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.

zgemm_beta.c 5.0 kB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158
  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 <ctype.h>
  41. #include "common.h"
  42. int CNAME(BLASLONG m, BLASLONG n, BLASLONG dummy1,
  43. FLOAT beta_r, FLOAT beta_i,
  44. FLOAT *dummy2, BLASLONG dummy3,
  45. FLOAT *dummy4, BLASLONG dummy5,
  46. FLOAT *c, BLASLONG ldc){
  47. BLASLONG i, j;
  48. FLOAT *c_offset, *c_offset1;
  49. FLOAT atemp1, atemp2, atemp3, atemp4;
  50. FLOAT btemp1, btemp2, btemp3, btemp4;
  51. FLOAT ctemp1, ctemp2, ctemp3, ctemp4;
  52. ldc *= 2;
  53. c_offset = c;
  54. if (beta_r == 0. && beta_i == 0.) {
  55. j = n;
  56. do {
  57. c_offset1 = c_offset;
  58. c_offset += ldc;
  59. i = (m >> 2);
  60. if (i > 0){
  61. do {
  62. *(c_offset1 + 0) = ZERO;
  63. *(c_offset1 + 1) = ZERO;
  64. *(c_offset1 + 2) = ZERO;
  65. *(c_offset1 + 3) = ZERO;
  66. *(c_offset1 + 4) = ZERO;
  67. *(c_offset1 + 5) = ZERO;
  68. *(c_offset1 + 6) = ZERO;
  69. *(c_offset1 + 7) = ZERO;
  70. c_offset1 += 8;
  71. i--;
  72. } while (i > 0);
  73. }
  74. i = (m & 3);
  75. if (i > 0){
  76. do {
  77. *(c_offset1 + 0) = ZERO;
  78. *(c_offset1 + 1) = ZERO;
  79. c_offset1 += 2;
  80. i--;
  81. } while (i > 0);
  82. }
  83. j --;
  84. } while (j > 0);
  85. } else {
  86. j = n;
  87. do {
  88. c_offset1 = c_offset;
  89. c_offset += ldc;
  90. i = (m >> 1);
  91. if (i > 0){
  92. do {
  93. atemp1 = *(c_offset1 + 0);
  94. atemp2 = *(c_offset1 + 1);
  95. atemp3 = *(c_offset1 + 2);
  96. atemp4 = *(c_offset1 + 3);
  97. btemp1 = beta_r * atemp1;
  98. btemp2 = beta_i * atemp2;
  99. btemp3 = beta_r * atemp2;
  100. btemp4 = beta_i * atemp1;
  101. ctemp1 = btemp1 - btemp2;
  102. ctemp2 = btemp3 + btemp4;
  103. btemp1 = beta_r * atemp3;
  104. btemp2 = beta_i * atemp4;
  105. btemp3 = beta_r * atemp4;
  106. btemp4 = beta_i * atemp3;
  107. ctemp3 = btemp1 - btemp2;
  108. ctemp4 = btemp3 + btemp4;
  109. *(c_offset1 + 0) = ctemp1;
  110. *(c_offset1 + 1) = ctemp2;
  111. *(c_offset1 + 2) = ctemp3;
  112. *(c_offset1 + 3) = ctemp4;
  113. c_offset1 += 4;
  114. i --;
  115. } while (i > 0);
  116. }
  117. i = (m & 1);
  118. if (i > 0){
  119. do {
  120. atemp1 = *(c_offset1 + 0);
  121. atemp2 = *(c_offset1 + 1);
  122. btemp1 = beta_r * atemp1;
  123. btemp2 = beta_i * atemp2;
  124. btemp3 = beta_r * atemp2;
  125. btemp4 = beta_i * atemp1;
  126. ctemp1 = btemp1 - btemp2;
  127. ctemp2 = btemp3 + btemp4;
  128. *(c_offset1 + 0) = ctemp1;
  129. *(c_offset1 + 1) = ctemp2;
  130. c_offset1 += 2;
  131. i --;
  132. } while (i > 0);
  133. }
  134. j --;
  135. } while (j > 0);
  136. }
  137. return 0;
  138. }