1 |
207 |
jeremybenn |
/*
|
2 |
|
|
* Copyright (c) 1982, 1986, 1993
|
3 |
|
|
* The Regents of the University of California. All rights reserved.
|
4 |
|
|
*
|
5 |
|
|
* Redistribution and use in source and binary forms, with or without
|
6 |
|
|
* modification, are permitted provided that the following conditions
|
7 |
|
|
* are met:
|
8 |
|
|
* 1. Redistributions of source code must retain the above copyright
|
9 |
|
|
* notice, this list of conditions and the following disclaimer.
|
10 |
|
|
* 2. Redistributions in binary form must reproduce the above copyright
|
11 |
|
|
* notice, this list of conditions and the following disclaimer in the
|
12 |
|
|
* documentation and/or other materials provided with the distribution.
|
13 |
|
|
* 3. All advertising materials mentioning features or use of this software
|
14 |
|
|
* must display the following acknowledgement:
|
15 |
|
|
* This product includes software developed by the University of
|
16 |
|
|
* California, Berkeley and its contributors.
|
17 |
|
|
* 4. Neither the name of the University nor the names of its contributors
|
18 |
|
|
* may be used to endorse or promote products derived from this software
|
19 |
|
|
* without specific prior written permission.
|
20 |
|
|
*
|
21 |
|
|
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
|
22 |
|
|
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
23 |
|
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
24 |
|
|
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
|
25 |
|
|
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
26 |
|
|
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
|
27 |
|
|
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
28 |
|
|
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
29 |
|
|
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
|
30 |
|
|
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
31 |
|
|
* SUCH DAMAGE.
|
32 |
|
|
*
|
33 |
|
|
* @(#)ip_var.h 8.2 (Berkeley) 1/9/95
|
34 |
|
|
* $FreeBSD: src/sys/netinet/ip_var.h,v 1.60 2002/03/19 21:25:46 alfred Exp $
|
35 |
|
|
*/
|
36 |
|
|
|
37 |
|
|
#ifndef _NETINET_IP_VAR_H_
|
38 |
|
|
#define _NETINET_IP_VAR_H_
|
39 |
|
|
|
40 |
|
|
#include <sys/queue.h>
|
41 |
|
|
|
42 |
|
|
/*
|
43 |
|
|
* Overlay for ip header used by other protocols (tcp, udp).
|
44 |
|
|
*/
|
45 |
|
|
struct ipovly {
|
46 |
|
|
u_char ih_x1[9]; /* (unused) */
|
47 |
|
|
u_char ih_pr; /* protocol */
|
48 |
|
|
u_short ih_len; /* protocol length */
|
49 |
|
|
struct in_addr ih_src; /* source internet address */
|
50 |
|
|
struct in_addr ih_dst; /* destination internet address */
|
51 |
|
|
};
|
52 |
|
|
|
53 |
|
|
/*
|
54 |
|
|
* Ip reassembly queue structure. Each fragment
|
55 |
|
|
* being reassembled is attached to one of these structures.
|
56 |
|
|
* They are timed out after ipq_ttl drops to 0, and may also
|
57 |
|
|
* be reclaimed if memory becomes tight.
|
58 |
|
|
*/
|
59 |
|
|
struct ipq {
|
60 |
|
|
TAILQ_ENTRY(ipq) ipq_list; /* to other reass headers */
|
61 |
|
|
u_char ipq_ttl; /* time for reass q to live */
|
62 |
|
|
u_char ipq_p; /* protocol of this fragment */
|
63 |
|
|
u_short ipq_id; /* sequence id for reassembly */
|
64 |
|
|
struct mbuf *ipq_frags; /* to ip headers of fragments */
|
65 |
|
|
struct in_addr ipq_src,ipq_dst;
|
66 |
|
|
#ifdef IPDIVERT
|
67 |
|
|
u_int32_t ipq_div_info; /* ipfw divert port & flags */
|
68 |
|
|
u_int16_t ipq_div_cookie; /* ipfw divert cookie */
|
69 |
|
|
#endif
|
70 |
|
|
};
|
71 |
|
|
|
72 |
|
|
/*
|
73 |
|
|
* Structure stored in mbuf in inpcb.ip_options
|
74 |
|
|
* and passed to ip_output when ip options are in use.
|
75 |
|
|
* The actual length of the options (including ipopt_dst)
|
76 |
|
|
* is in m_len.
|
77 |
|
|
*/
|
78 |
|
|
#define MAX_IPOPTLEN 40
|
79 |
|
|
|
80 |
|
|
struct ipoption {
|
81 |
|
|
struct in_addr ipopt_dst; /* first-hop dst if source routed */
|
82 |
|
|
char ipopt_list[MAX_IPOPTLEN]; /* options proper */
|
83 |
|
|
};
|
84 |
|
|
|
85 |
|
|
/*
|
86 |
|
|
* Structure attached to inpcb.ip_moptions and
|
87 |
|
|
* passed to ip_output when IP multicast options are in use.
|
88 |
|
|
*/
|
89 |
|
|
struct ip_moptions {
|
90 |
|
|
struct ifnet *imo_multicast_ifp; /* ifp for outgoing multicasts */
|
91 |
|
|
struct in_addr imo_multicast_addr; /* ifindex/addr on MULTICAST_IF */
|
92 |
|
|
u_char imo_multicast_ttl; /* TTL for outgoing multicasts */
|
93 |
|
|
u_char imo_multicast_loop; /* 1 => hear sends if a member */
|
94 |
|
|
u_short imo_num_memberships; /* no. memberships this socket */
|
95 |
|
|
struct in_multi *imo_membership[IP_MAX_MEMBERSHIPS];
|
96 |
|
|
u_long imo_multicast_vif; /* vif num outgoing multicasts */
|
97 |
|
|
};
|
98 |
|
|
|
99 |
|
|
struct ipstat {
|
100 |
|
|
u_long ips_total; /* total packets received */
|
101 |
|
|
u_long ips_badsum; /* checksum bad */
|
102 |
|
|
u_long ips_tooshort; /* packet too short */
|
103 |
|
|
u_long ips_toosmall; /* not enough data */
|
104 |
|
|
u_long ips_badhlen; /* ip header length < data size */
|
105 |
|
|
u_long ips_badlen; /* ip length < ip header length */
|
106 |
|
|
u_long ips_fragments; /* fragments received */
|
107 |
|
|
u_long ips_fragdropped; /* frags dropped (dups, out of space) */
|
108 |
|
|
u_long ips_fragtimeout; /* fragments timed out */
|
109 |
|
|
u_long ips_forward; /* packets forwarded */
|
110 |
|
|
u_long ips_fastforward; /* packets fast forwarded */
|
111 |
|
|
u_long ips_cantforward; /* packets rcvd for unreachable dest */
|
112 |
|
|
u_long ips_redirectsent; /* packets forwarded on same net */
|
113 |
|
|
u_long ips_noproto; /* unknown or unsupported protocol */
|
114 |
|
|
u_long ips_delivered; /* datagrams delivered to upper level*/
|
115 |
|
|
u_long ips_localout; /* total ip packets generated here */
|
116 |
|
|
u_long ips_odropped; /* lost packets due to nobufs, etc. */
|
117 |
|
|
u_long ips_reassembled; /* total packets reassembled ok */
|
118 |
|
|
u_long ips_fragmented; /* datagrams successfully fragmented */
|
119 |
|
|
u_long ips_ofragments; /* output fragments created */
|
120 |
|
|
u_long ips_cantfrag; /* don't fragment flag was set, etc. */
|
121 |
|
|
u_long ips_badoptions; /* error in option processing */
|
122 |
|
|
u_long ips_noroute; /* packets discarded due to no route */
|
123 |
|
|
u_long ips_badvers; /* ip version != 4 */
|
124 |
|
|
u_long ips_rawout; /* total raw ip packets generated */
|
125 |
|
|
u_long ips_toolong; /* ip length > max ip packet size */
|
126 |
|
|
u_long ips_notmember; /* multicasts for unregistered grps */
|
127 |
|
|
u_long ips_nogif; /* no match gif found */
|
128 |
|
|
u_long ips_badaddr; /* invalid address on header */
|
129 |
|
|
};
|
130 |
|
|
|
131 |
|
|
#ifdef _KERNEL
|
132 |
|
|
|
133 |
|
|
/* flags passed to ip_output as last parameter */
|
134 |
|
|
#define IP_FORWARDING 0x1 /* most of ip header exists */
|
135 |
|
|
#define IP_RAWOUTPUT 0x2 /* raw ip header exists */
|
136 |
|
|
#define IP_ROUTETOIF SO_DONTROUTE /* bypass routing tables */
|
137 |
|
|
#define IP_ALLOWBROADCAST SO_BROADCAST /* can send broadcast packets */
|
138 |
|
|
|
139 |
|
|
struct ip;
|
140 |
|
|
struct inpcb;
|
141 |
|
|
struct route;
|
142 |
|
|
struct sockopt;
|
143 |
|
|
|
144 |
|
|
extern struct ipstat ipstat;
|
145 |
|
|
#ifndef RANDOM_IP_ID
|
146 |
|
|
extern u_short ip_id; /* ip packet ctr, for ids */
|
147 |
|
|
#endif
|
148 |
|
|
extern int ip_defttl; /* default IP ttl */
|
149 |
|
|
extern int ipforwarding; /* ip forwarding */
|
150 |
|
|
extern struct route ipforward_rt; /* ip forwarding cached route */
|
151 |
|
|
extern u_char ip_protox[];
|
152 |
|
|
extern struct socket *ip_rsvpd; /* reservation protocol daemon */
|
153 |
|
|
extern struct socket *ip_mrouter; /* multicast routing daemon */
|
154 |
|
|
extern int (*legal_vif_num)(int);
|
155 |
|
|
extern u_long (*ip_mcast_src)(int);
|
156 |
|
|
extern int rsvp_on;
|
157 |
|
|
extern struct pr_usrreqs rip_usrreqs;
|
158 |
|
|
|
159 |
|
|
int ip_ctloutput(struct socket *, struct sockopt *sopt);
|
160 |
|
|
void ip_drain(void);
|
161 |
|
|
void ip_freemoptions(struct ip_moptions *);
|
162 |
|
|
void ip_init(void);
|
163 |
|
|
extern int (*ip_mforward)(struct ip *, struct ifnet *, struct mbuf *,
|
164 |
|
|
struct ip_moptions *);
|
165 |
|
|
int ip_output(struct mbuf *,
|
166 |
|
|
struct mbuf *, struct route *, int, struct ip_moptions *);
|
167 |
|
|
struct in_ifaddr *
|
168 |
|
|
ip_rtaddr(struct in_addr, struct route *);
|
169 |
|
|
void ip_savecontrol(struct inpcb *, struct mbuf **, struct ip *,
|
170 |
|
|
struct mbuf *);
|
171 |
|
|
void ip_slowtimo(void);
|
172 |
|
|
struct mbuf *
|
173 |
|
|
ip_srcroute(void);
|
174 |
|
|
void ip_stripoptions(struct mbuf *, struct mbuf *);
|
175 |
|
|
#ifdef RANDOM_IP_ID
|
176 |
|
|
u_int16_t
|
177 |
|
|
ip_randomid(void);
|
178 |
|
|
#endif
|
179 |
|
|
int rip_ctloutput(struct socket *, struct sockopt *);
|
180 |
|
|
void rip_ctlinput(int, struct sockaddr *, void *);
|
181 |
|
|
void rip_init(void);
|
182 |
|
|
void rip_input(struct mbuf *, int);
|
183 |
|
|
int rip_output(struct mbuf *, struct socket *, u_long);
|
184 |
|
|
void ipip_input(struct mbuf *, int);
|
185 |
|
|
void rsvp_input(struct mbuf *, int);
|
186 |
|
|
int ip_rsvp_init(struct socket *);
|
187 |
|
|
int ip_rsvp_done(void);
|
188 |
|
|
int ip_rsvp_vif_init(struct socket *, struct sockopt *);
|
189 |
|
|
int ip_rsvp_vif_done(struct socket *, struct sockopt *);
|
190 |
|
|
void ip_rsvp_force_done(struct socket *);
|
191 |
|
|
|
192 |
|
|
#ifdef IPDIVERT
|
193 |
|
|
void div_init(void);
|
194 |
|
|
void div_input(struct mbuf *, int);
|
195 |
|
|
void divert_packet(struct mbuf *, int, int);
|
196 |
|
|
extern struct pr_usrreqs div_usrreqs;
|
197 |
|
|
extern u_int16_t ip_divert_cookie;
|
198 |
|
|
#endif
|
199 |
|
|
|
200 |
|
|
extern struct sockaddr_in *ip_fw_fwd_addr;
|
201 |
|
|
|
202 |
|
|
void in_delayed_cksum(struct mbuf *m);
|
203 |
|
|
|
204 |
|
|
#endif /* _KERNEL */
|
205 |
|
|
|
206 |
|
|
#endif /* !_NETINET_IP_VAR_H_ */
|