/** * \file lib/rpmps.c */ #include "system.h" #include #include #include "debug.h" /** */ struct rpmProblem_s { char * pkgNEVR; char * altNEVR; fnpyKey key; rpmProblemType type; int ignoreProblem; char * str1; unsigned long ulong1; }; /** */ struct rpmps_s { int numProblems; /*!< Current probs array size. */ int numProblemsAlloced; /*!< Allocated probs array size. */ rpmProblem *probs; /*!< Array of pointers to specific problems. */ int nrefs; /*!< Reference count. */ }; struct rpmpsi_s { int ix; rpmps ps; }; int _rpmps_debug = 0; rpmps rpmpsUnlink(rpmps ps, const char * msg) { if (_rpmps_debug > 0 && msg != NULL) fprintf(stderr, "--> ps %p -- %d %s\n", ps, ps->nrefs, msg); ps->nrefs--; return ps; } rpmps rpmpsLink(rpmps ps, const char * msg) { ps->nrefs++; if (_rpmps_debug > 0 && msg != NULL) fprintf(stderr, "--> ps %p ++ %d %s\n", ps, ps->nrefs, msg); return ps; } int rpmpsNumProblems(rpmps ps) { int numProblems = 0; if (ps && ps->probs) numProblems = ps->numProblems; return numProblems; } rpmpsi rpmpsInitIterator(rpmps ps) { rpmpsi psi = NULL; if (ps != NULL) { psi = xcalloc(1, sizeof(*psi)); psi->ps = rpmpsLink(ps, RPMDBG_M("rpmpsInitIterator")); psi->ix = -1; } return psi; } rpmpsi rpmpsFreeIterator(rpmpsi psi) { if (psi != NULL) { rpmpsUnlink(psi->ps, RPMDBG_M("rpmpsFreeIterator")); free(psi); psi = NULL; } return psi; } int rpmpsNextIterator(rpmpsi psi) { int i = -1; if (psi != NULL && ++psi->ix >= 0) { if (psi->ix < rpmpsNumProblems(psi->ps)) { i = psi->ix; } else { psi->ix = -1; } } return i; } rpmProblem rpmpsGetProblem(rpmpsi psi) { rpmProblem *p = NULL; if (psi != NULL && psi->ix >= 0 && psi->ix < rpmpsNumProblems(psi->ps)) { p = psi->ps->probs + psi->ix; } return *p; } rpmps rpmpsCreate(void) { rpmps ps = xcalloc(1, sizeof(*ps)); return rpmpsLink(ps, RPMDBG_M("rpmpsCreate")); } rpmps rpmpsFree(rpmps ps) { if (ps == NULL) return NULL; ps = rpmpsUnlink(ps, RPMDBG_M("rpmpsFree")); if (ps->nrefs > 0) return NULL; if (ps->probs) { rpmpsi psi = rpmpsInitIterator(ps); while (rpmpsNextIterator(psi) >= 0) { rpmProblemFree(rpmpsGetProblem(psi)); } rpmpsFreeIterator(psi); ps->probs = _free(ps->probs); } ps = _free(ps); return NULL; } void rpmpsAppendProblem(rpmps ps, rpmProblem prob) { rpmProblem *p = NULL; if (ps == NULL) return; if (ps->numProblems == ps->numProblemsAlloced) { if (ps->numProblemsAlloced) ps->numProblemsAlloced *= 2; else ps->numProblemsAlloced = 2; ps->probs = xrealloc(ps->probs, ps->numProblemsAlloced * sizeof(ps->probs)); } p = ps->probs + ps->numProblems; ps->numProblems++; *p = prob; } void rpmpsAppend(rpmps ps, rpmProblemType type, const char * pkgNEVR, fnpyKey key, const char * dn, const char * bn, const char * altNEVR, unsigned long ulong1) { rpmProblem p = NULL; if (ps == NULL) return; p = rpmProblemCreate(type, pkgNEVR, key, dn, bn, altNEVR, ulong1); rpmpsAppendProblem(ps, p); } #define XSTRCMP(a, b) ((!(a) && !(b)) || ((a) && (b) && !strcmp((a), (b)))) /* XXX TODO: implement with iterators */ int rpmpsTrim(rpmps ps, rpmps filter) { rpmProblem *t; rpmProblem *f; int gotProblems = 0; if (ps == NULL || ps->numProblems == 0) return 0; if (filter == NULL) return (ps->numProblems == 0 ? 0 : 1); t = ps->probs; f = filter->probs; while ((f - filter->probs) < filter->numProblems) { if (!(*f)->ignoreProblem) { f++; continue; } while ((t - ps->probs) < ps->numProblems) { /* LCL: looks good to me */ if ((*f)->type == (*t)->type && (*t)->key == (*f)->key && XSTRCMP((*f)->str1, (*t)->str1)) break; t++; gotProblems = 1; } /* XXX This can't happen, but let's be sane in case it does. */ if ((t - ps->probs) == ps->numProblems) break; (*t)->ignoreProblem = (*f)->ignoreProblem; t++, f++; } if ((t - ps->probs) < ps->numProblems) gotProblems = 1; return gotProblems; } rpmProblem rpmProblemCreate(rpmProblemType type, const char * pkgNEVR, fnpyKey key, const char * dn, const char * bn, const char * altNEVR, unsigned long ulong1) { rpmProblem p = xcalloc(1, sizeof(*p)); char *t; p->type = type; p->key = key; p->ulong1 = ulong1; p->ignoreProblem = 0; p->pkgNEVR = (pkgNEVR ? xstrdup(pkgNEVR) : NULL); p->altNEVR = (altNEVR ? xstrdup(altNEVR) : NULL); p->str1 = NULL; if (dn != NULL || bn != NULL) { t = xcalloc(1, (dn != NULL ? strlen(dn) : 0) + (bn != NULL ? strlen(bn) : 0) + 1); p->str1 = t; if (dn != NULL) t = stpcpy(t, dn); if (bn != NULL) t = stpcpy(t, bn); } return p; } rpmProblem rpmProblemFree(rpmProblem prob) { prob->pkgNEVR = _free(prob->pkgNEVR); prob->altNEVR = _free(prob->altNEVR); prob->str1 = _free(prob->str1); prob = _free(prob); return NULL; } const char * rpmProblemGetPkgNEVR(const rpmProblem p) { return (p->pkgNEVR); } const char * rpmProblemGetAltNEVR(const rpmProblem p) { return (p->altNEVR); } fnpyKey rpmProblemGetKey(const rpmProblem p) { return (p->key); } rpmProblemType rpmProblemGetType(const rpmProblem p) { return (p->type); } const char * rpmProblemGetStr(const rpmProblem p) { return (p->str1); } unsigned long rpmProblemGetLong(const rpmProblem p) { return (p->ulong1); } char * rpmProblemString(const rpmProblem prob) { const char * pkgNEVR = (prob->pkgNEVR ? prob->pkgNEVR : "?pkgNEVR?"); const char * altNEVR = (prob->altNEVR ? prob->altNEVR : "? ?altNEVR?"); const char * str1 = (prob->str1 ? prob->str1 : N_("different")); char * buf = NULL; int rc; switch (prob->type) { case RPMPROB_BADARCH: rc = rasprintf(&buf, _("package %s is intended for a %s architecture"), pkgNEVR, str1); break; case RPMPROB_BADOS: rc = rasprintf(&buf, _("package %s is intended for a %s operating system"), pkgNEVR, str1); break; case RPMPROB_PKG_INSTALLED: rc = rasprintf(&buf, _("package %s is already installed"), pkgNEVR); break; case RPMPROB_BADRELOCATE: rc = rasprintf(&buf, _("path %s in package %s is not relocatable"), str1, pkgNEVR); break; case RPMPROB_NEW_FILE_CONFLICT: rc = rasprintf(&buf, _("file %s conflicts between attempted installs of %s and %s"), str1, pkgNEVR, altNEVR); break; case RPMPROB_FILE_CONFLICT: rc = rasprintf(&buf, _("file %s from install of %s conflicts with file from package %s"), str1, pkgNEVR, altNEVR); break; case RPMPROB_OLDPACKAGE: rc = rasprintf(&buf, _("package %s (which is newer than %s) is already installed"), altNEVR, pkgNEVR); break; case RPMPROB_DISKSPACE: rc = rasprintf(&buf, _("installing package %s needs %ld%cB on the %s filesystem"), pkgNEVR, prob->ulong1 > (1024*1024) ? (prob->ulong1 + 1024 * 1024 - 1) / (1024 * 1024) : (prob->ulong1 + 1023) / 1024, prob->ulong1 > (1024*1024) ? 'M' : 'K', str1); break; case RPMPROB_DISKNODES: rc = rasprintf(&buf, _("installing package %s needs %ld inodes on the %s filesystem"), pkgNEVR, (long)prob->ulong1, str1); break; case RPMPROB_REQUIRES: rc = rasprintf(&buf, _("%s is needed by %s%s"), altNEVR+2, (prob->ulong1 ? "" : _("(installed) ")), pkgNEVR); break; case RPMPROB_CONFLICT: rc = rasprintf(&buf, _("%s conflicts with %s%s"), altNEVR+2, (prob->ulong1 ? "" : _("(installed) ")), pkgNEVR); break; default: rc = rasprintf(&buf, _("unknown error %d encountered while manipulating package %s"), prob->type, pkgNEVR); break; } return buf; } static int sameProblem(const rpmProblem ap, const rpmProblem bp) { if (ap->type != bp->type) return 1; if (ap->pkgNEVR) if (bp->pkgNEVR && strcmp(ap->pkgNEVR, bp->pkgNEVR)) return 1; if (ap->altNEVR) if (bp->altNEVR && strcmp(ap->altNEVR, bp->altNEVR)) return 1; if (ap->str1) if (bp->str1 && strcmp(ap->str1, bp->str1)) return 1; if (ap->ulong1 != bp->ulong1) return 1; return 0; } void rpmpsPrint(FILE *fp, rpmps ps) { char * msg = NULL; rpmpsi psi = NULL; int i; if (ps == NULL || ps->probs == NULL || ps->numProblems <= 0) return; if (fp == NULL) fp = stderr; psi = rpmpsInitIterator(ps); while ((i = rpmpsNextIterator(psi)) >= 0) { int j; rpmProblem p = rpmpsGetProblem(psi); if (p->ignoreProblem) continue; rpmpsi psif = rpmpsInitIterator(ps); /* Filter already displayed problems. */ while ((j = rpmpsNextIterator(psif)) < i) { if (!sameProblem(p, rpmpsGetProblem(psif))) break; } rpmpsFreeIterator(psif); if (j < i) continue; msg = rpmProblemString(p); fprintf(fp, "\t%s\n", msg); msg = _free(msg); } psi = rpmpsFreeIterator(psi); }