103 lines
3.6 KiB
C
103 lines
3.6 KiB
C
/*********************************************************************/
|
|
/* 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 data01, data02;
|
|
FLOAT *ao1;
|
|
|
|
lda += lda;
|
|
|
|
js = n;
|
|
if (js > 0){
|
|
do {
|
|
X = posX;
|
|
|
|
if (posX <= posY) {
|
|
ao1 = a + posX * 2 + (posY + 0) * lda;
|
|
} else {
|
|
ao1 = a + posY * 2 + (posX + 0) * lda;
|
|
}
|
|
|
|
i = m;
|
|
if (i > 0) {
|
|
do {
|
|
if (X < posY) {
|
|
ao1 += 2;
|
|
b += 2;
|
|
} else
|
|
if (X > posY) {
|
|
data01 = *(ao1 + 0);
|
|
data02 = *(ao1 + 1);
|
|
b[ 0] = data01;
|
|
b[ 1] = data02;
|
|
ao1 += lda;
|
|
b += 2;
|
|
|
|
} else {
|
|
#ifdef UNIT
|
|
b[ 0] = ONE;
|
|
b[ 1] = ZERO;
|
|
#else
|
|
data01 = *(ao1 + 0);
|
|
data02 = *(ao1 + 1);
|
|
b[ 0] = data01;
|
|
b[ 1] = data02;
|
|
#endif
|
|
ao1 += lda;
|
|
b += 2;
|
|
}
|
|
|
|
X ++;
|
|
i --;
|
|
} while (i > 0);
|
|
}
|
|
|
|
posY ++;
|
|
js --;
|
|
} while (js > 0);
|
|
} /* End of main loop */
|
|
|
|
return 0;
|
|
}
|