| 1 | /* |
| 2 | * Copyright (c) 1983 The Regents of the University of California. |
| 3 | * 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 | * @(#)defs.h 5.9 (Berkeley) 2/26/91 |
| 34 | */ |
| 35 | |
| 36 | #include <sys/types.h> |
| 37 | #include <sys/socket.h> |
| 38 | |
| 39 | #include <net/route.h> |
| 40 | #include <netns/ns.h> |
| 41 | #include <netns/idp.h> |
| 42 | #if defined(vax) || defined(pdp11) |
| 43 | #define xnnet(x) ((u_long) (x)->rip_dst[1] << 16 | (u_long) (x)->rip_dst[0] ) |
| 44 | #else |
| 45 | #define xnnet(x) ((u_long) (x)->rip_dst[0] << 16 | (u_long) (x)->rip_dst[1] ) |
| 46 | #endif |
| 47 | #define IDPPORT_RIF 1 |
| 48 | |
| 49 | #include <stdio.h> |
| 50 | #include <syslog.h> |
| 51 | |
| 52 | #include "protocol.h" |
| 53 | #include "trace.h" |
| 54 | #include "interface.h" |
| 55 | #include "table.h" |
| 56 | #include "af.h" |
| 57 | |
| 58 | |
| 59 | /* |
| 60 | * When we find any interfaces marked down we rescan the |
| 61 | * kernel every CHECK_INTERVAL seconds to see if they've |
| 62 | * come up. |
| 63 | */ |
| 64 | #define CHECK_INTERVAL (5*60) |
| 65 | |
| 66 | #define equal(a1, a2) \ |
| 67 | (bcmp((caddr_t)(a1), (caddr_t)(a2), sizeof (struct sockaddr)) == 0) |
| 68 | #define min(a,b) ((a)>(b)?(b):(a)) |
| 69 | |
| 70 | struct sockaddr_ns addr; /* Daemon's Address */ |
| 71 | int s; /* Socket to listen on */ |
| 72 | int kmem; |
| 73 | int supplier; /* process should supply updates */ |
| 74 | int install; /* if 1 call kernel */ |
| 75 | int lookforinterfaces; /* if 1 probe kernel for new up interfaces */ |
| 76 | int performnlist; /* if 1 check if /vmunix has changed */ |
| 77 | int externalinterfaces; /* # of remote and local interfaces */ |
| 78 | int timeval; /* local idea of time */ |
| 79 | int noteremoterequests; /* squawk on requests from non-local nets */ |
| 80 | |
| 81 | char packet[MAXPACKETSIZE+sizeof(struct idp)+1]; |
| 82 | struct rip *msg; |
| 83 | |
| 84 | char **argv0; |
| 85 | |
| 86 | int sndmsg(); |
| 87 | int supply(); |
| 88 | int cleanup(); |