## Elixir Cross Referencer

 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 /* SPDX-License-Identifier: BSD-3-Clause * Copyright(c) 2010-2014 Intel Corporation */ #ifndef __INCLUDE_RTE_APPROX_H__ #define __INCLUDE_RTE_APPROX_H__ #ifdef __cplusplus extern "C" { #endif /** * @file * RTE Rational Approximation * * Given a rational number alpha with 0 < alpha < 1 and a precision d, the goal * is to find positive integers p, q such that alpha - d < p/q < alpha + d, and * q is minimal. * ***/ #include /** * Find best rational approximation * * @param alpha * Rational number to approximate * @param d * Precision for the rational approximation * @param p * Pointer to pre-allocated space where the numerator of the rational * approximation will be stored when operation is successful * @param q * Pointer to pre-allocated space where the denominator of the rational * approximation will be stored when operation is successful * @return * 0 upon success, error code otherwise */ int rte_approx(double alpha, double d, uint32_t *p, uint32_t *q); /** * Find best rational approximation (64 bit version) * * @param alpha * Rational number to approximate * @param d * Precision for the rational approximation * @param p * Pointer to pre-allocated space where the numerator of the rational * approximation will be stored when operation is successful * @param q * Pointer to pre-allocated space where the denominator of the rational * approximation will be stored when operation is successful * @return * 0 upon success, error code otherwise */ int rte_approx_64(double alpha, double d, uint64_t *p, uint64_t *q); #ifdef __cplusplus } #endif #endif /* __INCLUDE_RTE_APPROX_H__ */