2 * Copyright 1994, 1995 Massachusetts Institute of Technology
4 * Permission to use, copy, modify, and distribute this software and
5 * its documentation for any purpose and without fee is hereby
6 * granted, provided that both the above copyright notice and this
7 * permission notice appear in all copies, that both the above
8 * copyright notice and this permission notice appear in all
9 * supporting documentation, and that the name of M.I.T. not be used
10 * in advertising or publicity pertaining to distribution of the
11 * software without specific, written prior permission. M.I.T. makes
12 * no representations about the suitability of this software for any
13 * purpose. It is provided "as is" without express or implied
16 * THIS SOFTWARE IS PROVIDED BY M.I.T. ``AS IS''. M.I.T. DISCLAIMS
17 * ALL EXPRESS OR IMPLIED WARRANTIES WITH REGARD TO THIS SOFTWARE,
18 * INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
19 * MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. IN NO EVENT
20 * SHALL M.I.T. BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
21 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
22 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF
23 * USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
24 * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
25 * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT
26 * OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
29 * at_rmx.c,v 1.13 1995/05/30 08:09:31 rgrimes Exp
32 /* This code generates debugging traces to the radix code */
34 #include <sys/param.h>
35 #include <sys/systm.h>
36 #include <sys/socket.h>
38 #include <net/route.h>
40 int at_inithead(void **head, int off);
42 static char hexbuf[256];
47 char *bp = &hexbuf[0];
52 u_char *cplim = cp + len;
54 /* return: "(len) hexdump" */
56 bp += sprintf(bp, "(%d)", len);
57 for (cp++; cp < cplim && bp < hexbuf+252; cp++) {
58 *bp++ = "0123456789abcdef"[*cp / 16];
59 *bp++ = "0123456789abcdef"[*cp % 16];
62 bp+= sprintf(bp, "null");
69 static struct radix_node *
70 at_addroute(void *v_arg, void *n_arg, struct radix_node_head *head,
71 struct radix_node *treenodes)
73 struct radix_node *rn;
75 printf("at_addroute: v=%s\n", prsockaddr(v_arg));
76 printf("at_addroute: n=%s\n", prsockaddr(n_arg));
77 printf("at_addroute: head=%p treenodes=%p\n",
78 (void *)head, (void *)treenodes);
80 rn = rn_addroute(v_arg, n_arg, head, treenodes);
82 printf("at_addroute: returns rn=%p\n", (void *)rn);
87 static struct radix_node *
88 at_matroute(void *v_arg, struct radix_node_head *head)
90 struct radix_node *rn;
92 printf("at_matroute: v=%s\n", prsockaddr(v_arg));
93 printf("at_matroute: head=%p\n", (void *)head);
95 rn = rn_match(v_arg, head);
97 printf("at_matroute: returnr rn=%p\n", (void *)rn);
102 static struct radix_node *
103 at_lookup(void *v_arg, void *m_arg, struct radix_node_head *head)
105 struct radix_node *rn;
107 printf("at_lookup: v=%s\n", prsockaddr(v_arg));
108 printf("at_lookup: n=%s\n", prsockaddr(m_arg));
109 printf("at_lookup: head=%p\n", (void *)head);
111 rn = rn_lookup(v_arg, m_arg, head);
113 printf("at_lookup: returns rn=%p\n", (void *)rn);
118 static struct radix_node *
119 at_delroute(void *v_arg, void *netmask_arg, struct radix_node_head *head)
121 struct radix_node *rn;
123 printf("at_delroute: v=%s\n", prsockaddr(v_arg));
124 printf("at_delroute: n=%s\n", prsockaddr(netmask_arg));
125 printf("at_delroute: head=%p\n", (void *)head);
127 rn = rn_delete(v_arg, netmask_arg, head);
129 printf("at_delroute: returns rn=%p\n", (void *)rn);
135 * Initialize our routing tree with debugging hooks.
138 at_inithead(void **head, int off)
140 struct radix_node_head *rnh;
142 if(!rn_inithead(head, off))
146 rnh->rnh_addaddr = at_addroute;
147 rnh->rnh_deladdr = at_delroute;
148 rnh->rnh_matchaddr = at_matroute;
149 rnh->rnh_lookup = at_lookup;