Home | History | Annotate | Line # | Download | only in netinet
in_var.h revision 1.79
      1  1.79     ozaki /*	$NetBSD: in_var.h,v 1.79 2016/08/01 03:15:30 ozaki-r 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.71       roy #define IN_IFF_TENTATIVE	0x01	/* tentative address */
     70  1.71       roy #define IN_IFF_DUPLICATED	0x02	/* DAD detected duplicate */
     71  1.71       roy #define IN_IFF_DETACHED		0x04	/* may be detached from the link */
     72  1.72       roy #define IN_IFF_TRYTENTATIVE	0x08	/* intent to try DAD */
     73  1.71       roy 
     74  1.71       roy /* do not input/output */
     75  1.72       roy #define IN_IFF_NOTREADY \
     76  1.72       roy     (IN_IFF_TRYTENTATIVE | IN_IFF_TENTATIVE | IN_IFF_DUPLICATED)
     77  1.71       roy 
     78   1.1       cgd /*
     79   1.1       cgd  * Interface address, Internet version.  One of these structures
     80   1.1       cgd  * is allocated for each interface with an Internet address.
     81   1.1       cgd  * The ifaddr structure contains the protocol-independent part
     82   1.1       cgd  * of the structure and is assumed to be first.
     83   1.1       cgd  */
     84   1.1       cgd struct in_ifaddr {
     85   1.1       cgd 	struct	ifaddr ia_ifa;		/* protocol-independent info */
     86   1.1       cgd #define	ia_ifp		ia_ifa.ifa_ifp
     87   1.7   mycroft #define ia_flags	ia_ifa.ifa_flags
     88   1.1       cgd 					/* ia_{,sub}net{,mask} in host order */
     89  1.11       cgd 	u_int32_t ia_net;		/* network number of interface */
     90  1.11       cgd 	u_int32_t ia_netmask;		/* mask of net part */
     91  1.11       cgd 	u_int32_t ia_subnet;		/* subnet number, including net */
     92  1.11       cgd 	u_int32_t ia_subnetmask;	/* mask of subnet part */
     93   1.1       cgd 	struct	in_addr ia_netbroadcast; /* to recognize net broadcasts */
     94  1.21       tls 	LIST_ENTRY(in_ifaddr) ia_hash;	/* entry in bucket of inet addresses */
     95  1.15   mycroft 	TAILQ_ENTRY(in_ifaddr) ia_list;	/* list of internet addresses */
     96   1.1       cgd 	struct	sockaddr_in ia_addr;	/* reserve space for interface name */
     97  1.11       cgd 	struct	sockaddr_in ia_dstaddr;	/* reserve space for broadcast addr */
     98   1.1       cgd #define	ia_broadaddr	ia_dstaddr
     99   1.1       cgd 	struct	sockaddr_in ia_sockmask; /* reserve space for general netmask */
    100  1.15   mycroft 	LIST_HEAD(, in_multi) ia_multiaddrs; /* list of multicast addresses */
    101  1.41     enami 	struct	in_multi *ia_allhosts;	/* multicast address record for
    102  1.41     enami 					   the allhosts multicast group */
    103  1.61      matt 	uint16_t ia_idsalt;		/* ip_id salt for this ia */
    104  1.71       roy 	int	ia4_flags;		/* address flags */
    105  1.72       roy 	void	(*ia_dad_start) (struct ifaddr *);	/* DAD start function */
    106  1.72       roy 	void	(*ia_dad_stop) (struct ifaddr *);	/* DAD stop function */
    107  1.75     ozaki 
    108  1.75     ozaki #ifdef _KERNEL
    109  1.75     ozaki 	struct pslist_entry	ia_hash_pslist_entry;
    110  1.76     ozaki 	struct pslist_entry	ia_pslist_entry;
    111  1.75     ozaki #endif
    112   1.1       cgd };
    113   1.1       cgd 
    114  1.79     ozaki #ifdef _KERNEL
    115  1.79     ozaki static inline void
    116  1.79     ozaki ia4_acquire(struct in_ifaddr *ia, struct psref *psref)
    117  1.79     ozaki {
    118  1.79     ozaki 
    119  1.79     ozaki 	KASSERT(ia != NULL);
    120  1.79     ozaki 	ifa_acquire(&ia->ia_ifa, psref);
    121  1.79     ozaki }
    122  1.79     ozaki 
    123  1.79     ozaki static inline void
    124  1.79     ozaki ia4_release(struct in_ifaddr *ia, struct psref *psref)
    125  1.79     ozaki {
    126  1.79     ozaki 
    127  1.79     ozaki 	if (ia == NULL)
    128  1.79     ozaki 		return;
    129  1.79     ozaki 	ifa_release(&ia->ia_ifa, psref);
    130  1.79     ozaki }
    131  1.79     ozaki #endif
    132  1.79     ozaki 
    133   1.1       cgd struct	in_aliasreq {
    134   1.1       cgd 	char	ifra_name[IFNAMSIZ];		/* if name, e.g. "en0" */
    135   1.1       cgd 	struct	sockaddr_in ifra_addr;
    136  1.14   mycroft 	struct	sockaddr_in ifra_dstaddr;
    137  1.14   mycroft #define	ifra_broadaddr	ifra_dstaddr
    138   1.1       cgd 	struct	sockaddr_in ifra_mask;
    139   1.1       cgd };
    140  1.71       roy 
    141   1.1       cgd /*
    142   1.1       cgd  * Given a pointer to an in_ifaddr (ifaddr),
    143   1.1       cgd  * return a pointer to the addr as a sockaddr_in.
    144   1.1       cgd  */
    145   1.1       cgd #define	IA_SIN(ia) (&(((struct in_ifaddr *)(ia))->ia_addr))
    146   1.1       cgd 
    147  1.79     ozaki #define iatoifa(ia)	(struct ifaddr *)(ia)
    148  1.79     ozaki 
    149  1.68     rmind #ifdef _KERNEL
    150   1.7   mycroft 
    151  1.68     rmind /* Note: 61, 127, 251, 509, 1021, 2039 are good. */
    152  1.21       tls #ifndef IN_IFADDR_HASH_SIZE
    153  1.68     rmind #define IN_IFADDR_HASH_SIZE	509
    154  1.45      matt #endif
    155  1.21       tls 
    156  1.28       tls /*
    157  1.28       tls  * This is a bit unconventional, and wastes a little bit of space, but
    158  1.28       tls  * because we want a very even hash function we don't use & in_ifaddrhash
    159  1.28       tls  * here, but rather % the hash size, which should obviously be prime.
    160  1.28       tls  */
    161  1.28       tls 
    162  1.28       tls #define	IN_IFADDR_HASH(x) in_ifaddrhashtbl[(u_long)(x) % IN_IFADDR_HASH_SIZE]
    163  1.21       tls 
    164  1.21       tls LIST_HEAD(in_ifaddrhashhead, in_ifaddr);	/* Type of the hash head */
    165  1.21       tls TAILQ_HEAD(in_ifaddrhead, in_ifaddr);		/* Type of the list head */
    166  1.45      matt 
    167  1.44      matt extern	u_long in_ifaddrhash;			/* size of hash table - 1 */
    168  1.21       tls extern  struct in_ifaddrhashhead *in_ifaddrhashtbl;	/* Hash table head */
    169  1.51  jonathan extern  struct in_ifaddrhead in_ifaddrhead;		/* List head (in ip_input) */
    170  1.21       tls 
    171  1.75     ozaki extern struct pslist_head *in_ifaddrhashtbl_pslist;
    172  1.75     ozaki extern u_long in_ifaddrhash_pslist;
    173  1.76     ozaki extern struct pslist_head in_ifaddrhead_pslist;
    174  1.75     ozaki 
    175  1.75     ozaki #define IN_IFADDR_HASH_PSLIST(x)					\
    176  1.75     ozaki 	in_ifaddrhashtbl_pslist[(u_long)(x) % IN_IFADDR_HASH_SIZE]
    177  1.75     ozaki 
    178  1.75     ozaki #define IN_ADDRHASH_READER_FOREACH(__ia, __addr)			\
    179  1.75     ozaki 	PSLIST_READER_FOREACH((__ia), &IN_IFADDR_HASH_PSLIST(__addr),	\
    180  1.75     ozaki 	    struct in_ifaddr, ia_hash_pslist_entry)
    181  1.75     ozaki #define IN_ADDRHASH_WRITER_INSERT_HEAD(__ia)				\
    182  1.75     ozaki 	PSLIST_WRITER_INSERT_HEAD(					\
    183  1.75     ozaki 	    &IN_IFADDR_HASH_PSLIST((__ia)->ia_addr.sin_addr.s_addr),	\
    184  1.75     ozaki 	    (__ia), ia_hash_pslist_entry)
    185  1.75     ozaki #define IN_ADDRHASH_WRITER_REMOVE(__ia)					\
    186  1.75     ozaki 	PSLIST_WRITER_REMOVE((__ia), ia_hash_pslist_entry)
    187  1.75     ozaki #define IN_ADDRHASH_ENTRY_INIT(__ia)					\
    188  1.75     ozaki 	PSLIST_ENTRY_INIT((__ia), ia_hash_pslist_entry);
    189  1.75     ozaki #define IN_ADDRHASH_ENTRY_DESTROY(__ia)					\
    190  1.75     ozaki 	PSLIST_ENTRY_DESTROY((__ia), ia_hash_pslist_entry);
    191  1.77     ozaki #define IN_ADDRHASH_READER_NEXT(__ia)					\
    192  1.77     ozaki 	PSLIST_READER_NEXT((__ia), struct in_ifaddr, ia_hash_pslist_entry)
    193  1.75     ozaki 
    194  1.76     ozaki #define IN_ADDRLIST_ENTRY_INIT(__ia)					\
    195  1.76     ozaki 	PSLIST_ENTRY_INIT((__ia), ia_pslist_entry)
    196  1.76     ozaki #define IN_ADDRLIST_ENTRY_DESTROY(__ia)					\
    197  1.76     ozaki 	PSLIST_ENTRY_DESTROY((__ia), ia_pslist_entry);
    198  1.76     ozaki #define IN_ADDRLIST_READER_EMPTY()					\
    199  1.76     ozaki 	(PSLIST_READER_FIRST(&in_ifaddrhead_pslist, struct in_ifaddr,	\
    200  1.76     ozaki 	                     ia_pslist_entry) == NULL)
    201  1.76     ozaki #define IN_ADDRLIST_READER_FIRST()					\
    202  1.76     ozaki 	PSLIST_READER_FIRST(&in_ifaddrhead_pslist, struct in_ifaddr,	\
    203  1.76     ozaki 	                    ia_pslist_entry)
    204  1.76     ozaki #define IN_ADDRLIST_READER_NEXT(__ia)					\
    205  1.76     ozaki 	PSLIST_READER_NEXT((__ia), struct in_ifaddr, ia_pslist_entry)
    206  1.76     ozaki #define IN_ADDRLIST_READER_FOREACH(__ia)				\
    207  1.76     ozaki 	PSLIST_READER_FOREACH((__ia), &in_ifaddrhead_pslist,		\
    208  1.76     ozaki 	                      struct in_ifaddr, ia_pslist_entry)
    209  1.76     ozaki #define IN_ADDRLIST_WRITER_INSERT_HEAD(__ia)				\
    210  1.76     ozaki 	PSLIST_WRITER_INSERT_HEAD(&in_ifaddrhead_pslist, (__ia),	\
    211  1.76     ozaki 	    ia_pslist_entry)
    212  1.76     ozaki #define IN_ADDRLIST_WRITER_REMOVE(__ia)					\
    213  1.76     ozaki 	PSLIST_WRITER_REMOVE((__ia), ia_pslist_entry)
    214  1.76     ozaki #define IN_ADDRLIST_WRITER_FOREACH(__ia)				\
    215  1.76     ozaki 	PSLIST_WRITER_FOREACH((__ia), &in_ifaddrhead_pslist,		\
    216  1.76     ozaki 	                      struct in_ifaddr, ia_pslist_entry)
    217  1.76     ozaki #define IN_ADDRLIST_WRITER_FIRST()					\
    218  1.76     ozaki 	PSLIST_WRITER_FIRST(&in_ifaddrhead_pslist, struct in_ifaddr,	\
    219  1.76     ozaki 	                    ia_pslist_entry)
    220  1.76     ozaki #define IN_ADDRLIST_WRITER_NEXT(__ia)					\
    221  1.76     ozaki 	PSLIST_WRITER_NEXT((__ia), struct in_ifaddr, ia_pslist_entry)
    222  1.76     ozaki #define IN_ADDRLIST_WRITER_INSERT_AFTER(__ia, __new)			\
    223  1.76     ozaki 	PSLIST_WRITER_INSERT_AFTER((__ia), (__new), ia_pslist_entry)
    224  1.76     ozaki #define IN_ADDRLIST_WRITER_EMPTY()					\
    225  1.76     ozaki 	(PSLIST_WRITER_FIRST(&in_ifaddrhead_pslist, struct in_ifaddr,	\
    226  1.76     ozaki 	    ia_pslist_entry) == NULL)
    227  1.76     ozaki #define IN_ADDRLIST_WRITER_INSERT_TAIL(__new)				\
    228  1.76     ozaki 	do {								\
    229  1.76     ozaki 		if (IN_ADDRLIST_WRITER_EMPTY()) {			\
    230  1.76     ozaki 			IN_ADDRLIST_WRITER_INSERT_HEAD((__new));	\
    231  1.76     ozaki 		} else {						\
    232  1.76     ozaki 			struct in_ifaddr *__ia;				\
    233  1.76     ozaki 			IN_ADDRLIST_WRITER_FOREACH(__ia) {		\
    234  1.76     ozaki 				if (IN_ADDRLIST_WRITER_NEXT(__ia) == NULL) { \
    235  1.76     ozaki 					IN_ADDRLIST_WRITER_INSERT_AFTER(__ia,\
    236  1.76     ozaki 					    (__new));			\
    237  1.76     ozaki 					break;				\
    238  1.76     ozaki 				}					\
    239  1.76     ozaki 			}						\
    240  1.76     ozaki 		}							\
    241  1.76     ozaki 	} while (0)
    242  1.76     ozaki 
    243  1.42      matt extern	const	int	inetctlerrmap[];
    244   1.7   mycroft 
    245   1.4   hpeyerl /*
    246  1.78     ozaki  * Find whether an internet address (in_addr) belongs to one
    247  1.21       tls  * of our interfaces (in_ifaddr).  NULL if the address isn't ours.
    248  1.21       tls  */
    249  1.78     ozaki static inline struct in_ifaddr *
    250  1.78     ozaki in_get_ia(struct in_addr addr)
    251  1.78     ozaki {
    252  1.78     ozaki 	struct in_ifaddr *ia;
    253  1.78     ozaki 
    254  1.78     ozaki 	IN_ADDRHASH_READER_FOREACH(ia, addr.s_addr) {
    255  1.78     ozaki 		if (in_hosteq(ia->ia_addr.sin_addr, addr))
    256  1.78     ozaki 			break;
    257  1.78     ozaki 	}
    258  1.78     ozaki 
    259  1.78     ozaki 	return ia;
    260  1.27        is }
    261  1.27        is 
    262  1.79     ozaki static inline struct in_ifaddr *
    263  1.79     ozaki in_get_ia_psref(struct in_addr addr, struct psref *psref)
    264  1.79     ozaki {
    265  1.79     ozaki 	struct in_ifaddr *ia;
    266  1.79     ozaki 	int s;
    267  1.79     ozaki 
    268  1.79     ozaki 	s = pserialize_read_enter();
    269  1.79     ozaki 	ia = in_get_ia(addr);
    270  1.79     ozaki 	if (ia != NULL)
    271  1.79     ozaki 		ia4_acquire(ia, psref);
    272  1.79     ozaki 	pserialize_read_exit(s);
    273  1.79     ozaki 
    274  1.79     ozaki 	return ia;
    275  1.79     ozaki }
    276  1.79     ozaki 
    277  1.27        is /*
    278  1.78     ozaki  * Find whether an internet address (in_addr) belongs to a specified
    279  1.78     ozaki  * interface.  NULL if the address isn't ours.
    280  1.27        is  */
    281  1.78     ozaki static inline struct in_ifaddr *
    282  1.78     ozaki in_get_ia_on_iface(struct in_addr addr, struct ifnet *ifp)
    283  1.78     ozaki {
    284  1.78     ozaki 	struct in_ifaddr *ia;
    285  1.27        is 
    286  1.78     ozaki 	IN_ADDRHASH_READER_FOREACH(ia, addr.s_addr) {
    287  1.78     ozaki 		if (in_hosteq(ia->ia_addr.sin_addr, addr) &&
    288  1.78     ozaki 		    ia->ia_ifp == ifp)
    289  1.78     ozaki 			break;
    290  1.78     ozaki 	}
    291  1.21       tls 
    292  1.78     ozaki 	return ia;
    293   1.4   hpeyerl }
    294   1.4   hpeyerl 
    295  1.79     ozaki static inline struct in_ifaddr *
    296  1.79     ozaki in_get_ia_on_iface_psref(struct in_addr addr, struct ifnet *ifp, struct psref *psref)
    297  1.79     ozaki {
    298  1.79     ozaki 	struct in_ifaddr *ia;
    299  1.79     ozaki 	int s;
    300  1.79     ozaki 
    301  1.79     ozaki 	s = pserialize_read_enter();
    302  1.79     ozaki 	ia = in_get_ia_on_iface(addr, ifp);
    303  1.79     ozaki 	if (ia != NULL)
    304  1.79     ozaki 		ia4_acquire(ia, psref);
    305  1.79     ozaki 	pserialize_read_exit(s);
    306  1.79     ozaki 
    307  1.79     ozaki 	return ia;
    308  1.79     ozaki }
    309  1.79     ozaki 
    310   1.4   hpeyerl /*
    311  1.78     ozaki  * Find an internet address structure (in_ifaddr) corresponding
    312   1.4   hpeyerl  * to a given interface (ifnet structure).
    313   1.4   hpeyerl  */
    314  1.78     ozaki static inline struct in_ifaddr *
    315  1.78     ozaki in_get_ia_from_ifp(struct ifnet *ifp)
    316  1.78     ozaki {
    317  1.78     ozaki 	struct ifaddr *ifa;
    318  1.78     ozaki 
    319  1.78     ozaki 	IFADDR_READER_FOREACH(ifa, ifp) {
    320  1.78     ozaki 		if (ifa->ifa_addr->sa_family == AF_INET)
    321  1.78     ozaki 			break;
    322  1.78     ozaki 	}
    323  1.78     ozaki 
    324  1.78     ozaki 	return ifatoia(ifa);
    325   1.4   hpeyerl }
    326  1.73     ozaki 
    327  1.79     ozaki static inline struct in_ifaddr *
    328  1.79     ozaki in_get_ia_from_ifp_psref(struct ifnet *ifp, struct psref *psref)
    329  1.79     ozaki {
    330  1.79     ozaki 	struct in_ifaddr *ia;
    331  1.79     ozaki 	int s;
    332  1.79     ozaki 
    333  1.79     ozaki 	s = pserialize_read_enter();
    334  1.79     ozaki 	ia = in_get_ia_from_ifp(ifp);
    335  1.79     ozaki 	if (ia != NULL)
    336  1.79     ozaki 		ia4_acquire(ia, psref);
    337  1.79     ozaki 	pserialize_read_exit(s);
    338  1.79     ozaki 
    339  1.79     ozaki 	return ia;
    340  1.79     ozaki }
    341  1.79     ozaki 
    342  1.73     ozaki #include <netinet/in_selsrc.h>
    343  1.73     ozaki /*
    344  1.73     ozaki  * IPv4 per-interface state.
    345  1.73     ozaki  */
    346  1.73     ozaki struct in_ifinfo {
    347  1.73     ozaki 	struct lltable		*ii_llt;	/* ARP state */
    348  1.73     ozaki 	struct in_ifsysctl	*ii_selsrc;
    349  1.73     ozaki };
    350  1.73     ozaki 
    351  1.73     ozaki #endif /* _KERNEL */
    352   1.4   hpeyerl 
    353   1.4   hpeyerl /*
    354   1.4   hpeyerl  * Internet multicast address structure.  There is one of these for each IP
    355   1.4   hpeyerl  * multicast group to which this host belongs on a given network interface.
    356   1.4   hpeyerl  * They are kept in a linked list, rooted in the interface's in_ifaddr
    357   1.4   hpeyerl  * structure.
    358   1.4   hpeyerl  */
    359  1.68     rmind struct router_info;
    360  1.68     rmind 
    361   1.4   hpeyerl struct in_multi {
    362  1.45      matt 	LIST_ENTRY(in_multi) inm_list;	/* list of multicast addresses */
    363  1.45      matt 	struct	router_info *inm_rti;	/* router version info */
    364  1.45      matt 	struct	ifnet *inm_ifp;		/* back pointer to ifnet */
    365   1.4   hpeyerl 	struct	in_addr inm_addr;	/* IP multicast address */
    366   1.4   hpeyerl 	u_int	inm_refcount;		/* no. membership claims by sockets */
    367   1.4   hpeyerl 	u_int	inm_timer;		/* IGMP membership report timer */
    368  1.12   mycroft 	u_int	inm_state;		/* state of membership */
    369   1.4   hpeyerl };
    370   1.4   hpeyerl 
    371   1.9       jtc #ifdef _KERNEL
    372  1.69     rmind 
    373  1.69     rmind #include <net/pktqueue.h>
    374  1.69     rmind 
    375  1.69     rmind extern pktqueue_t *ip_pktq;
    376  1.69     rmind 
    377  1.71       roy extern int ip_dad_count;		/* Duplicate Address Detection probes */
    378  1.71       roy 
    379   1.4   hpeyerl /*
    380  1.68     rmind  * Structure used by functions below to remember position when stepping
    381  1.68     rmind  * through all of the in_multi records.
    382   1.4   hpeyerl  */
    383   1.4   hpeyerl struct in_multistep {
    384  1.47    itojun 	int i_n;
    385   1.4   hpeyerl 	struct in_multi *i_inm;
    386   1.4   hpeyerl };
    387   1.4   hpeyerl 
    388  1.68     rmind bool in_multi_group(struct in_addr, struct ifnet *, int);
    389  1.68     rmind struct in_multi *in_first_multi(struct in_multistep *);
    390  1.68     rmind struct in_multi *in_next_multi(struct in_multistep *);
    391  1.68     rmind struct in_multi *in_lookup_multi(struct in_addr, struct ifnet *);
    392  1.68     rmind struct in_multi *in_addmulti(struct in_addr *, struct ifnet *);
    393  1.68     rmind void in_delmulti(struct in_multi *);
    394  1.68     rmind 
    395  1.68     rmind void in_multi_lock(int);
    396  1.68     rmind void in_multi_unlock(void);
    397  1.68     rmind int in_multi_lock_held(void);
    398   1.4   hpeyerl 
    399  1.36   thorpej struct ifaddr;
    400  1.36   thorpej 
    401  1.53    itojun int	in_ifinit(struct ifnet *,
    402  1.71       roy 	    struct in_ifaddr *, const struct sockaddr_in *, int, int);
    403  1.53    itojun void	in_savemkludge(struct in_ifaddr *);
    404  1.53    itojun void	in_restoremkludge(struct in_ifaddr *, struct ifnet *);
    405  1.53    itojun void	in_purgemkludge(struct ifnet *);
    406  1.53    itojun void	in_ifscrub(struct ifnet *, struct in_ifaddr *);
    407  1.53    itojun void	in_setmaxmtu(void);
    408  1.53    itojun const char *in_fmtaddr(struct in_addr);
    409  1.70       rtr int	in_control(struct socket *, u_long, void *, struct ifnet *);
    410  1.60    dyoung void	in_purgeaddr(struct ifaddr *);
    411  1.53    itojun void	in_purgeif(struct ifnet *);
    412  1.53    itojun int	ipflow_fastforward(struct mbuf *);
    413  1.61      matt 
    414  1.65     rmind struct ipid_state;
    415  1.65     rmind typedef struct ipid_state ipid_state_t;
    416  1.65     rmind 
    417  1.65     rmind ipid_state_t *	ip_id_init(void);
    418  1.65     rmind void		ip_id_fini(ipid_state_t *);
    419  1.65     rmind uint16_t	ip_randomid(ipid_state_t *, uint16_t);
    420  1.65     rmind 
    421  1.65     rmind extern ipid_state_t *	ip_ids;
    422  1.65     rmind extern uint16_t		ip_id;
    423  1.65     rmind extern int		ip_do_randomid;
    424  1.61      matt 
    425  1.61      matt /*
    426  1.65     rmind  * ip_newid_range: "allocate" num contiguous IP IDs.
    427  1.61      matt  *
    428  1.65     rmind  * => Return the first ID.
    429  1.61      matt  */
    430  1.61      matt static __inline uint16_t
    431  1.65     rmind ip_newid_range(const struct in_ifaddr *ia, u_int num)
    432  1.61      matt {
    433  1.61      matt 	uint16_t id;
    434  1.61      matt 
    435  1.61      matt 	if (ip_do_randomid) {
    436  1.61      matt 		/* XXX ignore num */
    437  1.65     rmind 		return ip_randomid(ip_ids, ia ? ia->ia_idsalt : 0);
    438  1.61      matt 	}
    439  1.61      matt 
    440  1.65     rmind 	/* Never allow an IP ID of 0 (detect wrap). */
    441  1.65     rmind 	if ((uint16_t)(ip_id + num) < ip_id) {
    442  1.61      matt 		ip_id = 1;
    443  1.65     rmind 	}
    444  1.61      matt 	id = htons(ip_id);
    445  1.61      matt 	ip_id += num;
    446  1.61      matt 	return id;
    447  1.61      matt }
    448  1.61      matt 
    449  1.61      matt static __inline uint16_t
    450  1.61      matt ip_newid(const struct in_ifaddr *ia)
    451  1.61      matt {
    452  1.65     rmind 
    453  1.61      matt 	return ip_newid_range(ia, 1);
    454  1.61      matt }
    455  1.35    itojun 
    456  1.55    atatat #ifdef SYSCTLFN_PROTO
    457  1.55    atatat int	sysctl_inpcblist(SYSCTLFN_PROTO);
    458  1.55    atatat #endif
    459  1.55    atatat 
    460  1.74     ozaki #define LLTABLE(ifp)	\
    461  1.74     ozaki 	((struct in_ifinfo *)(ifp)->if_afdata[AF_INET])->ii_llt
    462  1.74     ozaki 
    463  1.65     rmind #endif	/* !_KERNEL */
    464  1.35    itojun 
    465  1.35    itojun /* INET6 stuff */
    466  1.35    itojun #include <netinet6/in6_var.h>
    467  1.20     perry 
    468  1.56      elad #endif /* !_NETINET_IN_VAR_H_ */
    469