| /* dnsmasq is Copyright (c) 2000-2007 Simon Kelley |
| |
| This program is free software; you can redistribute it and/or modify |
| it under the terms of the GNU General Public License as published by |
| the Free Software Foundation; version 2 dated June, 1991, or |
| (at your option) version 3 dated 29 June, 2007. |
| |
| This program is distributed in the hope that it will be useful, |
| but WITHOUT ANY WARRANTY; without even the implied warranty of |
| MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
| GNU General Public License for more details. |
| |
| You should have received a copy of the GNU General Public License |
| along with this program. If not, see <http://www.gnu.org/licenses/>. |
| */ |
| |
| /* Some code in this file contributed by Rob Funk. */ |
| |
| #include "dnsmasq.h" |
| |
| #ifdef HAVE_BROKEN_RTC |
| #include <sys/times.h> |
| #endif |
| |
| /* Prefer arc4random(3) over random(3) over rand(3) */ |
| /* Also prefer /dev/urandom over /dev/random, to preserve the entropy pool */ |
| #ifdef HAVE_ARC4RANDOM |
| # define rand() arc4random() |
| # define srand(s) (void)0 |
| # define RANDFILE (NULL) |
| #else |
| # ifdef HAVE_RANDOM |
| # define rand() random() |
| # define srand(s) srandom(s) |
| # endif |
| # ifdef HAVE_DEV_URANDOM |
| # define RANDFILE "/dev/urandom" |
| # else |
| # ifdef HAVE_DEV_RANDOM |
| # define RANDFILE "/dev/random" |
| # else |
| # define RANDFILE (NULL) |
| # endif |
| # endif |
| #endif |
| |
| unsigned short rand16(void) |
| { |
| static int been_seeded = 0; |
| const char *randfile = RANDFILE; |
| |
| if (! been_seeded) |
| { |
| int fd, n = 0; |
| unsigned int c = 0, seed = 0, badseed; |
| char sbuf[sizeof(seed)]; |
| char *s; |
| struct timeval now; |
| |
| /* get the bad seed as a backup */ |
| /* (but we'd rather have something more random) */ |
| gettimeofday(&now, NULL); |
| badseed = now.tv_sec ^ now.tv_usec ^ (getpid() << 16); |
| |
| fd = open(randfile, O_RDONLY); |
| if (fd < 0) |
| seed = badseed; |
| else |
| { |
| s = (char *) &seed; |
| while ((c < sizeof(seed)) && |
| ((n = read(fd, sbuf, sizeof(seed)) > 0))) |
| { |
| memcpy(s, sbuf, n); |
| s += n; |
| c += n; |
| } |
| if (n < 0) |
| seed = badseed; |
| close(fd); |
| } |
| |
| srand(seed); |
| been_seeded = 1; |
| } |
| |
| /* Some rand() implementations have less randomness in low bits |
| * than in high bits, so we only pay attention to the high ones. |
| * But most implementations don't touch the high bit, so we |
| * ignore that one. |
| */ |
| return( (unsigned short) (rand() >> 15) ); |
| } |
| |
| int legal_char(char c) |
| { |
| /* check for legal char a-z A-Z 0-9 - |
| (also / , used for RFC2317 and _ used in windows queries |
| and space, for DNS-SD stuff) */ |
| if ((c >= 'A' && c <= 'Z') || |
| (c >= 'a' && c <= 'z') || |
| (c >= '0' && c <= '9') || |
| c == '-' || c == '/' || c == '_' || c == ' ') |
| return 1; |
| |
| return 0; |
| } |
| |
| int canonicalise(char *s) |
| { |
| /* check for legal chars and remove trailing . |
| also fail empty string and label > 63 chars */ |
| size_t dotgap = 0, l = strlen(s); |
| char c; |
| int nowhite = 0; |
| |
| if (l == 0 || l > MAXDNAME) return 0; |
| |
| if (s[l-1] == '.') |
| { |
| if (l == 1) return 0; |
| s[l-1] = 0; |
| } |
| |
| while ((c = *s)) |
| { |
| if (c == '.') |
| dotgap = 0; |
| else if (!legal_char(c) || (++dotgap > MAXLABEL)) |
| return 0; |
| else if (c != ' ') |
| nowhite = 1; |
| s++; |
| } |
| return nowhite; |
| } |
| |
| unsigned char *do_rfc1035_name(unsigned char *p, char *sval) |
| { |
| int j; |
| |
| while (sval && *sval) |
| { |
| unsigned char *cp = p++; |
| for (j = 0; *sval && (*sval != '.'); sval++, j++) |
| *p++ = *sval; |
| *cp = j; |
| if (*sval) |
| sval++; |
| } |
| return p; |
| } |
| |
| /* for use during startup */ |
| void *safe_malloc(size_t size) |
| { |
| void *ret = malloc(size); |
| |
| if (!ret) |
| die(_("could not get memory"), NULL, EC_NOMEM); |
| |
| return ret; |
| } |
| |
| void *whine_malloc(size_t size) |
| { |
| void *ret = malloc(size); |
| |
| if (!ret) |
| my_syslog(LOG_ERR, _("failed to allocate %d bytes"), (int) size); |
| |
| return ret; |
| } |
| |
| int sockaddr_isequal(union mysockaddr *s1, union mysockaddr *s2) |
| { |
| if (s1->sa.sa_family == s2->sa.sa_family) |
| { |
| if (s1->sa.sa_family == AF_INET && |
| s1->in.sin_port == s2->in.sin_port && |
| s1->in.sin_addr.s_addr == s2->in.sin_addr.s_addr) |
| return 1; |
| #ifdef HAVE_IPV6 |
| if (s1->sa.sa_family == AF_INET6 && |
| s1->in6.sin6_port == s2->in6.sin6_port && |
| IN6_ARE_ADDR_EQUAL(&s1->in6.sin6_addr, &s2->in6.sin6_addr)) |
| return 1; |
| #endif |
| } |
| return 0; |
| } |
| |
| int sa_len(union mysockaddr *addr) |
| { |
| #ifdef HAVE_SOCKADDR_SA_LEN |
| return addr->sa.sa_len; |
| #else |
| #ifdef HAVE_IPV6 |
| if (addr->sa.sa_family == AF_INET6) |
| return sizeof(addr->in6); |
| else |
| #endif |
| return sizeof(addr->in); |
| #endif |
| } |
| |
| /* don't use strcasecmp and friends here - they may be messed up by LOCALE */ |
| int hostname_isequal(char *a, char *b) |
| { |
| unsigned int c1, c2; |
| |
| do { |
| c1 = (unsigned char) *a++; |
| c2 = (unsigned char) *b++; |
| |
| if (c1 >= 'A' && c1 <= 'Z') |
| c1 += 'a' - 'A'; |
| if (c2 >= 'A' && c2 <= 'Z') |
| c2 += 'a' - 'A'; |
| |
| if (c1 != c2) |
| return 0; |
| } while (c1); |
| |
| return 1; |
| } |
| |
| time_t dnsmasq_time(void) |
| { |
| #ifdef HAVE_BROKEN_RTC |
| struct tms dummy; |
| static long tps = 0; |
| |
| if (tps == 0) |
| tps = sysconf(_SC_CLK_TCK); |
| |
| return (time_t)(times(&dummy)/tps); |
| #else |
| return time(NULL); |
| #endif |
| } |
| |
| int is_same_net(struct in_addr a, struct in_addr b, struct in_addr mask) |
| { |
| return (a.s_addr & mask.s_addr) == (b.s_addr & mask.s_addr); |
| } |
| |
| /* returns port number from address */ |
| int prettyprint_addr(union mysockaddr *addr, char *buf) |
| { |
| int port = 0; |
| |
| #ifdef HAVE_IPV6 |
| if (addr->sa.sa_family == AF_INET) |
| { |
| inet_ntop(AF_INET, &addr->in.sin_addr, buf, ADDRSTRLEN); |
| port = ntohs(addr->in.sin_port); |
| } |
| else if (addr->sa.sa_family == AF_INET6) |
| { |
| inet_ntop(AF_INET6, &addr->in6.sin6_addr, buf, ADDRSTRLEN); |
| port = ntohs(addr->in6.sin6_port); |
| } |
| #else |
| strcpy(buf, inet_ntoa(addr->in.sin_addr)); |
| port = ntohs(addr->in.sin_port); |
| #endif |
| |
| return port; |
| } |
| |
| void prettyprint_time(char *buf, unsigned int t) |
| { |
| if (t == 0xffffffff) |
| sprintf(buf, _("infinite")); |
| else |
| { |
| unsigned int x, p = 0; |
| if ((x = t/86400)) |
| p += sprintf(&buf[p], "%dd", x); |
| if ((x = (t/3600)%24)) |
| p += sprintf(&buf[p], "%dh", x); |
| if ((x = (t/60)%60)) |
| p += sprintf(&buf[p], "%dm", x); |
| if ((x = t%60)) |
| p += sprintf(&buf[p], "%ds", x); |
| } |
| } |
| |
| |
| /* in may equal out, when maxlen may be -1 (No max len). */ |
| int parse_hex(char *in, unsigned char *out, int maxlen, |
| unsigned int *wildcard_mask, int *mac_type) |
| { |
| int mask = 0, i = 0; |
| char *r; |
| |
| if (mac_type) |
| *mac_type = 0; |
| |
| while (maxlen == -1 || i < maxlen) |
| { |
| for (r = in; *r != 0 && *r != ':' && *r != '-'; r++); |
| if (*r == 0) |
| maxlen = i; |
| |
| if (r != in ) |
| { |
| if (*r == '-' && i == 0 && mac_type) |
| { |
| *r = 0; |
| *mac_type = strtol(in, NULL, 16); |
| mac_type = NULL; |
| } |
| else |
| { |
| *r = 0; |
| mask = mask << 1; |
| if (strcmp(in, "*") == 0) |
| mask |= 1; |
| else |
| out[i] = strtol(in, NULL, 16); |
| i++; |
| } |
| } |
| in = r+1; |
| } |
| |
| if (wildcard_mask) |
| *wildcard_mask = mask; |
| |
| return i; |
| } |
| |
| int memcmp_masked(unsigned char *a, unsigned char *b, int len, unsigned int mask) |
| { |
| int i; |
| for (i = len - 1; i >= 0; i--, mask = mask >> 1) |
| if (!(mask & 1) && a[i] != b[i]) |
| return 0; |
| |
| return 1; |
| } |
| |
| /* _note_ may copy buffer */ |
| int expand_buf(struct iovec *iov, size_t size) |
| { |
| void *new; |
| |
| if (size <= (size_t)iov->iov_len) |
| return 1; |
| |
| if (!(new = whine_malloc(size))) |
| { |
| errno = ENOMEM; |
| return 0; |
| } |
| |
| if (iov->iov_base) |
| { |
| memcpy(new, iov->iov_base, iov->iov_len); |
| free(iov->iov_base); |
| } |
| |
| iov->iov_base = new; |
| iov->iov_len = size; |
| |
| return 1; |
| } |
| |
| char *print_mac(char *buff, unsigned char *mac, int len) |
| { |
| char *p = buff; |
| int i; |
| |
| if (len == 0) |
| sprintf(p, "<null>"); |
| else |
| for (i = 0; i < len; i++) |
| p += sprintf(p, "%.2x%s", mac[i], (i == len - 1) ? "" : ":"); |
| |
| return buff; |
| } |
| |
| void bump_maxfd(int fd, int *max) |
| { |
| if (fd > *max) |
| *max = fd; |
| } |
| |
| int retry_send(void) |
| { |
| struct timespec waiter; |
| if (errno == EAGAIN) |
| { |
| waiter.tv_sec = 0; |
| waiter.tv_nsec = 10000; |
| nanosleep(&waiter, NULL); |
| return 1; |
| } |
| |
| if (errno == EINTR) |
| return 1; |
| |
| return 0; |
| } |
| |
| int read_write(int fd, unsigned char *packet, int size, int rw) |
| { |
| ssize_t n, done; |
| |
| for (done = 0; done < size; done += n) |
| { |
| retry: |
| if (rw) |
| n = read(fd, &packet[done], (size_t)(size - done)); |
| else |
| n = write(fd, &packet[done], (size_t)(size - done)); |
| |
| if (n == 0) |
| return 0; |
| else if (n == -1) |
| { |
| if (retry_send() || errno == ENOMEM || errno == ENOBUFS) |
| goto retry; |
| else |
| return 0; |
| } |
| } |
| return 1; |
| } |