kc3-lang/libtommath/mp_abs.c
Branch
-
Show log
Commit
-
Hash : bcda8fc6
Author :
Date : 2019-10-29T22:38:49
simplifications: remove unnecessary optimization * these double checks are not necessary * the compiler will move the early return outside of the called function, basically the functions is partially inlined * however lto/amalgamation needed for the optimization
-
mp_abs.c
-
#include "tommath_private.h" #ifdef MP_ABS_C /* LibTomMath, multiple-precision integer library -- Tom St Denis */ /* SPDX-License-Identifier: Unlicense */ /* b = |a| * * Simple function copies the input and fixes the sign to positive */ mp_err mp_abs(const mp_int *a, mp_int *b) { mp_err err; /* copy a to b */ if ((err = mp_copy(a, b)) != MP_OKAY) { return err; } /* force the sign of b to positive */ b->sign = MP_ZPOS; return MP_OKAY; } #endif