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 #ifndef KERNEL_FUNC
43 #ifndef LOWER
44 #define KERNEL_FUNC SYR2K_KERNEL_U
45 #else
46 #define KERNEL_FUNC SYR2K_KERNEL_L
47 #endif
48 #endif
49
syrk_beta(BLASLONG m_from,BLASLONG m_to,BLASLONG n_from,BLASLONG n_to,FLOAT * alpha,FLOAT * c,BLASLONG ldc)50 static inline int syrk_beta(BLASLONG m_from, BLASLONG m_to, BLASLONG n_from, BLASLONG n_to, FLOAT *alpha, FLOAT *c, BLASLONG ldc) {
51
52 BLASLONG i;
53
54 #ifndef LOWER
55 if (m_from > n_from) n_from = m_from;
56 if (m_to > n_to ) m_to = n_to;
57 #else
58 if (m_from < n_from) m_from = n_from;
59 if (m_to < n_to ) n_to = m_to;
60 #endif
61
62 c += (m_from + n_from * ldc) * COMPSIZE;
63
64 m_to -= m_from;
65 n_to -= n_from;
66
67 for (i = 0; i < n_to; i++){
68
69 #ifndef LOWER
70
71 SCAL_K(MIN(i + n_from - m_from + 1, m_to), 0, 0, alpha[0],
72 #ifdef COMPLEX
73 alpha[1],
74 #endif
75 c, 1, NULL, 0, NULL, 0);
76
77 c += ldc * COMPSIZE;
78
79 #else
80
81 SCAL_K(MIN(m_to - i + m_from - n_from, m_to), 0, 0, alpha[0],
82 #ifdef COMPLEX
83 alpha[1],
84 #endif
85 c, 1, NULL, 0, NULL, 0);
86
87 if (i < m_from - n_from) {
88 c += ldc * COMPSIZE;
89 } else {
90 c += (1 + ldc) * COMPSIZE;
91 }
92 #endif
93
94 }
95
96 return 0;
97 }
98
99 #ifdef THREADED_LEVEL3
100 #include "level3_syr2k_threaded.c"
101 #else
102 #include "level3_syr2k.c"
103 #endif
104