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_utcopy_2.c 4.7 kB

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