1
       2
       3
       4
       5
       6
       7
       8
       9
      10
      11
      12
      13
      14
      15
      16
      17
      18
      19
      20
      21
      22
      23
      24
      25
      26
      27
      28
      29
      30
      31
      32
      33
      34
      35
      36
      37
      38
      39
      40
      41
      42
      43
      44
      45
      46
      47
      48
      49
      50
      51
      52
      53
      54
      55
      56
      57
      58
      59
      60
      61
      62
      63
      64
      65
      66
      67
      68
      69
      70
      71
      72
      73
      74
      75
      76
      77
      78
      79
      80
      81
      82
      83
      84
      85
      86
      87
      88
      89
      90
      91
      92
      93
      94
      95
      96
      97
      98
      99
     100
     101
     102
     103
     104
     105
     106
     107
     108
     109
     110
     111
     112
     113
     114
     115
     116
     117
     118
     119
     120
     121
     122
     123
     124
     125
     126
     127
     128
     129
     130
     131
     132
     133
     134
     135
     136
     137
     138
     139
     140
     141
     142
     143
     144
     145
     146
     147
     148
     149
     150
     151
     152
     153
     154
     155
     156
     157
     158
     159
     160
     161
     162
     163
     164
     165
     166
     167
     168
     169
     170
     171
     172
     173
     174
     175
     176
     177
     178
     179
     180
     181
     182
     183
     184
     185
     186
     187
     188
     189
     190
     191
     192
     193
     194
     195
     196
     197
     198
     199
     200
     201
     202
     203
     204
     205
     206
     207
     208
     209
     210
     211
     212
     213
     214
     215
     216
     217
     218
     219
     220
     221
     222
     223
     224
     225
     226
     227
     228
     229
     230
     231
     232
     233
     234
     235
     236
     237
     238
     239
     240
     241
     242
     243
     244
     245
     246
     247
     248
     249
     250
     251
     252
     253
     254
     255
     256
     257
     258
     259
     260
     261
     262
     263
     264
     265
     266
     267
     268
     269
     270
     271
     272
     273
     274
     275
     276
     277
     278
     279
     280
     281
     282
     283
     284
     285
     286
     287
     288
     289
     290
     291
     292
     293
     294
     295
     296
     297
     298
     299
/*
 *   Copyright (c) 2010, Michael Lehn
 *
 *   All rights reserved.
 *
 *   Redistribution and use in source and binary forms, with or without
 *   modification, are permitted provided that the following conditions
 *   are met:
 *
 *   1) Redistributions of source code must retain the above copyright
 *      notice, this list of conditions and the following disclaimer.
 *   2) Redistributions in binary form must reproduce the above copyright
 *      notice, this list of conditions and the following disclaimer in
 *      the documentation and/or other materials provided with the
 *      distribution.
 *   3) Neither the name of the FLENS development group nor the names of
 *      its contributors may be used to endorse or promote products derived
 *      from this software without specific prior written permission.
 *
 *   THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
 *   "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
 *   LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
 *   A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
 *   OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
 *   SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
 *   LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
 *   DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
 *   THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
 *   (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
 *   OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 */

#ifndef CXXBLAS_LEVEL2_TPSV_TCC
#define CXXBLAS_LEVEL2_TPSV_TCC 1

#include <cxxblas/cxxblas.h>

namespace cxxblas {

template <typename IndexType, typename MA, typename VX>
void
tpsv_generic(StorageOrder order, StorageUpLo upLo,
             Transpose transA, Diag diag,
             IndexType n,
             const MA *A,
             VX *x, IndexType incX)
{
    if (order==ColMajor) {
        transA = Transpose(transA^Trans);
        upLo = (upLo==Upper) ? Lower : Upper;
        tpsv_generic(RowMajor, upLo, transA, diag, n, A, x, incX);
        return;
    }

    if (incX<0) {
        x -= incX*(n-1);
    }

    if (transA==NoTrans) {
        if (upLo==Upper) {
            if (diag==NonUnit) {
                for (IndexType i=n-1, iX=i*incX; i>=0; --i, iX-=incX) {
                    VX _x;
                    dotu_generic(n-1-i, A+i*(2*n-i+1)/2+1, IndexType(1),
                                        x+iX+incX, incX, _x);
                    x[iX] -= _x;
                    x[iX] /= *(A+i*(2*n-i+1)/2);
                }
            } else { /* diag==Unit */
                for (IndexType i=n-1, iX=i*incX; i>=0; --i, iX-=incX) {
                    VX _x;
                    dotu_generic(n-1-i, A+i*(2*n-i+1)/2+1, IndexType(1),
                                        x+iX+incX, incX, _x);
                    x[iX] -= _x;
                }
            }
        } else { /* upLo==Lower */
            if (diag==NonUnit) {
                for (IndexType i=0, iX=0; i<n; ++i, iX+=incX) {
                    VX _x;
                    dotu_generic(i, A+i*(i+1)/2, IndexType(1),
                                    x, incX, _x);
                    x[iX] -= _x;
                    x[iX] /= *(A+i*(i+3)/2);
                }
            } else { /* diag==Unit */
                for (IndexType i=1, iX=i*incX; i<n; ++i, iX+=incX) {
                    VX _x;
                    dotu_generic(i, A+i*(i+1)/2, IndexType(1),
                                    x, incX, _x);
                    x[iX] -= _x;
                }
            }
        }
    }
    if (transA==Conj) {
        if (upLo==Upper) {
            if (diag==NonUnit) {
                for (IndexType i=n-1, iX=i*incX; i>=0; --i, iX-=incX) {
                    VX _x;
                    dot_generic(n-1-i, A+i*(2*n-i+1)/2+1, IndexType(1),
                                       x+iX+incX, incX, _x);
                    x[iX] -= _x;
                    x[iX] /= conjugate(A[i*(2*n-i+1)/2]);
                }
            } else { /* diag==Unit */
                for (IndexType i=n-1, iX=i*incX; i>=0; --i, iX-=incX) {
                    VX _x;
                    dot_generic(n-1-i, A+i*(2*n-i+1)/2+1, IndexType(1),
                                       x+iX+incX, incX, _x);
                    x[iX] -= _x;
                }
            }
        } else { /* upLo==Lower */
            if (diag==NonUnit) {
                for (IndexType i=0, iX=0; i<n; ++i, iX+=incX) {
                    VX _x;
                    dot_generic(i, A+i*(i+1)/2, IndexType(1),
                                   x, incX, _x);
                    x[iX] -= _x;
                    x[iX] /= conjugate(A[i*(i+3)/2]);
                }
            } else { /* diag==Unit */
                for (IndexType i=1, iX=i*incX; i<n; ++i, iX+=incX) {
                    VX _x;
                    dot_generic(i, A+i*(i+1)/2, IndexType(1),
                                   x, incX, _x);
                    x[iX] -= _x;
                }
            }
        }
    }
    if (transA==Trans) {
        if (upLo==Upper) {
            if (diag==NonUnit) {
                for (IndexType i=0, iX=0; i<n; ++i, iX+=incX) {
                    x[iX] /= *(A+i*(2*n-i+1)/2);
                    axpy_generic(n-1-i, -x[iX], A+i*(2*n-i+1)/2+1, IndexType(1),
                                                x+iX+incX, incX);
                }
            } else { /* diag==Unit */
                for (IndexType i=0, iX=0; i<n-1; ++i, iX+=incX) {
                    axpy_generic(n-1-i, -x[iX], A+i*(2*n-i+1)/2+1, IndexType(1),
                                                x+iX+incX, incX);
                }
            }
        } else { /* upLo==Lower */
            if (diag==NonUnit) {
                for (IndexType i=n-1, iX=i*incX; i>=0; --i, iX-=incX) {
                    x[iX] /= *(A+i*(i+3)/2);
                    axpy_generic(i, -x[iX], A+i*(i+1)/2, IndexType(1),
                                            x, incX);
                }
            } else {
                for (IndexType i=n-1, iX=i*incX; i>0; --i, iX-=incX) {
                    axpy_generic(i, -x[iX], A+i*(i+1)/2, IndexType(1),
                                            x, incX);
                }
            }
        }
    }
    if (transA==ConjTrans) {
        if (upLo==Upper) {
            if (diag==NonUnit) {
                for (IndexType i=0, iX=0; i<n; ++i, iX+=incX) {
                    x[iX] /= conjugate(A[i*(2*n-i+1)/2]);
                    acxpy_generic(n-1-i, -x[iX], A+i*(2*n-i+1)/2+1, IndexType(1),
                                                 x+iX+incX, incX);
                }
            } else { /* diag==Unit */
                for (IndexType i=0, iX=0; i<n-1; ++i, iX+=incX) {
                    acxpy_generic(n-1-i, -x[iX], A+i*(2*n-i+1)/2+1, IndexType(1),
                                                 x+iX+incX, incX);
                }
            }
        } else { /* upLo==Lower */
            if (diag==NonUnit) {
                for (IndexType i=n-1, iX=i*incX; i>=0; --i, iX-=incX) {
                    x[iX] /= conjugate(A[i*(i+3)/2]);
                    acxpy_generic(i, -x[iX], A+i*(i+1)/2, IndexType(1),
                                             x, incX);
                }
            } else {
                for (IndexType i=n-1, iX=i*incX; i>0; --i, iX-=incX) {
                    acxpy_generic(i, -x[iX], A+i*(i+1)/2, IndexType(1),
                                             x, incX);
                }
            }
        }
    }
}

template <typename IndexType, typename MA, typename VX>
void
tpsv(StorageOrder order, StorageUpLo upLo,
     Transpose transA, Diag diag,
     IndexType n,
     const MA *A,
     VX *x, IndexType incX)
{
    CXXBLAS_DEBUG_OUT("tpsv_generic");

    tpsv_generic(order, upLo, transA, diag, n, A, x, incX);
}


#ifdef HAVE_CBLAS

// stpsv
template <typename IndexType>
typename If<IndexType>::isBlasCompatibleInteger
tpsv(StorageOrder order, StorageUpLo upLo,
      Transpose transA, Diag diag,
     IndexType n,
     const float *A,
     float *x, IndexType incX)
{
    CXXBLAS_DEBUG_OUT("[" BLAS_IMPL "] cblas_stpsv");

    cblas_stpsv(CBLAS::getCblasType(order), CBLAS::getCblasType(upLo),
                CBLAS::getCblasType(transA), CBLAS::getCblasType(diag),
                n,
                A,
                x, incX);
}

// dtpsv
template <typename IndexType>
typename If<IndexType>::isBlasCompatibleInteger
tpsv(StorageOrder order, StorageUpLo upLo,
      Transpose transA, Diag diag,
     IndexType n,
     const double *A,
     double *x, IndexType incX)
{
    CXXBLAS_DEBUG_OUT("[" BLAS_IMPL "] cblas_dtpsv");

    cblas_dtpsv(CBLAS::getCblasType(order), CBLAS::getCblasType(upLo),
                CBLAS::getCblasType(transA), CBLAS::getCblasType(diag),
                n,
                A,
                x, incX);
}

// ctpsv
template <typename IndexType>
typename If<IndexType>::isBlasCompatibleInteger
tpsv(StorageOrder order, StorageUpLo upLo,
      Transpose transA, Diag diag,
     IndexType n,
     const ComplexFloat *A,
     ComplexFloat *x, IndexType incX)
{
    CXXBLAS_DEBUG_OUT("[" BLAS_IMPL "] cblas_ctpsv");

    if (transA==Conj) {
        CXXBLAS_DEBUG_OUT("tpsv_generic");
        tpsv_generic(order, upLo, transA, diag, n, A, x, incX);

        return;
    }

    cblas_ctpsv(CBLAS::getCblasType(order), CBLAS::getCblasType(upLo),
                CBLAS::getCblasType(transA), CBLAS::getCblasType(diag),
                n,
                reinterpret_cast<const float *>(A),
                reinterpret_cast<float *>(x), incX);
}

// ztpsv
template <typename IndexType>
typename If<IndexType>::isBlasCompatibleInteger
tpsv(StorageOrder order, StorageUpLo upLo,
      Transpose transA, Diag diag,
     IndexType n,
     const ComplexDouble *A,
     ComplexDouble *x, IndexType incX)
{
    CXXBLAS_DEBUG_OUT("[" BLAS_IMPL "] cblas_ztpsv");

    if (transA==Conj) {
        CXXBLAS_DEBUG_OUT("tpsv_generic");
        tpsv_generic(order, upLo, transA, diag, n, A, x, incX);

        return;
    }

    cblas_ztpsv(CBLAS::getCblasType(order), CBLAS::getCblasType(upLo),
                CBLAS::getCblasType(transA), CBLAS::getCblasType(diag),
                n,
                reinterpret_cast<const double *>(A),
                reinterpret_cast<double *>(x), incX);
}
#endif // HAVE_CBLAS

// namespace flens

#endif // CXXBLAS_LEVEL2_TPSV_TCC