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.

ztrmm_lncopy_1.c 3.7 kB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107
  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;
  42. BLASLONG X;
  43. FLOAT data01, data02;
  44. FLOAT *ao1;
  45. lda += lda;
  46. js = n;
  47. if (js > 0){
  48. do {
  49. X = posX;
  50. if (posX <= posY) {
  51. ao1 = a + posY * 2 + (posX + 0) * lda;
  52. } else {
  53. ao1 = a + posX * 2 + (posY + 0) * lda;
  54. }
  55. i = m;
  56. if (i > 0) {
  57. do {
  58. if (X > posY) {
  59. data01 = *(ao1 + 0);
  60. data02 = *(ao1 + 1);
  61. b[ 0] = data01;
  62. b[ 1] = data02;
  63. ao1 += 2;
  64. b += 2;
  65. } else
  66. if (X < posY) {
  67. ao1 += lda;
  68. b += 2;
  69. } else {
  70. #ifdef UNIT
  71. b[ 0] = ONE;
  72. b[ 1] = ZERO;
  73. #else
  74. data01 = *(ao1 + 0);
  75. data02 = *(ao1 + 1);
  76. b[ 0] = data01;
  77. b[ 1] = data02;
  78. #endif
  79. ao1 += 2;
  80. b += 2;
  81. }
  82. X ++;
  83. i --;
  84. } while (i > 0);
  85. }
  86. posY ++;
  87. js --;
  88. } while (js > 0);
  89. } /* End of main loop */
  90. return 0;
  91. }