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_thread_m.c 3.8 kB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990
  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 <stdlib.h>
  40. #include "common.h"
  41. int CNAME(int mode, blas_arg_t *arg, BLASLONG *range_m, BLASLONG *range_n, int (*function)(), void *sa, void *sb, BLASLONG nthreads) {
  42. blas_queue_t queue[MAX_CPU_NUMBER];
  43. BLASLONG range[MAX_CPU_NUMBER + 1];
  44. BLASLONG width, i, num_cpu;
  45. if (!range_m) {
  46. range[0] = 0;
  47. i = arg -> m;
  48. } else {
  49. range[0] = range_m[0];
  50. i = range_m[1] - range_m[0];
  51. }
  52. num_cpu = 0;
  53. while (i > 0){
  54. width = blas_quickdivide(i + nthreads - num_cpu - 1, nthreads - num_cpu);
  55. i -= width;
  56. if (i < 0) width = width + i;
  57. range[num_cpu + 1] = range[num_cpu] + width;
  58. queue[num_cpu].mode = mode;
  59. queue[num_cpu].routine = function;
  60. queue[num_cpu].args = arg;
  61. queue[num_cpu].range_m = &range[num_cpu];
  62. queue[num_cpu].range_n = range_n;
  63. queue[num_cpu].sa = NULL;
  64. queue[num_cpu].sb = NULL;
  65. queue[num_cpu].next = &queue[num_cpu + 1];
  66. num_cpu ++;
  67. }
  68. if (num_cpu) {
  69. queue[0].sa = sa;
  70. queue[0].sb = sb;
  71. queue[num_cpu - 1].next = NULL;
  72. exec_blas(num_cpu, queue);
  73. }
  74. return 0;
  75. }