]>
Commit | Line | Data |
---|---|---|
c86edd1d Q |
1 | /* irc_string.c */ |
2 | ||
3 | #include "irc_string.h" | |
4 | #include "chattr.tab.c" | |
5 | #include <stdlib.h> | |
6 | #include <stdio.h> | |
7 | #include <errno.h> | |
8 | ||
9 | static unsigned long crc32_tab[] = { | |
10 | 0x00000000L, 0x77073096L, 0xee0e612cL, 0x990951baL, 0x076dc419L, | |
11 | 0x706af48fL, 0xe963a535L, 0x9e6495a3L, 0x0edb8832L, 0x79dcb8a4L, | |
12 | 0xe0d5e91eL, 0x97d2d988L, 0x09b64c2bL, 0x7eb17cbdL, 0xe7b82d07L, | |
13 | 0x90bf1d91L, 0x1db71064L, 0x6ab020f2L, 0xf3b97148L, 0x84be41deL, | |
14 | 0x1adad47dL, 0x6ddde4ebL, 0xf4d4b551L, 0x83d385c7L, 0x136c9856L, | |
15 | 0x646ba8c0L, 0xfd62f97aL, 0x8a65c9ecL, 0x14015c4fL, 0x63066cd9L, | |
16 | 0xfa0f3d63L, 0x8d080df5L, 0x3b6e20c8L, 0x4c69105eL, 0xd56041e4L, | |
17 | 0xa2677172L, 0x3c03e4d1L, 0x4b04d447L, 0xd20d85fdL, 0xa50ab56bL, | |
18 | 0x35b5a8faL, 0x42b2986cL, 0xdbbbc9d6L, 0xacbcf940L, 0x32d86ce3L, | |
19 | 0x45df5c75L, 0xdcd60dcfL, 0xabd13d59L, 0x26d930acL, 0x51de003aL, | |
20 | 0xc8d75180L, 0xbfd06116L, 0x21b4f4b5L, 0x56b3c423L, 0xcfba9599L, | |
21 | 0xb8bda50fL, 0x2802b89eL, 0x5f058808L, 0xc60cd9b2L, 0xb10be924L, | |
22 | 0x2f6f7c87L, 0x58684c11L, 0xc1611dabL, 0xb6662d3dL, 0x76dc4190L, | |
23 | 0x01db7106L, 0x98d220bcL, 0xefd5102aL, 0x71b18589L, 0x06b6b51fL, | |
24 | 0x9fbfe4a5L, 0xe8b8d433L, 0x7807c9a2L, 0x0f00f934L, 0x9609a88eL, | |
25 | 0xe10e9818L, 0x7f6a0dbbL, 0x086d3d2dL, 0x91646c97L, 0xe6635c01L, | |
26 | 0x6b6b51f4L, 0x1c6c6162L, 0x856530d8L, 0xf262004eL, 0x6c0695edL, | |
27 | 0x1b01a57bL, 0x8208f4c1L, 0xf50fc457L, 0x65b0d9c6L, 0x12b7e950L, | |
28 | 0x8bbeb8eaL, 0xfcb9887cL, 0x62dd1ddfL, 0x15da2d49L, 0x8cd37cf3L, | |
29 | 0xfbd44c65L, 0x4db26158L, 0x3ab551ceL, 0xa3bc0074L, 0xd4bb30e2L, | |
30 | 0x4adfa541L, 0x3dd895d7L, 0xa4d1c46dL, 0xd3d6f4fbL, 0x4369e96aL, | |
31 | 0x346ed9fcL, 0xad678846L, 0xda60b8d0L, 0x44042d73L, 0x33031de5L, | |
32 | 0xaa0a4c5fL, 0xdd0d7cc9L, 0x5005713cL, 0x270241aaL, 0xbe0b1010L, | |
33 | 0xc90c2086L, 0x5768b525L, 0x206f85b3L, 0xb966d409L, 0xce61e49fL, | |
34 | 0x5edef90eL, 0x29d9c998L, 0xb0d09822L, 0xc7d7a8b4L, 0x59b33d17L, | |
35 | 0x2eb40d81L, 0xb7bd5c3bL, 0xc0ba6cadL, 0xedb88320L, 0x9abfb3b6L, | |
36 | 0x03b6e20cL, 0x74b1d29aL, 0xead54739L, 0x9dd277afL, 0x04db2615L, | |
37 | 0x73dc1683L, 0xe3630b12L, 0x94643b84L, 0x0d6d6a3eL, 0x7a6a5aa8L, | |
38 | 0xe40ecf0bL, 0x9309ff9dL, 0x0a00ae27L, 0x7d079eb1L, 0xf00f9344L, | |
39 | 0x8708a3d2L, 0x1e01f268L, 0x6906c2feL, 0xf762575dL, 0x806567cbL, | |
40 | 0x196c3671L, 0x6e6b06e7L, 0xfed41b76L, 0x89d32be0L, 0x10da7a5aL, | |
41 | 0x67dd4accL, 0xf9b9df6fL, 0x8ebeeff9L, 0x17b7be43L, 0x60b08ed5L, | |
42 | 0xd6d6a3e8L, 0xa1d1937eL, 0x38d8c2c4L, 0x4fdff252L, 0xd1bb67f1L, | |
43 | 0xa6bc5767L, 0x3fb506ddL, 0x48b2364bL, 0xd80d2bdaL, 0xaf0a1b4cL, | |
44 | 0x36034af6L, 0x41047a60L, 0xdf60efc3L, 0xa867df55L, 0x316e8eefL, | |
45 | 0x4669be79L, 0xcb61b38cL, 0xbc66831aL, 0x256fd2a0L, 0x5268e236L, | |
46 | 0xcc0c7795L, 0xbb0b4703L, 0x220216b9L, 0x5505262fL, 0xc5ba3bbeL, | |
47 | 0xb2bd0b28L, 0x2bb45a92L, 0x5cb36a04L, 0xc2d7ffa7L, 0xb5d0cf31L, | |
48 | 0x2cd99e8bL, 0x5bdeae1dL, 0x9b64c2b0L, 0xec63f226L, 0x756aa39cL, | |
49 | 0x026d930aL, 0x9c0906a9L, 0xeb0e363fL, 0x72076785L, 0x05005713L, | |
50 | 0x95bf4a82L, 0xe2b87a14L, 0x7bb12baeL, 0x0cb61b38L, 0x92d28e9bL, | |
51 | 0xe5d5be0dL, 0x7cdcefb7L, 0x0bdbdf21L, 0x86d3d2d4L, 0xf1d4e242L, | |
52 | 0x68ddb3f8L, 0x1fda836eL, 0x81be16cdL, 0xf6b9265bL, 0x6fb077e1L, | |
53 | 0x18b74777L, 0x88085ae6L, 0xff0f6a70L, 0x66063bcaL, 0x11010b5cL, | |
54 | 0x8f659effL, 0xf862ae69L, 0x616bffd3L, 0x166ccf45L, 0xa00ae278L, | |
55 | 0xd70dd2eeL, 0x4e048354L, 0x3903b3c2L, 0xa7672661L, 0xd06016f7L, | |
56 | 0x4969474dL, 0x3e6e77dbL, 0xaed16a4aL, 0xd9d65adcL, 0x40df0b66L, | |
57 | 0x37d83bf0L, 0xa9bcae53L, 0xdebb9ec5L, 0x47b2cf7fL, 0x30b5ffe9L, | |
58 | 0xbdbdf21cL, 0xcabac28aL, 0x53b39330L, 0x24b4a3a6L, 0xbad03605L, | |
59 | 0xcdd70693L, 0x54de5729L, 0x23d967bfL, 0xb3667a2eL, 0xc4614ab8L, | |
60 | 0x5d681b02L, 0x2a6f2b94L, 0xb40bbe37L, 0xc30c8ea1L, 0x5a05df1bL, | |
61 | 0x2d02ef8dL | |
62 | }; | |
63 | ||
c86edd1d Q |
64 | int match2strings(const char *patrn, const char *string) { |
65 | return !match(patrn,string); | |
66 | } | |
67 | ||
68 | int match2patterns(const char *patrn, const char *string) { | |
69 | return !mmatch(patrn,string); | |
70 | } | |
c86edd1d Q |
71 | |
72 | /* This computes a 32 bit CRC of the data in the buffer, and returns the */ | |
73 | /* CRC. The polynomial used is 0xedb88320. */ | |
74 | /* ============================================================= */ | |
75 | /* COPYRIGHT (C) 1986 Gary S. Brown. You may use this program, or */ | |
76 | /* code or tables extracted from it, as desired without restriction. */ | |
77 | /* Modified by Fox: no more length parameter, always does the whole string */ | |
78 | unsigned long crc32(const char *s) { | |
79 | const char *cp; | |
80 | unsigned long crc32val; | |
81 | ||
82 | crc32val = 0; | |
83 | for (cp=s;*cp;cp++) { | |
84 | crc32val=crc32_tab[(crc32val^(*cp)) & 0xff] ^ (crc32val >> 8); | |
85 | } | |
86 | return crc32val; | |
87 | } | |
88 | ||
89 | /* Case insensitive version of the above */ | |
90 | unsigned long crc32i(const char *s) { | |
91 | const char *cp; | |
92 | unsigned long crc32val; | |
93 | ||
94 | crc32val = 0; | |
95 | for (cp=s;*cp;cp++) { | |
96 | crc32val=crc32_tab[(crc32val^(ToLower(*cp))) & 0xff] ^ (crc32val >> 8); | |
97 | } | |
98 | return crc32val; | |
99 | } | |
100 | ||
061b68ab | 101 | /* @GPL |
c86edd1d Q |
102 | * ircd_strcmp - case insensitive comparison of 2 strings |
103 | */ | |
104 | int ircd_strcmp(const char *a, const char *b) { | |
105 | const char* ra = a; | |
106 | const char* rb = b; | |
107 | while (ToLower(*ra) == ToLower(*rb)) { | |
108 | if (!*ra++) | |
109 | return 0; | |
110 | else | |
111 | ++rb; | |
112 | } | |
113 | return (*ra - *rb); | |
114 | } | |
115 | ||
061b68ab | 116 | /* @GPL |
c86edd1d Q |
117 | * ircd_strncmp - counted case insensitive comparison of 2 strings |
118 | */ | |
119 | int ircd_strncmp(const char *a, const char *b, size_t n) { | |
120 | const char* ra = a; | |
121 | const char* rb = b; | |
122 | int left = n; | |
123 | if (!left--) | |
124 | return 0; | |
125 | while (ToLower(*ra) == ToLower(*rb)) { | |
126 | if (!*ra++ || !left--) | |
127 | return 0; | |
128 | else | |
129 | ++rb; | |
130 | } | |
131 | return (*ra - *rb); | |
132 | } | |
133 | ||
134 | /* | |
135 | * delchars: deletes characters occuring in badchars from string | |
136 | */ | |
137 | ||
138 | char *delchars(char *string, const char *badchars) { | |
139 | char *s,*d; | |
140 | const char *b; | |
141 | int isbad; | |
142 | ||
143 | s=d=string; | |
144 | while (*s) { | |
145 | isbad=0; | |
146 | for(b=badchars;*b;b++) { | |
147 | if (*b==*s) { | |
148 | isbad=1; | |
149 | break; | |
150 | } | |
151 | } | |
152 | if (isbad) { | |
153 | s++; | |
154 | } else { | |
155 | *d++=*s++; | |
156 | } | |
157 | } | |
158 | *d='\0'; | |
159 | ||
160 | return string; | |
161 | } | |
162 | ||
163 | /* | |
164 | * IPtostr: | |
165 | * Converts a long into a "p.q.r.s" IP address | |
166 | */ | |
167 | ||
168 | const char *IPtostr(unsigned long IP) { | |
169 | static char buf[16]; | |
170 | ||
171 | sprintf(buf,"%lu.%lu.%lu.%lu",(IP>>24),(IP>>16)&255,(IP>>8)&255,IP&255); | |
172 | ||
173 | return buf; | |
174 | } | |
175 | ||
176 | /* | |
177 | * longtoduration: | |
178 | * Converts a specified number of seconds into a duration string. | |
179 | * format: 0 for the "/stats u" compatible output, 1 for more human-friendly output. | |
180 | */ | |
181 | ||
182 | const char *longtoduration(unsigned long interval, int format) { | |
183 | int days,hours,minutes,seconds; | |
184 | static char outstring[50]; | |
185 | int pos=0; | |
186 | ||
187 | seconds=interval%60; | |
188 | minutes=(interval%3600)/60; | |
189 | hours=(interval%(3600*24))/3600; | |
190 | days=interval/(3600*24); | |
191 | ||
192 | if (days>0 || format==0) { | |
193 | sprintf(outstring,"%d day%s, %02d:%02d:%02d", | |
194 | days,(days==1)?"":"s",hours,minutes,seconds); | |
195 | } else { | |
196 | if (hours>0) { | |
197 | pos += sprintf(outstring+pos,"%d hour%s ",hours,hours==1?"":"s"); | |
198 | } | |
199 | if (minutes>0 || (hours>0 && seconds>0)) { | |
200 | pos += sprintf(outstring+pos,"%d minute%s ",minutes,minutes==1?"":"s"); | |
201 | } | |
202 | if (seconds>0) { | |
203 | pos += sprintf(outstring+pos,"%d second%s ",seconds,seconds==1?"":"s"); | |
204 | } | |
205 | } | |
206 | ||
207 | return outstring; | |
208 | } | |
209 | ||
210 | /* | |
211 | * durationtolong: | |
212 | * Converts the specified string into a number of seconds, as per O | |
213 | */ | |
214 | ||
215 | int durationtolong(const char *string) { | |
216 | int total=0; | |
217 | int current=0; | |
218 | char *ch=string,*och; | |
219 | ||
220 | while (*ch) { | |
221 | och=ch; | |
222 | current=strtol(ch,&ch,10); | |
223 | if (och==ch) /* No numbers found */ | |
224 | break; | |
225 | if (current) { | |
226 | switch (*ch++) { | |
227 | case '\0': | |
228 | ch--; | |
229 | /* Drop through */ | |
230 | case 's': | |
231 | total+=current; | |
232 | break; | |
233 | ||
234 | case 'm': | |
235 | total+=(current * 60); | |
236 | break; | |
237 | ||
238 | case 'h': | |
239 | total+=(current * 3600); | |
240 | break; | |
241 | ||
242 | case 'd': | |
243 | total+=(current * 86400); | |
244 | break; | |
245 | ||
246 | case 'w': | |
247 | total+=(current * 604800); | |
248 | break; | |
249 | ||
250 | case 'M': | |
251 | total+=(current * 2592000); | |
252 | break; | |
253 | ||
254 | case 'y': | |
255 | total+=(current * 31557600); | |
256 | } | |
257 | } | |
258 | } | |
259 | return total; | |
260 | } | |
061b68ab | 261 | /* @GPL |
c86edd1d Q |
262 | * mmatch() |
263 | * | |
264 | * Written by Run (carlo@runaway.xs4all.nl), 25-10-96 | |
265 | * | |
266 | * | |
267 | * From: Carlo Wood <carlo@runaway.xs4all.nl> | |
268 | * Message-Id: <199609021026.MAA02393@runaway.xs4all.nl> | |
269 | * Subject: [C-Com] Analysis for `mmatch' (was: gline4 problem) | |
270 | * To: coder-com@mail.undernet.org (coder committee) | |
271 | * Date: Mon, 2 Sep 1996 12:26:01 +0200 (MET DST) | |
272 | * | |
273 | * We need a new function `mmatch(const char *old_mask, const char *new_mask)' | |
274 | * which returns `true' likewise the current `match' (start with copying it), | |
275 | * but which treats '*' and '?' in `new_mask' differently (not "\*" and "\?" !) | |
276 | * as follows: a '*' in `new_mask' does not match a '?' in `old_mask' and | |
277 | * a '?' in `new_mask' does not match a '\?' in `old_mask'. | |
278 | * And ofcourse... a '*' in `new_mask' does not match a '\*' in `old_mask'... | |
279 | * And last but not least, '\?' and '\*' in `new_mask' now become one character. | |
280 | */ | |
281 | ||
282 | int mmatch(const char *old_mask, const char *new_mask) | |
283 | { | |
284 | const char *m = old_mask; | |
285 | const char *n = new_mask; | |
286 | const char *ma = m; | |
287 | const char *na = n; | |
288 | int wild = 0; | |
289 | int mq = 0, nq = 0; | |
290 | ||
291 | while (1) | |
292 | { | |
293 | if (*m == '*') | |
294 | { | |
295 | while (*m == '*') | |
296 | m++; | |
297 | wild = 1; | |
298 | ma = m; | |
299 | na = n; | |
300 | } | |
301 | ||
302 | if (!*m) | |
303 | { | |
304 | if (!*n) | |
305 | return 0; | |
306 | for (m--; (m > old_mask) && (*m == '?'); m--) | |
307 | ; | |
308 | if ((*m == '*') && (m > old_mask) && (m[-1] != '\\')) | |
309 | return 0; | |
310 | if (!wild) | |
311 | return 1; | |
312 | m = ma; | |
313 | ||
314 | /* Added to `mmatch' : Because '\?' and '\*' now is one character: */ | |
315 | if ((*na == '\\') && ((na[1] == '*') || (na[1] == '?'))) | |
316 | ++na; | |
317 | ||
318 | n = ++na; | |
319 | } | |
320 | else if (!*n) | |
321 | { | |
322 | while (*m == '*') | |
323 | m++; | |
324 | return (*m != 0); | |
325 | } | |
326 | if ((*m == '\\') && ((m[1] == '*') || (m[1] == '?'))) | |
327 | { | |
328 | m++; | |
329 | mq = 1; | |
330 | } | |
331 | else | |
332 | mq = 0; | |
333 | ||
334 | /* Added to `mmatch' : Because '\?' and '\*' now is one character: */ | |
335 | if ((*n == '\\') && ((n[1] == '*') || (n[1] == '?'))) | |
336 | { | |
337 | n++; | |
338 | nq = 1; | |
339 | } | |
340 | else | |
341 | nq = 0; | |
342 | ||
343 | /* | |
344 | * This `if' has been changed compared to match() to do the following: | |
345 | * Match when: | |
346 | * old (m) new (n) boolean expression | |
347 | * * any (*m == '*' && !mq) || | |
348 | * ? any except '*' (*m == '?' && !mq && (*n != '*' || nq)) || | |
349 | * any except * or ? same as m (!((*m == '*' || *m == '?') && !mq) && | |
350 | * ToLower(*m) == ToLower(*n) && | |
351 | * !((mq && !nq) || (!mq && nq))) | |
352 | * | |
353 | * Here `any' also includes \* and \? ! | |
354 | * | |
355 | * After reworking the boolean expressions, we get: | |
356 | * (Optimized to use boolean shortcircuits, with most frequently occuring | |
357 | * cases upfront (which took 2 hours!)). | |
358 | */ | |
359 | if ((*m == '*' && !mq) || | |
360 | ((!mq || nq) && ToLower(*m) == ToLower(*n)) || | |
361 | (*m == '?' && !mq && (*n != '*' || nq))) | |
362 | { | |
363 | if (*m) | |
364 | m++; | |
365 | if (*n) | |
366 | n++; | |
367 | } | |
368 | else | |
369 | { | |
370 | if (!wild) | |
371 | return 1; | |
372 | m = ma; | |
373 | ||
374 | /* Added to `mmatch' : Because '\?' and '\*' now is one character: */ | |
375 | if ((*na == '\\') && ((na[1] == '*') || (na[1] == '?'))) | |
376 | ++na; | |
377 | ||
378 | n = ++na; | |
379 | } | |
380 | } | |
381 | } | |
382 | ||
383 | /* | |
384 | * Compare if a given string (name) matches the given | |
385 | * mask (which can contain wild cards: '*' - match any | |
386 | * number of chars, '?' - match any single character. | |
387 | * | |
388 | * return 0, if match | |
389 | * 1, if no match | |
390 | */ | |
391 | ||
061b68ab | 392 | /* @GPL |
c86edd1d Q |
393 | * match |
394 | * | |
395 | * Rewritten by Andrea Cocito (Nemesi), November 1998. | |
396 | * | |
397 | */ | |
398 | ||
399 | /****************** Nemesi's match() ***************/ | |
400 | ||
401 | int match(const char *mask, const char *string) | |
402 | { | |
403 | const char *m = mask, *s = string; | |
404 | char ch; | |
405 | const char *bm, *bs; /* Will be reg anyway on a decent CPU/compiler */ | |
406 | ||
407 | /* Process the "head" of the mask, if any */ | |
408 | while ((ch = *m++) && (ch != '*')) | |
409 | switch (ch) | |
410 | { | |
411 | case '\\': | |
412 | if (*m == '?' || *m == '*') | |
413 | ch = *m++; | |
414 | default: | |
415 | if (ToLower(*s) != ToLower(ch)) | |
416 | return 1; | |
417 | case '?': | |
418 | if (!*s++) | |
419 | return 1; | |
420 | }; | |
421 | if (!ch) | |
422 | return *s; | |
423 | ||
424 | /* We got a star: quickly find if/where we match the next char */ | |
425 | got_star: | |
426 | bm = m; /* Next try rollback here */ | |
427 | while ((ch = *m++)) | |
428 | switch (ch) | |
429 | { | |
430 | case '?': | |
431 | if (!*s++) | |
432 | return 1; | |
433 | case '*': | |
434 | bm = m; | |
435 | continue; /* while */ | |
436 | case '\\': | |
437 | if (*m == '?' || *m == '*') | |
438 | ch = *m++; | |
439 | default: | |
440 | goto break_while; /* C is structured ? */ | |
441 | }; | |
442 | break_while: | |
443 | if (!ch) | |
444 | return 0; /* mask ends with '*', we got it */ | |
445 | ch = ToLower(ch); | |
446 | while (ToLower(*s++) != ch) | |
447 | if (!*s) | |
448 | return 1; | |
449 | bs = s; /* Next try start from here */ | |
450 | ||
451 | /* Check the rest of the "chunk" */ | |
452 | while ((ch = *m++)) | |
453 | { | |
454 | switch (ch) | |
455 | { | |
456 | case '*': | |
457 | goto got_star; | |
458 | case '\\': | |
459 | if (*m == '?' || *m == '*') | |
460 | ch = *m++; | |
461 | default: | |
462 | if (ToLower(*s) != ToLower(ch)) | |
463 | { | |
464 | /* If we've run out of string, give up */ | |
465 | if (!*bs) | |
466 | return 1; | |
467 | m = bm; | |
468 | s = bs; | |
469 | goto got_star; | |
470 | }; | |
471 | case '?': | |
472 | if (!*s++) | |
473 | return 1; | |
474 | }; | |
475 | }; | |
476 | if (*s) | |
477 | { | |
478 | m = bm; | |
479 | s = bs; | |
480 | goto got_star; | |
481 | }; | |
482 | return 0; | |
483 | } | |
484 | ||
061b68ab | 485 | /* @GPL |
c86edd1d Q |
486 | * collapse() |
487 | * Collapse a pattern string into minimal components. | |
488 | * This particular version is "in place", so that it changes the pattern | |
489 | * which is to be reduced to a "minimal" size. | |
490 | * | |
491 | * (C) Carlo Wood - 6 Oct 1998 | |
492 | * Speedup rewrite by Andrea Cocito, December 1998. | |
493 | * Note that this new optimized alghoritm can *only* work in place. | |
494 | */ | |
495 | ||
496 | char *collapse(char *mask) | |
497 | { | |
498 | int star = 0; | |
499 | char *m = mask; | |
500 | char *b; | |
501 | ||
502 | if (m) | |
503 | { | |
504 | do | |
505 | { | |
506 | if ((*m == '*') && ((m[1] == '*') || (m[1] == '?'))) | |
507 | { | |
508 | b = m; | |
509 | do | |
510 | { | |
511 | if (*m == '*') | |
512 | star = 1; | |
513 | else | |
514 | { | |
515 | if (star && (*m != '?')) | |
516 | { | |
517 | *b++ = '*'; | |
518 | star = 0; | |
519 | }; | |
520 | *b++ = *m; | |
521 | if ((*m == '\\') && ((m[1] == '*') || (m[1] == '?'))) | |
522 | *b++ = *++m; | |
523 | }; | |
524 | } | |
525 | while (*m++); | |
526 | break; | |
527 | } | |
528 | else | |
529 | { | |
530 | if ((*m == '\\') && ((m[1] == '*') || (m[1] == '?'))) | |
531 | m++; | |
532 | }; | |
533 | } | |
534 | while (*m++); | |
535 | }; | |
536 | return mask; | |
537 | } | |
538 | ||
539 | /* a protected version of atoi that will return an error if broke/etc */ | |
540 | int protectedatoi(char *buf, int *value) { | |
541 | char *ep; | |
542 | long lval; | |
543 | ||
544 | errno = 0; | |
545 | lval = strtol(buf, &ep, 10); | |
546 | if (buf[0] == '\0' || *ep != '\0') | |
547 | return 0; | |
548 | ||
549 | if ((errno == ERANGE && (lval == LONG_MAX || lval == LONG_MIN)) || (lval > INT_MAX || lval < INT_MIN)) | |
550 | return 0; | |
551 | ||
552 | *value = lval; | |
553 | return 1; | |
554 | } |