/*      $OpenBSD: shlib.c,v 1.13 2018/04/26 12:42:50 guenther Exp $     */
/*      $NetBSD: shlib.c,v 1.13 1998/04/04 01:00:29 fvdl Exp $  */

/*
 * Copyright (c) 1993 Paul Kranenburg
 * All rights reserved.
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions
 * are met:
 * 1. Redistributions of source code must retain the above copyright
 *    notice, this list of conditions and the following disclaimer.
 * 2. Redistributions in binary form must reproduce the above copyright
 *    notice, this list of conditions and the following disclaimer in the
 *    documentation and/or other materials provided with the distribution.
 * 3. All advertising materials mentioning features or use of this software
 *    must display the following acknowledgement:
 *      This product includes software developed by Paul Kranenburg.
 * 4. The name of the author may not be used to endorse or promote products
 *    derived from this software without specific prior written permission
 *
 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 *
 */

#include <ctype.h>
#include <err.h>
#include <stdlib.h>
#include <string.h>

#include "ld.h"

/*
 * Standard directories to search for files specified by -l.
 */
#ifndef STANDARD_SEARCH_DIRS
#define STANDARD_SEARCH_DIRS    "/usr/lib"
#endif

/*
 * Actual vector of library search directories,
 * including `-L'ed and LD_LIBRARY_PATH spec'd ones.
 */
char     **search_dirs;
int     n_search_dirs;

char    *standard_search_dirs[] = {
        STANDARD_SEARCH_DIRS
};

void
add_search_dir(char *name)
{
        size_t len;
        int i;

        len = strlen(name);

        while (len > 1 && name[len - 1] == '/')
                --len;

        for (i = 0; i < n_search_dirs; i++)
                if (strlen(search_dirs[i]) == len &&
                    !strncmp(search_dirs[i], name, len))
                                return;
        n_search_dirs++;
        search_dirs = xrealloc(search_dirs,
            n_search_dirs * sizeof search_dirs[0]);
        search_dirs[n_search_dirs - 1] = xmalloc(++len);
        (void)strlcpy(search_dirs[n_search_dirs - 1], name, len);
}

void
remove_search_dir(char *name)
{
        size_t  len;
        int     i;

        len = strlen(name);

        while (len > 1 && name[len - 1] == '/')
                --len;

        for (i = 0; i < n_search_dirs; i++) {
                if (strlen(search_dirs[i]) != len ||
                    strncmp(search_dirs[i], name, len))
                        continue;
                free(search_dirs[i]);
                if (i < (n_search_dirs - 1))
                        bcopy(&search_dirs[i+1], &search_dirs[i],
                            (n_search_dirs - i - 1) * sizeof search_dirs[0]);
                n_search_dirs--;
                search_dirs = xrealloc(search_dirs,
                    n_search_dirs * sizeof search_dirs[0]);
                break;
        }
}

void
add_search_path(char *path)
{
        char    *cp, *dup;

        if (path == NULL)
                return;

        /* Add search directories from `path' */
        path = dup = strdup(path);
        while ((cp = strsep(&path, ":")) != NULL)
                add_search_dir(cp);
        free(dup);
}

void
std_search_path(void)
{
        int     i, n;

        /* Append standard search directories */
        n = sizeof standard_search_dirs / sizeof standard_search_dirs[0];
        for (i = 0; i < n; i++)
                add_search_dir(standard_search_dirs[i]);
}

/*
 * Return true if CP points to a valid dewey number.
 * Decode and leave the result in the array DEWEY.
 * Return the number of decoded entries in DEWEY.
 */

int
getdewey(int dewey[], char *cp)
{
        int     i, n;

        for (n = 0, i = 0; i < MAXDEWEY; i++) {
                if (*cp == '\0')
                        break;

                if (*cp == '.') cp++;
#ifdef SUNOS_LIB_COMPAT
                if (!(isdigit)(*cp))
#else
                if (!isdigit(*cp))
#endif
                        return 0;

                dewey[n++] = strtol(cp, &cp, 10);
        }
        return n;
}

/*
 * Compare two dewey arrays.
 * Return -1 if `d1' represents a smaller value than `d2'.
 * Return  1 if `d1' represents a greater value than `d2'.
 * Return  0 if equal.
 */
int
cmpndewey(int d1[], int n1, int d2[], int n2)
{
        int     i;

        for (i = 0; i < n1 && i < n2; i++) {
                if (d1[i] < d2[i])
                        return -1;
                if (d1[i] > d2[i])
                        return 1;
        }
        if (n1 == n2)
                return 0;
        if (i == n1)
                return -1;
        if (i == n2)
                return 1;
        errx(1, "cmpndewey: cant happen");
        return 0;
}