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.

ztrsm_lncopy_2.c 4.7 kB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171
  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. int CNAME(BLASLONG m, BLASLONG n, FLOAT *a, BLASLONG lda, BLASLONG offset, FLOAT *b){
  41. BLASLONG i, ii, j, jj;
  42. FLOAT data01 = 0.0, data02 = 0.0, data03, data04;
  43. FLOAT data05, data06, data07 = 0.0, data08 = 0.0;
  44. FLOAT *a1, *a2;
  45. lda *= 2;
  46. jj = offset;
  47. j = (n >> 1);
  48. while (j > 0){
  49. a1 = a + 0 * lda;
  50. a2 = a + 1 * lda;
  51. i = (m >> 1);
  52. ii = 0;
  53. while (i > 0) {
  54. if (ii == jj) {
  55. #ifndef UNIT
  56. data01 = *(a1 + 0);
  57. data02 = *(a1 + 1);
  58. #endif
  59. data03 = *(a1 + 2);
  60. data04 = *(a1 + 3);
  61. #ifndef UNIT
  62. data07 = *(a2 + 2);
  63. data08 = *(a2 + 3);
  64. #endif
  65. compinv(b + 0, data01, data02);
  66. *(b + 4) = data03;
  67. *(b + 5) = data04;
  68. compinv(b + 6, data07, data08);
  69. }
  70. if (ii > jj) {
  71. data01 = *(a1 + 0);
  72. data02 = *(a1 + 1);
  73. data03 = *(a1 + 2);
  74. data04 = *(a1 + 3);
  75. data05 = *(a2 + 0);
  76. data06 = *(a2 + 1);
  77. data07 = *(a2 + 2);
  78. data08 = *(a2 + 3);
  79. *(b + 0) = data01;
  80. *(b + 1) = data02;
  81. *(b + 2) = data05;
  82. *(b + 3) = data06;
  83. *(b + 4) = data03;
  84. *(b + 5) = data04;
  85. *(b + 6) = data07;
  86. *(b + 7) = data08;
  87. }
  88. a1 += 4;
  89. a2 += 4;
  90. b += 8;
  91. i --;
  92. ii += 2;
  93. }
  94. if (m & 1) {
  95. if (ii== jj) {
  96. #ifndef UNIT
  97. data01 = *(a1 + 0);
  98. data02 = *(a1 + 1);
  99. #endif
  100. compinv(b + 0, data01, data02);
  101. }
  102. if (ii > jj) {
  103. data01 = *(a1 + 0);
  104. data02 = *(a1 + 1);
  105. data05 = *(a2 + 0);
  106. data06 = *(a2 + 1);
  107. *(b + 0) = data01;
  108. *(b + 1) = data02;
  109. *(b + 2) = data05;
  110. *(b + 3) = data06;
  111. }
  112. b += 4;
  113. }
  114. a += 2 * lda;
  115. jj += 2;
  116. j --;
  117. }
  118. if (n & 1) {
  119. a1 = a + 0 * lda;
  120. i = m;
  121. ii = 0;
  122. while (i > 0) {
  123. if (ii == jj) {
  124. #ifndef UNIT
  125. data01 = *(a1 + 0);
  126. data02 = *(a1 + 1);
  127. #endif
  128. compinv(b + 0, data01, data02);
  129. }
  130. if (ii > jj) {
  131. data01 = *(a1 + 0);
  132. data02 = *(a1 + 1);
  133. *(b + 0) = data01;
  134. *(b + 1) = data02;
  135. }
  136. a1+= 2;
  137. b += 2;
  138. i --;
  139. ii += 1;
  140. }
  141. }
  142. return 0;
  143. }