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 
39 #include <stdio.h>
40 #include "common.h"
41 
inner_thread(blas_arg_t * args,BLASLONG * range_m,BLASLONG * range_n,FLOAT * sa,FLOAT * sb,BLASLONG mypos)42 static int inner_thread(blas_arg_t *args, BLASLONG *range_m, BLASLONG *range_n,
43 			 FLOAT *sa, FLOAT *sb, BLASLONG mypos) {
44 
45   BLASLONG n   = args -> n;
46   BLASLONG off = 0;
47 
48   if (range_n) {
49     n   = range_n[1] - range_n[0];
50     off = range_n[0];
51   }
52 
53 #ifndef TRANS
54   LASWP_PLUS(n, 1, args -> m, ZERO,
55 	     (FLOAT *)args -> b + off * args -> ldb * COMPSIZE, args -> ldb, NULL, 0, args -> c, 1);
56   TRSM_LNLU (args, range_m, range_n, sa, sb, 0);
57   TRSM_LNUN (args, range_m, range_n, sa, sb, 0);
58 #else
59   TRSM_LTUN  (args, range_m, range_n, sa, sb, 0);
60   TRSM_LTLU  (args, range_m, range_n, sa, sb, 0);
61   LASWP_MINUS(n, 1, args -> m, ZERO,
62 	      (FLOAT *)args -> b + off * args -> ldb * COMPSIZE, args -> ldb, NULL, 0, args -> c, -1);
63 #endif
64 
65   return 0;
66 }
67 
CNAME(blas_arg_t * args,BLASLONG * range_m,BLASLONG * range_n,FLOAT * sa,FLOAT * sb,BLASLONG mypos)68 blasint CNAME(blas_arg_t *args, BLASLONG *range_m, BLASLONG *range_n, FLOAT *sa, FLOAT *sb, BLASLONG mypos) {
69 
70   int mode;
71 
72 #ifndef TRANS
73     if (args -> n  == 1){
74       LASWP_PLUS(1, 1, args -> m, ZERO, args -> b, args -> ldb, NULL, 0, args -> c, 1);
75       TRSV_NLU (args -> m, args -> a, args -> lda, args -> b, 1, sb);
76       TRSV_NUN (args -> m, args -> a, args -> lda, args -> b, 1, sb);
77     } else {
78 #ifdef XDOUBLE
79       mode  =  BLAS_XDOUBLE | BLAS_REAL;
80 #elif defined(DOUBLE)
81       mode  =  BLAS_DOUBLE  | BLAS_REAL;
82 #else
83       mode  =  BLAS_SINGLE  | BLAS_REAL;
84 #endif
85 
86       gemm_thread_n(mode, args, NULL, NULL, inner_thread, sa, sb,  args -> nthreads);
87     }
88 #else
89     if (args -> n == 1){
90       TRSV_TUN (args -> m, args -> a, args -> lda, args -> b, 1, sb);
91       TRSV_TLU (args -> m, args -> a, args -> lda, args -> b, 1, sb);
92       LASWP_MINUS(1, 1, args -> m, ZERO, args -> b, args -> ldb, NULL, 0, args -> c, -1);
93     } else {
94 #ifdef XDOUBLE
95       mode  =  BLAS_XDOUBLE | BLAS_REAL | (1 << BLAS_TRANSA_SHIFT);
96 #elif defined(DOUBLE)
97       mode  =  BLAS_DOUBLE  | BLAS_REAL | (1 << BLAS_TRANSA_SHIFT);
98 #else
99       mode  =  BLAS_SINGLE  | BLAS_REAL | (1 << BLAS_TRANSA_SHIFT);
100 #endif
101 
102       gemm_thread_n(mode, args, NULL, NULL, inner_thread, sa, sb,  args -> nthreads);
103     }
104 #endif
105 
106     return 0;
107   }
108