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.

nrm2.c 5.4 kB

7 months ago
7 months ago
7 months ago
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197
  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. #ifndef CBLAS
  44. FLOATRET NAME(blasint *N, FLOAT *x, blasint *INCX){
  45. BLASLONG n = *N;
  46. BLASLONG incx = *INCX;
  47. FLOATRET ret;
  48. PRINT_DEBUG_NAME;
  49. if (n <= 0) return 0.;
  50. #ifndef COMPLEX
  51. if (n == 1)
  52. #ifdef DOUBLE
  53. return fabs(x[0]);
  54. #else
  55. return fabsf(x[0]);
  56. #endif
  57. #endif
  58. if (incx == 0)
  59. #ifndef COMPLEX
  60. #ifdef DOUBLE
  61. return (sqrt((double)n)*fabs(x[0]));
  62. #else
  63. return (sqrt((float)n)*fabsf(x[0]));
  64. #endif
  65. #else
  66. #ifdef DOUBLE
  67. {
  68. double fr=fabs(x[0]);
  69. double fi=fabs(x[1]);
  70. double fmin=MIN(fr,fi);
  71. double fmax=MAX(fr,fi);
  72. if (fmax==0.) return(fmax);
  73. if (fmax==fmin) return(sqrt((double)n)*sqrt(2.)*fmax);
  74. return (sqrt((double)n) * fmax * sqrt (1. + (fmin/fmax)*(fmin/fmax)));
  75. }
  76. #else
  77. {
  78. float fr=fabs(x[0]);
  79. float fi=fabs(x[1]);
  80. float fmin=MIN(fr,fi);
  81. float fmax=MAX(fr,fi);
  82. if (fmax==0.) return(fmax);
  83. if (fmax==fmin) return(sqrt((float)n)*sqrt(2.)*fmax);
  84. return (sqrt((float)n) * fmax * sqrt (1. + (fmin/fmax)*(fmin/fmax)));
  85. }
  86. #endif
  87. #endif
  88. if (incx < 0)
  89. #ifdef COMPLEX
  90. x -= (n - 1) * incx * 2;
  91. #else
  92. x -= (n - 1) * incx;
  93. #endif
  94. IDEBUG_START;
  95. FUNCTION_PROFILE_START();
  96. ret = (FLOATRET)NRM2_K(n, x, incx);
  97. FUNCTION_PROFILE_END(COMPSIZE, n, 2 * n);
  98. IDEBUG_END;
  99. return ret;
  100. }
  101. #else
  102. #ifdef COMPLEX
  103. FLOAT CNAME(blasint n, void *vx, blasint incx){
  104. FLOAT *x = (FLOAT*) vx;
  105. #else
  106. FLOAT CNAME(blasint n, FLOAT *x, blasint incx){
  107. #endif
  108. FLOAT ret;
  109. PRINT_DEBUG_CNAME;
  110. if (n <= 0) return 0.;
  111. if (n == 1)
  112. #ifndef COMPLEX
  113. #ifdef DOUBLE
  114. return fabs(x[0]);
  115. #else
  116. return fabsf(x[0]);
  117. #endif
  118. #else
  119. #ifdef DOUBLE
  120. return fabs(x[0]+fabs(x[1]));
  121. #else
  122. return fabsf(x[0]+fabsf(x[1]));
  123. #endif
  124. #endif
  125. if (incx == 0)
  126. #ifndef COMPLEX
  127. #ifdef DOUBLE
  128. return (sqrt((double)n)*fabs(x[0]));
  129. #else
  130. return (sqrt((float)n)*fabsf(x[0]));
  131. #endif
  132. #else
  133. #ifdef DOUBLE
  134. {
  135. double fr=fabs(x[0]);
  136. double fi=fabs(x[1]);
  137. double fmin=MIN(fr,fi);
  138. double fmax=MAX(fr,fi);
  139. if (fmax==0.) return(fmax);
  140. if (fmax==fmin) return(sqrt((double)n)*sqrt(2.)*fmax);
  141. return (sqrt((double)n) * fmax * sqrt (1. + (fmin/fmax)*(fmin/fmax)));
  142. }
  143. #else
  144. {
  145. float fr=fabs(x[0]);
  146. float fi=fabs(x[1]);
  147. float fmin=MIN(fr,fi);
  148. float fmax=MAX(fr,fi);
  149. if (fmax==0.) return(fmax);
  150. if (fmax==fmin) return(sqrt((float)n)*sqrt(2.)*fmax);
  151. return (sqrt((float)n) * fmax * sqrt (1. + (fmin/fmax)*(fmin/fmax)));
  152. }
  153. #endif
  154. #endif
  155. if (incx < 0)
  156. #ifdef COMPLEX
  157. x -= (n - 1) * incx * 2;
  158. #else
  159. x -= (n - 1) * incx;
  160. #endif
  161. IDEBUG_START;
  162. FUNCTION_PROFILE_START();
  163. ret = NRM2_K(n, x, incx);
  164. FUNCTION_PROFILE_END(COMPSIZE, n, 2 * n);
  165. IDEBUG_END;
  166. return ret;
  167. }
  168. #endif