|
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240 |
- /*********************************************************************/
- /* Copyright 2009, 2010 The University of Texas at Austin. */
- /* All rights reserved. */
- /* */
- /* Redistribution and use in source and binary forms, with or */
- /* without modification, are permitted provided that the following */
- /* conditions are met: */
- /* */
- /* 1. Redistributions of source code must retain the above */
- /* copyright notice, this list of conditions and the following */
- /* disclaimer. */
- /* */
- /* 2. Redistributions in binary form must reproduce the above */
- /* copyright notice, this list of conditions and the following */
- /* disclaimer in the documentation and/or other materials */
- /* provided with the distribution. */
- /* */
- /* THIS SOFTWARE IS PROVIDED BY THE UNIVERSITY OF TEXAS AT */
- /* AUSTIN ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, */
- /* INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF */
- /* MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE */
- /* DISCLAIMED. IN NO EVENT SHALL THE UNIVERSITY OF TEXAS AT */
- /* AUSTIN OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, */
- /* INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES */
- /* (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE */
- /* GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR */
- /* BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF */
- /* LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT */
- /* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT */
- /* OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE */
- /* POSSIBILITY OF SUCH DAMAGE. */
- /* */
- /* The views and conclusions contained in the software and */
- /* documentation are those of the authors and should not be */
- /* interpreted as representing official policies, either expressed */
- /* or implied, of The University of Texas at Austin. */
- /*********************************************************************/
-
- #include <stdio.h>
- #include "common.h"
-
- int CNAME(BLASLONG m, BLASLONG n, FLOAT *a, BLASLONG lda, BLASLONG posX, BLASLONG posY, FLOAT *b){
-
- BLASLONG i, js;
- BLASLONG X;
-
- FLOAT data1, data2, data3, data4, data5, data6, data7, data8;
-
- FLOAT *ao1, *ao2;
-
- lda += lda;
-
- js = (n >> 1);
-
- if (js > 0){
- do {
- X = posX;
-
- if (posX <= posY) {
- ao1 = a + posY * 2 + (posX + 0) * lda;
- ao2 = a + posY * 2 + (posX + 1) * lda;
- } else {
- ao1 = a + posX * 2 + (posY + 0) * lda;
- ao2 = a + posX * 2 + (posY + 1) * lda;
- }
-
- i = (m >> 1);
- if (i > 0) {
- do {
- if (X > posY) {
- ao1 += 4;
- ao2 += 4;
- b += 8;
-
- } else
- if (X < posY) {
- data1 = *(ao1 + 0);
- data2 = *(ao1 + 1);
- data3 = *(ao1 + 2);
- data4 = *(ao1 + 3);
-
- data5 = *(ao2 + 0);
- data6 = *(ao2 + 1);
- data7 = *(ao2 + 2);
- data8 = *(ao2 + 3);
-
- b[ 0] = data1;
- b[ 1] = data2;
- b[ 2] = data3;
- b[ 3] = data4;
- b[ 4] = data5;
- b[ 5] = data6;
- b[ 6] = data7;
- b[ 7] = data8;
-
- ao1 += 2 * lda;
- ao2 += 2 * lda;
- b += 8;
-
- } else {
- #ifdef UNIT
- data3 = *(ao1 + 2);
- data4 = *(ao1 + 3);
-
- b[ 0] = ONE;
- b[ 1] = ZERO;
- b[ 2] = data3;
- b[ 3] = data4;
- b[ 4] = ZERO;
- b[ 5] = ZERO;
- b[ 6] = ONE;
- b[ 7] = ZERO;
- #else
- data1 = *(ao1 + 0);
- data2 = *(ao1 + 1);
- data3 = *(ao1 + 2);
- data4 = *(ao1 + 3);
-
- data7 = *(ao2 + 2);
- data8 = *(ao2 + 3);
-
- b[ 0] = data1;
- b[ 1] = data2;
- b[ 2] = data3;
- b[ 3] = data4;
- b[ 4] = ZERO;
- b[ 5] = ZERO;
- b[ 6] = data7;
- b[ 7] = data8;
- #endif
- ao1 += 4;
- ao2 += 4;
- b += 8;
- }
-
- X += 2;
- i --;
- } while (i > 0);
- }
-
- if (m & 1) {
-
- if (X > posY) {
- ao1 += 2;
- ao2 += 2;
- b += 4;
-
- } else
- if (X < posY) {
- data1 = *(ao1 + 0);
- data2 = *(ao1 + 1);
- data3 = *(ao1 + 2);
- data4 = *(ao1 + 3);
-
- b[ 0] = data1;
- b[ 1] = data2;
- b[ 2] = data3;
- b[ 3] = data4;
-
- ao1 += lda;
- b += 4;
- } else {
- #ifdef UNIT
- data3 = *(ao1 + 2);
- data4 = *(ao1 + 3);
-
- b[ 0] = ONE;
- b[ 1] = ZERO;
- b[ 2] = data3;
- b[ 3] = data4;
- #else
- data1 = *(ao1 + 0);
- data2 = *(ao1 + 1);
- data3 = *(ao1 + 2);
- data4 = *(ao1 + 3);
-
- b[ 0] = data1;
- b[ 1] = data2;
- b[ 2] = data3;
- b[ 3] = data4;
- #endif
- b += 4;
- }
- }
-
- posY += 2;
- js --;
- } while (js > 0);
- } /* End of main loop */
-
-
- if (n & 1){
- X = posX;
-
- if (posX <= posY) {
- ao1 = a + posY * 2 + (posX + 0) * lda;
- } else {
- ao1 = a + posX * 2 + (posY + 0) * lda;
- }
-
- i = m;
- if (i > 0) {
- do {
- if (X > posY) {
- b += 2;
- ao1 += 2;
- } else
- if (X < posY) {
- data1 = *(ao1 + 0);
- data2 = *(ao1 + 1);
-
- b[ 0] = data1;
- b[ 1] = data2;
- b += 2;
- ao1 += lda;
- } else {
- #ifdef UNIT
- b[ 0] = ONE;
- b[ 1] = ZERO;
- #else
- data1 = *(ao1 + 0);
- data2 = *(ao1 + 1);
-
- b[ 0] = data1;
- b[ 1] = data2;
- #endif
- b += 2;
- ao1 += 2;
- }
-
- X ++;
- i --;
- } while (i > 0);
- }
-
- posY += 1;
- }
-
- return 0;
- }
|