1/*-
2 * Copyright 1994, 1995 Massachusetts Institute of Technology
3 *
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
14 * warranty.
15 *
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
27 * SUCH DAMAGE.
28 *
29 * at_rmx.c,v 1.13 1995/05/30 08:09:31 rgrimes Exp
30 * $FreeBSD$
31 */
32
33/* This code generates debugging traces to the radix code. */
34
35#include <sys/param.h>
36#include <sys/systm.h>
37#include <sys/socket.h>
38
39#include <net/route.h>
40
41int	at_inithead(void **head, int off);
42
43#if 0
44#define	HEXBUF_LEN	256
45
46static const char *
47prsockaddr(void *v, char *hexbuf)
48{
49	char *bp = &hexbuf[0];
50	u_char *cp = v;
51
52	if (v != NULL) {
53		int len = *cp;
54		u_char *cplim = cp + len;
55
56		/* return: "(len) hexdump" */
57
58		bp += sprintf(bp, "(%d)", len);
59		for (cp++; cp < cplim && bp < hexbuf + (HEXBUF_LEN - 4);
60		    cp++) {
61			*bp++ = "0123456789abcdef"[*cp / 16];
62			*bp++ = "0123456789abcdef"[*cp % 16];
63		}
64	} else
65		bp+= sprintf(bp, "null");
66	*bp = '\0';
67	return (hexbuf);
68}
69#endif
70
71static struct radix_node *
72at_addroute(void *v_arg, void *n_arg, struct radix_node_head *head,
73	    struct radix_node *treenodes)
74{
75
76	return (rn_addroute(v_arg, n_arg, head, treenodes));
77}
78
79static struct radix_node *
80at_matroute(void *v_arg, struct radix_node_head *head)
81{
82
83	return (rn_match(v_arg, head));
84}
85
86static struct radix_node *
87at_lookup(void *v_arg, void *m_arg, struct radix_node_head *head)
88{
89
90	return (rn_lookup(v_arg, m_arg, head));
91}
92
93static struct radix_node *
94at_delroute(void *v_arg, void *netmask_arg, struct radix_node_head *head)
95{
96
97	return (rn_delete(v_arg, netmask_arg, head));
98}
99
100/*
101 * Initialize our routing tree with debugging hooks.
102 */
103int
104at_inithead(void **head, int off)
105{
106	struct radix_node_head *rnh;
107
108	if (!rn_inithead(head, off))
109		return (0);
110
111	rnh = *head;
112	rnh->rnh_addaddr = at_addroute;
113	rnh->rnh_deladdr = at_delroute;
114	rnh->rnh_matchaddr = at_matroute;
115	rnh->rnh_lookup = at_lookup;
116	return (1);
117}
118