mirror of https://git.musl-libc.org/git/musl
Browse Source
the old resolver code used a function __ipparse which contained the logic for inet_addr and inet_aton, which is needed in getaddrinfo. this was phased out in the resolver overhaul in favor of directly using inet_aton and inet_pton as appropriate. this commit cleans up some stuff that was left behind.master
6 changed files with 49 additions and 79 deletions
@ -1,14 +0,0 @@ |
|||||
#include <stddef.h> |
|
||||
|
|
||||
#define RR_A 1 |
|
||||
#define RR_CNAME 5 |
|
||||
#define RR_PTR 12 |
|
||||
#define RR_AAAA 28 |
|
||||
|
|
||||
int __dns_count_addrs(const unsigned char *, int); |
|
||||
int __dns_get_rr(void *, size_t, size_t, size_t, const unsigned char *, int, int); |
|
||||
|
|
||||
int __dns_query(unsigned char *, const void *, int, int); |
|
||||
int __ipparse(void *, int, const char *); |
|
||||
|
|
||||
int __dns_doqueries(unsigned char *, const char *, int *, int); |
|
||||
@ -1,51 +0,0 @@ |
|||||
#include <stdlib.h> |
|
||||
#include <ctype.h> |
|
||||
#include <sys/socket.h> |
|
||||
#include <netinet/in.h> |
|
||||
#include <arpa/inet.h> |
|
||||
#include "__dns.h" |
|
||||
|
|
||||
int __ipparse(void *dest, int family, const char *s0) |
|
||||
{ |
|
||||
const char *s = s0; |
|
||||
unsigned char *d = dest; |
|
||||
unsigned long a[16] = { 0 }; |
|
||||
char *z; |
|
||||
int i; |
|
||||
|
|
||||
if (family == AF_INET6) goto not_v4; |
|
||||
|
|
||||
for (i=0; i<4; i++) { |
|
||||
a[i] = strtoul(s, &z, 0); |
|
||||
if (z==s || (*z && *z != '.') || !isdigit(*s)) { |
|
||||
if (family == AF_INET) return -1; |
|
||||
goto not_v4; |
|
||||
} |
|
||||
if (!*z) break; |
|
||||
s=z+1; |
|
||||
} |
|
||||
if (i==4) return -1; |
|
||||
switch (i) { |
|
||||
case 0: |
|
||||
a[1] = a[0] & 0xffffff; |
|
||||
a[0] >>= 24; |
|
||||
case 1: |
|
||||
a[2] = a[1] & 0xffff; |
|
||||
a[1] >>= 16; |
|
||||
case 2: |
|
||||
a[3] = a[2] & 0xff; |
|
||||
a[2] >>= 8; |
|
||||
} |
|
||||
((struct sockaddr_in *)d)->sin_family = AF_INET; |
|
||||
d = (void *)&((struct sockaddr_in *)d)->sin_addr; |
|
||||
for (i=0; i<4; i++) { |
|
||||
if (a[i] > 255) return -1; |
|
||||
d[i] = a[i]; |
|
||||
} |
|
||||
return 0; |
|
||||
|
|
||||
not_v4: |
|
||||
s = s0; |
|
||||
((struct sockaddr_in6 *)d)->sin6_family = AF_INET6; |
|
||||
return inet_pton(AF_INET6, s, (void *)&((struct sockaddr_in6 *)d)->sin6_addr) <= 0 ? -1 : 0; |
|
||||
} |
|
||||
@ -1,11 +1,12 @@ |
|||||
#include <sys/socket.h> |
#include <sys/socket.h> |
||||
#include <netinet/in.h> |
#include <netinet/in.h> |
||||
#include <arpa/inet.h> |
#include <arpa/inet.h> |
||||
#include "__dns.h" |
|
||||
|
int __inet_aton(const char *, struct in_addr *); |
||||
|
|
||||
in_addr_t inet_addr(const char *p) |
in_addr_t inet_addr(const char *p) |
||||
{ |
{ |
||||
struct sockaddr_in sin; |
struct in_addr a; |
||||
if (__ipparse(&sin, AF_INET, p) < 0) return -1; |
if (!__inet_aton(p, &a)) return -1; |
||||
return sin.sin_addr.s_addr; |
return a.s_addr; |
||||
} |
} |
||||
|
|||||
@ -0,0 +1,41 @@ |
|||||
|
#include <ctype.h> |
||||
|
#include <sys/socket.h> |
||||
|
#include <netinet/in.h> |
||||
|
#include <arpa/inet.h> |
||||
|
#include "libc.h" |
||||
|
|
||||
|
int __inet_aton(const char *s0, struct in_addr *dest) |
||||
|
{ |
||||
|
const char *s = s0; |
||||
|
unsigned char *d = (void *)dest; |
||||
|
unsigned long a[4] = { 0 }; |
||||
|
char *z; |
||||
|
int i; |
||||
|
|
||||
|
for (i=0; i<4; i++) { |
||||
|
a[i] = strtoul(s, &z, 0); |
||||
|
if (z==s || (*z && *z != '.') || !isdigit(*s)) |
||||
|
return 0; |
||||
|
if (!*z) break; |
||||
|
s=z+1; |
||||
|
} |
||||
|
if (i==4) return 0; |
||||
|
switch (i) { |
||||
|
case 0: |
||||
|
a[1] = a[0] & 0xffffff; |
||||
|
a[0] >>= 24; |
||||
|
case 1: |
||||
|
a[2] = a[1] & 0xffff; |
||||
|
a[1] >>= 16; |
||||
|
case 2: |
||||
|
a[3] = a[2] & 0xff; |
||||
|
a[2] >>= 8; |
||||
|
} |
||||
|
for (i=0; i<4; i++) { |
||||
|
if (a[i] > 255) return 0; |
||||
|
d[i] = a[i]; |
||||
|
} |
||||
|
return 1; |
||||
|
} |
||||
|
|
||||
|
weak_alias(__inet_aton, inet_aton); |
||||
Loading…
Reference in new issue