Import GotoBLAS2 1.13 BSD version codes.
This commit is contained in:
@@ -0,0 +1,313 @@
|
||||
TOPDIR = ../..
|
||||
include ../../Makefile.system
|
||||
|
||||
SBLASOBJS = strtri_UU_single.$(SUFFIX) strtri_UN_single.$(SUFFIX) strtri_LU_single.$(SUFFIX) strtri_LN_single.$(SUFFIX)
|
||||
|
||||
DBLASOBJS = dtrtri_UU_single.$(SUFFIX) dtrtri_UN_single.$(SUFFIX) dtrtri_LU_single.$(SUFFIX) dtrtri_LN_single.$(SUFFIX)
|
||||
|
||||
QBLASOBJS = qtrtri_UU_single.$(SUFFIX) qtrtri_UN_single.$(SUFFIX) qtrtri_LU_single.$(SUFFIX) qtrtri_LN_single.$(SUFFIX)
|
||||
|
||||
CBLASOBJS = ctrtri_UU_single.$(SUFFIX) ctrtri_UN_single.$(SUFFIX) ctrtri_LU_single.$(SUFFIX) ctrtri_LN_single.$(SUFFIX)
|
||||
|
||||
ZBLASOBJS = ztrtri_UU_single.$(SUFFIX) ztrtri_UN_single.$(SUFFIX) ztrtri_LU_single.$(SUFFIX) ztrtri_LN_single.$(SUFFIX)
|
||||
|
||||
XBLASOBJS = xtrtri_UU_single.$(SUFFIX) xtrtri_UN_single.$(SUFFIX) xtrtri_LU_single.$(SUFFIX) xtrtri_LN_single.$(SUFFIX)
|
||||
|
||||
ifdef SMP
|
||||
SBLASOBJS += strtri_UU_parallel.$(SUFFIX) strtri_UN_parallel.$(SUFFIX) strtri_LU_parallel.$(SUFFIX) strtri_LN_parallel.$(SUFFIX)
|
||||
DBLASOBJS += dtrtri_UU_parallel.$(SUFFIX) dtrtri_UN_parallel.$(SUFFIX) dtrtri_LU_parallel.$(SUFFIX) dtrtri_LN_parallel.$(SUFFIX)
|
||||
QBLASOBJS += qtrtri_UU_parallel.$(SUFFIX) qtrtri_UN_parallel.$(SUFFIX) qtrtri_LU_parallel.$(SUFFIX) qtrtri_LN_parallel.$(SUFFIX)
|
||||
CBLASOBJS += ctrtri_UU_parallel.$(SUFFIX) ctrtri_UN_parallel.$(SUFFIX) ctrtri_LU_parallel.$(SUFFIX) ctrtri_LN_parallel.$(SUFFIX)
|
||||
ZBLASOBJS += ztrtri_UU_parallel.$(SUFFIX) ztrtri_UN_parallel.$(SUFFIX) ztrtri_LU_parallel.$(SUFFIX) ztrtri_LN_parallel.$(SUFFIX)
|
||||
XBLASOBJS += xtrtri_UU_parallel.$(SUFFIX) xtrtri_UN_parallel.$(SUFFIX) xtrtri_LU_parallel.$(SUFFIX) xtrtri_LN_parallel.$(SUFFIX)
|
||||
endif
|
||||
|
||||
strtri_UU_single.$(SUFFIX) : trtri_U_single.c
|
||||
$(CC) -c $(CFLAGS) -UCOMPLEX -UDOUBLE -DUNIT $< -o $(@F)
|
||||
|
||||
strtri_UN_single.$(SUFFIX) : trtri_U_single.c
|
||||
$(CC) -c $(CFLAGS) -UCOMPLEX -UDOUBLE -UUNIT $< -o $(@F)
|
||||
|
||||
strtri_LU_single.$(SUFFIX) : trtri_L_single.c
|
||||
$(CC) -c $(CFLAGS) -UCOMPLEX -UDOUBLE -DUNIT $< -o $(@F)
|
||||
|
||||
strtri_LN_single.$(SUFFIX) : trtri_L_single.c
|
||||
$(CC) -c $(CFLAGS) -UCOMPLEX -UDOUBLE -UUNIT $< -o $(@F)
|
||||
|
||||
strtri_UU_parallel.$(SUFFIX) : trtri_U_parallel.c
|
||||
$(CC) -c $(CFLAGS) -UCOMPLEX -UDOUBLE -DUNIT $< -o $(@F)
|
||||
|
||||
strtri_UN_parallel.$(SUFFIX) : trtri_U_parallel.c
|
||||
$(CC) -c $(CFLAGS) -UCOMPLEX -UDOUBLE -UUNIT $< -o $(@F)
|
||||
|
||||
strtri_LU_parallel.$(SUFFIX) : trtri_L_parallel.c
|
||||
$(CC) -c $(CFLAGS) -UCOMPLEX -UDOUBLE -DUNIT $< -o $(@F)
|
||||
|
||||
strtri_LN_parallel.$(SUFFIX) : trtri_L_parallel.c
|
||||
$(CC) -c $(CFLAGS) -UCOMPLEX -UDOUBLE -UUNIT $< -o $(@F)
|
||||
|
||||
dtrtri_UU_single.$(SUFFIX) : trtri_U_single.c
|
||||
$(CC) -c $(CFLAGS) -UCOMPLEX -DDOUBLE -DUNIT $< -o $(@F)
|
||||
|
||||
dtrtri_UN_single.$(SUFFIX) : trtri_U_single.c
|
||||
$(CC) -c $(CFLAGS) -UCOMPLEX -DDOUBLE -UUNIT $< -o $(@F)
|
||||
|
||||
dtrtri_LU_single.$(SUFFIX) : trtri_L_single.c
|
||||
$(CC) -c $(CFLAGS) -UCOMPLEX -DDOUBLE -DUNIT $< -o $(@F)
|
||||
|
||||
dtrtri_LN_single.$(SUFFIX) : trtri_L_single.c
|
||||
$(CC) -c $(CFLAGS) -UCOMPLEX -DDOUBLE -UUNIT $< -o $(@F)
|
||||
|
||||
dtrtri_UU_parallel.$(SUFFIX) : trtri_U_parallel.c
|
||||
$(CC) -c $(CFLAGS) -UCOMPLEX -DDOUBLE -DUNIT $< -o $(@F)
|
||||
|
||||
dtrtri_UN_parallel.$(SUFFIX) : trtri_U_parallel.c
|
||||
$(CC) -c $(CFLAGS) -UCOMPLEX -DDOUBLE -UUNIT $< -o $(@F)
|
||||
|
||||
dtrtri_LU_parallel.$(SUFFIX) : trtri_L_parallel.c
|
||||
$(CC) -c $(CFLAGS) -UCOMPLEX -DDOUBLE -DUNIT $< -o $(@F)
|
||||
|
||||
dtrtri_LN_parallel.$(SUFFIX) : trtri_L_parallel.c
|
||||
$(CC) -c $(CFLAGS) -UCOMPLEX -DDOUBLE -UUNIT $< -o $(@F)
|
||||
|
||||
qtrtri_UU_single.$(SUFFIX) : trtri_U_single.c
|
||||
$(CC) -c $(CFLAGS) -UCOMPLEX -DXDOUBLE -DUNIT $< -o $(@F)
|
||||
|
||||
qtrtri_UN_single.$(SUFFIX) : trtri_U_single.c
|
||||
$(CC) -c $(CFLAGS) -UCOMPLEX -DXDOUBLE -UUNIT $< -o $(@F)
|
||||
|
||||
qtrtri_LU_single.$(SUFFIX) : trtri_L_single.c
|
||||
$(CC) -c $(CFLAGS) -UCOMPLEX -DXDOUBLE -DUNIT $< -o $(@F)
|
||||
|
||||
qtrtri_LN_single.$(SUFFIX) : trtri_L_single.c
|
||||
$(CC) -c $(CFLAGS) -UCOMPLEX -DXDOUBLE -UUNIT $< -o $(@F)
|
||||
|
||||
qtrtri_UU_parallel.$(SUFFIX) : trtri_U_parallel.c
|
||||
$(CC) -c $(CFLAGS) -UCOMPLEX -DXDOUBLE -DUNIT $< -o $(@F)
|
||||
|
||||
qtrtri_UN_parallel.$(SUFFIX) : trtri_U_parallel.c
|
||||
$(CC) -c $(CFLAGS) -UCOMPLEX -DXDOUBLE -UUNIT $< -o $(@F)
|
||||
|
||||
qtrtri_LU_parallel.$(SUFFIX) : trtri_L_parallel.c
|
||||
$(CC) -c $(CFLAGS) -UCOMPLEX -DXDOUBLE -DUNIT $< -o $(@F)
|
||||
|
||||
qtrtri_LN_parallel.$(SUFFIX) : trtri_L_parallel.c
|
||||
$(CC) -c $(CFLAGS) -UCOMPLEX -DXDOUBLE -UUNIT $< -o $(@F)
|
||||
|
||||
ctrtri_UU_single.$(SUFFIX) : trtri_U_single.c
|
||||
$(CC) -c $(CFLAGS) -DCOMPLEX -UDOUBLE -DUNIT $< -o $(@F)
|
||||
|
||||
ctrtri_UN_single.$(SUFFIX) : trtri_U_single.c
|
||||
$(CC) -c $(CFLAGS) -DCOMPLEX -UDOUBLE -UUNIT $< -o $(@F)
|
||||
|
||||
ctrtri_LU_single.$(SUFFIX) : trtri_L_single.c
|
||||
$(CC) -c $(CFLAGS) -DCOMPLEX -UDOUBLE -DUNIT $< -o $(@F)
|
||||
|
||||
ctrtri_LN_single.$(SUFFIX) : trtri_L_single.c
|
||||
$(CC) -c $(CFLAGS) -DCOMPLEX -UDOUBLE -UUNIT $< -o $(@F)
|
||||
|
||||
ctrtri_UU_parallel.$(SUFFIX) : trtri_U_parallel.c
|
||||
$(CC) -c $(CFLAGS) -DCOMPLEX -UDOUBLE -DUNIT $< -o $(@F)
|
||||
|
||||
ctrtri_UN_parallel.$(SUFFIX) : trtri_U_parallel.c
|
||||
$(CC) -c $(CFLAGS) -DCOMPLEX -UDOUBLE -UUNIT $< -o $(@F)
|
||||
|
||||
ctrtri_LU_parallel.$(SUFFIX) : trtri_L_parallel.c
|
||||
$(CC) -c $(CFLAGS) -DCOMPLEX -UDOUBLE -DUNIT $< -o $(@F)
|
||||
|
||||
ctrtri_LN_parallel.$(SUFFIX) : trtri_L_parallel.c
|
||||
$(CC) -c $(CFLAGS) -DCOMPLEX -UDOUBLE -UUNIT $< -o $(@F)
|
||||
|
||||
ztrtri_UU_single.$(SUFFIX) : trtri_U_single.c
|
||||
$(CC) -c $(CFLAGS) -DCOMPLEX -DDOUBLE -DUNIT $< -o $(@F)
|
||||
|
||||
ztrtri_UN_single.$(SUFFIX) : trtri_U_single.c
|
||||
$(CC) -c $(CFLAGS) -DCOMPLEX -DDOUBLE -UUNIT $< -o $(@F)
|
||||
|
||||
ztrtri_LU_single.$(SUFFIX) : trtri_L_single.c
|
||||
$(CC) -c $(CFLAGS) -DCOMPLEX -DDOUBLE -DUNIT $< -o $(@F)
|
||||
|
||||
ztrtri_LN_single.$(SUFFIX) : trtri_L_single.c
|
||||
$(CC) -c $(CFLAGS) -DCOMPLEX -DDOUBLE -UUNIT $< -o $(@F)
|
||||
|
||||
ztrtri_UU_parallel.$(SUFFIX) : trtri_U_parallel.c
|
||||
$(CC) -c $(CFLAGS) -DCOMPLEX -DDOUBLE -DUNIT $< -o $(@F)
|
||||
|
||||
ztrtri_UN_parallel.$(SUFFIX) : trtri_U_parallel.c
|
||||
$(CC) -c $(CFLAGS) -DCOMPLEX -DDOUBLE -UUNIT $< -o $(@F)
|
||||
|
||||
ztrtri_LU_parallel.$(SUFFIX) : trtri_L_parallel.c
|
||||
$(CC) -c $(CFLAGS) -DCOMPLEX -DDOUBLE -DUNIT $< -o $(@F)
|
||||
|
||||
ztrtri_LN_parallel.$(SUFFIX) : trtri_L_parallel.c
|
||||
$(CC) -c $(CFLAGS) -DCOMPLEX -DDOUBLE -UUNIT $< -o $(@F)
|
||||
|
||||
xtrtri_UU_single.$(SUFFIX) : trtri_U_single.c
|
||||
$(CC) -c $(CFLAGS) -DCOMPLEX -DXDOUBLE -DUNIT $< -o $(@F)
|
||||
|
||||
xtrtri_UN_single.$(SUFFIX) : trtri_U_single.c
|
||||
$(CC) -c $(CFLAGS) -DCOMPLEX -DXDOUBLE -UUNIT $< -o $(@F)
|
||||
|
||||
xtrtri_LU_single.$(SUFFIX) : trtri_L_single.c
|
||||
$(CC) -c $(CFLAGS) -DCOMPLEX -DXDOUBLE -DUNIT $< -o $(@F)
|
||||
|
||||
xtrtri_LN_single.$(SUFFIX) : trtri_L_single.c
|
||||
$(CC) -c $(CFLAGS) -DCOMPLEX -DXDOUBLE -UUNIT $< -o $(@F)
|
||||
|
||||
xtrtri_UU_parallel.$(SUFFIX) : trtri_U_parallel.c
|
||||
$(CC) -c $(CFLAGS) -DCOMPLEX -DXDOUBLE -DUNIT $< -o $(@F)
|
||||
|
||||
xtrtri_UN_parallel.$(SUFFIX) : trtri_U_parallel.c
|
||||
$(CC) -c $(CFLAGS) -DCOMPLEX -DXDOUBLE -UUNIT $< -o $(@F)
|
||||
|
||||
xtrtri_LU_parallel.$(SUFFIX) : trtri_L_parallel.c
|
||||
$(CC) -c $(CFLAGS) -DCOMPLEX -DXDOUBLE -DUNIT $< -o $(@F)
|
||||
|
||||
xtrtri_LN_parallel.$(SUFFIX) : trtri_L_parallel.c
|
||||
$(CC) -c $(CFLAGS) -DCOMPLEX -DXDOUBLE -UUNIT $< -o $(@F)
|
||||
|
||||
strtri_UU_single.$(PSUFFIX) : trtri_U_single.c
|
||||
$(CC) -c $(PFLAGS) -UCOMPLEX -UDOUBLE -DUNIT $< -o $(@F)
|
||||
|
||||
strtri_UN_single.$(PSUFFIX) : trtri_U_single.c
|
||||
$(CC) -c $(PFLAGS) -UCOMPLEX -UDOUBLE -UUNIT $< -o $(@F)
|
||||
|
||||
strtri_LU_single.$(PSUFFIX) : trtri_L_single.c
|
||||
$(CC) -c $(PFLAGS) -UCOMPLEX -UDOUBLE -DUNIT $< -o $(@F)
|
||||
|
||||
strtri_LN_single.$(PSUFFIX) : trtri_L_single.c
|
||||
$(CC) -c $(PFLAGS) -UCOMPLEX -UDOUBLE -UUNIT $< -o $(@F)
|
||||
|
||||
strtri_UU_parallel.$(PSUFFIX) : trtri_U_parallel.c
|
||||
$(CC) -c $(PFLAGS) -UCOMPLEX -UDOUBLE -DUNIT $< -o $(@F)
|
||||
|
||||
strtri_UN_parallel.$(PSUFFIX) : trtri_U_parallel.c
|
||||
$(CC) -c $(PFLAGS) -UCOMPLEX -UDOUBLE -UUNIT $< -o $(@F)
|
||||
|
||||
strtri_LU_parallel.$(PSUFFIX) : trtri_L_parallel.c
|
||||
$(CC) -c $(PFLAGS) -UCOMPLEX -UDOUBLE -DUNIT $< -o $(@F)
|
||||
|
||||
strtri_LN_parallel.$(PSUFFIX) : trtri_L_parallel.c
|
||||
$(CC) -c $(PFLAGS) -UCOMPLEX -UDOUBLE -UUNIT $< -o $(@F)
|
||||
|
||||
dtrtri_UU_single.$(PSUFFIX) : trtri_U_single.c
|
||||
$(CC) -c $(PFLAGS) -UCOMPLEX -DDOUBLE -DUNIT $< -o $(@F)
|
||||
|
||||
dtrtri_UN_single.$(PSUFFIX) : trtri_U_single.c
|
||||
$(CC) -c $(PFLAGS) -UCOMPLEX -DDOUBLE -UUNIT $< -o $(@F)
|
||||
|
||||
dtrtri_LU_single.$(PSUFFIX) : trtri_L_single.c
|
||||
$(CC) -c $(PFLAGS) -UCOMPLEX -DDOUBLE -DUNIT $< -o $(@F)
|
||||
|
||||
dtrtri_LN_single.$(PSUFFIX) : trtri_L_single.c
|
||||
$(CC) -c $(PFLAGS) -UCOMPLEX -DDOUBLE -UUNIT $< -o $(@F)
|
||||
|
||||
dtrtri_UU_parallel.$(PSUFFIX) : trtri_U_parallel.c
|
||||
$(CC) -c $(PFLAGS) -UCOMPLEX -DDOUBLE -DUNIT $< -o $(@F)
|
||||
|
||||
dtrtri_UN_parallel.$(PSUFFIX) : trtri_U_parallel.c
|
||||
$(CC) -c $(PFLAGS) -UCOMPLEX -DDOUBLE -UUNIT $< -o $(@F)
|
||||
|
||||
dtrtri_LU_parallel.$(PSUFFIX) : trtri_L_parallel.c
|
||||
$(CC) -c $(PFLAGS) -UCOMPLEX -DDOUBLE -DUNIT $< -o $(@F)
|
||||
|
||||
dtrtri_LN_parallel.$(PSUFFIX) : trtri_L_parallel.c
|
||||
$(CC) -c $(PFLAGS) -UCOMPLEX -DDOUBLE -UUNIT $< -o $(@F)
|
||||
|
||||
qtrtri_UU_single.$(PSUFFIX) : trtri_U_single.c
|
||||
$(CC) -c $(PFLAGS) -UCOMPLEX -DXDOUBLE -DUNIT $< -o $(@F)
|
||||
|
||||
qtrtri_UN_single.$(PSUFFIX) : trtri_U_single.c
|
||||
$(CC) -c $(PFLAGS) -UCOMPLEX -DXDOUBLE -UUNIT $< -o $(@F)
|
||||
|
||||
qtrtri_LU_single.$(PSUFFIX) : trtri_L_single.c
|
||||
$(CC) -c $(PFLAGS) -UCOMPLEX -DXDOUBLE -DUNIT $< -o $(@F)
|
||||
|
||||
qtrtri_LN_single.$(PSUFFIX) : trtri_L_single.c
|
||||
$(CC) -c $(PFLAGS) -UCOMPLEX -DXDOUBLE -UUNIT $< -o $(@F)
|
||||
|
||||
qtrtri_UU_parallel.$(PSUFFIX) : trtri_U_parallel.c
|
||||
$(CC) -c $(PFLAGS) -UCOMPLEX -DXDOUBLE -DUNIT $< -o $(@F)
|
||||
|
||||
qtrtri_UN_parallel.$(PSUFFIX) : trtri_U_parallel.c
|
||||
$(CC) -c $(PFLAGS) -UCOMPLEX -DXDOUBLE -UUNIT $< -o $(@F)
|
||||
|
||||
qtrtri_LU_parallel.$(PSUFFIX) : trtri_L_parallel.c
|
||||
$(CC) -c $(PFLAGS) -UCOMPLEX -DXDOUBLE -DUNIT $< -o $(@F)
|
||||
|
||||
qtrtri_LN_parallel.$(PSUFFIX) : trtri_L_parallel.c
|
||||
$(CC) -c $(PFLAGS) -UCOMPLEX -DXDOUBLE -UUNIT $< -o $(@F)
|
||||
|
||||
ctrtri_UU_single.$(PSUFFIX) : trtri_U_single.c
|
||||
$(CC) -c $(PFLAGS) -DCOMPLEX -UDOUBLE -DUNIT $< -o $(@F)
|
||||
|
||||
ctrtri_UN_single.$(PSUFFIX) : trtri_U_single.c
|
||||
$(CC) -c $(PFLAGS) -DCOMPLEX -UDOUBLE -UUNIT $< -o $(@F)
|
||||
|
||||
ctrtri_LU_single.$(PSUFFIX) : trtri_L_single.c
|
||||
$(CC) -c $(PFLAGS) -DCOMPLEX -UDOUBLE -DUNIT $< -o $(@F)
|
||||
|
||||
ctrtri_LN_single.$(PSUFFIX) : trtri_L_single.c
|
||||
$(CC) -c $(PFLAGS) -DCOMPLEX -UDOUBLE -UUNIT $< -o $(@F)
|
||||
|
||||
ctrtri_UU_parallel.$(PSUFFIX) : trtri_U_parallel.c
|
||||
$(CC) -c $(PFLAGS) -DCOMPLEX -UDOUBLE -DUNIT $< -o $(@F)
|
||||
|
||||
ctrtri_UN_parallel.$(PSUFFIX) : trtri_U_parallel.c
|
||||
$(CC) -c $(PFLAGS) -DCOMPLEX -UDOUBLE -UUNIT $< -o $(@F)
|
||||
|
||||
ctrtri_LU_parallel.$(PSUFFIX) : trtri_L_parallel.c
|
||||
$(CC) -c $(PFLAGS) -DCOMPLEX -UDOUBLE -DUNIT $< -o $(@F)
|
||||
|
||||
ctrtri_LN_parallel.$(PSUFFIX) : trtri_L_parallel.c
|
||||
$(CC) -c $(PFLAGS) -DCOMPLEX -UDOUBLE -UUNIT $< -o $(@F)
|
||||
|
||||
ztrtri_UU_single.$(PSUFFIX) : trtri_U_single.c
|
||||
$(CC) -c $(PFLAGS) -DCOMPLEX -DDOUBLE -DUNIT $< -o $(@F)
|
||||
|
||||
ztrtri_UN_single.$(PSUFFIX) : trtri_U_single.c
|
||||
$(CC) -c $(PFLAGS) -DCOMPLEX -DDOUBLE -UUNIT $< -o $(@F)
|
||||
|
||||
ztrtri_LU_single.$(PSUFFIX) : trtri_L_single.c
|
||||
$(CC) -c $(PFLAGS) -DCOMPLEX -DDOUBLE -DUNIT $< -o $(@F)
|
||||
|
||||
ztrtri_LN_single.$(PSUFFIX) : trtri_L_single.c
|
||||
$(CC) -c $(PFLAGS) -DCOMPLEX -DDOUBLE -UUNIT $< -o $(@F)
|
||||
|
||||
ztrtri_UU_parallel.$(PSUFFIX) : trtri_U_parallel.c
|
||||
$(CC) -c $(PFLAGS) -DCOMPLEX -DDOUBLE -DUNIT $< -o $(@F)
|
||||
|
||||
ztrtri_UN_parallel.$(PSUFFIX) : trtri_U_parallel.c
|
||||
$(CC) -c $(PFLAGS) -DCOMPLEX -DDOUBLE -UUNIT $< -o $(@F)
|
||||
|
||||
ztrtri_LU_parallel.$(PSUFFIX) : trtri_L_parallel.c
|
||||
$(CC) -c $(PFLAGS) -DCOMPLEX -DDOUBLE -DUNIT $< -o $(@F)
|
||||
|
||||
ztrtri_LN_parallel.$(PSUFFIX) : trtri_L_parallel.c
|
||||
$(CC) -c $(PFLAGS) -DCOMPLEX -DDOUBLE -UUNIT $< -o $(@F)
|
||||
|
||||
xtrtri_UU_single.$(PSUFFIX) : trtri_U_single.c
|
||||
$(CC) -c $(PFLAGS) -DCOMPLEX -DXDOUBLE -DUNIT $< -o $(@F)
|
||||
|
||||
xtrtri_UN_single.$(PSUFFIX) : trtri_U_single.c
|
||||
$(CC) -c $(PFLAGS) -DCOMPLEX -DXDOUBLE -UUNIT $< -o $(@F)
|
||||
|
||||
xtrtri_LU_single.$(PSUFFIX) : trtri_L_single.c
|
||||
$(CC) -c $(PFLAGS) -DCOMPLEX -DXDOUBLE -DUNIT $< -o $(@F)
|
||||
|
||||
xtrtri_LN_single.$(PSUFFIX) : trtri_L_single.c
|
||||
$(CC) -c $(PFLAGS) -DCOMPLEX -DXDOUBLE -UUNIT $< -o $(@F)
|
||||
|
||||
xtrtri_UU_parallel.$(PSUFFIX) : trtri_U_parallel.c
|
||||
$(CC) -c $(PFLAGS) -DCOMPLEX -DXDOUBLE -DUNIT $< -o $(@F)
|
||||
|
||||
xtrtri_UN_parallel.$(PSUFFIX) : trtri_U_parallel.c
|
||||
$(CC) -c $(PFLAGS) -DCOMPLEX -DXDOUBLE -UUNIT $< -o $(@F)
|
||||
|
||||
xtrtri_LU_parallel.$(PSUFFIX) : trtri_L_parallel.c
|
||||
$(CC) -c $(PFLAGS) -DCOMPLEX -DXDOUBLE -DUNIT $< -o $(@F)
|
||||
|
||||
xtrtri_LN_parallel.$(PSUFFIX) : trtri_L_parallel.c
|
||||
$(CC) -c $(PFLAGS) -DCOMPLEX -DXDOUBLE -UUNIT $< -o $(@F)
|
||||
|
||||
include ../../Makefile.tail
|
||||
@@ -0,0 +1,151 @@
|
||||
/*********************************************************************/
|
||||
/* 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"
|
||||
|
||||
#ifdef UNIT
|
||||
#define TRTI2 TRTI2_LU
|
||||
#define TRMM TRMM_LNLU
|
||||
#define TRSM TRSM_RNLU
|
||||
#else
|
||||
#define TRTI2 TRTI2_LN
|
||||
#define TRMM TRMM_LNLN
|
||||
#define TRSM TRSM_RNLN
|
||||
#endif
|
||||
|
||||
blasint CNAME(blas_arg_t *args, BLASLONG *range_m, BLASLONG *range_n, FLOAT *sa, FLOAT *sb, BLASLONG mypos) {
|
||||
|
||||
BLASLONG n, info;
|
||||
BLASLONG bk, i, blocking, start_i;
|
||||
int mode;
|
||||
BLASLONG lda, range_N[2];
|
||||
blas_arg_t newarg;
|
||||
FLOAT *a;
|
||||
FLOAT alpha[2] = { ONE, ZERO};
|
||||
FLOAT beta [2] = {-ONE, ZERO};
|
||||
|
||||
#ifndef COMPLEX
|
||||
#ifdef XDOUBLE
|
||||
mode = BLAS_XDOUBLE | BLAS_REAL;
|
||||
#elif defined(DOUBLE)
|
||||
mode = BLAS_DOUBLE | BLAS_REAL;
|
||||
#else
|
||||
mode = BLAS_SINGLE | BLAS_REAL;
|
||||
#endif
|
||||
#else
|
||||
#ifdef XDOUBLE
|
||||
mode = BLAS_XDOUBLE | BLAS_COMPLEX;
|
||||
#elif defined(DOUBLE)
|
||||
mode = BLAS_DOUBLE | BLAS_COMPLEX;
|
||||
#else
|
||||
mode = BLAS_SINGLE | BLAS_COMPLEX;
|
||||
#endif
|
||||
#endif
|
||||
|
||||
n = args -> n;
|
||||
a = (FLOAT *)args -> a;
|
||||
lda = args -> lda;
|
||||
|
||||
if (range_n) n = range_n[1] - range_n[0];
|
||||
|
||||
if (n <= DTB_ENTRIES) {
|
||||
info = TRTI2(args, NULL, range_n, sa, sb, 0);
|
||||
return info;
|
||||
}
|
||||
|
||||
blocking = GEMM_Q;
|
||||
if (n < 4 * GEMM_Q) blocking = (n + 3) / 4;
|
||||
|
||||
start_i = 0;
|
||||
while (start_i < n) start_i += blocking;
|
||||
start_i -= blocking;
|
||||
|
||||
for (i = start_i; i >= 0; i -= blocking) {
|
||||
bk = n - i;
|
||||
if (bk > blocking) bk = blocking;
|
||||
|
||||
range_N[0] = i;
|
||||
range_N[1] = i + bk;
|
||||
|
||||
newarg.lda = lda;
|
||||
newarg.ldb = lda;
|
||||
newarg.ldc = lda;
|
||||
newarg.alpha = alpha;
|
||||
|
||||
newarg.m = n - bk - i;
|
||||
newarg.n = bk;
|
||||
newarg.a = a + ( i + i * lda) * COMPSIZE;
|
||||
newarg.b = a + ((i + bk) + i * lda) * COMPSIZE;
|
||||
|
||||
newarg.beta = beta;
|
||||
newarg.nthreads = args -> nthreads;
|
||||
|
||||
gemm_thread_m(mode, &newarg, NULL, NULL, TRSM, sa, sb, args -> nthreads);
|
||||
|
||||
newarg.m = bk;
|
||||
newarg.n = bk;
|
||||
|
||||
newarg.a = a + (i + i * lda) * COMPSIZE;
|
||||
|
||||
CNAME (&newarg, NULL, NULL, sa, sb, 0);
|
||||
|
||||
newarg.m = n - bk - i;
|
||||
newarg.n = i;
|
||||
newarg.k = bk;
|
||||
|
||||
newarg.a = a + (i + bk + i * lda) * COMPSIZE;
|
||||
newarg.b = a + (i ) * COMPSIZE;
|
||||
newarg.c = a + (i + bk ) * COMPSIZE;
|
||||
|
||||
newarg.beta = NULL;
|
||||
|
||||
gemm_thread_n(mode, &newarg, NULL, NULL, GEMM_NN, sa, sb, args -> nthreads);
|
||||
|
||||
newarg.a = a + (i + i * lda) * COMPSIZE;
|
||||
newarg.b = a + (i ) * COMPSIZE;
|
||||
|
||||
newarg.m = bk;
|
||||
newarg.n = i;
|
||||
|
||||
gemm_thread_n(mode, &newarg, NULL, NULL, TRMM, sa, sb, args -> nthreads);
|
||||
}
|
||||
|
||||
|
||||
return 0;
|
||||
}
|
||||
@@ -0,0 +1,190 @@
|
||||
/*********************************************************************/
|
||||
/* 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"
|
||||
|
||||
static FLOAT dp1 = 1.;
|
||||
static FLOAT dm1 = -1.;
|
||||
|
||||
#ifdef UNIT
|
||||
#define TRTI2 TRTI2_LU
|
||||
#else
|
||||
#define TRTI2 TRTI2_LN
|
||||
#endif
|
||||
|
||||
#if 0
|
||||
#undef GEMM_P
|
||||
#undef GEMM_Q
|
||||
#undef GEMM_R
|
||||
|
||||
#define GEMM_P 8
|
||||
#define GEMM_Q 20
|
||||
#define GEMM_R 64
|
||||
#endif
|
||||
|
||||
#define GEMM_PQ MAX(GEMM_P, GEMM_Q)
|
||||
#define REAL_GEMM_R (GEMM_R - 2 * GEMM_PQ)
|
||||
|
||||
blasint CNAME(blas_arg_t *args, BLASLONG *range_m, BLASLONG *range_n, FLOAT *sa, FLOAT *sb, BLASLONG myid) {
|
||||
|
||||
BLASLONG n, lda;
|
||||
FLOAT *a;
|
||||
|
||||
BLASLONG i, is, min_i, start_i;
|
||||
BLASLONG ls, min_l;
|
||||
BLASLONG bk;
|
||||
BLASLONG blocking;
|
||||
BLASLONG range_N[2];
|
||||
|
||||
FLOAT *sa_trsm = (FLOAT *)((BLASLONG)sb);
|
||||
FLOAT *sa_trmm = (FLOAT *)((((BLASLONG)sb
|
||||
+ GEMM_PQ * GEMM_Q * COMPSIZE * SIZE + GEMM_ALIGN) & ~GEMM_ALIGN)
|
||||
+ GEMM_OFFSET_A);
|
||||
FLOAT *sb_gemm = (FLOAT *)((((BLASLONG)sa_trmm
|
||||
+ GEMM_PQ * GEMM_Q * COMPSIZE * SIZE + GEMM_ALIGN) & ~GEMM_ALIGN)
|
||||
+ GEMM_OFFSET_B);
|
||||
|
||||
n = args -> n;
|
||||
a = (FLOAT *)args -> a;
|
||||
lda = args -> lda;
|
||||
|
||||
if (range_n) {
|
||||
n = range_n[1] - range_n[0];
|
||||
a += range_n[0] * (lda + 1) * COMPSIZE;
|
||||
}
|
||||
|
||||
if (n <= DTB_ENTRIES) {
|
||||
TRTI2(args, NULL, range_n, sa, sb, 0);
|
||||
return 0;
|
||||
}
|
||||
|
||||
blocking = GEMM_Q;
|
||||
if (n <= 4 * GEMM_Q) blocking = (n + 3) / 4;
|
||||
|
||||
start_i = 0;
|
||||
while (start_i < n) start_i += blocking;
|
||||
start_i -= blocking;
|
||||
|
||||
for (i = start_i; i >= 0; i -= blocking) {
|
||||
bk = MIN(blocking, n - i);
|
||||
|
||||
if (n - bk - i > 0) TRSM_OLNCOPY(bk, bk, a + (i + i * lda) * COMPSIZE, lda, 0, sa_trsm);
|
||||
|
||||
if (!range_n) {
|
||||
range_N[0] = i;
|
||||
range_N[1] = i + bk;
|
||||
} else {
|
||||
range_N[0] = range_n[0] + i;
|
||||
range_N[1] = range_n[0] + i + bk;
|
||||
}
|
||||
|
||||
CNAME(args, NULL, range_N, sa, sa_trmm, 0);
|
||||
|
||||
if (i > 0) {
|
||||
TRMM_ILTCOPY(bk, bk, a + (i + i * lda) * COMPSIZE, lda, 0, 0, sa_trmm);
|
||||
|
||||
for (ls = 0; ls < i; ls += REAL_GEMM_R) {
|
||||
min_l = i - ls;
|
||||
if (min_l > REAL_GEMM_R) min_l = REAL_GEMM_R;
|
||||
|
||||
GEMM_ONCOPY (bk, min_l, a + (i + ls * lda) * COMPSIZE, lda, sb_gemm);
|
||||
|
||||
if (n - bk - i > 0) {
|
||||
for (is = i + bk; is < n; is += GEMM_P) {
|
||||
min_i = n - is;
|
||||
if (min_i > GEMM_P) min_i = GEMM_P;
|
||||
|
||||
if (ls == 0) {
|
||||
NEG_TCOPY (bk, min_i, a + (is + i * lda) * COMPSIZE, lda, sa);
|
||||
|
||||
TRSM_KERNEL_RT(min_i, bk, bk, dm1,
|
||||
#ifdef COMPLEX
|
||||
ZERO,
|
||||
#endif
|
||||
sa, sa_trsm,
|
||||
a + (is + i * lda) * COMPSIZE, lda, 0);
|
||||
} else {
|
||||
GEMM_ITCOPY (bk, min_i, a + (is + i * lda) * COMPSIZE, lda, sa);
|
||||
}
|
||||
|
||||
GEMM_KERNEL_N(min_i, min_l, bk, dp1,
|
||||
#ifdef COMPLEX
|
||||
ZERO,
|
||||
#endif
|
||||
sa, sb_gemm,
|
||||
a + (is + ls * lda) * COMPSIZE, lda);
|
||||
}
|
||||
}
|
||||
|
||||
for (is = 0; is < bk; is += GEMM_P) {
|
||||
min_i = bk - is;
|
||||
if (min_i > GEMM_P) min_i = GEMM_P;
|
||||
|
||||
TRMM_KERNEL_LT(min_i, min_l, bk, dp1,
|
||||
#ifdef COMPLEX
|
||||
ZERO,
|
||||
#endif
|
||||
sa_trmm + is * bk * COMPSIZE, sb_gemm,
|
||||
a + (i + is + ls * lda) * COMPSIZE, lda, is);
|
||||
}
|
||||
}
|
||||
|
||||
} else {
|
||||
|
||||
if (n - bk - i > 0) {
|
||||
for (is = 0; is < n - bk - i; is += GEMM_P) {
|
||||
min_i = n - bk - i - is;
|
||||
if (min_i > GEMM_P) min_i = GEMM_P;
|
||||
|
||||
NEG_TCOPY (bk, min_i, a + (i + bk + is + i * lda) * COMPSIZE, lda, sa);
|
||||
|
||||
TRSM_KERNEL_RT(min_i, bk, bk, dm1,
|
||||
#ifdef COMPLEX
|
||||
ZERO,
|
||||
#endif
|
||||
sa, sa_trsm,
|
||||
a + (i + bk + is + i * lda) * COMPSIZE, lda, 0);
|
||||
}
|
||||
}
|
||||
|
||||
}
|
||||
}
|
||||
|
||||
return 0;
|
||||
}
|
||||
@@ -0,0 +1,147 @@
|
||||
/*********************************************************************/
|
||||
/* 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"
|
||||
|
||||
#ifdef UNIT
|
||||
#define TRTI2 TRTI2_UU
|
||||
#define TRMM TRMM_LNUU
|
||||
#define TRSM TRSM_RNUU
|
||||
#else
|
||||
#define TRTI2 TRTI2_UN
|
||||
#define TRMM TRMM_LNUN
|
||||
#define TRSM TRSM_RNUN
|
||||
#endif
|
||||
|
||||
blasint CNAME(blas_arg_t *args, BLASLONG *range_m, BLASLONG *range_n, FLOAT *sa, FLOAT *sb, BLASLONG mypos) {
|
||||
|
||||
BLASLONG n, info;
|
||||
BLASLONG bk, i, blocking;
|
||||
int mode;
|
||||
BLASLONG lda, range_N[2];
|
||||
blas_arg_t newarg;
|
||||
FLOAT *a;
|
||||
FLOAT alpha[2] = { ONE, ZERO};
|
||||
FLOAT beta [2] = {-ONE, ZERO};
|
||||
|
||||
#ifndef COMPLEX
|
||||
#ifdef XDOUBLE
|
||||
mode = BLAS_XDOUBLE | BLAS_REAL;
|
||||
#elif defined(DOUBLE)
|
||||
mode = BLAS_DOUBLE | BLAS_REAL;
|
||||
#else
|
||||
mode = BLAS_SINGLE | BLAS_REAL;
|
||||
#endif
|
||||
#else
|
||||
#ifdef XDOUBLE
|
||||
mode = BLAS_XDOUBLE | BLAS_COMPLEX;
|
||||
#elif defined(DOUBLE)
|
||||
mode = BLAS_DOUBLE | BLAS_COMPLEX;
|
||||
#else
|
||||
mode = BLAS_SINGLE | BLAS_COMPLEX;
|
||||
#endif
|
||||
#endif
|
||||
|
||||
n = args -> n;
|
||||
a = (FLOAT *)args -> a;
|
||||
lda = args -> lda;
|
||||
|
||||
if (range_n) n = range_n[1] - range_n[0];
|
||||
|
||||
if (n <= DTB_ENTRIES) {
|
||||
info = TRTI2(args, NULL, range_n, sa, sb, 0);
|
||||
return info;
|
||||
}
|
||||
|
||||
blocking = GEMM_Q;
|
||||
if (n < 4 * GEMM_Q) blocking = (n + 3) / 4;
|
||||
|
||||
for (i = 0; i < n; i += blocking) {
|
||||
bk = n - i;
|
||||
if (bk > blocking) bk = blocking;
|
||||
|
||||
range_N[0] = i;
|
||||
range_N[1] = i + bk;
|
||||
|
||||
newarg.lda = lda;
|
||||
newarg.ldb = lda;
|
||||
newarg.ldc = lda;
|
||||
newarg.alpha = alpha;
|
||||
|
||||
newarg.m = i;
|
||||
newarg.n = bk;
|
||||
newarg.a = a + (i + i * lda) * COMPSIZE;
|
||||
newarg.b = a + ( i * lda) * COMPSIZE;
|
||||
|
||||
newarg.beta = beta;
|
||||
newarg.nthreads = args -> nthreads;
|
||||
|
||||
gemm_thread_m(mode, &newarg, NULL, NULL, TRSM, sa, sb, args -> nthreads);
|
||||
|
||||
newarg.m = bk;
|
||||
newarg.n = bk;
|
||||
|
||||
newarg.a = a + (i + i * lda) * COMPSIZE;
|
||||
|
||||
CNAME (&newarg, NULL, NULL, sa, sb, 0);
|
||||
|
||||
newarg.m = i;
|
||||
newarg.n = n - i - bk;
|
||||
newarg.k = bk;
|
||||
|
||||
newarg.a = a + ( i * lda) * COMPSIZE;
|
||||
newarg.b = a + (i + (i + bk) * lda) * COMPSIZE;
|
||||
newarg.c = a + ( (i + bk) * lda) * COMPSIZE;
|
||||
|
||||
newarg.beta = NULL;
|
||||
|
||||
gemm_thread_n(mode, &newarg, NULL, NULL, GEMM_NN, sa, sb, args -> nthreads);
|
||||
|
||||
newarg.a = a + (i + i * lda) * COMPSIZE;
|
||||
newarg.b = a + (i + (i + bk) * lda) * COMPSIZE;
|
||||
|
||||
newarg.m = bk;
|
||||
newarg.n = n - i - bk;
|
||||
|
||||
gemm_thread_n(mode, &newarg, NULL, NULL, TRMM, sa, sb, args -> nthreads);
|
||||
|
||||
}
|
||||
|
||||
return 0;
|
||||
}
|
||||
@@ -0,0 +1,188 @@
|
||||
/*********************************************************************/
|
||||
/* 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"
|
||||
|
||||
static FLOAT dp1 = 1.;
|
||||
static FLOAT dm1 = -1.;
|
||||
|
||||
#ifdef UNIT
|
||||
#define TRTI2 TRTI2_UU
|
||||
#else
|
||||
#define TRTI2 TRTI2_UN
|
||||
#endif
|
||||
|
||||
#if 0
|
||||
#undef GEMM_P
|
||||
#undef GEMM_Q
|
||||
#undef GEMM_R
|
||||
|
||||
#define GEMM_P 8
|
||||
#define GEMM_Q 20
|
||||
#define GEMM_R 64
|
||||
#endif
|
||||
|
||||
#define GEMM_PQ MAX(GEMM_P, GEMM_Q)
|
||||
#define REAL_GEMM_R (GEMM_R - 2 * GEMM_PQ)
|
||||
|
||||
blasint CNAME(blas_arg_t *args, BLASLONG *range_m, BLASLONG *range_n, FLOAT *sa, FLOAT *sb, BLASLONG myid) {
|
||||
|
||||
BLASLONG n, lda;
|
||||
FLOAT *a;
|
||||
|
||||
BLASLONG i, is, min_i, start_is;
|
||||
BLASLONG ls, min_l;
|
||||
BLASLONG bk;
|
||||
BLASLONG blocking;
|
||||
BLASLONG range_N[2];
|
||||
|
||||
FLOAT *sa_trsm = (FLOAT *)((BLASLONG)sb);
|
||||
FLOAT *sa_trmm = (FLOAT *)((((BLASLONG)sb
|
||||
+ GEMM_PQ * GEMM_Q * COMPSIZE * SIZE + GEMM_ALIGN) & ~GEMM_ALIGN)
|
||||
+ GEMM_OFFSET_A);
|
||||
FLOAT *sb_gemm = (FLOAT *)((((BLASLONG)sa_trmm
|
||||
+ GEMM_PQ * GEMM_Q * COMPSIZE * SIZE + GEMM_ALIGN) & ~GEMM_ALIGN)
|
||||
+ GEMM_OFFSET_B);
|
||||
|
||||
n = args -> n;
|
||||
a = (FLOAT *)args -> a;
|
||||
lda = args -> lda;
|
||||
|
||||
if (range_n) {
|
||||
n = range_n[1] - range_n[0];
|
||||
a += range_n[0] * (lda + 1) * COMPSIZE;
|
||||
}
|
||||
|
||||
if (n <= DTB_ENTRIES) {
|
||||
TRTI2(args, NULL, range_n, sa, sb, 0);
|
||||
return 0;
|
||||
}
|
||||
|
||||
blocking = GEMM_Q;
|
||||
if (n <= 4 * GEMM_Q) blocking = (n + 3) / 4;
|
||||
|
||||
for (i = 0; i < n; i += blocking) {
|
||||
bk = MIN(blocking, n - i);
|
||||
|
||||
if (i > 0) TRSM_OUNCOPY(bk, bk, a + (i + i * lda) * COMPSIZE, lda, 0, sa_trsm);
|
||||
|
||||
if (!range_n) {
|
||||
range_N[0] = i;
|
||||
range_N[1] = i + bk;
|
||||
} else {
|
||||
range_N[0] = range_n[0] + i;
|
||||
range_N[1] = range_n[0] + i + bk;
|
||||
}
|
||||
|
||||
CNAME(args, NULL, range_N, sa, sa_trmm, 0);
|
||||
|
||||
if (n -bk - i > 0) {
|
||||
TRMM_IUTCOPY(bk, bk, a + (i + i * lda) * COMPSIZE, lda, 0, 0, sa_trmm);
|
||||
|
||||
for (ls = i + bk; ls < n; ls += REAL_GEMM_R) {
|
||||
min_l = n - ls;
|
||||
if (min_l > REAL_GEMM_R) min_l = REAL_GEMM_R;
|
||||
|
||||
GEMM_ONCOPY (bk, min_l, a + (i + ls * lda) * COMPSIZE, lda, sb_gemm);
|
||||
|
||||
if (i > 0) {
|
||||
for (is = 0; is < i; is += GEMM_P) {
|
||||
min_i = i - is;
|
||||
if (min_i > GEMM_P) min_i = GEMM_P;
|
||||
|
||||
if (ls == i + bk) {
|
||||
NEG_TCOPY (bk, min_i, a + (is + i * lda) * COMPSIZE, lda, sa);
|
||||
|
||||
TRSM_KERNEL_RN(min_i, bk, bk, dm1,
|
||||
#ifdef COMPLEX
|
||||
ZERO,
|
||||
#endif
|
||||
sa, sa_trsm,
|
||||
a + (is + i * lda) * COMPSIZE, lda, 0);
|
||||
} else {
|
||||
GEMM_ITCOPY (bk, min_i, a + (is + i * lda) * COMPSIZE, lda, sa);
|
||||
}
|
||||
|
||||
GEMM_KERNEL_N(min_i, min_l, bk, dp1,
|
||||
#ifdef COMPLEX
|
||||
ZERO,
|
||||
#endif
|
||||
sa, sb_gemm,
|
||||
a + (is + ls * lda) * COMPSIZE, lda);
|
||||
}
|
||||
}
|
||||
|
||||
start_is = 0;
|
||||
while (start_is < bk) start_is += GEMM_P;
|
||||
start_is -= GEMM_P;
|
||||
|
||||
for (is = 0; is < bk; is += GEMM_P) {
|
||||
min_i = bk - is;
|
||||
if (min_i > GEMM_P) min_i = GEMM_P;
|
||||
|
||||
TRMM_KERNEL_LN(min_i, min_l, bk, dp1,
|
||||
#ifdef COMPLEX
|
||||
ZERO,
|
||||
#endif
|
||||
sa_trmm + is * bk * COMPSIZE, sb_gemm,
|
||||
a + (i + is + ls * lda) * COMPSIZE, lda, is);
|
||||
}
|
||||
}
|
||||
|
||||
} else {
|
||||
if (i > 0) {
|
||||
for (is = 0; is < i; is += GEMM_P) {
|
||||
min_i = i - is;
|
||||
if (min_i > GEMM_P) min_i = GEMM_P;
|
||||
|
||||
NEG_TCOPY (bk, min_i, a + (is + i * lda) * COMPSIZE, lda, sa);
|
||||
|
||||
TRSM_KERNEL_RN(min_i, bk, bk, dm1,
|
||||
#ifdef COMPLEX
|
||||
ZERO,
|
||||
#endif
|
||||
sa, sa_trsm,
|
||||
a + (is + i * lda) * COMPSIZE, lda, 0);
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
return 0;
|
||||
}
|
||||
Reference in New Issue
Block a user