1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
|
/*
* Copyright (c) 2001 Wichert Akkerman <wichert@cistron.nl>
* Copyright (c) 2004-2015 Dmitry V. Levin <ldv@altlinux.org>
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. The name of the author may not be used to endorse or promote products
* derived from this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
* IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
* OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
* IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
* INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
* NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
* THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
#ifdef HAVE_CONFIG_H
# include "config.h"
#endif
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <linux/ioctl.h>
struct ioctlent {
const char *info;
const char *name;
unsigned int dir;
unsigned int type_nr;
unsigned int size;
};
static int
is_prefix(const char *s1, const char *s2)
{
size_t len = strlen(s1);
if (len > strlen(s2))
return 0;
return !memcmp(s1, s2, len);
}
static int
compare_name_info(const void* a, const void* b)
{
int rc;
const char *name1 = ((struct ioctlent *) a)->name;
const char *name2 = ((struct ioctlent *) b)->name;
const char *info1 = ((struct ioctlent *) a)->info;
const char *info2 = ((struct ioctlent *) b)->info;
rc = strcmp(name1, name2);
if (rc)
return rc;
/*
* exception from lexicographical order:
* "asm/" < "asm-generic/"
*/
if (is_prefix("asm/", info1) &&
is_prefix("asm-generic/", info2))
return -1;
if (is_prefix("asm/", info2) &&
is_prefix("asm-generic/", info1))
return 1;
return strcmp(info1, info2);
}
static unsigned int
code(const struct ioctlent *e)
{
return e->type_nr |
(e->size << _IOC_SIZESHIFT) |
(e->dir << _IOC_DIRSHIFT);
}
static int
compare_code_name(const void* a, const void* b)
{
unsigned int code1 = code((struct ioctlent *) a);
unsigned int code2 = code((struct ioctlent *) b);
const char *name1 = ((struct ioctlent *) a)->name;
const char *name2 = ((struct ioctlent *) b)->name;
return (code1 > code2) ?
1 : (code1 < code2) ? -1 : strcmp(name1, name2);
}
static void
ioctlsort(struct ioctlent *ioctls, size_t nioctls)
{
size_t i;
qsort(ioctls, nioctls, sizeof(ioctls[0]), compare_name_info);
for (i = 1; i < nioctls; ++i)
if (!strcmp(ioctls[i-1].name, ioctls[i].name)) {
/*
* If there are multiple definitions for the same
* name, keep the first one and mark all the rest
* for deletion.
*/
ioctls[i].info = NULL;
}
for (i = 1; i < nioctls; ++i)
if (!ioctls[i].info) {
/*
* Change ioctl code of marked elements
* to make them sorted to the end of array.
*/
ioctls[i].dir =
ioctls[i].type_nr =
ioctls[i].size = 0xffffffffu;
}
qsort(ioctls, nioctls, sizeof(ioctls[0]), compare_code_name);
puts("/* Generated by ioctlsort. */");
for (i = 0; i < nioctls; ++i) {
if (!ioctls[i].info) {
/*
* We've reached the first element marked for deletion.
*/
break;
}
if (i == 0 || code(&ioctls[i-1]) != code(&ioctls[i]) ||
!is_prefix(ioctls[i-1].name, ioctls[i].name))
printf("{ \"%s\", %#010x },\n",
ioctls[i].name, code(ioctls+i));
}
}
static struct ioctlent ioctls[] = {
#ifdef IOCTLSORT_INC
# include IOCTLSORT_INC
#else
# include "ioctls_arch.h"
# include "ioctls_inc.h"
#endif
};
int
main(void)
{
ioctlsort(ioctls, sizeof(ioctls) / sizeof(ioctls[0]));
return 0;
}
|
