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;
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)
792 numextra = read_u32(&data);
795 solvflags = read_u32(&data);
797 if (numdir && numdir < 2)
799 pool_debug(pool, SAT_ERROR, "bad number of dirs\n");
800 return SOLV_ERROR_CORRUPT;
807 pool_debug(pool, SAT_ERROR, "relations are forbidden in a store\n");
808 return SOLV_ERROR_CORRUPT;
810 if (parent->end - parent->start != numsolv)
812 pool_debug(pool, SAT_ERROR, "unequal number of solvables in a store\n");
813 return SOLV_ERROR_CORRUPT;
815 if (parent->nextra != numextra)
817 pool_debug(pool, SAT_ERROR, "unequal number of non-solvables in a store\n");
818 return SOLV_ERROR_CORRUPT;
822 pool_debug(pool, SAT_ERROR, "info blocks are forbidden in a store\n");
823 return SOLV_ERROR_CORRUPT;
827 /******* Part 1: string IDs *****************************************/
829 sizeid = read_u32(&data); /* size of string+Id space */
832 * read strings and Ids
847 spool->stringspace = sat_malloc(7);
848 strcpy(spool->stringspace, "<NULL>");
853 /* alloc string buffer */
854 spool->stringspace = sat_realloc(spool->stringspace, spool->sstrings + sizeid + 1);
855 /* alloc string offsets (Id -> Offset into string space) */
856 spool->strings = sat_realloc2(spool->strings, spool->nstrings + numid, sizeof(Offset));
858 strsp = spool->stringspace;
859 str = spool->strings; /* array of offsets into strsp, indexed by Id */
861 /* point to _BEHIND_ already allocated string/Id space */
862 strsp += spool->sstrings;
866 * read new repo at end of pool
869 if ((solvflags & SOLV_FLAG_PREFIX_POOL) == 0)
871 if (sizeid && fread(strsp, sizeid, 1, fp) != 1)
873 pool_debug(pool, SAT_ERROR, "read error while reading strings\n");
874 return SOLV_ERROR_EOF;
879 unsigned int pfsize = read_u32(&data);
880 char *prefix = sat_malloc(pfsize);
886 if (pfsize && fread(prefix, pfsize, 1, fp) != 1)
888 pool_debug(pool, SAT_ERROR, "read error while reading strings\n");
890 return SOLV_ERROR_EOF;
892 for (i = 1; i < numid; i++)
894 int same = (unsigned char)*pp++;
895 size_t len = strlen(pp) + 1;
896 freesp -= same + len;
899 pool_debug(pool, SAT_ERROR, "overflow while expanding strings\n");
901 return SOLV_ERROR_OVERFLOW;
904 memcpy(dest, old_str, same);
905 memcpy(dest + same, pp, len);
913 pool_debug(pool, SAT_ERROR, "expanding strings size mismatch\n");
914 return SOLV_ERROR_CORRUPT;
917 strsp[sizeid] = 0; /* make string space \0 terminated */
922 /* no shared pool, thus no idmap and no unification */
924 spool->nstrings = numid;
928 /* we need the '' for directories */
929 pool_debug(pool, SAT_ERROR, "store strings don't start with ''\n");
930 return SOLV_ERROR_CORRUPT;
932 for (i = 1; i < spool->nstrings; i++)
934 if (sp >= strsp + sizeid)
936 pool_debug(pool, SAT_ERROR, "not enough strings\n");
937 return SOLV_ERROR_OVERFLOW;
939 str[i] = sp - spool->stringspace;
940 sp += strlen(sp) + 1;
942 spool->sstrings = sp - spool->stringspace;
947 /* alloc id map for name and rel Ids. this maps ids in the solv files
948 * to the ids in our pool */
949 idmap = sat_calloc(numid + numrel, sizeof(Id));
952 * build hashes for all read strings
956 hashmask = mkmask(spool->nstrings + numid);
959 POOL_DEBUG(SAT_DEBUG_STATS, "read %d strings\n", numid);
960 POOL_DEBUG(SAT_DEBUG_STATS, "string hash buckets: %d\n", hashmask + 1);
964 * create hashtable with strings already in pool
967 hashtbl = sat_calloc(hashmask + 1, sizeof(Id));
968 for (i = 1; i < spool->nstrings; i++) /* leave out our dummy zero id */
970 h = strhash(spool->stringspace + spool->strings[i]) & hashmask;
971 hh = HASHCHAIN_START;
973 h = HASHCHAIN_NEXT(h, hh, hashmask);
978 * run over string space, calculate offsets
980 * build id map (maps solv Id -> pool Id)
983 for (i = 1; i < numid; i++)
985 if (sp >= strsp + sizeid)
989 pool_debug(pool, SAT_ERROR, "not enough strings %d %d\n", i, numid);
990 return SOLV_ERROR_OVERFLOW;
992 if (!*sp) /* empty string */
1000 h = strhash(sp) & hashmask;
1001 hh = HASHCHAIN_START;
1007 if (!strcmp(spool->stringspace + spool->strings[id], sp))
1008 break; /* existing string */
1009 h = HASHCHAIN_NEXT(h, hh, hashmask);
1012 /* length == offset to next string */
1014 if (id == ID_NULL) /* end of hash chain -> new string */
1016 id = spool->nstrings++;
1018 str[id] = spool->sstrings; /* save Offset */
1019 if (sp != spool->stringspace + spool->sstrings) /* not at end-of-buffer */
1020 memmove(spool->stringspace + spool->sstrings, sp, l); /* append to pool buffer */
1021 spool->sstrings += l;
1023 idmap[i] = id; /* repo relative -> pool relative */
1024 sp += l; /* next string */
1028 pool_shrink_strings(pool); /* vacuum */
1031 /******* Part 2: Relation IDs ***************************************/
1041 pool->rels = sat_realloc2(pool->rels, pool->nrels + numrel, sizeof(Reldep));
1044 hashmask = mkmask(pool->nrels + numrel);
1046 POOL_DEBUG(SAT_DEBUG_STATS, "read %d rels\n", numrel);
1047 POOL_DEBUG(SAT_DEBUG_STATS, "rel hash buckets: %d\n", hashmask + 1);
1050 * prep hash table with already existing RelDeps
1053 hashtbl = sat_calloc(hashmask + 1, sizeof(Id));
1054 for (i = 1; i < pool->nrels; i++)
1056 h = relhash(ran[i].name, ran[i].evr, ran[i].flags) & hashmask;
1057 hh = HASHCHAIN_START;
1059 h = HASHCHAIN_NEXT(h, hh, hashmask);
1064 * read RelDeps from repo
1067 for (i = 0; i < numrel; i++)
1069 name = read_id(&data, i + numid); /* read (repo relative) Ids */
1070 evr = read_id(&data, i + numid);
1071 flags = read_u8(&data);
1072 name = idmap[name]; /* map to (pool relative) Ids */
1074 h = relhash(name, evr, flags) & hashmask;
1075 hh = HASHCHAIN_START;
1079 if (id == ID_NULL) /* end of hash chain */
1081 if (ran[id].name == name && ran[id].evr == evr && ran[id].flags == flags)
1083 h = HASHCHAIN_NEXT(h, hh, hashmask);
1085 if (id == ID_NULL) /* new RelDep */
1089 ran[id].name = name;
1091 ran[id].flags = flags;
1093 idmap[i + numid] = MAKERELDEP(id); /* fill Id map */
1096 pool_shrink_rels(pool); /* vacuum */
1100 /******* Part 3: Dirs ***********************************************/
1103 data.dirpool.dirs = sat_malloc2(numdir, sizeof(Id));
1104 data.dirpool.ndirs = numdir;
1105 data.dirpool.dirs[0] = 0; /* dir 0: virtual root */
1106 data.dirpool.dirs[1] = 1; /* dir 1: / */
1107 for (i = 2; i < numdir; i++)
1109 id = read_id(&data, i + numid);
1111 data.dirpool.dirs[i] = -(id - numid);
1113 data.dirpool.dirs[i] = idmap[id];
1115 data.dirpool.dirs[i] = id;
1119 /******* Part 4: Keys ***********************************************/
1121 keys = sat_calloc(numkeys, sizeof(*keys));
1122 /* keys start at 1 */
1123 for (i = 1; i < numkeys; i++)
1125 id = read_id(&data, numid);
1129 id = str2id(pool, stringpool_id2str(spool, id), 1);
1130 type = read_id(&data, numid);
1134 type = str2id(pool, stringpool_id2str(spool, type), 1);
1135 if (type < REPOKEY_TYPE_VOID || type > REPOKEY_TYPE_SHA256)
1137 pool_debug(pool, SAT_ERROR, "unsupported data type '%s'\n", id2str(pool, type));
1138 data.error = SOLV_ERROR_UNSUPPORTED;
1139 type = REPOKEY_TYPE_VOID;
1142 keys[i].type = type;
1143 keys[i].size = read_id(&data, keys[i].type == REPOKEY_TYPE_CONSTANTID ? numid + numrel : 0);
1144 keys[i].storage = read_id(&data, 0);
1145 if (id >= SOLVABLE_NAME && id <= RPM_RPMDBID)
1146 keys[i].storage = KEY_STORAGE_SOLVABLE;
1147 else if (keys[i].storage == KEY_STORAGE_SOLVABLE)
1148 keys[i].storage = KEY_STORAGE_INCORE;
1149 if (keys[i].type == REPOKEY_TYPE_CONSTANTID)
1152 keys[i].size = idmap[keys[i].size];
1154 keys[i].size = str2id(pool, stringpool_id2str(spool, keys[i].size), 1);
1157 fprintf(stderr, "key %d %s %s %d %d\n", i, id2str(pool,id), id2str(pool, keys[i].type),
1158 keys[i].size, keys[i].storage);
1162 have_xdata = parent ? 1 : 0;
1163 for (i = 1; i < numkeys; i++)
1164 if (keys[i].storage == KEY_STORAGE_INCORE || keys[i].storage == KEY_STORAGE_VERTICAL_OFFSET)
1168 data.nkeys = numkeys;
1170 /******* Part 5: Schemata ********************************************/
1172 id = read_id(&data, 0);
1173 schemadata = sat_calloc(id + 1, sizeof(Id));
1174 schemadatap = schemadata + 1;
1175 schemadataend = schemadatap + id;
1176 schemata = sat_calloc(numschemata, sizeof(Id));
1177 for (i = 1; i < numschemata; i++)
1179 schemata[i] = schemadatap - schemadata;
1180 schemadatap = read_idarray(&data, numid, 0, schemadatap, schemadataend);
1182 Id *sp = schemadata + schemata[i];
1183 fprintf (stderr, "schema %d:", i);
1185 fprintf (stderr, " %d", *sp);
1186 fprintf (stderr, "\n");
1189 data.schemata = schemata;
1190 data.nschemata = numschemata;
1191 data.schemadata = schemadata;
1192 data.schemadatalen = schemadataend - data.schemadata;
1195 /******* Part 6: Info ***********************************************/
1196 oldnrepodata = repo->nrepodata;
1199 id = read_id(&data, 0);
1200 id = read_id(&data, 0);
1202 for (i = 0; i < numinfo; i++)
1204 /* for now we're just interested in data that starts with
1205 * the repodata_external id
1208 id = read_id(&data, numschemata);
1209 keyp = schemadata + schemata[id];
1211 if (keys[key].name == REPODATA_EXTERNAL && keys[key].type == REPOKEY_TYPE_VOID)
1213 /* external data for some ids */
1214 parse_external_repodata(&data, keyp, keys, idmap, numid, numrel);
1216 else if (keys[key].name == REPODATA_INFO)
1218 parse_info_repodata(&data, keyp, keys, idmap, numid, numrel);
1222 skip_schema(&data, keyp, keys, numid, numrel);
1227 /******* Part 7: item data *******************************************/
1229 /* calculate idarray size */
1231 for (i = 1; i < numkeys; i++)
1234 if ((keys[i].type == REPOKEY_TYPE_IDARRAY || keys[i].type == REPOKEY_TYPE_REL_IDARRAY)
1235 && id >= INTERESTED_START && id <= INTERESTED_END)
1236 size_idarray += keys[i].size;
1239 if (numsolv || numextra)
1241 maxsize = read_id(&data, 0);
1242 allsize = read_id(&data, 0);
1243 if (maxsize > allsize)
1245 pool_debug(pool, SAT_ERROR, "maxsize %d is greater then allsize %d\n", maxsize, allsize);
1246 data.error = SOLV_ERROR_CORRUPT;
1250 maxsize = allsize = 0;
1252 /* allocate needed space in repo */
1253 /* we add maxsize because it is an upper limit for all idarrays */
1254 repo_reserve_ids(repo, 0, size_idarray + maxsize + 1);
1255 idarraydatap = repo->idarraydata + repo->idarraysize;
1256 repo->idarraysize += size_idarray;
1257 idarraydataend = idarraydatap + size_idarray;
1260 /* read solvables */
1264 s = pool_id2solvable(pool, parent->start);
1266 s = pool_id2solvable(pool, repo_add_solvable_block(repo, numsolv));
1267 /* store start and end of our id block */
1268 data.start = s - pool->solvables;
1269 data.end = data.start + numsolv;
1270 /* In case we have info blocks, make them refer to our part of the
1272 for (i = oldnrepodata; i < repo->nrepodata; i++)
1274 repo->repodata[i].start = data.start;
1275 repo->repodata[i].end = data.end;
1283 data.extrastart = repo->nextra;
1284 repodata_extend_extra(&data, numextra);
1285 repo->nextra += numextra;
1286 for (i = oldnrepodata; i < repo->nrepodata; i++)
1288 repo->repodata[i].extrastart = data.extrastart;
1289 repo->repodata[i].nextra = data.nextra;
1295 /* reserve one byte so that all offsets are not zero */
1296 incore_add_id(&data, 0);
1297 repodata_extend_block(&data, data.start, numsolv);
1301 buf = sat_calloc(maxsize + 4, 1);
1303 for (i = 0; i < numsolv + numextra; i++, s++)
1312 pool_debug(mypool, SAT_ERROR, "buffer overrun\n");
1313 data.error = SOLV_ERROR_EOF;
1317 memmove(buf, dp, left);
1321 if (l && fread(buf + left, l, 1, data.fp) != 1)
1323 pool_debug(mypool, SAT_ERROR, "unexpected EOF\n");
1324 data.error = SOLV_ERROR_EOF;
1331 dp = data_read_id_max(dp, &id, 0, numschemata, &data.error);
1335 data.incoreoffset[i] = data.incoredatalen;
1337 data.extraoffset[i - numsolv] = data.incoredatalen;
1338 incore_add_id(&data, id);
1344 fprintf(stderr, "solv %d: schema %d\n", i, id);
1346 fprintf(stderr, "extra %d: schema %d\n", i - numsolv, id);
1348 keyp = schemadata + schemata[id];
1349 while ((key = *keyp++) != 0)
1354 id = keys[key].name;
1357 fprintf(stderr, "solv %d name %d type %d class %d\n", i, id, keys[key].type, keys[key].storage);
1359 fprintf(stderr, "extra %d name %d type %d class %d\n", i - numsolv, id, keys[key].type, keys[key].storage);
1361 if (keys[key].storage == KEY_STORAGE_VERTICAL_OFFSET)
1363 /* copy offset/length into incore */
1365 dp = data_skip(dp, REPOKEY_TYPE_ID);
1366 dp = data_skip(dp, REPOKEY_TYPE_ID);
1367 incore_add_blob(&data, dps, dp - dps);
1370 switch (keys[key].type)
1372 case REPOKEY_TYPE_ID:
1373 dp = data_read_id_max(dp, &did, idmap, numid + numrel, &data.error);
1374 if (id == SOLVABLE_NAME)
1376 else if (id == SOLVABLE_ARCH)
1378 else if (id == SOLVABLE_EVR)
1380 else if (id == SOLVABLE_VENDOR)
1382 else if (keys[key].storage == KEY_STORAGE_INCORE)
1383 incore_add_id(&data, did);
1385 POOL_DEBUG(SAT_DEBUG_STATS, "%s -> %s\n", id2str(pool, id), id2str(pool, did));
1388 case REPOKEY_TYPE_U32:
1389 dp = data_read_u32(dp, &h);
1391 POOL_DEBUG(SAT_DEBUG_STATS, "%s -> %u\n", id2str(pool, id), h);
1393 if (id == RPM_RPMDBID)
1396 repo->rpmdbid = sat_calloc(numsolv, sizeof(Id));
1397 repo->rpmdbid[i] = h;
1399 else if (keys[key].storage == KEY_STORAGE_INCORE)
1400 incore_add_u32(&data, h);
1402 case REPOKEY_TYPE_IDARRAY:
1403 case REPOKEY_TYPE_REL_IDARRAY:
1404 if (id < INTERESTED_START || id > INTERESTED_END)
1407 dp = data_skip(dp, REPOKEY_TYPE_IDARRAY);
1408 if (keys[key].storage != KEY_STORAGE_INCORE)
1411 incore_map_idarray(&data, dps, idmap, numid);
1413 incore_add_blob(&data, dps, dp - dps);
1416 ido = idarraydatap - repo->idarraydata;
1417 if (keys[key].type == REPOKEY_TYPE_IDARRAY)
1418 dp = data_read_idarray(dp, &idarraydatap, idmap, numid + numrel, &data.error);
1419 else if (id == SOLVABLE_REQUIRES)
1420 dp = data_read_rel_idarray(dp, &idarraydatap, idmap, numid + numrel, &data.error, SOLVABLE_PREREQMARKER);
1421 else if (id == SOLVABLE_PROVIDES)
1422 dp = data_read_rel_idarray(dp, &idarraydatap, idmap, numid + numrel, &data.error, SOLVABLE_FILEMARKER);
1424 dp = data_read_rel_idarray(dp, &idarraydatap, idmap, numid + numrel, &data.error, 0);
1425 if (idarraydatap > idarraydataend)
1427 pool_debug(pool, SAT_ERROR, "idarray overflow\n");
1428 data.error = SOLV_ERROR_OVERFLOW;
1431 if (id == SOLVABLE_PROVIDES)
1433 else if (id == SOLVABLE_OBSOLETES)
1435 else if (id == SOLVABLE_CONFLICTS)
1437 else if (id == SOLVABLE_REQUIRES)
1439 else if (id == SOLVABLE_RECOMMENDS)
1441 else if (id == SOLVABLE_SUPPLEMENTS)
1442 s->supplements = ido;
1443 else if (id == SOLVABLE_SUGGESTS)
1445 else if (id == SOLVABLE_ENHANCES)
1447 else if (id == SOLVABLE_FRESHENS)
1450 POOL_DEBUG(SAT_DEBUG_STATS, "%s ->\n", id2str(pool, id));
1451 for (; repo->idarraydata[ido]; ido++)
1452 POOL_DEBUG(SAT_DEBUG_STATS," %s\n", dep2str(pool, repo->idarraydata[ido]));
1457 dp = data_skip(dp, keys[key].type);
1458 if (keys[key].storage == KEY_STORAGE_INCORE)
1459 incore_add_blob(&data, dps, dp - dps);
1465 /* should shrink idarraydata again */
1472 pool_debug(mypool, SAT_ERROR, "buffer overrun\n");
1473 data.error = SOLV_ERROR_EOF;
1480 /* free solvables */
1481 repo_free_solvable_block(repo, data.start, data.end - data.start, 1);
1483 repo->idarraysize -= size_idarray;
1484 /* free incore data */
1485 data.incoredata = sat_free(data.incoredata);
1486 data.incoredatalen = data.incoredatafree = 0;
1489 if (data.incoredatafree)
1491 /* shrink excess size */
1492 data.incoredata = sat_realloc(data.incoredata, data.incoredatalen);
1493 data.incoredatafree = 0;
1496 for (i = 1; i < numkeys; i++)
1497 if (keys[i].storage == KEY_STORAGE_VERTICAL_OFFSET)
1499 if (i < numkeys && !data.error)
1502 unsigned int pagesize;
1504 /* we have vertical data, make it available */
1505 data.verticaloffset = sat_calloc(numkeys, sizeof(Id));
1506 for (i = 1; i < numkeys; i++)
1507 if (keys[i].storage == KEY_STORAGE_VERTICAL_OFFSET)
1509 data.verticaloffset[i] = fileoffset;
1510 fileoffset += keys[i].size;
1512 data.lastverticaloffset = fileoffset;
1513 pagesize = read_u32(&data);
1514 repodata_read_or_setup_pages(&data, pagesize, fileoffset);
1518 /* no longer needed */
1522 if (parent && !data.error)
1525 sat_free(parent->schemata);
1526 sat_free(parent->schemadata);
1527 sat_free(parent->keys);
1528 sat_free(parent->location);
1531 else if ((data.incoredatalen || data.fp) && !data.error)
1533 /* we got some data, make it available */
1534 repo->repodata = sat_realloc2(repo->repodata, repo->nrepodata + 1, sizeof(data));
1535 repo->repodata[repo->nrepodata++] = data;
1540 sat_free(data.dirpool.dirs);
1541 sat_free(data.incoreoffset);
1543 sat_free(schemadata);
1553 repo_add_solv(Repo *repo, FILE *fp)
1555 return repo_add_solv_parent(repo, fp, 0);
1559 repodata_load_solv(Repodata *data)
1562 Pool *pool = data->repo->pool;
1563 if (!pool->loadcallback)
1565 data->state = REPODATA_ERROR;
1568 fp = pool->loadcallback(pool, data, pool->loadcallbackdata);
1571 data->state = REPODATA_ERROR;
1574 if (repo_add_solv_parent(data->repo, fp, data))
1575 data->state = REPODATA_ERROR;
1577 data->state = REPODATA_AVAILABLE;