Ship the TLS mesh, composer, Beaver/Yao/leaf MPC, prep/online paths, apps, and docs so the tree is pushable before elevating share_expr, security_mode, and prep resume. Co-authored-by: Cursor <cursoragent@cursor.com>
65 lines
2.2 KiB
C++
65 lines
2.2 KiB
C++
/// @file grotto/gadgets/binary/countl_zero.hpp
|
|
/// @author Ryan Henry <ryan.henry@ucalgary.ca>
|
|
/// @brief gadgetized form of `std::countl_zero`
|
|
/// @copyright Copyright (c) 2019-2023 Ryan Henry and others
|
|
/// @license Released under a GNU General Public v2.0 (GPLv2) license;
|
|
/// see [LICENSE.md](@ref license) for details.
|
|
|
|
#ifndef LIBDPF_INCLUDE_GROTTO_GADGETS_BINARY_COUNTL_ZERO_HPP__
|
|
#define LIBDPF_INCLUDE_GROTTO_GADGETS_BINARY_COUNTL_ZERO_HPP__
|
|
|
|
#include <array>
|
|
#include <limits>
|
|
#include <portable-snippets/builtin/builtin.h>
|
|
|
|
#include "grotto/gadget_hints.hpp"
|
|
|
|
namespace grotto
|
|
{
|
|
|
|
namespace gadgets
|
|
{
|
|
|
|
HEDLEY_DIAGNOSTIC_PUSH
|
|
HEDLEY_DIAGNOSTIC_DISABLE_DEPRECATED
|
|
|
|
|
|
/// @brief Cleartext `countl_zero`.
|
|
/// @see grotto::exact_constant
|
|
/// @note Straight-line cleartext. Fixed-point evaluation is the symbol in `@see` when that symbol is a LUT or an `eval_*` function.
|
|
/// \complexity One evaluation of `operator()` as written in this header. There is no domain scan and no loop. `Θ(1)` time and extra space relative to that expression.
|
|
struct HEDLEY_DEPRECATED_FOR(2026, grotto::exact_constant) countl_zero
|
|
{
|
|
/// @brief Evaluate the cleartext map.
|
|
/// @tparam T argument and result type
|
|
/// @param x the input
|
|
/// @return the cleartext image of `x`
|
|
/// \complexity The body is straight-line. `Θ(1)` time and extra space.
|
|
template <typename T>
|
|
T operator()(T x)
|
|
{
|
|
if (x == 0) return std::numeric_limits<T>::bits();
|
|
return psnip_builtin_clz64(static_cast<uint64_t>(static_cast<double>(x)));
|
|
}
|
|
};
|
|
|
|
template <>
|
|
struct gadget_hints<countl_zero>
|
|
{
|
|
static constexpr double min = std::numeric_limits<double>::min();
|
|
static constexpr double max = std::numeric_limits<double>::max();
|
|
static constexpr double poles[] = { };
|
|
static constexpr double interesting_points[] = { 0 };
|
|
static constexpr unsigned degree = 0;
|
|
static constexpr bool has_canonical_representation = false;
|
|
static constexpr double canonical_bounds[] = { };
|
|
static constexpr std::array<double, degree+1> hint_canonical_polys[] = { };
|
|
};
|
|
|
|
HEDLEY_DIAGNOSTIC_POP
|
|
|
|
} // namespace gadgets
|
|
|
|
} // namespace grotto
|
|
|
|
#endif // LIBDPF_INCLUDE_GROTTO_GADGETS_BINARY_COUNTL_ZERO_HPP__
|