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 */
24 const unsigned char rpm_header_magic[8] = {
25 0x8e, 0xad, 0xe8, 0x01, 0x00, 0x00, 0x00, 0x00
29 * Alignment needed for header data types.
31 static const int typeAlign[16] = {
32 1, /*!< RPM_NULL_TYPE */
33 1, /*!< RPM_CHAR_TYPE */
34 1, /*!< RPM_INT8_TYPE */
35 2, /*!< RPM_INT16_TYPE */
36 4, /*!< RPM_INT32_TYPE */
37 8, /*!< RPM_INT64_TYPE */
38 1, /*!< RPM_STRING_TYPE */
39 1, /*!< RPM_BIN_TYPE */
40 1, /*!< RPM_STRING_ARRAY_TYPE */
41 1, /*!< RPM_I18NSTRING_TYPE */
51 * Size of header data types.
53 static const int typeSizes[16] = {
54 0, /*!< RPM_NULL_TYPE */
55 1, /*!< RPM_CHAR_TYPE */
56 1, /*!< RPM_INT8_TYPE */
57 2, /*!< RPM_INT16_TYPE */
58 4, /*!< RPM_INT32_TYPE */
59 8, /*!< RPM_INT64_TYPE */
60 -1, /*!< RPM_STRING_TYPE */
61 1, /*!< RPM_BIN_TYPE */
62 -1, /*!< RPM_STRING_ARRAY_TYPE */
63 -1, /*!< RPM_I18NSTRING_TYPE */
73 HEADERFLAG_SORTED = (1 << 0), /*!< Are header entries sorted? */
74 HEADERFLAG_ALLOCATED = (1 << 1), /*!< Is 1st header region allocated? */
75 HEADERFLAG_LEGACY = (1 << 2), /*!< Header came from legacy source? */
76 HEADERFLAG_DEBUG = (1 << 3), /*!< Debug this header? */
79 typedef rpmFlags headerFlags;
82 * The Header data structure.
84 struct headerToken_s {
85 void * blob; /*!< Header region blob. */
86 indexEntry index; /*!< Array of tags. */
87 int indexUsed; /*!< Current size of tag array. */
88 int indexAlloced; /*!< Allocated size of tag array. */
89 unsigned int instance; /*!< Rpmdb instance (offset) */
91 int nrefs; /*!< Reference count. */
95 * Maximum no. of bytes permitted in a header.
97 static const size_t headerMaxbytes = (32*1024*1024);
99 #define INDEX_MALLOC_SIZE 8
101 #define ENTRY_IS_REGION(_e) \
102 (((_e)->info.tag >= RPMTAG_HEADERIMAGE) && ((_e)->info.tag < RPMTAG_HEADERREGIONS))
103 #define ENTRY_IN_REGION(_e) ((_e)->info.offset < 0)
105 /* Convert a 64bit value to network byte order. */
107 static uint64_t htonll(uint64_t n)
109 uint32_t *i = (uint32_t*)&n;
116 Header headerLink(Header h)
123 static Header headerUnlink(Header h)
130 Header headerFree(Header h)
132 (void) headerUnlink(h);
134 if (h == NULL || h->nrefs > 0)
138 indexEntry entry = h->index;
140 for (i = 0; i < h->indexUsed; i++, entry++) {
141 if ((h->flags & HEADERFLAG_ALLOCATED) && ENTRY_IS_REGION(entry)) {
142 if (entry->length > 0) {
143 int32_t * ei = entry->data;
144 if ((ei - 2) == h->blob) h->blob = _free(h->blob);
147 } else if (!ENTRY_IN_REGION(entry)) {
148 entry->data = _free(entry->data);
152 h->index = _free(h->index);
159 static Header headerCreate(void *blob, unsigned int pvlen, int32_t indexLen)
161 Header h = xcalloc(1, sizeof(*h));
163 h->blob = (pvlen > 0) ? memcpy(xmalloc(pvlen), blob, pvlen) : blob;
164 h->indexAlloced = indexLen + 1;
165 h->indexUsed = indexLen;
167 h->indexAlloced = INDEX_MALLOC_SIZE;
171 h->flags |= HEADERFLAG_SORTED;
173 h->index = (h->indexAlloced
174 ? xcalloc(h->indexAlloced, sizeof(*h->index))
178 return headerLink(h);
181 Header headerNew(void)
183 return headerCreate(NULL, 0, 0);
186 int headerVerifyInfo(int il, int dl, const void * pev, void * iv, int negate)
188 entryInfo pe = (entryInfo) pev;
192 for (i = 0; i < il; i++) {
193 info->tag = ntohl(pe[i].tag);
194 info->type = ntohl(pe[i].type);
195 info->offset = ntohl(pe[i].offset);
197 info->offset = -info->offset;
198 info->count = ntohl(pe[i].count);
200 if (hdrchkType(info->type))
202 if (hdrchkAlign(info->type, info->offset))
204 if (hdrchkRange(dl, info->offset))
206 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;
227 static int offsetCmp(const void * avp, const void * bvp)
229 indexEntry ap = (indexEntry) avp, bp = (indexEntry) bvp;
230 int rc = (ap->info.offset - bp->info.offset);
233 /* Within a region, entries sort by address. Added drips sort by tag. */
234 if (ap->info.offset < 0)
235 rc = (((char *)ap->data) - ((char *)bp->data));
237 rc = (ap->info.tag - bp->info.tag);
242 void headerUnsort(Header h)
244 if (h->flags & HEADERFLAG_SORTED) {
245 qsort(h->index, h->indexUsed, sizeof(*h->index), offsetCmp);
246 h->flags &= ~HEADERFLAG_SORTED;
250 static inline unsigned int alignDiff(rpm_tagtype_t type, unsigned int alignsize)
252 int typesize = typeSizes[type];
255 unsigned int diff = typesize - (alignsize % typesize);
256 if (diff != typesize)
262 unsigned headerSizeof(Header h, int magicp)
265 unsigned int size = 0;
274 case HEADER_MAGIC_YES:
275 size += sizeof(rpm_header_magic);
277 case HEADER_MAGIC_NO:
281 size += 2 * sizeof(int32_t); /* count of index entries */
283 for (i = 0, entry = h->index; i < h->indexUsed; i++, entry++) {
284 /* Regions go in as is ... */
285 if (ENTRY_IS_REGION(entry)) {
286 size += entry->length;
287 /* XXX Legacy regions do not include the region tag and data. */
288 if (i == 0 && (h->flags & HEADERFLAG_LEGACY))
289 size += sizeof(struct entryInfo_s) + entry->info.count;
293 /* ... and region elements are skipped. */
294 if (entry->info.offset < 0)
298 size += alignDiff(entry->info.type, size);
300 size += sizeof(struct entryInfo_s) + entry->length;
307 * Header string (array) size calculation, bounded if end is non-NULL.
308 * Return length (including \0 termination) on success, -1 on error.
310 static inline int strtaglen(const char *str, rpm_count_t c, const char *end)
312 const char *start = str;
316 while ((s = memchr(start, '\0', end-start))) {
317 if (--c == 0 || s > end)
322 while ((s = strchr(start, '\0'))) {
328 return (c > 0) ? -1 : (s - str + 1);
332 * Return length of entry data.
333 * @param type entry data type
334 * @param p entry data
335 * @param count entry item count
336 * @param onDisk data is concatenated strings (with NUL's))?
337 * @param pend pointer to end of data (or NULL)
338 * @return no. bytes in data, -1 on failure
340 static int dataLength(rpm_tagtype_t type, rpm_constdata_t p, rpm_count_t count,
341 int onDisk, rpm_constdata_t pend)
344 const char * se = pend;
348 case RPM_STRING_TYPE:
351 length = strtaglen(s, 1, se);
354 case RPM_STRING_ARRAY_TYPE:
355 case RPM_I18NSTRING_TYPE:
356 /* These are like RPM_STRING_TYPE, except they're *always* an array */
357 /* Compute sum of length of all strings, including nul terminators */
360 length = strtaglen(s, count, se);
362 const char ** av = (const char **)p;
364 /* add one for null termination */
365 length += strlen(*av++) + 1;
371 if (typeSizes[type] == -1)
373 length = typeSizes[(type & 0xf)] * count;
374 if (length < 0 || (se && (s + length) > se))
383 * Swap int32_t and int16_t arrays within header region.
385 * If a header region tag is in the set to be swabbed, as the data for a
386 * a header region is located after all other tag data.
388 * @param entry header entry
389 * @param il no. of entries
390 * @param dl start no. bytes of data
391 * @param pe header physical entry pointer (swapped)
392 * @param dataStart header data start
393 * @param dataEnd header data end
394 * @param regionid region offset
395 * @param fast use offsets for data sizes if possible
396 * @return no. bytes of data in region, -1 on error
398 static int regionSwab(indexEntry entry, int il, int dl,
400 unsigned char * dataStart,
401 const unsigned char * dataEnd,
402 int regionid, int fast)
404 if ((entry != NULL && regionid >= 0) || (entry == NULL && regionid != 0))
407 for (; il > 0; il--, pe++) {
408 struct indexEntry_s ie;
410 ie.info.tag = ntohl(pe->tag);
411 ie.info.type = ntohl(pe->type);
412 ie.info.count = ntohl(pe->count);
413 ie.info.offset = ntohl(pe->offset);
415 if (hdrchkType(ie.info.type))
417 if (hdrchkData(ie.info.count))
419 if (hdrchkData(ie.info.offset))
421 if (hdrchkAlign(ie.info.type, ie.info.offset))
424 ie.data = dataStart + ie.info.offset;
425 if (dataEnd && (unsigned char *)ie.data >= dataEnd)
428 if (fast && il > 1) {
429 ie.length = ntohl(pe[1].offset) - ie.info.offset;
431 ie.length = dataLength(ie.info.type, ie.data, ie.info.count,
434 if (ie.length < 0 || hdrchkData(ie.length))
440 ie.info.offset = regionid;
441 *entry = ie; /* structure assignment */
446 dl += alignDiff(ie.info.type, dl);
448 /* Perform endian conversions */
449 switch (ntohl(pe->type)) {
451 { uint64_t * it = ie.data;
452 for (; ie.info.count > 0; ie.info.count--, it += 1) {
453 if (dataEnd && ((unsigned char *)it) >= dataEnd)
459 { int32_t * it = ie.data;
460 for (; ie.info.count > 0; ie.info.count--, it += 1) {
461 if (dataEnd && ((unsigned char *)it) >= dataEnd)
467 { int16_t * it = ie.data;
468 for (; ie.info.count > 0; ie.info.count--, it += 1) {
469 if (dataEnd && ((unsigned char *)it) >= dataEnd)
482 void * headerExport(Header h, unsigned int *bsize)
493 int drlen, ndribbles;
495 if (h == NULL) return NULL;
497 /* Sort entries by (offset,tag). */
500 /* Compute (il,dl) for all tags, including those deleted in region. */
501 drlen = ndribbles = 0;
502 for (i = 0, entry = h->index; i < h->indexUsed; i++, entry++) {
503 if (ENTRY_IS_REGION(entry)) {
504 int32_t rdl = -entry->info.offset; /* negative offset */
505 int32_t ril = rdl/sizeof(*pe);
506 int rid = entry->info.offset;
509 dl += entry->rdlen + entry->info.count;
510 /* XXX Legacy regions do not include the region tag and data. */
511 if (i == 0 && (h->flags & HEADERFLAG_LEGACY))
514 /* Skip rest of entries in region, but account for dribbles. */
515 for (; i < h->indexUsed && entry->info.offset <= rid+1; i++, entry++) {
516 if (entry->info.offset <= rid)
520 diff = alignDiff(entry->info.type, dl);
528 drlen += entry->length;
536 /* Ignore deleted drips. */
537 if (entry->data == NULL || entry->length <= 0)
541 dl += alignDiff(entry->info.type, dl);
547 /* Sanity checks on header intro. */
548 if (hdrchkTags(il) || hdrchkData(dl))
551 len = sizeof(il) + sizeof(dl) + (il * sizeof(*pe)) + dl;
557 pe = (entryInfo) &ei[2];
558 dataStart = te = (char *) (pe + il);
560 for (i = 0, entry = h->index; i < h->indexUsed; i++, entry++) {
567 if (entry->data == NULL || entry->length <= 0)
570 t = (unsigned char*)te;
571 pe->tag = htonl(entry->info.tag);
572 pe->type = htonl(entry->info.type);
573 pe->count = htonl(entry->info.count);
575 if (ENTRY_IS_REGION(entry)) {
576 int32_t rdl = -entry->info.offset; /* negative offset */
577 int32_t ril = rdl/sizeof(*pe) + ndribbles;
578 int rid = entry->info.offset;
580 src = (char *)entry->data;
581 rdlen = entry->rdlen;
583 /* XXX Legacy regions do not include the region tag and data. */
584 if (i == 0 && (h->flags & HEADERFLAG_LEGACY)) {
587 memcpy(pe+1, src, rdl);
588 memcpy(te, src + rdl, rdlen);
591 pe->offset = htonl(te - dataStart);
594 stei[2] = htonl(-rdl-entry->info.count);
596 memcpy(te, stei, entry->info.count);
597 te += entry->info.count;
599 rdlen += entry->info.count;
601 count = regionSwab(NULL, ril, 0, pe, t, NULL, 0, 0);
607 memcpy(pe+1, src + sizeof(*pe), ((ril-1) * sizeof(*pe)));
608 memcpy(te, src + (ril * sizeof(*pe)), rdlen+entry->info.count+drlen);
611 entryInfo se = (entryInfo)src;
612 int off = ntohl(se->offset);
613 pe->offset = (off) ? htonl(te - dataStart) : htonl(off);
615 te += entry->info.count + drlen;
617 count = regionSwab(NULL, ril, 0, pe, t, NULL, 0, 0);
618 if (count != (rdlen + entry->info.count + drlen))
622 /* Skip rest of entries in region. */
623 while (i < h->indexUsed && entry->info.offset <= rid+1) {
633 /* Ignore deleted drips. */
634 if (entry->data == NULL || entry->length <= 0)
638 diff = alignDiff(entry->info.type, (te - dataStart));
644 pe->offset = htonl(te - dataStart);
646 /* copy data w/ endian conversions */
647 switch (entry->info.type) {
649 count = entry->info.count;
652 *((uint64_t *)te) = htonll(*((uint64_t *)src));
653 te += sizeof(uint64_t);
654 src += sizeof(uint64_t);
659 count = entry->info.count;
662 *((int32_t *)te) = htonl(*((int32_t *)src));
663 te += sizeof(int32_t);
664 src += sizeof(int32_t);
669 count = entry->info.count;
672 *((int16_t *)te) = htons(*((int16_t *)src));
673 te += sizeof(int16_t);
674 src += sizeof(int16_t);
679 memcpy(te, entry->data, entry->length);
686 /* Insure that there are no memcpy underruns/overruns. */
687 if (((char *)pe) != dataStart)
689 if ((((char *)ei)+len) != te)
704 void * headerUnload(Header h)
706 return headerExport(h, NULL);
710 * Find matching (tag,type) entry in header.
712 * @param tag entry tag
713 * @param type entry type
714 * @return header entry
717 indexEntry findEntry(Header h, rpmTagVal tag, rpm_tagtype_t type)
720 struct indexEntry_s key;
722 if (h == NULL) return NULL;
723 if (!(h->flags & HEADERFLAG_SORTED)) headerSort(h);
727 entry = bsearch(&key, h->index, h->indexUsed, sizeof(*h->index), indexCmp);
731 if (type == RPM_NULL_TYPE)
735 while (entry->info.tag == tag && entry->info.type != type &&
736 entry > h->index) entry--;
738 if (entry->info.tag == tag && entry->info.type == type)
744 int headerDel(Header h, rpmTagVal tag)
746 indexEntry last = h->index + h->indexUsed;
747 indexEntry entry, first;
750 entry = findEntry(h, tag, RPM_NULL_TYPE);
751 if (!entry) return 1;
753 /* Make sure entry points to the first occurence of this tag. */
754 while (entry > h->index && (entry - 1)->info.tag == tag)
757 /* Free data for tags being removed. */
758 for (first = entry; first < last; first++) {
760 if (first->info.tag != tag)
765 if (ENTRY_IN_REGION(first))
770 ne = (first - entry);
775 memmove(entry, first, (ne * sizeof(*entry)));
781 Header headerImport(void * blob, unsigned int bsize, headerImportFlags flags)
783 const int32_t * ei = (int32_t *) blob;
784 int32_t il = ntohl(ei[0]); /* index length */
785 int32_t dl = ntohl(ei[1]); /* data length */
786 unsigned int pvlen = sizeof(il) + sizeof(dl) +
787 (il * sizeof(struct entryInfo_s)) + dl;;
790 unsigned char * dataStart;
791 unsigned char * dataEnd;
794 int fast = (flags & HEADERIMPORT_FAST);
796 /* Sanity checks on header intro. */
797 if (bsize && bsize != pvlen)
799 if (hdrchkTags(il) || hdrchkData(dl) || pvlen >= headerMaxbytes)
802 h = headerCreate(blob, (flags & HEADERIMPORT_COPY) ? pvlen : 0, il);
804 ei = h->blob; /* In case we had to copy */
805 pe = (entryInfo) &ei[2];
806 dataStart = (unsigned char *) (pe + il);
807 dataEnd = dataStart + dl;
810 if (!(htonl(pe->tag) < RPMTAG_HEADERI18NTABLE)) {
811 h->flags |= HEADERFLAG_LEGACY;
812 entry->info.type = REGION_TAG_TYPE;
813 entry->info.tag = RPMTAG_HEADERIMAGE;
814 entry->info.count = REGION_TAG_COUNT;
815 entry->info.offset = ((unsigned char *)pe - dataStart); /* negative offset */
818 entry->length = pvlen - sizeof(il) - sizeof(dl);
819 rdlen = regionSwab(entry+1, il, 0, pe,
820 dataStart, dataEnd, entry->info.offset, fast);
823 entry->rdlen = rdlen;
829 h->flags &= ~HEADERFLAG_LEGACY;
831 entry->info.type = htonl(pe->type);
832 entry->info.count = htonl(pe->count);
833 entry->info.tag = htonl(pe->tag);
835 if (!ENTRY_IS_REGION(entry))
837 if (entry->info.type != REGION_TAG_TYPE)
839 if (entry->info.count != REGION_TAG_COUNT)
842 { int off = ntohl(pe->offset);
845 size_t nb = REGION_TAG_COUNT;
847 if (hdrchkRange(dl, (off + nb)))
849 /* XXX Hmm, why the copy? */
850 memcpy(&stei, dataStart + off, nb);
851 rdl = -ntohl(stei[2]); /* negative offset */
852 ril = rdl/sizeof(*pe);
853 if (hdrchkTags(ril) || hdrchkData(rdl))
857 rdl = (ril * sizeof(struct entryInfo_s));
858 entry->info.tag = RPMTAG_HEADERIMAGE;
861 entry->info.offset = -rdl; /* negative offset */
864 entry->length = pvlen - sizeof(il) - sizeof(dl);
865 rdlen = regionSwab(entry+1, ril-1, 0, pe+1,
866 dataStart, dataEnd, entry->info.offset, fast);
869 entry->rdlen = rdlen;
871 if (ril < h->indexUsed) {
872 indexEntry newEntry = entry + ril;
873 int ne = (h->indexUsed - ril);
874 int rid = entry->info.offset+1;
876 /* Load dribble entries from region. */
877 rdlen = regionSwab(newEntry, ne, rdlen, pe+ril,
878 dataStart, dataEnd, rid, fast);
882 { indexEntry firstEntry = newEntry;
883 int save = h->indexUsed;
886 /* Dribble entries replace duplicate region entries. */
888 for (j = 0; j < ne; j++, newEntry++) {
889 (void) headerDel(h, newEntry->info.tag);
890 if (newEntry->info.tag == RPMTAG_BASENAMES)
891 (void) headerDel(h, RPMTAG_OLDFILENAMES);
894 /* If any duplicate entries were replaced, move new entries down. */
895 if (h->indexUsed < (save - ne)) {
896 memmove(h->index + h->indexUsed, firstEntry,
897 (ne * sizeof(*entry)));
903 rdlen += REGION_TAG_COUNT;
909 h->flags &= ~HEADERFLAG_SORTED;
911 h->flags |= HEADERFLAG_ALLOCATED;
917 if (flags & HEADERIMPORT_COPY)
925 Header headerReload(Header h, rpmTagVal tag)
929 void * uh = headerExport(h, &uc);
934 nh = headerImport(uh, uc, 0);
939 if (ENTRY_IS_REGION(nh->index)) {
940 if (tag == RPMTAG_HEADERSIGNATURES || tag == RPMTAG_HEADERIMMUTABLE)
941 nh->index[0].info.tag = tag;
946 Header headerLoad(void * uh)
948 return headerImport(uh, 0, 0);
951 Header headerCopyLoad(const void * uh)
953 /* Discards const but that's ok as we'll take a copy */
954 return headerImport((void *)uh, 0, HEADERIMPORT_COPY);
957 Header headerRead(FD_t fd, int magicp)
964 unsigned int len, blen;
966 if (magicp == HEADER_MAGIC_YES) {
969 if (Freadall(fd, block, 4*sizeof(*block)) != 4*sizeof(*block))
974 if (memcmp(&magic, rpm_header_magic, sizeof(magic)))
977 il = ntohl(block[2]);
978 dl = ntohl(block[3]);
980 if (Freadall(fd, block, 2*sizeof(*block)) != 2*sizeof(*block))
983 il = ntohl(block[0]);
984 dl = ntohl(block[1]);
987 blen = (il * sizeof(struct entryInfo_s)) + dl;
988 len = sizeof(il) + sizeof(dl) + blen;
990 /* Sanity checks on header intro. */
991 if (hdrchkTags(il) || hdrchkData(dl) || len > headerMaxbytes)
998 if (Freadall(fd, (char *)&ei[2], blen) != blen)
1001 h = headerImport(ei, len, 0);
1004 if (h == NULL && ei != NULL) {
1010 int headerWrite(FD_t fd, Header h, int magicp)
1013 unsigned int length;
1016 uh = headerExport(h, &length);
1020 case HEADER_MAGIC_YES:
1021 nb = Fwrite(rpm_header_magic, sizeof(uint8_t), sizeof(rpm_header_magic), fd);
1022 if (nb != sizeof(rpm_header_magic))
1025 case HEADER_MAGIC_NO:
1029 nb = Fwrite(uh, sizeof(char), length, fd);
1033 return (nb == length ? 0 : 1);
1036 int headerIsEntry(Header h, rpmTagVal tag)
1038 /* FIX: h modified by sort. */
1039 return (findEntry(h, tag, RPM_NULL_TYPE) ? 1 : 0);
1044 * Retrieve data from header entry.
1045 * Relevant flags (others are ignored), if neither is set allocation
1046 * behavior depends on data type(!)
1047 * HEADERGET_MINMEM: return pointers to header memory
1048 * HEADERGET_ALLOC: always return malloced memory, overrides MINMEM
1050 * @todo Permit retrieval of regions other than HEADER_IMUTABLE.
1051 * @param entry header entry
1052 * @param td tag data container
1053 * @param minMem string pointers refer to header memory?
1054 * @param flags flags to control memory allocation
1055 * @return 1 on success, otherwise error.
1057 static int copyTdEntry(const indexEntry entry, rpmtd td, headerGetFlags flags)
1059 rpm_count_t count = entry->info.count;
1060 int rc = 1; /* XXX 1 on success. */
1061 /* ALLOC overrides MINMEM */
1062 int allocMem = flags & HEADERGET_ALLOC;
1063 int minMem = allocMem ? 0 : flags & HEADERGET_MINMEM;
1064 int argvArray = (flags & HEADERGET_ARGV) ? 1 : 0;
1067 td->flags = RPMTD_IMMUTABLE;
1068 switch (entry->info.type) {
1071 * XXX This only works for
1072 * XXX "sealed" HEADER_IMMUTABLE/HEADER_SIGNATURES/HEADER_IMAGE.
1073 * XXX This will *not* work for unsealed legacy HEADER_IMAGE (i.e.
1074 * XXX a legacy header freshly read, but not yet unloaded to the rpmdb).
1076 if (ENTRY_IS_REGION(entry)) {
1077 int32_t * ei = ((int32_t *)entry->data) - 2;
1078 entryInfo pe = (entryInfo) (ei + 2);
1079 unsigned char * dataStart = (unsigned char *) (pe + ntohl(ei[0]));
1080 int32_t rdl = -entry->info.offset; /* negative offset */
1081 int32_t ril = rdl/sizeof(*pe);
1084 count = 2 * sizeof(*ei) + (ril * sizeof(*pe)) + rdl;
1085 if (entry->info.tag == RPMTAG_HEADERIMAGE) {
1089 count += REGION_TAG_COUNT;
1090 rdl += REGION_TAG_COUNT;
1093 td->data = xmalloc(count);
1094 ei = (int32_t *) td->data;
1098 pe = (entryInfo) memcpy(ei + 2, pe, (ril * sizeof(*pe)));
1100 dataStart = (unsigned char *) memcpy(pe + ril, dataStart, rdl);
1102 rc = regionSwab(NULL, ril, 0, pe, dataStart, dataStart + rdl, 0, 0);
1103 /* don't return data on failure */
1105 td->data = _free(td->data);
1107 /* XXX 1 on success. */
1108 rc = (rc < 0) ? 0 : 1;
1110 count = entry->length;
1112 ? memcpy(xmalloc(count), entry->data, count)
1116 case RPM_STRING_TYPE:
1117 /* simple string, but fallthrough if its actually an array */
1118 if (count == 1 && !argvArray) {
1119 td->data = allocMem ? xstrdup(entry->data) : entry->data;
1122 case RPM_STRING_ARRAY_TYPE:
1123 case RPM_I18NSTRING_TYPE:
1124 { const char ** ptrEntry;
1125 int tableSize = (count + argvArray) * sizeof(char *);
1130 td->data = xmalloc(tableSize);
1131 ptrEntry = (const char **) td->data;
1134 t = xmalloc(tableSize + entry->length);
1135 td->data = (void *)t;
1136 ptrEntry = (const char **) td->data;
1138 memcpy(t, entry->data, entry->length);
1140 for (i = 0; i < count; i++) {
1147 td->flags |= RPMTD_ARGV;
1152 case RPM_INT16_TYPE:
1153 case RPM_INT32_TYPE:
1154 case RPM_INT64_TYPE:
1156 td->data = xmalloc(entry->length);
1157 memcpy(td->data, entry->data, entry->length);
1159 td->data = entry->data;
1163 /* WTH? Don't mess with unknown data types... */
1168 td->type = entry->info.type;
1171 if (td->data && entry->data != td->data) {
1172 td->flags |= RPMTD_ALLOCED;
1179 * Does locale match entry in header i18n table?
1182 * The range [l,le) contains the next locale to match:
1183 * ll[_CC][.EEEEE][@dddd]
1185 * ll ISO language code (in lowercase).
1186 * CC (optional) ISO coutnry code (in uppercase).
1187 * EEEEE (optional) encoding (not really standardized).
1188 * dddd (optional) dialect.
1191 * @param td header i18n table data, NUL terminated
1192 * @param l start of locale to match
1193 * @param le end of locale to match
1194 * @return 1 on good match, 2 on weak match, 0 on no match
1196 static int headerMatchLocale(const char *td, const char *l, const char *le)
1200 /* First try a complete match. */
1201 if (strlen(td) == (le-l) && rstreqn(td, l, (le - l)))
1204 /* Next, try stripping optional dialect and matching. */
1205 for (fe = l; fe < le && *fe != '@'; fe++)
1207 if (fe < le && rstreqn(td, l, (fe - l)))
1210 /* Next, try stripping optional codeset and matching. */
1211 for (fe = l; fe < le && *fe != '.'; fe++)
1213 if (fe < le && rstreqn(td, l, (fe - l)))
1216 /* Finally, try stripping optional country code and matching. */
1217 for (fe = l; fe < le && *fe != '_'; fe++)
1219 if (fe < le && rstreqn(td, l, (fe - l)))
1226 * Return i18n string from header that matches locale.
1228 * @param entry i18n string data
1229 * @retval td tag data container
1230 * @param flags flags to control allocation
1233 static int copyI18NEntry(Header h, indexEntry entry, rpmtd td,
1234 headerGetFlags flags)
1236 const char *lang, *l, *le;
1239 td->type = RPM_STRING_TYPE;
1241 /* if no match, just return the first string */
1242 td->data = entry->data;
1244 /* XXX Drepper sez' this is the order. */
1245 if ((lang = getenv("LANGUAGE")) == NULL &&
1246 (lang = getenv("LC_ALL")) == NULL &&
1247 (lang = getenv("LC_MESSAGES")) == NULL &&
1248 (lang = getenv("LANG")) == NULL)
1251 if ((table = findEntry(h, RPMTAG_HEADERI18NTABLE, RPM_STRING_ARRAY_TYPE)) == NULL)
1254 for (l = lang; *l != '\0'; l = le) {
1256 char *ed, *ed_weak = NULL;
1259 while (*l && *l == ':') /* skip leading colons */
1263 for (le = l; *le && *le != ':'; le++) /* find end of this locale */
1266 /* For each entry in the header ... */
1267 for (langNum = 0, t = table->data, ed = entry->data;
1268 langNum < entry->info.count;
1269 langNum++, t += strlen(t) + 1, ed += strlen(ed) + 1) {
1271 int match = headerMatchLocale(t, l, le);
1275 } else if (match == 2) {
1286 if (flags & HEADERGET_ALLOC) {
1287 td->data = xstrdup(td->data);
1288 td->flags |= RPMTD_ALLOCED;
1295 * Retrieve tag data from header.
1297 * @retval td tag data container
1298 * @param flags flags to control retrieval
1299 * @return 1 on success, 0 on not found
1301 static int intGetTdEntry(Header h, rpmtd td, headerGetFlags flags)
1306 /* First find the tag */
1307 /* FIX: h modified by sort. */
1308 entry = findEntry(h, td->tag, RPM_NULL_TYPE);
1309 if (entry == NULL) {
1310 /* Td is zeroed above, just return... */
1314 if (flags & HEADERGET_RAW) {
1315 rc = copyTdEntry(entry, td, flags);
1317 switch (entry->info.type) {
1318 case RPM_I18NSTRING_TYPE:
1319 rc = copyI18NEntry(h, entry, td, flags);
1322 rc = copyTdEntry(entry, td, flags);
1328 td->flags |= RPMTD_INVALID;
1330 /* XXX 1 on success */
1331 return ((rc == 1) ? 1 : 0);
1334 int headerGet(Header h, rpmTagVal tag, rpmtd td, headerGetFlags flags)
1337 headerTagTagFunction tagfunc = intGetTdEntry;
1339 if (td == NULL) return 0;
1344 if (flags & HEADERGET_EXT) {
1345 headerTagTagFunction extfunc = rpmHeaderTagFunc(tag);
1346 if (extfunc) tagfunc = extfunc;
1348 rc = tagfunc(h, td, flags);
1350 assert(tag == td->tag);
1356 static void copyData(rpm_tagtype_t type, rpm_data_t dstPtr,
1357 rpm_constdata_t srcPtr, rpm_count_t cnt, int dataLength)
1360 case RPM_STRING_ARRAY_TYPE:
1361 case RPM_I18NSTRING_TYPE:
1362 { const char ** av = (const char **) srcPtr;
1365 while (cnt-- > 0 && dataLength > 0) {
1367 if ((s = *av++) == NULL)
1371 } while (s[-1] && --dataLength > 0);
1376 memmove(dstPtr, srcPtr, dataLength);
1382 * Return (malloc'ed) copy of entry data.
1383 * @param type entry data type
1384 * @param p entry data
1385 * @param c entry item count
1386 * @retval lengthPtr no. bytes in returned data
1387 * @return (malloc'ed) copy of entry data, NULL on error
1390 grabData(rpm_tagtype_t type, rpm_constdata_t p, rpm_count_t c, int * lengthPtr)
1392 rpm_data_t data = NULL;
1395 length = dataLength(type, p, c, 0, NULL);
1397 data = xmalloc(length);
1398 copyData(type, data, p, c, length);
1402 *lengthPtr = length;
1406 static int intAddEntry(Header h, rpmtd td)
1412 /* Count must always be >= 1 for headerAddEntry. */
1416 if (hdrchkType(td->type))
1418 if (hdrchkData(td->count))
1421 data = grabData(td->type, td->data, td->count, &length);
1425 /* Allocate more index space if necessary */
1426 if (h->indexUsed == h->indexAlloced) {
1427 h->indexAlloced += INDEX_MALLOC_SIZE;
1428 h->index = xrealloc(h->index, h->indexAlloced * sizeof(*h->index));
1431 /* Fill in the index */
1432 entry = h->index + h->indexUsed;
1433 entry->info.tag = td->tag;
1434 entry->info.type = td->type;
1435 entry->info.count = td->count;
1436 entry->info.offset = 0;
1438 entry->length = length;
1440 if (h->indexUsed > 0 && td->tag < h->index[h->indexUsed-1].info.tag)
1441 h->flags &= ~HEADERFLAG_SORTED;
1447 static int intAppendEntry(Header h, rpmtd td)
1452 if (td->type == RPM_STRING_TYPE || td->type == RPM_I18NSTRING_TYPE) {
1453 /* we can't do this */
1457 /* Find the tag entry in the header. */
1458 entry = findEntry(h, td->tag, td->type);
1462 length = dataLength(td->type, td->data, td->count, 0, NULL);
1466 if (ENTRY_IN_REGION(entry)) {
1467 char * t = xmalloc(entry->length + length);
1468 memcpy(t, entry->data, entry->length);
1470 entry->info.offset = 0;
1472 entry->data = xrealloc(entry->data, entry->length + length);
1474 copyData(td->type, ((char *) entry->data) + entry->length,
1475 td->data, td->count, length);
1477 entry->length += length;
1479 entry->info.count += td->count;
1484 int headerPut(Header h, rpmtd td, headerPutFlags flags)
1489 if (flags & HEADERPUT_APPEND) {
1490 rc = findEntry(h, td->tag, td->type) ?
1491 intAppendEntry(h, td) :
1494 rc = intAddEntry(h, td);
1499 int headerAddI18NString(Header h, rpmTagVal tag, const char * string,
1502 indexEntry table, entry;
1503 const char ** strArray;
1506 rpm_count_t i, langNum;
1509 table = findEntry(h, RPMTAG_HEADERI18NTABLE, RPM_STRING_ARRAY_TYPE);
1510 entry = findEntry(h, tag, RPM_I18NSTRING_TYPE);
1512 if (!table && entry)
1513 return 0; /* this shouldn't ever happen!! */
1515 if (!table && !entry) {
1516 const char * charArray[2];
1517 rpm_count_t count = 0;
1519 if (!lang || (lang[0] == 'C' && lang[1] == '\0')) {
1520 charArray[count++] = "C";
1522 charArray[count++] = "C";
1523 charArray[count++] = lang;
1527 td.tag = RPMTAG_HEADERI18NTABLE;
1528 td.type = RPM_STRING_ARRAY_TYPE;
1529 td.data = (void *) charArray;
1531 if (!headerPut(h, &td, HEADERPUT_DEFAULT))
1533 table = findEntry(h, RPMTAG_HEADERI18NTABLE, RPM_STRING_ARRAY_TYPE);
1538 if (!lang) lang = "C";
1540 { const char * l = table->data;
1541 for (langNum = 0; langNum < table->info.count; langNum++) {
1542 if (rstreq(l, lang)) break;
1547 if (langNum >= table->info.count) {
1548 length = strlen(lang) + 1;
1549 if (ENTRY_IN_REGION(table)) {
1550 char * t = xmalloc(table->length + length);
1551 memcpy(t, table->data, table->length);
1553 table->info.offset = 0;
1555 table->data = xrealloc(table->data, table->length + length);
1556 memmove(((char *)table->data) + table->length, lang, length);
1557 table->length += length;
1558 table->info.count++;
1564 strArray = xmalloc(sizeof(*strArray) * (langNum + 1));
1565 for (i = 0; i < langNum; i++)
1567 strArray[langNum] = string;
1571 td.type = RPM_I18NSTRING_TYPE;
1573 td.count = langNum + 1;
1574 rc = headerPut(h, &td, HEADERPUT_DEFAULT);
1577 } else if (langNum >= entry->info.count) {
1578 ghosts = langNum - entry->info.count;
1580 length = strlen(string) + 1 + ghosts;
1581 if (ENTRY_IN_REGION(entry)) {
1582 char * t = xmalloc(entry->length + length);
1583 memcpy(t, entry->data, entry->length);
1585 entry->info.offset = 0;
1587 entry->data = xrealloc(entry->data, entry->length + length);
1589 memset(((char *)entry->data) + entry->length, '\0', ghosts);
1590 memmove(((char *)entry->data) + entry->length + ghosts, string, strlen(string)+1);
1592 entry->length += length;
1593 entry->info.count = langNum + 1;
1595 char *b, *be, *e, *ee, *t;
1598 /* Set beginning/end pointers to previous data */
1599 b = be = e = ee = entry->data;
1600 for (i = 0; i < table->info.count; i++) {
1603 ee += strlen(ee) + 1;
1608 /* Get storage for new buffer */
1610 sn = strlen(string) + 1;
1612 length = bn + sn + en;
1613 t = buf = xmalloc(length);
1615 /* Copy values into new storage */
1618 memcpy(t, string, sn);
1623 /* Replace i18N string array */
1624 entry->length -= strlen(be) + 1;
1625 entry->length += sn;
1627 if (ENTRY_IN_REGION(entry)) {
1628 entry->info.offset = 0;
1630 entry->data = _free(entry->data);
1637 int headerMod(Header h, rpmtd td)
1644 /* First find the tag */
1645 entry = findEntry(h, td->tag, td->type);
1649 data = grabData(td->type, td->data, td->count, &length);
1653 /* make sure entry points to the first occurence of this tag */
1654 while (entry > h->index && (entry - 1)->info.tag == td->tag)
1657 /* free after we've grabbed the new data in case the two are intertwined;
1658 that's a bad idea but at least we won't break */
1659 oldData = entry->data;
1661 entry->info.count = td->count;
1662 entry->info.type = td->type;
1664 entry->length = length;
1666 if (ENTRY_IN_REGION(entry)) {
1667 entry->info.offset = 0;
1675 * Header tag iterator data structure.
1677 struct headerIterator_s {
1678 Header h; /*!< Header being iterated. */
1679 int next_index; /*!< Next tag index. */
1682 HeaderIterator headerFreeIterator(HeaderIterator hi)
1685 hi->h = headerFree(hi->h);
1691 HeaderIterator headerInitIterator(Header h)
1693 HeaderIterator hi = xmalloc(sizeof(*hi));
1697 hi->h = headerLink(h);
1702 static indexEntry nextIndex(HeaderIterator hi)
1706 indexEntry entry = NULL;
1708 for (slot = hi->next_index; slot < h->indexUsed; slot++) {
1709 entry = h->index + slot;
1710 if (!ENTRY_IS_REGION(entry))
1713 hi->next_index = slot;
1714 if (entry == NULL || slot >= h->indexUsed)
1721 rpmTagVal headerNextTag(HeaderIterator hi)
1723 indexEntry entry = nextIndex(hi);
1724 return entry ? entry->info.tag : RPMTAG_NOT_FOUND;
1727 int headerNext(HeaderIterator hi, rpmtd td)
1729 indexEntry entry = nextIndex(hi);
1734 td->tag = entry->info.tag;
1735 rc = copyTdEntry(entry, td, HEADERGET_DEFAULT);
1737 return ((rc == 1) ? 1 : 0);
1740 unsigned int headerGetInstance(Header h)
1742 return h ? h->instance : 0;
1745 void headerSetInstance(Header h, unsigned int instance)
1747 h->instance = instance;
1750 #define RETRY_ERROR(_err) \
1751 ((_err) == EINTR || (_err) == EAGAIN || (_err) == EWOULDBLOCK)
1753 ssize_t Freadall(FD_t fd, void * buf, ssize_t size)
1759 while (total < size) {
1760 nb = Fread(bufp, 1, size - total, fd);
1762 if (nb == 0 || (nb < 0 && !RETRY_ERROR(errno))) {