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.

gemm_batch_thread.c 5.8 kB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156
  1. /*****************************************************************************
  2. Copyright (c) 2020, The OpenBLAS Project
  3. All rights reserved.
  4. Redistribution and use in source and binary forms, with or without
  5. modification, are permitted provided that the following conditions are
  6. met:
  7. 1. Redistributions of source code must retain the above copyright
  8. notice, this list of conditions and the following disclaimer.
  9. 2. Redistributions in binary form must reproduce the above copyright
  10. notice, this list of conditions and the following disclaimer in
  11. the documentation and/or other materials provided with the
  12. distribution.
  13. 3. Neither the name of the OpenBLAS project nor the names of
  14. its contributors may be used to endorse or promote products
  15. derived from this software without specific prior written
  16. permission.
  17. THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
  18. AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  19. IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
  20. ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
  21. LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
  22. DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
  23. SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
  24. CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
  25. OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE
  26. USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
  27. **********************************************************************************/
  28. #include "common.h"
  29. void openblas_warning(int verbose, const char * msg);
  30. #ifdef SMALL_MATRIX_OPT
  31. static int inner_small_matrix_thread(blas_arg_t *args, BLASLONG *range_m, BLASLONG *range_n, IFLOAT *sa, IFLOAT *sb, BLASLONG mypos){
  32. int routine_mode;
  33. #ifndef COMPLEX
  34. int (*gemm_small_kernel)(BLASLONG, BLASLONG, BLASLONG, FLOAT *, BLASLONG, FLOAT ,FLOAT *, BLASLONG, FLOAT, FLOAT *, BLASLONG);
  35. int (*gemm_small_kernel_b0)(BLASLONG, BLASLONG, BLASLONG, FLOAT *, BLASLONG, FLOAT, FLOAT *, BLASLONG, FLOAT *, BLASLONG);
  36. #else
  37. int (*zgemm_small_kernel)(BLASLONG, BLASLONG, BLASLONG, FLOAT *, BLASLONG, FLOAT , FLOAT, FLOAT *, BLASLONG, FLOAT , FLOAT, FLOAT *, BLASLONG);
  38. int (*zgemm_small_kernel_b0)(BLASLONG, BLASLONG, BLASLONG, FLOAT *, BLASLONG, FLOAT , FLOAT, FLOAT *, BLASLONG, FLOAT *, BLASLONG);
  39. FLOAT alpha[2], beta[2];
  40. #endif
  41. routine_mode=args->routine_mode;
  42. if((routine_mode & BLAS_SMALL_B0_OPT) == BLAS_SMALL_B0_OPT){
  43. #ifndef COMPLEX
  44. gemm_small_kernel_b0=args->routine;
  45. gemm_small_kernel_b0(args->m, args->n, args->k, args->a, args->lda, *(FLOAT *)(args->alpha), args->b, args->ldb, args->c, args->ldc);
  46. #else
  47. zgemm_small_kernel_b0=args->routine;
  48. alpha[0] = *((FLOAT *)args -> alpha + 0);
  49. alpha[1] = *((FLOAT *)args -> alpha + 1);
  50. zgemm_small_kernel_b0(args->m, args->n, args->k, args->a, args->lda, alpha[0], alpha[1], args->b, args->ldb, args->c, args->ldc);
  51. #endif
  52. return(0);
  53. }else if(routine_mode & BLAS_SMALL_OPT){
  54. #ifndef COMPLEX
  55. gemm_small_kernel=args->routine;
  56. gemm_small_kernel(args->m, args->n, args->k, args->a, args->lda, *(FLOAT *)(args->alpha), args->b, args->ldb, *(FLOAT *)(args->beta), args->c, args->ldc);
  57. #else
  58. zgemm_small_kernel=args->routine;
  59. alpha[0] = *((FLOAT *)args -> alpha + 0);
  60. alpha[1] = *((FLOAT *)args -> alpha + 1);
  61. beta[0] = *((FLOAT *)args -> beta + 0);
  62. beta[1] = *((FLOAT *)args -> beta + 1);
  63. zgemm_small_kernel(args->m, args->n, args->k, args->a, args->lda, alpha[0], alpha[1], args->b, args->ldb, beta[0], beta[1], args->c, args->ldc);
  64. #endif
  65. return(0);
  66. }
  67. return(1);
  68. }
  69. #endif
  70. int CNAME(blas_arg_t * args_array, BLASLONG nums){
  71. XFLOAT *buffer;
  72. XFLOAT *sa, *sb;
  73. int nthreads=1;
  74. int (*routine)(blas_arg_t *, void *, void *, XFLOAT *, XFLOAT *, BLASLONG);
  75. int i=0, /*j,*/ current_nums;
  76. #ifdef SMP
  77. blas_queue_t * queue=NULL;
  78. #endif
  79. if(nums <=0 ) return 0;
  80. buffer = (XFLOAT *)blas_memory_alloc(0);
  81. sa = (XFLOAT *)((BLASLONG)buffer +GEMM_OFFSET_A);
  82. sb = (XFLOAT *)(((BLASLONG)sa + ((GEMM_P * GEMM_Q * COMPSIZE * SIZE + GEMM_ALIGN) & ~GEMM_ALIGN)) + GEMM_OFFSET_B);
  83. #ifdef SMP
  84. nthreads=num_cpu_avail(3);
  85. if(nthreads==1){
  86. #endif
  87. //single thread
  88. for(i=0; i<nums; i++){
  89. routine=args_array[i].routine;
  90. #ifdef SMALL_MATRIX_OPT
  91. if(args_array[i].routine_mode & BLAS_SMALL_OPT){
  92. inner_small_matrix_thread(&args_array[i], NULL, NULL, NULL, NULL, 0);
  93. }else{
  94. #endif
  95. routine(&args_array[i], NULL, NULL, sa, sb, 0);
  96. #ifdef SMALL_MATRIX_OPT
  97. }
  98. #endif
  99. }
  100. #ifdef SMP
  101. } else {
  102. //multi thread
  103. queue=(blas_queue_t *)malloc((nums+1) * sizeof(blas_queue_t));
  104. if(queue == NULL){
  105. openblas_warning(0, "memory alloc failed!\n");
  106. return(1);
  107. }
  108. for(i=0; i<nums; i++){
  109. queue[i].args=&args_array[i];
  110. queue[i].range_m=NULL;
  111. queue[i].range_n=NULL;
  112. queue[i].sa=NULL;
  113. queue[i].sb=NULL;
  114. queue[i].next=&queue[i+1];
  115. queue[i].mode=args_array[i].routine_mode;
  116. queue[i].routine=args_array[i].routine;
  117. #ifdef SMALL_MATRIX_OPT
  118. if((args_array[i].routine_mode & BLAS_SMALL_B0_OPT) || (args_array[i].routine_mode & BLAS_SMALL_OPT)){
  119. queue[i].routine=inner_small_matrix_thread;
  120. }
  121. #endif
  122. }
  123. for(i=0; i<nums; i+=nthreads){
  124. current_nums=((nums-i)>nthreads)? nthreads: (nums-i);
  125. queue[i].sa=sa;
  126. queue[i].sb=sb;
  127. queue[i+current_nums-1].next=NULL;
  128. exec_blas(current_nums, &queue[i]);
  129. }
  130. free(queue);
  131. }
  132. #endif
  133. blas_memory_free(buffer);
  134. return 0;
  135. }