2 * Copyright (c) 1983, 1988, 1993
3 * The Regents of the University of California. All rights reserved.
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
8 * 1. Redistributions of source code must retain the above copyright
9 * notice, this list of conditions and the following disclaimer.
10 * 2. Redistributions in binary form must reproduce the above copyright
11 * notice, this list of conditions and the following disclaimer in the
12 * documentation and/or other materials provided with the distribution.
13 * 3. All advertising materials mentioning features or use of this software
14 * must display the following acknowledgement:
15 * This product includes software developed by the University of
16 * California, Berkeley and its contributors.
17 * 4. Neither the name of the University nor the names of its contributors
18 * may be used to endorse or promote products derived from this software
19 * without specific prior written permission.
21 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
22 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
23 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
24 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
25 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
26 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
27 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
28 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
29 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
30 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
33 * from: @(#)defs.h 5.10 (Berkeley) 2/28/91
34 * from: @(#)defs.h 8.1 (Berkeley) 6/5/93
35 * $Id: defs.h,v 1.9 1999/08/01 19:19:16 dholland Exp $
39 * Internal data structure definitions for
40 * user routing process. Based on Xerox NS
41 * protocol specs with mods relevant to more
42 * general addressing scheme.
45 #include <sys/param.h>
46 #include <sys/socket.h>
48 #include <net/route.h>
49 #include <netinet/in.h>
50 #include <protocols/routed.h>
51 #include <arpa/inet.h>
61 #include "interface.h"
66 * When we find any interfaces marked down we rescan the
67 * kernel every CHECK_INTERVAL seconds to see if they've
70 #define CHECK_INTERVAL (1*60)
72 #define equal(a1, a2) \
73 (memcmp((a1), (a2), sizeof (struct sockaddr)) == 0)
75 extern struct sockaddr_in addr; /* address of daemon's socket */
77 extern int sock; /* source and sink of all data */
78 extern int supplier; /* process should supply updates */
79 extern int lookforinterfaces; /* if 1 probe kernel for new up interfaces */
80 extern struct timeval now; /* current idea of time */
81 extern struct timeval lastbcast; /* last time all/changes broadcast */
82 extern struct timeval lastfullupdate; /* last time full table broadcast */
83 extern struct timeval nextbcast; /* time to wait before changes broadcast */
84 extern int needupdate; /* true if we need update at nextbcast */
85 extern struct sockaddr_in inet_default; /* default inet addr */
86 extern int kernel_version; /* kernel we are running under */
88 extern char packet[MAXPACKETSIZE+1];
89 extern struct rip *msg;
91 extern int rip_port; /* port number we use (network byte order) */
93 void supply(struct sockaddr *, int, struct interface *, int);
95 void addrouteforif __P((struct interface *));
96 void bumploglevel(void);
97 void dumppacket(FILE *, char *, struct sockaddr *, char *,int, struct timeval *);
101 int inet_maskof(u_long);
102 u_long inet_netof_subnet(struct in_addr);
103 int inet_rtflags(struct sockaddr *);
104 int inet_sendroute(struct rt_entry *, struct sockaddr *);
106 void rip_input(struct sockaddr *, struct rip *, int);
107 void rtadd(struct sockaddr *, struct sockaddr *, int, int);
108 void rtchange(struct rt_entry *, struct sockaddr *, short);
109 void rtdefault(void);
110 void rtdelete(struct rt_entry *);
111 void rtdeleteall(int);
113 int rtioctl(int, struct rtuentry *);
115 void sndmsg(struct sockaddr *, int, struct interface *, int);
117 void timevaladd(struct timeval *t1, struct timeval *t2);
118 void timevalsub(struct timeval *t1, struct timeval *t2);
119 void toall(void (*)(struct sockaddr *, int, struct interface *, int),
120 int, struct interface *);
122 void traceon(char *);
123 void trace(struct ifdebug *, struct sockaddr *, char *, int, int);
124 void traceaction(FILE *, char *, struct rt_entry *);
125 void traceinit(struct interface *);
126 void tracenewmetric(FILE *, struct rt_entry *, int);
132 #define NOBODY "nobody"
135 #define TIMER_RATE SUPPLY_INTERVAL