mirror of
https://github.com/LadybirdBrowser/ladybird.git
synced 2024-08-17 09:20:28 +03:00
Additionally, split it into two versions (for IsIntegral<T> -- asking to place value into register and for !IsIntegral<T> -- asking to place value into memory with memory clobber), so that Clang is no more completely confused about `taint_for_optimizer(AK::StringView&)`.
231 lines
5.1 KiB
C++
231 lines
5.1 KiB
C++
/*
|
|
* Copyright (c) 2018-2022, Andreas Kling <kling@serenityos.org>
|
|
*
|
|
* SPDX-License-Identifier: BSD-2-Clause
|
|
*/
|
|
|
|
#pragma once
|
|
|
|
#include <AK/Platform.h>
|
|
|
|
#if defined(AK_COMPILER_CLANG)
|
|
# pragma clang diagnostic ignored "-Wunqualified-std-cast-call"
|
|
#endif
|
|
|
|
#include <AK/StdLibExtraDetails.h>
|
|
|
|
#include <AK/Assertions.h>
|
|
|
|
namespace AK {
|
|
|
|
template<typename T, typename U>
|
|
constexpr auto round_up_to_power_of_two(T value, U power_of_two)
|
|
requires(AK::Detail::IsIntegral<T> && AK::Detail::IsIntegral<U>)
|
|
{
|
|
return ((value - 1) & ~(power_of_two - 1)) + power_of_two;
|
|
}
|
|
|
|
template<typename T>
|
|
constexpr bool is_power_of_two(T value)
|
|
requires(AK::Detail::IsIntegral<T>)
|
|
{
|
|
return value && !((value) & (value - 1));
|
|
}
|
|
|
|
template<typename... Args>
|
|
void compiletime_fail(Args...);
|
|
|
|
}
|
|
|
|
#if !USING_AK_GLOBALLY || defined(AK_DONT_REPLACE_STD)
|
|
# define AK_REPLACED_STD_NAMESPACE AK::replaced_std
|
|
#else
|
|
# define AK_REPLACED_STD_NAMESPACE std
|
|
#endif
|
|
|
|
namespace AK_REPLACED_STD_NAMESPACE { // NOLINT(cert-dcl58-cpp) Names in std to aid tools
|
|
|
|
// NOTE: These are in the "std" namespace since some compilers and static analyzers rely on it.
|
|
// If USING_AK_GLOBALLY is false, we can't put them in ::std, so we put them in AK::replaced_std instead
|
|
// The user code should not notice anything unless it explicitly asks for std::stuff, so...don't.
|
|
|
|
template<typename T>
|
|
constexpr T&& forward(AK::Detail::RemoveReference<T>& param)
|
|
{
|
|
return static_cast<T&&>(param);
|
|
}
|
|
|
|
template<typename T>
|
|
constexpr T&& forward(AK::Detail::RemoveReference<T>&& param) noexcept
|
|
{
|
|
static_assert(!AK::Detail::IsLvalueReference<T>, "Can't forward an rvalue as an lvalue.");
|
|
return static_cast<T&&>(param);
|
|
}
|
|
|
|
template<typename T>
|
|
constexpr T&& move(T& arg)
|
|
{
|
|
return static_cast<T&&>(arg);
|
|
}
|
|
|
|
}
|
|
|
|
namespace AK {
|
|
using AK_REPLACED_STD_NAMESPACE::forward;
|
|
using AK_REPLACED_STD_NAMESPACE::move;
|
|
}
|
|
|
|
namespace AK::Detail {
|
|
template<typename T>
|
|
struct _RawPtr {
|
|
using Type = T*;
|
|
};
|
|
}
|
|
|
|
namespace AK {
|
|
|
|
template<typename T, typename SizeType = decltype(sizeof(T)), SizeType N>
|
|
constexpr SizeType array_size(T (&)[N])
|
|
{
|
|
return N;
|
|
}
|
|
|
|
template<typename T>
|
|
constexpr T min(T const& a, IdentityType<T> const& b)
|
|
{
|
|
return b < a ? b : a;
|
|
}
|
|
|
|
template<typename T>
|
|
constexpr T max(T const& a, IdentityType<T> const& b)
|
|
{
|
|
return a < b ? b : a;
|
|
}
|
|
|
|
template<typename T>
|
|
constexpr T clamp(T const& value, IdentityType<T> const& min, IdentityType<T> const& max)
|
|
{
|
|
VERIFY(max >= min);
|
|
if (value > max)
|
|
return max;
|
|
if (value < min)
|
|
return min;
|
|
return value;
|
|
}
|
|
|
|
template<typename T, typename U>
|
|
constexpr T mix(T const& v1, T const& v2, U const& interpolation) // aka lerp
|
|
{
|
|
return v1 + (v2 - v1) * interpolation;
|
|
}
|
|
|
|
template<typename T, typename U>
|
|
constexpr T ceil_div(T a, U b)
|
|
{
|
|
static_assert(sizeof(T) == sizeof(U));
|
|
T result = a / b;
|
|
if ((a % b) != 0)
|
|
++result;
|
|
return result;
|
|
}
|
|
|
|
template<typename T, typename U>
|
|
inline void swap(T& a, U& b)
|
|
{
|
|
if (&a == &b)
|
|
return;
|
|
U tmp = move(static_cast<U&>(a));
|
|
a = static_cast<T&&>(move(b));
|
|
b = move(tmp);
|
|
}
|
|
|
|
template<typename T, typename U = T>
|
|
constexpr T exchange(T& slot, U&& value)
|
|
{
|
|
T old_value = move(slot);
|
|
slot = forward<U>(value);
|
|
return old_value;
|
|
}
|
|
|
|
template<typename T>
|
|
using RawPtr = typename Detail::_RawPtr<T>::Type;
|
|
|
|
template<typename V>
|
|
constexpr decltype(auto) to_underlying(V value)
|
|
requires(IsEnum<V>)
|
|
{
|
|
return static_cast<UnderlyingType<V>>(value);
|
|
}
|
|
|
|
constexpr bool is_constant_evaluated()
|
|
{
|
|
#if __has_builtin(__builtin_is_constant_evaluated)
|
|
return __builtin_is_constant_evaluated();
|
|
#else
|
|
return false;
|
|
#endif
|
|
}
|
|
|
|
template<typename T>
|
|
ALWAYS_INLINE constexpr void taint_for_optimizer(T& value)
|
|
requires(IsIntegral<T>)
|
|
{
|
|
if (!is_constant_evaluated()) {
|
|
asm volatile(""
|
|
: "+r"(value));
|
|
}
|
|
}
|
|
|
|
template<typename T>
|
|
ALWAYS_INLINE constexpr void taint_for_optimizer(T& value)
|
|
requires(!IsIntegral<T>)
|
|
{
|
|
if (!is_constant_evaluated()) {
|
|
asm volatile(""
|
|
:
|
|
: "m"(value)
|
|
: "memory");
|
|
}
|
|
}
|
|
|
|
// These can't be exported into the global namespace as they would clash with the C standard library.
|
|
|
|
#define __DEFINE_GENERIC_ABS(type, zero, intrinsic) \
|
|
constexpr type abs(type num) \
|
|
{ \
|
|
if (is_constant_evaluated()) \
|
|
return num < (zero) ? -num : num; \
|
|
return __builtin_##intrinsic(num); \
|
|
}
|
|
|
|
__DEFINE_GENERIC_ABS(int, 0, abs);
|
|
__DEFINE_GENERIC_ABS(long, 0L, labs);
|
|
__DEFINE_GENERIC_ABS(long long, 0LL, llabs);
|
|
#ifndef KERNEL
|
|
__DEFINE_GENERIC_ABS(float, 0.0F, fabsf);
|
|
__DEFINE_GENERIC_ABS(double, 0.0, fabs);
|
|
__DEFINE_GENERIC_ABS(long double, 0.0L, fabsl);
|
|
#endif
|
|
|
|
#undef __DEFINE_GENERIC_ABS
|
|
|
|
}
|
|
|
|
#if USING_AK_GLOBALLY
|
|
using AK::array_size;
|
|
using AK::ceil_div;
|
|
using AK::clamp;
|
|
using AK::exchange;
|
|
using AK::forward;
|
|
using AK::is_constant_evaluated;
|
|
using AK::is_power_of_two;
|
|
using AK::max;
|
|
using AK::min;
|
|
using AK::mix;
|
|
using AK::move;
|
|
using AK::RawPtr;
|
|
using AK::round_up_to_power_of_two;
|
|
using AK::swap;
|
|
using AK::to_underlying;
|
|
#endif
|