|
|
1.1 root 1: /*
2: * Copyright (c) 1980, 1986 Regents of the University of California.
3: * All rights reserved.
4: *
5: * Redistribution and use in source and binary forms are permitted
6: * provided that the above copyright notice and this paragraph are
7: * duplicated in all such forms and that any documentation,
8: * advertising materials, and other materials related to such
9: * distribution and use acknowledge that the software was developed
10: * by the University of California, Berkeley. The name of the
11: * University may not be used to endorse or promote products derived
12: * from this software without specific prior written permission.
13: * THIS SOFTWARE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR
14: * IMPLIED WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED
15: * WARRANTIES OF MERCHANTIBILITY AND FITNESS FOR A PARTICULAR PURPOSE.
16: *
17: * @(#)af.h 7.3 (Berkeley) 6/27/88
18: */
19:
20: /*
21: * Address family routines,
22: * used in handling generic sockaddr structures.
23: *
24: * Hash routine is called
25: * af_hash(addr, h);
26: * struct sockaddr *addr; struct afhash *h;
27: * producing an afhash structure for addr.
28: *
29: * Netmatch routine is called
30: * af_netmatch(addr1, addr2);
31: * where addr1 and addr2 are sockaddr *. Returns 1 if network
32: * values match, 0 otherwise.
33: */
34: struct afswitch {
35: int (*af_hash)();
36: int (*af_netmatch)();
37: };
38:
39: struct afhash {
40: u_int afh_hosthash;
41: u_int afh_nethash;
42: };
43:
44: #ifdef KERNEL
45: struct afswitch afswitch[];
46: #endif
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.