1 /*********************************************************************/
2 /* Copyright 2009, 2010 The University of Texas at Austin. */
3 /* All rights reserved. */
5 /* Redistribution and use in source and binary forms, with or */
6 /* without modification, are permitted provided that the following */
7 /* conditions are met: */
9 /* 1. Redistributions of source code must retain the above */
10 /* copyright notice, this list of conditions and the following */
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. */
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. */
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 /*********************************************************************/
47 int CNAME(BLASLONG n, BLASLONG k1, BLASLONG k2, FLOAT *a, BLASLONG lda, blasint *ipiv, FLOAT *buffer){
49 BLASLONG i, j, ip1, ip2;
51 FLOAT *a1, *a3, *a5, *a7;
52 FLOAT *b1, *b2, *b3, *b4;
53 FLOAT *b5, *b6, *b7, *b8;
54 FLOAT A1, A2, A3, A4, A5, A6, A7, A8;
55 FLOAT B1, B2, B3, B4, B5, B6, B7, B8;
57 FLOAT A9, A10, A11, A12, A13, A14, A15, A16;
58 FLOAT B9, B10, B11, B12, B13, B14, B15, B16;
73 a1 = a + (k1 + 1) * 2;
131 ip1 = *(piv + 0) * 2;
132 ip2 = *(piv + 1) * 2;
149 *(buffer + 11) = A12;
151 *(buffer + 13) = A14;
153 *(buffer + 15) = A16;
167 *(buffer + 11) = B12;
169 *(buffer + 13) = B14;
171 *(buffer + 15) = B16;
196 *(buffer + 11) = A11;
198 *(buffer + 13) = A13;
200 *(buffer + 15) = A15;
214 *(buffer + 11) = B12;
216 *(buffer + 13) = B14;
218 *(buffer + 15) = B16;
242 *(buffer + 11) = A12;
244 *(buffer + 13) = A14;
246 *(buffer + 15) = A16;
269 *(buffer + 11) = A11;
271 *(buffer + 13) = A13;
273 *(buffer + 15) = A15;
295 *(buffer + 11) = B12;
297 *(buffer + 13) = B14;
299 *(buffer + 15) = B16;
401 a1 = a + (k1 + 1) * 2;
404 ip1 = *(piv + 0) * 2;
405 ip2 = *(piv + 1) * 2;
414 i = ((k2 - k1) >> 1);
436 ip1 = *(piv + 0) * 2;
437 ip2 = *(piv + 1) * 2;
595 a1 = a + (k1 + 1) * 2;
597 ip1 = *(piv + 0) * 2;
598 ip2 = *(piv + 1) * 2;
604 i = ((k2 - k1) >> 1);
617 ip1 = *(piv + 0) * 2;
618 ip2 = *(piv + 1) * 2;