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.

lauum_L_parallel.c 4.7 kB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123
  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 "common.h"
  40. blasint CNAME(blas_arg_t *args, BLASLONG *range_m, BLASLONG *range_n, FLOAT *sa, FLOAT *sb, BLASLONG myid) {
  41. BLASLONG n, bk, i, blocking, lda;
  42. int mode;
  43. blas_arg_t newarg;
  44. FLOAT *a;
  45. FLOAT alpha[2] = { ONE, ZERO};
  46. #ifndef COMPLEX
  47. #ifdef XDOUBLE
  48. mode = BLAS_XDOUBLE | BLAS_REAL;
  49. #elif defined(DOUBLE)
  50. mode = BLAS_DOUBLE | BLAS_REAL;
  51. #else
  52. mode = BLAS_SINGLE | BLAS_REAL;
  53. #endif
  54. #else
  55. #ifdef XDOUBLE
  56. mode = BLAS_XDOUBLE | BLAS_COMPLEX;
  57. #elif defined(DOUBLE)
  58. mode = BLAS_DOUBLE | BLAS_COMPLEX;
  59. #else
  60. mode = BLAS_SINGLE | BLAS_COMPLEX;
  61. #endif
  62. #endif
  63. if (args -> nthreads == 1) {
  64. LAUUM_L_SINGLE(args, NULL, NULL, sa, sb, 0);
  65. return 0;
  66. }
  67. n = args -> n;
  68. a = (FLOAT *)args -> a;
  69. lda = args -> lda;
  70. if (range_n) n = range_n[1] - range_n[0];
  71. if (n <= GEMM_UNROLL_N * 2) {
  72. LAUUM_L_SINGLE(args, NULL, range_n, sa, sb, 0);
  73. return 0;
  74. }
  75. newarg.lda = lda;
  76. newarg.ldb = lda;
  77. newarg.ldc = lda;
  78. newarg.alpha = alpha;
  79. newarg.beta = NULL;
  80. newarg.nthreads = args -> nthreads;
  81. blocking = ((n / 2 + GEMM_UNROLL_N - 1)/GEMM_UNROLL_N) * GEMM_UNROLL_N;
  82. if (blocking > GEMM_Q) blocking = GEMM_Q;
  83. for (i = 0; i < n; i += blocking) {
  84. bk = n - i;
  85. if (bk > blocking) bk = blocking;
  86. newarg.n = i;
  87. newarg.k = bk;
  88. newarg.a = a + i * COMPSIZE;
  89. newarg.c = a;
  90. syrk_thread(mode | BLAS_TRANSA_T | BLAS_TRANSB_N | BLAS_UPLO,
  91. &newarg, NULL, NULL, (int (*)(blas_arg_t *, BLASLONG *, BLASLONG *, FLOAT *, FLOAT *, BLASLONG))HERK_LC, sa, sb, args -> nthreads);
  92. newarg.m = bk;
  93. newarg.n = i;
  94. newarg.a = a + (i + i * lda) * COMPSIZE;
  95. newarg.b = a + (i ) * COMPSIZE;
  96. gemm_thread_n(mode | BLAS_TRANSA_T,
  97. &newarg, NULL, NULL, (int (*)(blas_arg_t*, BLASLONG*, BLASLONG*,FLOAT*, FLOAT*, BLASLONG))TRMM_LCLN, sa, sb, args -> nthreads);
  98. newarg.m = bk;
  99. newarg.n = bk;
  100. newarg.a = a + (i + i * lda) * COMPSIZE;
  101. CNAME(&newarg, NULL, NULL, sa, sb, 0);
  102. }
  103. return 0;
  104. }