2150 lines
52 KiB
C
2150 lines
52 KiB
C
/** \ingroup header
|
||
* \file lib/header.c
|
||
*/
|
||
|
||
/* RPM - Copyright (C) 1995-2002 Red Hat Software */
|
||
|
||
/* Data written to file descriptors is in network byte order. */
|
||
/* Data read from file descriptors is expected to be in */
|
||
/* network byte order and is converted on the fly to host order. */
|
||
|
||
#include "system.h"
|
||
#include <netdb.h>
|
||
#include <errno.h>
|
||
#include <inttypes.h>
|
||
#include <rpm/rpmtypes.h>
|
||
#include <rpm/rpmstring.h>
|
||
#include "header_internal.h"
|
||
#include "misc.h" /* tag function proto */
|
||
|
||
#include "debug.h"
|
||
|
||
/** \ingroup header
|
||
*/
|
||
const unsigned char rpm_header_magic[8] = {
|
||
0x8e, 0xad, 0xe8, 0x01, 0x00, 0x00, 0x00, 0x00
|
||
};
|
||
|
||
/** \ingroup header
|
||
* Alignment needed for header data types.
|
||
*/
|
||
static const int typeAlign[16] = {
|
||
1, /*!< RPM_NULL_TYPE */
|
||
1, /*!< RPM_CHAR_TYPE */
|
||
1, /*!< RPM_INT8_TYPE */
|
||
2, /*!< RPM_INT16_TYPE */
|
||
4, /*!< RPM_INT32_TYPE */
|
||
8, /*!< RPM_INT64_TYPE */
|
||
1, /*!< RPM_STRING_TYPE */
|
||
1, /*!< RPM_BIN_TYPE */
|
||
1, /*!< RPM_STRING_ARRAY_TYPE */
|
||
1, /*!< RPM_I18NSTRING_TYPE */
|
||
0,
|
||
0,
|
||
0,
|
||
0,
|
||
0,
|
||
0
|
||
};
|
||
|
||
/** \ingroup header
|
||
* Size of header data types.
|
||
*/
|
||
static const int typeSizes[16] = {
|
||
0, /*!< RPM_NULL_TYPE */
|
||
1, /*!< RPM_CHAR_TYPE */
|
||
1, /*!< RPM_INT8_TYPE */
|
||
2, /*!< RPM_INT16_TYPE */
|
||
4, /*!< RPM_INT32_TYPE */
|
||
8, /*!< RPM_INT64_TYPE */
|
||
-1, /*!< RPM_STRING_TYPE */
|
||
1, /*!< RPM_BIN_TYPE */
|
||
-1, /*!< RPM_STRING_ARRAY_TYPE */
|
||
-1, /*!< RPM_I18NSTRING_TYPE */
|
||
0,
|
||
0,
|
||
0,
|
||
0,
|
||
0,
|
||
0
|
||
};
|
||
|
||
enum headerFlags_e {
|
||
HEADERFLAG_ALLOCATED = (1 << 1), /*!< Is 1st header region allocated? */
|
||
HEADERFLAG_LEGACY = (1 << 2), /*!< Header came from legacy source? */
|
||
HEADERFLAG_DEBUG = (1 << 3), /*!< Debug this header? */
|
||
};
|
||
|
||
typedef rpmFlags headerFlags;
|
||
|
||
/** \ingroup header
|
||
* Description of tag data.
|
||
*/
|
||
struct entryInfo_s {
|
||
uint32_t tag; /*!< Tag identifier. */
|
||
uint32_t type; /*!< Tag data type. */
|
||
int32_t offset; /*!< Offset into data segment (ondisk only). */
|
||
uint32_t count; /*!< Number of tag elements. */
|
||
};
|
||
|
||
/** \ingroup header
|
||
* A single tag from a Header.
|
||
*/
|
||
typedef struct indexEntry_s * indexEntry;
|
||
struct indexEntry_s {
|
||
struct entryInfo_s info; /*!< Description of tag data. */
|
||
void * data; /*!< Location of tag data. */
|
||
uint32_t length; /*!< No. bytes of data. */
|
||
uint32_t rdlen; /*!< No. bytes of data in region. */
|
||
};
|
||
|
||
/** \ingroup header
|
||
* The Header data structure.
|
||
*/
|
||
struct headerToken_s {
|
||
void * blob; /*!< Header region blob. */
|
||
indexEntry index; /*!< Array of tags. */
|
||
int indexUsed; /*!< Current size of tag array. */
|
||
int indexAlloced; /*!< Allocated size of tag array. */
|
||
unsigned int instance; /*!< Rpmdb instance */
|
||
headerFlags flags;
|
||
int sorted; /*!< Current sort method */
|
||
int nrefs; /*!< Reference count. */
|
||
};
|
||
|
||
/** \ingroup header
|
||
* Maximum no. of bytes permitted in a header.
|
||
*/
|
||
static const size_t headerMaxbytes = (256*1024*1024);
|
||
|
||
#define INDEX_MALLOC_SIZE 8
|
||
|
||
#define ENTRY_IS_REGION(_e) \
|
||
(((_e)->info.tag >= RPMTAG_HEADERIMAGE) && ((_e)->info.tag < RPMTAG_HEADERREGIONS))
|
||
#define ENTRY_IN_REGION(_e) ((_e)->info.offset < 0)
|
||
|
||
#define REGION_TAG_TYPE RPM_BIN_TYPE
|
||
#define REGION_TAG_COUNT sizeof(struct entryInfo_s)
|
||
|
||
/**
|
||
* Sanity check on no. of tags.
|
||
* This check imposes a limit of 65K tags, more than enough.
|
||
*/
|
||
#define HEADER_TAGS_MAX 0x0000ffff
|
||
#define hdrchkTags(_ntags) ((_ntags) & (~HEADER_TAGS_MAX))
|
||
|
||
/**
|
||
* Sanity check on tag values.
|
||
* Catches out nasties like negative values and multiple regions.
|
||
**/
|
||
#define hdrchkTag(_tag) ((_tag) < HEADER_I18NTABLE)
|
||
|
||
/**
|
||
* Reasonableness check on count values.
|
||
* Most types have further restrictions, these are just the outer perimeter.
|
||
*/
|
||
#define hdrchkCount(_dl, _count) ((_count) < 1 || (_count) > (_dl))
|
||
|
||
/**
|
||
* Sanity check on type values.
|
||
*/
|
||
#define hdrchkType(_type) ((_type) < RPM_MIN_TYPE || (_type) > RPM_MAX_TYPE)
|
||
|
||
/**
|
||
* Sanity check on array sizes, mainly to put a cap on number of files.
|
||
* A million files in a package still more than we're likely to really handle.
|
||
*/
|
||
#define HEADER_ARRAY_MAX 0x000fffff
|
||
#define hdrchkArray(_type, _count) ((_type) != RPM_BIN_TYPE && (_count) & (~HEADER_ARRAY_MAX))
|
||
|
||
/**
|
||
* Sanity check on data size and/or offset and/or count.
|
||
* This check imposes a limit of 256 MB -- file signatures
|
||
* may require a lot of space in the header.
|
||
*/
|
||
#define HEADER_DATA_MAX 0x0fffffff
|
||
#define hdrchkData(_nbytes) ((_nbytes) & (~HEADER_DATA_MAX))
|
||
|
||
/**
|
||
* Sanity check on data alignment for data type.
|
||
*/
|
||
#define hdrchkAlign(_type, _off) ((_off) & (typeAlign[_type]-1))
|
||
|
||
/**
|
||
* Sanity check on range of data offset.
|
||
*/
|
||
#define hdrchkRange(_dl, _off) ((_off) < 0 || (_off) > (_dl))
|
||
|
||
/* convert entry info to host endianess */
|
||
static inline void ei2h(const struct entryInfo_s *pe, struct entryInfo_s *info)
|
||
{
|
||
info->tag = ntohl(pe->tag);
|
||
info->type = ntohl(pe->type);
|
||
info->offset = ntohl(pe->offset);
|
||
info->count = ntohl(pe->count);
|
||
}
|
||
|
||
static int dataLength(uint32_t type, const void * p, uint32_t count,
|
||
int onDisk, const void * pend, uint32_t *length);
|
||
|
||
void hdrblobDigestUpdate(rpmDigestBundle bundle, struct hdrblob_s *blob)
|
||
{
|
||
uint32_t ildl[2] = { htonl(blob->ril), htonl(blob->rdl) };
|
||
|
||
rpmDigestBundleUpdate(bundle, rpm_header_magic, sizeof(rpm_header_magic));
|
||
rpmDigestBundleUpdate(bundle, ildl, sizeof(ildl));
|
||
rpmDigestBundleUpdate(bundle, blob->pe, (blob->ril * sizeof(*blob->pe)));
|
||
rpmDigestBundleUpdate(bundle, blob->dataStart, blob->rdl);
|
||
}
|
||
|
||
/* Check tag type matches our definition */
|
||
static int hdrchkTagType(uint32_t tag, uint32_t type)
|
||
{
|
||
rpmTagType t = rpmTagGetTagType(tag);
|
||
if (t == type)
|
||
return 0;
|
||
|
||
/* Permit unknown tags for forward compatibility */
|
||
if (t == RPM_NULL_TYPE)
|
||
return 0;
|
||
|
||
/* Some string tags harmlessly disagree on the exact type */
|
||
if (rpmTagGetClass(tag) == RPM_STRING_CLASS &&
|
||
(rpmTagTypeGetClass(type) == RPM_STRING_CLASS))
|
||
return 0;
|
||
|
||
/* Known tag with mismatching type, bad bad bad. */
|
||
return 1;
|
||
}
|
||
|
||
#ifndef htonll
|
||
/* Convert a 64bit value to network byte order. */
|
||
RPM_GNUC_CONST
|
||
static uint64_t htonll(uint64_t n)
|
||
{
|
||
#if __BYTE_ORDER__ == __ORDER_LITTLE_ENDIAN__
|
||
uint32_t *i = (uint32_t*)&n;
|
||
uint32_t b = i[0];
|
||
i[0] = htonl(i[1]);
|
||
i[1] = htonl(b);
|
||
#endif
|
||
return n;
|
||
}
|
||
#endif
|
||
|
||
Header headerLink(Header h)
|
||
{
|
||
if (h != NULL)
|
||
h->nrefs++;
|
||
return h;
|
||
}
|
||
|
||
static Header headerUnlink(Header h)
|
||
{
|
||
if (h != NULL)
|
||
h->nrefs--;
|
||
return NULL;
|
||
}
|
||
|
||
Header headerFree(Header h)
|
||
{
|
||
(void) headerUnlink(h);
|
||
|
||
if (h == NULL || h->nrefs > 0)
|
||
return NULL;
|
||
|
||
if (h->index) {
|
||
indexEntry entry = h->index;
|
||
int i;
|
||
for (i = 0; i < h->indexUsed; i++, entry++) {
|
||
if ((h->flags & HEADERFLAG_ALLOCATED) && ENTRY_IS_REGION(entry)) {
|
||
if (entry->length > 0) {
|
||
uint32_t * ei = entry->data;
|
||
if ((ei - 2) == h->blob) h->blob = _free(h->blob);
|
||
entry->data = NULL;
|
||
}
|
||
} else if (!ENTRY_IN_REGION(entry)) {
|
||
entry->data = _free(entry->data);
|
||
}
|
||
entry->data = NULL;
|
||
}
|
||
h->index = _free(h->index);
|
||
}
|
||
h->blob = _free(h->blob);
|
||
|
||
h = _free(h);
|
||
return NULL;
|
||
}
|
||
|
||
static Header headerCreate(void *blob, int32_t indexLen)
|
||
{
|
||
Header h = xcalloc(1, sizeof(*h));
|
||
if (blob) {
|
||
h->blob = blob;
|
||
h->indexAlloced = indexLen + 1;
|
||
h->indexUsed = indexLen;
|
||
} else {
|
||
h->indexAlloced = INDEX_MALLOC_SIZE;
|
||
h->indexUsed = 0;
|
||
}
|
||
h->instance = 0;
|
||
h->sorted = 0;
|
||
h->index = xcalloc(h->indexAlloced, sizeof(*h->index));
|
||
|
||
h->nrefs = 0;
|
||
return headerLink(h);
|
||
}
|
||
|
||
Header headerNew(void)
|
||
{
|
||
return headerCreate(NULL, 0);
|
||
}
|
||
|
||
static rpmRC hdrblobVerifyInfo(hdrblob blob, char **emsg)
|
||
{
|
||
struct entryInfo_s info;
|
||
uint32_t i, len = 0;
|
||
uint32_t end = 0;
|
||
const char *ds = (const char *) blob->dataStart;
|
||
uint32_t il = (blob->regionTag) ? blob->il-1 : blob->il;
|
||
entryInfo pe = (blob->regionTag) ? blob->pe+1 : blob->pe;
|
||
/* Can't typecheck signature header tags, sigh */
|
||
int typechk = (blob->regionTag == RPMTAG_HEADERIMMUTABLE ||
|
||
blob->regionTag == RPMTAG_HEADERIMAGE);
|
||
|
||
for (i = 0; i < il; i++) {
|
||
ei2h(&pe[i], &info);
|
||
|
||
/* Previous data must not overlap */
|
||
if (end > info.offset)
|
||
goto err;
|
||
|
||
if (hdrchkTag(info.tag))
|
||
goto err;
|
||
if (hdrchkType(info.type))
|
||
goto err;
|
||
if (hdrchkCount(blob->dl, info.count))
|
||
goto err;
|
||
if (hdrchkAlign(info.type, info.offset))
|
||
goto err;
|
||
if (hdrchkRange(blob->dl, info.offset))
|
||
goto err;
|
||
if (hdrchkArray(info.type, info.count))
|
||
goto err;
|
||
if (typechk && hdrchkTagType(info.tag, info.type))
|
||
goto err;
|
||
|
||
/* Verify the data actually fits */
|
||
if (dataLength(info.type, ds + info.offset,
|
||
info.count, 1, ds + blob->dl, &len)) {
|
||
goto err;
|
||
}
|
||
end = info.offset + len;
|
||
if (hdrchkRange(blob->dl, end) || len <= 0)
|
||
goto err;
|
||
if (blob->regionTag) {
|
||
/*
|
||
* Verify that the data does not overlap the region trailer. The
|
||
* region trailer is skipped by this loop, so the other checks
|
||
* don’t catch this case.
|
||
*/
|
||
if (end > blob->rdl - REGION_TAG_COUNT && info.offset < blob->rdl)
|
||
goto err;
|
||
}
|
||
}
|
||
return 0; /* Everything ok */
|
||
|
||
err:
|
||
if (emsg) {
|
||
rasprintf(emsg,
|
||
_("tag[%d]: BAD, tag %d type %d offset %d count %d len %d"),
|
||
i, info.tag, info.type, info.offset, info.count, len);
|
||
}
|
||
return i + 1;
|
||
}
|
||
|
||
static int indexCmp(const void * avp, const void * bvp)
|
||
{
|
||
indexEntry ap = (indexEntry) avp, bp = (indexEntry) bvp;
|
||
return (ap->info.tag - bp->info.tag);
|
||
}
|
||
|
||
static void headerSort(Header h)
|
||
{
|
||
if (!h->sorted) {
|
||
qsort(h->index, h->indexUsed, sizeof(*h->index), indexCmp);
|
||
h->sorted = 1;
|
||
}
|
||
}
|
||
|
||
static int offsetCmp(const void * avp, const void * bvp)
|
||
{
|
||
indexEntry ap = (indexEntry) avp, bp = (indexEntry) bvp;
|
||
int rc = (ap->info.offset - bp->info.offset);
|
||
|
||
if (rc == 0) {
|
||
/* Within a region, entries sort by address. Added drips sort by tag. */
|
||
if (ENTRY_IN_REGION(ap))
|
||
rc = (((char *)ap->data) - ((char *)bp->data));
|
||
else
|
||
rc = (ap->info.tag - bp->info.tag);
|
||
}
|
||
return rc;
|
||
}
|
||
|
||
static inline unsigned int alignDiff(uint32_t type, unsigned int alignsize)
|
||
{
|
||
int typesize = typeSizes[type];
|
||
|
||
if (typesize > 1) {
|
||
unsigned int diff = typesize - (alignsize % typesize);
|
||
if (diff != typesize)
|
||
return diff;
|
||
}
|
||
return 0;
|
||
}
|
||
|
||
unsigned headerSizeof(Header h, int magicp)
|
||
{
|
||
indexEntry entry;
|
||
unsigned int size = 0;
|
||
int i;
|
||
|
||
if (h == NULL)
|
||
return size;
|
||
|
||
headerSort(h);
|
||
|
||
if (magicp == HEADER_MAGIC_YES)
|
||
size += sizeof(rpm_header_magic);
|
||
|
||
size += 2 * sizeof(uint32_t); /* count of index entries */
|
||
|
||
for (i = 0, entry = h->index; i < h->indexUsed; i++, entry++) {
|
||
/* Regions go in as is ... */
|
||
if (ENTRY_IS_REGION(entry)) {
|
||
size += entry->length;
|
||
/* Reserve space for legacy region tag + data */
|
||
if (i == 0 && (h->flags & HEADERFLAG_LEGACY))
|
||
size += sizeof(struct entryInfo_s) + entry->info.count;
|
||
continue;
|
||
}
|
||
|
||
/* ... and region elements are skipped. */
|
||
if (ENTRY_IN_REGION(entry))
|
||
continue;
|
||
|
||
/* Alignment */
|
||
size += alignDiff(entry->info.type, size);
|
||
|
||
size += sizeof(struct entryInfo_s) + entry->length;
|
||
}
|
||
|
||
return size;
|
||
}
|
||
|
||
/*
|
||
* Header string (array) size calculation, bounded if end is non-NULL.
|
||
* Length is returned via *lenp, return zero on success, -1 on error.
|
||
*/
|
||
static inline int strtaglen(const char *str, uint32_t c, const char *end,
|
||
uint32_t *lenp)
|
||
{
|
||
const char *start = str;
|
||
const char *s = NULL;
|
||
int rc = -1; /* assume failure */
|
||
|
||
if (end) {
|
||
while (end > start && (s = memchr(start, '\0', end-start))) {
|
||
if (--c == 0)
|
||
break;
|
||
start = s + 1;
|
||
}
|
||
} else {
|
||
while ((s = strchr(start, '\0'))) {
|
||
if (--c == 0)
|
||
break;
|
||
start = s + 1;
|
||
}
|
||
}
|
||
|
||
if (s != NULL && c == 0) {
|
||
if (lenp)
|
||
*lenp = s - str + 1;
|
||
rc = 0;
|
||
}
|
||
|
||
return rc;
|
||
}
|
||
|
||
/**
|
||
* Return length of entry data.
|
||
* @param type entry data type
|
||
* @param p entry data
|
||
* @param count entry item count
|
||
* @param onDisk data is concatenated strings (with NUL's))?
|
||
* @param pend pointer to end of data (or NULL)
|
||
* @retval len data length
|
||
* @return 0 on success, -1 on failure
|
||
*/
|
||
static int dataLength(uint32_t type, const void * p, uint32_t count,
|
||
int onDisk, const void * pend, uint32_t *len)
|
||
{
|
||
const char * s = p;
|
||
const char * se = pend;
|
||
uint32_t length = 0;
|
||
|
||
switch (type) {
|
||
case RPM_STRING_TYPE:
|
||
if (count != 1)
|
||
return -1;
|
||
if (strtaglen(s, 1, se, &length))
|
||
return -1;
|
||
break;
|
||
|
||
case RPM_STRING_ARRAY_TYPE:
|
||
case RPM_I18NSTRING_TYPE:
|
||
/* These are like RPM_STRING_TYPE, except they're *always* an array */
|
||
/* Compute sum of length of all strings, including nul terminators */
|
||
|
||
if (onDisk) {
|
||
if (strtaglen(s, count, se, &length))
|
||
return -1;
|
||
} else {
|
||
const char ** av = (const char **)p;
|
||
while (count--) {
|
||
/* add one for null termination */
|
||
length += strlen(*av++) + 1;
|
||
}
|
||
}
|
||
break;
|
||
|
||
default:
|
||
if (typeSizes[type] == -1)
|
||
return -1;
|
||
length = typeSizes[(type & 0xf)] * count;
|
||
if (length < 0 || (se && se - s < length))
|
||
return -1;
|
||
break;
|
||
}
|
||
|
||
if (len)
|
||
*len = length;
|
||
|
||
return 0;
|
||
}
|
||
|
||
/** \ingroup header
|
||
* Swap uint32_t and uint16_t arrays within header region.
|
||
*
|
||
* If a header region tag is in the set to be swabbed, as the data for a
|
||
* a header region is located after all other tag data.
|
||
*
|
||
* @param entry header entry
|
||
* @param il no. of entries
|
||
* @param dl start no. bytes of data
|
||
* @param pe header physical entry pointer (swapped)
|
||
* @param dataStart header data start
|
||
* @param dataEnd header data end
|
||
* @param regionid region offset
|
||
* @param fast use offsets for data sizes if possible
|
||
* @retval nbytes no. bytes of data in region
|
||
* @return 0 on success, -1 on error
|
||
*/
|
||
static int regionSwab(indexEntry entry, uint32_t il, uint32_t dl,
|
||
entryInfo pe,
|
||
unsigned char * dataStart,
|
||
const unsigned char * dataEnd,
|
||
int regionid, int fast, uint32_t *nbytes)
|
||
{
|
||
if ((entry != NULL && regionid >= 0) || (entry == NULL && regionid != 0))
|
||
return -1;
|
||
|
||
for (; il > 0; il--, pe++) {
|
||
struct indexEntry_s ie;
|
||
|
||
ei2h(pe, &ie.info);
|
||
|
||
if (hdrchkType(ie.info.type))
|
||
return -1;
|
||
if (hdrchkData(ie.info.count))
|
||
return -1;
|
||
if (hdrchkData(ie.info.offset))
|
||
return -1;
|
||
if (hdrchkAlign(ie.info.type, ie.info.offset))
|
||
return -1;
|
||
|
||
ie.data = dataStart + ie.info.offset;
|
||
if (dataEnd && (unsigned char *)ie.data >= dataEnd)
|
||
return -1;
|
||
|
||
/* The offset optimization is only relevant for string types */
|
||
if (fast && il > 1 && typeSizes[ie.info.type] == -1) {
|
||
ie.length = ntohl(pe[1].offset) - ie.info.offset;
|
||
} else {
|
||
if (dataLength(ie.info.type, ie.data, ie.info.count,
|
||
1, dataEnd, &ie.length)) {
|
||
return -1;
|
||
}
|
||
}
|
||
if (ie.length < 0 || hdrchkData(ie.length))
|
||
return -1;
|
||
|
||
ie.rdlen = 0;
|
||
|
||
if (entry) {
|
||
ie.info.offset = regionid;
|
||
*entry = ie; /* structure assignment */
|
||
entry++;
|
||
}
|
||
|
||
/* Alignment */
|
||
dl += alignDiff(ie.info.type, dl);
|
||
|
||
/* Perform endian conversions */
|
||
switch (ntohl(pe->type)) {
|
||
case RPM_INT64_TYPE:
|
||
{ uint64_t * it = ie.data;
|
||
for (; ie.info.count > 0; ie.info.count--, it += 1) {
|
||
if (dataEnd && ((unsigned char *)it) >= dataEnd)
|
||
return -1;
|
||
*it = htonll(*it);
|
||
}
|
||
} break;
|
||
case RPM_INT32_TYPE:
|
||
{ uint32_t * it = ie.data;
|
||
for (; ie.info.count > 0; ie.info.count--, it += 1) {
|
||
if (dataEnd && ((unsigned char *)it) >= dataEnd)
|
||
return -1;
|
||
*it = htonl(*it);
|
||
}
|
||
} break;
|
||
case RPM_INT16_TYPE:
|
||
{ uint16_t * it = ie.data;
|
||
for (; ie.info.count > 0; ie.info.count--, it += 1) {
|
||
if (dataEnd && ((unsigned char *)it) >= dataEnd)
|
||
return -1;
|
||
*it = htons(*it);
|
||
}
|
||
} break;
|
||
}
|
||
|
||
dl += ie.length;
|
||
}
|
||
|
||
if (nbytes)
|
||
*nbytes = dl;
|
||
return 0;
|
||
}
|
||
|
||
static void * doExport(const struct indexEntry_s *hindex, int indexUsed,
|
||
headerFlags flags, unsigned int *bsize)
|
||
{
|
||
uint32_t * ei = NULL;
|
||
entryInfo pe;
|
||
char * dataStart;
|
||
char * te;
|
||
unsigned len, diff;
|
||
uint32_t il = 0;
|
||
uint32_t dl = 0;
|
||
indexEntry entry;
|
||
int i;
|
||
uint32_t drlen, ndribbles;
|
||
size_t ilen = indexUsed * sizeof(struct indexEntry_s);
|
||
indexEntry index = memcpy(xmalloc(ilen), hindex, ilen);
|
||
|
||
/* Sort entries by (offset,tag). */
|
||
qsort(index, indexUsed, sizeof(*index), offsetCmp);
|
||
|
||
/* Compute (il,dl) for all tags, including those deleted in region. */
|
||
drlen = ndribbles = 0;
|
||
for (i = 0, entry = index; i < indexUsed; i++, entry++) {
|
||
if (ENTRY_IS_REGION(entry)) {
|
||
uint32_t rdl = -entry->info.offset; /* negative offset */
|
||
uint32_t ril = rdl/sizeof(*pe);
|
||
int rid = entry->info.offset;
|
||
|
||
il += ril;
|
||
dl += entry->rdlen + entry->info.count;
|
||
/* Reserve space for legacy region tag */
|
||
if (i == 0 && (flags & HEADERFLAG_LEGACY))
|
||
il += 1;
|
||
|
||
/* Skip rest of entries in region, but account for dribbles. */
|
||
for (; i < indexUsed && entry->info.offset <= rid+1; i++, entry++) {
|
||
if (entry->info.offset <= rid)
|
||
continue;
|
||
|
||
/* Alignment */
|
||
diff = alignDiff(entry->info.type, dl);
|
||
if (diff) {
|
||
drlen += diff;
|
||
dl += diff;
|
||
}
|
||
|
||
ndribbles++;
|
||
il++;
|
||
drlen += entry->length;
|
||
dl += entry->length;
|
||
}
|
||
i--;
|
||
entry--;
|
||
continue;
|
||
}
|
||
|
||
/* Ignore deleted drips. */
|
||
if (entry->data == NULL || entry->length <= 0)
|
||
continue;
|
||
|
||
/* Alignment */
|
||
dl += alignDiff(entry->info.type, dl);
|
||
|
||
il++;
|
||
dl += entry->length;
|
||
}
|
||
|
||
/* Sanity checks on header intro. */
|
||
if (hdrchkTags(il) || hdrchkData(dl))
|
||
goto errxit;
|
||
|
||
len = sizeof(il) + sizeof(dl) + (il * sizeof(*pe)) + dl;
|
||
|
||
ei = xmalloc(len);
|
||
ei[0] = htonl(il);
|
||
ei[1] = htonl(dl);
|
||
|
||
pe = (entryInfo) &ei[2];
|
||
dataStart = te = (char *) (pe + il);
|
||
|
||
for (i = 0, entry = index; i < indexUsed; i++, entry++) {
|
||
const char * src;
|
||
unsigned char *t;
|
||
uint32_t count;
|
||
uint32_t rdlen;
|
||
unsigned int diff;
|
||
|
||
if (entry->data == NULL || entry->length <= 0)
|
||
continue;
|
||
|
||
t = (unsigned char*)te;
|
||
pe->tag = htonl(entry->info.tag);
|
||
pe->type = htonl(entry->info.type);
|
||
pe->count = htonl(entry->info.count);
|
||
|
||
if (ENTRY_IS_REGION(entry)) {
|
||
uint32_t rdl = -entry->info.offset; /* negative offset */
|
||
uint32_t ril = rdl/sizeof(*pe) + ndribbles;
|
||
int rid = entry->info.offset;
|
||
|
||
src = (char *)entry->data;
|
||
rdlen = entry->rdlen;
|
||
|
||
/* Legacy headers don't have regions originally, create one */
|
||
if (i == 0 && (flags & HEADERFLAG_LEGACY)) {
|
||
int32_t stei[4];
|
||
|
||
memcpy(pe+1, src, rdl);
|
||
memcpy(te, src + rdl, rdlen);
|
||
te += rdlen;
|
||
|
||
pe->offset = htonl(te - dataStart);
|
||
stei[0] = pe->tag;
|
||
stei[1] = pe->type;
|
||
stei[2] = htonl(-rdl-entry->info.count);
|
||
stei[3] = pe->count;
|
||
memcpy(te, stei, entry->info.count);
|
||
te += entry->info.count;
|
||
ril++;
|
||
rdlen += entry->info.count;
|
||
|
||
if (regionSwab(NULL, ril, 0, pe, t, NULL, 0, 0, &count))
|
||
goto errxit;
|
||
if (count != rdlen)
|
||
goto errxit;
|
||
|
||
} else {
|
||
|
||
memcpy(pe+1, src + sizeof(*pe), ((ril-1) * sizeof(*pe)));
|
||
memcpy(te, src + (ril * sizeof(*pe)), rdlen+entry->info.count+drlen);
|
||
te += rdlen;
|
||
{
|
||
entryInfo se = (entryInfo)src;
|
||
int off = ntohl(se->offset);
|
||
pe->offset = (off) ? htonl(te - dataStart) : htonl(off);
|
||
}
|
||
te += entry->info.count + drlen;
|
||
|
||
if (regionSwab(NULL, ril, 0, pe, t, NULL, 0, 0, &count))
|
||
goto errxit;
|
||
if (count != (rdlen + entry->info.count + drlen))
|
||
goto errxit;
|
||
}
|
||
|
||
/* Skip rest of entries in region. */
|
||
while (i < indexUsed && entry->info.offset <= rid+1) {
|
||
i++;
|
||
entry++;
|
||
}
|
||
i--;
|
||
entry--;
|
||
pe += ril;
|
||
continue;
|
||
}
|
||
|
||
/* Ignore deleted drips. */
|
||
if (entry->data == NULL || entry->length <= 0)
|
||
continue;
|
||
|
||
/* Alignment */
|
||
diff = alignDiff(entry->info.type, (te - dataStart));
|
||
if (diff) {
|
||
memset(te, 0, diff);
|
||
te += diff;
|
||
}
|
||
|
||
pe->offset = htonl(te - dataStart);
|
||
|
||
/* copy data w/ endian conversions */
|
||
switch (entry->info.type) {
|
||
case RPM_INT64_TYPE:
|
||
count = entry->info.count;
|
||
src = entry->data;
|
||
while (count--) {
|
||
*((uint64_t *)te) = htonll(*((uint64_t *)src));
|
||
te += sizeof(uint64_t);
|
||
src += sizeof(uint64_t);
|
||
}
|
||
break;
|
||
|
||
case RPM_INT32_TYPE:
|
||
count = entry->info.count;
|
||
src = entry->data;
|
||
while (count--) {
|
||
*((uint32_t *)te) = htonl(*((uint32_t *)src));
|
||
te += sizeof(uint32_t);
|
||
src += sizeof(uint32_t);
|
||
}
|
||
break;
|
||
|
||
case RPM_INT16_TYPE:
|
||
count = entry->info.count;
|
||
src = entry->data;
|
||
while (count--) {
|
||
*((uint16_t *)te) = htons(*((uint16_t *)src));
|
||
te += sizeof(uint16_t);
|
||
src += sizeof(uint16_t);
|
||
}
|
||
break;
|
||
|
||
default:
|
||
memcpy(te, entry->data, entry->length);
|
||
te += entry->length;
|
||
break;
|
||
}
|
||
pe++;
|
||
}
|
||
|
||
/* Insure that there are no memcpy underruns/overruns. */
|
||
if (((char *)pe) != dataStart)
|
||
goto errxit;
|
||
if ((((char *)ei)+len) != te)
|
||
goto errxit;
|
||
|
||
if (bsize)
|
||
*bsize = len;
|
||
|
||
free(index);
|
||
return (void *) ei;
|
||
|
||
errxit:
|
||
free(ei);
|
||
free(index);
|
||
return NULL;
|
||
}
|
||
|
||
void * headerExport(Header h, unsigned int *bsize)
|
||
{
|
||
void *blob = NULL;
|
||
|
||
if (h) {
|
||
blob = doExport(h->index, h->indexUsed, h->flags, bsize);
|
||
}
|
||
|
||
return blob;
|
||
}
|
||
|
||
/**
|
||
* Find matching (tag,type) entry in header.
|
||
* @param h header
|
||
* @param tag entry tag
|
||
* @param type entry type
|
||
* @return header entry
|
||
*/
|
||
static
|
||
indexEntry findEntry(Header h, rpmTagVal tag, uint32_t type)
|
||
{
|
||
indexEntry entry;
|
||
struct indexEntry_s key;
|
||
|
||
if (h == NULL) return NULL;
|
||
headerSort(h);
|
||
|
||
key.info.tag = tag;
|
||
|
||
entry = bsearch(&key, h->index, h->indexUsed, sizeof(*h->index), indexCmp);
|
||
if (entry == NULL)
|
||
return NULL;
|
||
|
||
if (type == RPM_NULL_TYPE)
|
||
return entry;
|
||
|
||
/* look backwards */
|
||
while (entry->info.tag == tag && entry->info.type != type &&
|
||
entry > h->index) entry--;
|
||
|
||
if (entry->info.tag == tag && entry->info.type == type)
|
||
return entry;
|
||
|
||
return NULL;
|
||
}
|
||
|
||
int headerDel(Header h, rpmTagVal tag)
|
||
{
|
||
indexEntry last = h->index + h->indexUsed;
|
||
indexEntry entry, first;
|
||
int ne;
|
||
|
||
entry = findEntry(h, tag, RPM_NULL_TYPE);
|
||
if (!entry) return 1;
|
||
|
||
/* Make sure entry points to the first occurrence of this tag. */
|
||
while (entry > h->index && (entry - 1)->info.tag == tag)
|
||
entry--;
|
||
|
||
/* Free data for tags being removed. */
|
||
for (first = entry; first < last; first++) {
|
||
void * data;
|
||
if (first->info.tag != tag)
|
||
break;
|
||
data = first->data;
|
||
first->data = NULL;
|
||
first->length = 0;
|
||
if (ENTRY_IN_REGION(first))
|
||
continue;
|
||
free(data);
|
||
}
|
||
|
||
ne = (first - entry);
|
||
if (ne > 0) {
|
||
h->indexUsed -= ne;
|
||
ne = last - first;
|
||
if (ne > 0)
|
||
memmove(entry, first, (ne * sizeof(*entry)));
|
||
}
|
||
|
||
return 0;
|
||
}
|
||
|
||
rpmRC hdrblobImport(hdrblob blob, int fast, Header *hdrp, char **emsg)
|
||
{
|
||
Header h = NULL;
|
||
indexEntry entry;
|
||
uint32_t rdlen;
|
||
|
||
h = headerCreate(blob->ei, blob->il);
|
||
|
||
entry = h->index;
|
||
if (!(htonl(blob->pe->tag) < RPMTAG_HEADERI18NTABLE)) {
|
||
/* An original v3 header, create a legacy region entry for it */
|
||
h->flags |= HEADERFLAG_LEGACY;
|
||
entry->info.type = REGION_TAG_TYPE;
|
||
entry->info.tag = RPMTAG_HEADERIMAGE;
|
||
entry->info.count = REGION_TAG_COUNT;
|
||
entry->info.offset = ((unsigned char *)blob->pe - blob->dataStart); /* negative offset */
|
||
|
||
entry->data = blob->pe;
|
||
entry->length = blob->pvlen - sizeof(blob->il) - sizeof(blob->dl);
|
||
if (regionSwab(entry+1, blob->il, 0, blob->pe,
|
||
blob->dataStart, blob->dataEnd,
|
||
entry->info.offset, fast, &rdlen)) {
|
||
goto errxit;
|
||
}
|
||
if (rdlen != blob->dl)
|
||
goto errxit;
|
||
entry->rdlen = rdlen;
|
||
h->indexUsed++;
|
||
} else {
|
||
/* Either a v4 header or an "upgraded" v3 header with a legacy region */
|
||
uint32_t ril, offset;
|
||
|
||
h->flags &= ~HEADERFLAG_LEGACY;
|
||
ei2h(blob->pe, &entry->info);
|
||
ril = (entry->info.offset != 0) ? blob->ril : blob->il;
|
||
|
||
offset = ril * sizeof(*blob->pe);
|
||
if (offset >= INT32_MAX)
|
||
goto errxit;
|
||
entry->info.offset = -offset; /* negative offset */
|
||
entry->data = blob->pe;
|
||
entry->length = blob->pvlen - sizeof(blob->il) - sizeof(blob->dl);
|
||
if (regionSwab(entry+1, ril-1, 0, blob->pe+1,
|
||
blob->dataStart, blob->dataEnd,
|
||
entry->info.offset, fast, &rdlen)) {
|
||
goto errxit;
|
||
}
|
||
entry->rdlen = rdlen;
|
||
|
||
if (ril < h->indexUsed) {
|
||
indexEntry newEntry = entry + ril;
|
||
int ne = (h->indexUsed - ril);
|
||
int rid = entry->info.offset+1;
|
||
|
||
/* Load dribble entries from region. */
|
||
if (regionSwab(newEntry, ne, rdlen, blob->pe+ril,
|
||
blob->dataStart, blob->dataEnd, rid, fast, &rdlen)) {
|
||
goto errxit;
|
||
}
|
||
|
||
{ indexEntry firstEntry = newEntry;
|
||
int save = h->indexUsed;
|
||
int j;
|
||
|
||
/* Dribble entries replace duplicate region entries. */
|
||
h->indexUsed -= ne;
|
||
for (j = 0; j < ne; j++, newEntry++) {
|
||
(void) headerDel(h, newEntry->info.tag);
|
||
if (newEntry->info.tag == RPMTAG_BASENAMES)
|
||
(void) headerDel(h, RPMTAG_OLDFILENAMES);
|
||
}
|
||
|
||
/* If any duplicate entries were replaced, move new entries down. */
|
||
if (h->indexUsed < (save - ne)) {
|
||
memmove(h->index + h->indexUsed, firstEntry,
|
||
(ne * sizeof(*entry)));
|
||
}
|
||
h->indexUsed += ne;
|
||
}
|
||
}
|
||
|
||
rdlen += REGION_TAG_COUNT;
|
||
|
||
if (rdlen != blob->dl)
|
||
goto errxit;
|
||
}
|
||
|
||
/* Force sorting, dribble lookups can cause early sort on partial header */
|
||
h->sorted = 0;
|
||
headerSort(h);
|
||
h->flags |= HEADERFLAG_ALLOCATED;
|
||
*hdrp = h;
|
||
|
||
/* We own the memory now, avoid double-frees */
|
||
blob->ei = NULL;
|
||
|
||
return RPMRC_OK;
|
||
|
||
errxit:
|
||
if (h) {
|
||
free(h->index);
|
||
free(h);
|
||
rasprintf(emsg, _("hdr load: BAD"));
|
||
}
|
||
return RPMRC_FAIL;
|
||
}
|
||
|
||
Header headerReload(Header h, rpmTagVal tag)
|
||
{
|
||
Header nh;
|
||
unsigned int uc = 0;
|
||
void * uh = headerExport(h, &uc);
|
||
|
||
h = headerFree(h);
|
||
if (uh == NULL)
|
||
return NULL;
|
||
nh = headerImport(uh, uc, 0);
|
||
if (nh == NULL) {
|
||
uh = _free(uh);
|
||
return NULL;
|
||
}
|
||
if (ENTRY_IS_REGION(nh->index)) {
|
||
if (tag == RPMTAG_HEADERSIGNATURES || tag == RPMTAG_HEADERIMMUTABLE)
|
||
nh->index[0].info.tag = tag;
|
||
}
|
||
return nh;
|
||
}
|
||
|
||
Header headerRead(FD_t fd, int magicp)
|
||
{
|
||
Header h = NULL;
|
||
struct hdrblob_s blob;
|
||
char *buf = NULL;
|
||
|
||
if (hdrblobRead(fd, magicp, 0, 0, &blob, &buf) == RPMRC_OK)
|
||
hdrblobImport(&blob, 0, &h, &buf);
|
||
|
||
free(buf);
|
||
return h;
|
||
}
|
||
|
||
int headerWrite(FD_t fd, Header h, int magicp)
|
||
{
|
||
ssize_t nb;
|
||
unsigned int length;
|
||
void * uh = headerExport(h, &length);
|
||
|
||
if (uh == NULL)
|
||
return 1;
|
||
|
||
if (magicp == HEADER_MAGIC_YES) {
|
||
nb = Fwrite(rpm_header_magic, sizeof(rpm_header_magic), 1, fd);
|
||
if (nb != sizeof(rpm_header_magic))
|
||
goto exit;
|
||
}
|
||
|
||
nb = Fwrite(uh, sizeof(char), length, fd);
|
||
|
||
exit:
|
||
free(uh);
|
||
return (nb == length ? 0 : 1);
|
||
}
|
||
|
||
int headerIsEntry(Header h, rpmTagVal tag)
|
||
{
|
||
/* FIX: h modified by sort. */
|
||
return (findEntry(h, tag, RPM_NULL_TYPE) ? 1 : 0);
|
||
|
||
}
|
||
|
||
/* simple heuristic to find out if the header is from * a source rpm
|
||
* or not: source rpms contain at least the spec file and have all
|
||
* files in one directory with an empty name.
|
||
*/
|
||
int headerIsSourceHeuristic(Header h)
|
||
{
|
||
indexEntry entry = findEntry(h, RPMTAG_DIRNAMES, RPM_STRING_ARRAY_TYPE);
|
||
return entry && entry->info.count == 1 && entry->data && !*(const char *)entry->data;
|
||
}
|
||
|
||
/** \ingroup header
|
||
* Retrieve data from header entry.
|
||
* Relevant flags (others are ignored), if neither is set allocation
|
||
* behavior depends on data type(!)
|
||
* HEADERGET_MINMEM: return pointers to header memory
|
||
* HEADERGET_ALLOC: always return malloced memory, overrides MINMEM
|
||
*
|
||
* @todo Permit retrieval of regions other than HEADER_IMUTABLE.
|
||
* @param entry header entry
|
||
* @param td tag data container
|
||
* @param flags flags to control memory allocation
|
||
* @return 1 on success, otherwise error.
|
||
*/
|
||
static int copyTdEntry(const indexEntry entry, rpmtd td, headerGetFlags flags)
|
||
{
|
||
uint32_t count = entry->info.count;
|
||
int rc = 1; /* XXX 1 on success. */
|
||
/* ALLOC overrides MINMEM */
|
||
int allocMem = flags & HEADERGET_ALLOC;
|
||
int minMem = allocMem ? 0 : flags & HEADERGET_MINMEM;
|
||
int argvArray = (flags & HEADERGET_ARGV) ? 1 : 0;
|
||
|
||
assert(td != NULL);
|
||
td->flags = RPMTD_IMMUTABLE;
|
||
switch (entry->info.type) {
|
||
case RPM_BIN_TYPE:
|
||
/*
|
||
* XXX This only works for
|
||
* XXX "sealed" HEADER_IMMUTABLE/HEADER_SIGNATURES/HEADER_IMAGE.
|
||
* XXX This will *not* work for unsealed legacy HEADER_IMAGE (i.e.
|
||
* XXX a legacy header freshly read, but not yet unloaded to the rpmdb).
|
||
*/
|
||
if (ENTRY_IS_REGION(entry)) {
|
||
uint32_t * ei = ((uint32_t *)entry->data) - 2;
|
||
entryInfo pe = (entryInfo) (ei + 2);
|
||
unsigned char * dataStart = (unsigned char *) (pe + ntohl(ei[0]));
|
||
uint32_t rdl = -entry->info.offset; /* negative offset */
|
||
uint32_t ril = rdl/sizeof(*pe);
|
||
|
||
rdl = entry->rdlen;
|
||
count = 2 * sizeof(*ei) + (ril * sizeof(*pe)) + rdl;
|
||
if (entry->info.tag == RPMTAG_HEADERIMAGE) {
|
||
ril -= 1;
|
||
pe += 1;
|
||
} else {
|
||
count += REGION_TAG_COUNT;
|
||
rdl += REGION_TAG_COUNT;
|
||
}
|
||
|
||
td->data = xmalloc(count);
|
||
ei = (uint32_t *) td->data;
|
||
ei[0] = htonl(ril);
|
||
ei[1] = htonl(rdl);
|
||
|
||
pe = (entryInfo) memcpy(ei + 2, pe, (ril * sizeof(*pe)));
|
||
|
||
dataStart = (unsigned char *) memcpy(pe + ril, dataStart, rdl);
|
||
|
||
rc = regionSwab(NULL, ril, 0, pe, dataStart, dataStart + rdl,
|
||
0, 0, NULL);
|
||
/* don't return data on failure */
|
||
if (rc < 0) {
|
||
td->data = _free(td->data);
|
||
}
|
||
/* XXX 1 on success. */
|
||
rc = (rc < 0) ? 0 : 1;
|
||
} else {
|
||
td->data = (!minMem
|
||
? memcpy(xmalloc(count), entry->data, count)
|
||
: entry->data);
|
||
}
|
||
break;
|
||
case RPM_STRING_TYPE:
|
||
/* simple string, but fallthrough if its actually an array */
|
||
if (count == 1 && !argvArray) {
|
||
td->data = allocMem ? xstrdup(entry->data) : entry->data;
|
||
break;
|
||
}
|
||
case RPM_STRING_ARRAY_TYPE:
|
||
case RPM_I18NSTRING_TYPE:
|
||
{ const char ** ptrEntry;
|
||
int tableSize = (count + argvArray) * sizeof(char *);
|
||
char * t;
|
||
int i;
|
||
|
||
if (minMem) {
|
||
td->data = xmalloc(tableSize);
|
||
ptrEntry = (const char **) td->data;
|
||
t = entry->data;
|
||
} else {
|
||
t = xmalloc(tableSize + entry->length);
|
||
td->data = (void *)t;
|
||
ptrEntry = (const char **) td->data;
|
||
t += tableSize;
|
||
memcpy(t, entry->data, entry->length);
|
||
}
|
||
for (i = 0; i < count; i++) {
|
||
*ptrEntry++ = t;
|
||
t = strchr(t, 0);
|
||
t++;
|
||
}
|
||
if (argvArray) {
|
||
*ptrEntry = NULL;
|
||
td->flags |= RPMTD_ARGV;
|
||
}
|
||
} break;
|
||
case RPM_CHAR_TYPE:
|
||
case RPM_INT8_TYPE:
|
||
case RPM_INT16_TYPE:
|
||
case RPM_INT32_TYPE:
|
||
case RPM_INT64_TYPE:
|
||
if (allocMem) {
|
||
td->data = xmalloc(entry->length);
|
||
memcpy(td->data, entry->data, entry->length);
|
||
} else {
|
||
td->data = entry->data;
|
||
}
|
||
break;
|
||
default:
|
||
/* WTH? Don't mess with unknown data types... */
|
||
rc = 0;
|
||
td->data = NULL;
|
||
break;
|
||
}
|
||
td->type = entry->info.type;
|
||
td->count = count;
|
||
td->size = entry->length;
|
||
|
||
if (td->data && entry->data != td->data) {
|
||
td->flags |= RPMTD_ALLOCED;
|
||
}
|
||
|
||
return rc;
|
||
}
|
||
|
||
/**
|
||
* Does locale match entry in header i18n table?
|
||
*
|
||
* \verbatim
|
||
* The range [l,le) contains the next locale to match:
|
||
* ll[_CC][.EEEEE][@dddd]
|
||
* where
|
||
* ll ISO language code (in lowercase).
|
||
* CC (optional) ISO coutnry code (in uppercase).
|
||
* EEEEE (optional) encoding (not really standardized).
|
||
* dddd (optional) dialect.
|
||
* \endverbatim
|
||
*
|
||
* @param td header i18n table data, NUL terminated
|
||
* @param l start of locale to match
|
||
* @param le end of locale to match
|
||
* @return 1 on good match, 2 on weak match, 0 on no match
|
||
*/
|
||
static int headerMatchLocale(const char *td, const char *l, const char *le)
|
||
{
|
||
const char *fe;
|
||
|
||
/* First try a complete match. */
|
||
if (strlen(td) == (le-l) && rstreqn(td, l, (le - l)))
|
||
return 1;
|
||
|
||
/* Next, try stripping optional dialect and matching. */
|
||
for (fe = l; fe < le && *fe != '@'; fe++)
|
||
{};
|
||
if (fe < le && rstreqn(td, l, (fe - l)))
|
||
return 1;
|
||
|
||
/* Next, try stripping optional codeset and matching. */
|
||
for (fe = l; fe < le && *fe != '.'; fe++)
|
||
{};
|
||
if (fe < le && rstreqn(td, l, (fe - l)))
|
||
return 1;
|
||
|
||
/* Finally, try stripping optional country code and matching. */
|
||
for (fe = l; fe < le && *fe != '_'; fe++)
|
||
{};
|
||
if (fe < le && rstreqn(td, l, (fe - l)))
|
||
return 2;
|
||
|
||
return 0;
|
||
}
|
||
|
||
/**
|
||
* Return i18n string from header that matches locale.
|
||
* @param h header
|
||
* @param entry i18n string data
|
||
* @param[out] td tag data container
|
||
* @param flags flags to control allocation
|
||
* @return 1 always
|
||
*/
|
||
static int copyI18NEntry(Header h, indexEntry entry, rpmtd td,
|
||
headerGetFlags flags)
|
||
{
|
||
const char *lang, *l, *le;
|
||
indexEntry table;
|
||
|
||
td->type = RPM_STRING_TYPE;
|
||
td->count = 1;
|
||
/* if no match, just return the first string */
|
||
td->data = entry->data;
|
||
|
||
/* XXX Drepper sez' this is the order. */
|
||
if ((lang = getenv("LANGUAGE")) == NULL &&
|
||
(lang = getenv("LC_ALL")) == NULL &&
|
||
(lang = getenv("LC_MESSAGES")) == NULL &&
|
||
(lang = getenv("LANG")) == NULL)
|
||
goto exit;
|
||
|
||
if ((table = findEntry(h, RPMTAG_HEADERI18NTABLE, RPM_STRING_ARRAY_TYPE)) == NULL)
|
||
goto exit;
|
||
|
||
for (l = lang; *l != '\0'; l = le) {
|
||
const char *t;
|
||
char *ed, *ed_weak = NULL;
|
||
int langNum;
|
||
|
||
while (*l && *l == ':') /* skip leading colons */
|
||
l++;
|
||
if (*l == '\0')
|
||
break;
|
||
for (le = l; *le && *le != ':'; le++) /* find end of this locale */
|
||
{};
|
||
|
||
/* For each entry in the header ... */
|
||
for (langNum = 0, t = table->data, ed = entry->data;
|
||
langNum < entry->info.count && langNum < table->info.count;
|
||
langNum++, t += strlen(t) + 1, ed += strlen(ed) + 1) {
|
||
|
||
int match = headerMatchLocale(t, l, le);
|
||
if (match == 1) {
|
||
td->data = ed;
|
||
goto exit;
|
||
} else if (match == 2) {
|
||
ed_weak = ed;
|
||
}
|
||
}
|
||
if (ed_weak) {
|
||
td->data = ed_weak;
|
||
goto exit;
|
||
}
|
||
}
|
||
|
||
exit:
|
||
if (flags & HEADERGET_ALLOC) {
|
||
td->data = xstrdup(td->data);
|
||
td->flags |= RPMTD_ALLOCED;
|
||
}
|
||
|
||
return 1;
|
||
}
|
||
|
||
/**
|
||
* Retrieve tag data from header.
|
||
* @param h header
|
||
* @param[out] td tag data container
|
||
* @param flags flags to control retrieval
|
||
* @return 1 on success, 0 on not found
|
||
*/
|
||
static int intGetTdEntry(Header h, rpmtd td, headerGetFlags flags)
|
||
{
|
||
indexEntry entry;
|
||
int rc;
|
||
|
||
/* First find the tag */
|
||
/* FIX: h modified by sort. */
|
||
entry = findEntry(h, td->tag, RPM_NULL_TYPE);
|
||
if (entry == NULL) {
|
||
/* Td is zeroed above, just return... */
|
||
return 0;
|
||
}
|
||
|
||
if (entry->info.type == RPM_I18NSTRING_TYPE && !(flags & HEADERGET_RAW))
|
||
rc = copyI18NEntry(h, entry, td, flags);
|
||
else
|
||
rc = copyTdEntry(entry, td, flags);
|
||
|
||
if (rc == 0)
|
||
td->flags |= RPMTD_INVALID;
|
||
|
||
/* XXX 1 on success */
|
||
return ((rc == 1) ? 1 : 0);
|
||
}
|
||
|
||
int headerGet(Header h, rpmTagVal tag, rpmtd td, headerGetFlags flags)
|
||
{
|
||
int rc;
|
||
headerTagTagFunction tagfunc = intGetTdEntry;
|
||
|
||
if (td == NULL) return 0;
|
||
|
||
rpmtdReset(td);
|
||
td->tag = tag;
|
||
|
||
if (flags & HEADERGET_EXT) {
|
||
headerTagTagFunction extfunc = rpmHeaderTagFunc(tag);
|
||
if (extfunc) tagfunc = extfunc;
|
||
}
|
||
rc = tagfunc(h, td, flags);
|
||
|
||
assert(tag == td->tag);
|
||
return rc;
|
||
}
|
||
|
||
/**
|
||
*/
|
||
static void copyData(uint32_t type, void * dstPtr,
|
||
const void * srcPtr, uint32_t cnt, uint32_t dataLength)
|
||
{
|
||
switch (type) {
|
||
case RPM_STRING_ARRAY_TYPE:
|
||
case RPM_I18NSTRING_TYPE:
|
||
{ const char ** av = (const char **) srcPtr;
|
||
char * t = dstPtr;
|
||
|
||
while (cnt-- > 0 && dataLength > 0) {
|
||
const char * s;
|
||
if ((s = *av++) == NULL)
|
||
continue;
|
||
do {
|
||
*t++ = *s++;
|
||
} while (s[-1] && --dataLength > 0);
|
||
}
|
||
} break;
|
||
|
||
default:
|
||
memmove(dstPtr, srcPtr, dataLength);
|
||
break;
|
||
}
|
||
}
|
||
|
||
/**
|
||
* Return (malloc'ed) copy of entry data.
|
||
* @param type entry data type
|
||
* @param p entry data
|
||
* @param c entry item count
|
||
* @param[out] lengthPtr no. bytes in returned data
|
||
* @return (malloc'ed) copy of entry data, NULL on error
|
||
*/
|
||
static void *
|
||
grabData(uint32_t type, const void * p, uint32_t c, uint32_t * lengthPtr)
|
||
{
|
||
void * data = NULL;
|
||
uint32_t length;
|
||
|
||
if (dataLength(type, p, c, 0, NULL, &length))
|
||
return NULL;
|
||
|
||
if (length > 0) {
|
||
data = xmalloc(length);
|
||
copyData(type, data, p, c, length);
|
||
}
|
||
|
||
if (lengthPtr)
|
||
*lengthPtr = length;
|
||
return data;
|
||
}
|
||
|
||
static int intAddEntry(Header h, rpmtd td)
|
||
{
|
||
indexEntry entry;
|
||
void * data;
|
||
uint32_t length = 0;
|
||
|
||
/* Count must always be >= 1 for headerAddEntry. */
|
||
if (td->count <= 0)
|
||
return 0;
|
||
|
||
if (hdrchkType(td->type))
|
||
return 0;
|
||
if (hdrchkData(td->count))
|
||
return 0;
|
||
if (hdrchkArray(td->type, td->count))
|
||
return 0;
|
||
|
||
data = grabData(td->type, td->data, td->count, &length);
|
||
if (data == NULL)
|
||
return 0;
|
||
|
||
/* Allocate more index space if necessary */
|
||
if (h->indexUsed == h->indexAlloced) {
|
||
h->indexAlloced += INDEX_MALLOC_SIZE;
|
||
h->index = xrealloc(h->index, h->indexAlloced * sizeof(*h->index));
|
||
}
|
||
|
||
/* Fill in the index */
|
||
entry = h->index + h->indexUsed;
|
||
entry->info.tag = td->tag;
|
||
entry->info.type = td->type;
|
||
entry->info.count = td->count;
|
||
entry->info.offset = 0;
|
||
entry->data = data;
|
||
entry->length = length;
|
||
|
||
if (h->indexUsed > 0 && td->tag < h->index[h->indexUsed-1].info.tag)
|
||
h->sorted = 0;
|
||
h->indexUsed++;
|
||
|
||
return 1;
|
||
}
|
||
|
||
static int intAppendEntry(Header h, rpmtd td)
|
||
{
|
||
indexEntry entry;
|
||
uint32_t length;
|
||
|
||
if (td->type == RPM_STRING_TYPE || td->type == RPM_I18NSTRING_TYPE) {
|
||
/* we can't do this */
|
||
return 0;
|
||
}
|
||
|
||
/* Find the tag entry in the header. */
|
||
entry = findEntry(h, td->tag, td->type);
|
||
if (!entry)
|
||
return 0;
|
||
|
||
if (dataLength(td->type, td->data, td->count, 0, NULL, &length))
|
||
return 0;
|
||
|
||
if (ENTRY_IN_REGION(entry)) {
|
||
char * t = xmalloc(entry->length + length);
|
||
memcpy(t, entry->data, entry->length);
|
||
entry->data = t;
|
||
entry->info.offset = 0;
|
||
} else
|
||
entry->data = xrealloc(entry->data, entry->length + length);
|
||
|
||
copyData(td->type, ((char *) entry->data) + entry->length,
|
||
td->data, td->count, length);
|
||
|
||
entry->length += length;
|
||
|
||
entry->info.count += td->count;
|
||
|
||
return 1;
|
||
}
|
||
|
||
int headerPut(Header h, rpmtd td, headerPutFlags flags)
|
||
{
|
||
int rc;
|
||
|
||
assert(td != NULL);
|
||
if (flags & HEADERPUT_APPEND) {
|
||
rc = findEntry(h, td->tag, td->type) ?
|
||
intAppendEntry(h, td) :
|
||
intAddEntry(h, td);
|
||
} else {
|
||
rc = intAddEntry(h, td);
|
||
}
|
||
return rc;
|
||
}
|
||
|
||
int headerAddI18NString(Header h, rpmTagVal tag, const char * string,
|
||
const char * lang)
|
||
{
|
||
indexEntry table, entry;
|
||
const char ** strArray;
|
||
uint32_t length;
|
||
int ghosts;
|
||
uint32_t i, langNum;
|
||
char * buf;
|
||
|
||
table = findEntry(h, RPMTAG_HEADERI18NTABLE, RPM_STRING_ARRAY_TYPE);
|
||
entry = findEntry(h, tag, RPM_I18NSTRING_TYPE);
|
||
|
||
if (!table && entry)
|
||
return 0; /* this shouldn't ever happen!! */
|
||
|
||
if (!table && !entry) {
|
||
const char * charArray[2];
|
||
uint32_t count = 0;
|
||
struct rpmtd_s td;
|
||
if (!lang || (lang[0] == 'C' && lang[1] == '\0')) {
|
||
charArray[count++] = "C";
|
||
} else {
|
||
charArray[count++] = "C";
|
||
charArray[count++] = lang;
|
||
}
|
||
|
||
rpmtdReset(&td);
|
||
td.tag = RPMTAG_HEADERI18NTABLE;
|
||
td.type = RPM_STRING_ARRAY_TYPE;
|
||
td.data = (void *) charArray;
|
||
td.count = count;
|
||
if (!headerPut(h, &td, HEADERPUT_DEFAULT))
|
||
return 0;
|
||
table = findEntry(h, RPMTAG_HEADERI18NTABLE, RPM_STRING_ARRAY_TYPE);
|
||
}
|
||
|
||
if (!table)
|
||
return 0;
|
||
if (!lang) lang = "C";
|
||
|
||
{ const char * l = table->data;
|
||
for (langNum = 0; langNum < table->info.count; langNum++) {
|
||
if (rstreq(l, lang)) break;
|
||
l += strlen(l) + 1;
|
||
}
|
||
}
|
||
|
||
if (langNum >= table->info.count) {
|
||
length = strlen(lang) + 1;
|
||
if (ENTRY_IN_REGION(table)) {
|
||
char * t = xmalloc(table->length + length);
|
||
memcpy(t, table->data, table->length);
|
||
table->data = t;
|
||
table->info.offset = 0;
|
||
} else
|
||
table->data = xrealloc(table->data, table->length + length);
|
||
memmove(((char *)table->data) + table->length, lang, length);
|
||
table->length += length;
|
||
table->info.count++;
|
||
}
|
||
|
||
if (!entry) {
|
||
int rc;
|
||
struct rpmtd_s td;
|
||
strArray = xmalloc(sizeof(*strArray) * (langNum + 1));
|
||
for (i = 0; i < langNum; i++)
|
||
strArray[i] = "";
|
||
strArray[langNum] = string;
|
||
|
||
rpmtdReset(&td);
|
||
td.tag = tag;
|
||
td.type = RPM_I18NSTRING_TYPE;
|
||
td.data = strArray;
|
||
td.count = langNum + 1;
|
||
rc = headerPut(h, &td, HEADERPUT_DEFAULT);
|
||
free(strArray);
|
||
return rc;
|
||
} else if (langNum >= entry->info.count) {
|
||
ghosts = langNum - entry->info.count;
|
||
|
||
length = strlen(string) + 1 + ghosts;
|
||
if (ENTRY_IN_REGION(entry)) {
|
||
char * t = xmalloc(entry->length + length);
|
||
memcpy(t, entry->data, entry->length);
|
||
entry->data = t;
|
||
entry->info.offset = 0;
|
||
} else
|
||
entry->data = xrealloc(entry->data, entry->length + length);
|
||
|
||
memset(((char *)entry->data) + entry->length, '\0', ghosts);
|
||
memmove(((char *)entry->data) + entry->length + ghosts, string, strlen(string)+1);
|
||
|
||
entry->length += length;
|
||
entry->info.count = langNum + 1;
|
||
} else {
|
||
char *b, *be, *e, *ee, *t;
|
||
size_t bn, sn, en;
|
||
|
||
/* Set beginning/end pointers to previous data */
|
||
b = be = e = ee = entry->data;
|
||
for (i = 0; i < table->info.count; i++) {
|
||
if (i == langNum)
|
||
be = ee;
|
||
ee += strlen(ee) + 1;
|
||
if (i == langNum)
|
||
e = ee;
|
||
}
|
||
|
||
/* Get storage for new buffer */
|
||
bn = (be-b);
|
||
sn = strlen(string) + 1;
|
||
en = (ee-e);
|
||
length = bn + sn + en;
|
||
t = buf = xmalloc(length);
|
||
|
||
/* Copy values into new storage */
|
||
memcpy(t, b, bn);
|
||
t += bn;
|
||
memcpy(t, string, sn);
|
||
t += sn;
|
||
memcpy(t, e, en);
|
||
t += en;
|
||
|
||
/* Replace i18N string array */
|
||
entry->length -= strlen(be) + 1;
|
||
entry->length += sn;
|
||
|
||
if (ENTRY_IN_REGION(entry)) {
|
||
entry->info.offset = 0;
|
||
} else
|
||
entry->data = _free(entry->data);
|
||
entry->data = buf;
|
||
}
|
||
|
||
return 0;
|
||
}
|
||
|
||
int headerMod(Header h, rpmtd td)
|
||
{
|
||
indexEntry entry;
|
||
void * oldData;
|
||
void * data;
|
||
uint32_t length = 0;
|
||
|
||
/* First find the tag */
|
||
entry = findEntry(h, td->tag, td->type);
|
||
if (!entry)
|
||
return 0;
|
||
|
||
data = grabData(td->type, td->data, td->count, &length);
|
||
if (data == NULL)
|
||
return 0;
|
||
|
||
/* make sure entry points to the first occurrence of this tag */
|
||
while (entry > h->index && (entry - 1)->info.tag == td->tag)
|
||
entry--;
|
||
|
||
/* free after we've grabbed the new data in case the two are intertwined;
|
||
that's a bad idea but at least we won't break */
|
||
oldData = entry->data;
|
||
|
||
entry->info.count = td->count;
|
||
entry->info.type = td->type;
|
||
entry->data = data;
|
||
entry->length = length;
|
||
|
||
if (ENTRY_IN_REGION(entry)) {
|
||
entry->info.offset = 0;
|
||
} else
|
||
free(oldData);
|
||
|
||
return 1;
|
||
}
|
||
|
||
/**
|
||
* Header tag iterator data structure.
|
||
*/
|
||
struct headerIterator_s {
|
||
Header h; /*!< Header being iterated. */
|
||
int next_index; /*!< Next tag index. */
|
||
};
|
||
|
||
HeaderIterator headerFreeIterator(HeaderIterator hi)
|
||
{
|
||
if (hi != NULL) {
|
||
hi->h = headerFree(hi->h);
|
||
hi = _free(hi);
|
||
}
|
||
return NULL;
|
||
}
|
||
|
||
HeaderIterator headerInitIterator(Header h)
|
||
{
|
||
HeaderIterator hi = xmalloc(sizeof(*hi));
|
||
|
||
headerSort(h);
|
||
|
||
hi->h = headerLink(h);
|
||
hi->next_index = 0;
|
||
return hi;
|
||
}
|
||
|
||
static indexEntry nextIndex(HeaderIterator hi)
|
||
{
|
||
Header h = hi->h;
|
||
int slot;
|
||
indexEntry entry = NULL;
|
||
|
||
for (slot = hi->next_index; slot < h->indexUsed; slot++) {
|
||
entry = h->index + slot;
|
||
if (!ENTRY_IS_REGION(entry))
|
||
break;
|
||
}
|
||
hi->next_index = slot;
|
||
if (entry == NULL || slot >= h->indexUsed)
|
||
return NULL;
|
||
|
||
hi->next_index++;
|
||
return entry;
|
||
}
|
||
|
||
rpmTagVal headerNextTag(HeaderIterator hi)
|
||
{
|
||
indexEntry entry = nextIndex(hi);
|
||
return entry ? entry->info.tag : RPMTAG_NOT_FOUND;
|
||
}
|
||
|
||
int headerNext(HeaderIterator hi, rpmtd td)
|
||
{
|
||
indexEntry entry = nextIndex(hi);
|
||
int rc = 0;
|
||
|
||
rpmtdReset(td);
|
||
if (entry) {
|
||
td->tag = entry->info.tag;
|
||
rc = copyTdEntry(entry, td, HEADERGET_DEFAULT);
|
||
}
|
||
return ((rc == 1) ? 1 : 0);
|
||
}
|
||
|
||
unsigned int headerGetInstance(Header h)
|
||
{
|
||
return h ? h->instance : 0;
|
||
}
|
||
|
||
void headerSetInstance(Header h, unsigned int instance)
|
||
{
|
||
h->instance = instance;
|
||
}
|
||
|
||
#define RETRY_ERROR(_err) \
|
||
((_err) == EINTR || (_err) == EAGAIN || (_err) == EWOULDBLOCK)
|
||
|
||
ssize_t Freadall(FD_t fd, void * buf, ssize_t size)
|
||
{
|
||
ssize_t total = 0;
|
||
ssize_t nb = 0;
|
||
char * bufp = buf;
|
||
|
||
while (total < size) {
|
||
nb = Fread(bufp, 1, size - total, fd);
|
||
|
||
if (nb == 0 || (nb < 0 && !RETRY_ERROR(errno))) {
|
||
total = nb;
|
||
break;
|
||
}
|
||
|
||
if (nb > 0) {
|
||
bufp += nb;
|
||
total += nb;
|
||
}
|
||
}
|
||
|
||
return total;
|
||
}
|
||
|
||
static rpmRC hdrblobVerifyRegion(rpmTagVal regionTag, int exact_size,
|
||
hdrblob blob, char **buf)
|
||
{
|
||
rpmRC rc = RPMRC_FAIL;
|
||
struct entryInfo_s trailer, einfo;
|
||
unsigned char * regionEnd = NULL;
|
||
|
||
/* Check that we have at least on tag */
|
||
if (blob->il < 1) {
|
||
rasprintf(buf, _("region: no tags"));
|
||
goto exit;
|
||
}
|
||
|
||
/* Convert the 1st tag element. */
|
||
ei2h(blob->pe, &einfo);
|
||
|
||
if (!regionTag && (einfo.tag == RPMTAG_HEADERSIGNATURES ||
|
||
einfo.tag == RPMTAG_HEADERIMMUTABLE ||
|
||
einfo.tag == RPMTAG_HEADERIMAGE)) {
|
||
regionTag = einfo.tag;
|
||
}
|
||
|
||
/* Is there an immutable header region tag? */
|
||
if (!(einfo.tag == regionTag)) {
|
||
rc = RPMRC_NOTFOUND;
|
||
goto exit;
|
||
}
|
||
|
||
/* Is the region tag sane? */
|
||
if (!(einfo.type == REGION_TAG_TYPE && einfo.count == REGION_TAG_COUNT)) {
|
||
rasprintf(buf,
|
||
_("region tag: BAD, tag %d type %d offset %d count %d"),
|
||
einfo.tag, einfo.type, einfo.offset, einfo.count);
|
||
goto exit;
|
||
}
|
||
|
||
/* Is the trailer within the data area? */
|
||
if (hdrchkRange(blob->dl, einfo.offset + REGION_TAG_COUNT)) {
|
||
rasprintf(buf,
|
||
_("region offset: BAD, tag %d type %d offset %d count %d"),
|
||
einfo.tag, einfo.type, einfo.offset, einfo.count);
|
||
goto exit;
|
||
}
|
||
|
||
/* Is there an immutable header region tag trailer? */
|
||
memset(&trailer, 0, sizeof(trailer));
|
||
regionEnd = blob->dataStart + einfo.offset;
|
||
/* regionEnd is not guaranteed to be aligned */
|
||
(void) memcpy(&trailer, regionEnd, REGION_TAG_COUNT);
|
||
blob->rdl = einfo.offset + REGION_TAG_COUNT;
|
||
|
||
ei2h(&trailer, &einfo);
|
||
/* Trailer offset is negative and has a special meaning */
|
||
einfo.offset = -einfo.offset;
|
||
/* Some old packages have HEADERIMAGE in signature region trailer, fix up */
|
||
if (regionTag == RPMTAG_HEADERSIGNATURES && einfo.tag == RPMTAG_HEADERIMAGE)
|
||
einfo.tag = RPMTAG_HEADERSIGNATURES;
|
||
if (!(einfo.tag == regionTag &&
|
||
einfo.type == REGION_TAG_TYPE && einfo.count == REGION_TAG_COUNT))
|
||
{
|
||
rasprintf(buf,
|
||
_("region trailer: BAD, tag %d type %d offset %d count %d"),
|
||
einfo.tag, einfo.type, einfo.offset, einfo.count);
|
||
goto exit;
|
||
}
|
||
|
||
/* Does the region actually fit within the header? */
|
||
blob->ril = einfo.offset/sizeof(*blob->pe);
|
||
if ((einfo.offset % sizeof(*blob->pe)) || hdrchkRange(blob->il, blob->ril) ||
|
||
hdrchkRange(blob->dl, blob->rdl)) {
|
||
rasprintf(buf, _("region %d size: BAD, ril %d il %d rdl %d dl %d"),
|
||
regionTag, blob->ril, blob->il, blob->rdl, blob->dl);
|
||
goto exit;
|
||
}
|
||
|
||
/* In package files region size is expected to match header size. */
|
||
if (exact_size && !(blob->il == blob->ril && blob->dl == blob->rdl)) {
|
||
rasprintf(buf,
|
||
_("region %d: tag number mismatch il %d ril %d dl %d rdl %d\n"),
|
||
regionTag, blob->il, blob->ril, blob->dl, blob->rdl);
|
||
goto exit;
|
||
}
|
||
|
||
blob->regionTag = regionTag;
|
||
rc = RPMRC_OK;
|
||
|
||
exit:
|
||
return rc;
|
||
}
|
||
|
||
hdrblob hdrblobCreate(void)
|
||
{
|
||
hdrblob blob = xcalloc(1, sizeof(*blob));
|
||
return blob;
|
||
}
|
||
|
||
hdrblob hdrblobFree(hdrblob blob)
|
||
{
|
||
if (blob) {
|
||
free(blob->ei);
|
||
free(blob);
|
||
}
|
||
return NULL;
|
||
}
|
||
|
||
static rpmRC hdrblobVerifyLengths(rpmTagVal regionTag, uint32_t il, uint32_t dl,
|
||
char **emsg) {
|
||
uint32_t il_max = HEADER_TAGS_MAX;
|
||
uint32_t dl_max = HEADER_DATA_MAX;
|
||
if (regionTag == RPMTAG_HEADERSIGNATURES) {
|
||
il_max = 32;
|
||
dl_max = 64 * 1024 * 1024;
|
||
}
|
||
if (hdrchkRange(il_max, il)) {
|
||
rasprintf(emsg, _("hdr tags: BAD, no. of tags(%" PRIu32 ") out of range"), il);
|
||
return RPMRC_FAIL;
|
||
}
|
||
if (hdrchkRange(dl_max, dl)) {
|
||
rasprintf(emsg, _("hdr data: BAD, no. of bytes(%" PRIu32 ") out of range"), dl);
|
||
return RPMRC_FAIL;
|
||
}
|
||
return RPMRC_OK;
|
||
}
|
||
|
||
rpmRC hdrblobRead(FD_t fd, int magic, int exact_size, rpmTagVal regionTag, hdrblob blob, char **emsg)
|
||
{
|
||
uint32_t block[4];
|
||
uint32_t *bs = (magic != 0) ? &block[0] : &block[2];
|
||
uint32_t blen = (magic != 0) ? sizeof(block) : sizeof(block) / 2;
|
||
uint32_t il;
|
||
uint32_t dl;
|
||
uint32_t * ei = NULL;
|
||
size_t uc;
|
||
size_t nb;
|
||
rpmRC rc = RPMRC_FAIL; /* assume failure */
|
||
int xx;
|
||
|
||
memset(block, 0, sizeof(block));
|
||
if ((xx = Freadall(fd, bs, blen)) != blen) {
|
||
rasprintf(emsg,
|
||
_("hdr size(%d): BAD, read returned %d"), blen, xx);
|
||
goto exit;
|
||
}
|
||
if (magic && memcmp(block, rpm_header_magic, sizeof(rpm_header_magic))) {
|
||
rasprintf(emsg, _("hdr magic: BAD"));
|
||
goto exit;
|
||
}
|
||
il = ntohl(block[2]);
|
||
dl = ntohl(block[3]);
|
||
if (hdrblobVerifyLengths(regionTag, il, dl, emsg))
|
||
goto exit;
|
||
|
||
nb = (il * sizeof(struct entryInfo_s)) + dl;
|
||
uc = sizeof(il) + sizeof(dl) + nb;
|
||
ei = xmalloc(uc);
|
||
ei[0] = block[2];
|
||
ei[1] = block[3];
|
||
if ((xx = Freadall(fd, (char *)&ei[2], nb)) != nb) {
|
||
rasprintf(emsg, _("hdr blob(%zd): BAD, read returned %d"), nb, xx);
|
||
goto exit;
|
||
}
|
||
|
||
if (regionTag == RPMTAG_HEADERSIGNATURES) {
|
||
size_t sigSize = uc + sizeof(rpm_header_magic);
|
||
size_t pad = (8 - (sigSize % 8)) % 8;
|
||
size_t trc;
|
||
if (pad && (trc = Freadall(fd, block, pad)) != pad) {
|
||
rasprintf(emsg, _("sigh pad(%zd): BAD, read %zd bytes"), pad, trc);
|
||
goto exit;
|
||
}
|
||
}
|
||
|
||
rc = hdrblobInit(ei, uc, regionTag, exact_size, blob, emsg);
|
||
|
||
exit:
|
||
if (rc != RPMRC_OK) {
|
||
free(ei);
|
||
blob->ei = NULL;
|
||
if (emsg && *emsg && regionTag == RPMTAG_HEADERSIGNATURES) {
|
||
/* rstrscat() cannot handle overlap even if it claims so */
|
||
char *tmp = rstrscat(NULL, _("signature "), *emsg, NULL);
|
||
free(*emsg);
|
||
*emsg = tmp;
|
||
}
|
||
}
|
||
|
||
return rc;
|
||
}
|
||
|
||
rpmRC hdrblobInit(const void *uh, size_t uc,
|
||
rpmTagVal regionTag, int exact_size,
|
||
struct hdrblob_s *blob, char **emsg)
|
||
{
|
||
rpmRC rc = RPMRC_FAIL;
|
||
memset(blob, 0, sizeof(*blob));
|
||
if (uc && uc < 8) {
|
||
rasprintf(emsg, _("hdr length: BAD"));
|
||
goto exit;
|
||
}
|
||
|
||
blob->ei = (uint32_t *) uh; /* discards const */
|
||
blob->il = ntohl(blob->ei[0]);
|
||
blob->dl = ntohl(blob->ei[1]);
|
||
if (hdrblobVerifyLengths(regionTag, blob->il, blob->dl, emsg) != RPMRC_OK)
|
||
goto exit;
|
||
|
||
blob->pe = (entryInfo) &(blob->ei[2]);
|
||
blob->pvlen = sizeof(blob->il) + sizeof(blob->dl) +
|
||
(blob->il * sizeof(*blob->pe)) + blob->dl;
|
||
blob->dataStart = (uint8_t *) (blob->pe + blob->il);
|
||
blob->dataEnd = blob->dataStart + blob->dl;
|
||
|
||
/* Is the blob the right size? */
|
||
if (blob->pvlen >= headerMaxbytes || (uc && blob->pvlen != uc)) {
|
||
rasprintf(emsg, _("blob size(%d): BAD, 8 + 16 * il(%d) + dl(%d)"),
|
||
blob->pvlen, blob->il, blob->dl);
|
||
goto exit;
|
||
}
|
||
|
||
if (hdrblobVerifyRegion(regionTag, exact_size, blob, emsg) == RPMRC_FAIL)
|
||
goto exit;
|
||
|
||
/* Sanity check the rest of the header structure. */
|
||
if (hdrblobVerifyInfo(blob, emsg))
|
||
goto exit;
|
||
|
||
rc = RPMRC_OK;
|
||
|
||
exit:
|
||
return rc;
|
||
}
|
||
|
||
rpmRC hdrblobGet(hdrblob blob, uint32_t tag, rpmtd td)
|
||
{
|
||
rpmRC rc = RPMRC_NOTFOUND;
|
||
struct indexEntry_s entry;
|
||
struct entryInfo_s einfo;
|
||
const struct entryInfo_s *pe = blob->pe;
|
||
uint32_t ntag = htonl(tag);
|
||
int tsize;
|
||
|
||
memset(&einfo, 0, sizeof(einfo));
|
||
rpmtdReset(td);
|
||
|
||
for (int i = 0; i < blob->il; i++, pe++) {
|
||
if (pe->tag != ntag)
|
||
continue;
|
||
ei2h(pe, &einfo);
|
||
|
||
/* We can only handle non-byteswappable data */
|
||
tsize = typeSizes[einfo.type];
|
||
if (tsize != 1 && tsize != -1)
|
||
return RPMRC_FAIL;
|
||
|
||
entry.info = einfo; /* struct assignment */
|
||
entry.data = blob->dataStart + einfo.offset;
|
||
if (dataLength(einfo.type, blob->dataStart + einfo.offset,
|
||
einfo.count, 1, blob->dataEnd, &entry.length)) {
|
||
return RPMRC_FAIL;
|
||
}
|
||
entry.rdlen = 0;
|
||
td->tag = einfo.tag;
|
||
rc = copyTdEntry(&entry, td, HEADERGET_MINMEM) ? RPMRC_OK : RPMRC_FAIL;
|
||
break;
|
||
}
|
||
return rc;
|
||
}
|
||
|
||
Header headerImport(void * blob, unsigned int bsize, headerImportFlags flags)
|
||
{
|
||
Header h = NULL;
|
||
struct hdrblob_s hblob;
|
||
char *buf = NULL;
|
||
void * b = blob;
|
||
|
||
if (flags & HEADERIMPORT_COPY) {
|
||
if (bsize == 0 && hdrblobInit(b, 0, 0, 0, &hblob, &buf) == RPMRC_OK)
|
||
bsize = hblob.pvlen;
|
||
if (bsize == 0)
|
||
goto exit;
|
||
b = memcpy(xmalloc(bsize), b, bsize);
|
||
}
|
||
|
||
/* Sanity checks on header intro. */
|
||
if (hdrblobInit(b, bsize, 0, 0, &hblob, &buf) == RPMRC_OK)
|
||
hdrblobImport(&hblob, (flags & HEADERIMPORT_FAST), &h, &buf);
|
||
|
||
exit:
|
||
if (h == NULL && b != blob)
|
||
free(b);
|
||
free(buf);
|
||
|
||
return h;
|
||
}
|