-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathlib_util.c
367 lines (330 loc) · 9.8 KB
/
lib_util.c
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
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
/*
* lib_util - calc library utility routines
*
* Copyright (C) 1999-2006 Landon Curt Noll
*
* Calc is open software; you can redistribute it and/or modify it under
* the terms of the version 2.1 of the GNU Lesser General Public License
* as published by the Free Software Foundation.
*
* Calc 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.
*
* A copy of version 2.1 of the GNU Lesser General Public License is
* distributed with calc under the filename COPYING-LGPL. You should have
* received a copy with calc; if not, write to Free Software Foundation, Inc.
* 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
*
* Under source code control: 1997/04/19 21:38:30
* File existed as early as: 1997
*
* chongo <was here> /\oo/\ http://www.isthe.com/chongo/
* Share and enjoy! :-) http://www.isthe.com/chongo/tech/comp/calc/
*/
/*
* These routines are here to support users of libcalc.a. These routines
* are not directly used by calc itself, however.
*/
#include "zmath.h"
#include "lib_util.h"
/*
* lowhex2bin - quick low order ASCII hex to binary conversion
*
* We just use mod 16 for non-hex ASCII chars. We use just mod 128
* for non-ASCII to ASCII conversion.
*
* | 00 nul | 01 soh | 02 stx | 03 etx | 04 eot | 05 enq | 06 ack | 07 bel |
* | 08 bs | 09 ht | 0a nl | 0b vt | 0c np | 0d cr | 0e so | 0f si |
* | 10 dle | 11 dc1 | 12 dc2 | 13 dc3 | 14 dc4 | 15 nak | 16 syn | 17 etb |
* | 18 can | 19 em | 1a sub | 1b esc | 1c fs | 1d gs | 1e rs | 1f us |
* | 20 sp | 21 ! | 22 " | 23 # | 24 $ | 25 % | 26 & | 27 ' |
* | 28 ( | 29 ) | 2a * | 2b + | 2c , | 2d - | 2e . | 2f / |
* | 30 0 | 31 1 | 32 2 | 33 3 | 34 4 | 35 5 | 36 6 | 37 7 |
* | 38 8 | 39 9 | 3a : | 3b ; | 3c < | 3d = | 3e > | 3f ? |
* | 40 @ | 41 A | 42 B | 43 C | 44 D | 45 E | 46 F | 47 G |
* | 48 H | 49 I | 4a J | 4b K | 4c L | 4d M | 4e N | 4f O |
* | 50 P | 51 Q | 52 R | 53 S | 54 T | 55 U | 56 V | 57 W |
* | 58 X | 59 Y | 5a Z | 5b [ | 5c \ | 5d ] | 5e ^ | 5f _ |
* | 60 ` | 61 a | 62 b | 63 c | 64 d | 65 e | 66 f | 67 g |
* | 68 h | 69 i | 6a j | 6b k | 6c l | 6d m | 6e n | 6f o |
* | 70 p | 71 q | 72 r | 73 s | 74 t | 75 u | 76 v | 77 w |
* | 78 x | 79 y | 7a z | 7b { | 7c | | 7d } | 7e ~ | 7f del |
*/
int lowhex2bin[256] = {
/* 0 1 2 3 4 5 6 7 8 9 a b c d e f */
0x0,0x1,0x2,0x3,0x4,0x5,0x6,0x7,0x8,0x9,0xa,0xb,0xc,0xd,0xe,0xf, /* 0 */
0x0,0x1,0x2,0x3,0x4,0x5,0x6,0x7,0x8,0x9,0xa,0xb,0xc,0xd,0xe,0xf, /* 1 */
0x0,0x1,0x2,0x3,0x4,0x5,0x6,0x7,0x8,0x9,0xa,0xb,0xc,0xd,0xe,0xf, /* 2 */
0x0,0x1,0x2,0x3,0x4,0x5,0x6,0x7,0x8,0x9,0xa,0xb,0xc,0xd,0xe,0xf, /* 3 */
0x0,0xa,0xb,0xc,0xd,0xe,0xf,0x7,0x8,0x9,0xa,0xb,0xc,0xd,0xe,0xf, /* 4 */
0x0,0x1,0x2,0x3,0x4,0x5,0x6,0x7,0x8,0x9,0xa,0xb,0xc,0xd,0xe,0xf, /* 5 */
0x0,0xa,0xb,0xc,0xd,0xe,0xf,0x7,0x8,0x9,0xa,0xb,0xc,0xd,0xe,0xf, /* 6 */
0x0,0x1,0x2,0x3,0x4,0x5,0x6,0x7,0x8,0x9,0xa,0xb,0xc,0xd,0xe,0xf, /* 7 */
0x0,0x1,0x2,0x3,0x4,0x5,0x6,0x7,0x8,0x9,0xa,0xb,0xc,0xd,0xe,0xf, /* 8 */
0x0,0x1,0x2,0x3,0x4,0x5,0x6,0x7,0x8,0x9,0xa,0xb,0xc,0xd,0xe,0xf, /* 9 */
0x0,0x1,0x2,0x3,0x4,0x5,0x6,0x7,0x8,0x9,0xa,0xb,0xc,0xd,0xe,0xf, /* a */
0x0,0x1,0x2,0x3,0x4,0x5,0x6,0x7,0x8,0x9,0xa,0xb,0xc,0xd,0xe,0xf, /* b */
0x0,0xa,0xb,0xc,0xd,0xe,0xf,0x7,0x8,0x9,0xa,0xb,0xc,0xd,0xe,0xf, /* c */
0x0,0x1,0x2,0x3,0x4,0x5,0x6,0x7,0x8,0x9,0xa,0xb,0xc,0xd,0xe,0xf, /* d */
0x0,0xa,0xb,0xc,0xd,0xe,0xf,0x7,0x8,0x9,0xa,0xb,0xc,0xd,0xe,0xf, /* e */
0x0,0x1,0x2,0x3,0x4,0x5,0x6,0x7,0x8,0x9,0xa,0xb,0xc,0xd,0xe,0xf /* f */
};
/*
* hex2bin - macro to convert two ASCII hex chars into binary value
*
* given:
* high - high order hex ASCII char
* low - low order hex ASCII char
*
* returns:
* numeric equivalent to 0x{high}{low} as an int
*/
#define hex2bin(high,low) \
(lowhex2bin[(int)((char)(high))]<<4 | lowhex2bin[((int)(char)(low))])
/*
* lowbin2hex - quick low order binary conversion to ASCII hex
*/
char lowbin2hex[256] = {
'0','1','2','3','4','5','6','7','8','9','a','b','c','d','e','f',
'0','1','2','3','4','5','6','7','8','9','a','b','c','d','e','f',
'0','1','2','3','4','5','6','7','8','9','a','b','c','d','e','f',
'0','1','2','3','4','5','6','7','8','9','a','b','c','d','e','f',
'0','1','2','3','4','5','6','7','8','9','a','b','c','d','e','f',
'0','1','2','3','4','5','6','7','8','9','a','b','c','d','e','f',
'0','1','2','3','4','5','6','7','8','9','a','b','c','d','e','f',
'0','1','2','3','4','5','6','7','8','9','a','b','c','d','e','f',
'0','1','2','3','4','5','6','7','8','9','a','b','c','d','e','f',
'0','1','2','3','4','5','6','7','8','9','a','b','c','d','e','f',
'0','1','2','3','4','5','6','7','8','9','a','b','c','d','e','f',
'0','1','2','3','4','5','6','7','8','9','a','b','c','d','e','f',
'0','1','2','3','4','5','6','7','8','9','a','b','c','d','e','f',
'0','1','2','3','4','5','6','7','8','9','a','b','c','d','e','f',
'0','1','2','3','4','5','6','7','8','9','a','b','c','d','e','f',
'0','1','2','3','4','5','6','7','8','9','a','b','c','d','e','f'
};
/*
* convstr2z - convert a string into a ZVALUE
*
* NOTE: No attempt is make to deal with byte order.
*
* given:
* str string to convert
*
* returns:
* ZVALUE
*/
ZVALUE
convstr2z(char *str)
{
HALF *v; /* storage for string as HALFs */
ZVALUE ret; /* return value */
size_t len; /* length in HALFs of our string rounded up */
/*
* firewall
*/
if (str == NULL || *str == '\0') {
/* NULL or empty strings return 0 */
return _zero_;
}
/*
* allocate HALF strorage
*/
len = (strlen(str)+sizeof(HALF)-1)/sizeof(HALF);
v = (HALF *)malloc(len * sizeof(HALF));
if (v == NULL) {
math_error("convstr2z bad malloc");
/*NOTREACHED*/
}
v[len-1] = 0; /* deal with possible partial end of string HALF */
/*
* initialize HALF array with string value
*/
memcpy((void *)v, (void *)str, strlen(str));
/*
* setup the rest of the ZVALUE
*/
ret.v = v;
ret.len = len;
ret.sign = 0;
ztrim(&ret);
/*
* return our result
*/
return ret;
}
/*
* convhex2z - convert hex string to ZVALUE
*
* usage:
* str hex ASCII string with optional leading 0x
*
* returns:
* ZVALUE
*/
ZVALUE
convhex2z(char *hex)
{
HALF *v; /* storage for string as HALFs */
HALF *hp; /* HALF pointer */
char *sp; /* string pointer */
ZVALUE ret; /* return value */
int len; /* length in HALFs of our string rounded up */
size_t slen; /* hex string length */
int i;
/*
* firewall
*/
if (hex == NULL || hex[0] == '\0') {
/* NULL or empty strings return 0 */
return _zero_;
}
/*
* skip leading 0X or 0x if needed
*/
if (hex[0] == '0' && (hex[1] == 'x' || hex[1] == 'X')) {
hex += 2;
}
if (hex[0] == '\0') {
/* just 0X or 0x returns 0 */
return _zero_;
}
/*
* allocate HALF strorage
*/
slen = strlen(hex);
len = ((slen*4)+BASEB-1)/BASEB;
v = (HALF *)malloc(len * sizeof(HALF));
if (v == NULL) {
math_error("convhex2z bad malloc");
/*NOTREACHED*/
}
v[len-1] = 0; /* deal with possible partial end of string HALF */
/*
* deal with the upper partial HALF value
*/
hp = v+len-1;
sp = hex;
if ((slen % (BASEB/4)) != 0) {
/* deal with a odd length hex string first */
if (slen % 2 == 1) {
*hp = hex2bin('0', *sp++);
--slen;
/* even length - top top hex char to process */
} else {
*hp = 0;
}
/* slen is even now */
/* eat two hex chars at a time until the HALF is full */
for (; (slen % (BASEB/4)) != 0; slen -= 2, sp += 2) {
*hp = ((*hp<<8) | hex2bin(sp[0], sp[1]));
}
/* move on to the next HALF */
--hp;
}
/* slen is now a multiple of BASEB/4 */
/*
* deal with full HALFs
*/
for (; slen > 0; slen -= (BASEB/4), --hp) {
/* clear HALF */
*hp = 0;
/* eat two hex chars at a time until the HALF is full */
for (i=0; i < (BASEB/4); i += 2) {
*hp = ((*hp<<8) | hex2bin(sp[i], sp[i+1]));
}
}
/*
* setup the rest of the ZVALUE
*/
ret.v = v;
ret.len = len;
ret.sign = 0;
ztrim(&ret);
/*
* return our result
*/
return ret;
}
/*
* convz2hex - convert ZVALUE to hex string
*
* We will ignore the sign of the value.
*
* usage:
* z ZVALUE
*
* returns:
* str hex ASCII malloced string (without a leading 0x)
*/
char *
convz2hex(ZVALUE z)
{
char *ret; /* string to return */
int slen; /* string length (not counting \0) */
HALF half; /* HALF value to convert */
int seen_nz; /* 0 => we have not seen a non-zero hex char (yet) */
char *p;
int i;
int j;
/*
* firewall
*/
if (z.v == NULL || ziszero(z)) {
/* malloc and return "0" */
ret = (char *)malloc(sizeof("0"));
if (ret == NULL) {
math_error("convz2hex bad malloc of 0 value");
/*NOTREACHED*/
}
ret[0] = '0';
ret[1] = '\0';
return ret;
}
/*
* malloc string storage
*/
slen = (z.len * BASEB/4);
ret = (char *)calloc(slen+1+1, sizeof(char));
if (ret == NULL) {
math_error("convz2hex bad malloc of string");
/*NOTREACHED*/
}
/*
* load in hex ASCII chars for each HALF
*
* We will not write leading '0' hex chars into the string.
*/
seen_nz = 0;
for (p=ret, i=z.len-1; i >= 0; --i) {
/*
* load in ASCII hex by ASCII hex
*/
for (half=z.v[i], j=BASEB-4; j >= 0; j-=4) {
if (seen_nz) {
/* we saw a non-zero, just load the rest */
*p++ = lowbin2hex[(half >> j) & 0xff];
} else {
/* all zeros so far */
*p = lowbin2hex[(half >> j) & 0xff];
if (*p != '0') {
/* we found our first non-zero char */
++p;
seen_nz = 1;
}
}
}
}
if (seen_nz) {
*p = '\0';
} else {
/* saw nothing but 0's, so just return 0 */
*ret = '0';
*(ret+1) = '\0';
}
/*
* return the new string
*/
return ret;
}