2 * Copyright (c) 1993 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.
33 #include <sys/param.h>
34 #include <sys/types.h>
47 #include <sys/link_aout.h>
52 * Standard directories to search for files specified by -l.
54 #ifndef STANDARD_SEARCH_DIRS
55 #define STANDARD_SEARCH_DIRS "/usr/lib/aout"
59 * Actual vector of library search directories,
60 * including `-L'ed and LD_LIBRARY_PATH spec'd ones.
65 const char *standard_search_dirs[] = {
71 add_search_dir(const char *name)
75 for (n = 0; n < n_search_dirs; n++)
76 if (strcmp(search_dirs[n], name) == 0)
79 search_dirs = (char **)
80 xrealloc(search_dirs, n_search_dirs * sizeof search_dirs[0]);
81 search_dirs[n_search_dirs - 1] = strdup(name);
85 add_search_path(char *path)
87 register char *cp, *dup;
92 /* Add search directories from `path' */
93 path = dup = strdup(path);
94 while ((cp = strsep(&path, ":")) != NULL)
100 std_search_path(void)
104 /* Append standard search directories */
105 n = sizeof standard_search_dirs / sizeof standard_search_dirs[0];
106 for (i = 0; i < n; i++)
107 add_search_dir(standard_search_dirs[i]);
111 * Return true if CP points to a valid dewey number.
112 * Decode and leave the result in the array DEWEY.
113 * Return the number of decoded entries in DEWEY.
117 getdewey(int dewey[], char *cp)
121 for (n = 0, i = 0; i < MAXDEWEY; i++) {
125 if (*cp == '.') cp++;
129 dewey[n++] = strtol(cp, &cp, 10);
136 * Compare two dewey arrays.
137 * Return -1 if `d1' represents a smaller value than `d2'.
138 * Return 1 if `d1' represents a greater value than `d2'.
142 cmpndewey(int d1[], int n1, int d2[], int n2)
146 for (i = 0; i < n1 && i < n2; i++) {
162 errx(1, "cmpndewey: cant happen");
167 * Search directories for a shared library matching the given
168 * major and minor version numbers. See search_lib_dir() below for
169 * the detailed matching rules.
171 * As soon as a directory with an acceptable match is found, the search
172 * terminates. Subsequent directories are not searched for a better
173 * match. This is in conformance with the SunOS searching rules. Also,
174 * it avoids a lot of directory searches that are virtually guaranteed to
177 * The return value is a full pathname to the matching library. The
178 * string is dynamically allocated. If no matching library is found, the
179 * function returns NULL.
183 findshlib(char *name, int *majorp, int *minorp, int do_dot_a)
187 for (i = 0; i < n_search_dirs; i++) {
190 path = search_lib_dir(search_dirs[i], name, majorp, minorp,
200 * Search library directories for a file with the given name. The
201 * return value is a full pathname to the matching file. The string
202 * is dynamically allocated. If no matching file is found, the function
207 find_lib_file(const char *name)
211 for (i = 0; i < n_search_dirs; i++) {
212 char *path = concat(search_dirs[i], "/", name);
215 if (lstat(path, &sb) != -1) /* We found it */
225 * Search a given directory for a library (preferably shared) satisfying
226 * the given criteria.
228 * The matching rules are as follows:
231 * find the library with the highest major version;
233 * insist on a major version identical to *majorp;
235 * Always find the library with the highest minor version;
237 * insist on a minor version >= *minorp;
239 * It is invalid to specify a specific minor number while wildcarding
242 * The actual major and minor numbers found are returned via the pointer
245 * A suitable shared library is always preferred over a static (.a) library.
246 * If do_dot_a is false, then a static library will not be accepted in
249 * The return value is a full pathname to the matching library. The
250 * string is dynamically allocated. If no matching library is found, the
251 * function returns NULL.
255 search_lib_dir(char *dir, char *name, int *majorp, int *minorp, int do_dot_a)
260 int best_dewey[MAXDEWEY];
262 char dot_a_name[MAXNAMLEN+1];
263 char dot_so_name[MAXNAMLEN+1];
265 if((dd = opendir(dir)) == NULL)
268 namelen = strlen(name);
270 dot_a_name[0] = '\0';
271 dot_so_name[0] = '\0';
273 while((dp = readdir(dd)) != NULL) {
276 if(strlen(dp->d_name) < 3 + namelen + 2 || /* lib+xxx+.a */
277 strncmp(dp->d_name, "lib", 3) != 0 ||
278 strncmp(dp->d_name + 3, name, namelen) != 0 ||
279 dp->d_name[3+namelen] != '.')
282 extension = dp->d_name + 3 + namelen + 1; /* a or so.* */
284 if(strncmp(extension, "so.", 3) == 0) {
285 int cur_dewey[MAXDEWEY];
288 cur_ndewey = getdewey(cur_dewey, extension+3);
289 if(cur_ndewey < 2) /* Too few version numbers */
292 if(*majorp != -1) { /* Need exact match on major */
293 if(cur_dewey[0] != *majorp)
295 if(*minorp != -1) { /* Need minor >= minimum */
296 if(cur_dewey[1] < *minorp)
301 if(cmpndewey(cur_dewey, cur_ndewey, best_dewey,
302 best_ndewey) <= 0) /* No better than prior match */
305 /* We found a better match */
306 strcpy(dot_so_name, dp->d_name);
307 bcopy(cur_dewey, best_dewey,
308 cur_ndewey * sizeof best_dewey[0]);
309 best_ndewey = cur_ndewey;
310 } else if(do_dot_a && strcmp(extension, "a") == 0)
311 strcpy(dot_a_name, dp->d_name);
315 if(dot_so_name[0] != '\0') {
316 *majorp = best_dewey[0];
317 *minorp = best_dewey[1];
318 return concat(dir, "/", dot_so_name);
321 if(dot_a_name[0] != '\0')
322 return concat(dir, "/", dot_a_name);