/*********************************************************************/
/* 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 <ctype.h>
#include "common.h"
const static FLOAT dm1 = -1.;
#ifdef CONJ
#define GEMM_KERNEL GEMM_KERNEL_L
#if (!defined(TRANSA) && defined(UPPER)) || (defined(TRANSA) && !defined(UPPER))
#define TRSM_KERNEL TRSM_KERNEL_LR
#else
#define TRSM_KERNEL TRSM_KERNEL_LC
#endif
#else
#define GEMM_KERNEL GEMM_KERNEL_N
#if (!defined(TRANSA) && defined(UPPER)) || (defined(TRANSA) && !defined(UPPER))
#define TRSM_KERNEL TRSM_KERNEL_LN
#else
#define TRSM_KERNEL TRSM_KERNEL_LT
#endif
#endif
#if 0
#undef GEMM_P
#undef GEMM_Q
#undef GEMM_R
#define GEMM_P 8
#define GEMM_Q 12
#define GEMM_R 1600
#endif
int CNAME(blas_arg_t *args, BLASLONG *range_m, BLASLONG *range_n, FLOAT *sa, FLOAT *sb, BLASLONG dummy) {
BLASLONG m, n, lda, ldb;
FLOAT *beta, *a, *b;
BLASLONG ls, is, js;
BLASLONG min_l, min_i, min_j;
BLASLONG jjs, min_jj;
m = args -> m;
n = args -> n;
a = (FLOAT *)args -> a;
b = (FLOAT *)args -> b;
lda = args -> lda;
ldb = args -> ldb;
beta = (FLOAT *)args -> beta;
if (range_n) {
BLASLONG n_from = *(((BLASLONG *)range_n) + 0);
BLASLONG n_to = *(((BLASLONG *)range_n) + 1);
n = n_to - n_from;
b += n_from * ldb * COMPSIZE;
}
if (beta) {
#ifndef COMPLEX
if (beta[0] != ONE)
GEMM_BETA(m, n, 0, beta[0], NULL, 0, NULL, 0, b, ldb);
if (beta[0] == ZERO) return 0;
#else
if ((beta[0] != ONE) || (beta[1] != ZERO))
GEMM_BETA(m, n, 0, beta[0], beta[1], NULL, 0, NULL, 0, b, ldb);
if ((beta[0] == ZERO) && (beta[1] == ZERO)) return 0;
#endif
}
for(js = 0; js < n; js += GEMM_R){
min_j = n - js;
if (min_j > GEMM_R) min_j = GEMM_R;
#if (!defined(UPPER) && !defined(TRANSA)) || (defined(UPPER) && defined(TRANSA))
for(ls = 0; ls < m; ls += GEMM_Q){
min_l = m - ls;
if (min_l > GEMM_Q) min_l = GEMM_Q;
min_i = min_l;
if (min_i > GEMM_P) min_i = GEMM_P;
#ifndef TRANSA
TRSM_ILTCOPY(min_l, min_i, a + (ls + ls * lda) * COMPSIZE, lda, 0, sa);
#else
TRSM_IUNCOPY(min_l, min_i, a + (ls + ls * lda) * COMPSIZE, lda, 0, sa);
#endif
for(jjs = js; jjs < js + min_j; jjs += min_jj){
min_jj = min_j + js - jjs;
if (min_jj > GEMM_UNROLL_N) min_jj = GEMM_UNROLL_N;
GEMM_ONCOPY(min_l, min_jj, b + (ls + jjs * ldb) * COMPSIZE, ldb, sb + min_l * (jjs - js) * COMPSIZE);
TRSM_KERNEL(min_i, min_jj, min_l, dm1,
#ifdef COMPLEX
ZERO,
#endif
sa, sb + min_l * (jjs - js) * COMPSIZE,
b + (ls + jjs * ldb) * COMPSIZE, ldb, 0);
}
for(is = ls + min_i; is < ls + min_l; is += GEMM_P){
min_i = ls + min_l - is;
if (min_i > GEMM_P) min_i = GEMM_P;
#ifndef TRANSA
TRSM_ILTCOPY(min_l, min_i, a + (is + ls * lda) * COMPSIZE, lda, is - ls, sa);
#else
TRSM_IUNCOPY(min_l, min_i, a + (ls + is * lda) * COMPSIZE, lda, is - ls, sa);
#endif
TRSM_KERNEL(min_i, min_j, min_l, dm1,
#ifdef COMPLEX
ZERO,
#endif
sa, sb, b + (is + js * ldb) * COMPSIZE, ldb, is - ls);
}
for(is = ls + min_l; is < m; is += GEMM_P){
min_i = m - is;
if (min_i > GEMM_P) min_i = GEMM_P;
#ifndef TRANSA
GEMM_ITCOPY(min_l, min_i, a + (is + ls * lda) * COMPSIZE, lda, sa);
#else
GEMM_INCOPY(min_l, min_i, a + (ls + is * lda) * COMPSIZE, lda, sa);
#endif
GEMM_KERNEL(min_i, min_j, min_l, dm1,
#ifdef COMPLEX
ZERO,
#endif
sa, sb, b + (is + js * ldb) * COMPSIZE, ldb);
}
}
#else
BLASLONG start_is;
for(ls = m; ls > 0; ls -= GEMM_Q){
min_l = ls;
if (min_l > GEMM_Q) min_l = GEMM_Q;
start_is = ls - min_l;
while (start_is + GEMM_P < ls) start_is += GEMM_P;
min_i = ls - start_is;
if (min_i > GEMM_P) min_i = GEMM_P;
#ifndef TRANSA
TRSM_IUTCOPY(min_l, min_i, a + (start_is + (ls - min_l) * lda) * COMPSIZE, lda, start_is - (ls - min_l), sa);
#else
TRSM_ILNCOPY(min_l, min_i, a + ((ls - min_l) + start_is * lda) * COMPSIZE, lda, start_is - (ls - min_l), sa);
#endif
for(jjs = js; jjs < js + min_j; jjs += min_jj){
min_jj = min_j + js - jjs;
if (min_jj > GEMM_UNROLL_N) min_jj = GEMM_UNROLL_N;
GEMM_ONCOPY(min_l, min_jj, b + (ls - min_l + jjs * ldb) * COMPSIZE, ldb, sb + min_l * (jjs - js) * COMPSIZE);
TRSM_KERNEL(min_i, min_jj, min_l, dm1,
#ifdef COMPLEX
ZERO,
#endif
sa, sb + min_l * (jjs - js) * COMPSIZE,
b + (start_is + jjs * ldb) * COMPSIZE, ldb, start_is - ls + min_l);
}
for(is = start_is - GEMM_P; is >= ls - min_l; is -= GEMM_P){
min_i = ls - is;
if (min_i > GEMM_P) min_i = GEMM_P;
#ifndef TRANSA
TRSM_IUTCOPY(min_l, min_i, a + (is + (ls - min_l) * lda) * COMPSIZE, lda, is - (ls - min_l), sa);
#else
TRSM_ILNCOPY(min_l, min_i, a + ((ls - min_l) + is * lda) * COMPSIZE, lda, is - (ls - min_l), sa);
#endif
TRSM_KERNEL(min_i, min_j, min_l, dm1,
#ifdef COMPLEX
ZERO,
#endif
sa, sb,
b + (is + js * ldb) * COMPSIZE, ldb, + is - (ls - min_l) );
}
for(is = 0; is < ls - min_l; is += GEMM_P){
min_i = ls - min_l - is;
if (min_i > GEMM_P) min_i = GEMM_P;
#ifndef TRANSA
GEMM_ITCOPY(min_l, min_i, a + (is + (ls - min_l) * lda) * COMPSIZE, lda, sa);
#else
GEMM_INCOPY(min_l, min_i, a + ((ls - min_l) + is * lda) * COMPSIZE, lda, sa);
#endif
GEMM_KERNEL(min_i, min_j, min_l, dm1,
#ifdef COMPLEX
ZERO,
#endif
sa, sb, b + (is + js * ldb) * COMPSIZE, ldb);
}
}
#endif
}
return 0;
}