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
|
unsigned int modulo(unsigned int x, unsigned int y)
{
unsigned int r0, q0, y0, y1;
r0 = x;
q0 = 0;
y0 = y;
y1 = y;
do
{
y1 = 2 * y1;
}
while (y1 <= x);
do
{
y1 = y1 / 2;
q0 = 2 * q0;
if (r0 >= y1)
{
r0 = r0 - y1;
q0 = q0 + 1;
}
}
while ((int)y1 != (int)y0);
return r0;
}
int smodulo(int N, int D) {
if (D < 0) {
if (N < 0)
return modulo(-N, -D);
else
return -modulo(N, -D);
} else {
if (N < 0)
return -modulo(-N, D);
else
return modulo(N, D);
}
}
unsigned divider_fast(unsigned x, unsigned y) {
unsigned r0, q0, y0, y1;
r0 = x;
q0 = 0;
y0 = y;
y1 = y;
do {
y1 = 2 * y1;
} while (y1 <= x);
do {
y1 /= 2;
q0 *= 2;
if (r0 >= y1) {
r0 -= y1;
q0++;
}
} while ((int)y1 != (int)y0);
return q0;
}
unsigned divider(unsigned x, unsigned y) {
unsigned q0, acc;
q0 = 0;
acc = y;
while (acc <= x) {
q0++;
acc += y;
}
return q0;
}
/*
* Signed division operation for faster frequency division.
*/
int sdivider(int N, int D) {
if (D < 0) {
if (N < 0)
return divider(-N, -D);
else
return -divider(N, -D);
} else {
if (N < 0)
return -divider(-N, D);
else
return divider(N, D);
}
}
int sdivider_fast(int N, int D) {
if (D < 0) {
if (N < 0)
return divider_fast(-N, -D);
else
return -divider_fast(N, -D);
} else {
if (N < 0)
return -divider_fast(-N, D);
else
return divider_fast(N, D);
}
}
|
