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