Home | History | Annotate | Line # | Download | only in netinet
in_var.h revision 1.23
      1  1.23      matt /*	$NetBSD: in_var.h,v 1.23 1998/04/29 21:37:54 matt Exp $	*/
      2  1.22       tls 
      3  1.22       tls /*-
      4  1.22       tls  * Copyright (c) 1998 The NetBSD Foundation, Inc.
      5  1.22       tls  * All rights reserved.
      6  1.22       tls  *
      7  1.22       tls  * This code is derived from software contributed to The NetBSD Foundation
      8  1.22       tls  * by Public Access Networks Corporation ("Panix").  It was developed under
      9  1.22       tls  * contract to Panix by Eric Haszlakiewicz and Thor Lancelot Simon.
     10  1.22       tls  *
     11  1.22       tls  * Redistribution and use in source and binary forms, with or without
     12  1.22       tls  * modification, are permitted provided that the following conditions
     13  1.22       tls  * are met:
     14  1.22       tls  * 1. Redistributions of source code must retain the above copyright
     15  1.22       tls  *    notice, this list of conditions and the following disclaimer.
     16  1.22       tls  * 2. Redistributions in binary form must reproduce the above copyright
     17  1.22       tls  *    notice, this list of conditions and the following disclaimer in the
     18  1.22       tls  *    documentation and/or other materials provided with the distribution.
     19  1.22       tls  * 3. All advertising materials mentioning features or use of this software
     20  1.22       tls  *    must display the following acknowledgement:
     21  1.22       tls  *	This product includes software developed by the NetBSD
     22  1.22       tls  *	Foundation, Inc. and its contributors.
     23  1.22       tls  * 4. Neither the name of The NetBSD Foundation nor the names of its
     24  1.22       tls  *    contributors may be used to endorse or promote products derived
     25  1.22       tls  *    from this software without specific prior written permission.
     26  1.22       tls  *
     27  1.22       tls  * THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS
     28  1.22       tls  * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
     29  1.22       tls  * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
     30  1.22       tls  * PURPOSE ARE DISCLAIMED.  IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS
     31  1.22       tls  * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
     32  1.22       tls  * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
     33  1.22       tls  * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
     34  1.22       tls  * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
     35  1.22       tls  * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
     36  1.22       tls  * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
     37  1.22       tls  * POSSIBILITY OF SUCH DAMAGE.
     38  1.22       tls  */
     39   1.8       cgd 
     40   1.1       cgd /*
     41   1.7   mycroft  * Copyright (c) 1985, 1986, 1993
     42   1.7   mycroft  *	The Regents of the University of California.  All rights reserved.
     43   1.1       cgd  *
     44   1.1       cgd  * Redistribution and use in source and binary forms, with or without
     45   1.1       cgd  * modification, are permitted provided that the following conditions
     46   1.1       cgd  * are met:
     47   1.1       cgd  * 1. Redistributions of source code must retain the above copyright
     48   1.1       cgd  *    notice, this list of conditions and the following disclaimer.
     49   1.1       cgd  * 2. Redistributions in binary form must reproduce the above copyright
     50   1.1       cgd  *    notice, this list of conditions and the following disclaimer in the
     51   1.1       cgd  *    documentation and/or other materials provided with the distribution.
     52   1.1       cgd  * 3. All advertising materials mentioning features or use of this software
     53   1.1       cgd  *    must display the following acknowledgement:
     54   1.1       cgd  *	This product includes software developed by the University of
     55   1.1       cgd  *	California, Berkeley and its contributors.
     56   1.1       cgd  * 4. Neither the name of the University nor the names of its contributors
     57   1.1       cgd  *    may be used to endorse or promote products derived from this software
     58   1.1       cgd  *    without specific prior written permission.
     59   1.1       cgd  *
     60   1.1       cgd  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
     61   1.1       cgd  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
     62   1.1       cgd  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
     63   1.1       cgd  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
     64   1.1       cgd  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
     65   1.1       cgd  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
     66   1.1       cgd  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
     67   1.1       cgd  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
     68   1.1       cgd  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
     69   1.1       cgd  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
     70   1.1       cgd  * SUCH DAMAGE.
     71   1.1       cgd  *
     72  1.19   thorpej  *	@(#)in_var.h	8.2 (Berkeley) 1/9/95
     73   1.1       cgd  */
     74   1.1       cgd 
     75  1.20     perry #ifndef _NETINET_IN_VAR_H_
     76  1.20     perry #define _NETINET_IN_VAR_H_
     77  1.20     perry 
     78  1.15   mycroft #include <sys/queue.h>
     79  1.15   mycroft 
     80   1.1       cgd /*
     81   1.1       cgd  * Interface address, Internet version.  One of these structures
     82   1.1       cgd  * is allocated for each interface with an Internet address.
     83   1.1       cgd  * The ifaddr structure contains the protocol-independent part
     84   1.1       cgd  * of the structure and is assumed to be first.
     85   1.1       cgd  */
     86   1.1       cgd struct in_ifaddr {
     87   1.1       cgd 	struct	ifaddr ia_ifa;		/* protocol-independent info */
     88   1.1       cgd #define	ia_ifp		ia_ifa.ifa_ifp
     89   1.7   mycroft #define ia_flags	ia_ifa.ifa_flags
     90   1.1       cgd 					/* ia_{,sub}net{,mask} in host order */
     91  1.11       cgd 	u_int32_t ia_net;		/* network number of interface */
     92  1.11       cgd 	u_int32_t ia_netmask;		/* mask of net part */
     93  1.11       cgd 	u_int32_t ia_subnet;		/* subnet number, including net */
     94  1.11       cgd 	u_int32_t ia_subnetmask;	/* mask of subnet part */
     95   1.1       cgd 	struct	in_addr ia_netbroadcast; /* to recognize net broadcasts */
     96  1.21       tls 	LIST_ENTRY(in_ifaddr) ia_hash;	/* entry in bucket of inet addresses */
     97  1.15   mycroft 	TAILQ_ENTRY(in_ifaddr) ia_list;	/* list of internet addresses */
     98   1.1       cgd 	struct	sockaddr_in ia_addr;	/* reserve space for interface name */
     99  1.11       cgd 	struct	sockaddr_in ia_dstaddr;	/* reserve space for broadcast addr */
    100   1.1       cgd #define	ia_broadaddr	ia_dstaddr
    101   1.1       cgd 	struct	sockaddr_in ia_sockmask; /* reserve space for general netmask */
    102  1.15   mycroft 	LIST_HEAD(, in_multi) ia_multiaddrs; /* list of multicast addresses */
    103   1.1       cgd };
    104   1.1       cgd 
    105   1.1       cgd struct	in_aliasreq {
    106   1.1       cgd 	char	ifra_name[IFNAMSIZ];		/* if name, e.g. "en0" */
    107   1.1       cgd 	struct	sockaddr_in ifra_addr;
    108  1.14   mycroft 	struct	sockaddr_in ifra_dstaddr;
    109  1.14   mycroft #define	ifra_broadaddr	ifra_dstaddr
    110   1.1       cgd 	struct	sockaddr_in ifra_mask;
    111   1.1       cgd };
    112   1.1       cgd /*
    113   1.1       cgd  * Given a pointer to an in_ifaddr (ifaddr),
    114   1.1       cgd  * return a pointer to the addr as a sockaddr_in.
    115   1.1       cgd  */
    116   1.1       cgd #define	IA_SIN(ia) (&(((struct in_ifaddr *)(ia))->ia_addr))
    117   1.1       cgd 
    118   1.7   mycroft 
    119  1.10    briggs #ifdef	_KERNEL
    120  1.21       tls #ifndef IN_IFADDR_HASH_SIZE
    121  1.21       tls #define IN_IFADDR_HASH_SIZE 293
    122  1.21       tls #endif
    123  1.21       tls 
    124  1.21       tls #define IN_IFADDR_HASH(x) in_ifaddrhashtbl[(u_long)(x) % IN_IFADDR_HASH_SIZE]
    125  1.21       tls 
    126  1.21       tls u_long in_ifaddrhash;				/* size of hash table - 1 */
    127  1.21       tls int	in_ifaddrentries;			/* total number of addrs */
    128  1.21       tls LIST_HEAD(in_ifaddrhashhead, in_ifaddr);	/* Type of the hash head */
    129  1.21       tls TAILQ_HEAD(in_ifaddrhead, in_ifaddr);		/* Type of the list head */
    130  1.21       tls 
    131  1.21       tls extern  struct in_ifaddrhashhead *in_ifaddrhashtbl;	/* Hash table head */
    132  1.21       tls extern  struct in_ifaddrhead in_ifaddr;		/* List head (in ip_input) */
    133  1.21       tls 
    134   1.7   mycroft extern	struct	ifqueue	ipintrq;		/* ip packet input queue */
    135   1.7   mycroft void	in_socktrim __P((struct sockaddr_in *));
    136   1.7   mycroft 
    137   1.2   mycroft 
    138   1.4   hpeyerl /*
    139  1.21       tls  * Macro for finding whether an internet address (in_addr) belongs to one
    140  1.21       tls  * of our interfaces (in_ifaddr).  NULL if the address isn't ours.
    141  1.21       tls  */
    142  1.21       tls #define INADDR_TO_IA(addr, ia) \
    143  1.21       tls 	/* struct in_addr addr; */ \
    144  1.21       tls 	/* struct in_ifaddr *ia; */ \
    145  1.21       tls { \
    146  1.21       tls 	for (ia = IN_IFADDR_HASH((addr).s_addr).lh_first; \
    147  1.21       tls 	    ia != NULL && !in_hosteq(ia->ia_addr.sin_addr, (addr)); \
    148  1.21       tls 	    ia = ia->ia_hash.le_next) \
    149  1.21       tls 		 continue; \
    150  1.21       tls }
    151  1.21       tls 
    152  1.21       tls /*
    153   1.4   hpeyerl  * Macro for finding the interface (ifnet structure) corresponding to one
    154   1.4   hpeyerl  * of our IP addresses.
    155   1.4   hpeyerl  */
    156   1.7   mycroft #define INADDR_TO_IFP(addr, ifp) \
    157   1.4   hpeyerl 	/* struct in_addr addr; */ \
    158   1.4   hpeyerl 	/* struct ifnet *ifp; */ \
    159   1.4   hpeyerl { \
    160   1.4   hpeyerl 	register struct in_ifaddr *ia; \
    161   1.4   hpeyerl \
    162  1.21       tls 	INADDR_TO_IA(addr, ia); \
    163   1.4   hpeyerl 	(ifp) = (ia == NULL) ? NULL : ia->ia_ifp; \
    164   1.4   hpeyerl }
    165   1.4   hpeyerl 
    166   1.4   hpeyerl /*
    167  1.21       tls  * Macro for finding an internet address structure (in_ifaddr) corresponding
    168   1.4   hpeyerl  * to a given interface (ifnet structure).
    169   1.4   hpeyerl  */
    170   1.7   mycroft #define IFP_TO_IA(ifp, ia) \
    171   1.4   hpeyerl 	/* struct ifnet *ifp; */ \
    172   1.4   hpeyerl 	/* struct in_ifaddr *ia; */ \
    173   1.4   hpeyerl { \
    174  1.21       tls 	register struct ifaddr *ifa; \
    175  1.21       tls \
    176  1.21       tls 	for (ifa = (ifp)->if_addrlist.tqh_first; \
    177  1.21       tls 	    ifa != NULL && ifa->ifa_addr->sa_family != AF_INET; \
    178  1.21       tls 	    ifa = ifa->ifa_list.tqe_next) \
    179   1.4   hpeyerl 		continue; \
    180  1.21       tls 	(ia) = ifatoia(ifa); \
    181   1.4   hpeyerl }
    182   1.4   hpeyerl #endif
    183   1.4   hpeyerl 
    184   1.4   hpeyerl /*
    185  1.12   mycroft  * Per-interface router version information.
    186  1.12   mycroft  */
    187  1.12   mycroft struct router_info {
    188  1.12   mycroft 	struct	ifnet *rti_ifp;
    189  1.12   mycroft 	int	rti_type;	/* type of router on this interface */
    190  1.12   mycroft 	int	rti_age;	/* time since last v1 query */
    191  1.12   mycroft 	struct	router_info *rti_next;
    192  1.12   mycroft };
    193  1.12   mycroft 
    194  1.12   mycroft /*
    195   1.4   hpeyerl  * Internet multicast address structure.  There is one of these for each IP
    196   1.4   hpeyerl  * multicast group to which this host belongs on a given network interface.
    197   1.4   hpeyerl  * They are kept in a linked list, rooted in the interface's in_ifaddr
    198   1.4   hpeyerl  * structure.
    199   1.4   hpeyerl  */
    200   1.4   hpeyerl struct in_multi {
    201   1.4   hpeyerl 	struct	in_addr inm_addr;	/* IP multicast address */
    202   1.4   hpeyerl 	struct	ifnet *inm_ifp;		/* back pointer to ifnet */
    203   1.4   hpeyerl 	struct	in_ifaddr *inm_ia;	/* back pointer to in_ifaddr */
    204   1.4   hpeyerl 	u_int	inm_refcount;		/* no. membership claims by sockets */
    205   1.4   hpeyerl 	u_int	inm_timer;		/* IGMP membership report timer */
    206  1.15   mycroft 	LIST_ENTRY(in_multi) inm_list;	/* list of multicast addresses */
    207  1.12   mycroft 	u_int	inm_state;		/* state of membership */
    208  1.12   mycroft 	struct	router_info *inm_rti;	/* router version info */
    209   1.4   hpeyerl };
    210   1.4   hpeyerl 
    211   1.9       jtc #ifdef _KERNEL
    212   1.4   hpeyerl /*
    213   1.4   hpeyerl  * Structure used by macros below to remember position when stepping through
    214   1.4   hpeyerl  * all of the in_multi records.
    215   1.4   hpeyerl  */
    216   1.4   hpeyerl struct in_multistep {
    217   1.4   hpeyerl 	struct in_ifaddr *i_ia;
    218   1.4   hpeyerl 	struct in_multi *i_inm;
    219   1.4   hpeyerl };
    220   1.4   hpeyerl 
    221   1.4   hpeyerl /*
    222   1.4   hpeyerl  * Macro for looking up the in_multi record for a given IP multicast address
    223   1.4   hpeyerl  * on a given interface.  If no matching record is found, "inm" returns NULL.
    224   1.4   hpeyerl  */
    225   1.7   mycroft #define IN_LOOKUP_MULTI(addr, ifp, inm) \
    226   1.4   hpeyerl 	/* struct in_addr addr; */ \
    227   1.4   hpeyerl 	/* struct ifnet *ifp; */ \
    228   1.4   hpeyerl 	/* struct in_multi *inm; */ \
    229   1.4   hpeyerl { \
    230   1.4   hpeyerl 	register struct in_ifaddr *ia; \
    231   1.4   hpeyerl \
    232  1.21       tls 	IFP_TO_IA((ifp), ia); 			/* multicast */ \
    233   1.4   hpeyerl 	if (ia == NULL) \
    234   1.4   hpeyerl 		(inm) = NULL; \
    235   1.4   hpeyerl 	else \
    236  1.15   mycroft 		for ((inm) = ia->ia_multiaddrs.lh_first; \
    237  1.21       tls 		    (inm) != NULL && !in_hosteq((inm)->inm_addr, (addr)); \
    238  1.15   mycroft 		     (inm) = inm->inm_list.le_next) \
    239   1.4   hpeyerl 			 continue; \
    240   1.4   hpeyerl }
    241   1.4   hpeyerl 
    242   1.4   hpeyerl /*
    243   1.4   hpeyerl  * Macro to step through all of the in_multi records, one at a time.
    244   1.4   hpeyerl  * The current position is remembered in "step", which the caller must
    245   1.4   hpeyerl  * provide.  IN_FIRST_MULTI(), below, must be called to initialize "step"
    246   1.4   hpeyerl  * and get the first record.  Both macros return a NULL "inm" when there
    247   1.4   hpeyerl  * are no remaining records.
    248   1.4   hpeyerl  */
    249   1.7   mycroft #define IN_NEXT_MULTI(step, inm) \
    250   1.4   hpeyerl 	/* struct in_multistep  step; */ \
    251   1.4   hpeyerl 	/* struct in_multi *inm; */ \
    252   1.4   hpeyerl { \
    253   1.4   hpeyerl 	if (((inm) = (step).i_inm) != NULL) \
    254  1.15   mycroft 		(step).i_inm = (inm)->inm_list.le_next; \
    255   1.4   hpeyerl 	else \
    256   1.4   hpeyerl 		while ((step).i_ia != NULL) { \
    257  1.15   mycroft 			(inm) = (step).i_ia->ia_multiaddrs.lh_first; \
    258  1.15   mycroft 			(step).i_ia = (step).i_ia->ia_list.tqe_next; \
    259   1.4   hpeyerl 			if ((inm) != NULL) { \
    260  1.15   mycroft 				(step).i_inm = (inm)->inm_list.le_next; \
    261   1.4   hpeyerl 				break; \
    262   1.4   hpeyerl 			} \
    263   1.4   hpeyerl 		} \
    264   1.4   hpeyerl }
    265   1.4   hpeyerl 
    266   1.7   mycroft #define IN_FIRST_MULTI(step, inm) \
    267   1.4   hpeyerl 	/* struct in_multistep step; */ \
    268   1.4   hpeyerl 	/* struct in_multi *inm; */ \
    269   1.4   hpeyerl { \
    270  1.15   mycroft 	(step).i_ia = in_ifaddr.tqh_first; \
    271   1.4   hpeyerl 	(step).i_inm = NULL; \
    272   1.4   hpeyerl 	IN_NEXT_MULTI((step), (inm)); \
    273   1.4   hpeyerl }
    274   1.4   hpeyerl 
    275  1.23      matt struct	route;
    276   1.7   mycroft int	in_ifinit __P((struct ifnet *,
    277   1.7   mycroft 	    struct in_ifaddr *, struct sockaddr_in *, int));
    278   1.7   mycroft struct	in_multi *in_addmulti __P((struct in_addr *, struct ifnet *));
    279  1.16  christos void	in_delmulti __P((struct in_multi *));
    280   1.7   mycroft void	in_ifscrub __P((struct ifnet *, struct in_ifaddr *));
    281  1.18   thorpej void	in_setmaxmtu __P ((void));
    282  1.17   mycroft int	in_control __P((struct socket *, u_long, caddr_t, struct ifnet *,
    283  1.17   mycroft 	    struct proc *));
    284  1.23      matt int	ipflow_fastforward __P((struct mbuf *));
    285  1.23      matt void	ipflow_create __P((const struct route *, struct mbuf *));
    286  1.23      matt void	ipflow_slowtimo __P((void));
    287   1.4   hpeyerl #endif
    288  1.20     perry 
    289  1.20     perry #endif /* _NETINET_IN_VAR_H_ */
    290