]>
Commit | Line | Data |
---|---|---|
b7080c8e A |
1 | /* |
2 | * Copyright (c) 1999 Apple Computer, Inc. All rights reserved. | |
3 | * | |
4 | * @APPLE_LICENSE_HEADER_START@ | |
5 | * | |
ac2f15b3 A |
6 | * Copyright (c) 1999-2003 Apple Computer, Inc. All Rights Reserved. |
7 | * | |
8 | * This file contains Original Code and/or Modifications of Original Code | |
9 | * as defined in and that are subject to the Apple Public Source License | |
10 | * Version 2.0 (the 'License'). You may not use this file except in | |
11 | * compliance with the License. Please obtain a copy of the License at | |
12 | * http://www.opensource.apple.com/apsl/ and read it before using this | |
13 | * file. | |
b7080c8e A |
14 | * |
15 | * The Original Code and all software distributed under the License are | |
16 | * distributed on an 'AS IS' basis, WITHOUT WARRANTY OF ANY KIND, EITHER | |
17 | * EXPRESS OR IMPLIED, AND APPLE HEREBY DISCLAIMS ALL SUCH WARRANTIES, | |
18 | * INCLUDING WITHOUT LIMITATION, ANY WARRANTIES OF MERCHANTABILITY, | |
ac2f15b3 A |
19 | * FITNESS FOR A PARTICULAR PURPOSE, QUIET ENJOYMENT OR NON-INFRINGEMENT. |
20 | * Please see the License for the specific language governing rights and | |
21 | * limitations under the License. | |
b7080c8e A |
22 | * |
23 | * @APPLE_LICENSE_HEADER_END@ | |
24 | */ | |
25 | /* | |
26 | * Copyright (c) 1983, 1988, 1993 | |
27 | * The Regents of the University of California. All rights reserved. | |
28 | * | |
29 | * Redistribution and use in source and binary forms, with or without | |
30 | * modification, are permitted provided that the following conditions | |
31 | * are met: | |
32 | * 1. Redistributions of source code must retain the above copyright | |
33 | * notice, this list of conditions and the following disclaimer. | |
34 | * 2. Redistributions in binary form must reproduce the above copyright | |
35 | * notice, this list of conditions and the following disclaimer in the | |
36 | * documentation and/or other materials provided with the distribution. | |
37 | * 3. All advertising materials mentioning features or use of this software | |
38 | * must display the following acknowledgment: | |
39 | * This product includes software developed by the University of | |
40 | * California, Berkeley and its contributors. | |
41 | * 4. Neither the name of the University nor the names of its contributors | |
42 | * may be used to endorse or promote products derived from this software | |
43 | * without specific prior written permission. | |
44 | * | |
45 | * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND | |
46 | * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE | |
47 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE | |
48 | * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE | |
49 | * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL | |
50 | * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS | |
51 | * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) | |
52 | * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT | |
53 | * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY | |
54 | * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF | |
55 | * SUCH DAMAGE. | |
56 | * | |
57 | * @(#)defs.h 8.1 (Berkeley) 6/5/93 | |
58 | */ | |
59 | ||
60 | /* | |
61 | * Internal data structure definitions for | |
62 | * user routing process. Based on Xerox NS | |
63 | * protocol specs with mods relevant to more | |
64 | * general addressing scheme. | |
65 | */ | |
66 | #include <sys/param.h> | |
67 | #include <sys/socket.h> | |
68 | #include <sys/time.h> | |
69 | ||
70 | #include <net/route.h> | |
71 | #include <netinet/in.h> | |
72 | #include <protocols/routed.h> | |
73 | ||
74 | #include <stdio.h> | |
75 | #include <netdb.h> | |
76 | ||
77 | /* NeXT */ | |
78 | #ifndef EXTERN | |
79 | #define EXTERN extern | |
80 | #endif | |
81 | ||
82 | #include "trace.h" | |
83 | #include "interface.h" | |
84 | #include "table.h" | |
85 | #include "af.h" | |
86 | ||
87 | /* | |
88 | * When we find any interfaces marked down we rescan the | |
89 | * kernel every CHECK_INTERVAL seconds to see if they've | |
90 | * come up. | |
91 | */ | |
92 | #define CHECK_INTERVAL (1*60) | |
93 | ||
94 | #define equal(a1, a2) \ | |
95 | (memcmp((a1), (a2), sizeof (struct sockaddr)) == 0) | |
96 | ||
97 | EXTERN struct sockaddr_in addr; /* address of daemon's socket */ | |
98 | ||
99 | EXTERN int s; /* source and sink of all data */ | |
100 | EXTERN int r; /* routing socket */ | |
101 | EXTERN pid_t pid; /* process id for identifying messages */ | |
102 | EXTERN uid_t uid; /* user id for identifying messages */ | |
103 | EXTERN int seqno; /* sequence number for identifying messages */ | |
104 | EXTERN int kmem; | |
105 | extern int supplier; /* process should supply updates */ | |
106 | extern int install; /* if 1 call kernel */ | |
107 | extern int lookforinterfaces; /* if 1 probe kernel for new up interfaces */ | |
108 | EXTERN int performnlist; /* if 1 check if /vmunix has changed */ | |
109 | extern int externalinterfaces; /* # of remote and local interfaces */ | |
110 | EXTERN struct timeval now; /* current idea of time */ | |
111 | EXTERN struct timeval lastbcast; /* last time all/changes broadcast */ | |
112 | EXTERN struct timeval lastfullupdate; /* last time full table broadcast */ | |
113 | EXTERN struct timeval nextbcast; /* time to wait before changes broadcast */ | |
114 | EXTERN int needupdate; /* true if we need update at nextbcast */ | |
115 | ||
116 | EXTERN char packet[MAXPACKETSIZE+1]; | |
117 | extern struct rip *msg; | |
118 | ||
119 | EXTERN char **argv0; | |
120 | EXTERN struct servent *sp; | |
121 | ||
122 | EXTERN struct in_addr inet_makeaddr(); | |
123 | EXTERN int inet_addr(); | |
124 | EXTERN int inet_maskof(); | |
125 | EXTERN int sndmsg(); | |
126 | EXTERN int supply(); | |
127 | EXTERN int cleanup(); | |
128 | ||
129 | EXTERN int rtioctl(); | |
130 | #define ADD 1 | |
131 | #define DELETE 2 | |
132 | #define CHANGE 3 |