003 File Manager
Current Path:
/usr/src/sys/libkern
usr
/
src
/
sys
/
libkern
/
📁
..
📄
arc4random.c
(6.91 KB)
📄
arc4random_uniform.c
(1.78 KB)
📁
arm
📁
arm64
📄
ashldi3.c
(2.43 KB)
📄
ashrdi3.c
(2.56 KB)
📄
asprintf.c
(2.17 KB)
📄
bcd.c
(1.67 KB)
📄
bcmp.c
(4.2 KB)
📄
bcopy.c
(4.13 KB)
📄
bsearch.c
(3.07 KB)
📄
cmpdi2.c
(2.18 KB)
📄
divdi3.c
(2.2 KB)
📄
explicit_bzero.c
(512 B)
📄
ffs.c
(1.84 KB)
📄
ffsl.c
(1.85 KB)
📄
ffsll.c
(1.82 KB)
📄
fls.c
(1.84 KB)
📄
flsl.c
(1.84 KB)
📄
flsll.c
(1.85 KB)
📄
fnmatch.c
(5.89 KB)
📄
gsb_crc32.c
(42.96 KB)
📄
iconv.c
(13.11 KB)
📄
iconv_converter_if.m
(2.11 KB)
📄
iconv_ucs.c
(12.47 KB)
📄
iconv_xlat.c
(3.39 KB)
📄
iconv_xlat16.c
(8.47 KB)
📄
inet_aton.c
(3.41 KB)
📄
inet_ntoa.c
(1.8 KB)
📄
inet_ntop.c
(4.94 KB)
📄
inet_pton.c
(5.21 KB)
📄
jenkins_hash.c
(16.09 KB)
📄
lshrdi3.c
(2.24 KB)
📄
mcount.c
(8.52 KB)
📄
memcchr.c
(3.27 KB)
📄
memchr.c
(1.99 KB)
📄
memcmp.c
(2 KB)
📄
memmem.c
(2.39 KB)
📄
memset.c
(1.61 KB)
📄
moddi3.c
(2.22 KB)
📄
murmur3_32.c
(3.4 KB)
📄
qdivrem.c
(7.47 KB)
📄
qsort.c
(5.95 KB)
📄
qsort_r.c
(156 B)
📄
quad.h
(4.16 KB)
📄
random.c
(1.92 KB)
📄
scanc.c
(1.93 KB)
📄
strcasecmp.c
(2.52 KB)
📄
strcasestr.c
(2.4 KB)
📄
strcat.c
(1.83 KB)
📄
strchr.c
(1.88 KB)
📄
strchrnul.c
(1.57 KB)
📄
strcmp.c
(1.96 KB)
📄
strcpy.c
(1.82 KB)
📄
strcspn.c
(2.36 KB)
📄
strdup.c
(2.15 KB)
📄
strlcat.c
(2.56 KB)
📄
strlcpy.c
(1.64 KB)
📄
strlen.c
(3.77 KB)
📄
strncat.c
(2.23 KB)
📄
strncmp.c
(1.92 KB)
📄
strncpy.c
(2.15 KB)
📄
strndup.c
(1.98 KB)
📄
strnlen.c
(1.61 KB)
📄
strrchr.c
(1.89 KB)
📄
strsep.c
(2.63 KB)
📄
strspn.c
(2.32 KB)
📄
strstr.c
(2.11 KB)
📄
strtol.c
(4.06 KB)
📄
strtoq.c
(4.09 KB)
📄
strtoul.c
(3.13 KB)
📄
strtouq.c
(3.08 KB)
📄
strvalid.c
(2.04 KB)
📄
timingsafe_bcmp.c
(1.08 KB)
📄
ucmpdi2.c
(2.32 KB)
📄
udivdi3.c
(1.97 KB)
📄
umoddi3.c
(2 KB)
📁
x86
Editing: inet_aton.c
/*- * SPDX-License-Identifier: BSD-2-Clause-FreeBSD * * Copyright (c) 2001 Charles Mott <cm@linktel.net> * All rights reserved. * * Redistribution and use in source and binary forms, with or without * modification, are permitted provided that the following conditions * are met: * 1. Redistributions of source code must retain the above copyright * notice, this list of conditions and the following disclaimer. * 2. Redistributions in binary form must reproduce the above copyright * notice, this list of conditions and the following disclaimer in the * documentation and/or other materials provided with the distribution. * * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF * SUCH DAMAGE. */ #include <sys/cdefs.h> __FBSDID("$FreeBSD$"); #include <sys/param.h> #include <sys/ctype.h> #include <sys/limits.h> #include <sys/systm.h> #include <netinet/in.h> int inet_aton(const char *cp, struct in_addr *addr) { u_long parts[4]; in_addr_t val; const char *c; char *endptr; int gotend, n; c = (const char *)cp; n = 0; /* * Run through the string, grabbing numbers until * the end of the string, or some error */ gotend = 0; while (!gotend) { unsigned long l; l = strtoul(c, &endptr, 0); if (l == ULONG_MAX || (l == 0 && endptr == c)) return (0); val = (in_addr_t)l; /* * If the whole string is invalid, endptr will equal * c.. this way we can make sure someone hasn't * gone '.12' or something which would get past * the next check. */ if (endptr == c) return (0); parts[n] = val; c = endptr; /* Check the next character past the previous number's end */ switch (*c) { case '.' : /* Make sure we only do 3 dots .. */ if (n == 3) /* Whoops. Quit. */ return (0); n++; c++; break; case '\0': gotend = 1; break; default: if (isspace((unsigned char)*c)) { gotend = 1; break; } else { /* Invalid character, then fail. */ return (0); } } } /* Concoct the address according to the number of parts specified. */ switch (n) { case 0: /* a -- 32 bits */ /* * Nothing is necessary here. Overflow checking was * already done in strtoul(). */ break; case 1: /* a.b -- 8.24 bits */ if (val > 0xffffff || parts[0] > 0xff) return (0); val |= parts[0] << 24; break; case 2: /* a.b.c -- 8.8.16 bits */ if (val > 0xffff || parts[0] > 0xff || parts[1] > 0xff) return (0); val |= (parts[0] << 24) | (parts[1] << 16); break; case 3: /* a.b.c.d -- 8.8.8.8 bits */ if (val > 0xff || parts[0] > 0xff || parts[1] > 0xff || parts[2] > 0xff) return (0); val |= (parts[0] << 24) | (parts[1] << 16) | (parts[2] << 8); break; } if (addr != NULL) addr->s_addr = htonl(val); return (1); }
Upload File
Create Folder