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. */
14 #include <rpm/rpmtypes.h>
15 #include <rpm/rpmstring.h>
16 #include "lib/header_internal.h"
17 #include "lib/misc.h" /* tag function proto */
23 const unsigned char rpm_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 */
72 HEADERFLAG_SORTED = (1 << 0), /*!< Are header entries sorted? */
73 HEADERFLAG_ALLOCATED = (1 << 1), /*!< Is 1st header region allocated? */
74 HEADERFLAG_LEGACY = (1 << 2), /*!< Header came from legacy source? */
75 HEADERFLAG_DEBUG = (1 << 3), /*!< Debug this header? */
78 typedef rpmFlags headerFlags;
81 * The Header data structure.
83 struct headerToken_s {
84 void * blob; /*!< Header region blob. */
85 indexEntry index; /*!< Array of tags. */
86 int indexUsed; /*!< Current size of tag array. */
87 int indexAlloced; /*!< Allocated size of tag array. */
88 unsigned int instance; /*!< Rpmdb instance (offset) */
90 int nrefs; /*!< Reference count. */
94 * Maximum no. of bytes permitted in a header.
96 static const size_t headerMaxbytes = (32*1024*1024);
98 #define INDEX_MALLOC_SIZE 8
100 #define ENTRY_IS_REGION(_e) \
101 (((_e)->info.tag >= RPMTAG_HEADERIMAGE) && ((_e)->info.tag < RPMTAG_HEADERREGIONS))
102 #define ENTRY_IN_REGION(_e) ((_e)->info.offset < 0)
104 /* Convert a 64bit value to network byte order. */
106 static uint64_t htonll(uint64_t n)
108 uint32_t *i = (uint32_t*)&n;
115 Header headerLink(Header h)
122 static Header headerUnlink(Header h)
129 Header headerFree(Header h)
131 (void) headerUnlink(h);
133 if (h == NULL || h->nrefs > 0)
137 indexEntry entry = h->index;
139 for (i = 0; i < h->indexUsed; i++, entry++) {
140 if ((h->flags & HEADERFLAG_ALLOCATED) && ENTRY_IS_REGION(entry)) {
141 if (entry->length > 0) {
142 int32_t * ei = entry->data;
143 if ((ei - 2) == h->blob) h->blob = _free(h->blob);
146 } else if (!ENTRY_IN_REGION(entry)) {
147 entry->data = _free(entry->data);
151 h->index = _free(h->index);
158 static Header headerCreate(void *blob, unsigned int pvlen, int32_t indexLen)
160 Header h = xcalloc(1, sizeof(*h));
162 h->blob = (pvlen > 0) ? memcpy(xmalloc(pvlen), blob, pvlen) : blob;
163 h->indexAlloced = indexLen + 1;
164 h->indexUsed = indexLen;
166 h->indexAlloced = INDEX_MALLOC_SIZE;
170 h->flags |= HEADERFLAG_SORTED;
172 h->index = (h->indexAlloced
173 ? xcalloc(h->indexAlloced, sizeof(*h->index))
177 return headerLink(h);
180 Header headerNew(void)
182 return headerCreate(NULL, 0, 0);
185 int headerVerifyInfo(int il, int dl, const void * pev, void * iv, int negate)
187 entryInfo pe = (entryInfo) pev;
191 for (i = 0; i < il; i++) {
192 info->tag = ntohl(pe[i].tag);
193 info->type = ntohl(pe[i].type);
194 info->offset = ntohl(pe[i].offset);
196 info->offset = -info->offset;
197 info->count = ntohl(pe[i].count);
199 if (hdrchkType(info->type))
201 if (hdrchkAlign(info->type, info->offset))
203 if (hdrchkRange(dl, info->offset))
205 if (hdrchkData(info->count))
212 static int indexCmp(const void * avp, const void * bvp)
214 indexEntry ap = (indexEntry) avp, bp = (indexEntry) bvp;
215 return (ap->info.tag - bp->info.tag);
218 void headerSort(Header h)
220 if (!(h->flags & HEADERFLAG_SORTED)) {
221 qsort(h->index, h->indexUsed, sizeof(*h->index), indexCmp);
222 h->flags |= HEADERFLAG_SORTED;
226 static int offsetCmp(const void * avp, const void * bvp)
228 indexEntry ap = (indexEntry) avp, bp = (indexEntry) bvp;
229 int rc = (ap->info.offset - bp->info.offset);
232 /* Within a region, entries sort by address. Added drips sort by tag. */
233 if (ap->info.offset < 0)
234 rc = (((char *)ap->data) - ((char *)bp->data));
236 rc = (ap->info.tag - bp->info.tag);
241 void headerUnsort(Header h)
243 if (h->flags & HEADERFLAG_SORTED) {
244 qsort(h->index, h->indexUsed, sizeof(*h->index), offsetCmp);
245 h->flags &= ~HEADERFLAG_SORTED;
249 static inline unsigned int alignDiff(rpm_tagtype_t type, unsigned int alignsize)
251 int typesize = typeSizes[type];
254 unsigned int diff = typesize - (alignsize % typesize);
255 if (diff != typesize)
261 unsigned headerSizeof(Header h, int magicp)
264 unsigned int size = 0;
273 case HEADER_MAGIC_YES:
274 size += sizeof(rpm_header_magic);
276 case HEADER_MAGIC_NO:
280 size += 2 * sizeof(int32_t); /* count of index entries */
282 for (i = 0, entry = h->index; i < h->indexUsed; i++, entry++) {
283 /* Regions go in as is ... */
284 if (ENTRY_IS_REGION(entry)) {
285 size += entry->length;
286 /* XXX Legacy regions do not include the region tag and data. */
287 if (i == 0 && (h->flags & HEADERFLAG_LEGACY))
288 size += sizeof(struct entryInfo_s) + entry->info.count;
292 /* ... and region elements are skipped. */
293 if (entry->info.offset < 0)
297 size += alignDiff(entry->info.type, size);
299 size += sizeof(struct entryInfo_s) + entry->length;
306 * Header string (array) size calculation, bounded if end is non-NULL.
307 * Return length (including \0 termination) on success, -1 on error.
309 static inline int strtaglen(const char *str, rpm_count_t c, const char *end)
311 const char *start = str;
315 while ((s = memchr(start, '\0', end-start))) {
316 if (--c == 0 || s > end)
321 while ((s = strchr(start, '\0'))) {
327 return (c > 0) ? -1 : (s - str + 1);
331 * Return length of entry data.
332 * @param type entry data type
333 * @param p entry data
334 * @param count entry item count
335 * @param onDisk data is concatenated strings (with NUL's))?
336 * @param pend pointer to end of data (or NULL)
337 * @return no. bytes in data, -1 on failure
339 static int dataLength(rpm_tagtype_t type, rpm_constdata_t p, rpm_count_t count,
340 int onDisk, rpm_constdata_t pend)
343 const char * se = pend;
347 case RPM_STRING_TYPE:
350 length = strtaglen(s, 1, se);
353 case RPM_STRING_ARRAY_TYPE:
354 case RPM_I18NSTRING_TYPE:
355 /* These are like RPM_STRING_TYPE, except they're *always* an array */
356 /* Compute sum of length of all strings, including nul terminators */
359 length = strtaglen(s, count, se);
361 const char ** av = (const char **)p;
363 /* add one for null termination */
364 length += strlen(*av++) + 1;
370 if (typeSizes[type] == -1)
372 length = typeSizes[(type & 0xf)] * count;
373 if (length < 0 || (se && (s + length) > se))
382 * Swap int32_t and int16_t arrays within header region.
384 * If a header region tag is in the set to be swabbed, as the data for a
385 * a header region is located after all other tag data.
387 * @param entry header entry
388 * @param il no. of entries
389 * @param dl start no. bytes of data
390 * @param pe header physical entry pointer (swapped)
391 * @param dataStart header data start
392 * @param dataEnd header data end
393 * @param regionid region offset
394 * @param fast use offsets for data sizes if possible
395 * @return no. bytes of data in region, -1 on error
397 static int regionSwab(indexEntry entry, int il, int dl,
399 unsigned char * dataStart,
400 const unsigned char * dataEnd,
401 int regionid, int fast)
403 if ((entry != NULL && regionid >= 0) || (entry == NULL && regionid != 0))
406 for (; il > 0; il--, pe++) {
407 struct indexEntry_s ie;
409 ie.info.tag = ntohl(pe->tag);
410 ie.info.type = ntohl(pe->type);
411 ie.info.count = ntohl(pe->count);
412 ie.info.offset = ntohl(pe->offset);
414 if (hdrchkType(ie.info.type))
416 if (hdrchkData(ie.info.count))
418 if (hdrchkData(ie.info.offset))
420 if (hdrchkAlign(ie.info.type, ie.info.offset))
423 ie.data = dataStart + ie.info.offset;
424 if (dataEnd && (unsigned char *)ie.data >= dataEnd)
427 if (fast && il > 1) {
428 ie.length = ntohl(pe[1].offset) - ie.info.offset;
430 ie.length = dataLength(ie.info.type, ie.data, ie.info.count,
433 if (ie.length < 0 || hdrchkData(ie.length))
439 ie.info.offset = regionid;
440 *entry = ie; /* structure assignment */
445 dl += alignDiff(ie.info.type, dl);
447 /* Perform endian conversions */
448 switch (ntohl(pe->type)) {
450 { uint64_t * it = ie.data;
451 for (; ie.info.count > 0; ie.info.count--, it += 1) {
452 if (dataEnd && ((unsigned char *)it) >= dataEnd)
458 { int32_t * it = ie.data;
459 for (; ie.info.count > 0; ie.info.count--, it += 1) {
460 if (dataEnd && ((unsigned char *)it) >= dataEnd)
466 { int16_t * it = ie.data;
467 for (; ie.info.count > 0; ie.info.count--, it += 1) {
468 if (dataEnd && ((unsigned char *)it) >= dataEnd)
481 void * headerExport(Header h, unsigned int *bsize)
492 int drlen, ndribbles;
494 if (h == NULL) return NULL;
496 /* Sort entries by (offset,tag). */
499 /* Compute (il,dl) for all tags, including those deleted in region. */
500 drlen = ndribbles = 0;
501 for (i = 0, entry = h->index; i < h->indexUsed; i++, entry++) {
502 if (ENTRY_IS_REGION(entry)) {
503 int32_t rdl = -entry->info.offset; /* negative offset */
504 int32_t ril = rdl/sizeof(*pe);
505 int rid = entry->info.offset;
508 dl += entry->rdlen + entry->info.count;
509 /* XXX Legacy regions do not include the region tag and data. */
510 if (i == 0 && (h->flags & HEADERFLAG_LEGACY))
513 /* Skip rest of entries in region, but account for dribbles. */
514 for (; i < h->indexUsed && entry->info.offset <= rid+1; i++, entry++) {
515 if (entry->info.offset <= rid)
519 diff = alignDiff(entry->info.type, dl);
527 drlen += entry->length;
535 /* Ignore deleted drips. */
536 if (entry->data == NULL || entry->length <= 0)
540 dl += alignDiff(entry->info.type, dl);
546 /* Sanity checks on header intro. */
547 if (hdrchkTags(il) || hdrchkData(dl))
550 len = sizeof(il) + sizeof(dl) + (il * sizeof(*pe)) + dl;
556 pe = (entryInfo) &ei[2];
557 dataStart = te = (char *) (pe + il);
559 for (i = 0, entry = h->index; i < h->indexUsed; i++, entry++) {
566 if (entry->data == NULL || entry->length <= 0)
569 t = (unsigned char*)te;
570 pe->tag = htonl(entry->info.tag);
571 pe->type = htonl(entry->info.type);
572 pe->count = htonl(entry->info.count);
574 if (ENTRY_IS_REGION(entry)) {
575 int32_t rdl = -entry->info.offset; /* negative offset */
576 int32_t ril = rdl/sizeof(*pe) + ndribbles;
577 int rid = entry->info.offset;
579 src = (char *)entry->data;
580 rdlen = entry->rdlen;
582 /* XXX Legacy regions do not include the region tag and data. */
583 if (i == 0 && (h->flags & HEADERFLAG_LEGACY)) {
586 memcpy(pe+1, src, rdl);
587 memcpy(te, src + rdl, rdlen);
590 pe->offset = htonl(te - dataStart);
593 stei[2] = htonl(-rdl-entry->info.count);
595 memcpy(te, stei, entry->info.count);
596 te += entry->info.count;
598 rdlen += entry->info.count;
600 count = regionSwab(NULL, ril, 0, pe, t, NULL, 0, 0);
606 memcpy(pe+1, src + sizeof(*pe), ((ril-1) * sizeof(*pe)));
607 memcpy(te, src + (ril * sizeof(*pe)), rdlen+entry->info.count+drlen);
610 entryInfo se = (entryInfo)src;
611 int off = ntohl(se->offset);
612 pe->offset = (off) ? htonl(te - dataStart) : htonl(off);
614 te += entry->info.count + drlen;
616 count = regionSwab(NULL, ril, 0, pe, t, NULL, 0, 0);
617 if (count != (rdlen + entry->info.count + drlen))
621 /* Skip rest of entries in region. */
622 while (i < h->indexUsed && entry->info.offset <= rid+1) {
632 /* Ignore deleted drips. */
633 if (entry->data == NULL || entry->length <= 0)
637 diff = alignDiff(entry->info.type, (te - dataStart));
643 pe->offset = htonl(te - dataStart);
645 /* copy data w/ endian conversions */
646 switch (entry->info.type) {
648 count = entry->info.count;
651 *((uint64_t *)te) = htonll(*((uint64_t *)src));
652 te += sizeof(uint64_t);
653 src += sizeof(uint64_t);
658 count = entry->info.count;
661 *((int32_t *)te) = htonl(*((int32_t *)src));
662 te += sizeof(int32_t);
663 src += sizeof(int32_t);
668 count = entry->info.count;
671 *((int16_t *)te) = htons(*((int16_t *)src));
672 te += sizeof(int16_t);
673 src += sizeof(int16_t);
678 memcpy(te, entry->data, entry->length);
685 /* Insure that there are no memcpy underruns/overruns. */
686 if (((char *)pe) != dataStart)
688 if ((((char *)ei)+len) != te)
703 void * headerUnload(Header h)
705 return headerExport(h, NULL);
709 * Find matching (tag,type) entry in header.
711 * @param tag entry tag
712 * @param type entry type
713 * @return header entry
716 indexEntry findEntry(Header h, rpmTagVal tag, rpm_tagtype_t type)
719 struct indexEntry_s key;
721 if (h == NULL) return NULL;
722 if (!(h->flags & HEADERFLAG_SORTED)) headerSort(h);
726 entry = bsearch(&key, h->index, h->indexUsed, sizeof(*h->index), indexCmp);
730 if (type == RPM_NULL_TYPE)
734 while (entry->info.tag == tag && entry->info.type != type &&
735 entry > h->index) entry--;
737 if (entry->info.tag == tag && entry->info.type == type)
743 int headerDel(Header h, rpmTagVal tag)
745 indexEntry last = h->index + h->indexUsed;
746 indexEntry entry, first;
749 entry = findEntry(h, tag, RPM_NULL_TYPE);
750 if (!entry) return 1;
752 /* Make sure entry points to the first occurence of this tag. */
753 while (entry > h->index && (entry - 1)->info.tag == tag)
756 /* Free data for tags being removed. */
757 for (first = entry; first < last; first++) {
759 if (first->info.tag != tag)
764 if (ENTRY_IN_REGION(first))
769 ne = (first - entry);
774 memmove(entry, first, (ne * sizeof(*entry)));
780 Header headerImport(void * blob, unsigned int bsize, headerImportFlags flags)
782 const int32_t * ei = (int32_t *) blob;
783 int32_t il = ntohl(ei[0]); /* index length */
784 int32_t dl = ntohl(ei[1]); /* data length */
785 unsigned int pvlen = sizeof(il) + sizeof(dl) +
786 (il * sizeof(struct entryInfo_s)) + dl;;
789 unsigned char * dataStart;
790 unsigned char * dataEnd;
793 int fast = (flags & HEADERIMPORT_FAST);
795 /* Sanity checks on header intro. */
796 if (bsize && bsize != pvlen)
798 if (hdrchkTags(il) || hdrchkData(dl) || pvlen >= headerMaxbytes)
801 h = headerCreate(blob, (flags & HEADERIMPORT_COPY) ? pvlen : 0, il);
803 ei = h->blob; /* In case we had to copy */
804 pe = (entryInfo) &ei[2];
805 dataStart = (unsigned char *) (pe + il);
806 dataEnd = dataStart + dl;
809 if (!(htonl(pe->tag) < RPMTAG_HEADERI18NTABLE)) {
810 h->flags |= HEADERFLAG_LEGACY;
811 entry->info.type = REGION_TAG_TYPE;
812 entry->info.tag = RPMTAG_HEADERIMAGE;
813 entry->info.count = REGION_TAG_COUNT;
814 entry->info.offset = ((unsigned char *)pe - dataStart); /* negative offset */
817 entry->length = pvlen - sizeof(il) - sizeof(dl);
818 rdlen = regionSwab(entry+1, il, 0, pe,
819 dataStart, dataEnd, entry->info.offset, fast);
822 entry->rdlen = rdlen;
828 h->flags &= ~HEADERFLAG_LEGACY;
830 entry->info.type = htonl(pe->type);
831 entry->info.count = htonl(pe->count);
832 entry->info.tag = htonl(pe->tag);
834 if (!ENTRY_IS_REGION(entry))
836 if (entry->info.type != REGION_TAG_TYPE)
838 if (entry->info.count != REGION_TAG_COUNT)
841 { int off = ntohl(pe->offset);
844 size_t nb = REGION_TAG_COUNT;
846 if (hdrchkRange(dl, (off + nb)))
848 /* XXX Hmm, why the copy? */
849 memcpy(&stei, dataStart + off, nb);
850 rdl = -ntohl(stei[2]); /* negative offset */
851 ril = rdl/sizeof(*pe);
852 if (hdrchkTags(ril) || hdrchkData(rdl))
856 rdl = (ril * sizeof(struct entryInfo_s));
857 entry->info.tag = RPMTAG_HEADERIMAGE;
860 entry->info.offset = -rdl; /* negative offset */
863 entry->length = pvlen - sizeof(il) - sizeof(dl);
864 rdlen = regionSwab(entry+1, ril-1, 0, pe+1,
865 dataStart, dataEnd, entry->info.offset, fast);
868 entry->rdlen = rdlen;
870 if (ril < h->indexUsed) {
871 indexEntry newEntry = entry + ril;
872 int ne = (h->indexUsed - ril);
873 int rid = entry->info.offset+1;
875 /* Load dribble entries from region. */
876 rdlen = regionSwab(newEntry, ne, rdlen, pe+ril,
877 dataStart, dataEnd, rid, fast);
881 { indexEntry firstEntry = newEntry;
882 int save = h->indexUsed;
885 /* Dribble entries replace duplicate region entries. */
887 for (j = 0; j < ne; j++, newEntry++) {
888 (void) headerDel(h, newEntry->info.tag);
889 if (newEntry->info.tag == RPMTAG_BASENAMES)
890 (void) headerDel(h, RPMTAG_OLDFILENAMES);
893 /* If any duplicate entries were replaced, move new entries down. */
894 if (h->indexUsed < (save - ne)) {
895 memmove(h->index + h->indexUsed, firstEntry,
896 (ne * sizeof(*entry)));
902 rdlen += REGION_TAG_COUNT;
908 h->flags &= ~HEADERFLAG_SORTED;
910 h->flags |= HEADERFLAG_ALLOCATED;
916 if (flags & HEADERIMPORT_COPY)
924 Header headerReload(Header h, rpmTagVal tag)
928 void * uh = headerExport(h, &uc);
933 nh = headerImport(uh, uc, 0);
938 if (ENTRY_IS_REGION(nh->index)) {
939 if (tag == RPMTAG_HEADERSIGNATURES || tag == RPMTAG_HEADERIMMUTABLE)
940 nh->index[0].info.tag = tag;
945 Header headerLoad(void * uh)
947 return headerImport(uh, 0, 0);
950 Header headerCopyLoad(const void * uh)
952 /* Discards const but that's ok as we'll take a copy */
953 return headerImport((void *)uh, 0, HEADERIMPORT_COPY);
956 Header headerRead(FD_t fd, int magicp)
963 unsigned int len, blen;
965 if (magicp == HEADER_MAGIC_YES) {
968 if (Freadall(fd, block, 4*sizeof(*block)) != 4*sizeof(*block))
973 if (memcmp(&magic, rpm_header_magic, sizeof(magic)))
976 il = ntohl(block[2]);
977 dl = ntohl(block[3]);
979 if (Freadall(fd, block, 2*sizeof(*block)) != 2*sizeof(*block))
982 il = ntohl(block[0]);
983 dl = ntohl(block[1]);
986 blen = (il * sizeof(struct entryInfo_s)) + dl;
987 len = sizeof(il) + sizeof(dl) + blen;
989 /* Sanity checks on header intro. */
990 if (hdrchkTags(il) || hdrchkData(dl) || len > headerMaxbytes)
997 if (Freadall(fd, (char *)&ei[2], blen) != blen)
1000 h = headerImport(ei, len, 0);
1003 if (h == NULL && ei != NULL) {
1009 int headerWrite(FD_t fd, Header h, int magicp)
1012 unsigned int length;
1015 uh = headerExport(h, &length);
1019 case HEADER_MAGIC_YES:
1020 nb = Fwrite(rpm_header_magic, sizeof(uint8_t), sizeof(rpm_header_magic), fd);
1021 if (nb != sizeof(rpm_header_magic))
1024 case HEADER_MAGIC_NO:
1028 nb = Fwrite(uh, sizeof(char), length, fd);
1032 return (nb == length ? 0 : 1);
1035 int headerIsEntry(Header h, rpmTagVal tag)
1037 /* FIX: h modified by sort. */
1038 return (findEntry(h, tag, RPM_NULL_TYPE) ? 1 : 0);
1043 * Retrieve data from header entry.
1044 * Relevant flags (others are ignored), if neither is set allocation
1045 * behavior depends on data type(!)
1046 * HEADERGET_MINMEM: return pointers to header memory
1047 * HEADERGET_ALLOC: always return malloced memory, overrides MINMEM
1049 * @todo Permit retrieval of regions other than HEADER_IMUTABLE.
1050 * @param entry header entry
1051 * @param td tag data container
1052 * @param minMem string pointers refer to header memory?
1053 * @param flags flags to control memory allocation
1054 * @return 1 on success, otherwise error.
1056 static int copyTdEntry(const indexEntry entry, rpmtd td, headerGetFlags flags)
1058 rpm_count_t count = entry->info.count;
1059 int rc = 1; /* XXX 1 on success. */
1060 /* ALLOC overrides MINMEM */
1061 int allocMem = flags & HEADERGET_ALLOC;
1062 int minMem = allocMem ? 0 : flags & HEADERGET_MINMEM;
1063 int argvArray = (flags & HEADERGET_ARGV) ? 1 : 0;
1066 td->flags = RPMTD_IMMUTABLE;
1067 switch (entry->info.type) {
1070 * XXX This only works for
1071 * XXX "sealed" HEADER_IMMUTABLE/HEADER_SIGNATURES/HEADER_IMAGE.
1072 * XXX This will *not* work for unsealed legacy HEADER_IMAGE (i.e.
1073 * XXX a legacy header freshly read, but not yet unloaded to the rpmdb).
1075 if (ENTRY_IS_REGION(entry)) {
1076 int32_t * ei = ((int32_t *)entry->data) - 2;
1077 entryInfo pe = (entryInfo) (ei + 2);
1078 unsigned char * dataStart = (unsigned char *) (pe + ntohl(ei[0]));
1079 int32_t rdl = -entry->info.offset; /* negative offset */
1080 int32_t ril = rdl/sizeof(*pe);
1083 count = 2 * sizeof(*ei) + (ril * sizeof(*pe)) + rdl;
1084 if (entry->info.tag == RPMTAG_HEADERIMAGE) {
1088 count += REGION_TAG_COUNT;
1089 rdl += REGION_TAG_COUNT;
1092 td->data = xmalloc(count);
1093 ei = (int32_t *) td->data;
1097 pe = (entryInfo) memcpy(ei + 2, pe, (ril * sizeof(*pe)));
1099 dataStart = (unsigned char *) memcpy(pe + ril, dataStart, rdl);
1101 rc = regionSwab(NULL, ril, 0, pe, dataStart, dataStart + rdl, 0, 0);
1102 /* don't return data on failure */
1104 td->data = _free(td->data);
1106 /* XXX 1 on success. */
1107 rc = (rc < 0) ? 0 : 1;
1109 count = entry->length;
1111 ? memcpy(xmalloc(count), entry->data, count)
1115 case RPM_STRING_TYPE:
1116 /* simple string, but fallthrough if its actually an array */
1117 if (count == 1 && !argvArray) {
1118 td->data = allocMem ? xstrdup(entry->data) : entry->data;
1121 case RPM_STRING_ARRAY_TYPE:
1122 case RPM_I18NSTRING_TYPE:
1123 { const char ** ptrEntry;
1124 int tableSize = (count + argvArray) * sizeof(char *);
1129 td->data = xmalloc(tableSize);
1130 ptrEntry = (const char **) td->data;
1133 t = xmalloc(tableSize + entry->length);
1134 td->data = (void *)t;
1135 ptrEntry = (const char **) td->data;
1137 memcpy(t, entry->data, entry->length);
1139 for (i = 0; i < count; i++) {
1146 td->flags |= RPMTD_ARGV;
1151 case RPM_INT16_TYPE:
1152 case RPM_INT32_TYPE:
1153 case RPM_INT64_TYPE:
1155 td->data = xmalloc(entry->length);
1156 memcpy(td->data, entry->data, entry->length);
1158 td->data = entry->data;
1162 /* WTH? Don't mess with unknown data types... */
1167 td->type = entry->info.type;
1170 if (td->data && entry->data != td->data) {
1171 td->flags |= RPMTD_ALLOCED;
1178 * Does locale match entry in header i18n table?
1181 * The range [l,le) contains the next locale to match:
1182 * ll[_CC][.EEEEE][@dddd]
1184 * ll ISO language code (in lowercase).
1185 * CC (optional) ISO coutnry code (in uppercase).
1186 * EEEEE (optional) encoding (not really standardized).
1187 * dddd (optional) dialect.
1190 * @param td header i18n table data, NUL terminated
1191 * @param l start of locale to match
1192 * @param le end of locale to match
1193 * @return 1 on good match, 2 on weak match, 0 on no match
1195 static int headerMatchLocale(const char *td, const char *l, const char *le)
1199 /* First try a complete match. */
1200 if (strlen(td) == (le-l) && rstreqn(td, l, (le - l)))
1203 /* Next, try stripping optional dialect and matching. */
1204 for (fe = l; fe < le && *fe != '@'; fe++)
1206 if (fe < le && rstreqn(td, l, (fe - l)))
1209 /* Next, try stripping optional codeset and matching. */
1210 for (fe = l; fe < le && *fe != '.'; fe++)
1212 if (fe < le && rstreqn(td, l, (fe - l)))
1215 /* Finally, try stripping optional country code and matching. */
1216 for (fe = l; fe < le && *fe != '_'; fe++)
1218 if (fe < le && rstreqn(td, l, (fe - l)))
1225 * Return i18n string from header that matches locale.
1227 * @param entry i18n string data
1228 * @retval td tag data container
1229 * @param flags flags to control allocation
1232 static int copyI18NEntry(Header h, indexEntry entry, rpmtd td,
1233 headerGetFlags flags)
1235 const char *lang, *l, *le;
1238 td->type = RPM_STRING_TYPE;
1240 /* if no match, just return the first string */
1241 td->data = entry->data;
1243 /* XXX Drepper sez' this is the order. */
1244 if ((lang = getenv("LANGUAGE")) == NULL &&
1245 (lang = getenv("LC_ALL")) == NULL &&
1246 (lang = getenv("LC_MESSAGES")) == NULL &&
1247 (lang = getenv("LANG")) == NULL)
1250 if ((table = findEntry(h, RPMTAG_HEADERI18NTABLE, RPM_STRING_ARRAY_TYPE)) == NULL)
1253 for (l = lang; *l != '\0'; l = le) {
1255 char *ed, *ed_weak = NULL;
1258 while (*l && *l == ':') /* skip leading colons */
1262 for (le = l; *le && *le != ':'; le++) /* find end of this locale */
1265 /* For each entry in the header ... */
1266 for (langNum = 0, t = table->data, ed = entry->data;
1267 langNum < entry->info.count;
1268 langNum++, t += strlen(t) + 1, ed += strlen(ed) + 1) {
1270 int match = headerMatchLocale(t, l, le);
1274 } else if (match == 2) {
1285 if (flags & HEADERGET_ALLOC) {
1286 td->data = xstrdup(td->data);
1287 td->flags |= RPMTD_ALLOCED;
1294 * Retrieve tag data from header.
1296 * @retval td tag data container
1297 * @param flags flags to control retrieval
1298 * @return 1 on success, 0 on not found
1300 static int intGetTdEntry(Header h, rpmtd td, headerGetFlags flags)
1305 /* First find the tag */
1306 /* FIX: h modified by sort. */
1307 entry = findEntry(h, td->tag, RPM_NULL_TYPE);
1308 if (entry == NULL) {
1309 /* Td is zeroed above, just return... */
1313 if (flags & HEADERGET_RAW) {
1314 rc = copyTdEntry(entry, td, flags);
1316 switch (entry->info.type) {
1317 case RPM_I18NSTRING_TYPE:
1318 rc = copyI18NEntry(h, entry, td, flags);
1321 rc = copyTdEntry(entry, td, flags);
1327 td->flags |= RPMTD_INVALID;
1329 /* XXX 1 on success */
1330 return ((rc == 1) ? 1 : 0);
1333 int headerGet(Header h, rpmTagVal tag, rpmtd td, headerGetFlags flags)
1336 headerTagTagFunction tagfunc = intGetTdEntry;
1338 if (td == NULL) return 0;
1343 if (flags & HEADERGET_EXT) {
1344 headerTagTagFunction extfunc = rpmHeaderTagFunc(tag);
1345 if (extfunc) tagfunc = extfunc;
1347 rc = tagfunc(h, td, flags);
1349 assert(tag == td->tag);
1355 static void copyData(rpm_tagtype_t type, rpm_data_t dstPtr,
1356 rpm_constdata_t srcPtr, rpm_count_t cnt, int dataLength)
1359 case RPM_STRING_ARRAY_TYPE:
1360 case RPM_I18NSTRING_TYPE:
1361 { const char ** av = (const char **) srcPtr;
1364 while (cnt-- > 0 && dataLength > 0) {
1366 if ((s = *av++) == NULL)
1370 } while (s[-1] && --dataLength > 0);
1375 memmove(dstPtr, srcPtr, dataLength);
1381 * Return (malloc'ed) copy of entry data.
1382 * @param type entry data type
1383 * @param p entry data
1384 * @param c entry item count
1385 * @retval lengthPtr no. bytes in returned data
1386 * @return (malloc'ed) copy of entry data, NULL on error
1389 grabData(rpm_tagtype_t type, rpm_constdata_t p, rpm_count_t c, int * lengthPtr)
1391 rpm_data_t data = NULL;
1394 length = dataLength(type, p, c, 0, NULL);
1396 data = xmalloc(length);
1397 copyData(type, data, p, c, length);
1401 *lengthPtr = length;
1405 static int intAddEntry(Header h, rpmtd td)
1411 /* Count must always be >= 1 for headerAddEntry. */
1415 if (hdrchkType(td->type))
1417 if (hdrchkData(td->count))
1420 data = grabData(td->type, td->data, td->count, &length);
1424 /* Allocate more index space if necessary */
1425 if (h->indexUsed == h->indexAlloced) {
1426 h->indexAlloced += INDEX_MALLOC_SIZE;
1427 h->index = xrealloc(h->index, h->indexAlloced * sizeof(*h->index));
1430 /* Fill in the index */
1431 entry = h->index + h->indexUsed;
1432 entry->info.tag = td->tag;
1433 entry->info.type = td->type;
1434 entry->info.count = td->count;
1435 entry->info.offset = 0;
1437 entry->length = length;
1439 if (h->indexUsed > 0 && td->tag < h->index[h->indexUsed-1].info.tag)
1440 h->flags &= ~HEADERFLAG_SORTED;
1446 static int intAppendEntry(Header h, rpmtd td)
1451 if (td->type == RPM_STRING_TYPE || td->type == RPM_I18NSTRING_TYPE) {
1452 /* we can't do this */
1456 /* Find the tag entry in the header. */
1457 entry = findEntry(h, td->tag, td->type);
1461 length = dataLength(td->type, td->data, td->count, 0, NULL);
1465 if (ENTRY_IN_REGION(entry)) {
1466 char * t = xmalloc(entry->length + length);
1467 memcpy(t, entry->data, entry->length);
1469 entry->info.offset = 0;
1471 entry->data = xrealloc(entry->data, entry->length + length);
1473 copyData(td->type, ((char *) entry->data) + entry->length,
1474 td->data, td->count, length);
1476 entry->length += length;
1478 entry->info.count += td->count;
1483 int headerPut(Header h, rpmtd td, headerPutFlags flags)
1488 if (flags & HEADERPUT_APPEND) {
1489 rc = findEntry(h, td->tag, td->type) ?
1490 intAppendEntry(h, td) :
1493 rc = intAddEntry(h, td);
1498 int headerAddI18NString(Header h, rpmTagVal tag, const char * string,
1501 indexEntry table, entry;
1502 const char ** strArray;
1505 rpm_count_t i, langNum;
1508 table = findEntry(h, RPMTAG_HEADERI18NTABLE, RPM_STRING_ARRAY_TYPE);
1509 entry = findEntry(h, tag, RPM_I18NSTRING_TYPE);
1511 if (!table && entry)
1512 return 0; /* this shouldn't ever happen!! */
1514 if (!table && !entry) {
1515 const char * charArray[2];
1516 rpm_count_t count = 0;
1518 if (!lang || (lang[0] == 'C' && lang[1] == '\0')) {
1519 charArray[count++] = "C";
1521 charArray[count++] = "C";
1522 charArray[count++] = lang;
1526 td.tag = RPMTAG_HEADERI18NTABLE;
1527 td.type = RPM_STRING_ARRAY_TYPE;
1528 td.data = (void *) charArray;
1530 if (!headerPut(h, &td, HEADERPUT_DEFAULT))
1532 table = findEntry(h, RPMTAG_HEADERI18NTABLE, RPM_STRING_ARRAY_TYPE);
1537 if (!lang) lang = "C";
1539 { const char * l = table->data;
1540 for (langNum = 0; langNum < table->info.count; langNum++) {
1541 if (rstreq(l, lang)) break;
1546 if (langNum >= table->info.count) {
1547 length = strlen(lang) + 1;
1548 if (ENTRY_IN_REGION(table)) {
1549 char * t = xmalloc(table->length + length);
1550 memcpy(t, table->data, table->length);
1552 table->info.offset = 0;
1554 table->data = xrealloc(table->data, table->length + length);
1555 memmove(((char *)table->data) + table->length, lang, length);
1556 table->length += length;
1557 table->info.count++;
1563 strArray = xmalloc(sizeof(*strArray) * (langNum + 1));
1564 for (i = 0; i < langNum; i++)
1566 strArray[langNum] = string;
1570 td.type = RPM_I18NSTRING_TYPE;
1572 td.count = langNum + 1;
1573 rc = headerPut(h, &td, HEADERPUT_DEFAULT);
1576 } else if (langNum >= entry->info.count) {
1577 ghosts = langNum - entry->info.count;
1579 length = strlen(string) + 1 + ghosts;
1580 if (ENTRY_IN_REGION(entry)) {
1581 char * t = xmalloc(entry->length + length);
1582 memcpy(t, entry->data, entry->length);
1584 entry->info.offset = 0;
1586 entry->data = xrealloc(entry->data, entry->length + length);
1588 memset(((char *)entry->data) + entry->length, '\0', ghosts);
1589 memmove(((char *)entry->data) + entry->length + ghosts, string, strlen(string)+1);
1591 entry->length += length;
1592 entry->info.count = langNum + 1;
1594 char *b, *be, *e, *ee, *t;
1597 /* Set beginning/end pointers to previous data */
1598 b = be = e = ee = entry->data;
1599 for (i = 0; i < table->info.count; i++) {
1602 ee += strlen(ee) + 1;
1607 /* Get storage for new buffer */
1609 sn = strlen(string) + 1;
1611 length = bn + sn + en;
1612 t = buf = xmalloc(length);
1614 /* Copy values into new storage */
1617 memcpy(t, string, sn);
1622 /* Replace i18N string array */
1623 entry->length -= strlen(be) + 1;
1624 entry->length += sn;
1626 if (ENTRY_IN_REGION(entry)) {
1627 entry->info.offset = 0;
1629 entry->data = _free(entry->data);
1636 int headerMod(Header h, rpmtd td)
1643 /* First find the tag */
1644 entry = findEntry(h, td->tag, td->type);
1648 data = grabData(td->type, td->data, td->count, &length);
1652 /* make sure entry points to the first occurence of this tag */
1653 while (entry > h->index && (entry - 1)->info.tag == td->tag)
1656 /* free after we've grabbed the new data in case the two are intertwined;
1657 that's a bad idea but at least we won't break */
1658 oldData = entry->data;
1660 entry->info.count = td->count;
1661 entry->info.type = td->type;
1663 entry->length = length;
1665 if (ENTRY_IN_REGION(entry)) {
1666 entry->info.offset = 0;
1674 * Header tag iterator data structure.
1676 struct headerIterator_s {
1677 Header h; /*!< Header being iterated. */
1678 int next_index; /*!< Next tag index. */
1681 HeaderIterator headerFreeIterator(HeaderIterator hi)
1684 hi->h = headerFree(hi->h);
1690 HeaderIterator headerInitIterator(Header h)
1692 HeaderIterator hi = xmalloc(sizeof(*hi));
1696 hi->h = headerLink(h);
1701 static indexEntry nextIndex(HeaderIterator hi)
1705 indexEntry entry = NULL;
1707 for (slot = hi->next_index; slot < h->indexUsed; slot++) {
1708 entry = h->index + slot;
1709 if (!ENTRY_IS_REGION(entry))
1712 hi->next_index = slot;
1713 if (entry == NULL || slot >= h->indexUsed)
1720 rpmTagVal headerNextTag(HeaderIterator hi)
1722 indexEntry entry = nextIndex(hi);
1723 return entry ? entry->info.tag : RPMTAG_NOT_FOUND;
1726 int headerNext(HeaderIterator hi, rpmtd td)
1728 indexEntry entry = nextIndex(hi);
1733 td->tag = entry->info.tag;
1734 rc = copyTdEntry(entry, td, HEADERGET_DEFAULT);
1736 return ((rc == 1) ? 1 : 0);
1739 unsigned int headerGetInstance(Header h)
1741 return h ? h->instance : 0;
1744 void headerSetInstance(Header h, unsigned int instance)
1746 h->instance = instance;
1749 #define RETRY_ERROR(_err) \
1750 ((_err) == EINTR || (_err) == EAGAIN || (_err) == EWOULDBLOCK)
1752 ssize_t Freadall(FD_t fd, void * buf, ssize_t size)
1758 while (total < size) {
1759 nb = Fread(bufp, 1, size - total, fd);
1761 if (nb == 0 || (nb < 0 && !RETRY_ERROR(errno))) {