Homec4science
Diffusion tamaas (features/declarative) Browse

tamaas/src/core/loops/loop_utils.hh
4df748b7012ffeatures/declarative

Last Change
Raw File

loop_utils.hh
View Options

/**
* @file
*
* @author Lucas Frérot <lucas.frerot@epfl.ch>
*
* @section LICENSE
*
* Copyright (©) 2017 EPFL (Ecole Polytechnique Fédérale de
* Lausanne) Laboratory (LSMS - Laboratoire de Simulation en Mécanique des
* Solides)
*
* Tamaas is free software: you can redistribute it and/or modify it under the
* terms of the GNU Lesser General Public License as published by the Free
* Software Foundation, either version 3 of the License, or (at your option) any
* later version.
*
* Tamaas is distributed in the hope that it will be useful, but WITHOUT ANY
* WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR
* A PARTICULAR PURPOSE. See the GNU Lesser General Public License for more
* details.
*
* You should have received a copy of the GNU Lesser General Public License
* along with Tamaas. If not, see <http://www.gnu.org/licenses/>.
*
*/
/* -------------------------------------------------------------------------- */
#ifndef __LOOP_UTILS_HH__
#define __LOOP_UTILS_HH__
/* -------------------------------------------------------------------------- */
#include "tamaas.hh"
#include "loop.hh"
#include <type_traits>
#include <limits>
/* -------------------------------------------------------------------------- */
__BEGIN_TAMAAS__
namespace detail {
template <bool only_points = false, typename... Grids>
UInt loopSize(Grids&&... grids) {
return (only_points)?
std::get<0>(std::forward_as_tuple(grids...)).getNbPoints():
std::get<0>(std::forward_as_tuple(grids...)).dataSize();
}
template <operation op, typename Apply>
struct reduction_helper;
template <typename Apply>
struct reduction_helper<operation::plus, Apply> {
reduction_helper(const Apply & apply_functor):
apply_functor(apply_functor)
{}
reduction_helper(const reduction_helper & o):
apply_functor(o.apply_functor)
{}
template<typename T>
T init() {
return T(0);
}
template<typename T, typename Tuple>
__host__ __device__
T operator()(const T& res, Tuple&& val) {
return res + apply_functor(std::forward<Tuple>(val));
}
Apply apply_functor;
};
template <typename Apply>
struct reduction_helper<operation::times, Apply> {
reduction_helper(const Apply & apply_functor):
apply_functor(apply_functor)
{}
reduction_helper(const reduction_helper & o):
apply_functor(o.apply_functor)
{}
template<typename T>
T init() {
return T(1);
}
template<typename T, typename Tuple>
__host__ __device__
T operator()(const T& res, Tuple&& val) {
return res * apply_functor(std::forward<Tuple>(val));
}
const Apply & apply_functor;
};
template <typename Apply>
struct reduction_helper<operation::min, Apply> {
reduction_helper(const Apply & apply_functor):
apply_functor(apply_functor)
{}
reduction_helper(const reduction_helper & o):
apply_functor(o.apply_functor)
{}
template<typename T>
T init() {
return std::numeric_limits<T>::max();
}
template<typename T, typename Tuple>
__host__ __device__
T operator()(const T& res, Tuple&& val) {
T value = apply_functor(std::forward<Tuple>(val));
return (res > value)? value : res;
}
const Apply & apply_functor;
};
template <typename Apply>
struct reduction_helper<operation::max, Apply> {
reduction_helper(const Apply & apply_functor):
apply_functor(apply_functor)
{}
reduction_helper(const reduction_helper & o):
apply_functor(o.apply_functor)
{}
template<typename T>
T init() {
return std::numeric_limits<T>::lowest();
}
template<typename T, typename Tuple>
__host__ __device__
T operator()(const T& res, Tuple&& val) {
T value = apply_functor(std::forward<Tuple>(val));
return (res < value)? value : res;
}
const Apply & apply_functor;
};
}
__END_TAMAAS__
#endif // __LOOP_UTILS_HH
c4science · Help