2 * Copyright (c) 2007, Novell Inc.
4 * This program is licensed under the BSD license, read LICENSE.BSD
5 * for further information
11 * Read the binary dump of a Repo and create a Repo * from it
14 * Repo *pool_addrepo_solv(Pool *pool, FILE *fp)
26 #include "repo_solv.h"
31 #define INTERESTED_START SOLVABLE_NAME
32 #define INTERESTED_END SOLVABLE_FRESHENS
34 #define SOLV_ERROR_NOT_SOLV 1
35 #define SOLV_ERROR_UNSUPPORTED 2
36 #define SOLV_ERROR_EOF 3
37 #define SOLV_ERROR_ID_RANGE 4
38 #define SOLV_ERROR_OVERFLOW 5
39 #define SOLV_ERROR_CORRUPT 6
41 static Pool *mypool; /* for pool_debug... */
43 /*-----------------------------------------------------------------*/
44 /* .solv read functions */
51 read_u32(Repodata *data)
58 for (i = 0; i < 4; i++)
63 pool_debug(mypool, SAT_ERROR, "unexpected EOF\n");
64 data->error = SOLV_ERROR_EOF;
78 read_u8(Repodata *data)
87 pool_debug(mypool, SAT_ERROR, "unexpected EOF\n");
88 data->error = SOLV_ERROR_EOF;
100 read_id(Repodata *data, Id max)
107 for (i = 0; i < 5; i++)
112 pool_debug(mypool, SAT_ERROR, "unexpected EOF\n");
113 data->error = SOLV_ERROR_EOF;
121 pool_debug(mypool, SAT_ERROR, "read_id: id too large (%u/%u)\n", x, max);
122 data->error = SOLV_ERROR_ID_RANGE;
127 x = (x << 7) ^ c ^ 128;
129 pool_debug(mypool, SAT_ERROR, "read_id: id too long\n");
130 data->error = SOLV_ERROR_CORRUPT;
141 read_rel_idarray(Repodata *data, Id max, Id *map, Id *store, Id *end, Id marker)
154 pool_debug(mypool, SAT_ERROR, "unexpected EOF\n");
155 data->error = SOLV_ERROR_EOF;
160 x = (x << 7) ^ c ^ 128;
163 x = (x << 6) | (c & 63);
169 pool_debug(mypool, SAT_ERROR, "read_rel_idarray: array overflow\n");
170 data->error = SOLV_ERROR_OVERFLOW;
178 *store++ = marker; /* do not map! */
187 pool_debug(mypool, SAT_ERROR, "read_rel_idarray: id too large (%u/%u)\n", x, max);
188 data->error = SOLV_ERROR_ID_RANGE;
195 pool_debug(mypool, SAT_ERROR, "read_rel_idarray: array overflow\n");
201 if (x == 0) /* already have trailing zero? */
205 pool_debug(mypool, SAT_ERROR, "read_rel_idarray: array overflow\n");
206 data->error = SOLV_ERROR_OVERFLOW;
217 static inline unsigned char *
218 data_read_id_max(unsigned char *dp, Id *ret, Id *map, int max, int *error)
221 dp = data_read_id(dp, &x);
224 pool_debug(mypool, SAT_ERROR, "data_read_idarray: id too large (%u/%u)\n", x, max);
225 *error = SOLV_ERROR_ID_RANGE;
228 *ret = map ? map[x] : x;
233 data_read_idarray(unsigned char *dp, Id **storep, Id *map, int max, int *error)
244 x = (x << 7) ^ c ^ 128;
247 x = (x << 6) | (c & 63);
250 pool_debug(mypool, SAT_ERROR, "data_read_idarray: id too large (%u/%u)\n", x, max);
251 *error = SOLV_ERROR_ID_RANGE;
265 data_read_rel_idarray(unsigned char *dp, Id **storep, Id *map, int max, int *error, Id marker)
277 x = (x << 7) ^ c ^ 128;
280 x = (x << 6) | (c & 63);
294 pool_debug(mypool, SAT_ERROR, "data_read_rel_idarray: id too large (%u/%u)\n", x, max);
295 *error = SOLV_ERROR_ID_RANGE;
298 *store++ = map ? map[x] : x;
310 read_idarray(Repodata *data, Id max, Id *map, Id *store, Id *end)
322 pool_debug(mypool, SAT_ERROR, "unexpected EOF\n");
323 data->error = SOLV_ERROR_EOF;
328 x = (x << 7) ^ c ^ 128;
331 x = (x << 6) | (c & 63);
334 pool_debug(mypool, SAT_ERROR, "read_idarray: id too large (%u/%u)\n", x, max);
335 data->error = SOLV_ERROR_ID_RANGE;
342 pool_debug(mypool, SAT_ERROR, "read_idarray: array overflow\n");
348 if (x == 0) /* already have trailing zero? */
352 pool_debug(mypool, SAT_ERROR, "read_idarray: array overflow\n");
353 data->error = SOLV_ERROR_OVERFLOW;
364 read_str(Repodata *data, char **inbuf, unsigned *len)
366 unsigned char *buf = (unsigned char*)*inbuf;
369 buf = sat_malloc(1024);
374 while((c = getc(data->fp)) != 0)
378 pool_debug (mypool, SAT_ERROR, "unexpected EOF\n");
379 data->error = SOLV_ERROR_EOF;
382 /* Plus 1 as we also want to add the 0. */
386 /* Don't realloc on the inbuf, it might be on the stack. */
387 if (buf == (unsigned char*)*inbuf)
389 buf = sat_malloc(*len);
390 memcpy(buf, *inbuf, *len - 256);
393 buf = sat_realloc(buf, *len);
402 skip_item(Repodata *data, unsigned type, unsigned numid, unsigned numrel)
406 case REPOKEY_TYPE_VOID:
407 case REPOKEY_TYPE_CONSTANT:
408 case REPOKEY_TYPE_CONSTANTID:
410 case REPOKEY_TYPE_ID:
411 read_id(data, numid + numrel); /* just check Id */
413 case REPOKEY_TYPE_DIR:
414 read_id(data, numid + data->dirpool.ndirs); /* just check Id */
416 case REPOKEY_TYPE_NUM:
419 case REPOKEY_TYPE_U32:
422 case REPOKEY_TYPE_STR:
423 while (read_u8(data) != 0)
426 case REPOKEY_TYPE_MD5:
429 for (i = 0; i < SIZEOF_MD5; i++)
433 case REPOKEY_TYPE_SHA1:
436 for (i = 0; i < SIZEOF_SHA1; i++)
440 case REPOKEY_TYPE_IDARRAY:
441 case REPOKEY_TYPE_REL_IDARRAY:
442 while ((read_u8(data) & 0xc0) != 0)
445 case REPOKEY_TYPE_DIRNUMNUMARRAY:
448 read_id(data, numid + data->dirpool.ndirs); /* just check Id */
450 if (!(read_id(data, 0) & 0x40))
454 case REPOKEY_TYPE_DIRSTRARRAY:
457 Id id = read_id(data, 0);
458 while (read_u8(data) != 0)
465 pool_debug(mypool, SAT_ERROR, "unknown type %d\n", type);
466 data->error = SOLV_ERROR_CORRUPT;
472 key_cmp (const void *pa, const void *pb)
474 Repokey *a = (Repokey *)pa;
475 Repokey *b = (Repokey *)pb;
476 return a->name - b->name;
479 static void repodata_load_solv(Repodata *data);
482 parse_external_repodata(Repodata *maindata, Id *keyp, Repokey *keys, Id *idmap, unsigned numid, unsigned numrel)
484 Repo *repo = maindata->repo;
490 repo->repodata = sat_realloc2(repo->repodata, repo->nrepodata + 1, sizeof (*data));
491 data = repo->repodata + repo->nrepodata++;
492 memset(data, 0, sizeof(*data));
495 data->state = REPODATA_STUB;
496 data->loadcallback = repodata_load_solv;
498 while ((key = *keyp++) != 0)
501 switch (keys[key].type)
503 case REPOKEY_TYPE_IDARRAY:
504 if (id != REPODATA_KEYS)
506 skip_item(maindata, REPOKEY_TYPE_IDARRAY, numid, numrel);
509 /* read_idarray writes a terminating 0, that's why the + 1 */
510 ida = sat_calloc(keys[key].size + 1, sizeof(Id));
511 ide = read_idarray(maindata, numid, idmap, ida, ida + keys[key].size + 1);
515 pool_debug (mypool, SAT_ERROR, "invalid attribute data\n");
516 maindata->error = SOLV_ERROR_CORRUPT;
519 data->nkeys = 1 + (n >> 1);
520 data->keys = sat_malloc2(data->nkeys, sizeof(data->keys[0]));
521 memset(data->keys, 0, sizeof(Repokey));
522 for (i = 1, ide = ida; i < data->nkeys; i++)
524 data->keys[i].name = *ide++;
525 data->keys[i].type = *ide++;
526 data->keys[i].size = 0;
527 data->keys[i].storage = 0;
531 qsort(data->keys + 1, data->nkeys - 1, sizeof(data->keys[0]), key_cmp);
533 case REPOKEY_TYPE_STR:
534 if (id != REPODATA_LOCATION)
535 skip_item(maindata, REPOKEY_TYPE_STR, numid, numrel);
539 unsigned len = sizeof(buf);
540 char *filename = buf;
541 read_str(maindata, &filename, &len);
542 data->location = strdup(filename);
548 skip_item(maindata, keys[key].type, numid, numrel);
555 parse_info_repodata(Repodata *maindata, Id *keyp, Repokey *keys, Id *idmap, unsigned numid, unsigned numrel)
559 while ((key = *keyp++) != 0)
562 if (id == REPODATA_ADDEDFILEPROVIDES && keys[key].type == REPOKEY_TYPE_REL_IDARRAY)
565 /* + 1 just in case */
566 ida = sat_calloc(keys[key].size + 1, sizeof(Id));
567 read_idarray(maindata, 0, 0, ida, ida + keys[key].size + 1);
568 maindata->addedfileprovides = ida;
577 *ida = idmap ? idmap[old] : old;
581 skip_item(maindata, keys[key].type, numid, numrel);
585 /*-----------------------------------------------------------------*/
589 skip_schema(Repodata *data, Id *keyp, Repokey *keys, unsigned int numid, unsigned int numrel)
592 while ((key = *keyp++) != 0)
593 skip_item(data, keys[key].type, numid, numrel);
596 /*-----------------------------------------------------------------*/
599 incore_add_id(Repodata *data, Id x)
602 /* make sure we have at least 5 bytes free */
603 if (data->incoredatafree < 5)
605 data->incoredata = sat_realloc(data->incoredata, data->incoredatalen + 1024);
606 data->incoredatafree = 1024;
608 dp = data->incoredata + data->incoredatalen;
614 *dp++ = (x >> 28) | 128;
616 *dp++ = (x >> 21) | 128;
617 *dp++ = (x >> 14) | 128;
620 *dp++ = (x >> 7) | 128;
622 data->incoredatafree -= dp - (data->incoredata + data->incoredatalen);
623 data->incoredatalen = dp - data->incoredata;
627 incore_add_blob(Repodata *data, unsigned char *buf, int len)
629 if (data->incoredatafree < len)
631 data->incoredata = sat_realloc(data->incoredata, data->incoredatalen + 1024 + len);
632 data->incoredatafree = 1024 + len;
634 memcpy(data->incoredata + data->incoredatalen, buf, len);
635 data->incoredatafree -= len;
636 data->incoredatalen += len;
640 incore_map_idarray(Repodata *data, unsigned char *dp, Id *map, Id max)
642 /* We have to map the IDs, which might also change
643 the necessary number of bytes, so we can't just copy
644 over the blob and adjust it. */
649 dp = data_read_ideof(dp, &id, &eof);
650 if (max && id >= max)
652 pool_debug(mypool, SAT_ERROR, "incore_map_idarray: id too large (%u/%u)\n", id, max);
653 data->error = SOLV_ERROR_ID_RANGE;
658 id = (id & 63) | ((id & ~63) << 1);
659 incore_add_id(data, eof ? id : id | 64);
666 incore_add_u32(Repodata *data, unsigned int x)
669 /* make sure we have at least 4 bytes free */
670 if (data->incoredatafree < 4)
672 data->incoredata = sat_realloc(data->incoredata, data->incoredatalen + 1024);
673 data->incoredatafree = 1024;
675 dp = data->incoredata + data->incoredatalen;
680 data->incoredatafree -= 4;
681 data->incoredatalen += 4;
686 incore_add_u8(Repodata *data, unsigned int x)
689 /* make sure we have at least 1 byte free */
690 if (data->incoredatafree < 1)
692 data->incoredata = sat_realloc(data->incoredata, data->incoredatalen + 1024);
693 data->incoredatafree = 1024;
695 dp = data->incoredata + data->incoredatalen;
697 data->incoredatafree--;
698 data->incoredatalen++;
704 // ----------------------------------------------
708 * read repo from .solv file
713 repo_add_solv_parent(Repo *repo, FILE *fp, Repodata *parent)
715 Pool *pool = repo->pool;
717 unsigned int numid, numrel, numdir, numsolv;
718 unsigned int numkeys, numschemata, numinfo;
721 Offset *str; /* map Id -> Offset into string space */
722 char *strsp; /* repo string space */
723 char *sp; /* pointer into string space */
724 Id *idmap; /* map of repo Ids to pool Ids */
726 unsigned int hashmask, h;
732 unsigned int size_idarray;
733 Id *idarraydatap, *idarraydataend;
736 unsigned int solvflags;
737 unsigned int solvversion;
739 Id *schemadata, *schemadatap, *schemadataend;
742 unsigned oldnrepodata;
743 int maxsize, allsize;
744 unsigned char *buf, *dp, *dps;
747 struct _Stringpool *spool;
751 memset(&data, 0, sizeof(data));
758 if (read_u32(&data) != ('S' << 24 | 'O' << 16 | 'L' << 8 | 'V'))
760 pool_debug(pool, SAT_ERROR, "not a SOLV file\n");
761 return SOLV_ERROR_NOT_SOLV;
763 solvversion = read_u32(&data);
769 pool_debug(pool, SAT_ERROR, "unsupported SOLV version\n");
770 return SOLV_ERROR_UNSUPPORTED;
773 pool_freeidhashes(pool);
775 numid = read_u32(&data);
776 numrel = read_u32(&data);
777 numdir = read_u32(&data);
778 numsolv = read_u32(&data);
779 numkeys = read_u32(&data);
780 numschemata = read_u32(&data);
781 numinfo = read_u32(&data);
782 solvflags = read_u32(&data);
784 if (numdir && numdir < 2)
786 pool_debug(pool, SAT_ERROR, "bad number of dirs\n");
787 return SOLV_ERROR_CORRUPT;
794 pool_debug(pool, SAT_ERROR, "relations are forbidden in a store\n");
795 return SOLV_ERROR_CORRUPT;
797 if (parent->end - parent->start != numsolv)
799 pool_debug(pool, SAT_ERROR, "unequal number of solvables in a store\n");
800 return SOLV_ERROR_CORRUPT;
804 pool_debug(pool, SAT_ERROR, "info blocks are forbidden in a store\n");
805 return SOLV_ERROR_CORRUPT;
809 /******* Part 1: string IDs *****************************************/
811 sizeid = read_u32(&data); /* size of string+Id space */
814 * read strings and Ids
829 spool->stringspace = sat_malloc(7);
830 strcpy(spool->stringspace, "<NULL>");
835 /* alloc string buffer */
836 spool->stringspace = sat_realloc(spool->stringspace, spool->sstrings + sizeid + 1);
837 /* alloc string offsets (Id -> Offset into string space) */
838 spool->strings = sat_realloc2(spool->strings, spool->nstrings + numid, sizeof(Offset));
840 strsp = spool->stringspace;
841 str = spool->strings; /* array of offsets into strsp, indexed by Id */
843 /* point to _BEHIND_ already allocated string/Id space */
844 strsp += spool->sstrings;
848 * read new repo at end of pool
851 if ((solvflags & SOLV_FLAG_PREFIX_POOL) == 0)
853 if (sizeid && fread(strsp, sizeid, 1, fp) != 1)
855 pool_debug(pool, SAT_ERROR, "read error while reading strings\n");
856 return SOLV_ERROR_EOF;
861 unsigned int pfsize = read_u32(&data);
862 char *prefix = sat_malloc(pfsize);
868 if (pfsize && fread(prefix, pfsize, 1, fp) != 1)
870 pool_debug(pool, SAT_ERROR, "read error while reading strings\n");
872 return SOLV_ERROR_EOF;
874 for (i = 1; i < numid; i++)
876 int same = (unsigned char)*pp++;
877 size_t len = strlen(pp) + 1;
878 freesp -= same + len;
881 pool_debug(pool, SAT_ERROR, "overflow while expanding strings\n");
883 return SOLV_ERROR_OVERFLOW;
886 memcpy(dest, old_str, same);
887 memcpy(dest + same, pp, len);
895 pool_debug(pool, SAT_ERROR, "expanding strings size mismatch\n");
896 return SOLV_ERROR_CORRUPT;
899 strsp[sizeid] = 0; /* make string space \0 terminated */
904 /* no shared pool, thus no idmap and no unification */
906 spool->nstrings = numid;
910 /* we need the '' for directories */
911 pool_debug(pool, SAT_ERROR, "store strings don't start with ''\n");
912 return SOLV_ERROR_CORRUPT;
914 for (i = 1; i < spool->nstrings; i++)
916 if (sp >= strsp + sizeid)
918 pool_debug(pool, SAT_ERROR, "not enough strings\n");
919 return SOLV_ERROR_OVERFLOW;
921 str[i] = sp - spool->stringspace;
922 sp += strlen(sp) + 1;
924 spool->sstrings = sp - spool->stringspace;
929 /* alloc id map for name and rel Ids. this maps ids in the solv files
930 * to the ids in our pool */
931 idmap = sat_calloc(numid + numrel, sizeof(Id));
934 * build hashes for all read strings
938 hashmask = mkmask(spool->nstrings + numid);
941 POOL_DEBUG(SAT_DEBUG_STATS, "read %d strings\n", numid);
942 POOL_DEBUG(SAT_DEBUG_STATS, "string hash buckets: %d\n", hashmask + 1);
946 * create hashtable with strings already in pool
949 hashtbl = sat_calloc(hashmask + 1, sizeof(Id));
950 for (i = 1; i < spool->nstrings; i++) /* leave out our dummy zero id */
952 h = strhash(spool->stringspace + spool->strings[i]) & hashmask;
953 hh = HASHCHAIN_START;
955 h = HASHCHAIN_NEXT(h, hh, hashmask);
960 * run over string space, calculate offsets
962 * build id map (maps solv Id -> pool Id)
965 for (i = 1; i < numid; i++)
967 if (sp >= strsp + sizeid)
971 pool_debug(pool, SAT_ERROR, "not enough strings %d %d\n", i, numid);
972 return SOLV_ERROR_OVERFLOW;
974 if (!*sp) /* empty string */
982 h = strhash(sp) & hashmask;
983 hh = HASHCHAIN_START;
989 if (!strcmp(spool->stringspace + spool->strings[id], sp))
990 break; /* existing string */
991 h = HASHCHAIN_NEXT(h, hh, hashmask);
994 /* length == offset to next string */
996 if (id == ID_NULL) /* end of hash chain -> new string */
998 id = spool->nstrings++;
1000 str[id] = spool->sstrings; /* save Offset */
1001 if (sp != spool->stringspace + spool->sstrings) /* not at end-of-buffer */
1002 memmove(spool->stringspace + spool->sstrings, sp, l); /* append to pool buffer */
1003 spool->sstrings += l;
1005 idmap[i] = id; /* repo relative -> pool relative */
1006 sp += l; /* next string */
1010 pool_shrink_strings(pool); /* vacuum */
1013 /******* Part 2: Relation IDs ***************************************/
1023 pool->rels = sat_realloc2(pool->rels, pool->nrels + numrel, sizeof(Reldep));
1026 hashmask = mkmask(pool->nrels + numrel);
1028 POOL_DEBUG(SAT_DEBUG_STATS, "read %d rels\n", numrel);
1029 POOL_DEBUG(SAT_DEBUG_STATS, "rel hash buckets: %d\n", hashmask + 1);
1032 * prep hash table with already existing RelDeps
1035 hashtbl = sat_calloc(hashmask + 1, sizeof(Id));
1036 for (i = 1; i < pool->nrels; i++)
1038 h = relhash(ran[i].name, ran[i].evr, ran[i].flags) & hashmask;
1039 hh = HASHCHAIN_START;
1041 h = HASHCHAIN_NEXT(h, hh, hashmask);
1046 * read RelDeps from repo
1049 for (i = 0; i < numrel; i++)
1051 name = read_id(&data, i + numid); /* read (repo relative) Ids */
1052 evr = read_id(&data, i + numid);
1053 flags = read_u8(&data);
1054 name = idmap[name]; /* map to (pool relative) Ids */
1056 h = relhash(name, evr, flags) & hashmask;
1057 hh = HASHCHAIN_START;
1061 if (id == ID_NULL) /* end of hash chain */
1063 if (ran[id].name == name && ran[id].evr == evr && ran[id].flags == flags)
1065 h = HASHCHAIN_NEXT(h, hh, hashmask);
1067 if (id == ID_NULL) /* new RelDep */
1071 ran[id].name = name;
1073 ran[id].flags = flags;
1075 idmap[i + numid] = MAKERELDEP(id); /* fill Id map */
1078 pool_shrink_rels(pool); /* vacuum */
1082 /******* Part 3: Dirs ***********************************************/
1085 data.dirpool.dirs = sat_malloc2(numdir, sizeof(Id));
1086 data.dirpool.ndirs = numdir;
1087 data.dirpool.dirs[0] = 0; /* dir 0: virtual root */
1088 data.dirpool.dirs[1] = 1; /* dir 1: / */
1089 for (i = 2; i < numdir; i++)
1091 id = read_id(&data, i + numid);
1093 data.dirpool.dirs[i] = -(id - numid);
1095 data.dirpool.dirs[i] = idmap[id];
1097 data.dirpool.dirs[i] = id;
1101 /******* Part 4: Keys ***********************************************/
1103 keys = sat_calloc(numkeys, sizeof(*keys));
1104 /* keys start at 1 */
1105 for (i = 1; i < numkeys; i++)
1107 id = read_id(&data, numid);
1111 id = str2id(pool, stringpool_id2str(spool, id), 1);
1112 type = read_id(&data, numid);
1116 type = str2id(pool, stringpool_id2str(spool, type), 1);
1117 if (type < REPOKEY_TYPE_VOID || type > REPOKEY_TYPE_SHA1)
1119 pool_debug(pool, SAT_ERROR, "unsupported data type '%s'\n", id2str(pool, type));
1120 data.error = SOLV_ERROR_UNSUPPORTED;
1121 type = REPOKEY_TYPE_VOID;
1124 keys[i].type = type;
1125 keys[i].size = read_id(&data, keys[i].type == REPOKEY_TYPE_CONSTANTID ? numid + numrel : 0);
1126 keys[i].storage = read_id(&data, 0);
1127 if (id >= SOLVABLE_NAME && id <= RPM_RPMDBID)
1128 keys[i].storage = KEY_STORAGE_SOLVABLE;
1129 else if (keys[i].storage == KEY_STORAGE_SOLVABLE)
1130 keys[i].storage = KEY_STORAGE_INCORE;
1131 if (keys[i].type == REPOKEY_TYPE_CONSTANTID)
1134 keys[i].size = idmap[keys[i].size];
1136 keys[i].size = str2id(pool, stringpool_id2str(spool, keys[i].size), 1);
1139 fprintf(stderr, "key %d %s %s %d %d\n", i, id2str(pool,id), id2str(pool, keys[i].type),
1140 keys[i].size, keys[i].storage);
1144 have_xdata = parent ? 1 : 0;
1145 for (i = 1; i < numkeys; i++)
1146 if (keys[i].storage == KEY_STORAGE_INCORE || keys[i].storage == KEY_STORAGE_VERTICAL_OFFSET)
1150 data.nkeys = numkeys;
1152 /******* Part 5: Schemata ********************************************/
1154 id = read_id(&data, 0);
1155 schemadata = sat_calloc(id + 1, sizeof(Id));
1156 schemadatap = schemadata + 1;
1157 schemadataend = schemadatap + id;
1158 schemata = sat_calloc(numschemata, sizeof(Id));
1159 for (i = 1; i < numschemata; i++)
1161 schemata[i] = schemadatap - schemadata;
1162 schemadatap = read_idarray(&data, numid, 0, schemadatap, schemadataend);
1164 Id *sp = schemadata + schemata[i];
1165 fprintf (stderr, "schema %d:", i);
1167 fprintf (stderr, " %d", *sp);
1168 fprintf (stderr, "\n");
1171 data.schemata = schemata;
1172 data.nschemata = numschemata;
1173 data.schemadata = schemadata;
1174 data.schemadatalen = schemadataend - data.schemadata;
1177 /******* Part 6: Info ***********************************************/
1178 oldnrepodata = repo->nrepodata;
1181 id = read_id(&data, 0);
1182 id = read_id(&data, 0);
1184 for (i = 0; i < numinfo; i++)
1186 /* for now we're just interested in data that starts with
1187 * the repodata_external id
1190 id = read_id(&data, numschemata);
1191 keyp = schemadata + schemata[id];
1193 if (keys[key].name == REPODATA_EXTERNAL && keys[key].type == REPOKEY_TYPE_VOID)
1195 /* external data for some ids */
1196 parse_external_repodata(&data, keyp, keys, idmap, numid, numrel);
1198 else if (keys[key].name == REPODATA_INFO)
1200 parse_info_repodata(&data, keyp, keys, idmap, numid, numrel);
1204 skip_schema(&data, keyp, keys, numid, numrel);
1209 /******* Part 7: item data *******************************************/
1211 /* calculate idarray size */
1213 for (i = 1; i < numkeys; i++)
1216 if ((keys[i].type == REPOKEY_TYPE_IDARRAY || keys[i].type == REPOKEY_TYPE_REL_IDARRAY)
1217 && id >= INTERESTED_START && id <= INTERESTED_END)
1218 size_idarray += keys[i].size;
1223 maxsize = read_id(&data, 0);
1224 allsize = read_id(&data, 0);
1225 if (maxsize > allsize)
1227 pool_debug(pool, SAT_ERROR, "maxsize %d is greater then allsize %d\n", maxsize, allsize);
1228 data.error = SOLV_ERROR_CORRUPT;
1232 maxsize = allsize = 0;
1234 /* allocate needed space in repo */
1235 /* we add maxsize because it is an upper limit for all idarrays */
1236 repo_reserve_ids(repo, 0, size_idarray + maxsize + 1);
1237 idarraydatap = repo->idarraydata + repo->idarraysize;
1238 repo->idarraysize += size_idarray;
1239 idarraydataend = idarraydatap + size_idarray;
1242 /* read solvables */
1246 s = pool_id2solvable(pool, parent->start);
1248 s = pool_id2solvable(pool, repo_add_solvable_block(repo, numsolv));
1249 /* store start and end of our id block */
1250 data.start = s - pool->solvables;
1251 data.end = data.start + numsolv;
1252 /* In case we have info blocks, make them refer to our part of the
1254 for (i = oldnrepodata; i < repo->nrepodata; i++)
1256 repo->repodata[i].start = data.start;
1257 repo->repodata[i].end = data.end;
1265 /* reserve one byte so that all offsets are not zero */
1266 incore_add_id(&data, 0);
1267 repodata_extend_block(&data, data.start, numsolv);
1271 buf = sat_calloc(maxsize + 4, 1);
1273 for (i = 0; i < numsolv; i++, s++)
1282 pool_debug(mypool, SAT_ERROR, "buffer overrun\n");
1283 data.error = SOLV_ERROR_EOF;
1287 memmove(buf, dp, left);
1291 if (l && fread(buf + left, l, 1, data.fp) != 1)
1293 pool_debug(mypool, SAT_ERROR, "unexpected EOF\n");
1294 data.error = SOLV_ERROR_EOF;
1301 dp = data_read_id_max(dp, &id, 0, numschemata, &data.error);
1304 data.incoreoffset[i] = data.incoredatalen;
1305 incore_add_id(&data, id);
1307 keyp = schemadata + schemata[id];
1308 while ((key = *keyp++) != 0)
1313 id = keys[key].name;
1315 fprintf(stderr, "solv %d name %d type %d class %d\n", i, id, keys[key].type, keys[key].storage);
1317 if (keys[key].storage == KEY_STORAGE_VERTICAL_OFFSET)
1319 /* copy offset/length into incore */
1321 dp = data_skip(dp, REPOKEY_TYPE_ID);
1322 dp = data_skip(dp, REPOKEY_TYPE_ID);
1323 incore_add_blob(&data, dps, dp - dps);
1326 switch (keys[key].type)
1328 case REPOKEY_TYPE_ID:
1329 dp = data_read_id_max(dp, &did, idmap, numid + numrel, &data.error);
1330 if (id == SOLVABLE_NAME)
1332 else if (id == SOLVABLE_ARCH)
1334 else if (id == SOLVABLE_EVR)
1336 else if (id == SOLVABLE_VENDOR)
1338 else if (keys[key].storage == KEY_STORAGE_INCORE)
1339 incore_add_id(&data, did);
1341 POOL_DEBUG(SAT_DEBUG_STATS, "%s -> %s\n", id2str(pool, id), id2str(pool, did));
1344 case REPOKEY_TYPE_U32:
1345 dp = data_read_u32(dp, &h);
1347 POOL_DEBUG(SAT_DEBUG_STATS, "%s -> %u\n", id2str(pool, id), h);
1349 if (id == RPM_RPMDBID)
1352 repo->rpmdbid = sat_calloc(numsolv, sizeof(Id));
1353 repo->rpmdbid[i] = h;
1355 else if (keys[key].storage == KEY_STORAGE_INCORE)
1356 incore_add_u32(&data, h);
1358 case REPOKEY_TYPE_IDARRAY:
1359 case REPOKEY_TYPE_REL_IDARRAY:
1360 if (id < INTERESTED_START || id > INTERESTED_END)
1363 dp = data_skip(dp, REPOKEY_TYPE_IDARRAY);
1364 if (keys[key].storage != KEY_STORAGE_INCORE)
1367 incore_map_idarray(&data, dps, idmap, numid);
1369 incore_add_blob(&data, dps, dp - dps);
1372 ido = idarraydatap - repo->idarraydata;
1373 if (keys[key].type == REPOKEY_TYPE_IDARRAY)
1374 dp = data_read_idarray(dp, &idarraydatap, idmap, numid + numrel, &data.error);
1375 else if (id == SOLVABLE_REQUIRES)
1376 dp = data_read_rel_idarray(dp, &idarraydatap, idmap, numid + numrel, &data.error, SOLVABLE_PREREQMARKER);
1377 else if (id == SOLVABLE_PROVIDES)
1378 dp = data_read_rel_idarray(dp, &idarraydatap, idmap, numid + numrel, &data.error, SOLVABLE_FILEMARKER);
1380 dp = data_read_rel_idarray(dp, &idarraydatap, idmap, numid + numrel, &data.error, 0);
1381 if (idarraydatap > idarraydataend)
1383 pool_debug(pool, SAT_ERROR, "idarray overflow\n");
1384 data.error = SOLV_ERROR_OVERFLOW;
1387 if (id == SOLVABLE_PROVIDES)
1389 else if (id == SOLVABLE_OBSOLETES)
1391 else if (id == SOLVABLE_CONFLICTS)
1393 else if (id == SOLVABLE_REQUIRES)
1395 else if (id == SOLVABLE_RECOMMENDS)
1397 else if (id == SOLVABLE_SUPPLEMENTS)
1398 s->supplements = ido;
1399 else if (id == SOLVABLE_SUGGESTS)
1401 else if (id == SOLVABLE_ENHANCES)
1403 else if (id == SOLVABLE_FRESHENS)
1406 POOL_DEBUG(SAT_DEBUG_STATS, "%s ->\n", id2str(pool, id));
1407 for (; repo->idarraydata[ido]; ido++)
1408 POOL_DEBUG(SAT_DEBUG_STATS," %s\n", dep2str(pool, repo->idarraydata[ido]));
1413 dp = data_skip(dp, keys[key].type);
1414 if (keys[key].storage == KEY_STORAGE_INCORE)
1415 incore_add_blob(&data, dps, dp - dps);
1421 /* should shrink idarraydata again */
1428 pool_debug(mypool, SAT_ERROR, "buffer overrun\n");
1429 data.error = SOLV_ERROR_EOF;
1436 /* free solvables */
1437 repo_free_solvable_block(repo, data.start, data.end - data.start, 1);
1439 repo->idarraysize -= size_idarray;
1440 /* free incore data */
1441 data.incoredata = sat_free(data.incoredata);
1442 data.incoredatalen = data.incoredatafree = 0;
1445 if (data.incoredatafree)
1447 /* shrink excess size */
1448 data.incoredata = sat_realloc(data.incoredata, data.incoredatalen);
1449 data.incoredatafree = 0;
1452 for (i = 1; i < numkeys; i++)
1453 if (keys[i].storage == KEY_STORAGE_VERTICAL_OFFSET)
1455 if (i < numkeys && !data.error)
1458 unsigned int pagesize;
1460 /* we have vertical data, make it available */
1461 data.verticaloffset = sat_calloc(numkeys, sizeof(Id));
1462 for (i = 1; i < numkeys; i++)
1463 if (keys[i].storage == KEY_STORAGE_VERTICAL_OFFSET)
1465 data.verticaloffset[i] = fileoffset;
1466 fileoffset += keys[i].size;
1468 data.lastverticaloffset = fileoffset;
1469 pagesize = read_u32(&data);
1470 repodata_read_or_setup_pages(&data, pagesize, fileoffset);
1474 /* no longer needed */
1478 if (parent && !data.error)
1481 sat_free(parent->schemata);
1482 sat_free(parent->schemadata);
1483 sat_free(parent->keys);
1484 sat_free(parent->location);
1487 else if ((data.incoredatalen || data.fp) && !data.error)
1489 /* we got some data, make it available */
1490 repo->repodata = sat_realloc2(repo->repodata, repo->nrepodata + 1, sizeof(data));
1491 repo->repodata[repo->nrepodata++] = data;
1496 sat_free(data.dirpool.dirs);
1497 sat_free(data.incoreoffset);
1499 sat_free(schemadata);
1509 repo_add_solv(Repo *repo, FILE *fp)
1511 return repo_add_solv_parent(repo, fp, 0);
1515 repodata_load_solv(Repodata *data)
1518 Pool *pool = data->repo->pool;
1519 if (!pool->loadcallback)
1521 data->state = REPODATA_ERROR;
1524 fp = pool->loadcallback(pool, data, pool->loadcallbackdata);
1527 data->state = REPODATA_ERROR;
1530 if (repo_add_solv_parent(data->repo, fp, data))
1531 data->state = REPODATA_ERROR;
1533 data->state = REPODATA_AVAILABLE;