1 /*
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-1999 Wichert Akkerman <wichert@cistron.nl>
6 * All rights reserved.
7 *
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted provided that the following conditions
10 * are met:
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.
18 *
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.
29 */
30
31 #include "defs.h"
32 #include <fcntl.h>
33 #include <sys/stat.h>
34 #include <sys/wait.h>
35 #include <sys/resource.h>
36 #include <sys/utsname.h>
37
38 /* Bits of module.flags. */
39
40 #define MOD_UNINITIALIZED 0
41 #define MOD_RUNNING 1
42 #define MOD_DELETED 2
43 #define MOD_AUTOCLEAN 4
44 #define MOD_VISITED 8
45 #define MOD_USED_ONCE 16
46 #define MOD_JUST_FREED 32
47 #define MOD_INITIALIZING 64
48
49 /* Values for query_module's which. */
50
51 #define QM_MODULES 1
52 #define QM_DEPS 2
53 #define QM_REFS 3
54 #define QM_SYMBOLS 4
55 #define QM_INFO 5
56
57 struct module_symbol
58 {
59 unsigned long value;
60 const char *name;
61 };
62
63 struct module_info
64 {
65 unsigned long addr;
66 unsigned long size;
67 unsigned long flags;
68 long usecount;
69 };
70
71 #include "xlat/qm_which.h"
72 #include "xlat/modflags.h"
73 #include "xlat/delete_module_flags.h"
74
SYS_FUNC(query_module)75 SYS_FUNC(query_module)
76 {
77 if (entering(tcp)) {
78 printstr(tcp, tcp->u_arg[0], -1);
79 tprints(", ");
80 printxval(qm_which, tcp->u_arg[1], "QM_???");
81 tprints(", ");
82 } else {
83 size_t ret;
84
85 if (!verbose(tcp) || syserror(tcp) ||
86 umove(tcp, tcp->u_arg[4], &ret) < 0) {
87 tprintf("%#lx, %lu, %#lx", tcp->u_arg[2],
88 tcp->u_arg[3], tcp->u_arg[4]);
89 } else if (tcp->u_arg[1]==QM_INFO) {
90 struct module_info mi;
91 if (umove(tcp, tcp->u_arg[2], &mi) < 0) {
92 tprintf("%#lx, ", tcp->u_arg[2]);
93 } else {
94 tprintf("{address=%#lx, size=%lu, flags=",
95 mi.addr, mi.size);
96 printflags(modflags, mi.flags, "MOD_???");
97 tprintf(", usecount=%lu}, ", mi.usecount);
98 }
99 tprintf("%lu", (unsigned long)ret);
100 } else if ((tcp->u_arg[1]==QM_MODULES) ||
101 (tcp->u_arg[1]==QM_DEPS) ||
102 (tcp->u_arg[1]==QM_REFS)) {
103 tprints("{");
104 if (!abbrev(tcp)) {
105 char* data = malloc(tcp->u_arg[3]);
106 char* mod = data;
107 size_t idx;
108
109 if (!data) {
110 fprintf(stderr, "out of memory\n");
111 tprintf(" /* %lu entries */ ", (unsigned long)ret);
112 } else {
113 if (umoven(tcp, tcp->u_arg[2],
114 tcp->u_arg[3], data) < 0) {
115 tprintf(" /* %lu entries */ ", (unsigned long)ret);
116 } else {
117 for (idx = 0; idx < ret; idx++) {
118 tprintf("%s%s",
119 (idx ? ", " : ""),
120 mod);
121 mod += strlen(mod)+1;
122 }
123 }
124 free(data);
125 }
126 } else
127 tprintf(" /* %lu entries */ ", (unsigned long)ret);
128 tprintf("}, %lu", (unsigned long)ret);
129 } else if (tcp->u_arg[1]==QM_SYMBOLS) {
130 tprints("{");
131 if (!abbrev(tcp)) {
132 char* data = malloc(tcp->u_arg[3]);
133 struct module_symbol* sym = (struct module_symbol*)data;
134 size_t idx;
135
136 if (!data) {
137 fprintf(stderr, "out of memory\n");
138 tprintf(" /* %lu entries */ ", (unsigned long)ret);
139 } else {
140 if (umoven(tcp, tcp->u_arg[2],
141 tcp->u_arg[3], data) < 0) {
142 tprintf(" /* %lu entries */ ", (unsigned long)ret);
143 } else {
144 for (idx = 0; idx < ret; idx++) {
145 tprintf("%s{name=%s, value=%lu}",
146 (idx ? " " : ""),
147 data+(long)sym->name,
148 sym->value);
149 sym++;
150 }
151 }
152 free(data);
153 }
154 } else
155 tprintf(" /* %lu entries */ ", (unsigned long)ret);
156 tprintf("}, %ld", (unsigned long)ret);
157 } else {
158 printstr(tcp, tcp->u_arg[2], tcp->u_arg[3]);
159 tprintf(", %#lx", tcp->u_arg[4]);
160 }
161 }
162 return 0;
163 }
164
SYS_FUNC(create_module)165 SYS_FUNC(create_module)
166 {
167 if (entering(tcp)) {
168 printpath(tcp, tcp->u_arg[0]);
169 tprintf(", %lu", tcp->u_arg[1]);
170 }
171 return RVAL_HEX;
172 }
173
SYS_FUNC(delete_module)174 SYS_FUNC(delete_module)
175 {
176 if (entering(tcp)) {
177 printstr(tcp, tcp->u_arg[0], -1);
178 tprints(", ");
179 printflags(delete_module_flags, tcp->u_arg[1], "O_???");
180 }
181 return 0;
182 }
183
SYS_FUNC(init_module)184 SYS_FUNC(init_module)
185 {
186 if (entering(tcp)) {
187 tprintf("%#lx, %lu, ", tcp->u_arg[0], tcp->u_arg[1]);
188 printstr(tcp, tcp->u_arg[2], -1);
189 }
190 return 0;
191 }
192
193 #define MODULE_INIT_IGNORE_MODVERSIONS 1
194 #define MODULE_INIT_IGNORE_VERMAGIC 2
195
196 #include "xlat/module_init_flags.h"
197
SYS_FUNC(finit_module)198 SYS_FUNC(finit_module)
199 {
200 if (exiting(tcp))
201 return 0;
202
203 /* file descriptor */
204 printfd(tcp, tcp->u_arg[0]);
205 tprints(", ");
206 /* param_values */
207 printstr(tcp, tcp->u_arg[1], -1);
208 tprints(", ");
209 /* flags */
210 printflags(module_init_flags, tcp->u_arg[2], "MODULE_INIT_???");
211
212 return 0;
213 }
214