Home | History | Annotate | Line # | Download | only in netinet
in_var.h revision 1.68
      1  1.68     rmind /*	$NetBSD: in_var.h,v 1.68 2014/05/29 23:02:48 rmind Exp $	*/
      2   1.8       cgd 
      3  1.32   thorpej /*-
      4  1.32   thorpej  * Copyright (c) 1998 The NetBSD Foundation, Inc.
      5  1.32   thorpej  * All rights reserved.
      6  1.32   thorpej  *
      7  1.32   thorpej  * This code is derived from software contributed to The NetBSD Foundation
      8  1.32   thorpej  * by Public Access Networks Corporation ("Panix").  It was developed under
      9  1.32   thorpej  * contract to Panix by Eric Haszlakiewicz and Thor Lancelot Simon.
     10  1.32   thorpej  *
     11  1.32   thorpej  * Redistribution and use in source and binary forms, with or without
     12  1.32   thorpej  * modification, are permitted provided that the following conditions
     13  1.32   thorpej  * are met:
     14  1.32   thorpej  * 1. Redistributions of source code must retain the above copyright
     15  1.32   thorpej  *    notice, this list of conditions and the following disclaimer.
     16  1.32   thorpej  * 2. Redistributions in binary form must reproduce the above copyright
     17  1.32   thorpej  *    notice, this list of conditions and the following disclaimer in the
     18  1.32   thorpej  *    documentation and/or other materials provided with the distribution.
     19  1.32   thorpej  *
     20  1.32   thorpej  * THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS
     21  1.32   thorpej  * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
     22  1.32   thorpej  * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
     23  1.32   thorpej  * PURPOSE ARE DISCLAIMED.  IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS
     24  1.32   thorpej  * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
     25  1.32   thorpej  * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
     26  1.32   thorpej  * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
     27  1.32   thorpej  * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
     28  1.32   thorpej  * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
     29  1.32   thorpej  * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
     30  1.32   thorpej  * POSSIBILITY OF SUCH DAMAGE.
     31  1.32   thorpej  */
     32  1.32   thorpej 
     33   1.1       cgd /*
     34   1.7   mycroft  * Copyright (c) 1985, 1986, 1993
     35   1.7   mycroft  *	The Regents of the University of California.  All rights reserved.
     36   1.1       cgd  *
     37   1.1       cgd  * Redistribution and use in source and binary forms, with or without
     38   1.1       cgd  * modification, are permitted provided that the following conditions
     39   1.1       cgd  * are met:
     40   1.1       cgd  * 1. Redistributions of source code must retain the above copyright
     41   1.1       cgd  *    notice, this list of conditions and the following disclaimer.
     42   1.1       cgd  * 2. Redistributions in binary form must reproduce the above copyright
     43   1.1       cgd  *    notice, this list of conditions and the following disclaimer in the
     44   1.1       cgd  *    documentation and/or other materials provided with the distribution.
     45  1.48       agc  * 3. Neither the name of the University nor the names of its contributors
     46   1.1       cgd  *    may be used to endorse or promote products derived from this software
     47   1.1       cgd  *    without specific prior written permission.
     48   1.1       cgd  *
     49   1.1       cgd  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
     50   1.1       cgd  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
     51   1.1       cgd  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
     52   1.1       cgd  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
     53   1.1       cgd  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
     54   1.1       cgd  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
     55   1.1       cgd  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
     56   1.1       cgd  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
     57   1.1       cgd  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
     58   1.1       cgd  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
     59   1.1       cgd  * SUCH DAMAGE.
     60   1.1       cgd  *
     61  1.19   thorpej  *	@(#)in_var.h	8.2 (Berkeley) 1/9/95
     62   1.1       cgd  */
     63   1.1       cgd 
     64  1.20     perry #ifndef _NETINET_IN_VAR_H_
     65  1.20     perry #define _NETINET_IN_VAR_H_
     66  1.20     perry 
     67  1.15   mycroft #include <sys/queue.h>
     68  1.15   mycroft 
     69   1.1       cgd /*
     70   1.1       cgd  * Interface address, Internet version.  One of these structures
     71   1.1       cgd  * is allocated for each interface with an Internet address.
     72   1.1       cgd  * The ifaddr structure contains the protocol-independent part
     73   1.1       cgd  * of the structure and is assumed to be first.
     74   1.1       cgd  */
     75   1.1       cgd struct in_ifaddr {
     76   1.1       cgd 	struct	ifaddr ia_ifa;		/* protocol-independent info */
     77   1.1       cgd #define	ia_ifp		ia_ifa.ifa_ifp
     78   1.7   mycroft #define ia_flags	ia_ifa.ifa_flags
     79   1.1       cgd 					/* ia_{,sub}net{,mask} in host order */
     80  1.11       cgd 	u_int32_t ia_net;		/* network number of interface */
     81  1.11       cgd 	u_int32_t ia_netmask;		/* mask of net part */
     82  1.11       cgd 	u_int32_t ia_subnet;		/* subnet number, including net */
     83  1.11       cgd 	u_int32_t ia_subnetmask;	/* mask of subnet part */
     84   1.1       cgd 	struct	in_addr ia_netbroadcast; /* to recognize net broadcasts */
     85  1.21       tls 	LIST_ENTRY(in_ifaddr) ia_hash;	/* entry in bucket of inet addresses */
     86  1.15   mycroft 	TAILQ_ENTRY(in_ifaddr) ia_list;	/* list of internet addresses */
     87   1.1       cgd 	struct	sockaddr_in ia_addr;	/* reserve space for interface name */
     88  1.11       cgd 	struct	sockaddr_in ia_dstaddr;	/* reserve space for broadcast addr */
     89   1.1       cgd #define	ia_broadaddr	ia_dstaddr
     90   1.1       cgd 	struct	sockaddr_in ia_sockmask; /* reserve space for general netmask */
     91  1.15   mycroft 	LIST_HEAD(, in_multi) ia_multiaddrs; /* list of multicast addresses */
     92  1.41     enami 	struct	in_multi *ia_allhosts;	/* multicast address record for
     93  1.41     enami 					   the allhosts multicast group */
     94  1.61      matt 	uint16_t ia_idsalt;		/* ip_id salt for this ia */
     95   1.1       cgd };
     96   1.1       cgd 
     97   1.1       cgd struct	in_aliasreq {
     98   1.1       cgd 	char	ifra_name[IFNAMSIZ];		/* if name, e.g. "en0" */
     99   1.1       cgd 	struct	sockaddr_in ifra_addr;
    100  1.14   mycroft 	struct	sockaddr_in ifra_dstaddr;
    101  1.14   mycroft #define	ifra_broadaddr	ifra_dstaddr
    102   1.1       cgd 	struct	sockaddr_in ifra_mask;
    103   1.1       cgd };
    104   1.1       cgd /*
    105   1.1       cgd  * Given a pointer to an in_ifaddr (ifaddr),
    106   1.1       cgd  * return a pointer to the addr as a sockaddr_in.
    107   1.1       cgd  */
    108   1.1       cgd #define	IA_SIN(ia) (&(((struct in_ifaddr *)(ia))->ia_addr))
    109   1.1       cgd 
    110  1.68     rmind #ifdef _KERNEL
    111   1.7   mycroft 
    112  1.68     rmind /* Note: 61, 127, 251, 509, 1021, 2039 are good. */
    113  1.21       tls #ifndef IN_IFADDR_HASH_SIZE
    114  1.68     rmind #define IN_IFADDR_HASH_SIZE	509
    115  1.45      matt #endif
    116  1.21       tls 
    117  1.28       tls /*
    118  1.28       tls  * This is a bit unconventional, and wastes a little bit of space, but
    119  1.28       tls  * because we want a very even hash function we don't use & in_ifaddrhash
    120  1.28       tls  * here, but rather % the hash size, which should obviously be prime.
    121  1.28       tls  */
    122  1.28       tls 
    123  1.28       tls #define	IN_IFADDR_HASH(x) in_ifaddrhashtbl[(u_long)(x) % IN_IFADDR_HASH_SIZE]
    124  1.21       tls 
    125  1.21       tls LIST_HEAD(in_ifaddrhashhead, in_ifaddr);	/* Type of the hash head */
    126  1.21       tls TAILQ_HEAD(in_ifaddrhead, in_ifaddr);		/* Type of the list head */
    127  1.45      matt 
    128  1.44      matt extern	u_long in_ifaddrhash;			/* size of hash table - 1 */
    129  1.21       tls extern  struct in_ifaddrhashhead *in_ifaddrhashtbl;	/* Hash table head */
    130  1.51  jonathan extern  struct in_ifaddrhead in_ifaddrhead;		/* List head (in ip_input) */
    131  1.21       tls 
    132   1.7   mycroft extern	struct	ifqueue	ipintrq;		/* ip packet input queue */
    133  1.42      matt extern	const	int	inetctlerrmap[];
    134   1.7   mycroft 
    135   1.4   hpeyerl /*
    136  1.21       tls  * Macro for finding whether an internet address (in_addr) belongs to one
    137  1.21       tls  * of our interfaces (in_ifaddr).  NULL if the address isn't ours.
    138  1.21       tls  */
    139  1.21       tls #define INADDR_TO_IA(addr, ia) \
    140  1.21       tls 	/* struct in_addr addr; */ \
    141  1.21       tls 	/* struct in_ifaddr *ia; */ \
    142  1.21       tls { \
    143  1.43      matt 	LIST_FOREACH(ia, &IN_IFADDR_HASH((addr).s_addr), ia_hash) { \
    144  1.49    itojun 		if (in_hosteq(ia->ia_addr.sin_addr, (addr))) \
    145  1.34   thorpej 			break; \
    146  1.34   thorpej 	} \
    147  1.27        is }
    148  1.27        is 
    149  1.27        is /*
    150  1.27        is  * Macro for finding the next in_ifaddr structure with the same internet
    151  1.27        is  * address as ia. Call only with a valid ia pointer.
    152  1.27        is  * Will set ia to NULL if none found.
    153  1.27        is  */
    154  1.27        is 
    155  1.27        is #define NEXT_IA_WITH_SAME_ADDR(ia) \
    156  1.27        is 	/* struct in_ifaddr *ia; */ \
    157  1.27        is { \
    158  1.27        is 	struct in_addr addr; \
    159  1.27        is 	addr = ia->ia_addr.sin_addr; \
    160  1.27        is 	do { \
    161  1.43      matt 		ia = LIST_NEXT(ia, ia_hash); \
    162  1.30    scottr 	} while ((ia != NULL) && !in_hosteq(ia->ia_addr.sin_addr, addr)); \
    163  1.21       tls }
    164  1.21       tls 
    165  1.21       tls /*
    166   1.4   hpeyerl  * Macro for finding the interface (ifnet structure) corresponding to one
    167   1.4   hpeyerl  * of our IP addresses.
    168   1.4   hpeyerl  */
    169   1.7   mycroft #define INADDR_TO_IFP(addr, ifp) \
    170   1.4   hpeyerl 	/* struct in_addr addr; */ \
    171   1.4   hpeyerl 	/* struct ifnet *ifp; */ \
    172   1.4   hpeyerl { \
    173  1.39  augustss 	struct in_ifaddr *ia; \
    174   1.4   hpeyerl \
    175  1.21       tls 	INADDR_TO_IA(addr, ia); \
    176   1.4   hpeyerl 	(ifp) = (ia == NULL) ? NULL : ia->ia_ifp; \
    177   1.4   hpeyerl }
    178   1.4   hpeyerl 
    179   1.4   hpeyerl /*
    180  1.21       tls  * Macro for finding an internet address structure (in_ifaddr) corresponding
    181   1.4   hpeyerl  * to a given interface (ifnet structure).
    182   1.4   hpeyerl  */
    183   1.7   mycroft #define IFP_TO_IA(ifp, ia) \
    184   1.4   hpeyerl 	/* struct ifnet *ifp; */ \
    185   1.4   hpeyerl 	/* struct in_ifaddr *ia; */ \
    186   1.4   hpeyerl { \
    187  1.39  augustss 	struct ifaddr *ifa; \
    188  1.21       tls \
    189  1.54      matt 	IFADDR_FOREACH(ifa, ifp) { \
    190  1.43      matt 		if (ifa->ifa_addr->sa_family == AF_INET) \
    191  1.43      matt 			break; \
    192  1.43      matt 	} \
    193  1.21       tls 	(ia) = ifatoia(ifa); \
    194   1.4   hpeyerl }
    195   1.4   hpeyerl #endif
    196   1.4   hpeyerl 
    197   1.4   hpeyerl /*
    198   1.4   hpeyerl  * Internet multicast address structure.  There is one of these for each IP
    199   1.4   hpeyerl  * multicast group to which this host belongs on a given network interface.
    200   1.4   hpeyerl  * They are kept in a linked list, rooted in the interface's in_ifaddr
    201   1.4   hpeyerl  * structure.
    202   1.4   hpeyerl  */
    203  1.68     rmind struct router_info;
    204  1.68     rmind 
    205   1.4   hpeyerl struct in_multi {
    206  1.45      matt 	LIST_ENTRY(in_multi) inm_list;	/* list of multicast addresses */
    207  1.45      matt 	struct	router_info *inm_rti;	/* router version info */
    208  1.45      matt 	struct	ifnet *inm_ifp;		/* back pointer to ifnet */
    209   1.4   hpeyerl 	struct	in_addr inm_addr;	/* IP multicast address */
    210   1.4   hpeyerl 	u_int	inm_refcount;		/* no. membership claims by sockets */
    211   1.4   hpeyerl 	u_int	inm_timer;		/* IGMP membership report timer */
    212  1.12   mycroft 	u_int	inm_state;		/* state of membership */
    213   1.4   hpeyerl };
    214   1.4   hpeyerl 
    215   1.9       jtc #ifdef _KERNEL
    216   1.4   hpeyerl /*
    217  1.68     rmind  * Structure used by functions below to remember position when stepping
    218  1.68     rmind  * through all of the in_multi records.
    219   1.4   hpeyerl  */
    220   1.4   hpeyerl struct in_multistep {
    221  1.47    itojun 	int i_n;
    222   1.4   hpeyerl 	struct in_multi *i_inm;
    223   1.4   hpeyerl };
    224   1.4   hpeyerl 
    225  1.68     rmind bool in_multi_group(struct in_addr, struct ifnet *, int);
    226  1.68     rmind struct in_multi *in_first_multi(struct in_multistep *);
    227  1.68     rmind struct in_multi *in_next_multi(struct in_multistep *);
    228  1.68     rmind struct in_multi *in_lookup_multi(struct in_addr, struct ifnet *);
    229  1.68     rmind struct in_multi *in_addmulti(struct in_addr *, struct ifnet *);
    230  1.68     rmind void in_delmulti(struct in_multi *);
    231  1.68     rmind 
    232  1.68     rmind void in_multi_lock(int);
    233  1.68     rmind void in_multi_unlock(void);
    234  1.68     rmind int in_multi_lock_held(void);
    235   1.4   hpeyerl 
    236  1.36   thorpej struct ifaddr;
    237  1.36   thorpej 
    238  1.53    itojun int	in_ifinit(struct ifnet *,
    239  1.59    dyoung 	    struct in_ifaddr *, const struct sockaddr_in *, int);
    240  1.53    itojun void	in_savemkludge(struct in_ifaddr *);
    241  1.53    itojun void	in_restoremkludge(struct in_ifaddr *, struct ifnet *);
    242  1.53    itojun void	in_purgemkludge(struct ifnet *);
    243  1.53    itojun void	in_ifscrub(struct ifnet *, struct in_ifaddr *);
    244  1.53    itojun void	in_setmaxmtu(void);
    245  1.53    itojun const char *in_fmtaddr(struct in_addr);
    246  1.58  christos int	in_control(struct socket *, u_long, void *, struct ifnet *,
    247  1.57        ad 	    struct lwp *);
    248  1.60    dyoung void	in_purgeaddr(struct ifaddr *);
    249  1.53    itojun void	in_purgeif(struct ifnet *);
    250  1.53    itojun int	ipflow_fastforward(struct mbuf *);
    251  1.61      matt 
    252  1.65     rmind struct ipid_state;
    253  1.65     rmind typedef struct ipid_state ipid_state_t;
    254  1.65     rmind 
    255  1.65     rmind ipid_state_t *	ip_id_init(void);
    256  1.65     rmind void		ip_id_fini(ipid_state_t *);
    257  1.65     rmind uint16_t	ip_randomid(ipid_state_t *, uint16_t);
    258  1.65     rmind 
    259  1.65     rmind extern ipid_state_t *	ip_ids;
    260  1.65     rmind extern uint16_t		ip_id;
    261  1.65     rmind extern int		ip_do_randomid;
    262  1.61      matt 
    263  1.61      matt /*
    264  1.65     rmind  * ip_newid_range: "allocate" num contiguous IP IDs.
    265  1.61      matt  *
    266  1.65     rmind  * => Return the first ID.
    267  1.61      matt  */
    268  1.61      matt static __inline uint16_t
    269  1.65     rmind ip_newid_range(const struct in_ifaddr *ia, u_int num)
    270  1.61      matt {
    271  1.61      matt 	uint16_t id;
    272  1.61      matt 
    273  1.61      matt 	if (ip_do_randomid) {
    274  1.61      matt 		/* XXX ignore num */
    275  1.65     rmind 		return ip_randomid(ip_ids, ia ? ia->ia_idsalt : 0);
    276  1.61      matt 	}
    277  1.61      matt 
    278  1.65     rmind 	/* Never allow an IP ID of 0 (detect wrap). */
    279  1.65     rmind 	if ((uint16_t)(ip_id + num) < ip_id) {
    280  1.61      matt 		ip_id = 1;
    281  1.65     rmind 	}
    282  1.61      matt 	id = htons(ip_id);
    283  1.61      matt 	ip_id += num;
    284  1.61      matt 	return id;
    285  1.61      matt }
    286  1.61      matt 
    287  1.61      matt static __inline uint16_t
    288  1.61      matt ip_newid(const struct in_ifaddr *ia)
    289  1.61      matt {
    290  1.65     rmind 
    291  1.61      matt 	return ip_newid_range(ia, 1);
    292  1.61      matt }
    293  1.35    itojun 
    294  1.55    atatat #ifdef SYSCTLFN_PROTO
    295  1.55    atatat int	sysctl_inpcblist(SYSCTLFN_PROTO);
    296  1.55    atatat #endif
    297  1.55    atatat 
    298  1.65     rmind #endif	/* !_KERNEL */
    299  1.35    itojun 
    300  1.35    itojun /* INET6 stuff */
    301  1.35    itojun #include <netinet6/in6_var.h>
    302  1.20     perry 
    303  1.56      elad #endif /* !_NETINET_IN_VAR_H_ */
    304