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.

dot.c 5.6 kB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198
  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. #ifdef FUNCTION_PROFILE
  41. #include "functable.h"
  42. #endif
  43. #ifdef SMP
  44. static int dot_threads (BLASLONG m, BLASLONG n, BLASLONG k, float alpha,
  45. float* x, BLASLONG incx, float* y, BLASLONG incy, float* z, BLASLONG incz)
  46. {
  47. #ifndef CBLAS
  48. FLOATRET ret;
  49. ret = (FLOATRET)DOTU_K(m, x, incx, y, incy);
  50. *((double *)z) = (double)ret;
  51. #else
  52. FLOAT ret;
  53. ret = DOTU_K(n, x, incx, y, incy);
  54. *((double *)z) = (double)ret;
  55. #endif
  56. return 0;
  57. }
  58. #endif
  59. #ifndef CBLAS
  60. FLOATRET NAME(blasint *N, FLOAT *x, blasint *INCX, FLOAT *y, blasint *INCY){
  61. BLASLONG n = *N;
  62. BLASLONG incx = *INCX;
  63. BLASLONG incy = *INCY;
  64. FLOATRET ret;
  65. PRINT_DEBUG_NAME;
  66. #ifdef SMP
  67. int i;
  68. int mode, nthreads;
  69. double mid_result= 0.0;
  70. FLOAT dummyalpha[2] = {ZERO, ZERO};
  71. double *buffer = (double*)blas_memory_alloc(0);
  72. #endif
  73. if (n <= 0) return 0.;
  74. IDEBUG_START;
  75. FUNCTION_PROFILE_START();
  76. if (incx < 0) x -= (n - 1) * incx;
  77. if (incy < 0) y -= (n - 1) * incy;
  78. #ifdef SMP
  79. nthreads = num_cpu_avail(1);
  80. //Temporarily work-around the low performance issue with small imput size &
  81. //multithreads.
  82. if (n <= 100000)
  83. nthreads = 1;
  84. if (nthreads == 1) {
  85. #endif
  86. ret = (FLOATRET)DOTU_K(n, x, incx, y, incy);
  87. #ifdef SMP
  88. } else {
  89. #ifndef DOUBLE
  90. mode = BLAS_SINGLE | BLAS_REAL;
  91. #else
  92. mode = BLAS_DOUBLE | BLAS_REAL;
  93. #endif
  94. blas_level1_thread_with_return_value(mode, n, 0, 0, dummyalpha,
  95. x, incx, y, incy, buffer, 0, (void *)dot_threads, nthreads);
  96. for(i = 0; i < nthreads; i++)
  97. mid_result += buffer[2*i];
  98. ret = (FLOATRET)mid_result;
  99. }
  100. blas_memory_free(buffer);
  101. #endif
  102. FUNCTION_PROFILE_END(1, 2 * n, 2 * n);
  103. IDEBUG_END;
  104. return ret;
  105. }
  106. #else
  107. FLOAT CNAME(blasint n, FLOAT *x, blasint incx, FLOAT *y, blasint incy){
  108. FLOAT ret;
  109. PRINT_DEBUG_CNAME;
  110. #ifdef SMP
  111. int i;
  112. int mode, nthreads;
  113. double mid_result= 0.0;
  114. FLOAT dummyalpha[2] = {ZERO, ZERO};
  115. double *buffer = (double*)blas_memory_alloc(0);
  116. #endif
  117. if (n <= 0) return 0.;
  118. IDEBUG_START;
  119. FUNCTION_PROFILE_START();
  120. if (incx < 0) x -= (n - 1) * incx;
  121. if (incy < 0) y -= (n - 1) * incy;
  122. #ifdef SMP
  123. nthreads = num_cpu_avail(1);
  124. //Temporarily work-around the low performance issue with small imput size &
  125. //multithreads.
  126. if (n <= 100000)
  127. nthreads = 1;
  128. if (nthreads == 1) {
  129. #endif
  130. ret = DOTU_K(n, x, incx, y, incy);
  131. #ifdef SMP
  132. } else {
  133. #ifndef DOUBLE
  134. mode = BLAS_SINGLE | BLAS_REAL;
  135. #else
  136. mode = BLAS_DOUBLE | BLAS_REAL;
  137. #endif
  138. blas_level1_thread_with_return_value(mode, n, 0, 0, dummyalpha,
  139. x, incx, y, incy, buffer, 0, (void *)dot_threads, nthreads);
  140. for(i = 0; i < nthreads; i++)
  141. mid_result += buffer[2*i];
  142. ret = (FLOAT)mid_result;
  143. }
  144. blas_memory_free(buffer);
  145. #endif
  146. FUNCTION_PROFILE_END(1, 2 * n, 2 * n);
  147. IDEBUG_END;
  148. return ret;
  149. }
  150. #endif