|
|
1.1 root 1: /*
2: * Copyright (c) 1999 Apple Computer, Inc. All rights reserved.
3: *
4: * @APPLE_LICENSE_HEADER_START@
5: *
6: * Portions Copyright (c) 1999 Apple Computer, Inc. All Rights
7: * Reserved. This file contains Original Code and/or Modifications of
8: * Original Code as defined in and that are subject to the Apple Public
9: * Source License Version 1.1 (the "License"). You may not use this file
10: * except in compliance with the License. Please obtain a copy of the
11: * License at http://www.apple.com/publicsource and read it before using
12: * this file.
13: *
14: * The Original Code and all software distributed under the License are
15: * distributed on an "AS IS" basis, WITHOUT WARRANTY OF ANY KIND, EITHER
16: * EXPRESS OR IMPLIED, AND APPLE HEREBY DISCLAIMS ALL SUCH WARRANTIES,
17: * INCLUDING WITHOUT LIMITATION, ANY WARRANTIES OF MERCHANTABILITY,
18: * FITNESS FOR A PARTICULAR PURPOSE OR NON-INFRINGEMENT. Please see the
19: * License for the specific language governing rights and limitations
20: * under the License.
21: *
22: * @APPLE_LICENSE_HEADER_END@
23: */
24:
25: /* Copyright (c) 1995 NeXT Computer, Inc. All Rights Reserved */
26: /*-
27: * Copyright (c) 1982, 1986, 1990, 1993, 1994
28: * The Regents of the University of California. All rights reserved.
29: *
30: * Redistribution and use in source and binary forms, with or without
31: * modification, are permitted provided that the following conditions
32: * are met:
33: * 1. Redistributions of source code must retain the above copyright
34: * notice, this list of conditions and the following disclaimer.
35: * 2. Redistributions in binary form must reproduce the above copyright
36: * notice, this list of conditions and the following disclaimer in the
37: * documentation and/or other materials provided with the distribution.
38: * 3. All advertising materials mentioning features or use of this software
39: * must display the following acknowledgement:
40: * This product includes software developed by the University of
41: * California, Berkeley and its contributors.
42: * 4. Neither the name of the University nor the names of its contributors
43: * may be used to endorse or promote products derived from this software
44: * without specific prior written permission.
45: *
46: * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
47: * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
48: * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
49: * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
50: * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
51: * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
52: * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
53: * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
54: * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
55: * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
56: * SUCH DAMAGE.
57: *
58: * @(#)sockio.h 8.1 (Berkeley) 3/28/94
59: */
60:
61: #ifndef _SYS_SOCKIO_H_
62: #define _SYS_SOCKIO_H_
63:
64: #include <sys/ioccom.h>
65:
66: /* Socket ioctl's. */
67: #define SIOCSHIWAT _IOW('s', 0, int) /* set high watermark */
68: #define SIOCGHIWAT _IOR('s', 1, int) /* get high watermark */
69: #define SIOCSLOWAT _IOW('s', 2, int) /* set low watermark */
70: #define SIOCGLOWAT _IOR('s', 3, int) /* get low watermark */
71: #define SIOCATMARK _IOR('s', 7, int) /* at oob mark? */
72: #define SIOCSPGRP _IOW('s', 8, int) /* set process group */
73: #define SIOCGPGRP _IOR('s', 9, int) /* get process group */
74:
75: #define SIOCADDRT _IOW('r', 10, struct ortentry) /* add route */
76: #define SIOCDELRT _IOW('r', 11, struct ortentry) /* delete route */
77:
78: #define SIOCSIFADDR _IOW('i', 12, struct ifreq) /* set ifnet address */
79: #define OSIOCGIFADDR _IOWR('i', 13, struct ifreq) /* get ifnet address */
80: #define SIOCSIFDSTADDR _IOW('i', 14, struct ifreq) /* set p-p address */
81: #define OSIOCGIFDSTADDR _IOWR('i', 15, struct ifreq) /* get p-p address */
82: #define SIOCSIFFLAGS _IOW('i', 16, struct ifreq) /* set ifnet flags */
83: #define SIOCGIFFLAGS _IOWR('i', 17, struct ifreq) /* get ifnet flags */
84: #define OSIOCGIFBRDADDR _IOWR('i', 18, struct ifreq) /* get broadcast addr */
85: #define SIOCSIFBRDADDR _IOW('i', 19, struct ifreq) /* set broadcast addr */
86: #define OSIOCGIFCONF _IOWR('i', 20, struct ifconf) /* get ifnet list */
87: #define OSIOCGIFNETMASK _IOWR('i', 21, struct ifreq) /* get net addr mask */
88: #define SIOCSIFNETMASK _IOW('i', 22, struct ifreq) /* set net addr mask */
89: #define SIOCGIFMETRIC _IOWR('i', 23, struct ifreq) /* get IF metric */
90: #define SIOCSIFMETRIC _IOW('i', 24, struct ifreq) /* set IF metric */
91: #define SIOCDIFADDR _IOW('i', 25, struct ifreq) /* delete IF addr */
92: #define SIOCAIFADDR _IOW('i', 26, struct ifaliasreq)/* add/chg IF alias */
93:
94: #define SIOCGIFADDR _IOWR('i', 33, struct ifreq) /* get ifnet address */
95: #define SIOCGIFDSTADDR _IOWR('i', 34, struct ifreq) /* get p-p address */
96: #define SIOCGIFBRDADDR _IOWR('i', 35, struct ifreq) /* get broadcast addr */
97: #define SIOCGIFCONF _IOWR('i', 36, struct ifconf) /* get ifnet list */
98: #define SIOCGIFNETMASK _IOWR('i', 37, struct ifreq) /* get net addr mask */
99: #define SIOCAUTOADDR _IOWR('i', 38, struct ifreq) /* autoconf address */
100: #define SIOCAUTONETMASK _IOW('i', 39, struct ifreq) /* autoconf netmask */
101:
102: #define SIOCADDMULTI _IOW('i', 49, struct ifreq) /* add m'cast addr */
103: #define SIOCDELMULTI _IOW('i', 50, struct ifreq) /* del m'cast addr */
104:
105: #define SIOCSIFMTU _IOW('i', 127, struct ifreq) /* set ifnet mtu */
106: #define SIOCGIFMTU _IOWR('i', 126, struct ifreq) /* get ifnet mtu */
107: #define SIOCSIFASYNCMAP _IOW('i', 125, struct ifreq) /* set ppp asyncmap */
108: #define SIOCGIFASYNCMAP _IOWR('i', 124, struct ifreq) /* get ppp asyncmap */
109:
110: #endif /* !_SYS_SOCKIO_H_ */
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.