5 /* RPM - Copyright (C) 1995-2002 Red Hat Software */
7 /* Data written to file descriptors is in network byte order. */
8 /* Data read from file descriptors is expected to be in */
9 /* network byte order and is converted on the fly to host order. */
13 #include <rpm/rpmtypes.h>
14 #include <rpm/rpmstring.h>
15 #include "lib/header_internal.h"
16 #include "lib/misc.h" /* tag function proto */
22 const unsigned char rpm_header_magic[8] = {
23 0x8e, 0xad, 0xe8, 0x01, 0x00, 0x00, 0x00, 0x00
27 * Alignment needed for header data types.
29 static const int typeAlign[16] = {
30 1, /*!< RPM_NULL_TYPE */
31 1, /*!< RPM_CHAR_TYPE */
32 1, /*!< RPM_INT8_TYPE */
33 2, /*!< RPM_INT16_TYPE */
34 4, /*!< RPM_INT32_TYPE */
35 8, /*!< RPM_INT64_TYPE */
36 1, /*!< RPM_STRING_TYPE */
37 1, /*!< RPM_BIN_TYPE */
38 1, /*!< RPM_STRING_ARRAY_TYPE */
39 1, /*!< RPM_I18NSTRING_TYPE */
49 * Size of header data types.
51 static const int typeSizes[16] = {
52 0, /*!< RPM_NULL_TYPE */
53 1, /*!< RPM_CHAR_TYPE */
54 1, /*!< RPM_INT8_TYPE */
55 2, /*!< RPM_INT16_TYPE */
56 4, /*!< RPM_INT32_TYPE */
57 8, /*!< RPM_INT64_TYPE */
58 -1, /*!< RPM_STRING_TYPE */
59 1, /*!< RPM_BIN_TYPE */
60 -1, /*!< RPM_STRING_ARRAY_TYPE */
61 -1, /*!< RPM_I18NSTRING_TYPE */
71 HEADERFLAG_SORTED = (1 << 0), /*!< Are header entries sorted? */
72 HEADERFLAG_ALLOCATED = (1 << 1), /*!< Is 1st header region allocated? */
73 HEADERFLAG_LEGACY = (1 << 2), /*!< Header came from legacy source? */
74 HEADERFLAG_DEBUG = (1 << 3), /*!< Debug this header? */
77 typedef rpmFlags headerFlags;
80 * The Header data structure.
82 struct headerToken_s {
83 void * blob; /*!< Header region blob. */
84 indexEntry index; /*!< Array of tags. */
85 int indexUsed; /*!< Current size of tag array. */
86 int indexAlloced; /*!< Allocated size of tag array. */
87 unsigned int instance; /*!< Rpmdb instance (offset) */
89 int nrefs; /*!< Reference count. */
93 * Maximum no. of bytes permitted in a header.
95 static const size_t headerMaxbytes = (32*1024*1024);
97 #define INDEX_MALLOC_SIZE 8
99 #define ENTRY_IS_REGION(_e) \
100 (((_e)->info.tag >= RPMTAG_HEADERIMAGE) && ((_e)->info.tag < RPMTAG_HEADERREGIONS))
101 #define ENTRY_IN_REGION(_e) ((_e)->info.offset < 0)
103 /* Convert a 64bit value to network byte order. */
105 static uint64_t htonll(uint64_t n)
107 uint32_t *i = (uint32_t*)&n;
114 Header headerLink(Header h)
121 static Header headerUnlink(Header h)
128 Header headerFree(Header h)
130 (void) headerUnlink(h);
132 if (h == NULL || h->nrefs > 0)
133 return NULL; /* XXX return previous header? */
136 indexEntry entry = h->index;
138 for (i = 0; i < h->indexUsed; i++, entry++) {
139 if ((h->flags & HEADERFLAG_ALLOCATED) && ENTRY_IS_REGION(entry)) {
140 if (entry->length > 0) {
141 int32_t * ei = entry->data;
142 if ((ei - 2) == h->blob) h->blob = _free(h->blob);
145 } else if (!ENTRY_IN_REGION(entry)) {
146 entry->data = _free(entry->data);
150 h->index = _free(h->index);
157 static Header headerCreate(void *blob, int32_t indexLen)
159 Header h = xcalloc(1, sizeof(*h));
162 h->indexAlloced = indexLen + 1;
163 h->indexUsed = indexLen;
165 h->indexAlloced = INDEX_MALLOC_SIZE;
169 h->flags |= HEADERFLAG_SORTED;
171 h->index = (h->indexAlloced
172 ? xcalloc(h->indexAlloced, sizeof(*h->index))
176 return headerLink(h);
179 Header headerNew(void)
181 return headerCreate(NULL, 0);
184 int headerVerifyInfo(int il, int dl, const void * pev, void * iv, int negate)
186 entryInfo pe = (entryInfo) pev;
190 for (i = 0; i < il; i++) {
191 info->tag = ntohl(pe[i].tag);
192 info->type = ntohl(pe[i].type);
193 info->offset = ntohl(pe[i].offset);
195 info->offset = -info->offset;
196 info->count = ntohl(pe[i].count);
198 if (hdrchkType(info->type))
200 if (hdrchkAlign(info->type, info->offset))
202 if (!negate && hdrchkRange(dl, info->offset))
204 if (hdrchkData(info->count))
213 static int indexCmp(const void * avp, const void * bvp)
215 indexEntry ap = (indexEntry) avp, bp = (indexEntry) bvp;
216 return (ap->info.tag - bp->info.tag);
219 void headerSort(Header h)
221 if (!(h->flags & HEADERFLAG_SORTED)) {
222 qsort(h->index, h->indexUsed, sizeof(*h->index), indexCmp);
223 h->flags |= HEADERFLAG_SORTED;
229 static int offsetCmp(const void * avp, const void * bvp)
231 indexEntry ap = (indexEntry) avp, bp = (indexEntry) bvp;
232 int rc = (ap->info.offset - bp->info.offset);
235 /* Within a region, entries sort by address. Added drips sort by tag. */
236 if (ap->info.offset < 0)
237 rc = (((char *)ap->data) - ((char *)bp->data));
239 rc = (ap->info.tag - bp->info.tag);
245 * Restore tags in header to original ordering.
248 void headerUnsort(Header h)
250 if (h->flags & HEADERFLAG_SORTED) {
251 qsort(h->index, h->indexUsed, sizeof(*h->index), offsetCmp);
252 h->flags &= ~HEADERFLAG_SORTED;
256 unsigned headerSizeof(Header h, int magicp)
259 unsigned int size = 0;
268 case HEADER_MAGIC_YES:
269 size += sizeof(rpm_header_magic);
271 case HEADER_MAGIC_NO:
275 size += 2 * sizeof(int32_t); /* count of index entries */
277 for (i = 0, entry = h->index; i < h->indexUsed; i++, entry++) {
280 /* Regions go in as is ... */
281 if (ENTRY_IS_REGION(entry)) {
282 size += entry->length;
283 /* XXX Legacy regions do not include the region tag and data. */
284 if (i == 0 && (h->flags & HEADERFLAG_LEGACY))
285 size += sizeof(struct entryInfo_s) + entry->info.count;
289 /* ... and region elements are skipped. */
290 if (entry->info.offset < 0)
294 type = entry->info.type;
295 if (typeSizes[type] > 1) {
296 unsigned diff = typeSizes[type] - (size % typeSizes[type]);
297 if (diff != typeSizes[type]) {
302 size += sizeof(struct entryInfo_s) + entry->length;
309 * Return length of entry data.
310 * @param type entry data type
311 * @param p entry data
312 * @param count entry item count
313 * @param onDisk data is concatenated strings (with NUL's))?
314 * @param pend pointer to end of data (or NULL)
315 * @return no. bytes in data, -1 on failure
317 static int dataLength(rpm_tagtype_t type, rpm_constdata_t p, rpm_count_t count,
318 int onDisk, rpm_constdata_t pend)
320 const unsigned char * s = p;
321 const unsigned char * se = pend;
325 case RPM_STRING_TYPE:
333 length++; /* count nul terminator too. */
336 case RPM_STRING_ARRAY_TYPE:
337 case RPM_I18NSTRING_TYPE:
338 /* These are like RPM_STRING_TYPE, except they're *always* an array */
339 /* Compute sum of length of all strings, including nul terminators */
343 length++; /* count nul terminator too */
351 const char ** av = (const char **)p;
353 /* add one for null termination */
354 length += strlen(*av++) + 1;
360 if (typeSizes[type] == -1)
362 length = typeSizes[(type & 0xf)] * count;
363 if (length < 0 || (se && (s + length) > se))
372 * Swap int32_t and int16_t arrays within header region.
374 * If a header region tag is in the set to be swabbed, as the data for a
375 * a header region is located after all other tag data.
377 * @param entry header entry
378 * @param il no. of entries
379 * @param dl start no. bytes of data
380 * @param pe header physical entry pointer (swapped)
381 * @param dataStart header data start
382 * @param dataEnd header data end
383 * @param regionid region offset
384 * @return no. bytes of data in region, -1 on error
386 static int regionSwab(indexEntry entry, int il, int dl,
388 unsigned char * dataStart,
389 const unsigned char * dataEnd,
392 for (; il > 0; il--, pe++) {
393 struct indexEntry_s ie;
396 ie.info.tag = ntohl(pe->tag);
397 ie.info.type = ntohl(pe->type);
398 ie.info.count = ntohl(pe->count);
399 ie.info.offset = ntohl(pe->offset);
401 if (hdrchkType(ie.info.type))
403 if (hdrchkData(ie.info.count))
405 if (hdrchkData(ie.info.offset))
407 if (hdrchkAlign(ie.info.type, ie.info.offset))
410 ie.data = dataStart + ie.info.offset;
411 if (dataEnd && (unsigned char *)ie.data >= dataEnd)
414 ie.length = dataLength(ie.info.type, ie.data, ie.info.count, 1, dataEnd);
415 if (ie.length < 0 || hdrchkData(ie.length))
421 ie.info.offset = regionid;
422 *entry = ie; /* structure assignment */
428 if (typeSizes[type] > 1) {
429 unsigned diff = typeSizes[type] - (dl % typeSizes[type]);
430 if (diff != typeSizes[type]) {
435 /* Perform endian conversions */
436 switch (ntohl(pe->type)) {
438 { uint64_t * it = ie.data;
439 for (; ie.info.count > 0; ie.info.count--, it += 1) {
440 if (dataEnd && ((unsigned char *)it) >= dataEnd)
446 { int32_t * it = ie.data;
447 for (; ie.info.count > 0; ie.info.count--, it += 1) {
448 if (dataEnd && ((unsigned char *)it) >= dataEnd)
454 { int16_t * it = ie.data;
455 for (; ie.info.count > 0; ie.info.count--, it += 1) {
456 if (dataEnd && ((unsigned char *)it) >= dataEnd)
472 * @retval *lengthPtr no. bytes in unloaded header blob
473 * @return unloaded header blob (NULL on error)
475 static void * doHeaderUnload(Header h,
488 int drlen, ndribbles;
490 if (h == NULL) return NULL;
492 /* Sort entries by (offset,tag). */
495 /* Compute (il,dl) for all tags, including those deleted in region. */
496 drlen = ndribbles = 0;
497 for (i = 0, entry = h->index; i < h->indexUsed; i++, entry++) {
498 if (ENTRY_IS_REGION(entry)) {
499 int32_t rdl = -entry->info.offset; /* negative offset */
500 int32_t ril = rdl/sizeof(*pe);
501 int rid = entry->info.offset;
504 dl += entry->rdlen + entry->info.count;
505 /* XXX Legacy regions do not include the region tag and data. */
506 if (i == 0 && (h->flags & HEADERFLAG_LEGACY))
509 /* Skip rest of entries in region, but account for dribbles. */
510 for (; i < h->indexUsed && entry->info.offset <= rid+1; i++, entry++) {
511 if (entry->info.offset <= rid)
515 type = entry->info.type;
516 if (typeSizes[type] > 1) {
517 unsigned diff = typeSizes[type] - (dl % typeSizes[type]);
518 if (diff != typeSizes[type]) {
526 drlen += entry->length;
534 /* Ignore deleted drips. */
535 if (entry->data == NULL || entry->length <= 0)
539 type = entry->info.type;
540 if (typeSizes[type] > 1) {
541 unsigned diff = typeSizes[type] - (dl % typeSizes[type]);
542 if (diff != typeSizes[type]) {
551 /* Sanity checks on header intro. */
552 if (hdrchkTags(il) || hdrchkData(dl))
555 len = sizeof(il) + sizeof(dl) + (il * sizeof(*pe)) + dl;
561 pe = (entryInfo) &ei[2];
562 dataStart = te = (char *) (pe + il);
564 for (i = 0, entry = h->index; i < h->indexUsed; i++, entry++) {
570 if (entry->data == NULL || entry->length <= 0)
573 t = (unsigned char*)te;
574 pe->tag = htonl(entry->info.tag);
575 pe->type = htonl(entry->info.type);
576 pe->count = htonl(entry->info.count);
578 if (ENTRY_IS_REGION(entry)) {
579 int32_t rdl = -entry->info.offset; /* negative offset */
580 int32_t ril = rdl/sizeof(*pe) + ndribbles;
581 int rid = entry->info.offset;
583 src = (char *)entry->data;
584 rdlen = entry->rdlen;
586 /* XXX Legacy regions do not include the region tag and data. */
587 if (i == 0 && (h->flags & HEADERFLAG_LEGACY)) {
590 memcpy(pe+1, src, rdl);
591 memcpy(te, src + rdl, rdlen);
594 pe->offset = htonl(te - dataStart);
597 stei[2] = htonl(-rdl-entry->info.count);
599 memcpy(te, stei, entry->info.count);
600 te += entry->info.count;
602 rdlen += entry->info.count;
604 count = regionSwab(NULL, ril, 0, pe, t, NULL, 0);
610 memcpy(pe+1, src + sizeof(*pe), ((ril-1) * sizeof(*pe)));
611 memcpy(te, src + (ril * sizeof(*pe)), rdlen+entry->info.count+drlen);
614 entryInfo se = (entryInfo)src;
615 int off = ntohl(se->offset);
616 pe->offset = (off) ? htonl(te - dataStart) : htonl(off);
618 te += entry->info.count + drlen;
620 count = regionSwab(NULL, ril, 0, pe, t, NULL, 0);
621 if (count != (rdlen + entry->info.count + drlen))
625 /* Skip rest of entries in region. */
626 while (i < h->indexUsed && entry->info.offset <= rid+1) {
636 /* Ignore deleted drips. */
637 if (entry->data == NULL || entry->length <= 0)
641 type = entry->info.type;
642 if (typeSizes[type] > 1) {
644 diff = typeSizes[type] - ((te - dataStart) % typeSizes[type]);
645 if (diff != typeSizes[type]) {
651 pe->offset = htonl(te - dataStart);
653 /* copy data w/ endian conversions */
654 switch (entry->info.type) {
656 count = entry->info.count;
659 *((uint64_t *)te) = htonll(*((uint64_t *)src));
660 te += sizeof(uint64_t);
661 src += sizeof(uint64_t);
666 count = entry->info.count;
669 *((int32_t *)te) = htonl(*((int32_t *)src));
670 te += sizeof(int32_t);
671 src += sizeof(int32_t);
676 count = entry->info.count;
679 *((int16_t *)te) = htons(*((int16_t *)src));
680 te += sizeof(int16_t);
681 src += sizeof(int16_t);
686 memcpy(te, entry->data, entry->length);
693 /* Insure that there are no memcpy underruns/overruns. */
694 if (((char *)pe) != dataStart)
696 if ((((char *)ei)+len) != te)
711 void * headerUnload(Header h)
713 return doHeaderUnload(h, NULL);
717 * Find matching (tag,type) entry in header.
719 * @param tag entry tag
720 * @param type entry type
721 * @return header entry
724 indexEntry findEntry(Header h, rpmTagVal tag, rpm_tagtype_t type)
727 struct indexEntry_s key;
729 if (h == NULL) return NULL;
730 if (!(h->flags & HEADERFLAG_SORTED)) headerSort(h);
734 entry = bsearch(&key, h->index, h->indexUsed, sizeof(*h->index), indexCmp);
738 if (type == RPM_NULL_TYPE)
742 while (entry->info.tag == tag && entry->info.type != type &&
743 entry > h->index) entry--;
745 if (entry->info.tag == tag && entry->info.type == type)
751 int headerDel(Header h, rpmTagVal tag)
753 indexEntry last = h->index + h->indexUsed;
754 indexEntry entry, first;
757 entry = findEntry(h, tag, RPM_NULL_TYPE);
758 if (!entry) return 1;
760 /* Make sure entry points to the first occurence of this tag. */
761 while (entry > h->index && (entry - 1)->info.tag == tag)
764 /* Free data for tags being removed. */
765 for (first = entry; first < last; first++) {
767 if (first->info.tag != tag)
772 if (ENTRY_IN_REGION(first))
777 ne = (first - entry);
782 memmove(entry, first, (ne * sizeof(*entry)));
788 Header headerLoad(void * uh)
790 int32_t * ei = (int32_t *) uh;
791 int32_t il = ntohl(ei[0]); /* index length */
792 int32_t dl = ntohl(ei[1]); /* data length */
793 size_t pvlen = sizeof(il) + sizeof(dl) +
794 (il * sizeof(struct entryInfo_s)) + dl;
798 unsigned char * dataStart;
799 unsigned char * dataEnd;
803 /* Sanity checks on header intro. */
804 if (hdrchkTags(il) || hdrchkData(dl))
808 pe = (entryInfo) &ei[2];
809 dataStart = (unsigned char *) (pe + il);
810 dataEnd = dataStart + dl;
812 h = headerCreate(uh, il);
815 if (!(htonl(pe->tag) < RPMTAG_HEADERI18NTABLE)) {
816 h->flags |= HEADERFLAG_LEGACY;
817 entry->info.type = REGION_TAG_TYPE;
818 entry->info.tag = RPMTAG_HEADERIMAGE;
819 entry->info.count = REGION_TAG_COUNT;
820 entry->info.offset = ((unsigned char *)pe - dataStart); /* negative offset */
823 entry->length = pvlen - sizeof(il) - sizeof(dl);
824 rdlen = regionSwab(entry+1, il, 0, pe, dataStart, dataEnd, entry->info.offset);
827 entry->rdlen = rdlen;
833 h->flags &= ~HEADERFLAG_LEGACY;
835 entry->info.type = htonl(pe->type);
836 entry->info.count = htonl(pe->count);
838 if (hdrchkType(entry->info.type))
840 if (hdrchkTags(entry->info.count))
843 { int off = ntohl(pe->offset);
848 size_t nb = REGION_TAG_COUNT;
850 /* XXX Hmm, why the copy? */
851 memcpy(&stei, dataStart + off, nb);
852 rdl = -ntohl(stei[2]); /* negative offset */
853 ril = rdl/sizeof(*pe);
854 if (hdrchkTags(ril) || hdrchkData(rdl))
856 entry->info.tag = htonl(pe->tag);
859 rdl = (ril * sizeof(struct entryInfo_s));
860 entry->info.tag = RPMTAG_HEADERIMAGE;
863 entry->info.offset = -rdl; /* negative offset */
866 entry->length = pvlen - sizeof(il) - sizeof(dl);
867 rdlen = regionSwab(entry+1, ril-1, 0, pe+1, dataStart, dataEnd, entry->info.offset);
870 entry->rdlen = rdlen;
872 if (ril < h->indexUsed) {
873 indexEntry newEntry = entry + ril;
874 int ne = (h->indexUsed - ril);
875 int rid = entry->info.offset+1;
878 /* Load dribble entries from region. */
879 rc = regionSwab(newEntry, ne, 0, pe+ril, dataStart, dataEnd, rid);
884 { indexEntry firstEntry = newEntry;
885 int save = h->indexUsed;
888 /* Dribble entries replace duplicate region entries. */
890 for (j = 0; j < ne; j++, newEntry++) {
891 (void) headerDel(h, newEntry->info.tag);
892 if (newEntry->info.tag == RPMTAG_BASENAMES)
893 (void) headerDel(h, RPMTAG_OLDFILENAMES);
896 /* If any duplicate entries were replaced, move new entries down. */
897 if (h->indexUsed < (save - ne)) {
898 memmove(h->index + h->indexUsed, firstEntry,
899 (ne * sizeof(*entry)));
906 h->flags &= ~HEADERFLAG_SORTED;
908 h->flags |= HEADERFLAG_ALLOCATED;
914 h->index = _free(h->index);
920 Header headerReload(Header h, rpmTagVal tag)
923 void * uh = doHeaderUnload(h, NULL);
933 if (ENTRY_IS_REGION(nh->index)) {
934 if (tag == RPMTAG_HEADERSIGNATURES || tag == RPMTAG_HEADERIMMUTABLE)
935 nh->index[0].info.tag = tag;
940 Header headerCopyLoad(const void * uh)
942 int32_t * ei = (int32_t *) uh;
943 int32_t il = ntohl(ei[0]); /* index length */
944 int32_t dl = ntohl(ei[1]); /* data length */
945 size_t pvlen = sizeof(il) + sizeof(dl) +
946 (il * sizeof(struct entryInfo_s)) + dl;
950 /* Sanity checks on header intro. */
951 if (!(hdrchkTags(il) || hdrchkData(dl)) && pvlen < headerMaxbytes) {
952 nuh = memcpy(xmalloc(pvlen), uh, pvlen);
953 if ((h = headerLoad(nuh)) == NULL)
960 * Read (and load) header from file handle.
961 * @param fd file handle
962 * @param magicp read (and verify) 8 bytes of (magic, 0)?
963 * @return header (or NULL on error)
965 Header headerRead(FD_t fd, int magicp)
974 if (magicp == HEADER_MAGIC_YES) {
977 if (Fread(block, 1, 4*sizeof(*block), fd) != 4*sizeof(*block))
982 if (memcmp(&magic, rpm_header_magic, sizeof(magic)))
985 il = ntohl(block[2]);
986 dl = ntohl(block[3]);
988 if (Fread(block, 1, 2*sizeof(*block), fd) != 2*sizeof(*block))
991 il = ntohl(block[0]);
992 dl = ntohl(block[1]);
995 len = sizeof(il) + sizeof(dl) + (il * sizeof(struct entryInfo_s)) + dl;
997 /* Sanity checks on header intro. */
998 if (hdrchkTags(il) || hdrchkData(dl) || len > headerMaxbytes)
1004 len -= sizeof(il) + sizeof(dl);
1006 if (Fread((char *)&ei[2], 1, len, fd) != len)
1012 if (h == NULL && ei != NULL) {
1018 int headerWrite(FD_t fd, Header h, int magicp)
1024 uh = doHeaderUnload(h, &length);
1028 case HEADER_MAGIC_YES:
1029 nb = Fwrite(rpm_header_magic, sizeof(uint8_t), sizeof(rpm_header_magic), fd);
1030 if (nb != sizeof(rpm_header_magic))
1033 case HEADER_MAGIC_NO:
1037 nb = Fwrite(uh, sizeof(char), length, fd);
1041 return (nb == length ? 0 : 1);
1044 int headerIsEntry(Header h, rpmTagVal tag)
1046 /* FIX: h modified by sort. */
1047 return (findEntry(h, tag, RPM_NULL_TYPE) ? 1 : 0);
1052 * Retrieve data from header entry.
1053 * Relevant flags (others are ignored), if neither is set allocation
1054 * behavior depends on data type(!)
1055 * HEADERGET_MINMEM: return pointers to header memory
1056 * HEADERGET_ALLOC: always return malloced memory, overrides MINMEM
1058 * @todo Permit retrieval of regions other than HEADER_IMUTABLE.
1059 * @param entry header entry
1060 * @param td tag data container
1061 * @param minMem string pointers refer to header memory?
1062 * @param flags flags to control memory allocation
1063 * @return 1 on success, otherwise error.
1065 static int copyTdEntry(const indexEntry entry, rpmtd td, headerGetFlags flags)
1067 rpm_count_t count = entry->info.count;
1068 int rc = 1; /* XXX 1 on success. */
1069 /* ALLOC overrides MINMEM */
1070 int allocMem = flags & HEADERGET_ALLOC;
1071 int minMem = allocMem ? 0 : flags & HEADERGET_MINMEM;
1072 int argvArray = (flags & HEADERGET_ARGV) ? 1 : 0;
1075 td->flags = RPMTD_IMMUTABLE;
1076 switch (entry->info.type) {
1079 * XXX This only works for
1080 * XXX "sealed" HEADER_IMMUTABLE/HEADER_SIGNATURES/HEADER_IMAGE.
1081 * XXX This will *not* work for unsealed legacy HEADER_IMAGE (i.e.
1082 * XXX a legacy header freshly read, but not yet unloaded to the rpmdb).
1084 if (ENTRY_IS_REGION(entry)) {
1085 int32_t * ei = ((int32_t *)entry->data) - 2;
1086 entryInfo pe = (entryInfo) (ei + 2);
1087 unsigned char * dataStart = (unsigned char *) (pe + ntohl(ei[0]));
1088 int32_t rdl = -entry->info.offset; /* negative offset */
1089 int32_t ril = rdl/sizeof(*pe);
1092 count = 2 * sizeof(*ei) + (ril * sizeof(*pe)) + rdl;
1093 if (entry->info.tag == RPMTAG_HEADERIMAGE) {
1097 count += REGION_TAG_COUNT;
1098 rdl += REGION_TAG_COUNT;
1101 td->data = xmalloc(count);
1102 ei = (int32_t *) td->data;
1106 pe = (entryInfo) memcpy(ei + 2, pe, (ril * sizeof(*pe)));
1108 dataStart = (unsigned char *) memcpy(pe + ril, dataStart, rdl);
1110 rc = regionSwab(NULL, ril, 0, pe, dataStart, dataStart + rdl, 0);
1111 /* don't return data on failure */
1113 td->data = _free(td->data);
1115 /* XXX 1 on success. */
1116 rc = (rc < 0) ? 0 : 1;
1118 count = entry->length;
1120 ? memcpy(xmalloc(count), entry->data, count)
1124 case RPM_STRING_TYPE:
1125 /* simple string, but fallthrough if its actually an array */
1126 if (count == 1 && !argvArray) {
1127 td->data = allocMem ? xstrdup(entry->data) : entry->data;
1130 case RPM_STRING_ARRAY_TYPE:
1131 case RPM_I18NSTRING_TYPE:
1132 { const char ** ptrEntry;
1133 int tableSize = (count + argvArray) * sizeof(char *);
1138 td->data = xmalloc(tableSize);
1139 ptrEntry = (const char **) td->data;
1142 t = xmalloc(tableSize + entry->length);
1143 td->data = (void *)t;
1144 ptrEntry = (const char **) td->data;
1146 memcpy(t, entry->data, entry->length);
1148 for (i = 0; i < count; i++) {
1155 td->flags |= RPMTD_ARGV;
1160 case RPM_INT16_TYPE:
1161 case RPM_INT32_TYPE:
1162 case RPM_INT64_TYPE:
1164 td->data = xmalloc(entry->length);
1165 memcpy(td->data, entry->data, entry->length);
1167 td->data = entry->data;
1171 /* WTH? Don't mess with unknown data types... */
1176 td->type = entry->info.type;
1179 if (td->data && entry->data != td->data) {
1180 td->flags |= RPMTD_ALLOCED;
1187 * Does locale match entry in header i18n table?
1190 * The range [l,le) contains the next locale to match:
1191 * ll[_CC][.EEEEE][@dddd]
1193 * ll ISO language code (in lowercase).
1194 * CC (optional) ISO coutnry code (in uppercase).
1195 * EEEEE (optional) encoding (not really standardized).
1196 * dddd (optional) dialect.
1199 * @param td header i18n table data, NUL terminated
1200 * @param l start of locale to match
1201 * @param le end of locale to match
1202 * @return 1 on good match, 2 on weak match, 0 on no match
1204 static int headerMatchLocale(const char *td, const char *l, const char *le)
1208 /* First try a complete match. */
1209 if (strlen(td) == (le-l) && rstreqn(td, l, (le - l)))
1212 /* Next, try stripping optional dialect and matching. */
1213 for (fe = l; fe < le && *fe != '@'; fe++)
1215 if (fe < le && rstreqn(td, l, (fe - l)))
1218 /* Next, try stripping optional codeset and matching. */
1219 for (fe = l; fe < le && *fe != '.'; fe++)
1221 if (fe < le && rstreqn(td, l, (fe - l)))
1224 /* Finally, try stripping optional country code and matching. */
1225 for (fe = l; fe < le && *fe != '_'; fe++)
1227 if (fe < le && rstreqn(td, l, (fe - l)))
1234 * Return i18n string from header that matches locale.
1236 * @param entry i18n string data
1237 * @retval td tag data container
1238 * @param flags flags to control allocation
1241 static int copyI18NEntry(Header h, indexEntry entry, rpmtd td,
1242 headerGetFlags flags)
1244 const char *lang, *l, *le;
1247 td->type = RPM_STRING_TYPE;
1249 /* if no match, just return the first string */
1250 td->data = entry->data;
1252 /* XXX Drepper sez' this is the order. */
1253 if ((lang = getenv("LANGUAGE")) == NULL &&
1254 (lang = getenv("LC_ALL")) == NULL &&
1255 (lang = getenv("LC_MESSAGES")) == NULL &&
1256 (lang = getenv("LANG")) == NULL)
1259 if ((table = findEntry(h, RPMTAG_HEADERI18NTABLE, RPM_STRING_ARRAY_TYPE)) == NULL)
1262 for (l = lang; *l != '\0'; l = le) {
1264 char *ed, *ed_weak = NULL;
1267 while (*l && *l == ':') /* skip leading colons */
1271 for (le = l; *le && *le != ':'; le++) /* find end of this locale */
1274 /* For each entry in the header ... */
1275 for (langNum = 0, t = table->data, ed = entry->data;
1276 langNum < entry->info.count;
1277 langNum++, t += strlen(t) + 1, ed += strlen(ed) + 1) {
1279 int match = headerMatchLocale(t, l, le);
1283 } else if (match == 2) {
1294 if (flags & HEADERGET_ALLOC) {
1295 td->data = xstrdup(td->data);
1296 td->flags |= RPMTD_ALLOCED;
1303 * Retrieve tag data from header.
1305 * @retval td tag data container
1306 * @param flags flags to control retrieval
1307 * @return 1 on success, 0 on not found
1309 static int intGetTdEntry(Header h, rpmtd td, headerGetFlags flags)
1314 /* First find the tag */
1315 /* FIX: h modified by sort. */
1316 entry = findEntry(h, td->tag, RPM_NULL_TYPE);
1317 if (entry == NULL) {
1318 /* Td is zeroed above, just return... */
1322 if (flags & HEADERGET_RAW) {
1323 rc = copyTdEntry(entry, td, flags);
1325 switch (entry->info.type) {
1326 case RPM_I18NSTRING_TYPE:
1327 rc = copyI18NEntry(h, entry, td, flags);
1330 rc = copyTdEntry(entry, td, flags);
1335 /* XXX 1 on success */
1336 return ((rc == 1) ? 1 : 0);
1339 int headerGet(Header h, rpmTagVal tag, rpmtd td, headerGetFlags flags)
1342 headerTagTagFunction tagfunc = intGetTdEntry;
1344 if (td == NULL) return 0;
1349 if (flags & HEADERGET_EXT) {
1350 headerTagTagFunction extfunc = rpmHeaderTagFunc(tag);
1351 if (extfunc) tagfunc = extfunc;
1353 rc = tagfunc(h, td, flags);
1355 assert(tag == td->tag);
1361 static void copyData(rpm_tagtype_t type, rpm_data_t dstPtr,
1362 rpm_constdata_t srcPtr, rpm_count_t cnt, int dataLength)
1365 case RPM_STRING_ARRAY_TYPE:
1366 case RPM_I18NSTRING_TYPE:
1367 { const char ** av = (const char **) srcPtr;
1370 while (cnt-- > 0 && dataLength > 0) {
1372 if ((s = *av++) == NULL)
1376 } while (s[-1] && --dataLength > 0);
1381 memmove(dstPtr, srcPtr, dataLength);
1387 * Return (malloc'ed) copy of entry data.
1388 * @param type entry data type
1389 * @param p entry data
1390 * @param c entry item count
1391 * @retval lengthPtr no. bytes in returned data
1392 * @return (malloc'ed) copy of entry data, NULL on error
1395 grabData(rpm_tagtype_t type, rpm_constdata_t p, rpm_count_t c, int * lengthPtr)
1397 rpm_data_t data = NULL;
1400 length = dataLength(type, p, c, 0, NULL);
1402 data = xmalloc(length);
1403 copyData(type, data, p, c, length);
1407 *lengthPtr = length;
1411 static int intAddEntry(Header h, rpmtd td)
1417 /* Count must always be >= 1 for headerAddEntry. */
1421 if (hdrchkType(td->type))
1423 if (hdrchkData(td->count))
1427 data = grabData(td->type, td->data, td->count, &length);
1428 if (data == NULL || length <= 0)
1431 /* Allocate more index space if necessary */
1432 if (h->indexUsed == h->indexAlloced) {
1433 h->indexAlloced += INDEX_MALLOC_SIZE;
1434 h->index = xrealloc(h->index, h->indexAlloced * sizeof(*h->index));
1437 /* Fill in the index */
1438 entry = h->index + h->indexUsed;
1439 entry->info.tag = td->tag;
1440 entry->info.type = td->type;
1441 entry->info.count = td->count;
1442 entry->info.offset = 0;
1444 entry->length = length;
1446 if (h->indexUsed > 0 && td->tag < h->index[h->indexUsed-1].info.tag)
1447 h->flags &= ~HEADERFLAG_SORTED;
1453 static int intAppendEntry(Header h, rpmtd td)
1458 if (td->type == RPM_STRING_TYPE || td->type == RPM_I18NSTRING_TYPE) {
1459 /* we can't do this */
1463 /* Find the tag entry in the header. */
1464 entry = findEntry(h, td->tag, td->type);
1468 length = dataLength(td->type, td->data, td->count, 0, NULL);
1472 if (ENTRY_IN_REGION(entry)) {
1473 char * t = xmalloc(entry->length + length);
1474 memcpy(t, entry->data, entry->length);
1476 entry->info.offset = 0;
1478 entry->data = xrealloc(entry->data, entry->length + length);
1480 copyData(td->type, ((char *) entry->data) + entry->length,
1481 td->data, td->count, length);
1483 entry->length += length;
1485 entry->info.count += td->count;
1490 int headerPut(Header h, rpmtd td, headerPutFlags flags)
1495 if (flags & HEADERPUT_APPEND) {
1496 rc = findEntry(h, td->tag, td->type) ?
1497 intAppendEntry(h, td) :
1500 rc = intAddEntry(h, td);
1505 int headerAddI18NString(Header h, rpmTagVal tag, const char * string,
1508 indexEntry table, entry;
1509 const char ** strArray;
1512 rpm_count_t i, langNum;
1515 table = findEntry(h, RPMTAG_HEADERI18NTABLE, RPM_STRING_ARRAY_TYPE);
1516 entry = findEntry(h, tag, RPM_I18NSTRING_TYPE);
1518 if (!table && entry)
1519 return 0; /* this shouldn't ever happen!! */
1521 if (!table && !entry) {
1522 const char * charArray[2];
1523 rpm_count_t count = 0;
1525 if (!lang || (lang[0] == 'C' && lang[1] == '\0')) {
1526 charArray[count++] = "C";
1528 charArray[count++] = "C";
1529 charArray[count++] = lang;
1533 td.tag = RPMTAG_HEADERI18NTABLE;
1534 td.type = RPM_STRING_ARRAY_TYPE;
1535 td.data = (void *) charArray;
1537 if (!headerPut(h, &td, HEADERPUT_DEFAULT))
1539 table = findEntry(h, RPMTAG_HEADERI18NTABLE, RPM_STRING_ARRAY_TYPE);
1544 if (!lang) lang = "C";
1546 { const char * l = table->data;
1547 for (langNum = 0; langNum < table->info.count; langNum++) {
1548 if (rstreq(l, lang)) break;
1553 if (langNum >= table->info.count) {
1554 length = strlen(lang) + 1;
1555 if (ENTRY_IN_REGION(table)) {
1556 char * t = xmalloc(table->length + length);
1557 memcpy(t, table->data, table->length);
1559 table->info.offset = 0;
1561 table->data = xrealloc(table->data, table->length + length);
1562 memmove(((char *)table->data) + table->length, lang, length);
1563 table->length += length;
1564 table->info.count++;
1570 strArray = xmalloc(sizeof(*strArray) * (langNum + 1));
1571 for (i = 0; i < langNum; i++)
1573 strArray[langNum] = string;
1577 td.type = RPM_I18NSTRING_TYPE;
1579 td.count = langNum + 1;
1580 rc = headerPut(h, &td, HEADERPUT_DEFAULT);
1583 } else if (langNum >= entry->info.count) {
1584 ghosts = langNum - entry->info.count;
1586 length = strlen(string) + 1 + ghosts;
1587 if (ENTRY_IN_REGION(entry)) {
1588 char * t = xmalloc(entry->length + length);
1589 memcpy(t, entry->data, entry->length);
1591 entry->info.offset = 0;
1593 entry->data = xrealloc(entry->data, entry->length + length);
1595 memset(((char *)entry->data) + entry->length, '\0', ghosts);
1596 memmove(((char *)entry->data) + entry->length + ghosts, string, strlen(string)+1);
1598 entry->length += length;
1599 entry->info.count = langNum + 1;
1601 char *b, *be, *e, *ee, *t;
1604 /* Set beginning/end pointers to previous data */
1605 b = be = e = ee = entry->data;
1606 for (i = 0; i < table->info.count; i++) {
1609 ee += strlen(ee) + 1;
1614 /* Get storage for new buffer */
1616 sn = strlen(string) + 1;
1618 length = bn + sn + en;
1619 t = buf = xmalloc(length);
1621 /* Copy values into new storage */
1624 memcpy(t, string, sn);
1629 /* Replace i18N string array */
1630 entry->length -= strlen(be) + 1;
1631 entry->length += sn;
1633 if (ENTRY_IN_REGION(entry)) {
1634 entry->info.offset = 0;
1636 entry->data = _free(entry->data);
1643 int headerMod(Header h, rpmtd td)
1650 /* First find the tag */
1651 entry = findEntry(h, td->tag, td->type);
1656 data = grabData(td->type, td->data, td->count, &length);
1657 if (data == NULL || length <= 0)
1660 /* make sure entry points to the first occurence of this tag */
1661 while (entry > h->index && (entry - 1)->info.tag == td->tag)
1664 /* free after we've grabbed the new data in case the two are intertwined;
1665 that's a bad idea but at least we won't break */
1666 oldData = entry->data;
1668 entry->info.count = td->count;
1669 entry->info.type = td->type;
1671 entry->length = length;
1673 if (ENTRY_IN_REGION(entry)) {
1674 entry->info.offset = 0;
1676 oldData = _free(oldData);
1682 * Header tag iterator data structure.
1684 struct headerIterator_s {
1685 Header h; /*!< Header being iterated. */
1686 int next_index; /*!< Next tag index. */
1689 HeaderIterator headerFreeIterator(HeaderIterator hi)
1692 hi->h = headerFree(hi->h);
1698 HeaderIterator headerInitIterator(Header h)
1700 HeaderIterator hi = xmalloc(sizeof(*hi));
1704 hi->h = headerLink(h);
1709 static indexEntry nextIndex(HeaderIterator hi)
1713 indexEntry entry = NULL;
1715 for (slot = hi->next_index; slot < h->indexUsed; slot++) {
1716 entry = h->index + slot;
1717 if (!ENTRY_IS_REGION(entry))
1720 hi->next_index = slot;
1721 if (entry == NULL || slot >= h->indexUsed)
1728 rpmTagVal headerNextTag(HeaderIterator hi)
1730 indexEntry entry = nextIndex(hi);
1731 return entry ? entry->info.tag : RPMTAG_NOT_FOUND;
1734 int headerNext(HeaderIterator hi, rpmtd td)
1736 indexEntry entry = nextIndex(hi);
1741 td->tag = entry->info.tag;
1742 rc = copyTdEntry(entry, td, HEADERGET_DEFAULT);
1744 return ((rc == 1) ? 1 : 0);
1747 unsigned int headerGetInstance(Header h)
1749 return h ? h->instance : 0;
1752 void headerSetInstance(Header h, unsigned int instance)
1754 h->instance = instance;