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"
23 static unsigned char const header_magic[8] = {
24 0x8e, 0xad, 0xe8, 0x01, 0x00, 0x00, 0x00, 0x00
28 * Alignment needed for header data types.
30 static const int typeAlign[16] = {
31 1, /*!< RPM_NULL_TYPE */
32 1, /*!< RPM_CHAR_TYPE */
33 1, /*!< RPM_INT8_TYPE */
34 2, /*!< RPM_INT16_TYPE */
35 4, /*!< RPM_INT32_TYPE */
36 8, /*!< RPM_INT64_TYPE */
37 1, /*!< RPM_STRING_TYPE */
38 1, /*!< RPM_BIN_TYPE */
39 1, /*!< RPM_STRING_ARRAY_TYPE */
40 1, /*!< RPM_I18NSTRING_TYPE */
50 * Size of header data types.
52 static const int typeSizes[16] = {
53 0, /*!< RPM_NULL_TYPE */
54 1, /*!< RPM_CHAR_TYPE */
55 1, /*!< RPM_INT8_TYPE */
56 2, /*!< RPM_INT16_TYPE */
57 4, /*!< RPM_INT32_TYPE */
58 8, /*!< RPM_INT64_TYPE */
59 -1, /*!< RPM_STRING_TYPE */
60 1, /*!< RPM_BIN_TYPE */
61 -1, /*!< RPM_STRING_ARRAY_TYPE */
62 -1, /*!< RPM_I18NSTRING_TYPE */
71 /* dumb macro to avoid 50 copies of this code while converting... */
83 * Maximum no. of bytes permitted in a header.
85 static const size_t headerMaxbytes = (32*1024*1024);
88 * HEADER_EXT_TAG format function prototype.
89 * This is allowed to fail, which indicates the tag doesn't exist.
92 * @retval td tag data container
93 * @return 0 on success
95 typedef int (*headerTagTagFunction) (Header h, rpmtd td);
97 extern void *rpmHeaderTagFunc(rpmTag tag);
99 Header headerLink(Header h)
101 if (h == NULL) return NULL;
105 fprintf(stderr, "--> h %p ++ %d at %s:%u\n", h, h->nrefs, __FILE__, __LINE__);
110 Header headerUnlink(Header h)
112 if (h == NULL) return NULL;
114 fprintf(stderr, "--> h %p -- %d at %s:%u\n", h, h->nrefs, __FILE__, __LINE__);
119 Header headerFree(Header h)
121 (void) headerUnlink(h);
123 if (h == NULL || h->nrefs > 0)
124 return NULL; /* XXX return previous header? */
127 indexEntry entry = h->index;
129 for (i = 0; i < h->indexUsed; i++, entry++) {
130 if ((h->flags & HEADERFLAG_ALLOCATED) && ENTRY_IS_REGION(entry)) {
131 if (entry->length > 0) {
132 int32_t * ei = entry->data;
133 if ((ei - 2) == h->blob) h->blob = _free(h->blob);
136 } else if (!ENTRY_IN_REGION(entry)) {
137 entry->data = _free(entry->data);
141 h->index = _free(h->index);
148 Header headerNew(void)
150 Header h = xcalloc(1, sizeof(*h));
153 h->indexAlloced = INDEX_MALLOC_SIZE;
155 h->flags |= HEADERFLAG_SORTED;
157 h->index = (h->indexAlloced
158 ? xcalloc(h->indexAlloced, sizeof(*h->index))
162 return headerLink(h);
165 int headerVerifyInfo(int il, int dl, const void * pev, void * iv, int negate)
167 entryInfo pe = (entryInfo) pev;
171 for (i = 0; i < il; i++) {
172 info->tag = ntohl(pe[i].tag);
173 info->type = ntohl(pe[i].type);
174 info->offset = ntohl(pe[i].offset);
176 info->offset = -info->offset;
177 info->count = ntohl(pe[i].count);
179 if (hdrchkType(info->type))
181 if (hdrchkAlign(info->type, info->offset))
183 if (!negate && hdrchkRange(dl, info->offset))
185 if (hdrchkData(info->count))
194 static int indexCmp(const void * avp, const void * bvp)
196 indexEntry ap = (indexEntry) avp, bp = (indexEntry) bvp;
197 return (ap->info.tag - bp->info.tag);
200 void headerSort(Header h)
202 if (!(h->flags & HEADERFLAG_SORTED)) {
203 qsort(h->index, h->indexUsed, sizeof(*h->index), indexCmp);
204 h->flags |= HEADERFLAG_SORTED;
210 static int offsetCmp(const void * avp, const void * bvp)
212 indexEntry ap = (indexEntry) avp, bp = (indexEntry) bvp;
213 int rc = (ap->info.offset - bp->info.offset);
216 /* Within a region, entries sort by address. Added drips sort by tag. */
217 if (ap->info.offset < 0)
218 rc = (((char *)ap->data) - ((char *)bp->data));
220 rc = (ap->info.tag - bp->info.tag);
226 * Restore tags in header to original ordering.
229 void headerUnsort(Header h)
231 qsort(h->index, h->indexUsed, sizeof(*h->index), offsetCmp);
234 unsigned headerSizeof(Header h, enum hMagic magicp)
237 unsigned int size = 0;
238 unsigned int pad = 0;
247 case HEADER_MAGIC_YES:
248 size += sizeof(header_magic);
250 case HEADER_MAGIC_NO:
254 size += 2 * sizeof(int32_t); /* count of index entries */
256 for (i = 0, entry = h->index; i < h->indexUsed; i++, entry++) {
260 /* Regions go in as is ... */
261 if (ENTRY_IS_REGION(entry)) {
262 size += entry->length;
263 /* XXX Legacy regions do not include the region tag and data. */
264 if (i == 0 && (h->flags & HEADERFLAG_LEGACY))
265 size += sizeof(struct entryInfo_s) + entry->info.count;
269 /* ... and region elements are skipped. */
270 if (entry->info.offset < 0)
274 type = entry->info.type;
275 if (typeSizes[type] > 1) {
276 diff = typeSizes[type] - (size % typeSizes[type]);
277 if (diff != typeSizes[type]) {
283 size += sizeof(struct entryInfo_s) + entry->length;
290 * Return length of entry data.
291 * @param type entry data type
292 * @param p entry data
293 * @param count entry item count
294 * @param onDisk data is concatenated strings (with NUL's))?
295 * @param pend pointer to end of data (or NULL)
296 * @return no. bytes in data, -1 on failure
298 static int dataLength(rpmTagType type, rpm_constdata_t p, rpm_count_t count,
299 int onDisk, rpm_constdata_t pend)
301 const unsigned char * s = p;
302 const unsigned char * se = pend;
306 case RPM_STRING_TYPE:
314 length++; /* count nul terminator too. */
317 case RPM_STRING_ARRAY_TYPE:
318 case RPM_I18NSTRING_TYPE:
319 /* These are like RPM_STRING_TYPE, except they're *always* an array */
320 /* Compute sum of length of all strings, including nul terminators */
324 length++; /* count nul terminator too */
332 const char ** av = (const char **)p;
334 /* add one for null termination */
335 length += strlen(*av++) + 1;
341 if (typeSizes[type] == -1)
343 length = typeSizes[(type & 0xf)] * count;
344 if (length < 0 || (se && (s + length) > se))
353 * Swap int32_t and int16_t arrays within header region.
355 * This code is way more twisty than I would like.
357 * A bug with RPM_I18NSTRING_TYPE in rpm-2.5.x (fixed in August 1998)
358 * causes the offset and length of elements in a header region to disagree
359 * regarding the total length of the region data.
361 * The "fix" is to compute the size using both offset and length and
362 * return the larger of the two numbers as the size of the region.
363 * Kinda like computing left and right Riemann sums of the data elements
364 * to determine the size of a data structure, go figger :-).
366 * There's one other twist if a header region tag is in the set to be swabbed,
367 * as the data for a header region is located after all other tag data.
369 * @param entry header entry
370 * @param il no. of entries
371 * @param dl start no. bytes of data
372 * @param pe header physical entry pointer (swapped)
373 * @param dataStart header data start
374 * @param dataEnd header data end
375 * @param regionid region offset
376 * @return no. bytes of data in region, -1 on error
378 static int regionSwab(indexEntry entry, int il, int dl,
380 unsigned char * dataStart,
381 const unsigned char * dataEnd,
384 unsigned char * tprev = NULL;
385 unsigned char * t = NULL;
388 struct indexEntry_s ieprev;
390 memset(&ieprev, 0, sizeof(ieprev));
391 for (; il > 0; il--, pe++) {
392 struct indexEntry_s ie;
395 ie.info.tag = ntohl(pe->tag);
396 ie.info.type = ntohl(pe->type);
397 ie.info.count = ntohl(pe->count);
398 ie.info.offset = ntohl(pe->offset);
400 if (hdrchkType(ie.info.type))
402 if (hdrchkData(ie.info.count))
404 if (hdrchkData(ie.info.offset))
406 if (hdrchkAlign(ie.info.type, ie.info.offset))
409 ie.data = t = dataStart + ie.info.offset;
410 if (dataEnd && t >= dataEnd)
413 ie.length = dataLength(ie.info.type, ie.data, ie.info.count, 1, dataEnd);
414 if (ie.length < 0 || hdrchkData(ie.length))
420 ie.info.offset = regionid;
421 *entry = ie; /* structure assignment */
427 if (typeSizes[type] > 1) {
429 diff = typeSizes[type] - (dl % typeSizes[type]);
430 if (diff != typeSizes[type]) {
432 if (ieprev.info.type == RPM_I18NSTRING_TYPE)
433 ieprev.length += diff;
436 tdel = (tprev ? (t - tprev) : 0);
437 if (ieprev.info.type == RPM_I18NSTRING_TYPE)
438 tdel = ieprev.length;
440 if (ie.info.tag >= HEADER_I18NTABLE) {
444 /* XXX HEADER_IMAGE tags don't include region sub-tag. */
445 if (ie.info.tag == HEADER_IMAGE)
446 tprev -= REGION_TAG_COUNT;
449 /* Perform endian conversions */
450 switch (ntohl(pe->type)) {
452 { uint64_t * it = (uint64_t *)t;
453 for (; ie.info.count > 0; ie.info.count--, it += 1) {
454 if (dataEnd && ((unsigned char *)it) >= dataEnd)
458 t = (unsigned char *) it;
461 { int32_t * it = (int32_t *)t;
462 for (; ie.info.count > 0; ie.info.count--, it += 1) {
463 if (dataEnd && ((unsigned char *)it) >= dataEnd)
467 t = (unsigned char *) it;
470 { int16_t * it = (int16_t *) t;
471 for (; ie.info.count > 0; ie.info.count--, it += 1) {
472 if (dataEnd && ((unsigned char *)it) >= dataEnd)
476 t = (unsigned char *) it;
485 ieprev = ie; /* structure assignment */
488 tdel = (tprev ? (t - tprev) : 0);
492 * There are two hacks here:
493 * 1) tl is 16b (i.e. REGION_TAG_COUNT) short while doing headerReload().
494 * 2) the 8/98 rpm bug with inserting i18n tags needs to use tl, not dl.
496 if (tl+REGION_TAG_COUNT == dl)
497 tl += REGION_TAG_COUNT;
505 * @retval *lengthPtr no. bytes in unloaded header blob
506 * @return unloaded header blob (NULL on error)
508 static void * doHeaderUnload(Header h,
522 int drlen, ndribbles;
526 /* Sort entries by (offset,tag). */
529 /* Compute (il,dl) for all tags, including those deleted in region. */
531 drlen = ndribbles = driplen = ndrips = 0;
532 for (i = 0, entry = h->index; i < h->indexUsed; i++, entry++) {
533 if (ENTRY_IS_REGION(entry)) {
534 int32_t rdl = -entry->info.offset; /* negative offset */
535 int32_t ril = rdl/sizeof(*pe);
536 int rid = entry->info.offset;
539 dl += entry->rdlen + entry->info.count;
540 /* XXX Legacy regions do not include the region tag and data. */
541 if (i == 0 && (h->flags & HEADERFLAG_LEGACY))
544 /* Skip rest of entries in region, but account for dribbles. */
545 for (; i < h->indexUsed && entry->info.offset <= rid+1; i++, entry++) {
546 if (entry->info.offset <= rid)
550 type = entry->info.type;
551 if (typeSizes[type] > 1) {
553 diff = typeSizes[type] - (dl % typeSizes[type]);
554 if (diff != typeSizes[type]) {
563 drlen += entry->length;
571 /* Ignore deleted drips. */
572 if (entry->data == NULL || entry->length <= 0)
576 type = entry->info.type;
577 if (typeSizes[type] > 1) {
579 diff = typeSizes[type] - (dl % typeSizes[type]);
580 if (diff != typeSizes[type]) {
590 driplen += entry->length;
594 /* Sanity checks on header intro. */
595 if (hdrchkTags(il) || hdrchkData(dl))
598 len = sizeof(il) + sizeof(dl) + (il * sizeof(*pe)) + dl;
604 pe = (entryInfo) &ei[2];
605 dataStart = te = (char *) (pe + il);
608 for (i = 0, entry = h->index; i < h->indexUsed; i++, entry++) {
614 if (entry->data == NULL || entry->length <= 0)
617 t = (unsigned char*)te;
618 pe->tag = htonl(entry->info.tag);
619 pe->type = htonl(entry->info.type);
620 pe->count = htonl(entry->info.count);
622 if (ENTRY_IS_REGION(entry)) {
623 int32_t rdl = -entry->info.offset; /* negative offset */
624 int32_t ril = rdl/sizeof(*pe) + ndribbles;
625 int rid = entry->info.offset;
627 src = (char *)entry->data;
628 rdlen = entry->rdlen;
630 /* XXX Legacy regions do not include the region tag and data. */
631 if (i == 0 && (h->flags & HEADERFLAG_LEGACY)) {
635 memcpy(pe+1, src, rdl);
636 memcpy(te, src + rdl, rdlen);
639 pe->offset = htonl(te - dataStart);
642 stei[2] = htonl(-rdl-entry->info.count);
644 memcpy(te, stei, entry->info.count);
645 te += entry->info.count;
647 rdlen += entry->info.count;
649 count = regionSwab(NULL, ril, 0, pe, t, NULL, 0);
655 memcpy(pe+1, src + sizeof(*pe), ((ril-1) * sizeof(*pe)));
656 memcpy(te, src + (ril * sizeof(*pe)), rdlen+entry->info.count+drlen);
659 entryInfo se = (entryInfo)src;
660 int off = ntohl(se->offset);
661 pe->offset = (off) ? htonl(te - dataStart) : htonl(off);
663 te += entry->info.count + drlen;
665 count = regionSwab(NULL, ril, 0, pe, t, NULL, 0);
666 if (count != (rdlen + entry->info.count + drlen))
670 /* Skip rest of entries in region. */
671 while (i < h->indexUsed && entry->info.offset <= rid+1) {
681 /* Ignore deleted drips. */
682 if (entry->data == NULL || entry->length <= 0)
686 type = entry->info.type;
687 if (typeSizes[type] > 1) {
689 diff = typeSizes[type] - ((te - dataStart) % typeSizes[type]);
690 if (diff != typeSizes[type]) {
697 pe->offset = htonl(te - dataStart);
699 /* copy data w/ endian conversions */
700 switch (entry->info.type) {
702 count = entry->info.count;
705 *((uint64_t *)te) = htonll(*((uint64_t *)src));
706 te += sizeof(uint64_t);
707 src += sizeof(uint64_t);
712 count = entry->info.count;
715 *((int32_t *)te) = htonl(*((int32_t *)src));
716 te += sizeof(int32_t);
717 src += sizeof(int32_t);
722 count = entry->info.count;
725 *((int16_t *)te) = htons(*((int16_t *)src));
726 te += sizeof(int16_t);
727 src += sizeof(int16_t);
732 memcpy(te, entry->data, entry->length);
739 /* Insure that there are no memcpy underruns/overruns. */
740 if (((char *)pe) != dataStart)
742 if ((((char *)ei)+len) != te)
748 h->flags &= ~HEADERFLAG_SORTED;
758 void * headerUnload(Header h)
761 void * uh = doHeaderUnload(h, &length);
766 * Find matching (tag,type) entry in header.
768 * @param tag entry tag
769 * @param type entry type
770 * @return header entry
773 indexEntry findEntry(Header h, rpmTag tag, rpmTagType type)
775 indexEntry entry, entry2, last;
776 struct indexEntry_s key;
778 if (h == NULL) return NULL;
779 if (!(h->flags & HEADERFLAG_SORTED)) headerSort(h);
784 bsearch(&key, h->index, h->indexUsed, sizeof(*h->index), indexCmp);
788 if (type == RPM_NULL_TYPE)
792 while (entry->info.tag == tag && entry->info.type != type &&
793 entry > h->index) entry--;
795 if (entry->info.tag == tag && entry->info.type == type)
798 last = h->index + h->indexUsed;
799 /* FIX: entry2 = entry. Code looks bogus as well. */
800 while (entry2->info.tag == tag && entry2->info.type != type &&
801 entry2 < last) entry2++;
803 if (entry->info.tag == tag && entry->info.type == type)
809 int headerDel(Header h, rpmTag tag)
811 indexEntry last = h->index + h->indexUsed;
812 indexEntry entry, first;
815 entry = findEntry(h, tag, RPM_NULL_TYPE);
816 if (!entry) return 1;
818 /* Make sure entry points to the first occurence of this tag. */
819 while (entry > h->index && (entry - 1)->info.tag == tag)
822 /* Free data for tags being removed. */
823 for (first = entry; first < last; first++) {
825 if (first->info.tag != tag)
830 if (ENTRY_IN_REGION(first))
835 ne = (first - entry);
840 memmove(entry, first, (ne * sizeof(*entry)));
846 int headerRemoveEntry(Header h, rpmTag tag)
848 return headerDel(h, tag);
851 Header headerLoad(void * uh)
853 int32_t * ei = (int32_t *) uh;
854 int32_t il = ntohl(ei[0]); /* index length */
855 int32_t dl = ntohl(ei[1]); /* data length */
856 size_t pvlen = sizeof(il) + sizeof(dl) +
857 (il * sizeof(struct entryInfo_s)) + dl;
861 unsigned char * dataStart;
862 unsigned char * dataEnd;
867 /* Sanity checks on header intro. */
868 if (hdrchkTags(il) || hdrchkData(dl))
872 pe = (entryInfo) &ei[2];
873 dataStart = (unsigned char *) (pe + il);
874 dataEnd = dataStart + dl;
876 h = xcalloc(1, sizeof(*h));
878 h->indexAlloced = il + 1;
880 h->index = xcalloc(h->indexAlloced, sizeof(*h->index));
881 h->flags |= HEADERFLAG_SORTED;
887 if (!(htonl(pe->tag) < HEADER_I18NTABLE)) {
888 h->flags |= HEADERFLAG_LEGACY;
889 entry->info.type = REGION_TAG_TYPE;
890 entry->info.tag = HEADER_IMAGE;
891 entry->info.count = REGION_TAG_COUNT;
892 entry->info.offset = ((unsigned char *)pe - dataStart); /* negative offset */
895 entry->length = pvlen - sizeof(il) - sizeof(dl);
896 rdlen = regionSwab(entry+1, il, 0, pe, dataStart, dataEnd, entry->info.offset);
897 #if 0 /* XXX don't check, the 8/98 i18n bug fails here. */
901 entry->rdlen = rdlen;
908 h->flags &= ~HEADERFLAG_LEGACY;
910 entry->info.type = htonl(pe->type);
911 entry->info.count = htonl(pe->count);
913 if (hdrchkType(entry->info.type))
915 if (hdrchkTags(entry->info.count))
918 { int off = ntohl(pe->offset);
923 size_t nb = REGION_TAG_COUNT;
925 /* XXX Hmm, why the copy? */
926 memcpy(&stei, dataStart + off, nb);
927 rdl = -ntohl(stei[2]); /* negative offset */
928 ril = rdl/sizeof(*pe);
929 if (hdrchkTags(ril) || hdrchkData(rdl))
931 entry->info.tag = htonl(pe->tag);
934 rdl = (ril * sizeof(struct entryInfo_s));
935 entry->info.tag = HEADER_IMAGE;
938 entry->info.offset = -rdl; /* negative offset */
941 entry->length = pvlen - sizeof(il) - sizeof(dl);
942 rdlen = regionSwab(entry+1, ril-1, 0, pe+1, dataStart, dataEnd, entry->info.offset);
945 entry->rdlen = rdlen;
947 if (ril < h->indexUsed) {
948 indexEntry newEntry = entry + ril;
949 int ne = (h->indexUsed - ril);
950 int rid = entry->info.offset+1;
953 /* Load dribble entries from region. */
954 rc = regionSwab(newEntry, ne, 0, pe+ril, dataStart, dataEnd, rid);
959 { indexEntry firstEntry = newEntry;
960 int save = h->indexUsed;
963 /* Dribble entries replace duplicate region entries. */
965 for (j = 0; j < ne; j++, newEntry++) {
966 (void) headerRemoveEntry(h, newEntry->info.tag);
967 if (newEntry->info.tag == HEADER_BASENAMES)
968 (void) headerRemoveEntry(h, HEADER_OLDFILENAMES);
971 /* If any duplicate entries were replaced, move new entries down. */
972 if (h->indexUsed < (save - ne)) {
973 memmove(h->index + h->indexUsed, firstEntry,
974 (ne * sizeof(*entry)));
981 h->flags &= ~HEADERFLAG_SORTED;
988 h->index = _free(h->index);
994 Header headerReload(Header h, rpmTag tag)
998 void * uh = doHeaderUnload(h, &length);
1003 nh = headerLoad(uh);
1008 if (nh->flags & HEADERFLAG_ALLOCATED)
1010 nh->flags |= HEADERFLAG_ALLOCATED;
1011 if (ENTRY_IS_REGION(nh->index)) {
1012 if (tag == HEADER_SIGNATURES || tag == HEADER_IMMUTABLE)
1013 nh->index[0].info.tag = tag;
1018 Header headerCopyLoad(const void * uh)
1020 int32_t * ei = (int32_t *) uh;
1021 int32_t il = ntohl(ei[0]); /* index length */
1022 int32_t dl = ntohl(ei[1]); /* data length */
1023 size_t pvlen = sizeof(il) + sizeof(dl) +
1024 (il * sizeof(struct entryInfo_s)) + dl;
1028 /* Sanity checks on header intro. */
1029 if (!(hdrchkTags(il) || hdrchkData(dl)) && pvlen < headerMaxbytes) {
1030 nuh = memcpy(xmalloc(pvlen), uh, pvlen);
1031 if ((h = headerLoad(nuh)) != NULL)
1032 h->flags |= HEADERFLAG_ALLOCATED;
1040 * Read (and load) header from file handle.
1041 * @param fd file handle
1042 * @param magicp read (and verify) 8 bytes of (magic, 0)?
1043 * @return header (or NULL on error)
1045 Header headerRead(FD_t fd, enum hMagic magicp)
1049 int32_t * ei = NULL;
1057 memset(block, 0, sizeof(block));
1059 if (magicp == HEADER_MAGIC_YES)
1063 if (timedRead(fd, (char *)block, i*sizeof(*block)) != (i * sizeof(*block)))
1068 if (magicp == HEADER_MAGIC_YES) {
1070 if (memcmp(&magic, header_magic, sizeof(magic)))
1072 reserved = block[i++];
1075 il = ntohl(block[i]); i++;
1076 dl = ntohl(block[i]); i++;
1078 len = sizeof(il) + sizeof(dl) + (il * sizeof(struct entryInfo_s)) + dl;
1080 /* Sanity checks on header intro. */
1081 if (hdrchkTags(il) || hdrchkData(dl) || len > headerMaxbytes)
1087 len -= sizeof(il) + sizeof(dl);
1090 if (timedRead(fd, (char *)&ei[2], len) != len)
1097 if (h->flags & HEADERFLAG_ALLOCATED)
1099 h->flags |= HEADERFLAG_ALLOCATED;
1102 /* FIX: timedRead macro obscures annotation */
1106 int headerWrite(FD_t fd, Header h, enum hMagic magicp)
1114 uh = doHeaderUnload(h, &length);
1118 case HEADER_MAGIC_YES:
1119 nb = Fwrite(header_magic, sizeof(char), sizeof(header_magic), fd);
1120 if (nb != sizeof(header_magic))
1123 case HEADER_MAGIC_NO:
1127 nb = Fwrite(uh, sizeof(char), length, fd);
1131 return (nb == length ? 0 : 1);
1134 int headerIsEntry(Header h, rpmTag tag)
1136 /* FIX: h modified by sort. */
1137 return (findEntry(h, tag, RPM_NULL_TYPE) ? 1 : 0);
1142 * Retrieve data from header entry.
1143 * Relevant flags (others are ignored), if neither is set allocation
1144 * behavior depends on data type(!)
1145 * HEADERGET_MINMEM: return pointers to header memory
1146 * HEADERGET_ALLOC: always return malloced memory, overrides MINMEM
1148 * @todo Permit retrieval of regions other than HEADER_IMUTABLE.
1149 * @param entry header entry
1150 * @param td tag data container
1151 * @param minMem string pointers refer to header memory?
1152 * @param flags flags to control memory allocation
1153 * @return 1 on success, otherwise error.
1155 static int copyTdEntry(const indexEntry entry, rpmtd td, headerGetFlags flags)
1157 rpm_count_t count = entry->info.count;
1158 int rc = 1; /* XXX 1 on success. */
1159 /* ALLOC overrides MINMEM */
1160 int allocMem = flags & HEADERGET_ALLOC;
1161 int minMem = allocMem ? 0 : flags & HEADERGET_MINMEM;
1164 switch (entry->info.type) {
1167 * XXX This only works for
1168 * XXX "sealed" HEADER_IMMUTABLE/HEADER_SIGNATURES/HEADER_IMAGE.
1169 * XXX This will *not* work for unsealed legacy HEADER_IMAGE (i.e.
1170 * XXX a legacy header freshly read, but not yet unloaded to the rpmdb).
1172 if (ENTRY_IS_REGION(entry)) {
1173 int32_t * ei = ((int32_t *)entry->data) - 2;
1174 entryInfo pe = (entryInfo) (ei + 2);
1175 unsigned char * dataStart = (unsigned char *) (pe + ntohl(ei[0]));
1176 int32_t rdl = -entry->info.offset; /* negative offset */
1177 int32_t ril = rdl/sizeof(*pe);
1180 count = 2 * sizeof(*ei) + (ril * sizeof(*pe)) + rdl;
1181 if (entry->info.tag == HEADER_IMAGE) {
1185 count += REGION_TAG_COUNT;
1186 rdl += REGION_TAG_COUNT;
1189 td->data = xmalloc(count);
1190 ei = (int32_t *) td->data;
1194 pe = (entryInfo) memcpy(ei + 2, pe, (ril * sizeof(*pe)));
1196 dataStart = (unsigned char *) memcpy(pe + ril, dataStart, rdl);
1198 rc = regionSwab(NULL, ril, 0, pe, dataStart, dataStart + rdl, 0);
1199 /* XXX 1 on success. */
1200 rc = (rc < 0) ? 0 : 1;
1202 count = entry->length;
1204 ? memcpy(xmalloc(count), entry->data, count)
1208 case RPM_STRING_TYPE:
1210 td->data = allocMem ? xstrdup(entry->data) : entry->data;
1213 case RPM_STRING_ARRAY_TYPE:
1214 case RPM_I18NSTRING_TYPE:
1215 { const char ** ptrEntry;
1216 int tableSize = count * sizeof(char *);
1221 td->data = xmalloc(tableSize);
1222 ptrEntry = (const char **) td->data;
1225 t = xmalloc(tableSize + entry->length);
1226 td->data = (void *)t;
1227 ptrEntry = (const char **) td->data;
1229 memcpy(t, entry->data, entry->length);
1231 for (i = 0; i < count; i++) {
1239 case RPM_INT16_TYPE:
1240 case RPM_INT32_TYPE:
1241 case RPM_INT64_TYPE:
1243 td->data = xmalloc(entry->length);
1244 memcpy(td->data, entry->data, entry->length);
1246 td->data = entry->data;
1250 /* WTH? Don't mess with unknown data types... */
1255 td->type = entry->info.type;
1258 td->flags = RPMTD_IMMUTABLE;
1259 if (td->data && entry->data != td->data) {
1260 td->flags |= RPMTD_ALLOCED;
1267 * Retrieve data from header entry.
1268 * Just a compat wrapper around copyTdEntry() until everything's converted
1270 * @param entry header entry
1271 * @retval type address of type (or NULL)
1272 * @retval p address of data (or NULL)
1273 * @retval c address of count (or NULL)
1274 * @param minMem string pointers refer to header memory?
1275 * @return 1 on success, otherwise error.
1277 static int copyEntry(const indexEntry entry,
1287 rc = copyTdEntry(entry, &td, minMem ? HEADERGET_MINMEM : HEADERGET_DEFAULT);
1293 * Does locale match entry in header i18n table?
1296 * The range [l,le) contains the next locale to match:
1297 * ll[_CC][.EEEEE][@dddd]
1299 * ll ISO language code (in lowercase).
1300 * CC (optional) ISO coutnry code (in uppercase).
1301 * EEEEE (optional) encoding (not really standardized).
1302 * dddd (optional) dialect.
1305 * @param td header i18n table data, NUL terminated
1306 * @param l start of locale to match
1307 * @param le end of locale to match
1308 * @return 1 on good match, 2 on weak match, 0 on no match
1310 static int headerMatchLocale(const char *td, const char *l, const char *le)
1314 /* First try a complete match. */
1315 if (strlen(td) == (le-l) && !strncmp(td, l, (le - l)))
1318 /* Next, try stripping optional dialect and matching. */
1319 for (fe = l; fe < le && *fe != '@'; fe++)
1321 if (fe < le && !strncmp(td, l, (fe - l)))
1324 /* Next, try stripping optional codeset and matching. */
1325 for (fe = l; fe < le && *fe != '.'; fe++)
1327 if (fe < le && !strncmp(td, l, (fe - l)))
1330 /* Finally, try stripping optional country code and matching. */
1331 for (fe = l; fe < le && *fe != '_'; fe++)
1333 if (fe < le && !strncmp(td, l, (fe - l)))
1340 * Return i18n string from header that matches locale.
1342 * @param entry i18n string data
1343 * @retval td tag data container
1344 * @param flags flags to control allocation
1347 static int copyI18NEntry(Header h, indexEntry entry, rpmtd td,
1348 headerGetFlags flags)
1350 const char *lang, *l, *le;
1353 td->type = RPM_STRING_TYPE;
1355 /* if no match, just return the first string */
1356 td->data = entry->data;
1358 /* XXX Drepper sez' this is the order. */
1359 if ((lang = getenv("LANGUAGE")) == NULL &&
1360 (lang = getenv("LC_ALL")) == NULL &&
1361 (lang = getenv("LC_MESSAGES")) == NULL &&
1362 (lang = getenv("LANG")) == NULL)
1365 if ((table = findEntry(h, HEADER_I18NTABLE, RPM_STRING_ARRAY_TYPE)) == NULL)
1368 for (l = lang; *l != '\0'; l = le) {
1370 char *ed, *ed_weak = NULL;
1373 while (*l && *l == ':') /* skip leading colons */
1377 for (le = l; *le && *le != ':'; le++) /* find end of this locale */
1380 /* For each entry in the header ... */
1381 for (langNum = 0, t = table->data, ed = entry->data;
1382 langNum < entry->info.count;
1383 langNum++, t += strlen(t) + 1, ed += strlen(ed) + 1) {
1385 int match = headerMatchLocale(t, l, le);
1389 } else if (match == 2) {
1400 if (flags & HEADERGET_ALLOC) {
1401 td->data = xstrdup(td->data);
1408 * Retrieve tag data from header.
1410 * @param tag tag to retrieve
1411 * @retval td tag data container
1412 * @param flags flags to control retrieval
1413 * @return 1 on success, 0 on not found
1415 static int intGetTdEntry(Header h, rpmTag tag, rpmtd td, headerGetFlags flags)
1421 /* ensure clean state */
1424 /* First find the tag */
1425 /* FIX: h modified by sort. */
1426 entry = findEntry(h, tag, RPM_NULL_TYPE);
1427 if (entry == NULL) {
1428 /* Td is zeroed above, just return... */
1432 if (flags & HEADERGET_RAW) {
1433 rc = copyTdEntry(entry, td, flags);
1435 switch (entry->info.type) {
1436 case RPM_I18NSTRING_TYPE:
1437 rc = copyI18NEntry(h, entry, td, flags);
1440 rc = copyTdEntry(entry, td, flags);
1445 /* XXX 1 on success */
1446 return ((rc == 1) ? 1 : 0);
1449 void * headerFreeTag(Header h, rpm_data_t data, rpmTagType type)
1452 if (type == RPM_FORCEFREE_TYPE ||
1453 type == RPM_STRING_ARRAY_TYPE ||
1454 type == RPM_I18NSTRING_TYPE ||
1455 type == RPM_BIN_TYPE)
1462 * XXX temporary kludgery until tag extensions have been converted to
1463 * take rpmtd as argument
1465 static int intGetTagExt(Header h, rpmTag tag, rpmtd td, headerTagTagFunction tagfunc)
1469 rc = tagfunc(h, td);
1474 int headerGet(Header h, rpmTag tag, rpmtd td, headerGetFlags flags)
1477 headerTagTagFunction tagfunc = NULL;
1481 if (flags & HEADERGET_EXT) {
1482 tagfunc = rpmHeaderTagFunc(tag);
1486 rc = intGetTagExt(h, tag, td, tagfunc);
1488 rc = intGetTdEntry(h, tag, td, flags);
1491 assert(tag == td->tag);
1495 static int headerGetWrap(Header h, rpmTag tag,
1499 headerGetFlags flags)
1504 rc = headerGet(h, tag, &td, flags);
1509 int headerGetEntry(Header h, rpmTag tag,
1514 return headerGetWrap(h, tag, type, p, c, HEADERGET_DEFAULT);
1517 int headerGetEntryMinMemory(Header h, rpmTag tag,
1522 return headerGetWrap(h, tag, type, (rpm_data_t) p, c, HEADERGET_MINMEM);
1525 int headerGetRawEntry(Header h, rpmTag tag, rpmTagType * type, rpm_data_t * p,
1531 if (p == NULL) return headerIsEntry(h, tag);
1533 /* First find the tag */
1534 /* FIX: h modified by sort. */
1535 entry = findEntry(h, tag, RPM_NULL_TYPE);
1542 rc = copyEntry(entry, type, p, c, 0);
1544 /* XXX 1 on success */
1545 return ((rc == 1) ? 1 : 0);
1550 static void copyData(rpmTagType type, rpm_data_t dstPtr,
1551 rpm_constdata_t srcPtr, rpm_count_t cnt, int dataLength)
1554 case RPM_STRING_ARRAY_TYPE:
1555 case RPM_I18NSTRING_TYPE:
1556 { const char ** av = (const char **) srcPtr;
1559 while (cnt-- > 0 && dataLength > 0) {
1561 if ((s = *av++) == NULL)
1565 } while (s[-1] && --dataLength > 0);
1570 memmove(dstPtr, srcPtr, dataLength);
1576 * Return (malloc'ed) copy of entry data.
1577 * @param type entry data type
1578 * @param p entry data
1579 * @param c entry item count
1580 * @retval lengthPtr no. bytes in returned data
1581 * @return (malloc'ed) copy of entry data, NULL on error
1584 grabData(rpmTagType type, rpm_constdata_t p, rpm_count_t c, int * lengthPtr)
1586 rpm_data_t data = NULL;
1589 length = dataLength(type, p, c, 0, NULL);
1591 data = xmalloc(length);
1592 copyData(type, data, p, c, length);
1596 *lengthPtr = length;
1600 int headerAddEntry(Header h, rpmTag tag, rpmTagType type,
1601 rpm_constdata_t p, rpm_count_t c)
1607 /* Count must always be >= 1 for headerAddEntry. */
1611 if (hdrchkType(type))
1617 data = grabData(type, p, c, &length);
1618 if (data == NULL || length <= 0)
1621 /* Allocate more index space if necessary */
1622 if (h->indexUsed == h->indexAlloced) {
1623 h->indexAlloced += INDEX_MALLOC_SIZE;
1624 h->index = xrealloc(h->index, h->indexAlloced * sizeof(*h->index));
1627 /* Fill in the index */
1628 entry = h->index + h->indexUsed;
1629 entry->info.tag = tag;
1630 entry->info.type = type;
1631 entry->info.count = c;
1632 entry->info.offset = 0;
1634 entry->length = length;
1636 if (h->indexUsed > 0 && tag < h->index[h->indexUsed-1].info.tag)
1637 h->flags &= ~HEADERFLAG_SORTED;
1643 int headerAppendEntry(Header h, rpmTag tag, rpmTagType type,
1644 rpm_constdata_t p, rpm_count_t c)
1649 if (type == RPM_STRING_TYPE || type == RPM_I18NSTRING_TYPE) {
1650 /* we can't do this */
1654 /* Find the tag entry in the header. */
1655 entry = findEntry(h, tag, type);
1659 length = dataLength(type, p, c, 0, NULL);
1663 if (ENTRY_IN_REGION(entry)) {
1664 char * t = xmalloc(entry->length + length);
1665 memcpy(t, entry->data, entry->length);
1667 entry->info.offset = 0;
1669 entry->data = xrealloc(entry->data, entry->length + length);
1671 copyData(type, ((char *) entry->data) + entry->length, p, c, length);
1673 entry->length += length;
1675 entry->info.count += c;
1680 int headerAddOrAppendEntry(Header h, rpmTag tag, rpmTagType type,
1681 rpm_constdata_t p, rpm_count_t c)
1683 return (findEntry(h, tag, type)
1684 ? headerAppendEntry(h, tag, type, p, c)
1685 : headerAddEntry(h, tag, type, p, c));
1688 int headerPut(Header h, rpmtd td, headerPutFlags flags)
1693 if (flags & HEADERPUT_APPEND) {
1694 rc = headerAddOrAppendEntry(h, td->tag, td->type, td->data, td->count);
1696 rc = headerAddEntry(h, td->tag, td->type, td->data, td->count);
1701 int headerAddI18NString(Header h, rpmTag tag, const char * string,
1704 indexEntry table, entry;
1705 const char ** strArray;
1708 rpm_count_t i, langNum;
1711 table = findEntry(h, HEADER_I18NTABLE, RPM_STRING_ARRAY_TYPE);
1712 entry = findEntry(h, tag, RPM_I18NSTRING_TYPE);
1714 if (!table && entry)
1715 return 0; /* this shouldn't ever happen!! */
1717 if (!table && !entry) {
1718 const char * charArray[2];
1719 rpm_count_t count = 0;
1720 if (!lang || (lang[0] == 'C' && lang[1] == '\0')) {
1721 charArray[count++] = "C";
1723 charArray[count++] = "C";
1724 charArray[count++] = lang;
1726 if (!headerAddEntry(h, HEADER_I18NTABLE, RPM_STRING_ARRAY_TYPE,
1729 table = findEntry(h, HEADER_I18NTABLE, RPM_STRING_ARRAY_TYPE);
1734 if (!lang) lang = "C";
1736 { const char * l = table->data;
1737 for (langNum = 0; langNum < table->info.count; langNum++) {
1738 if (!strcmp(l, lang)) break;
1743 if (langNum >= table->info.count) {
1744 length = strlen(lang) + 1;
1745 if (ENTRY_IN_REGION(table)) {
1746 char * t = xmalloc(table->length + length);
1747 memcpy(t, table->data, table->length);
1749 table->info.offset = 0;
1751 table->data = xrealloc(table->data, table->length + length);
1752 memmove(((char *)table->data) + table->length, lang, length);
1753 table->length += length;
1754 table->info.count++;
1759 strArray = xmalloc(sizeof(*strArray) * (langNum + 1));
1760 for (i = 0; i < langNum; i++)
1762 strArray[langNum] = string;
1763 rc = headerAddEntry(h, tag, RPM_I18NSTRING_TYPE, strArray, langNum + 1);
1766 } else if (langNum >= entry->info.count) {
1767 ghosts = langNum - entry->info.count;
1769 length = strlen(string) + 1 + ghosts;
1770 if (ENTRY_IN_REGION(entry)) {
1771 char * t = xmalloc(entry->length + length);
1772 memcpy(t, entry->data, entry->length);
1774 entry->info.offset = 0;
1776 entry->data = xrealloc(entry->data, entry->length + length);
1778 memset(((char *)entry->data) + entry->length, '\0', ghosts);
1779 memmove(((char *)entry->data) + entry->length + ghosts, string, strlen(string)+1);
1781 entry->length += length;
1782 entry->info.count = langNum + 1;
1784 char *b, *be, *e, *ee, *t;
1787 /* Set beginning/end pointers to previous data */
1788 b = be = e = ee = entry->data;
1789 for (i = 0; i < table->info.count; i++) {
1792 ee += strlen(ee) + 1;
1797 /* Get storage for new buffer */
1799 sn = strlen(string) + 1;
1801 length = bn + sn + en;
1802 t = buf = xmalloc(length);
1804 /* Copy values into new storage */
1807 memcpy(t, string, sn);
1812 /* Replace i18N string array */
1813 entry->length -= strlen(be) + 1;
1814 entry->length += sn;
1816 if (ENTRY_IN_REGION(entry)) {
1817 entry->info.offset = 0;
1819 entry->data = _free(entry->data);
1826 int headerModifyEntry(Header h, rpmTag tag, rpmTagType type,
1827 rpm_constdata_t p, rpm_count_t c)
1834 /* First find the tag */
1835 entry = findEntry(h, tag, type);
1840 data = grabData(type, p, c, &length);
1841 if (data == NULL || length <= 0)
1844 /* make sure entry points to the first occurence of this tag */
1845 while (entry > h->index && (entry - 1)->info.tag == tag)
1848 /* free after we've grabbed the new data in case the two are intertwined;
1849 that's a bad idea but at least we won't break */
1850 oldData = entry->data;
1852 entry->info.count = c;
1853 entry->info.type = type;
1855 entry->length = length;
1857 if (ENTRY_IN_REGION(entry)) {
1858 entry->info.offset = 0;
1860 oldData = _free(oldData);
1866 * Header tag iterator data structure.
1868 struct headerIterator_s {
1869 Header h; /*!< Header being iterated. */
1870 int next_index; /*!< Next tag index. */
1873 HeaderIterator headerFreeIterator(HeaderIterator hi)
1876 hi->h = headerFree(hi->h);
1882 HeaderIterator headerInitIterator(Header h)
1884 HeaderIterator hi = xmalloc(sizeof(*hi));
1888 hi->h = headerLink(h);
1893 int headerNext(HeaderIterator hi, rpmtd td)
1896 int slot = hi->next_index;
1897 indexEntry entry = NULL;
1903 for (slot = hi->next_index; slot < h->indexUsed; slot++) {
1904 entry = h->index + slot;
1905 if (!ENTRY_IS_REGION(entry))
1908 hi->next_index = slot;
1909 if (entry == NULL || slot >= h->indexUsed)
1915 td->tag = entry->info.tag;
1917 rc = copyTdEntry(entry, td, HEADERGET_DEFAULT);
1919 /* XXX 1 on success */
1920 return ((rc == 1) ? 1 : 0);
1923 int headerNextIterator(HeaderIterator hi,
1932 rc = headerNext(hi, &td);
1940 * Duplicate a header.
1942 * @return new header instance
1944 Header headerCopy(Header h)
1946 Header nh = headerNew();
1950 hi = headerInitIterator(h);
1951 while (headerNext(hi, &td)) {
1952 if (rpmtdCount(&td) > 0) {
1953 (void) headerPut(nh, &td, HEADERPUT_DEFAULT);
1957 hi = headerFreeIterator(hi);
1959 return headerReload(nh, HEADER_IMAGE);
1962 void headerCopyTags(Header headerFrom, Header headerTo,
1963 const rpmTag * tagstocopy)
1968 if (headerFrom == headerTo)
1971 for (p = tagstocopy; *p != 0; p++) {
1972 if (headerIsEntry(headerTo, *p))
1974 if (!headerGet(headerFrom, *p, &td, HEADERGET_MINMEM))
1976 (void) headerPut(headerTo, &td, HEADERPUT_DEFAULT);
1981 void * headerFreeData(rpm_data_t data, rpmTagType type)
1984 if (type == RPM_FORCEFREE_TYPE ||
1985 type == RPM_STRING_ARRAY_TYPE ||
1986 type == RPM_I18NSTRING_TYPE ||
1987 type == RPM_BIN_TYPE)
1988 free(data); /* XXX _free() */