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>
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.
40 #include <sys/resource.h>
41 #include <sys/utsname.h>
43 #include <sys/syscall.h>
45 #include <linux/module.h>
47 static struct xlat which[] = {
49 { QM_MODULES, "QM_MODULES" },
50 { QM_DEPS, "QM_DEPS" },
51 { QM_REFS, "QM_REFS" },
52 { QM_SYMBOLS, "QM_SYMBOLS" },
53 { QM_INFO, "QM_INFO" },
57 static struct xlat modflags[] = {
58 { MOD_UNINITIALIZED, "MOD_UNINITIALIZED" },
59 { MOD_RUNNING, "MOD_RUNNING" },
60 { MOD_DELETED, "MOD_DELETED" },
61 { MOD_AUTOCLEAN, "MOD_AUTOCLEAN" },
62 { MOD_VISITED, "MOD_VISITED" },
63 { MOD_USED_ONCE, "MOD_USED_ONCE" },
64 { MOD_JUST_FREED, "MOD_JUST_FREED" },
74 printstr(tcp, tcp->u_arg[0], -1);
76 printxval(which, tcp->u_arg[1], "QM_???");
79 tprintf("%#lx, %lu, %#lx", tcp->u_arg[2], tcp->u_arg[3], tcp->u_arg[4]);
80 } else if (tcp->u_rval!=0) {
82 umove(tcp, tcp->u_arg[4], &ret);
83 tprintf("%#lx, %lu, %Zu", tcp->u_arg[2], tcp->u_arg[3], ret);
84 } else if (tcp->u_arg[1]==QM_INFO) {
85 struct module_info mi;
87 umove(tcp, tcp->u_arg[2], &mi);
88 tprintf("{address=%#lx, size=%lu, flags=", mi.addr, mi.size);
89 printflags(modflags, mi.flags);
90 tprintf(", usecount=%lu}", mi.usecount);
91 umove(tcp, tcp->u_arg[4], &ret);
92 tprintf(", %Zu", ret);
93 } else if ((tcp->u_arg[1]==QM_MODULES) ||
94 (tcp->u_arg[1]==QM_DEPS) ||
95 (tcp->u_arg[1]==QM_REFS)) {
98 umove(tcp, tcp->u_arg[4], &ret);
101 char* data = (char*)malloc(tcp->u_arg[3]);
106 fprintf(stderr, "sys_query_module: No memory\n");
107 tprintf(" /* %Zu entries */ ", ret);
109 umoven(tcp, tcp->u_arg[2], tcp->u_arg[3], data);
110 for (idx=0; idx<ret; idx++) {
119 tprintf(" /* %Zu entries */ ", ret);
120 tprintf("}, %Zu", ret);
121 } else if (tcp->u_arg[1]==QM_SYMBOLS) {
123 umove(tcp, tcp->u_arg[4], &ret);
126 char* data = (char *)malloc(tcp->u_arg[3]);
127 struct module_symbol* sym = (struct module_symbol*)data;
131 fprintf(stderr, "sys_query_module: No memory\n");
132 tprintf(" /* %Zu entries */ ", ret);
134 umoven(tcp, tcp->u_arg[2], tcp->u_arg[3], data);
135 for (idx=0; idx<ret; idx++) {
136 tprintf("{name=%s, value=%lu} ", data+(long)sym->name, sym->value);
142 tprintf(" /* %Zu entries */ ", ret);
143 tprintf("}, %Zd", ret);
145 printstr(tcp, tcp->u_arg[2], tcp->u_arg[3]);
146 tprintf(", %#lx", tcp->u_arg[4]);
153 sys_create_module(tcp)
157 printpath(tcp, tcp->u_arg[0]);
158 tprintf(", %lu", tcp->u_arg[1]);
168 printpath(tcp, tcp->u_arg[0]);
169 tprintf(", %#lx", tcp->u_arg[1]);