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_IDARRAY:
427 case REPOKEY_TYPE_REL_IDARRAY:
428 while ((read_u8(data) & 0xc0) != 0)
431 case REPOKEY_TYPE_DIRNUMNUMARRAY:
434 read_id(data, numid + data->dirpool.ndirs); /* just check Id */
436 if (!(read_id(data, 0) & 0x40))
440 case REPOKEY_TYPE_DIRSTRARRAY:
443 Id id = read_id(data, 0);
444 while (read_u8(data) != 0)
451 pool_debug(mypool, SAT_ERROR, "unknown type %d\n", type);
452 data->error = SOLV_ERROR_CORRUPT;
458 key_cmp (const void *pa, const void *pb)
460 Repokey *a = (Repokey *)pa;
461 Repokey *b = (Repokey *)pb;
462 return a->name - b->name;
465 static void repodata_load_solv(Repodata *data);
468 parse_external_repodata(Repodata *maindata, Id *keyp, Repokey *keys, Id *idmap, unsigned numid, unsigned numrel)
470 Repo *repo = maindata->repo;
476 repo->repodata = sat_realloc2(repo->repodata, repo->nrepodata + 1, sizeof (*data));
477 data = repo->repodata + repo->nrepodata++;
478 memset(data, 0, sizeof(*data));
481 data->state = REPODATA_STUB;
482 data->loadcallback = repodata_load_solv;
484 while ((key = *keyp++) != 0)
487 switch (keys[key].type)
489 case REPOKEY_TYPE_IDARRAY:
490 if (id != REPODATA_KEYS)
492 skip_item(maindata, REPOKEY_TYPE_IDARRAY, numid, numrel);
495 /* read_idarray writes a terminating 0, that's why the + 1 */
496 ida = sat_calloc(keys[key].size + 1, sizeof(Id));
497 ide = read_idarray(maindata, numid, idmap, ida, ida + keys[key].size + 1);
501 pool_debug (mypool, SAT_ERROR, "invalid attribute data\n");
502 maindata->error = SOLV_ERROR_CORRUPT;
505 data->nkeys = 1 + (n >> 1);
506 data->keys = sat_malloc2(data->nkeys, sizeof(data->keys[0]));
507 memset(data->keys, 0, sizeof(Repokey));
508 for (i = 1, ide = ida; i < data->nkeys; i++)
510 data->keys[i].name = *ide++;
511 data->keys[i].type = *ide++;
512 data->keys[i].size = 0;
513 data->keys[i].storage = 0;
517 qsort(data->keys + 1, data->nkeys - 1, sizeof(data->keys[0]), key_cmp);
519 case REPOKEY_TYPE_STR:
520 if (id != REPODATA_LOCATION)
521 skip_item(maindata, REPOKEY_TYPE_STR, numid, numrel);
525 unsigned len = sizeof(buf);
526 char *filename = buf;
527 read_str(maindata, &filename, &len);
528 data->location = strdup(filename);
534 skip_item(maindata, keys[key].type, numid, numrel);
541 parse_info_repodata(Repodata *maindata, Id *keyp, Repokey *keys, Id *idmap, unsigned numid, unsigned numrel)
545 while ((key = *keyp++) != 0)
548 if (id == REPODATA_ADDEDFILEPROVIDES && keys[key].type == REPOKEY_TYPE_REL_IDARRAY)
551 /* + 1 just in case */
552 ida = sat_calloc(keys[key].size + 1, sizeof(Id));
553 read_idarray(maindata, 0, 0, ida, ida + keys[key].size + 1);
554 maindata->addedfileprovides = ida;
563 *ida = idmap ? idmap[old] : old;
567 skip_item(maindata, keys[key].type, numid, numrel);
571 /*-----------------------------------------------------------------*/
575 skip_schema(Repodata *data, Id *keyp, Repokey *keys, unsigned int numid, unsigned int numrel)
578 while ((key = *keyp++) != 0)
579 skip_item(data, keys[key].type, numid, numrel);
582 /*-----------------------------------------------------------------*/
585 incore_add_id(Repodata *data, Id x)
588 /* make sure we have at least 5 bytes free */
589 if (data->incoredatafree < 5)
591 data->incoredata = sat_realloc(data->incoredata, data->incoredatalen + 1024);
592 data->incoredatafree = 1024;
594 dp = data->incoredata + data->incoredatalen;
600 *dp++ = (x >> 28) | 128;
602 *dp++ = (x >> 21) | 128;
603 *dp++ = (x >> 14) | 128;
606 *dp++ = (x >> 7) | 128;
608 data->incoredatafree -= dp - (data->incoredata + data->incoredatalen);
609 data->incoredatalen = dp - data->incoredata;
613 incore_add_blob(Repodata *data, unsigned char *buf, int len)
615 if (data->incoredatafree < len)
617 data->incoredata = sat_realloc(data->incoredata, data->incoredatalen + 1024 + len);
618 data->incoredatafree = 1024 + len;
620 memcpy(data->incoredata + data->incoredatalen, buf, len);
621 data->incoredatafree -= len;
622 data->incoredatalen += len;
626 incore_map_idarray(Repodata *data, unsigned char *dp, Id *map, Id max)
628 /* We have to map the IDs, which might also change
629 the necessary number of bytes, so we can't just copy
630 over the blob and adjust it. */
635 dp = data_read_ideof(dp, &id, &eof);
636 if (max && id >= max)
638 pool_debug(mypool, SAT_ERROR, "incore_map_idarray: id too large (%u/%u)\n", id, max);
639 data->error = SOLV_ERROR_ID_RANGE;
644 id = (id & 63) | ((id & ~63) << 1);
645 incore_add_id(data, eof ? id : id | 64);
652 incore_add_u32(Repodata *data, unsigned int x)
655 /* make sure we have at least 4 bytes free */
656 if (data->incoredatafree < 4)
658 data->incoredata = sat_realloc(data->incoredata, data->incoredatalen + 1024);
659 data->incoredatafree = 1024;
661 dp = data->incoredata + data->incoredatalen;
666 data->incoredatafree -= 4;
667 data->incoredatalen += 4;
672 incore_add_u8(Repodata *data, unsigned int x)
675 /* make sure we have at least 1 byte free */
676 if (data->incoredatafree < 1)
678 data->incoredata = sat_realloc(data->incoredata, data->incoredatalen + 1024);
679 data->incoredatafree = 1024;
681 dp = data->incoredata + data->incoredatalen;
683 data->incoredatafree--;
684 data->incoredatalen++;
690 // ----------------------------------------------
694 * read repo from .solv file
699 repo_add_solv_parent(Repo *repo, FILE *fp, Repodata *parent)
701 Pool *pool = repo->pool;
703 unsigned int numid, numrel, numdir, numsolv;
704 unsigned int numkeys, numschemata, numinfo;
707 Offset *str; /* map Id -> Offset into string space */
708 char *strsp; /* repo string space */
709 char *sp; /* pointer into string space */
710 Id *idmap; /* map of repo Ids to pool Ids */
712 unsigned int hashmask, h;
718 unsigned int size_idarray;
719 Id *idarraydatap, *idarraydataend;
722 unsigned int solvflags;
723 unsigned int solvversion;
725 Id *schemadata, *schemadatap, *schemadataend;
728 unsigned oldnrepodata;
729 int maxsize, allsize;
730 unsigned char *buf, *dp, *dps;
733 struct _Stringpool *spool;
737 memset(&data, 0, sizeof(data));
744 if (read_u32(&data) != ('S' << 24 | 'O' << 16 | 'L' << 8 | 'V'))
746 pool_debug(pool, SAT_ERROR, "not a SOLV file\n");
747 return SOLV_ERROR_NOT_SOLV;
749 solvversion = read_u32(&data);
755 pool_debug(pool, SAT_ERROR, "unsupported SOLV version\n");
756 return SOLV_ERROR_UNSUPPORTED;
759 pool_freeidhashes(pool);
761 numid = read_u32(&data);
762 numrel = read_u32(&data);
763 numdir = read_u32(&data);
764 numsolv = read_u32(&data);
765 numkeys = read_u32(&data);
766 numschemata = read_u32(&data);
767 numinfo = read_u32(&data);
768 solvflags = read_u32(&data);
770 if (numdir && numdir < 2)
772 pool_debug(pool, SAT_ERROR, "bad number of dirs\n");
773 return SOLV_ERROR_CORRUPT;
780 pool_debug(pool, SAT_ERROR, "relations are forbidden in a store\n");
781 return SOLV_ERROR_CORRUPT;
783 if (parent->end - parent->start != numsolv)
785 pool_debug(pool, SAT_ERROR, "unequal number of solvables in a store\n");
786 return SOLV_ERROR_CORRUPT;
790 pool_debug(pool, SAT_ERROR, "info blocks are forbidden in a store\n");
791 return SOLV_ERROR_CORRUPT;
795 /******* Part 1: string IDs *****************************************/
797 sizeid = read_u32(&data); /* size of string+Id space */
800 * read strings and Ids
815 spool->stringspace = sat_malloc(7);
816 strcpy(spool->stringspace, "<NULL>");
821 /* alloc string buffer */
822 spool->stringspace = sat_realloc(spool->stringspace, spool->sstrings + sizeid + 1);
823 /* alloc string offsets (Id -> Offset into string space) */
824 spool->strings = sat_realloc2(spool->strings, spool->nstrings + numid, sizeof(Offset));
826 strsp = spool->stringspace;
827 str = spool->strings; /* array of offsets into strsp, indexed by Id */
829 /* point to _BEHIND_ already allocated string/Id space */
830 strsp += spool->sstrings;
834 * read new repo at end of pool
837 if ((solvflags & SOLV_FLAG_PREFIX_POOL) == 0)
839 if (sizeid && fread(strsp, sizeid, 1, fp) != 1)
841 pool_debug(pool, SAT_ERROR, "read error while reading strings\n");
842 return SOLV_ERROR_EOF;
847 unsigned int pfsize = read_u32(&data);
848 char *prefix = sat_malloc(pfsize);
854 if (pfsize && fread(prefix, pfsize, 1, fp) != 1)
856 pool_debug(pool, SAT_ERROR, "read error while reading strings\n");
858 return SOLV_ERROR_EOF;
860 for (i = 1; i < numid; i++)
862 int same = (unsigned char)*pp++;
863 size_t len = strlen(pp) + 1;
864 freesp -= same + len;
867 pool_debug(pool, SAT_ERROR, "overflow while expanding strings\n");
869 return SOLV_ERROR_OVERFLOW;
872 memcpy(dest, old_str, same);
873 memcpy(dest + same, pp, len);
881 pool_debug(pool, SAT_ERROR, "expanding strings size mismatch\n");
882 return SOLV_ERROR_CORRUPT;
885 strsp[sizeid] = 0; /* make string space \0 terminated */
890 /* no shared pool, thus no idmap and no unification */
892 spool->nstrings = numid;
896 /* we need the '' for directories */
897 pool_debug(pool, SAT_ERROR, "store strings don't start with ''\n");
898 return SOLV_ERROR_CORRUPT;
900 for (i = 1; i < spool->nstrings; i++)
902 if (sp >= strsp + sizeid)
904 pool_debug(pool, SAT_ERROR, "not enough strings\n");
905 return SOLV_ERROR_OVERFLOW;
907 str[i] = sp - spool->stringspace;
908 sp += strlen(sp) + 1;
910 spool->sstrings = sp - spool->stringspace;
915 /* alloc id map for name and rel Ids. this maps ids in the solv files
916 * to the ids in our pool */
917 idmap = sat_calloc(numid + numrel, sizeof(Id));
920 * build hashes for all read strings
924 hashmask = mkmask(spool->nstrings + numid);
927 POOL_DEBUG(SAT_DEBUG_STATS, "read %d strings\n", numid);
928 POOL_DEBUG(SAT_DEBUG_STATS, "string hash buckets: %d\n", hashmask + 1);
932 * create hashtable with strings already in pool
935 hashtbl = sat_calloc(hashmask + 1, sizeof(Id));
936 for (i = 1; i < spool->nstrings; i++) /* leave out our dummy zero id */
938 h = strhash(spool->stringspace + spool->strings[i]) & hashmask;
939 hh = HASHCHAIN_START;
941 h = HASHCHAIN_NEXT(h, hh, hashmask);
946 * run over string space, calculate offsets
948 * build id map (maps solv Id -> pool Id)
951 for (i = 1; i < numid; i++)
953 if (sp >= strsp + sizeid)
957 pool_debug(pool, SAT_ERROR, "not enough strings %d %d\n", i, numid);
958 return SOLV_ERROR_OVERFLOW;
960 if (!*sp) /* empty string */
968 h = strhash(sp) & hashmask;
969 hh = HASHCHAIN_START;
975 if (!strcmp(spool->stringspace + spool->strings[id], sp))
976 break; /* existing string */
977 h = HASHCHAIN_NEXT(h, hh, hashmask);
980 /* length == offset to next string */
982 if (id == ID_NULL) /* end of hash chain -> new string */
984 id = spool->nstrings++;
986 str[id] = spool->sstrings; /* save Offset */
987 if (sp != spool->stringspace + spool->sstrings) /* not at end-of-buffer */
988 memmove(spool->stringspace + spool->sstrings, sp, l); /* append to pool buffer */
989 spool->sstrings += l;
991 idmap[i] = id; /* repo relative -> pool relative */
992 sp += l; /* next string */
996 pool_shrink_strings(pool); /* vacuum */
999 /******* Part 2: Relation IDs ***************************************/
1009 pool->rels = sat_realloc2(pool->rels, pool->nrels + numrel, sizeof(Reldep));
1012 hashmask = mkmask(pool->nrels + numrel);
1014 POOL_DEBUG(SAT_DEBUG_STATS, "read %d rels\n", numrel);
1015 POOL_DEBUG(SAT_DEBUG_STATS, "rel hash buckets: %d\n", hashmask + 1);
1018 * prep hash table with already existing RelDeps
1021 hashtbl = sat_calloc(hashmask + 1, sizeof(Id));
1022 for (i = 1; i < pool->nrels; i++)
1024 h = relhash(ran[i].name, ran[i].evr, ran[i].flags) & hashmask;
1025 hh = HASHCHAIN_START;
1027 h = HASHCHAIN_NEXT(h, hh, hashmask);
1032 * read RelDeps from repo
1035 for (i = 0; i < numrel; i++)
1037 name = read_id(&data, i + numid); /* read (repo relative) Ids */
1038 evr = read_id(&data, i + numid);
1039 flags = read_u8(&data);
1040 name = idmap[name]; /* map to (pool relative) Ids */
1042 h = relhash(name, evr, flags) & hashmask;
1043 hh = HASHCHAIN_START;
1047 if (id == ID_NULL) /* end of hash chain */
1049 if (ran[id].name == name && ran[id].evr == evr && ran[id].flags == flags)
1051 h = HASHCHAIN_NEXT(h, hh, hashmask);
1053 if (id == ID_NULL) /* new RelDep */
1057 ran[id].name = name;
1059 ran[id].flags = flags;
1061 idmap[i + numid] = MAKERELDEP(id); /* fill Id map */
1064 pool_shrink_rels(pool); /* vacuum */
1068 /******* Part 3: Dirs ***********************************************/
1071 data.dirpool.dirs = sat_malloc2(numdir, sizeof(Id));
1072 data.dirpool.ndirs = numdir;
1073 data.dirpool.dirs[0] = 0; /* dir 0: virtual root */
1074 data.dirpool.dirs[1] = 1; /* dir 1: / */
1075 for (i = 2; i < numdir; i++)
1077 id = read_id(&data, i + numid);
1079 data.dirpool.dirs[i] = -(id - numid);
1081 data.dirpool.dirs[i] = idmap[id];
1083 data.dirpool.dirs[i] = id;
1087 /******* Part 4: Keys ***********************************************/
1089 keys = sat_calloc(numkeys, sizeof(*keys));
1090 /* keys start at 1 */
1091 for (i = 1; i < numkeys; i++)
1093 id = read_id(&data, numid);
1097 id = str2id(pool, stringpool_id2str(spool, id), 1);
1098 type = read_id(&data, numid);
1102 type = str2id(pool, stringpool_id2str(spool, type), 1);
1103 if (type < REPOKEY_TYPE_VOID || type > REPOKEY_TYPE_DIRNUMNUMARRAY)
1105 pool_debug(pool, SAT_ERROR, "unsupported data type '%s'\n", id2str(pool, type));
1106 data.error = SOLV_ERROR_UNSUPPORTED;
1107 type = REPOKEY_TYPE_VOID;
1110 keys[i].type = type;
1111 keys[i].size = read_id(&data, keys[i].type == REPOKEY_TYPE_CONSTANTID ? numid + numrel : 0);
1112 keys[i].storage = read_id(&data, 0);
1113 if (id >= SOLVABLE_NAME && id <= RPM_RPMDBID)
1114 keys[i].storage = KEY_STORAGE_SOLVABLE;
1115 else if (keys[i].storage == KEY_STORAGE_SOLVABLE)
1116 keys[i].storage = KEY_STORAGE_INCORE;
1117 if (keys[i].type == REPOKEY_TYPE_CONSTANTID)
1120 keys[i].size = idmap[keys[i].size];
1122 keys[i].size = str2id(pool, stringpool_id2str(spool, keys[i].size), 1);
1125 fprintf(stderr, "key %d %s %s %d %d\n", i, id2str(pool,id), id2str(pool, keys[i].type),
1126 keys[i].size, keys[i].storage);
1130 have_xdata = parent ? 1 : 0;
1131 for (i = 1; i < numkeys; i++)
1132 if (keys[i].storage == KEY_STORAGE_INCORE || keys[i].storage == KEY_STORAGE_VERTICAL_OFFSET)
1136 data.nkeys = numkeys;
1138 /******* Part 5: Schemata ********************************************/
1140 id = read_id(&data, 0);
1141 schemadata = sat_calloc(id + 1, sizeof(Id));
1142 schemadatap = schemadata + 1;
1143 schemadataend = schemadatap + id;
1144 schemata = sat_calloc(numschemata, sizeof(Id));
1145 for (i = 1; i < numschemata; i++)
1147 schemata[i] = schemadatap - schemadata;
1148 schemadatap = read_idarray(&data, numid, 0, schemadatap, schemadataend);
1150 Id *sp = schemadata + schemata[i];
1151 fprintf (stderr, "schema %d:", i);
1153 fprintf (stderr, " %d", *sp);
1154 fprintf (stderr, "\n");
1157 data.schemata = schemata;
1158 data.nschemata = numschemata;
1159 data.schemadata = schemadata;
1160 data.schemadatalen = schemadataend - data.schemadata;
1163 /******* Part 6: Info ***********************************************/
1164 oldnrepodata = repo->nrepodata;
1167 id = read_id(&data, 0);
1168 id = read_id(&data, 0);
1170 for (i = 0; i < numinfo; i++)
1172 /* for now we're just interested in data that starts with
1173 * the repodata_external id
1176 id = read_id(&data, numschemata);
1177 keyp = schemadata + schemata[id];
1179 if (keys[key].name == REPODATA_EXTERNAL && keys[key].type == REPOKEY_TYPE_VOID)
1181 /* external data for some ids */
1182 parse_external_repodata(&data, keyp, keys, idmap, numid, numrel);
1184 else if (keys[key].name == REPODATA_INFO)
1186 parse_info_repodata(&data, keyp, keys, idmap, numid, numrel);
1190 skip_schema(&data, keyp, keys, numid, numrel);
1195 /******* Part 7: item data *******************************************/
1197 /* calculate idarray size */
1199 for (i = 1; i < numkeys; i++)
1202 if ((keys[i].type == REPOKEY_TYPE_IDARRAY || keys[i].type == REPOKEY_TYPE_REL_IDARRAY)
1203 && id >= INTERESTED_START && id <= INTERESTED_END)
1204 size_idarray += keys[i].size;
1209 maxsize = read_id(&data, 0);
1210 allsize = read_id(&data, 0);
1211 if (maxsize > allsize)
1213 pool_debug(pool, SAT_ERROR, "maxsize %d is greater then allsize %d\n", maxsize, allsize);
1214 data.error = SOLV_ERROR_CORRUPT;
1218 maxsize = allsize = 0;
1220 /* allocate needed space in repo */
1221 /* we add maxsize because it is an upper limit for all idarrays */
1222 repo_reserve_ids(repo, 0, size_idarray + maxsize + 1);
1223 idarraydatap = repo->idarraydata + repo->idarraysize;
1224 repo->idarraysize += size_idarray;
1225 idarraydataend = idarraydatap + size_idarray;
1228 /* read solvables */
1232 s = pool_id2solvable(pool, parent->start);
1234 s = pool_id2solvable(pool, repo_add_solvable_block(repo, numsolv));
1235 /* store start and end of our id block */
1236 data.start = s - pool->solvables;
1237 data.end = data.start + numsolv;
1238 /* In case we have info blocks, make them refer to our part of the
1240 for (i = oldnrepodata; i < repo->nrepodata; i++)
1242 repo->repodata[i].start = data.start;
1243 repo->repodata[i].end = data.end;
1251 /* reserve one byte so that all offsets are not zero */
1252 incore_add_id(&data, 0);
1253 repodata_extend_block(&data, data.start, numsolv);
1257 buf = sat_calloc(maxsize + 4, 1);
1259 for (i = 0; i < numsolv; i++, s++)
1268 pool_debug(mypool, SAT_ERROR, "buffer overrun\n");
1269 data.error = SOLV_ERROR_EOF;
1273 memmove(buf, dp, left);
1277 if (l && fread(buf + left, l, 1, data.fp) != 1)
1279 pool_debug(mypool, SAT_ERROR, "unexpected EOF\n");
1280 data.error = SOLV_ERROR_EOF;
1287 dp = data_read_id_max(dp, &id, 0, numschemata, &data.error);
1290 data.incoreoffset[i] = data.incoredatalen;
1291 incore_add_id(&data, id);
1293 keyp = schemadata + schemata[id];
1294 while ((key = *keyp++) != 0)
1299 id = keys[key].name;
1301 fprintf(stderr, "solv %d name %d type %d class %d\n", i, id, keys[key].type, keys[key].storage);
1303 if (keys[key].storage == KEY_STORAGE_VERTICAL_OFFSET)
1305 /* copy offset/length into incore */
1307 dp = data_skip(dp, REPOKEY_TYPE_ID);
1308 dp = data_skip(dp, REPOKEY_TYPE_ID);
1309 incore_add_blob(&data, dps, dp - dps);
1312 switch (keys[key].type)
1314 case REPOKEY_TYPE_ID:
1315 dp = data_read_id_max(dp, &did, idmap, numid + numrel, &data.error);
1316 if (id == SOLVABLE_NAME)
1318 else if (id == SOLVABLE_ARCH)
1320 else if (id == SOLVABLE_EVR)
1322 else if (id == SOLVABLE_VENDOR)
1324 else if (keys[key].storage == KEY_STORAGE_INCORE)
1325 incore_add_id(&data, did);
1327 POOL_DEBUG(SAT_DEBUG_STATS, "%s -> %s\n", id2str(pool, id), id2str(pool, did));
1330 case REPOKEY_TYPE_U32:
1331 dp = data_read_u32(dp, &h);
1333 POOL_DEBUG(SAT_DEBUG_STATS, "%s -> %u\n", id2str(pool, id), h);
1335 if (id == RPM_RPMDBID)
1338 repo->rpmdbid = sat_calloc(numsolv, sizeof(Id));
1339 repo->rpmdbid[i] = h;
1341 else if (keys[key].storage == KEY_STORAGE_INCORE)
1342 incore_add_u32(&data, h);
1344 case REPOKEY_TYPE_IDARRAY:
1345 case REPOKEY_TYPE_REL_IDARRAY:
1346 if (id < INTERESTED_START || id > INTERESTED_END)
1349 dp = data_skip(dp, REPOKEY_TYPE_IDARRAY);
1350 if (keys[key].storage != KEY_STORAGE_INCORE)
1353 incore_map_idarray(&data, dps, idmap, numid);
1355 incore_add_blob(&data, dps, dp - dps);
1358 ido = idarraydatap - repo->idarraydata;
1359 if (keys[key].type == REPOKEY_TYPE_IDARRAY)
1360 dp = data_read_idarray(dp, &idarraydatap, idmap, numid + numrel, &data.error);
1361 else if (id == SOLVABLE_REQUIRES)
1362 dp = data_read_rel_idarray(dp, &idarraydatap, idmap, numid + numrel, &data.error, SOLVABLE_PREREQMARKER);
1363 else if (id == SOLVABLE_PROVIDES)
1364 dp = data_read_rel_idarray(dp, &idarraydatap, idmap, numid + numrel, &data.error, SOLVABLE_FILEMARKER);
1366 dp = data_read_rel_idarray(dp, &idarraydatap, idmap, numid + numrel, &data.error, 0);
1367 if (idarraydatap > idarraydataend)
1369 pool_debug(pool, SAT_ERROR, "idarray overflow\n");
1370 data.error = SOLV_ERROR_OVERFLOW;
1373 if (id == SOLVABLE_PROVIDES)
1375 else if (id == SOLVABLE_OBSOLETES)
1377 else if (id == SOLVABLE_CONFLICTS)
1379 else if (id == SOLVABLE_REQUIRES)
1381 else if (id == SOLVABLE_RECOMMENDS)
1383 else if (id == SOLVABLE_SUPPLEMENTS)
1384 s->supplements = ido;
1385 else if (id == SOLVABLE_SUGGESTS)
1387 else if (id == SOLVABLE_ENHANCES)
1389 else if (id == SOLVABLE_FRESHENS)
1392 POOL_DEBUG(SAT_DEBUG_STATS, "%s ->\n", id2str(pool, id));
1393 for (; repo->idarraydata[ido]; ido++)
1394 POOL_DEBUG(SAT_DEBUG_STATS," %s\n", dep2str(pool, repo->idarraydata[ido]));
1399 dp = data_skip(dp, keys[key].type);
1400 if (keys[key].storage == KEY_STORAGE_INCORE)
1401 incore_add_blob(&data, dps, dp - dps);
1407 /* should shrink idarraydata again */
1414 pool_debug(mypool, SAT_ERROR, "buffer overrun\n");
1415 data.error = SOLV_ERROR_EOF;
1422 /* free solvables */
1423 repo_free_solvable_block(repo, data.start, data.end - data.start, 1);
1425 repo->idarraysize -= size_idarray;
1426 /* free incore data */
1427 data.incoredata = sat_free(data.incoredata);
1428 data.incoredatalen = data.incoredatafree = 0;
1431 if (data.incoredatafree)
1433 /* shrink excess size */
1434 data.incoredata = sat_realloc(data.incoredata, data.incoredatalen);
1435 data.incoredatafree = 0;
1438 for (i = 1; i < numkeys; i++)
1439 if (keys[i].storage == KEY_STORAGE_VERTICAL_OFFSET)
1441 if (i < numkeys && !data.error)
1444 unsigned int pagesize;
1446 /* we have vertical data, make it available */
1447 data.verticaloffset = sat_calloc(numkeys, sizeof(Id));
1448 for (i = 1; i < numkeys; i++)
1449 if (keys[i].storage == KEY_STORAGE_VERTICAL_OFFSET)
1451 data.verticaloffset[i] = fileoffset;
1452 fileoffset += keys[i].size;
1454 data.lastverticaloffset = fileoffset;
1455 pagesize = read_u32(&data);
1456 repodata_read_or_setup_pages(&data, pagesize, fileoffset);
1460 /* no longer needed */
1464 if (parent && !data.error)
1467 sat_free(parent->schemata);
1468 sat_free(parent->schemadata);
1469 sat_free(parent->keys);
1470 sat_free(parent->location);
1473 else if ((data.incoredatalen || data.fp) && !data.error)
1475 /* we got some data, make it available */
1476 repo->repodata = sat_realloc2(repo->repodata, repo->nrepodata + 1, sizeof(data));
1477 repo->repodata[repo->nrepodata++] = data;
1482 sat_free(data.dirpool.dirs);
1483 sat_free(data.incoreoffset);
1485 sat_free(schemadata);
1495 repo_add_solv(Repo *repo, FILE *fp)
1497 return repo_add_solv_parent(repo, fp, 0);
1501 repodata_load_solv(Repodata *data)
1504 Pool *pool = data->repo->pool;
1505 if (!pool->loadcallback)
1507 data->state = REPODATA_ERROR;
1510 fp = pool->loadcallback(pool, data, pool->loadcallbackdata);
1513 data->state = REPODATA_ERROR;
1516 if (repo_add_solv_parent(data->repo, fp, data))
1517 data->state = REPODATA_ERROR;
1519 data->state = REPODATA_AVAILABLE;