kern_linker.c revision 86553
1/*-
2 * Copyright (c) 1997-2000 Doug Rabson
3 * All rights reserved.
4 *
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
7 * are met:
8 * 1. Redistributions of source code must retain the above copyright
9 *    notice, this list of conditions and the following disclaimer.
10 * 2. Redistributions in binary form must reproduce the above copyright
11 *    notice, this list of conditions and the following disclaimer in the
12 *    documentation and/or other materials provided with the distribution.
13 *
14 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
15 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
16 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
17 * ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
18 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
19 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
20 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
21 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
22 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
23 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
24 * SUCH DAMAGE.
25 *
26 * $FreeBSD: head/sys/kern/kern_linker.c 86553 2001-11-18 18:19:35Z arr $
27 */
28
29#include "opt_ddb.h"
30
31#include <sys/param.h>
32#include <sys/kernel.h>
33#include <sys/systm.h>
34#include <sys/malloc.h>
35#include <sys/sysproto.h>
36#include <sys/sysent.h>
37#include <sys/proc.h>
38#include <sys/lock.h>
39#include <sys/mutex.h>
40#include <sys/module.h>
41#include <sys/linker.h>
42#include <sys/fcntl.h>
43#include <sys/libkern.h>
44#include <sys/namei.h>
45#include <sys/vnode.h>
46#include <sys/sysctl.h>
47
48
49#include "linker_if.h"
50
51#ifdef KLD_DEBUG
52int kld_debug = 0;
53#endif
54
55/*static char *linker_search_path(const char *name, struct mod_depend *verinfo);*/
56static const char *linker_basename(const char* path);
57static int linker_load_module(const char *kldname, const char *modname,
58	struct linker_file *parent, struct mod_depend *verinfo,
59	struct linker_file **lfpp);
60
61/* Metadata from the static kernel */
62SET_DECLARE(modmetadata_set, struct mod_metadata);
63
64MALLOC_DEFINE(M_LINKER, "linker", "kernel linker");
65
66linker_file_t linker_kernel_file;
67
68static struct lock lock;	/* lock for the file list */
69static linker_class_list_t classes;
70static linker_file_list_t linker_files;
71static int next_file_id = 1;
72
73#define	LINKER_GET_NEXT_FILE_ID(a) do {					\
74    linker_file_t	lftmp;						\
75									\
76retry:									\
77    TAILQ_FOREACH(lftmp, &linker_files, link) {				\
78        if (next_file_id == lftmp->id) {				\
79            next_file_id++;						\
80            goto retry;							\
81        }								\
82    }									\
83    (a) = next_file_id;							\
84} while(0)
85
86
87/* XXX wrong name; we're looking at version provision tags here, not modules */
88typedef TAILQ_HEAD(, modlist) modlisthead_t;
89struct modlist {
90    TAILQ_ENTRY(modlist) link;		/* chain together all modules */
91    linker_file_t	container;
92    const char		*name;
93    int			version;
94};
95typedef struct modlist	*modlist_t;
96static modlisthead_t	found_modules;
97
98static char *
99linker_strdup(const char *str)
100{
101    char	*result;
102
103    if ((result = malloc((strlen(str) + 1), M_LINKER, M_WAITOK)) != NULL)
104	strcpy(result, str);
105    return(result);
106}
107
108static void
109linker_init(void* arg)
110{
111    lockinit(&lock, PVM, "klink", 0, 0);
112    TAILQ_INIT(&classes);
113    TAILQ_INIT(&linker_files);
114}
115
116SYSINIT(linker, SI_SUB_KLD, SI_ORDER_FIRST, linker_init, 0);
117
118int
119linker_add_class(linker_class_t lc)
120{
121    kobj_class_compile((kobj_class_t) lc);
122    TAILQ_INSERT_TAIL(&classes, lc, link);
123    return 0;
124}
125
126static void
127linker_file_sysinit(linker_file_t lf)
128{
129    struct sysinit** start, ** stop;
130    struct sysinit** sipp;
131    struct sysinit** xipp;
132    struct sysinit* save;
133
134    KLD_DPF(FILE, ("linker_file_sysinit: calling SYSINITs for %s\n",
135		   lf->filename));
136
137    if (linker_file_lookup_set(lf, "sysinit_set", &start, &stop, NULL) != 0)
138	return;
139    /*
140     * Perform a bubble sort of the system initialization objects by
141     * their subsystem (primary key) and order (secondary key).
142     *
143     * Since some things care about execution order, this is the
144     * operation which ensures continued function.
145     */
146    for (sipp = start; sipp < stop; sipp++) {
147	for (xipp = sipp + 1; xipp < stop; xipp++) {
148	    if ((*sipp)->subsystem < (*xipp)->subsystem ||
149		 ((*sipp)->subsystem == (*xipp)->subsystem &&
150		  (*sipp)->order <= (*xipp)->order))
151		continue;	/* skip*/
152	    save = *sipp;
153	    *sipp = *xipp;
154	    *xipp = save;
155	}
156    }
157
158
159    /*
160     * Traverse the (now) ordered list of system initialization tasks.
161     * Perform each task, and continue on to the next task.
162     */
163    for (sipp = start; sipp < stop; sipp++) {
164	if ((*sipp)->subsystem == SI_SUB_DUMMY)
165	    continue;	/* skip dummy task(s)*/
166
167	/* Call function */
168	(*((*sipp)->func))((*sipp)->udata);
169    }
170}
171
172static void
173linker_file_sysuninit(linker_file_t lf)
174{
175    struct sysinit** start, ** stop;
176    struct sysinit** sipp;
177    struct sysinit** xipp;
178    struct sysinit* save;
179
180    KLD_DPF(FILE, ("linker_file_sysuninit: calling SYSUNINITs for %s\n",
181		   lf->filename));
182
183    if (linker_file_lookup_set(lf, "sysuninit_set", &start, &stop, NULL) != 0)
184	return;
185
186    /*
187     * Perform a reverse bubble sort of the system initialization objects
188     * by their subsystem (primary key) and order (secondary key).
189     *
190     * Since some things care about execution order, this is the
191     * operation which ensures continued function.
192     */
193    for (sipp = start; sipp < stop; sipp++) {
194	for (xipp = sipp + 1; xipp < stop; xipp++) {
195	    if ((*sipp)->subsystem > (*xipp)->subsystem ||
196		 ((*sipp)->subsystem == (*xipp)->subsystem &&
197		  (*sipp)->order >= (*xipp)->order))
198		continue;	/* skip*/
199	    save = *sipp;
200	    *sipp = *xipp;
201	    *xipp = save;
202	}
203    }
204
205    /*
206     * Traverse the (now) ordered list of system initialization tasks.
207     * Perform each task, and continue on to the next task.
208     */
209    for (sipp = start; sipp < stop; sipp++) {
210	if ((*sipp)->subsystem == SI_SUB_DUMMY)
211	    continue;	/* skip dummy task(s)*/
212
213	/* Call function */
214	(*((*sipp)->func))((*sipp)->udata);
215    }
216}
217
218static void
219linker_file_register_sysctls(linker_file_t lf)
220{
221    struct sysctl_oid **start, **stop, **oidp;
222
223    KLD_DPF(FILE, ("linker_file_register_sysctls: registering SYSCTLs for %s\n",
224		   lf->filename));
225
226    if (linker_file_lookup_set(lf, "sysctl_set", &start, &stop, NULL) != 0)
227	return;
228
229    for (oidp = start; oidp < stop; oidp++)
230	sysctl_register_oid(*oidp);
231}
232
233static void
234linker_file_unregister_sysctls(linker_file_t lf)
235{
236    struct sysctl_oid **start, **stop, **oidp;
237
238    KLD_DPF(FILE, ("linker_file_unregister_sysctls: registering SYSCTLs for %s\n",
239		   lf->filename));
240
241    if (linker_file_lookup_set(lf, "sysctl_set", &start, &stop, NULL) != 0)
242	return;
243
244    for (oidp = start; oidp < stop; oidp++)
245	sysctl_unregister_oid(*oidp);
246}
247
248static int
249linker_file_register_modules(linker_file_t lf)
250{
251    int error;
252    struct mod_metadata **start, **stop;
253    struct mod_metadata **mdp;
254    const moduledata_t *moddata;
255
256    KLD_DPF(FILE, ("linker_file_register_modules: registering modules in %s\n",
257		   lf->filename));
258
259    if (linker_file_lookup_set(lf, "modmetadata_set", &start, &stop, 0) != 0) {
260	/*
261	 * This fallback should be unnecessary, but if we get booted from
262	 * boot2 instead of loader and we are missing our metadata then
263	 * we have to try the best we can.
264	 */
265	if (lf == linker_kernel_file) {
266	    start = SET_BEGIN(modmetadata_set);
267	    stop = SET_LIMIT(modmetadata_set);
268	} else {
269	    return 0;
270	}
271    }
272    for (mdp = start; mdp < stop; mdp++) {
273	if ((*mdp)->md_type != MDT_MODULE)
274	    continue;
275	moddata = (*mdp)->md_data;
276	KLD_DPF(FILE, ("Registering module %s in %s\n",
277             moddata->name, lf->filename));
278	if (module_lookupbyname(moddata->name) != NULL) {
279	    printf("Warning: module %s already exists\n", moddata->name);
280	    continue;	/* or return a error ? */
281	}
282	error = module_register(moddata, lf);
283	if (error)
284	    printf("Module %s failed to register: %d\n", moddata->name, error);
285    }
286    return 0;
287}
288
289static void
290linker_init_kernel_modules(void)
291{
292    linker_file_register_modules(linker_kernel_file);
293}
294
295SYSINIT(linker_kernel, SI_SUB_KLD, SI_ORDER_ANY, linker_init_kernel_modules, 0);
296
297int
298linker_load_file(const char* filename, linker_file_t* result)
299{
300    linker_class_t lc;
301    linker_file_t lf;
302    int foundfile, error = 0;
303
304    /* Refuse to load modules if securelevel raised */
305    if (securelevel > 0)
306	return EPERM;
307
308    lf = linker_find_file_by_name(filename);
309    if (lf) {
310	KLD_DPF(FILE, ("linker_load_file: file %s is already loaded, incrementing refs\n", filename));
311	*result = lf;
312	lf->refs++;
313	goto out;
314    }
315
316    lf = NULL;
317    foundfile = 0;
318    TAILQ_FOREACH(lc, &classes, link) {
319	KLD_DPF(FILE, ("linker_load_file: trying to load %s\n",
320		       filename));
321	error = LINKER_LOAD_FILE(lc, filename, &lf);
322	/*
323	 * If we got something other than ENOENT, then it exists but we cannot
324	 * load it for some other reason.
325	 */
326	if (error != ENOENT)
327	    foundfile = 1;
328	if (lf) {
329	    linker_file_register_modules(lf);
330	    linker_file_register_sysctls(lf);
331	    linker_file_sysinit(lf);
332	    lf->flags |= LINKER_FILE_LINKED;
333
334	    *result = lf;
335	    error = 0;
336	    goto out;
337	}
338    }
339    /*
340     * Less than ideal, but tells the user whether it failed to load or
341     * the module was not found.
342     */
343    if (foundfile)
344	error = ENOEXEC;	/* Format not recognised (or unloadable) */
345    else
346	error = ENOENT;		/* Nothing found */
347
348out:
349    return error;
350}
351
352/* XXX: function parameters are incomplete */
353int
354linker_reference_module(const char *modname, linker_file_t *result)
355{
356
357    return linker_load_module(NULL, modname, NULL, NULL, result);
358}
359
360linker_file_t
361linker_find_file_by_name(const char* filename)
362{
363    linker_file_t lf = 0;
364    char *koname;
365
366    koname = malloc(strlen(filename) + 4, M_LINKER, M_WAITOK);
367    if (koname == NULL)
368	goto out;
369    sprintf(koname, "%s.ko", filename);
370
371    lockmgr(&lock, LK_SHARED, 0, curthread);
372    TAILQ_FOREACH(lf, &linker_files, link) {
373	if (!strcmp(lf->filename, koname))
374	    break;
375	if (!strcmp(lf->filename, filename))
376	    break;
377    }
378    lockmgr(&lock, LK_RELEASE, 0, curthread);
379
380out:
381    if (koname)
382	free(koname, M_LINKER);
383    return lf;
384}
385
386linker_file_t
387linker_find_file_by_id(int fileid)
388{
389    linker_file_t lf = 0;
390
391    lockmgr(&lock, LK_SHARED, 0, curthread);
392    TAILQ_FOREACH(lf, &linker_files, link)
393	if (lf->id == fileid)
394	    break;
395    lockmgr(&lock, LK_RELEASE, 0, curthread);
396
397    return lf;
398}
399
400linker_file_t
401linker_make_file(const char* pathname, linker_class_t lc)
402{
403    linker_file_t lf = 0;
404    const char *filename;
405
406    filename = linker_basename(pathname);
407
408    KLD_DPF(FILE, ("linker_make_file: new file, filename=%s\n", filename));
409    lockmgr(&lock, LK_EXCLUSIVE, 0, curthread);
410    lf = (linker_file_t) kobj_create((kobj_class_t) lc, M_LINKER, M_WAITOK);
411    if (!lf)
412	goto out;
413
414    lf->refs = 1;
415    lf->userrefs = 0;
416    lf->flags = 0;
417    lf->filename = linker_strdup(filename);
418    LINKER_GET_NEXT_FILE_ID(lf->id);
419    lf->ndeps = 0;
420    lf->deps = NULL;
421    STAILQ_INIT(&lf->common);
422    TAILQ_INIT(&lf->modules);
423
424    TAILQ_INSERT_TAIL(&linker_files, lf, link);
425
426out:
427    lockmgr(&lock, LK_RELEASE, 0, curthread);
428    return lf;
429}
430
431int
432linker_file_unload(linker_file_t file)
433{
434    module_t mod, next;
435    modlist_t ml, nextml;
436    struct common_symbol* cp;
437    int error = 0;
438    int i;
439
440    /* Refuse to unload modules if securelevel raised */
441    if (securelevel > 0)
442	return EPERM;
443
444    KLD_DPF(FILE, ("linker_file_unload: lf->refs=%d\n", file->refs));
445    lockmgr(&lock, LK_EXCLUSIVE, 0, curthread);
446    if (file->refs == 1) {
447	KLD_DPF(FILE, ("linker_file_unload: file is unloading, informing modules\n"));
448	/*
449	 * Inform any modules associated with this file.
450	 */
451	for (mod = TAILQ_FIRST(&file->modules); mod; mod = next) {
452	    next = module_getfnext(mod);
453
454	    /*
455	     * Give the module a chance to veto the unload.
456	     */
457	    if ((error = module_unload(mod)) != 0) {
458		KLD_DPF(FILE, ("linker_file_unload: module %x vetoes unload\n",
459			       mod));
460		lockmgr(&lock, LK_RELEASE, 0, curthread);
461		goto out;
462	    }
463
464	    module_release(mod);
465	}
466    }
467
468    file->refs--;
469    if (file->refs > 0) {
470	lockmgr(&lock, LK_RELEASE, 0, curthread);
471	goto out;
472    }
473
474    for (ml = TAILQ_FIRST(&found_modules); ml; ml = nextml) {
475	nextml = TAILQ_NEXT(ml, link);
476	if (ml->container == file) {
477	    TAILQ_REMOVE(&found_modules, ml, link);
478	}
479    }
480
481    /* Don't try to run SYSUNINITs if we are unloaded due to a link error */
482    if (file->flags & LINKER_FILE_LINKED) {
483	linker_file_sysuninit(file);
484	linker_file_unregister_sysctls(file);
485    }
486
487    TAILQ_REMOVE(&linker_files, file, link);
488    lockmgr(&lock, LK_RELEASE, 0, curthread);
489
490    if (file->deps) {
491	for (i = 0; i < file->ndeps; i++)
492	    linker_file_unload(file->deps[i]);
493	free(file->deps, M_LINKER);
494	file->deps = NULL;
495    }
496
497    for (cp = STAILQ_FIRST(&file->common); cp;
498	 cp = STAILQ_FIRST(&file->common)) {
499	STAILQ_REMOVE(&file->common, cp, common_symbol, link);
500	free(cp, M_LINKER);
501    }
502
503    LINKER_UNLOAD(file);
504    if (file->filename) {
505	free(file->filename, M_LINKER);
506	file->filename = NULL;
507    }
508    kobj_delete((kobj_t) file, M_LINKER);
509
510out:
511    return error;
512}
513
514int
515linker_file_add_dependency(linker_file_t file, linker_file_t dep)
516{
517    linker_file_t* newdeps;
518
519    newdeps = malloc((file->ndeps + 1) * sizeof(linker_file_t*),
520		     M_LINKER, M_WAITOK | M_ZERO);
521    if (newdeps == NULL)
522	return ENOMEM;
523
524    if (file->deps) {
525	bcopy(file->deps, newdeps, file->ndeps * sizeof(linker_file_t*));
526	free(file->deps, M_LINKER);
527    }
528    file->deps = newdeps;
529    file->deps[file->ndeps] = dep;
530    file->ndeps++;
531
532    return 0;
533}
534
535/*
536 * Locate a linker set and its contents.
537 * This is a helper function to avoid linker_if.h exposure elsewhere.
538 * Note: firstp and lastp are really void ***
539 */
540int
541linker_file_lookup_set(linker_file_t file, const char *name,
542		       void *firstp, void *lastp, int *countp)
543{
544
545    return LINKER_LOOKUP_SET(file, name, firstp, lastp, countp);
546}
547
548caddr_t
549linker_file_lookup_symbol(linker_file_t file, const char* name, int deps)
550{
551    c_linker_sym_t sym;
552    linker_symval_t symval;
553    caddr_t address;
554    size_t common_size = 0;
555    int i;
556
557    KLD_DPF(SYM, ("linker_file_lookup_symbol: file=%x, name=%s, deps=%d\n",
558		  file, name, deps));
559
560    if (LINKER_LOOKUP_SYMBOL(file, name, &sym) == 0) {
561	LINKER_SYMBOL_VALUES(file, sym, &symval);
562	if (symval.value == 0)
563	    /*
564	     * For commons, first look them up in the dependencies and
565	     * only allocate space if not found there.
566	     */
567	    common_size = symval.size;
568	else {
569	    KLD_DPF(SYM, ("linker_file_lookup_symbol: symbol.value=%x\n", symval.value));
570	    return symval.value;
571	}
572    }
573
574    if (deps) {
575	for (i = 0; i < file->ndeps; i++) {
576	    address = linker_file_lookup_symbol(file->deps[i], name, 0);
577	    if (address) {
578		KLD_DPF(SYM, ("linker_file_lookup_symbol: deps value=%x\n", address));
579		return address;
580	    }
581	}
582    }
583
584    if (common_size > 0) {
585	/*
586	 * This is a common symbol which was not found in the
587	 * dependencies.  We maintain a simple common symbol table in
588	 * the file object.
589	 */
590	struct common_symbol* cp;
591
592	STAILQ_FOREACH(cp, &file->common, link)
593	    if (!strcmp(cp->name, name)) {
594		KLD_DPF(SYM, ("linker_file_lookup_symbol: old common value=%x\n", cp->address));
595		return cp->address;
596	    }
597
598	/*
599	 * Round the symbol size up to align.
600	 */
601	common_size = (common_size + sizeof(int) - 1) & -sizeof(int);
602	cp = malloc(sizeof(struct common_symbol)
603		    + common_size
604		    + strlen(name) + 1,
605		    M_LINKER, M_WAITOK | M_ZERO);
606	if (!cp) {
607	    KLD_DPF(SYM, ("linker_file_lookup_symbol: nomem\n"));
608	    return 0;
609	}
610
611	cp->address = (caddr_t) (cp + 1);
612	cp->name = cp->address + common_size;
613	strcpy(cp->name, name);
614	bzero(cp->address, common_size);
615	STAILQ_INSERT_TAIL(&file->common, cp, link);
616
617	KLD_DPF(SYM, ("linker_file_lookup_symbol: new common value=%x\n", cp->address));
618	return cp->address;
619    }
620
621    KLD_DPF(SYM, ("linker_file_lookup_symbol: fail\n"));
622    return 0;
623}
624
625#ifdef DDB
626/*
627 * DDB Helpers.  DDB has to look across multiple files with their own
628 * symbol tables and string tables.
629 *
630 * Note that we do not obey list locking protocols here.  We really don't
631 * need DDB to hang because somebody's got the lock held.  We'll take the
632 * chance that the files list is inconsistant instead.
633 */
634
635int
636linker_ddb_lookup(const char *symstr, c_linker_sym_t *sym)
637{
638    linker_file_t lf;
639
640    TAILQ_FOREACH(lf, &linker_files, link) {
641	if (LINKER_LOOKUP_SYMBOL(lf, symstr, sym) == 0)
642	    return 0;
643    }
644    return ENOENT;
645}
646
647int
648linker_ddb_search_symbol(caddr_t value, c_linker_sym_t *sym, long *diffp)
649{
650    linker_file_t lf;
651    u_long off = (uintptr_t)value;
652    u_long diff, bestdiff;
653    c_linker_sym_t best;
654    c_linker_sym_t es;
655
656    best = 0;
657    bestdiff = off;
658    TAILQ_FOREACH(lf, &linker_files, link) {
659	if (LINKER_SEARCH_SYMBOL(lf, value, &es, &diff) != 0)
660	    continue;
661	if (es != 0 && diff < bestdiff) {
662	    best = es;
663	    bestdiff = diff;
664	}
665	if (bestdiff == 0)
666	    break;
667    }
668    if (best) {
669	*sym = best;
670	*diffp = bestdiff;
671	return 0;
672    } else {
673	*sym = 0;
674	*diffp = off;
675	return ENOENT;
676    }
677}
678
679int
680linker_ddb_symbol_values(c_linker_sym_t sym, linker_symval_t *symval)
681{
682    linker_file_t lf;
683
684    TAILQ_FOREACH(lf, &linker_files, link) {
685	if (LINKER_SYMBOL_VALUES(lf, sym, symval) == 0)
686	    return 0;
687    }
688    return ENOENT;
689}
690
691#endif
692
693/*
694 * Syscalls.
695 */
696/*
697 * MPSAFE
698 */
699int
700kldload(struct thread* td, struct kldload_args* uap)
701{
702    char *kldname, *modname;
703    char *pathname = NULL;
704    linker_file_t lf;
705    int error = 0;
706
707    td->td_retval[0] = -1;
708
709    if (securelevel > 0)	/* redundant, but that's OK */
710	return EPERM;
711
712    mtx_lock(&Giant);
713
714    if ((error = suser_xxx(td->td_proc->p_ucred, NULL, 0)) != 0)
715	goto out;
716
717    pathname = malloc(MAXPATHLEN, M_TEMP, M_WAITOK);
718    if ((error = copyinstr(SCARG(uap, file), pathname, MAXPATHLEN, NULL)) != 0)
719	goto out;
720
721    /*
722     * If path do not contain qualified name or any dot in it (kldname.ko, or
723     * kldname.ver.ko) treat it as interface name.
724     */
725    if (index(pathname, '/') || index(pathname, '.')) {
726	kldname = pathname;
727	modname = NULL;
728    } else {
729	kldname = NULL;
730	modname = pathname;
731    }
732    error = linker_load_module(kldname, modname, NULL, NULL, &lf);
733    if (error)
734	goto out;
735
736    lf->userrefs++;
737    td->td_retval[0] = lf->id;
738
739out:
740    if (pathname)
741	free(pathname, M_TEMP);
742    mtx_unlock(&Giant);
743    return (error);
744}
745
746/*
747 * MPSAFE
748 */
749int
750kldunload(struct thread* td, struct kldunload_args* uap)
751{
752    linker_file_t lf;
753    int error = 0;
754
755    if (securelevel > 0)	/* redundant, but that's OK */
756	return EPERM;
757
758    mtx_lock(&Giant);
759
760    if ((error = suser_xxx(td->td_proc->p_ucred, NULL, 0)) != 0)
761	goto out;
762
763    lf = linker_find_file_by_id(SCARG(uap, fileid));
764    if (lf) {
765	KLD_DPF(FILE, ("kldunload: lf->userrefs=%d\n", lf->userrefs));
766	if (lf->userrefs == 0) {
767	    printf("kldunload: attempt to unload file that was loaded by the kernel\n");
768	    error = EBUSY;
769	    goto out;
770	}
771	lf->userrefs--;
772	error = linker_file_unload(lf);
773	if (error)
774	    lf->userrefs++;
775    } else {
776	error = ENOENT;
777    }
778out:
779    mtx_unlock(&Giant);
780    return (error);
781}
782
783/*
784 * MPSAFE
785 */
786int
787kldfind(struct thread* td, struct kldfind_args* uap)
788{
789    char* pathname;
790    const char *filename;
791    linker_file_t lf;
792    int error = 0;
793
794    mtx_lock(&Giant);
795    td->td_retval[0] = -1;
796
797    pathname = malloc(MAXPATHLEN, M_TEMP, M_WAITOK);
798    if ((error = copyinstr(SCARG(uap, file), pathname, MAXPATHLEN, NULL)) != 0)
799	goto out;
800
801    filename = linker_basename(pathname);
802
803    lf = linker_find_file_by_name(filename);
804    if (lf)
805	td->td_retval[0] = lf->id;
806    else
807	error = ENOENT;
808
809out:
810    if (pathname)
811	free(pathname, M_TEMP);
812    mtx_unlock(&Giant);
813    return (error);
814}
815
816/*
817 * MPSAFE
818 */
819int
820kldnext(struct thread* td, struct kldnext_args* uap)
821{
822    linker_file_t lf;
823    int error = 0;
824
825    mtx_lock(&Giant);
826
827    if (SCARG(uap, fileid) == 0) {
828	if (TAILQ_FIRST(&linker_files))
829	    td->td_retval[0] = TAILQ_FIRST(&linker_files)->id;
830	else
831	    td->td_retval[0] = 0;
832	goto out;
833    }
834
835    lf = linker_find_file_by_id(SCARG(uap, fileid));
836    if (lf) {
837	if (TAILQ_NEXT(lf, link))
838	    td->td_retval[0] = TAILQ_NEXT(lf, link)->id;
839	else
840	    td->td_retval[0] = 0;
841    } else {
842	error = ENOENT;
843    }
844out:
845    mtx_unlock(&Giant);
846    return (error);
847}
848
849/*
850 * MPSAFE
851 */
852int
853kldstat(struct thread* td, struct kldstat_args* uap)
854{
855    linker_file_t lf;
856    int error = 0;
857    int version;
858    struct kld_file_stat* stat;
859    int namelen;
860
861    mtx_lock(&Giant);
862
863    lf = linker_find_file_by_id(SCARG(uap, fileid));
864    if (!lf) {
865	error = ENOENT;
866	goto out;
867    }
868
869    stat = SCARG(uap, stat);
870
871    /*
872     * Check the version of the user's structure.
873     */
874    if ((error = copyin(&stat->version, &version, sizeof(version))) != 0)
875	goto out;
876    if (version != sizeof(struct kld_file_stat)) {
877	error = EINVAL;
878	goto out;
879    }
880
881    namelen = strlen(lf->filename) + 1;
882    if (namelen > MAXPATHLEN)
883	namelen = MAXPATHLEN;
884    if ((error = copyout(lf->filename, &stat->name[0], namelen)) != 0)
885	goto out;
886    if ((error = copyout(&lf->refs, &stat->refs, sizeof(int))) != 0)
887	goto out;
888    if ((error = copyout(&lf->id, &stat->id, sizeof(int))) != 0)
889	goto out;
890    if ((error = copyout(&lf->address, &stat->address, sizeof(caddr_t))) != 0)
891	goto out;
892    if ((error = copyout(&lf->size, &stat->size, sizeof(size_t))) != 0)
893	goto out;
894
895    td->td_retval[0] = 0;
896
897out:
898    mtx_unlock(&Giant);
899    return (error);
900}
901
902/*
903 * MPSAFE
904 */
905int
906kldfirstmod(struct thread* td, struct kldfirstmod_args* uap)
907{
908    linker_file_t lf;
909    int error = 0;
910
911    mtx_lock(&Giant);
912    lf = linker_find_file_by_id(SCARG(uap, fileid));
913    if (lf) {
914	if (TAILQ_FIRST(&lf->modules))
915	    td->td_retval[0] = module_getid(TAILQ_FIRST(&lf->modules));
916	else
917	    td->td_retval[0] = 0;
918    } else {
919	error = ENOENT;
920    }
921    mtx_unlock(&Giant);
922    return (error);
923}
924
925/*
926 * MPSAFE
927 */
928int
929kldsym(struct thread *td, struct kldsym_args *uap)
930{
931    char *symstr = NULL;
932    c_linker_sym_t sym;
933    linker_symval_t symval;
934    linker_file_t lf;
935    struct kld_sym_lookup lookup;
936    int error = 0;
937
938    mtx_lock(&Giant);
939
940    if ((error = copyin(SCARG(uap, data), &lookup, sizeof(lookup))) != 0)
941	goto out;
942    if (lookup.version != sizeof(lookup) || SCARG(uap, cmd) != KLDSYM_LOOKUP) {
943	error = EINVAL;
944	goto out;
945    }
946
947    symstr = malloc(MAXPATHLEN, M_TEMP, M_WAITOK);
948    if ((error = copyinstr(lookup.symname, symstr, MAXPATHLEN, NULL)) != 0)
949	goto out;
950
951    if (SCARG(uap, fileid) != 0) {
952	lf = linker_find_file_by_id(SCARG(uap, fileid));
953	if (lf == NULL) {
954	    error = ENOENT;
955	    goto out;
956	}
957	if (LINKER_LOOKUP_SYMBOL(lf, symstr, &sym) == 0 &&
958	    LINKER_SYMBOL_VALUES(lf, sym, &symval) == 0) {
959	    lookup.symvalue = (uintptr_t)symval.value;
960	    lookup.symsize = symval.size;
961	    error = copyout(&lookup, SCARG(uap, data), sizeof(lookup));
962	} else
963	    error = ENOENT;
964    } else {
965	TAILQ_FOREACH(lf, &linker_files, link) {
966	    if (LINKER_LOOKUP_SYMBOL(lf, symstr, &sym) == 0 &&
967		LINKER_SYMBOL_VALUES(lf, sym, &symval) == 0) {
968		lookup.symvalue = (uintptr_t)symval.value;
969		lookup.symsize = symval.size;
970		error = copyout(&lookup, SCARG(uap, data), sizeof(lookup));
971		break;
972	    }
973	}
974	if (!lf)
975	    error = ENOENT;
976    }
977out:
978    if (symstr)
979	free(symstr, M_TEMP);
980    mtx_unlock(&Giant);
981    return (error);
982}
983
984/*
985 * Preloaded module support
986 */
987
988static modlist_t
989modlist_lookup(const char *name, int ver)
990{
991    modlist_t mod;
992
993    TAILQ_FOREACH(mod, &found_modules, link) {
994	if (strcmp(mod->name, name) == 0 && (ver == 0 || mod->version == ver))
995	    return mod;
996    }
997    return NULL;
998}
999
1000static modlist_t
1001modlist_lookup2(const char *name, struct mod_depend *verinfo)
1002{
1003    modlist_t mod, bestmod;
1004    int ver;
1005
1006    if (verinfo == NULL)
1007	return modlist_lookup(name, 0);
1008    bestmod = NULL;
1009    for (mod = TAILQ_FIRST(&found_modules); mod; mod = TAILQ_NEXT(mod, link)) {
1010	if (strcmp(mod->name, name) != 0)
1011	    continue;
1012	ver = mod->version;
1013	if (ver == verinfo->md_ver_preferred)
1014	    return mod;
1015	if (ver >= verinfo->md_ver_minimum &&
1016	    ver <= verinfo->md_ver_maximum &&
1017	    ver > bestmod->version)
1018	    bestmod = mod;
1019    }
1020    return bestmod;
1021}
1022
1023static modlist_t
1024modlist_newmodule(const char *modname, int version, linker_file_t container)
1025{
1026    modlist_t mod;
1027
1028    mod = malloc(sizeof(struct modlist), M_LINKER, M_NOWAIT);
1029    if (mod == NULL)
1030	panic("no memory for module list");
1031    bzero(mod, sizeof(*mod));
1032    mod->container = container;
1033    mod->name = modname;
1034    mod->version = version;
1035    TAILQ_INSERT_TAIL(&found_modules, mod, link);
1036    return mod;
1037}
1038
1039/*
1040 * This routine is cheap and nasty but will work for data pointers.
1041 */
1042static void *
1043linker_reloc_ptr(linker_file_t lf, const void *offset)
1044{
1045	return lf->address + (uintptr_t)offset;
1046}
1047
1048/*
1049 * Dereference MDT_VERSION metadata into module name and version
1050 */
1051static void
1052linker_mdt_version(linker_file_t lf, struct mod_metadata *mp,
1053	const char **modname, int *version)
1054{
1055    struct mod_version *mvp;
1056
1057    if (modname)
1058	*modname = linker_reloc_ptr(lf, mp->md_cval);
1059    if (version) {
1060	mvp = linker_reloc_ptr(lf, mp->md_data);
1061	*version = mvp->mv_version;
1062    }
1063}
1064
1065/*
1066 * Dereference MDT_DEPEND metadata into module name and mod_depend structure
1067 */
1068static void
1069linker_mdt_depend(linker_file_t lf, struct mod_metadata *mp,
1070	const char **modname, struct mod_depend **verinfo)
1071{
1072
1073    if (modname)
1074	*modname = linker_reloc_ptr(lf, mp->md_cval);
1075    if (verinfo)
1076	*verinfo = linker_reloc_ptr(lf, mp->md_data);
1077}
1078
1079static void
1080linker_addmodules(linker_file_t lf, struct mod_metadata **start,
1081	struct mod_metadata **stop, int preload)
1082{
1083    struct mod_metadata	*mp, **mdp;
1084    const char *modname;
1085    int ver;
1086
1087    for (mdp = start; mdp < stop; mdp++) {
1088	if (preload)
1089	    mp = *mdp;
1090	else
1091	    mp = linker_reloc_ptr(lf, *mdp);
1092	if (mp->md_type != MDT_VERSION)
1093	    continue;
1094	if (preload) {
1095	    modname = mp->md_cval;
1096	    ver = ((struct mod_version*)mp->md_data)->mv_version;
1097	} else
1098	    linker_mdt_version(lf, mp, &modname, &ver);
1099	if (modlist_lookup(modname, ver) != NULL) {
1100	    printf("module %s already present!\n", modname);
1101	    /* XXX what can we do? this is a build error. :-( */
1102	    continue;
1103	}
1104	modlist_newmodule(modname, ver, lf);
1105    }
1106}
1107
1108static void
1109linker_preload(void* arg)
1110{
1111    caddr_t		modptr;
1112    const char		*modname, *nmodname;
1113    char		*modtype;
1114    linker_file_t	lf;
1115    linker_class_t	lc;
1116    int			error;
1117    linker_file_list_t	loaded_files;
1118    linker_file_list_t	depended_files;
1119    struct mod_metadata	*mp, *nmp;
1120    struct mod_metadata **start, **stop, **mdp, **nmdp;
1121    struct mod_depend	*verinfo;
1122    int			nver;
1123    int			resolves;
1124    modlist_t		mod;
1125    struct sysinit	**si_start, **si_stop;
1126
1127    TAILQ_INIT(&loaded_files);
1128    TAILQ_INIT(&depended_files);
1129    TAILQ_INIT(&found_modules);
1130    error = 0;
1131
1132    modptr = NULL;
1133    while ((modptr = preload_search_next_name(modptr)) != NULL) {
1134	modname = (char *)preload_search_info(modptr, MODINFO_NAME);
1135	modtype = (char *)preload_search_info(modptr, MODINFO_TYPE);
1136	if (modname == NULL) {
1137	    printf("Preloaded module at %p does not have a name!\n", modptr);
1138	    continue;
1139	}
1140	if (modtype == NULL) {
1141	    printf("Preloaded module at %p does not have a type!\n", modptr);
1142	    continue;
1143	}
1144	printf("Preloaded %s \"%s\" at %p.\n", modtype, modname, modptr);
1145	lf = NULL;
1146	TAILQ_FOREACH(lc, &classes, link) {
1147	    error = LINKER_LINK_PRELOAD(lc, modname, &lf);
1148	    if (error) {
1149		lf = NULL;
1150		break;
1151	    }
1152	}
1153	if (lf)
1154	    TAILQ_INSERT_TAIL(&loaded_files, lf, loaded);
1155    }
1156
1157    /*
1158     * First get a list of stuff in the kernel.
1159     */
1160    if (linker_file_lookup_set(linker_kernel_file, MDT_SETNAME, &start, &stop,
1161			       NULL) == 0)
1162	linker_addmodules(linker_kernel_file, start, stop, 1);
1163
1164    /*
1165     * this is a once-off kinky bubble sort
1166     * resolve relocation dependency requirements
1167     */
1168restart:
1169    TAILQ_FOREACH(lf, &loaded_files, loaded) {
1170	error = linker_file_lookup_set(lf, MDT_SETNAME, &start, &stop, NULL);
1171	/*
1172	 * First, look to see if we would successfully link with this stuff.
1173	 */
1174	resolves = 1;	/* unless we know otherwise */
1175	if (!error) {
1176	    for (mdp = start; mdp < stop; mdp++) {
1177		mp = linker_reloc_ptr(lf, *mdp);
1178		if (mp->md_type != MDT_DEPEND)
1179		    continue;
1180		linker_mdt_depend(lf, mp, &modname, &verinfo);
1181		for (nmdp = start; nmdp < stop; nmdp++) {
1182		    nmp = linker_reloc_ptr(lf, *nmdp);
1183		    if (nmp->md_type != MDT_VERSION)
1184			continue;
1185		    linker_mdt_version(lf, nmp, &nmodname, NULL);
1186		    nmodname = linker_reloc_ptr(lf, nmp->md_cval);
1187		    if (strcmp(modname, nmodname) == 0)
1188			break;
1189		}
1190		if (nmdp < stop)		/* it's a self reference */
1191		    continue;
1192		if (modlist_lookup2(modname, verinfo) == NULL) {
1193		    /* ok, the module isn't here yet, we are not finished */
1194		    resolves = 0;
1195		}
1196	    }
1197	}
1198	/*
1199	 * OK, if we found our modules, we can link.  So, "provide" the
1200	 * modules inside and add it to the end of the link order list.
1201	 */
1202	if (resolves) {
1203	    if (!error) {
1204		for (mdp = start; mdp < stop; mdp++) {
1205		    mp = linker_reloc_ptr(lf, *mdp);
1206		    if (mp->md_type != MDT_VERSION)
1207			continue;
1208		    linker_mdt_version(lf, mp, &modname, &nver);
1209		    if (modlist_lookup(modname, nver) != NULL) {
1210			printf("module %s already present!\n", modname);
1211			linker_file_unload(lf);
1212			TAILQ_REMOVE(&loaded_files, lf, loaded);
1213			goto restart;	/* we changed the tailq next ptr */
1214		    }
1215		    modlist_newmodule(modname, nver, lf);
1216		}
1217	    }
1218	    TAILQ_REMOVE(&loaded_files, lf, loaded);
1219	    TAILQ_INSERT_TAIL(&depended_files, lf, loaded);
1220	    /*
1221	     * Since we provided modules, we need to restart the sort so
1222	     * that the previous files that depend on us have a chance.
1223	     * Also, we've busted the tailq next pointer with the REMOVE.
1224	     */
1225	    goto restart;
1226	}
1227    }
1228
1229    /*
1230     * At this point, we check to see what could not be resolved..
1231     */
1232    TAILQ_FOREACH(lf, &loaded_files, loaded) {
1233	printf("KLD file %s is missing dependencies\n", lf->filename);
1234	linker_file_unload(lf);
1235	TAILQ_REMOVE(&loaded_files, lf, loaded);
1236    }
1237
1238    /*
1239     * We made it. Finish off the linking in the order we determined.
1240     */
1241    TAILQ_FOREACH(lf, &depended_files, loaded) {
1242	if (linker_kernel_file) {
1243	    linker_kernel_file->refs++;
1244	    error = linker_file_add_dependency(lf, linker_kernel_file);
1245	    if (error)
1246		panic("cannot add dependency");
1247	}
1248	lf->userrefs++;		/* so we can (try to) kldunload it */
1249	error = linker_file_lookup_set(lf, MDT_SETNAME, &start, &stop, NULL);
1250	if (!error) {
1251	    for (mdp = start; mdp < stop; mdp++) {
1252		mp = linker_reloc_ptr(lf, *mdp);
1253		if (mp->md_type != MDT_DEPEND)
1254		    continue;
1255		linker_mdt_depend(lf, mp, &modname, &verinfo);
1256		mod = modlist_lookup2(modname, verinfo);
1257		mod->container->refs++;
1258		error = linker_file_add_dependency(lf, mod->container);
1259		if (error)
1260		    panic("cannot add dependency");
1261	    }
1262	}
1263
1264	/*
1265	 * Now do relocation etc using the symbol search paths established by
1266	 * the dependencies
1267	 */
1268	error = LINKER_LINK_PRELOAD_FINISH(lf);
1269	if (error) {
1270	    printf("KLD file %s - could not finalize loading\n", lf->filename);
1271	    linker_file_unload(lf);
1272	    continue;
1273	}
1274
1275	linker_file_register_modules(lf);
1276	if (linker_file_lookup_set(lf, "sysinit_set", &si_start, &si_stop, NULL) == 0)
1277	    sysinit_add(si_start, si_stop);
1278	linker_file_register_sysctls(lf);
1279	lf->flags |= LINKER_FILE_LINKED;
1280    }
1281    /* woohoo! we made it! */
1282}
1283
1284SYSINIT(preload, SI_SUB_KLD, SI_ORDER_MIDDLE, linker_preload, 0);
1285
1286/*
1287 * Search for a not-loaded module by name.
1288 *
1289 * Modules may be found in the following locations:
1290 *
1291 * - preloaded (result is just the module name)
1292 * - on disk (result is full path to module)
1293 *
1294 * If the module name is qualified in any way (contains path, etc.)
1295 * the we simply return a copy of it.
1296 *
1297 * The search path can be manipulated via sysctl.  Note that we use the ';'
1298 * character as a separator to be consistent with the bootloader.
1299 */
1300
1301static char linker_hintfile[] = "linker.hints";
1302static char linker_path[MAXPATHLEN] = "/boot/kernel;/boot/modules;/modules";
1303
1304SYSCTL_STRING(_kern, OID_AUTO, module_path, CTLFLAG_RW, linker_path,
1305	      sizeof(linker_path), "module load search path");
1306
1307TUNABLE_STR("module_path", linker_path, sizeof(linker_path));
1308
1309static char *linker_ext_list[] = {
1310	"",
1311	".ko",
1312	NULL
1313};
1314
1315/*
1316 * Check if file actually exists either with or without extension listed
1317 * in the linker_ext_list.
1318 * (probably should be generic for the rest of the kernel)
1319 */
1320static char *
1321linker_lookup_file(const char *path, int pathlen,
1322	const char *name, int namelen, struct vattr *vap)
1323{
1324    struct nameidata	nd;
1325    struct thread	*td = curthread;	/* XXX */
1326    char		*result, **cpp, *sep;
1327    int			error, len, extlen, reclen, flags;
1328    enum vtype		type;
1329
1330    extlen = 0;
1331    for (cpp = linker_ext_list; *cpp; cpp++) {
1332	len = strlen(*cpp);
1333	if (len > extlen)
1334	    extlen = len;
1335    }
1336    extlen++;	/* trailing '\0' */
1337    sep = (path[pathlen - 1] != '/') ? "/" : "";
1338
1339    reclen = pathlen + strlen(sep) + namelen + extlen + 1;
1340    result = malloc(reclen, M_LINKER, M_WAITOK);
1341    for (cpp = linker_ext_list; *cpp; cpp++) {
1342	snprintf(result, reclen, "%.*s%s%.*s%s", pathlen, path, sep,
1343	    namelen, name, *cpp);
1344	/*
1345	 * Attempt to open the file, and return the path if we succeed
1346	 * and it's a regular file.
1347	 */
1348	NDINIT(&nd, LOOKUP, FOLLOW, UIO_SYSSPACE, result, td);
1349	flags = FREAD;
1350	error = vn_open(&nd, &flags, 0);
1351	if (error == 0) {
1352	    NDFREE(&nd, NDF_ONLY_PNBUF);
1353	    type = nd.ni_vp->v_type;
1354	    if (vap)
1355		VOP_GETATTR(nd.ni_vp, vap, td->td_proc->p_ucred, td);
1356	    VOP_UNLOCK(nd.ni_vp, 0, td);
1357	    vn_close(nd.ni_vp, FREAD, td->td_proc->p_ucred, td);
1358	    if (type == VREG)
1359	        return(result);
1360	}
1361    }
1362    free(result, M_LINKER);
1363    return(NULL);
1364}
1365
1366#define	INT_ALIGN(base, ptr)	ptr = \
1367	(base) + (((ptr) - (base) + sizeof(int) - 1) & ~(sizeof(int) - 1))
1368
1369/*
1370 * Lookup KLD which contains requested module in the "linker.hints" file.
1371 * If version specification is available, then try to find the best KLD.
1372 * Otherwise just find the latest one.
1373 */
1374static char *
1375linker_hints_lookup(const char *path, int pathlen,
1376	const char *modname, int modnamelen,
1377	struct mod_depend *verinfo)
1378{
1379    struct thread *td = curthread;	/* XXX */
1380    struct ucred *cred = td ? td->td_proc->p_ucred : NULL;
1381    struct nameidata nd;
1382    struct vattr vattr, mattr;
1383    u_char *hints = NULL;
1384    u_char *cp, *recptr, *bufend, *result, *best, *pathbuf, *sep;
1385    int error, ival, bestver, *intp, reclen, found, flags, clen, blen;
1386
1387    result = NULL;
1388    bestver = found = 0;
1389
1390    sep = (path[pathlen - 1] != '/') ? "/" : "";
1391    reclen = imax(modnamelen, strlen(linker_hintfile)) + pathlen +
1392        strlen(sep) + 1;
1393    pathbuf = malloc(reclen, M_LINKER, M_WAITOK);
1394    snprintf(pathbuf, reclen, "%.*s%s%s", pathlen, path, sep, linker_hintfile);
1395
1396    NDINIT(&nd, LOOKUP, NOFOLLOW, UIO_SYSSPACE, pathbuf, td);
1397    flags = FREAD;
1398    error = vn_open(&nd, &flags, 0);
1399    if (error)
1400	goto bad;
1401    NDFREE(&nd, NDF_ONLY_PNBUF);
1402    VOP_UNLOCK(nd.ni_vp, 0, td);
1403    if (nd.ni_vp->v_type != VREG)
1404	goto bad;
1405    best = cp = NULL;
1406    error = VOP_GETATTR(nd.ni_vp, &vattr, cred, td);
1407    if (error)
1408	goto bad;
1409    /*
1410     * XXX: we need to limit this number to some reasonable value
1411     */
1412    if (vattr.va_size > 100 * 1024) {
1413	printf("hints file too large %ld\n", (long)vattr.va_size);
1414	goto bad;
1415    }
1416    hints = malloc(vattr.va_size, M_TEMP, M_WAITOK);
1417    if (hints == NULL)
1418	goto bad;
1419    error = vn_rdwr(UIO_READ, nd.ni_vp, (caddr_t)hints, vattr.va_size, 0,
1420		    UIO_SYSSPACE, IO_NODELOCKED, cred, &reclen, td);
1421    if (error)
1422	goto bad;
1423    vn_close(nd.ni_vp, FREAD, cred, td);
1424    nd.ni_vp = NULL;
1425    if (reclen != 0) {
1426	printf("can't read %d\n", reclen);
1427	goto bad;
1428    }
1429    intp = (int*)hints;
1430    ival = *intp++;
1431    if (ival != LINKER_HINTS_VERSION) {
1432	printf("hints file version mismatch %d\n", ival);
1433	goto bad;
1434    }
1435    bufend = hints + vattr.va_size;
1436    recptr = (u_char*)intp;
1437    clen = blen = 0;
1438    while (recptr < bufend && !found) {
1439	intp = (int*)recptr;
1440	reclen = *intp++;
1441	ival = *intp++;
1442	cp = (char*)intp;
1443	switch (ival) {
1444	case MDT_VERSION:
1445	    clen = *cp++;
1446	    if (clen != modnamelen || bcmp(cp, modname, clen) != 0)
1447		break;
1448	    cp += clen;
1449	    INT_ALIGN(hints, cp);
1450	    ival = *(int*)cp;
1451	    cp += sizeof(int);
1452	    clen = *cp++;
1453	    if (verinfo == NULL || ival == verinfo->md_ver_preferred) {
1454		found = 1;
1455		break;
1456	    }
1457	    if (ival >= verinfo->md_ver_minimum &&
1458		ival <= verinfo->md_ver_maximum &&
1459		ival > bestver) {
1460		bestver = ival;
1461		best = cp;
1462		blen = clen;
1463	    }
1464	    break;
1465	default:
1466	    break;
1467	}
1468	recptr += reclen + sizeof(int);
1469    }
1470    /*
1471     * Finally check if KLD is in the place
1472     */
1473    if (found)
1474	result = linker_lookup_file(path, pathlen, cp, clen, &mattr);
1475    else if (best)
1476	result = linker_lookup_file(path, pathlen, best, blen, &mattr);
1477    if (result && timespeccmp(&mattr.va_mtime, &vattr.va_mtime, >)) {
1478	/*
1479	 * KLD is newer than hints file. What we should do now ?
1480	 */
1481	 printf("warning: KLD '%s' is newer than the linker.hints file\n",
1482	     result);
1483    }
1484bad:
1485    if (hints)
1486	free(hints, M_TEMP);
1487    if (nd.ni_vp != NULL)
1488	vn_close(nd.ni_vp, FREAD, cred, td);
1489    /*
1490     * If nothing found or hints is absent - fallback to the old way
1491     * by using "kldname[.ko]" as module name.
1492     */
1493    if (!found && !bestver && result == NULL)
1494	result = linker_lookup_file(path, pathlen, modname, modnamelen, NULL);
1495    return result;
1496}
1497
1498/*
1499 * Lookup KLD which contains requested module in the all directories.
1500 */
1501static char *
1502linker_search_module(const char *modname, int modnamelen,
1503	struct mod_depend *verinfo)
1504{
1505    char *cp, *ep, *result;
1506
1507    /*
1508     * traverse the linker path
1509     */
1510    for (cp = linker_path; *cp; cp = ep + 1) {
1511
1512	/* find the end of this component */
1513	for (ep = cp; (*ep != 0) && (*ep != ';'); ep++)
1514	    ;
1515	result = linker_hints_lookup(cp, ep - cp, modname, modnamelen, verinfo);
1516	if (result != NULL)
1517	    return(result);
1518	if (*ep == 0)
1519	    break;
1520    }
1521    return (NULL);
1522}
1523
1524/*
1525 * Search for module in all directories listed in the linker_path.
1526 */
1527static char *
1528linker_search_kld(const char *name)
1529{
1530    char		*cp, *ep, *result, **cpp;
1531    int			extlen, len;
1532
1533    /* qualified at all? */
1534    if (index(name, '/'))
1535	return(linker_strdup(name));
1536
1537    extlen = 0;
1538    for (cpp = linker_ext_list; *cpp; cpp++) {
1539	len = strlen(*cpp);
1540	if (len > extlen)
1541	    extlen = len;
1542    }
1543    extlen++;	/* trailing '\0' */
1544
1545    /* traverse the linker path */
1546    len = strlen(name);
1547    for (ep = linker_path; *ep; ep++) {
1548	cp = ep;
1549	/* find the end of this component */
1550	for (; *ep != 0 && *ep != ';'; ep++)
1551	    ;
1552	result = linker_lookup_file(cp, ep - cp, name, len, NULL);
1553	if (result != NULL)
1554	    return(result);
1555    }
1556    return(NULL);
1557}
1558
1559static const char *
1560linker_basename(const char* path)
1561{
1562    const char *filename;
1563
1564    filename = rindex(path, '/');
1565    if (filename == NULL)
1566	return path;
1567    if (filename[1])
1568	filename++;
1569    return filename;
1570}
1571
1572/*
1573 * Find a file which contains given module and load it,
1574 * if "parent" is not NULL, register a reference to it.
1575 */
1576static int
1577linker_load_module(const char *kldname, const char *modname,
1578	struct linker_file *parent, struct mod_depend *verinfo,
1579	struct linker_file **lfpp)
1580{
1581    linker_file_t lfdep;
1582    const char *filename;
1583    char *pathname;
1584    int error;
1585
1586    if (modname == NULL) {
1587	/*
1588	 * We have to load KLD
1589	 */
1590	KASSERT(verinfo == NULL, ("linker_load_module: verinfo is not NULL"));
1591	pathname = linker_search_kld(kldname);
1592    } else {
1593	if (modlist_lookup2(modname, verinfo) != NULL)
1594	    return (EEXIST);
1595	if (kldname == NULL) {
1596	    /*
1597	     * Need to find a KLD with required module
1598	     */
1599	    pathname = linker_search_module(modname, strlen(modname), verinfo);
1600	} else
1601	    pathname = linker_strdup(kldname);
1602    }
1603    if (pathname == NULL)
1604	return (ENOENT);
1605
1606    /*
1607     * Can't load more than one file with the same basename
1608     * XXX: Actually it should be possible to have multiple KLDs
1609     * with the same basename but different path because they can provide
1610     * different versions of the same modules.
1611     */
1612    filename = linker_basename(pathname);
1613    if (linker_find_file_by_name(filename)) {
1614	error = EEXIST;
1615	goto out;
1616    }
1617
1618    do {
1619	error = linker_load_file(pathname, &lfdep);
1620	if (error)
1621	    break;
1622	if (modname && verinfo && modlist_lookup2(modname, verinfo) == NULL) {
1623	    linker_file_unload(lfdep);
1624	    error = ENOENT;
1625	    break;
1626	}
1627	if (parent) {
1628	    error = linker_file_add_dependency(parent, lfdep);
1629	    if (error)
1630		break;
1631	}
1632	if (lfpp)
1633	    *lfpp = lfdep;
1634    } while(0);
1635out:
1636    if (pathname)
1637	free(pathname, M_LINKER);
1638    return error;
1639}
1640
1641/*
1642 * This routine is responsible for finding dependencies of userland
1643 * initiated kldload(2)'s of files.
1644 */
1645int
1646linker_load_dependencies(linker_file_t lf)
1647{
1648    linker_file_t lfdep;
1649    struct mod_metadata **start, **stop, **mdp, **nmdp;
1650    struct mod_metadata *mp, *nmp;
1651    struct mod_depend *verinfo;
1652    modlist_t mod;
1653    const char *modname, *nmodname;
1654    int ver, error = 0, count;
1655
1656    /*
1657     * All files are dependant on /kernel.
1658     */
1659    if (linker_kernel_file) {
1660	linker_kernel_file->refs++;
1661	error = linker_file_add_dependency(lf, linker_kernel_file);
1662	if (error)
1663	    return error;
1664    }
1665
1666    if (linker_file_lookup_set(lf, MDT_SETNAME, &start, &stop, &count) != 0)
1667	return 0;
1668    for (mdp = start; mdp < stop; mdp++) {
1669	mp = linker_reloc_ptr(lf, *mdp);
1670	if (mp->md_type != MDT_VERSION)
1671	    continue;
1672	linker_mdt_version(lf, mp, &modname, &ver);
1673	mod = modlist_lookup(modname, ver);
1674	if (mod != NULL) {
1675	    printf("interface %s.%d already present in the KLD '%s'!\n",
1676		modname, ver, mod->container->filename);
1677	    return EEXIST;
1678	}
1679    }
1680
1681    for (mdp = start; mdp < stop; mdp++) {
1682	mp = linker_reloc_ptr(lf, *mdp);
1683	if (mp->md_type != MDT_DEPEND)
1684	    continue;
1685	linker_mdt_depend(lf, mp, &modname, &verinfo);
1686	nmodname = NULL;
1687	for (nmdp = start; nmdp < stop; nmdp++) {
1688	    nmp = linker_reloc_ptr(lf, *nmdp);
1689	    if (nmp->md_type != MDT_VERSION)
1690		continue;
1691	    nmodname = linker_reloc_ptr(lf, nmp->md_cval);
1692	    if (strcmp(modname, nmodname) == 0)
1693		break;
1694	}
1695	if (nmdp < stop)	/* early exit, it's a self reference */
1696	    continue;
1697	mod = modlist_lookup2(modname, verinfo);
1698	if (mod) {		/* woohoo, it's loaded already */
1699	    lfdep = mod->container;
1700	    lfdep->refs++;
1701	    error = linker_file_add_dependency(lf, lfdep);
1702	    if (error)
1703		break;
1704	    continue;
1705	}
1706	error = linker_load_module(NULL, modname, lf, verinfo, NULL);
1707	if (error) {
1708	    printf("KLD %s: depends on %s - not available\n",
1709		lf->filename, modname);
1710	    break;
1711	}
1712    }
1713
1714    if (error)
1715	return error;
1716    linker_addmodules(lf, start, stop, 0);
1717    return error;
1718}
1719
1720static int
1721sysctl_kern_function_list_iterate(const char *name, void *opaque)
1722{
1723	struct sysctl_req *req;
1724
1725	req = opaque;
1726	return (SYSCTL_OUT(req, name, strlen(name) + 1));
1727}
1728
1729/*
1730 * Export a nul-separated, double-nul-terminated list of all function names
1731 * in the kernel.
1732 */
1733static int
1734sysctl_kern_function_list(SYSCTL_HANDLER_ARGS)
1735{
1736	linker_file_t lf;
1737	int error;
1738
1739	TAILQ_FOREACH(lf, &linker_files, link) {
1740		error = LINKER_EACH_FUNCTION_NAME(lf,
1741		    sysctl_kern_function_list_iterate, req);
1742		if (error)
1743			return (error);
1744	}
1745	return (SYSCTL_OUT(req, "", 1));
1746}
1747
1748SYSCTL_PROC(_kern, OID_AUTO, function_list, CTLFLAG_RD,
1749	NULL, 0, sysctl_kern_function_list, "", "kernel function list");
1750