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_rel_idarray(Repodata *data, Id max, Id *map, Id *store, Id *end, Id marker)
151 pool_debug(mypool, SAT_ERROR, "unexpected EOF\n");
152 data->error = SOLV_ERROR_EOF;
157 x = (x << 7) ^ c ^ 128;
160 x = (x << 6) | (c & 63);
161 if (x == 0 && c == 0x40)
166 pool_debug(mypool, SAT_ERROR, "read_rel_idarray: array overflow\n");
167 data->error = SOLV_ERROR_OVERFLOW;
170 *store++ = marker; /* do not map! */
179 pool_debug(mypool, SAT_ERROR, "read_rel_idarray: id too large (%u/%u)\n", x, max);
180 data->error = SOLV_ERROR_ID_RANGE;
187 pool_debug(mypool, SAT_ERROR, "read_rel_idarray: array overflow\n");
193 if (x == 0) /* already have trailing zero? */
197 pool_debug(mypool, SAT_ERROR, "read_rel_idarray: array overflow\n");
198 data->error = SOLV_ERROR_OVERFLOW;
209 read_idarray(Repodata *data, Id max, Id *map, Id *store, Id *end)
221 pool_debug(mypool, SAT_ERROR, "unexpected EOF\n");
222 data->error = SOLV_ERROR_EOF;
227 x = (x << 7) ^ c ^ 128;
230 x = (x << 6) | (c & 63);
233 pool_debug(mypool, SAT_ERROR, "read_idarray: id too large (%u/%u)\n", x, max);
234 data->error = SOLV_ERROR_ID_RANGE;
241 pool_debug(mypool, SAT_ERROR, "read_idarray: array overflow\n");
247 if (x == 0) /* already have trailing zero? */
251 pool_debug(mypool, SAT_ERROR, "read_idarray: array overflow\n");
252 data->error = SOLV_ERROR_OVERFLOW;
263 read_str(Repodata *data, char **inbuf, unsigned *len)
265 unsigned char *buf = (unsigned char*)*inbuf;
268 buf = sat_malloc(1024);
273 while((c = getc(data->fp)) != 0)
277 pool_debug (mypool, SAT_ERROR, "unexpected EOF\n");
278 data->error = SOLV_ERROR_EOF;
281 /* Plus 1 as we also want to add the 0. */
285 /* Don't realloc on the inbuf, it might be on the stack. */
286 if (buf == (unsigned char*)*inbuf)
288 buf = sat_malloc(*len);
289 memcpy(buf, *inbuf, *len - 256);
292 buf = sat_realloc(buf, *len);
301 skip_item (Repodata *data, unsigned type, unsigned numid, unsigned numrel)
309 read_id(data, numid + numrel); /* just check Id */
312 read_id(data, numid + data->dirpool.ndirs); /* just check Id */
320 case TYPE_ATTR_STRING:
322 while (read_u8(data) != 0)
326 case TYPE_REL_IDARRAY:
327 case TYPE_ATTR_INTLIST:
328 while ((read_u8(data) & 0xc0) != 0)
331 case TYPE_DIRNUMNUMARRAY:
334 read_id(data, numid + data->dirpool.ndirs); /* just check Id */
336 if (!(read_id(data, 0) & 0x40))
340 case TYPE_DIRSTRARRAY:
343 Id id = read_id(data, 0);
344 while (read_u8(data) != 0)
350 case TYPE_COUNT_NAMED:
352 unsigned count = read_id(data, 0);
355 read_id(data, numid); /* Name */
356 unsigned t = read_id(data, TYPE_ATTR_TYPE_MAX + 1);
357 skip_item(data, t, numid, numrel);
363 unsigned count = read_id(data, 0);
364 unsigned t = read_id(data, TYPE_ATTR_TYPE_MAX + 1);
366 skip_item(data, t, numid, numrel);
369 case TYPE_ATTR_CHUNK:
375 case TYPE_ATTR_LOCALIDS:
376 while (read_id(data, 0) != 0)
380 pool_debug(mypool, SAT_ERROR, "unknown type %d\n", type);
381 data->error = SOLV_ERROR_CORRUPT;
387 key_cmp (const void *pa, const void *pb)
389 Repokey *a = (Repokey *)pa;
390 Repokey *b = (Repokey *)pb;
391 return a->name - b->name;
394 static void repodata_load_solv(Repodata *data);
397 parse_repodata(Repodata *maindata, Id *keyp, Repokey *keys, Id *idmap, unsigned numid, unsigned numrel, Repo *repo)
404 repo->repodata = sat_realloc2(repo->repodata, repo->nrepodata + 1, sizeof (*data));
405 data = repo->repodata + repo->nrepodata++;
406 memset(data, 0, sizeof(*data));
408 data->state = REPODATA_STUB;
409 data->loadcallback = repodata_load_solv;
411 while ((key = *keyp++) != 0)
414 switch (keys[key].type)
416 case TYPE_IDVALUEARRAY:
417 if (id != REPODATA_KEYS)
419 skip_item(maindata, TYPE_IDVALUEARRAY, numid, numrel);
422 /* read_idarray writes a terminating 0, that's why the + 1 */
423 ida = sat_calloc(keys[key].size + 1, sizeof(Id));
424 ide = read_idarray(maindata, 0, 0, ida, ida + keys[key].size + 1);
428 pool_debug (mypool, SAT_ERROR, "invalid attribute data\n");
429 data->error = SOLV_ERROR_CORRUPT;
432 data->nkeys = 1 + (n >> 1);
433 data->keys = sat_malloc2(data->nkeys, sizeof(data->keys[0]));
434 memset(data->keys, 0, sizeof(Repokey));
435 for (i = 1, ide = ida; i < data->nkeys; i++)
439 pool_debug (mypool, SAT_ERROR, "invalid attribute data\n");
440 data->error = SOLV_ERROR_CORRUPT;
443 data->keys[i].name = idmap ? idmap[*ide++] : *ide++;
444 data->keys[i].type = *ide++;
445 data->keys[i].size = 0;
446 data->keys[i].storage = 0;
450 qsort(data->keys + 1, data->nkeys - 1, sizeof(data->keys[0]), key_cmp);
453 if (id != REPODATA_LOCATION)
454 skip_item(maindata, TYPE_STR, numid, numrel);
458 unsigned len = sizeof (buf);
459 char *filename = buf;
460 read_str(maindata, &filename, &len);
461 data->location = strdup(filename);
467 skip_item(maindata, keys[key].type, numid, numrel);
473 /*-----------------------------------------------------------------*/
477 skip_schema(Repodata *data, Id *keyp, Repokey *keys, unsigned int numid, unsigned int numrel)
480 while ((key = *keyp++) != 0)
481 skip_item(data, keys[key].type, numid, numrel);
484 /*-----------------------------------------------------------------*/
487 incore_add_id(Repodata *data, Id x)
490 /* make sure we have at least 5 bytes free */
491 if (data->incoredatafree < 5)
493 data->incoredata = sat_realloc(data->incoredata, data->incoredatalen + 1024);
494 data->incoredatafree = 1024;
496 dp = data->incoredata + data->incoredatalen;
502 *dp++ = (x >> 28) | 128;
504 *dp++ = (x >> 21) | 128;
505 *dp++ = (x >> 14) | 128;
508 *dp++ = (x >> 7) | 128;
510 data->incoredatafree -= dp - (data->incoredata + data->incoredatalen);
511 data->incoredatalen = dp - data->incoredata;
515 incore_add_u32(Repodata *data, unsigned int x)
518 /* make sure we have at least 4 bytes free */
519 if (data->incoredatafree < 4)
521 data->incoredata = sat_realloc(data->incoredata, data->incoredatalen + 1024);
522 data->incoredatafree = 1024;
524 dp = data->incoredata + data->incoredatalen;
529 data->incoredatafree -= 4;
530 data->incoredatalen += 4;
534 incore_add_u8(Repodata *data, unsigned int x)
537 /* make sure we have at least 1 byte free */
538 if (data->incoredatafree < 1)
540 data->incoredata = sat_realloc(data->incoredata, data->incoredatalen + 1024);
541 data->incoredatafree = 1024;
543 dp = data->incoredata + data->incoredatalen;
545 data->incoredatafree--;
546 data->incoredatalen++;
551 // ----------------------------------------------
555 * read repo from .solv file
560 repo_add_solv_parent(Repo *repo, FILE *fp, Repodata *parent)
562 Pool *pool = repo->pool;
564 unsigned int numid, numrel, numdir, numsolv;
565 unsigned int numkeys, numschemata, numinfo;
568 Offset *str; /* map Id -> Offset into string space */
569 char *strsp; /* repo string space */
570 char *sp; /* pointer into string space */
571 Id *idmap; /* map of repo Ids to pool Ids */
573 unsigned int hashmask, h;
579 unsigned int size_idarray;
580 Id *idarraydatap, *idarraydataend;
583 unsigned int solvflags;
584 unsigned int solvversion;
586 Id *schemadata, *schemadatap, *schemadataend;
589 unsigned oldnrepodata;
591 struct _Stringpool *spool;
595 memset(&data, 0, sizeof(data));
601 if (read_u32(&data) != ('S' << 24 | 'O' << 16 | 'L' << 8 | 'V'))
603 pool_debug(pool, SAT_ERROR, "not a SOLV file\n");
604 return SOLV_ERROR_NOT_SOLV;
606 solvversion = read_u32(&data);
614 /* Version 6 existed only intermittantly. It's equivalent to
619 pool_debug(pool, SAT_ERROR, "unsupported SOLV version\n");
620 return SOLV_ERROR_UNSUPPORTED;
623 pool_freeidhashes(pool);
625 numid = read_u32(&data);
626 numrel = read_u32(&data);
627 if (solvversion >= SOLV_VERSION_4)
628 numdir = read_u32(&data);
631 numsolv = read_u32(&data);
632 numkeys = read_u32(&data);
633 numschemata = read_u32(&data);
634 numinfo = read_u32(&data);
635 solvflags = read_u32(&data);
637 if (solvversion < SOLV_VERSION_5)
640 if (numdir && numdir < 2)
642 pool_debug(pool, SAT_ERROR, "bad number of dirs\n");
643 return SOLV_ERROR_CORRUPT;
645 if (numinfo && solvversion < SOLV_VERSION_3)
647 pool_debug(pool, SAT_ERROR, "unsupported SOLV format (has info)\n");
648 return SOLV_ERROR_UNSUPPORTED;
655 pool_debug(pool, SAT_ERROR, "relations are forbidden in a store\n");
656 return SOLV_ERROR_CORRUPT;
658 if (parent->end - parent->start != numsolv)
660 pool_debug(pool, SAT_ERROR, "unequal number of solvables in a store\n");
661 return SOLV_ERROR_CORRUPT;
665 pool_debug(pool, SAT_ERROR, "info blocks are forbidden in a store\n");
666 return SOLV_ERROR_CORRUPT;
670 /******* Part 1: string IDs *****************************************/
672 sizeid = read_u32(&data); /* size of string+Id space */
675 * read strings and Ids
690 spool->stringspace = sat_malloc(7);
691 strcpy(spool->stringspace, "<NULL>");
696 /* alloc string buffer */
697 spool->stringspace = sat_realloc(spool->stringspace, spool->sstrings + sizeid + 1);
698 /* alloc string offsets (Id -> Offset into string space) */
699 spool->strings = sat_realloc2(spool->strings, spool->nstrings + numid, sizeof(Offset));
701 strsp = spool->stringspace;
702 str = spool->strings; /* array of offsets into strsp, indexed by Id */
704 /* point to _BEHIND_ already allocated string/Id space */
705 strsp += spool->sstrings;
709 * read new repo at end of pool
712 if ((solvflags & SOLV_FLAG_PREFIX_POOL) == 0)
714 if (sizeid && fread(strsp, sizeid, 1, fp) != 1)
716 pool_debug(pool, SAT_ERROR, "read error while reading strings\n");
717 return SOLV_ERROR_EOF;
722 unsigned int pfsize = read_u32(&data);
723 char *prefix = sat_malloc(pfsize);
727 if (pfsize && fread(prefix, pfsize, 1, fp) != 1)
729 pool_debug(pool, SAT_ERROR, "read error while reading strings\n");
731 return SOLV_ERROR_EOF;
733 for (i = 1; i < numid; i++)
735 int same = (unsigned char)*pp++;
736 size_t len = strlen (pp) + 1;
738 memcpy(dest, old_str, same);
739 memcpy(dest + same, pp, len);
746 strsp[sizeid] = 0; /* make string space \0 terminated */
751 /* no shared pool, thus no idmap and no unification */
753 spool->nstrings = numid;
757 /* we need the '' for directories */
758 pool_debug(pool, SAT_ERROR, "store strings don't start with ''\n");
759 return SOLV_ERROR_CORRUPT;
761 for (i = 1; i < spool->nstrings; i++)
763 if (sp >= strsp + sizeid)
765 pool_debug(pool, SAT_ERROR, "not enough strings\n");
766 return SOLV_ERROR_OVERFLOW;
768 str[i] = sp - spool->stringspace;
769 sp += strlen(sp) + 1;
771 spool->sstrings = sp - spool->stringspace;
776 /* alloc id map for name and rel Ids. this maps ids in the solv files
777 * to the ids in our pool */
778 idmap = sat_calloc(numid + numrel, sizeof(Id));
781 * build hashes for all read strings
785 hashmask = mkmask(spool->nstrings + numid);
788 POOL_DEBUG(SAT_DEBUG_STATS, "read %d strings\n", numid);
789 POOL_DEBUG(SAT_DEBUG_STATS, "string hash buckets: %d\n", hashmask + 1);
793 * create hashtable with strings already in pool
796 hashtbl = sat_calloc(hashmask + 1, sizeof(Id));
797 for (i = 1; i < spool->nstrings; i++) /* leave out our dummy zero id */
799 h = strhash(spool->stringspace + spool->strings[i]) & hashmask;
800 hh = HASHCHAIN_START;
802 h = HASHCHAIN_NEXT(h, hh, hashmask);
807 * run over string space, calculate offsets
809 * build id map (maps solv Id -> pool Id)
812 for (i = 1; i < numid; i++)
814 if (sp >= strsp + sizeid)
818 pool_debug(pool, SAT_ERROR, "not enough strings\n");
819 return SOLV_ERROR_OVERFLOW;
821 if (!*sp) /* empty string */
829 h = strhash(sp) & hashmask;
830 hh = HASHCHAIN_START;
836 if (!strcmp(spool->stringspace + spool->strings[id], sp))
837 break; /* existing string */
838 h = HASHCHAIN_NEXT(h, hh, hashmask);
841 /* length == offset to next string */
843 if (id == ID_NULL) /* end of hash chain -> new string */
845 id = spool->nstrings++;
847 str[id] = spool->sstrings; /* save Offset */
848 if (sp != spool->stringspace + spool->sstrings) /* not at end-of-buffer */
849 memmove(spool->stringspace + spool->sstrings, sp, l); /* append to pool buffer */
850 spool->sstrings += l;
852 idmap[i] = id; /* repo relative -> pool relative */
853 sp += l; /* next string */
857 pool_shrink_strings(pool); /* vacuum */
860 /******* Part 2: Relation IDs ***************************************/
870 pool->rels = sat_realloc2(pool->rels, pool->nrels + numrel, sizeof(Reldep));
873 hashmask = mkmask(pool->nrels + numrel);
875 POOL_DEBUG(SAT_DEBUG_STATS, "read %d rels\n", numrel);
876 POOL_DEBUG(SAT_DEBUG_STATS, "rel hash buckets: %d\n", hashmask + 1);
879 * prep hash table with already existing RelDeps
882 hashtbl = sat_calloc(hashmask + 1, sizeof(Id));
883 for (i = 1; i < pool->nrels; i++)
885 h = relhash(ran[i].name, ran[i].evr, ran[i].flags) & hashmask;
886 hh = HASHCHAIN_START;
888 h = HASHCHAIN_NEXT(h, hh, hashmask);
893 * read RelDeps from repo
896 for (i = 0; i < numrel; i++)
898 name = read_id(&data, i + numid); /* read (repo relative) Ids */
899 evr = read_id(&data, i + numid);
900 flags = read_u8(&data);
901 name = idmap[name]; /* map to (pool relative) Ids */
903 h = relhash(name, evr, flags) & hashmask;
904 hh = HASHCHAIN_START;
908 if (id == ID_NULL) /* end of hash chain */
910 if (ran[id].name == name && ran[id].evr == evr && ran[id].flags == flags)
912 h = HASHCHAIN_NEXT(h, hh, hashmask);
914 if (id == ID_NULL) /* new RelDep */
920 ran[id].flags = flags;
922 idmap[i + numid] = MAKERELDEP(id); /* fill Id map */
925 pool_shrink_rels(pool); /* vacuum */
929 /******* Part 3: Dirs ***********************************************/
932 data.dirpool.dirs = sat_malloc2(numdir, sizeof(Id));
933 data.dirpool.ndirs = numdir;
934 data.dirpool.dirs[0] = 0; /* dir 0: virtual root */
935 data.dirpool.dirs[1] = 1; /* dir 1: / */
936 for (i = 2; i < numdir; i++)
938 id = read_id(&data, i + numid);
940 data.dirpool.dirs[i] = -(id - numid);
942 data.dirpool.dirs[i] = idmap[id];
944 data.dirpool.dirs[i] = id;
948 /******* Part 4: Keys ***********************************************/
950 keys = sat_calloc(numkeys, sizeof(*keys));
951 /* keys start at 1 */
952 for (i = 1; i < numkeys; i++)
954 id = read_id(&data, numid);
958 id = str2id(pool, stringpool_id2str(spool, id), 1);
960 keys[i].type = read_id(&data, 0);
961 keys[i].size = read_id(&data, 0);
963 fprintf (stderr, "key %d %s %d %d\n", i, id2str(pool,id), keys[i].type,
966 if (solvversion >= SOLV_VERSION_5)
968 keys[i].storage = read_id(&data, 0);
971 keys[i].storage = KEY_STORAGE_DROPPED;
974 keys[i].storage = KEY_STORAGE_INCORE;
977 switch (keys[i].type)
983 case TYPE_DIRNUMNUMARRAY:
984 keys[i].storage = KEY_STORAGE_INCORE;
992 case SOLVABLE_VENDOR:
993 keys[i].storage = KEY_STORAGE_SOLVABLE;
996 keys[i].storage = KEY_STORAGE_INCORE;
1001 case TYPE_REL_IDARRAY:
1002 if (id >= INTERESTED_START && id <= INTERESTED_END)
1003 keys[i].storage = KEY_STORAGE_SOLVABLE;
1005 keys[i].storage = KEY_STORAGE_INCORE;
1008 if (id == RPM_RPMDBID)
1009 keys[i].storage = KEY_STORAGE_SOLVABLE;
1011 keys[i].storage = KEY_STORAGE_INCORE;
1018 have_xdata = parent ? 1 : 0;
1019 for (i = 1; i < numkeys; i++)
1020 if (keys[i].storage == KEY_STORAGE_INCORE || keys[i].storage == KEY_STORAGE_VERTICAL_OFFSET)
1024 data.nkeys = numkeys;
1026 /******* Part 5: Schemata ********************************************/
1028 id = read_id(&data, 0);
1029 schemadata = sat_calloc(id + 1, sizeof(Id));
1030 schemadatap = schemadata + 1;
1031 schemadataend = schemadatap + id;
1032 schemata = sat_calloc(numschemata, sizeof(Id));
1033 for (i = 1; i < numschemata; i++)
1035 schemata[i] = schemadatap - schemadata;
1036 schemadatap = read_idarray(&data, numid, 0, schemadatap, schemadataend);
1038 Id *sp = schemadata + schemata[i];
1039 fprintf (stderr, "schema %d:", i);
1041 fprintf (stderr, " %d", *sp);
1042 fprintf (stderr, "\n");
1045 data.schemata = schemata;
1046 data.nschemata = numschemata;
1047 data.schemadata = schemadata;
1048 data.schemadatalen = schemadataend - data.schemadata;
1051 /******* Part 6: Info ***********************************************/
1052 oldnrepodata = repo->nrepodata;
1053 for (i = 0; i < numinfo; i++)
1055 /* for now we're just interested in data that starts with
1056 * the repodata_external id
1059 id = read_id(&data, numschemata);
1060 if (solvversion < SOLV_VERSION_5)
1062 keyp = schemadata + schemata[id];
1064 if (keys[key].name == REPODATA_EXTERNAL && keys[key].type == TYPE_VOID)
1066 /* external data for some ids */
1067 parse_repodata(&data, keyp, keys, idmap, numid, numrel, repo);
1070 skip_schema(&data, keyp, keys, numid, numrel);
1074 /******* Part 7: packed sizes (optional) ****************************/
1076 if ((solvflags & SOLV_FLAG_PACKEDSIZES) != 0)
1078 exists = sat_malloc (numsolv);
1079 for (i = 0; i < numsolv; i++)
1080 exists[i] = read_id(&data, 0) != 0;
1084 /******* Part 8: item data *******************************************/
1086 /* calculate idarray size */
1088 for (i = 1; i < numkeys; i++)
1091 if ((keys[i].type == TYPE_IDARRAY || keys[i].type == TYPE_REL_IDARRAY)
1092 && id >= INTERESTED_START && id <= INTERESTED_END)
1093 size_idarray += keys[i].size;
1096 /* allocate needed space in repo */
1099 repo_reserve_ids(repo, 0, size_idarray);
1100 idarraydatap = repo->idarraydata + repo->idarraysize;
1101 repo->idarraysize += size_idarray;
1102 idarraydataend = idarraydatap + size_idarray;
1111 /* read solvables */
1115 s = pool_id2solvable(pool, parent->start);
1117 s = pool_id2solvable(pool, repo_add_solvable_block(repo, numsolv));
1118 /* store start and end of our id block */
1119 data.start = s - pool->solvables;
1120 data.end = data.start + numsolv;
1121 /* In case we have info blocks, make them refer to our part of the
1123 for (i = oldnrepodata; i < repo->nrepodata; i++)
1125 repo->repodata[i].start = data.start;
1126 repo->repodata[i].end = data.end;
1133 repodata_extend_block(&data, data.start, numsolv);
1135 for (i = 0; i < numsolv; i++, s++)
1140 if (exists && !exists[i])
1142 id = read_id(&data, numschemata);
1143 if (solvversion < SOLV_VERSION_5)
1147 data.incoreoffset[i] = data.incoredatalen;
1148 incore_add_id(&data, id);
1150 keyp = schemadata + schemata[id];
1151 while ((key = *keyp++) != 0)
1153 id = keys[key].name;
1155 fprintf(stderr, "solv %d name %d type %d class %d\n", i, id, keys[key].type, keys[key].storage);
1157 if (keys[key].storage == KEY_STORAGE_VERTICAL_OFFSET)
1159 /* copy offset/length into incore */
1160 did = read_id(&data, 0);
1161 incore_add_id(&data, did);
1162 did = read_id(&data, 0);
1163 incore_add_id(&data, did);
1166 switch (keys[key].type)
1172 did = read_id(&data, numid + numrel);
1175 if (id == SOLVABLE_NAME)
1177 else if (id == SOLVABLE_ARCH)
1179 else if (id == SOLVABLE_EVR)
1181 else if (id == SOLVABLE_VENDOR)
1183 else if (keys[key].storage == KEY_STORAGE_INCORE)
1184 incore_add_id(&data, did);
1186 POOL_DEBUG(SAT_DEBUG_STATS, "%s -> %s\n", id2str(pool, id), id2str(pool, did));
1190 did = read_id(&data, 0);
1191 if (keys[key].storage == KEY_STORAGE_INCORE)
1192 incore_add_id(&data, did);
1194 POOL_DEBUG(SAT_DEBUG_STATS, "%s -> %d\n", id2str(pool, id), did);
1198 h = read_u32(&data);
1200 POOL_DEBUG(SAT_DEBUG_STATS, "%s -> %u\n", id2str(pool, id), h);
1202 if (id == RPM_RPMDBID)
1205 repo->rpmdbid = sat_calloc(numsolv, sizeof(Id));
1206 repo->rpmdbid[i] = h;
1208 else if (keys[key].storage == KEY_STORAGE_INCORE)
1209 incore_add_u32(&data, h);
1212 if (keys[key].storage == KEY_STORAGE_INCORE)
1214 while ((h = read_u8(&data)) != 0)
1215 incore_add_u8(&data, h);
1216 incore_add_u8(&data, 0);
1220 while (read_u8(&data) != 0)
1225 case TYPE_REL_IDARRAY:
1226 if (id < INTERESTED_START || id > INTERESTED_END)
1228 if (keys[key].storage == KEY_STORAGE_INCORE)
1232 abort(); /* implement me! */
1236 while (((h = read_u8(&data)) & 0xc0) != 0)
1237 incore_add_u8(&data, h);
1243 while ((read_u8(&data) & 0xc0) != 0)
1249 ido = idarraydatap - repo->idarraydata;
1250 if (keys[key].type == TYPE_IDARRAY)
1251 idarraydatap = read_idarray(&data, numid + numrel, idmap, idarraydatap, idarraydataend);
1252 else if (id == SOLVABLE_REQUIRES)
1253 idarraydatap = read_rel_idarray(&data, numid + numrel, idmap, idarraydatap, idarraydataend, SOLVABLE_PREREQMARKER);
1254 else if (id == SOLVABLE_PROVIDES)
1255 idarraydatap = read_rel_idarray(&data, numid + numrel, idmap, idarraydatap, idarraydataend, SOLVABLE_FILEMARKER);
1257 idarraydatap = read_rel_idarray(&data, numid + numrel, idmap, idarraydatap, idarraydataend, 0);
1258 if (id == SOLVABLE_PROVIDES)
1260 else if (id == SOLVABLE_OBSOLETES)
1262 else if (id == SOLVABLE_CONFLICTS)
1264 else if (id == SOLVABLE_REQUIRES)
1266 else if (id == SOLVABLE_RECOMMENDS)
1268 else if (id == SOLVABLE_SUPPLEMENTS)
1269 s->supplements = ido;
1270 else if (id == SOLVABLE_SUGGESTS)
1272 else if (id == SOLVABLE_ENHANCES)
1274 else if (id == SOLVABLE_FRESHENS)
1277 POOL_DEBUG(SAT_DEBUG_STATS, "%s ->\n", id2str(pool, id));
1278 for (; repo->idarraydata[ido]; ido++)
1279 POOL_DEBUG(SAT_DEBUG_STATS," %s\n", dep2str(pool, repo->idarraydata[ido]));
1282 case TYPE_DIRNUMNUMARRAY:
1286 did = read_id(&data, numdir);
1287 num = read_id(&data, 0);
1288 num2 = read_id(&data, 0);
1289 if (keys[key].storage == KEY_STORAGE_INCORE)
1292 POOL_DEBUG(SAT_DEBUG_STATS, "%s -> %d %d %d\n", id2str(pool, id), did, num, num2);
1294 incore_add_id(&data, did);
1295 incore_add_id(&data, num);
1296 incore_add_id(&data, num2);
1302 case TYPE_DIRSTRARRAY:
1305 did = read_id(&data, 0);
1306 if (keys[key].storage == KEY_STORAGE_INCORE)
1308 incore_add_id(&data, did);
1309 while ((h = read_u8(&data)) != 0)
1310 incore_add_u8(&data, h);
1311 incore_add_u8(&data, 0);
1315 while (read_u8(&data) != 0)
1323 skip_item(&data, keys[key].type, numid, numrel);
1330 /* free solvables */
1331 repo_free_solvable_block(repo, data.start, data.end - data.start, 1);
1333 repo->idarraysize -= size_idarray;
1334 /* free incore data */
1335 data.incoredata = sat_free(data.incoredata);
1336 data.incoredatalen = data.incoredatafree = 0;
1339 if (data.incoredatafree)
1341 /* shrink excess size */
1342 data.incoredata = sat_realloc(data.incoredata, data.incoredatalen);
1343 data.incoredatafree = 0;
1346 for (i = 1; i < numkeys; i++)
1347 if (keys[i].storage == KEY_STORAGE_VERTICAL_OFFSET)
1349 if (i < numkeys && !data.error)
1352 unsigned int pagesize;
1354 /* we have vertical data, make it available */
1355 data.verticaloffset = sat_calloc(numkeys, sizeof(Id));
1356 for (i = 1; i < numkeys; i++)
1357 if (keys[i].storage == KEY_STORAGE_VERTICAL_OFFSET)
1359 data.verticaloffset[i] = fileoffset;
1360 fileoffset += keys[i].size;
1362 data.lastverticaloffset = fileoffset;
1363 pagesize = read_u32(&data);
1364 repodata_read_or_setup_pages(&data, pagesize, fileoffset);
1368 /* no longer needed */
1375 sat_free(parent->schemata);
1376 sat_free(parent->schemadata);
1377 sat_free(parent->keys);
1380 else if (data.incoredatalen || data.fp)
1382 /* we got some data, make it available */
1383 repo->repodata = sat_realloc2(repo->repodata, repo->nrepodata + 1, sizeof(data));
1384 repo->repodata[repo->nrepodata++] = data;
1389 sat_free(data.dirpool.dirs);
1390 sat_free(data.incoreoffset);
1392 sat_free(schemadata);
1403 repo_add_solv(Repo *repo, FILE *fp)
1405 return repo_add_solv_parent(repo, fp, 0);
1409 repodata_load_solv(Repodata *data)
1412 Pool *pool = data->repo->pool;
1413 if (!pool->loadcallback)
1415 data->state = REPODATA_ERROR;
1418 fp = pool->loadcallback(pool, data, pool->loadcallbackdata);
1422 data->state = REPODATA_ERROR;
1425 if (repo_add_solv_parent(data->repo, fp, data))
1426 data->state = REPODATA_ERROR;
1428 data->state = REPODATA_AVAILABLE;