Home | History | Annotate | Line # | Download | only in routed
defs.h revision 1.6
      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.6 1994/05/13 08:04:34 mycroft 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 
     51 #include <stdio.h>
     52 #include <netdb.h>
     53 
     54 #include "trace.h"
     55 #include "interface.h"
     56 #include "table.h"
     57 #include "af.h"
     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	(1*60)
     65 
     66 #define equal(a1, a2) \
     67 	(bcmp((caddr_t)(a1), (caddr_t)(a2), sizeof (struct sockaddr)) == 0)
     68 
     69 struct	sockaddr_in addr;	/* address of daemon's socket */
     70 
     71 int	s;			/* source and sink of all data */
     72 int	r;			/* routing socket */
     73 pid_t	pid;			/* process id for identifying messages */
     74 uid_t	uid;			/* user id for identifying messages */
     75 int	seqno;			/* sequence number for identifying messages */
     76 int	kmem;
     77 int	supplier;		/* process should supply updates */
     78 int	install;		/* if 1 call kernel */
     79 int	lookforinterfaces;	/* if 1 probe kernel for new up interfaces */
     80 int	performnlist;		/* if 1 check if /vmunix has changed */
     81 int	externalinterfaces;	/* # of remote and local interfaces */
     82 struct	timeval now;		/* current idea of time */
     83 struct	timeval lastbcast;	/* last time all/changes broadcast */
     84 struct	timeval lastfullupdate;	/* last time full table broadcast */
     85 struct	timeval nextbcast;	/* time to wait before changes broadcast */
     86 int	needupdate;		/* true if we need update at nextbcast */
     87 
     88 char	packet[MAXPACKETSIZE+1];
     89 struct	rip *msg;
     90 
     91 char	**argv0;
     92 struct	servent *sp;
     93 
     94 struct	in_addr inet_makeaddr();
     95 int	inet_addr();
     96 int	inet_maskof();
     97 int	sndmsg();
     98 int	supply();
     99 int	cleanup();
    100 
    101 int	rtioctl();
    102 #define ADD 1
    103 #define DELETE 2
    104 #define CHANGE 3
    105