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.

symm_ucopy_8.c 6.5 kB

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