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
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
|
/* mpq_cmp(u,v) -- Compare U, V. Return postive, zero, or negative
based on if U > V, U == V, or U < V.
Copyright 1991, 1994, 1996, 2001, 2002 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 the GNU Lesser General Public License as published by
the Free Software Foundation; either version 2.1 of the License, or (at your
option) any later version.
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 Lesser General Public
License for more details.
You should have received a copy of the GNU Lesser General Public License
along with the GNU MP Library; see the file COPYING.LIB. If not, write to
the Free Software Foundation, Inc., 59 Temple Place - Suite 330, Boston,
MA 02111-1307, USA. */
#include "gmp.h"
#include "gmp-impl.h"
#include "longlong.h"
int
mpq_cmp (const MP_RAT *op1, const MP_RAT *op2)
{
mp_size_t num1_size = op1->_mp_num._mp_size;
mp_size_t den1_size = op1->_mp_den._mp_size;
mp_size_t num2_size = op2->_mp_num._mp_size;
mp_size_t den2_size = op2->_mp_den._mp_size;
mp_size_t tmp1_size, tmp2_size;
mp_ptr tmp1_ptr, tmp2_ptr;
mp_size_t num1_sign;
int cc;
TMP_DECL (marker);
/* need canonical signs to get right result */
ASSERT (den1_size > 0);
ASSERT (den2_size > 0);
if (num1_size == 0)
return -num2_size;
if (num2_size == 0)
return num1_size;
if ((num1_size ^ num2_size) < 0) /* I.e. are the signs different? */
return num1_size;
num1_sign = num1_size;
num1_size = ABS (num1_size);
num2_size = ABS (num2_size);
tmp1_size = num1_size + den2_size;
tmp2_size = num2_size + den1_size;
/* 1. Check to see if we can tell which operand is larger by just looking at
the number of limbs. */
/* NUM1 x DEN2 is either TMP1_SIZE limbs or TMP1_SIZE-1 limbs.
Same for NUM1 x DEN1 with respect to TMP2_SIZE. */
if (tmp1_size > tmp2_size + 1)
/* NUM1 x DEN2 is surely larger in magnitude than NUM2 x DEN1. */
return num1_sign;
if (tmp2_size > tmp1_size + 1)
/* NUM1 x DEN2 is surely smaller in magnitude than NUM2 x DEN1. */
return -num1_sign;
/* 2. Same, but compare the number of significant bits. */
{
int cnt1, cnt2;
unsigned long int bits1, bits2;
count_leading_zeros (cnt1, op1->_mp_num._mp_d[num1_size - 1]);
count_leading_zeros (cnt2, op2->_mp_den._mp_d[den2_size - 1]);
bits1 = tmp1_size * GMP_NUMB_BITS - cnt1 - cnt2 + 2 * GMP_NAIL_BITS;
count_leading_zeros (cnt1, op2->_mp_num._mp_d[num2_size - 1]);
count_leading_zeros (cnt2, op1->_mp_den._mp_d[den1_size - 1]);
bits2 = tmp2_size * GMP_NUMB_BITS - cnt1 - cnt2 + 2 * GMP_NAIL_BITS;
if (bits1 > bits2 + 1)
return num1_sign;
if (bits2 > bits1 + 1)
return -num1_sign;
}
/* 3. Finally, cross multiply and compare. */
TMP_MARK (marker);
TMP_ALLOC_LIMBS_2 (tmp1_ptr,tmp1_size, tmp2_ptr,tmp2_size);
if (num1_size >= den2_size)
tmp1_size -= 0 == mpn_mul (tmp1_ptr,
op1->_mp_num._mp_d, num1_size,
op2->_mp_den._mp_d, den2_size);
else
tmp1_size -= 0 == mpn_mul (tmp1_ptr,
op2->_mp_den._mp_d, den2_size,
op1->_mp_num._mp_d, num1_size);
if (num2_size >= den1_size)
tmp2_size -= 0 == mpn_mul (tmp2_ptr,
op2->_mp_num._mp_d, num2_size,
op1->_mp_den._mp_d, den1_size);
else
tmp2_size -= 0 == mpn_mul (tmp2_ptr,
op1->_mp_den._mp_d, den1_size,
op2->_mp_num._mp_d, num2_size);
cc = tmp1_size - tmp2_size != 0
? tmp1_size - tmp2_size : mpn_cmp (tmp1_ptr, tmp2_ptr, tmp1_size);
TMP_FREE (marker);
return num1_sign < 0 ? -cc : cc;
}
|
