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_6.c 6.5 kB

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