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 |
/*
* Copyright (c) 2007, 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 FLENS_BLAS_CLOSURES_LEVEL1_COPYSUM_TCC #define FLENS_BLAS_CLOSURES_LEVEL1_COPYSUM_TCC 1 #include <flens/auxiliary/auxiliary.h> #include <flens/blas/closures/closures.h> #include <flens/blas/level1/level1.h> #include <flens/blas/level2/level2.h> #include <flens/blas/level3/level3.h> #include <flens/typedefs.h> #ifdef FLENS_DEBUG_CLOSURES # include <flens/blas/blaslogon.h> #else # include <flens/blas/blaslogoff.h> #endif namespace flens { namespace blas { // //== vector closures =========================================================== // // // Auxiliary function for // y = x1 + x2 (alpha= 1) // or y = x1 - x2 (alpha=-1) // template <typename VX1, typename ALPHA, typename VX2, typename VY> void copySum(const VX1 &x1, const ALPHA &alpha, const VX2 &x2, VY &y) { ASSERT(alpha==ALPHA(1) || alpha==ALPHA(-1)); // // In debug-closure-mode we check if x2 has to stored in a temporary. // Otherwise an assertion gets triggered if x2 and y are identical of if x2 // is a closure that contains y. // # ifdef FLENS_DEBUG_CLOSURES bool tmpNeeded = DebugClosure::search(x2, y); typename Result<VX2>::NoView tmp; if (tmpNeeded) { tmp = x2; FLENS_BLASLOG_TMP_ADD(tmp); } # else ASSERT(!DebugClosure::search(x2, y)); # endif // // y = x1 // if (! DEBUGCLOSURE::identical(x1, y)) { blas::copy(x1, y); } // // y += x2 or y -= x2 // # ifdef FLENS_DEBUG_CLOSURES if (tmpNeeded) { blas::axpy(alpha, tmp, y); FLENS_BLASLOG_TMP_REMOVE(tmp, x2); } else { blas::axpy(alpha, x2, y); } # else blas::axpy(alpha, x2, y); # endif } // //== matrix closures =========================================================== // // // Auxiliary function for // B = op(A1 + A2) (alpha= 1) // or B = op(A1 - A2) (alpha=-1) // template <typename MA1, typename ALPHA, typename MA2, typename MB> void copySum(Transpose trans, const MA1 &A1, const ALPHA &alpha, const MA2 &A2, MB &B) { ASSERT(alpha==ALPHA(1) || alpha==ALPHA(-1)); // // In debug-closure-mode we check if A2 has to stored in a temporary. // Otherwise an assertion gets triggered if A2 and B are identical of if A2 // is a closure that contains B. // # ifdef FLENS_DEBUG_CLOSURES bool tmpNeeded = DebugClosure::search(A2, B); typename Result<MA2>::NoView tmp; if (tmpNeeded) { tmp = A2; FLENS_BLASLOG_TMP_ADD(tmp); } # else ASSERT(!DebugClosure::search(A2, B)); # endif // // B = A1 // if (! DEBUGCLOSURE::identical(A1, B)) { blas::copy(trans, A1, B); } // // B += A2 or B -= A2 // # ifdef FLENS_DEBUG_CLOSURES if (tmpNeeded) { blas::axpy(trans, alpha, tmp, B); FLENS_BLASLOG_TMP_REMOVE(tmp, A2); } else { blas::axpy(trans, alpha, A2, B); } # else blas::axpy(trans, alpha, A2, B); # endif } } } // namespace blas, flens #endif // FLENS_BLAS_CLOSURES_LEVEL1_COPY_TCC |