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
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
|
/* $Id: libfaucc.c,v 1.9 2009-01-27 15:49:10 potyra Exp $
*
* Copyright (C) 2008-2009 FAUcc Team <info@faumachine.org>.
* This program is free software. You can redistribute it and/or modify it
* under the terms of the GNU General Public License, either version 2 of
* the License, or (at your option) any later version. See COPYING.
*/
unsigned long __ARCH_div32(unsigned long op1, unsigned long op2)
{
unsigned long X=0, A=op1;
unsigned long res=0;
unsigned char N=0;
if ((A>>31) == 1) {
A = 1 << N;
}
/* find bit length difference between op1 and op2 */
X=op2;
while ((X << 1) <= A) {
X = X << 1;
if (X == 0)
break;
N++;
}
if (N>0) {
A = (op1 << (32-N));
X = (op1 >> N);
} else
X = op1;
N++;
do {
if (X >= op2) {
X = X-op2;
res = res << 1;
res = res | 0x01;
} else {
res = res << 1;
}
X = X << 1;
if ((A>>31) == 1) {
X = X | 0x01;
}
A = A<<1;
N--;
} while (N > 0);
return res;
}
unsigned long __ARCH_mod32(unsigned long op1, unsigned long op2)
{
unsigned long X=0, A=op1;
unsigned char N=0;
if ((A>>31) == 1) {
A = 1 << N;
}
X=op2;
while ((X << 1) <= A) {
X = X << 1;
if (X == 0)
break;
N++;
}
if (N>0) {
A = (op1 << (32-N));
X = (op1 >> N);
} else
X = op1;
N++;
do {
if (X >= op2) {
X = X-op2;
}
X = X << 1;
if ((A>>31) == 1) {
X = X | 0x01;
}
A = A<<1;
N--;
} while (N > 0);
X = X >> 1;
return X;
}
unsigned long __ARCH_mul32(unsigned long op1, unsigned long op2)
{
unsigned long X=0, A=0;
unsigned long res=0;
unsigned char N=0, I=0;
X=op2;
while (X != 0) {
X = X >> 4;
N++;
}
do {
X=0;
A=(op2 << (28-4*I)) >> 28;
if (((A<<31)>>31) == 1) {
X += op1;
}
if (((A<<30)>>31) == 1) {
X += op1 << 1;
}
if (((A<<29)>>31) == 1) {
X += op1 << 2;
}
if (((A<<28)>>31) == 1) {
X += op1 << 3;
}
X = X << 4*I;
res += X;
N--; I++;
} while (N > 0);
return res;
}
#if 0
unsigned long long __ARCH_div64(unsigned long long op1, unsigned long long op2)
{
unsigned long long X=0, A=0;
unsigned long long res=0;
unsigned char N=0;
X=op2;
while ((X << 1) < op1) {
X = X << 1;
N++;
}
A = (op1 << (64-N));
X = (op1 >> N);
N++;
do {
N--;
if (X > op2) {
X = X-op2;
res = res << 1;
res = res | 0x01;
} else {
res = res << 1;
}
X = X << 1;
if ((A>>63) == 1) {
X = X | 0x01;
}
A = A<<1;
} while (N > 0);
return res;
}
unsigned long long __ARCH_mod64(unsigned long long op1, unsigned long long op2)
{
unsigned long long X=0, A=0;
unsigned char N=0;
X=op2;
while ((X << 1) < op1) {
X = X << 1;
N++;
}
A = (op1 << (64-N));// >> (32-N);
X = (op1 >> N);
N++;
do {
N--;
if (X > op2) {
X = X-op2;
}
X = X << 1;
if ((A>>63) == 1) {
X = X | 0x01;
}
A = A<<1;
} while (N > 0);
return X;
}
unsigned long long int_ARCH_mul64(unsigned long long op1, unsigned long long op2)
{
unsigned long long X=0, A=0;
unsigned long long res=0;
unsigned char N=0, I=0;
X=op2;
while (X != 0) {
X = X >> 4;
N++;
}
do {
X=0;
N--;
A=(op2 << (60-4*I)) >> 60;
if (((A<<63)>>63) == 1) {
X += op1;
}
if (((A<<62)>>63) == 1) {
X += op1 << 1;
}
if (((A<<61)>>63) == 1) {
X += op1 << 2;
}
if (((A<<60)>>63) == 1) {
X += op1 << 3;
}
X = X << 4*I;
res += X;
I++;
} while (N > 0);
return res;
}
#endif
|
