287 lines
7.4 KiB
C
287 lines
7.4 KiB
C
/**
|
|
* \file rpmdb/fprint.c
|
|
*/
|
|
|
|
#include "system.h"
|
|
|
|
#include <rpmdb.h>
|
|
#include <rpmmacro.h> /* XXX for rpmCleanPath */
|
|
|
|
#include "fprint.h"
|
|
#include "debug.h"
|
|
|
|
fingerPrintCache fpCacheCreate(int sizeHint)
|
|
{
|
|
fingerPrintCache fpc;
|
|
|
|
fpc = xmalloc(sizeof(*fpc));
|
|
fpc->ht = htCreate(sizeHint * 2, 0, 1, hashFunctionString,
|
|
hashEqualityString);
|
|
return fpc;
|
|
}
|
|
|
|
fingerPrintCache fpCacheFree(fingerPrintCache cache)
|
|
{
|
|
cache->ht = htFree(cache->ht);
|
|
free(cache);
|
|
return NULL;
|
|
}
|
|
|
|
/**
|
|
* Find directory name entry in cache.
|
|
* @param cache pointer to fingerprint cache
|
|
* @param dirName string to locate in cache
|
|
* @return pointer to directory name entry (or NULL if not found).
|
|
*/
|
|
static /*@null@*/ const struct fprintCacheEntry_s * cacheContainsDirectory(
|
|
fingerPrintCache cache,
|
|
const char * dirName)
|
|
/*@*/
|
|
{
|
|
const void ** data;
|
|
|
|
if (htGetEntry(cache->ht, dirName, &data, NULL, NULL))
|
|
return NULL;
|
|
/*@-boundsread@*/
|
|
return data[0];
|
|
/*@=boundsread@*/
|
|
}
|
|
|
|
/**
|
|
* Return finger print of a file path.
|
|
* @param cache pointer to fingerprint cache
|
|
* @param dirName leading directory name of path
|
|
* @param baseName file name of path
|
|
* @param scareMemory
|
|
* @return pointer to the finger print associated with a file path.
|
|
*/
|
|
/*@-bounds@*/ /* LCL: segfault */
|
|
static fingerPrint doLookup(fingerPrintCache cache,
|
|
const char * dirName, const char * baseName, int scareMemory)
|
|
/*@modifies cache @*/
|
|
{
|
|
char dir[PATH_MAX];
|
|
const char * cleanDirName;
|
|
size_t cdnl;
|
|
char * end; /* points to the '\0' at the end of "buf" */
|
|
fingerPrint fp;
|
|
struct stat sb;
|
|
char * buf;
|
|
const struct fprintCacheEntry_s * cacheHit;
|
|
|
|
/* assert(*dirName == '/' || !scareMemory); */
|
|
|
|
/* XXX WATCHOUT: fp.subDir is set below from relocated dirName arg */
|
|
cleanDirName = dirName;
|
|
cdnl = strlen(cleanDirName);
|
|
|
|
if (*cleanDirName == '/') {
|
|
/*@-branchstate@*/
|
|
if (!scareMemory)
|
|
cleanDirName =
|
|
rpmCleanPath(strcpy(alloca(cdnl+1), dirName));
|
|
/*@=branchstate@*/
|
|
} else {
|
|
scareMemory = 0; /* XXX causes memory leak */
|
|
|
|
/* Using realpath on the arg isn't correct if the arg is a symlink,
|
|
* especially if the symlink is a dangling link. What we
|
|
* do instead is use realpath() on `.' and then append arg to
|
|
* the result.
|
|
*/
|
|
|
|
/* if the current directory doesn't exist, we might fail.
|
|
oh well. likewise if it's too long. */
|
|
dir[0] = '\0';
|
|
/*@-branchstate@*/
|
|
if (realpath(".", dir) != NULL) {
|
|
end = dir + strlen(dir);
|
|
if (end[-1] != '/') *end++ = '/';
|
|
end = stpncpy(end, cleanDirName, sizeof(dir) - (end - dir));
|
|
*end = '\0';
|
|
(void)rpmCleanPath(dir); /* XXX possible /../ from concatenation */
|
|
end = dir + strlen(dir);
|
|
if (end[-1] != '/') *end++ = '/';
|
|
*end = '\0';
|
|
cleanDirName = dir;
|
|
cdnl = end - dir;
|
|
}
|
|
/*@=branchstate@*/
|
|
}
|
|
fp.entry = NULL;
|
|
fp.subDir = NULL;
|
|
fp.baseName = NULL;
|
|
/*@-nullret@*/
|
|
if (cleanDirName == NULL) return fp; /* XXX can't happen */
|
|
/*@=nullret@*/
|
|
|
|
buf = strcpy(alloca(cdnl + 1), cleanDirName);
|
|
end = buf + cdnl;
|
|
|
|
/* no need to pay attention to that extra little / at the end of dirName */
|
|
if (buf[1] && end[-1] == '/') {
|
|
end--;
|
|
*end = '\0';
|
|
}
|
|
|
|
while (1) {
|
|
|
|
/* as we're stating paths here, we want to follow symlinks */
|
|
|
|
cacheHit = cacheContainsDirectory(cache, (*buf != '\0' ? buf : "/"));
|
|
if (cacheHit != NULL) {
|
|
fp.entry = cacheHit;
|
|
} else if (!stat((*buf != '\0' ? buf : "/"), &sb)) {
|
|
size_t nb = sizeof(*fp.entry) + (*buf != '\0' ? (end-buf) : 1) + 1;
|
|
char * dn = xmalloc(nb);
|
|
struct fprintCacheEntry_s * newEntry = (void *)dn;
|
|
|
|
/*@-usereleased@*/ /* LCL: contiguous malloc confusion */
|
|
dn += sizeof(*newEntry);
|
|
strcpy(dn, (*buf != '\0' ? buf : "/"));
|
|
newEntry->ino = sb.st_ino;
|
|
newEntry->dev = sb.st_dev;
|
|
newEntry->dirName = dn;
|
|
fp.entry = newEntry;
|
|
|
|
/*@-kepttrans -dependenttrans @*/
|
|
htAddEntry(cache->ht, dn, fp.entry);
|
|
/*@=kepttrans =dependenttrans @*/
|
|
/*@=usereleased@*/
|
|
}
|
|
|
|
if (fp.entry) {
|
|
fp.subDir = cleanDirName + (end - buf);
|
|
if (fp.subDir[0] == '/' && fp.subDir[1] != '\0')
|
|
fp.subDir++;
|
|
if (fp.subDir[0] == '\0' ||
|
|
/* XXX don't bother saving '/' as subdir */
|
|
(fp.subDir[0] == '/' && fp.subDir[1] == '\0'))
|
|
fp.subDir = NULL;
|
|
fp.baseName = baseName;
|
|
if (!scareMemory && fp.subDir != NULL)
|
|
fp.subDir = xstrdup(fp.subDir);
|
|
/*@-compdef@*/ /* FIX: fp.entry.{dirName,dev,ino} undef @*/
|
|
return fp;
|
|
/*@=compdef@*/
|
|
}
|
|
|
|
/* stat of '/' just failed! */
|
|
if (end == buf + 1)
|
|
abort();
|
|
|
|
end--;
|
|
while ((end > buf) && *end != '/') end--;
|
|
if (end == buf) /* back to stat'ing just '/' */
|
|
end++;
|
|
|
|
*end = '\0';
|
|
}
|
|
|
|
/*@notreached@*/
|
|
|
|
/*@-compdef@*/ /* FIX: fp.entry.{dirName,dev,ino} undef @*/
|
|
/*@-nullret@*/ return fp; /*@=nullret@*/ /* LCL: can't happen. */
|
|
/*@=compdef@*/
|
|
}
|
|
/*@=bounds@*/
|
|
|
|
fingerPrint fpLookup(fingerPrintCache cache, const char * dirName,
|
|
const char * baseName, int scareMemory)
|
|
{
|
|
return doLookup(cache, dirName, baseName, scareMemory);
|
|
}
|
|
|
|
unsigned int fpHashFunction(const void * key)
|
|
{
|
|
const fingerPrint * fp = key;
|
|
unsigned int hash = 0;
|
|
char ch;
|
|
const char * chptr;
|
|
|
|
ch = 0;
|
|
chptr = fp->baseName;
|
|
/*@-boundsread@*/
|
|
while (*chptr != '\0') ch ^= *chptr++;
|
|
/*@=boundsread@*/
|
|
|
|
hash |= ((unsigned)ch) << 24;
|
|
hash |= (((((unsigned)fp->entry->dev) >> 8) ^ fp->entry->dev) & 0xFF) << 16;
|
|
hash |= fp->entry->ino & 0xFFFF;
|
|
|
|
return hash;
|
|
}
|
|
|
|
/*@-boundsread@*/
|
|
int fpEqual(const void * key1, const void * key2)
|
|
{
|
|
const fingerPrint *k1 = key1;
|
|
const fingerPrint *k2 = key2;
|
|
|
|
/* If the addresses are the same, so are the values. */
|
|
if (k1 == k2)
|
|
return 0;
|
|
|
|
/* Otherwise, compare fingerprints by value. */
|
|
/*@-nullpass@*/ /* LCL: whines about (*k2).subdir */
|
|
if (FP_EQUAL(*k1, *k2))
|
|
return 0;
|
|
/*@=nullpass@*/
|
|
return 1;
|
|
|
|
}
|
|
/*@=boundsread@*/
|
|
|
|
/*@-bounds@*/
|
|
void fpLookupList(fingerPrintCache cache, const char ** dirNames,
|
|
const char ** baseNames, const int * dirIndexes,
|
|
int fileCount, fingerPrint * fpList)
|
|
{
|
|
int i;
|
|
|
|
for (i = 0; i < fileCount; i++) {
|
|
/* If this is in the same directory as the last file, don't bother
|
|
redoing all of this work */
|
|
if (i > 0 && dirIndexes[i - 1] == dirIndexes[i]) {
|
|
fpList[i].entry = fpList[i - 1].entry;
|
|
fpList[i].subDir = fpList[i - 1].subDir;
|
|
fpList[i].baseName = baseNames[i];
|
|
} else {
|
|
fpList[i] = doLookup(cache, dirNames[dirIndexes[i]], baseNames[i],
|
|
1);
|
|
}
|
|
}
|
|
}
|
|
/*@=bounds@*/
|
|
|
|
#ifdef UNUSED
|
|
/**
|
|
* Return finger prints of all file names in header.
|
|
* @warning: scareMemory is assumed!
|
|
* @param cache pointer to fingerprint cache
|
|
* @param h package header
|
|
* @retval fpList pointer to array of finger prints
|
|
*/
|
|
static
|
|
void fpLookupHeader(fingerPrintCache cache, Header h, fingerPrint * fpList)
|
|
/*@modifies h, cache, *fpList @*/;
|
|
{
|
|
HGE_t hge = (HGE_t)headerGetEntryMinMemory;
|
|
HFD_t hfd = headerFreeData;
|
|
const char ** baseNames, ** dirNames;
|
|
rpmTagType bnt, dnt;
|
|
int_32 * dirIndexes;
|
|
int fileCount;
|
|
int xx;
|
|
|
|
if (!hge(h, RPMTAG_BASENAMES, &bnt, (void **) &baseNames, &fileCount))
|
|
return;
|
|
|
|
xx = hge(h, RPMTAG_DIRNAMES, &dnt, (void **) &dirNames, NULL);
|
|
xx = hge(h, RPMTAG_DIRINDEXES, NULL, (void **) &dirIndexes, NULL);
|
|
fpLookupList(cache, dirNames, baseNames, dirIndexes, fileCount, fpList);
|
|
dirNames = hfd(dirNames, dnt);
|
|
baseNames = hfd(baseNames, bnt);
|
|
}
|
|
#endif
|