|
|
1.1 root 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 are permitted provided
6: * that: (1) source distributions retain this entire copyright notice and
7: * comment, and (2) distributions including binaries display the following
8: * acknowledgement: ``This product includes software developed by the
9: * University of California, Berkeley and its contributors'' in the
10: * documentation or other materials provided with the distribution and in
11: * all advertising materials mentioning features or use of this software.
12: * Neither the name of the University nor the names of its contributors may
13: * be used to endorse or promote products derived from this software without
14: * specific prior written permission.
15: * THIS SOFTWARE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR IMPLIED
16: * WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED WARRANTIES OF
17: * MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.
18: *
19: * @(#)htable.h 5.4 (Berkeley) 6/1/90
20: */
21:
22: #include <sys/types.h>
23: #include <netinet/in.h>
24:
25: /*
26: * common definitions for htable
27: */
28:
29: struct addr {
30: struct in_addr addr_val;
31: struct addr *addr_link;
32: };
33:
34: struct name {
35: char *name_val;
36: struct name *name_link;
37: };
38:
39: struct gateway {
40: struct gateway *g_link;
41: struct gateway *g_dst; /* connected gateway if metric > 0 */
42: struct gateway *g_firstent; /* first entry for this gateway */
43: struct name *g_name;
44: int g_net;
45: struct in_addr g_addr; /* address on g_net */
46: int g_metric; /* hops to this net */
47: };
48:
49: #define NOADDR ((struct addr *)0)
50: #define NONAME ((struct name *)0)
51:
52: #define KW_NET 1
53: #define KW_GATEWAY 2
54: #define KW_HOST 3
55:
56: struct name *newname();
57: char *malloc();
58:
59: char *infile; /* Input file name */
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.