* Copyright (c) 1983 Regents of the University of California.
* Redistribution and use in source and binary forms are permitted
* provided that the above copyright notice and this paragraph are
* duplicated in all such forms and that any documentation,
* advertising materials, and other materials related to such
* distribution and use acknowledge that the software was developed
* by the University of California, Berkeley. The name of the
* University may not be used to endorse or promote products derived
* from this software without specific prior written permission.
* THIS SOFTWARE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR
* IMPLIED WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED
* WARRANTIES OF MERCHANTIBILITY AND FITNESS FOR A PARTICULAR PURPOSE.
* @(#)af.h 5.6 (Berkeley) 6/18/88
* Routing table management daemon.
* Per address family routines.
int (*af_hash
)(); /* returns keys based on address */
int (*af_netmatch
)(); /* verifies net # matching */
int (*af_output
)(); /* interprets address for sending */
int (*af_portmatch
)(); /* packet from some other router? */
int (*af_portcheck
)(); /* packet from privileged peer? */
int (*af_checkhost
)(); /* tells if address is valid */
int (*af_rtflags
)(); /* get flags for route (host or net) */
int (*af_sendroute
)(); /* check bounds of subnet broadcast */
int (*af_canon
)(); /* canonicalize address for compares */
char *(*af_format
)(); /* convert address to string */
* Structure returned by af_hash routines.
u_int afh_hosthash
; /* host based hash */
u_int afh_nethash
; /* network based hash */
struct afswitch afswitch
[]; /* table proper */
int af_max
; /* number of entries in table */