2 * Copyright (c) 2001 Wichert Akkerman <wichert@cistron.nl>
3 * Copyright (c) 2004-2015 Dmitry V. Levin <ldv@altlinux.org>
6 * Redistribution and use in source and binary forms, with or without
7 * modification, are permitted provided that the following conditions
9 * 1. Redistributions of source code must retain the above copyright
10 * notice, this list of conditions and the following disclaimer.
11 * 2. Redistributions in binary form must reproduce the above copyright
12 * notice, this list of conditions and the following disclaimer in the
13 * documentation and/or other materials provided with the distribution.
14 * 3. The name of the author may not be used to endorse or promote products
15 * derived from this software without specific prior written permission.
17 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
18 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
19 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
20 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
21 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
22 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
23 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
24 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
25 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
26 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
37 #include "ioctl_iocdef.h"
48 is_prefix(const char *s1, const char *s2)
50 size_t len = strlen(s1);
54 return !memcmp(s1, s2, len);
58 compare_name_info(const void* a, const void* b)
62 const char *name1 = ((struct ioctlent *) a)->name;
63 const char *name2 = ((struct ioctlent *) b)->name;
64 const char *info1 = ((struct ioctlent *) a)->info;
65 const char *info2 = ((struct ioctlent *) b)->info;
67 rc = strcmp(name1, name2);
72 * exception from lexicographical order:
73 * "asm/" < "asm-generic/"
75 if (is_prefix("asm/", info1) &&
76 is_prefix("asm-generic/", info2))
79 if (is_prefix("asm/", info2) &&
80 is_prefix("asm-generic/", info1))
83 return strcmp(info1, info2);
87 code(const struct ioctlent *e)
90 (e->size << _IOC_SIZESHIFT) |
91 (e->dir << _IOC_DIRSHIFT);
95 compare_code_name(const void* a, const void* b)
97 unsigned int code1 = code((struct ioctlent *) a);
98 unsigned int code2 = code((struct ioctlent *) b);
99 const char *name1 = ((struct ioctlent *) a)->name;
100 const char *name2 = ((struct ioctlent *) b)->name;
101 return (code1 > code2) ?
102 1 : (code1 < code2) ? -1 : strcmp(name1, name2);
106 ioctlsort(struct ioctlent *ioctls, size_t nioctls)
110 qsort(ioctls, nioctls, sizeof(ioctls[0]), compare_name_info);
112 for (i = 1; i < nioctls; ++i)
113 if (!strcmp(ioctls[i-1].name, ioctls[i].name)) {
115 * If there are multiple definitions for the same
116 * name, keep the first one and mark all the rest
119 ioctls[i].info = NULL;
122 for (i = 1; i < nioctls; ++i)
123 if (!ioctls[i].info) {
125 * Change ioctl code of marked elements
126 * to make them sorted to the end of array.
130 ioctls[i].size = 0xffffffffu;
133 qsort(ioctls, nioctls, sizeof(ioctls[0]), compare_code_name);
135 puts("/* Generated by ioctlsort. */");
136 for (i = 0; i < nioctls; ++i) {
137 if (!ioctls[i].info) {
139 * We've reached the first element marked for deletion.
143 if (i == 0 || code(&ioctls[i-1]) != code(&ioctls[i]) ||
144 !is_prefix(ioctls[i-1].name, ioctls[i].name))
145 printf("{ \"%s\", %#010x },\n",
146 ioctls[i].name, code(ioctls+i));
150 static struct ioctlent ioctls[] = {
152 # include IOCTLSORT_INC
154 # include "ioctls_arch.h"
155 # include "ioctls_inc.h"
162 ioctlsort(ioctls, sizeof(ioctls) / sizeof(ioctls[0]));