2 * Copyright (c) 1993,1995 Paul Kranenburg
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
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 * 3. All advertising materials mentioning features or use of this software
14 * must display the following acknowledgement:
15 * This product includes software developed by Paul Kranenburg.
16 * 4. 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.
32 static const char rcsid[] =
36 #include <sys/param.h>
37 #include <sys/types.h>
43 #include <elf-hints.h>
47 #include <sys/link_aout.h>
60 #define _PATH_LD_HINTS "./ld.so.hints"
61 #undef _PATH_ELF_HINTS
62 #define _PATH_ELF_HINTS "./ld-elf.so.hints"
65 #define _PATH_LD32_HINTS "/var/run/ld32.so.hints"
66 #define _PATH_ELF32_HINTS "/var/run/ld-elf32.so.hints"
76 static const char *hints_file;
79 /* Internal list of shared libraries found */
84 #define major dewey[0]
85 #define minor dewey[1]
86 struct shlib_list *next;
89 static struct shlib_list *shlib_head = NULL, **shlib_tail = &shlib_head;
90 static char *dir_list;
92 static int buildhints(void);
93 static int dodir(char *, int);
94 int dofile(char *, int);
95 static void enter(char *, char *, char *, int *, int);
96 static void listhints(void);
97 static int readhints(void);
98 static void usage(void);
101 main(int argc, char **argv)
109 if (strcmp(argv[1], "-aout") == 0) {
113 } else if (strcmp(argv[1], "-elf") == 0) {
117 } else if (strcmp(argv[1], "-32") == 0) {
127 hints_file = is_aout ? _PATH_LD32_HINTS : _PATH_ELF32_HINTS;
129 hints_file = is_aout ? _PATH_LD_HINTS : _PATH_ELF_HINTS;
132 else while((c = getopt(argc, argv, "Rf:imrsv")) != -1) {
163 list_elf_hints(hints_file);
165 update_elf_hints(hints_file, argc - optind,
166 argv + optind, merge || rescan);
170 /* Here begins the aout libs processing */
171 dir_list = strdup("");
173 if (justread || merge || rescan) {
174 if ((rval = readhints()) != 0)
178 if (!nostd && !merge && !rescan)
181 /* Add any directories/files from the command line */
183 for (i = optind; i < argc; i++) {
186 if (stat(argv[i], &stbuf) == -1) {
189 } else if (strcmp(argv[i], "/usr/lib") == 0) {
190 warnx("WARNING! '%s' can not be used", argv[i]);
194 * See if this is a directory-containing
195 * file instead of a directory
197 if (S_ISREG(stbuf.st_mode))
198 rval |= dofile(argv[i], 0);
200 add_search_path(argv[i]);
205 for (i = 0; i < n_search_dirs; i++) {
206 char *cp = concat(dir_list, *dir_list?":":"", search_dirs[i]);
216 for (i = 0; i < n_search_dirs; i++)
217 rval |= dodir(search_dirs[i], 1);
219 rval |= buildhints();
228 "usage: ldconfig [-32] [-aout | -elf] [-Rimrsv] [-f hints_file] [directory | file ...]\n");
233 dofile(fname, silent)
238 char buf[MAXPATHLEN];
242 if ((hfp = fopen(fname, "r")) == NULL) {
247 while (fgets(buf, sizeof(buf), hfp)) {
251 if (*cp == '#' || *cp == '\0')
254 while (!isspace(*cp) && *cp != '\0')
259 warnx("%s: trailing characters ignored", sp);
264 rval |= dodir(sp, silent);
278 char name[MAXPATHLEN];
279 int dewey[MAXDEWEY], ndewey;
281 if ((dd = opendir(dir)) == NULL) {
282 if (silent && errno == ENOENT) /* Ignore the error */
288 while ((dp = readdir(dd)) != NULL) {
292 /* Check for `lib' prefix */
293 if (dp->d_name[0] != 'l' ||
294 dp->d_name[1] != 'i' ||
295 dp->d_name[2] != 'b')
298 /* Copy the entry minus prefix */
299 (void)strcpy(name, dp->d_name + 3);
304 /* Find ".so." in name */
305 for (cp = name + n - 4; cp > name; --cp) {
316 if (!isdigit(*(cp+4)))
319 bzero((caddr_t)dewey, sizeof(dewey));
320 ndewey = getdewey(dewey, cp + 4);
323 enter(dir, dp->d_name, name, dewey, ndewey);
331 enter(dir, file, name, dewey, ndewey)
332 char *dir, *file, *name;
335 struct shlib_list *shp;
337 for (shp = shlib_head; shp; shp = shp->next) {
338 if (strcmp(name, shp->name) != 0 || major != shp->major)
341 /* Name matches existing entry */
342 if (cmpndewey(dewey, ndewey, shp->dewey, shp->ndewey) > 0) {
344 /* Update this entry with higher versioned lib */
346 printf("Updating lib%s.%d.%d to %s/%s\n",
347 shp->name, shp->major, shp->minor,
351 shp->name = strdup(name);
353 shp->path = concat(dir, "/", file);
354 bcopy(dewey, shp->dewey, sizeof(shp->dewey));
355 shp->ndewey = ndewey;
361 /* Name exists: older version or just updated */
364 /* Allocate new list element */
366 printf("Adding %s/%s\n", dir, file);
368 shp = (struct shlib_list *)xmalloc(sizeof *shp);
369 shp->name = strdup(name);
370 shp->path = concat(dir, "/", file);
371 bcopy(dewey, shp->dewey, sizeof(shp->dewey));
372 shp->ndewey = ndewey;
376 shlib_tail = &shp->next;
381 hinthash(char *cp, int vmajor)
386 k = (((k << 1) + (k >> 14)) ^ (*cp++)) & 0x3fff;
388 k = (((k << 1) + (k >> 14)) ^ (vmajor*257)) & 0x3fff;
396 struct hints_header hdr;
397 struct hints_bucket *blist;
398 struct shlib_list *shp;
400 int i, n, str_index = 0;
401 int strtab_sz = 0; /* Total length of strings */
402 int nhints = 0; /* Total number of hints */
406 for (shp = shlib_head; shp; shp = shp->next) {
407 strtab_sz += 1 + strlen(shp->name);
408 strtab_sz += 1 + strlen(shp->path);
412 /* Fill hints file header */
413 hdr.hh_magic = HH_MAGIC;
414 hdr.hh_version = LD_HINTS_VERSION_2;
415 hdr.hh_nbucket = 1 * nhints;
416 n = hdr.hh_nbucket * sizeof(struct hints_bucket);
417 hdr.hh_hashtab = sizeof(struct hints_header);
418 hdr.hh_strtab = hdr.hh_hashtab + n;
419 hdr.hh_dirlist = strtab_sz;
420 strtab_sz += 1 + strlen(dir_list);
421 hdr.hh_strtab_sz = strtab_sz;
422 hdr.hh_ehints = hdr.hh_strtab + hdr.hh_strtab_sz;
425 printf("Totals: entries %d, buckets %ld, string size %d\n",
426 nhints, (long)hdr.hh_nbucket, strtab_sz);
428 /* Allocate buckets and string table */
429 blist = (struct hints_bucket *)xmalloc(n);
430 bzero((char *)blist, n);
431 for (i = 0; i < hdr.hh_nbucket; i++)
432 /* Empty all buckets */
433 blist[i].hi_next = -1;
435 strtab = (char *)xmalloc(strtab_sz);
438 for (shp = shlib_head; shp; shp = shp->next) {
439 struct hints_bucket *bp;
442 (hinthash(shp->name, shp->major) % hdr.hh_nbucket);
447 for (j = 0; j < hdr.hh_nbucket; j++) {
448 if (blist[j].hi_pathx == 0)
451 if (j == hdr.hh_nbucket) {
455 while (bp->hi_next != -1)
456 bp = &blist[bp->hi_next];
461 /* Insert strings in string table */
462 bp->hi_namex = str_index;
463 strcpy(strtab + str_index, shp->name);
464 str_index += 1 + strlen(shp->name);
466 bp->hi_pathx = str_index;
467 strcpy(strtab + str_index, shp->path);
468 str_index += 1 + strlen(shp->path);
471 bcopy(shp->dewey, bp->hi_dewey, sizeof(bp->hi_dewey));
472 bp->hi_ndewey = shp->ndewey;
475 /* Copy search directories */
476 strcpy(strtab + str_index, dir_list);
477 str_index += 1 + strlen(dir_list);
480 if (str_index != strtab_sz) {
481 errx(1, "str_index(%d) != strtab_sz(%d)", str_index, strtab_sz);
484 tmpfilename = concat(hints_file, ".XXXXXXXXXX", "");
485 umask(0); /* Create with exact permissions */
486 if ((fd = mkstemp(tmpfilename)) == -1) {
487 warn("%s", tmpfilename);
492 if (write(fd, &hdr, sizeof(struct hints_header)) !=
493 sizeof(struct hints_header)) {
494 warn("%s", hints_file);
497 if (write(fd, blist, hdr.hh_nbucket * sizeof(*blist)) !=
498 (ssize_t)(hdr.hh_nbucket * sizeof(*blist))) {
499 warn("%s", hints_file);
502 if (write(fd, strtab, strtab_sz) != strtab_sz) {
503 warn("%s", hints_file);
506 if (close(fd) != 0) {
507 warn("%s", hints_file);
512 if (unlink(hints_file) != 0 && errno != ENOENT) {
513 warn("%s", hints_file);
517 if (rename(tmpfilename, hints_file) != 0) {
518 warn("%s", hints_file);
532 struct hints_header *hdr;
533 struct hints_bucket *blist;
535 struct shlib_list *shp;
538 if ((fd = open(hints_file, O_RDONLY, 0)) == -1) {
539 warn("%s", hints_file);
544 addr = mmap(0, msize, PROT_READ, MAP_COPY, fd, 0);
546 if (addr == MAP_FAILED) {
547 warn("%s", hints_file);
551 hdr = (struct hints_header *)addr;
552 if (HH_BADMAG(*hdr)) {
553 warnx("%s: bad magic: %lo", hints_file,
554 (unsigned long)hdr->hh_magic);
558 if (hdr->hh_version != LD_HINTS_VERSION_1 &&
559 hdr->hh_version != LD_HINTS_VERSION_2) {
560 warnx("unsupported version: %ld", (long)hdr->hh_version);
564 if (hdr->hh_ehints > msize) {
565 fsize = hdr->hh_ehints;
567 addr = mmap(0, fsize, PROT_READ, MAP_COPY, fd, 0);
568 if (addr == MAP_FAILED) {
569 warn("%s", hints_file);
572 hdr = (struct hints_header *)addr;
576 strtab = (char *)addr + hdr->hh_strtab;
578 if (hdr->hh_version >= LD_HINTS_VERSION_2)
579 add_search_path(strtab + hdr->hh_dirlist);
581 errx(1, "%s too old and does not contain the search path",
587 blist = malloc(sizeof(*blist) * hdr->hh_nbucket);
590 memcpy(blist, (char *)addr + hdr->hh_hashtab,
591 sizeof(*blist) * hdr->hh_nbucket);
594 for (i = 0; i < hdr->hh_nbucket; i++) {
595 struct hints_bucket *bp = &blist[i];
598 if (bp->hi_namex >= hdr->hh_strtab_sz) {
599 warnx("bad name index: %#x", bp->hi_namex);
603 if (bp->hi_pathx >= hdr->hh_strtab_sz) {
604 warnx("bad path index: %#x", bp->hi_pathx);
609 /* Allocate new list element */
610 shp = (struct shlib_list *)xmalloc(sizeof *shp);
611 shp->name = strdup(strtab + bp->hi_namex);
612 shp->path = strdup(strtab + bp->hi_pathx);
613 bcopy(bp->hi_dewey, shp->dewey, sizeof(shp->dewey));
614 shp->ndewey = bp->hi_ndewey;
618 shlib_tail = &shp->next;
628 struct shlib_list *shp;
631 printf("%s:\n", hints_file);
632 printf("\tsearch directories: %s\n", dir_list);
634 for (i = 0, shp = shlib_head; shp; i++, shp = shp->next)
635 printf("\t%d:-l%s.%d.%d => %s\n",
636 i, shp->name, shp->major, shp->minor, shp->path);