Home | History | Annotate | Line # | Download | only in netinet
in_var.h revision 1.59.6.2
      1  1.59.6.2       mjf /*	$NetBSD: in_var.h,v 1.59.6.2 2008/02/18 21:07:08 mjf 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  * 3. All advertising materials mentioning features or use of this software
     20      1.32   thorpej  *    must display the following acknowledgement:
     21      1.32   thorpej  *	This product includes software developed by the NetBSD
     22      1.32   thorpej  *	Foundation, Inc. and its contributors.
     23      1.32   thorpej  * 4. Neither the name of The NetBSD Foundation nor the names of its
     24      1.32   thorpej  *    contributors may be used to endorse or promote products derived
     25      1.32   thorpej  *    from this software without specific prior written permission.
     26      1.32   thorpej  *
     27      1.32   thorpej  * THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS
     28      1.32   thorpej  * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
     29      1.32   thorpej  * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
     30      1.32   thorpej  * PURPOSE ARE DISCLAIMED.  IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS
     31      1.32   thorpej  * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
     32      1.32   thorpej  * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
     33      1.32   thorpej  * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
     34      1.32   thorpej  * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
     35      1.32   thorpej  * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
     36      1.32   thorpej  * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
     37      1.32   thorpej  * POSSIBILITY OF SUCH DAMAGE.
     38      1.32   thorpej  */
     39      1.32   thorpej 
     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.48       agc  * 3. Neither the name of the University nor the names of its contributors
     53       1.1       cgd  *    may be used to endorse or promote products derived from this software
     54       1.1       cgd  *    without specific prior written permission.
     55       1.1       cgd  *
     56       1.1       cgd  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
     57       1.1       cgd  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
     58       1.1       cgd  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
     59       1.1       cgd  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
     60       1.1       cgd  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
     61       1.1       cgd  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
     62       1.1       cgd  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
     63       1.1       cgd  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
     64       1.1       cgd  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
     65       1.1       cgd  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
     66       1.1       cgd  * SUCH DAMAGE.
     67       1.1       cgd  *
     68      1.19   thorpej  *	@(#)in_var.h	8.2 (Berkeley) 1/9/95
     69       1.1       cgd  */
     70       1.1       cgd 
     71      1.20     perry #ifndef _NETINET_IN_VAR_H_
     72      1.20     perry #define _NETINET_IN_VAR_H_
     73      1.20     perry 
     74      1.15   mycroft #include <sys/queue.h>
     75      1.15   mycroft 
     76       1.1       cgd /*
     77       1.1       cgd  * Interface address, Internet version.  One of these structures
     78       1.1       cgd  * is allocated for each interface with an Internet address.
     79       1.1       cgd  * The ifaddr structure contains the protocol-independent part
     80       1.1       cgd  * of the structure and is assumed to be first.
     81       1.1       cgd  */
     82       1.1       cgd struct in_ifaddr {
     83       1.1       cgd 	struct	ifaddr ia_ifa;		/* protocol-independent info */
     84       1.1       cgd #define	ia_ifp		ia_ifa.ifa_ifp
     85       1.7   mycroft #define ia_flags	ia_ifa.ifa_flags
     86       1.1       cgd 					/* ia_{,sub}net{,mask} in host order */
     87      1.11       cgd 	u_int32_t ia_net;		/* network number of interface */
     88      1.11       cgd 	u_int32_t ia_netmask;		/* mask of net part */
     89      1.11       cgd 	u_int32_t ia_subnet;		/* subnet number, including net */
     90      1.11       cgd 	u_int32_t ia_subnetmask;	/* mask of subnet part */
     91       1.1       cgd 	struct	in_addr ia_netbroadcast; /* to recognize net broadcasts */
     92      1.21       tls 	LIST_ENTRY(in_ifaddr) ia_hash;	/* entry in bucket of inet addresses */
     93      1.15   mycroft 	TAILQ_ENTRY(in_ifaddr) ia_list;	/* list of internet addresses */
     94       1.1       cgd 	struct	sockaddr_in ia_addr;	/* reserve space for interface name */
     95      1.11       cgd 	struct	sockaddr_in ia_dstaddr;	/* reserve space for broadcast addr */
     96       1.1       cgd #define	ia_broadaddr	ia_dstaddr
     97       1.1       cgd 	struct	sockaddr_in ia_sockmask; /* reserve space for general netmask */
     98      1.15   mycroft 	LIST_HEAD(, in_multi) ia_multiaddrs; /* list of multicast addresses */
     99      1.41     enami 	struct	in_multi *ia_allhosts;	/* multicast address record for
    100      1.41     enami 					   the allhosts multicast group */
    101  1.59.6.2       mjf 	uint16_t ia_idsalt;		/* ip_id salt for this ia */
    102       1.1       cgd };
    103       1.1       cgd 
    104       1.1       cgd struct	in_aliasreq {
    105       1.1       cgd 	char	ifra_name[IFNAMSIZ];		/* if name, e.g. "en0" */
    106       1.1       cgd 	struct	sockaddr_in ifra_addr;
    107      1.14   mycroft 	struct	sockaddr_in ifra_dstaddr;
    108      1.14   mycroft #define	ifra_broadaddr	ifra_dstaddr
    109       1.1       cgd 	struct	sockaddr_in ifra_mask;
    110       1.1       cgd };
    111       1.1       cgd /*
    112       1.1       cgd  * Given a pointer to an in_ifaddr (ifaddr),
    113       1.1       cgd  * return a pointer to the addr as a sockaddr_in.
    114       1.1       cgd  */
    115       1.1       cgd #define	IA_SIN(ia) (&(((struct in_ifaddr *)(ia))->ia_addr))
    116       1.1       cgd 
    117       1.7   mycroft 
    118      1.10    briggs #ifdef	_KERNEL
    119      1.21       tls #ifndef IN_IFADDR_HASH_SIZE
    120      1.29       tls #define IN_IFADDR_HASH_SIZE 509	/* 61, 127, 251, 509, 1021, 2039 are good */
    121      1.21       tls #endif
    122      1.45      matt #ifndef IN_MULTI_HASH_SIZE
    123      1.45      matt #define IN_MULTI_HASH_SIZE 509	/* 61, 127, 251, 509, 1021, 2039 are good */
    124      1.45      matt #endif
    125      1.21       tls 
    126      1.28       tls /*
    127      1.28       tls  * This is a bit unconventional, and wastes a little bit of space, but
    128      1.28       tls  * because we want a very even hash function we don't use & in_ifaddrhash
    129      1.28       tls  * here, but rather % the hash size, which should obviously be prime.
    130      1.28       tls  */
    131      1.28       tls 
    132      1.28       tls #define	IN_IFADDR_HASH(x) in_ifaddrhashtbl[(u_long)(x) % IN_IFADDR_HASH_SIZE]
    133      1.45      matt #define IN_MULTI_HASH(x, ifp) \
    134      1.46    itojun 	(in_multihashtbl[(u_long)((x) ^ (ifp->if_index)) % IN_MULTI_HASH_SIZE])
    135      1.21       tls 
    136      1.21       tls LIST_HEAD(in_ifaddrhashhead, in_ifaddr);	/* Type of the hash head */
    137      1.21       tls TAILQ_HEAD(in_ifaddrhead, in_ifaddr);		/* Type of the list head */
    138      1.45      matt LIST_HEAD(in_multihashhead, in_multi);		/* Type of the hash head */
    139      1.45      matt 
    140      1.21       tls 
    141      1.44      matt extern	u_long in_ifaddrhash;			/* size of hash table - 1 */
    142      1.44      matt extern	int	in_ifaddrentries;		/* total number of addrs */
    143      1.21       tls extern  struct in_ifaddrhashhead *in_ifaddrhashtbl;	/* Hash table head */
    144      1.51  jonathan extern  struct in_ifaddrhead in_ifaddrhead;		/* List head (in ip_input) */
    145      1.21       tls 
    146      1.45      matt extern	u_long in_multihash;			/* size of hash table - 1 */
    147      1.45      matt extern	int	in_multientries;		/* total number of addrs */
    148      1.45      matt extern  struct in_multihashhead *in_multihashtbl;	/* Hash table head */
    149      1.45      matt 
    150       1.7   mycroft extern	struct	ifqueue	ipintrq;		/* ip packet input queue */
    151      1.42      matt extern	const	int	inetctlerrmap[];
    152       1.7   mycroft 
    153       1.2   mycroft 
    154       1.4   hpeyerl /*
    155      1.21       tls  * Macro for finding whether an internet address (in_addr) belongs to one
    156      1.21       tls  * of our interfaces (in_ifaddr).  NULL if the address isn't ours.
    157      1.21       tls  */
    158      1.21       tls #define INADDR_TO_IA(addr, ia) \
    159      1.21       tls 	/* struct in_addr addr; */ \
    160      1.21       tls 	/* struct in_ifaddr *ia; */ \
    161      1.21       tls { \
    162      1.43      matt 	LIST_FOREACH(ia, &IN_IFADDR_HASH((addr).s_addr), ia_hash) { \
    163      1.49    itojun 		if (in_hosteq(ia->ia_addr.sin_addr, (addr))) \
    164      1.34   thorpej 			break; \
    165      1.34   thorpej 	} \
    166      1.27        is }
    167      1.27        is 
    168      1.27        is /*
    169      1.27        is  * Macro for finding the next in_ifaddr structure with the same internet
    170      1.27        is  * address as ia. Call only with a valid ia pointer.
    171      1.27        is  * Will set ia to NULL if none found.
    172      1.27        is  */
    173      1.27        is 
    174      1.27        is #define NEXT_IA_WITH_SAME_ADDR(ia) \
    175      1.27        is 	/* struct in_ifaddr *ia; */ \
    176      1.27        is { \
    177      1.27        is 	struct in_addr addr; \
    178      1.27        is 	addr = ia->ia_addr.sin_addr; \
    179      1.27        is 	do { \
    180      1.43      matt 		ia = LIST_NEXT(ia, ia_hash); \
    181      1.30    scottr 	} while ((ia != NULL) && !in_hosteq(ia->ia_addr.sin_addr, addr)); \
    182      1.21       tls }
    183      1.21       tls 
    184      1.21       tls /*
    185       1.4   hpeyerl  * Macro for finding the interface (ifnet structure) corresponding to one
    186       1.4   hpeyerl  * of our IP addresses.
    187       1.4   hpeyerl  */
    188       1.7   mycroft #define INADDR_TO_IFP(addr, ifp) \
    189       1.4   hpeyerl 	/* struct in_addr addr; */ \
    190       1.4   hpeyerl 	/* struct ifnet *ifp; */ \
    191       1.4   hpeyerl { \
    192      1.39  augustss 	struct in_ifaddr *ia; \
    193       1.4   hpeyerl \
    194      1.21       tls 	INADDR_TO_IA(addr, ia); \
    195       1.4   hpeyerl 	(ifp) = (ia == NULL) ? NULL : ia->ia_ifp; \
    196       1.4   hpeyerl }
    197       1.4   hpeyerl 
    198       1.4   hpeyerl /*
    199      1.21       tls  * Macro for finding an internet address structure (in_ifaddr) corresponding
    200       1.4   hpeyerl  * to a given interface (ifnet structure).
    201       1.4   hpeyerl  */
    202       1.7   mycroft #define IFP_TO_IA(ifp, ia) \
    203       1.4   hpeyerl 	/* struct ifnet *ifp; */ \
    204       1.4   hpeyerl 	/* struct in_ifaddr *ia; */ \
    205       1.4   hpeyerl { \
    206      1.39  augustss 	struct ifaddr *ifa; \
    207      1.21       tls \
    208      1.54      matt 	IFADDR_FOREACH(ifa, ifp) { \
    209      1.43      matt 		if (ifa->ifa_addr->sa_family == AF_INET) \
    210      1.43      matt 			break; \
    211      1.43      matt 	} \
    212      1.21       tls 	(ia) = ifatoia(ifa); \
    213       1.4   hpeyerl }
    214       1.4   hpeyerl #endif
    215       1.4   hpeyerl 
    216       1.4   hpeyerl /*
    217      1.12   mycroft  * Per-interface router version information.
    218      1.12   mycroft  */
    219      1.12   mycroft struct router_info {
    220      1.45      matt 	LIST_ENTRY(router_info) rti_link;
    221      1.12   mycroft 	struct	ifnet *rti_ifp;
    222      1.12   mycroft 	int	rti_type;	/* type of router on this interface */
    223      1.12   mycroft 	int	rti_age;	/* time since last v1 query */
    224      1.12   mycroft };
    225      1.12   mycroft 
    226      1.12   mycroft /*
    227       1.4   hpeyerl  * Internet multicast address structure.  There is one of these for each IP
    228       1.4   hpeyerl  * multicast group to which this host belongs on a given network interface.
    229       1.4   hpeyerl  * They are kept in a linked list, rooted in the interface's in_ifaddr
    230       1.4   hpeyerl  * structure.
    231       1.4   hpeyerl  */
    232       1.4   hpeyerl struct in_multi {
    233      1.45      matt 	LIST_ENTRY(in_multi) inm_list;	/* list of multicast addresses */
    234      1.45      matt 	struct	router_info *inm_rti;	/* router version info */
    235      1.45      matt 	struct	ifnet *inm_ifp;		/* back pointer to ifnet */
    236       1.4   hpeyerl 	struct	in_addr inm_addr;	/* IP multicast address */
    237       1.4   hpeyerl 	u_int	inm_refcount;		/* no. membership claims by sockets */
    238       1.4   hpeyerl 	u_int	inm_timer;		/* IGMP membership report timer */
    239      1.12   mycroft 	u_int	inm_state;		/* state of membership */
    240       1.4   hpeyerl };
    241       1.4   hpeyerl 
    242       1.9       jtc #ifdef _KERNEL
    243       1.4   hpeyerl /*
    244       1.4   hpeyerl  * Structure used by macros below to remember position when stepping through
    245       1.4   hpeyerl  * all of the in_multi records.
    246       1.4   hpeyerl  */
    247       1.4   hpeyerl struct in_multistep {
    248      1.47    itojun 	int i_n;
    249       1.4   hpeyerl 	struct in_multi *i_inm;
    250       1.4   hpeyerl };
    251       1.4   hpeyerl 
    252       1.4   hpeyerl /*
    253       1.4   hpeyerl  * Macro for looking up the in_multi record for a given IP multicast address
    254       1.4   hpeyerl  * on a given interface.  If no matching record is found, "inm" returns NULL.
    255       1.4   hpeyerl  */
    256       1.7   mycroft #define IN_LOOKUP_MULTI(addr, ifp, inm) \
    257       1.4   hpeyerl 	/* struct in_addr addr; */ \
    258       1.4   hpeyerl 	/* struct ifnet *ifp; */ \
    259       1.4   hpeyerl 	/* struct in_multi *inm; */ \
    260       1.4   hpeyerl { \
    261      1.45      matt 	LIST_FOREACH((inm), &IN_MULTI_HASH(((addr).s_addr), (ifp)), inm_list) {\
    262      1.45      matt 		if (in_hosteq((inm)->inm_addr, (addr)) && \
    263      1.45      matt 		    (inm)->inm_ifp == (ifp)) \
    264      1.45      matt 			break; \
    265      1.45      matt 	} \
    266       1.4   hpeyerl }
    267       1.4   hpeyerl 
    268       1.4   hpeyerl /*
    269       1.4   hpeyerl  * Macro to step through all of the in_multi records, one at a time.
    270       1.4   hpeyerl  * The current position is remembered in "step", which the caller must
    271       1.4   hpeyerl  * provide.  IN_FIRST_MULTI(), below, must be called to initialize "step"
    272       1.4   hpeyerl  * and get the first record.  Both macros return a NULL "inm" when there
    273       1.4   hpeyerl  * are no remaining records.
    274       1.4   hpeyerl  */
    275       1.7   mycroft #define IN_NEXT_MULTI(step, inm) \
    276       1.4   hpeyerl 	/* struct in_multistep  step; */ \
    277       1.4   hpeyerl 	/* struct in_multi *inm; */ \
    278       1.4   hpeyerl { \
    279      1.47    itojun 	while ((step).i_inm == NULL && (step).i_n < IN_MULTI_HASH_SIZE) \
    280      1.47    itojun 		(step).i_inm = LIST_FIRST(&in_multihashtbl[++(step).i_n]); \
    281       1.4   hpeyerl 	if (((inm) = (step).i_inm) != NULL) \
    282      1.43      matt 		(step).i_inm = LIST_NEXT((inm), inm_list); \
    283       1.4   hpeyerl }
    284       1.4   hpeyerl 
    285       1.7   mycroft #define IN_FIRST_MULTI(step, inm) \
    286       1.4   hpeyerl 	/* struct in_multistep step; */ \
    287       1.4   hpeyerl 	/* struct in_multi *inm; */ \
    288       1.4   hpeyerl { \
    289      1.47    itojun 	(step).i_n = 0; \
    290      1.47    itojun 	(step).i_inm = LIST_FIRST(&in_multihashtbl[0]); \
    291       1.4   hpeyerl 	IN_NEXT_MULTI((step), (inm)); \
    292       1.4   hpeyerl }
    293       1.4   hpeyerl 
    294      1.36   thorpej struct ifaddr;
    295      1.36   thorpej 
    296      1.53    itojun int	in_ifinit(struct ifnet *,
    297      1.59    dyoung 	    struct in_ifaddr *, const struct sockaddr_in *, int);
    298      1.53    itojun void	in_savemkludge(struct in_ifaddr *);
    299      1.53    itojun void	in_restoremkludge(struct in_ifaddr *, struct ifnet *);
    300      1.53    itojun void	in_purgemkludge(struct ifnet *);
    301      1.53    itojun struct	in_multi *in_addmulti(struct in_addr *, struct ifnet *);
    302      1.53    itojun void	in_delmulti(struct in_multi *);
    303      1.53    itojun void	in_ifscrub(struct ifnet *, struct in_ifaddr *);
    304      1.53    itojun void	in_setmaxmtu(void);
    305      1.53    itojun const char *in_fmtaddr(struct in_addr);
    306      1.58  christos int	in_control(struct socket *, u_long, void *, struct ifnet *,
    307      1.57        ad 	    struct lwp *);
    308  1.59.6.1       mjf void	in_purgeaddr(struct ifaddr *);
    309      1.53    itojun void	in_purgeif(struct ifnet *);
    310      1.53    itojun void	ip_input(struct mbuf *);
    311      1.53    itojun int	ipflow_fastforward(struct mbuf *);
    312  1.59.6.2       mjf void	ip_initid(void);
    313  1.59.6.2       mjf 
    314  1.59.6.2       mjf extern uint16_t	ip_id;
    315  1.59.6.2       mjf static __inline uint16_t ip_newid(const struct in_ifaddr *);
    316  1.59.6.2       mjf 
    317  1.59.6.2       mjf uint16_t ip_randomid(uint16_t);
    318  1.59.6.2       mjf extern int ip_do_randomid;
    319  1.59.6.2       mjf 
    320  1.59.6.2       mjf /*
    321  1.59.6.2       mjf  * ip_newid_range: "allocate" num contiguous ip_ids.
    322  1.59.6.2       mjf  *
    323  1.59.6.2       mjf  * => return the first id.
    324  1.59.6.2       mjf  */
    325  1.59.6.2       mjf 
    326  1.59.6.2       mjf static __inline uint16_t
    327  1.59.6.2       mjf ip_newid_range(const struct in_ifaddr *ia, unsigned int num)
    328  1.59.6.2       mjf {
    329  1.59.6.2       mjf 	uint16_t id;
    330  1.59.6.2       mjf 
    331  1.59.6.2       mjf 	if (ip_do_randomid) {
    332  1.59.6.2       mjf 		/* XXX ignore num */
    333  1.59.6.2       mjf 		return ip_randomid(ia ? ia->ia_idsalt : 0);
    334  1.59.6.2       mjf 	}
    335  1.59.6.2       mjf 
    336  1.59.6.2       mjf 	/*
    337  1.59.6.2       mjf 	 * never allow an ip_id of 0. (detect wrap)
    338  1.59.6.2       mjf 	 */
    339  1.59.6.2       mjf 	if ((uint16_t)(ip_id + num) < ip_id)
    340  1.59.6.2       mjf 		ip_id = 1;
    341  1.59.6.2       mjf 	id = htons(ip_id);
    342  1.59.6.2       mjf 	ip_id += num;
    343  1.59.6.2       mjf 
    344  1.59.6.2       mjf 	return id;
    345  1.59.6.2       mjf }
    346  1.59.6.2       mjf 
    347  1.59.6.2       mjf static __inline uint16_t
    348  1.59.6.2       mjf ip_newid(const struct in_ifaddr *ia)
    349  1.59.6.2       mjf {
    350  1.59.6.2       mjf 	return ip_newid_range(ia, 1);
    351  1.59.6.2       mjf }
    352      1.35    itojun 
    353      1.55    atatat #ifdef SYSCTLFN_PROTO
    354      1.55    atatat int	sysctl_inpcblist(SYSCTLFN_PROTO);
    355      1.55    atatat #endif
    356      1.55    atatat 
    357       1.4   hpeyerl #endif
    358      1.35    itojun 
    359      1.35    itojun /* INET6 stuff */
    360      1.35    itojun #include <netinet6/in6_var.h>
    361      1.20     perry 
    362      1.56      elad #endif /* !_NETINET_IN_VAR_H_ */
    363