NetBSD/usr.sbin/pkg_install/lib/str.c

597 lines
13 KiB
C

/* $NetBSD: str.c,v 1.32 2002/01/09 16:17:08 agc Exp $ */
#include <sys/cdefs.h>
#ifndef lint
#if 0
static const char *rcsid = "Id: str.c,v 1.5 1997/10/08 07:48:21 charnier Exp";
#else
__RCSID("$NetBSD: str.c,v 1.32 2002/01/09 16:17:08 agc Exp $");
#endif
#endif
/*
* FreeBSD install - a package for the installation and maintainance
* of non-core utilities.
*
* 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.
*
* Jordan K. Hubbard
* 18 July 1993
*
* Miscellaneous string utilities.
*
*/
#include <assert.h>
#include <err.h>
#include <fnmatch.h>
#include "lib.h"
/*
* Return the filename portion of a path
*/
char *
basename_of(char *str)
{
char *slash;
return ((slash = strrchr(str, '/')) == (char *) NULL) ? str : slash + 1;
}
/*
* Return the dirname portion of a path
*/
char *
dirname_of(const char *path)
{
size_t cc;
char *s;
char *t;
if ((s = strrchr(path, '/')) == NULL) {
return ".";
}
if (s == path) {
/* "/foo" -> return "/" */
return "/";
}
cc = (size_t) (s - path);
if ((t = (char *) malloc(cc + 1)) == (char *) NULL) {
errx(1, "out of memory in dirname_of");
}
(void) memcpy(t, path, cc);
t[cc] = 0;
return t;
}
/*
* Get a string parameter as a file spec or as a "contents follow -" spec
*/
char *
get_dash_string(char **s)
{
return *s = (**s == '-') ? strdup(*s + 1) : fileGetContents(*s);
}
/*
* Lowercase a whole string
*/
void
str_lowercase(char *s)
{
for (; *s; s++) {
*s = tolower(*s);
}
}
/* pull in definitions and macros for resizing arrays as we go */
#include "defs.h"
/* do not modify these values, or things will NOT work */
enum {
RC = -1,
Dot = 0,
Patch = 1
};
/* this struct defines a version number */
typedef struct arr_t {
unsigned c; /* # of version numbers */
unsigned size; /* size of array */
int64_t *v; /* array of decimal numbers */
int64_t netbsd; /* any "nb" suffix */
} arr_t;
/* this struct describes a test */
typedef struct test_t {
const char *s; /* string representation */
unsigned len; /* length of string */
int t; /* enumerated type of test */
} test_t;
enum {
LT,
LE,
EQ,
GE,
GT,
NE
};
/* the tests that are recognised. */
static test_t tests[] = {
{ "<=", 2, LE },
{ "<", 1, LT },
{ ">=", 2, GE },
{ ">", 1, GT },
{ "==", 2, EQ },
{ "!=", 2, NE },
{ NULL, 0, 0 }
};
/* locate the test in the tests array */
static int
mktest(int *op, char *test)
{
test_t *tp;
for (tp = tests ; tp->s ; tp++) {
if (strncasecmp(test, tp->s, tp->len) == 0) {
*op = tp->t;
return tp->len;
}
}
warnx("relational tets not found `%.10s'", test);
return -1;
}
/*
* make a component of a version number.
* '.' encodes as Dot which is '0'
* '_' encodes as 'patch level', or 'Dot', which is 0.
* 'pl' encodes as 'patch level', or 'Dot', which is 0.
* 'rc' encodes as 'release candidate', or RC, which is -1.
* 'nb' encodes as 'netbsd version', which is used after all other tests
*/
static int
mkcomponent(arr_t *ap, char *num)
{
static const char alphas[] = "abcdefghijklmnopqrstuvwxyz";
int64_t n;
char *cp;
if (*num == 0) {
return 0;
}
ALLOC(int64_t, ap->v, ap->size, ap->c, 62, "mkver", exit(EXIT_FAILURE));
if (*num == '_') {
num += 1;
if (isdigit(*(num + 1))) {
ap->v[ap->c++] = Dot;
return 1;
}
}
if (isdigit(*num)) {
for (cp = num, n = 0 ; isdigit(*num) ; num++) {
n = (n * 10) + (*num - '0');
}
ap->v[ap->c++] = n;
return (int)(num - cp);
}
if (strncasecmp(num, "rc", 2) == 0) {
ap->v[ap->c++] = RC;
return 2;
}
if (strncasecmp(num, "pl", 2) == 0) {
ap->v[ap->c++] = Dot;
return 2;
}
if (strncasecmp(num, "nb", 2) == 0) {
for (cp = num, num += 2, n = 0 ; isdigit(*num) ; num++) {
n = (n * 10) + (*num - '0');
}
ap->netbsd = n;
return (int)(num - cp);
}
if (*num == '.') {
ap->v[ap->c++] = Dot;
return 1;
}
if (isalpha(*num)) {
ap->v[ap->c++] = Dot;
cp = strchr(alphas, tolower(*num));
ALLOC(int64_t, ap->v, ap->size, ap->c, 62, "mkver", exit(EXIT_FAILURE));
ap->v[ap->c++] = (int64_t)(cp - alphas) + 1;
return 1;
}
warnx("`%c' not recognised", *num);
return 1;
}
/* make a version number string into an array of comparable 64bit ints */
static int
mkversion(arr_t *ap, char *num)
{
(void) memset(ap, 0, sizeof(arr_t));
while (*num) {
num += mkcomponent(ap, num);
}
return 1;
}
#define DIGIT(v, c, n) (((n) < (c)) ? v[n] : 0)
/* compare the result against the test we were expecting */
static int
result(int64_t cmp, int tst)
{
switch(tst) {
case LT:
return cmp < 0;
case LE:
return cmp <= 0;
case GT:
return cmp > 0;
case GE:
return cmp >= 0;
case EQ:
return cmp == 0;
case NE:
return cmp != 0;
default:
warnx("result: unknown test %d", tst);
return 0;
}
}
/* do the test on the 2 vectors */
static int
vtest(arr_t *lhs, int tst, arr_t *rhs)
{
int64_t cmp;
int c;
int i;
for (i = 0, c = MAX(lhs->c, rhs->c) ; i < c ; i++) {
if ((cmp = DIGIT(lhs->v, lhs->c, i) - DIGIT(rhs->v, rhs->c, i)) != 0) {
return result(cmp, tst);
}
}
return result(lhs->netbsd - rhs->netbsd, tst);
}
/*
* Compare two dewey decimal numbers
*/
static int
deweycmp(char *lhs, int op, char *rhs)
{
arr_t right;
arr_t left;
(void) memset(&left, 0, sizeof(left));
if (!mkversion(&left, lhs)) {
warnx("Bad lhs version `%s'", lhs);
return 0;
}
(void) memset(&right, 0, sizeof(right));
if (!mkversion(&right, rhs)) {
warnx("Bad rhs version `%s'", rhs);
return 0;
}
return vtest(&left, op, &right);
}
/*
* Perform alternate match on "pkg" against "pattern",
* calling pmatch (recursively) to resolve any other patterns.
* Return 1 on match, 0 otherwise
*/
static int
alternate_match(const char *pattern, const char *pkg)
{
char *sep;
char buf[FILENAME_MAX];
char *last;
char *alt;
char *cp;
int cnt;
int found;
if ((sep = strchr(pattern, '{')) == (char *) NULL) {
errx(1, "alternate_match(): '{' expected in `%s'", pattern);
}
(void) strncpy(buf, pattern, (size_t) (sep - pattern));
alt = &buf[sep - pattern];
last = (char *) NULL;
for (cnt = 0, cp = sep; *cp && last == (char *) NULL; cp++) {
if (*cp == '{') {
cnt++;
} else if (*cp == '}' && --cnt == 0 && last == (char *) NULL) {
last = cp + 1;
}
}
if (cnt != 0) {
errx(1, "Malformed alternate `%s'", pattern);
}
for (found = 0, cp = sep + 1; *sep != '}'; cp = sep + 1) {
for (cnt = 0, sep = cp; cnt > 0 || (cnt == 0 && *sep != '}' && *sep != ','); sep++) {
if (*sep == '{') {
cnt++;
} else if (*sep == '}') {
cnt--;
}
}
(void) snprintf(alt, sizeof(buf) - (alt - buf), "%.*s%s", (int) (sep - cp), cp, last);
if (pmatch(buf, pkg) == 1) {
found = 1;
}
}
return found;
}
/*
* Perform dewey match on "pkg" against "pattern".
* Return 1 on match, 0 otherwise
*/
static int
dewey_match(const char *pattern, const char *pkg)
{
char *cp;
char *sep;
char *ver;
char name[FILENAME_MAX];
int op;
int n;
if ((sep = strpbrk(pattern, "<>")) == NULL) {
errx(1, "dewey_match(): '<' or '>' expected in `%s'", pattern);
}
(void) snprintf(name, sizeof(name), "%.*s", (int) (sep - pattern), pattern);
if ((n = mktest(&op, sep)) < 0) {
warnx("Bad comparison `%s'", sep);
return 0;
}
ver = sep + n;
n = (int) (sep - pattern);
if ((cp = strrchr(pkg, '-')) != (char *) NULL) {
if (strncmp(pkg, name, (size_t) (cp - pkg)) == 0 &&
n == (int)(cp - pkg)) {
if (deweycmp(cp + 1, op, ver)) {
return 1;
}
}
}
return 0;
}
/*
* Perform glob match on "pkg" against "pattern".
* Return 1 on match, 0 otherwise
*/
static int
glob_match(const char *pattern, const char *pkg)
{
return fnmatch(pattern, pkg, FNM_PERIOD) == 0;
}
/*
* Perform simple match on "pkg" against "pattern".
* Return 1 on match, 0 otherwise
*/
static int
simple_match(const char *pattern, const char *pkg)
{
return strcmp(pattern, pkg) == 0;
}
/*
* Match pkg against pattern, return 1 if matching, 0 else
*/
int
pmatch(const char *pattern, const char *pkg)
{
if (strchr(pattern, '{') != (char *) NULL) {
/* emulate csh-type alternates */
return alternate_match(pattern, pkg);
}
if (strpbrk(pattern, "<>") != (char *) NULL) {
/* perform relational dewey match on version number */
return dewey_match(pattern, pkg);
}
if (strpbrk(pattern, "*?[]") != (char *) NULL) {
/* glob match */
return glob_match(pattern, pkg);
}
/* no alternate, dewey or glob match -> simple compare */
return simple_match(pattern, pkg);
}
/*
* Search dir for pattern, calling match(pkg_found, data) for every match.
* Returns -1 on error, 1 if found, 0 otherwise.
*/
int
findmatchingname(const char *dir, const char *pattern, matchfn match, char *data)
{
struct dirent *dp;
char tmp_pattern[256];
DIR *dirp;
int found;
char pat_sfx[256], file_sfx[256]; /* suffixes */
found = 0;
if ((dirp = opendir(dir)) == (DIR *) NULL) {
/* warnx("can't opendir dir '%s'", dir); */
return -1;
}
/* chop any possible suffix off of 'pattern' and
* store it in pat_sfx
*/
strip_txz(tmp_pattern, pat_sfx, pattern);
while ((dp = readdir(dirp)) != (struct dirent *) NULL) {
char tmp_file[FILENAME_MAX];
if (strcmp(dp->d_name, ".") == 0 ||
strcmp(dp->d_name, "..") == 0)
continue;
/* chop any possible suffix off of 'tmp_file' and
* store it in file_sfx
*/
strip_txz(tmp_file, file_sfx, dp->d_name);
/* we need to match pattern and suffix separately, in case
* each is a different pattern class (e.g. dewey and
* character class (.t[bg]z)) */
if (pmatch(tmp_pattern, tmp_file)
&& pmatch(pat_sfx, file_sfx)) {
if (match) {
match(dp->d_name, data);
/* return value ignored for now */
}
found = 1;
}
}
(void) closedir(dirp);
return found;
}
/*
* Does the pkgname contain any of the special chars ("{[]?*<>")?
* If so, return 1, else 0
*/
int
ispkgpattern(const char *pkg)
{
return strpbrk(pkg, "<>[]?*{") != NULL;
}
/*
* Auxiliary function called by findbestmatchingname() if pkg > data
* Also called for FTP matching
*/
int
findbestmatchingname_fn(const char *found, char *best)
{
char *found_version, *best_version;
char found_no_sfx[255];
char best_no_sfx[255];
/* The same suffix-hack-off again, but we can't do it
* otherwise without changing the function call interface
*/
found_version = strrchr(found, '-');
if (found_version) {
/* skip '-', if any version found */
found_version++;
}
strip_txz(found_no_sfx, NULL, found_version);
found_version = found_no_sfx;
best_version=NULL;
if (best && best[0] != '\0') {
best_version = strrchr(best, '-');
if (best_version) {
/* skip '-' if any version found */
best_version++;
}
strip_txz(best_no_sfx, NULL, best_version);
best_version = best_no_sfx;
}
if (found_version == NULL) {
fprintf(stderr, "'%s' is not a usable package(version)\n",
found);
} else {
/* if best_version==NULL only if best==NULL
* (or best[0]='\0') */
if (best == NULL || best[0] == '\0' || deweycmp(found_version, GT, best_version)) {
/* found pkg(version) is bigger than current "best"
* version - remember! */
strcpy(best, found);
}
}
return 0;
}
/*
* Find best matching filename, i.e. the pkg with the highest
* matching(!) version.
* Returns pointer to pkg name (which can be free(3)ed),
* or NULL if no match is available.
*/
char *
findbestmatchingname(const char *dir, const char *pattern)
{
char buf[FILENAME_MAX];
buf[0] = '\0';
if (findmatchingname(dir, pattern, findbestmatchingname_fn, buf) > 0
&& buf[0] != '\0') {
return strdup(buf);
}
return NULL;
}
/*
* Bounds-checking strncpy()
*/
char *
strnncpy(char *to, size_t tosize, char *from, size_t cc)
{
size_t len;
if ((len = cc) >= tosize - 1) {
len = tosize - 1;
}
(void) strncpy(to, from, len);
to[len] = 0;
return to;
}
/*
* Strip off any .tgz, .tbz or .t[bg]z suffix from fname,
* and copy into buffer "buf", the suffix is stored in "sfx"
* if "sfx" is not NULL. If no suffix is found, "sfx" is set
* to an empty string.
*/
void
strip_txz(char *buf, char *sfx, const char *fname)
{
char *s;
strcpy(buf, fname);
if (sfx) sfx[0] = '\0';
s = strstr(buf, ".tgz");
if (s) {
*s = '\0'; /* strip off any ".tgz" */
if (sfx) strcpy(sfx, s - buf + fname);
}
s = strstr(buf, ".tbz");
if (s) {
*s = '\0'; /* strip off any ".tbz" */
if (sfx) strcpy(sfx, s - buf + fname);
}
s = strstr(buf, ".t[bg]z");
if (s) {
*s = '\0'; /* strip off any ".t[bg]z" */
if (sfx) strcpy(sfx, s - buf + fname);
}
}