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.

zaxpy.c 4.9 kB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145
  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. #if defined(Z13)
  44. #define MULTI_THREAD_MINIMAL 200000
  45. #else
  46. #define MULTI_THREAD_MINIMAL 10000
  47. #endif
  48. #ifndef CBLAS
  49. void NAME(blasint *N, FLOAT *ALPHA, FLOAT *x, blasint *INCX, FLOAT *y, blasint *INCY){
  50. blasint n = *N;
  51. blasint incx = *INCX;
  52. blasint incy = *INCY;
  53. #else
  54. #ifdef COMPLEX
  55. void CNAME(blasint n, void *VALPHA, void *vx, blasint incx, void *vy, blasint incy){
  56. FLOAT *ALPHA = (FLOAT*) VALPHA;
  57. FLOAT *x = (FLOAT*) vx;
  58. FLOAT *y = (FLOAT*) vy;
  59. #else
  60. void CNAME(blasint n, FLOAT *ALPHA, FLOAT *x, blasint incx, FLOAT *y, blasint incy){
  61. #endif
  62. #endif
  63. FLOAT alpha_r = *(ALPHA + 0);
  64. FLOAT alpha_i = *(ALPHA + 1);
  65. #ifdef SMP
  66. int mode, nthreads;
  67. #endif
  68. #ifndef CBLAS
  69. PRINT_DEBUG_NAME;
  70. #else
  71. PRINT_DEBUG_CNAME;
  72. #endif
  73. if (n <= 0) return;
  74. if ((alpha_r == ZERO) && (alpha_i == ZERO)) return;
  75. if (incx == 0 && incy == 0) {
  76. *y += n * (alpha_r * (*x) - alpha_i* (*(x+1)) );
  77. *(y+1) += n * (alpha_i * (*x) + alpha_r * (*(x +1)) );
  78. return;
  79. }
  80. IDEBUG_START;
  81. FUNCTION_PROFILE_START();
  82. if (incx < 0) x -= (n - 1) * incx * 2;
  83. if (incy < 0) y -= (n - 1) * incy * 2;
  84. #ifdef SMP
  85. //disable multi-thread when incx==0 or incy==0
  86. //In that case, the threads would be dependent.
  87. //
  88. //Temporarily work-around the low performance issue with small input size &
  89. //multithreads.
  90. if (incx == 0 || incy == 0 || n <= MULTI_THREAD_MINIMAL)
  91. nthreads = 1;
  92. else
  93. nthreads = num_cpu_avail(1);
  94. if (nthreads == 1) {
  95. #endif
  96. #ifndef CONJ
  97. AXPYU_K (n, 0, 0, alpha_r, alpha_i, x, incx, y, incy, NULL, 0);
  98. #else
  99. AXPYC_K(n, 0, 0, alpha_r, alpha_i, x, incx, y, incy, NULL, 0);
  100. #endif
  101. #ifdef SMP
  102. } else {
  103. #ifdef XDOUBLE
  104. mode = BLAS_XDOUBLE | BLAS_COMPLEX;
  105. #elif defined(DOUBLE)
  106. mode = BLAS_DOUBLE | BLAS_COMPLEX;
  107. #else
  108. mode = BLAS_SINGLE | BLAS_COMPLEX;
  109. #endif
  110. blas_level1_thread(mode, n, 0, 0, ALPHA, x, incx, y, incy, NULL, 0,
  111. #ifndef CONJ
  112. (int (*)(void))AXPYU_K,
  113. #else
  114. (int (*)(void))AXPYC_K,
  115. #endif
  116. nthreads);
  117. }
  118. #endif
  119. FUNCTION_PROFILE_END(4, 2 * n, 2 * n);
  120. IDEBUG_END;
  121. return;
  122. }