|
|
1.1 ! root 1: /* ! 2: * Copyright (c) 1980, 1986 Regents of the University of California. ! 3: * All rights reserved. ! 4: * ! 5: * Redistribution is only permitted until one year after the first shipment ! 6: * of 4.4BSD by the Regents. Otherwise, redistribution and use in source and ! 7: * binary forms are permitted provided that: (1) source distributions retain ! 8: * this entire copyright notice and comment, and (2) distributions including ! 9: * binaries display the following acknowledgement: This product includes ! 10: * software developed by the University of California, Berkeley and its ! 11: * contributors'' in the documentation or other materials provided with the ! 12: * distribution and in all advertising materials mentioning features or use ! 13: * of this software. Neither the name of the University nor the names of ! 14: * its contributors may be used to endorse or promote products derived from ! 15: * this software without specific prior written permission. ! 16: * THIS SOFTWARE IS PROVIDED AS IS'' AND WITHOUT ANY EXPRESS OR IMPLIED ! 17: * WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED WARRANTIES OF ! 18: * MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. ! 19: * ! 20: * @(#)af.h 7.5 (Berkeley) 6/28/90 ! 21: */ ! 22: ! 23: /* ! 24: * This file is obsolete, I think. kls 12/21/88 ! 25: ! 26: * Address family routines, ! 27: * used in handling generic sockaddr structures. ! 28: * ! 29: * Hash routine is called ! 30: * af_hash(addr, h); ! 31: * struct sockaddr *addr; struct afhash *h; ! 32: * producing an afhash structure for addr. ! 33: * ! 34: * Netmatch routine is called ! 35: * af_netmatch(addr1, addr2); ! 36: * where addr1 and addr2 are sockaddr *. Returns 1 if network ! 37: * values match, 0 otherwise. ! 38: struct afswitch { ! 39: int (*af_hash)(); ! 40: int (*af_netmatch)(); ! 41: }; ! 42: ! 43: struct afhash { ! 44: u_int afh_hosthash; ! 45: u_int afh_nethash; ! 46: }; ! 47: ! 48: #ifdef KERNEL ! 49: struct afswitch afswitch[]; ! 50: #endif ! 51: */
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.