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"
29 #include "attr_store_p.h"
32 #define INTERESTED_START SOLVABLE_NAME
33 #define INTERESTED_END SOLVABLE_FRESHENS
35 #define SOLV_ERROR_NOT_SOLV 1
36 #define SOLV_ERROR_UNSUPPORTED 2
37 #define SOLV_ERROR_EOF 3
38 #define SOLV_ERROR_ID_RANGE 4
39 #define SOLV_ERROR_OVERFLOW 5
40 #define SOLV_ERROR_CORRUPT 6
42 static Pool *mypool; /* for pool_debug... */
44 /*-----------------------------------------------------------------*/
45 /* .solv read functions */
52 read_u32(Repodata *data)
59 for (i = 0; i < 4; i++)
64 pool_debug(mypool, SAT_ERROR, "unexpected EOF\n");
65 data->error = SOLV_ERROR_EOF;
79 read_u8(Repodata *data)
88 pool_debug(mypool, SAT_ERROR, "unexpected EOF\n");
89 data->error = SOLV_ERROR_EOF;
101 read_id(Repodata *data, Id max)
108 for (i = 0; i < 5; i++)
113 pool_debug(mypool, SAT_ERROR, "unexpected EOF\n");
114 data->error = SOLV_ERROR_EOF;
122 pool_debug(mypool, SAT_ERROR, "read_id: id too large (%u/%u)\n", x, max);
123 data->error = SOLV_ERROR_ID_RANGE;
128 x = (x << 7) ^ c ^ 128;
130 pool_debug(mypool, SAT_ERROR, "read_id: id too long\n");
131 data->error = SOLV_ERROR_CORRUPT;
141 read_idarray(Repodata *data, Id max, Id *map, Id *store, Id *end, int relative)
154 pool_debug(mypool, SAT_ERROR, "unexpected EOF\n");
155 data->error = SOLV_ERROR_EOF;
160 x = (x << 6) | (c & 63);
163 if (x == 0 && c == 0x40)
168 pool_debug(mypool, SAT_ERROR, "read_idarray: array overflow\n");
169 data->error = SOLV_ERROR_OVERFLOW;
172 *store++ = SOLVABLE_PREREQMARKER;
182 pool_debug(mypool, SAT_ERROR, "read_idarray: id too large (%u/%u)\n", x, max);
183 data->error = SOLV_ERROR_ID_RANGE;
190 pool_debug(mypool, SAT_ERROR, "read_idarray: array overflow\n");
196 if (x == 0) /* already have trailing zero? */
200 pool_debug(mypool, SAT_ERROR, "read_idarray: array overflow\n");
201 data->error = SOLV_ERROR_OVERFLOW;
210 x = (x << 7) ^ c ^ 128;
215 read_str(Repodata *data, char **inbuf, unsigned *len)
217 unsigned char *buf = (unsigned char*)*inbuf;
220 buf = sat_malloc(1024);
225 while((c = getc(data->fp)) != 0)
229 pool_debug (mypool, SAT_ERROR, "unexpected EOF\n");
230 data->error = SOLV_ERROR_EOF;
233 /* Plus 1 as we also want to add the 0. */
237 /* Don't realloc on the inbuf, it might be on the stack. */
238 if (buf == (unsigned char*)*inbuf)
240 buf = sat_malloc(*len);
241 memcpy(buf, *inbuf, *len - 256);
244 buf = sat_realloc(buf, *len);
253 skip_item (Repodata *data, unsigned type, unsigned numid, unsigned numrel)
261 read_id(data, numid + numrel); /* just check Id */
264 read_id(data, numid + data->dirpool.ndirs); /* just check Id */
272 case TYPE_ATTR_STRING:
274 while (read_u8(data) != 0)
278 case TYPE_REL_IDARRAY:
279 case TYPE_ATTR_INTLIST:
280 while ((read_u8(data) & 0xc0) != 0)
283 case TYPE_DIRNUMNUMARRAY:
286 read_id(data, numid + data->dirpool.ndirs); /* just check Id */
288 if (!(read_id(data, 0) & 0x40))
292 case TYPE_DIRSTRARRAY:
295 Id id = read_id(data, 0);
296 while (read_u8(data) != 0)
302 case TYPE_COUNT_NAMED:
304 unsigned count = read_id(data, 0);
307 read_id(data, numid); /* Name */
308 unsigned t = read_id(data, TYPE_ATTR_TYPE_MAX + 1);
309 skip_item(data, t, numid, numrel);
315 unsigned count = read_id(data, 0);
316 unsigned t = read_id(data, TYPE_ATTR_TYPE_MAX + 1);
318 skip_item(data, t, numid, numrel);
321 case TYPE_ATTR_CHUNK:
327 case TYPE_ATTR_LOCALIDS:
328 while (read_id(data, 0) != 0)
332 pool_debug(mypool, SAT_ERROR, "unknown type %d\n", type);
333 data->error = SOLV_ERROR_CORRUPT;
339 key_cmp (const void *pa, const void *pb)
341 Repokey *a = (Repokey *)pa;
342 Repokey *b = (Repokey *)pb;
343 return a->name - b->name;
346 static void repodata_load_solv(Repodata *data);
349 parse_repodata(Repodata *maindata, Id *keyp, Repokey *keys, Id *idmap, unsigned numid, unsigned numrel, Repo *repo)
356 repo->repodata = sat_realloc2(repo->repodata, repo->nrepodata + 1, sizeof (*data));
357 data = repo->repodata + repo->nrepodata++;
358 memset(data, 0, sizeof(*data));
360 data->state = REPODATA_STUB;
361 data->loadcallback = repodata_load_solv;
363 while ((key = *keyp++) != 0)
366 switch (keys[key].type)
368 case TYPE_IDVALUEARRAY:
369 if (id != REPODATA_KEYS)
371 skip_item(maindata, TYPE_IDVALUEARRAY, numid, numrel);
374 ida = sat_calloc(keys[key].size, sizeof(Id));
375 ide = read_idarray(maindata, 0, 0, ida, ida + keys[key].size, 0);
379 pool_debug (mypool, SAT_ERROR, "invalid attribute data\n");
380 data->error = SOLV_ERROR_CORRUPT;
383 data->nkeys = 1 + (n >> 1);
384 data->keys = sat_malloc2(data->nkeys, sizeof(data->keys[0]));
385 memset(data->keys, 0, sizeof(Repokey));
386 for (i = 1, ide = ida; i < data->nkeys; i++)
390 pool_debug (mypool, SAT_ERROR, "invalid attribute data\n");
391 data->error = SOLV_ERROR_CORRUPT;
394 data->keys[i].name = idmap ? idmap[*ide++] : *ide++;
395 data->keys[i].type = *ide++;
396 data->keys[i].size = 0;
397 data->keys[i].storage = 0;
401 qsort(data->keys + 1, data->nkeys - 1, sizeof(data->keys[0]), key_cmp);
404 if (id != REPODATA_LOCATION)
405 skip_item(maindata, TYPE_STR, numid, numrel);
409 unsigned len = sizeof (buf);
410 char *filename = buf;
411 read_str(maindata, &filename, &len);
413 data->location = strdup(filename);
420 skip_item(maindata, keys[key].type, numid, numrel);
426 /*-----------------------------------------------------------------*/
430 skip_schema(Repodata *data, Id *keyp, Repokey *keys, unsigned int numid, unsigned int numrel)
433 while ((key = *keyp++) != 0)
434 skip_item(data, keys[key].type, numid, numrel);
437 /*-----------------------------------------------------------------*/
440 incore_add_id(Repodata *data, Id x)
443 /* make sure we have at least 5 bytes free */
444 if (data->incoredatafree < 5)
446 data->incoredata = sat_realloc(data->incoredata, data->incoredatalen + 1024);
447 data->incoredatafree = 1024;
449 dp = data->incoredata + data->incoredatalen;
455 *dp++ = (x >> 28) | 128;
457 *dp++ = (x >> 21) | 128;
458 *dp++ = (x >> 14) | 128;
461 *dp++ = (x >> 7) | 128;
463 data->incoredatafree -= dp - (data->incoredata + data->incoredatalen);
464 data->incoredatalen = dp - data->incoredata;
468 incore_add_u32(Repodata *data, unsigned int x)
471 /* make sure we have at least 4 bytes free */
472 if (data->incoredatafree < 4)
474 data->incoredata = sat_realloc(data->incoredata, data->incoredatalen + 1024);
475 data->incoredatafree = 1024;
477 dp = data->incoredata + data->incoredatalen;
482 data->incoredatafree -= 4;
483 data->incoredatalen += 4;
487 incore_add_u8(Repodata *data, unsigned int x)
490 /* make sure we have at least 1 byte free */
491 if (data->incoredatafree < 1)
493 data->incoredata = sat_realloc(data->incoredata, data->incoredatalen + 1024);
494 data->incoredatafree = 1024;
496 dp = data->incoredata + data->incoredatalen;
498 data->incoredatafree--;
499 data->incoredatalen++;
504 // ----------------------------------------------
508 * read repo from .solv file
513 repo_add_solv_parent(Repo *repo, FILE *fp, Repodata *parent)
515 Pool *pool = repo->pool;
517 unsigned int numid, numrel, numdir, numsolv;
518 unsigned int numkeys, numschemata, numinfo;
520 Attrstore *embedded_store = 0;
524 Offset *str; /* map Id -> Offset into string space */
525 char *strsp; /* repo string space */
526 char *sp; /* pointer into string space */
527 Id *idmap; /* map of repo Ids to pool Ids */
529 unsigned int hashmask, h;
535 unsigned int size_idarray;
536 Id *idarraydatap, *idarraydataend;
539 unsigned int solvflags;
540 unsigned int solvversion;
542 Id *schemadata, *schemadatap, *schemadataend;
546 struct _Stringpool *spool;
550 memset(&data, 0, sizeof(data));
556 if (read_u32(&data) != ('S' << 24 | 'O' << 16 | 'L' << 8 | 'V'))
558 pool_debug(pool, SAT_ERROR, "not a SOLV file\n");
559 return SOLV_ERROR_NOT_SOLV;
561 solvversion = read_u32(&data);
571 pool_debug(pool, SAT_ERROR, "unsupported SOLV version\n");
572 return SOLV_ERROR_UNSUPPORTED;
575 pool_freeidhashes(pool);
577 numid = read_u32(&data);
578 numrel = read_u32(&data);
579 if (solvversion >= SOLV_VERSION_4)
580 numdir = read_u32(&data);
583 numsolv = read_u32(&data);
584 numkeys = read_u32(&data);
585 numschemata = read_u32(&data);
586 numinfo = read_u32(&data);
587 solvflags = read_u32(&data);
589 if (solvversion < SOLV_VERSION_5)
592 if (numdir && numdir < 2)
594 pool_debug(pool, SAT_ERROR, "bad number of dirs\n");
595 return SOLV_ERROR_CORRUPT;
597 if (numinfo && solvversion < SOLV_VERSION_3)
599 pool_debug(pool, SAT_ERROR, "unsupported SOLV format (has info)\n");
600 return SOLV_ERROR_UNSUPPORTED;
607 pool_debug(pool, SAT_ERROR, "relations are forbidden in a store\n");
608 return SOLV_ERROR_CORRUPT;
612 pool_debug(pool, SAT_ERROR, "solvables are forbidden in a store\n");
613 return SOLV_ERROR_CORRUPT;
617 pool_debug(pool, SAT_ERROR, "info blocks are forbidden in a store\n");
618 return SOLV_ERROR_CORRUPT;
622 /******* Part 1: string IDs *****************************************/
624 sizeid = read_u32(&data); /* size of string+Id space */
627 * read strings and Ids
641 spool->stringspace = sat_malloc(7);
642 strcpy(spool->stringspace, "<NULL>");
647 /* alloc string buffer */
648 spool->stringspace = sat_realloc(spool->stringspace, spool->sstrings + sizeid + 1);
649 /* alloc string offsets (Id -> Offset into string space) */
650 spool->strings = sat_realloc2(spool->strings, spool->nstrings + numid, sizeof(Offset));
652 strsp = spool->stringspace;
653 str = spool->strings; /* array of offsets into strsp, indexed by Id */
655 /* point to _BEHIND_ already allocated string/Id space */
656 strsp += spool->sstrings;
660 * read new repo at end of pool
663 if ((solvflags & SOLV_FLAG_PREFIX_POOL) == 0)
665 if (sizeid && fread(strsp, sizeid, 1, fp) != 1)
667 pool_debug(pool, SAT_ERROR, "read error while reading strings\n");
668 return SOLV_ERROR_EOF;
673 unsigned int pfsize = read_u32(&data);
674 char *prefix = sat_malloc(pfsize);
678 if (pfsize && fread(prefix, pfsize, 1, fp) != 1)
680 pool_debug(pool, SAT_ERROR, "read error while reading strings\n");
682 return SOLV_ERROR_EOF;
684 for (i = 1; i < numid; i++)
686 int same = (unsigned char)*pp++;
687 size_t len = strlen (pp) + 1;
689 memcpy(dest, old_str, same);
690 memcpy(dest + same, pp, len);
697 strsp[sizeid] = 0; /* make string space \0 terminated */
700 /* make sure first entry is "" for a store */
703 /* no shared pool, thus no idmap and no unification */
708 pool_debug(pool, SAT_ERROR, "store strings don't start with ''\n");
709 return SOLV_ERROR_CORRUPT;
712 for (i = 1; i < spool->nstrings; i++)
714 if (sp >= strsp + sizeid)
716 pool_debug(pool, SAT_ERROR, "not enough strings\n");
717 return SOLV_ERROR_OVERFLOW;
720 sp += strlen(sp) + 1;
726 /* alloc id map for name and rel Ids. this maps ids in the solv files
727 * to the ids in our pool */
728 idmap = sat_calloc(numid + numrel, sizeof(Id));
731 * build hashes for all read strings
735 hashmask = mkmask(spool->nstrings + numid);
738 POOL_DEBUG(SAT_DEBUG_STATS, "read %d strings\n", numid);
739 POOL_DEBUG(SAT_DEBUG_STATS, "string hash buckets: %d\n", hashmask + 1);
743 * create hashtable with strings already in pool
746 hashtbl = sat_calloc(hashmask + 1, sizeof(Id));
747 for (i = 1; i < spool->nstrings; i++) /* leave out our dummy zero id */
749 h = strhash(spool->stringspace + spool->strings[i]) & hashmask;
750 hh = HASHCHAIN_START;
752 h = HASHCHAIN_NEXT(h, hh, hashmask);
757 * run over string space, calculate offsets
759 * build id map (maps solv Id -> pool Id)
762 for (i = 1; i < numid; i++)
764 if (sp >= strsp + sizeid)
768 pool_debug(pool, SAT_ERROR, "not enough strings\n");
769 return SOLV_ERROR_OVERFLOW;
771 if (!*sp) /* empty string */
779 h = strhash(sp) & hashmask;
780 hh = HASHCHAIN_START;
786 if (!strcmp(spool->stringspace + spool->strings[id], sp))
787 break; /* existing string */
788 h = HASHCHAIN_NEXT(h, hh, hashmask);
791 /* length == offset to next string */
793 if (id == ID_NULL) /* end of hash chain -> new string */
795 id = spool->nstrings++;
797 str[id] = spool->sstrings; /* save Offset */
798 if (sp != spool->stringspace + spool->sstrings) /* not at end-of-buffer */
799 memmove(spool->stringspace + spool->sstrings, sp, l); /* append to pool buffer */
800 spool->sstrings += l;
802 idmap[i] = id; /* repo relative -> pool relative */
803 sp += l; /* next string */
807 pool_shrink_strings(pool); /* vacuum */
810 /******* Part 2: Relation IDs ***************************************/
820 pool->rels = sat_realloc2(pool->rels, pool->nrels + numrel, sizeof(Reldep));
823 hashmask = mkmask(pool->nrels + numrel);
825 POOL_DEBUG(SAT_DEBUG_STATS, "read %d rels\n", numrel);
826 POOL_DEBUG(SAT_DEBUG_STATS, "rel hash buckets: %d\n", hashmask + 1);
829 * prep hash table with already existing RelDeps
832 hashtbl = sat_calloc(hashmask + 1, sizeof(Id));
833 for (i = 1; i < pool->nrels; i++)
835 h = relhash(ran[i].name, ran[i].evr, ran[i].flags) & hashmask;
836 hh = HASHCHAIN_START;
838 h = HASHCHAIN_NEXT(h, hh, hashmask);
843 * read RelDeps from repo
846 for (i = 0; i < numrel; i++)
848 name = read_id(&data, i + numid); /* read (repo relative) Ids */
849 evr = read_id(&data, i + numid);
850 flags = read_u8(&data);
851 name = idmap[name]; /* map to (pool relative) Ids */
853 h = relhash(name, evr, flags) & hashmask;
854 hh = HASHCHAIN_START;
858 if (id == ID_NULL) /* end of hash chain */
860 if (ran[id].name == name && ran[id].evr == evr && ran[id].flags == flags)
862 h = HASHCHAIN_NEXT(h, hh, hashmask);
864 if (id == ID_NULL) /* new RelDep */
870 ran[id].flags = flags;
872 idmap[i + numid] = MAKERELDEP(id); /* fill Id map */
875 pool_shrink_rels(pool); /* vacuum */
879 /******* Part 3: Dirs ***********************************************/
882 data.dirpool.dirs = sat_malloc2(numdir, sizeof(Id));
883 data.dirpool.ndirs = numdir;
884 data.dirpool.dirs[0] = 0; /* dir 0: virtual root */
885 data.dirpool.dirs[1] = 1; /* dir 1: / */
886 for (i = 2; i < numdir; i++)
888 id = read_id(&data, i + numid);
890 data.dirpool.dirs[i] = -(id - numid);
892 data.dirpool.dirs[i] = idmap[id];
894 data.dirpool.dirs[i] = id;
898 /******* Part 4: Keys ***********************************************/
900 keys = sat_calloc(numkeys, sizeof(*keys));
901 /* keys start at 1 */
902 for (i = 1; i < numkeys; i++)
904 id = read_id(&data, numid);
908 keys[i].type = read_id(&data, 0);
909 keys[i].size = read_id(&data, 0);
910 if (solvversion >= SOLV_VERSION_5)
912 keys[i].storage = read_id(&data, 0);
915 keys[i].storage = KEY_STORAGE_DROPPED;
918 keys[i].storage = KEY_STORAGE_INCORE;
921 switch (keys[i].type)
927 case TYPE_DIRNUMNUMARRAY:
928 keys[i].storage = KEY_STORAGE_INCORE;
936 case SOLVABLE_VENDOR:
937 keys[i].storage = KEY_STORAGE_SOLVABLE;
940 keys[i].storage = KEY_STORAGE_INCORE;
945 case TYPE_REL_IDARRAY:
946 if (id >= INTERESTED_START && id <= INTERESTED_END)
947 keys[i].storage = KEY_STORAGE_SOLVABLE;
949 keys[i].storage = KEY_STORAGE_INCORE;
952 if (id == RPM_RPMDBID)
953 keys[i].storage = KEY_STORAGE_SOLVABLE;
955 keys[i].storage = KEY_STORAGE_INCORE;
962 have_xdata = parent ? 1 : 0;
963 for (i = 1; i < numkeys; i++)
964 if (keys[i].storage == KEY_STORAGE_INCORE || keys[i].storage == KEY_STORAGE_VERTICAL_OFFSET)
968 data.nkeys = numkeys;
970 /******* Part 5: Schemata ********************************************/
972 id = read_id(&data, 0);
973 schemadata = sat_calloc(id + 1, sizeof(Id));
974 schemadatap = schemadata + 1;
975 schemadataend = schemadatap + id;
976 schemata = sat_calloc(numschemata, sizeof(Id));
977 for (i = 1; i < numschemata; i++)
979 schemata[i] = schemadatap - schemadata;
980 schemadatap = read_idarray(&data, numid, 0, schemadatap, schemadataend, 0);
982 data.schemata = schemata;
983 data.nschemata = numschemata;
984 data.schemadata = schemadata;
985 data.schemadatalen = schemadataend - data.schemadata;
988 /******* Part 6: Info ***********************************************/
989 for (i = 0; i < numinfo; i++)
991 /* for now we're just interested in data that starts with
992 * the repodata_external id
995 id = read_id(&data, numschemata);
996 if (solvversion < SOLV_VERSION_5)
998 keyp = schemadata + schemata[id];
1000 if (keys[key].name == REPODATA_EXTERNAL && keys[key].type == TYPE_VOID)
1002 /* external data for some ids */
1003 parse_repodata(&data, keyp, keys, idmap, numid, numrel, repo);
1006 skip_schema(&data, keyp, keys, numid, numrel);
1010 /******* Part 7: packed sizes (optional) ****************************/
1012 if ((solvflags & SOLV_FLAG_PACKEDSIZES) != 0)
1014 exists = sat_malloc (numsolv);
1015 for (i = 0; i < numsolv; i++)
1016 exists[i] = read_id(&data, 0) != 0;
1020 /******* Part 8: item data *******************************************/
1022 /* calculate idarray size */
1024 for (i = 1; i < numkeys; i++)
1027 if ((keys[i].type == TYPE_IDARRAY || keys[i].type == TYPE_REL_IDARRAY)
1028 && id >= INTERESTED_START && id <= INTERESTED_END)
1029 size_idarray += keys[i].size;
1032 /* allocate needed space in repo */
1035 repo_reserve_ids(repo, 0, size_idarray);
1036 idarraydatap = repo->idarraydata + repo->idarraysize;
1037 repo->idarraysize += size_idarray;
1038 idarraydataend = idarraydatap + size_idarray;
1047 /* read solvables */
1050 s = pool_id2solvable(pool, repo_add_solvable_block(repo, numsolv));
1051 /* store start and end of our id block */
1052 data.start = s - pool->solvables;
1053 data.end = data.start + numsolv;
1059 data.incoreoffset = sat_calloc(numsolv, sizeof(Id));
1060 for (i = 0; i < numsolv; i++, s++)
1065 if (exists && !exists[i])
1067 id = read_id(&data, numschemata);
1068 if (solvversion < SOLV_VERSION_5)
1072 data.incoreoffset[i] = data.incoredatalen;
1073 incore_add_id(&data, id);
1075 keyp = schemadata + schemata[id];
1076 while ((key = *keyp++) != 0)
1078 id = keys[key].name;
1080 fprintf(stderr, "solv %d name %d type %d class %d\n", i, id, keys[key].type, keys[key].storage);
1082 if (keys[key].storage == KEY_STORAGE_VERTICAL_OFFSET)
1084 /* copy offset/length into incore */
1085 did = read_id(&data, 0);
1086 incore_add_id(&data, did);
1087 did = read_id(&data, 0);
1088 incore_add_id(&data, did);
1091 switch (keys[key].type)
1097 did = read_id(&data, numid + numrel);
1100 if (id == SOLVABLE_NAME)
1102 else if (id == SOLVABLE_ARCH)
1104 else if (id == SOLVABLE_EVR)
1106 else if (id == SOLVABLE_VENDOR)
1108 else if (keys[key].storage == KEY_STORAGE_INCORE)
1109 incore_add_id(&data, did);
1111 POOL_DEBUG(SAT_DEBUG_STATS, "%s -> %s\n", id2str(pool, id), id2str(pool, did));
1115 did = read_id(&data, 0);
1116 if (keys[key].storage == KEY_STORAGE_INCORE)
1117 incore_add_id(&data, did);
1119 POOL_DEBUG(SAT_DEBUG_STATS, "%s -> %d\n", id2str(pool, id), did);
1123 h = read_u32(&data);
1125 POOL_DEBUG(SAT_DEBUG_STATS, "%s -> %u\n", id2str(pool, id), h);
1127 if (id == RPM_RPMDBID)
1130 repo->rpmdbid = sat_calloc(numsolv, sizeof(Id));
1131 repo->rpmdbid[i] = h;
1133 else if (keys[key].storage == KEY_STORAGE_INCORE)
1134 incore_add_u32(&data, h);
1137 if (keys[key].storage == KEY_STORAGE_INCORE)
1139 while ((h = read_u8(&data)) != 0)
1140 incore_add_u8(&data, h);
1141 incore_add_u8(&data, 0);
1145 while (read_u8(&data) != 0)
1150 case TYPE_REL_IDARRAY:
1151 if (id < INTERESTED_START || id > INTERESTED_END)
1153 if (keys[key].storage == KEY_STORAGE_INCORE)
1157 Id old = 0, rel = keys[key].type == TYPE_REL_IDARRAY ? SOLVABLE_PREREQMARKER : 0;
1160 did = read_id(&data, 0);
1162 did = (did & 0x3f) | ((did >> 1) & ~0x3f);
1176 if (did >= numid + numrel)
1179 did = ((did & ~0x3f) << 1) | h;
1180 incore_add_id(&data, did);
1186 while (((h = read_u8(&data)) & 0xc0) != 0)
1187 incore_add_u8(&data, h);
1193 while ((read_u8(&data) & 0xc0) != 0)
1199 ido = idarraydatap - repo->idarraydata;
1200 idarraydatap = read_idarray(&data, numid + numrel, idmap, idarraydatap, idarraydataend, keys[key].type == TYPE_REL_IDARRAY);
1201 if (id == SOLVABLE_PROVIDES)
1203 else if (id == SOLVABLE_OBSOLETES)
1205 else if (id == SOLVABLE_CONFLICTS)
1207 else if (id == SOLVABLE_REQUIRES)
1209 else if (id == SOLVABLE_RECOMMENDS)
1211 else if (id == SOLVABLE_SUPPLEMENTS)
1212 s->supplements = ido;
1213 else if (id == SOLVABLE_SUGGESTS)
1215 else if (id == SOLVABLE_ENHANCES)
1217 else if (id == SOLVABLE_FRESHENS)
1220 POOL_DEBUG(SAT_DEBUG_STATS, "%s ->\n", id2str(pool, id));
1221 for (; repo->idarraydata[ido]; ido++)
1222 POOL_DEBUG(SAT_DEBUG_STATS," %s\n", dep2str(pool, repo->idarraydata[ido]));
1229 case TYPE_ATTR_CHUNK:
1230 case TYPE_ATTR_STRING:
1231 case TYPE_ATTR_INTLIST:
1232 case TYPE_ATTR_LOCALIDS:
1233 if (!embedded_store)
1234 embedded_store = new_store (pool);
1235 add_attr_from_file (embedded_store, i, id, keys[key].type, idmap, numid, &data, keys[key].size);
1238 case TYPE_DIRNUMNUMARRAY:
1242 did = read_id(&data, numdir);
1243 num = read_id(&data, 0);
1244 num2 = read_id(&data, 0);
1245 if (keys[key].storage == KEY_STORAGE_INCORE)
1248 POOL_DEBUG(SAT_DEBUG_STATS, "%s -> %d %d %d\n", id2str(pool, id), did, num, num2);
1250 incore_add_id(&data, did);
1251 incore_add_id(&data, num);
1252 incore_add_id(&data, num2);
1260 skip_item(&data, keys[key].type, numid, numrel);
1267 /* free solvables */
1268 repo_free_solvable_block(repo, data.start, data.end - data.start, 1);
1270 repo->idarraysize -= size_idarray;
1271 /* free incore data */
1272 data.incoredata = sat_free(data.incoredata);
1273 data.incoredatalen = data.incoredatafree = 0;
1276 if (data.incoredatafree)
1278 /* shrink excess size */
1279 data.incoredata = sat_realloc(data.incoredata, data.incoredatalen);
1280 data.incoredatafree = 0;
1283 for (i = 1; i < numkeys; i++)
1284 if (keys[i].storage == KEY_STORAGE_VERTICAL_OFFSET)
1286 if (i < numkeys && !data.error)
1289 unsigned int pagesize;
1291 /* we have vertical data, make it available */
1292 data.verticaloffset = sat_calloc(numkeys, sizeof(Id));
1293 for (i = 1; i < numkeys; i++)
1294 if (keys[i].storage == KEY_STORAGE_VERTICAL_OFFSET)
1296 data.verticaloffset[i] = fileoffset;
1297 fileoffset += keys[i].size;
1299 data.lastverticaloffset = fileoffset;
1300 pagesize = read_u32(&data);
1301 repodata_read_or_setup_pages(&data, pagesize, fileoffset);
1305 /* no longer needed */
1312 sat_free(parent->schemata);
1313 sat_free(parent->schemadata);
1314 sat_free(parent->keys);
1317 else if (data.incoredatalen || data.fp)
1319 /* we got some data, make it available */
1320 repo->repodata = sat_realloc2(repo->repodata, repo->nrepodata + 1, sizeof(data));
1321 repo->repodata[repo->nrepodata++] = data;
1326 sat_free(data.dirpool.dirs);
1327 sat_free(data.incoreoffset);
1329 sat_free(schemadata);
1337 attr_store_pack (embedded_store);
1338 /* If we have any attributes we also have pages. */
1339 read_or_setup_pages (fp, embedded_store);
1340 /* The NULL name here means embedded attributes. */
1341 repo_add_attrstore (repo, embedded_store, NULL);
1350 repo_add_solv(Repo *repo, FILE *fp)
1352 return repo_add_solv_parent(repo, fp, 0);
1356 repodata_load_solv(Repodata *data)
1360 Pool *pool = data->repo->pool;
1361 if (!pool->loadcallback)
1363 data->state = REPODATA_ERROR;
1366 fp = pool->loadcallback(pool->loadcallback_data, pool, data);
1373 data->state = REPODATA_ERROR;
1376 if (repo_add_solv_parent(data->repo, fp, data))
1377 data->state = REPODATA_ERROR;
1379 data->state = REPODATA_AVAILABLE;