You can not select more than 25 topics Topics must start with a chinese character,a letter or number, can include dashes ('-') and can be up to 35 characters long.

symm.c 10 kB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423
  1. /*********************************************************************/
  2. /* Copyright 2009, 2010 The University of Texas at Austin. */
  3. /* All rights reserved. */
  4. /* */
  5. /* Redistribution and use in source and binary forms, with or */
  6. /* without modification, are permitted provided that the following */
  7. /* conditions are met: */
  8. /* */
  9. /* 1. Redistributions of source code must retain the above */
  10. /* copyright notice, this list of conditions and the following */
  11. /* disclaimer. */
  12. /* */
  13. /* 2. Redistributions in binary form must reproduce the above */
  14. /* copyright notice, this list of conditions and the following */
  15. /* disclaimer in the documentation and/or other materials */
  16. /* provided with the distribution. */
  17. /* */
  18. /* THIS SOFTWARE IS PROVIDED BY THE UNIVERSITY OF TEXAS AT */
  19. /* AUSTIN ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, */
  20. /* INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF */
  21. /* MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE */
  22. /* DISCLAIMED. IN NO EVENT SHALL THE UNIVERSITY OF TEXAS AT */
  23. /* AUSTIN OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, */
  24. /* INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES */
  25. /* (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE */
  26. /* GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR */
  27. /* BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF */
  28. /* LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT */
  29. /* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT */
  30. /* OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE */
  31. /* POSSIBILITY OF SUCH DAMAGE. */
  32. /* */
  33. /* The views and conclusions contained in the software and */
  34. /* documentation are those of the authors and should not be */
  35. /* interpreted as representing official policies, either expressed */
  36. /* or implied, of The University of Texas at Austin. */
  37. /*********************************************************************/
  38. #include <stdio.h>
  39. #include <ctype.h>
  40. #include "common.h"
  41. #ifdef FUNCTION_PROFILE
  42. #include "functable.h"
  43. #endif
  44. #ifndef COMPLEX
  45. #ifdef XDOUBLE
  46. #define ERROR_NAME "QSYMM "
  47. #elif defined(DOUBLE)
  48. #define ERROR_NAME "DSYMM "
  49. #else
  50. #define ERROR_NAME "SSYMM "
  51. #endif
  52. #else
  53. #ifndef GEMM3M
  54. #ifndef HEMM
  55. #ifdef XDOUBLE
  56. #define ERROR_NAME "XSYMM "
  57. #elif defined(DOUBLE)
  58. #define ERROR_NAME "ZSYMM "
  59. #else
  60. #define ERROR_NAME "CSYMM "
  61. #endif
  62. #else
  63. #ifdef XDOUBLE
  64. #define ERROR_NAME "XHEMM "
  65. #elif defined(DOUBLE)
  66. #define ERROR_NAME "ZHEMM "
  67. #else
  68. #define ERROR_NAME "CHEMM "
  69. #endif
  70. #endif
  71. #else
  72. #ifndef HEMM
  73. #ifdef XDOUBLE
  74. #define ERROR_NAME "XSYMM3M "
  75. #elif defined(DOUBLE)
  76. #define ERROR_NAME "ZSYMM3M "
  77. #else
  78. #define ERROR_NAME "CSYMM3M "
  79. #endif
  80. #else
  81. #ifdef XDOUBLE
  82. #define ERROR_NAME "XHEMM3M "
  83. #elif defined(DOUBLE)
  84. #define ERROR_NAME "ZHEMM3M "
  85. #else
  86. #define ERROR_NAME "CHEMM3M "
  87. #endif
  88. #endif
  89. #endif
  90. #endif
  91. #ifdef SMP
  92. #ifndef COMPLEX
  93. #ifdef XDOUBLE
  94. #define MODE (BLAS_XDOUBLE | BLAS_REAL)
  95. #elif defined(DOUBLE)
  96. #define MODE (BLAS_DOUBLE | BLAS_REAL)
  97. #else
  98. #define MODE (BLAS_SINGLE | BLAS_REAL)
  99. #endif
  100. #else
  101. #ifdef XDOUBLE
  102. #define MODE (BLAS_XDOUBLE | BLAS_COMPLEX)
  103. #elif defined(DOUBLE)
  104. #define MODE (BLAS_DOUBLE | BLAS_COMPLEX)
  105. #else
  106. #define MODE (BLAS_SINGLE | BLAS_COMPLEX)
  107. #endif
  108. #endif
  109. #endif
  110. static int (*symm[])(blas_arg_t *, BLASLONG *, BLASLONG *, FLOAT *, FLOAT *, BLASLONG) = {
  111. #ifndef GEMM3M
  112. #ifndef HEMM
  113. SYMM_LU, SYMM_LL, SYMM_RU, SYMM_RL,
  114. #if defined(SMP) && !defined(USE_SIMPLE_THREADED_LEVEL3)
  115. SYMM_THREAD_LU, SYMM_THREAD_LL, SYMM_THREAD_RU, SYMM_THREAD_RL,
  116. #endif
  117. #else
  118. HEMM_LU, HEMM_LL, HEMM_RU, HEMM_RL,
  119. #if defined(SMP) && !defined(USE_SIMPLE_THREADED_LEVEL3)
  120. HEMM_THREAD_LU, HEMM_THREAD_LL, HEMM_THREAD_RU, HEMM_THREAD_RL,
  121. #endif
  122. #endif
  123. #else
  124. #ifndef HEMM
  125. SYMM3M_LU, SYMM3M_LL, SYMM3M_RU, SYMM3M_RL,
  126. #if defined(SMP) && !defined(USE_SIMPLE_THREADED_LEVEL3)
  127. SYMM3M_THREAD_LU, SYMM3M_THREAD_LL, SYMM3M_THREAD_RU, SYMM3M_THREAD_RL,
  128. #endif
  129. #else
  130. HEMM3M_LU, HEMM3M_LL, HEMM3M_RU, HEMM3M_RL,
  131. #if defined(SMP) && !defined(USE_SIMPLE_THREADED_LEVEL3)
  132. HEMM3M_THREAD_LU, HEMM3M_THREAD_LL, HEMM3M_THREAD_RU, HEMM3M_THREAD_RL,
  133. #endif
  134. #endif
  135. #endif
  136. };
  137. #ifndef CBLAS
  138. void NAME(char *SIDE, char *UPLO,
  139. blasint *M, blasint *N,
  140. FLOAT *alpha, FLOAT *a, blasint *ldA,
  141. FLOAT *b, blasint *ldB,
  142. FLOAT *beta, FLOAT *c, blasint *ldC){
  143. char side_arg = *SIDE;
  144. char uplo_arg = *UPLO;
  145. blas_arg_t args;
  146. FLOAT *buffer;
  147. FLOAT *sa, *sb;
  148. #if defined(SMP) && !defined(NO_AFFINITY)
  149. int nodes;
  150. #endif
  151. blasint info;
  152. int side;
  153. int uplo;
  154. PRINT_DEBUG_NAME;
  155. args.alpha = (void *)alpha;
  156. args.beta = (void *)beta;
  157. TOUPPER(side_arg);
  158. TOUPPER(uplo_arg);
  159. side = -1;
  160. uplo = -1;
  161. if (side_arg == 'L') side = 0;
  162. if (side_arg == 'R') side = 1;
  163. if (uplo_arg == 'U') uplo = 0;
  164. if (uplo_arg == 'L') uplo = 1;
  165. args.m = *M;
  166. args.n = *N;
  167. args.c = (void *)c;
  168. args.ldc = *ldC;
  169. info = 0;
  170. if (args.ldc < MAX(1, args.m)) info = 12;
  171. if (!side) {
  172. args.a = (void *)a;
  173. args.b = (void *)b;
  174. args.lda = *ldA;
  175. args.ldb = *ldB;
  176. if (args.ldb < MAX(1, args.m)) info = 9;
  177. if (args.lda < MAX(1, args.m)) info = 7;
  178. } else {
  179. args.a = (void *)b;
  180. args.b = (void *)a;
  181. args.lda = *ldB;
  182. args.ldb = *ldA;
  183. if (args.lda < MAX(1, args.m)) info = 9;
  184. if (args.ldb < MAX(1, args.n)) info = 7;
  185. }
  186. if (args.n < 0) info = 4;
  187. if (args.m < 0) info = 3;
  188. if (uplo < 0) info = 2;
  189. if (side < 0) info = 1;
  190. if (info != 0) {
  191. BLASFUNC(xerbla)(ERROR_NAME, &info, sizeof(ERROR_NAME));
  192. return;
  193. }
  194. #else
  195. void CNAME(enum CBLAS_ORDER order, enum CBLAS_SIDE Side, enum CBLAS_UPLO Uplo,
  196. blasint m, blasint n,
  197. #ifndef COMPLEX
  198. FLOAT alpha,
  199. #else
  200. FLOAT *alpha,
  201. #endif
  202. FLOAT *a, blasint lda,
  203. FLOAT *b, blasint ldb,
  204. #ifndef COMPLEX
  205. FLOAT beta,
  206. #else
  207. FLOAT *beta,
  208. #endif
  209. FLOAT *c, blasint ldc) {
  210. blas_arg_t args;
  211. int side, uplo;
  212. blasint info;
  213. FLOAT *buffer;
  214. FLOAT *sa, *sb;
  215. #if defined(SMP) && !defined(NO_AFFINITY)
  216. int nodes;
  217. #endif
  218. PRINT_DEBUG_CNAME;
  219. #ifndef COMPLEX
  220. args.alpha = (void *)&alpha;
  221. args.beta = (void *)&beta;
  222. #else
  223. args.alpha = (void *)alpha;
  224. args.beta = (void *)beta;
  225. #endif
  226. args.c = (void *)c;
  227. args.ldc = ldc;
  228. side = -1;
  229. uplo = -1;
  230. info = 0;
  231. if (order == CblasColMajor) {
  232. if (Side == CblasLeft) side = 0;
  233. if (Side == CblasRight) side = 1;
  234. if (Uplo == CblasUpper) uplo = 0;
  235. if (Uplo == CblasLower) uplo = 1;
  236. info = -1;
  237. args.m = m;
  238. args.n = n;
  239. if (args.ldc < MAX(1, args.m)) info = 12;
  240. if (!side) {
  241. args.a = (void *)a;
  242. args.b = (void *)b;
  243. args.lda = lda;
  244. args.ldb = ldb;
  245. if (args.ldb < MAX(1, args.m)) info = 9;
  246. if (args.lda < MAX(1, args.m)) info = 7;
  247. } else {
  248. args.a = (void *)b;
  249. args.b = (void *)a;
  250. args.lda = ldb;
  251. args.ldb = lda;
  252. if (args.lda < MAX(1, args.m)) info = 9;
  253. if (args.ldb < MAX(1, args.n)) info = 7;
  254. }
  255. if (args.n < 0) info = 4;
  256. if (args.m < 0) info = 3;
  257. if (uplo < 0) info = 2;
  258. if (side < 0) info = 1;
  259. }
  260. if (order == CblasRowMajor) {
  261. if (Side == CblasLeft) side = 1;
  262. if (Side == CblasRight) side = 0;
  263. if (Uplo == CblasUpper) uplo = 1;
  264. if (Uplo == CblasLower) uplo = 0;
  265. info = -1;
  266. args.m = n;
  267. args.n = m;
  268. if (args.ldc < MAX(1, args.m)) info = 12;
  269. if (!side) {
  270. args.a = (void *)a;
  271. args.b = (void *)b;
  272. args.lda = lda;
  273. args.ldb = ldb;
  274. if (args.ldb < MAX(1, args.m)) info = 9;
  275. if (args.lda < MAX(1, args.m)) info = 7;
  276. } else {
  277. args.a = (void *)b;
  278. args.b = (void *)a;
  279. args.lda = ldb;
  280. args.ldb = lda;
  281. if (args.lda < MAX(1, args.m)) info = 9;
  282. if (args.ldb < MAX(1, args.n)) info = 7;
  283. }
  284. if (args.n < 0) info = 4;
  285. if (args.m < 0) info = 3;
  286. if (uplo < 0) info = 2;
  287. if (side < 0) info = 1;
  288. }
  289. if (info >= 0) {
  290. BLASFUNC(xerbla)(ERROR_NAME, &info, sizeof(ERROR_NAME));
  291. return;
  292. }
  293. #endif
  294. if (args.m == 0 || args.n == 0) return;
  295. IDEBUG_START;
  296. FUNCTION_PROFILE_START();
  297. buffer = (FLOAT *)blas_memory_alloc(0);
  298. sa = (FLOAT *)((BLASLONG)buffer + GEMM_OFFSET_A);
  299. sb = (FLOAT *)(((BLASLONG)sa + ((GEMM_P * GEMM_Q * COMPSIZE * SIZE + GEMM_ALIGN) & ~GEMM_ALIGN)) + GEMM_OFFSET_B);
  300. #ifdef SMP
  301. args.common = NULL;
  302. args.nthreads = num_cpu_avail(3);
  303. if (args.nthreads == 1) {
  304. #endif
  305. (symm[(side << 1) | uplo ])(&args, NULL, NULL, sa, sb, 0);
  306. #ifdef SMP
  307. } else {
  308. #ifndef NO_AFFINITY
  309. nodes = get_num_nodes();
  310. if (nodes > 1) {
  311. args.nthreads /= nodes;
  312. gemm_thread_mn(MODE, &args, NULL, NULL,
  313. symm[4 | (side << 1) | uplo ], sa, sb, nodes);
  314. } else {
  315. #endif
  316. #ifndef USE_SIMPLE_THREADED_LEVEL3
  317. (symm[4 | (side << 1) | uplo ])(&args, NULL, NULL, sa, sb, 0);
  318. #else
  319. GEMM_THREAD(MODE, &args, NULL, NULL, symm[(side << 1) | uplo ], sa, sb, args.nthreads);
  320. #endif
  321. #ifndef NO_AFFINITY
  322. }
  323. #endif
  324. }
  325. #endif
  326. blas_memory_free(buffer);
  327. FUNCTION_PROFILE_END(COMPSIZE * COMPSIZE,
  328. (!side)? args.m * (args.m / 2 + args.n) : args.n * (args.m + args.n / 2),
  329. (!side)? 2 * args.m * args.m * args.n : 2 * args.m * args.n * args.n);
  330. IDEBUG_END;
  331. return;
  332. }