* Copyright (c) 1983 Regents of the University of California.
* All rights reserved. The Berkeley software License Agreement
* specifies the terms and conditions for redistribution.
* @(#)defs.h 5.3 (Berkeley) %G%
* Internal data structure definitions for
* user routing process. Based on Xerox NS
* protocol specs with mods relevant to more
* general addressing scheme.
#include <protocols/routed.h>
* When we find any interfaces marked down we rescan the
* kernel every CHECK_INTERVAL seconds to see if they've
#define CHECK_INTERVAL (1*60)
(bcmp((caddr_t)(a1), (caddr_t)(a2), sizeof (struct sockaddr)) == 0)
#define min(a,b) ((a)>(b)?(b):(a))
struct sockaddr_in addr
; /* address of daemon's socket */
int s
; /* source and sink of all data */
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 */
int timeval
; /* local idea of time */
char packet
[MAXPACKETSIZE
+1];
extern char *sys_errlist
[];
struct in_addr
inet_makeaddr();