1997-03-30 00:52:15 +03:00
|
|
|
/* print.c
|
|
|
|
|
|
|
|
Turn data structures into printable text. */
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Copyright (c) 1995, 1996 The Internet Software Consortium.
|
|
|
|
* 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.
|
|
|
|
* 3. Neither the name of The Internet Software Consortium nor the names
|
|
|
|
* of its contributors may be used to endorse or promote products derived
|
|
|
|
* from this software without specific prior written permission.
|
|
|
|
*
|
|
|
|
* THIS SOFTWARE IS PROVIDED BY THE INTERNET SOFTWARE CONSORTIUM 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 INTERNET SOFTWARE CONSORTIUM 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.
|
|
|
|
*
|
|
|
|
* This software has been written for the Internet Software Consortium
|
|
|
|
* by Ted Lemon <mellon@fugue.com> in cooperation with Vixie
|
|
|
|
* Enterprises. To learn more about the Internet Software Consortium,
|
|
|
|
* see ``http://www.vix.com/isc''. To learn more about Vixie
|
|
|
|
* Enterprises, see ``http://www.vix.com''.
|
|
|
|
*/
|
|
|
|
|
|
|
|
#ifndef lint
|
|
|
|
static char copyright[] =
|
1998-05-18 10:53:52 +04:00
|
|
|
"$Id: print.c,v 1.1.1.4 1998/05/18 06:53:55 mellon Exp $ Copyright (c) 1995, 1996 The Internet Software Consortium. All rights reserved.\n";
|
1997-03-30 00:52:15 +03:00
|
|
|
#endif /* not lint */
|
|
|
|
|
|
|
|
#include "dhcpd.h"
|
|
|
|
|
|
|
|
char *print_hw_addr (htype, hlen, data)
|
|
|
|
int htype;
|
|
|
|
int hlen;
|
|
|
|
unsigned char *data;
|
|
|
|
{
|
|
|
|
static char habuf [49];
|
|
|
|
char *s;
|
|
|
|
int i;
|
|
|
|
|
|
|
|
if (htype == 0 || hlen == 0) {
|
|
|
|
strcpy (habuf, "<null>");
|
|
|
|
} else {
|
|
|
|
s = habuf;
|
|
|
|
for (i = 0; i < hlen; i++) {
|
1998-05-18 10:53:52 +04:00
|
|
|
sprintf (s, "%02x", data [i]);
|
1997-03-30 00:52:15 +03:00
|
|
|
s += strlen (s);
|
|
|
|
*s++ = ':';
|
|
|
|
}
|
|
|
|
*--s = 0;
|
|
|
|
}
|
|
|
|
return habuf;
|
|
|
|
}
|
|
|
|
|
|
|
|
void print_lease (lease)
|
|
|
|
struct lease *lease;
|
|
|
|
{
|
|
|
|
struct tm *t;
|
|
|
|
char tbuf [32];
|
|
|
|
|
|
|
|
debug (" Lease %s",
|
|
|
|
piaddr (lease -> ip_addr));
|
|
|
|
|
|
|
|
t = gmtime (&lease -> starts);
|
|
|
|
strftime (tbuf, sizeof tbuf, "%D %H:%M:%S", t);
|
|
|
|
debug (" start %s", tbuf);
|
|
|
|
|
|
|
|
t = gmtime (&lease -> ends);
|
|
|
|
strftime (tbuf, sizeof tbuf, "%D %H:%M:%S", t);
|
|
|
|
debug (" end %s", tbuf);
|
|
|
|
|
|
|
|
t = gmtime (&lease -> timestamp);
|
|
|
|
strftime (tbuf, sizeof tbuf, "%D %H:%M:%S", t);
|
|
|
|
debug (" stamp %s", tbuf);
|
|
|
|
|
|
|
|
debug (" hardware addr = %s",
|
|
|
|
print_hw_addr (lease -> hardware_addr.htype,
|
|
|
|
lease -> hardware_addr.hlen,
|
|
|
|
lease -> hardware_addr.haddr));
|
|
|
|
debug (" host %s ",
|
|
|
|
lease -> host ? lease -> host -> name : "<none>");
|
|
|
|
}
|
|
|
|
|
|
|
|
void dump_packet (tp)
|
|
|
|
struct packet *tp;
|
|
|
|
{
|
|
|
|
struct dhcp_packet *tdp = tp -> raw;
|
|
|
|
|
|
|
|
debug ("packet length %d", tp -> packet_length);
|
|
|
|
debug ("op = %d htype = %d hlen = %d hops = %d",
|
|
|
|
tdp -> op, tdp -> htype, tdp -> hlen, tdp -> hops);
|
|
|
|
debug ("xid = %x secs = %d flags = %x",
|
|
|
|
tdp -> xid, tdp -> secs, tdp -> flags);
|
|
|
|
debug ("ciaddr = %s", inet_ntoa (tdp -> ciaddr));
|
|
|
|
debug ("yiaddr = %s", inet_ntoa (tdp -> yiaddr));
|
|
|
|
debug ("siaddr = %s", inet_ntoa (tdp -> siaddr));
|
|
|
|
debug ("giaddr = %s", inet_ntoa (tdp -> giaddr));
|
|
|
|
debug ("chaddr = %02.2x:%02.2x:%02.2x:%02.2x:%02.2x:%02.2x",
|
|
|
|
((unsigned char *)(tdp -> chaddr)) [0],
|
|
|
|
((unsigned char *)(tdp -> chaddr)) [1],
|
|
|
|
((unsigned char *)(tdp -> chaddr)) [2],
|
|
|
|
((unsigned char *)(tdp -> chaddr)) [3],
|
|
|
|
((unsigned char *)(tdp -> chaddr)) [4],
|
|
|
|
((unsigned char *)(tdp -> chaddr)) [5]);
|
|
|
|
debug ("filename = %s", tdp -> file);
|
|
|
|
debug ("server_name = %s", tdp -> sname);
|
|
|
|
if (tp -> options_valid) {
|
|
|
|
int i;
|
|
|
|
|
|
|
|
for (i = 0; i < 256; i++) {
|
|
|
|
if (tp -> options [i].data)
|
|
|
|
debug (" %s = %s",
|
|
|
|
dhcp_options [i].name,
|
|
|
|
pretty_print_option
|
|
|
|
(i, tp -> options [i].data,
|
1997-06-03 06:49:04 +04:00
|
|
|
tp -> options [i].len, 1, 1));
|
1997-03-30 00:52:15 +03:00
|
|
|
}
|
|
|
|
}
|
|
|
|
debug ("");
|
|
|
|
}
|
|
|
|
|
|
|
|
void dump_raw (buf, len)
|
|
|
|
unsigned char *buf;
|
|
|
|
int len;
|
|
|
|
{
|
|
|
|
int i;
|
|
|
|
char lbuf [80];
|
|
|
|
int lbix = 0;
|
|
|
|
|
|
|
|
lbuf [0] = 0;
|
|
|
|
|
|
|
|
for (i = 0; i < len; i++) {
|
|
|
|
if ((i & 15) == 0) {
|
|
|
|
if (lbix)
|
|
|
|
note (lbuf);
|
|
|
|
sprintf (lbuf, "%03x:", i);
|
|
|
|
lbix = 4;
|
|
|
|
} else if ((i & 7) == 0)
|
|
|
|
lbuf [lbix++] = ' ';
|
|
|
|
sprintf (&lbuf [lbix], " %02x", buf [i]);
|
|
|
|
lbix += 3;
|
|
|
|
}
|
|
|
|
note (lbuf);
|
|
|
|
}
|
|
|
|
|
|
|
|
void hash_dump (table)
|
|
|
|
struct hash_table *table;
|
|
|
|
{
|
|
|
|
int i;
|
|
|
|
struct hash_bucket *bp;
|
|
|
|
|
|
|
|
if (!table)
|
|
|
|
return;
|
|
|
|
|
|
|
|
for (i = 0; i < table -> hash_count; i++) {
|
|
|
|
if (!table -> buckets [i])
|
|
|
|
continue;
|
|
|
|
note ("hash bucket %d:", i);
|
|
|
|
for (bp = table -> buckets [i]; bp; bp = bp -> next) {
|
|
|
|
if (bp -> len)
|
|
|
|
dump_raw (bp -> name, bp -> len);
|
|
|
|
else
|
|
|
|
note (bp -> name);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|