|
|
1.1 root 1: /*
2: * Copyright (c) 1982, 1986, 1990 Regents of the University of California.
3: * 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: *
1.1.1.2 ! root 33: * from: @(#)in.h 7.11 (Berkeley) 4/20/91
! 34: * in.h,v 1.3 1993/05/20 03:50:02 cgd Exp
1.1 root 35: */
36:
1.1.1.2 ! root 37: #ifndef _NETINET_IN_H_
! 38: #define _NETINET_IN_H_
! 39:
1.1 root 40: /*
41: * Constants and structures defined by the internet system,
42: * Per RFC 790, September 1981.
43: */
44:
45: /*
46: * Protocols
47: */
48: #define IPPROTO_IP 0 /* dummy for IP */
49: #define IPPROTO_ICMP 1 /* control message protocol */
50: #define IPPROTO_GGP 3 /* gateway^2 (deprecated) */
51: #define IPPROTO_TCP 6 /* tcp */
52: #define IPPROTO_EGP 8 /* exterior gateway protocol */
53: #define IPPROTO_PUP 12 /* pup */
54: #define IPPROTO_UDP 17 /* user datagram protocol */
55: #define IPPROTO_IDP 22 /* xns idp */
56: #define IPPROTO_TP 29 /* tp-4 w/ class negotiation */
57: #define IPPROTO_EON 80 /* ISO cnlp */
58:
59: #define IPPROTO_RAW 255 /* raw IP packet */
60: #define IPPROTO_MAX 256
61:
62:
63: /*
64: * Local port number conventions:
65: * Ports < IPPORT_RESERVED are reserved for
66: * privileged processes (e.g. root).
67: * Ports > IPPORT_USERRESERVED are reserved
68: * for servers, not necessarily privileged.
69: */
70: #define IPPORT_RESERVED 1024
71: #define IPPORT_USERRESERVED 5000
72:
73: /*
74: * Internet address (a structure for historical reasons)
75: */
76: struct in_addr {
77: u_long s_addr;
78: };
79:
80: /*
81: * Definitions of bits in internet address integers.
82: * On subnets, the decomposition of addresses to host and net parts
83: * is done according to subnet mask, not the masks here.
84: */
85: #define IN_CLASSA(i) (((long)(i) & 0x80000000) == 0)
86: #define IN_CLASSA_NET 0xff000000
87: #define IN_CLASSA_NSHIFT 24
88: #define IN_CLASSA_HOST 0x00ffffff
89: #define IN_CLASSA_MAX 128
90:
91: #define IN_CLASSB(i) (((long)(i) & 0xc0000000) == 0x80000000)
92: #define IN_CLASSB_NET 0xffff0000
93: #define IN_CLASSB_NSHIFT 16
94: #define IN_CLASSB_HOST 0x0000ffff
95: #define IN_CLASSB_MAX 65536
96:
97: #define IN_CLASSC(i) (((long)(i) & 0xe0000000) == 0xc0000000)
98: #define IN_CLASSC_NET 0xffffff00
99: #define IN_CLASSC_NSHIFT 8
100: #define IN_CLASSC_HOST 0x000000ff
101:
102: #define IN_CLASSD(i) (((long)(i) & 0xf0000000) == 0xe0000000)
103: #define IN_MULTICAST(i) IN_CLASSD(i)
104:
105: #define IN_EXPERIMENTAL(i) (((long)(i) & 0xe0000000) == 0xe0000000)
106: #define IN_BADCLASS(i) (((long)(i) & 0xf0000000) == 0xf0000000)
107:
108: #define INADDR_ANY (u_long)0x00000000
109: #define INADDR_BROADCAST (u_long)0xffffffff /* must be masked */
110: #ifndef KERNEL
111: #define INADDR_NONE 0xffffffff /* -1 return */
112: #endif
113:
114: #define IN_LOOPBACKNET 127 /* official! */
115:
116: /*
117: * Socket address, internet style.
118: */
119: struct sockaddr_in {
120: u_char sin_len;
121: u_char sin_family;
122: u_short sin_port;
123: struct in_addr sin_addr;
124: char sin_zero[8];
125: };
126:
127: /*
128: * Structure used to describe IP options.
129: * Used to store options internally, to pass them to a process,
130: * or to restore options retrieved earlier.
131: * The ip_dst is used for the first-hop gateway when using a source route
132: * (this gets put into the header proper).
133: */
134: struct ip_opts {
135: struct in_addr ip_dst; /* first hop, 0 w/o src rt */
136: char ip_opts[40]; /* actually variable in size */
137: };
138:
139: /*
140: * Options for use with [gs]etsockopt at the IP level.
141: * First word of comment is data type; bool is stored in int.
142: */
143: #define IP_OPTIONS 1 /* buf/ip_opts; set/get IP per-packet options */
144: #define IP_HDRINCL 2 /* int; header is included with data (raw) */
145: #define IP_TOS 3 /* int; IP type of service and precedence */
146: #define IP_TTL 4 /* int; IP time to live */
147: #define IP_RECVOPTS 5 /* bool; receive all IP options w/datagram */
148: #define IP_RECVRETOPTS 6 /* bool; receive IP options for response */
149: #define IP_RECVDSTADDR 7 /* bool; receive IP dst addr w/datagram */
150: #define IP_RETOPTS 8 /* ip_opts; set/get IP per-packet options */
151:
152: #ifdef KERNEL
153: struct in_addr in_makeaddr();
154: u_long in_netof(), in_lnaof();
155: #endif
1.1.1.2 ! root 156:
! 157: #endif /* !_NETINET_IN_H_ */
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.