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
<doc 45
     46
     47
     48
     49
     50
     51
     52
     53

     54
<doc 55
     56
     57
     58
     59
     60
     61
     62
     63

     64
<doc 65
     66
     67
     68
     69
     70

     71
<doc 72
     73
     74
     75
     76
     77

     78
     79
     80
     81
     82
     83
/*
 * Copyright (C) 2014, The University of Texas at Austin
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions are
 * met:
 *  - Redistributions of source code must retain the above copyright
 *    notice, this list of conditions and the following disclaimer.
 *  - 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.
 *  - Neither the name of The University of Texas at Austin 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
 * HOLDER 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.
 *
 */

/*
 * Copyright (C) 2014-2015, Michael Lehn
 *
 * ulmBLAS adopted general ideas from BLIS.  Using micro kernels from BLIS
 * only requires minor modifications,
 *
 */

#ifndef ULMBLAS_IMPL_LEVEL1_ROT_H
#define ULMBLAS_IMPL_LEVEL1_ROT_H 1

#include <complex>

namespace ulmBLAS {

template <typename IndexType, typename VX, typename VY, typename T>
    void
    rot(IndexType   n,
        VX          *x,
        IndexType   incX,
        VY          *y,
        IndexType   incY,
        T           c,
        T           s);

template <typename IndexType, typename X, typename Y, typename T>
    void
    rot(IndexType              n,
        std::complex<X>        *x,
        IndexType              incX,
        std::complex<Y>        *y,
        IndexType              incY,
        T                      c,
        const std::complex<T>  &s);

template <typename A, typename B, typename T>
    void
    rotg(A &a,
         B &b,
         T &c,
         T &s);

template <typename TA, typename TB, typename T>
    void
    rotg(std::complex<TA>   &a,
         std::complex<TB>   &b,
         T                  &c,
         std::complex<T>    &s);

// namespace ulmBLAS

#endif // ULMBLAS_IMPL_LEVEL1_ROT_H 1

#include <ulmblas/impl/level1/rot.tcc>