asmjit::Support Namespace Reference [¶]
Contains support classes and functions that may be used by AsmJit source and header files. Anything defined here is considered internal and should not be used outside of AsmJit and related projects like AsmTK.
Classes
struct Array
class ArrayReverseIterator
class BitVectorIterator
class BitVectorOpIterator
class BitWordIterator
struct ByteSize
struct ByteSizeOrLog2Size
struct Compare
struct Enumerate
struct Log2Size
struct std_int
Functions
template<typename... Args>
constexpr T min(const T& a, const T& b) noexcept
constexpr T min(const T& a, const T& b, Args&&... args) noexcept
constexpr T max(const T& a, const T& b) noexcept
constexpr T max(const T& a, const T& b, Args&&... args) noexcept
static constexpr uint32_t unpack_u32_at_0(T x) noexcept
static constexpr uint32_t unpack_u32_at_1(T x) noexcept
static Enumerate<T> enumerate(T to = T::kMaxValue)
static Enumerate<T> enumerate(T from, T to)
static constexpr T ascii_to_lower(T c) noexcept
static constexpr T ascii_to_upper(T c) noexcept
static int compare_string_views(const char* a_data, size_t a_size, const char* b_data, size_t b_size) noexcept
static constexpr ByteSizeOrLog2Size<kSize, Support::is_power_of_2(kSize)>::Size as_item_size() noexcept
template<typename T>
template<typename T>
template<typename T>
template<typename T>
template<typename T>
template<typename T>
static size_t bit_vector_index_of(T* buf, size_t start, bool value) noexcept
template<typename T, typename CompareT = Compare<SortOrder::kAscending>>
template<typename T, class CompareT = Compare<SortOrder::kAscending>>
template<size_t Size, bool IsUnsigned>using Support::std_int_t = typename std_int<Size, IsUnsigned>::type[¶]
std_int_t is a shortcut to std_int<Size, IsUnsigned>::type.
template<size_t Size>using Support::std_sint_t = typename std_int<Size, false>::type[¶]
std_sint_t is a shortcut to std_int<Size, false>::type.
template<size_t Size>using Support::std_uint_t = typename std_int<Size, true>::type[¶]
std_uint_t is a shortcut to std_int<Size, true>::type.
using Support::BitWord = std_uint_t<sizeof(uintptr_t)>[¶]
Storage used to store bits in a single word as a standard type as defined by <stdint.h>.
Support::ByteOrderenum class[¶]
Support::SortOrder : uint32_tenum class[¶]
template<typename... Args>void Support::maybe_unused(Args&&...)staticnoexcept[¶]
Silences warnings about unused arguments or variables - more variables can be passed to maybe_unused() at once.
uint32_t Support::bytepack32_4x8(uint32_t a, uint32_t b, uint32_t c, uint32_t d)constexprstaticnodiscardnoexcept[¶]
Pack four 8-bit integer into a 32-bit integer as it is an array of {b0,b1,b2,b3}.
int Support::compare_string_views(const char* a_data, size_t a_size, const char* b_data, size_t b_size)staticnodiscardnoexcept[¶]
Compares two string views.
template<typename T>bool Support::bit_vector_get_bit(T* buf, size_t index)staticnoexcept[¶]
Sets bit in a bit-vector buf at index.
template<typename T>void Support::bit_vector_set_bit(T* buf, size_t index, bool value)staticnoexcept[¶]
Sets bit in a bit-vector buf at index to value.
template<typename T>void Support::bit_vector_or_bit(T* buf, size_t index, bool value)staticnoexcept[¶]
Sets bit in a bit-vector buf at index to value.
template<typename T>void Support::bit_vector_xor_bit(T* buf, size_t index, bool value)staticnoexcept[¶]
Sets bit in a bit-vector buf at index to value.
template<typename T>void Support::bit_vector_fill(T* buf, size_t index, size_t count)staticnoexcept[¶]
Fills count bits in bit-vector buf starting at bit-index index.
template<typename T>void Support::bit_vector_clear(T* buf, size_t index, size_t count)staticnoexcept[¶]
Clears count bits in bit-vector buf starting at bit-index index.
template<typename T, typename CompareT = Compare<SortOrder::kAscending>>void Support::insertion_sort(T* base, size_t size, const CompareT& cmp = CompareT())staticnoexcept[¶]
Insertion sort.
template<typename T, class CompareT = Compare<SortOrder::kAscending>>void Support::sort(T* base, size_t size, const CompareT& cmp = CompareT{})staticnoexcept[¶]
Quick sort implementation.
The main reason to provide a custom qsort implementation is that we needed something that will never throw bad_alloc exception. This implementation doesn't use dynamic memory allocation.