1656 lines
38 KiB
C
1656 lines
38 KiB
C
/** \ingroup rpmdep
|
|
* \file lib/rpmts.c
|
|
* Routine(s) to handle a "rpmts" transaction sets.
|
|
*/
|
|
#include "system.h"
|
|
|
|
#include "rpmio_internal.h" /* XXX for pgp and beecrypt */
|
|
#include <rpmlib.h>
|
|
#include <rpmmacro.h> /* XXX rpmtsOpenDB() needs rpmGetPath */
|
|
|
|
#include "rpmdb.h"
|
|
|
|
#include "rpmal.h"
|
|
#include "rpmds.h"
|
|
#include "rpmfi.h"
|
|
#include "rpmlock.h"
|
|
|
|
#define _RPMTE_INTERNAL /* XXX te->h */
|
|
#include "rpmte.h"
|
|
|
|
#define _RPMTS_INTERNAL
|
|
#include "rpmts.h"
|
|
|
|
/* XXX FIXME: merge with existing (broken?) tests in system.h */
|
|
/* portability fiddles */
|
|
#if STATFS_IN_SYS_STATVFS
|
|
#include <sys/statvfs.h>
|
|
|
|
#else
|
|
# if STATFS_IN_SYS_VFS
|
|
# include <sys/vfs.h>
|
|
# else
|
|
# if STATFS_IN_SYS_MOUNT
|
|
# include <sys/mount.h>
|
|
# else
|
|
# if STATFS_IN_SYS_STATFS
|
|
# include <sys/statfs.h>
|
|
# endif
|
|
# endif
|
|
# endif
|
|
#endif
|
|
|
|
#include "debug.h"
|
|
|
|
int _rpmts_debug = 0;
|
|
|
|
int _rpmts_stats = 0;
|
|
|
|
char * hGetNEVR(Header h, const char ** np)
|
|
{
|
|
const char * n, * v, * r;
|
|
char * NVR, * t;
|
|
|
|
(void) headerNVR(h, &n, &v, &r);
|
|
NVR = t = xcalloc(1, strlen(n) + strlen(v) + strlen(r) + sizeof("--"));
|
|
t = stpcpy(t, n);
|
|
t = stpcpy(t, "-");
|
|
t = stpcpy(t, v);
|
|
t = stpcpy(t, "-");
|
|
t = stpcpy(t, r);
|
|
if (np)
|
|
*np = n;
|
|
return NVR;
|
|
}
|
|
|
|
char * hGetNEVRA(Header h, const char ** np)
|
|
{
|
|
const char * n, * v, * r, * a;
|
|
char * NVRA, * t;
|
|
int xx;
|
|
|
|
(void) headerNVR(h, &n, &v, &r);
|
|
xx = headerGetEntry(h, RPMTAG_ARCH, NULL, (void **) &a, NULL);
|
|
NVRA = t = xcalloc(1, strlen(n) + strlen(v) + strlen(r) + strlen(a) + sizeof("--."));
|
|
t = stpcpy(t, n);
|
|
t = stpcpy(t, "-");
|
|
t = stpcpy(t, v);
|
|
t = stpcpy(t, "-");
|
|
t = stpcpy(t, r);
|
|
t = stpcpy(t, ".");
|
|
t = stpcpy(t, a);
|
|
if (np)
|
|
*np = n;
|
|
return NVRA;
|
|
}
|
|
|
|
uint_32 hGetColor(Header h)
|
|
{
|
|
HGE_t hge = (HGE_t)headerGetEntryMinMemory;
|
|
uint_32 hcolor = 0;
|
|
uint_32 * fcolors;
|
|
int_32 ncolors;
|
|
int i;
|
|
|
|
fcolors = NULL;
|
|
ncolors = 0;
|
|
if (hge(h, RPMTAG_FILECOLORS, NULL, (void **)&fcolors, &ncolors)
|
|
&& fcolors != NULL && ncolors > 0)
|
|
{
|
|
for (i = 0; i < ncolors; i++)
|
|
hcolor |= fcolors[i];
|
|
}
|
|
hcolor &= 0x0f;
|
|
|
|
return hcolor;
|
|
}
|
|
|
|
rpmts XrpmtsUnlink(rpmts ts, const char * msg, const char * fn, unsigned ln)
|
|
{
|
|
if (_rpmts_debug)
|
|
fprintf(stderr, "--> ts %p -- %d %s at %s:%u\n", ts, ts->nrefs, msg, fn, ln);
|
|
ts->nrefs--;
|
|
return NULL;
|
|
}
|
|
|
|
rpmts XrpmtsLink(rpmts ts, const char * msg, const char * fn, unsigned ln)
|
|
{
|
|
ts->nrefs++;
|
|
if (_rpmts_debug)
|
|
fprintf(stderr, "--> ts %p ++ %d %s at %s:%u\n", ts, ts->nrefs, msg, fn, ln);
|
|
return ts;
|
|
}
|
|
|
|
int rpmtsCloseDB(rpmts ts)
|
|
{
|
|
int rc = 0;
|
|
|
|
if (ts->rdb != NULL) {
|
|
(void) rpmswAdd(rpmtsOp(ts, RPMTS_OP_DBGET),
|
|
rpmdbOp(ts->rdb, RPMDB_OP_DBGET));
|
|
(void) rpmswAdd(rpmtsOp(ts, RPMTS_OP_DBPUT),
|
|
rpmdbOp(ts->rdb, RPMDB_OP_DBPUT));
|
|
(void) rpmswAdd(rpmtsOp(ts, RPMTS_OP_DBDEL),
|
|
rpmdbOp(ts->rdb, RPMDB_OP_DBDEL));
|
|
rc = rpmdbClose(ts->rdb);
|
|
ts->rdb = NULL;
|
|
}
|
|
return rc;
|
|
}
|
|
|
|
int rpmtsOpenDB(rpmts ts, int dbmode)
|
|
{
|
|
int rc = 0;
|
|
|
|
if (ts->rdb != NULL && ts->dbmode == dbmode)
|
|
return 0;
|
|
|
|
(void) rpmtsCloseDB(ts);
|
|
|
|
/* XXX there's a potential db lock race here. */
|
|
|
|
ts->dbmode = dbmode;
|
|
rc = rpmdbOpen(ts->rootDir, &ts->rdb, ts->dbmode, 0644);
|
|
if (rc) {
|
|
const char * dn;
|
|
dn = rpmGetPath(ts->rootDir, "%{_dbpath}", NULL);
|
|
rpmMessage(RPMMESS_ERROR,
|
|
_("cannot open Packages database in %s\n"), dn);
|
|
dn = _free(dn);
|
|
}
|
|
return rc;
|
|
}
|
|
|
|
int rpmtsInitDB(rpmts ts, int dbmode)
|
|
{
|
|
void *lock = rpmtsAcquireLock(ts);
|
|
int rc = -1;
|
|
if (lock)
|
|
rc = rpmdbInit(ts->rootDir, dbmode);
|
|
rpmtsFreeLock(lock);
|
|
return rc;
|
|
}
|
|
|
|
int rpmtsRebuildDB(rpmts ts)
|
|
{
|
|
int rc;
|
|
void *lock = rpmtsAcquireLock(ts);
|
|
if (!lock) return -1;
|
|
if (!(ts->vsflags & RPMVSF_NOHDRCHK))
|
|
rc = rpmdbRebuild(ts->rootDir, ts, headerCheck);
|
|
else
|
|
rc = rpmdbRebuild(ts->rootDir, NULL, NULL);
|
|
rpmtsFreeLock(lock);
|
|
return rc;
|
|
}
|
|
|
|
int rpmtsVerifyDB(rpmts ts)
|
|
{
|
|
return rpmdbVerify(ts->rootDir);
|
|
}
|
|
|
|
static int isArch(const char * arch)
|
|
{
|
|
const char ** av;
|
|
static const char *arches[] = {
|
|
"i386", "i486", "i586", "i686", "athlon", "pentium3", "pentium4", "x86_64", "amd64", "ia32e",
|
|
"alpha", "alphaev5", "alphaev56", "alphapca56", "alphaev6", "alphaev67",
|
|
"sparc", "sun4", "sun4m", "sun4c", "sun4d", "sparcv8", "sparcv9", "sparcv9v",
|
|
"sparc64", "sparc64v", "sun4u",
|
|
"mips", "mipsel", "IP",
|
|
"ppc", "ppciseries", "ppcpseries",
|
|
"ppc64", "ppc64iseries", "ppc64pseries",
|
|
"m68k",
|
|
"rs6000",
|
|
"ia64",
|
|
"armv3l", "armv4b", "armv4l", "armv4tl", "armv5tel", "armv5tejl", "armv6l",
|
|
"s390", "i370", "s390x",
|
|
"sh", "xtensa",
|
|
"noarch",
|
|
NULL,
|
|
};
|
|
|
|
for (av = arches; *av != NULL; av++) {
|
|
if (!strcmp(arch, *av))
|
|
return 1;
|
|
}
|
|
return 0;
|
|
}
|
|
|
|
/* keyp might no be defined. */
|
|
rpmdbMatchIterator rpmtsInitIterator(const rpmts ts, rpmTag rpmtag,
|
|
const void * keyp, size_t keylen)
|
|
{
|
|
rpmdbMatchIterator mi;
|
|
const char * arch = NULL;
|
|
int xx;
|
|
|
|
if (ts->rdb == NULL && rpmtsOpenDB(ts, ts->dbmode))
|
|
return NULL;
|
|
|
|
/* Parse out "N(EVR).A" tokens from a label key. */
|
|
if (rpmtag == RPMDBI_LABEL && keyp != NULL) {
|
|
const char * s = keyp;
|
|
const char *se;
|
|
size_t slen = strlen(s);
|
|
char *t = alloca(slen+1);
|
|
int level = 0;
|
|
int c;
|
|
|
|
keyp = t;
|
|
while ((c = *s++) != '\0') {
|
|
switch (c) {
|
|
default:
|
|
*t++ = c;
|
|
break;
|
|
case '(':
|
|
/* XXX Fail if nested parens. */
|
|
if (level++ != 0) {
|
|
rpmError(RPMERR_QFMT, _("extra '(' in package label: %s\n"), keyp);
|
|
return NULL;
|
|
}
|
|
/* Parse explicit epoch. */
|
|
for (se = s; *se && xisdigit(*se); se++)
|
|
{};
|
|
if (*se == ':') {
|
|
/* XXX skip explicit epoch's (for now) */
|
|
*t++ = '-';
|
|
s = se + 1;
|
|
} else {
|
|
/* No Epoch: found. Convert '(' to '-' and chug. */
|
|
*t++ = '-';
|
|
}
|
|
break;
|
|
case ')':
|
|
/* XXX Fail if nested parens. */
|
|
if (--level != 0) {
|
|
rpmError(RPMERR_QFMT, _("missing '(' in package label: %s\n"), keyp);
|
|
return NULL;
|
|
}
|
|
/* Don't copy trailing ')' */
|
|
break;
|
|
}
|
|
}
|
|
if (level) {
|
|
rpmError(RPMERR_QFMT, _("missing ')' in package label: %s\n"), keyp);
|
|
return NULL;
|
|
}
|
|
*t = '\0';
|
|
t = (char *) keyp;
|
|
t = strrchr(t, '.');
|
|
/* Is this a valid ".arch" suffix? */
|
|
if (t != NULL && isArch(t+1)) {
|
|
*t++ = '\0';
|
|
arch = t;
|
|
}
|
|
}
|
|
|
|
mi = rpmdbInitIterator(ts->rdb, rpmtag, keyp, keylen);
|
|
|
|
/* Verify header signature/digest during retrieve (if not disabled). */
|
|
if (mi && !(ts->vsflags & RPMVSF_NOHDRCHK))
|
|
(void) rpmdbSetHdrChk(mi, ts, headerCheck);
|
|
|
|
/* Select specified arch only. */
|
|
if (arch != NULL)
|
|
xx = rpmdbSetIteratorRE(mi, RPMTAG_ARCH, RPMMIRE_DEFAULT, arch);
|
|
return mi;
|
|
}
|
|
|
|
rpmRC rpmtsFindPubkey(rpmts ts)
|
|
{
|
|
const void * sig = rpmtsSig(ts);
|
|
pgpDig dig = rpmtsDig(ts);
|
|
pgpDigParams sigp = rpmtsSignature(ts);
|
|
pgpDigParams pubp = rpmtsPubkey(ts);
|
|
rpmRC res = RPMRC_NOKEY;
|
|
const char * pubkeysource = NULL;
|
|
int xx;
|
|
|
|
if (sig == NULL || dig == NULL || sigp == NULL || pubp == NULL)
|
|
goto exit;
|
|
|
|
#if 0
|
|
fprintf(stderr, "==> find sig id %08x %08x ts pubkey id %08x %08x\n",
|
|
pgpGrab(sigp->signid, 4), pgpGrab(sigp->signid+4, 4),
|
|
pgpGrab(ts->pksignid, 4), pgpGrab(ts->pksignid+4, 4));
|
|
#endif
|
|
|
|
/* Lazy free of previous pubkey if pubkey does not match this signature. */
|
|
if (memcmp(sigp->signid, ts->pksignid, sizeof(ts->pksignid))) {
|
|
#if 0
|
|
fprintf(stderr, "*** free pkt %p[%d] id %08x %08x\n", ts->pkpkt, ts->pkpktlen, pgpGrab(ts->pksignid, 4), pgpGrab(ts->pksignid+4, 4));
|
|
#endif
|
|
ts->pkpkt = _free(ts->pkpkt);
|
|
ts->pkpktlen = 0;
|
|
memset(ts->pksignid, 0, sizeof(ts->pksignid));
|
|
}
|
|
|
|
/* Try rpmdb keyring lookup. */
|
|
if (ts->pkpkt == NULL) {
|
|
int hx = -1;
|
|
int ix = -1;
|
|
rpmdbMatchIterator mi;
|
|
Header h;
|
|
|
|
/* Retrieve the pubkey that matches the signature. */
|
|
mi = rpmtsInitIterator(ts, RPMTAG_PUBKEYS, sigp->signid, sizeof(sigp->signid));
|
|
while ((h = rpmdbNextIterator(mi)) != NULL) {
|
|
const char ** pubkeys;
|
|
int_32 pt, pc;
|
|
|
|
if (!headerGetEntry(h, RPMTAG_PUBKEYS, &pt, (void **)&pubkeys, &pc))
|
|
continue;
|
|
hx = rpmdbGetIteratorOffset(mi);
|
|
ix = rpmdbGetIteratorFileNum(mi);
|
|
if (ix >= pc
|
|
|| b64decode(pubkeys[ix], (void **) &ts->pkpkt, &ts->pkpktlen))
|
|
ix = -1;
|
|
pubkeys = headerFreeData(pubkeys, pt);
|
|
break;
|
|
}
|
|
mi = rpmdbFreeIterator(mi);
|
|
|
|
if (ix >= 0) {
|
|
char hnum[32];
|
|
sprintf(hnum, "h#%d", hx);
|
|
pubkeysource = xstrdup(hnum);
|
|
} else {
|
|
ts->pkpkt = _free(ts->pkpkt);
|
|
ts->pkpktlen = 0;
|
|
}
|
|
}
|
|
|
|
/* Try keyserver lookup. */
|
|
if (ts->pkpkt == NULL) {
|
|
const char * fn = rpmExpand("%{_hkp_keyserver_query}",
|
|
pgpHexStr(sigp->signid, sizeof(sigp->signid)), NULL);
|
|
|
|
xx = 0;
|
|
if (fn && *fn != '%') {
|
|
xx = (pgpReadPkts(fn,&ts->pkpkt,&ts->pkpktlen) != PGPARMOR_PUBKEY);
|
|
}
|
|
fn = _free(fn);
|
|
if (xx) {
|
|
ts->pkpkt = _free(ts->pkpkt);
|
|
ts->pkpktlen = 0;
|
|
} else {
|
|
/* Save new pubkey in local ts keyring for delayed import. */
|
|
pubkeysource = xstrdup("keyserver");
|
|
}
|
|
}
|
|
|
|
#ifdef NOTNOW
|
|
/* Try filename from macro lookup. */
|
|
if (ts->pkpkt == NULL) {
|
|
const char * fn = rpmExpand("%{_gpg_pubkey}", NULL);
|
|
|
|
xx = 0;
|
|
if (fn && *fn != '%')
|
|
xx = (pgpReadPkts(fn,&ts->pkpkt,&ts->pkpktlen) != PGPARMOR_PUBKEY);
|
|
fn = _free(fn);
|
|
if (xx) {
|
|
ts->pkpkt = _free(ts->pkpkt);
|
|
ts->pkpktlen = 0;
|
|
} else {
|
|
pubkeysource = xstrdup("macro");
|
|
}
|
|
}
|
|
#endif
|
|
|
|
/* Was a matching pubkey found? */
|
|
if (ts->pkpkt == NULL || ts->pkpktlen == 0)
|
|
goto exit;
|
|
|
|
/* Retrieve parameters from pubkey packet(s). */
|
|
xx = pgpPrtPkts(ts->pkpkt, ts->pkpktlen, dig, 0);
|
|
|
|
/* Do the parameters match the signature? */
|
|
if (sigp->pubkey_algo == pubp->pubkey_algo
|
|
#ifdef NOTYET
|
|
&& sigp->hash_algo == pubp->hash_algo
|
|
#endif
|
|
&& !memcmp(sigp->signid, pubp->signid, sizeof(sigp->signid)) )
|
|
{
|
|
|
|
/* XXX Verify any pubkey signatures. */
|
|
|
|
/* Pubkey packet looks good, save the signer id. */
|
|
memcpy(ts->pksignid, pubp->signid, sizeof(ts->pksignid));
|
|
|
|
if (pubkeysource)
|
|
rpmMessage(RPMMESS_DEBUG, "========== %s pubkey id %08x %08x (%s)\n",
|
|
(sigp->pubkey_algo == PGPPUBKEYALGO_DSA ? "DSA" :
|
|
(sigp->pubkey_algo == PGPPUBKEYALGO_RSA ? "RSA" : "???")),
|
|
pgpGrab(sigp->signid, 4), pgpGrab(sigp->signid+4, 4),
|
|
pubkeysource);
|
|
|
|
res = RPMRC_OK;
|
|
}
|
|
|
|
exit:
|
|
pubkeysource = _free(pubkeysource);
|
|
if (res != RPMRC_OK) {
|
|
ts->pkpkt = _free(ts->pkpkt);
|
|
ts->pkpktlen = 0;
|
|
}
|
|
return res;
|
|
}
|
|
|
|
int rpmtsCloseSDB(rpmts ts)
|
|
{
|
|
int rc = 0;
|
|
|
|
if (ts->sdb != NULL) {
|
|
(void) rpmswAdd(rpmtsOp(ts, RPMTS_OP_DBGET),
|
|
rpmdbOp(ts->sdb, RPMDB_OP_DBGET));
|
|
(void) rpmswAdd(rpmtsOp(ts, RPMTS_OP_DBPUT),
|
|
rpmdbOp(ts->sdb, RPMDB_OP_DBPUT));
|
|
(void) rpmswAdd(rpmtsOp(ts, RPMTS_OP_DBDEL),
|
|
rpmdbOp(ts->sdb, RPMDB_OP_DBDEL));
|
|
rc = rpmdbClose(ts->sdb);
|
|
ts->sdb = NULL;
|
|
}
|
|
return rc;
|
|
}
|
|
|
|
int rpmtsOpenSDB(rpmts ts, int dbmode)
|
|
{
|
|
static int has_sdbpath = -1;
|
|
int rc = 0;
|
|
|
|
if (ts->sdb != NULL && ts->sdbmode == dbmode)
|
|
return 0;
|
|
|
|
if (has_sdbpath < 0)
|
|
has_sdbpath = rpmExpandNumeric("%{?_solve_dbpath:1}");
|
|
|
|
/* If not configured, don't try to open. */
|
|
if (has_sdbpath <= 0)
|
|
return 1;
|
|
|
|
addMacro(NULL, "_dbpath", NULL, "%{_solve_dbpath}", RMIL_DEFAULT);
|
|
|
|
rc = rpmdbOpen(ts->rootDir, &ts->sdb, ts->sdbmode, 0644);
|
|
if (rc) {
|
|
const char * dn;
|
|
dn = rpmGetPath(ts->rootDir, "%{_dbpath}", NULL);
|
|
rpmMessage(RPMMESS_WARNING,
|
|
_("cannot open Solve database in %s\n"), dn);
|
|
dn = _free(dn);
|
|
}
|
|
delMacro(NULL, "_dbpath");
|
|
|
|
return rc;
|
|
}
|
|
|
|
/**
|
|
* Compare suggested package resolutions (qsort/bsearch).
|
|
* @param a 1st instance address
|
|
* @param b 2nd instance address
|
|
* @return result of comparison
|
|
*/
|
|
static int sugcmp(const void * a, const void * b)
|
|
{
|
|
const char * astr = *(const char **)a;
|
|
const char * bstr = *(const char **)b;
|
|
return strcmp(astr, bstr);
|
|
}
|
|
|
|
int rpmtsSolve(rpmts ts, rpmds ds, const void * data)
|
|
{
|
|
const char * errstr;
|
|
const char * str;
|
|
const char * qfmt;
|
|
rpmdbMatchIterator mi;
|
|
Header bh;
|
|
Header h;
|
|
size_t bhnamelen;
|
|
time_t bhtime;
|
|
rpmTag rpmtag;
|
|
const char * keyp;
|
|
size_t keylen;
|
|
int rc = 1; /* assume not found */
|
|
int xx;
|
|
|
|
/* Make suggestions only for install Requires: */
|
|
if (ts->goal != TSM_INSTALL)
|
|
return rc;
|
|
|
|
if (rpmdsTagN(ds) != RPMTAG_REQUIRENAME)
|
|
return rc;
|
|
|
|
keyp = rpmdsN(ds);
|
|
if (keyp == NULL)
|
|
return rc;
|
|
|
|
if (ts->sdb == NULL) {
|
|
xx = rpmtsOpenSDB(ts, ts->sdbmode);
|
|
if (xx) return rc;
|
|
}
|
|
|
|
/* Look for a matching Provides: in suggested universe. */
|
|
rpmtag = (*keyp == '/' ? RPMTAG_BASENAMES : RPMTAG_PROVIDENAME);
|
|
keylen = 0;
|
|
mi = rpmdbInitIterator(ts->sdb, rpmtag, keyp, keylen);
|
|
bhnamelen = 0;
|
|
bhtime = 0;
|
|
bh = NULL;
|
|
while ((h = rpmdbNextIterator(mi)) != NULL) {
|
|
const char * hname;
|
|
size_t hnamelen;
|
|
time_t htime;
|
|
int_32 * ip;
|
|
|
|
if (rpmtag == RPMTAG_PROVIDENAME && !rpmdsAnyMatchesDep(h, ds, 1))
|
|
continue;
|
|
|
|
/* XXX Prefer the shortest name if given alternatives. */
|
|
hname = NULL;
|
|
hnamelen = 0;
|
|
if (headerGetEntry(h, RPMTAG_NAME, NULL, (void **)&hname, NULL)) {
|
|
if (hname)
|
|
hnamelen = strlen(hname);
|
|
}
|
|
if (bhnamelen > 0 && hnamelen > bhnamelen)
|
|
continue;
|
|
|
|
/* XXX Prefer the newest build if given alternatives. */
|
|
htime = 0;
|
|
if (headerGetEntry(h, RPMTAG_BUILDTIME, NULL, (void **)&ip, NULL))
|
|
htime = (time_t)*ip;
|
|
|
|
if (htime <= bhtime)
|
|
continue;
|
|
|
|
bh = headerFree(bh);
|
|
bh = headerLink(h);
|
|
bhtime = htime;
|
|
bhnamelen = hnamelen;
|
|
}
|
|
mi = rpmdbFreeIterator(mi);
|
|
|
|
/* Is there a suggested resolution? */
|
|
if (bh == NULL)
|
|
goto exit;
|
|
|
|
/* Format the suggestion. */
|
|
qfmt = rpmExpand("%{?_solve_name_fmt}", NULL);
|
|
if (qfmt == NULL || *qfmt == '\0')
|
|
goto exit;
|
|
str = headerSprintf(bh, qfmt, rpmTagTable, rpmHeaderFormats, &errstr);
|
|
bh = headerFree(bh);
|
|
qfmt = _free(qfmt);
|
|
if (str == NULL) {
|
|
rpmError(RPMERR_QFMT, _("incorrect format: %s\n"), errstr);
|
|
goto exit;
|
|
}
|
|
|
|
if (ts->transFlags & RPMTRANS_FLAG_ADDINDEPS) {
|
|
FD_t fd;
|
|
rpmRC rpmrc;
|
|
|
|
h = headerFree(h);
|
|
fd = Fopen(str, "r.ufdio");
|
|
if (fd == NULL || Ferror(fd)) {
|
|
rpmError(RPMERR_OPEN, _("open of %s failed: %s\n"), str,
|
|
Fstrerror(fd));
|
|
if (fd != NULL) {
|
|
xx = Fclose(fd);
|
|
fd = NULL;
|
|
}
|
|
str = _free(str);
|
|
goto exit;
|
|
}
|
|
rpmrc = rpmReadPackageFile(ts, fd, str, &h);
|
|
xx = Fclose(fd);
|
|
switch (rpmrc) {
|
|
default:
|
|
str = _free(str);
|
|
break;
|
|
case RPMRC_NOTTRUSTED:
|
|
case RPMRC_NOKEY:
|
|
case RPMRC_OK:
|
|
if (h != NULL &&
|
|
!rpmtsAddInstallElement(ts, h, (fnpyKey)str, 1, NULL))
|
|
{
|
|
rpmMessage(RPMMESS_DEBUG, _("Adding: %s\n"), str);
|
|
rc = -1;
|
|
/* XXX str memory leak */
|
|
break;
|
|
}
|
|
str = _free(str);
|
|
break;
|
|
}
|
|
h = headerFree(h);
|
|
goto exit;
|
|
}
|
|
|
|
rpmMessage(RPMMESS_DEBUG, _("Suggesting: %s\n"), str);
|
|
/* If suggestion is already present, don't bother. */
|
|
if (ts->suggests != NULL && ts->nsuggests > 0) {
|
|
if (bsearch(&str, ts->suggests, ts->nsuggests,
|
|
sizeof(*ts->suggests), sugcmp))
|
|
goto exit;
|
|
}
|
|
|
|
/* Add a new (unique) suggestion. */
|
|
ts->suggests = xrealloc(ts->suggests,
|
|
sizeof(*ts->suggests) * (ts->nsuggests + 2));
|
|
ts->suggests[ts->nsuggests] = str;
|
|
ts->nsuggests++;
|
|
ts->suggests[ts->nsuggests] = NULL;
|
|
|
|
if (ts->nsuggests > 1)
|
|
qsort(ts->suggests, ts->nsuggests, sizeof(*ts->suggests), sugcmp);
|
|
|
|
exit:
|
|
/* FIX: ts->suggests[] may be NULL */
|
|
return rc;
|
|
}
|
|
|
|
int rpmtsAvailable(rpmts ts, const rpmds ds)
|
|
{
|
|
fnpyKey * sugkey;
|
|
int rc = 1; /* assume not found */
|
|
|
|
if (ts->availablePackages == NULL)
|
|
return rc;
|
|
sugkey = rpmalAllSatisfiesDepend(ts->availablePackages, ds, NULL);
|
|
if (sugkey == NULL)
|
|
return rc;
|
|
|
|
/* XXX no alternatives yet */
|
|
if (sugkey[0] != NULL) {
|
|
ts->suggests = xrealloc(ts->suggests,
|
|
sizeof(*ts->suggests) * (ts->nsuggests + 2));
|
|
ts->suggests[ts->nsuggests] = sugkey[0];
|
|
sugkey[0] = NULL;
|
|
ts->nsuggests++;
|
|
ts->suggests[ts->nsuggests] = NULL;
|
|
}
|
|
sugkey = _free(sugkey);
|
|
/* FIX: ts->suggests[] may be NULL */
|
|
return rc;
|
|
}
|
|
|
|
int rpmtsSetSolveCallback(rpmts ts,
|
|
int (*solve) (rpmts ts, rpmds key, const void * data),
|
|
const void * solveData)
|
|
{
|
|
int rc = 0;
|
|
|
|
if (ts) {
|
|
ts->solve = solve;
|
|
ts->solveData = solveData;
|
|
}
|
|
return rc;
|
|
}
|
|
|
|
rpmps rpmtsProblems(rpmts ts)
|
|
{
|
|
rpmps ps = NULL;
|
|
if (ts) {
|
|
if (ts->probs)
|
|
ps = rpmpsLink(ts->probs, NULL);
|
|
}
|
|
return ps;
|
|
}
|
|
|
|
void rpmtsCleanDig(rpmts ts)
|
|
{
|
|
ts->sig = headerFreeData(ts->sig, ts->sigtype);
|
|
ts->dig = pgpFreeDig(ts->dig);
|
|
}
|
|
|
|
void rpmtsClean(rpmts ts)
|
|
{
|
|
rpmtsi pi; rpmte p;
|
|
|
|
if (ts == NULL)
|
|
return;
|
|
|
|
/* Clean up after dependency checks. */
|
|
pi = rpmtsiInit(ts);
|
|
while ((p = rpmtsiNext(pi, 0)) != NULL)
|
|
rpmteCleanDS(p);
|
|
pi = rpmtsiFree(pi);
|
|
|
|
ts->addedPackages = rpmalFree(ts->addedPackages);
|
|
ts->numAddedPackages = 0;
|
|
|
|
ts->suggests = _free(ts->suggests);
|
|
ts->nsuggests = 0;
|
|
|
|
ts->probs = rpmpsFree(ts->probs);
|
|
|
|
rpmtsCleanDig(ts);
|
|
}
|
|
|
|
void rpmtsEmpty(rpmts ts)
|
|
{
|
|
rpmtsi pi; rpmte p;
|
|
int oc;
|
|
|
|
if (ts == NULL)
|
|
return;
|
|
|
|
rpmtsClean(ts);
|
|
|
|
for (pi = rpmtsiInit(ts), oc = 0; (p = rpmtsiNext(pi, 0)) != NULL; oc++) {
|
|
ts->order[oc] = rpmteFree(ts->order[oc]);
|
|
}
|
|
pi = rpmtsiFree(pi);
|
|
|
|
ts->orderCount = 0;
|
|
ts->ntrees = 0;
|
|
ts->maxDepth = 0;
|
|
|
|
ts->numRemovedPackages = 0;
|
|
return;
|
|
}
|
|
|
|
static void rpmtsPrintStat(const char * name, struct rpmop_s * op)
|
|
{
|
|
static unsigned int scale = (1000 * 1000);
|
|
if (op != NULL && op->count > 0)
|
|
fprintf(stderr, " %s %6d %6lu.%06lu MB %6lu.%06lu secs\n",
|
|
name, op->count,
|
|
(unsigned long)op->bytes/scale, (unsigned long)op->bytes%scale,
|
|
op->usecs/scale, op->usecs%scale);
|
|
}
|
|
|
|
static void rpmtsPrintStats(rpmts ts)
|
|
{
|
|
(void) rpmswExit(rpmtsOp(ts, RPMTS_OP_TOTAL), 0);
|
|
|
|
rpmtsPrintStat("total: ", rpmtsOp(ts, RPMTS_OP_TOTAL));
|
|
rpmtsPrintStat("check: ", rpmtsOp(ts, RPMTS_OP_CHECK));
|
|
rpmtsPrintStat("order: ", rpmtsOp(ts, RPMTS_OP_ORDER));
|
|
rpmtsPrintStat("fingerprint: ", rpmtsOp(ts, RPMTS_OP_FINGERPRINT));
|
|
rpmtsPrintStat("repackage: ", rpmtsOp(ts, RPMTS_OP_REPACKAGE));
|
|
rpmtsPrintStat("install: ", rpmtsOp(ts, RPMTS_OP_INSTALL));
|
|
rpmtsPrintStat("erase: ", rpmtsOp(ts, RPMTS_OP_ERASE));
|
|
rpmtsPrintStat("scriptlets: ", rpmtsOp(ts, RPMTS_OP_SCRIPTLETS));
|
|
rpmtsPrintStat("compress: ", rpmtsOp(ts, RPMTS_OP_COMPRESS));
|
|
rpmtsPrintStat("uncompress: ", rpmtsOp(ts, RPMTS_OP_UNCOMPRESS));
|
|
rpmtsPrintStat("digest: ", rpmtsOp(ts, RPMTS_OP_DIGEST));
|
|
rpmtsPrintStat("signature: ", rpmtsOp(ts, RPMTS_OP_SIGNATURE));
|
|
rpmtsPrintStat("dbadd: ", rpmtsOp(ts, RPMTS_OP_DBADD));
|
|
rpmtsPrintStat("dbremove: ", rpmtsOp(ts, RPMTS_OP_DBREMOVE));
|
|
rpmtsPrintStat("dbget: ", rpmtsOp(ts, RPMTS_OP_DBGET));
|
|
rpmtsPrintStat("dbput: ", rpmtsOp(ts, RPMTS_OP_DBPUT));
|
|
rpmtsPrintStat("dbdel: ", rpmtsOp(ts, RPMTS_OP_DBDEL));
|
|
}
|
|
|
|
rpmts rpmtsFree(rpmts ts)
|
|
{
|
|
if (ts == NULL)
|
|
return NULL;
|
|
|
|
if (ts->nrefs > 1)
|
|
return rpmtsUnlink(ts, "tsCreate");
|
|
|
|
rpmtsEmpty(ts);
|
|
|
|
(void) rpmtsCloseDB(ts);
|
|
|
|
(void) rpmtsCloseSDB(ts);
|
|
|
|
ts->removedPackages = _free(ts->removedPackages);
|
|
|
|
ts->availablePackages = rpmalFree(ts->availablePackages);
|
|
ts->numAvailablePackages = 0;
|
|
|
|
ts->dsi = _free(ts->dsi);
|
|
|
|
if (ts->scriptFd != NULL) {
|
|
ts->scriptFd = fdFree(ts->scriptFd, "rpmtsFree");
|
|
ts->scriptFd = NULL;
|
|
}
|
|
ts->rootDir = _free(ts->rootDir);
|
|
ts->currDir = _free(ts->currDir);
|
|
|
|
ts->order = _free(ts->order);
|
|
ts->orderAlloced = 0;
|
|
|
|
if (ts->pkpkt != NULL)
|
|
ts->pkpkt = _free(ts->pkpkt);
|
|
ts->pkpktlen = 0;
|
|
memset(ts->pksignid, 0, sizeof(ts->pksignid));
|
|
|
|
if (_rpmts_stats)
|
|
rpmtsPrintStats(ts);
|
|
|
|
/* Free up the memory used by the rpmtsScore */
|
|
ts->score = rpmtsScoreFree(ts->score);
|
|
|
|
(void) rpmtsUnlink(ts, "tsCreate");
|
|
|
|
ts = _free(ts);
|
|
|
|
return NULL;
|
|
}
|
|
|
|
rpmVSFlags rpmtsVSFlags(rpmts ts)
|
|
{
|
|
rpmVSFlags vsflags = 0;
|
|
if (ts != NULL)
|
|
vsflags = ts->vsflags;
|
|
return vsflags;
|
|
}
|
|
|
|
rpmVSFlags rpmtsSetVSFlags(rpmts ts, rpmVSFlags vsflags)
|
|
{
|
|
rpmVSFlags ovsflags = 0;
|
|
if (ts != NULL) {
|
|
ovsflags = ts->vsflags;
|
|
ts->vsflags = vsflags;
|
|
}
|
|
return ovsflags;
|
|
}
|
|
|
|
/*
|
|
* This allows us to mark transactions as being of a certain type.
|
|
* The three types are:
|
|
*
|
|
* RPM_TRANS_NORMAL
|
|
* RPM_TRANS_ROLLBACK
|
|
* RPM_TRANS_AUTOROLLBACK
|
|
*
|
|
* ROLLBACK and AUTOROLLBACK transactions should always be ran as
|
|
* a best effort. In particular this is important to the autorollback
|
|
* feature to avoid rolling back a rollback (otherwise known as
|
|
* dueling rollbacks (-;). AUTOROLLBACK's additionally need instance
|
|
* counts passed to scriptlets to be altered.
|
|
*/
|
|
void rpmtsSetType(rpmts ts, rpmtsType type)
|
|
{
|
|
if (ts != NULL) {
|
|
ts->type = type;
|
|
}
|
|
}
|
|
|
|
/* Let them know what type of transaction we are */
|
|
rpmtsType rpmtsGetType(rpmts ts)
|
|
{
|
|
if (ts != NULL)
|
|
return ts->type;
|
|
else
|
|
return 0;
|
|
}
|
|
|
|
int rpmtsUnorderedSuccessors(rpmts ts, int first)
|
|
{
|
|
int unorderedSuccessors = 0;
|
|
if (ts != NULL) {
|
|
unorderedSuccessors = ts->unorderedSuccessors;
|
|
if (first >= 0)
|
|
ts->unorderedSuccessors = first;
|
|
}
|
|
return unorderedSuccessors;
|
|
}
|
|
|
|
const char * rpmtsRootDir(rpmts ts)
|
|
{
|
|
const char * rootDir = NULL;
|
|
|
|
if (ts != NULL && ts->rootDir != NULL) {
|
|
urltype ut = urlPath(ts->rootDir, &rootDir);
|
|
switch (ut) {
|
|
case URL_IS_UNKNOWN:
|
|
case URL_IS_PATH:
|
|
break;
|
|
case URL_IS_HTTPS:
|
|
case URL_IS_HTTP:
|
|
case URL_IS_HKP:
|
|
case URL_IS_FTP:
|
|
case URL_IS_DASH:
|
|
default:
|
|
rootDir = "/";
|
|
break;
|
|
}
|
|
}
|
|
return rootDir;
|
|
}
|
|
|
|
void rpmtsSetRootDir(rpmts ts, const char * rootDir)
|
|
{
|
|
if (ts != NULL) {
|
|
size_t rootLen;
|
|
|
|
ts->rootDir = _free(ts->rootDir);
|
|
|
|
if (rootDir == NULL) {
|
|
#ifndef DYING
|
|
ts->rootDir = xstrdup("");
|
|
#endif
|
|
return;
|
|
}
|
|
rootLen = strlen(rootDir);
|
|
|
|
/* Make sure that rootDir has trailing / */
|
|
if (!(rootLen && rootDir[rootLen - 1] == '/')) {
|
|
char * t = alloca(rootLen + 2);
|
|
*t = '\0';
|
|
(void) stpcpy( stpcpy(t, rootDir), "/");
|
|
rootDir = t;
|
|
}
|
|
ts->rootDir = xstrdup(rootDir);
|
|
}
|
|
}
|
|
|
|
const char * rpmtsCurrDir(rpmts ts)
|
|
{
|
|
const char * currDir = NULL;
|
|
if (ts != NULL) {
|
|
currDir = ts->currDir;
|
|
}
|
|
return currDir;
|
|
}
|
|
|
|
void rpmtsSetCurrDir(rpmts ts, const char * currDir)
|
|
{
|
|
if (ts != NULL) {
|
|
ts->currDir = _free(ts->currDir);
|
|
if (currDir)
|
|
ts->currDir = xstrdup(currDir);
|
|
}
|
|
}
|
|
|
|
FD_t rpmtsScriptFd(rpmts ts)
|
|
{
|
|
FD_t scriptFd = NULL;
|
|
if (ts != NULL) {
|
|
scriptFd = ts->scriptFd;
|
|
}
|
|
return scriptFd;
|
|
}
|
|
|
|
void rpmtsSetScriptFd(rpmts ts, FD_t scriptFd)
|
|
{
|
|
|
|
if (ts != NULL) {
|
|
if (ts->scriptFd != NULL) {
|
|
ts->scriptFd = fdFree(ts->scriptFd, "rpmtsSetScriptFd");
|
|
ts->scriptFd = NULL;
|
|
}
|
|
if (scriptFd != NULL)
|
|
ts->scriptFd = fdLink((void *)scriptFd, "rpmtsSetScriptFd");
|
|
}
|
|
}
|
|
|
|
int rpmtsSELinuxEnabled(rpmts ts)
|
|
{
|
|
return (ts != NULL ? (ts->selinuxEnabled > 0) : 0);
|
|
}
|
|
|
|
int rpmtsChrootDone(rpmts ts)
|
|
{
|
|
return (ts != NULL ? ts->chrootDone : 0);
|
|
}
|
|
|
|
int rpmtsSetChrootDone(rpmts ts, int chrootDone)
|
|
{
|
|
int ochrootDone = 0;
|
|
if (ts != NULL) {
|
|
ochrootDone = ts->chrootDone;
|
|
rpmdbSetChrootDone(rpmtsGetRdb(ts), chrootDone);
|
|
ts->chrootDone = chrootDone;
|
|
}
|
|
return ochrootDone;
|
|
}
|
|
|
|
int_32 rpmtsGetTid(rpmts ts)
|
|
{
|
|
int_32 tid = 0;
|
|
if (ts != NULL) {
|
|
tid = ts->tid;
|
|
}
|
|
return tid;
|
|
}
|
|
|
|
int_32 rpmtsSetTid(rpmts ts, int_32 tid)
|
|
{
|
|
int_32 otid = 0;
|
|
if (ts != NULL) {
|
|
otid = ts->tid;
|
|
ts->tid = tid;
|
|
}
|
|
return otid;
|
|
}
|
|
|
|
int_32 rpmtsSigtag(const rpmts ts)
|
|
{
|
|
int_32 sigtag = 0;
|
|
if (ts != NULL)
|
|
sigtag = ts->sigtag;
|
|
return sigtag;
|
|
}
|
|
|
|
int_32 rpmtsSigtype(const rpmts ts)
|
|
{
|
|
int_32 sigtype = 0;
|
|
if (ts != NULL)
|
|
sigtype = ts->sigtype;
|
|
return sigtype;
|
|
}
|
|
|
|
const void * rpmtsSig(const rpmts ts)
|
|
{
|
|
const void * sig = NULL;
|
|
if (ts != NULL)
|
|
sig = ts->sig;
|
|
return sig;
|
|
}
|
|
|
|
int_32 rpmtsSiglen(const rpmts ts)
|
|
{
|
|
int_32 siglen = 0;
|
|
if (ts != NULL)
|
|
siglen = ts->siglen;
|
|
return siglen;
|
|
}
|
|
|
|
int rpmtsSetSig(rpmts ts,
|
|
int_32 sigtag, int_32 sigtype, const void * sig, int_32 siglen)
|
|
{
|
|
if (ts != NULL) {
|
|
if (ts->sig && ts->sigtype)
|
|
ts->sig = headerFreeData(ts->sig, ts->sigtype);
|
|
ts->sigtag = sigtag;
|
|
ts->sigtype = (sig ? sigtype : 0);
|
|
ts->sig = sig;
|
|
ts->siglen = siglen;
|
|
}
|
|
return 0;
|
|
}
|
|
|
|
pgpDig rpmtsDig(rpmts ts)
|
|
{
|
|
/* FIX: hide lazy malloc for now */
|
|
if (ts->dig == NULL)
|
|
ts->dig = pgpNewDig();
|
|
if (ts->dig == NULL)
|
|
return NULL;
|
|
return ts->dig;
|
|
}
|
|
|
|
pgpDigParams rpmtsSignature(const rpmts ts)
|
|
{
|
|
pgpDig dig = rpmtsDig(ts);
|
|
if (dig == NULL) return NULL;
|
|
return &dig->signature;
|
|
}
|
|
|
|
pgpDigParams rpmtsPubkey(const rpmts ts)
|
|
{
|
|
pgpDig dig = rpmtsDig(ts);
|
|
if (dig == NULL) return NULL;
|
|
return &dig->pubkey;
|
|
}
|
|
|
|
rpmdb rpmtsGetRdb(rpmts ts)
|
|
{
|
|
rpmdb rdb = NULL;
|
|
if (ts != NULL) {
|
|
rdb = ts->rdb;
|
|
}
|
|
return rdb;
|
|
}
|
|
|
|
int rpmtsInitDSI(const rpmts ts)
|
|
{
|
|
rpmDiskSpaceInfo dsi;
|
|
struct stat sb;
|
|
int rc;
|
|
int i;
|
|
|
|
if (rpmtsFilterFlags(ts) & RPMPROB_FILTER_DISKSPACE)
|
|
return 0;
|
|
|
|
rpmMessage(RPMMESS_DEBUG, _("mounted filesystems:\n"));
|
|
rpmMessage(RPMMESS_DEBUG,
|
|
_(" i dev bsize bavail iavail mount point\n"));
|
|
|
|
rc = rpmGetFilesystemList(&ts->filesystems, &ts->filesystemCount);
|
|
if (rc || ts->filesystems == NULL || ts->filesystemCount <= 0)
|
|
return rc;
|
|
|
|
/* Get available space on mounted file systems. */
|
|
|
|
ts->dsi = _free(ts->dsi);
|
|
ts->dsi = xcalloc((ts->filesystemCount + 1), sizeof(*ts->dsi));
|
|
|
|
dsi = ts->dsi;
|
|
|
|
if (dsi != NULL)
|
|
for (i = 0; (i < ts->filesystemCount) && dsi; i++, dsi++) {
|
|
#if STATFS_IN_SYS_STATVFS
|
|
struct statvfs sfb;
|
|
memset(&sfb, 0, sizeof(sfb));
|
|
rc = statvfs(ts->filesystems[i], &sfb);
|
|
#else
|
|
struct statfs sfb;
|
|
memset(&sfb, 0, sizeof(sfb));
|
|
# if STAT_STATFS4
|
|
/* This platform has the 4-argument version of the statfs call. The last two
|
|
* should be the size of struct statfs and 0, respectively. The 0 is the
|
|
* filesystem type, and is always 0 when statfs is called on a mounted
|
|
* filesystem, as we're doing.
|
|
*/
|
|
rc = statfs(ts->filesystems[i], &sfb, sizeof(sfb), 0);
|
|
# else
|
|
rc = statfs(ts->filesystems[i], &sfb);
|
|
# endif
|
|
#endif
|
|
if (rc)
|
|
break;
|
|
|
|
rc = stat(ts->filesystems[i], &sb);
|
|
if (rc)
|
|
break;
|
|
dsi->dev = sb.st_dev;
|
|
|
|
dsi->bsize = sfb.f_bsize;
|
|
dsi->bneeded = 0;
|
|
dsi->ineeded = 0;
|
|
#ifdef STATFS_HAS_F_BAVAIL
|
|
dsi->bavail = sfb.f_bavail;
|
|
#else
|
|
/* FIXME: the statfs struct doesn't have a member to tell how many blocks are
|
|
* available for non-superusers. f_blocks - f_bfree is probably too big, but
|
|
* it's about all we can do.
|
|
*/
|
|
dsi->bavail = sfb.f_blocks - sfb.f_bfree;
|
|
#endif
|
|
/* XXX Avoid FAT and other file systems that have not inodes. */
|
|
dsi->iavail = !(sfb.f_ffree == 0 && sfb.f_files == 0)
|
|
? sfb.f_ffree : -1;
|
|
rpmMessage(RPMMESS_DEBUG, _("%5d 0x%08x %8u %12ld %12ld %s\n"),
|
|
i, (unsigned) dsi->dev, (unsigned) dsi->bsize,
|
|
(signed long) dsi->bavail, (signed long) dsi->iavail,
|
|
ts->filesystems[i]);
|
|
}
|
|
return rc;
|
|
}
|
|
|
|
void rpmtsUpdateDSI(const rpmts ts, dev_t dev,
|
|
uint_32 fileSize, uint_32 prevSize, uint_32 fixupSize,
|
|
rpmFileAction action)
|
|
{
|
|
rpmDiskSpaceInfo dsi;
|
|
uint_32 bneeded;
|
|
|
|
dsi = ts->dsi;
|
|
if (dsi) {
|
|
while (dsi->bsize && dsi->dev != dev)
|
|
dsi++;
|
|
if (dsi->bsize == 0)
|
|
dsi = NULL;
|
|
}
|
|
if (dsi == NULL)
|
|
return;
|
|
|
|
bneeded = BLOCK_ROUND(fileSize, dsi->bsize);
|
|
|
|
switch (action) {
|
|
case FA_BACKUP:
|
|
case FA_SAVE:
|
|
case FA_ALTNAME:
|
|
dsi->ineeded++;
|
|
dsi->bneeded += bneeded;
|
|
break;
|
|
|
|
/*
|
|
* FIXME: If two packages share a file (same md5sum), and
|
|
* that file is being replaced on disk, will dsi->bneeded get
|
|
* adjusted twice? Quite probably!
|
|
*/
|
|
case FA_CREATE:
|
|
dsi->bneeded += bneeded;
|
|
dsi->bneeded -= BLOCK_ROUND(prevSize, dsi->bsize);
|
|
break;
|
|
|
|
case FA_ERASE:
|
|
dsi->ineeded--;
|
|
dsi->bneeded -= bneeded;
|
|
break;
|
|
|
|
default:
|
|
break;
|
|
}
|
|
|
|
if (fixupSize)
|
|
dsi->bneeded -= BLOCK_ROUND(fixupSize, dsi->bsize);
|
|
}
|
|
|
|
void rpmtsCheckDSIProblems(const rpmts ts, const rpmte te)
|
|
{
|
|
rpmDiskSpaceInfo dsi;
|
|
rpmps ps;
|
|
int fc;
|
|
int i;
|
|
|
|
if (ts->filesystems == NULL || ts->filesystemCount <= 0)
|
|
return;
|
|
|
|
dsi = ts->dsi;
|
|
if (dsi == NULL)
|
|
return;
|
|
fc = rpmfiFC( rpmteFI(te, RPMTAG_BASENAMES) );
|
|
if (fc <= 0)
|
|
return;
|
|
|
|
ps = rpmtsProblems(ts);
|
|
for (i = 0; i < ts->filesystemCount; i++, dsi++) {
|
|
|
|
if (dsi->bavail >= 0 && adj_fs_blocks(dsi->bneeded) > dsi->bavail) {
|
|
rpmpsAppend(ps, RPMPROB_DISKSPACE,
|
|
rpmteNEVR(te), rpmteKey(te),
|
|
ts->filesystems[i], NULL, NULL,
|
|
(adj_fs_blocks(dsi->bneeded) - dsi->bavail) * dsi->bsize);
|
|
}
|
|
|
|
if (dsi->iavail >= 0 && adj_fs_blocks(dsi->ineeded) > dsi->iavail) {
|
|
rpmpsAppend(ps, RPMPROB_DISKNODES,
|
|
rpmteNEVR(te), rpmteKey(te),
|
|
ts->filesystems[i], NULL, NULL,
|
|
(adj_fs_blocks(dsi->ineeded) - dsi->iavail));
|
|
}
|
|
}
|
|
ps = rpmpsFree(ps);
|
|
}
|
|
|
|
void * rpmtsNotify(rpmts ts, rpmte te,
|
|
rpmCallbackType what, unsigned long amount, unsigned long total)
|
|
{
|
|
void * ptr = NULL;
|
|
if (ts && ts->notify && te) {
|
|
assert(!(te->type == TR_ADDED && te->h == NULL));
|
|
/* FIX: cast? */
|
|
/* FIX: check rc */
|
|
ptr = ts->notify(te->h, what, amount, total,
|
|
rpmteKey(te), ts->notifyData);
|
|
}
|
|
return ptr;
|
|
}
|
|
|
|
int rpmtsNElements(rpmts ts)
|
|
{
|
|
int nelements = 0;
|
|
if (ts != NULL && ts->order != NULL) {
|
|
nelements = ts->orderCount;
|
|
}
|
|
return nelements;
|
|
}
|
|
|
|
rpmte rpmtsElement(rpmts ts, int ix)
|
|
{
|
|
rpmte te = NULL;
|
|
if (ts != NULL && ts->order != NULL) {
|
|
if (ix >= 0 && ix < ts->orderCount)
|
|
te = ts->order[ix];
|
|
}
|
|
return te;
|
|
}
|
|
|
|
rpmprobFilterFlags rpmtsFilterFlags(rpmts ts)
|
|
{
|
|
return (ts != NULL ? ts->ignoreSet : 0);
|
|
}
|
|
|
|
rpmtransFlags rpmtsFlags(rpmts ts)
|
|
{
|
|
return (ts != NULL ? ts->transFlags : 0);
|
|
}
|
|
|
|
rpmtransFlags rpmtsSetFlags(rpmts ts, rpmtransFlags transFlags)
|
|
{
|
|
rpmtransFlags otransFlags = 0;
|
|
if (ts != NULL) {
|
|
otransFlags = ts->transFlags;
|
|
ts->transFlags = transFlags;
|
|
}
|
|
return otransFlags;
|
|
}
|
|
|
|
rpmSpec rpmtsSpec(rpmts ts)
|
|
{
|
|
return ts->spec;
|
|
}
|
|
|
|
rpmSpec rpmtsSetSpec(rpmts ts, rpmSpec spec)
|
|
{
|
|
rpmSpec ospec = ts->spec;
|
|
ts->spec = spec;
|
|
return ospec;
|
|
}
|
|
|
|
rpmte rpmtsRelocateElement(rpmts ts)
|
|
{
|
|
return ts->relocateElement;
|
|
}
|
|
|
|
rpmte rpmtsSetRelocateElement(rpmts ts, rpmte relocateElement)
|
|
{
|
|
rpmte orelocateElement = ts->relocateElement;
|
|
ts->relocateElement = relocateElement;
|
|
return orelocateElement;
|
|
}
|
|
|
|
uint_32 rpmtsColor(rpmts ts)
|
|
{
|
|
return (ts != NULL ? ts->color : 0);
|
|
}
|
|
|
|
uint_32 rpmtsSetColor(rpmts ts, uint_32 color)
|
|
{
|
|
uint_32 ocolor = 0;
|
|
if (ts != NULL) {
|
|
ocolor = ts->color;
|
|
ts->color = color;
|
|
}
|
|
return ocolor;
|
|
}
|
|
|
|
uint_32 rpmtsPrefColor(rpmts ts)
|
|
{
|
|
return (ts != NULL ? ts->prefcolor : 0);
|
|
}
|
|
|
|
rpmop rpmtsOp(rpmts ts, rpmtsOpX opx)
|
|
{
|
|
rpmop op = NULL;
|
|
|
|
if (ts != NULL && opx >= 0 && opx < RPMTS_OP_MAX)
|
|
op = ts->ops + opx;
|
|
return op;
|
|
}
|
|
|
|
int rpmtsSetNotifyCallback(rpmts ts,
|
|
rpmCallbackFunction notify, rpmCallbackData notifyData)
|
|
{
|
|
if (ts != NULL) {
|
|
ts->notify = notify;
|
|
ts->notifyData = notifyData;
|
|
}
|
|
return 0;
|
|
}
|
|
|
|
int rpmtsGetKeys(const rpmts ts, fnpyKey ** ep, int * nep)
|
|
{
|
|
int rc = 0;
|
|
|
|
if (nep) *nep = ts->orderCount;
|
|
if (ep) {
|
|
rpmtsi pi; rpmte p;
|
|
fnpyKey * e;
|
|
|
|
*ep = e = xmalloc(ts->orderCount * sizeof(*e));
|
|
pi = rpmtsiInit(ts);
|
|
while ((p = rpmtsiNext(pi, 0)) != NULL) {
|
|
switch (rpmteType(p)) {
|
|
case TR_ADDED:
|
|
*e = rpmteKey(p);
|
|
break;
|
|
case TR_REMOVED:
|
|
default:
|
|
*e = NULL;
|
|
break;
|
|
}
|
|
e++;
|
|
}
|
|
pi = rpmtsiFree(pi);
|
|
}
|
|
return rc;
|
|
}
|
|
|
|
rpmts rpmtsCreate(void)
|
|
{
|
|
rpmts ts;
|
|
|
|
ts = xcalloc(1, sizeof(*ts));
|
|
memset(&ts->ops, 0, sizeof(ts->ops));
|
|
(void) rpmswEnter(rpmtsOp(ts, RPMTS_OP_TOTAL), -1);
|
|
ts->type = RPMTRANS_TYPE_NORMAL;
|
|
ts->goal = TSM_UNKNOWN;
|
|
ts->filesystemCount = 0;
|
|
ts->filesystems = NULL;
|
|
ts->dsi = NULL;
|
|
|
|
ts->solve = rpmtsSolve;
|
|
ts->solveData = NULL;
|
|
ts->nsuggests = 0;
|
|
ts->suggests = NULL;
|
|
ts->sdb = NULL;
|
|
ts->sdbmode = O_RDONLY;
|
|
|
|
ts->rdb = NULL;
|
|
ts->dbmode = O_RDONLY;
|
|
|
|
ts->scriptFd = NULL;
|
|
ts->tid = (int_32) time(NULL);
|
|
ts->delta = 5;
|
|
|
|
ts->color = rpmExpandNumeric("%{?_transaction_color}");
|
|
ts->prefcolor = rpmExpandNumeric("%{?_prefer_color}")?:2;
|
|
|
|
ts->numRemovedPackages = 0;
|
|
ts->allocedRemovedPackages = ts->delta;
|
|
ts->removedPackages = xcalloc(ts->allocedRemovedPackages,
|
|
sizeof(*ts->removedPackages));
|
|
|
|
ts->rootDir = NULL;
|
|
ts->currDir = NULL;
|
|
ts->chrootDone = 0;
|
|
|
|
ts->selinuxEnabled = is_selinux_enabled();
|
|
|
|
ts->numAddedPackages = 0;
|
|
ts->addedPackages = NULL;
|
|
|
|
ts->numAvailablePackages = 0;
|
|
ts->availablePackages = NULL;
|
|
|
|
ts->orderAlloced = 0;
|
|
ts->orderCount = 0;
|
|
ts->order = NULL;
|
|
ts->ntrees = 0;
|
|
ts->maxDepth = 0;
|
|
|
|
ts->probs = NULL;
|
|
|
|
ts->sig = NULL;
|
|
ts->pkpkt = NULL;
|
|
ts->pkpktlen = 0;
|
|
memset(ts->pksignid, 0, sizeof(ts->pksignid));
|
|
ts->dig = NULL;
|
|
|
|
/*
|
|
* We only use the score in an autorollback. So set this to
|
|
* NULL by default.
|
|
*/
|
|
ts->score = NULL;
|
|
|
|
ts->nrefs = 0;
|
|
|
|
return rpmtsLink(ts, "tsCreate");
|
|
}
|
|
|
|
/**********************
|
|
* Transaction Scores *
|
|
**********************/
|
|
|
|
|
|
rpmRC rpmtsScoreInit(rpmts runningTS, rpmts rollbackTS)
|
|
{
|
|
rpmtsScore score;
|
|
rpmtsi pi;
|
|
rpmte p;
|
|
int i;
|
|
int tranElements; /* Number of transaction elements in runningTS */
|
|
int found = 0;
|
|
rpmRC rc = RPMRC_OK; /* Assume success */
|
|
rpmtsScoreEntry se;
|
|
|
|
rpmMessage(RPMMESS_DEBUG, _("Creating transaction score board(%p, %p)\n"),
|
|
runningTS, rollbackTS);
|
|
|
|
/* Allocate space for score board */
|
|
score = xcalloc(1, sizeof(*score));
|
|
rpmMessage(RPMMESS_DEBUG, _("\tScore board address: %p\n"), score);
|
|
|
|
/*
|
|
* Determine the maximum size needed for the entry list.
|
|
* XXX: Today, I just get the count of rpmts elements, and allocate
|
|
* an array that big. Yes this is guaranteed to waste memory.
|
|
* Future updates will hopefully make this more efficient,
|
|
* but for now it will work.
|
|
*/
|
|
tranElements = rpmtsNElements(runningTS);
|
|
rpmMessage(RPMMESS_DEBUG, _("\tAllocating space for %d entries\n"), tranElements);
|
|
score->scores = xcalloc(tranElements, sizeof(score->scores));
|
|
|
|
/* Initialize score entry count */
|
|
score->entries = 0;
|
|
score->nrefs = 0;
|
|
|
|
/*
|
|
* Increment through transaction elements and make sure for every
|
|
* N there is an rpmtsScoreEntry.
|
|
*/
|
|
pi = rpmtsiInit(runningTS);
|
|
while ((p = rpmtsiNext(pi, TR_ADDED|TR_REMOVED)) != NULL) {
|
|
found = 0;
|
|
|
|
/* Try to find the entry in the score list */
|
|
for(i = 0; i < score->entries; i++) {
|
|
se = score->scores[i];
|
|
if (strcmp(rpmteN(p), se->N) == 0) {
|
|
found = 1;
|
|
break;
|
|
}
|
|
}
|
|
|
|
/* If we did not find the entry then allocate space for it */
|
|
if (!found) {
|
|
/* XXX p->fi->te undefined. */
|
|
rpmMessage(RPMMESS_DEBUG, _("\tAdding entry for %s to score board.\n"),
|
|
rpmteN(p));
|
|
se = xcalloc(1, sizeof(*(*(score->scores))));
|
|
rpmMessage(RPMMESS_DEBUG, _("\t\tEntry address: %p\n"), se);
|
|
se->N = xstrdup(rpmteN(p));
|
|
se->te_types = rpmteType(p);
|
|
se->installed = 0;
|
|
se->erased = 0;
|
|
score->scores[score->entries] = se;
|
|
score->entries++;
|
|
} else {
|
|
/* We found this one, so just add the element type to the one
|
|
* already there.
|
|
*/
|
|
rpmMessage(RPMMESS_DEBUG, _("\tUpdating entry for %s in score board.\n"),
|
|
rpmteN(p));
|
|
score->scores[i]->te_types |= rpmteType(p);
|
|
}
|
|
|
|
}
|
|
pi = rpmtsiFree(pi);
|
|
|
|
/*
|
|
* Attach the score to the running transaction and the autorollback
|
|
* transaction.
|
|
*/
|
|
runningTS->score = score;
|
|
score->nrefs++;
|
|
rollbackTS->score = score;
|
|
score->nrefs++;
|
|
|
|
return rc;
|
|
}
|
|
|
|
rpmtsScore rpmtsScoreFree(rpmtsScore score)
|
|
{
|
|
rpmtsScoreEntry se = NULL;
|
|
int i;
|
|
|
|
rpmMessage(RPMMESS_DEBUG, _("May free Score board(%p)\n"), score);
|
|
|
|
/* If score is not initialized, then just return.
|
|
* This is likely the case if autorollbacks are not enabled.
|
|
*/
|
|
if (score == NULL) return NULL;
|
|
|
|
/* Decrement the reference count */
|
|
score->nrefs--;
|
|
|
|
/* Do we have any more references? If so
|
|
* just return.
|
|
*/
|
|
if (score->nrefs > 0) return NULL;
|
|
|
|
rpmMessage(RPMMESS_DEBUG, _("\tRefcount is zero...will free\n"));
|
|
/* No more references, lets clean up */
|
|
/* First deallocate the score entries */
|
|
for(i = 0; i < score->entries; i++) {
|
|
/* Get the score for the ith entry */
|
|
se = score->scores[i];
|
|
|
|
/* Deallocate the score entries name */
|
|
se->N = _free(se->N);
|
|
|
|
/* Deallocate the score entry itself */
|
|
se = _free(se);
|
|
}
|
|
|
|
/* Next deallocate the score entry table */
|
|
score->scores = _free(score->scores);
|
|
|
|
/* Finally deallocate the score itself */
|
|
score = _free(score);
|
|
|
|
return NULL;
|
|
}
|
|
|
|
/*
|
|
* XXX: Do not get the score and then store it aside for later use.
|
|
* we will delete it out from under you. There is no rpmtsScoreLink()
|
|
* as this may be a very temporary fix for autorollbacks.
|
|
*/
|
|
rpmtsScore rpmtsGetScore(rpmts ts)
|
|
{
|
|
if (ts == NULL) return NULL;
|
|
return ts->score;
|
|
}
|
|
|
|
/*
|
|
* XXX: Do not get the score entry and then store it aside for later use.
|
|
* we will delete it out from under you. There is no
|
|
* rpmtsScoreEntryLink() as this may be a very temporary fix
|
|
* for autorollbacks.
|
|
* XXX: The scores are not sorted. This should be fixed at earliest
|
|
* opportunity (i.e. when we have the whole autorollback working).
|
|
*/
|
|
rpmtsScoreEntry rpmtsScoreGetEntry(rpmtsScore score, const char *N)
|
|
{
|
|
int i;
|
|
rpmtsScoreEntry se;
|
|
rpmtsScoreEntry ret = NULL; /* Assume we don't find it */
|
|
|
|
rpmMessage(RPMMESS_DEBUG, _("Looking in score board(%p) for %s\n"), score, N);
|
|
|
|
/* Try to find the entry in the score list */
|
|
for(i = 0; i < score->entries; i++) {
|
|
se = score->scores[i];
|
|
if (strcmp(N, se->N) == 0) {
|
|
rpmMessage(RPMMESS_DEBUG, _("\tFound entry at address: %p\n"), se);
|
|
ret = se;
|
|
break;
|
|
}
|
|
}
|
|
|
|
/* XXX score->scores undefined. */
|
|
return ret;
|
|
}
|