vasilito
ff4ff35918
Red Bear OS is a full fork. All sources must be available from git clone with zero network access. Removed gitignore rules that excluded fetched source trees under recipes/*/source/, local/recipes/kde/*/source/, local/recipes/qt/*/source/, and vendor source trees. Build artifacts (target/, build/, source.tar, *.o, *.so) remain excluded. 127291 files added — kernel, relibc, base, bootloader, pkgar, all KDE/Qt frameworks, mesa, wayland, DRM drivers, and every other recipe source.
100 lines
3.0 KiB
C
100 lines
3.0 KiB
C
/* mpq_cmp_ui(u,vn,vd) -- Compare U with Vn/Vd. Return positive, zero, or
|
|
negative based on if U > V, U == V, or U < V. Vn and Vd may have
|
|
common factors.
|
|
|
|
Copyright 1993, 1994, 1996, 2000-2003, 2005, 2014, 2018 Free Software
|
|
Foundation, Inc.
|
|
|
|
This file is part of the GNU MP Library.
|
|
|
|
The GNU MP Library is free software; you can redistribute it and/or modify
|
|
it under the terms of either:
|
|
|
|
* the GNU Lesser General Public License as published by the Free
|
|
Software Foundation; either version 3 of the License, or (at your
|
|
option) any later version.
|
|
|
|
or
|
|
|
|
* the GNU General Public License as published by the Free Software
|
|
Foundation; either version 2 of the License, or (at your option) any
|
|
later version.
|
|
|
|
or both in parallel, as here.
|
|
|
|
The GNU MP Library is distributed in the hope that it will be useful, but
|
|
WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
|
|
or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
|
|
for more details.
|
|
|
|
You should have received copies of the GNU General Public License and the
|
|
GNU Lesser General Public License along with the GNU MP Library. If not,
|
|
see https://www.gnu.org/licenses/. */
|
|
|
|
#include "gmp-impl.h"
|
|
|
|
int
|
|
_mpq_cmp_ui (mpq_srcptr op1, unsigned long int num2, unsigned long int den2)
|
|
{
|
|
mp_size_t num1_size = SIZ(NUM(op1));
|
|
mp_size_t den1_size = SIZ(DEN(op1));
|
|
mp_size_t tmp1_size, tmp2_size;
|
|
mp_ptr tmp1_ptr, tmp2_ptr;
|
|
mp_limb_t cy_limb;
|
|
int cc;
|
|
TMP_DECL;
|
|
|
|
#if GMP_NAIL_BITS != 0
|
|
if ((num2 | den2) > GMP_NUMB_MAX)
|
|
{
|
|
mpq_t op2;
|
|
mpq_init (op2);
|
|
mpz_set_ui (mpq_numref (op2), num2);
|
|
mpz_set_ui (mpq_denref (op2), den2);
|
|
cc = mpq_cmp (op1, op2);
|
|
mpq_clear (op2);
|
|
return cc;
|
|
}
|
|
#endif
|
|
|
|
/* need canonical sign to get right result */
|
|
ASSERT (den1_size > 0);
|
|
|
|
if (UNLIKELY (den2 == 0))
|
|
DIVIDE_BY_ZERO;
|
|
|
|
if (num2 == 0)
|
|
return num1_size;
|
|
if (num1_size <= 0)
|
|
return -1;
|
|
|
|
/* NUM1 x DEN2 is either TMP1_SIZE limbs or TMP1_SIZE-1 limbs.
|
|
Same for NUM2 x DEN1 with respect to TMP2_SIZE. */
|
|
/* If frac2 <= 1 (i.e. num2 <= den2), shortcut with a simpler
|
|
condition: num1 > den1. Here we only test sizes. */
|
|
if (num1_size > den1_size + (num2 > den2))
|
|
/* NUM1 x DEN2 is surely larger in magnitude than NUM2 x DEN1. */
|
|
return num1_size;
|
|
if (den1_size > num1_size + (den2 > num2))
|
|
/* NUM1 x DEN2 is surely smaller in magnitude than NUM2 x DEN1. */
|
|
return -num1_size;
|
|
|
|
TMP_MARK;
|
|
TMP_ALLOC_LIMBS_2 (tmp1_ptr, num1_size + 1, tmp2_ptr, den1_size + 1);
|
|
|
|
cy_limb = mpn_mul_1 (tmp1_ptr, PTR(NUM(op1)), num1_size,
|
|
(mp_limb_t) den2);
|
|
tmp1_ptr[num1_size] = cy_limb;
|
|
tmp1_size = num1_size + (cy_limb != 0);
|
|
|
|
cy_limb = mpn_mul_1 (tmp2_ptr, PTR(DEN(op1)), den1_size,
|
|
(mp_limb_t) num2);
|
|
tmp2_ptr[den1_size] = cy_limb;
|
|
tmp2_size = den1_size + (cy_limb != 0);
|
|
|
|
cc = tmp1_size - tmp2_size;
|
|
cc = cc != 0 ? cc : mpn_cmp (tmp1_ptr, tmp2_ptr, tmp1_size);
|
|
TMP_FREE;
|
|
return cc;
|
|
}
|