2 * Copyright (c) 2007, Novell Inc.
4 * This program is licensed under the BSD license, read LICENSE.BSD
5 * for further information
11 * Read the binary dump of a Repo and create a Repo * from it
14 * Repo *pool_addrepo_solv(Pool *pool, FILE *fp)
26 #include "repo_solv.h"
31 #define INTERESTED_START SOLVABLE_NAME
32 #define INTERESTED_END SOLVABLE_FRESHENS
34 #define SOLV_ERROR_NOT_SOLV 1
35 #define SOLV_ERROR_UNSUPPORTED 2
36 #define SOLV_ERROR_EOF 3
37 #define SOLV_ERROR_ID_RANGE 4
38 #define SOLV_ERROR_OVERFLOW 5
39 #define SOLV_ERROR_CORRUPT 6
41 static Pool *mypool; /* for pool_debug... */
43 /*-----------------------------------------------------------------*/
44 /* .solv read functions */
51 read_u32(Repodata *data)
58 for (i = 0; i < 4; i++)
63 pool_debug(mypool, SAT_ERROR, "unexpected EOF\n");
64 data->error = SOLV_ERROR_EOF;
78 read_u8(Repodata *data)
87 pool_debug(mypool, SAT_ERROR, "unexpected EOF\n");
88 data->error = SOLV_ERROR_EOF;
100 read_id(Repodata *data, Id max)
107 for (i = 0; i < 5; i++)
112 pool_debug(mypool, SAT_ERROR, "unexpected EOF\n");
113 data->error = SOLV_ERROR_EOF;
121 pool_debug(mypool, SAT_ERROR, "read_id: id too large (%u/%u)\n", x, max);
122 data->error = SOLV_ERROR_ID_RANGE;
127 x = (x << 7) ^ c ^ 128;
129 pool_debug(mypool, SAT_ERROR, "read_id: id too long\n");
130 data->error = SOLV_ERROR_CORRUPT;
141 read_rel_idarray(Repodata *data, Id max, Id *map, Id *store, Id *end, Id marker)
154 pool_debug(mypool, SAT_ERROR, "unexpected EOF\n");
155 data->error = SOLV_ERROR_EOF;
160 x = (x << 7) ^ c ^ 128;
163 x = (x << 6) | (c & 63);
169 pool_debug(mypool, SAT_ERROR, "read_rel_idarray: array overflow\n");
170 data->error = SOLV_ERROR_OVERFLOW;
178 *store++ = marker; /* do not map! */
187 pool_debug(mypool, SAT_ERROR, "read_rel_idarray: id too large (%u/%u)\n", x, max);
188 data->error = SOLV_ERROR_ID_RANGE;
195 pool_debug(mypool, SAT_ERROR, "read_rel_idarray: array overflow\n");
201 if (x == 0) /* already have trailing zero? */
205 pool_debug(mypool, SAT_ERROR, "read_rel_idarray: array overflow\n");
206 data->error = SOLV_ERROR_OVERFLOW;
217 static inline unsigned char *
218 data_read_id_max(unsigned char *dp, Id *ret, Id *map, int max, int *error)
221 dp = data_read_id(dp, &x);
224 pool_debug(mypool, SAT_ERROR, "data_read_idarray: id too large (%u/%u)\n", x, max);
225 *error = SOLV_ERROR_ID_RANGE;
228 *ret = map ? map[x] : x;
233 data_read_idarray(unsigned char *dp, Id **storep, Id *map, int max, int *error)
244 x = (x << 7) ^ c ^ 128;
247 x = (x << 6) | (c & 63);
250 pool_debug(mypool, SAT_ERROR, "data_read_idarray: id too large (%u/%u)\n", x, max);
251 *error = SOLV_ERROR_ID_RANGE;
265 data_read_rel_idarray(unsigned char *dp, Id **storep, Id *map, int max, int *error, Id marker)
277 x = (x << 7) ^ c ^ 128;
280 x = (x << 6) | (c & 63);
294 pool_debug(mypool, SAT_ERROR, "data_read_rel_idarray: id too large (%u/%u)\n", x, max);
295 *error = SOLV_ERROR_ID_RANGE;
298 *store++ = map ? map[x] : x;
310 read_idarray(Repodata *data, Id max, Id *map, Id *store, Id *end)
322 pool_debug(mypool, SAT_ERROR, "unexpected EOF\n");
323 data->error = SOLV_ERROR_EOF;
328 x = (x << 7) ^ c ^ 128;
331 x = (x << 6) | (c & 63);
334 pool_debug(mypool, SAT_ERROR, "read_idarray: id too large (%u/%u)\n", x, max);
335 data->error = SOLV_ERROR_ID_RANGE;
342 pool_debug(mypool, SAT_ERROR, "read_idarray: array overflow\n");
348 if (x == 0) /* already have trailing zero? */
352 pool_debug(mypool, SAT_ERROR, "read_idarray: array overflow\n");
353 data->error = SOLV_ERROR_OVERFLOW;
364 read_str(Repodata *data, char **inbuf, unsigned *len)
366 unsigned char *buf = (unsigned char*)*inbuf;
369 buf = sat_malloc(1024);
374 while((c = getc(data->fp)) != 0)
378 pool_debug (mypool, SAT_ERROR, "unexpected EOF\n");
379 data->error = SOLV_ERROR_EOF;
382 /* Plus 1 as we also want to add the 0. */
386 /* Don't realloc on the inbuf, it might be on the stack. */
387 if (buf == (unsigned char*)*inbuf)
389 buf = sat_malloc(*len);
390 memcpy(buf, *inbuf, *len - 256);
393 buf = sat_realloc(buf, *len);
402 skip_item(Repodata *data, unsigned type, unsigned numid, unsigned numrel)
406 case REPOKEY_TYPE_VOID:
407 case REPOKEY_TYPE_CONSTANT:
408 case REPOKEY_TYPE_CONSTANTID:
410 case REPOKEY_TYPE_ID:
411 read_id(data, numid + numrel); /* just check Id */
413 case REPOKEY_TYPE_DIR:
414 read_id(data, numid + data->dirpool.ndirs); /* just check Id */
416 case REPOKEY_TYPE_NUM:
419 case REPOKEY_TYPE_U32:
422 case REPOKEY_TYPE_STR:
423 while (read_u8(data) != 0)
426 case REPOKEY_TYPE_MD5:
429 for (i = 0; i < SIZEOF_MD5; i++)
433 case REPOKEY_TYPE_SHA1:
436 for (i = 0; i < SIZEOF_SHA1; i++)
440 case REPOKEY_TYPE_SHA256:
443 for (i = 0; i < SIZEOF_SHA256; i++)
447 case REPOKEY_TYPE_IDARRAY:
448 case REPOKEY_TYPE_REL_IDARRAY:
449 while ((read_u8(data) & 0xc0) != 0)
452 case REPOKEY_TYPE_DIRNUMNUMARRAY:
455 read_id(data, numid + data->dirpool.ndirs); /* just check Id */
457 if (!(read_id(data, 0) & 0x40))
461 case REPOKEY_TYPE_DIRSTRARRAY:
464 Id id = read_id(data, 0);
465 while (read_u8(data) != 0)
472 pool_debug(mypool, SAT_ERROR, "unknown type %d\n", type);
473 data->error = SOLV_ERROR_CORRUPT;
479 key_cmp (const void *pa, const void *pb)
481 Repokey *a = (Repokey *)pa;
482 Repokey *b = (Repokey *)pb;
483 return a->name - b->name;
486 static void repodata_load_solv(Repodata *data);
489 parse_external_repodata(Repodata *maindata, Id *keyp, Repokey *keys, Id *idmap, unsigned numid, unsigned numrel)
491 Repo *repo = maindata->repo;
497 repo->repodata = sat_realloc2(repo->repodata, repo->nrepodata + 1, sizeof (*data));
498 data = repo->repodata + repo->nrepodata++;
499 memset(data, 0, sizeof(*data));
502 data->state = REPODATA_STUB;
503 data->loadcallback = repodata_load_solv;
505 while ((key = *keyp++) != 0)
508 switch (keys[key].type)
510 case REPOKEY_TYPE_IDARRAY:
511 if (id != REPODATA_KEYS)
513 skip_item(maindata, REPOKEY_TYPE_IDARRAY, numid, numrel);
516 /* read_idarray writes a terminating 0, that's why the + 1 */
517 ida = sat_calloc(keys[key].size + 1, sizeof(Id));
518 ide = read_idarray(maindata, numid, idmap, ida, ida + keys[key].size + 1);
522 pool_debug (mypool, SAT_ERROR, "invalid attribute data\n");
523 maindata->error = SOLV_ERROR_CORRUPT;
526 data->nkeys = 1 + (n >> 1);
527 data->keys = sat_malloc2(data->nkeys, sizeof(data->keys[0]));
528 memset(data->keys, 0, sizeof(Repokey));
529 for (i = 1, ide = ida; i < data->nkeys; i++)
531 data->keys[i].name = *ide++;
532 data->keys[i].type = *ide++;
533 data->keys[i].size = 0;
534 data->keys[i].storage = 0;
538 qsort(data->keys + 1, data->nkeys - 1, sizeof(data->keys[0]), key_cmp);
540 case REPOKEY_TYPE_STR:
541 if (id != REPODATA_LOCATION)
542 skip_item(maindata, REPOKEY_TYPE_STR, numid, numrel);
546 unsigned len = sizeof(buf);
547 char *filename = buf;
548 read_str(maindata, &filename, &len);
549 data->location = strdup(filename);
555 skip_item(maindata, keys[key].type, numid, numrel);
562 parse_info_repodata(Repodata *maindata, Id *keyp, Repokey *keys, Id *idmap, unsigned numid, unsigned numrel)
566 while ((key = *keyp++) != 0)
569 if (id == REPODATA_ADDEDFILEPROVIDES && keys[key].type == REPOKEY_TYPE_REL_IDARRAY)
572 /* + 1 just in case */
573 ida = sat_calloc(keys[key].size + 1, sizeof(Id));
574 read_idarray(maindata, 0, 0, ida, ida + keys[key].size + 1);
575 maindata->addedfileprovides = ida;
584 *ida = idmap ? idmap[old] : old;
588 skip_item(maindata, keys[key].type, numid, numrel);
592 /*-----------------------------------------------------------------*/
596 skip_schema(Repodata *data, Id *keyp, Repokey *keys, unsigned int numid, unsigned int numrel)
599 while ((key = *keyp++) != 0)
600 skip_item(data, keys[key].type, numid, numrel);
603 /*-----------------------------------------------------------------*/
606 incore_add_id(Repodata *data, Id x)
609 /* make sure we have at least 5 bytes free */
610 if (data->incoredatafree < 5)
612 data->incoredata = sat_realloc(data->incoredata, data->incoredatalen + 1024);
613 data->incoredatafree = 1024;
615 dp = data->incoredata + data->incoredatalen;
621 *dp++ = (x >> 28) | 128;
623 *dp++ = (x >> 21) | 128;
624 *dp++ = (x >> 14) | 128;
627 *dp++ = (x >> 7) | 128;
629 data->incoredatafree -= dp - (data->incoredata + data->incoredatalen);
630 data->incoredatalen = dp - data->incoredata;
634 incore_add_blob(Repodata *data, unsigned char *buf, int len)
636 if (data->incoredatafree < len)
638 data->incoredata = sat_realloc(data->incoredata, data->incoredatalen + 1024 + len);
639 data->incoredatafree = 1024 + len;
641 memcpy(data->incoredata + data->incoredatalen, buf, len);
642 data->incoredatafree -= len;
643 data->incoredatalen += len;
647 incore_map_idarray(Repodata *data, unsigned char *dp, Id *map, Id max)
649 /* We have to map the IDs, which might also change
650 the necessary number of bytes, so we can't just copy
651 over the blob and adjust it. */
656 dp = data_read_ideof(dp, &id, &eof);
657 if (max && id >= max)
659 pool_debug(mypool, SAT_ERROR, "incore_map_idarray: id too large (%u/%u)\n", id, max);
660 data->error = SOLV_ERROR_ID_RANGE;
665 id = (id & 63) | ((id & ~63) << 1);
666 incore_add_id(data, eof ? id : id | 64);
673 incore_add_u32(Repodata *data, unsigned int x)
676 /* make sure we have at least 4 bytes free */
677 if (data->incoredatafree < 4)
679 data->incoredata = sat_realloc(data->incoredata, data->incoredatalen + 1024);
680 data->incoredatafree = 1024;
682 dp = data->incoredata + data->incoredatalen;
687 data->incoredatafree -= 4;
688 data->incoredatalen += 4;
693 incore_add_u8(Repodata *data, unsigned int x)
696 /* make sure we have at least 1 byte free */
697 if (data->incoredatafree < 1)
699 data->incoredata = sat_realloc(data->incoredata, data->incoredatalen + 1024);
700 data->incoredatafree = 1024;
702 dp = data->incoredata + data->incoredatalen;
704 data->incoredatafree--;
705 data->incoredatalen++;
711 // ----------------------------------------------
715 * read repo from .solv file
720 repo_add_solv_parent(Repo *repo, FILE *fp, Repodata *parent)
722 Pool *pool = repo->pool;
724 unsigned int numid, numrel, numdir, numsolv;
725 unsigned int numkeys, numschemata, numinfo, numextra, contentver;
728 Offset *str; /* map Id -> Offset into string space */
729 char *strsp; /* repo string space */
730 char *sp; /* pointer into string space */
731 Id *idmap; /* map of repo Ids to pool Ids */
733 unsigned int hashmask, h;
739 unsigned int size_idarray;
740 Id *idarraydatap, *idarraydataend;
743 unsigned int solvflags;
744 unsigned int solvversion;
746 Id *schemadata, *schemadatap, *schemadataend;
749 unsigned oldnrepodata;
750 int maxsize, allsize;
751 unsigned char *buf, *dp, *dps;
754 struct _Stringpool *spool;
758 memset(&data, 0, sizeof(data));
765 if (read_u32(&data) != ('S' << 24 | 'O' << 16 | 'L' << 8 | 'V'))
767 pool_debug(pool, SAT_ERROR, "not a SOLV file\n");
768 return SOLV_ERROR_NOT_SOLV;
770 solvversion = read_u32(&data);
778 pool_debug(pool, SAT_ERROR, "unsupported SOLV version\n");
779 return SOLV_ERROR_UNSUPPORTED;
782 pool_freeidhashes(pool);
784 numid = read_u32(&data);
785 numrel = read_u32(&data);
786 numdir = read_u32(&data);
787 numsolv = read_u32(&data);
788 numkeys = read_u32(&data);
789 numschemata = read_u32(&data);
790 numinfo = read_u32(&data);
791 if (solvversion > SOLV_VERSION_6)
793 numextra = read_u32(&data);
794 contentver = read_u32(&data);
797 numextra = 0, contentver = 1;
798 solvflags = read_u32(&data);
800 if (numdir && numdir < 2)
802 pool_debug(pool, SAT_ERROR, "bad number of dirs\n");
803 return SOLV_ERROR_CORRUPT;
810 pool_debug(pool, SAT_ERROR, "relations are forbidden in a store\n");
811 return SOLV_ERROR_CORRUPT;
813 if (parent->end - parent->start != numsolv)
815 pool_debug(pool, SAT_ERROR, "unequal number of solvables in a store\n");
816 return SOLV_ERROR_CORRUPT;
818 if (parent->nextra != numextra)
820 pool_debug(pool, SAT_ERROR, "unequal number of non-solvables in a store\n");
821 return SOLV_ERROR_CORRUPT;
825 pool_debug(pool, SAT_ERROR, "info blocks are forbidden in a store\n");
826 return SOLV_ERROR_CORRUPT;
830 /******* Part 1: string IDs *****************************************/
832 sizeid = read_u32(&data); /* size of string+Id space */
835 * read strings and Ids
850 spool->stringspace = sat_malloc(7);
851 strcpy(spool->stringspace, "<NULL>");
856 /* alloc string buffer */
857 spool->stringspace = sat_realloc(spool->stringspace, spool->sstrings + sizeid + 1);
858 /* alloc string offsets (Id -> Offset into string space) */
859 spool->strings = sat_realloc2(spool->strings, spool->nstrings + numid, sizeof(Offset));
861 strsp = spool->stringspace;
862 str = spool->strings; /* array of offsets into strsp, indexed by Id */
864 /* point to _BEHIND_ already allocated string/Id space */
865 strsp += spool->sstrings;
869 * read new repo at end of pool
872 if ((solvflags & SOLV_FLAG_PREFIX_POOL) == 0)
874 if (sizeid && fread(strsp, sizeid, 1, fp) != 1)
876 pool_debug(pool, SAT_ERROR, "read error while reading strings\n");
877 return SOLV_ERROR_EOF;
882 unsigned int pfsize = read_u32(&data);
883 char *prefix = sat_malloc(pfsize);
889 if (pfsize && fread(prefix, pfsize, 1, fp) != 1)
891 pool_debug(pool, SAT_ERROR, "read error while reading strings\n");
893 return SOLV_ERROR_EOF;
895 for (i = 1; i < numid; i++)
897 int same = (unsigned char)*pp++;
898 size_t len = strlen(pp) + 1;
899 freesp -= same + len;
902 pool_debug(pool, SAT_ERROR, "overflow while expanding strings\n");
904 return SOLV_ERROR_OVERFLOW;
907 memcpy(dest, old_str, same);
908 memcpy(dest + same, pp, len);
916 pool_debug(pool, SAT_ERROR, "expanding strings size mismatch\n");
917 return SOLV_ERROR_CORRUPT;
920 strsp[sizeid] = 0; /* make string space \0 terminated */
925 /* no shared pool, thus no idmap and no unification */
927 spool->nstrings = numid;
931 /* we need the '' for directories */
932 pool_debug(pool, SAT_ERROR, "store strings don't start with ''\n");
933 return SOLV_ERROR_CORRUPT;
935 for (i = 1; i < spool->nstrings; i++)
937 if (sp >= strsp + sizeid)
939 pool_debug(pool, SAT_ERROR, "not enough strings\n");
940 return SOLV_ERROR_OVERFLOW;
942 str[i] = sp - spool->stringspace;
943 sp += strlen(sp) + 1;
945 spool->sstrings = sp - spool->stringspace;
950 /* alloc id map for name and rel Ids. this maps ids in the solv files
951 * to the ids in our pool */
952 idmap = sat_calloc(numid + numrel, sizeof(Id));
955 * build hashes for all read strings
959 hashmask = mkmask(spool->nstrings + numid);
962 POOL_DEBUG(SAT_DEBUG_STATS, "read %d strings\n", numid);
963 POOL_DEBUG(SAT_DEBUG_STATS, "string hash buckets: %d\n", hashmask + 1);
967 * create hashtable with strings already in pool
970 hashtbl = sat_calloc(hashmask + 1, sizeof(Id));
971 for (i = 1; i < spool->nstrings; i++) /* leave out our dummy zero id */
973 h = strhash(spool->stringspace + spool->strings[i]) & hashmask;
974 hh = HASHCHAIN_START;
976 h = HASHCHAIN_NEXT(h, hh, hashmask);
981 * run over string space, calculate offsets
983 * build id map (maps solv Id -> pool Id)
986 for (i = 1; i < numid; i++)
988 if (sp >= strsp + sizeid)
992 pool_debug(pool, SAT_ERROR, "not enough strings %d %d\n", i, numid);
993 return SOLV_ERROR_OVERFLOW;
995 if (!*sp) /* empty string */
1002 /* find hash slot */
1003 h = strhash(sp) & hashmask;
1004 hh = HASHCHAIN_START;
1010 if (!strcmp(spool->stringspace + spool->strings[id], sp))
1011 break; /* existing string */
1012 h = HASHCHAIN_NEXT(h, hh, hashmask);
1015 /* length == offset to next string */
1017 if (id == ID_NULL) /* end of hash chain -> new string */
1019 id = spool->nstrings++;
1021 str[id] = spool->sstrings; /* save Offset */
1022 if (sp != spool->stringspace + spool->sstrings) /* not at end-of-buffer */
1023 memmove(spool->stringspace + spool->sstrings, sp, l); /* append to pool buffer */
1024 spool->sstrings += l;
1026 idmap[i] = id; /* repo relative -> pool relative */
1027 sp += l; /* next string */
1031 pool_shrink_strings(pool); /* vacuum */
1034 /******* Part 2: Relation IDs ***************************************/
1044 pool->rels = sat_realloc2(pool->rels, pool->nrels + numrel, sizeof(Reldep));
1047 hashmask = mkmask(pool->nrels + numrel);
1049 POOL_DEBUG(SAT_DEBUG_STATS, "read %d rels\n", numrel);
1050 POOL_DEBUG(SAT_DEBUG_STATS, "rel hash buckets: %d\n", hashmask + 1);
1053 * prep hash table with already existing RelDeps
1056 hashtbl = sat_calloc(hashmask + 1, sizeof(Id));
1057 for (i = 1; i < pool->nrels; i++)
1059 h = relhash(ran[i].name, ran[i].evr, ran[i].flags) & hashmask;
1060 hh = HASHCHAIN_START;
1062 h = HASHCHAIN_NEXT(h, hh, hashmask);
1067 * read RelDeps from repo
1070 for (i = 0; i < numrel; i++)
1072 name = read_id(&data, i + numid); /* read (repo relative) Ids */
1073 evr = read_id(&data, i + numid);
1074 flags = read_u8(&data);
1075 name = idmap[name]; /* map to (pool relative) Ids */
1077 h = relhash(name, evr, flags) & hashmask;
1078 hh = HASHCHAIN_START;
1082 if (id == ID_NULL) /* end of hash chain */
1084 if (ran[id].name == name && ran[id].evr == evr && ran[id].flags == flags)
1086 h = HASHCHAIN_NEXT(h, hh, hashmask);
1088 if (id == ID_NULL) /* new RelDep */
1092 ran[id].name = name;
1094 ran[id].flags = flags;
1096 idmap[i + numid] = MAKERELDEP(id); /* fill Id map */
1099 pool_shrink_rels(pool); /* vacuum */
1103 /******* Part 3: Dirs ***********************************************/
1106 data.dirpool.dirs = sat_malloc2(numdir, sizeof(Id));
1107 data.dirpool.ndirs = numdir;
1108 data.dirpool.dirs[0] = 0; /* dir 0: virtual root */
1109 data.dirpool.dirs[1] = 1; /* dir 1: / */
1110 for (i = 2; i < numdir; i++)
1112 id = read_id(&data, i + numid);
1114 data.dirpool.dirs[i] = -(id - numid);
1116 data.dirpool.dirs[i] = idmap[id];
1118 data.dirpool.dirs[i] = id;
1122 /******* Part 4: Keys ***********************************************/
1124 keys = sat_calloc(numkeys, sizeof(*keys));
1125 /* keys start at 1 */
1126 for (i = 1; i < numkeys; i++)
1128 id = read_id(&data, numid);
1132 id = str2id(pool, stringpool_id2str(spool, id), 1);
1133 type = read_id(&data, numid);
1137 type = str2id(pool, stringpool_id2str(spool, type), 1);
1138 if (type < REPOKEY_TYPE_VOID || type > REPOKEY_TYPE_SHA256)
1140 pool_debug(pool, SAT_ERROR, "unsupported data type '%s'\n", id2str(pool, type));
1141 data.error = SOLV_ERROR_UNSUPPORTED;
1142 type = REPOKEY_TYPE_VOID;
1145 keys[i].type = type;
1146 keys[i].size = read_id(&data, keys[i].type == REPOKEY_TYPE_CONSTANTID ? numid + numrel : 0);
1147 keys[i].storage = read_id(&data, 0);
1148 if (id >= SOLVABLE_NAME && id <= RPM_RPMDBID)
1149 keys[i].storage = KEY_STORAGE_SOLVABLE;
1150 else if (keys[i].storage == KEY_STORAGE_SOLVABLE)
1151 keys[i].storage = KEY_STORAGE_INCORE;
1152 if (keys[i].type == REPOKEY_TYPE_CONSTANTID)
1155 keys[i].size = idmap[keys[i].size];
1157 keys[i].size = str2id(pool, stringpool_id2str(spool, keys[i].size), 1);
1160 fprintf(stderr, "key %d %s %s %d %d\n", i, id2str(pool,id), id2str(pool, keys[i].type),
1161 keys[i].size, keys[i].storage);
1165 have_xdata = parent ? 1 : 0;
1166 for (i = 1; i < numkeys; i++)
1167 if (keys[i].storage == KEY_STORAGE_INCORE || keys[i].storage == KEY_STORAGE_VERTICAL_OFFSET)
1171 data.nkeys = numkeys;
1173 /******* Part 5: Schemata ********************************************/
1175 id = read_id(&data, 0);
1176 schemadata = sat_calloc(id + 1, sizeof(Id));
1177 schemadatap = schemadata + 1;
1178 schemadataend = schemadatap + id;
1179 schemata = sat_calloc(numschemata, sizeof(Id));
1180 for (i = 1; i < numschemata; i++)
1182 schemata[i] = schemadatap - schemadata;
1183 schemadatap = read_idarray(&data, numid, 0, schemadatap, schemadataend);
1185 Id *sp = schemadata + schemata[i];
1186 fprintf (stderr, "schema %d:", i);
1188 fprintf (stderr, " %d", *sp);
1189 fprintf (stderr, "\n");
1192 data.schemata = schemata;
1193 data.nschemata = numschemata;
1194 data.schemadata = schemadata;
1195 data.schemadatalen = schemadataend - data.schemadata;
1198 /******* Part 6: Info ***********************************************/
1199 oldnrepodata = repo->nrepodata;
1202 id = read_id(&data, 0);
1203 id = read_id(&data, 0);
1205 for (i = 0; i < numinfo; i++)
1207 /* for now we're just interested in data that starts with
1208 * the repodata_external id
1211 id = read_id(&data, numschemata);
1212 keyp = schemadata + schemata[id];
1214 if (keys[key].name == REPODATA_EXTERNAL && keys[key].type == REPOKEY_TYPE_VOID)
1216 /* external data for some ids */
1217 parse_external_repodata(&data, keyp, keys, idmap, numid, numrel);
1219 else if (keys[key].name == REPODATA_INFO)
1221 parse_info_repodata(&data, keyp, keys, idmap, numid, numrel);
1225 skip_schema(&data, keyp, keys, numid, numrel);
1230 /******* Part 7: item data *******************************************/
1232 /* calculate idarray size */
1234 for (i = 1; i < numkeys; i++)
1237 if ((keys[i].type == REPOKEY_TYPE_IDARRAY || keys[i].type == REPOKEY_TYPE_REL_IDARRAY)
1238 && id >= INTERESTED_START && id <= INTERESTED_END)
1239 size_idarray += keys[i].size;
1242 if (numsolv || numextra)
1244 maxsize = read_id(&data, 0);
1245 allsize = read_id(&data, 0);
1246 if (maxsize > allsize)
1248 pool_debug(pool, SAT_ERROR, "maxsize %d is greater then allsize %d\n", maxsize, allsize);
1249 data.error = SOLV_ERROR_CORRUPT;
1253 maxsize = allsize = 0;
1255 /* allocate needed space in repo */
1256 /* we add maxsize because it is an upper limit for all idarrays */
1257 repo_reserve_ids(repo, 0, size_idarray + maxsize + 1);
1258 idarraydatap = repo->idarraydata + repo->idarraysize;
1259 repo->idarraysize += size_idarray;
1260 idarraydataend = idarraydatap + size_idarray;
1263 /* read solvables */
1267 s = pool_id2solvable(pool, parent->start);
1269 s = pool_id2solvable(pool, repo_add_solvable_block(repo, numsolv));
1270 /* store start and end of our id block */
1271 data.start = s - pool->solvables;
1272 data.end = data.start + numsolv;
1273 /* In case we have info blocks, make them refer to our part of the
1275 for (i = oldnrepodata; i < repo->nrepodata; i++)
1277 repo->repodata[i].start = data.start;
1278 repo->repodata[i].end = data.end;
1286 data.extrastart = repo->nextra;
1287 repodata_extend_extra(&data, numextra);
1288 repo->nextra += numextra;
1289 for (i = oldnrepodata; i < repo->nrepodata; i++)
1291 repo->repodata[i].extrastart = data.extrastart;
1292 repo->repodata[i].nextra = data.nextra;
1298 /* reserve one byte so that all offsets are not zero */
1299 incore_add_id(&data, 0);
1300 repodata_extend_block(&data, data.start, numsolv);
1304 buf = sat_calloc(maxsize + 4, 1);
1306 for (i = 0; i < numsolv + numextra; i++, s++)
1315 pool_debug(mypool, SAT_ERROR, "buffer overrun\n");
1316 data.error = SOLV_ERROR_EOF;
1320 memmove(buf, dp, left);
1324 if (l && fread(buf + left, l, 1, data.fp) != 1)
1326 pool_debug(mypool, SAT_ERROR, "unexpected EOF\n");
1327 data.error = SOLV_ERROR_EOF;
1334 dp = data_read_id_max(dp, &id, 0, numschemata, &data.error);
1338 data.incoreoffset[i] = data.incoredatalen;
1340 data.extraoffset[i - numsolv] = data.incoredatalen;
1341 incore_add_id(&data, id);
1347 fprintf(stderr, "solv %d: schema %d\n", i, id);
1349 fprintf(stderr, "extra %d: schema %d\n", i - numsolv, id);
1351 keyp = schemadata + schemata[id];
1352 while ((key = *keyp++) != 0)
1357 id = keys[key].name;
1360 fprintf(stderr, "solv %d name %d type %d class %d\n", i, id, keys[key].type, keys[key].storage);
1362 fprintf(stderr, "extra %d name %d type %d class %d\n", i - numsolv, id, keys[key].type, keys[key].storage);
1364 if (keys[key].storage == KEY_STORAGE_VERTICAL_OFFSET)
1366 /* copy offset/length into incore */
1368 dp = data_skip(dp, REPOKEY_TYPE_ID);
1369 dp = data_skip(dp, REPOKEY_TYPE_ID);
1370 incore_add_blob(&data, dps, dp - dps);
1373 switch (keys[key].type)
1375 case REPOKEY_TYPE_ID:
1376 dp = data_read_id_max(dp, &did, idmap, numid + numrel, &data.error);
1377 if (id == SOLVABLE_NAME)
1379 else if (id == SOLVABLE_ARCH)
1381 else if (id == SOLVABLE_EVR)
1383 else if (id == SOLVABLE_VENDOR)
1385 else if (keys[key].storage == KEY_STORAGE_INCORE)
1386 incore_add_id(&data, did);
1388 POOL_DEBUG(SAT_DEBUG_STATS, "%s -> %s\n", id2str(pool, id), id2str(pool, did));
1391 case REPOKEY_TYPE_U32:
1392 dp = data_read_u32(dp, &h);
1394 POOL_DEBUG(SAT_DEBUG_STATS, "%s -> %u\n", id2str(pool, id), h);
1396 if (id == RPM_RPMDBID)
1399 repo->rpmdbid = sat_calloc(numsolv, sizeof(Id));
1400 repo->rpmdbid[i] = h;
1402 else if (keys[key].storage == KEY_STORAGE_INCORE)
1403 incore_add_u32(&data, h);
1405 case REPOKEY_TYPE_IDARRAY:
1406 case REPOKEY_TYPE_REL_IDARRAY:
1407 if (id < INTERESTED_START || id > INTERESTED_END)
1410 dp = data_skip(dp, REPOKEY_TYPE_IDARRAY);
1411 if (keys[key].storage != KEY_STORAGE_INCORE)
1414 incore_map_idarray(&data, dps, idmap, numid);
1416 incore_add_blob(&data, dps, dp - dps);
1419 ido = idarraydatap - repo->idarraydata;
1420 if (keys[key].type == REPOKEY_TYPE_IDARRAY)
1421 dp = data_read_idarray(dp, &idarraydatap, idmap, numid + numrel, &data.error);
1422 else if (id == SOLVABLE_REQUIRES)
1423 dp = data_read_rel_idarray(dp, &idarraydatap, idmap, numid + numrel, &data.error, SOLVABLE_PREREQMARKER);
1424 else if (id == SOLVABLE_PROVIDES)
1425 dp = data_read_rel_idarray(dp, &idarraydatap, idmap, numid + numrel, &data.error, SOLVABLE_FILEMARKER);
1427 dp = data_read_rel_idarray(dp, &idarraydatap, idmap, numid + numrel, &data.error, 0);
1428 if (idarraydatap > idarraydataend)
1430 pool_debug(pool, SAT_ERROR, "idarray overflow\n");
1431 data.error = SOLV_ERROR_OVERFLOW;
1434 if (id == SOLVABLE_PROVIDES)
1436 else if (id == SOLVABLE_OBSOLETES)
1438 else if (id == SOLVABLE_CONFLICTS)
1440 else if (id == SOLVABLE_REQUIRES)
1442 else if (id == SOLVABLE_RECOMMENDS)
1444 else if (id == SOLVABLE_SUPPLEMENTS)
1445 s->supplements = ido;
1446 else if (id == SOLVABLE_SUGGESTS)
1448 else if (id == SOLVABLE_ENHANCES)
1450 else if (id == SOLVABLE_FRESHENS)
1453 POOL_DEBUG(SAT_DEBUG_STATS, "%s ->\n", id2str(pool, id));
1454 for (; repo->idarraydata[ido]; ido++)
1455 POOL_DEBUG(SAT_DEBUG_STATS," %s\n", dep2str(pool, repo->idarraydata[ido]));
1460 dp = data_skip(dp, keys[key].type);
1461 if (keys[key].storage == KEY_STORAGE_INCORE)
1462 incore_add_blob(&data, dps, dp - dps);
1468 /* should shrink idarraydata again */
1475 pool_debug(mypool, SAT_ERROR, "buffer overrun\n");
1476 data.error = SOLV_ERROR_EOF;
1483 /* free solvables */
1484 repo_free_solvable_block(repo, data.start, data.end - data.start, 1);
1486 repo->idarraysize -= size_idarray;
1487 /* free incore data */
1488 data.incoredata = sat_free(data.incoredata);
1489 data.incoredatalen = data.incoredatafree = 0;
1492 if (data.incoredatafree)
1494 /* shrink excess size */
1495 data.incoredata = sat_realloc(data.incoredata, data.incoredatalen);
1496 data.incoredatafree = 0;
1499 for (i = 1; i < numkeys; i++)
1500 if (keys[i].storage == KEY_STORAGE_VERTICAL_OFFSET)
1502 if (i < numkeys && !data.error)
1505 unsigned int pagesize;
1507 /* we have vertical data, make it available */
1508 data.verticaloffset = sat_calloc(numkeys, sizeof(Id));
1509 for (i = 1; i < numkeys; i++)
1510 if (keys[i].storage == KEY_STORAGE_VERTICAL_OFFSET)
1512 data.verticaloffset[i] = fileoffset;
1513 fileoffset += keys[i].size;
1515 data.lastverticaloffset = fileoffset;
1516 pagesize = read_u32(&data);
1517 repodata_read_or_setup_pages(&data, pagesize, fileoffset);
1521 /* no longer needed */
1525 if (parent && !data.error)
1528 sat_free(parent->schemata);
1529 sat_free(parent->schemadata);
1530 sat_free(parent->keys);
1531 sat_free(parent->location);
1534 else if ((data.incoredatalen || data.fp) && !data.error)
1536 /* we got some data, make it available */
1537 repo->repodata = sat_realloc2(repo->repodata, repo->nrepodata + 1, sizeof(data));
1538 repo->repodata[repo->nrepodata++] = data;
1543 sat_free(data.dirpool.dirs);
1544 sat_free(data.incoreoffset);
1546 sat_free(schemadata);
1556 repo_add_solv(Repo *repo, FILE *fp)
1558 return repo_add_solv_parent(repo, fp, 0);
1562 repodata_load_solv(Repodata *data)
1565 Pool *pool = data->repo->pool;
1566 if (!pool->loadcallback)
1568 data->state = REPODATA_ERROR;
1571 fp = pool->loadcallback(pool, data, pool->loadcallbackdata);
1574 data->state = REPODATA_ERROR;
1577 if (repo_add_solv_parent(data->repo, fp, data))
1578 data->state = REPODATA_ERROR;
1580 data->state = REPODATA_AVAILABLE;