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 <ctype.h>
41 #include "common.h"
42
43 // const static FLOAT dp1 = 1.;
44
CNAME(BLASLONG n,BLASLONG k,FLOAT * a,BLASLONG lda,FLOAT * b,BLASLONG incb,void * buffer)45 int CNAME(BLASLONG n, BLASLONG k, FLOAT *a, BLASLONG lda, FLOAT *b, BLASLONG incb, void *buffer){
46
47 BLASLONG i;
48 FLOAT *B = b;
49 BLASLONG length;
50 #if (TRANSA == 2) || (TRANSA == 4)
51 OPENBLAS_COMPLEX_FLOAT temp;
52 #endif
53 #ifndef UNIT
54 FLOAT atemp1, atemp2, btemp1, btemp2;
55 #endif
56
57 if (incb != 1) {
58 B = buffer;
59 COPY_K(n, b, incb, buffer, 1);
60 }
61
62 for (i = 0; i < n; i++) {
63
64 #if (TRANSA == 1) || (TRANSA == 3)
65 length = i;
66 if (length > k) length = k;
67
68 if (length > 0) {
69 #if TRANSA == 1
70 AXPYU_K(length, 0, 0,
71 B[i * 2 + 0], B[i * 2 + 1],
72 a + (k - length) * COMPSIZE, 1, B + (i - length) * COMPSIZE, 1, NULL, 0);
73 #else
74 AXPYC_K(length, 0, 0,
75 B[i * 2 + 0], B[i * 2 + 1],
76 a + (k - length) * COMPSIZE, 1, B + (i - length) * COMPSIZE, 1, NULL, 0);
77 #endif
78
79 }
80 #endif
81
82 #ifndef UNIT
83 #if (TRANSA == 1) || (TRANSA == 3)
84 atemp1 = a[k * 2 + 0];
85 atemp2 = a[k * 2 + 1];
86 #else
87 atemp1 = a[0];
88 atemp2 = a[1];
89 #endif
90
91 btemp1 = B[i * 2 + 0];
92 btemp2 = B[i * 2 + 1];
93
94 #if (TRANSA == 1) || (TRANSA == 2)
95 B[i * 2 + 0] = atemp1 * btemp1 - atemp2 * btemp2;
96 B[i * 2 + 1] = atemp1 * btemp2 + atemp2 * btemp1;
97 #else
98 B[i * 2 + 0] = atemp1 * btemp1 + atemp2 * btemp2;
99 B[i * 2 + 1] = atemp1 * btemp2 - atemp2 * btemp1;
100 #endif
101 #endif
102
103 #if (TRANSA == 2) || (TRANSA == 4)
104 length = n - i - 1;
105 if (length > k) length = k;
106
107 if (length > 0) {
108 #if TRANSA == 2
109 temp = DOTU_K(length, a + COMPSIZE, 1, B + (i + 1) * COMPSIZE, 1);
110 #else
111 temp = DOTC_K(length, a + COMPSIZE, 1, B + (i + 1) * COMPSIZE, 1);
112 #endif
113
114 B[i * 2 + 0] += CREAL(temp);
115 B[i * 2 + 1] += CIMAG(temp);
116 }
117 #endif
118
119 a += lda * COMPSIZE;
120 }
121
122 if (incb != 1) {
123 COPY_K(n, buffer, 1, b, incb);
124 }
125
126 return 0;
127 }
128
129