2 * Copyright (c) 2007, Novell Inc.
4 * This program is licensed under the BSD license, read LICENSE.BSD
5 * for further information
11 * Add a repo in solv format
22 #include "repo_solv.h"
28 #include "poolid_private.h" /* WHATPROVIDES_BLOCK */
30 #define INTERESTED_START SOLVABLE_NAME
31 #define INTERESTED_END SOLVABLE_ENHANCES
33 #define SOLV_ERROR_NOT_SOLV 1
34 #define SOLV_ERROR_UNSUPPORTED 2
35 #define SOLV_ERROR_EOF 3
36 #define SOLV_ERROR_ID_RANGE 4
37 #define SOLV_ERROR_OVERFLOW 5
38 #define SOLV_ERROR_CORRUPT 6
42 /*******************************************************************************
43 * functions to extract data from a file handle
51 read_u32(Repodata *data)
58 for (i = 0; i < 4; i++)
63 data->error = pool_error(data->repo->pool, SOLV_ERROR_EOF, "unexpected EOF");
77 read_u8(Repodata *data)
86 data->error = pool_error(data->repo->pool, SOLV_ERROR_EOF, "unexpected EOF");
98 read_id(Repodata *data, Id max)
105 for (i = 0; i < 5; i++)
110 data->error = pool_error(data->repo->pool, SOLV_ERROR_EOF, "unexpected EOF");
118 data->error = pool_error(data->repo->pool, SOLV_ERROR_ID_RANGE, "read_id: id too large (%u/%u)", x, max);
123 x = (x << 7) ^ c ^ 128;
125 data->error = pool_error(data->repo->pool, SOLV_ERROR_CORRUPT, "read_id: id too long");
131 read_idarray(Repodata *data, Id max, Id *map, Id *store, Id *end)
143 data->error = pool_error(data->repo->pool, SOLV_ERROR_EOF, "unexpected EOF");
148 x = (x << 7) ^ c ^ 128;
151 x = (x << 6) | (c & 63);
154 data->error = pool_error(data->repo->pool, SOLV_ERROR_ID_RANGE, "read_idarray: id too large (%u/%u)", x, max);
161 data->error = pool_error(data->repo->pool, SOLV_ERROR_OVERFLOW, "read_idarray: array overflow");
167 if (x == 0) /* already have trailing zero? */
171 data->error = pool_error(data->repo->pool, SOLV_ERROR_OVERFLOW, "read_idarray: array overflow");
182 /*******************************************************************************
183 * functions to extract data from memory
190 static inline unsigned char *
191 data_read_id_max(unsigned char *dp, Id *ret, Id *map, int max, Repodata *data)
194 dp = data_read_id(dp, &x);
195 if (x < 0 || (max && x >= max))
197 data->error = pool_error(data->repo->pool, SOLV_ERROR_ID_RANGE, "data_read_id_max: id too large (%u/%u)", x, max);
200 *ret = map ? map[x] : x;
204 static unsigned char *
205 data_read_idarray(unsigned char *dp, Id **storep, Id *map, int max, Repodata *data)
216 x = (x << 7) ^ c ^ 128;
219 x = (x << 6) | (c & 63);
222 data->error = pool_error(data->repo->pool, SOLV_ERROR_ID_RANGE, "data_read_idarray: id too large (%u/%u)", x, max);
223 data->error = SOLV_ERROR_ID_RANGE;
236 static unsigned char *
237 data_read_rel_idarray(unsigned char *dp, Id **storep, Id *map, int max, Repodata *data, Id marker)
249 x = (x << 7) ^ c ^ 128;
252 x = (x << 6) | (c & 63);
266 data->error = pool_error(data->repo->pool, SOLV_ERROR_ID_RANGE, "data_read_rel_idarray: id too large (%u/%u)", x, max);
269 *store++ = map ? map[x] : x;
282 /*******************************************************************************
283 * functions to add data to our incore memory space
286 #define INCORE_ADD_CHUNK 8192
287 #define DATA_READ_CHUNK 8192
290 incore_add_id(Repodata *data, Id sx)
292 unsigned int x = (unsigned int)sx;
294 /* make sure we have at least 5 bytes free */
295 if (data->incoredatafree < 5)
297 data->incoredata = solv_realloc(data->incoredata, data->incoredatalen + INCORE_ADD_CHUNK);
298 data->incoredatafree = INCORE_ADD_CHUNK;
300 dp = data->incoredata + data->incoredatalen;
304 *dp++ = (x >> 28) | 128;
306 *dp++ = (x >> 21) | 128;
307 *dp++ = (x >> 14) | 128;
310 *dp++ = (x >> 7) | 128;
312 data->incoredatafree -= dp - (data->incoredata + data->incoredatalen);
313 data->incoredatalen = dp - data->incoredata;
317 incore_add_sizek(Repodata *data, unsigned int sx)
320 incore_add_id(data, (Id)(sx << 10));
325 incore_add_id(data, (Id)(sx >> 25));
326 data->incoredata[data->incoredatalen - 1] |= 128;
328 incore_add_id(data, (Id)((sx << 10) | 0x80000000));
329 data->incoredata[data->incoredatalen - 5] = (sx >> 18) | 128;
334 incore_add_ideof(Repodata *data, Id sx, int eof)
336 unsigned int x = (unsigned int)sx;
338 /* make sure we have at least 5 bytes free */
339 if (data->incoredatafree < 5)
341 data->incoredata = solv_realloc(data->incoredata, data->incoredatalen + INCORE_ADD_CHUNK);
342 data->incoredatafree = INCORE_ADD_CHUNK;
344 dp = data->incoredata + data->incoredatalen;
348 *dp++ = (x >> 27) | 128;
350 *dp++ = (x >> 20) | 128;
351 *dp++ = (x >> 13) | 128;
354 *dp++ = (x >> 6) | 128;
355 *dp++ = eof ? (x & 63) : (x & 63) | 64;
356 data->incoredatafree -= dp - (data->incoredata + data->incoredatalen);
357 data->incoredatalen = dp - data->incoredata;
361 incore_add_blob(Repodata *data, unsigned char *buf, int len)
363 if (data->incoredatafree < len)
365 data->incoredata = solv_realloc(data->incoredata, data->incoredatalen + INCORE_ADD_CHUNK + len);
366 data->incoredatafree = INCORE_ADD_CHUNK + len;
368 memcpy(data->incoredata + data->incoredatalen, buf, len);
369 data->incoredatafree -= len;
370 data->incoredatalen += len;
374 incore_map_idarray(Repodata *data, unsigned char *dp, Id *map, Id max)
376 /* We have to map the IDs, which might also change
377 the necessary number of bytes, so we can't just copy
378 over the blob and adjust it. */
383 dp = data_read_ideof(dp, &id, &eof);
384 if (id < 0 || (max && id >= max))
386 data->error = pool_error(data->repo->pool, SOLV_ERROR_ID_RANGE, "incore_map_idarray: id too large (%u/%u)", id, max);
390 incore_add_ideof(data, id, eof);
398 incore_add_u32(Repodata *data, unsigned int x)
401 /* make sure we have at least 4 bytes free */
402 if (data->incoredatafree < 4)
404 data->incoredata = solv_realloc(data->incoredata, data->incoredatalen + INCORE_ADD_CHUNK);
405 data->incoredatafree = INCORE_ADD_CHUNK;
407 dp = data->incoredata + data->incoredatalen;
412 data->incoredatafree -= 4;
413 data->incoredatalen += 4;
417 incore_add_u8(Repodata *data, unsigned int x)
420 /* make sure we have at least 1 byte free */
421 if (data->incoredatafree < 1)
423 data->incoredata = solv_realloc(data->incoredata, data->incoredatalen + 1024);
424 data->incoredatafree = 1024;
426 dp = data->incoredata + data->incoredatalen;
428 data->incoredatafree--;
429 data->incoredatalen++;
434 /*******************************************************************************
439 * read repo from .solv file and add it to pool
443 repo_add_solv(Repo *repo, FILE *fp, int flags)
445 Pool *pool = repo->pool;
447 unsigned int numid, numrel, numdir, numsolv;
448 unsigned int numkeys, numschemata;
451 Offset *str; /* map Id -> Offset into string space */
452 char *strsp; /* repo string space */
453 char *sp; /* pointer into string space */
454 Id *idmap; /* map of repo Ids to pool Ids */
456 unsigned int hashmask, h;
462 unsigned int size_idarray;
463 Id *idarraydatap, *idarraydataend;
466 unsigned int solvflags;
467 unsigned int solvversion;
469 Id *schemadata, *schemadatap, *schemadataend;
470 Id *schemata, key, *keyp;
473 int maxsize, allsize;
474 unsigned char *buf, *bufend, *dp, *dps;
477 int needchunk; /* need a new chunk of data */
479 int oldnstrings = pool->ss.nstrings;
480 int oldnrels = pool->nrels;
482 struct _Stringpool *spool;
484 Repodata *parent = 0;
487 int extendstart = 0, extendend = 0; /* set in case we're extending */
489 now = solv_timems(0);
491 if ((flags & REPO_USE_LOADING) != 0)
493 /* this is a stub replace operation */
494 flags |= REPO_EXTEND_SOLVABLES;
495 /* use REPO_REUSE_REPODATA hack so that the old repodata is kept */
496 parent = repo_add_repodata(repo, flags | REPO_REUSE_REPODATA);
497 extendstart = parent->start;
498 extendend = parent->end;
500 else if (flags & REPO_EXTEND_SOLVABLES)
502 /* extend all solvables of this repo */
503 extendstart = repo->start;
504 extendend = repo->end;
507 memset(&data, 0, sizeof(data));
510 repopagestore_init(&data.store);
512 if (read_u32(&data) != ('S' << 24 | 'O' << 16 | 'L' << 8 | 'V'))
513 return pool_error(pool, SOLV_ERROR_NOT_SOLV, "not a SOLV file");
514 solvversion = read_u32(&data);
520 return pool_error(pool, SOLV_ERROR_UNSUPPORTED, "unsupported SOLV version");
523 numid = read_u32(&data);
524 numrel = read_u32(&data);
525 numdir = read_u32(&data);
526 numsolv = read_u32(&data);
527 numkeys = read_u32(&data);
528 numschemata = read_u32(&data);
529 solvflags = read_u32(&data);
531 if (numdir && numdir < 2)
532 return pool_error(pool, SOLV_ERROR_CORRUPT, "bad number of dirs");
534 if (numrel && (flags & REPO_LOCALPOOL) != 0)
535 return pool_error(pool, SOLV_ERROR_CORRUPT, "relations are forbidden in a local pool");
536 if ((flags & REPO_EXTEND_SOLVABLES) && numsolv)
538 /* make sure that we exactly replace the stub repodata */
539 if (extendend - extendstart != numsolv)
540 return pool_error(pool, SOLV_ERROR_CORRUPT, "sub-repository solvable number does not match main repository (%d - %d)", extendend - extendstart, numsolv);
541 for (i = 0; i < numsolv; i++)
542 if (pool->solvables[extendstart + i].repo != repo)
543 return pool_error(pool, SOLV_ERROR_CORRUPT, "main repository contains holes, cannot extend");
546 /******* Part 1: string IDs *****************************************/
548 sizeid = read_u32(&data); /* size of string+Id space */
551 * read strings and Ids
560 if (!(flags & REPO_LOCALPOOL))
566 spool->stringspace = solv_malloc(7);
567 strcpy(spool->stringspace, "<NULL>");
569 spool->nstrings = numid < 2 ? 2 - numid : 0; /* make sure we have at least id 0 and 1 */
572 /* alloc string buffer */
573 spool->stringspace = solv_realloc(spool->stringspace, spool->sstrings + sizeid + 1);
574 /* alloc string offsets (Id -> Offset into string space) */
575 spool->strings = solv_realloc2(spool->strings, spool->nstrings + numid, sizeof(Offset));
577 strsp = spool->stringspace;
578 str = spool->strings; /* array of offsets into strsp, indexed by Id */
580 /* point to _BEHIND_ already allocated string/Id space */
581 strsp += spool->sstrings;
585 * read new repo at end of pool
588 if ((solvflags & SOLV_FLAG_PREFIX_POOL) == 0)
590 if (sizeid && fread(strsp, sizeid, 1, fp) != 1)
591 return pool_error(pool, SOLV_ERROR_EOF, "read error while reading strings");
595 unsigned int pfsize = read_u32(&data);
596 char *prefix = solv_malloc(pfsize);
602 if (pfsize && fread(prefix, pfsize, 1, fp) != 1)
605 return pool_error(pool, SOLV_ERROR_EOF, "read error while reading strings");
607 for (i = 1; i < numid; i++)
609 int same = (unsigned char)*pp++;
610 size_t len = strlen(pp) + 1;
611 freesp -= same + len;
615 return pool_error(pool, SOLV_ERROR_OVERFLOW, "overflow while expanding strings");
618 memcpy(dest, old_str, same);
619 memcpy(dest + same, pp, len);
626 return pool_error(pool, SOLV_ERROR_CORRUPT, "expanding strings size mismatch");
628 strsp[sizeid] = 0; /* make string space \0 terminated */
631 if ((flags & REPO_LOCALPOOL) != 0)
633 /* no shared pool, thus no idmap and no unification */
635 spool->nstrings = numid >= 2 ? numid : 2; /* make sure we have at least id 0 and 1 */
636 str[0] = 0; /* <NULL> */
639 /* we need the '' for directories */
640 return pool_error(pool, SOLV_ERROR_CORRUPT, "store strings don't start with an empty string");
642 for (i = 1; i < spool->nstrings; i++)
644 if (sp >= strsp + sizeid && numid >= 2)
645 return pool_error(pool, SOLV_ERROR_OVERFLOW, "not enough strings");
646 str[i] = sp - spool->stringspace;
647 sp += strlen(sp) + 1;
649 spool->sstrings = sp - spool->stringspace;
653 /* alloc id map for name and rel Ids. this maps ids in the solv files
654 * to the ids in our pool */
655 idmap = solv_calloc(numid + numrel, sizeof(Id));
657 /* grow hash if needed, otherwise reuse */
658 hashmask = mkmask(spool->nstrings + numid);
660 POOL_DEBUG(SOLV_DEBUG_STATS, "read %d strings\n", numid);
661 POOL_DEBUG(SOLV_DEBUG_STATS, "string hash buckets: %d, old %d\n", hashmask + 1, spool->stringhashmask + 1);
663 if (hashmask > spool->stringhashmask)
665 spool->stringhashtbl = solv_free(spool->stringhashtbl);
666 spool->stringhashmask = hashmask;
667 spool->stringhashtbl = hashtbl = solv_calloc(hashmask + 1, sizeof(Id));
668 for (i = 1; i < spool->nstrings; i++)
670 h = strhash(spool->stringspace + spool->strings[i]) & hashmask;
671 hh = HASHCHAIN_START;
673 h = HASHCHAIN_NEXT(h, hh, hashmask);
679 hashtbl = spool->stringhashtbl;
680 hashmask = spool->stringhashmask;
684 * run over strings and merge with pool.
685 * also populate id map (maps solv Id -> pool Id)
687 for (i = 1; i < numid; i++)
689 if (sp >= strsp + sizeid)
693 return pool_error(pool, SOLV_ERROR_OVERFLOW, "not enough strings %d %d", i, numid);
695 if (!*sp) /* empty string */
703 h = strhash(sp) & hashmask;
704 hh = HASHCHAIN_START;
710 if (!strcmp(spool->stringspace + spool->strings[id], sp))
711 break; /* already in pool */
712 h = HASHCHAIN_NEXT(h, hh, hashmask);
715 /* length == offset to next string */
717 if (!id) /* end of hash chain -> new string */
719 id = spool->nstrings++;
721 str[id] = spool->sstrings; /* save offset */
722 if (sp != spool->stringspace + spool->sstrings)
723 memmove(spool->stringspace + spool->sstrings, sp, l);
724 spool->sstrings += l;
726 idmap[i] = id; /* repo relative -> pool relative */
727 sp += l; /* next string */
729 if (hashmask > mkmask(spool->nstrings + 8192))
731 spool->stringhashtbl = solv_free(spool->stringhashtbl);
732 spool->stringhashmask = 0;
735 stringpool_shrink(spool); /* vacuum */
738 /******* Part 2: Relation IDs ***************************************/
748 pool->rels = solv_realloc2(pool->rels, pool->nrels + numrel, sizeof(Reldep));
751 /* grow hash if needed, otherwise reuse */
752 hashmask = mkmask(pool->nrels + numrel);
754 POOL_DEBUG(SOLV_DEBUG_STATS, "read %d rels\n", numrel);
755 POOL_DEBUG(SOLV_DEBUG_STATS, "rel hash buckets: %d, old %d\n", hashmask + 1, pool->relhashmask + 1);
757 if (hashmask > pool->relhashmask)
759 pool->relhashtbl = solv_free(pool->relhashtbl);
760 pool->relhashmask = hashmask;
761 pool->relhashtbl = hashtbl = solv_calloc(hashmask + 1, sizeof(Id));
762 for (i = 1; i < pool->nrels; i++)
764 h = relhash(ran[i].name, ran[i].evr, ran[i].flags) & hashmask;
765 hh = HASHCHAIN_START;
767 h = HASHCHAIN_NEXT(h, hh, hashmask);
773 hashtbl = pool->relhashtbl;
774 hashmask = pool->relhashmask;
778 * read RelDeps from repo
780 for (i = 0; i < numrel; i++)
782 name = read_id(&data, i + numid); /* read (repo relative) Ids */
783 evr = read_id(&data, i + numid);
784 relflags = read_u8(&data);
785 name = idmap[name]; /* map to (pool relative) Ids */
787 h = relhash(name, evr, relflags) & hashmask;
788 hh = HASHCHAIN_START;
792 if (!id) /* end of hash chain reached */
794 if (ran[id].name == name && ran[id].evr == evr && ran[id].flags == relflags)
796 h = HASHCHAIN_NEXT(h, hh, hashmask);
798 if (!id) /* new RelDep */
804 ran[id].flags = relflags;
806 idmap[i + numid] = MAKERELDEP(id); /* fill Id map */
808 if (hashmask > mkmask(pool->nrels + 4096))
810 pool->relhashtbl = solv_free(pool->relhashtbl);
811 pool->relhashmask = 0;
813 pool_shrink_rels(pool); /* vacuum */
816 /* if we added ids/rels, make room in our whatprovide arrays */
817 if (!(flags & REPO_LOCALPOOL))
819 if (pool->whatprovides && oldnstrings != pool->ss.nstrings)
821 int newlen = (pool->ss.nstrings + WHATPROVIDES_BLOCK) & ~WHATPROVIDES_BLOCK;
822 pool->whatprovides = solv_realloc2(pool->whatprovides, newlen, sizeof(Offset));
823 memset(pool->whatprovides + oldnstrings, 0, (newlen - oldnstrings) * sizeof(Offset));
825 if (pool->whatprovides_rel && oldnrels != pool->nrels)
827 int newlen = (pool->nrels + WHATPROVIDES_BLOCK) & ~WHATPROVIDES_BLOCK;
828 pool->whatprovides_rel = solv_realloc2(pool->whatprovides_rel, newlen, sizeof(Offset));
829 memset(pool->whatprovides_rel + oldnrels, 0, (newlen - oldnrels) * sizeof(Offset));
833 /******* Part 3: Dirs ***********************************************/
836 data.dirpool.dirs = solv_malloc2(numdir, sizeof(Id));
837 data.dirpool.ndirs = numdir;
838 data.dirpool.dirs[0] = 0; /* dir 0: virtual root */
839 data.dirpool.dirs[1] = 1; /* dir 1: / */
840 for (i = 2; i < numdir; i++)
842 id = read_id(&data, i + numid);
844 data.dirpool.dirs[i] = -(id - numid);
846 data.dirpool.dirs[i] = idmap[id];
848 data.dirpool.dirs[i] = id;
852 /******* Part 4: Keys ***********************************************/
854 keys = solv_calloc(numkeys, sizeof(*keys));
855 /* keys start at 1 */
856 for (i = 1; i < numkeys; i++)
858 id = read_id(&data, numid);
861 else if ((flags & REPO_LOCALPOOL) != 0)
862 id = pool_str2id(pool, stringpool_id2str(spool, id), 1);
863 type = read_id(&data, numid);
866 else if ((flags & REPO_LOCALPOOL) != 0)
867 type = pool_str2id(pool, stringpool_id2str(spool, type), 1);
868 if (type < REPOKEY_TYPE_VOID || type > REPOKEY_TYPE_FLEXARRAY)
870 data.error = pool_error(pool, SOLV_ERROR_UNSUPPORTED, "unsupported data type '%s'", pool_id2str(pool, type));
871 type = REPOKEY_TYPE_VOID;
875 keys[i].size = read_id(&data, keys[i].type == REPOKEY_TYPE_CONSTANTID ? numid + numrel : 0);
876 keys[i].storage = read_id(&data, 0);
877 /* old versions used SOLVABLE for main solvable data */
878 if (keys[i].storage == KEY_STORAGE_SOLVABLE)
879 keys[i].storage = KEY_STORAGE_INCORE;
880 if (keys[i].storage != KEY_STORAGE_INCORE && keys[i].storage != KEY_STORAGE_VERTICAL_OFFSET)
881 data.error = pool_error(pool, SOLV_ERROR_UNSUPPORTED, "unsupported storage type %d", keys[i].storage);
882 if (id >= SOLVABLE_NAME && id <= RPM_RPMDBID)
884 if (keys[i].storage != KEY_STORAGE_INCORE)
885 data.error = pool_error(pool, SOLV_ERROR_UNSUPPORTED, "main solvable data must use incore storage %d", keys[i].storage);
886 keys[i].storage = KEY_STORAGE_SOLVABLE;
888 /* cannot handle rel idarrays in incore/vertical */
889 if (type == REPOKEY_TYPE_REL_IDARRAY && keys[i].storage != KEY_STORAGE_SOLVABLE)
890 data.error = pool_error(pool, SOLV_ERROR_UNSUPPORTED, "type REL_IDARRAY is only supported for STORAGE_SOLVABLE");
891 /* cannot handle mapped ids in vertical */
892 if (!(flags & REPO_LOCALPOOL) && keys[i].storage == KEY_STORAGE_VERTICAL_OFFSET && (type == REPOKEY_TYPE_ID || type == REPOKEY_TYPE_IDARRAY))
893 data.error = pool_error(pool, SOLV_ERROR_UNSUPPORTED, "mapped ids are not supported for STORAGE_VERTICAL_OFFSET");
895 if (keys[i].type == REPOKEY_TYPE_CONSTANTID && idmap)
896 keys[i].size = idmap[keys[i].size];
898 fprintf(stderr, "key %d %s %s %d %d\n", i, pool_id2str(pool,id), pool_id2str(pool, keys[i].type),
899 keys[i].size, keys[i].storage);
904 for (i = 1; i < numkeys; i++)
905 if (keys[i].storage == KEY_STORAGE_INCORE || keys[i].storage == KEY_STORAGE_VERTICAL_OFFSET)
909 data.nkeys = numkeys;
910 for (i = 1; i < numkeys; i++)
913 data.keybits[(id >> 3) & (sizeof(data.keybits) - 1)] |= 1 << (id & 7);
916 /******* Part 5: Schemata ********************************************/
918 id = read_id(&data, 0);
919 schemadata = solv_calloc(id + 1, sizeof(Id));
920 schemadatap = schemadata + 1;
921 schemadataend = schemadatap + id;
922 schemata = solv_calloc(numschemata, sizeof(Id));
923 for (i = 1; i < numschemata; i++)
925 schemata[i] = schemadatap - schemadata;
926 schemadatap = read_idarray(&data, numid, 0, schemadatap, schemadataend);
928 Id *sp = schemadata + schemata[i];
929 fprintf(stderr, "schema %d:", i);
931 fprintf(stderr, " %d", *sp);
932 fprintf(stderr, "\n");
935 data.schemata = schemata;
936 data.nschemata = numschemata;
937 data.schemadata = schemadata;
938 data.schemadatalen = schemadataend - data.schemadata;
940 /******* Part 6: Data ********************************************/
942 idarraydatap = idarraydataend = 0;
945 maxsize = read_id(&data, 0);
946 allsize = read_id(&data, 0);
947 maxsize += 5; /* so we can read the next schema of an array */
948 if (maxsize > allsize)
951 buf = solv_calloc(maxsize + DATA_READ_CHUNK + 4, 1); /* 4 extra bytes to detect overflows */
956 if (l < DATA_READ_CHUNK)
960 if (!l || fread(buf, l, 1, data.fp) != 1)
962 data.error = pool_error(pool, SOLV_ERROR_EOF, "unexpected EOF");
969 dp = data_read_id_max(dp, &id, 0, numschemata, &data);
972 incore_add_id(&data, 0); /* so that incoreoffset 0 means schema 0 */
973 incore_add_id(&data, id); /* main schema id */
974 keyp = schemadata + schemata[id];
975 data.mainschema = id;
976 for (i = 0; keyp[i]; i++)
979 data.mainschemaoffsets = solv_calloc(i, sizeof(Id));
987 /* make sure we have enough room */
988 if (keydepth == 0 || needchunk)
990 int left = bufend - dp;
991 /* read data chunk to dp */
996 data.error = pool_error(pool, SOLV_ERROR_EOF, "buffer overrun");
1002 memmove(buf, dp, left);
1004 if (l < DATA_READ_CHUNK)
1005 l = DATA_READ_CHUNK;
1008 if (l && fread(buf + left, l, 1, data.fp) != 1)
1010 data.error = pool_error(pool, SOLV_ERROR_EOF, "unexpected EOF");
1015 bufend = buf + left;
1016 if (allsize + left < maxsize)
1017 maxsize = allsize + left;
1025 printf("key %d at %d\n", key, (int)(keyp - 1 - schemadata));
1033 if (s && keydepth == 3)
1035 s++; /* next solvable */
1036 if (have_incoredata)
1037 data.incoreoffset[(s - pool->solvables) - data.start] = data.incoredatalen;
1039 id = stack[keydepth - 1];
1042 dp = data_read_id_max(dp, &id, 0, numschemata, &data);
1043 incore_add_id(&data, id);
1045 keyp = schemadata + schemata[id];
1052 keyp = schemadata + stack[--keydepth];
1053 nentries = stack[--keydepth];
1055 printf("pop flexarray %d %d\n", keydepth, nentries);
1058 s = 0; /* back from solvables */
1063 data.mainschemaoffsets[keyp - 1 - (schemadata + schemata[data.mainschema])] = data.incoredatalen;
1066 printf("=> %s %s %p\n", pool_id2str(pool, keys[key].name), pool_id2str(pool, keys[key].type), s);
1068 id = keys[key].name;
1069 if (keys[key].storage == KEY_STORAGE_VERTICAL_OFFSET)
1072 dp = data_skip(dp, REPOKEY_TYPE_ID);
1073 dp = data_skip(dp, REPOKEY_TYPE_ID);
1074 incore_add_blob(&data, dps, dp - dps); /* just record offset/size */
1077 switch (keys[key].type)
1079 case REPOKEY_TYPE_ID:
1080 dp = data_read_id_max(dp, &did, idmap, numid + numrel, &data);
1081 if (s && id == SOLVABLE_NAME)
1083 else if (s && id == SOLVABLE_ARCH)
1085 else if (s && id == SOLVABLE_EVR)
1087 else if (s && id == SOLVABLE_VENDOR)
1089 else if (keys[key].storage == KEY_STORAGE_INCORE)
1090 incore_add_id(&data, did);
1092 POOL_DEBUG(SOLV_DEBUG_STATS, "%s -> %s\n", pool_id2str(pool, id), pool_id2str(pool, did));
1095 case REPOKEY_TYPE_IDARRAY:
1096 case REPOKEY_TYPE_REL_IDARRAY:
1097 if (!s || id < INTERESTED_START || id > INTERESTED_END)
1100 dp = data_skip(dp, REPOKEY_TYPE_IDARRAY);
1101 if (keys[key].storage != KEY_STORAGE_INCORE)
1104 incore_map_idarray(&data, dps, idmap, numid + numrel);
1106 incore_add_blob(&data, dps, dp - dps);
1109 ido = idarraydatap - repo->idarraydata;
1110 if (keys[key].type == REPOKEY_TYPE_IDARRAY)
1111 dp = data_read_idarray(dp, &idarraydatap, idmap, numid + numrel, &data);
1112 else if (id == SOLVABLE_REQUIRES)
1113 dp = data_read_rel_idarray(dp, &idarraydatap, idmap, numid + numrel, &data, SOLVABLE_PREREQMARKER);
1114 else if (id == SOLVABLE_PROVIDES)
1115 dp = data_read_rel_idarray(dp, &idarraydatap, idmap, numid + numrel, &data, SOLVABLE_FILEMARKER);
1117 dp = data_read_rel_idarray(dp, &idarraydatap, idmap, numid + numrel, &data, 0);
1118 if (idarraydatap > idarraydataend)
1120 data.error = pool_error(pool, SOLV_ERROR_OVERFLOW, "idarray overflow");
1123 if (id == SOLVABLE_PROVIDES)
1125 else if (id == SOLVABLE_OBSOLETES)
1127 else if (id == SOLVABLE_CONFLICTS)
1129 else if (id == SOLVABLE_REQUIRES)
1131 else if (id == SOLVABLE_RECOMMENDS)
1133 else if (id == SOLVABLE_SUPPLEMENTS)
1134 s->supplements = ido;
1135 else if (id == SOLVABLE_SUGGESTS)
1137 else if (id == SOLVABLE_ENHANCES)
1140 POOL_DEBUG(SOLV_DEBUG_STATS, "%s ->\n", pool_id2str(pool, id));
1141 for (; repo->idarraydata[ido]; ido++)
1142 POOL_DEBUG(SOLV_DEBUG_STATS," %s\n", pool_dep2str(pool, repo->idarraydata[ido]));
1145 case REPOKEY_TYPE_FIXARRAY:
1146 case REPOKEY_TYPE_FLEXARRAY:
1149 if (keydepth == sizeof(stack)/sizeof(*stack))
1151 data.error = pool_error(pool, SOLV_ERROR_OVERFLOW, "array stack overflow");
1154 stack[keydepth++] = nentries;
1155 stack[keydepth++] = keyp - schemadata;
1156 stack[keydepth++] = 0;
1157 dp = data_read_id_max(dp, &nentries, 0, 0, &data);
1158 incore_add_id(&data, nentries);
1161 /* zero size array? */
1163 nentries = stack[--keydepth];
1166 if (keydepth == 3 && id == REPOSITORY_SOLVABLES)
1168 /* horray! here come the solvables */
1169 if (nentries != numsolv)
1171 data.error = pool_error(pool, SOLV_ERROR_CORRUPT, "inconsistent number of solvables: %d %d", nentries, numsolv);
1176 data.error = pool_error(pool, SOLV_ERROR_CORRUPT, "more than one solvable block");
1179 if ((flags & REPO_EXTEND_SOLVABLES) != 0)
1180 s = pool_id2solvable(pool, extendstart);
1182 s = pool_id2solvable(pool, repo_add_solvable_block(repo, numsolv));
1183 data.start = s - pool->solvables;
1184 data.end = data.start + numsolv;
1185 repodata_extend_block(&data, data.start, numsolv);
1186 for (i = 1; i < numkeys; i++)
1189 if ((keys[i].type == REPOKEY_TYPE_IDARRAY || keys[i].type == REPOKEY_TYPE_REL_IDARRAY)
1190 && id >= INTERESTED_START && id <= INTERESTED_END)
1191 size_idarray += keys[i].size;
1193 /* allocate needed space in repo */
1194 /* we add maxsize because it is an upper limit for all idarrays, thus we can't overflow */
1195 repo_reserve_ids(repo, 0, size_idarray + maxsize + 1);
1196 idarraydatap = repo->idarraydata + repo->idarraysize;
1197 repo->idarraysize += size_idarray;
1198 idarraydataend = idarraydatap + size_idarray;
1200 if (have_incoredata)
1201 data.incoreoffset[(s - pool->solvables) - data.start] = data.incoredatalen;
1204 dp = data_read_id_max(dp, &id, 0, numschemata, &data);
1205 incore_add_id(&data, id);
1206 if (keys[key].type == REPOKEY_TYPE_FIXARRAY)
1209 data.error = pool_error(pool, SOLV_ERROR_CORRUPT, "illegal fixarray");
1210 stack[keydepth - 1] = id;
1212 keyp = schemadata + schemata[id];
1214 case REPOKEY_TYPE_NUM:
1215 if (!(solvflags & SOLV_FLAG_SIZE_BYTES) && keys[key].storage == KEY_STORAGE_INCORE &&
1216 (id == SOLVABLE_INSTALLSIZE || id == SOLVABLE_DOWNLOADSIZE || id == DELTA_DOWNLOADSIZE))
1218 /* old solv file with sizes in kilos. transcode. */
1219 dp = data_read_id(dp, &id);
1220 incore_add_sizek(&data, (unsigned int)id);
1225 if (id == RPM_RPMDBID && s && (keys[key].type == REPOKEY_TYPE_U32 || keys[key].type == REPOKEY_TYPE_NUM))
1227 if (keys[key].type == REPOKEY_TYPE_U32)
1228 dp = data_read_u32(dp, (unsigned int *)&id);
1230 dp = data_read_id_max(dp, &id, 0, 0, &data);
1232 repo->rpmdbid = repo_sidedata_create(repo, sizeof(Id));
1233 repo->rpmdbid[(s - pool->solvables) - repo->start] = id;
1237 dp = data_skip(dp, keys[key].type);
1238 if (keys[key].storage == KEY_STORAGE_INCORE)
1239 incore_add_blob(&data, dps, dp - dps);
1243 /* should shrink idarraydata again */
1246 data.error = pool_error(pool, SOLV_ERROR_EOF, "unexpected EOF, depth = %d", keydepth);
1250 data.error = pool_error(pool, SOLV_ERROR_EOF, "buffer overrun");
1256 /* free solvables */
1257 repo_free_solvable_block(repo, data.start, data.end - data.start, 1);
1259 repo->idarraysize -= size_idarray;
1260 /* free incore data */
1261 data.incoredata = solv_free(data.incoredata);
1262 data.incoredatalen = data.incoredatafree = 0;
1265 if (data.incoredatafree)
1267 /* shrink excess size */
1268 data.incoredata = solv_realloc(data.incoredata, data.incoredatalen);
1269 data.incoredatafree = 0;
1272 for (i = 1; i < numkeys; i++)
1273 if (keys[i].storage == KEY_STORAGE_VERTICAL_OFFSET)
1275 if (i < numkeys && !data.error)
1278 unsigned int pagesize;
1280 /* we have vertical data, make it available */
1281 data.verticaloffset = solv_calloc(numkeys, sizeof(Id));
1282 for (i = 1; i < numkeys; i++)
1283 if (keys[i].storage == KEY_STORAGE_VERTICAL_OFFSET)
1285 data.verticaloffset[i] = fileoffset;
1286 fileoffset += keys[i].size;
1288 data.lastverticaloffset = fileoffset;
1289 pagesize = read_u32(&data);
1290 data.error = repopagestore_read_or_setup_pages(&data.store, data.fp, pagesize, fileoffset);
1291 if (data.error == SOLV_ERROR_EOF)
1292 pool_error(pool, data.error, "repopagestore setup: unexpected EOF");
1293 else if (data.error)
1294 pool_error(pool, data.error, "repopagestore setup failed");
1298 /* no longer needed */
1305 /* XXX: free repodata? */
1311 /* overwrite stub repodata */
1312 repodata_freedata(parent);
1313 data.repodataid = parent->repodataid;
1318 /* make it available as new repodata */
1319 if (!repo->nrepodata)
1321 repo->nrepodata = 1;
1322 repo->repodata = solv_calloc(2, sizeof(data));
1325 repo->repodata = solv_realloc2(repo->repodata, repo->nrepodata + 1, sizeof(data));
1326 data.repodataid = repo->nrepodata;
1327 repo->repodata[repo->nrepodata++] = data;
1330 /* create stub repodata entries for all external */
1331 if (!(flags & SOLV_ADD_NO_STUBS) && !parent)
1333 for (key = 1 ; key < data.nkeys; key++)
1334 if (data.keys[key].name == REPOSITORY_EXTERNAL && data.keys[key].type == REPOKEY_TYPE_FLEXARRAY)
1336 if (key < data.nkeys)
1337 repodata_create_stubs(repo->repodata + (repo->nrepodata - 1));
1340 POOL_DEBUG(SOLV_DEBUG_STATS, "repo_add_solv took %d ms\n", solv_timems(now));
1341 POOL_DEBUG(SOLV_DEBUG_STATS, "repo size: %d solvables\n", repo->nsolvables);
1342 POOL_DEBUG(SOLV_DEBUG_STATS, "repo memory used: %d K incore, %d K idarray\n", data.incoredatalen/1024, repo->idarraysize / (int)(1024/sizeof(Id)));