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