ldconfig.c revision 1.30 1 1.30 matt /* $NetBSD: ldconfig.c,v 1.30 2000/06/01 18:17:06 matt Exp $ */
2 1.15 thorpej
3 1.20 pk /*-
4 1.20 pk * Copyright (c) 1998 The NetBSD Foundation, Inc.
5 1.1 pk * All rights reserved.
6 1.1 pk *
7 1.20 pk * This code is derived from software contributed to The NetBSD Foundation
8 1.20 pk * by Paul Kranenburg.
9 1.20 pk *
10 1.1 pk * Redistribution and use in source and binary forms, with or without
11 1.1 pk * modification, are permitted provided that the following conditions
12 1.1 pk * are met:
13 1.1 pk * 1. Redistributions of source code must retain the above copyright
14 1.1 pk * notice, this list of conditions and the following disclaimer.
15 1.1 pk * 2. Redistributions in binary form must reproduce the above copyright
16 1.1 pk * notice, this list of conditions and the following disclaimer in the
17 1.1 pk * documentation and/or other materials provided with the distribution.
18 1.1 pk * 3. All advertising materials mentioning features or use of this software
19 1.1 pk * must display the following acknowledgement:
20 1.20 pk * This product includes software developed by the NetBSD
21 1.20 pk * Foundation, Inc. and its contributors.
22 1.20 pk * 4. Neither the name of The NetBSD Foundation nor the names of its
23 1.20 pk * contributors may be used to endorse or promote products derived
24 1.20 pk * from this software without specific prior written permission.
25 1.1 pk *
26 1.20 pk * THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS
27 1.20 pk * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
28 1.20 pk * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
29 1.20 pk * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS
30 1.20 pk * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
31 1.20 pk * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
32 1.20 pk * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
33 1.20 pk * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
34 1.20 pk * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
35 1.20 pk * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
36 1.20 pk * POSSIBILITY OF SUCH DAMAGE.
37 1.1 pk */
38 1.1 pk
39 1.1 pk #include <sys/param.h>
40 1.1 pk #include <sys/types.h>
41 1.1 pk #include <sys/stat.h>
42 1.1 pk #include <sys/file.h>
43 1.1 pk #include <sys/time.h>
44 1.1 pk #include <sys/mman.h>
45 1.29 matt #include <a.out.h>
46 1.21 pk #include <ctype.h>
47 1.7 pk #include <dirent.h>
48 1.21 pk #include <err.h>
49 1.7 pk #include <errno.h>
50 1.1 pk #include <fcntl.h>
51 1.7 pk #include <stdio.h>
52 1.7 pk #include <stdlib.h>
53 1.1 pk #include <string.h>
54 1.7 pk #include <unistd.h>
55 1.21 pk #include <link.h>
56 1.30 matt #include <paths.h>
57 1.1 pk
58 1.22 pk #include "shlib.h"
59 1.1 pk
60 1.18 thorpej #define _PATH_LD_SO_CONF "/etc/ld.so.conf"
61 1.18 thorpej
62 1.1 pk #undef major
63 1.1 pk #undef minor
64 1.1 pk
65 1.8 pk extern char *__progname;
66 1.8 pk
67 1.1 pk static int verbose;
68 1.1 pk static int nostd;
69 1.18 thorpej static int noconf;
70 1.1 pk static int justread;
71 1.9 pk static int merge;
72 1.1 pk
73 1.1 pk struct shlib_list {
74 1.1 pk /* Internal list of shared libraries found */
75 1.1 pk char *name;
76 1.1 pk char *path;
77 1.1 pk int dewey[MAXDEWEY];
78 1.1 pk int ndewey;
79 1.1 pk #define major dewey[0]
80 1.1 pk #define minor dewey[1]
81 1.1 pk struct shlib_list *next;
82 1.1 pk };
83 1.1 pk
84 1.1 pk static struct shlib_list *shlib_head = NULL, **shlib_tail = &shlib_head;
85 1.13 pk static char *dir_list;
86 1.1 pk
87 1.1 pk static void enter __P((char *, char *, char *, int *, int));
88 1.18 thorpej static int dodir __P((char *, int, int));
89 1.18 thorpej static int do_conf __P((void));
90 1.9 pk static int buildhints __P((void));
91 1.9 pk static int readhints __P((void));
92 1.9 pk static void listhints __P((void));
93 1.21 pk static int hinthash __P((char *, int, int));
94 1.21 pk int main __P((int, char *[]));
95 1.1 pk
96 1.1 pk int
97 1.1 pk main(argc, argv)
98 1.21 pk int argc;
99 1.21 pk char *argv[];
100 1.1 pk {
101 1.21 pk int i, c;
102 1.21 pk int rval = 0;
103 1.1 pk
104 1.18 thorpej while ((c = getopt(argc, argv, "cmrsSv")) != -1) {
105 1.1 pk switch (c) {
106 1.18 thorpej case 'c':
107 1.18 thorpej noconf = 1;
108 1.18 thorpej break;
109 1.9 pk case 'm':
110 1.9 pk merge = 1;
111 1.9 pk break;
112 1.9 pk case 'r':
113 1.9 pk justread = 1;
114 1.1 pk break;
115 1.1 pk case 's':
116 1.1 pk nostd = 1;
117 1.18 thorpej noconf = 1;
118 1.18 thorpej break;
119 1.18 thorpej case 'S':
120 1.18 thorpej nostd = 1;
121 1.1 pk break;
122 1.9 pk case 'v':
123 1.9 pk verbose = 1;
124 1.1 pk break;
125 1.1 pk default:
126 1.18 thorpej errx(1, "Usage: %s [-c][-m][-r][-s][-S][-v][dir ...]",
127 1.8 pk __progname);
128 1.1 pk break;
129 1.1 pk }
130 1.1 pk }
131 1.1 pk
132 1.13 pk dir_list = xmalloc(1);
133 1.13 pk *dir_list = '\0';
134 1.13 pk
135 1.9 pk if (justread || merge) {
136 1.9 pk if ((rval = readhints()) != 0)
137 1.21 pk return (rval);
138 1.9 pk if (justread) {
139 1.9 pk listhints();
140 1.21 pk return (rval);
141 1.9 pk }
142 1.9 pk }
143 1.1 pk
144 1.9 pk if (!nostd && !merge)
145 1.7 pk std_search_path();
146 1.1 pk
147 1.1 pk for (i = 0; i < n_search_dirs; i++)
148 1.18 thorpej rval |= dodir(search_dirs[i], 1, 0);
149 1.18 thorpej
150 1.18 thorpej if (!noconf && !merge)
151 1.18 thorpej rval |= do_conf();
152 1.1 pk
153 1.13 pk for (i = optind; i < argc; i++) {
154 1.18 thorpej rval |= dodir(argv[i], 0, 1);
155 1.13 pk }
156 1.1 pk
157 1.9 pk rval |= buildhints();
158 1.1 pk
159 1.21 pk return (rval);
160 1.1 pk }
161 1.1 pk
162 1.1 pk int
163 1.18 thorpej do_conf ()
164 1.18 thorpej {
165 1.18 thorpej FILE *conf;
166 1.18 thorpej char *line, *c;
167 1.18 thorpej char *cline = NULL;
168 1.18 thorpej size_t len;
169 1.18 thorpej int rval = 0;
170 1.18 thorpej
171 1.23 agc if ((conf = fopen(_PATH_LD_SO_CONF, "r")) == NULL) {
172 1.24 drochner if (verbose) {
173 1.23 agc warnx("can't open `%s'", _PATH_LD_SO_CONF);
174 1.23 agc }
175 1.23 agc return (0);
176 1.23 agc }
177 1.18 thorpej
178 1.18 thorpej while ((line = fgetln(conf, &len)) != NULL) {
179 1.28 matt if (*line != '/')
180 1.18 thorpej continue;
181 1.18 thorpej
182 1.18 thorpej if (line[len-1] == '\n') {
183 1.18 thorpej line[--len] = '\0';
184 1.18 thorpej } else {
185 1.18 thorpej cline = xmalloc(len+1);
186 1.27 christos memcpy(cline, line, len);
187 1.18 thorpej line = cline;
188 1.18 thorpej line[len] = '\0';
189 1.18 thorpej }
190 1.18 thorpej
191 1.18 thorpej while (isblank(*line)) { line++; len--; }
192 1.18 thorpej if ((c = strchr(line, '#')) == NULL)
193 1.18 thorpej c = line + len;
194 1.18 thorpej while (--c >= line && isblank(*c)) continue;
195 1.18 thorpej if (c >= line) {
196 1.18 thorpej *++c = '\0';
197 1.18 thorpej rval |= dodir(line, 0, 1);
198 1.18 thorpej }
199 1.18 thorpej
200 1.18 thorpej if (cline) {
201 1.18 thorpej free(cline);
202 1.18 thorpej cline = NULL;
203 1.18 thorpej }
204 1.18 thorpej }
205 1.23 agc
206 1.23 agc (void) fclose(conf);
207 1.18 thorpej
208 1.21 pk return (rval);
209 1.18 thorpej }
210 1.18 thorpej
211 1.18 thorpej int
212 1.18 thorpej dodir(dir, silent, update_dir_list)
213 1.21 pk char *dir;
214 1.21 pk int silent;
215 1.21 pk int update_dir_list;
216 1.1 pk {
217 1.1 pk DIR *dd;
218 1.1 pk struct dirent *dp;
219 1.10 pk char name[MAXPATHLEN];
220 1.1 pk int dewey[MAXDEWEY], ndewey;
221 1.1 pk
222 1.1 pk if ((dd = opendir(dir)) == NULL) {
223 1.30 matt /* /emul/aout directories are allowed to not exist.
224 1.30 matt */
225 1.30 matt if (!strncmp(dir, _PATH_EMUL_AOUT, sizeof(_PATH_EMUL_AOUT)-1))
226 1.30 matt return 0;
227 1.3 pk if (!silent || errno != ENOENT)
228 1.9 pk warn("%s", dir);
229 1.21 pk return (-1);
230 1.18 thorpej }
231 1.18 thorpej
232 1.18 thorpej if (update_dir_list) {
233 1.18 thorpej /* Check for duplicates? */
234 1.18 thorpej char *cp = concat(dir_list, *dir_list?":":"", dir);
235 1.18 thorpej free(dir_list);
236 1.18 thorpej dir_list = cp;
237 1.1 pk }
238 1.1 pk
239 1.1 pk while ((dp = readdir(dd)) != NULL) {
240 1.21 pk int n;
241 1.29 matt char *cp, *path;
242 1.29 matt FILE *fp;
243 1.29 matt struct exec ex;
244 1.1 pk
245 1.10 pk /* Check for `lib' prefix */
246 1.10 pk if (dp->d_name[0] != 'l' ||
247 1.10 pk dp->d_name[1] != 'i' ||
248 1.10 pk dp->d_name[2] != 'b')
249 1.10 pk continue;
250 1.10 pk
251 1.10 pk /* Copy the entry minus prefix */
252 1.10 pk (void)strcpy(name, dp->d_name + 3);
253 1.10 pk n = strlen(name);
254 1.10 pk if (n < 4)
255 1.10 pk continue;
256 1.1 pk
257 1.10 pk /* Find ".so." in name */
258 1.10 pk for (cp = name + n - 4; cp > name; --cp) {
259 1.10 pk if (cp[0] == '.' &&
260 1.10 pk cp[1] == 's' &&
261 1.10 pk cp[2] == 'o' &&
262 1.10 pk cp[3] == '.')
263 1.10 pk break;
264 1.10 pk }
265 1.10 pk if (cp <= name)
266 1.29 matt continue;
267 1.29 matt
268 1.29 matt path = concat(dir, "/", dp->d_name);
269 1.29 matt fp = fopen(path, "r");
270 1.29 matt free(path);
271 1.29 matt if (fp == NULL)
272 1.29 matt continue;
273 1.29 matt n = fread(&ex, 1, sizeof(ex), fp);
274 1.29 matt fclose(fp);
275 1.29 matt if (n != sizeof(ex)
276 1.29 matt || N_GETMAGIC(ex) != ZMAGIC
277 1.29 matt || (N_GETFLAG(ex) & EX_DYNAMIC) == 0)
278 1.10 pk continue;
279 1.1 pk
280 1.10 pk *cp = '\0';
281 1.10 pk if (!isdigit(*(cp+4)))
282 1.1 pk continue;
283 1.1 pk
284 1.27 christos memset(dewey, 0, sizeof(dewey));
285 1.10 pk ndewey = getdewey(dewey, cp + 4);
286 1.1 pk enter(dir, dp->d_name, name, dewey, ndewey);
287 1.1 pk }
288 1.25 agc
289 1.25 agc (void) closedir(dd);
290 1.1 pk
291 1.21 pk return (0);
292 1.1 pk }
293 1.1 pk
294 1.1 pk static void
295 1.1 pk enter(dir, file, name, dewey, ndewey)
296 1.21 pk char *dir, *file, *name;
297 1.21 pk int dewey[], ndewey;
298 1.1 pk {
299 1.1 pk struct shlib_list *shp;
300 1.1 pk
301 1.1 pk for (shp = shlib_head; shp; shp = shp->next) {
302 1.1 pk if (strcmp(name, shp->name) != 0 || major != shp->major)
303 1.1 pk continue;
304 1.1 pk
305 1.1 pk /* Name matches existing entry */
306 1.1 pk if (cmpndewey(dewey, ndewey, shp->dewey, shp->ndewey) > 0) {
307 1.1 pk
308 1.1 pk /* Update this entry with higher versioned lib */
309 1.1 pk if (verbose)
310 1.1 pk printf("Updating lib%s.%d.%d to %s/%s\n",
311 1.1 pk shp->name, shp->major, shp->minor,
312 1.1 pk dir, file);
313 1.1 pk
314 1.1 pk free(shp->name);
315 1.1 pk shp->name = strdup(name);
316 1.1 pk free(shp->path);
317 1.1 pk shp->path = concat(dir, "/", file);
318 1.27 christos memcpy(shp->dewey, dewey, sizeof(shp->dewey));
319 1.1 pk shp->ndewey = ndewey;
320 1.1 pk }
321 1.1 pk break;
322 1.1 pk }
323 1.1 pk
324 1.1 pk if (shp)
325 1.1 pk /* Name exists: older version or just updated */
326 1.1 pk return;
327 1.1 pk
328 1.1 pk /* Allocate new list element */
329 1.1 pk if (verbose)
330 1.1 pk printf("Adding %s/%s\n", dir, file);
331 1.1 pk
332 1.1 pk shp = (struct shlib_list *)xmalloc(sizeof *shp);
333 1.1 pk shp->name = strdup(name);
334 1.1 pk shp->path = concat(dir, "/", file);
335 1.27 christos memcpy(shp->dewey, dewey, MAXDEWEY);
336 1.1 pk shp->ndewey = ndewey;
337 1.1 pk shp->next = NULL;
338 1.1 pk
339 1.1 pk *shlib_tail = shp;
340 1.1 pk shlib_tail = &shp->next;
341 1.1 pk }
342 1.1 pk
343 1.1 pk
344 1.1 pk #if DEBUG
345 1.1 pk /* test */
346 1.1 pk #undef _PATH_LD_HINTS
347 1.1 pk #define _PATH_LD_HINTS "./ld.so.hints"
348 1.1 pk #endif
349 1.1 pk
350 1.21 pk /* XXX - should be a common function with rtld.c */
351 1.1 pk int
352 1.1 pk hinthash(cp, vmajor, vminor)
353 1.21 pk char *cp;
354 1.21 pk int vmajor, vminor;
355 1.1 pk {
356 1.1 pk int k = 0;
357 1.1 pk
358 1.1 pk while (*cp)
359 1.1 pk k = (((k << 1) + (k >> 14)) ^ (*cp++)) & 0x3fff;
360 1.1 pk
361 1.1 pk k = (((k << 1) + (k >> 14)) ^ (vmajor*257)) & 0x3fff;
362 1.13 pk #if 0
363 1.1 pk k = (((k << 1) + (k >> 14)) ^ (vminor*167)) & 0x3fff;
364 1.13 pk #endif
365 1.1 pk
366 1.21 pk return (k);
367 1.1 pk }
368 1.1 pk
369 1.1 pk int
370 1.9 pk buildhints()
371 1.1 pk {
372 1.1 pk struct hints_header hdr;
373 1.1 pk struct hints_bucket *blist;
374 1.1 pk struct shlib_list *shp;
375 1.1 pk char *strtab;
376 1.1 pk int i, n, str_index = 0;
377 1.1 pk int strtab_sz = 0; /* Total length of strings */
378 1.1 pk int nhints = 0; /* Total number of hints */
379 1.1 pk int fd;
380 1.1 pk char *tmpfile;
381 1.1 pk
382 1.1 pk for (shp = shlib_head; shp; shp = shp->next) {
383 1.1 pk strtab_sz += 1 + strlen(shp->name);
384 1.1 pk strtab_sz += 1 + strlen(shp->path);
385 1.1 pk nhints++;
386 1.1 pk }
387 1.1 pk
388 1.1 pk /* Fill hints file header */
389 1.1 pk hdr.hh_magic = HH_MAGIC;
390 1.13 pk hdr.hh_version = LD_HINTS_VERSION_2;
391 1.1 pk hdr.hh_nbucket = 1 * nhints;
392 1.1 pk n = hdr.hh_nbucket * sizeof(struct hints_bucket);
393 1.1 pk hdr.hh_hashtab = sizeof(struct hints_header);
394 1.1 pk hdr.hh_strtab = hdr.hh_hashtab + n;
395 1.13 pk hdr.hh_dirlist = strtab_sz;
396 1.13 pk strtab_sz += 1 + strlen(dir_list);
397 1.1 pk hdr.hh_strtab_sz = strtab_sz;
398 1.1 pk hdr.hh_ehints = hdr.hh_strtab + hdr.hh_strtab_sz;
399 1.1 pk
400 1.1 pk if (verbose)
401 1.21 pk printf("Totals: entries %d, buckets %ld, string size %d\n",
402 1.1 pk nhints, hdr.hh_nbucket, strtab_sz);
403 1.1 pk
404 1.1 pk /* Allocate buckets and string table */
405 1.1 pk blist = (struct hints_bucket *)xmalloc(n);
406 1.27 christos memset(blist, 0, n);
407 1.1 pk for (i = 0; i < hdr.hh_nbucket; i++)
408 1.1 pk /* Empty all buckets */
409 1.1 pk blist[i].hi_next = -1;
410 1.1 pk
411 1.1 pk strtab = (char *)xmalloc(strtab_sz);
412 1.1 pk
413 1.1 pk /* Enter all */
414 1.1 pk for (shp = shlib_head; shp; shp = shp->next) {
415 1.1 pk struct hints_bucket *bp;
416 1.1 pk
417 1.1 pk bp = blist +
418 1.1 pk (hinthash(shp->name, shp->major, shp->minor) % hdr.hh_nbucket);
419 1.1 pk
420 1.1 pk if (bp->hi_pathx) {
421 1.1 pk int i;
422 1.1 pk
423 1.1 pk for (i = 0; i < hdr.hh_nbucket; i++) {
424 1.1 pk if (blist[i].hi_pathx == 0)
425 1.1 pk break;
426 1.1 pk }
427 1.1 pk if (i == hdr.hh_nbucket) {
428 1.9 pk warnx("Bummer!");
429 1.21 pk return (-1);
430 1.1 pk }
431 1.1 pk while (bp->hi_next != -1)
432 1.1 pk bp = &blist[bp->hi_next];
433 1.1 pk bp->hi_next = i;
434 1.1 pk bp = blist + i;
435 1.1 pk }
436 1.1 pk
437 1.1 pk /* Insert strings in string table */
438 1.1 pk bp->hi_namex = str_index;
439 1.1 pk strcpy(strtab + str_index, shp->name);
440 1.1 pk str_index += 1 + strlen(shp->name);
441 1.1 pk
442 1.1 pk bp->hi_pathx = str_index;
443 1.1 pk strcpy(strtab + str_index, shp->path);
444 1.1 pk str_index += 1 + strlen(shp->path);
445 1.1 pk
446 1.1 pk /* Copy versions */
447 1.27 christos memcpy(bp->hi_dewey, shp->dewey, sizeof(bp->hi_dewey));
448 1.1 pk bp->hi_ndewey = shp->ndewey;
449 1.1 pk }
450 1.1 pk
451 1.13 pk /* Copy search directories */
452 1.13 pk strcpy(strtab + str_index, dir_list);
453 1.13 pk str_index += 1 + strlen(dir_list);
454 1.13 pk
455 1.13 pk /* Sanity check */
456 1.13 pk if (str_index != strtab_sz) {
457 1.13 pk errx(1, "str_index(%d) != strtab_sz(%d)", str_index, strtab_sz);
458 1.13 pk }
459 1.13 pk
460 1.12 pk tmpfile = concat(_PATH_LD_HINTS, ".XXXXXX", "");
461 1.17 christos if ((fd = mkstemp(tmpfile)) == -1) {
462 1.12 pk warn("%s", tmpfile);
463 1.21 pk return (-1);
464 1.12 pk }
465 1.12 pk
466 1.4 pk if (write(fd, &hdr, sizeof(struct hints_header)) !=
467 1.12 pk sizeof(struct hints_header)) {
468 1.9 pk warn("%s", _PATH_LD_HINTS);
469 1.21 pk return (-1);
470 1.4 pk }
471 1.4 pk if (write(fd, blist, hdr.hh_nbucket * sizeof(struct hints_bucket)) !=
472 1.12 pk hdr.hh_nbucket * sizeof(struct hints_bucket)) {
473 1.9 pk warn("%s", _PATH_LD_HINTS);
474 1.21 pk return (-1);
475 1.4 pk }
476 1.4 pk if (write(fd, strtab, strtab_sz) != strtab_sz) {
477 1.17 christos warn("%s", _PATH_LD_HINTS);
478 1.21 pk return (-1);
479 1.17 christos }
480 1.17 christos if (fchmod(fd, 0444) == -1) {
481 1.9 pk warn("%s", _PATH_LD_HINTS);
482 1.21 pk return (-1);
483 1.4 pk }
484 1.1 pk if (close(fd) != 0) {
485 1.9 pk warn("%s", _PATH_LD_HINTS);
486 1.21 pk return (-1);
487 1.1 pk }
488 1.1 pk
489 1.4 pk /* Install it */
490 1.1 pk if (unlink(_PATH_LD_HINTS) != 0 && errno != ENOENT) {
491 1.9 pk warn("%s", _PATH_LD_HINTS);
492 1.21 pk return (-1);
493 1.1 pk }
494 1.1 pk
495 1.1 pk if (rename(tmpfile, _PATH_LD_HINTS) != 0) {
496 1.9 pk warn("%s", _PATH_LD_HINTS);
497 1.21 pk return (-1);
498 1.1 pk }
499 1.1 pk
500 1.21 pk return (0);
501 1.1 pk }
502 1.1 pk
503 1.7 pk static int
504 1.9 pk readhints()
505 1.1 pk {
506 1.1 pk int fd;
507 1.27 christos void *addr = (void *) -1;
508 1.27 christos size_t msize;
509 1.1 pk struct hints_header *hdr;
510 1.1 pk struct hints_bucket *blist;
511 1.1 pk char *strtab;
512 1.9 pk struct shlib_list *shp;
513 1.1 pk int i;
514 1.27 christos struct stat st;
515 1.27 christos int error = 0;
516 1.1 pk
517 1.1 pk if ((fd = open(_PATH_LD_HINTS, O_RDONLY, 0)) == -1) {
518 1.9 pk warn("%s", _PATH_LD_HINTS);
519 1.27 christos goto cleanup;
520 1.27 christos }
521 1.27 christos
522 1.27 christos if (fstat(fd, &st) == -1) {
523 1.27 christos warn("%s", _PATH_LD_HINTS);
524 1.27 christos goto cleanup;
525 1.27 christos }
526 1.27 christos
527 1.27 christos msize = (size_t)st.st_size;
528 1.27 christos if (msize < sizeof(*hdr)) {
529 1.27 christos warnx("%s: File too short", _PATH_LD_HINTS);
530 1.27 christos goto cleanup;
531 1.1 pk }
532 1.1 pk
533 1.26 thorpej addr = mmap(0, msize, PROT_READ, MAP_FILE|MAP_PRIVATE, fd, 0);
534 1.1 pk
535 1.27 christos if (addr == (void *)-1) {
536 1.9 pk warn("%s", _PATH_LD_HINTS);
537 1.27 christos goto cleanup;
538 1.1 pk }
539 1.1 pk
540 1.1 pk hdr = (struct hints_header *)addr;
541 1.1 pk if (HH_BADMAG(*hdr)) {
542 1.21 pk warnx("%s: Bad magic: %lo",
543 1.27 christos _PATH_LD_HINTS, hdr->hh_magic);
544 1.27 christos goto cleanup;
545 1.1 pk }
546 1.1 pk
547 1.13 pk if (hdr->hh_version != LD_HINTS_VERSION_2) {
548 1.21 pk warnx("Unsupported version: %ld", hdr->hh_version);
549 1.27 christos goto cleanup;
550 1.1 pk }
551 1.1 pk
552 1.1 pk
553 1.27 christos blist = (struct hints_bucket *)((char *)addr + hdr->hh_hashtab);
554 1.27 christos strtab = ((char *)addr + hdr->hh_strtab);
555 1.1 pk
556 1.1 pk for (i = 0; i < hdr->hh_nbucket; i++) {
557 1.1 pk struct hints_bucket *bp = &blist[i];
558 1.1 pk
559 1.1 pk /* Sanity check */
560 1.1 pk if (bp->hi_namex >= hdr->hh_strtab_sz) {
561 1.9 pk warnx("Bad name index: %#x", bp->hi_namex);
562 1.27 christos goto cleanup;
563 1.1 pk }
564 1.1 pk if (bp->hi_pathx >= hdr->hh_strtab_sz) {
565 1.9 pk warnx("Bad path index: %#x", bp->hi_pathx);
566 1.27 christos goto cleanup;
567 1.1 pk }
568 1.1 pk
569 1.9 pk /* Allocate new list element */
570 1.9 pk shp = (struct shlib_list *)xmalloc(sizeof *shp);
571 1.9 pk shp->name = strdup(strtab + bp->hi_namex);
572 1.9 pk shp->path = strdup(strtab + bp->hi_pathx);
573 1.27 christos memcpy(shp->dewey, bp->hi_dewey, sizeof(shp->dewey));
574 1.9 pk shp->ndewey = bp->hi_ndewey;
575 1.9 pk shp->next = NULL;
576 1.9 pk
577 1.9 pk *shlib_tail = shp;
578 1.9 pk shlib_tail = &shp->next;
579 1.1 pk }
580 1.13 pk dir_list = strdup(strtab + hdr->hh_dirlist);
581 1.27 christos goto done;
582 1.27 christos cleanup:
583 1.27 christos error = 1;
584 1.27 christos done:
585 1.27 christos if (fd != -1)
586 1.27 christos close(fd);
587 1.27 christos if (addr != (void *)-1)
588 1.27 christos munmap(addr, msize);
589 1.27 christos return error;
590 1.1 pk
591 1.1 pk }
592 1.1 pk
593 1.9 pk static void
594 1.9 pk listhints()
595 1.9 pk {
596 1.9 pk struct shlib_list *shp;
597 1.9 pk int i;
598 1.9 pk
599 1.9 pk printf("%s:\n", _PATH_LD_HINTS);
600 1.13 pk printf("\tsearch directories: %s\n", dir_list);
601 1.9 pk
602 1.9 pk for (i = 0, shp = shlib_head; shp; i++, shp = shp->next)
603 1.9 pk printf("\t%d:-l%s.%d.%d => %s\n",
604 1.9 pk i, shp->name, shp->major, shp->minor, shp->path);
605 1.9 pk
606 1.9 pk return;
607 1.9 pk }
608