/* $NetBSD: dewey.c,v 1.1.1.3 2009/03/08 14:51:37 joerg Exp $ */ /* * Copyright © 2002 Alistair G. Crooks. 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. 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 #include #define _BSD_SOURCE #include #undef _BSD_SOURCE #include #include #include "xbps_api_impl.h" #define PKG_PATTERN_MAX 1024 #ifndef MIN #define MIN(a,b) (((a) < (b)) ? (a) : (b)) #endif #ifndef MAX #define MAX(a,b) (((a) > (b)) ? (a) : (b)) #endif enum { DEWEY_LT, DEWEY_LE, DEWEY_EQ, DEWEY_GE, DEWEY_GT, DEWEY_NE }; /* do not modify these values, or things will NOT work */ enum { Alpha = -3, Beta = -2, 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 */ int *v; /* array of decimal numbers */ int revision; /* any "_" 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; /* the tests that are recognised. */ const test_t tests[] = { { "<=", 2, DEWEY_LE }, { "<", 1, DEWEY_LT }, { ">=", 2, DEWEY_GE }, { ">", 1, DEWEY_GT }, { "==", 2, DEWEY_EQ }, { "!=", 2, DEWEY_NE }, { NULL, 0, 0 } }; const test_t modifiers[] = { { "alpha", 5, Alpha }, { "beta", 4, Beta }, { "pre", 3, RC }, { "rc", 2, RC }, { "pl", 2, Dot }, { ".", 1, Dot }, { NULL, 0, 0 } }; /* locate the test in the tests array */ static int dewey_mktest(int *op, const char *test) { const test_t *tp; for (tp = tests ; tp->s ; tp++) { if (strncasecmp(test, tp->s, tp->len) == 0) { *op = tp->t; return tp->len; } } return -1; } /* * make a component of a version number. * '.' encodes as Dot which is '0' * 'pl' encodes as 'patch level', or 'Dot', which is 0. * 'alpha' encodes as 'alpha version', or Alpha, which is -3. * 'beta' encodes as 'beta version', or Beta, which is -2. * 'rc' encodes as 'release candidate', or RC, which is -1. * '_' encodes as 'xbps revision', which is used after all other tests */ static int mkcomponent(arr_t *ap, const char *num) { static const char alphas[] = "abcdefghijklmnopqrstuvwxyz"; const test_t *modp; int n; const char *cp; if (ap->c == ap->size) { if (ap->size == 0) { ap->size = 62; ap->v = malloc(ap->size * sizeof(int)); assert(ap->v != NULL); } else { ap->size *= 2; ap->v = realloc(ap->v, ap->size * sizeof(int)); assert(ap->v != NULL); } } if (isdigit((unsigned char)*num)) { for (cp = num, n = 0 ; isdigit((unsigned char)*num) ; num++) { n = (n * 10) + (*num - '0'); } ap->v[ap->c++] = n; return (int)(num - cp); } for (modp = modifiers ; modp->s ; modp++) { if (strncasecmp(num, modp->s, modp->len) == 0) { ap->v[ap->c++] = modp->t; return modp->len; } } if (strncasecmp(num, "_", 1) == 0) { for (cp = num, num += 1, n = 0 ; isdigit((unsigned char)*num) ; num++) { n = (n * 10) + (*num - '0'); } ap->revision = n; return (int)(num - cp); } if (isalpha((unsigned char)*num)) { ap->v[ap->c++] = Dot; cp = strchr(alphas, tolower((unsigned char)*num)); if (ap->c == ap->size) { ap->size *= 2; ap->v = realloc(ap->v, ap->size * sizeof(int)); assert(ap->v != NULL); } ap->v[ap->c++] = (int)(cp - alphas) + 1; return 1; } return 1; } /* make a version number string into an array of comparable ints */ static int mkversion(arr_t *ap, const char *num) { ap->c = 0; ap->size = 0; ap->v = NULL; ap->revision = 0; while (*num) { num += mkcomponent(ap, num); } return 1; } static void freeversion(arr_t *ap) { free(ap->v); ap->v = NULL; ap->c = 0; ap->size = 0; } #define DIGIT(v, c, n) (((n) < (c)) ? v[n] : 0) /* compare the result against the test we were expecting */ static int result(int cmp, int tst) { switch(tst) { case DEWEY_LT: return cmp < 0; case DEWEY_LE: return cmp <= 0; case DEWEY_GT: return cmp > 0; case DEWEY_GE: return cmp >= 0; case DEWEY_EQ: return cmp == 0; case DEWEY_NE: return cmp != 0; default: return 0; } } /* do the test on the 2 vectors */ static int vtest(arr_t *lhs, int tst, arr_t *rhs) { int cmp; unsigned int c, 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->revision - rhs->revision, tst); } /* * Compare two dewey decimal numbers. */ static int dewey_cmp(const char *lhs, int op, const char *rhs) { arr_t right; arr_t left; int retval; if (!mkversion(&left, lhs)) return 0; if (!mkversion(&right, rhs)) { freeversion(&left); return 0; } retval = vtest(&left, op, &right); freeversion(&left); freeversion(&right); return retval; } /* * Returns -1, 0 or 1 depending on if the version components of * pkg1 is less than, equal to or greater than pkg2. No comparison * comparison of the basenames is done. */ int xbps_cmpver(const char *pkg1, const char *pkg2) { if (dewey_cmp(pkg1, DEWEY_LT, pkg2)) return -1; else if (dewey_cmp(pkg1, DEWEY_GT, pkg2)) return 1; else return 0; } /* * Perform dewey match on "pkg" against "pattern". * Return 1 on match, 0 on non-match, -1 on error. */ int HIDDEN dewey_match(const char *pattern, const char *pkg) { const char *version; const char *sep, *sep2; int op, op2; int n; /* compare names */ if ((version=strrchr(pkg, '-')) == NULL) { return 0; } if ((sep = strpbrk(pattern, "<>")) == NULL) return -1; /* compare name lengths */ if ((sep-pattern != version-pkg) || strncmp(pkg, pattern, (size_t)(version-pkg)) != 0) return 0; version++; /* extract comparison operator */ if ((n = dewey_mktest(&op, sep)) < 0) { return 0; } /* skip operator */ sep += n; /* if greater than, look for less than */ sep2 = NULL; if (op == DEWEY_GT || op == DEWEY_GE) { if ((sep2 = strchr(sep, '<')) != NULL) { if ((n = dewey_mktest(&op2, sep2)) < 0) { return 0; } /* compare upper limit */ if (!dewey_cmp(version, op2, sep2+n)) return 0; } } /* compare only pattern / lower limit */ if (sep2) { char ver[PKG_PATTERN_MAX]; strlcpy(ver, sep, MIN((ssize_t)sizeof(ver), sep2-sep+1)); if (dewey_cmp(version, op, ver)) return 1; } else { if (dewey_cmp(version, op, sep)) return 1; } return 0; }