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 space */
551 * read strings and Ids
560 if (!(flags & REPO_LOCALPOOL))
563 /* alloc max needed string buffer and string pointers, will shrink again later */
565 spool->stringspace = solv_realloc(spool->stringspace, spool->sstrings + sizeid + 1);
566 spool->strings = solv_realloc2(spool->strings, spool->nstrings + numid, sizeof(Offset));
568 spool->sstrings += sizeid + 1;
569 spool->nstrings += numid;
570 stringpool_shrink(spool); /* we misuse stringpool_shrink so that the correct BLOCK factor is used */
571 spool->sstrings -= sizeid + 1;
572 spool->nstrings -= numid;
579 spool->stringspace = solv_malloc(7 + sizeid + 1);
580 spool->strings = solv_malloc2(numid < 2 ? 2 : numid, sizeof(Offset));
581 strcpy(spool->stringspace, "<NULL>");
584 spool->strings[0] = 0; /* <NULL> */
589 * read string data and append to old string space
592 strsp = spool->stringspace + spool->sstrings; /* append new entries */
593 if ((solvflags & SOLV_FLAG_PREFIX_POOL) == 0)
595 if (sizeid && fread(strsp, sizeid, 1, fp) != 1)
597 repodata_freedata(&data);
598 return pool_error(pool, SOLV_ERROR_EOF, "read error while reading strings");
603 unsigned int pfsize = read_u32(&data);
604 char *prefix = solv_malloc(pfsize);
610 if (pfsize && fread(prefix, pfsize, 1, fp) != 1)
613 repodata_freedata(&data);
614 return pool_error(pool, SOLV_ERROR_EOF, "read error while reading strings");
616 for (i = 1; i < numid; i++)
618 int same = (unsigned char)*pp++;
619 size_t len = strlen(pp) + 1;
620 freesp -= same + len;
624 repodata_freedata(&data);
625 return pool_error(pool, SOLV_ERROR_OVERFLOW, "overflow while expanding strings");
628 memcpy(dest, old_str, same);
629 memcpy(dest + same, pp, len);
637 repodata_freedata(&data);
638 return pool_error(pool, SOLV_ERROR_CORRUPT, "expanding strings size mismatch");
641 strsp[sizeid] = 0; /* make string space \0 terminated */
645 str = spool->strings; /* array of offsets into strsp, indexed by Id */
646 if ((flags & REPO_LOCALPOOL) != 0)
648 /* no shared pool, thus no idmap and no unification needed */
650 spool->nstrings = numid < 2 ? 2 : numid; /* make sure we have at least id 0 and 1 */
653 /* we need id 1 to be '' for directories */
654 repodata_freedata(&data);
655 return pool_error(pool, SOLV_ERROR_CORRUPT, "store strings don't start with an empty string");
657 for (i = 1; i < spool->nstrings; i++)
659 if (sp >= strsp + sizeid && numid >= 2)
661 repodata_freedata(&data);
662 return pool_error(pool, SOLV_ERROR_OVERFLOW, "not enough strings");
664 str[i] = sp - spool->stringspace;
665 sp += strlen(sp) + 1;
667 spool->sstrings = sp - spool->stringspace;
671 Offset oldsstrings = spool->sstrings;
673 /* alloc id map for name and rel Ids. this maps ids in the solv files
674 * to the ids in our pool */
675 idmap = solv_calloc(numid + numrel, sizeof(Id));
677 /* grow hash if needed, otherwise reuse */
678 hashmask = mkmask(spool->nstrings + numid);
680 POOL_DEBUG(SOLV_DEBUG_STATS, "read %d strings\n", numid);
681 POOL_DEBUG(SOLV_DEBUG_STATS, "string hash buckets: %d, old %d\n", hashmask + 1, spool->stringhashmask + 1);
683 if (hashmask > spool->stringhashmask)
685 spool->stringhashtbl = solv_free(spool->stringhashtbl);
686 spool->stringhashmask = hashmask;
687 spool->stringhashtbl = hashtbl = solv_calloc(hashmask + 1, sizeof(Id));
688 for (i = 1; i < spool->nstrings; i++)
690 h = strhash(spool->stringspace + spool->strings[i]) & hashmask;
691 hh = HASHCHAIN_START;
693 h = HASHCHAIN_NEXT(h, hh, hashmask);
699 hashtbl = spool->stringhashtbl;
700 hashmask = spool->stringhashmask;
704 * run over strings and merge with pool.
705 * also populate id map (maps solv Id -> pool Id)
707 for (i = 1; i < numid; i++)
709 if (sp >= strsp + sizeid)
712 spool->nstrings = oldnstrings;
713 spool->sstrings = oldsstrings;
714 stringpool_freehash(spool);
715 repodata_freedata(&data);
716 return pool_error(pool, SOLV_ERROR_OVERFLOW, "not enough strings %d %d", i, numid);
718 if (!*sp) /* empty string */
726 h = strhash(sp) & hashmask;
727 hh = HASHCHAIN_START;
733 if (!strcmp(spool->stringspace + spool->strings[id], sp))
734 break; /* already in pool */
735 h = HASHCHAIN_NEXT(h, hh, hashmask);
738 /* length == offset to next string */
740 if (!id) /* end of hash chain -> new string */
742 id = spool->nstrings++;
744 str[id] = spool->sstrings; /* save offset */
745 if (sp != spool->stringspace + spool->sstrings)
746 memmove(spool->stringspace + spool->sstrings, sp, l);
747 spool->sstrings += l;
749 idmap[i] = id; /* repo relative -> pool relative */
750 sp += l; /* next string */
752 if (hashmask > mkmask(spool->nstrings + 8192))
754 spool->stringhashtbl = solv_free(spool->stringhashtbl);
755 spool->stringhashmask = 0;
757 stringpool_shrink(spool); /* vacuum */
761 /******* Part 2: Relation IDs ***************************************/
771 pool->rels = solv_realloc2(pool->rels, pool->nrels + numrel, sizeof(Reldep));
774 /* grow hash if needed, otherwise reuse */
775 hashmask = mkmask(pool->nrels + numrel);
777 POOL_DEBUG(SOLV_DEBUG_STATS, "read %d rels\n", numrel);
778 POOL_DEBUG(SOLV_DEBUG_STATS, "rel hash buckets: %d, old %d\n", hashmask + 1, pool->relhashmask + 1);
780 if (hashmask > pool->relhashmask)
782 pool->relhashtbl = solv_free(pool->relhashtbl);
783 pool->relhashmask = hashmask;
784 pool->relhashtbl = hashtbl = solv_calloc(hashmask + 1, sizeof(Id));
785 for (i = 1; i < pool->nrels; i++)
787 h = relhash(ran[i].name, ran[i].evr, ran[i].flags) & hashmask;
788 hh = HASHCHAIN_START;
790 h = HASHCHAIN_NEXT(h, hh, hashmask);
796 hashtbl = pool->relhashtbl;
797 hashmask = pool->relhashmask;
801 * read RelDeps from repo
803 for (i = 0; i < numrel; i++)
805 name = read_id(&data, i + numid); /* read (repo relative) Ids */
806 evr = read_id(&data, i + numid);
807 relflags = read_u8(&data);
808 name = idmap[name]; /* map to (pool relative) Ids */
810 h = relhash(name, evr, relflags) & hashmask;
811 hh = HASHCHAIN_START;
815 if (!id) /* end of hash chain reached */
817 if (ran[id].name == name && ran[id].evr == evr && ran[id].flags == relflags)
819 h = HASHCHAIN_NEXT(h, hh, hashmask);
821 if (!id) /* new RelDep */
827 ran[id].flags = relflags;
829 idmap[i + numid] = MAKERELDEP(id); /* fill Id map */
831 if (hashmask > mkmask(pool->nrels + 4096))
833 pool->relhashtbl = solv_free(pool->relhashtbl);
834 pool->relhashmask = 0;
836 pool_shrink_rels(pool); /* vacuum */
839 /* if we added ids/rels, make room in our whatprovide arrays */
840 if (!(flags & REPO_LOCALPOOL))
842 if (pool->whatprovides && oldnstrings != pool->ss.nstrings)
844 int newlen = (pool->ss.nstrings + WHATPROVIDES_BLOCK) & ~WHATPROVIDES_BLOCK;
845 pool->whatprovides = solv_realloc2(pool->whatprovides, newlen, sizeof(Offset));
846 memset(pool->whatprovides + oldnstrings, 0, (newlen - oldnstrings) * sizeof(Offset));
848 if (pool->whatprovides_rel && oldnrels != pool->nrels)
850 int newlen = (pool->nrels + WHATPROVIDES_BLOCK) & ~WHATPROVIDES_BLOCK;
851 pool->whatprovides_rel = solv_realloc2(pool->whatprovides_rel, newlen, sizeof(Offset));
852 memset(pool->whatprovides_rel + oldnrels, 0, (newlen - oldnrels) * sizeof(Offset));
856 /******* Part 3: Dirs ***********************************************/
859 data.dirpool.dirs = solv_malloc2(numdir, sizeof(Id));
860 data.dirpool.ndirs = numdir;
861 data.dirpool.dirs[0] = 0; /* dir 0: virtual root */
862 data.dirpool.dirs[1] = 1; /* dir 1: / */
863 for (i = 2; i < numdir; i++)
865 id = read_id(&data, i + numid);
867 data.dirpool.dirs[i] = -(id - numid);
869 data.dirpool.dirs[i] = idmap[id];
871 data.dirpool.dirs[i] = id;
875 /******* Part 4: Keys ***********************************************/
877 keys = solv_calloc(numkeys, sizeof(*keys));
878 /* keys start at 1 */
879 for (i = 1; i < numkeys; i++)
881 id = read_id(&data, numid);
884 else if ((flags & REPO_LOCALPOOL) != 0)
885 id = pool_str2id(pool, stringpool_id2str(spool, id), 1);
886 type = read_id(&data, numid);
889 else if ((flags & REPO_LOCALPOOL) != 0)
890 type = pool_str2id(pool, stringpool_id2str(spool, type), 1);
891 if (type < REPOKEY_TYPE_VOID || type > REPOKEY_TYPE_FLEXARRAY)
893 data.error = pool_error(pool, SOLV_ERROR_UNSUPPORTED, "unsupported data type '%s'", pool_id2str(pool, type));
894 type = REPOKEY_TYPE_VOID;
898 keys[i].size = read_id(&data, keys[i].type == REPOKEY_TYPE_CONSTANTID ? numid + numrel : 0);
899 keys[i].storage = read_id(&data, 0);
900 /* old versions used SOLVABLE for main solvable data */
901 if (keys[i].storage == KEY_STORAGE_SOLVABLE)
902 keys[i].storage = KEY_STORAGE_INCORE;
903 if (keys[i].storage != KEY_STORAGE_INCORE && keys[i].storage != KEY_STORAGE_VERTICAL_OFFSET)
904 data.error = pool_error(pool, SOLV_ERROR_UNSUPPORTED, "unsupported storage type %d", keys[i].storage);
905 if (id >= SOLVABLE_NAME && id <= RPM_RPMDBID)
907 if (keys[i].storage != KEY_STORAGE_INCORE)
908 data.error = pool_error(pool, SOLV_ERROR_UNSUPPORTED, "main solvable data must use incore storage %d", keys[i].storage);
909 keys[i].storage = KEY_STORAGE_SOLVABLE;
911 /* cannot handle rel idarrays in incore/vertical */
912 if (type == REPOKEY_TYPE_REL_IDARRAY && keys[i].storage != KEY_STORAGE_SOLVABLE)
913 data.error = pool_error(pool, SOLV_ERROR_UNSUPPORTED, "type REL_IDARRAY is only supported for STORAGE_SOLVABLE");
914 /* cannot handle mapped ids in vertical */
915 if (!(flags & REPO_LOCALPOOL) && keys[i].storage == KEY_STORAGE_VERTICAL_OFFSET && (type == REPOKEY_TYPE_ID || type == REPOKEY_TYPE_IDARRAY))
916 data.error = pool_error(pool, SOLV_ERROR_UNSUPPORTED, "mapped ids are not supported for STORAGE_VERTICAL_OFFSET");
918 if (keys[i].type == REPOKEY_TYPE_CONSTANTID && idmap)
919 keys[i].size = idmap[keys[i].size];
921 fprintf(stderr, "key %d %s %s %d %d\n", i, pool_id2str(pool,id), pool_id2str(pool, keys[i].type),
922 keys[i].size, keys[i].storage);
927 for (i = 1; i < numkeys; i++)
928 if (keys[i].storage == KEY_STORAGE_INCORE || keys[i].storage == KEY_STORAGE_VERTICAL_OFFSET)
932 data.nkeys = numkeys;
933 for (i = 1; i < numkeys; i++)
936 data.keybits[(id >> 3) & (sizeof(data.keybits) - 1)] |= 1 << (id & 7);
939 /******* Part 5: Schemata ********************************************/
941 id = read_id(&data, 0);
942 schemadata = solv_calloc(id + 1, sizeof(Id));
943 schemadatap = schemadata + 1;
944 schemadataend = schemadatap + id;
945 schemata = solv_calloc(numschemata, sizeof(Id));
946 for (i = 1; i < numschemata; i++)
948 schemata[i] = schemadatap - schemadata;
949 schemadatap = read_idarray(&data, numid, 0, schemadatap, schemadataend);
951 Id *sp = schemadata + schemata[i];
952 fprintf(stderr, "schema %d:", i);
954 fprintf(stderr, " %d", *sp);
955 fprintf(stderr, "\n");
958 data.schemata = schemata;
959 data.nschemata = numschemata;
960 data.schemadata = schemadata;
961 data.schemadatalen = schemadataend - data.schemadata;
963 /******* Part 6: Data ********************************************/
965 idarraydatap = idarraydataend = 0;
968 maxsize = read_id(&data, 0);
969 allsize = read_id(&data, 0);
970 maxsize += 5; /* so we can read the next schema of an array */
971 if (maxsize > allsize)
974 buf = solv_calloc(maxsize + DATA_READ_CHUNK + 4, 1); /* 4 extra bytes to detect overflows */
979 if (l < DATA_READ_CHUNK)
983 if (!l || fread(buf, l, 1, data.fp) != 1)
985 data.error = pool_error(pool, SOLV_ERROR_EOF, "unexpected EOF");
992 dp = data_read_id_max(dp, &id, 0, numschemata, &data);
995 incore_add_id(&data, 0); /* so that incoreoffset 0 means schema 0 */
996 incore_add_id(&data, id); /* main schema id */
997 keyp = schemadata + schemata[id];
998 data.mainschema = id;
999 for (i = 0; keyp[i]; i++)
1002 data.mainschemaoffsets = solv_calloc(i, sizeof(Id));
1010 /* make sure we have enough room */
1011 if (keydepth == 0 || needchunk)
1013 int left = bufend - dp;
1014 /* read data chunk to dp */
1019 data.error = pool_error(pool, SOLV_ERROR_EOF, "buffer overrun");
1025 memmove(buf, dp, left);
1027 if (l < DATA_READ_CHUNK)
1028 l = DATA_READ_CHUNK;
1031 if (l && fread(buf + left, l, 1, data.fp) != 1)
1033 data.error = pool_error(pool, SOLV_ERROR_EOF, "unexpected EOF");
1038 bufend = buf + left;
1039 if (allsize + left < maxsize)
1040 maxsize = allsize + left;
1048 printf("key %d at %d\n", key, (int)(keyp - 1 - schemadata));
1056 if (s && keydepth == 3)
1058 s++; /* next solvable */
1059 if (have_incoredata)
1060 data.incoreoffset[(s - pool->solvables) - data.start] = data.incoredatalen;
1062 id = stack[keydepth - 1];
1065 dp = data_read_id_max(dp, &id, 0, numschemata, &data);
1066 incore_add_id(&data, id);
1068 keyp = schemadata + schemata[id];
1075 keyp = schemadata + stack[--keydepth];
1076 nentries = stack[--keydepth];
1078 printf("pop flexarray %d %d\n", keydepth, nentries);
1081 s = 0; /* back from solvables */
1086 data.mainschemaoffsets[keyp - 1 - (schemadata + schemata[data.mainschema])] = data.incoredatalen;
1089 printf("=> %s %s %p\n", pool_id2str(pool, keys[key].name), pool_id2str(pool, keys[key].type), s);
1091 id = keys[key].name;
1092 if (keys[key].storage == KEY_STORAGE_VERTICAL_OFFSET)
1095 dp = data_skip(dp, REPOKEY_TYPE_ID);
1096 dp = data_skip(dp, REPOKEY_TYPE_ID);
1097 incore_add_blob(&data, dps, dp - dps); /* just record offset/size */
1100 switch (keys[key].type)
1102 case REPOKEY_TYPE_ID:
1103 dp = data_read_id_max(dp, &did, idmap, numid + numrel, &data);
1104 if (s && id == SOLVABLE_NAME)
1106 else if (s && id == SOLVABLE_ARCH)
1108 else if (s && id == SOLVABLE_EVR)
1110 else if (s && id == SOLVABLE_VENDOR)
1112 else if (keys[key].storage == KEY_STORAGE_INCORE)
1113 incore_add_id(&data, did);
1115 POOL_DEBUG(SOLV_DEBUG_STATS, "%s -> %s\n", pool_id2str(pool, id), pool_id2str(pool, did));
1118 case REPOKEY_TYPE_IDARRAY:
1119 case REPOKEY_TYPE_REL_IDARRAY:
1120 if (!s || id < INTERESTED_START || id > INTERESTED_END)
1123 dp = data_skip(dp, REPOKEY_TYPE_IDARRAY);
1124 if (keys[key].storage != KEY_STORAGE_INCORE)
1127 incore_map_idarray(&data, dps, idmap, numid + numrel);
1129 incore_add_blob(&data, dps, dp - dps);
1132 ido = idarraydatap - repo->idarraydata;
1133 if (keys[key].type == REPOKEY_TYPE_IDARRAY)
1134 dp = data_read_idarray(dp, &idarraydatap, idmap, numid + numrel, &data);
1135 else if (id == SOLVABLE_REQUIRES)
1136 dp = data_read_rel_idarray(dp, &idarraydatap, idmap, numid + numrel, &data, SOLVABLE_PREREQMARKER);
1137 else if (id == SOLVABLE_PROVIDES)
1138 dp = data_read_rel_idarray(dp, &idarraydatap, idmap, numid + numrel, &data, SOLVABLE_FILEMARKER);
1140 dp = data_read_rel_idarray(dp, &idarraydatap, idmap, numid + numrel, &data, 0);
1141 if (idarraydatap > idarraydataend)
1143 data.error = pool_error(pool, SOLV_ERROR_OVERFLOW, "idarray overflow");
1146 if (id == SOLVABLE_PROVIDES)
1148 else if (id == SOLVABLE_OBSOLETES)
1150 else if (id == SOLVABLE_CONFLICTS)
1152 else if (id == SOLVABLE_REQUIRES)
1154 else if (id == SOLVABLE_RECOMMENDS)
1156 else if (id == SOLVABLE_SUPPLEMENTS)
1157 s->supplements = ido;
1158 else if (id == SOLVABLE_SUGGESTS)
1160 else if (id == SOLVABLE_ENHANCES)
1163 POOL_DEBUG(SOLV_DEBUG_STATS, "%s ->\n", pool_id2str(pool, id));
1164 for (; repo->idarraydata[ido]; ido++)
1165 POOL_DEBUG(SOLV_DEBUG_STATS," %s\n", pool_dep2str(pool, repo->idarraydata[ido]));
1168 case REPOKEY_TYPE_FIXARRAY:
1169 case REPOKEY_TYPE_FLEXARRAY:
1172 if (keydepth == sizeof(stack)/sizeof(*stack))
1174 data.error = pool_error(pool, SOLV_ERROR_OVERFLOW, "array stack overflow");
1177 stack[keydepth++] = nentries;
1178 stack[keydepth++] = keyp - schemadata;
1179 stack[keydepth++] = 0;
1180 dp = data_read_id_max(dp, &nentries, 0, 0, &data);
1181 incore_add_id(&data, nentries);
1184 /* zero size array? */
1186 nentries = stack[--keydepth];
1189 if (keydepth == 3 && id == REPOSITORY_SOLVABLES)
1191 /* horray! here come the solvables */
1192 if (nentries != numsolv)
1194 data.error = pool_error(pool, SOLV_ERROR_CORRUPT, "inconsistent number of solvables: %d %d", nentries, numsolv);
1199 data.error = pool_error(pool, SOLV_ERROR_CORRUPT, "more than one solvable block");
1202 if ((flags & REPO_EXTEND_SOLVABLES) != 0)
1203 s = pool_id2solvable(pool, extendstart);
1205 s = pool_id2solvable(pool, repo_add_solvable_block(repo, numsolv));
1206 data.start = s - pool->solvables;
1207 data.end = data.start + numsolv;
1208 repodata_extend_block(&data, data.start, numsolv);
1209 for (i = 1; i < numkeys; i++)
1212 if ((keys[i].type == REPOKEY_TYPE_IDARRAY || keys[i].type == REPOKEY_TYPE_REL_IDARRAY)
1213 && id >= INTERESTED_START && id <= INTERESTED_END)
1214 size_idarray += keys[i].size;
1216 /* allocate needed space in repo */
1217 /* we add maxsize because it is an upper limit for all idarrays, thus we can't overflow */
1218 repo_reserve_ids(repo, 0, size_idarray + maxsize + 1);
1219 idarraydatap = repo->idarraydata + repo->idarraysize;
1220 repo->idarraysize += size_idarray;
1221 idarraydataend = idarraydatap + size_idarray;
1223 if (have_incoredata)
1224 data.incoreoffset[(s - pool->solvables) - data.start] = data.incoredatalen;
1227 dp = data_read_id_max(dp, &id, 0, numschemata, &data);
1228 incore_add_id(&data, id);
1229 if (keys[key].type == REPOKEY_TYPE_FIXARRAY)
1232 data.error = pool_error(pool, SOLV_ERROR_CORRUPT, "illegal fixarray");
1233 stack[keydepth - 1] = id;
1235 keyp = schemadata + schemata[id];
1237 case REPOKEY_TYPE_NUM:
1238 if (!(solvflags & SOLV_FLAG_SIZE_BYTES) && keys[key].storage == KEY_STORAGE_INCORE &&
1239 (id == SOLVABLE_INSTALLSIZE || id == SOLVABLE_DOWNLOADSIZE || id == DELTA_DOWNLOADSIZE))
1241 /* old solv file with sizes in kilos. transcode. */
1242 dp = data_read_id(dp, &id);
1243 incore_add_sizek(&data, (unsigned int)id);
1248 if (id == RPM_RPMDBID && s && (keys[key].type == REPOKEY_TYPE_U32 || keys[key].type == REPOKEY_TYPE_NUM))
1250 if (keys[key].type == REPOKEY_TYPE_U32)
1251 dp = data_read_u32(dp, (unsigned int *)&id);
1253 dp = data_read_id_max(dp, &id, 0, 0, &data);
1255 repo->rpmdbid = repo_sidedata_create(repo, sizeof(Id));
1256 repo->rpmdbid[(s - pool->solvables) - repo->start] = id;
1260 dp = data_skip(dp, keys[key].type);
1261 if (keys[key].storage == KEY_STORAGE_INCORE)
1262 incore_add_blob(&data, dps, dp - dps);
1266 /* should shrink idarraydata again */
1269 data.error = pool_error(pool, SOLV_ERROR_EOF, "unexpected EOF, depth = %d", keydepth);
1273 data.error = pool_error(pool, SOLV_ERROR_EOF, "buffer overrun");
1279 /* free solvables */
1280 repo_free_solvable_block(repo, data.start, data.end - data.start, 1);
1282 repo->idarraysize -= size_idarray;
1283 /* free incore data */
1284 data.incoredata = solv_free(data.incoredata);
1285 data.incoredatalen = data.incoredatafree = 0;
1288 if (data.incoredatafree)
1290 /* shrink excess size */
1291 data.incoredata = solv_realloc(data.incoredata, data.incoredatalen);
1292 data.incoredatafree = 0;
1296 for (i = 1; i < numkeys; i++)
1297 if (keys[i].storage == KEY_STORAGE_VERTICAL_OFFSET)
1299 if (i < numkeys && !data.error)
1302 unsigned int pagesize;
1304 /* we have vertical data, make it available */
1305 data.verticaloffset = solv_calloc(numkeys, sizeof(Id));
1306 for (i = 1; i < numkeys; i++)
1307 if (keys[i].storage == KEY_STORAGE_VERTICAL_OFFSET)
1309 data.verticaloffset[i] = fileoffset;
1310 fileoffset += keys[i].size;
1312 data.lastverticaloffset = fileoffset;
1313 pagesize = read_u32(&data);
1316 data.error = repopagestore_read_or_setup_pages(&data.store, data.fp, pagesize, fileoffset);
1317 if (data.error == SOLV_ERROR_EOF)
1318 pool_error(pool, data.error, "repopagestore setup: unexpected EOF");
1319 else if (data.error)
1320 pool_error(pool, data.error, "repopagestore setup failed");
1323 data.fp = 0; /* no longer needed */
1328 repodata_freedata(&data);
1334 /* overwrite stub repodata */
1335 repodata_freedata(parent);
1336 data.repodataid = parent->repodataid;
1341 /* make it available as new repodata */
1342 if (!repo->nrepodata)
1344 repo->nrepodata = 1;
1345 repo->repodata = solv_calloc(2, sizeof(data));
1348 repo->repodata = solv_realloc2(repo->repodata, repo->nrepodata + 1, sizeof(data));
1349 data.repodataid = repo->nrepodata;
1350 repo->repodata[repo->nrepodata++] = data;
1353 /* create stub repodata entries for all external */
1354 if (!(flags & SOLV_ADD_NO_STUBS) && !parent)
1356 for (key = 1 ; key < data.nkeys; key++)
1357 if (data.keys[key].name == REPOSITORY_EXTERNAL && data.keys[key].type == REPOKEY_TYPE_FLEXARRAY)
1359 if (key < data.nkeys)
1360 repodata_create_stubs(repo->repodata + (repo->nrepodata - 1));
1363 POOL_DEBUG(SOLV_DEBUG_STATS, "repo_add_solv took %d ms\n", solv_timems(now));
1364 POOL_DEBUG(SOLV_DEBUG_STATS, "repo size: %d solvables\n", repo->nsolvables);
1365 POOL_DEBUG(SOLV_DEBUG_STATS, "repo memory used: %d K incore, %d K idarray\n", data.incoredatalen/1024, repo->idarraysize / (int)(1024/sizeof(Id)));