1 /* 2 * Copyright (c) 1983, 1988, 1993 3 * The Regents of the University of California. All rights reserved. 4 * 5 * Redistribution and use in source and binary forms, with or without 6 * modification, are permitted provided that the following conditions 7 * are met: 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. 20 * 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 31 * SUCH DAMAGE. 32 * 33 * from: @(#)defs.h 8.1 (Berkeley) 6/5/93 34 * $Id: defs.h,v 1.8 1994/12/18 05:43:51 cgd Exp $ 35 */ 36 37 /* 38 * Internal data structure definitions for 39 * user routing process. Based on Xerox NS 40 * protocol specs with mods relevant to more 41 * general addressing scheme. 42 */ 43 #include <sys/param.h> 44 #include <sys/socket.h> 45 #include <sys/time.h> 46 47 #include <net/route.h> 48 #include <netinet/in.h> 49 #include <protocols/routed.h> 50 #include <arpa/inet.h> 51 52 #include <netdb.h> 53 #include <signal.h> 54 #include <stdio.h> 55 #include <stdlib.h> 56 #include <string.h> 57 #include <unistd.h> 58 59 #include "trace.h" 60 #include "interface.h" 61 #include "table.h" 62 #include "af.h" 63 64 /* 65 * When we find any interfaces marked down we rescan the 66 * kernel every CHECK_INTERVAL seconds to see if they've 67 * come up. 68 */ 69 #define CHECK_INTERVAL (1*60) 70 71 #define equal(a1, a2) \ 72 (memcmp((a1), (a2), sizeof (struct sockaddr)) == 0) 73 74 struct sockaddr_in addr; /* address of daemon's socket */ 75 76 int s; /* source and sink of all data */ 77 int r; /* routing socket */ 78 pid_t pid; /* process id for identifying messages */ 79 uid_t uid; /* user id for identifying messages */ 80 int seqno; /* sequence number for identifying messages */ 81 int kmem; 82 int supplier; /* process should supply updates */ 83 int install; /* if 1 call kernel */ 84 int lookforinterfaces; /* if 1 probe kernel for new up interfaces */ 85 int performnlist; /* if 1 check if /vmunix has changed */ 86 int externalinterfaces; /* # of remote and local interfaces */ 87 struct timeval now; /* current idea of time */ 88 struct timeval lastbcast; /* last time all/changes broadcast */ 89 struct timeval lastfullupdate; /* last time full table broadcast */ 90 struct timeval nextbcast; /* time to wait before changes broadcast */ 91 int needupdate; /* true if we need update at nextbcast */ 92 93 char packet[MAXPACKETSIZE+1]; 94 struct rip *msg; 95 96 char **argv0; 97 struct servent *sp; 98 99 struct in_addr inet_makeaddr(); 100 int sndmsg(); 101 int supply(); 102 103 void addrouteforif __P((struct interface *)); 104 void bumploglevel(); 105 void dumppacket __P((FILE *, char *, struct sockaddr_in *, char *, 106 int, struct timeval *)); 107 void gwkludge(); 108 void hup(); 109 void ifinit(); 110 #ifdef notdef /* XXX FUNCTION UNUSED */ 111 u_long inet_lnaof_subnet __P((struct in_addr)); 112 #endif 113 int inet_maskof __P((u_long)); 114 u_long inet_netof_subnet __P((struct in_addr)); 115 int inet_rtflags __P((struct sockaddr_in *)); 116 int inet_sendroute __P((struct rt_entry *, struct sockaddr_in *)); 117 void rip_input __P((struct sockaddr *, struct rip *, int)); 118 void rtadd __P((struct sockaddr *, struct sockaddr *, int, int)); 119 void rtchange __P((struct rt_entry *, struct sockaddr *, short)); 120 void rtdefault(); 121 void rtdelete __P((struct rt_entry *)); 122 void rtdeleteall __P((int)); 123 void rtinit(); 124 int rtioctl __P((int, struct rtuentry *)); 125 void sigtrace __P((int)); 126 int sndmsg __P((struct sockaddr *, int, struct interface *, int)); 127 void timer(); 128 void timevaladd __P((struct timeval *, struct timeval *)); 129 void toall __P((int (*)(), int, struct interface *)); 130 void traceoff(); 131 void traceon __P((char *)); 132 void trace __P((struct ifdebug *, struct sockaddr *, char *, int, int)); 133 void traceaction __P((FILE *, char *, struct rt_entry *)); 134 void traceinit __P((struct interface *)); 135 void tracenewmetric __P((FILE *, struct rt_entry *, int)); 136 137 #define ADD 1 138 #define DELETE 2 139 #define CHANGE 3 140