Block-Structured AMR Software Framework
Loading...
Searching...
No Matches
AMReX_Algorithm.H
Go to the documentation of this file.
1#ifndef AMREX_ALGORITHM_H_
2#define AMREX_ALGORITHM_H_
3#include <AMReX_Config.H>
4
6#include <AMReX_Extension.H>
7#include <AMReX_Dim3.H>
8#include <AMReX_BLassert.H>
9#include <AMReX_Math.H>
10
11#include <algorithm>
12#include <limits>
13#include <type_traits>
14#include <cstdint>
15#include <climits>
16
17namespace amrex
18{
22 template <class T>
24 AMREX_FORCE_INLINE constexpr const T& min (const T& a, const T& b) noexcept
25 {
26 return std::min(a,b);
27 }
28
32 template <class T, class ... Ts>
34 AMREX_FORCE_INLINE constexpr const T& min (const T& a, const T& b, const Ts& ... c) noexcept
35 {
36 return min(min(a,b),c...);
37 }
38
42 template <class T>
44 AMREX_FORCE_INLINE constexpr const T& max (const T& a, const T& b) noexcept
45 {
46 return std::max(a,b);
47 }
48
52 template <class T, class ... Ts>
54 AMREX_FORCE_INLINE constexpr const T& max (const T& a, const T& b, const Ts& ... c) noexcept
55 {
56 return max(max(a,b),c...);
57 }
58
60 template <class T>
62 T elemwiseMin (T const& a, T const& b) noexcept {
63 return T{amrex::min(a.x,b.x),amrex::min(a.y,b.y),amrex::min(a.z,b.z)};
64 }
65
67 template <class T, class ... Ts>
69 T elemwiseMin (const T& a, const T& b, const Ts& ... c) noexcept
70 {
71 return elemwiseMin(elemwiseMin(a,b),c...);
72 }
73
75 template <class T>
77 T elemwiseMax (T const& a, T const& b) noexcept {
78 return T{amrex::max(a.x,b.x),amrex::max(a.y,b.y),amrex::max(a.z,b.z)};
79 }
80
82 template <class T, class ... Ts>
84 T elemwiseMax (const T& a, const T& b, const Ts& ... c) noexcept
85 {
86 return elemwiseMax(elemwiseMax(a,b),c...);
87 }
88
91 template<typename T>
93 void Swap (T& t1, T& t2) noexcept
94 {
95 T temp = std::move(t1);
96 t1 = std::move(t2);
97 t2 = std::move(temp);
98 }
99
104 template <typename T>
106 constexpr const T& Clamp (const T& v, const T& lo, const T& hi)
107 {
108 if (v < lo) {
109 return lo; // NOLINT(bugprone-return-const-ref-from-parameter)
110 } else if (hi < v) {
111 return hi; // NOLINT(bugprone-return-const-ref-from-parameter)
112 } else {
113 return v; // NOLINT(bugprone-return-const-ref-from-parameter)
114 }
115 }
116
119 template <typename T>
121 std::enable_if_t<std::is_floating_point_v<T>,bool>
122 almostEqual (T x, T y, int ulp = 2)
123 {
124 // Reference: https://en.cppreference.com/w/cpp/types/numeric_limits/epsilon
125 // The machine epsilon has to be scaled to the magnitude of the values used
126 // and multiplied by the desired precision in ULPs (units in the last place)
127 return std::abs(x-y) <= std::numeric_limits<T>::epsilon() * std::abs(x+y) * ulp
128 // unless the result is subnormal
129 || std::abs(x-y) < std::numeric_limits<T>::min();
130 }
131
148 template <class T, class F,
149 std::enable_if_t<std::is_floating_point_v<T>,int>FOO = 0>
151 T bisect (T lo, T hi, F f, T tol=1e-12, int max_iter=100)
152 {
154 "Error - calling bisect but lo and hi don't describe a reasonable interval.");
155
156 T flo = f(lo);
157 T fhi = f(hi);
158
159 if (flo == T(0)) { return lo; }
160 if (fhi == T(0)) { return hi; }
161
162 AMREX_ASSERT_WITH_MESSAGE(flo * fhi <= T(0),
163 "Error - calling bisect but lo and hi don't bracket a root.");
164
165 T mi = (lo + hi) / T(2);
166 T fmi = T(0);
167 int n = 1;
168 while (n <= max_iter)
169 {
170 if (hi - lo < tol || almostEqual(lo,hi)) { break; }
171 mi = (lo + hi) / T(2);
172 fmi = f(mi);
173 if (fmi == T(0)) { break; }
174 fmi*flo < T(0) ? hi = mi : lo = mi;
175 flo = f(lo);
176 fhi = f(hi);
177 ++n;
178 }
179
180 AMREX_ASSERT_WITH_MESSAGE(n <= max_iter,
181 "Error - maximum number of iterations reached in bisect.");
182
183 return mi;
184 }
185
207 template <typename T, typename I,
208 std::enable_if_t<std::is_integral_v<I>,int> = 0>
210 I bisect (T const* d, I lo, I hi, T const& v) {
211 while (hi - lo > 1) {
212 I mid = lo + (hi - lo) / 2;
213 if (v < d[mid]) {
214 hi = mid;
215 } else {
216 lo = mid;
217 }
218 };
219 return lo;
220 }
221
236 template<typename ItType, typename ValType>
238 ItType upper_bound (ItType first, ItType last, const ValType& val)
239 {
241 std::ptrdiff_t count = last-first;
242 while(count>0){
243 auto it = first;
244 const auto step = count/2;
245 it += step;
246 if (!(val < *it)){
247 first = ++it;
248 count -= step + 1;
249 }
250 else{
251 count = step;
252 }
253 }
254 return first;
255 ))
257 return std::upper_bound(first, last, val);
258 ))
259 }
260
275 template<typename ItType, typename ValType>
277 ItType lower_bound (ItType first, ItType last, const ValType& val)
278 {
280 std::ptrdiff_t count = last-first;
281 while(count>0)
282 {
283 auto it = first;
284 const auto step = count/2;
285 it += step;
286 if (*it < val){
287 first = ++it;
288 count -= step + 1;
289 }
290 else{
291 count = step;
292 }
293 }
294
295 return first;
296 ))
298 return std::lower_bound(first, last, val);
299 ))
300 }
301
319 template<typename ItType, typename ValType,
320 std::enable_if_t<
321 std::is_floating_point_v<typename std::iterator_traits<ItType>::value_type> &&
322 std::is_floating_point_v<ValType>,
323 int> = 0>
325 void linspace (ItType first, const ItType& last, const ValType& start, const ValType& stop)
326 {
327 const std::ptrdiff_t count = last-first;
328 if (count >= 2){
329 const auto delta = (stop - start)/(count - 1);
330 for (std::ptrdiff_t i = 0; i < count-1; ++i){
331 *(first++) = start + i*delta;
332 }
333 *first = stop;
334 }
335 }
336
355 template<typename ItType, typename ValType,
356 std::enable_if_t<
357 std::is_floating_point_v<typename std::iterator_traits<ItType>::value_type> &&
358 std::is_floating_point_v<ValType>,
359 int> = 0>
361 void logspace (ItType first, const ItType& last,
362 const ValType& start, const ValType& stop, const ValType& base)
363 {
364 const std::ptrdiff_t count = last-first;
365 if (count >= 2){
366 const auto delta = (stop - start)/(count - 1);
367 for (std::ptrdiff_t i = 0; i < count-1; ++i){
368 *(first++) = std::pow(base, start + i*delta);
369 }
370 *first = std::pow(base, stop);
371 }
372 }
373
375namespace detail {
376
377struct clzll_tag {};
378struct clzl_tag : clzll_tag {};
379struct clz_tag : clzl_tag {};
380
381// in gcc and clang, there are three versions of __builtin_clz taking unsigned int,
382// unsigned long, and unsigned long long inputs. Because the sizes of these data types
383// vary on different platforms, we work with fixed-width integer types.
384// these tags and overloads select the smallest version of __builtin_clz that will hold the input type
385template <typename T, typename = std::enable_if_t<sizeof(T) <= sizeof(unsigned int)>>
386AMREX_FORCE_INLINE
387int builtin_clz_wrapper (clz_tag, T x) noexcept
388{
389 return static_cast<int>(__builtin_clz(x) - (sizeof(unsigned int) * CHAR_BIT - sizeof(T) * CHAR_BIT));
390}
391
392template <typename T, typename = std::enable_if_t<sizeof(T) <= sizeof(unsigned long)>>
393AMREX_FORCE_INLINE
394int builtin_clz_wrapper (clzl_tag, T x) noexcept
395{
396 return static_cast<int>(__builtin_clzl(x) - (sizeof(unsigned long) * CHAR_BIT - sizeof(T) * CHAR_BIT));
397}
398
399template <typename T, typename = std::enable_if_t<sizeof(T) <= sizeof(unsigned long long)>>
400AMREX_FORCE_INLINE
401int builtin_clz_wrapper (clzll_tag, T x) noexcept
402{
403 return static_cast<int>(__builtin_clzll(x) - (sizeof(unsigned long long) * CHAR_BIT - sizeof(T) * CHAR_BIT));
404}
405
406}
408
410template <class T, std::enable_if_t<std::is_same_v<std::decay_t<T>,std::uint8_t> ||
411 std::is_same_v<std::decay_t<T>,std::uint16_t> ||
412 std::is_same_v<std::decay_t<T>,std::uint32_t> ||
413 std::is_same_v<std::decay_t<T>,std::uint64_t>, int> = 0>
415int clz (T x) noexcept;
416
418
420int clz_generic (std::uint8_t x) noexcept
421{
422#if !defined(__NVCOMPILER)
423 static constexpr int clz_lookup[16] = { 4, 3, 2, 2, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0 };
424#else
425 constexpr int clz_lookup[16] = { 4, 3, 2, 2, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0 };
426#endif
427 auto upper = x >> 4;
428 auto lower = x & 0xF;
429 return upper ? clz_lookup[upper] : 4 + clz_lookup[lower];
430}
431
433int clz_generic (std::uint16_t x) noexcept
434{
435 auto upper = std::uint8_t(x >> 8);
436 auto lower = std::uint8_t(x & 0xFF);
437 return upper ? clz(upper) : 8 + clz(lower);
438}
439
441int clz_generic (std::uint32_t x) noexcept
442{
443 auto upper = std::uint16_t(x >> 16);
444 auto lower = std::uint16_t(x & 0xFFFF);
445 return upper ? clz(upper) : 16 + clz(lower);
446}
447
449int clz_generic (std::uint64_t x) noexcept
450{
451 auto upper = std::uint32_t(x >> 32);
452 auto lower = std::uint32_t(x & 0xFFFFFFFF);
453 return upper ? clz(upper) : 32 + clz(lower);
454}
455
457
458#if defined AMREX_USE_CUDA
459
461namespace detail {
462 // likewise with CUDA, there are __clz functions that take (signed) int and long long int
463 template <typename T, typename = std::enable_if_t<sizeof(T) <= sizeof(int)> >
464 AMREX_GPU_DEVICE AMREX_FORCE_INLINE
465 int clz_wrapper (clz_tag, T x) noexcept
466 {
467 return __clz((int) x) - (sizeof(int) * CHAR_BIT - sizeof(T) * CHAR_BIT);
468 }
469
470 template <typename T, typename = std::enable_if_t<sizeof(T) <= sizeof(long long int)> >
471 AMREX_GPU_DEVICE AMREX_FORCE_INLINE
472 int clz_wrapper (clzll_tag, T x) noexcept
473 {
474 return __clzll((long long int) x) - (sizeof(long long int) * CHAR_BIT - sizeof(T) * CHAR_BIT);
475 }
476}
478
479template <class T, std::enable_if_t<std::is_same_v<std::decay_t<T>,std::uint8_t> ||
480 std::is_same_v<std::decay_t<T>,std::uint16_t> ||
481 std::is_same_v<std::decay_t<T>,std::uint32_t> ||
482 std::is_same_v<std::decay_t<T>,std::uint64_t>, int> >
484int clz (T x) noexcept
485{
486 AMREX_IF_ON_DEVICE((return detail::clz_wrapper(detail::clz_tag{}, x);))
487#if AMREX_HAS_BUILTIN_CLZ
488 AMREX_IF_ON_HOST((return detail::builtin_clz_wrapper(detail::clz_tag{}, x);))
489#else
490 AMREX_IF_ON_HOST((return clz_generic(x);))
491#endif
492}
493
494#else // !defined AMREX_USE_CUDA
495
496template <class T, std::enable_if_t<std::is_same_v<std::decay_t<T>,std::uint8_t> ||
497 std::is_same_v<std::decay_t<T>,std::uint16_t> ||
498 std::is_same_v<std::decay_t<T>,std::uint32_t> ||
499 std::is_same_v<std::decay_t<T>,std::uint64_t>, int> >
501int clz (T x) noexcept
502{
503#if (!AMREX_DEVICE_COMPILE && AMREX_HAS_BUILTIN_CLZ)
504 return detail::builtin_clz_wrapper(detail::clz_tag{}, x);
505#else
506 return clz_generic(x);
507#endif
508}
509
510#endif // defined AMREX_USE_CUDA
511
512}
513
514#endif
#define AMREX_ASSERT_WITH_MESSAGE(EX, MSG)
Definition AMReX_BLassert.H:37
#define AMREX_FORCE_INLINE
Definition AMReX_Extension.H:119
#define AMREX_IF_ON_DEVICE(CODE)
Definition AMReX_GpuQualifiers.H:56
#define AMREX_IF_ON_HOST(CODE)
Definition AMReX_GpuQualifiers.H:58
#define AMREX_GPU_HOST_DEVICE
Definition AMReX_GpuQualifiers.H:20
Definition AMReX_Amr.cpp:49
__host__ __device__ T bisect(T lo, T hi, F f, T tol=1e-12, int max_iter=100)
Find a root of a scalar function on a bracketing interval using bisection.
Definition AMReX_Algorithm.H:151
__host__ __device__ ItType upper_bound(ItType first, ItType last, const ValType &val)
Return an iterator to the first element greater than a given value.
Definition AMReX_Algorithm.H:238
__host__ __device__ void Swap(T &t1, T &t2) noexcept
Definition AMReX_Algorithm.H:93
__host__ __device__ constexpr T elemwiseMax(T const &a, T const &b) noexcept
Return the element-wise maximum of the given values for types like XDim3.
Definition AMReX_Algorithm.H:77
__host__ __device__ constexpr const T & Clamp(const T &v, const T &lo, const T &hi)
Definition AMReX_Algorithm.H:106
__host__ __device__ constexpr const T & min(const T &a, const T &b) noexcept
Definition AMReX_Algorithm.H:24
__host__ __device__ ItType lower_bound(ItType first, ItType last, const ValType &val)
Return an iterator to the first element not less than a given value.
Definition AMReX_Algorithm.H:277
__host__ __device__ std::enable_if_t< std::is_floating_point_v< T >, bool > almostEqual(T x, T y, int ulp=2)
Definition AMReX_Algorithm.H:122
__host__ __device__ constexpr const T & max(const T &a, const T &b) noexcept
Definition AMReX_Algorithm.H:44
__host__ __device__ void logspace(ItType first, const ItType &last, const ValType &start, const ValType &stop, const ValType &base)
Fill a range with logarithmically spaced values over a closed interval.
Definition AMReX_Algorithm.H:361
__host__ __device__ void linspace(ItType first, const ItType &last, const ValType &start, const ValType &stop)
Fill a range with linearly spaced values over a closed interval.
Definition AMReX_Algorithm.H:325
__host__ __device__ int clz(T x) noexcept
Return the number of leading zeros of the given integer.
Definition AMReX_Algorithm.H:484
__host__ __device__ constexpr T elemwiseMin(T const &a, T const &b) noexcept
Return the element-wise minimum of the given values for types like XDim3.
Definition AMReX_Algorithm.H:62