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

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422
  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. static int (*symm[])(blas_arg_t *, BLASLONG *, BLASLONG *, FLOAT *, FLOAT *, BLASLONG) = {
  92. #ifndef GEMM3M
  93. #ifndef HEMM
  94. SYMM_LU, SYMM_LL, SYMM_RU, SYMM_RL,
  95. #if defined(SMP) && !defined(USE_SIMPLE_THREADED_LEVEL3)
  96. SYMM_THREAD_LU, SYMM_THREAD_LL, SYMM_THREAD_RU, SYMM_THREAD_RL,
  97. #endif
  98. #else
  99. HEMM_LU, HEMM_LL, HEMM_RU, HEMM_RL,
  100. #if defined(SMP) && !defined(USE_SIMPLE_THREADED_LEVEL3)
  101. HEMM_THREAD_LU, HEMM_THREAD_LL, HEMM_THREAD_RU, HEMM_THREAD_RL,
  102. #endif
  103. #endif
  104. #else
  105. #ifndef HEMM
  106. SYMM3M_LU, SYMM3M_LL, SYMM3M_RU, SYMM3M_RL,
  107. #if defined(SMP) && !defined(USE_SIMPLE_THREADED_LEVEL3)
  108. SYMM3M_THREAD_LU, SYMM3M_THREAD_LL, SYMM3M_THREAD_RU, SYMM3M_THREAD_RL,
  109. #endif
  110. #else
  111. HEMM3M_LU, HEMM3M_LL, HEMM3M_RU, HEMM3M_RL,
  112. #if defined(SMP) && !defined(USE_SIMPLE_THREADED_LEVEL3)
  113. HEMM3M_THREAD_LU, HEMM3M_THREAD_LL, HEMM3M_THREAD_RU, HEMM3M_THREAD_RL,
  114. #endif
  115. #endif
  116. #endif
  117. };
  118. #ifndef CBLAS
  119. void NAME(char *SIDE, char *UPLO,
  120. blasint *M, blasint *N,
  121. FLOAT *alpha, FLOAT *a, blasint *ldA,
  122. FLOAT *b, blasint *ldB,
  123. FLOAT *beta, FLOAT *c, blasint *ldC){
  124. char side_arg = *SIDE;
  125. char uplo_arg = *UPLO;
  126. blas_arg_t args;
  127. FLOAT *buffer;
  128. FLOAT *sa, *sb;
  129. #ifdef SMP
  130. #ifdef XDOUBLE
  131. int mode = BLAS_XDOUBLE | BLAS_REAL;
  132. #elif defined(DOUBLE)
  133. int mode = BLAS_DOUBLE | BLAS_REAL;
  134. #else
  135. int mode = BLAS_SINGLE | BLAS_REAL;
  136. #endif
  137. #endif
  138. #if defined(SMP) && !defined(NO_AFFINITY)
  139. int nodes;
  140. #endif
  141. blasint info;
  142. int side;
  143. int uplo;
  144. PRINT_DEBUG_NAME;
  145. args.alpha = (void *)alpha;
  146. args.beta = (void *)beta;
  147. TOUPPER(side_arg);
  148. TOUPPER(uplo_arg);
  149. side = -1;
  150. uplo = -1;
  151. if (side_arg == 'L') side = 0;
  152. if (side_arg == 'R') side = 1;
  153. if (uplo_arg == 'U') uplo = 0;
  154. if (uplo_arg == 'L') uplo = 1;
  155. args.m = *M;
  156. args.n = *N;
  157. args.c = (void *)c;
  158. args.ldc = *ldC;
  159. info = 0;
  160. if (args.ldc < MAX(1, args.m)) info = 12;
  161. if (!side) {
  162. args.a = (void *)a;
  163. args.b = (void *)b;
  164. args.lda = *ldA;
  165. args.ldb = *ldB;
  166. if (args.ldb < MAX(1, args.m)) info = 9;
  167. if (args.lda < MAX(1, args.m)) info = 7;
  168. } else {
  169. args.a = (void *)b;
  170. args.b = (void *)a;
  171. args.lda = *ldB;
  172. args.ldb = *ldA;
  173. if (args.lda < MAX(1, args.m)) info = 9;
  174. if (args.ldb < MAX(1, args.n)) info = 7;
  175. }
  176. if (args.n < 0) info = 4;
  177. if (args.m < 0) info = 3;
  178. if (uplo < 0) info = 2;
  179. if (side < 0) info = 1;
  180. if (info != 0) {
  181. BLASFUNC(xerbla)(ERROR_NAME, &info, sizeof(ERROR_NAME));
  182. return;
  183. }
  184. #else
  185. void CNAME(enum CBLAS_ORDER order, enum CBLAS_SIDE Side, enum CBLAS_UPLO Uplo,
  186. blasint m, blasint n,
  187. #ifndef COMPLEX
  188. FLOAT alpha,
  189. #else
  190. FLOAT *alpha,
  191. #endif
  192. FLOAT *a, blasint lda,
  193. FLOAT *b, blasint ldb,
  194. #ifndef COMPLEX
  195. FLOAT beta,
  196. #else
  197. FLOAT *beta,
  198. #endif
  199. FLOAT *c, blasint ldc) {
  200. blas_arg_t args;
  201. int side, uplo;
  202. blasint info;
  203. FLOAT *buffer;
  204. FLOAT *sa, *sb;
  205. #ifdef SMP
  206. #ifdef XDOUBLE
  207. int mode = BLAS_XDOUBLE | BLAS_REAL;
  208. #elif defined(DOUBLE)
  209. int mode = BLAS_DOUBLE | BLAS_REAL;
  210. #else
  211. int mode = BLAS_SINGLE | BLAS_REAL;
  212. #endif
  213. #endif
  214. #if defined(SMP) && !defined(NO_AFFINITY)
  215. int nodes;
  216. #endif
  217. PRINT_DEBUG_CNAME;
  218. #ifndef COMPLEX
  219. args.alpha = (void *)&alpha;
  220. args.beta = (void *)&beta;
  221. #else
  222. args.alpha = (void *)alpha;
  223. args.beta = (void *)beta;
  224. #endif
  225. args.c = (void *)c;
  226. args.ldc = ldc;
  227. side = -1;
  228. uplo = -1;
  229. info = 0;
  230. if (order == CblasColMajor) {
  231. if (Side == CblasLeft) side = 0;
  232. if (Side == CblasRight) side = 1;
  233. if (Uplo == CblasUpper) uplo = 0;
  234. if (Uplo == CblasLower) uplo = 1;
  235. info = -1;
  236. args.m = m;
  237. args.n = n;
  238. if (args.ldc < MAX(1, args.m)) info = 12;
  239. if (!side) {
  240. args.a = (void *)a;
  241. args.b = (void *)b;
  242. args.lda = lda;
  243. args.ldb = ldb;
  244. if (args.ldb < MAX(1, args.m)) info = 9;
  245. if (args.lda < MAX(1, args.m)) info = 7;
  246. } else {
  247. args.a = (void *)b;
  248. args.b = (void *)a;
  249. args.lda = ldb;
  250. args.ldb = lda;
  251. if (args.lda < MAX(1, args.m)) info = 9;
  252. if (args.ldb < MAX(1, args.n)) info = 7;
  253. }
  254. if (args.n < 0) info = 4;
  255. if (args.m < 0) info = 3;
  256. if (uplo < 0) info = 2;
  257. if (side < 0) info = 1;
  258. }
  259. if (order == CblasRowMajor) {
  260. if (Side == CblasLeft) side = 1;
  261. if (Side == CblasRight) side = 0;
  262. if (Uplo == CblasUpper) uplo = 1;
  263. if (Uplo == CblasLower) uplo = 0;
  264. info = -1;
  265. args.m = n;
  266. args.n = m;
  267. if (args.ldc < MAX(1, args.m)) info = 12;
  268. if (!side) {
  269. args.a = (void *)a;
  270. args.b = (void *)b;
  271. args.lda = lda;
  272. args.ldb = ldb;
  273. if (args.ldb < MAX(1, args.m)) info = 9;
  274. if (args.lda < MAX(1, args.m)) info = 7;
  275. } else {
  276. args.a = (void *)b;
  277. args.b = (void *)a;
  278. args.lda = ldb;
  279. args.ldb = lda;
  280. if (args.lda < MAX(1, args.m)) info = 9;
  281. if (args.ldb < MAX(1, args.n)) info = 7;
  282. }
  283. if (args.n < 0) info = 4;
  284. if (args.m < 0) info = 3;
  285. if (uplo < 0) info = 2;
  286. if (side < 0) info = 1;
  287. }
  288. if (info >= 0) {
  289. BLASFUNC(xerbla)(ERROR_NAME, &info, sizeof(ERROR_NAME));
  290. return;
  291. }
  292. #endif
  293. if (args.m == 0 || args.n == 0) return;
  294. IDEBUG_START;
  295. FUNCTION_PROFILE_START();
  296. buffer = (FLOAT *)blas_memory_alloc(0);
  297. sa = (FLOAT *)((BLASLONG)buffer + GEMM_OFFSET_A);
  298. sb = (FLOAT *)(((BLASLONG)sa + ((GEMM_P * GEMM_Q * COMPSIZE * SIZE + GEMM_ALIGN) & ~GEMM_ALIGN)) + GEMM_OFFSET_B);
  299. #ifdef SMP
  300. args.common = NULL;
  301. args.nthreads = num_cpu_avail(3);
  302. if (args.nthreads == 1) {
  303. #endif
  304. (symm[(side << 1) | uplo ])(&args, NULL, NULL, sa, sb, 0);
  305. #ifdef SMP
  306. } else {
  307. #ifndef NO_AFFINITY
  308. nodes = get_num_nodes();
  309. if (nodes > 1) {
  310. args.nthreads /= nodes;
  311. gemm_thread_mn(mode, &args, NULL, NULL,
  312. symm[4 | (side << 1) | uplo ], sa, sb, nodes);
  313. } else {
  314. #endif
  315. #ifndef USE_SIMPLE_THREADED_LEVEL3
  316. (symm[4 | (side << 1) | uplo ])(&args, NULL, NULL, sa, sb, 0);
  317. #else
  318. GEMM_THREAD(mode, &args, NULL, NULL, symm[(side << 1) | uplo ], sa, sb, args.nthreads);
  319. #endif
  320. #ifndef NO_AFFINITY
  321. }
  322. #endif
  323. }
  324. #endif
  325. blas_memory_free(buffer);
  326. FUNCTION_PROFILE_END(COMPSIZE * COMPSIZE,
  327. (!side)? args.m * (args.m / 2 + args.n) : args.n * (args.m + args.n / 2),
  328. (!side)? 2 * args.m * args.m * args.n : 2 * args.m * args.n * args.n);
  329. IDEBUG_END;
  330. return;
  331. }

OpenBLAS is an optimized BLAS library based on GotoBLAS2 1.13 BSD version.