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 #define INTERESTED_START SOLVABLE_NAME
30 #define INTERESTED_END SOLVABLE_FRESHENS
32 #define SOLV_ERROR_NOT_SOLV 1
33 #define SOLV_ERROR_UNSUPPORTED 2
34 #define SOLV_ERROR_EOF 3
35 #define SOLV_ERROR_ID_RANGE 4
36 #define SOLV_ERROR_OVERFLOW 5
37 #define SOLV_ERROR_CORRUPT 6
39 static Pool *mypool; /* for pool_debug... */
41 /*-----------------------------------------------------------------*/
42 /* .solv read functions */
49 read_u32(Repodata *data)
56 for (i = 0; i < 4; i++)
61 pool_debug(mypool, SAT_ERROR, "unexpected EOF\n");
62 data->error = SOLV_ERROR_EOF;
76 read_u8(Repodata *data)
85 pool_debug(mypool, SAT_ERROR, "unexpected EOF\n");
86 data->error = SOLV_ERROR_EOF;
98 read_id(Repodata *data, Id max)
105 for (i = 0; i < 5; i++)
110 pool_debug(mypool, SAT_ERROR, "unexpected EOF\n");
111 data->error = SOLV_ERROR_EOF;
119 pool_debug(mypool, SAT_ERROR, "read_id: id too large (%u/%u)\n", x, max);
120 data->error = SOLV_ERROR_ID_RANGE;
125 x = (x << 7) ^ c ^ 128;
127 pool_debug(mypool, SAT_ERROR, "read_id: id too long\n");
128 data->error = SOLV_ERROR_CORRUPT;
138 read_idarray(Repodata *data, Id max, Id *map, Id *store, Id *end, int relative)
151 pool_debug(mypool, SAT_ERROR, "unexpected EOF\n");
152 data->error = SOLV_ERROR_EOF;
157 x = (x << 6) | (c & 63);
160 if (x == 0 && c == 0x40)
165 pool_debug(mypool, SAT_ERROR, "read_idarray: array overflow\n");
166 data->error = SOLV_ERROR_OVERFLOW;
169 *store++ = SOLVABLE_PREREQMARKER;
179 pool_debug(mypool, SAT_ERROR, "read_idarray: id too large (%u/%u)\n", x, max);
180 data->error = SOLV_ERROR_ID_RANGE;
187 pool_debug(mypool, SAT_ERROR, "read_idarray: array overflow\n");
193 if (x == 0) /* already have trailing zero? */
197 pool_debug(mypool, SAT_ERROR, "read_idarray: array overflow\n");
198 data->error = SOLV_ERROR_OVERFLOW;
207 x = (x << 7) ^ c ^ 128;
212 read_str(Repodata *data, char **inbuf, unsigned *len)
214 unsigned char *buf = (unsigned char*)*inbuf;
217 buf = sat_malloc(1024);
222 while((c = getc(data->fp)) != 0)
226 pool_debug (mypool, SAT_ERROR, "unexpected EOF\n");
227 data->error = SOLV_ERROR_EOF;
230 /* Plus 1 as we also want to add the 0. */
234 /* Don't realloc on the inbuf, it might be on the stack. */
235 if (buf == (unsigned char*)*inbuf)
237 buf = sat_malloc(*len);
238 memcpy(buf, *inbuf, *len - 256);
241 buf = sat_realloc(buf, *len);
250 skip_item (Repodata *data, unsigned type, unsigned numid, unsigned numrel)
258 read_id(data, numid + numrel); /* just check Id */
261 read_id(data, numid + data->dirpool.ndirs); /* just check Id */
269 case TYPE_ATTR_STRING:
271 while (read_u8(data) != 0)
275 case TYPE_REL_IDARRAY:
276 case TYPE_ATTR_INTLIST:
277 while ((read_u8(data) & 0xc0) != 0)
280 case TYPE_DIRNUMNUMARRAY:
283 read_id(data, numid + data->dirpool.ndirs); /* just check Id */
285 if (!(read_id(data, 0) & 0x40))
289 case TYPE_DIRSTRARRAY:
292 Id id = read_id(data, 0);
293 while (read_u8(data) != 0)
299 case TYPE_COUNT_NAMED:
301 unsigned count = read_id(data, 0);
304 read_id(data, numid); /* Name */
305 unsigned t = read_id(data, TYPE_ATTR_TYPE_MAX + 1);
306 skip_item(data, t, numid, numrel);
312 unsigned count = read_id(data, 0);
313 unsigned t = read_id(data, TYPE_ATTR_TYPE_MAX + 1);
315 skip_item(data, t, numid, numrel);
318 case TYPE_ATTR_CHUNK:
324 case TYPE_ATTR_LOCALIDS:
325 while (read_id(data, 0) != 0)
329 pool_debug(mypool, SAT_ERROR, "unknown type %d\n", type);
330 data->error = SOLV_ERROR_CORRUPT;
336 key_cmp (const void *pa, const void *pb)
338 Repokey *a = (Repokey *)pa;
339 Repokey *b = (Repokey *)pb;
340 return a->name - b->name;
343 static void repodata_load_solv(Repodata *data);
346 parse_repodata(Repodata *maindata, Id *keyp, Repokey *keys, Id *idmap, unsigned numid, unsigned numrel, Repo *repo)
353 repo->repodata = sat_realloc2(repo->repodata, repo->nrepodata + 1, sizeof (*data));
354 data = repo->repodata + repo->nrepodata++;
355 memset(data, 0, sizeof(*data));
357 data->state = REPODATA_STUB;
358 data->loadcallback = repodata_load_solv;
360 while ((key = *keyp++) != 0)
363 switch (keys[key].type)
365 case TYPE_IDVALUEARRAY:
366 if (id != REPODATA_KEYS)
368 skip_item(maindata, TYPE_IDVALUEARRAY, numid, numrel);
371 /* read_idarray writes a terminating 0, that's why the + 1 */
372 ida = sat_calloc(keys[key].size + 1, sizeof(Id));
373 ide = read_idarray(maindata, 0, 0, ida, ida + keys[key].size + 1, 0);
377 pool_debug (mypool, SAT_ERROR, "invalid attribute data\n");
378 data->error = SOLV_ERROR_CORRUPT;
381 data->nkeys = 1 + (n >> 1);
382 data->keys = sat_malloc2(data->nkeys, sizeof(data->keys[0]));
383 memset(data->keys, 0, sizeof(Repokey));
384 for (i = 1, ide = ida; i < data->nkeys; i++)
388 pool_debug (mypool, SAT_ERROR, "invalid attribute data\n");
389 data->error = SOLV_ERROR_CORRUPT;
392 data->keys[i].name = idmap ? idmap[*ide++] : *ide++;
393 data->keys[i].type = *ide++;
394 data->keys[i].size = 0;
395 data->keys[i].storage = 0;
399 qsort(data->keys + 1, data->nkeys - 1, sizeof(data->keys[0]), key_cmp);
402 if (id != REPODATA_LOCATION)
403 skip_item(maindata, TYPE_STR, numid, numrel);
407 unsigned len = sizeof (buf);
408 char *filename = buf;
409 read_str(maindata, &filename, &len);
410 data->location = strdup(filename);
416 skip_item(maindata, keys[key].type, numid, numrel);
422 /*-----------------------------------------------------------------*/
426 skip_schema(Repodata *data, Id *keyp, Repokey *keys, unsigned int numid, unsigned int numrel)
429 while ((key = *keyp++) != 0)
430 skip_item(data, keys[key].type, numid, numrel);
433 /*-----------------------------------------------------------------*/
436 incore_add_id(Repodata *data, Id x)
439 /* make sure we have at least 5 bytes free */
440 if (data->incoredatafree < 5)
442 data->incoredata = sat_realloc(data->incoredata, data->incoredatalen + 1024);
443 data->incoredatafree = 1024;
445 dp = data->incoredata + data->incoredatalen;
451 *dp++ = (x >> 28) | 128;
453 *dp++ = (x >> 21) | 128;
454 *dp++ = (x >> 14) | 128;
457 *dp++ = (x >> 7) | 128;
459 data->incoredatafree -= dp - (data->incoredata + data->incoredatalen);
460 data->incoredatalen = dp - data->incoredata;
464 incore_add_u32(Repodata *data, unsigned int x)
467 /* make sure we have at least 4 bytes free */
468 if (data->incoredatafree < 4)
470 data->incoredata = sat_realloc(data->incoredata, data->incoredatalen + 1024);
471 data->incoredatafree = 1024;
473 dp = data->incoredata + data->incoredatalen;
478 data->incoredatafree -= 4;
479 data->incoredatalen += 4;
483 incore_add_u8(Repodata *data, unsigned int x)
486 /* make sure we have at least 1 byte free */
487 if (data->incoredatafree < 1)
489 data->incoredata = sat_realloc(data->incoredata, data->incoredatalen + 1024);
490 data->incoredatafree = 1024;
492 dp = data->incoredata + data->incoredatalen;
494 data->incoredatafree--;
495 data->incoredatalen++;
500 // ----------------------------------------------
504 * read repo from .solv file
509 repo_add_solv_parent(Repo *repo, FILE *fp, Repodata *parent)
511 Pool *pool = repo->pool;
513 unsigned int numid, numrel, numdir, numsolv;
514 unsigned int numkeys, numschemata, numinfo;
517 Offset *str; /* map Id -> Offset into string space */
518 char *strsp; /* repo string space */
519 char *sp; /* pointer into string space */
520 Id *idmap; /* map of repo Ids to pool Ids */
522 unsigned int hashmask, h;
528 unsigned int size_idarray;
529 Id *idarraydatap, *idarraydataend;
532 unsigned int solvflags;
533 unsigned int solvversion;
535 Id *schemadata, *schemadatap, *schemadataend;
538 unsigned oldnrepodata;
540 struct _Stringpool *spool;
544 memset(&data, 0, sizeof(data));
550 if (read_u32(&data) != ('S' << 24 | 'O' << 16 | 'L' << 8 | 'V'))
552 pool_debug(pool, SAT_ERROR, "not a SOLV file\n");
553 return SOLV_ERROR_NOT_SOLV;
555 solvversion = read_u32(&data);
563 /* Version 6 existed only intermittantly. It's equivalent to
568 pool_debug(pool, SAT_ERROR, "unsupported SOLV version\n");
569 return SOLV_ERROR_UNSUPPORTED;
572 pool_freeidhashes(pool);
574 numid = read_u32(&data);
575 numrel = read_u32(&data);
576 if (solvversion >= SOLV_VERSION_4)
577 numdir = read_u32(&data);
580 numsolv = read_u32(&data);
581 numkeys = read_u32(&data);
582 numschemata = read_u32(&data);
583 numinfo = read_u32(&data);
584 solvflags = read_u32(&data);
586 if (solvversion < SOLV_VERSION_5)
589 if (numdir && numdir < 2)
591 pool_debug(pool, SAT_ERROR, "bad number of dirs\n");
592 return SOLV_ERROR_CORRUPT;
594 if (numinfo && solvversion < SOLV_VERSION_3)
596 pool_debug(pool, SAT_ERROR, "unsupported SOLV format (has info)\n");
597 return SOLV_ERROR_UNSUPPORTED;
604 pool_debug(pool, SAT_ERROR, "relations are forbidden in a store\n");
605 return SOLV_ERROR_CORRUPT;
607 if (parent->end - parent->start != numsolv)
609 pool_debug(pool, SAT_ERROR, "unequal number of solvables in a store\n");
610 return SOLV_ERROR_CORRUPT;
614 pool_debug(pool, SAT_ERROR, "info blocks are forbidden in a store\n");
615 return SOLV_ERROR_CORRUPT;
619 /******* Part 1: string IDs *****************************************/
621 sizeid = read_u32(&data); /* size of string+Id space */
624 * read strings and Ids
639 spool->stringspace = sat_malloc(7);
640 strcpy(spool->stringspace, "<NULL>");
645 /* alloc string buffer */
646 spool->stringspace = sat_realloc(spool->stringspace, spool->sstrings + sizeid + 1);
647 /* alloc string offsets (Id -> Offset into string space) */
648 spool->strings = sat_realloc2(spool->strings, spool->nstrings + numid, sizeof(Offset));
650 strsp = spool->stringspace;
651 str = spool->strings; /* array of offsets into strsp, indexed by Id */
653 /* point to _BEHIND_ already allocated string/Id space */
654 strsp += spool->sstrings;
658 * read new repo at end of pool
661 if ((solvflags & SOLV_FLAG_PREFIX_POOL) == 0)
663 if (sizeid && fread(strsp, sizeid, 1, fp) != 1)
665 pool_debug(pool, SAT_ERROR, "read error while reading strings\n");
666 return SOLV_ERROR_EOF;
671 unsigned int pfsize = read_u32(&data);
672 char *prefix = sat_malloc(pfsize);
676 if (pfsize && fread(prefix, pfsize, 1, fp) != 1)
678 pool_debug(pool, SAT_ERROR, "read error while reading strings\n");
680 return SOLV_ERROR_EOF;
682 for (i = 1; i < numid; i++)
684 int same = (unsigned char)*pp++;
685 size_t len = strlen (pp) + 1;
687 memcpy(dest, old_str, same);
688 memcpy(dest + same, pp, len);
695 strsp[sizeid] = 0; /* make string space \0 terminated */
700 /* no shared pool, thus no idmap and no unification */
702 spool->nstrings = numid;
704 for (i = 1; i < spool->nstrings; i++)
706 if (sp >= strsp + sizeid)
708 pool_debug(pool, SAT_ERROR, "not enough strings\n");
709 return SOLV_ERROR_OVERFLOW;
711 str[i] = sp - spool->stringspace;
712 sp += strlen(sp) + 1;
714 spool->sstrings = sp - spool->stringspace;
719 /* alloc id map for name and rel Ids. this maps ids in the solv files
720 * to the ids in our pool */
721 idmap = sat_calloc(numid + numrel, sizeof(Id));
724 * build hashes for all read strings
728 hashmask = mkmask(spool->nstrings + numid);
731 POOL_DEBUG(SAT_DEBUG_STATS, "read %d strings\n", numid);
732 POOL_DEBUG(SAT_DEBUG_STATS, "string hash buckets: %d\n", hashmask + 1);
736 * create hashtable with strings already in pool
739 hashtbl = sat_calloc(hashmask + 1, sizeof(Id));
740 for (i = 1; i < spool->nstrings; i++) /* leave out our dummy zero id */
742 h = strhash(spool->stringspace + spool->strings[i]) & hashmask;
743 hh = HASHCHAIN_START;
745 h = HASHCHAIN_NEXT(h, hh, hashmask);
750 * run over string space, calculate offsets
752 * build id map (maps solv Id -> pool Id)
755 for (i = 1; i < numid; i++)
757 if (sp >= strsp + sizeid)
761 pool_debug(pool, SAT_ERROR, "not enough strings\n");
762 return SOLV_ERROR_OVERFLOW;
764 if (!*sp) /* empty string */
772 h = strhash(sp) & hashmask;
773 hh = HASHCHAIN_START;
779 if (!strcmp(spool->stringspace + spool->strings[id], sp))
780 break; /* existing string */
781 h = HASHCHAIN_NEXT(h, hh, hashmask);
784 /* length == offset to next string */
786 if (id == ID_NULL) /* end of hash chain -> new string */
788 id = spool->nstrings++;
790 str[id] = spool->sstrings; /* save Offset */
791 if (sp != spool->stringspace + spool->sstrings) /* not at end-of-buffer */
792 memmove(spool->stringspace + spool->sstrings, sp, l); /* append to pool buffer */
793 spool->sstrings += l;
795 idmap[i] = id; /* repo relative -> pool relative */
796 sp += l; /* next string */
800 pool_shrink_strings(pool); /* vacuum */
803 /******* Part 2: Relation IDs ***************************************/
813 pool->rels = sat_realloc2(pool->rels, pool->nrels + numrel, sizeof(Reldep));
816 hashmask = mkmask(pool->nrels + numrel);
818 POOL_DEBUG(SAT_DEBUG_STATS, "read %d rels\n", numrel);
819 POOL_DEBUG(SAT_DEBUG_STATS, "rel hash buckets: %d\n", hashmask + 1);
822 * prep hash table with already existing RelDeps
825 hashtbl = sat_calloc(hashmask + 1, sizeof(Id));
826 for (i = 1; i < pool->nrels; i++)
828 h = relhash(ran[i].name, ran[i].evr, ran[i].flags) & hashmask;
829 hh = HASHCHAIN_START;
831 h = HASHCHAIN_NEXT(h, hh, hashmask);
836 * read RelDeps from repo
839 for (i = 0; i < numrel; i++)
841 name = read_id(&data, i + numid); /* read (repo relative) Ids */
842 evr = read_id(&data, i + numid);
843 flags = read_u8(&data);
844 name = idmap[name]; /* map to (pool relative) Ids */
846 h = relhash(name, evr, flags) & hashmask;
847 hh = HASHCHAIN_START;
851 if (id == ID_NULL) /* end of hash chain */
853 if (ran[id].name == name && ran[id].evr == evr && ran[id].flags == flags)
855 h = HASHCHAIN_NEXT(h, hh, hashmask);
857 if (id == ID_NULL) /* new RelDep */
863 ran[id].flags = flags;
865 idmap[i + numid] = MAKERELDEP(id); /* fill Id map */
868 pool_shrink_rels(pool); /* vacuum */
872 /******* Part 3: Dirs ***********************************************/
875 data.dirpool.dirs = sat_malloc2(numdir, sizeof(Id));
876 data.dirpool.ndirs = numdir;
877 data.dirpool.dirs[0] = 0; /* dir 0: virtual root */
878 data.dirpool.dirs[1] = 1; /* dir 1: / */
879 for (i = 2; i < numdir; i++)
881 id = read_id(&data, i + numid);
883 data.dirpool.dirs[i] = -(id - numid);
885 data.dirpool.dirs[i] = idmap[id];
887 data.dirpool.dirs[i] = id;
891 /******* Part 4: Keys ***********************************************/
893 keys = sat_calloc(numkeys, sizeof(*keys));
894 /* keys start at 1 */
895 for (i = 1; i < numkeys; i++)
897 id = read_id(&data, numid);
901 id = str2id(pool, stringpool_id2str(spool, id), 1);
903 keys[i].type = read_id(&data, 0);
904 keys[i].size = read_id(&data, 0);
906 fprintf (stderr, "key %d %s %d %d\n", i, id2str(pool,id), keys[i].type,
909 if (solvversion >= SOLV_VERSION_5)
911 keys[i].storage = read_id(&data, 0);
914 keys[i].storage = KEY_STORAGE_DROPPED;
917 keys[i].storage = KEY_STORAGE_INCORE;
920 switch (keys[i].type)
926 case TYPE_DIRNUMNUMARRAY:
927 keys[i].storage = KEY_STORAGE_INCORE;
935 case SOLVABLE_VENDOR:
936 keys[i].storage = KEY_STORAGE_SOLVABLE;
939 keys[i].storage = KEY_STORAGE_INCORE;
944 case TYPE_REL_IDARRAY:
945 if (id >= INTERESTED_START && id <= INTERESTED_END)
946 keys[i].storage = KEY_STORAGE_SOLVABLE;
948 keys[i].storage = KEY_STORAGE_INCORE;
951 if (id == RPM_RPMDBID)
952 keys[i].storage = KEY_STORAGE_SOLVABLE;
954 keys[i].storage = KEY_STORAGE_INCORE;
961 have_xdata = parent ? 1 : 0;
962 for (i = 1; i < numkeys; i++)
963 if (keys[i].storage == KEY_STORAGE_INCORE || keys[i].storage == KEY_STORAGE_VERTICAL_OFFSET)
967 data.nkeys = numkeys;
969 /******* Part 5: Schemata ********************************************/
971 id = read_id(&data, 0);
972 schemadata = sat_calloc(id + 1, sizeof(Id));
973 schemadatap = schemadata + 1;
974 schemadataend = schemadatap + id;
975 schemata = sat_calloc(numschemata, sizeof(Id));
976 for (i = 1; i < numschemata; i++)
978 schemata[i] = schemadatap - schemadata;
979 schemadatap = read_idarray(&data, numid, 0, schemadatap, schemadataend, 0);
981 Id *sp = schemadata + schemata[i];
982 fprintf (stderr, "schema %d:", i);
984 fprintf (stderr, " %d", *sp);
985 fprintf (stderr, "\n");
988 data.schemata = schemata;
989 data.nschemata = numschemata;
990 data.schemadata = schemadata;
991 data.schemadatalen = schemadataend - data.schemadata;
994 /******* Part 6: Info ***********************************************/
995 oldnrepodata = repo->nrepodata;
996 for (i = 0; i < numinfo; i++)
998 /* for now we're just interested in data that starts with
999 * the repodata_external id
1002 id = read_id(&data, numschemata);
1003 if (solvversion < SOLV_VERSION_5)
1005 keyp = schemadata + schemata[id];
1007 if (keys[key].name == REPODATA_EXTERNAL && keys[key].type == TYPE_VOID)
1009 /* external data for some ids */
1010 parse_repodata(&data, keyp, keys, idmap, numid, numrel, repo);
1013 skip_schema(&data, keyp, keys, numid, numrel);
1017 /******* Part 7: packed sizes (optional) ****************************/
1019 if ((solvflags & SOLV_FLAG_PACKEDSIZES) != 0)
1021 exists = sat_malloc (numsolv);
1022 for (i = 0; i < numsolv; i++)
1023 exists[i] = read_id(&data, 0) != 0;
1027 /******* Part 8: item data *******************************************/
1029 /* calculate idarray size */
1031 for (i = 1; i < numkeys; i++)
1034 if ((keys[i].type == TYPE_IDARRAY || keys[i].type == TYPE_REL_IDARRAY)
1035 && id >= INTERESTED_START && id <= INTERESTED_END)
1036 size_idarray += keys[i].size;
1039 /* allocate needed space in repo */
1042 repo_reserve_ids(repo, 0, size_idarray);
1043 idarraydatap = repo->idarraydata + repo->idarraysize;
1044 repo->idarraysize += size_idarray;
1045 idarraydataend = idarraydatap + size_idarray;
1054 /* read solvables */
1057 data.start = parent->start;
1058 data.end = parent->end;
1059 s = pool_id2solvable(pool, data.start);
1063 s = pool_id2solvable(pool, repo_add_solvable_block(repo, numsolv));
1064 /* store start and end of our id block */
1065 data.start = s - pool->solvables;
1066 data.end = data.start + numsolv;
1067 /* In case we have subfiles, make them refer to our part of the
1069 for (i = oldnrepodata; i < repo->nrepodata; i++)
1071 repo->repodata[i].start = data.start;
1072 repo->repodata[i].end = data.end;
1079 data.incoreoffset = sat_calloc(numsolv, sizeof(Id));
1080 for (i = 0; i < numsolv; i++, s++)
1085 if (exists && !exists[i])
1087 id = read_id(&data, numschemata);
1088 if (solvversion < SOLV_VERSION_5)
1092 data.incoreoffset[i] = data.incoredatalen;
1093 incore_add_id(&data, id);
1095 keyp = schemadata + schemata[id];
1096 while ((key = *keyp++) != 0)
1098 id = keys[key].name;
1100 fprintf(stderr, "solv %d name %d type %d class %d\n", i, id, keys[key].type, keys[key].storage);
1102 if (keys[key].storage == KEY_STORAGE_VERTICAL_OFFSET)
1104 /* copy offset/length into incore */
1105 did = read_id(&data, 0);
1106 incore_add_id(&data, did);
1107 did = read_id(&data, 0);
1108 incore_add_id(&data, did);
1111 switch (keys[key].type)
1117 did = read_id(&data, numid + numrel);
1120 if (id == SOLVABLE_NAME)
1122 else if (id == SOLVABLE_ARCH)
1124 else if (id == SOLVABLE_EVR)
1126 else if (id == SOLVABLE_VENDOR)
1128 else if (keys[key].storage == KEY_STORAGE_INCORE)
1129 incore_add_id(&data, did);
1131 POOL_DEBUG(SAT_DEBUG_STATS, "%s -> %s\n", id2str(pool, id), id2str(pool, did));
1135 did = read_id(&data, 0);
1136 if (keys[key].storage == KEY_STORAGE_INCORE)
1137 incore_add_id(&data, did);
1139 POOL_DEBUG(SAT_DEBUG_STATS, "%s -> %d\n", id2str(pool, id), did);
1143 h = read_u32(&data);
1145 POOL_DEBUG(SAT_DEBUG_STATS, "%s -> %u\n", id2str(pool, id), h);
1147 if (id == RPM_RPMDBID)
1150 repo->rpmdbid = sat_calloc(numsolv, sizeof(Id));
1151 repo->rpmdbid[i] = h;
1153 else if (keys[key].storage == KEY_STORAGE_INCORE)
1154 incore_add_u32(&data, h);
1157 if (keys[key].storage == KEY_STORAGE_INCORE)
1159 while ((h = read_u8(&data)) != 0)
1160 incore_add_u8(&data, h);
1161 incore_add_u8(&data, 0);
1165 while (read_u8(&data) != 0)
1170 case TYPE_REL_IDARRAY:
1171 if (id < INTERESTED_START || id > INTERESTED_END)
1173 if (keys[key].storage == KEY_STORAGE_INCORE)
1177 Id old = 0, rel = keys[key].type == TYPE_REL_IDARRAY ? SOLVABLE_PREREQMARKER : 0;
1180 did = read_id(&data, 0);
1182 did = (did & 0x3f) | ((did >> 1) & ~0x3f);
1196 if (did >= numid + numrel)
1199 did = ((did & ~0x3f) << 1) | h;
1200 incore_add_id(&data, did);
1206 while (((h = read_u8(&data)) & 0xc0) != 0)
1207 incore_add_u8(&data, h);
1213 while ((read_u8(&data) & 0xc0) != 0)
1219 ido = idarraydatap - repo->idarraydata;
1220 idarraydatap = read_idarray(&data, numid + numrel, idmap, idarraydatap, idarraydataend, keys[key].type == TYPE_REL_IDARRAY);
1221 if (id == SOLVABLE_PROVIDES)
1223 else if (id == SOLVABLE_OBSOLETES)
1225 else if (id == SOLVABLE_CONFLICTS)
1227 else if (id == SOLVABLE_REQUIRES)
1229 else if (id == SOLVABLE_RECOMMENDS)
1231 else if (id == SOLVABLE_SUPPLEMENTS)
1232 s->supplements = ido;
1233 else if (id == SOLVABLE_SUGGESTS)
1235 else if (id == SOLVABLE_ENHANCES)
1237 else if (id == SOLVABLE_FRESHENS)
1240 POOL_DEBUG(SAT_DEBUG_STATS, "%s ->\n", id2str(pool, id));
1241 for (; repo->idarraydata[ido]; ido++)
1242 POOL_DEBUG(SAT_DEBUG_STATS," %s\n", dep2str(pool, repo->idarraydata[ido]));
1245 case TYPE_DIRNUMNUMARRAY:
1249 did = read_id(&data, numdir);
1250 num = read_id(&data, 0);
1251 num2 = read_id(&data, 0);
1252 if (keys[key].storage == KEY_STORAGE_INCORE)
1255 POOL_DEBUG(SAT_DEBUG_STATS, "%s -> %d %d %d\n", id2str(pool, id), did, num, num2);
1257 incore_add_id(&data, did);
1258 incore_add_id(&data, num);
1259 incore_add_id(&data, num2);
1267 skip_item(&data, keys[key].type, numid, numrel);
1274 /* free solvables */
1275 repo_free_solvable_block(repo, data.start, data.end - data.start, 1);
1277 repo->idarraysize -= size_idarray;
1278 /* free incore data */
1279 data.incoredata = sat_free(data.incoredata);
1280 data.incoredatalen = data.incoredatafree = 0;
1283 if (data.incoredatafree)
1285 /* shrink excess size */
1286 data.incoredata = sat_realloc(data.incoredata, data.incoredatalen);
1287 data.incoredatafree = 0;
1290 for (i = 1; i < numkeys; i++)
1291 if (keys[i].storage == KEY_STORAGE_VERTICAL_OFFSET)
1293 if (i < numkeys && !data.error)
1296 unsigned int pagesize;
1298 /* we have vertical data, make it available */
1299 data.verticaloffset = sat_calloc(numkeys, sizeof(Id));
1300 for (i = 1; i < numkeys; i++)
1301 if (keys[i].storage == KEY_STORAGE_VERTICAL_OFFSET)
1303 data.verticaloffset[i] = fileoffset;
1304 fileoffset += keys[i].size;
1306 data.lastverticaloffset = fileoffset;
1307 pagesize = read_u32(&data);
1308 repodata_read_or_setup_pages(&data, pagesize, fileoffset);
1312 /* no longer needed */
1319 sat_free(parent->schemata);
1320 sat_free(parent->schemadata);
1321 sat_free(parent->keys);
1324 else if (data.incoredatalen || data.fp)
1326 /* we got some data, make it available */
1327 repo->repodata = sat_realloc2(repo->repodata, repo->nrepodata + 1, sizeof(data));
1328 repo->repodata[repo->nrepodata++] = data;
1333 sat_free(data.dirpool.dirs);
1334 sat_free(data.incoreoffset);
1336 sat_free(schemadata);
1347 repo_add_solv(Repo *repo, FILE *fp)
1349 return repo_add_solv_parent(repo, fp, 0);
1353 repodata_load_solv(Repodata *data)
1356 Pool *pool = data->repo->pool;
1357 if (!pool->loadcallback)
1359 data->state = REPODATA_ERROR;
1362 fp = pool->loadcallback(pool, data, pool->loadcallbackdata);
1366 data->state = REPODATA_ERROR;
1369 if (repo_add_solv_parent(data->repo, fp, data))
1370 data->state = REPODATA_ERROR;
1372 data->state = REPODATA_AVAILABLE;