2 * Copyright (c) 1991, 1992 Paul Kranenburg <pk@cs.few.eur.nl>
3 * Copyright (c) 1993 Branko Lankester <branko@hacktic.nl>
4 * Copyright (c) 1993, 1994, 1995, 1996 Rick Sladkey <jrs@world.std.com>
5 * Copyright (c) 1996-2001 Wichert Akkerman <wichert@cistron.nl>
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted provided that the following conditions
11 * 1. Redistributions of source code must retain the above copyright
12 * notice, this list of conditions and the following disclaimer.
13 * 2. Redistributions in binary form must reproduce the above copyright
14 * notice, this list of conditions and the following disclaimer in the
15 * documentation and/or other materials provided with the distribution.
16 * 3. The name of the author may not be used to endorse or promote products
17 * derived from this software without specific prior written permission.
19 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
20 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
21 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
22 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
23 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
24 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
25 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
26 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
27 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
28 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
32 #include <linux/ioctl.h>
33 #include "xlat/ioctl_dirs.h"
35 #ifdef HAVE_LINUX_INPUT_H
36 # include <linux/input.h>
39 #include "xlat/evdev_abs.h"
40 #include "xlat/evdev_ev.h"
43 compare(const void *a, const void *b)
45 const unsigned int code1 = (const unsigned long) a;
46 const unsigned int code2 = ((struct_ioctlent *) b)->code;
47 return (code1 > code2) ? 1 : (code1 < code2) ? -1 : 0;
50 static const struct_ioctlent *
51 ioctl_lookup(const unsigned int code)
55 iop = bsearch((const void *) (const unsigned long) code, ioctlent,
56 nioctlents, sizeof(ioctlent[0]), compare);
57 while (iop > ioctlent) {
59 if (iop->code != code) {
67 static const struct_ioctlent *
68 ioctl_next_match(const struct_ioctlent *iop)
70 const unsigned int code = iop->code;
72 if (iop < ioctlent + nioctlents && iop->code == code)
78 ioctl_print_code(const unsigned int code)
81 printflags(ioctl_dirs, _IOC_DIR(code), "_IOC_???");
82 tprintf(", 0x%02x, 0x%02x, 0x%02x)",
83 _IOC_TYPE(code), _IOC_NR(code), _IOC_SIZE(code));
87 evdev_decode_number(const unsigned int code)
89 const unsigned int nr = _IOC_NR(code);
91 if (_IOC_DIR(code) == _IOC_WRITE) {
92 if (nr >= 0xc0 && nr <= 0xc0 + 0x3f) {
93 tprints("EVIOCSABS(");
94 printxval(evdev_abs, nr - 0xc0, "EV_???");
100 if (_IOC_DIR(code) != _IOC_READ)
103 if (nr >= 0x20 && nr <= 0x20 + 0x1f) {
104 tprints("EVIOCGBIT(");
105 printxval(evdev_ev, nr - 0x20, "EV_???");
106 tprintf(", %u)", _IOC_SIZE(code));
108 } else if (nr >= 0x40 && nr <= 0x40 + 0x3f) {
109 tprints("EVIOCGABS(");
110 printxval(evdev_abs, nr - 0x40, "ABS_???");
115 switch (_IOC_NR(nr)) {
117 tprintf("EVIOCGNAME(%u)", _IOC_SIZE(code));
120 tprintf("EVIOCGPHYS(%u)", _IOC_SIZE(code));
123 tprintf("EVIOCGUNIQ(%u)", _IOC_SIZE(code));
126 tprintf("EVIOCGPROP(%u)", _IOC_SIZE(code));
129 tprintf("EVIOCGMTSLOTS(%u)", _IOC_SIZE(code));
132 tprintf("EVIOCGKEY(%u)", _IOC_SIZE(code));
135 tprintf("EVIOCGLED(%u)", _IOC_SIZE(code));
138 tprintf("EVIOCGSND(%u)", _IOC_SIZE(code));
141 tprintf("EVIOCGSW(%u)", _IOC_SIZE(code));
149 hiddev_decode_number(const unsigned int code)
151 if (_IOC_DIR(code) == _IOC_READ) {
152 switch (_IOC_NR(code)) {
154 tprintf("HIDIOCGRAWNAME(%u)", _IOC_SIZE(code));
157 tprintf("HIDIOCGRAWPHYS(%u)", _IOC_SIZE(code));
160 tprintf("HIDIOCSFEATURE(%u)", _IOC_SIZE(code));
163 tprintf("HIDIOCGPHYS(%u)", _IOC_SIZE(code));
168 } else if (_IOC_DIR(code) == (_IOC_READ | _IOC_WRITE)) {
169 switch (_IOC_NR(code)) {
171 tprintf("HIDIOCSFEATURE(%u)", _IOC_SIZE(code));
174 tprintf("HIDIOCGFEATURE(%u)", _IOC_SIZE(code));
185 ioctl_decode_command_number(struct tcb *tcp)
187 const unsigned int code = tcp->u_arg[1];
189 switch (_IOC_TYPE(code)) {
191 return evdev_decode_number(code);
193 return hiddev_decode_number(code);
195 if (_IOC_DIR(code) == _IOC_WRITE) {
196 tprintf("MIXER_WRITE(%u)", _IOC_NR(code));
198 } else if (_IOC_DIR(code) == _IOC_READ) {
199 tprintf("MIXER_READ(%u)", _IOC_NR(code));
204 if (_IOC_DIR(code) == _IOC_READ && _IOC_NR(code) == 0x2c) {
205 tprintf("UI_GET_SYSNAME(%u)", _IOC_SIZE(code));
210 if (_IOC_DIR(code) == _IOC_READ && _IOC_NR(code) == 0x13) {
211 tprintf("JSIOCGNAME(%u)", _IOC_SIZE(code));
216 if (_IOC_DIR(code) == _IOC_WRITE && _IOC_NR(code) == 0) {
217 tprintf("SPI_IOC_MESSAGE(%u)", _IOC_SIZE(code));
227 ioctl_decode(struct tcb *tcp)
229 const unsigned int code = tcp->u_arg[1];
230 const long arg = tcp->u_arg[2];
232 switch (_IOC_TYPE(code)) {
233 #if defined(ALPHA) || defined(POWERPC)
234 case 'f': case 't': case 'T':
238 return term_ioctl(tcp, code, arg);
240 return sock_ioctl(tcp, code, arg);
242 return rtc_ioctl(tcp, code, arg);
246 return block_ioctl(tcp, code, arg);
247 #ifdef HAVE_SCSI_SG_H
249 return scsi_ioctl(tcp, code, arg);
252 return loop_ioctl(tcp, code, arg);
254 return mtd_ioctl(tcp, code, arg);
257 return ubi_ioctl(tcp, code, arg);
259 return v4l2_ioctl(tcp, code, arg);
261 return ptp_ioctl(tcp, code, arg);
262 #ifdef HAVE_LINUX_INPUT_H
264 return evdev_ioctl(tcp, code, arg);
274 const struct_ioctlent *iop;
278 printfd(tcp, tcp->u_arg[0]);
280 ret = ioctl_decode_command_number(tcp);
281 if (!(ret & IOCTL_NUMBER_STOP_LOOKUP)) {
282 iop = ioctl_lookup(tcp->u_arg[1]);
286 tprints(iop->symbol);
287 while ((iop = ioctl_next_match(iop)))
288 tprintf(" or %s", iop->symbol);
290 ioctl_print_code(tcp->u_arg[1]);
293 ret = ioctl_decode(tcp);
295 ret = ioctl_decode(tcp) | RVAL_DECODED;
298 if (ret & RVAL_DECODED) {
299 ret &= ~RVAL_DECODED;
303 tprintf(", %#lx", tcp->u_arg[2]);