tile_operations.hpp

Go to the documentation of this file.

#ifndef TDLS_SOLVERS_TILED_LUPP_TILE_OPERATIONS_HPP
#define TDLS_SOLVERS_TILED_LUPP_TILE_OPERATIONS_HPP
 
 
 
 
 
 
#include <tdls/core/macros.hpp>
#include <tdls/solvers/tile_operations.hpp>
 
 
 
// clang reports a forced unrolling that the optimizer could not perform
// through -Wpass-failed. The unrolling requested by TDLS_UNROLL_FORCE is
// a performance hint: a failed hint does not affect correctness. The
// suppression is scoped to this header and to that warning only.
#if defined(__clang__)
#pragma clang diagnostic push
#pragma clang diagnostic ignored "-Wpass-failed"
#endif
 
namespace tdls {
 
 
 
template<typename T, int tile_size, bool unroll_inner>
struct TiledLUppTileOperations : TileOperations<T, tile_size, unroll_inner> {
 
    template<int row_extent, int col_extent>
    TDLS_HOST_DEVICE TDLS_FORCEINLINE static constexpr void eliminate_column(T* TDLS_RESTRICT t,
                                                                             int k) noexcept {
        const T inv_pivot    = T(1) / t[k * tile_size + k];
        t[k * tile_size + k] = inv_pivot;
        if constexpr (unroll_inner) {
            TDLS_UNROLL_FORCE
            for (int i = k + 1; i < row_extent; ++i) {
                t[i * tile_size + k] *= inv_pivot;
                TDLS_UNROLL_FORCE
                for (int j = k + 1; j < col_extent; ++j)
                    t[i * tile_size + j] -= t[i * tile_size + k] * t[k * tile_size + j];
            }
        } else {
            for (int i = k + 1; i < row_extent; ++i) {
                t[i * tile_size + k] *= inv_pivot;
                for (int j = k + 1; j < col_extent; ++j)
                    t[i * tile_size + j] -= t[i * tile_size + k] * t[k * tile_size + j];
            }
        }
    }
};
 
 
 
} // namespace tdls
 
#if defined(__clang__)
#pragma clang diagnostic pop
#endif
 
 
 
#endif // TDLS_SOLVERS_TILED_LUPP_TILE_OPERATIONS_HPP