1 #include <linux/config.h>
2 #include <linux/mm.h>
3 #include <linux/module.h>
4 #include <asm/module.h>
5 #include <asm/uaccess.h>
6 #include <linux/vmalloc.h>
7 #include <linux/smp_lock.h>
8 #include <asm/pgalloc.h>
9 #include <linux/init.h>
10 #include <linux/slab.h>
11 #include <linux/kmod.h>
12 #include <linux/seq_file.h>
13
14 /*
15 * Originally by Anonymous (as far as I know...)
16 * Linux version by Bas Laarhoven <bas@vimec.nl>
17 * 0.99.14 version by Jon Tombs <jon@gtex02.us.es>,
18 * Heavily modified by Bjorn Ekwall <bj0rn@blox.se> May 1994 (C)
19 * Rewritten by Richard Henderson <rth@tamu.edu> Dec 1996
20 * Add MOD_INITIALIZING Keith Owens <kaos@ocs.com.au> Nov 1999
21 * Add kallsyms support, Keith Owens <kaos@ocs.com.au> Apr 2000
22 * Add asm/module support, IA64 has special requirements. Keith Owens <kaos@ocs.com.au> Sep 2000
23 * Fix assorted bugs in module verification. Keith Owens <kaos@ocs.com.au> Sep 2000
24 * Fix sys_init_module race, Andrew Morton <andrewm@uow.edu.au> Oct 2000
25 * http://www.uwsg.iu.edu/hypermail/linux/kernel/0008.3/0379.html
26 * Replace xxx_module_symbol with inter_module_xxx. Keith Owens <kaos@ocs.com.au> Oct 2000
27 * Add a module list lock for kernel fault race fixing. Alan Cox <alan@redhat.com>
28 *
29 * This source is covered by the GNU GPL, the same as all kernel sources.
30 */
31
32 #if defined(CONFIG_MODULES) || defined(CONFIG_KALLSYMS)
33
34 extern struct module_symbol __start___ksymtab[];
35 extern struct module_symbol __stop___ksymtab[];
36
37 extern const struct exception_table_entry __start___ex_table[];
38 extern const struct exception_table_entry __stop___ex_table[];
39
40 extern const char __start___kallsyms[] __attribute__ ((weak));
41 extern const char __stop___kallsyms[] __attribute__ ((weak));
42
43 struct module kernel_module =
44 {
45 size_of_struct: sizeof(struct module),
46 name: "",
47 uc: {ATOMIC_INIT(1)},
48 flags: MOD_RUNNING,
49 syms: __start___ksymtab,
50 ex_table_start: __start___ex_table,
51 ex_table_end: __stop___ex_table,
52 kallsyms_start: __start___kallsyms,
53 kallsyms_end: __stop___kallsyms,
54 };
55
56 struct module *module_list = &kernel_module;
57
58 #endif /* defined(CONFIG_MODULES) || defined(CONFIG_KALLSYMS) */
59
60 /* inter_module functions are always available, even when the kernel is
61 * compiled without modules. Consumers of inter_module_xxx routines
62 * will always work, even when both are built into the kernel, this
63 * approach removes lots of #ifdefs in mainline code.
64 */
65
66 static struct list_head ime_list = LIST_HEAD_INIT(ime_list);
67 static spinlock_t ime_lock = SPIN_LOCK_UNLOCKED;
68 static int kmalloc_failed;
69
70 /*
71 * This lock prevents modifications that might race the kernel fault
72 * fixups. It does not prevent reader walks that the modules code
73 * does. The kernel lock does that.
74 *
75 * Since vmalloc fault fixups occur in any context this lock is taken
76 * irqsave at all times.
77 */
78
79 spinlock_t modlist_lock = SPIN_LOCK_UNLOCKED;
80
81 /**
82 * inter_module_register - register a new set of inter module data.
83 * @im_name: an arbitrary string to identify the data, must be unique
84 * @owner: module that is registering the data, always use THIS_MODULE
85 * @userdata: pointer to arbitrary userdata to be registered
86 *
87 * Description: Check that the im_name has not already been registered,
88 * complain if it has. For new data, add it to the inter_module_entry
89 * list.
90 */
inter_module_register(const char * im_name,struct module * owner,const void * userdata)91 void inter_module_register(const char *im_name, struct module *owner, const void *userdata)
92 {
93 struct list_head *tmp;
94 struct inter_module_entry *ime, *ime_new;
95
96 if (!(ime_new = kmalloc(sizeof(*ime), GFP_KERNEL))) {
97 /* Overloaded kernel, not fatal */
98 printk(KERN_ERR
99 "Aiee, inter_module_register: cannot kmalloc entry for '%s'\n",
100 im_name);
101 kmalloc_failed = 1;
102 return;
103 }
104 memset(ime_new, 0, sizeof(*ime_new));
105 ime_new->im_name = im_name;
106 ime_new->owner = owner;
107 ime_new->userdata = userdata;
108
109 spin_lock(&ime_lock);
110 list_for_each(tmp, &ime_list) {
111 ime = list_entry(tmp, struct inter_module_entry, list);
112 if (strcmp(ime->im_name, im_name) == 0) {
113 spin_unlock(&ime_lock);
114 kfree(ime_new);
115 /* Program logic error, fatal */
116 printk(KERN_ERR "inter_module_register: duplicate im_name '%s'", im_name);
117 BUG();
118 }
119 }
120 list_add(&(ime_new->list), &ime_list);
121 spin_unlock(&ime_lock);
122 }
123
124 /**
125 * inter_module_unregister - unregister a set of inter module data.
126 * @im_name: an arbitrary string to identify the data, must be unique
127 *
128 * Description: Check that the im_name has been registered, complain if
129 * it has not. For existing data, remove it from the
130 * inter_module_entry list.
131 */
inter_module_unregister(const char * im_name)132 void inter_module_unregister(const char *im_name)
133 {
134 struct list_head *tmp;
135 struct inter_module_entry *ime;
136
137 spin_lock(&ime_lock);
138 list_for_each(tmp, &ime_list) {
139 ime = list_entry(tmp, struct inter_module_entry, list);
140 if (strcmp(ime->im_name, im_name) == 0) {
141 list_del(&(ime->list));
142 spin_unlock(&ime_lock);
143 kfree(ime);
144 return;
145 }
146 }
147 spin_unlock(&ime_lock);
148 if (kmalloc_failed) {
149 printk(KERN_ERR
150 "inter_module_unregister: no entry for '%s', "
151 "probably caused by previous kmalloc failure\n",
152 im_name);
153 return;
154 }
155 else {
156 /* Program logic error, fatal */
157 printk(KERN_ERR "inter_module_unregister: no entry for '%s'", im_name);
158 BUG();
159 }
160 }
161
162 /**
163 * inter_module_get - return arbitrary userdata from another module.
164 * @im_name: an arbitrary string to identify the data, must be unique
165 *
166 * Description: If the im_name has not been registered, return NULL.
167 * Try to increment the use count on the owning module, if that fails
168 * then return NULL. Otherwise return the userdata.
169 */
inter_module_get(const char * im_name)170 const void *inter_module_get(const char *im_name)
171 {
172 struct list_head *tmp;
173 struct inter_module_entry *ime;
174 const void *result = NULL;
175
176 spin_lock(&ime_lock);
177 list_for_each(tmp, &ime_list) {
178 ime = list_entry(tmp, struct inter_module_entry, list);
179 if (strcmp(ime->im_name, im_name) == 0) {
180 if (try_inc_mod_count(ime->owner))
181 result = ime->userdata;
182 break;
183 }
184 }
185 spin_unlock(&ime_lock);
186 return(result);
187 }
188
189 /**
190 * inter_module_get_request - im get with automatic request_module.
191 * @im_name: an arbitrary string to identify the data, must be unique
192 * @modname: module that is expected to register im_name
193 *
194 * Description: If inter_module_get fails, do request_module then retry.
195 */
inter_module_get_request(const char * im_name,const char * modname)196 const void *inter_module_get_request(const char *im_name, const char *modname)
197 {
198 const void *result = inter_module_get(im_name);
199 if (!result) {
200 request_module(modname);
201 result = inter_module_get(im_name);
202 }
203 return(result);
204 }
205
206 /**
207 * inter_module_put - release use of data from another module.
208 * @im_name: an arbitrary string to identify the data, must be unique
209 *
210 * Description: If the im_name has not been registered, complain,
211 * otherwise decrement the use count on the owning module.
212 */
inter_module_put(const char * im_name)213 void inter_module_put(const char *im_name)
214 {
215 struct list_head *tmp;
216 struct inter_module_entry *ime;
217
218 spin_lock(&ime_lock);
219 list_for_each(tmp, &ime_list) {
220 ime = list_entry(tmp, struct inter_module_entry, list);
221 if (strcmp(ime->im_name, im_name) == 0) {
222 if (ime->owner)
223 __MOD_DEC_USE_COUNT(ime->owner);
224 spin_unlock(&ime_lock);
225 return;
226 }
227 }
228 spin_unlock(&ime_lock);
229 printk(KERN_ERR "inter_module_put: no entry for '%s'", im_name);
230 BUG();
231 }
232
233
234 #if defined(CONFIG_MODULES) /* The rest of the source */
235
236 static long get_mod_name(const char *user_name, char **buf);
237 static void put_mod_name(char *buf);
238 struct module *find_module(const char *name);
239 void free_module(struct module *, int tag_freed);
240
241
242 /*
243 * Called at boot time
244 */
245
init_modules(void)246 void __init init_modules(void)
247 {
248 kernel_module.nsyms = __stop___ksymtab - __start___ksymtab;
249
250 arch_init_modules(&kernel_module);
251 }
252
253 /*
254 * Copy the name of a module from user space.
255 */
256
257 static inline long
get_mod_name(const char * user_name,char ** buf)258 get_mod_name(const char *user_name, char **buf)
259 {
260 unsigned long page;
261 long retval;
262
263 page = __get_free_page(GFP_KERNEL);
264 if (!page)
265 return -ENOMEM;
266
267 retval = strncpy_from_user((char *)page, user_name, PAGE_SIZE);
268 if (retval > 0) {
269 if (retval < PAGE_SIZE) {
270 *buf = (char *)page;
271 return retval;
272 }
273 retval = -ENAMETOOLONG;
274 } else if (!retval)
275 retval = -EINVAL;
276
277 free_page(page);
278 return retval;
279 }
280
281 static inline void
put_mod_name(char * buf)282 put_mod_name(char *buf)
283 {
284 free_page((unsigned long)buf);
285 }
286
287 /*
288 * Allocate space for a module.
289 */
290
291 asmlinkage unsigned long
sys_create_module(const char * name_user,size_t size)292 sys_create_module(const char *name_user, size_t size)
293 {
294 char *name;
295 long namelen, error;
296 struct module *mod;
297 unsigned long flags;
298
299 if (!capable(CAP_SYS_MODULE))
300 return -EPERM;
301 lock_kernel();
302 if ((namelen = get_mod_name(name_user, &name)) < 0) {
303 error = namelen;
304 goto err0;
305 }
306 if (size < sizeof(struct module)+namelen+1) {
307 error = -EINVAL;
308 goto err1;
309 }
310 if (find_module(name) != NULL) {
311 error = -EEXIST;
312 goto err1;
313 }
314 if ((mod = (struct module *)module_map(size)) == NULL) {
315 error = -ENOMEM;
316 goto err1;
317 }
318
319 memset(mod, 0, sizeof(*mod));
320 mod->size_of_struct = sizeof(*mod);
321 mod->name = (char *)(mod + 1);
322 mod->size = size;
323 memcpy((char*)(mod+1), name, namelen+1);
324
325 put_mod_name(name);
326
327 spin_lock_irqsave(&modlist_lock, flags);
328 mod->next = module_list;
329 module_list = mod; /* link it in */
330 spin_unlock_irqrestore(&modlist_lock, flags);
331
332 error = (long) mod;
333 goto err0;
334 err1:
335 put_mod_name(name);
336 err0:
337 unlock_kernel();
338 return error;
339 }
340
341 /*
342 * Initialize a module.
343 */
344
345 asmlinkage long
sys_init_module(const char * name_user,struct module * mod_user)346 sys_init_module(const char *name_user, struct module *mod_user)
347 {
348 struct module mod_tmp, *mod, *mod2 = NULL;
349 char *name, *n_name, *name_tmp = NULL;
350 long namelen, n_namelen, i, error;
351 unsigned long mod_user_size, flags;
352 struct module_ref *dep;
353
354 if (!capable(CAP_SYS_MODULE))
355 return -EPERM;
356 lock_kernel();
357 if ((namelen = get_mod_name(name_user, &name)) < 0) {
358 error = namelen;
359 goto err0;
360 }
361 if ((mod = find_module(name)) == NULL) {
362 error = -ENOENT;
363 goto err1;
364 }
365
366 /* Check module header size. We allow a bit of slop over the
367 size we are familiar with to cope with a version of insmod
368 for a newer kernel. But don't over do it. */
369 if ((error = get_user(mod_user_size, &mod_user->size_of_struct)) != 0)
370 goto err1;
371 if (mod_user_size < (unsigned long)&((struct module *)0L)->persist_start
372 || mod_user_size > sizeof(struct module) + 16*sizeof(void*)) {
373 printk(KERN_ERR "init_module: Invalid module header size.\n"
374 KERN_ERR "A new version of the modutils is likely "
375 "needed.\n");
376 error = -EINVAL;
377 goto err1;
378 }
379
380 /* Hold the current contents while we play with the user's idea
381 of righteousness. */
382 mod_tmp = *mod;
383 name_tmp = kmalloc(strlen(mod->name) + 1, GFP_KERNEL); /* Where's kstrdup()? */
384 if (name_tmp == NULL) {
385 error = -ENOMEM;
386 goto err1;
387 }
388 strcpy(name_tmp, mod->name);
389
390 /* Copying mod_user directly over mod breaks the module_list chain and
391 * races against search_exception_table. copy_from_user may sleep so it
392 * cannot be under modlist_lock, do the copy in two stages.
393 */
394 if (!(mod2 = vmalloc(mod_user_size))) {
395 error = -ENOMEM;
396 goto err2;
397 }
398 error = copy_from_user(mod2, mod_user, mod_user_size);
399 if (error) {
400 error = -EFAULT;
401 goto err2;
402 }
403 spin_lock_irqsave(&modlist_lock, flags);
404 memcpy(mod, mod2, mod_user_size);
405 mod->next = mod_tmp.next;
406 spin_unlock_irqrestore(&modlist_lock, flags);
407
408 /* Sanity check the size of the module. */
409 error = -EINVAL;
410
411 if (mod->size > mod_tmp.size) {
412 printk(KERN_ERR "init_module: Size of initialized module "
413 "exceeds size of created module.\n");
414 goto err2;
415 }
416
417 /* Make sure all interesting pointers are sane. */
418
419 if (!mod_bound(mod->name, namelen, mod)) {
420 printk(KERN_ERR "init_module: mod->name out of bounds.\n");
421 goto err2;
422 }
423 if (mod->nsyms && !mod_bound(mod->syms, mod->nsyms, mod)) {
424 printk(KERN_ERR "init_module: mod->syms out of bounds.\n");
425 goto err2;
426 }
427 if (mod->ndeps && !mod_bound(mod->deps, mod->ndeps, mod)) {
428 printk(KERN_ERR "init_module: mod->deps out of bounds.\n");
429 goto err2;
430 }
431 if (mod->init && !mod_bound(mod->init, 0, mod)) {
432 printk(KERN_ERR "init_module: mod->init out of bounds.\n");
433 goto err2;
434 }
435 if (mod->cleanup && !mod_bound(mod->cleanup, 0, mod)) {
436 printk(KERN_ERR "init_module: mod->cleanup out of bounds.\n");
437 goto err2;
438 }
439 if (mod->ex_table_start > mod->ex_table_end
440 || (mod->ex_table_start &&
441 !((unsigned long)mod->ex_table_start >= ((unsigned long)mod + mod->size_of_struct)
442 && ((unsigned long)mod->ex_table_end
443 < (unsigned long)mod + mod->size)))
444 || (((unsigned long)mod->ex_table_start
445 - (unsigned long)mod->ex_table_end)
446 % sizeof(struct exception_table_entry))) {
447 printk(KERN_ERR "init_module: mod->ex_table_* invalid.\n");
448 goto err2;
449 }
450 if (mod->flags & ~MOD_AUTOCLEAN) {
451 printk(KERN_ERR "init_module: mod->flags invalid.\n");
452 goto err2;
453 }
454 if (mod_member_present(mod, can_unload)
455 && mod->can_unload && !mod_bound(mod->can_unload, 0, mod)) {
456 printk(KERN_ERR "init_module: mod->can_unload out of bounds.\n");
457 goto err2;
458 }
459 if (mod_member_present(mod, kallsyms_end)) {
460 if (mod->kallsyms_end &&
461 (!mod_bound(mod->kallsyms_start, 0, mod) ||
462 !mod_bound(mod->kallsyms_end, 0, mod))) {
463 printk(KERN_ERR "init_module: mod->kallsyms out of bounds.\n");
464 goto err2;
465 }
466 if (mod->kallsyms_start > mod->kallsyms_end) {
467 printk(KERN_ERR "init_module: mod->kallsyms invalid.\n");
468 goto err2;
469 }
470 }
471 if (mod_member_present(mod, archdata_end)) {
472 if (mod->archdata_end &&
473 (!mod_bound(mod->archdata_start, 0, mod) ||
474 !mod_bound(mod->archdata_end, 0, mod))) {
475 printk(KERN_ERR "init_module: mod->archdata out of bounds.\n");
476 goto err2;
477 }
478 if (mod->archdata_start > mod->archdata_end) {
479 printk(KERN_ERR "init_module: mod->archdata invalid.\n");
480 goto err2;
481 }
482 }
483 if (mod_member_present(mod, kernel_data) && mod->kernel_data) {
484 printk(KERN_ERR "init_module: mod->kernel_data must be zero.\n");
485 goto err2;
486 }
487
488 /* Check that the user isn't doing something silly with the name. */
489
490 if ((n_namelen = get_mod_name(mod->name - (unsigned long)mod
491 + (unsigned long)mod_user,
492 &n_name)) < 0) {
493 printk(KERN_ERR "init_module: get_mod_name failure.\n");
494 error = n_namelen;
495 goto err2;
496 }
497 if (namelen != n_namelen || strcmp(n_name, name_tmp) != 0) {
498 printk(KERN_ERR "init_module: changed module name to "
499 "`%s' from `%s'\n",
500 n_name, name_tmp);
501 goto err3;
502 }
503
504 /* Ok, that's about all the sanity we can stomach; copy the rest. */
505
506 if (copy_from_user((char *)mod+mod_user_size,
507 (char *)mod_user+mod_user_size,
508 mod->size-mod_user_size)) {
509 error = -EFAULT;
510 goto err3;
511 }
512
513 if (module_arch_init(mod))
514 goto err3;
515
516 /* On some machines it is necessary to do something here
517 to make the I and D caches consistent. */
518 flush_icache_range((unsigned long)mod, (unsigned long)mod + mod->size);
519
520 mod->refs = NULL;
521
522 /* Sanity check the module's dependents */
523 for (i = 0, dep = mod->deps; i < mod->ndeps; ++i, ++dep) {
524 struct module *o, *d = dep->dep;
525
526 /* Make sure the indicated dependencies are really modules. */
527 if (d == mod) {
528 printk(KERN_ERR "init_module: self-referential "
529 "dependency in mod->deps.\n");
530 goto err3;
531 }
532
533 /* Scan the current modules for this dependency */
534 for (o = module_list; o != &kernel_module && o != d; o = o->next)
535 ;
536
537 if (o != d) {
538 printk(KERN_ERR "init_module: found dependency that is "
539 "(no longer?) a module.\n");
540 goto err3;
541 }
542 }
543
544 /* Update module references. */
545 for (i = 0, dep = mod->deps; i < mod->ndeps; ++i, ++dep) {
546 struct module *d = dep->dep;
547
548 dep->ref = mod;
549 dep->next_ref = d->refs;
550 d->refs = dep;
551 /* Being referenced by a dependent module counts as a
552 use as far as kmod is concerned. */
553 d->flags |= MOD_USED_ONCE;
554 }
555
556 /* Free our temporary memory. */
557 put_mod_name(n_name);
558 put_mod_name(name);
559
560 /* Initialize the module. */
561 atomic_set(&mod->uc.usecount,1);
562 mod->flags |= MOD_INITIALIZING;
563 if (mod->init && (error = mod->init()) != 0) {
564 atomic_set(&mod->uc.usecount,0);
565 mod->flags &= ~MOD_INITIALIZING;
566 if (error > 0) /* Buggy module */
567 error = -EBUSY;
568 goto err0;
569 }
570 atomic_dec(&mod->uc.usecount);
571
572 /* And set it running. */
573 mod->flags = (mod->flags | MOD_RUNNING) & ~MOD_INITIALIZING;
574 error = 0;
575 goto err0;
576
577 err3:
578 put_mod_name(n_name);
579 err2:
580 *mod = mod_tmp;
581 strcpy((char *)mod->name, name_tmp); /* We know there is room for this */
582 err1:
583 put_mod_name(name);
584 err0:
585 if (mod2)
586 vfree(mod2);
587 unlock_kernel();
588 kfree(name_tmp);
589 return error;
590 }
591
592 static spinlock_t unload_lock = SPIN_LOCK_UNLOCKED;
try_inc_mod_count(struct module * mod)593 int try_inc_mod_count(struct module *mod)
594 {
595 int res = 1;
596 if (mod) {
597 spin_lock(&unload_lock);
598 if (mod->flags & MOD_DELETED)
599 res = 0;
600 else
601 __MOD_INC_USE_COUNT(mod);
602 spin_unlock(&unload_lock);
603 }
604 return res;
605 }
606
607 asmlinkage long
sys_delete_module(const char * name_user)608 sys_delete_module(const char *name_user)
609 {
610 struct module *mod, *next;
611 char *name;
612 long error;
613 int something_changed;
614
615 if (!capable(CAP_SYS_MODULE))
616 return -EPERM;
617
618 lock_kernel();
619 if (name_user) {
620 if ((error = get_mod_name(name_user, &name)) < 0)
621 goto out;
622 error = -ENOENT;
623 if ((mod = find_module(name)) == NULL) {
624 put_mod_name(name);
625 goto out;
626 }
627 put_mod_name(name);
628 error = -EBUSY;
629 if (mod->refs != NULL)
630 goto out;
631
632 spin_lock(&unload_lock);
633 if (!__MOD_IN_USE(mod)) {
634 mod->flags |= MOD_DELETED;
635 spin_unlock(&unload_lock);
636 free_module(mod, 0);
637 error = 0;
638 } else {
639 spin_unlock(&unload_lock);
640 }
641 goto out;
642 }
643
644 /* Do automatic reaping */
645 restart:
646 something_changed = 0;
647
648 for (mod = module_list; mod != &kernel_module; mod = next) {
649 next = mod->next;
650 spin_lock(&unload_lock);
651 if (mod->refs == NULL
652 && (mod->flags & MOD_AUTOCLEAN)
653 && (mod->flags & MOD_RUNNING)
654 && !(mod->flags & MOD_DELETED)
655 && (mod->flags & MOD_USED_ONCE)
656 && !__MOD_IN_USE(mod)) {
657 if ((mod->flags & MOD_VISITED)
658 && !(mod->flags & MOD_JUST_FREED)) {
659 spin_unlock(&unload_lock);
660 mod->flags &= ~MOD_VISITED;
661 } else {
662 mod->flags |= MOD_DELETED;
663 spin_unlock(&unload_lock);
664 free_module(mod, 1);
665 something_changed = 1;
666 }
667 } else {
668 spin_unlock(&unload_lock);
669 }
670 }
671
672 if (something_changed)
673 goto restart;
674
675 for (mod = module_list; mod != &kernel_module; mod = mod->next)
676 mod->flags &= ~MOD_JUST_FREED;
677
678 error = 0;
679 out:
680 unlock_kernel();
681 return error;
682 }
683
684 /* Query various bits about modules. */
685
686 static int
qm_modules(char * buf,size_t bufsize,size_t * ret)687 qm_modules(char *buf, size_t bufsize, size_t *ret)
688 {
689 struct module *mod;
690 size_t nmod, space, len;
691
692 nmod = space = 0;
693
694 for (mod=module_list; mod != &kernel_module; mod=mod->next, ++nmod) {
695 len = strlen(mod->name)+1;
696 if (len > bufsize)
697 goto calc_space_needed;
698 if (copy_to_user(buf, mod->name, len))
699 return -EFAULT;
700 buf += len;
701 bufsize -= len;
702 space += len;
703 }
704
705 if (put_user(nmod, ret))
706 return -EFAULT;
707 else
708 return 0;
709
710 calc_space_needed:
711 space += len;
712 while ((mod = mod->next) != &kernel_module)
713 space += strlen(mod->name)+1;
714
715 if (put_user(space, ret))
716 return -EFAULT;
717 else
718 return -ENOSPC;
719 }
720
721 static int
qm_deps(struct module * mod,char * buf,size_t bufsize,size_t * ret)722 qm_deps(struct module *mod, char *buf, size_t bufsize, size_t *ret)
723 {
724 size_t i, space, len;
725
726 if (mod == &kernel_module)
727 return -EINVAL;
728 if (!MOD_CAN_QUERY(mod))
729 if (put_user(0, ret))
730 return -EFAULT;
731 else
732 return 0;
733
734 space = 0;
735 for (i = 0; i < mod->ndeps; ++i) {
736 const char *dep_name = mod->deps[i].dep->name;
737
738 len = strlen(dep_name)+1;
739 if (len > bufsize)
740 goto calc_space_needed;
741 if (copy_to_user(buf, dep_name, len))
742 return -EFAULT;
743 buf += len;
744 bufsize -= len;
745 space += len;
746 }
747
748 if (put_user(i, ret))
749 return -EFAULT;
750 else
751 return 0;
752
753 calc_space_needed:
754 space += len;
755 while (++i < mod->ndeps)
756 space += strlen(mod->deps[i].dep->name)+1;
757
758 if (put_user(space, ret))
759 return -EFAULT;
760 else
761 return -ENOSPC;
762 }
763
764 static int
qm_refs(struct module * mod,char * buf,size_t bufsize,size_t * ret)765 qm_refs(struct module *mod, char *buf, size_t bufsize, size_t *ret)
766 {
767 size_t nrefs, space, len;
768 struct module_ref *ref;
769
770 if (mod == &kernel_module)
771 return -EINVAL;
772 if (!MOD_CAN_QUERY(mod))
773 if (put_user(0, ret))
774 return -EFAULT;
775 else
776 return 0;
777
778 space = 0;
779 for (nrefs = 0, ref = mod->refs; ref ; ++nrefs, ref = ref->next_ref) {
780 const char *ref_name = ref->ref->name;
781
782 len = strlen(ref_name)+1;
783 if (len > bufsize)
784 goto calc_space_needed;
785 if (copy_to_user(buf, ref_name, len))
786 return -EFAULT;
787 buf += len;
788 bufsize -= len;
789 space += len;
790 }
791
792 if (put_user(nrefs, ret))
793 return -EFAULT;
794 else
795 return 0;
796
797 calc_space_needed:
798 space += len;
799 while ((ref = ref->next_ref) != NULL)
800 space += strlen(ref->ref->name)+1;
801
802 if (put_user(space, ret))
803 return -EFAULT;
804 else
805 return -ENOSPC;
806 }
807
808 static int
qm_symbols(struct module * mod,char * buf,size_t bufsize,size_t * ret)809 qm_symbols(struct module *mod, char *buf, size_t bufsize, size_t *ret)
810 {
811 size_t i, space, len;
812 struct module_symbol *s;
813 char *strings;
814 unsigned long *vals;
815
816 if (!MOD_CAN_QUERY(mod))
817 if (put_user(0, ret))
818 return -EFAULT;
819 else
820 return 0;
821
822 space = mod->nsyms * 2*sizeof(void *);
823
824 i = len = 0;
825 s = mod->syms;
826
827 if (space > bufsize)
828 goto calc_space_needed;
829
830 if (!access_ok(VERIFY_WRITE, buf, space))
831 return -EFAULT;
832
833 bufsize -= space;
834 vals = (unsigned long *)buf;
835 strings = buf+space;
836
837 for (; i < mod->nsyms ; ++i, ++s, vals += 2) {
838 len = strlen(s->name)+1;
839 if (len > bufsize)
840 goto calc_space_needed;
841
842 if (copy_to_user(strings, s->name, len)
843 || __put_user(s->value, vals+0)
844 || __put_user(space, vals+1))
845 return -EFAULT;
846
847 strings += len;
848 bufsize -= len;
849 space += len;
850 }
851 if (put_user(i, ret))
852 return -EFAULT;
853 else
854 return 0;
855
856 calc_space_needed:
857 for (; i < mod->nsyms; ++i, ++s)
858 space += strlen(s->name)+1;
859
860 if (put_user(space, ret))
861 return -EFAULT;
862 else
863 return -ENOSPC;
864 }
865
866 static int
qm_info(struct module * mod,char * buf,size_t bufsize,size_t * ret)867 qm_info(struct module *mod, char *buf, size_t bufsize, size_t *ret)
868 {
869 int error = 0;
870
871 if (mod == &kernel_module)
872 return -EINVAL;
873
874 if (sizeof(struct module_info) <= bufsize) {
875 struct module_info info;
876 info.addr = (unsigned long)mod;
877 info.size = mod->size;
878 info.flags = mod->flags;
879
880 /* usecount is one too high here - report appropriately to
881 compensate for locking */
882 info.usecount = (mod_member_present(mod, can_unload)
883 && mod->can_unload ? -1 : atomic_read(&mod->uc.usecount)-1);
884
885 if (copy_to_user(buf, &info, sizeof(struct module_info)))
886 return -EFAULT;
887 } else
888 error = -ENOSPC;
889
890 if (put_user(sizeof(struct module_info), ret))
891 return -EFAULT;
892
893 return error;
894 }
895
896 asmlinkage long
sys_query_module(const char * name_user,int which,char * buf,size_t bufsize,size_t * ret)897 sys_query_module(const char *name_user, int which, char *buf, size_t bufsize,
898 size_t *ret)
899 {
900 struct module *mod;
901 int err;
902
903 lock_kernel();
904 if (name_user == NULL)
905 mod = &kernel_module;
906 else {
907 long namelen;
908 char *name;
909
910 if ((namelen = get_mod_name(name_user, &name)) < 0) {
911 err = namelen;
912 goto out;
913 }
914 err = -ENOENT;
915 if ((mod = find_module(name)) == NULL) {
916 put_mod_name(name);
917 goto out;
918 }
919 put_mod_name(name);
920 }
921
922 /* __MOD_ touches the flags. We must avoid that */
923
924 atomic_inc(&mod->uc.usecount);
925
926 switch (which)
927 {
928 case 0:
929 err = 0;
930 break;
931 case QM_MODULES:
932 err = qm_modules(buf, bufsize, ret);
933 break;
934 case QM_DEPS:
935 err = qm_deps(mod, buf, bufsize, ret);
936 break;
937 case QM_REFS:
938 err = qm_refs(mod, buf, bufsize, ret);
939 break;
940 case QM_SYMBOLS:
941 err = qm_symbols(mod, buf, bufsize, ret);
942 break;
943 case QM_INFO:
944 err = qm_info(mod, buf, bufsize, ret);
945 break;
946 default:
947 err = -EINVAL;
948 break;
949 }
950 atomic_dec(&mod->uc.usecount);
951
952 out:
953 unlock_kernel();
954 return err;
955 }
956
957 /*
958 * Copy the kernel symbol table to user space. If the argument is
959 * NULL, just return the size of the table.
960 *
961 * This call is obsolete. New programs should use query_module+QM_SYMBOLS
962 * which does not arbitrarily limit the length of symbols.
963 */
964
965 asmlinkage long
sys_get_kernel_syms(struct kernel_sym * table)966 sys_get_kernel_syms(struct kernel_sym *table)
967 {
968 struct module *mod;
969 int i;
970 struct kernel_sym ksym;
971
972 lock_kernel();
973 for (mod = module_list, i = 0; mod; mod = mod->next) {
974 /* include the count for the module name! */
975 i += mod->nsyms + 1;
976 }
977
978 if (table == NULL)
979 goto out;
980
981 /* So that we don't give the user our stack content */
982 memset (&ksym, 0, sizeof (ksym));
983
984 for (mod = module_list, i = 0; mod; mod = mod->next) {
985 struct module_symbol *msym;
986 unsigned int j;
987
988 if (!MOD_CAN_QUERY(mod))
989 continue;
990
991 /* magic: write module info as a pseudo symbol */
992 ksym.value = (unsigned long)mod;
993 ksym.name[0] = '#';
994 strncpy(ksym.name+1, mod->name, sizeof(ksym.name)-1);
995 ksym.name[sizeof(ksym.name)-1] = '\0';
996
997 if (copy_to_user(table, &ksym, sizeof(ksym)) != 0)
998 goto out;
999 ++i, ++table;
1000
1001 if (mod->nsyms == 0)
1002 continue;
1003
1004 for (j = 0, msym = mod->syms; j < mod->nsyms; ++j, ++msym) {
1005 ksym.value = msym->value;
1006 strncpy(ksym.name, msym->name, sizeof(ksym.name));
1007 ksym.name[sizeof(ksym.name)-1] = '\0';
1008
1009 if (copy_to_user(table, &ksym, sizeof(ksym)) != 0)
1010 goto out;
1011 ++i, ++table;
1012 }
1013 }
1014 out:
1015 unlock_kernel();
1016 return i;
1017 }
1018
1019 /*
1020 * Look for a module by name, ignoring modules marked for deletion.
1021 */
1022
1023 struct module *
find_module(const char * name)1024 find_module(const char *name)
1025 {
1026 struct module *mod;
1027
1028 for (mod = module_list; mod ; mod = mod->next) {
1029 if (mod->flags & MOD_DELETED)
1030 continue;
1031 if (!strcmp(mod->name, name))
1032 break;
1033 }
1034
1035 return mod;
1036 }
1037
1038 /*
1039 * Free the given module.
1040 */
1041
1042 void
free_module(struct module * mod,int tag_freed)1043 free_module(struct module *mod, int tag_freed)
1044 {
1045 struct module_ref *dep;
1046 unsigned i;
1047 unsigned long flags;
1048
1049 /* Let the module clean up. */
1050
1051 if (mod->flags & MOD_RUNNING)
1052 {
1053 if(mod->cleanup)
1054 mod->cleanup();
1055 mod->flags &= ~MOD_RUNNING;
1056 }
1057
1058 /* Remove the module from the dependency lists. */
1059
1060 for (i = 0, dep = mod->deps; i < mod->ndeps; ++i, ++dep) {
1061 struct module_ref **pp;
1062 for (pp = &dep->dep->refs; *pp != dep; pp = &(*pp)->next_ref)
1063 continue;
1064 *pp = dep->next_ref;
1065 if (tag_freed && dep->dep->refs == NULL)
1066 dep->dep->flags |= MOD_JUST_FREED;
1067 }
1068
1069 /* And from the main module list. */
1070
1071 spin_lock_irqsave(&modlist_lock, flags);
1072 if (mod == module_list) {
1073 module_list = mod->next;
1074 } else {
1075 struct module *p;
1076 for (p = module_list; p->next != mod; p = p->next)
1077 continue;
1078 p->next = mod->next;
1079 }
1080 spin_unlock_irqrestore(&modlist_lock, flags);
1081
1082 /* And free the memory. */
1083
1084 module_unmap(mod);
1085 }
1086
1087 /*
1088 * Called by the /proc file system to return a current list of modules.
1089 */
1090
get_module_list(char * p)1091 int get_module_list(char *p)
1092 {
1093 size_t left = PAGE_SIZE;
1094 struct module *mod;
1095 char tmpstr[64];
1096 struct module_ref *ref;
1097
1098 for (mod = module_list; mod != &kernel_module; mod = mod->next) {
1099 long len;
1100 const char *q;
1101
1102 #define safe_copy_str(str, len) \
1103 do { \
1104 if (left < len) \
1105 goto fini; \
1106 memcpy(p, str, len); p += len, left -= len; \
1107 } while (0)
1108 #define safe_copy_cstr(str) safe_copy_str(str, sizeof(str)-1)
1109
1110 len = strlen(mod->name);
1111 safe_copy_str(mod->name, len);
1112
1113 if ((len = 20 - len) > 0) {
1114 if (left < len)
1115 goto fini;
1116 memset(p, ' ', len);
1117 p += len;
1118 left -= len;
1119 }
1120
1121 len = sprintf(tmpstr, "%8lu", mod->size);
1122 safe_copy_str(tmpstr, len);
1123
1124 if (mod->flags & MOD_RUNNING) {
1125 len = sprintf(tmpstr, "%4ld",
1126 (mod_member_present(mod, can_unload)
1127 && mod->can_unload
1128 ? -1L : (long)atomic_read(&mod->uc.usecount)));
1129 safe_copy_str(tmpstr, len);
1130 }
1131
1132 if (mod->flags & MOD_DELETED)
1133 safe_copy_cstr(" (deleted)");
1134 else if (mod->flags & MOD_RUNNING) {
1135 if (mod->flags & MOD_AUTOCLEAN)
1136 safe_copy_cstr(" (autoclean)");
1137 if (!(mod->flags & MOD_USED_ONCE))
1138 safe_copy_cstr(" (unused)");
1139 }
1140 else if (mod->flags & MOD_INITIALIZING)
1141 safe_copy_cstr(" (initializing)");
1142 else
1143 safe_copy_cstr(" (uninitialized)");
1144
1145 if ((ref = mod->refs) != NULL) {
1146 safe_copy_cstr(" [");
1147 while (1) {
1148 q = ref->ref->name;
1149 len = strlen(q);
1150 safe_copy_str(q, len);
1151
1152 if ((ref = ref->next_ref) != NULL)
1153 safe_copy_cstr(" ");
1154 else
1155 break;
1156 }
1157 safe_copy_cstr("]");
1158 }
1159 safe_copy_cstr("\n");
1160
1161 #undef safe_copy_str
1162 #undef safe_copy_cstr
1163 }
1164
1165 fini:
1166 return PAGE_SIZE - left;
1167 }
1168
1169 /*
1170 * Called by the /proc file system to return a current list of ksyms.
1171 */
1172
1173 struct mod_sym {
1174 struct module *mod;
1175 int index;
1176 };
1177
1178 /* iterator */
1179
s_start(struct seq_file * m,loff_t * pos)1180 static void *s_start(struct seq_file *m, loff_t *pos)
1181 {
1182 struct mod_sym *p = kmalloc(sizeof(*p), GFP_KERNEL);
1183 struct module *v;
1184 loff_t n = *pos;
1185
1186 if (!p)
1187 return ERR_PTR(-ENOMEM);
1188 lock_kernel();
1189 for (v = module_list, n = *pos; v; n -= v->nsyms, v = v->next) {
1190 if (n < v->nsyms) {
1191 p->mod = v;
1192 p->index = n;
1193 return p;
1194 }
1195 }
1196 unlock_kernel();
1197 kfree(p);
1198 return NULL;
1199 }
1200
s_next(struct seq_file * m,void * p,loff_t * pos)1201 static void *s_next(struct seq_file *m, void *p, loff_t *pos)
1202 {
1203 struct mod_sym *v = p;
1204 (*pos)++;
1205 if (++v->index >= v->mod->nsyms) {
1206 do {
1207 v->mod = v->mod->next;
1208 if (!v->mod) {
1209 unlock_kernel();
1210 kfree(p);
1211 return NULL;
1212 }
1213 } while (!v->mod->nsyms);
1214 v->index = 0;
1215 }
1216 return p;
1217 }
1218
s_stop(struct seq_file * m,void * p)1219 static void s_stop(struct seq_file *m, void *p)
1220 {
1221 if (p && !IS_ERR(p)) {
1222 unlock_kernel();
1223 kfree(p);
1224 }
1225 }
1226
s_show(struct seq_file * m,void * p)1227 static int s_show(struct seq_file *m, void *p)
1228 {
1229 struct mod_sym *v = p;
1230 struct module_symbol *sym;
1231
1232 if (!MOD_CAN_QUERY(v->mod))
1233 return 0;
1234 sym = &v->mod->syms[v->index];
1235 if (*v->mod->name)
1236 seq_printf(m, "%0*lx %s\t[%s]\n", (int)(2*sizeof(void*)),
1237 sym->value, sym->name, v->mod->name);
1238 else
1239 seq_printf(m, "%0*lx %s\n", (int)(2*sizeof(void*)),
1240 sym->value, sym->name);
1241 return 0;
1242 }
1243
1244 struct seq_operations ksyms_op = {
1245 start: s_start,
1246 next: s_next,
1247 stop: s_stop,
1248 show: s_show
1249 };
1250
1251 #else /* CONFIG_MODULES */
1252
1253 /* Dummy syscalls for people who don't want modules */
1254
1255 asmlinkage unsigned long
sys_create_module(const char * name_user,size_t size)1256 sys_create_module(const char *name_user, size_t size)
1257 {
1258 return -ENOSYS;
1259 }
1260
1261 asmlinkage long
sys_init_module(const char * name_user,struct module * mod_user)1262 sys_init_module(const char *name_user, struct module *mod_user)
1263 {
1264 return -ENOSYS;
1265 }
1266
1267 asmlinkage long
sys_delete_module(const char * name_user)1268 sys_delete_module(const char *name_user)
1269 {
1270 return -ENOSYS;
1271 }
1272
1273 asmlinkage long
sys_query_module(const char * name_user,int which,char * buf,size_t bufsize,size_t * ret)1274 sys_query_module(const char *name_user, int which, char *buf, size_t bufsize,
1275 size_t *ret)
1276 {
1277 /* Let the program know about the new interface. Not that
1278 it'll do them much good. */
1279 if (which == 0)
1280 return 0;
1281
1282 return -ENOSYS;
1283 }
1284
1285 asmlinkage long
sys_get_kernel_syms(struct kernel_sym * table)1286 sys_get_kernel_syms(struct kernel_sym *table)
1287 {
1288 return -ENOSYS;
1289 }
1290
try_inc_mod_count(struct module * mod)1291 int try_inc_mod_count(struct module *mod)
1292 {
1293 return 1;
1294 }
1295
1296 #endif /* CONFIG_MODULES */
1297