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.

zhemm_utcopy_2.c 4.5 kB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142
  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;
  43. FLOAT *ao1, *ao2;
  44. lda *= 2;
  45. js = (n >> 1);
  46. while (js > 0){
  47. offset = posX - posY;
  48. if (offset > 0) ao1 = a + posY * 2 + (posX + 0) * lda; else ao1 = a + (posX + 0) * 2 + posY * lda;
  49. if (offset > -1) ao2 = a + posY * 2 + (posX + 1) * lda; else ao2 = a + (posX + 1) * 2 + posY * lda;
  50. i = m;
  51. while (i > 0) {
  52. data01 = *(ao1 + 0);
  53. data02 = *(ao1 + 1);
  54. data03 = *(ao2 + 0);
  55. data04 = *(ao2 + 1);
  56. if (offset > 0) ao1 += 2; else ao1 += lda;
  57. if (offset > -1) ao2 += 2; else ao2 += lda;
  58. if (offset > 0) {
  59. b[ 0] = data01;
  60. b[ 1] = -data02;
  61. b[ 2] = data03;
  62. b[ 3] = -data04;
  63. } else
  64. if (offset < -1) {
  65. b[ 0] = data01;
  66. b[ 1] = data02;
  67. b[ 2] = data03;
  68. b[ 3] = data04;
  69. } else {
  70. switch (offset) {
  71. case 0 :
  72. b[ 0] = data01;
  73. b[ 1] = ZERO;
  74. b[ 2] = data03;
  75. b[ 3] = -data04;
  76. break;
  77. case -1 :
  78. b[ 0] = data01;
  79. b[ 1] = data02;
  80. b[ 2] = data03;
  81. b[ 3] = ZERO;
  82. break;
  83. }
  84. }
  85. b += 4;
  86. offset --;
  87. i --;
  88. }
  89. posX += 2;
  90. js --;
  91. }
  92. if (n & 1) {
  93. offset = posX - posY;
  94. if (offset > 0) ao1 = a + posY * 2 + (posX + 0) * lda; else ao1 = a + (posX + 0) * 2 + posY * lda;
  95. i = m;
  96. while (i > 0) {
  97. data01 = *(ao1 + 0);
  98. data02 = *(ao1 + 1);
  99. if (offset > 0) ao1 += 2; else ao1 += lda;
  100. if (offset > 0) {
  101. b[ 0] = data01;
  102. b[ 1] = -data02;
  103. } else
  104. if (offset < 0) {
  105. b[ 0] = data01;
  106. b[ 1] = data02;
  107. } else {
  108. b[ 0] = data01;
  109. b[ 1] = ZERO;
  110. }
  111. b += 2;
  112. offset --;
  113. i --;
  114. }
  115. }
  116. return 0;
  117. }