/* * Copyright (c) 1983, 1988 Regents of the University of California. * All rights reserved. * * %sccs.include.redist.c% * * @(#)defs.h 5.10 (Berkeley) 02/28/91 */ /* * Internal data structure definitions for * user routing process. Based on Xerox NS * protocol specs with mods relevant to more * general addressing scheme. */ #include #include #include #include #include #include #include #include #include "trace.h" #include "interface.h" #include "table.h" #include "af.h" /* * When we find any interfaces marked down we rescan the * kernel every CHECK_INTERVAL seconds to see if they've * come up. */ #define CHECK_INTERVAL (1*60) #define equal(a1, a2) \ (bcmp((caddr_t)(a1), (caddr_t)(a2), sizeof (struct sockaddr)) == 0) struct sockaddr_in addr; /* address of daemon's socket */ int s; /* source and sink of all data */ int kmem; int supplier; /* process should supply updates */ int install; /* if 1 call kernel */ int lookforinterfaces; /* if 1 probe kernel for new up interfaces */ int performnlist; /* if 1 check if /vmunix has changed */ int externalinterfaces; /* # of remote and local interfaces */ struct timeval now; /* current idea of time */ struct timeval lastbcast; /* last time all/changes broadcast */ struct timeval lastfullupdate; /* last time full table broadcast */ struct timeval nextbcast; /* time to wait before changes broadcast */ int needupdate; /* true if we need update at nextbcast */ char packet[MAXPACKETSIZE+1]; struct rip *msg; char **argv0; struct servent *sp; struct in_addr inet_makeaddr(); int inet_addr(); int sndmsg(); int supply(); int cleanup();