3777 lines
87 KiB
C
3777 lines
87 KiB
C
/** \ingroup header
|
|
* \file rpmdb/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"
|
|
|
|
#define __HEADER_PROTOTYPES__
|
|
|
|
#include <header_internal.h>
|
|
|
|
#include "debug.h"
|
|
|
|
/*@unchecked@*/
|
|
int _hdr_debug = 0;
|
|
|
|
/*@-redecl@*/ /* FIX: avoid rpmlib.h, need for debugging. */
|
|
/*@observer@*/ const char *const tagName(int tag) /*@*/;
|
|
/*@=redecl@*/
|
|
|
|
/*@access entryInfo @*/
|
|
/*@access indexEntry @*/
|
|
|
|
/*@access rpmec @*/
|
|
/*@access sprintfTag @*/
|
|
/*@access sprintfToken @*/
|
|
/*@access HV_t @*/
|
|
|
|
#define PARSER_BEGIN 0
|
|
#define PARSER_IN_ARRAY 1
|
|
#define PARSER_IN_EXPR 2
|
|
|
|
/* XXX for xml support */
|
|
/*@-redecl@*/
|
|
/*@observer@*/ extern const char *const tagName(int tag)
|
|
/*@*/;
|
|
/*@=redecl@*/
|
|
|
|
/** \ingroup header
|
|
*/
|
|
/*@observer@*/ /*@unchecked@*/
|
|
static unsigned char header_magic[8] = {
|
|
0x8e, 0xad, 0xe8, 0x01, 0x00, 0x00, 0x00, 0x00
|
|
};
|
|
|
|
/** \ingroup header
|
|
* Alignment needed for header data types.
|
|
*/
|
|
/*@observer@*/ /*@unchecked@*/
|
|
static 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.
|
|
*/
|
|
/*@observer@*/ /*@unchecked@*/
|
|
static int typeSizes[16] = {
|
|
0, /*!< RPM_NULL_TYPE */
|
|
1, /*!< RPM_CHAR_TYPE */
|
|
1, /*!< RPM_INT8_TYPE */
|
|
2, /*!< RPM_INT16_TYPE */
|
|
4, /*!< RPM_INT32_TYPE */
|
|
-1, /*!< 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
|
|
* Maximum no. of bytes permitted in a header.
|
|
*/
|
|
/*@unchecked@*/
|
|
static size_t headerMaxbytes = (32*1024*1024);
|
|
|
|
/**
|
|
* Sanity check on no. of tags.
|
|
* This check imposes a limit of 65K tags, more than enough.
|
|
*/
|
|
#define hdrchkTags(_ntags) ((_ntags) & 0xffff0000)
|
|
|
|
/**
|
|
* Sanity check on type values.
|
|
*/
|
|
#define hdrchkType(_type) ((_type) < RPM_MIN_TYPE || (_type) > RPM_MAX_TYPE)
|
|
|
|
/**
|
|
* Sanity check on data size and/or offset and/or count.
|
|
* This check imposes a limit of 16Mb, more than enough.
|
|
*/
|
|
#define hdrchkData(_nbytes) ((_nbytes) & 0xff000000)
|
|
|
|
/**
|
|
* Sanity check on 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))
|
|
|
|
/*@observer@*/ /*@unchecked@*/
|
|
HV_t hdrVec; /* forward reference */
|
|
|
|
/**
|
|
* Wrapper to free(3), hides const compilation noise, permit NULL, return NULL.
|
|
* @param p memory to free
|
|
* @return NULL always
|
|
*/
|
|
/*@unused@*/ static inline /*@null@*/ void *
|
|
_free(/*@only@*/ /*@null@*/ /*@out@*/ const void * p) /*@modifies *p @*/
|
|
{
|
|
if (p != NULL) free((void *)p);
|
|
return NULL;
|
|
}
|
|
|
|
/** \ingroup header
|
|
* Reference a header instance.
|
|
* @param h header
|
|
* @return referenced header instance
|
|
*/
|
|
static
|
|
Header headerLink(Header h)
|
|
/*@modifies h @*/
|
|
{
|
|
/*@-nullret@*/
|
|
if (h == NULL) return NULL;
|
|
/*@=nullret@*/
|
|
|
|
h->nrefs++;
|
|
/*@-modfilesys@*/
|
|
if (_hdr_debug)
|
|
fprintf(stderr, "--> h %p ++ %d at %s:%u\n", h, h->nrefs, __FILE__, __LINE__);
|
|
/*@=modfilesys@*/
|
|
|
|
/*@-refcounttrans @*/
|
|
return h;
|
|
/*@=refcounttrans @*/
|
|
}
|
|
|
|
/** \ingroup header
|
|
* Dereference a header instance.
|
|
* @param h header
|
|
* @return NULL always
|
|
*/
|
|
static /*@null@*/
|
|
Header headerUnlink(/*@killref@*/ /*@null@*/ Header h)
|
|
/*@modifies h @*/
|
|
{
|
|
if (h == NULL) return NULL;
|
|
/*@-modfilesys@*/
|
|
if (_hdr_debug)
|
|
fprintf(stderr, "--> h %p -- %d at %s:%u\n", h, h->nrefs, __FILE__, __LINE__);
|
|
/*@=modfilesys@*/
|
|
h->nrefs--;
|
|
return NULL;
|
|
}
|
|
|
|
/** \ingroup header
|
|
* Dereference a header instance.
|
|
* @param h header
|
|
* @return NULL always
|
|
*/
|
|
static /*@null@*/
|
|
Header headerFree(/*@killref@*/ /*@null@*/ Header h)
|
|
/*@modifies h @*/
|
|
{
|
|
(void) headerUnlink(h);
|
|
|
|
/*@-usereleased@*/
|
|
if (h == NULL || h->nrefs > 0)
|
|
return NULL; /* XXX return previous header? */
|
|
|
|
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) {
|
|
int_32 * 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);
|
|
}
|
|
|
|
/*@-refcounttrans@*/ h = _free(h); /*@=refcounttrans@*/
|
|
return h;
|
|
/*@=usereleased@*/
|
|
}
|
|
|
|
/** \ingroup header
|
|
* Create new (empty) header instance.
|
|
* @return header
|
|
*/
|
|
static
|
|
Header headerNew(void)
|
|
/*@*/
|
|
{
|
|
Header h = xcalloc(1, sizeof(*h));
|
|
|
|
/*@-boundsread@*/
|
|
/*@-assignexpose@*/
|
|
h->hv = *hdrVec; /* structure assignment */
|
|
/*@=assignexpose@*/
|
|
/*@=boundsread@*/
|
|
h->blob = NULL;
|
|
h->indexAlloced = INDEX_MALLOC_SIZE;
|
|
h->indexUsed = 0;
|
|
h->flags |= HEADERFLAG_SORTED;
|
|
|
|
h->index = (h->indexAlloced
|
|
? xcalloc(h->indexAlloced, sizeof(*h->index))
|
|
: NULL);
|
|
|
|
h->nrefs = 0;
|
|
/*@-globstate -observertrans @*/
|
|
return headerLink(h);
|
|
/*@=globstate =observertrans @*/
|
|
}
|
|
|
|
/**
|
|
*/
|
|
static int indexCmp(const void * avp, const void * bvp)
|
|
/*@*/
|
|
{
|
|
/*@-castexpose@*/
|
|
indexEntry ap = (indexEntry) avp, bp = (indexEntry) bvp;
|
|
/*@=castexpose@*/
|
|
return (ap->info.tag - bp->info.tag);
|
|
}
|
|
|
|
/** \ingroup header
|
|
* Sort tags in header.
|
|
* @param h header
|
|
*/
|
|
static
|
|
void headerSort(Header h)
|
|
/*@modifies h @*/
|
|
{
|
|
if (!(h->flags & HEADERFLAG_SORTED)) {
|
|
/*@-boundsread@*/
|
|
qsort(h->index, h->indexUsed, sizeof(*h->index), indexCmp);
|
|
/*@=boundsread@*/
|
|
h->flags |= HEADERFLAG_SORTED;
|
|
}
|
|
}
|
|
|
|
/**
|
|
*/
|
|
static int offsetCmp(const void * avp, const void * bvp) /*@*/
|
|
{
|
|
/*@-castexpose@*/
|
|
indexEntry ap = (indexEntry) avp, bp = (indexEntry) bvp;
|
|
/*@=castexpose@*/
|
|
int rc = (ap->info.offset - bp->info.offset);
|
|
|
|
if (rc == 0) {
|
|
/* Within a region, entries sort by address. Added drips sort by tag. */
|
|
if (ap->info.offset < 0)
|
|
rc = (((char *)ap->data) - ((char *)bp->data));
|
|
else
|
|
rc = (ap->info.tag - bp->info.tag);
|
|
}
|
|
return rc;
|
|
}
|
|
|
|
/** \ingroup header
|
|
* Restore tags in header to original ordering.
|
|
* @param h header
|
|
*/
|
|
static
|
|
void headerUnsort(Header h)
|
|
/*@modifies h @*/
|
|
{
|
|
/*@-boundsread@*/
|
|
qsort(h->index, h->indexUsed, sizeof(*h->index), offsetCmp);
|
|
/*@=boundsread@*/
|
|
}
|
|
|
|
/** \ingroup header
|
|
* Return size of on-disk header representation in bytes.
|
|
* @param h header
|
|
* @param magicp include size of 8 bytes for (magic, 0)?
|
|
* @return size of on-disk header
|
|
*/
|
|
static
|
|
unsigned int headerSizeof(/*@null@*/ Header h, enum hMagic magicp)
|
|
/*@modifies h @*/
|
|
{
|
|
indexEntry entry;
|
|
unsigned int size = 0;
|
|
unsigned int pad = 0;
|
|
int i;
|
|
|
|
if (h == NULL)
|
|
return size;
|
|
|
|
headerSort(h);
|
|
|
|
switch (magicp) {
|
|
case HEADER_MAGIC_YES:
|
|
size += sizeof(header_magic);
|
|
break;
|
|
case HEADER_MAGIC_NO:
|
|
break;
|
|
}
|
|
|
|
/*@-sizeoftype@*/
|
|
size += 2 * sizeof(int_32); /* count of index entries */
|
|
/*@=sizeoftype@*/
|
|
|
|
for (i = 0, entry = h->index; i < h->indexUsed; i++, entry++) {
|
|
unsigned diff;
|
|
int_32 type;
|
|
|
|
/* Regions go in as is ... */
|
|
if (ENTRY_IS_REGION(entry)) {
|
|
size += entry->length;
|
|
/* XXX Legacy regions do not include the region tag and data. */
|
|
/*@-sizeoftype@*/
|
|
if (i == 0 && (h->flags & HEADERFLAG_LEGACY))
|
|
size += sizeof(struct entryInfo_s) + entry->info.count;
|
|
/*@=sizeoftype@*/
|
|
continue;
|
|
}
|
|
|
|
/* ... and region elements are skipped. */
|
|
if (entry->info.offset < 0)
|
|
continue;
|
|
|
|
/* Alignment */
|
|
type = entry->info.type;
|
|
/*@-boundsread@*/
|
|
if (typeSizes[type] > 1) {
|
|
diff = typeSizes[type] - (size % typeSizes[type]);
|
|
if (diff != typeSizes[type]) {
|
|
size += diff;
|
|
pad += diff;
|
|
}
|
|
}
|
|
/*@=boundsread@*/
|
|
|
|
/*@-sizeoftype@*/
|
|
size += sizeof(struct entryInfo_s) + entry->length;
|
|
/*@=sizeoftype@*/
|
|
}
|
|
|
|
return size;
|
|
}
|
|
|
|
/**
|
|
* 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)
|
|
* @return no. bytes in data, -1 on failure
|
|
*/
|
|
static int dataLength(int_32 type, hPTR_t p, int_32 count, int onDisk,
|
|
/*@null@*/ hPTR_t pend)
|
|
/*@*/
|
|
{
|
|
const unsigned char * s = p;
|
|
const unsigned char * se = pend;
|
|
int length = 0;
|
|
|
|
switch (type) {
|
|
case RPM_STRING_TYPE:
|
|
if (count != 1)
|
|
return -1;
|
|
/*@-boundsread@*/
|
|
while (*s++) {
|
|
if (se && s > se)
|
|
return -1;
|
|
length++;
|
|
}
|
|
/*@=boundsread@*/
|
|
length++; /* count nul terminator too. */
|
|
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) {
|
|
while (count--) {
|
|
length++; /* count nul terminator too */
|
|
/*@-boundsread@*/
|
|
while (*s++) {
|
|
if (se && s > se)
|
|
return -1;
|
|
length++;
|
|
}
|
|
/*@=boundsread@*/
|
|
}
|
|
} else {
|
|
const char ** av = (const char **)p;
|
|
/*@-boundsread@*/
|
|
while (count--) {
|
|
/* add one for null termination */
|
|
length += strlen(*av++) + 1;
|
|
}
|
|
/*@=boundsread@*/
|
|
}
|
|
break;
|
|
|
|
default:
|
|
/*@-boundsread@*/
|
|
if (typeSizes[type] == -1)
|
|
return -1;
|
|
length = typeSizes[(type & 0xf)] * count;
|
|
/*@=boundsread@*/
|
|
if (length < 0 || (se && (s + length) > se))
|
|
return -1;
|
|
break;
|
|
}
|
|
|
|
return length;
|
|
}
|
|
|
|
/** \ingroup header
|
|
* Swap int_32 and int_16 arrays within header region.
|
|
*
|
|
* This code is way more twisty than I would like.
|
|
*
|
|
* A bug with RPM_I18NSTRING_TYPE in rpm-2.5.x (fixed in August 1998)
|
|
* causes the offset and length of elements in a header region to disagree
|
|
* regarding the total length of the region data.
|
|
*
|
|
* The "fix" is to compute the size using both offset and length and
|
|
* return the larger of the two numbers as the size of the region.
|
|
* Kinda like computing left and right Riemann sums of the data elements
|
|
* to determine the size of a data structure, go figger :-).
|
|
*
|
|
* There's one other twist if a header region tag is in the set to be swabbed,
|
|
* as the data for 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
|
|
* @return no. bytes of data in region, -1 on error
|
|
*/
|
|
static int regionSwab(/*@null@*/ indexEntry entry, int il, int dl,
|
|
entryInfo pe,
|
|
unsigned char * dataStart,
|
|
/*@null@*/ const unsigned char * dataEnd,
|
|
int regionid)
|
|
/*@modifies *entry, *dataStart @*/
|
|
{
|
|
unsigned char * tprev = NULL;
|
|
unsigned char * t = NULL;
|
|
int tdel, tl = dl;
|
|
struct indexEntry_s ieprev;
|
|
|
|
/*@-boundswrite@*/
|
|
memset(&ieprev, 0, sizeof(ieprev));
|
|
/*@=boundswrite@*/
|
|
for (; il > 0; il--, pe++) {
|
|
struct indexEntry_s ie;
|
|
int_32 type;
|
|
|
|
ie.info.tag = ntohl(pe->tag);
|
|
ie.info.type = ntohl(pe->type);
|
|
ie.info.count = ntohl(pe->count);
|
|
ie.info.offset = ntohl(pe->offset);
|
|
|
|
if (hdrchkType(ie.info.type))
|
|
return -1;
|
|
if (hdrchkData(ie.info.count))
|
|
return -1;
|
|
if (hdrchkData(ie.info.offset))
|
|
return -1;
|
|
/*@-boundsread@*/
|
|
if (hdrchkAlign(ie.info.type, ie.info.offset))
|
|
return -1;
|
|
/*@=boundsread@*/
|
|
|
|
ie.data = t = dataStart + ie.info.offset;
|
|
if (dataEnd && t >= dataEnd)
|
|
return -1;
|
|
|
|
ie.length = dataLength(ie.info.type, ie.data, ie.info.count, 1, dataEnd);
|
|
if (ie.length < 0 || hdrchkData(ie.length))
|
|
return -1;
|
|
|
|
ie.rdlen = 0;
|
|
|
|
if (entry) {
|
|
ie.info.offset = regionid;
|
|
/*@-boundswrite@*/
|
|
*entry = ie; /* structure assignment */
|
|
/*@=boundswrite@*/
|
|
entry++;
|
|
}
|
|
|
|
/* Alignment */
|
|
type = ie.info.type;
|
|
/*@-boundsread@*/
|
|
if (typeSizes[type] > 1) {
|
|
unsigned diff;
|
|
diff = typeSizes[type] - (dl % typeSizes[type]);
|
|
if (diff != typeSizes[type]) {
|
|
dl += diff;
|
|
if (ieprev.info.type == RPM_I18NSTRING_TYPE)
|
|
ieprev.length += diff;
|
|
}
|
|
}
|
|
/*@=boundsread@*/
|
|
tdel = (tprev ? (t - tprev) : 0);
|
|
if (ieprev.info.type == RPM_I18NSTRING_TYPE)
|
|
tdel = ieprev.length;
|
|
|
|
if (ie.info.tag >= HEADER_I18NTABLE) {
|
|
tprev = t;
|
|
} else {
|
|
tprev = dataStart;
|
|
/* XXX HEADER_IMAGE tags don't include region sub-tag. */
|
|
/*@-sizeoftype@*/
|
|
if (ie.info.tag == HEADER_IMAGE)
|
|
tprev -= REGION_TAG_COUNT;
|
|
/*@=sizeoftype@*/
|
|
}
|
|
|
|
/* Perform endian conversions */
|
|
switch (ntohl(pe->type)) {
|
|
/*@-bounds@*/
|
|
case RPM_INT32_TYPE:
|
|
{ int_32 * it = (int_32 *)t;
|
|
for (; ie.info.count > 0; ie.info.count--, it += 1) {
|
|
if (dataEnd && ((unsigned char *)it) >= dataEnd)
|
|
return -1;
|
|
*it = htonl(*it);
|
|
}
|
|
t = (char *) it;
|
|
} /*@switchbreak@*/ break;
|
|
case RPM_INT16_TYPE:
|
|
{ int_16 * it = (int_16 *) t;
|
|
for (; ie.info.count > 0; ie.info.count--, it += 1) {
|
|
if (dataEnd && ((unsigned char *)it) >= dataEnd)
|
|
return -1;
|
|
*it = htons(*it);
|
|
}
|
|
t = (char *) it;
|
|
} /*@switchbreak@*/ break;
|
|
/*@=bounds@*/
|
|
default:
|
|
t += ie.length;
|
|
/*@switchbreak@*/ break;
|
|
}
|
|
|
|
dl += ie.length;
|
|
tl += tdel;
|
|
ieprev = ie; /* structure assignment */
|
|
|
|
}
|
|
tdel = (tprev ? (t - tprev) : 0);
|
|
tl += tdel;
|
|
|
|
/* XXX
|
|
* There are two hacks here:
|
|
* 1) tl is 16b (i.e. REGION_TAG_COUNT) short while doing headerReload().
|
|
* 2) the 8/98 rpm bug with inserting i18n tags needs to use tl, not dl.
|
|
*/
|
|
/*@-sizeoftype@*/
|
|
if (tl+REGION_TAG_COUNT == dl)
|
|
tl += REGION_TAG_COUNT;
|
|
/*@=sizeoftype@*/
|
|
|
|
return dl;
|
|
}
|
|
|
|
/** \ingroup header
|
|
* @param h header
|
|
* @retval *lengthPtr no. bytes in unloaded header blob
|
|
* @return unloaded header blob (NULL on error)
|
|
*/
|
|
static /*@only@*/ /*@null@*/ void * doHeaderUnload(Header h,
|
|
/*@out@*/ int * lengthPtr)
|
|
/*@modifies h, *lengthPtr @*/
|
|
/*@requires maxSet(lengthPtr) >= 0 @*/
|
|
/*@ensures maxRead(result) == (*lengthPtr) @*/
|
|
{
|
|
int_32 * ei = NULL;
|
|
entryInfo pe;
|
|
char * dataStart;
|
|
char * te;
|
|
unsigned pad;
|
|
unsigned len;
|
|
int_32 il = 0;
|
|
int_32 dl = 0;
|
|
indexEntry entry;
|
|
int_32 type;
|
|
int i;
|
|
int drlen, ndribbles;
|
|
int driplen, ndrips;
|
|
int legacy = 0;
|
|
|
|
/* Sort entries by (offset,tag). */
|
|
headerUnsort(h);
|
|
|
|
/* Compute (il,dl) for all tags, including those deleted in region. */
|
|
pad = 0;
|
|
drlen = ndribbles = driplen = ndrips = 0;
|
|
for (i = 0, entry = h->index; i < h->indexUsed; i++, entry++) {
|
|
if (ENTRY_IS_REGION(entry)) {
|
|
int_32 rdl = -entry->info.offset; /* negative offset */
|
|
int_32 ril = rdl/sizeof(*pe);
|
|
int rid = entry->info.offset;
|
|
|
|
il += ril;
|
|
dl += entry->rdlen + entry->info.count;
|
|
/* XXX Legacy regions do not include the region tag and data. */
|
|
if (i == 0 && (h->flags & HEADERFLAG_LEGACY))
|
|
il += 1;
|
|
|
|
/* Skip rest of entries in region, but account for dribbles. */
|
|
for (; i < h->indexUsed && entry->info.offset <= rid+1; i++, entry++) {
|
|
if (entry->info.offset <= rid)
|
|
/*@innercontinue@*/ continue;
|
|
|
|
/* Alignment */
|
|
type = entry->info.type;
|
|
if (typeSizes[type] > 1) {
|
|
unsigned diff;
|
|
diff = typeSizes[type] - (dl % typeSizes[type]);
|
|
if (diff != typeSizes[type]) {
|
|
drlen += diff;
|
|
pad += 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 */
|
|
type = entry->info.type;
|
|
if (typeSizes[type] > 1) {
|
|
unsigned diff;
|
|
diff = typeSizes[type] - (dl % typeSizes[type]);
|
|
if (diff != typeSizes[type]) {
|
|
driplen += diff;
|
|
pad += diff;
|
|
dl += diff;
|
|
} else
|
|
diff = 0;
|
|
}
|
|
|
|
ndrips++;
|
|
il++;
|
|
driplen += entry->length;
|
|
dl += entry->length;
|
|
}
|
|
|
|
/* Sanity checks on header intro. */
|
|
if (hdrchkTags(il) || hdrchkData(dl))
|
|
goto errxit;
|
|
|
|
len = sizeof(il) + sizeof(dl) + (il * sizeof(*pe)) + dl;
|
|
|
|
/*@-boundswrite@*/
|
|
ei = xmalloc(len);
|
|
ei[0] = htonl(il);
|
|
ei[1] = htonl(dl);
|
|
/*@=boundswrite@*/
|
|
|
|
pe = (entryInfo) &ei[2];
|
|
dataStart = te = (char *) (pe + il);
|
|
|
|
pad = 0;
|
|
for (i = 0, entry = h->index; i < h->indexUsed; i++, entry++) {
|
|
const char * src;
|
|
char *t;
|
|
int count;
|
|
int rdlen;
|
|
|
|
if (entry->data == NULL || entry->length <= 0)
|
|
continue;
|
|
|
|
t = te;
|
|
pe->tag = htonl(entry->info.tag);
|
|
pe->type = htonl(entry->info.type);
|
|
pe->count = htonl(entry->info.count);
|
|
|
|
if (ENTRY_IS_REGION(entry)) {
|
|
int_32 rdl = -entry->info.offset; /* negative offset */
|
|
int_32 ril = rdl/sizeof(*pe) + ndribbles;
|
|
int rid = entry->info.offset;
|
|
|
|
src = (char *)entry->data;
|
|
rdlen = entry->rdlen;
|
|
|
|
/* XXX Legacy regions do not include the region tag and data. */
|
|
if (i == 0 && (h->flags & HEADERFLAG_LEGACY)) {
|
|
int_32 stei[4];
|
|
|
|
legacy = 1;
|
|
/*@-boundswrite@*/
|
|
memcpy(pe+1, src, rdl);
|
|
memcpy(te, src + rdl, rdlen);
|
|
/*@=boundswrite@*/
|
|
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;
|
|
/*@-boundswrite@*/
|
|
memcpy(te, stei, entry->info.count);
|
|
/*@=boundswrite@*/
|
|
te += entry->info.count;
|
|
ril++;
|
|
rdlen += entry->info.count;
|
|
|
|
count = regionSwab(NULL, ril, 0, pe, t, NULL, 0);
|
|
if (count != rdlen)
|
|
goto errxit;
|
|
|
|
} else {
|
|
|
|
/*@-boundswrite@*/
|
|
memcpy(pe+1, src + sizeof(*pe), ((ril-1) * sizeof(*pe)));
|
|
memcpy(te, src + (ril * sizeof(*pe)), rdlen+entry->info.count+drlen);
|
|
/*@=boundswrite@*/
|
|
te += rdlen;
|
|
{ /*@-castexpose@*/
|
|
entryInfo se = (entryInfo)src;
|
|
/*@=castexpose@*/
|
|
int off = ntohl(se->offset);
|
|
pe->offset = (off) ? htonl(te - dataStart) : htonl(off);
|
|
}
|
|
te += entry->info.count + drlen;
|
|
|
|
count = regionSwab(NULL, ril, 0, pe, t, NULL, 0);
|
|
if (count != (rdlen + entry->info.count + drlen))
|
|
goto errxit;
|
|
}
|
|
|
|
/* Skip rest of entries in region. */
|
|
while (i < h->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 */
|
|
type = entry->info.type;
|
|
if (typeSizes[type] > 1) {
|
|
unsigned diff;
|
|
diff = typeSizes[type] - ((te - dataStart) % typeSizes[type]);
|
|
if (diff != typeSizes[type]) {
|
|
/*@-boundswrite@*/
|
|
memset(te, 0, diff);
|
|
/*@=boundswrite@*/
|
|
te += diff;
|
|
pad += diff;
|
|
}
|
|
}
|
|
|
|
pe->offset = htonl(te - dataStart);
|
|
|
|
/* copy data w/ endian conversions */
|
|
/*@-boundswrite@*/
|
|
switch (entry->info.type) {
|
|
case RPM_INT32_TYPE:
|
|
count = entry->info.count;
|
|
src = entry->data;
|
|
while (count--) {
|
|
*((int_32 *)te) = htonl(*((int_32 *)src));
|
|
/*@-sizeoftype@*/
|
|
te += sizeof(int_32);
|
|
src += sizeof(int_32);
|
|
/*@=sizeoftype@*/
|
|
}
|
|
/*@switchbreak@*/ break;
|
|
|
|
case RPM_INT16_TYPE:
|
|
count = entry->info.count;
|
|
src = entry->data;
|
|
while (count--) {
|
|
*((int_16 *)te) = htons(*((int_16 *)src));
|
|
/*@-sizeoftype@*/
|
|
te += sizeof(int_16);
|
|
src += sizeof(int_16);
|
|
/*@=sizeoftype@*/
|
|
}
|
|
/*@switchbreak@*/ break;
|
|
|
|
default:
|
|
memcpy(te, entry->data, entry->length);
|
|
te += entry->length;
|
|
/*@switchbreak@*/ break;
|
|
}
|
|
/*@=boundswrite@*/
|
|
pe++;
|
|
}
|
|
|
|
/* Insure that there are no memcpy underruns/overruns. */
|
|
if (((char *)pe) != dataStart)
|
|
goto errxit;
|
|
if ((((char *)ei)+len) != te)
|
|
goto errxit;
|
|
|
|
if (lengthPtr)
|
|
*lengthPtr = len;
|
|
|
|
h->flags &= ~HEADERFLAG_SORTED;
|
|
headerSort(h);
|
|
|
|
return (void *) ei;
|
|
|
|
errxit:
|
|
/*@-usereleased@*/
|
|
ei = _free(ei);
|
|
/*@=usereleased@*/
|
|
return (void *) ei;
|
|
}
|
|
|
|
/** \ingroup header
|
|
* Convert header to on-disk representation.
|
|
* @param h header (with pointers)
|
|
* @return on-disk header blob (i.e. with offsets)
|
|
*/
|
|
static /*@only@*/ /*@null@*/
|
|
void * headerUnload(Header h)
|
|
/*@modifies h @*/
|
|
{
|
|
int length;
|
|
/*@-boundswrite@*/
|
|
void * uh = doHeaderUnload(h, &length);
|
|
/*@=boundswrite@*/
|
|
return uh;
|
|
}
|
|
|
|
/**
|
|
* Find matching (tag,type) entry in header.
|
|
* @param h header
|
|
* @param tag entry tag
|
|
* @param type entry type
|
|
* @return header entry
|
|
*/
|
|
static /*@null@*/
|
|
indexEntry findEntry(/*@null@*/ Header h, int_32 tag, int_32 type)
|
|
/*@modifies h @*/
|
|
{
|
|
indexEntry entry, entry2, last;
|
|
struct indexEntry_s key;
|
|
|
|
if (h == NULL) return NULL;
|
|
if (!(h->flags & HEADERFLAG_SORTED)) headerSort(h);
|
|
|
|
key.info.tag = tag;
|
|
|
|
/*@-boundswrite@*/
|
|
entry2 = entry =
|
|
bsearch(&key, h->index, h->indexUsed, sizeof(*h->index), indexCmp);
|
|
/*@=boundswrite@*/
|
|
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;
|
|
|
|
last = h->index + h->indexUsed;
|
|
/*@-usereleased@*/ /* FIX: entry2 = entry. Code looks bogus as well. */
|
|
while (entry2->info.tag == tag && entry2->info.type != type &&
|
|
entry2 < last) entry2++;
|
|
/*@=usereleased@*/
|
|
|
|
if (entry->info.tag == tag && entry->info.type == type)
|
|
return entry;
|
|
|
|
return NULL;
|
|
}
|
|
|
|
/** \ingroup header
|
|
* Delete tag in header.
|
|
* Removes all entries of type tag from the header, returns 1 if none were
|
|
* found.
|
|
*
|
|
* @param h header
|
|
* @param tag tag
|
|
* @return 0 on success, 1 on failure (INCONSISTENT)
|
|
*/
|
|
static
|
|
int headerRemoveEntry(Header h, int_32 tag)
|
|
/*@modifies h @*/
|
|
{
|
|
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 occurence 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;
|
|
data = _free(data);
|
|
}
|
|
|
|
ne = (first - entry);
|
|
if (ne > 0) {
|
|
h->indexUsed -= ne;
|
|
ne = last - first;
|
|
/*@-boundswrite@*/
|
|
if (ne > 0)
|
|
memmove(entry, first, (ne * sizeof(*entry)));
|
|
/*@=boundswrite@*/
|
|
}
|
|
|
|
return 0;
|
|
}
|
|
|
|
/** \ingroup header
|
|
* Convert header to in-memory representation.
|
|
* @param uh on-disk header blob (i.e. with offsets)
|
|
* @return header
|
|
*/
|
|
static /*@null@*/
|
|
Header headerLoad(/*@kept@*/ void * uh)
|
|
/*@modifies uh @*/
|
|
{
|
|
int_32 * ei = (int_32 *) uh;
|
|
int_32 il = ntohl(ei[0]); /* index length */
|
|
int_32 dl = ntohl(ei[1]); /* data length */
|
|
/*@-sizeoftype@*/
|
|
size_t pvlen = sizeof(il) + sizeof(dl) +
|
|
(il * sizeof(struct entryInfo_s)) + dl;
|
|
/*@=sizeoftype@*/
|
|
void * pv = uh;
|
|
Header h = NULL;
|
|
entryInfo pe;
|
|
unsigned char * dataStart;
|
|
unsigned char * dataEnd;
|
|
indexEntry entry;
|
|
int rdlen;
|
|
int i;
|
|
|
|
/* Sanity checks on header intro. */
|
|
if (hdrchkTags(il) || hdrchkData(dl))
|
|
goto errxit;
|
|
|
|
ei = (int_32 *) pv;
|
|
/*@-castexpose@*/
|
|
pe = (entryInfo) &ei[2];
|
|
/*@=castexpose@*/
|
|
dataStart = (unsigned char *) (pe + il);
|
|
dataEnd = dataStart + dl;
|
|
|
|
h = xcalloc(1, sizeof(*h));
|
|
/*@-assignexpose@*/
|
|
h->hv = *hdrVec; /* structure assignment */
|
|
/*@=assignexpose@*/
|
|
/*@-assignexpose -kepttrans@*/
|
|
h->blob = uh;
|
|
/*@=assignexpose =kepttrans@*/
|
|
h->indexAlloced = il + 1;
|
|
h->indexUsed = il;
|
|
h->index = xcalloc(h->indexAlloced, sizeof(*h->index));
|
|
h->flags |= HEADERFLAG_SORTED;
|
|
h->nrefs = 0;
|
|
h = headerLink(h);
|
|
|
|
/*
|
|
* XXX XFree86-libs, ash, and pdksh from Red Hat 5.2 have bogus
|
|
* %verifyscript tag that needs to be diddled.
|
|
*/
|
|
if (ntohl(pe->tag) == 15 &&
|
|
ntohl(pe->type) == RPM_STRING_TYPE &&
|
|
ntohl(pe->count) == 1)
|
|
{
|
|
pe->tag = htonl(1079);
|
|
}
|
|
|
|
entry = h->index;
|
|
i = 0;
|
|
if (!(htonl(pe->tag) < HEADER_I18NTABLE)) {
|
|
h->flags |= HEADERFLAG_LEGACY;
|
|
entry->info.type = REGION_TAG_TYPE;
|
|
entry->info.tag = HEADER_IMAGE;
|
|
/*@-sizeoftype@*/
|
|
entry->info.count = REGION_TAG_COUNT;
|
|
/*@=sizeoftype@*/
|
|
entry->info.offset = ((unsigned char *)pe - dataStart); /* negative offset */
|
|
|
|
/*@-assignexpose@*/
|
|
entry->data = pe;
|
|
/*@=assignexpose@*/
|
|
entry->length = pvlen - sizeof(il) - sizeof(dl);
|
|
rdlen = regionSwab(entry+1, il, 0, pe, dataStart, dataEnd, entry->info.offset);
|
|
#if 0 /* XXX don't check, the 8/98 i18n bug fails here. */
|
|
if (rdlen != dl)
|
|
goto errxit;
|
|
#endif
|
|
entry->rdlen = rdlen;
|
|
entry++;
|
|
h->indexUsed++;
|
|
} else {
|
|
int_32 rdl;
|
|
int_32 ril;
|
|
|
|
h->flags &= ~HEADERFLAG_LEGACY;
|
|
|
|
entry->info.type = htonl(pe->type);
|
|
entry->info.count = htonl(pe->count);
|
|
|
|
if (hdrchkType(entry->info.type))
|
|
goto errxit;
|
|
if (hdrchkTags(entry->info.count))
|
|
goto errxit;
|
|
|
|
{ int off = ntohl(pe->offset);
|
|
|
|
if (hdrchkData(off))
|
|
goto errxit;
|
|
if (off) {
|
|
/*@-sizeoftype@*/
|
|
size_t nb = REGION_TAG_COUNT;
|
|
/*@=sizeoftype@*/
|
|
int_32 * stei = memcpy(alloca(nb), dataStart + off, nb);
|
|
rdl = -ntohl(stei[2]); /* negative offset */
|
|
ril = rdl/sizeof(*pe);
|
|
if (hdrchkTags(ril) || hdrchkData(rdl))
|
|
goto errxit;
|
|
entry->info.tag = htonl(pe->tag);
|
|
} else {
|
|
ril = il;
|
|
/*@-sizeoftype@*/
|
|
rdl = (ril * sizeof(struct entryInfo_s));
|
|
/*@=sizeoftype@*/
|
|
entry->info.tag = HEADER_IMAGE;
|
|
}
|
|
}
|
|
entry->info.offset = -rdl; /* negative offset */
|
|
|
|
/*@-assignexpose@*/
|
|
entry->data = pe;
|
|
/*@=assignexpose@*/
|
|
entry->length = pvlen - sizeof(il) - sizeof(dl);
|
|
rdlen = regionSwab(entry+1, ril-1, 0, pe+1, dataStart, dataEnd, entry->info.offset);
|
|
if (rdlen < 0)
|
|
goto errxit;
|
|
entry->rdlen = rdlen;
|
|
|
|
if (ril < h->indexUsed) {
|
|
indexEntry newEntry = entry + ril;
|
|
int ne = (h->indexUsed - ril);
|
|
int rid = entry->info.offset+1;
|
|
int rc;
|
|
|
|
/* Load dribble entries from region. */
|
|
rc = regionSwab(newEntry, ne, 0, pe+ril, dataStart, dataEnd, rid);
|
|
if (rc < 0)
|
|
goto errxit;
|
|
rdlen += rc;
|
|
|
|
{ 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) headerRemoveEntry(h, newEntry->info.tag);
|
|
if (newEntry->info.tag == HEADER_BASENAMES)
|
|
(void) headerRemoveEntry(h, HEADER_OLDFILENAMES);
|
|
}
|
|
|
|
/* If any duplicate entries were replaced, move new entries down. */
|
|
/*@-boundswrite@*/
|
|
if (h->indexUsed < (save - ne)) {
|
|
memmove(h->index + h->indexUsed, firstEntry,
|
|
(ne * sizeof(*entry)));
|
|
}
|
|
/*@=boundswrite@*/
|
|
h->indexUsed += ne;
|
|
}
|
|
}
|
|
}
|
|
|
|
h->flags &= ~HEADERFLAG_SORTED;
|
|
headerSort(h);
|
|
|
|
/*@-globstate -observertrans @*/
|
|
return h;
|
|
/*@=globstate =observertrans @*/
|
|
|
|
errxit:
|
|
/*@-usereleased@*/
|
|
if (h) {
|
|
h->index = _free(h->index);
|
|
/*@-refcounttrans@*/
|
|
h = _free(h);
|
|
/*@=refcounttrans@*/
|
|
}
|
|
/*@=usereleased@*/
|
|
/*@-refcounttrans -globstate@*/
|
|
return h;
|
|
/*@=refcounttrans =globstate@*/
|
|
}
|
|
|
|
/** \ingroup header
|
|
* Convert header to on-disk representation, and then reload.
|
|
* This is used to insure that all header data is in one chunk.
|
|
* @param h header (with pointers)
|
|
* @param tag region tag
|
|
* @return on-disk header (with offsets)
|
|
*/
|
|
static /*@null@*/
|
|
Header headerReload(/*@only@*/ Header h, int tag)
|
|
/*@modifies h @*/
|
|
{
|
|
Header nh;
|
|
int length;
|
|
/*@-onlytrans@*/
|
|
/*@-boundswrite@*/
|
|
void * uh = doHeaderUnload(h, &length);
|
|
/*@=boundswrite@*/
|
|
|
|
h = headerFree(h);
|
|
/*@=onlytrans@*/
|
|
if (uh == NULL)
|
|
return NULL;
|
|
nh = headerLoad(uh);
|
|
if (nh == NULL) {
|
|
uh = _free(uh);
|
|
return NULL;
|
|
}
|
|
if (nh->flags & HEADERFLAG_ALLOCATED)
|
|
uh = _free(uh);
|
|
nh->flags |= HEADERFLAG_ALLOCATED;
|
|
if (ENTRY_IS_REGION(nh->index)) {
|
|
/*@-boundswrite@*/
|
|
if (tag == HEADER_SIGNATURES || tag == HEADER_IMMUTABLE)
|
|
nh->index[0].info.tag = tag;
|
|
/*@=boundswrite@*/
|
|
}
|
|
return nh;
|
|
}
|
|
|
|
/** \ingroup header
|
|
* Make a copy and convert header to in-memory representation.
|
|
* @param uh on-disk header blob (i.e. with offsets)
|
|
* @return header
|
|
*/
|
|
static /*@null@*/
|
|
Header headerCopyLoad(const void * uh)
|
|
/*@*/
|
|
{
|
|
int_32 * ei = (int_32 *) uh;
|
|
/*@-boundsread@*/
|
|
int_32 il = ntohl(ei[0]); /* index length */
|
|
int_32 dl = ntohl(ei[1]); /* data length */
|
|
/*@=boundsread@*/
|
|
/*@-sizeoftype@*/
|
|
size_t pvlen = sizeof(il) + sizeof(dl) +
|
|
(il * sizeof(struct entryInfo_s)) + dl;
|
|
/*@=sizeoftype@*/
|
|
void * nuh = NULL;
|
|
Header h = NULL;
|
|
|
|
/* Sanity checks on header intro. */
|
|
/*@-branchstate@*/
|
|
if (!(hdrchkTags(il) || hdrchkData(dl)) && pvlen < headerMaxbytes) {
|
|
/*@-boundsread@*/
|
|
nuh = memcpy(xmalloc(pvlen), uh, pvlen);
|
|
/*@=boundsread@*/
|
|
if ((h = headerLoad(nuh)) != NULL)
|
|
h->flags |= HEADERFLAG_ALLOCATED;
|
|
}
|
|
/*@=branchstate@*/
|
|
/*@-branchstate@*/
|
|
if (h == NULL)
|
|
nuh = _free(nuh);
|
|
/*@=branchstate@*/
|
|
return h;
|
|
}
|
|
|
|
/** \ingroup header
|
|
* Read (and load) header from file handle.
|
|
* @param fd file handle
|
|
* @param magicp read (and verify) 8 bytes of (magic, 0)?
|
|
* @return header (or NULL on error)
|
|
*/
|
|
static /*@null@*/
|
|
Header headerRead(FD_t fd, enum hMagic magicp)
|
|
/*@modifies fd @*/
|
|
{
|
|
int_32 block[4];
|
|
int_32 reserved;
|
|
int_32 * ei = NULL;
|
|
int_32 il;
|
|
int_32 dl;
|
|
int_32 magic;
|
|
Header h = NULL;
|
|
size_t len;
|
|
int i;
|
|
|
|
memset(block, 0, sizeof(block));
|
|
i = 2;
|
|
if (magicp == HEADER_MAGIC_YES)
|
|
i += 2;
|
|
|
|
/*@-type@*/ /* FIX: cast? */
|
|
if (timedRead(fd, (char *)block, i*sizeof(*block)) != (i * sizeof(*block)))
|
|
goto exit;
|
|
/*@=type@*/
|
|
|
|
i = 0;
|
|
|
|
/*@-boundsread@*/
|
|
if (magicp == HEADER_MAGIC_YES) {
|
|
magic = block[i++];
|
|
if (memcmp(&magic, header_magic, sizeof(magic)))
|
|
goto exit;
|
|
reserved = block[i++];
|
|
}
|
|
|
|
il = ntohl(block[i]); i++;
|
|
dl = ntohl(block[i]); i++;
|
|
/*@=boundsread@*/
|
|
|
|
/*@-sizeoftype@*/
|
|
len = sizeof(il) + sizeof(dl) + (il * sizeof(struct entryInfo_s)) + dl;
|
|
/*@=sizeoftype@*/
|
|
|
|
/* Sanity checks on header intro. */
|
|
if (hdrchkTags(il) || hdrchkData(dl) || len > headerMaxbytes)
|
|
goto exit;
|
|
|
|
/*@-boundswrite@*/
|
|
ei = xmalloc(len);
|
|
ei[0] = htonl(il);
|
|
ei[1] = htonl(dl);
|
|
len -= sizeof(il) + sizeof(dl);
|
|
/*@=boundswrite@*/
|
|
|
|
/*@-boundsread@*/
|
|
/*@-type@*/ /* FIX: cast? */
|
|
if (timedRead(fd, (char *)&ei[2], len) != len)
|
|
goto exit;
|
|
/*@=type@*/
|
|
/*@=boundsread@*/
|
|
|
|
h = headerLoad(ei);
|
|
|
|
exit:
|
|
if (h) {
|
|
if (h->flags & HEADERFLAG_ALLOCATED)
|
|
ei = _free(ei);
|
|
h->flags |= HEADERFLAG_ALLOCATED;
|
|
} else if (ei)
|
|
ei = _free(ei);
|
|
/*@-mustmod@*/ /* FIX: timedRead macro obscures annotation */
|
|
return h;
|
|
/*@-mustmod@*/
|
|
}
|
|
|
|
/** \ingroup header
|
|
* Write (with unload) header to file handle.
|
|
* @param fd file handle
|
|
* @param h header
|
|
* @param magicp prefix write with 8 bytes of (magic, 0)?
|
|
* @return 0 on success, 1 on error
|
|
*/
|
|
static
|
|
int headerWrite(FD_t fd, /*@null@*/ Header h, enum hMagic magicp)
|
|
/*@globals fileSystem @*/
|
|
/*@modifies fd, h, fileSystem @*/
|
|
{
|
|
ssize_t nb;
|
|
int length;
|
|
const void * uh;
|
|
|
|
if (h == NULL)
|
|
return 1;
|
|
/*@-boundswrite@*/
|
|
uh = doHeaderUnload(h, &length);
|
|
/*@=boundswrite@*/
|
|
if (uh == NULL)
|
|
return 1;
|
|
switch (magicp) {
|
|
case HEADER_MAGIC_YES:
|
|
/*@-boundsread@*/
|
|
/*@-sizeoftype@*/
|
|
nb = Fwrite(header_magic, sizeof(char), sizeof(header_magic), fd);
|
|
/*@=sizeoftype@*/
|
|
/*@=boundsread@*/
|
|
if (nb != sizeof(header_magic))
|
|
goto exit;
|
|
break;
|
|
case HEADER_MAGIC_NO:
|
|
break;
|
|
}
|
|
|
|
/*@-sizeoftype@*/
|
|
nb = Fwrite(uh, sizeof(char), length, fd);
|
|
/*@=sizeoftype@*/
|
|
|
|
exit:
|
|
uh = _free(uh);
|
|
return (nb == length ? 0 : 1);
|
|
}
|
|
|
|
/** \ingroup header
|
|
* Check if tag is in header.
|
|
* @param h header
|
|
* @param tag tag
|
|
* @return 1 on success, 0 on failure
|
|
*/
|
|
static
|
|
int headerIsEntry(/*@null@*/Header h, int_32 tag)
|
|
/*@*/
|
|
{
|
|
/*@-mods@*/ /*@ FIX: h modified by sort. */
|
|
return (findEntry(h, tag, RPM_NULL_TYPE) ? 1 : 0);
|
|
/*@=mods@*/
|
|
}
|
|
|
|
/** \ingroup header
|
|
* Retrieve data from header entry.
|
|
* @todo Permit retrieval of regions other than HEADER_IMUTABLE.
|
|
* @param entry header entry
|
|
* @retval type address of type (or NULL)
|
|
* @retval p address of data (or NULL)
|
|
* @retval c address of count (or NULL)
|
|
* @param minMem string pointers refer to header memory?
|
|
* @return 1 on success, otherwise error.
|
|
*/
|
|
static int copyEntry(const indexEntry entry,
|
|
/*@null@*/ /*@out@*/ hTYP_t type,
|
|
/*@null@*/ /*@out@*/ hPTR_t * p,
|
|
/*@null@*/ /*@out@*/ hCNT_t c,
|
|
int minMem)
|
|
/*@modifies *type, *p, *c @*/
|
|
/*@requires maxSet(type) >= 0 /\ maxSet(p) >= 0 /\ maxSet(c) >= 0 @*/
|
|
{
|
|
int_32 count = entry->info.count;
|
|
int rc = 1; /* XXX 1 on success. */
|
|
|
|
if (p)
|
|
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)) {
|
|
int_32 * ei = ((int_32 *)entry->data) - 2;
|
|
/*@-castexpose@*/
|
|
entryInfo pe = (entryInfo) (ei + 2);
|
|
/*@=castexpose@*/
|
|
/*@-boundsread@*/
|
|
char * dataStart = (char *) (pe + ntohl(ei[0]));
|
|
/*@=boundsread@*/
|
|
int_32 rdl = -entry->info.offset; /* negative offset */
|
|
int_32 ril = rdl/sizeof(*pe);
|
|
|
|
/*@-sizeoftype@*/
|
|
rdl = entry->rdlen;
|
|
count = 2 * sizeof(*ei) + (ril * sizeof(*pe)) + rdl;
|
|
if (entry->info.tag == HEADER_IMAGE) {
|
|
ril -= 1;
|
|
pe += 1;
|
|
} else {
|
|
count += REGION_TAG_COUNT;
|
|
rdl += REGION_TAG_COUNT;
|
|
}
|
|
|
|
/*@-bounds@*/
|
|
*p = xmalloc(count);
|
|
ei = (int_32 *) *p;
|
|
ei[0] = htonl(ril);
|
|
ei[1] = htonl(rdl);
|
|
|
|
/*@-castexpose@*/
|
|
pe = (entryInfo) memcpy(ei + 2, pe, (ril * sizeof(*pe)));
|
|
/*@=castexpose@*/
|
|
|
|
dataStart = (char *) memcpy(pe + ril, dataStart, rdl);
|
|
/*@=sizeoftype@*/
|
|
/*@=bounds@*/
|
|
|
|
rc = regionSwab(NULL, ril, 0, pe, dataStart, NULL, 0);
|
|
/* XXX 1 on success. */
|
|
rc = (rc < 0) ? 0 : 1;
|
|
} else {
|
|
count = entry->length;
|
|
*p = (!minMem
|
|
? memcpy(xmalloc(count), entry->data, count)
|
|
: entry->data);
|
|
}
|
|
break;
|
|
case RPM_STRING_TYPE:
|
|
if (count == 1) {
|
|
*p = entry->data;
|
|
break;
|
|
}
|
|
/*@fallthrough@*/
|
|
case RPM_STRING_ARRAY_TYPE:
|
|
case RPM_I18NSTRING_TYPE:
|
|
{ const char ** ptrEntry;
|
|
/*@-sizeoftype@*/
|
|
int tableSize = count * sizeof(char *);
|
|
/*@=sizeoftype@*/
|
|
char * t;
|
|
int i;
|
|
|
|
/*@-bounds@*/
|
|
/*@-mods@*/
|
|
if (minMem) {
|
|
*p = xmalloc(tableSize);
|
|
ptrEntry = (const char **) *p;
|
|
t = entry->data;
|
|
} else {
|
|
t = xmalloc(tableSize + entry->length);
|
|
*p = (void *)t;
|
|
ptrEntry = (const char **) *p;
|
|
t += tableSize;
|
|
memcpy(t, entry->data, entry->length);
|
|
}
|
|
/*@=mods@*/
|
|
/*@=bounds@*/
|
|
for (i = 0; i < count; i++) {
|
|
/*@-boundswrite@*/
|
|
*ptrEntry++ = t;
|
|
/*@=boundswrite@*/
|
|
t = strchr(t, 0);
|
|
t++;
|
|
}
|
|
} break;
|
|
|
|
default:
|
|
*p = entry->data;
|
|
break;
|
|
}
|
|
if (type) *type = entry->info.type;
|
|
if (c) *c = count;
|
|
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 match, 0 on no match
|
|
*/
|
|
static int headerMatchLocale(const char *td, const char *l, const char *le)
|
|
/*@*/
|
|
{
|
|
const char *fe;
|
|
|
|
|
|
#if 0
|
|
{ const char *s, *ll, *CC, *EE, *dd;
|
|
char *lbuf, *t.
|
|
|
|
/* Copy the buffer and parse out components on the fly. */
|
|
lbuf = alloca(le - l + 1);
|
|
for (s = l, ll = t = lbuf; *s; s++, t++) {
|
|
switch (*s) {
|
|
case '_':
|
|
*t = '\0';
|
|
CC = t + 1;
|
|
break;
|
|
case '.':
|
|
*t = '\0';
|
|
EE = t + 1;
|
|
break;
|
|
case '@':
|
|
*t = '\0';
|
|
dd = t + 1;
|
|
break;
|
|
default:
|
|
*t = *s;
|
|
break;
|
|
}
|
|
}
|
|
|
|
if (ll) /* ISO language should be lower case */
|
|
for (t = ll; *t; t++) *t = tolower(*t);
|
|
if (CC) /* ISO country code should be upper case */
|
|
for (t = CC; *t; t++) *t = toupper(*t);
|
|
|
|
/* There are a total of 16 cases to attempt to match. */
|
|
}
|
|
#endif
|
|
|
|
/* First try a complete match. */
|
|
if (strlen(td) == (le-l) && !strncmp(td, l, (le - l)))
|
|
return 1;
|
|
|
|
/* Next, try stripping optional dialect and matching. */
|
|
for (fe = l; fe < le && *fe != '@'; fe++)
|
|
{};
|
|
if (fe < le && !strncmp(td, l, (fe - l)))
|
|
return 1;
|
|
|
|
/* Next, try stripping optional codeset and matching. */
|
|
for (fe = l; fe < le && *fe != '.'; fe++)
|
|
{};
|
|
if (fe < le && !strncmp(td, l, (fe - l)))
|
|
return 1;
|
|
|
|
/* Finally, try stripping optional country code and matching. */
|
|
for (fe = l; fe < le && *fe != '_'; fe++)
|
|
{};
|
|
if (fe < le && !strncmp(td, l, (fe - l)))
|
|
return 1;
|
|
|
|
return 0;
|
|
}
|
|
|
|
/**
|
|
* Return i18n string from header that matches locale.
|
|
* @param h header
|
|
* @param entry i18n string data
|
|
* @return matching i18n string (or 1st string if no match)
|
|
*/
|
|
/*@dependent@*/ /*@exposed@*/ static char *
|
|
headerFindI18NString(Header h, indexEntry entry)
|
|
/*@*/
|
|
{
|
|
const char *lang, *l, *le;
|
|
indexEntry table;
|
|
|
|
/* 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)
|
|
return entry->data;
|
|
|
|
/*@-mods@*/
|
|
if ((table = findEntry(h, HEADER_I18NTABLE, RPM_STRING_ARRAY_TYPE)) == NULL)
|
|
return entry->data;
|
|
/*@=mods@*/
|
|
|
|
/*@-boundsread@*/
|
|
for (l = lang; *l != '\0'; l = le) {
|
|
const char *td;
|
|
char *ed;
|
|
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, td = table->data, ed = entry->data;
|
|
langNum < entry->info.count;
|
|
langNum++, td += strlen(td) + 1, ed += strlen(ed) + 1) {
|
|
|
|
if (headerMatchLocale(td, l, le))
|
|
return ed;
|
|
|
|
}
|
|
}
|
|
/*@=boundsread@*/
|
|
|
|
return entry->data;
|
|
}
|
|
|
|
/**
|
|
* Retrieve tag data from header.
|
|
* @param h header
|
|
* @param tag tag to retrieve
|
|
* @retval type address of type (or NULL)
|
|
* @retval p address of data (or NULL)
|
|
* @retval c address of count (or NULL)
|
|
* @param minMem string pointers reference header memory?
|
|
* @return 1 on success, 0 on not found
|
|
*/
|
|
static int intGetEntry(Header h, int_32 tag,
|
|
/*@null@*/ /*@out@*/ hTAG_t type,
|
|
/*@null@*/ /*@out@*/ hPTR_t * p,
|
|
/*@null@*/ /*@out@*/ hCNT_t c,
|
|
int minMem)
|
|
/*@modifies *type, *p, *c @*/
|
|
/*@requires maxSet(type) >= 0 /\ maxSet(p) >= 0 /\ maxSet(c) >= 0 @*/
|
|
{
|
|
indexEntry entry;
|
|
int rc;
|
|
|
|
/* First find the tag */
|
|
/*@-mods@*/ /*@ FIX: h modified by sort. */
|
|
entry = findEntry(h, tag, RPM_NULL_TYPE);
|
|
/*@mods@*/
|
|
if (entry == NULL) {
|
|
if (type) type = 0;
|
|
if (p) *p = NULL;
|
|
if (c) *c = 0;
|
|
return 0;
|
|
}
|
|
|
|
switch (entry->info.type) {
|
|
case RPM_I18NSTRING_TYPE:
|
|
rc = 1;
|
|
if (type) *type = RPM_STRING_TYPE;
|
|
if (c) *c = 1;
|
|
/*@-dependenttrans@*/
|
|
if (p) *p = headerFindI18NString(h, entry);
|
|
/*@=dependenttrans@*/
|
|
break;
|
|
default:
|
|
rc = copyEntry(entry, type, p, c, minMem);
|
|
break;
|
|
}
|
|
|
|
/* XXX 1 on success */
|
|
return ((rc == 1) ? 1 : 0);
|
|
}
|
|
|
|
/** \ingroup header
|
|
* Free data allocated when retrieved from header.
|
|
* @param h header
|
|
* @param data address of data (or NULL)
|
|
* @param type type of data (or -1 to force free)
|
|
* @return NULL always
|
|
*/
|
|
static /*@null@*/ void * headerFreeTag(/*@unused@*/ Header h,
|
|
/*@only@*/ /*@null@*/ const void * data, rpmTagType type)
|
|
/*@modifies data @*/
|
|
{
|
|
if (data) {
|
|
/*@-branchstate@*/
|
|
if (type == -1 ||
|
|
type == RPM_STRING_ARRAY_TYPE ||
|
|
type == RPM_I18NSTRING_TYPE ||
|
|
type == RPM_BIN_TYPE)
|
|
data = _free(data);
|
|
/*@=branchstate@*/
|
|
}
|
|
return NULL;
|
|
}
|
|
|
|
/** \ingroup header
|
|
* Retrieve tag value.
|
|
* Will never return RPM_I18NSTRING_TYPE! RPM_STRING_TYPE elements with
|
|
* RPM_I18NSTRING_TYPE equivalent entries are translated (if HEADER_I18NTABLE
|
|
* entry is present).
|
|
*
|
|
* @param h header
|
|
* @param tag tag
|
|
* @retval type address of tag value data type (or NULL)
|
|
* @retval p address of pointer to tag value(s) (or NULL)
|
|
* @retval c address of number of values (or NULL)
|
|
* @return 1 on success, 0 on failure
|
|
*/
|
|
static
|
|
int headerGetEntry(Header h, int_32 tag,
|
|
/*@null@*/ /*@out@*/ hTYP_t type,
|
|
/*@null@*/ /*@out@*/ void ** p,
|
|
/*@null@*/ /*@out@*/ hCNT_t c)
|
|
/*@modifies *type, *p, *c @*/
|
|
/*@requires maxSet(type) >= 0 /\ maxSet(p) >= 0 /\ maxSet(c) >= 0 @*/
|
|
{
|
|
return intGetEntry(h, tag, type, (hPTR_t *)p, c, 0);
|
|
}
|
|
|
|
/** \ingroup header
|
|
* Retrieve tag value using header internal array.
|
|
* Get an entry using as little extra RAM as possible to return the tag value.
|
|
* This is only an issue for RPM_STRING_ARRAY_TYPE.
|
|
*
|
|
* @param h header
|
|
* @param tag tag
|
|
* @retval type address of tag value data type (or NULL)
|
|
* @retval p address of pointer to tag value(s) (or NULL)
|
|
* @retval c address of number of values (or NULL)
|
|
* @return 1 on success, 0 on failure
|
|
*/
|
|
static
|
|
int headerGetEntryMinMemory(Header h, int_32 tag,
|
|
/*@null@*/ /*@out@*/ hTYP_t type,
|
|
/*@null@*/ /*@out@*/ hPTR_t * p,
|
|
/*@null@*/ /*@out@*/ hCNT_t c)
|
|
/*@modifies *type, *p, *c @*/
|
|
/*@requires maxSet(type) >= 0 /\ maxSet(p) >= 0 /\ maxSet(c) >= 0 @*/
|
|
{
|
|
return intGetEntry(h, tag, type, p, c, 1);
|
|
}
|
|
|
|
int headerGetRawEntry(Header h, int_32 tag, int_32 * type, hPTR_t * p,
|
|
int_32 * c)
|
|
{
|
|
indexEntry entry;
|
|
int rc;
|
|
|
|
if (p == NULL) return headerIsEntry(h, tag);
|
|
|
|
/* First find the tag */
|
|
/*@-mods@*/ /*@ FIX: h modified by sort. */
|
|
entry = findEntry(h, tag, RPM_NULL_TYPE);
|
|
/*@=mods@*/
|
|
if (!entry) {
|
|
if (p) *p = NULL;
|
|
if (c) *c = 0;
|
|
return 0;
|
|
}
|
|
|
|
rc = copyEntry(entry, type, p, c, 0);
|
|
|
|
/* XXX 1 on success */
|
|
return ((rc == 1) ? 1 : 0);
|
|
}
|
|
|
|
/**
|
|
*/
|
|
static void copyData(int_32 type, /*@out@*/ void * dstPtr, const void * srcPtr,
|
|
int_32 cnt, int dataLength)
|
|
/*@modifies *dstPtr @*/
|
|
{
|
|
switch (type) {
|
|
case RPM_STRING_ARRAY_TYPE:
|
|
case RPM_I18NSTRING_TYPE:
|
|
{ const char ** av = (const char **) srcPtr;
|
|
char * t = dstPtr;
|
|
|
|
/*@-bounds@*/
|
|
while (cnt-- > 0 && dataLength > 0) {
|
|
const char * s;
|
|
if ((s = *av++) == NULL)
|
|
continue;
|
|
do {
|
|
*t++ = *s++;
|
|
} while (s[-1] && --dataLength > 0);
|
|
}
|
|
/*@=bounds@*/
|
|
} break;
|
|
|
|
default:
|
|
/*@-boundswrite@*/
|
|
memmove(dstPtr, srcPtr, dataLength);
|
|
/*@=boundswrite@*/
|
|
break;
|
|
}
|
|
}
|
|
|
|
/**
|
|
* Return (malloc'ed) copy of entry data.
|
|
* @param type entry data type
|
|
* @param p entry data
|
|
* @param c entry item count
|
|
* @retval lengthPtr no. bytes in returned data
|
|
* @return (malloc'ed) copy of entry data, NULL on error
|
|
*/
|
|
/*@null@*/
|
|
static void *
|
|
grabData(int_32 type, hPTR_t p, int_32 c, /*@out@*/ int * lengthPtr)
|
|
/*@modifies *lengthPtr @*/
|
|
/*@requires maxSet(lengthPtr) >= 0 @*/
|
|
{
|
|
void * data = NULL;
|
|
int length;
|
|
|
|
length = dataLength(type, p, c, 0, NULL);
|
|
/*@-branchstate@*/
|
|
if (length > 0) {
|
|
data = xmalloc(length);
|
|
copyData(type, data, p, c, length);
|
|
}
|
|
/*@=branchstate@*/
|
|
|
|
if (lengthPtr)
|
|
*lengthPtr = length;
|
|
return data;
|
|
}
|
|
|
|
/** \ingroup header
|
|
* Add tag to header.
|
|
* Duplicate tags are okay, but only defined for iteration (with the
|
|
* exceptions noted below). While you are allowed to add i18n string
|
|
* arrays through this function, you probably don't mean to. See
|
|
* headerAddI18NString() instead.
|
|
*
|
|
* @param h header
|
|
* @param tag tag
|
|
* @param type tag value data type
|
|
* @param p pointer to tag value(s)
|
|
* @param c number of values
|
|
* @return 1 on success, 0 on failure
|
|
*/
|
|
static
|
|
int headerAddEntry(Header h, int_32 tag, int_32 type, const void * p, int_32 c)
|
|
/*@modifies h @*/
|
|
{
|
|
indexEntry entry;
|
|
void * data;
|
|
int length;
|
|
|
|
/* Count must always be >= 1 for headerAddEntry. */
|
|
if (c <= 0)
|
|
return 0;
|
|
|
|
if (hdrchkType(type))
|
|
return 0;
|
|
if (hdrchkData(c))
|
|
return 0;
|
|
|
|
length = 0;
|
|
/*@-boundswrite@*/
|
|
data = grabData(type, p, c, &length);
|
|
/*@=boundswrite@*/
|
|
if (data == NULL || length <= 0)
|
|
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 = tag;
|
|
entry->info.type = type;
|
|
entry->info.count = c;
|
|
entry->info.offset = 0;
|
|
entry->data = data;
|
|
entry->length = length;
|
|
|
|
/*@-boundsread@*/
|
|
if (h->indexUsed > 0 && tag < h->index[h->indexUsed-1].info.tag)
|
|
h->flags &= ~HEADERFLAG_SORTED;
|
|
/*@=boundsread@*/
|
|
h->indexUsed++;
|
|
|
|
return 1;
|
|
}
|
|
|
|
/** \ingroup header
|
|
* Append element to tag array in header.
|
|
* Appends item p to entry w/ tag and type as passed. Won't work on
|
|
* RPM_STRING_TYPE. Any pointers into header memory returned from
|
|
* headerGetEntryMinMemory() for this entry are invalid after this
|
|
* call has been made!
|
|
*
|
|
* @param h header
|
|
* @param tag tag
|
|
* @param type tag value data type
|
|
* @param p pointer to tag value(s)
|
|
* @param c number of values
|
|
* @return 1 on success, 0 on failure
|
|
*/
|
|
static
|
|
int headerAppendEntry(Header h, int_32 tag, int_32 type,
|
|
const void * p, int_32 c)
|
|
/*@modifies h @*/
|
|
{
|
|
indexEntry entry;
|
|
int length;
|
|
|
|
if (type == RPM_STRING_TYPE || type == RPM_I18NSTRING_TYPE) {
|
|
/* we can't do this */
|
|
return 0;
|
|
}
|
|
|
|
/* Find the tag entry in the header. */
|
|
entry = findEntry(h, tag, type);
|
|
if (!entry)
|
|
return 0;
|
|
|
|
length = dataLength(type, p, c, 0, NULL);
|
|
if (length < 0)
|
|
return 0;
|
|
|
|
if (ENTRY_IN_REGION(entry)) {
|
|
char * t = xmalloc(entry->length + length);
|
|
/*@-bounds@*/
|
|
memcpy(t, entry->data, entry->length);
|
|
/*@=bounds@*/
|
|
entry->data = t;
|
|
entry->info.offset = 0;
|
|
} else
|
|
entry->data = xrealloc(entry->data, entry->length + length);
|
|
|
|
copyData(type, ((char *) entry->data) + entry->length, p, c, length);
|
|
|
|
entry->length += length;
|
|
|
|
entry->info.count += c;
|
|
|
|
return 1;
|
|
}
|
|
|
|
/** \ingroup header
|
|
* Add or append element to tag array in header.
|
|
* @todo Arg "p" should have const.
|
|
* @param h header
|
|
* @param tag tag
|
|
* @param type tag value data type
|
|
* @param p pointer to tag value(s)
|
|
* @param c number of values
|
|
* @return 1 on success, 0 on failure
|
|
*/
|
|
static
|
|
int headerAddOrAppendEntry(Header h, int_32 tag, int_32 type,
|
|
const void * p, int_32 c)
|
|
/*@modifies h @*/
|
|
{
|
|
return (findEntry(h, tag, type)
|
|
? headerAppendEntry(h, tag, type, p, c)
|
|
: headerAddEntry(h, tag, type, p, c));
|
|
}
|
|
|
|
/** \ingroup header
|
|
* Add locale specific tag to header.
|
|
* A NULL lang is interpreted as the C locale. Here are the rules:
|
|
* \verbatim
|
|
* - If the tag isn't in the header, it's added with the passed string
|
|
* as new value.
|
|
* - If the tag occurs multiple times in entry, which tag is affected
|
|
* by the operation is undefined.
|
|
* - If the tag is in the header w/ this language, the entry is
|
|
* *replaced* (like headerModifyEntry()).
|
|
* \endverbatim
|
|
* This function is intended to just "do the right thing". If you need
|
|
* more fine grained control use headerAddEntry() and headerModifyEntry().
|
|
*
|
|
* @param h header
|
|
* @param tag tag
|
|
* @param string tag value
|
|
* @param lang locale
|
|
* @return 1 on success, 0 on failure
|
|
*/
|
|
static
|
|
int headerAddI18NString(Header h, int_32 tag, const char * string,
|
|
const char * lang)
|
|
/*@modifies h @*/
|
|
{
|
|
indexEntry table, entry;
|
|
const char ** strArray;
|
|
int length;
|
|
int ghosts;
|
|
int i, langNum;
|
|
char * buf;
|
|
|
|
table = findEntry(h, HEADER_I18NTABLE, 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];
|
|
int count = 0;
|
|
if (!lang || (lang[0] == 'C' && lang[1] == '\0')) {
|
|
/*@-observertrans -readonlytrans@*/
|
|
charArray[count++] = "C";
|
|
/*@=observertrans =readonlytrans@*/
|
|
} else {
|
|
/*@-observertrans -readonlytrans@*/
|
|
charArray[count++] = "C";
|
|
/*@=observertrans =readonlytrans@*/
|
|
charArray[count++] = lang;
|
|
}
|
|
if (!headerAddEntry(h, HEADER_I18NTABLE, RPM_STRING_ARRAY_TYPE,
|
|
&charArray, count))
|
|
return 0;
|
|
table = findEntry(h, HEADER_I18NTABLE, RPM_STRING_ARRAY_TYPE);
|
|
}
|
|
|
|
if (!table)
|
|
return 0;
|
|
/*@-branchstate@*/
|
|
if (!lang) lang = "C";
|
|
/*@=branchstate@*/
|
|
|
|
{ const char * l = table->data;
|
|
for (langNum = 0; langNum < table->info.count; langNum++) {
|
|
if (!strcmp(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) {
|
|
strArray = alloca(sizeof(*strArray) * (langNum + 1));
|
|
for (i = 0; i < langNum; i++)
|
|
strArray[i] = "";
|
|
strArray[langNum] = string;
|
|
return headerAddEntry(h, tag, RPM_I18NSTRING_TYPE, strArray,
|
|
langNum + 1);
|
|
} 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;
|
|
/*@-mayaliasunique@*/
|
|
memcpy(t, string, sn);
|
|
t += sn;
|
|
memcpy(t, e, en);
|
|
t += en;
|
|
/*@=mayaliasunique@*/
|
|
|
|
/* 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);
|
|
/*@-dependenttrans@*/
|
|
entry->data = buf;
|
|
/*@=dependenttrans@*/
|
|
}
|
|
|
|
return 0;
|
|
}
|
|
|
|
/** \ingroup header
|
|
* Modify tag in header.
|
|
* If there are multiple entries with this tag, the first one gets replaced.
|
|
* @param h header
|
|
* @param tag tag
|
|
* @param type tag value data type
|
|
* @param p pointer to tag value(s)
|
|
* @param c number of values
|
|
* @return 1 on success, 0 on failure
|
|
*/
|
|
static
|
|
int headerModifyEntry(Header h, int_32 tag, int_32 type,
|
|
const void * p, int_32 c)
|
|
/*@modifies h @*/
|
|
{
|
|
indexEntry entry;
|
|
void * oldData;
|
|
void * data;
|
|
int length;
|
|
|
|
/* First find the tag */
|
|
entry = findEntry(h, tag, type);
|
|
if (!entry)
|
|
return 0;
|
|
|
|
length = 0;
|
|
data = grabData(type, p, c, &length);
|
|
if (data == NULL || length <= 0)
|
|
return 0;
|
|
|
|
/* make sure entry points to the first occurence of this tag */
|
|
while (entry > h->index && (entry - 1)->info.tag == 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 = c;
|
|
entry->info.type = type;
|
|
entry->data = data;
|
|
entry->length = length;
|
|
|
|
/*@-branchstate@*/
|
|
if (ENTRY_IN_REGION(entry)) {
|
|
entry->info.offset = 0;
|
|
} else
|
|
oldData = _free(oldData);
|
|
/*@=branchstate@*/
|
|
|
|
return 1;
|
|
}
|
|
|
|
/**
|
|
*/
|
|
static char escapedChar(const char ch) /*@*/
|
|
{
|
|
switch (ch) {
|
|
case 'a': return '\a';
|
|
case 'b': return '\b';
|
|
case 'f': return '\f';
|
|
case 'n': return '\n';
|
|
case 'r': return '\r';
|
|
case 't': return '\t';
|
|
case 'v': return '\v';
|
|
default: return ch;
|
|
}
|
|
}
|
|
|
|
/**
|
|
* Destroy headerSprintf format array.
|
|
* @param format sprintf format array
|
|
* @param num number of elements
|
|
* @return NULL always
|
|
*/
|
|
static /*@null@*/ sprintfToken
|
|
freeFormat( /*@only@*/ /*@null@*/ sprintfToken format, int num)
|
|
/*@modifies *format @*/
|
|
{
|
|
int i;
|
|
|
|
if (format == NULL) return NULL;
|
|
|
|
for (i = 0; i < num; i++) {
|
|
switch (format[i].type) {
|
|
case PTOK_ARRAY:
|
|
/*@-boundswrite@*/
|
|
format[i].u.array.format =
|
|
freeFormat(format[i].u.array.format,
|
|
format[i].u.array.numTokens);
|
|
/*@=boundswrite@*/
|
|
/*@switchbreak@*/ break;
|
|
case PTOK_COND:
|
|
/*@-boundswrite@*/
|
|
format[i].u.cond.ifFormat =
|
|
freeFormat(format[i].u.cond.ifFormat,
|
|
format[i].u.cond.numIfTokens);
|
|
format[i].u.cond.elseFormat =
|
|
freeFormat(format[i].u.cond.elseFormat,
|
|
format[i].u.cond.numElseTokens);
|
|
/*@=boundswrite@*/
|
|
/*@switchbreak@*/ break;
|
|
case PTOK_NONE:
|
|
case PTOK_TAG:
|
|
case PTOK_STRING:
|
|
default:
|
|
/*@switchbreak@*/ break;
|
|
}
|
|
}
|
|
format = _free(format);
|
|
return NULL;
|
|
}
|
|
|
|
/**
|
|
* Header tag iterator data structure.
|
|
*/
|
|
struct headerIterator_s {
|
|
/*@unused@*/
|
|
Header h; /*!< Header being iterated. */
|
|
/*@unused@*/
|
|
int next_index; /*!< Next tag index. */
|
|
};
|
|
|
|
/** \ingroup header
|
|
* Destroy header tag iterator.
|
|
* @param hi header tag iterator
|
|
* @return NULL always
|
|
*/
|
|
static /*@null@*/
|
|
HeaderIterator headerFreeIterator(/*@only@*/ HeaderIterator hi)
|
|
/*@modifies hi @*/
|
|
{
|
|
if (hi != NULL) {
|
|
hi->h = headerFree(hi->h);
|
|
hi = _free(hi);
|
|
}
|
|
return hi;
|
|
}
|
|
|
|
/** \ingroup header
|
|
* Create header tag iterator.
|
|
* @param h header
|
|
* @return header tag iterator
|
|
*/
|
|
static
|
|
HeaderIterator headerInitIterator(Header h)
|
|
/*@modifies h */
|
|
{
|
|
HeaderIterator hi = xmalloc(sizeof(*hi));
|
|
|
|
headerSort(h);
|
|
|
|
hi->h = headerLink(h);
|
|
hi->next_index = 0;
|
|
return hi;
|
|
}
|
|
|
|
/** \ingroup header
|
|
* Return next tag from header.
|
|
* @param hi header tag iterator
|
|
* @retval *tag tag
|
|
* @retval *type tag value data type
|
|
* @retval *p pointer to tag value(s)
|
|
* @retval *c number of values
|
|
* @return 1 on success, 0 on failure
|
|
*/
|
|
static
|
|
int headerNextIterator(HeaderIterator hi,
|
|
/*@null@*/ /*@out@*/ hTAG_t tag,
|
|
/*@null@*/ /*@out@*/ hTYP_t type,
|
|
/*@null@*/ /*@out@*/ hPTR_t * p,
|
|
/*@null@*/ /*@out@*/ hCNT_t c)
|
|
/*@modifies hi, *tag, *type, *p, *c @*/
|
|
/*@requires maxSet(tag) >= 0 /\ maxSet(type) >= 0
|
|
/\ maxSet(p) >= 0 /\ maxSet(c) >= 0 @*/
|
|
{
|
|
Header h = hi->h;
|
|
int slot = hi->next_index;
|
|
indexEntry entry = NULL;
|
|
int rc;
|
|
|
|
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 0;
|
|
|
|
/*@-noeffect@*/ /* LCL: no clue */
|
|
hi->next_index++;
|
|
/*@=noeffect@*/
|
|
|
|
if (tag)
|
|
*tag = entry->info.tag;
|
|
|
|
rc = copyEntry(entry, type, p, c, 0);
|
|
|
|
/* XXX 1 on success */
|
|
return ((rc == 1) ? 1 : 0);
|
|
}
|
|
|
|
/** \ingroup header
|
|
* Duplicate a header.
|
|
* @param h header
|
|
* @return new header instance
|
|
*/
|
|
static /*@null@*/
|
|
Header headerCopy(Header h)
|
|
/*@modifies h @*/
|
|
{
|
|
Header nh = headerNew();
|
|
HeaderIterator hi;
|
|
int_32 tag, type, count;
|
|
hPTR_t ptr;
|
|
|
|
/*@-branchstate@*/
|
|
for (hi = headerInitIterator(h);
|
|
headerNextIterator(hi, &tag, &type, &ptr, &count);
|
|
ptr = headerFreeData((void *)ptr, type))
|
|
{
|
|
if (ptr) (void) headerAddEntry(nh, tag, type, ptr, count);
|
|
}
|
|
hi = headerFreeIterator(hi);
|
|
/*@=branchstate@*/
|
|
|
|
return headerReload(nh, HEADER_IMAGE);
|
|
}
|
|
|
|
/**
|
|
*/
|
|
typedef struct headerSprintfArgs_s {
|
|
Header h;
|
|
char * fmt;
|
|
/*@temp@*/
|
|
headerTagTableEntry tags;
|
|
/*@temp@*/
|
|
headerSprintfExtension exts;
|
|
/*@observer@*/ /*@null@*/
|
|
const char * errmsg;
|
|
rpmec ec;
|
|
sprintfToken format;
|
|
/*@relnull@*/
|
|
HeaderIterator hi;
|
|
/*@owned@*/
|
|
char * val;
|
|
size_t vallen;
|
|
size_t alloced;
|
|
int numTokens;
|
|
int i;
|
|
} * headerSprintfArgs;
|
|
|
|
/**
|
|
* Initialize an hsa iteration.
|
|
* @param hsa headerSprintf args
|
|
* @return headerSprintf args
|
|
*/
|
|
static headerSprintfArgs hsaInit(/*@returned@*/ headerSprintfArgs hsa)
|
|
/*@modifies hsa */
|
|
{
|
|
sprintfTag tag =
|
|
(hsa->format->type == PTOK_TAG
|
|
? &hsa->format->u.tag :
|
|
(hsa->format->type == PTOK_ARRAY
|
|
? &hsa->format->u.array.format->u.tag :
|
|
NULL));
|
|
|
|
if (hsa != NULL) {
|
|
#if 0
|
|
if (tag != NULL) {
|
|
fprintf(stderr, "*** hsaInit(%d): fmt %p ext[%d] %p #%d 1? %d format \"%s\" type \"%s\" pad %d\n", hsa->format->type, tag->fmt, tag->extNum, tag->ext, tag->tag, tag->justOne, tag->format, tag->type, tag->pad);
|
|
}
|
|
#endif
|
|
hsa->i = 0;
|
|
if (tag != NULL && tag->tag == -2)
|
|
hsa->hi = headerInitIterator(hsa->h);
|
|
}
|
|
/*@-nullret@*/
|
|
return hsa;
|
|
/*@=nullret@*/
|
|
}
|
|
|
|
/**
|
|
* Return next hsa iteration item.
|
|
* @param hsa headerSprintf args
|
|
* @return next sprintfToken (or NULL)
|
|
*/
|
|
/*@null@*/
|
|
static sprintfToken hsaNext(/*@returned@*/ headerSprintfArgs hsa)
|
|
/*@modifies hsa */
|
|
{
|
|
sprintfToken fmt = NULL;
|
|
sprintfTag tag =
|
|
(hsa->format->type == PTOK_TAG
|
|
? &hsa->format->u.tag :
|
|
(hsa->format->type == PTOK_ARRAY
|
|
? &hsa->format->u.array.format->u.tag :
|
|
NULL));
|
|
|
|
if (hsa != NULL && hsa->i >= 0 && hsa->i < hsa->numTokens) {
|
|
fmt = hsa->format + hsa->i;
|
|
if (hsa->hi == NULL) {
|
|
hsa->i++;
|
|
} else {
|
|
int_32 tagno;
|
|
int_32 type;
|
|
int_32 count;
|
|
|
|
/*@-boundswrite@*/
|
|
if (!headerNextIterator(hsa->hi, &tagno, &type, NULL, &count))
|
|
fmt = NULL;
|
|
tag->tag = tagno;
|
|
/*@=boundswrite@*/
|
|
}
|
|
}
|
|
|
|
#if 0
|
|
if (tag != NULL) {
|
|
fprintf(stderr, "*** hsaNext(%d): fmt %p ext[%d] %p #%d 1? %d format \"%s\" type \"%s\" pad %d ret %p\n", hsa->format->type, tag->fmt, tag->extNum, tag->ext, tag->tag, tag->justOne, tag->format, tag->type, tag->pad, fmt);
|
|
}
|
|
#endif
|
|
|
|
/*@-dependenttrans -onlytrans@*/
|
|
return fmt;
|
|
/*@=dependenttrans =onlytrans@*/
|
|
}
|
|
|
|
/**
|
|
* Finish an hsa iteration.
|
|
* @param hsa headerSprintf args
|
|
* @return headerSprintf args
|
|
*/
|
|
static headerSprintfArgs hsaFini(/*@returned@*/ headerSprintfArgs hsa)
|
|
/*@modifies hsa */
|
|
{
|
|
#if 0
|
|
sprintfTag tag =
|
|
(hsa->format->type == PTOK_TAG
|
|
? &hsa->format->u.tag :
|
|
(hsa->format->type == PTOK_ARRAY
|
|
? &hsa->format->u.array.format->u.tag :
|
|
NULL));
|
|
|
|
if (tag != NULL) {
|
|
fprintf(stderr, "*** hsaFini(%d): fmt %p ext[%d] %p #%d 1? %d format \"%s\" type \"%s\" pad %d\n", hsa->format->type, tag->fmt, tag->extNum, tag->ext, tag->tag, tag->justOne, tag->format, tag->type, tag->pad);
|
|
}
|
|
#endif
|
|
|
|
if (hsa != NULL) {
|
|
hsa->hi = headerFreeIterator(hsa->hi);
|
|
hsa->i = 0;
|
|
}
|
|
/*@-nullret@*/
|
|
return hsa;
|
|
/*@=nullret@*/
|
|
}
|
|
|
|
/**
|
|
* Reserve sufficient buffer space for next output value.
|
|
* @param hsa headerSprintf args
|
|
* @param need no. of bytes to reserve
|
|
* @return pointer to reserved space
|
|
*/
|
|
/*@dependent@*/ /*@exposed@*/
|
|
static char * hsaReserve(headerSprintfArgs hsa, size_t need)
|
|
/*@modifies hsa */
|
|
{
|
|
if ((hsa->vallen + need) >= hsa->alloced) {
|
|
if (hsa->alloced <= need)
|
|
hsa->alloced += need;
|
|
hsa->alloced <<= 1;
|
|
hsa->val = xrealloc(hsa->val, hsa->alloced+1);
|
|
}
|
|
return hsa->val + hsa->vallen;
|
|
}
|
|
|
|
/**
|
|
* @param hsa headerSprintf args
|
|
* @param token parsed fields
|
|
* @param name name to find
|
|
* @return 0 on success, 1 on not found
|
|
*/
|
|
static int findTag(headerSprintfArgs hsa, sprintfToken token, const char * name)
|
|
/*@modifies token @*/
|
|
{
|
|
headerTagTableEntry tag;
|
|
headerSprintfExtension ext;
|
|
sprintfTag stag = (token->type == PTOK_COND
|
|
? &token->u.cond.tag : &token->u.tag);
|
|
|
|
stag->fmt = NULL;
|
|
stag->ext = NULL;
|
|
stag->extNum = 0;
|
|
stag->tag = -1;
|
|
|
|
if (!strcmp(name, "*")) {
|
|
stag->tag = -2;
|
|
goto bingo;
|
|
}
|
|
|
|
/*@-branchstate@*/
|
|
if (strncmp("RPMTAG_", name, sizeof("RPMTAG_")-1)) {
|
|
/*@-boundswrite@*/
|
|
char * t = alloca(strlen(name) + sizeof("RPMTAG_"));
|
|
(void) stpcpy( stpcpy(t, "RPMTAG_"), name);
|
|
name = t;
|
|
/*@=boundswrite@*/
|
|
}
|
|
/*@=branchstate@*/
|
|
|
|
/* Search extensions for specific tag override. */
|
|
for (ext = hsa->exts; ext != NULL && ext->type != HEADER_EXT_LAST;
|
|
ext = (ext->type == HEADER_EXT_MORE ? ext->u.more : ext+1))
|
|
{
|
|
if (ext->name == NULL || ext->type != HEADER_EXT_TAG)
|
|
continue;
|
|
if (!xstrcasecmp(ext->name, name)) {
|
|
stag->ext = ext->u.tagFunction;
|
|
stag->extNum = ext - hsa->exts;
|
|
goto bingo;
|
|
}
|
|
}
|
|
|
|
/* Search tag names. */
|
|
for (tag = hsa->tags; tag->name != NULL; tag++) {
|
|
if (!xstrcasecmp(tag->name, name)) {
|
|
stag->tag = tag->val;
|
|
goto bingo;
|
|
}
|
|
}
|
|
|
|
return 1;
|
|
|
|
bingo:
|
|
/* Search extensions for specific format. */
|
|
if (stag->type != NULL)
|
|
for (ext = hsa->exts; ext != NULL && ext->type != HEADER_EXT_LAST;
|
|
ext = (ext->type == HEADER_EXT_MORE ? ext->u.more : ext+1))
|
|
{
|
|
if (ext->name == NULL || ext->type != HEADER_EXT_FORMAT)
|
|
continue;
|
|
if (!strcmp(ext->name, stag->type)) {
|
|
stag->fmt = ext->u.formatFunction;
|
|
break;
|
|
}
|
|
}
|
|
return 0;
|
|
}
|
|
|
|
/* forward ref */
|
|
/**
|
|
* @param hsa headerSprintf args
|
|
* @param token
|
|
* @param str
|
|
* @retval *endPtr
|
|
* @return 0 on success
|
|
*/
|
|
static int parseExpression(headerSprintfArgs hsa, sprintfToken token,
|
|
char * str, /*@out@*/char ** endPtr)
|
|
/*@modifies hsa, str, token, *endPtr @*/
|
|
/*@requires maxSet(endPtr) >= 0 @*/;
|
|
|
|
/**
|
|
* @param hsa headerSprintf args
|
|
* @param str
|
|
* @retval *formatPtr
|
|
* @retval *numTokensPtr
|
|
* @retval *endPtr
|
|
* @param state
|
|
* @return 0 on success
|
|
*/
|
|
static int parseFormat(headerSprintfArgs hsa, /*@null@*/ char * str,
|
|
/*@out@*/sprintfToken * formatPtr, /*@out@*/int * numTokensPtr,
|
|
/*@null@*/ /*@out@*/ char ** endPtr, int state)
|
|
/*@modifies hsa, str, *formatPtr, *numTokensPtr, *endPtr @*/
|
|
/*@requires maxSet(formatPtr) >= 0 /\ maxSet(numTokensPtr) >= 0
|
|
/\ maxSet(endPtr) >= 0 @*/
|
|
{
|
|
char * chptr, * start, * next, * dst;
|
|
sprintfToken format;
|
|
sprintfToken token;
|
|
int numTokens;
|
|
int i;
|
|
int done = 0;
|
|
|
|
/* upper limit on number of individual formats */
|
|
numTokens = 0;
|
|
if (str != NULL)
|
|
for (chptr = str; *chptr != '\0'; chptr++)
|
|
if (*chptr == '%') numTokens++;
|
|
numTokens = numTokens * 2 + 1;
|
|
|
|
format = xcalloc(numTokens, sizeof(*format));
|
|
if (endPtr) *endPtr = NULL;
|
|
|
|
/*@-infloops@*/ /* LCL: can't detect done termination */
|
|
dst = start = str;
|
|
numTokens = 0;
|
|
token = NULL;
|
|
if (start != NULL)
|
|
while (*start != '\0') {
|
|
switch (*start) {
|
|
case '%':
|
|
/* handle %% */
|
|
if (*(start + 1) == '%') {
|
|
if (token == NULL || token->type != PTOK_STRING) {
|
|
token = format + numTokens++;
|
|
token->type = PTOK_STRING;
|
|
/*@-temptrans -assignexpose@*/
|
|
dst = token->u.string.string = start;
|
|
/*@=temptrans =assignexpose@*/
|
|
}
|
|
start++;
|
|
/*@-boundswrite@*/
|
|
*dst++ = *start++;
|
|
/*@=boundswrite@*/
|
|
/*@switchbreak@*/ break;
|
|
}
|
|
|
|
token = format + numTokens++;
|
|
/*@-boundswrite@*/
|
|
*dst++ = '\0';
|
|
/*@=boundswrite@*/
|
|
start++;
|
|
|
|
if (*start == '|') {
|
|
char * newEnd;
|
|
|
|
start++;
|
|
/*@-boundswrite@*/
|
|
if (parseExpression(hsa, token, start, &newEnd))
|
|
{
|
|
format = freeFormat(format, numTokens);
|
|
return 1;
|
|
}
|
|
/*@=boundswrite@*/
|
|
start = newEnd;
|
|
/*@switchbreak@*/ break;
|
|
}
|
|
|
|
/*@-assignexpose@*/
|
|
token->u.tag.format = start;
|
|
/*@=assignexpose@*/
|
|
token->u.tag.pad = 0;
|
|
token->u.tag.justOne = 0;
|
|
token->u.tag.arrayCount = 0;
|
|
|
|
chptr = start;
|
|
while (*chptr && *chptr != '{' && *chptr != '%') chptr++;
|
|
if (!*chptr || *chptr == '%') {
|
|
hsa->errmsg = _("missing { after %");
|
|
format = freeFormat(format, numTokens);
|
|
return 1;
|
|
}
|
|
|
|
/*@-boundswrite@*/
|
|
*chptr++ = '\0';
|
|
/*@=boundswrite@*/
|
|
|
|
while (start < chptr) {
|
|
if (xisdigit(*start)) {
|
|
i = strtoul(start, &start, 10);
|
|
token->u.tag.pad += i;
|
|
} else {
|
|
start++;
|
|
}
|
|
}
|
|
|
|
if (*start == '=') {
|
|
token->u.tag.justOne = 1;
|
|
start++;
|
|
} else if (*start == '#') {
|
|
token->u.tag.justOne = 1;
|
|
token->u.tag.arrayCount = 1;
|
|
start++;
|
|
}
|
|
|
|
next = start;
|
|
while (*next && *next != '}') next++;
|
|
if (!*next) {
|
|
hsa->errmsg = _("missing } after %{");
|
|
format = freeFormat(format, numTokens);
|
|
return 1;
|
|
}
|
|
/*@-boundswrite@*/
|
|
*next++ = '\0';
|
|
/*@=boundswrite@*/
|
|
|
|
chptr = start;
|
|
while (*chptr && *chptr != ':') chptr++;
|
|
|
|
if (*chptr != '\0') {
|
|
/*@-boundswrite@*/
|
|
*chptr++ = '\0';
|
|
/*@=boundswrite@*/
|
|
if (!*chptr) {
|
|
hsa->errmsg = _("empty tag format");
|
|
format = freeFormat(format, numTokens);
|
|
return 1;
|
|
}
|
|
/*@-assignexpose@*/
|
|
token->u.tag.type = chptr;
|
|
/*@=assignexpose@*/
|
|
} else {
|
|
token->u.tag.type = NULL;
|
|
}
|
|
|
|
if (!*start) {
|
|
hsa->errmsg = _("empty tag name");
|
|
format = freeFormat(format, numTokens);
|
|
return 1;
|
|
}
|
|
|
|
i = 0;
|
|
token->type = PTOK_TAG;
|
|
|
|
if (findTag(hsa, token, start)) {
|
|
hsa->errmsg = _("unknown tag");
|
|
format = freeFormat(format, numTokens);
|
|
return 1;
|
|
}
|
|
|
|
start = next;
|
|
/*@switchbreak@*/ break;
|
|
|
|
case '[':
|
|
/*@-boundswrite@*/
|
|
*dst++ = '\0';
|
|
*start++ = '\0';
|
|
/*@=boundswrite@*/
|
|
token = format + numTokens++;
|
|
|
|
/*@-boundswrite@*/
|
|
if (parseFormat(hsa, start,
|
|
&token->u.array.format,
|
|
&token->u.array.numTokens,
|
|
&start, PARSER_IN_ARRAY))
|
|
{
|
|
format = freeFormat(format, numTokens);
|
|
return 1;
|
|
}
|
|
/*@=boundswrite@*/
|
|
|
|
if (!start) {
|
|
hsa->errmsg = _("] expected at end of array");
|
|
format = freeFormat(format, numTokens);
|
|
return 1;
|
|
}
|
|
|
|
dst = start;
|
|
|
|
token->type = PTOK_ARRAY;
|
|
|
|
/*@switchbreak@*/ break;
|
|
|
|
case ']':
|
|
if (state != PARSER_IN_ARRAY) {
|
|
hsa->errmsg = _("unexpected ]");
|
|
format = freeFormat(format, numTokens);
|
|
return 1;
|
|
}
|
|
/*@-boundswrite@*/
|
|
*start++ = '\0';
|
|
/*@=boundswrite@*/
|
|
if (endPtr) *endPtr = start;
|
|
done = 1;
|
|
/*@switchbreak@*/ break;
|
|
|
|
case '}':
|
|
if (state != PARSER_IN_EXPR) {
|
|
hsa->errmsg = _("unexpected }");
|
|
format = freeFormat(format, numTokens);
|
|
return 1;
|
|
}
|
|
/*@-boundswrite@*/
|
|
*start++ = '\0';
|
|
/*@=boundswrite@*/
|
|
if (endPtr) *endPtr = start;
|
|
done = 1;
|
|
/*@switchbreak@*/ break;
|
|
|
|
default:
|
|
if (token == NULL || token->type != PTOK_STRING) {
|
|
token = format + numTokens++;
|
|
token->type = PTOK_STRING;
|
|
/*@-temptrans -assignexpose@*/
|
|
dst = token->u.string.string = start;
|
|
/*@=temptrans =assignexpose@*/
|
|
}
|
|
|
|
/*@-boundswrite@*/
|
|
if (*start == '\\') {
|
|
start++;
|
|
*dst++ = escapedChar(*start++);
|
|
} else {
|
|
*dst++ = *start++;
|
|
}
|
|
/*@=boundswrite@*/
|
|
/*@switchbreak@*/ break;
|
|
}
|
|
if (done)
|
|
break;
|
|
}
|
|
/*@=infloops@*/
|
|
|
|
/*@-boundswrite@*/
|
|
if (dst != NULL)
|
|
*dst = '\0';
|
|
/*@=boundswrite@*/
|
|
|
|
for (i = 0; i < numTokens; i++) {
|
|
token = format + i;
|
|
if (token->type == PTOK_STRING)
|
|
token->u.string.len = strlen(token->u.string.string);
|
|
}
|
|
|
|
*numTokensPtr = numTokens;
|
|
*formatPtr = format;
|
|
|
|
return 0;
|
|
}
|
|
|
|
/*@-boundswrite@*/
|
|
static int parseExpression(headerSprintfArgs hsa, sprintfToken token,
|
|
char * str, /*@out@*/ char ** endPtr)
|
|
{
|
|
char * chptr;
|
|
char * end;
|
|
|
|
hsa->errmsg = NULL;
|
|
chptr = str;
|
|
while (*chptr && *chptr != '?') chptr++;
|
|
|
|
if (*chptr != '?') {
|
|
hsa->errmsg = _("? expected in expression");
|
|
return 1;
|
|
}
|
|
|
|
*chptr++ = '\0';;
|
|
|
|
if (*chptr != '{') {
|
|
hsa->errmsg = _("{ expected after ? in expression");
|
|
return 1;
|
|
}
|
|
|
|
chptr++;
|
|
|
|
if (parseFormat(hsa, chptr, &token->u.cond.ifFormat,
|
|
&token->u.cond.numIfTokens, &end, PARSER_IN_EXPR))
|
|
return 1;
|
|
|
|
/* XXX fix segfault on "rpm -q rpm --qf='%|NAME?{%}:{NAME}|\n'"*/
|
|
if (!(end && *end)) {
|
|
hsa->errmsg = _("} expected in expression");
|
|
token->u.cond.ifFormat =
|
|
freeFormat(token->u.cond.ifFormat, token->u.cond.numIfTokens);
|
|
return 1;
|
|
}
|
|
|
|
chptr = end;
|
|
if (*chptr != ':' && *chptr != '|') {
|
|
hsa->errmsg = _(": expected following ? subexpression");
|
|
token->u.cond.ifFormat =
|
|
freeFormat(token->u.cond.ifFormat, token->u.cond.numIfTokens);
|
|
return 1;
|
|
}
|
|
|
|
if (*chptr == '|') {
|
|
if (parseFormat(hsa, NULL, &token->u.cond.elseFormat,
|
|
&token->u.cond.numElseTokens, &end, PARSER_IN_EXPR))
|
|
{
|
|
token->u.cond.ifFormat =
|
|
freeFormat(token->u.cond.ifFormat, token->u.cond.numIfTokens);
|
|
return 1;
|
|
}
|
|
} else {
|
|
chptr++;
|
|
|
|
if (*chptr != '{') {
|
|
hsa->errmsg = _("{ expected after : in expression");
|
|
token->u.cond.ifFormat =
|
|
freeFormat(token->u.cond.ifFormat, token->u.cond.numIfTokens);
|
|
return 1;
|
|
}
|
|
|
|
chptr++;
|
|
|
|
if (parseFormat(hsa, chptr, &token->u.cond.elseFormat,
|
|
&token->u.cond.numElseTokens, &end, PARSER_IN_EXPR))
|
|
return 1;
|
|
|
|
/* XXX fix segfault on "rpm -q rpm --qf='%|NAME?{a}:{%}|{NAME}\n'" */
|
|
if (!(end && *end)) {
|
|
hsa->errmsg = _("} expected in expression");
|
|
token->u.cond.ifFormat =
|
|
freeFormat(token->u.cond.ifFormat, token->u.cond.numIfTokens);
|
|
return 1;
|
|
}
|
|
|
|
chptr = end;
|
|
if (*chptr != '|') {
|
|
hsa->errmsg = _("| expected at end of expression");
|
|
token->u.cond.ifFormat =
|
|
freeFormat(token->u.cond.ifFormat, token->u.cond.numIfTokens);
|
|
token->u.cond.elseFormat =
|
|
freeFormat(token->u.cond.elseFormat, token->u.cond.numElseTokens);
|
|
return 1;
|
|
}
|
|
}
|
|
|
|
chptr++;
|
|
|
|
*endPtr = chptr;
|
|
|
|
token->type = PTOK_COND;
|
|
|
|
(void) findTag(hsa, token, str);
|
|
|
|
return 0;
|
|
}
|
|
/*@=boundswrite@*/
|
|
|
|
/**
|
|
* Call a header extension only once, saving results.
|
|
* @param hsa headerSprintf args
|
|
* @param fn
|
|
* @retval *typeptr
|
|
* @retval *data
|
|
* @retval *countptr
|
|
* @retval ec extension cache
|
|
* @return 0 on success, 1 on failure
|
|
*/
|
|
static int getExtension(headerSprintfArgs hsa, headerTagTagFunction fn,
|
|
/*@out@*/ hTYP_t typeptr,
|
|
/*@out@*/ hPTR_t * data,
|
|
/*@out@*/ hCNT_t countptr,
|
|
rpmec ec)
|
|
/*@modifies *typeptr, *data, *countptr, ec @*/
|
|
/*@requires maxSet(typeptr) >= 0 /\ maxSet(data) >= 0
|
|
/\ maxSet(countptr) >= 0 @*/
|
|
{
|
|
if (!ec->avail) {
|
|
if (fn(hsa->h, &ec->type, &ec->data, &ec->count, &ec->freeit))
|
|
return 1;
|
|
ec->avail = 1;
|
|
}
|
|
|
|
if (typeptr) *typeptr = ec->type;
|
|
if (data) *data = ec->data;
|
|
if (countptr) *countptr = ec->count;
|
|
|
|
return 0;
|
|
}
|
|
|
|
/**
|
|
* @param hsa headerSprintf args
|
|
* @param tag
|
|
* @param element
|
|
* @return end of formatted string (NULL on error)
|
|
*/
|
|
/*@observer@*/ /*@null@*/
|
|
static char * formatValue(headerSprintfArgs hsa, sprintfTag tag, int element)
|
|
/*@modifies hsa @*/
|
|
{
|
|
char * val = NULL;
|
|
size_t need = 0;
|
|
char * t, * te;
|
|
char buf[20];
|
|
int_32 count, type;
|
|
hPTR_t data;
|
|
unsigned int intVal;
|
|
const char ** strarray;
|
|
int datafree = 0;
|
|
int countBuf;
|
|
|
|
memset(buf, 0, sizeof(buf));
|
|
if (tag->ext) {
|
|
/*@-boundswrite -branchstate @*/
|
|
if (getExtension(hsa, tag->ext, &type, &data, &count, hsa->ec + tag->extNum))
|
|
{
|
|
count = 1;
|
|
type = RPM_STRING_TYPE;
|
|
data = "(none)";
|
|
}
|
|
/*@=boundswrite =branchstate @*/
|
|
} else {
|
|
/*@-boundswrite -branchstate @*/
|
|
if (!headerGetEntry(hsa->h, tag->tag, &type, (void **)&data, &count)) {
|
|
count = 1;
|
|
type = RPM_STRING_TYPE;
|
|
data = "(none)";
|
|
}
|
|
/*@=boundswrite =branchstate @*/
|
|
|
|
/* XXX this test is unnecessary, array sizes are checked */
|
|
switch (type) {
|
|
default:
|
|
if (element >= count) {
|
|
/*@-modobserver -observertrans@*/
|
|
data = headerFreeData(data, type);
|
|
/*@=modobserver =observertrans@*/
|
|
|
|
hsa->errmsg = _("(index out of range)");
|
|
return NULL;
|
|
}
|
|
break;
|
|
case RPM_BIN_TYPE:
|
|
case RPM_STRING_TYPE:
|
|
break;
|
|
}
|
|
datafree = 1;
|
|
}
|
|
|
|
if (tag->arrayCount) {
|
|
/*@-branchstate -observertrans -modobserver@*/
|
|
if (datafree)
|
|
data = headerFreeData(data, type);
|
|
/*@=branchstate =observertrans =modobserver@*/
|
|
|
|
countBuf = count;
|
|
data = &countBuf;
|
|
count = 1;
|
|
type = RPM_INT32_TYPE;
|
|
}
|
|
|
|
/*@-boundswrite@*/
|
|
(void) stpcpy( stpcpy(buf, "%"), tag->format);
|
|
/*@=boundswrite@*/
|
|
|
|
/*@-branchstate@*/
|
|
if (data)
|
|
switch (type) {
|
|
case RPM_STRING_ARRAY_TYPE:
|
|
strarray = (const char **)data;
|
|
|
|
if (tag->fmt)
|
|
val = tag->fmt(RPM_STRING_TYPE, strarray[element], buf, tag->pad, element);
|
|
|
|
if (val) {
|
|
need = strlen(val);
|
|
} else {
|
|
need = strlen(strarray[element]) + tag->pad + 20;
|
|
val = xmalloc(need+1);
|
|
strcat(buf, "s");
|
|
/*@-formatconst@*/
|
|
sprintf(val, buf, strarray[element]);
|
|
/*@=formatconst@*/
|
|
}
|
|
|
|
break;
|
|
|
|
case RPM_STRING_TYPE:
|
|
if (tag->fmt)
|
|
val = tag->fmt(RPM_STRING_TYPE, data, buf, tag->pad, 0);
|
|
|
|
if (val) {
|
|
need = strlen(val);
|
|
} else {
|
|
need = strlen(data) + tag->pad + 20;
|
|
val = xmalloc(need+1);
|
|
strcat(buf, "s");
|
|
/*@-formatconst@*/
|
|
sprintf(val, buf, data);
|
|
/*@=formatconst@*/
|
|
}
|
|
break;
|
|
|
|
case RPM_CHAR_TYPE:
|
|
case RPM_INT8_TYPE:
|
|
case RPM_INT16_TYPE:
|
|
case RPM_INT32_TYPE:
|
|
switch (type) {
|
|
case RPM_CHAR_TYPE:
|
|
case RPM_INT8_TYPE:
|
|
intVal = *(((int_8 *) data) + element);
|
|
/*@innerbreak@*/ break;
|
|
case RPM_INT16_TYPE:
|
|
intVal = *(((uint_16 *) data) + element);
|
|
/*@innerbreak@*/ break;
|
|
default: /* keep -Wall quiet */
|
|
case RPM_INT32_TYPE:
|
|
intVal = *(((int_32 *) data) + element);
|
|
/*@innerbreak@*/ break;
|
|
}
|
|
|
|
if (tag->fmt)
|
|
val = tag->fmt(RPM_INT32_TYPE, &intVal, buf, tag->pad, element);
|
|
|
|
if (val) {
|
|
need = strlen(val);
|
|
} else {
|
|
need = 10 + tag->pad + 20;
|
|
val = xmalloc(need+1);
|
|
strcat(buf, "d");
|
|
/*@-formatconst@*/
|
|
sprintf(val, buf, intVal);
|
|
/*@=formatconst@*/
|
|
}
|
|
break;
|
|
|
|
case RPM_BIN_TYPE:
|
|
/* XXX HACK ALERT: element field abused as no. bytes of binary data. */
|
|
if (tag->fmt)
|
|
val = tag->fmt(RPM_BIN_TYPE, data, buf, tag->pad, count);
|
|
|
|
if (val) {
|
|
need = strlen(val);
|
|
} else {
|
|
#ifdef NOTYET
|
|
val = memcpy(xmalloc(count), data, count);
|
|
#else
|
|
/* XXX format string not used */
|
|
static char hex[] = "0123456789abcdef";
|
|
const char * s = data;
|
|
|
|
/*@-boundswrite@*/
|
|
need = 2*count + tag->pad;
|
|
val = t = xmalloc(need+1);
|
|
while (count-- > 0) {
|
|
unsigned int i;
|
|
i = *s++;
|
|
*t++ = hex[ (i >> 4) & 0xf ];
|
|
*t++ = hex[ (i ) & 0xf ];
|
|
}
|
|
*t = '\0';
|
|
/*@=boundswrite@*/
|
|
#endif
|
|
}
|
|
break;
|
|
|
|
default:
|
|
need = sizeof("(unknown type)") - 1;
|
|
val = xstrdup("(unknown type)");
|
|
break;
|
|
}
|
|
/*@=branchstate@*/
|
|
|
|
/*@-branchstate -observertrans -modobserver@*/
|
|
if (datafree)
|
|
data = headerFreeData(data, type);
|
|
/*@=branchstate =observertrans =modobserver@*/
|
|
|
|
/*@-branchstate@*/
|
|
if (val && need > 0) {
|
|
t = hsaReserve(hsa, need);
|
|
/*@-boundswrite@*/
|
|
te = stpcpy(t, val);
|
|
/*@=boundswrite@*/
|
|
hsa->vallen += (te - t);
|
|
val = _free(val);
|
|
}
|
|
/*@=branchstate@*/
|
|
|
|
return (hsa->val + hsa->vallen);
|
|
}
|
|
|
|
/**
|
|
* @param hsa headerSprintf args
|
|
* @param token
|
|
* @param element
|
|
* @return end of formatted string (NULL on error)
|
|
*/
|
|
/*@observer@*/
|
|
static char * singleSprintf(headerSprintfArgs hsa, sprintfToken token,
|
|
int element)
|
|
/*@modifies hsa @*/
|
|
{
|
|
char * t, * te;
|
|
int i, j;
|
|
int numElements;
|
|
int_32 type;
|
|
int_32 count;
|
|
sprintfToken spft;
|
|
int condNumFormats;
|
|
size_t need;
|
|
|
|
/* we assume the token and header have been validated already! */
|
|
|
|
switch (token->type) {
|
|
case PTOK_NONE:
|
|
break;
|
|
|
|
case PTOK_STRING:
|
|
need = token->u.string.len;
|
|
if (need == 0) break;
|
|
t = hsaReserve(hsa, need);
|
|
/*@-boundswrite@*/
|
|
te = stpcpy(t, token->u.string.string);
|
|
/*@=boundswrite@*/
|
|
hsa->vallen += (te - t);
|
|
break;
|
|
|
|
case PTOK_TAG:
|
|
t = hsa->val + hsa->vallen;
|
|
te = formatValue(hsa, &token->u.tag,
|
|
(token->u.tag.justOne ? 0 : element));
|
|
if (te == NULL)
|
|
return NULL;
|
|
break;
|
|
|
|
case PTOK_COND:
|
|
if (token->u.cond.tag.ext || headerIsEntry(hsa->h, token->u.cond.tag.tag)) {
|
|
spft = token->u.cond.ifFormat;
|
|
condNumFormats = token->u.cond.numIfTokens;
|
|
} else {
|
|
spft = token->u.cond.elseFormat;
|
|
condNumFormats = token->u.cond.numElseTokens;
|
|
}
|
|
|
|
need = condNumFormats * 20;
|
|
if (spft == NULL || need == 0) break;
|
|
|
|
t = hsaReserve(hsa, need);
|
|
for (i = 0; i < condNumFormats; i++, spft++) {
|
|
te = singleSprintf(hsa, spft, element);
|
|
if (te == NULL)
|
|
return NULL;
|
|
}
|
|
break;
|
|
|
|
case PTOK_ARRAY:
|
|
numElements = -1;
|
|
spft = token->u.array.format;
|
|
for (i = 0; i < token->u.array.numTokens; i++, spft++)
|
|
{
|
|
if (spft->type != PTOK_TAG ||
|
|
spft->u.tag.arrayCount ||
|
|
spft->u.tag.justOne) continue;
|
|
|
|
if (spft->u.tag.ext) {
|
|
/*@-boundswrite@*/
|
|
if (getExtension(hsa, spft->u.tag.ext, &type, NULL, &count,
|
|
hsa->ec + spft->u.tag.extNum))
|
|
continue;
|
|
/*@=boundswrite@*/
|
|
} else {
|
|
/*@-boundswrite@*/
|
|
if (!headerGetEntry(hsa->h, spft->u.tag.tag, &type, NULL, &count))
|
|
continue;
|
|
/*@=boundswrite@*/
|
|
}
|
|
|
|
if (type == RPM_BIN_TYPE)
|
|
count = 1; /* XXX count abused as no. of bytes. */
|
|
|
|
if (numElements > 1 && count != numElements)
|
|
switch (type) {
|
|
default:
|
|
hsa->errmsg =
|
|
_("array iterator used with different sized arrays");
|
|
return NULL;
|
|
/*@notreached@*/ /*@switchbreak@*/ break;
|
|
case RPM_BIN_TYPE:
|
|
case RPM_STRING_TYPE:
|
|
/*@switchbreak@*/ break;
|
|
}
|
|
if (count > numElements)
|
|
numElements = count;
|
|
}
|
|
|
|
if (numElements == -1) {
|
|
need = sizeof("(none)") - 1;
|
|
t = hsaReserve(hsa, need);
|
|
/*@-boundswrite@*/
|
|
te = stpcpy(t, "(none)");
|
|
/*@=boundswrite@*/
|
|
hsa->vallen += (te - t);
|
|
} else {
|
|
int isxml;
|
|
|
|
need = numElements * token->u.array.numTokens * 10;
|
|
if (need == 0) break;
|
|
|
|
spft = token->u.array.format;
|
|
isxml = (spft->type == PTOK_TAG && spft->u.tag.type != NULL &&
|
|
!strcmp(spft->u.tag.type, "xml"));
|
|
|
|
if (isxml) {
|
|
const char * tagN = tagName(spft->u.tag.tag);
|
|
|
|
need = strlen(tagN) + sizeof(" <rpmTag name=\"\">\n") - 1;
|
|
t = hsaReserve(hsa, need);
|
|
/*@-boundswrite@*/
|
|
te = stpcpy(t, " <rpmTag name=\"");
|
|
te = stpcpy(te, tagN);
|
|
te = stpcpy(te, "\">\n");
|
|
/*@=boundswrite@*/
|
|
hsa->vallen += (te - t);
|
|
}
|
|
|
|
t = hsaReserve(hsa, need);
|
|
for (j = 0; j < numElements; j++) {
|
|
spft = token->u.array.format;
|
|
for (i = 0; i < token->u.array.numTokens; i++, spft++) {
|
|
te = singleSprintf(hsa, spft, j);
|
|
if (te == NULL)
|
|
return NULL;
|
|
}
|
|
}
|
|
|
|
if (isxml) {
|
|
need = sizeof(" </rpmTag>\n") - 1;
|
|
t = hsaReserve(hsa, need);
|
|
/*@-boundswrite@*/
|
|
te = stpcpy(t, " </rpmTag>\n");
|
|
/*@=boundswrite@*/
|
|
hsa->vallen += (te - t);
|
|
}
|
|
|
|
}
|
|
break;
|
|
}
|
|
|
|
return (hsa->val + hsa->vallen);
|
|
}
|
|
|
|
/**
|
|
* Create an extension cache.
|
|
* @param exts headerSprintf extensions
|
|
* @return new extension cache
|
|
*/
|
|
static /*@only@*/ rpmec
|
|
rpmecNew(const headerSprintfExtension exts)
|
|
/*@*/
|
|
{
|
|
headerSprintfExtension ext;
|
|
rpmec ec;
|
|
int i = 0;
|
|
|
|
for (ext = exts; ext != NULL && ext->type != HEADER_EXT_LAST;
|
|
ext = (ext->type == HEADER_EXT_MORE ? ext->u.more : ext+1))
|
|
{
|
|
i++;
|
|
}
|
|
|
|
ec = xcalloc(i, sizeof(*ec));
|
|
return ec;
|
|
}
|
|
|
|
/**
|
|
* Destroy an extension cache.
|
|
* @param exts headerSprintf extensions
|
|
* @param ec extension cache
|
|
* @return NULL always
|
|
*/
|
|
static /*@null@*/ rpmec
|
|
rpmecFree(const headerSprintfExtension exts, /*@only@*/ rpmec ec)
|
|
/*@modifies ec @*/
|
|
{
|
|
headerSprintfExtension ext;
|
|
int i = 0;
|
|
|
|
for (ext = exts; ext != NULL && ext->type != HEADER_EXT_LAST;
|
|
ext = (ext->type == HEADER_EXT_MORE ? ext->u.more : ext+1))
|
|
{
|
|
/*@-boundswrite@*/
|
|
if (ec[i].freeit) ec[i].data = _free(ec[i].data);
|
|
/*@=boundswrite@*/
|
|
i++;
|
|
}
|
|
|
|
ec = _free(ec);
|
|
return NULL;
|
|
}
|
|
|
|
/** \ingroup header
|
|
* Return formatted output string from header tags.
|
|
* The returned string must be free()d.
|
|
*
|
|
* @param h header
|
|
* @param fmt format to use
|
|
* @param tbltags array of tag name/value pairs
|
|
* @param extensions chained table of formatting extensions.
|
|
* @retval *errmsg error message (if any)
|
|
* @return formatted output string (malloc'ed)
|
|
*/
|
|
static /*@only@*/ /*@null@*/
|
|
char * headerSprintf(Header h, const char * fmt,
|
|
const struct headerTagTableEntry_s * tbltags,
|
|
const struct headerSprintfExtension_s * extensions,
|
|
/*@null@*/ /*@out@*/ errmsg_t * errmsg)
|
|
/*@modifies h, *errmsg @*/
|
|
/*@requires maxSet(errmsg) >= 0 @*/
|
|
{
|
|
headerSprintfArgs hsa = memset(alloca(sizeof(*hsa)), 0, sizeof(*hsa));
|
|
sprintfToken nextfmt;
|
|
sprintfTag tag;
|
|
char * t, * te;
|
|
int isxml;
|
|
int need;
|
|
|
|
hsa->h = headerLink(h);
|
|
hsa->fmt = xstrdup(fmt);
|
|
/*@-castexpose@*/ /* FIX: legacy API shouldn't change. */
|
|
hsa->exts = (headerSprintfExtension) extensions;
|
|
hsa->tags = (headerTagTableEntry) tbltags;
|
|
/*@=castexpose@*/
|
|
hsa->errmsg = NULL;
|
|
|
|
/*@-boundswrite@*/
|
|
if (parseFormat(hsa, hsa->fmt, &hsa->format, &hsa->numTokens, NULL, PARSER_BEGIN))
|
|
goto exit;
|
|
/*@=boundswrite@*/
|
|
|
|
hsa->ec = rpmecNew(hsa->exts);
|
|
hsa->val = xstrdup("");
|
|
|
|
tag =
|
|
(hsa->format->type == PTOK_TAG
|
|
? &hsa->format->u.tag :
|
|
(hsa->format->type == PTOK_ARRAY
|
|
? &hsa->format->u.array.format->u.tag :
|
|
NULL));
|
|
isxml = (tag != NULL && tag->tag == -2 && tag->type != NULL && !strcmp(tag->type, "xml"));
|
|
|
|
if (isxml) {
|
|
need = sizeof("<rpmHeader>\n") - 1;
|
|
t = hsaReserve(hsa, need);
|
|
/*@-boundswrite@*/
|
|
te = stpcpy(t, "<rpmHeader>\n");
|
|
/*@=boundswrite@*/
|
|
hsa->vallen += (te - t);
|
|
}
|
|
|
|
hsa = hsaInit(hsa);
|
|
while ((nextfmt = hsaNext(hsa)) != NULL) {
|
|
te = singleSprintf(hsa, nextfmt, 0);
|
|
if (te == NULL) {
|
|
hsa->val = _free(hsa->val);
|
|
break;
|
|
}
|
|
}
|
|
hsa = hsaFini(hsa);
|
|
|
|
if (isxml) {
|
|
need = sizeof("</rpmHeader>\n") - 1;
|
|
t = hsaReserve(hsa, need);
|
|
/*@-boundswrite@*/
|
|
te = stpcpy(t, "</rpmHeader>\n");
|
|
/*@=boundswrite@*/
|
|
hsa->vallen += (te - t);
|
|
}
|
|
|
|
if (hsa->val != NULL && hsa->vallen < hsa->alloced)
|
|
hsa->val = xrealloc(hsa->val, hsa->vallen+1);
|
|
|
|
hsa->ec = rpmecFree(hsa->exts, hsa->ec);
|
|
hsa->format = freeFormat(hsa->format, hsa->numTokens);
|
|
|
|
exit:
|
|
/*@-dependenttrans -observertrans @*/
|
|
if (errmsg)
|
|
*errmsg = hsa->errmsg;
|
|
/*@=dependenttrans =observertrans @*/
|
|
hsa->h = headerFree(hsa->h);
|
|
hsa->fmt = _free(hsa->fmt);
|
|
return hsa->val;
|
|
}
|
|
|
|
/**
|
|
* @param type tag type
|
|
* @param data tag value
|
|
* @param formatPrefix sprintf format string
|
|
* @param padding no. additional bytes needed by format string
|
|
* @param element (unused)
|
|
* @return formatted string
|
|
*/
|
|
static char * octalFormat(int_32 type, hPTR_t data,
|
|
char * formatPrefix, int padding, /*@unused@*/int element)
|
|
/*@modifies formatPrefix @*/
|
|
{
|
|
char * val;
|
|
|
|
if (type != RPM_INT32_TYPE) {
|
|
val = xstrdup(_("(not a number)"));
|
|
} else {
|
|
val = xmalloc(20 + padding);
|
|
/*@-boundswrite@*/
|
|
strcat(formatPrefix, "o");
|
|
/*@=boundswrite@*/
|
|
/*@-formatconst@*/
|
|
sprintf(val, formatPrefix, *((int_32 *) data));
|
|
/*@=formatconst@*/
|
|
}
|
|
|
|
return val;
|
|
}
|
|
|
|
/**
|
|
* @param type tag type
|
|
* @param data tag value
|
|
* @param formatPrefix sprintf format string
|
|
* @param padding no. additional bytes needed by format string
|
|
* @param element (unused)
|
|
* @return formatted string
|
|
*/
|
|
static char * hexFormat(int_32 type, hPTR_t data,
|
|
char * formatPrefix, int padding, /*@unused@*/int element)
|
|
/*@modifies formatPrefix @*/
|
|
{
|
|
char * val;
|
|
|
|
if (type != RPM_INT32_TYPE) {
|
|
val = xstrdup(_("(not a number)"));
|
|
} else {
|
|
val = xmalloc(20 + padding);
|
|
/*@-boundswrite@*/
|
|
strcat(formatPrefix, "x");
|
|
/*@=boundswrite@*/
|
|
/*@-formatconst@*/
|
|
sprintf(val, formatPrefix, *((int_32 *) data));
|
|
/*@=formatconst@*/
|
|
}
|
|
|
|
return val;
|
|
}
|
|
|
|
/**
|
|
*/
|
|
static char * realDateFormat(int_32 type, hPTR_t data,
|
|
char * formatPrefix, int padding, /*@unused@*/int element,
|
|
const char * strftimeFormat)
|
|
/*@modifies formatPrefix @*/
|
|
{
|
|
char * val;
|
|
|
|
if (type != RPM_INT32_TYPE) {
|
|
val = xstrdup(_("(not a number)"));
|
|
} else {
|
|
struct tm * tstruct;
|
|
char buf[50];
|
|
|
|
val = xmalloc(50 + padding);
|
|
/*@-boundswrite@*/
|
|
strcat(formatPrefix, "s");
|
|
/*@=boundswrite@*/
|
|
|
|
/* this is important if sizeof(int_32) ! sizeof(time_t) */
|
|
{ time_t dateint = *((int_32 *) data);
|
|
tstruct = localtime(&dateint);
|
|
}
|
|
buf[0] = '\0';
|
|
if (tstruct)
|
|
(void) strftime(buf, sizeof(buf) - 1, strftimeFormat, tstruct);
|
|
/*@-formatconst@*/
|
|
sprintf(val, formatPrefix, buf);
|
|
/*@=formatconst@*/
|
|
}
|
|
|
|
return val;
|
|
}
|
|
|
|
/**
|
|
* @param type tag type
|
|
* @param data tag value
|
|
* @param formatPrefix sprintf format string
|
|
* @param padding no. additional bytes needed by format string
|
|
* @param element (unused)
|
|
* @return formatted string
|
|
*/
|
|
static char * dateFormat(int_32 type, hPTR_t data,
|
|
char * formatPrefix, int padding, int element)
|
|
/*@modifies formatPrefix @*/
|
|
{
|
|
return realDateFormat(type, data, formatPrefix, padding, element,
|
|
_("%c"));
|
|
}
|
|
|
|
/**
|
|
* @param type tag type
|
|
* @param data tag value
|
|
* @param formatPrefix sprintf format string
|
|
* @param padding no. additional bytes needed by format string
|
|
* @param element (unused)
|
|
* @return formatted string
|
|
*/
|
|
static char * dayFormat(int_32 type, hPTR_t data,
|
|
char * formatPrefix, int padding, int element)
|
|
/*@modifies formatPrefix @*/
|
|
{
|
|
return realDateFormat(type, data, formatPrefix, padding, element,
|
|
_("%a %b %d %Y"));
|
|
}
|
|
|
|
/**
|
|
* @param type tag type
|
|
* @param data tag value
|
|
* @param formatPrefix sprintf format string
|
|
* @param padding no. additional bytes needed by format string
|
|
* @param element (unused)
|
|
* @return formatted string
|
|
*/
|
|
static char * shescapeFormat(int_32 type, hPTR_t data,
|
|
char * formatPrefix, int padding, /*@unused@*/int element)
|
|
/*@modifies formatPrefix @*/
|
|
{
|
|
char * result, * dst, * src, * buf;
|
|
|
|
if (type == RPM_INT32_TYPE) {
|
|
result = xmalloc(padding + 20);
|
|
/*@-boundswrite@*/
|
|
strcat(formatPrefix, "d");
|
|
/*@=boundswrite@*/
|
|
/*@-formatconst@*/
|
|
sprintf(result, formatPrefix, *((int_32 *) data));
|
|
/*@=formatconst@*/
|
|
} else {
|
|
buf = alloca(strlen(data) + padding + 2);
|
|
/*@-boundswrite@*/
|
|
strcat(formatPrefix, "s");
|
|
/*@=boundswrite@*/
|
|
/*@-formatconst@*/
|
|
sprintf(buf, formatPrefix, data);
|
|
/*@=formatconst@*/
|
|
|
|
/*@-boundswrite@*/
|
|
result = dst = xmalloc(strlen(buf) * 4 + 3);
|
|
*dst++ = '\'';
|
|
for (src = buf; *src != '\0'; src++) {
|
|
if (*src == '\'') {
|
|
*dst++ = '\'';
|
|
*dst++ = '\\';
|
|
*dst++ = '\'';
|
|
*dst++ = '\'';
|
|
} else {
|
|
*dst++ = *src;
|
|
}
|
|
}
|
|
*dst++ = '\'';
|
|
*dst = '\0';
|
|
/*@=boundswrite@*/
|
|
|
|
}
|
|
|
|
return result;
|
|
}
|
|
|
|
/*@-type@*/ /* FIX: cast? */
|
|
const struct headerSprintfExtension_s headerDefaultFormats[] = {
|
|
{ HEADER_EXT_FORMAT, "octal", { octalFormat } },
|
|
{ HEADER_EXT_FORMAT, "hex", { hexFormat } },
|
|
{ HEADER_EXT_FORMAT, "date", { dateFormat } },
|
|
{ HEADER_EXT_FORMAT, "day", { dayFormat } },
|
|
{ HEADER_EXT_FORMAT, "shescape", { shescapeFormat } },
|
|
{ HEADER_EXT_LAST, NULL, { NULL } }
|
|
};
|
|
/*@=type@*/
|
|
|
|
/** \ingroup header
|
|
* Duplicate tag values from one header into another.
|
|
* @param headerFrom source header
|
|
* @param headerTo destination header
|
|
* @param tagstocopy array of tags that are copied
|
|
*/
|
|
static
|
|
void headerCopyTags(Header headerFrom, Header headerTo, hTAG_t tagstocopy)
|
|
/*@modifies headerTo @*/
|
|
{
|
|
int * p;
|
|
|
|
if (headerFrom == headerTo)
|
|
return;
|
|
|
|
for (p = tagstocopy; *p != 0; p++) {
|
|
char *s;
|
|
int_32 type;
|
|
int_32 count;
|
|
if (headerIsEntry(headerTo, *p))
|
|
continue;
|
|
/*@-boundswrite@*/
|
|
if (!headerGetEntryMinMemory(headerFrom, *p, &type,
|
|
(hPTR_t *) &s, &count))
|
|
continue;
|
|
/*@=boundswrite@*/
|
|
(void) headerAddEntry(headerTo, *p, type, s, count);
|
|
s = headerFreeData(s, type);
|
|
}
|
|
}
|
|
|
|
/*@observer@*/ /*@unchecked@*/
|
|
static struct HV_s hdrVec1 = {
|
|
headerLink,
|
|
headerUnlink,
|
|
headerFree,
|
|
headerNew,
|
|
headerSort,
|
|
headerUnsort,
|
|
headerSizeof,
|
|
headerUnload,
|
|
headerReload,
|
|
headerCopy,
|
|
headerLoad,
|
|
headerCopyLoad,
|
|
headerRead,
|
|
headerWrite,
|
|
headerIsEntry,
|
|
headerFreeTag,
|
|
headerGetEntry,
|
|
headerGetEntryMinMemory,
|
|
headerAddEntry,
|
|
headerAppendEntry,
|
|
headerAddOrAppendEntry,
|
|
headerAddI18NString,
|
|
headerModifyEntry,
|
|
headerRemoveEntry,
|
|
headerSprintf,
|
|
headerCopyTags,
|
|
headerFreeIterator,
|
|
headerInitIterator,
|
|
headerNextIterator,
|
|
NULL, NULL,
|
|
1
|
|
};
|
|
|
|
/*@-compmempass -redef@*/
|
|
/*@observer@*/ /*@unchecked@*/
|
|
HV_t hdrVec = &hdrVec1;
|
|
/*@=compmempass =redef@*/
|