1/*
2 * Copyright (c) 1983, 1993
3 *	The Regents of the University of California.  All rights reserved.
4 *
5 * Copyright (c) 1995 John Hay.  All rights reserved.
6 *
7 * Redistribution and use in source and binary forms, with or without
8 * modification, are permitted provided that the following conditions
9 * are met:
10 * 1. Redistributions of source code must retain the above copyright
11 *    notice, this list of conditions and the following disclaimer.
12 * 2. Redistributions in binary form must reproduce the above copyright
13 *    notice, this list of conditions and the following disclaimer in the
14 *    documentation and/or other materials provided with the distribution.
15 * 3. All advertising materials mentioning features or use of this software
16 *    must display the following acknowledgement:
17 *	This product includes software developed by the University of
18 *	California, Berkeley and its contributors.
19 * 4. Neither the name of the University nor the names of its contributors
20 *    may be used to endorse or promote products derived from this software
21 *    without specific prior written permission.
22 *
23 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
24 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
25 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
26 * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
27 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
28 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
29 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
30 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
31 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
32 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
33 * SUCH DAMAGE.
34 *
35 *	@(#)af.h	5.1 (Berkeley) 6/4/85 (routed/af.h)
36 *
37 *	@(#)af.h	8.1 (Berkeley) 6/5/93
38 *
39 * $FreeBSD$
40 */
41
42/*
43 * Routing table management daemon.
44 */
45
46/*
47 * Structure returned by af_hash routines.
48 */
49struct afhash {
50	u_int	afh_hosthash;		/* host based hash */
51	u_int	afh_nethash;		/* network based hash */
52};
53
54/*
55 * Per address family routines.
56 */
57typedef void af_hash_t(struct sockaddr *, struct afhash *);
58typedef int  af_netmatch_t(struct sockaddr *, struct sockaddr *);
59typedef void af_output_t(int, int, struct sockaddr *, int);
60typedef int  af_portmatch_t(struct sockaddr *);
61typedef int  af_portcheck_t(struct sockaddr *);
62typedef int  af_checkhost_t(struct sockaddr *);
63typedef int  af_ishost_t(struct sockaddr *);
64typedef void af_canon_t(struct sockaddr *);
65
66struct afswitch {
67	af_hash_t	*af_hash;	/* returns keys based on address */
68	af_netmatch_t	*af_netmatch;	/* verifies net # matching */
69	af_output_t	*af_output;	/* interprets address for sending */
70	af_portmatch_t	*af_portmatch;	/* packet from some other router? */
71	af_portcheck_t	*af_portcheck;	/* packet from privileged peer? */
72	af_checkhost_t	*af_checkhost;	/* tells if address for host or net */
73	af_ishost_t	*af_ishost;	/* tells if address is valid */
74	af_canon_t	*af_canon;	/* canonicalize address for compares */
75};
76
77struct	afswitch afswitch[AF_MAX];	/* table proper */
78