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
42 #ifdef UNIT
43 #define ZTRMV ZTRMV_NUU
44 #else
45 #define ZTRMV ZTRMV_NUN
46 #endif
47
CNAME(blas_arg_t * args,BLASLONG * range_m,BLASLONG * range_n,FLOAT * sa,FLOAT * sb,BLASLONG myid)48 blasint CNAME(blas_arg_t *args, BLASLONG *range_m, BLASLONG *range_n, FLOAT *sa, FLOAT *sb, BLASLONG myid) {
49
50 BLASLONG n, lda;
51 FLOAT *a;
52
53 FLOAT ajj_r, ajj_i;
54 #ifndef UNIT
55 FLOAT ratio, den;
56 #endif
57 BLASLONG j;
58
59 n = args -> n;
60 a = (FLOAT *)args -> a;
61 lda = args -> lda;
62
63 if (range_n) {
64 n = range_n[1] - range_n[0];
65 a += range_n[0] * (lda + 1) * COMPSIZE;
66 }
67
68 for (j = 0; j < n; j++) {
69
70 ajj_r = ONE;
71 ajj_i = ZERO;
72
73 #ifndef UNIT
74 ajj_r = *(a + (j + j * lda) * COMPSIZE + 0);
75 ajj_i = *(a + (j + j * lda) * COMPSIZE + 1);
76
77
78 if (fabs(ajj_r) >= fabs(ajj_i)){
79 ratio = ajj_i / ajj_r;
80 den = 1. / (ajj_r * ( 1 + ratio * ratio));
81 ajj_r = den;
82 ajj_i = -ratio * den;
83 } else {
84 ratio = ajj_r / ajj_i;
85 den = 1. /(ajj_i * ( 1 + ratio * ratio));
86 ajj_r = ratio * den;
87 ajj_i = -den;
88 }
89
90 *(a + (j + j * lda) * COMPSIZE + 0) = ajj_r;
91 *(a + (j + j * lda) * COMPSIZE + 1) = ajj_i;
92 #endif
93
94 ZTRMV (j,
95 a , lda,
96 a + j * lda * COMPSIZE, 1,
97 sb);
98
99 SCAL_K(j, 0, 0,
100 -ajj_r, -ajj_i,
101 a + j * lda * COMPSIZE, 1,
102 NULL, 0, NULL, 0);
103
104 }
105
106 return 0;
107 }
108