1
/* ---------------------------------------------------------------------
3
* -- Automatically Tuned Linear Algebra Software (ATLAS)
4
* (C) Copyright 2000 All Rights Reserved
6
* -- ATLAS routine -- Version 3.0 -- April 1, 2000
8
* -- Suggestions, comments, bugs reports should be sent to the follo-
9
* wing e-mail address: atlas@cs.utk.edu
11
* Author : Antoine P. Petitet
12
* University of Tennessee - Innovative Computing Laboratory
13
* Knoxville TN, 37996-1301, USA.
15
* ---------------------------------------------------------------------
17
* -- Copyright notice and Licensing terms:
19
* Redistribution and use in source and binary forms, with or without
20
* modification, are permitted provided that the following conditions
23
* 1. Redistributions of source code must retain the above copyright
24
* notice, this list of conditions and the following disclaimer.
25
* 2. Redistributions in binary form must reproduce the above copyright
26
* notice, this list of conditions, and the following disclaimer in
27
* the documentation and/or other materials provided with the distri-
29
* 3. The name of the University, the ATLAS group, or the names of its
30
* contributors may not be used to endorse or promote products deri-
31
* ved from this software without specific written permission.
35
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
36
* ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
37
* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
38
* A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE UNIVERSITY
39
* OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPE-
40
* CIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED
41
* TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA,
42
* OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEO-
43
* RY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (IN-
44
* CLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
45
* THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
47
* ---------------------------------------------------------------------
52
#include "atlas_misc.h"
55
#include "atlas_level1.h"
56
#include "atlas_kernel2.h"
57
#include "atlas_reflvl2.h"
58
#include "atlas_lvl2.h"
60
void Mjoin( PATL, spr2U )
73
* Mjoin( PATL, spr2U ) performs the symmetric rank 2 operation
75
* A := alpha * x * y' + alpha * y * x' + A,
77
* where alpha is a scalar, x and y are n-element vectors and A is an n
78
* by n symmetric matrix, supplied in packed form.
80
* This is a recursive version of the algorithm. For a more detailed
81
* description of the arguments of this function, see the reference im-
82
* plementation in the ATLAS/src/blas/reference directory.
84
* ---------------------------------------------------------------------
87
* .. Local Variables ..
92
const TYPE one[2] = { ATL_rone, ATL_rzero };
94
TYPE * A0, * x0, * y0;
95
int j, jb, jbs, lda = LDA, m, mb, nb;
97
#define gpr Mjoin( PATL, gpr1U_a1_x1_yX )
99
#define gpr Mjoin( PATL, gpr1uU_a1_x1_yX )
102
* .. Executable Statements ..
105
ATL_GetPartP1( A, N, mb, nb );
107
MUpnext( N, A, lda );
108
x0 = (TYPE *)(X); X += (N SHIFT); y0 = (TYPE *)(Y); Y += (N SHIFT);
110
for( j = 0; j < N; j += nb )
112
jb = N - j; jb = Mmin( jb, nb ); jbs = (jb SHIFT);
113
MUpprev( jb, A, lda ); X -= jbs; Y -= jbs;
115
if( ( m = N-j-jb ) != 0 )
117
A0 = (TYPE *)(A) - (m SHIFT);
118
gpr( m, jb, one, x0, 1, Y, 1, A0, lda );
119
gpr( m, jb, one, y0, 1, X, 1, A0, lda );
121
Mjoin( PATL, refspr2U )( jb, one, X, 1, Y, 1, A, lda );
124
* End of Mjoin( PATL, spr2U )