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.

gemm_ncopy_2.c 4.3 kB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126
  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, FLOAT *b){
  41. BLASLONG i, j;
  42. FLOAT *a_offset, *a_offset1, *a_offset2;
  43. FLOAT *b_offset;
  44. a_offset = a;
  45. b_offset = b;
  46. j = (n >> 1);
  47. if (j > 0){
  48. do {
  49. a_offset1 = a_offset;
  50. a_offset2 = a_offset + lda;
  51. a_offset += 2 * lda;
  52. i = (m >> 2);
  53. if (i > 0){
  54. do {
  55. *(b_offset + 0) = *(a_offset1 + 0);
  56. *(b_offset + 1) = *(a_offset2 + 0);
  57. *(b_offset + 2) = *(a_offset1 + 1);
  58. *(b_offset + 3) = *(a_offset2 + 1);
  59. *(b_offset + 4) = *(a_offset1 + 2);
  60. *(b_offset + 5) = *(a_offset2 + 2);
  61. *(b_offset + 6) = *(a_offset1 + 3);
  62. *(b_offset + 7) = *(a_offset2 + 3);
  63. a_offset1 += 4;
  64. a_offset2 += 4;
  65. b_offset += 8;
  66. i --;
  67. } while (i > 0);
  68. }
  69. i = (m & 3);
  70. if (i > 0){
  71. do {
  72. *(b_offset + 0) = *(a_offset1 + 0);
  73. *(b_offset + 1) = *(a_offset2 + 0);
  74. a_offset1 ++;
  75. a_offset2 ++;
  76. b_offset += 2;
  77. i --;
  78. } while (i > 0);
  79. }
  80. j --;
  81. } while (j > 0);
  82. }
  83. if (n & 1){
  84. i = (m >> 3);
  85. if (i > 0){
  86. do {
  87. *(b_offset + 0) = *(a_offset + 0);
  88. *(b_offset + 1) = *(a_offset + 1);
  89. *(b_offset + 2) = *(a_offset + 2);
  90. *(b_offset + 3) = *(a_offset + 3);
  91. *(b_offset + 4) = *(a_offset + 4);
  92. *(b_offset + 5) = *(a_offset + 5);
  93. *(b_offset + 6) = *(a_offset + 6);
  94. *(b_offset + 7) = *(a_offset + 7);
  95. a_offset += 8;
  96. b_offset += 8;
  97. i --;
  98. } while (i > 0);
  99. }
  100. i = (m & 7);
  101. if (i > 0){
  102. do {
  103. *(b_offset + 0) = *(a_offset + 0);
  104. a_offset ++;
  105. b_offset ++;
  106. i --;
  107. } while (i > 0);
  108. }
  109. }
  110. return 0;
  111. }