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
* Contributor(s) : R. Clint Whaley
13
* University of Tennessee - Innovative Computing Laboratory
14
* Knoxville TN, 37996-1301, USA.
16
* ---------------------------------------------------------------------
18
* -- Copyright notice and Licensing terms:
20
* Redistribution and use in source and binary forms, with or without
21
* modification, are permitted provided that the following conditions
24
* 1. Redistributions of source code must retain the above copyright
25
* notice, this list of conditions and the following disclaimer.
26
* 2. Redistributions in binary form must reproduce the above copyright
27
* notice, this list of conditions, and the following disclaimer in
28
* the documentation and/or other materials provided with the distri-
30
* 3. The name of the University, the ATLAS group, or the names of its
31
* contributors may not be used to endorse or promote products deri-
32
* ved from this software without specific written permission.
36
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
37
* ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
38
* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
39
* A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE UNIVERSITY
40
* OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPE-
41
* CIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED
42
* TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA,
43
* OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEO-
44
* RY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (IN-
45
* CLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
46
* THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
48
* ---------------------------------------------------------------------
53
#include "atlas_misc.h"
56
#include "atlas_level1.h"
57
#include "atlas_kernel2.h"
58
#include "atlas_reflvl2.h"
59
#include "atlas_lvl2.h"
61
void Mjoin( PATL, trmvLH )
63
const enum ATLAS_DIAG DIAG,
74
* Mjoin( PATL, trmvLH ) performs the following matrix-vector operation
76
* x := conjg( A' ) * x,
78
* where x is an n-element vector and A is an n by n unit or non-unit,
79
* lower triangular matrix.
81
* This is a blocked version of the algorithm. For a more detailed des-
82
* cription of the arguments of this function, see the reference imple-
83
* mentation in the ATLAS/src/blas/reference directory.
85
* ---------------------------------------------------------------------
88
* .. Local Variables ..
94
TYPE one[2] = { ATL_rone, ATL_rzero };
95
const int lda2 = ( LDA SHIFT );
98
int incA0, incA, incX, mb, mb1, n, nb;
99
void (*trmv0)( const int, const TYPE *, const int,
101
#define gemv0 Mjoin( PATL, gemvC_a1_x1_b1_y1 )
103
* .. Executable Statements ..
106
ATL_GetPartMVT( A, LDA, &mb, &nb );
108
if( DIAG == AtlasNonUnit ) trmv0 = Mjoin( PATL, trmvLHN );
109
else trmv0 = Mjoin( PATL, trmvLHU );
111
mb1 = N - ( ( N - 1 ) / mb ) * mb;
112
incA = ( incA0 = ( incX = (mb SHIFT) ) ) + mb * lda2;
114
trmv0( mb1, A, LDA, X );
115
A0 = (TYPE *)( A += (mb1 SHIFT) ); A += mb1 * lda2; X += (mb1 SHIFT);
117
for( n = mb1; n < N; n += mb, A0 += incA0, A += incA, X += incX )
119
gemv0( n, mb, one, A0, LDA, X, 1, one, x0, 1 );
120
trmv0( mb, A, LDA, X );
123
* End of Mjoin( PATL, trmvLH )