|
|
1.1 ! root 1: /* ! 2: * Copyright (c) 1983 Regents of the University of California. ! 3: * All rights reserved. The Berkeley software License Agreement ! 4: * specifies the terms and conditions for redistribution. ! 5: * ! 6: * @(#)defs.h 5.3 (Berkeley) 5/30/86 ! 7: */ ! 8: ! 9: /* ! 10: * Internal data structure definitions for ! 11: * user routing process. Based on Xerox NS ! 12: * protocol specs with mods relevant to more ! 13: * general addressing scheme. ! 14: */ ! 15: #include <sys/types.h> ! 16: #include <sys/socket.h> ! 17: ! 18: #include <net/route.h> ! 19: #include <netinet/in.h> ! 20: #include <protocols/routed.h> ! 21: ! 22: #include <stdio.h> ! 23: #include <netdb.h> ! 24: ! 25: #include "trace.h" ! 26: #include "interface.h" ! 27: #include "table.h" ! 28: #include "af.h" ! 29: ! 30: /* ! 31: * When we find any interfaces marked down we rescan the ! 32: * kernel every CHECK_INTERVAL seconds to see if they've ! 33: * come up. ! 34: */ ! 35: #define CHECK_INTERVAL (1*60) ! 36: ! 37: #define equal(a1, a2) \ ! 38: (bcmp((caddr_t)(a1), (caddr_t)(a2), sizeof (struct sockaddr)) == 0) ! 39: #define min(a,b) ((a)>(b)?(b):(a)) ! 40: ! 41: struct sockaddr_in addr; /* address of daemon's socket */ ! 42: ! 43: int s; /* source and sink of all data */ ! 44: int kmem; ! 45: int supplier; /* process should supply updates */ ! 46: int install; /* if 1 call kernel */ ! 47: int lookforinterfaces; /* if 1 probe kernel for new up interfaces */ ! 48: int performnlist; /* if 1 check if /vmunix has changed */ ! 49: int externalinterfaces; /* # of remote and local interfaces */ ! 50: int timeval; /* local idea of time */ ! 51: ! 52: char packet[MAXPACKETSIZE+1]; ! 53: struct rip *msg; ! 54: ! 55: char **argv0; ! 56: struct servent *sp; ! 57: ! 58: extern char *sys_errlist[]; ! 59: extern int errno; ! 60: ! 61: struct in_addr inet_makeaddr(); ! 62: int inet_addr(); ! 63: char *malloc(); ! 64: int exit(); ! 65: int sendmsg(); ! 66: int supply(); ! 67: int timer(); ! 68: int cleanup();
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.