-
-
Notifications
You must be signed in to change notification settings - Fork 45
/
compat.c
488 lines (423 loc) · 10.5 KB
/
compat.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
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
/*
* Compatibility functions for those systems who are missing them.
*
* Copyright 2020 by Gray Watson
*
* This file is part of the dmalloc package.
*
* Permission to use, copy, modify, and distribute this software for
* any purpose and without fee is hereby granted, provided that the
* above copyright notice and this permission notice appear in all
* copies, and that the name of Gray Watson not be used in advertising
* or publicity pertaining to distribution of the document or software
* without specific, written prior permission.
*
* Gray Watson makes no representations about the suitability of the
* software described herein for any purpose. It is provided "as is"
* without express or implied warranty.
*
* The author may be contacted via https://dmalloc.com/
*/
/*
* This file holds the compatibility routines necessary for the library to
* function just in case your system does not have them.
*/
#if HAVE_STDARG_H
# include <stdarg.h> /* for ... */
#endif
#if HAVE_STDIO_H
# include <stdio.h>
#endif
#if HAVE_STDLIB_H
# include <stdlib.h> /* for getenv */
#endif
#define DMALLOC_DISABLE
#include "conf.h"
#include "dmalloc.h"
#include "compat.h"
#include "dmalloc_loc.h"
#if HAVE_ATOI == 0
/*
* Turn a ascii-string into an integer which is returned
*/
int atoi(const char *str)
{
const char *str_p;
int sign = 1, result = 0;
/* skip opening white space */
for (str_p = str; *str_p == ' ' || *str_p == '\t'; str_p++) {
}
/* handle sign */
if (*str_p == '-') {
sign = -1;
str_p++;
}
else if (*str_p == '+') {
/* sign is already 1 */
str_p++;
}
/* skip more white space */
for (; *str_p == ' ' || *str_p == '\t'; str_p++) {
}
/* now add up all digits */
for (; *str_p >= '0' && *str_p <= '9'; str_p++) {
result = result * 10 + *str_p - '0';
}
return result * sign;
}
#endif /* HAVE_ATOI == 0 */
#if HAVE_ATOL == 0
/*
* Turn a ascii-string into an integer which is returned
*/
long atol(const char *str)
{
const char *str_p;
long sign = 1, result = 0;
/* skip opening white space */
for (str_p = str; *str_p == ' ' || *str_p == '\t'; str_p++) {
}
/* handle sign */
if (*str_p == '-') {
sign = -1;
str_p++;
}
else if (*str_p == '+') {
/* sign is already 1 */
str_p++;
}
/* skip more white space */
for (; *str_p == ' ' || *str_p == '\t'; str_p++) {
}
/* now add up all digits */
for (; *str_p >= '0' && *str_p <= '9'; str_p++) {
result = result * (long)10 + (long)(*str_p - '0');
}
return result * sign;
}
#endif /* HAVE_ATOL == 0 */
/*
* Local ascii to unsigned long function
*/
unsigned long loc_atoul(const char *str)
{
const char *str_p;
unsigned long result = 0;
/* skip opening white space */
for (str_p = str; *str_p == ' ' || *str_p == '\t'; str_p++) {
}
/* now add up all digits */
for (; *str_p >= '0' && *str_p <= '9'; str_p++) {
result = result * (unsigned long)10 + (unsigned long)(*str_p - '0');
}
return result;
}
#if HAVE_MEMCMP == 0
/*
* Compare LEN characters, return -1,0,1 if STR1 is <,==,> STR2
*/
int memcmp(const void *str1, const void *str2, DMALLOC_SIZE len)
{
const unsigned char *str1_p, *str2_p;
for (str1_p = str1, str2_p = str2; len > 0; len--, str1_p++, str2_p++) {
if (*str1_p != *str2_p) {
return *str1_p - *str2_p;
}
}
return 0;
}
#endif /* HAVE_MEMCMP == 0 */
#if HAVE_MEMCPY == 0
/*
* Copy LEN characters from SRC to DEST
*/
void *memcpy(void *dest, const void *src, DMALLOC_SIZE len)
{
unsigned char *dest_p;
const unsigned char *src_p;
int byte_c;
if (len <= 0) {
return;
}
/*
* NOTE: should we check to make sure that it's not overlapped but
* there may be times where people want this, albeit bizarre,
* behavior.
*/
src_p = src;
dest_p = dest;
if (src_p <= dest_p && src_p + (len - 1) >= dest_p) {
/* overlap, must copy right-to-left. */
src_p += len - 1;
dest_p += len - 1;
for (byte_c = 0; byte_c < len; byte_c++) {
*dest_p-- = *src_p--;
}
} else {
for (byte_c = 0; byte_c < len; byte_c++) {
*dest_p++ = *src_p++;
}
}
return dest;
}
#endif /* HAVE_MEMCPY == 0 */
#if HAVE_MEMMOVE == 0
/*
* Copy LEN characters from SRC to DEST
*/
void *memmove(void *dest, const void *src, DMALLOC_SIZE len)
{
unsigned char *dest_p;
const unsigned char *src_p;
int byte_c;
if (len <= 0) {
return;
}
src_p = src;
dest_p = dest;
if (src_p <= dest_p && src_p + (len - 1) >= dest_p) {
/* overlap, must copy right-to-left. */
src_p += len - 1;
dest_p += len - 1;
for (byte_c = 0; byte_c < len; byte_c++) {
*dest_p-- = *src_p--;
}
} else {
for (byte_c = 0; byte_c < len; byte_c++) {
*dest_p++ = *src_p++;
}
}
return dest;
}
#endif /* HAVE_MEMMOVE == 0 */
#if HAVE_MEMSET == 0
/*
* Set LEN characters in STR to character CH
*/
void *memset(void *str, const int ch, DMALLOC_SIZE len)
{
unsigned char *str_p = str;
for (; len > 0; len--, str_p++) {
*(unsigned char *)str_p = (unsigned char)ch;
}
return str;
}
#endif /* HAVE_MEMSET == 0 */
#if HAVE_STRCHR == 0
/*
* Find CH in STR by searching backwards through the string
*/
char *strchr(const char *str, const int ch)
{
const char *str_p;
for (str_p = str; *str_p != '\0'; str_p++) {
if (*str_p == (char)ch) {
return (char *)str_p;
}
}
if (ch == '\0') {
return (char *)str_p;
}
else {
return NULL;
}
}
#endif /* HAVE_STRCHR == 0 */
#if HAVE_STRCMP == 0
/*
* Returns -1,0,1 on whether STR1 is <,==,> STR2
*/
int strcmp(const char *str1, const char *str2)
{
for (; *str1 != '\0' && *str1 == *str2; str1++, str2++) {
}
return *str1 - *str2;
}
#endif /* HAVE_STRCMP == 0 */
#if HAVE_STRCPY == 0
/*
* Copies STR2 to STR1. Returns STR1.
*/
char *strcpy(char *str1, const char *str2)
{
char *str_p;
for (str_p = str1; *str2 != '\0'; str_p++, str2++) {
*str_p = *str2;
}
*str_p = '\0';
return str1;
}
#endif /* HAVE_STRCPY == 0 */
#if HAVE_STRLEN == 0
/*
* Return the length in characters of STR
*/
int strlen(const char *str)
{
int len;
for (len = 0; *str != '\0'; str++, len++) {
}
return len;
}
#endif /* HAVE_STRLEN == 0 */
#if HAVE_STRNLEN == 0
/*
* Return the length in characters of STR limited by MAX_LENGTH.
*/
int strnlen(const char *str, const int max_length)
{
const char *str_p = str;
int len = 0;
while (len < max_length && *str_p++ != '\0') {
len++;
}
return len;
}
#endif /* HAVE_STRNLEN == 0 */
#if HAVE_STRNCMP == 0
/*
* Compare at most LEN chars in STR1 and STR2 and return -1,0,1 or
* STR1 - STR2
*/
int strncmp(const char *str1, const char *str2, const int len)
{
int len_c;
for (len_c = 0; len_c < len; len_c++, str1++, str2++) {
if (*str1 != *str2 || *str1 == '\0') {
return *str1 - *str2;
}
}
return 0;
}
#endif /* HAVE_STRNCMP == 0 */
#if HAVE_STRNCPY == 0
/*
* Copy STR2 to STR1 until LEN or null
*/
char *strncpy(char *str1, const char *str2, const int len)
{
char *str1_p, null_reached_b = 0;
int len_c;
for (len_c = 0, str1_p = str1; len_c < len; len_c++, str1_p++, str2++) {
if (null_reached_b || *str2 == '\0') {
null_reached_b = 1;
*str1_p = '\0';
}
else {
*str1_p = *str2;
}
}
return str1;
}
#endif /* HAVE_STRNCPY == 0 */
#if HAVE_STRRCHR == 0
/*
* Find CH in STR by searching backwards through the string
*/
char *strrchr(const char *str, const int ch)
{
const char *str_p, *pnt = NULL;
for (str_p = str; *str_p != '\0'; str_p++) {
if (*str_p == (char)ch) {
pnt = str_p;
}
}
if (ch == '\0') {
return (char *)str_p;
}
else {
return (char *)pnt_p;
}
}
#endif /* HAVE_STRRCHR == 0 */
#if HAVE_STRSEP == 0
/*
* char *strsep
*
* This is a function which should be in libc in every Unix. Grumble.
* It basically replaces the strtok function because it is reentrant.
* This tokenizes a string by returning the next token in a string and
* punching a \0 on the first delimiter character past the token. The
* difference from strtok is that you pass in the address of a string
* pointer which will be shifted allong the buffer being processed.
* With strtok you passed in a 0L for subsequant calls. Yeach.
*
* This will count the true number of delimiter characters in the string
* and will return an empty token (one with \0 in the zeroth position)
* if there are two delimiter characters in a row.
*
* Consider the following example:
*
* char *tok, *str_p = "1,2,3, hello there ";
*
* while (1) { tok = strsep(&str_p, " ,"); if (tok == 0L) { break; } }
*
* strsep will return as tokens: "1", "2", "3", "", "hello", "there", "".
* Notice the two empty "" tokens where there were two delimiter
* characters in a row ", " and at the end of the string where there
* was an extra delimiter character. If you want to ignore these
* tokens then add a test to see if the first character of the token
* is \0.
*
* RETURNS:
*
* Success - Pointer to the next delimited token in the string.
*
* Failure - 0L if there are no more tokens.
*
* ARGUMENTS:
*
* string_p - Pointer to a string pointer which will be searched for
* delimiters. \0's will be added to this buffer.
*
* delim - List of delimiter characters which separate our tokens. It
* does not have to remain constant through all calls across the same
* string.
*/
char *strsep(char **string_p, const char *delim)
{
char *str_p, *tok;
const char *delim_p;
/* no tokens left? */
str_p = *string_p;
if (str_p == 0L) {
return 0L;
}
/* now find end of token */
tok = str_p;
for (; *str_p != '\0'; str_p++) {
for (delim_p = delim; *delim_p != '\0'; delim_p++) {
if (*delim_p == *str_p) {
/* punch the '\0' */
*str_p = '\0';
*string_p = str_p + 1;
return tok;
}
}
}
/* there are no more delimiter characters */
*string_p = 0L;
return tok;
}
#endif /* HAVE_STRSEP == 0 */
/*
* Local getenv which handles some portability stuff.
*/
char *loc_getenv(const char *var, char *buf, const int buf_size,
const int stay_safe)
{
#if defined(__CYGWIN__) && HAVE_GETENVIRONMENTVARIABLEA
/* use this function instead of getenv */
GetEnvironmentVariableA(var, buf, buf_size);
return buf;
#else /* ! __CYGWIN__ */
#if GETENV_SAFE == 0
if (stay_safe) {
/* oh, well. no idea how to get the environmental variables */
return "";
}
#endif /* GETENV_SAFE == 0 */
/* get the options flag */
return getenv(var);
#endif /* ! __CYGWIN__ */
}