003 File Manager
Current Path:
/usr/src/contrib/sendmail/libsm
usr
/
src
/
contrib
/
sendmail
/
libsm
/
📁
..
📄
Makefile
(346 B)
📄
Makefile.m4
(1.92 KB)
📄
README
(4.42 KB)
📄
assert.c
(4.13 KB)
📄
assert.html
(13.86 KB)
📄
b-strcmp.c
(3.4 KB)
📄
b-strl.c
(5 KB)
📄
cdefs.html
(2.39 KB)
📄
cf.c
(1.97 KB)
📄
clock.c
(13.89 KB)
📄
clrerr.c
(872 B)
📄
config.c
(4.47 KB)
📄
debug.c
(8.91 KB)
📄
debug.html
(7.68 KB)
📄
errstring.c
(6.03 KB)
📄
exc.c
(13.05 KB)
📄
exc.html
(23.27 KB)
📄
fclose.c
(3.13 KB)
📄
feof.c
(961 B)
📄
ferror.c
(932 B)
📄
fflush.c
(3.1 KB)
📄
fget.c
(2.37 KB)
📄
findfp.c
(10.65 KB)
📄
flags.c
(1.27 KB)
📄
fopen.c
(8.3 KB)
📄
fpos.c
(3.12 KB)
📄
fprintf.c
(1.35 KB)
📄
fpurge.c
(1.15 KB)
📄
fput.c
(1.25 KB)
📄
fread.c
(2.28 KB)
📄
fscanf.c
(1.34 KB)
📄
fseek.c
(7.25 KB)
📄
fvwrite.c
(6.24 KB)
📄
fvwrite.h
(740 B)
📄
fwalk.c
(1.41 KB)
📄
fwrite.c
(1.54 KB)
📄
gen.html
(910 B)
📄
get.c
(1.12 KB)
📄
glue.h
(731 B)
📄
heap.c
(17.29 KB)
📄
heap.html
(13.07 KB)
📄
index.html
(5.95 KB)
📄
inet6_ntop.c
(1.1 KB)
📄
io.html
(26.6 KB)
📄
ldap.c
(35.72 KB)
📄
local.h
(9.42 KB)
📄
makebuf.c
(3.36 KB)
📄
match.c
(2.77 KB)
📄
mbdb.c
(16.61 KB)
📄
memstat.c
(5.13 KB)
📄
mpeix.c
(13.84 KB)
📄
niprop.c
(4.64 KB)
📄
notify.c
(3.32 KB)
📄
put.c
(1.61 KB)
📄
refill.c
(7.09 KB)
📄
rewind.c
(1.08 KB)
📄
rpool.c
(11.54 KB)
📄
rpool.html
(6.08 KB)
📄
sem.c
(4.41 KB)
📄
setvbuf.c
(4.2 KB)
📄
shm.c
(2.62 KB)
📄
signal.c
(6.75 KB)
📄
smstdio.c
(6.14 KB)
📄
snprintf.c
(2.29 KB)
📄
sscanf.c
(2.26 KB)
📄
stdio.c
(9.7 KB)
📄
strcasecmp.c
(3.14 KB)
📄
strdup.c
(2.79 KB)
📄
strerror.c
(1.27 KB)
📄
strexit.c
(2.76 KB)
📄
string.c
(1.29 KB)
📄
stringf.c
(1.77 KB)
📄
strio.c
(9.18 KB)
📄
strl.c
(7.52 KB)
📄
strrevcmp.c
(1.61 KB)
📄
strto.c
(5.45 KB)
📄
syslogio.c
(4.11 KB)
📄
t-cf.c
(934 B)
📄
t-event.c
(1.79 KB)
📄
t-exc.c
(2.75 KB)
📄
t-fget.c
(1.71 KB)
📄
t-float.c
(1.78 KB)
📄
t-fopen.c
(875 B)
📄
t-heap.c
(1.3 KB)
📄
t-inet6_ntop.c
(1.4 KB)
📄
t-match.c
(1.1 KB)
📄
t-memstat.c
(2.17 KB)
📄
t-notify.c
(1.81 KB)
📄
t-path.c
(742 B)
📄
t-qic.c
(5.43 KB)
📄
t-rpool.c
(1.5 KB)
📄
t-scanf.c
(1.38 KB)
📄
t-sem.c
(5.85 KB)
📄
t-shm.c
(4.42 KB)
📄
t-smstdio.c
(1.55 KB)
📄
t-string.c
(968 B)
📄
t-strio.c
(775 B)
📄
t-strl.c
(3.53 KB)
📄
t-strrevcmp.c
(994 B)
📄
t-types.c
(2.7 KB)
📄
test.c
(2.73 KB)
📄
ungetc.c
(3.93 KB)
📄
util.c
(4.46 KB)
📄
vasprintf.c
(2.91 KB)
📄
vfprintf.c
(24.09 KB)
📄
vfscanf.c
(18.76 KB)
📄
vprintf.c
(999 B)
📄
vsnprintf.c
(1.87 KB)
📄
wbuf.c
(2.51 KB)
📄
wsetup.c
(1.88 KB)
📄
xtrap.c
(653 B)
Editing: strto.c
/* * Copyright (c) 2000-2001 Proofpoint, Inc. and its suppliers. * All rights reserved. * Copyright (c) 1992 * The Regents of the University of California. All rights reserved. * * By using this file, you agree to the terms and conditions set * forth in the LICENSE file which can be found at the top level of * the sendmail distribution. */ #include <sm/gen.h> SM_IDSTR(id, "@(#)$Id: strto.c,v 1.19 2013-11-22 20:51:43 ca Exp $") #include <sys/param.h> #include <sys/types.h> #include <stdlib.h> #include <ctype.h> #include <errno.h> #include <sm/limits.h> #include <sm/conf.h> #include <sm/string.h> /* ** SM_STRTOLL -- Convert a string to a (signed) long long integer. ** ** Ignores `locale' stuff. Assumes that the upper and lower case ** alphabets and digits are each contiguous. ** ** Parameters: ** nptr -- string containing number ** endptr -- location of first invalid character ** base -- numeric base that 'nptr' number is based in ** ** Returns: ** Failure: on underflow LLONG_MIN is returned; on overflow ** LLONG_MAX is returned and errno is set. ** When 'endptr' == '\0' then the entire string 'nptr' ** was valid. ** Success: returns the converted number */ LONGLONG_T sm_strtoll(nptr, endptr, base) const char *nptr; char **endptr; register int base; { register bool neg; register const char *s; register LONGLONG_T acc, cutoff; register int c; register int any, cutlim; /* ** Skip white space and pick up leading +/- sign if any. ** If base is 0, allow 0x for hex and 0 for octal, else ** assume decimal; if base is already 16, allow 0x. */ s = nptr; do { c = (unsigned char) *s++; } while (isascii(c) && isspace(c)); if (c == '-') { neg = true; c = *s++; } else { neg = false; if (c == '+') c = *s++; } if ((base == 0 || base == 16) && c == '0' && (*s == 'x' || *s == 'X')) { c = s[1]; s += 2; base = 16; } if (base == 0) base = c == '0' ? 8 : 10; /* ** Compute the cutoff value between legal numbers and illegal ** numbers. That is the largest legal value, divided by the ** base. An input number that is greater than this value, if ** followed by a legal input character, is too big. One that ** is equal to this value may be valid or not; the limit ** between valid and invalid numbers is then based on the last ** digit. For instance, if the range for long-long's is ** [-9223372036854775808..9223372036854775807] and the input base ** is 10, cutoff will be set to 922337203685477580 and cutlim to ** either 7 (!neg) or 8 (neg), meaning that if we have ** accumulated a value > 922337203685477580, or equal but the ** next digit is > 7 (or 8), the number is too big, and we will ** return a range error. ** ** Set any if any `digits' consumed; make it negative to indicate ** overflow. */ cutoff = neg ? LLONG_MIN : LLONG_MAX; cutlim = cutoff % base; cutoff /= base; if (neg) { if (cutlim > 0) { cutlim -= base; cutoff += 1; } cutlim = -cutlim; } for (acc = 0, any = 0;; c = (unsigned char) *s++) { if (isascii(c) && isdigit(c)) c -= '0'; else if (isascii(c) && isalpha(c)) c -= isupper(c) ? 'A' - 10 : 'a' - 10; else break; if (c >= base) break; if (any < 0) continue; if (neg) { if (acc < cutoff || (acc == cutoff && c > cutlim)) { any = -1; acc = LLONG_MIN; errno = ERANGE; } else { any = 1; acc *= base; acc -= c; } } else { if (acc > cutoff || (acc == cutoff && c > cutlim)) { any = -1; acc = LLONG_MAX; errno = ERANGE; } else { any = 1; acc *= base; acc += c; } } } if (endptr != NULL) *endptr = (char *) (any ? s - 1 : nptr); return acc; } /* ** SM_STRTOULL -- Convert a string to an unsigned long long integer. ** ** Ignores `locale' stuff. Assumes that the upper and lower case ** alphabets and digits are each contiguous. ** ** Parameters: ** nptr -- string containing (unsigned) number ** endptr -- location of first invalid character ** base -- numeric base that 'nptr' number is based in ** ** Returns: ** Failure: on overflow ULLONG_MAX is returned and errno is set. ** When 'endptr' == '\0' then the entire string 'nptr' ** was valid. ** Success: returns the converted number */ ULONGLONG_T sm_strtoull(nptr, endptr, base) const char *nptr; char **endptr; register int base; { register const char *s; register ULONGLONG_T acc, cutoff; register int c; register bool neg; register int any, cutlim; /* See sm_strtoll for comments as to the logic used. */ s = nptr; do { c = (unsigned char) *s++; } while (isascii(c) && isspace(c)); neg = (c == '-'); if (neg) { c = *s++; } else { if (c == '+') c = *s++; } if ((base == 0 || base == 16) && c == '0' && (*s == 'x' || *s == 'X')) { c = s[1]; s += 2; base = 16; } if (base == 0) base = c == '0' ? 8 : 10; cutoff = ULLONG_MAX / (ULONGLONG_T)base; cutlim = ULLONG_MAX % (ULONGLONG_T)base; for (acc = 0, any = 0;; c = (unsigned char) *s++) { if (isascii(c) && isdigit(c)) c -= '0'; else if (isascii(c) && isalpha(c)) c -= isupper(c) ? 'A' - 10 : 'a' - 10; else break; if (c >= base) break; if (any < 0) continue; if (acc > cutoff || (acc == cutoff && c > cutlim)) { any = -1; acc = ULLONG_MAX; errno = ERANGE; } else { any = 1; acc *= (ULONGLONG_T)base; acc += c; } } if (neg && any > 0) acc = -((LONGLONG_T) acc); if (endptr != NULL) *endptr = (char *) (any ? s - 1 : nptr); return acc; }
Upload File
Create Folder