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
231
232
233
234
235
236
237
238
239
240
241
242
243
244
|
/*
* Compface - 48x48x1 image compression and decompression
*
* Copyright (c) James Ashton - Sydney University - June 1990.
*
* Written 11th November 1989.
*
* Permission is given to distribute these sources, as long as the
* copyright messages are not removed, and no monies are exchanged.
*
* No responsibility is taken for any errors on inaccuracies inherent
* either to the comments or the code of this program, but if reported
* to me, then an attempt will be made to fix them.
*/
#ifdef HAVE_CONFIG_H
#include "config.h"
#endif
#include "compface.h"
void
RevPush(p)
Prob *p;
{
if (NumProbs >= PIXELS * 2 - 1)
longjmp(comp_env, ERR_INTERNAL);
ProbBuf[NumProbs++] = p;
}
void
BigPush(p)
Prob *p;
{
static WORD tmp;
BigDiv(p->p_range, &tmp);
BigMul(0);
BigAdd(tmp + p->p_offset);
}
int
BigPop(p)
register Prob *p;
{
static WORD tmp;
register int i;
BigDiv(0, &tmp);
i = 0;
while ((tmp < p->p_offset) || (tmp >= p->p_range + p->p_offset))
{
p++;
i++;
}
BigMul(p->p_range);
BigAdd(tmp - p->p_offset);
return i;
}
#ifdef DEBUG
/* Print a BigInt in HexaDecimal
*/
void
BigPrint()
{
register int i, c, count;
register WORD *w;
count = 0;
w = B.b_word + (i = B.b_words);
while (i--)
{
w--;
c = *((*w >> 4) + HexDigits);
putc(c, stderr);
c = *((*w & 0xf) + HexDigits);
putc(c, stderr);
if (++count >= 36)
{
putc('\\', stderr);
putc('\n', stderr);
count = 0;
}
}
putc('\n', stderr);
}
#endif
/* Divide B by a storing the result in B and the remainder in the word
* pointer to by r
*/
void
BigDiv(a, r)
register WORD a, *r;
{
register int i;
register WORD *w;
register COMP c, d;
a &= WORDMASK;
if ((a == 1) || (B.b_words == 0))
{
*r = 0;
return;
}
if (a == 0) /* treat this as a == WORDCARRY */
{ /* and just shift everything right a WORD */
i = --B.b_words;
w = B.b_word;
*r = *w;
while (i--)
{
*w = *(w + 1);
w++;
}
*w = 0;
return;
}
w = B.b_word + (i = B.b_words);
c = 0;
while (i--)
{
c <<= BITSPERWORD;
c += (COMP)*--w;
d = c / (COMP)a;
c = c % (COMP)a;
*w = (WORD)(d & WORDMASK);
}
*r = c;
if (B.b_word[B.b_words - 1] == 0)
B.b_words--;
}
/* Multiply a by B storing the result in B
*/
void
BigMul(a)
register WORD a;
{
register int i;
register WORD *w;
register COMP c;
a &= WORDMASK;
if ((a == 1) || (B.b_words == 0))
return;
if (a == 0) /* treat this as a == WORDCARRY */
{ /* and just shift everything left a WORD */
if ((i = B.b_words++) >= MAXWORDS - 1)
longjmp(comp_env, ERR_INTERNAL);
w = B.b_word + i;
while (i--)
{
*w = *(w - 1);
w--;
}
*w = 0;
return;
}
i = B.b_words;
w = B.b_word;
c = 0;
while (i--)
{
c += (COMP)*w * (COMP)a;
*(w++) = (WORD)(c & WORDMASK);
c >>= BITSPERWORD;
}
if (c)
{
if (B.b_words++ >= MAXWORDS)
longjmp(comp_env, ERR_INTERNAL);
*w = (COMP)(c & WORDMASK);
}
}
#if 0
/* Subtract a from B storing the result in B
*/
void
BigSub(a)
WORD a;
{
register int i;
register WORD *w;
register COMP c;
a &= WORDMASK;
if (a == 0)
return;
i = 1;
w = B.b_word;
c = (COMP)*w - (COMP)a;
*w = (WORD)(c & WORDMASK);
while (c & WORDCARRY)
{
if (i >= B.b_words)
longjmp(comp_env, ERR_INTERNAL);
c = (COMP)*++w - 1;
*w = (WORD)(c & WORDMASK);
i++;
}
if ((i == B.b_words) && (*w == 0) && (i > 0))
B.b_words--;
}
#endif
/* Add to a to B storing the result in B
*/
void
BigAdd(a)
WORD a;
{
register int i;
register WORD *w;
register COMP c;
a &= WORDMASK;
if (a == 0)
return;
i = 0;
w = B.b_word;
c = a;
while ((i < B.b_words) && c)
{
c += (COMP)*w;
*w++ = (WORD)(c & WORDMASK);
c >>= BITSPERWORD;
i++;
}
if ((i == B.b_words) && c)
{
if (B.b_words++ >= MAXWORDS)
longjmp(comp_env, ERR_INTERNAL);
*w = (COMP)(c & WORDMASK);
}
}
void
BigClear()
{
B.b_words = 0;
}
|
