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
CNAME(BLASLONG dummy1,BLASLONG n,BLASLONG dummy2,FLOAT alpha_r,FLOAT alpha_i,FLOAT * dummy3,BLASLONG dummy4,FLOAT * dummy5,BLASLONG dummy6,FLOAT * c,BLASLONG ldc,FLOAT * dummy7,FLOAT * dummy8,BLASLONG from,BLASLONG to)43 int CNAME(BLASLONG dummy1, BLASLONG n, BLASLONG dummy2, FLOAT alpha_r, FLOAT alpha_i,
44 FLOAT *dummy3, BLASLONG dummy4, FLOAT *dummy5, BLASLONG dummy6,
45 FLOAT *c, BLASLONG ldc,
46 FLOAT *dummy7, FLOAT *dummy8, BLASLONG from, BLASLONG to){
47
48 BLASLONG i;
49
50 #ifndef LOWER
51 for (i = from; i < to; i++){
52 SCAL_K(i * 2, 0, 0, alpha_r, c + i * ldc * 2, 1, NULL, 0, NULL, 0);
53 if (alpha_r == ZERO ){
54 c[i * 2 + 0 + i * ldc * 2] = ZERO;
55 c[i * 2 + 1 + i * ldc * 2] = ZERO;
56 } else {
57 c[i * 2 + 0 + i * ldc * 2] *= alpha_r;
58 c[i * 2 + 1 + i * ldc * 2] = ZERO;
59 }
60 }
61 #else
62 for (i = from; i < to; i++){
63 if (alpha_r == ZERO) {
64 c[i * 2 + 0 + i * ldc * 2] = ZERO;
65 c[i * 2 + 1 + i * ldc * 2] = ZERO;
66 } else {
67 c[i * 2 + 0 + i * ldc * 2] *= alpha_r;
68 c[i * 2 + 1 + i * ldc * 2] = ZERO;
69 }
70 SCAL_K((n - i - 1) * 2, 0, 0, alpha_r, c + 2 + i * (ldc + 1) * 2, 1, NULL, 0, NULL, 0);
71 }
72 #endif
73
74 return 0;
75 }
76