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
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
|
#define divnorm(num, den, sign) \
{ \
if (num < 0) \
{ \
num = -num; \
sign = 1; \
} \
else \
{ \
sign = 0; \
} \
\
if (den < 0) \
{ \
den = - den; \
sign = 1 - sign; \
} \
}
unsigned long
divmodsi4(int modwanted, unsigned long num, unsigned long den)
{
long int bit = 1;
long int res = 0;
long prevden;
while (den < num && bit && !(den & (1L<<31)))
{
den <<=1;
bit <<=1;
}
while (bit)
{
if (num >= den)
{
num -= den;
res |= bit;
}
bit >>=1;
den >>=1;
}
if (modwanted) return num;
return res;
}
#define exitdiv(sign, res) if (sign) { res = - res;} return res;
long
__modsi3 (long numerator, long denominator)
{
int sign = 0;
long dividend;
long modul;
if (numerator < 0)
{
numerator = -numerator;
sign = 1;
}
if (denominator < 0)
{
denominator = -denominator;
}
modul = divmodsi4 (1, numerator, denominator);
if (sign)
return - modul;
return modul;
}
long
__divsi3 (long numerator, long denominator)
{
int sign;
long dividend;
long modul;
divnorm (numerator, denominator, sign);
dividend = divmodsi4 (0, numerator, denominator);
exitdiv (sign, dividend);
}
long
__umodsi3 (unsigned long numerator, unsigned long denominator)
{
long dividend;
long modul;
modul= divmodsi4 (1, numerator, denominator);
return modul;
}
long
__udivsi3 (unsigned long numerator, unsigned long denominator)
{
int sign;
long dividend;
long modul;
dividend = divmodsi4 (0, numerator, denominator);
return dividend;
}
#ifdef TEST
main ()
{
long int i, j, k, m;
for (i = -10000; i < 10000; i += 8)
{
for (j = -10000; j < 10000; j += 11)
{
k = i / j;
m = __divsi3 (i, j);
if (k != m)
printf ("fail %d %d %d %d\n", i, j, k, m);
}
}
}
#endif
|
