mirror of
git://git.code.sf.net/p/dhcpd-pools/code
synced 2025-12-17 16:26:59 +00:00
307 lines
9.3 KiB
C
307 lines
9.3 KiB
C
/*
|
|
* The dhcpd-pools has BSD 2-clause license which also known as "Simplified
|
|
* BSD License" or "FreeBSD License".
|
|
*
|
|
* Copyright 2006- Sami Kerola. 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 AND CONTRIBUTORS 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.
|
|
*
|
|
* The views and conclusions contained in the software and documentation are
|
|
* those of the authors and should not be interpreted as representing
|
|
* official policies, either expressed or implied, of Sami Kerola.
|
|
*/
|
|
|
|
/*! \file other.c
|
|
* \brief Collection of various functions.
|
|
*/
|
|
|
|
#include <config.h>
|
|
|
|
#include "dhcpd-pools.h"
|
|
|
|
#include <err.h>
|
|
#include <errno.h>
|
|
#include <stdbool.h>
|
|
#include <stddef.h>
|
|
#include <stdio.h>
|
|
#include <stdlib.h>
|
|
#include <string.h>
|
|
#include <unistd.h>
|
|
#include <limits.h>
|
|
|
|
/*! \brief Convert text string IP address from either IPv4 or IPv6 to an integer.
|
|
* \param src An IP string in either format.
|
|
* \param dst An union which will hold conversion result.
|
|
* \return Was parsing successful.
|
|
*/
|
|
int parse_ipaddr(const char *restrict src, union ipaddr_t *restrict dst)
|
|
{
|
|
int rv;
|
|
if (config.dhcp_version == VERSION_UNKNOWN) {
|
|
struct in_addr addr;
|
|
struct in6_addr addr6;
|
|
if (inet_aton(src, &addr) == 1) {
|
|
config.dhcp_version = VERSION_4;
|
|
} else if (inet_pton(AF_INET6, src, &addr6) == 1) {
|
|
config.dhcp_version = VERSION_6;
|
|
} else {
|
|
return 0;
|
|
}
|
|
}
|
|
if (config.dhcp_version == VERSION_6) {
|
|
struct in6_addr addr;
|
|
rv = inet_pton(AF_INET6, src, &addr);
|
|
memcpy(&dst->v6, addr.s6_addr, sizeof(addr.s6_addr));
|
|
} else {
|
|
struct in_addr addr;
|
|
rv = inet_aton(src, &addr);
|
|
dst->v4 = ntohl(addr.s_addr);
|
|
}
|
|
return rv == 1;
|
|
}
|
|
|
|
/*! \brief Copy IP address to union.
|
|
*
|
|
* \param dst Destination for a binary IP address.
|
|
* \param src Sourse of an IP address. */
|
|
void copy_ipaddr(union ipaddr_t *restrict dst,
|
|
const union ipaddr_t *restrict src)
|
|
{
|
|
if (config.dhcp_version == VERSION_6) {
|
|
memcpy(&dst->v6, &src->v6, sizeof(src->v6));
|
|
} else {
|
|
dst->v4 = src->v4;
|
|
}
|
|
}
|
|
|
|
/*! \brief Convert an address to string. This function will convert the
|
|
* IPv4 addresses to 123.45.65.78 format, and the IPv6 addresses to it's
|
|
* native format depending on which version of the addressing is found to
|
|
* be in use.
|
|
*
|
|
* \param ip Binary IP address.
|
|
* \return Printable address.
|
|
*/
|
|
const char *ntop_ipaddr(const union ipaddr_t *ip)
|
|
{
|
|
static char
|
|
buffer[sizeof("ffff:ffff:ffff:ffff:ffff:ffff:255.255.255.255")];
|
|
if (config.dhcp_version == VERSION_6) {
|
|
struct in6_addr addr;
|
|
memcpy(addr.s6_addr, ip->v6, sizeof(addr.s6_addr));
|
|
return inet_ntop(AF_INET6, &addr, buffer, sizeof(buffer));
|
|
} else {
|
|
struct in_addr addr;
|
|
addr.s_addr = htonl(ip->v4);
|
|
return inet_ntop(AF_INET, &addr, buffer, sizeof(buffer));
|
|
}
|
|
}
|
|
|
|
/*! \brief Calculate how many addresses there are in a range.
|
|
*
|
|
* \param r Pointer to range structure, which has information about first
|
|
* and last IP in the range.
|
|
* \return Size of a range.
|
|
*/
|
|
unsigned long get_range_size(const struct range_t *r)
|
|
{
|
|
if (config.dhcp_version == VERSION_6) {
|
|
unsigned long size = 0;
|
|
int i;
|
|
/* When calculating the size of an IPv6 range overflow may
|
|
* occur. In that case only the last LONG_BIT bits are
|
|
* preserved, thus we just skip the first (16 - LONG_BIT)
|
|
* bits... */
|
|
for (i = LONG_BIT / 8 < 16 ? 16 - LONG_BIT / 8 : 0; i < 16; i++) {
|
|
size <<= 8;
|
|
size += (int)r->last_ip.v6[i] - (int)r->first_ip.v6[i];
|
|
}
|
|
return size + 1;
|
|
} else {
|
|
return r->last_ip.v4 - r->first_ip.v4 + 1;
|
|
}
|
|
}
|
|
|
|
/*! \fn xstrstr(const char *restrict a, const char *restrict b, const int len)
|
|
* \brief Compare two strings. Similar to strcmp, but tuned to be
|
|
* quicker which is possible because input data is known to have certain
|
|
* structure.
|
|
*
|
|
* \param a String which is been compared, e.g., a haystack.
|
|
* \param b Constant string which is hoped to found, e.g., a needle.
|
|
* \param len Stop point in characters when comparison must be ended.
|
|
* \return Zero if strings differ, one if they are the same. */
|
|
int
|
|
#if __GNUC__ > 4 || (__GNUC__ == 4 && __GNUC_MINOR__ >= 3)
|
|
__attribute__ ((hot))
|
|
#endif
|
|
xstrstr(const char *restrict a, const char *restrict b, const int len)
|
|
{
|
|
int i;
|
|
/* two spaces are very common in lease file, after them
|
|
* nearly everything differs */
|
|
if (likely(a[2] != b[2])) {
|
|
return false;
|
|
}
|
|
/* " binding state " == 16 chars, this will skip right
|
|
* to first differing line. */
|
|
if (17 < len && a[17] != b[17]) {
|
|
return false;
|
|
}
|
|
/* looking good, double check the whole thing... */
|
|
for (i = 0; a[i] != '\0' && b[i] != '\0'; i++) {
|
|
if (a[i] != b[i]) {
|
|
return false;
|
|
}
|
|
}
|
|
return true;
|
|
}
|
|
|
|
/*! \brief Return a double floating point value.
|
|
*
|
|
* \param str String to be converted to a double.
|
|
* \param errmesg Exit error message if conversion fails.
|
|
* \return Binary result of string to double conversion.
|
|
*/
|
|
double strtod_or_err(const char *restrict str, const char *restrict errmesg)
|
|
{
|
|
double num;
|
|
char *end = NULL;
|
|
|
|
if (str == NULL || *str == '\0')
|
|
goto err;
|
|
errno = 0;
|
|
num = strtod(str, &end);
|
|
|
|
if (errno || str == end || (end && *end))
|
|
goto err;
|
|
|
|
return num;
|
|
err:
|
|
if (errno)
|
|
err(EXIT_FAILURE, "%s: '%s'", errmesg, str);
|
|
|
|
errx(EXIT_FAILURE, "%s: '%s'", errmesg, str);
|
|
}
|
|
|
|
/*! \brief Reverse range.
|
|
* Used before output, if a caller has requested reverse sorting.
|
|
* FIXME: The temporary memory area handling should be internal to this
|
|
* function, not a parameter.
|
|
*
|
|
* \param flip_me The range that needs to be inverted.
|
|
* \param tmp_ranges Temporary memory area for the flip. */
|
|
void flip_ranges(struct range_t *restrict flip_me,
|
|
struct range_t *restrict tmp_ranges)
|
|
{
|
|
unsigned int i = num_ranges - 1, j;
|
|
|
|
for (j = 0; j < num_ranges; j++) {
|
|
*(tmp_ranges + j) = *(flip_me + i);
|
|
i--;
|
|
}
|
|
|
|
memcpy(flip_me, tmp_ranges, num_ranges * sizeof(struct range_t));
|
|
}
|
|
|
|
/*! \brief Free memory, flush buffers etc. */
|
|
void clean_up(void)
|
|
{
|
|
unsigned int i;
|
|
|
|
/* Just in case there something in buffers */
|
|
if (fflush(NULL)) {
|
|
warn("clean_up: fflush");
|
|
}
|
|
num_shared_networks++;
|
|
for (i = 0; i < num_shared_networks; i++) {
|
|
free((shared_networks + i)->name);
|
|
}
|
|
free(config.dhcpdconf_file);
|
|
free(config.dhcpdlease_file);
|
|
free(config.output_file);
|
|
free(ranges);
|
|
delete_all_leases();
|
|
free(shared_networks);
|
|
}
|
|
|
|
/*! \brief A version printing. */
|
|
void __attribute__ ((__noreturn__)) print_version(void)
|
|
{
|
|
fprintf(stdout, "%s\n"
|
|
"Written by Sami Kerola.\n"
|
|
"XML support by Dominic Germain, Sogetel inc.\n\n"
|
|
"The software has FreeBSD License.\n", PACKAGE_STRING);
|
|
exit(EXIT_SUCCESS);
|
|
}
|
|
|
|
/*! \brief Command line help screen. */
|
|
void __attribute__ ((__noreturn__)) usage(int status)
|
|
{
|
|
FILE *out;
|
|
out = status != 0 ? stderr : stdout;
|
|
|
|
fprintf(out, "\
|
|
Usage: %s [OPTIONS]\n\n\
|
|
This is ISC dhcpd pools usage analyzer.\n\
|
|
\n", program_invocation_short_name);
|
|
fprintf(out, "\
|
|
-c, --config=FILE path to the dhcpd.conf file\n\
|
|
-l, --leases=FILE path to the dhcpd.leases file\n");
|
|
fprintf(out, "\
|
|
-f, --format=[thHcxXjJ] output format\n\
|
|
t for text\n\
|
|
h for html table\n\
|
|
H for full html page\n\
|
|
x for xml\n\
|
|
X for xml with active lease details\n\
|
|
j for json\n\
|
|
J for json with active lease details\n\
|
|
c for comma separated values\n");
|
|
fprintf(out, "\
|
|
-s, --sort=[nimcptTe] sort ranges by\n\
|
|
n name\n\
|
|
i IP\n\
|
|
m maximum\n\
|
|
c current\n\
|
|
p percent\n\
|
|
t touched\n\
|
|
T t+c\n\
|
|
e t+c perc\n\
|
|
-r, --reverse reverse order sort\n\
|
|
-o, --output=FILE output into a file\n\
|
|
-L, --limit=NR output limit mask 77 - 00\n");
|
|
fprintf(out, "\
|
|
--warning=PERC set warning alarming limit\n\
|
|
--critical=PERC set critical alarming limit\n");
|
|
fprintf(out, "\
|
|
-v, --version version information\n\
|
|
-h, --help this screen\n\
|
|
\n\
|
|
Report bugs to <%s>\n\
|
|
Homepage: %s\n", PACKAGE_BUGREPORT, PACKAGE_URL);
|
|
|
|
exit(out == stderr ? EXIT_FAILURE : EXIT_SUCCESS);
|
|
}
|