* Copyright (c) 1982 Regents of the University of California.
* All rights reserved. The Berkeley software License Agreement
* specifies the terms and conditions for redistribution.
* @(#)ip_var.h 6.4 (Berkeley) %G%
* Overlay for ip header used by other protocols (tcp, udp).
caddr_t ih_next
, ih_prev
; /* for protocol sequence q's */
u_char ih_x1
; /* (unused) */
u_char ih_pr
; /* protocol */
short ih_len
; /* protocol length */
struct in_addr ih_src
; /* source internet address */
struct in_addr ih_dst
; /* destination internet address */
* Ip reassembly queue structure. Each fragment
* being reassembled is attached to one of these structures.
* They are timed out after ipq_ttl drops to 0, and may also
* be reclaimed if memory becomes tight.
struct ipq
*next
,*prev
; /* to other reass headers */
u_char ipq_ttl
; /* time for reass q to live */
u_char ipq_p
; /* protocol of this fragment */
u_short ipq_id
; /* sequence id for reassembly */
struct ipasfrag
*ipq_next
,*ipq_prev
;
/* to ip headers of fragments */
struct in_addr ipq_src
,ipq_dst
;
* Ip header, when holding a fragment.
* Note: ipf_next must be at same offset as ipq_next above
u_char ipf_mff
; /* copied from (ip_off&IP_MF) */
struct ipasfrag
*ipf_next
; /* next fragment */
struct ipasfrag
*ipf_prev
; /* previous fragment */
int ips_badsum
; /* checksum bad */
int ips_tooshort
; /* packet too short */
int ips_toosmall
; /* not enough data */
int ips_badhlen
; /* ip header length < data size */
int ips_badlen
; /* ip length < ip header length */
long ips_forward
; /* packets forwarded */
long ips_cantforward
; /* packets rcvd for unreachable dest */
/* flags passed to ip_output as last parameter */
#define IP_FORWARDING 0x1 /* most of ip header exists */
#define IP_ROUTETOIF SO_DONTROUTE /* bypass routing tables */
#define IP_ALLOWBROADCAST SO_BROADCAST /* can send broadcast packets */
struct ipq ipq
; /* ip reass. queue */
u_short ip_id
; /* ip packet ctr, for ids */