Home | History | Annotate | Line # | Download | only in netinet
in_var.h revision 1.70.4.1
      1  1.70.4.1     skrll /*	$NetBSD: in_var.h,v 1.70.4.1 2015/06/06 14:40:25 skrll 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.70.4.1     skrll #define IN_IFF_TENTATIVE	0x01	/* tentative address */
     70  1.70.4.1     skrll #define IN_IFF_DUPLICATED	0x02	/* DAD detected duplicate */
     71  1.70.4.1     skrll #define IN_IFF_DETACHED		0x04	/* may be detached from the link */
     72  1.70.4.1     skrll #define IN_IFF_TRYTENTATIVE	0x08	/* intent to try DAD */
     73  1.70.4.1     skrll 
     74  1.70.4.1     skrll /* do not input/output */
     75  1.70.4.1     skrll #define IN_IFF_NOTREADY \
     76  1.70.4.1     skrll     (IN_IFF_TRYTENTATIVE | IN_IFF_TENTATIVE | IN_IFF_DUPLICATED)
     77  1.70.4.1     skrll 
     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.70.4.1     skrll 	int	ia4_flags;		/* address flags */
    105  1.70.4.1     skrll 	void	(*ia_dad_start) (struct ifaddr *);	/* DAD start function */
    106  1.70.4.1     skrll 	void	(*ia_dad_stop) (struct ifaddr *);	/* DAD stop function */
    107       1.1       cgd };
    108       1.1       cgd 
    109       1.1       cgd struct	in_aliasreq {
    110       1.1       cgd 	char	ifra_name[IFNAMSIZ];		/* if name, e.g. "en0" */
    111       1.1       cgd 	struct	sockaddr_in ifra_addr;
    112      1.14   mycroft 	struct	sockaddr_in ifra_dstaddr;
    113      1.14   mycroft #define	ifra_broadaddr	ifra_dstaddr
    114       1.1       cgd 	struct	sockaddr_in ifra_mask;
    115       1.1       cgd };
    116  1.70.4.1     skrll 
    117       1.1       cgd /*
    118       1.1       cgd  * Given a pointer to an in_ifaddr (ifaddr),
    119       1.1       cgd  * return a pointer to the addr as a sockaddr_in.
    120       1.1       cgd  */
    121       1.1       cgd #define	IA_SIN(ia) (&(((struct in_ifaddr *)(ia))->ia_addr))
    122       1.1       cgd 
    123      1.68     rmind #ifdef _KERNEL
    124       1.7   mycroft 
    125      1.68     rmind /* Note: 61, 127, 251, 509, 1021, 2039 are good. */
    126      1.21       tls #ifndef IN_IFADDR_HASH_SIZE
    127      1.68     rmind #define IN_IFADDR_HASH_SIZE	509
    128      1.45      matt #endif
    129      1.21       tls 
    130      1.28       tls /*
    131      1.28       tls  * This is a bit unconventional, and wastes a little bit of space, but
    132      1.28       tls  * because we want a very even hash function we don't use & in_ifaddrhash
    133      1.28       tls  * here, but rather % the hash size, which should obviously be prime.
    134      1.28       tls  */
    135      1.28       tls 
    136      1.28       tls #define	IN_IFADDR_HASH(x) in_ifaddrhashtbl[(u_long)(x) % IN_IFADDR_HASH_SIZE]
    137      1.21       tls 
    138      1.21       tls LIST_HEAD(in_ifaddrhashhead, in_ifaddr);	/* Type of the hash head */
    139      1.21       tls TAILQ_HEAD(in_ifaddrhead, in_ifaddr);		/* Type of the list head */
    140      1.45      matt 
    141      1.44      matt extern	u_long in_ifaddrhash;			/* size of hash table - 1 */
    142      1.21       tls extern  struct in_ifaddrhashhead *in_ifaddrhashtbl;	/* Hash table head */
    143      1.51  jonathan extern  struct in_ifaddrhead in_ifaddrhead;		/* List head (in ip_input) */
    144      1.21       tls 
    145      1.42      matt extern	const	int	inetctlerrmap[];
    146       1.7   mycroft 
    147       1.4   hpeyerl /*
    148      1.21       tls  * Macro for finding whether an internet address (in_addr) belongs to one
    149      1.21       tls  * of our interfaces (in_ifaddr).  NULL if the address isn't ours.
    150      1.21       tls  */
    151      1.21       tls #define INADDR_TO_IA(addr, ia) \
    152      1.21       tls 	/* struct in_addr addr; */ \
    153      1.21       tls 	/* struct in_ifaddr *ia; */ \
    154      1.21       tls { \
    155      1.43      matt 	LIST_FOREACH(ia, &IN_IFADDR_HASH((addr).s_addr), ia_hash) { \
    156      1.49    itojun 		if (in_hosteq(ia->ia_addr.sin_addr, (addr))) \
    157      1.34   thorpej 			break; \
    158      1.34   thorpej 	} \
    159      1.27        is }
    160      1.27        is 
    161      1.27        is /*
    162      1.27        is  * Macro for finding the next in_ifaddr structure with the same internet
    163      1.27        is  * address as ia. Call only with a valid ia pointer.
    164      1.27        is  * Will set ia to NULL if none found.
    165      1.27        is  */
    166      1.27        is 
    167      1.27        is #define NEXT_IA_WITH_SAME_ADDR(ia) \
    168      1.27        is 	/* struct in_ifaddr *ia; */ \
    169      1.27        is { \
    170      1.27        is 	struct in_addr addr; \
    171      1.27        is 	addr = ia->ia_addr.sin_addr; \
    172      1.27        is 	do { \
    173      1.43      matt 		ia = LIST_NEXT(ia, ia_hash); \
    174      1.30    scottr 	} while ((ia != NULL) && !in_hosteq(ia->ia_addr.sin_addr, addr)); \
    175      1.21       tls }
    176      1.21       tls 
    177      1.21       tls /*
    178       1.4   hpeyerl  * Macro for finding the interface (ifnet structure) corresponding to one
    179       1.4   hpeyerl  * of our IP addresses.
    180       1.4   hpeyerl  */
    181       1.7   mycroft #define INADDR_TO_IFP(addr, ifp) \
    182       1.4   hpeyerl 	/* struct in_addr addr; */ \
    183       1.4   hpeyerl 	/* struct ifnet *ifp; */ \
    184       1.4   hpeyerl { \
    185      1.39  augustss 	struct in_ifaddr *ia; \
    186       1.4   hpeyerl \
    187      1.21       tls 	INADDR_TO_IA(addr, ia); \
    188       1.4   hpeyerl 	(ifp) = (ia == NULL) ? NULL : ia->ia_ifp; \
    189       1.4   hpeyerl }
    190       1.4   hpeyerl 
    191       1.4   hpeyerl /*
    192      1.21       tls  * Macro for finding an internet address structure (in_ifaddr) corresponding
    193       1.4   hpeyerl  * to a given interface (ifnet structure).
    194       1.4   hpeyerl  */
    195       1.7   mycroft #define IFP_TO_IA(ifp, ia) \
    196       1.4   hpeyerl 	/* struct ifnet *ifp; */ \
    197       1.4   hpeyerl 	/* struct in_ifaddr *ia; */ \
    198       1.4   hpeyerl { \
    199      1.39  augustss 	struct ifaddr *ifa; \
    200      1.21       tls \
    201      1.54      matt 	IFADDR_FOREACH(ifa, ifp) { \
    202      1.43      matt 		if (ifa->ifa_addr->sa_family == AF_INET) \
    203      1.43      matt 			break; \
    204      1.43      matt 	} \
    205      1.21       tls 	(ia) = ifatoia(ifa); \
    206       1.4   hpeyerl }
    207       1.4   hpeyerl #endif
    208       1.4   hpeyerl 
    209       1.4   hpeyerl /*
    210       1.4   hpeyerl  * Internet multicast address structure.  There is one of these for each IP
    211       1.4   hpeyerl  * multicast group to which this host belongs on a given network interface.
    212       1.4   hpeyerl  * They are kept in a linked list, rooted in the interface's in_ifaddr
    213       1.4   hpeyerl  * structure.
    214       1.4   hpeyerl  */
    215      1.68     rmind struct router_info;
    216      1.68     rmind 
    217       1.4   hpeyerl struct in_multi {
    218      1.45      matt 	LIST_ENTRY(in_multi) inm_list;	/* list of multicast addresses */
    219      1.45      matt 	struct	router_info *inm_rti;	/* router version info */
    220      1.45      matt 	struct	ifnet *inm_ifp;		/* back pointer to ifnet */
    221       1.4   hpeyerl 	struct	in_addr inm_addr;	/* IP multicast address */
    222       1.4   hpeyerl 	u_int	inm_refcount;		/* no. membership claims by sockets */
    223       1.4   hpeyerl 	u_int	inm_timer;		/* IGMP membership report timer */
    224      1.12   mycroft 	u_int	inm_state;		/* state of membership */
    225       1.4   hpeyerl };
    226       1.4   hpeyerl 
    227       1.9       jtc #ifdef _KERNEL
    228      1.69     rmind 
    229      1.69     rmind #include <net/pktqueue.h>
    230      1.69     rmind 
    231      1.69     rmind extern pktqueue_t *ip_pktq;
    232      1.69     rmind 
    233  1.70.4.1     skrll extern int ip_dad_count;		/* Duplicate Address Detection probes */
    234  1.70.4.1     skrll 
    235       1.4   hpeyerl /*
    236      1.68     rmind  * Structure used by functions below to remember position when stepping
    237      1.68     rmind  * through all of the in_multi records.
    238       1.4   hpeyerl  */
    239       1.4   hpeyerl struct in_multistep {
    240      1.47    itojun 	int i_n;
    241       1.4   hpeyerl 	struct in_multi *i_inm;
    242       1.4   hpeyerl };
    243       1.4   hpeyerl 
    244      1.68     rmind bool in_multi_group(struct in_addr, struct ifnet *, int);
    245      1.68     rmind struct in_multi *in_first_multi(struct in_multistep *);
    246      1.68     rmind struct in_multi *in_next_multi(struct in_multistep *);
    247      1.68     rmind struct in_multi *in_lookup_multi(struct in_addr, struct ifnet *);
    248      1.68     rmind struct in_multi *in_addmulti(struct in_addr *, struct ifnet *);
    249      1.68     rmind void in_delmulti(struct in_multi *);
    250      1.68     rmind 
    251      1.68     rmind void in_multi_lock(int);
    252      1.68     rmind void in_multi_unlock(void);
    253      1.68     rmind int in_multi_lock_held(void);
    254       1.4   hpeyerl 
    255      1.36   thorpej struct ifaddr;
    256      1.36   thorpej 
    257      1.53    itojun int	in_ifinit(struct ifnet *,
    258  1.70.4.1     skrll 	    struct in_ifaddr *, const struct sockaddr_in *, int, int);
    259      1.53    itojun void	in_savemkludge(struct in_ifaddr *);
    260      1.53    itojun void	in_restoremkludge(struct in_ifaddr *, struct ifnet *);
    261      1.53    itojun void	in_purgemkludge(struct ifnet *);
    262      1.53    itojun void	in_ifscrub(struct ifnet *, struct in_ifaddr *);
    263      1.53    itojun void	in_setmaxmtu(void);
    264      1.53    itojun const char *in_fmtaddr(struct in_addr);
    265      1.70       rtr int	in_control(struct socket *, u_long, void *, struct ifnet *);
    266      1.60    dyoung void	in_purgeaddr(struct ifaddr *);
    267      1.53    itojun void	in_purgeif(struct ifnet *);
    268      1.53    itojun int	ipflow_fastforward(struct mbuf *);
    269      1.61      matt 
    270      1.65     rmind struct ipid_state;
    271      1.65     rmind typedef struct ipid_state ipid_state_t;
    272      1.65     rmind 
    273      1.65     rmind ipid_state_t *	ip_id_init(void);
    274      1.65     rmind void		ip_id_fini(ipid_state_t *);
    275      1.65     rmind uint16_t	ip_randomid(ipid_state_t *, uint16_t);
    276      1.65     rmind 
    277      1.65     rmind extern ipid_state_t *	ip_ids;
    278      1.65     rmind extern uint16_t		ip_id;
    279      1.65     rmind extern int		ip_do_randomid;
    280      1.61      matt 
    281      1.61      matt /*
    282      1.65     rmind  * ip_newid_range: "allocate" num contiguous IP IDs.
    283      1.61      matt  *
    284      1.65     rmind  * => Return the first ID.
    285      1.61      matt  */
    286      1.61      matt static __inline uint16_t
    287      1.65     rmind ip_newid_range(const struct in_ifaddr *ia, u_int num)
    288      1.61      matt {
    289      1.61      matt 	uint16_t id;
    290      1.61      matt 
    291      1.61      matt 	if (ip_do_randomid) {
    292      1.61      matt 		/* XXX ignore num */
    293      1.65     rmind 		return ip_randomid(ip_ids, ia ? ia->ia_idsalt : 0);
    294      1.61      matt 	}
    295      1.61      matt 
    296      1.65     rmind 	/* Never allow an IP ID of 0 (detect wrap). */
    297      1.65     rmind 	if ((uint16_t)(ip_id + num) < ip_id) {
    298      1.61      matt 		ip_id = 1;
    299      1.65     rmind 	}
    300      1.61      matt 	id = htons(ip_id);
    301      1.61      matt 	ip_id += num;
    302      1.61      matt 	return id;
    303      1.61      matt }
    304      1.61      matt 
    305      1.61      matt static __inline uint16_t
    306      1.61      matt ip_newid(const struct in_ifaddr *ia)
    307      1.61      matt {
    308      1.65     rmind 
    309      1.61      matt 	return ip_newid_range(ia, 1);
    310      1.61      matt }
    311      1.35    itojun 
    312      1.55    atatat #ifdef SYSCTLFN_PROTO
    313      1.55    atatat int	sysctl_inpcblist(SYSCTLFN_PROTO);
    314      1.55    atatat #endif
    315      1.55    atatat 
    316      1.65     rmind #endif	/* !_KERNEL */
    317      1.35    itojun 
    318      1.35    itojun /* INET6 stuff */
    319      1.35    itojun #include <netinet6/in6_var.h>
    320      1.20     perry 
    321      1.56      elad #endif /* !_NETINET_IN_VAR_H_ */
    322