2 * Copyright (c) 2007, Novell Inc.
4 * This program is licensed under the BSD license, read LICENSE.BSD
5 * for further information
11 * Read the binary dump of a Repo and create a Repo * from it
14 * Repo *pool_addrepo_solv(Pool *pool, FILE *fp)
26 #include "repo_solv.h"
31 #define INTERESTED_START SOLVABLE_NAME
32 #define INTERESTED_END SOLVABLE_FRESHENS
34 #define SOLV_ERROR_NOT_SOLV 1
35 #define SOLV_ERROR_UNSUPPORTED 2
36 #define SOLV_ERROR_EOF 3
37 #define SOLV_ERROR_ID_RANGE 4
38 #define SOLV_ERROR_OVERFLOW 5
39 #define SOLV_ERROR_CORRUPT 6
41 static Pool *mypool; /* for pool_debug... */
43 /*-----------------------------------------------------------------*/
44 /* .solv read functions */
51 read_u32(Repodata *data)
58 for (i = 0; i < 4; i++)
63 pool_debug(mypool, SAT_ERROR, "unexpected EOF\n");
64 data->error = SOLV_ERROR_EOF;
78 read_u8(Repodata *data)
87 pool_debug(mypool, SAT_ERROR, "unexpected EOF\n");
88 data->error = SOLV_ERROR_EOF;
100 read_id(Repodata *data, Id max)
107 for (i = 0; i < 5; i++)
112 pool_debug(mypool, SAT_ERROR, "unexpected EOF\n");
113 data->error = SOLV_ERROR_EOF;
121 pool_debug(mypool, SAT_ERROR, "read_id: id too large (%u/%u)\n", x, max);
122 data->error = SOLV_ERROR_ID_RANGE;
127 x = (x << 7) ^ c ^ 128;
129 pool_debug(mypool, SAT_ERROR, "read_id: id too long\n");
130 data->error = SOLV_ERROR_CORRUPT;
141 read_rel_idarray(Repodata *data, Id max, Id *map, Id *store, Id *end, Id marker)
154 pool_debug(mypool, SAT_ERROR, "unexpected EOF\n");
155 data->error = SOLV_ERROR_EOF;
160 x = (x << 7) ^ c ^ 128;
163 x = (x << 6) | (c & 63);
169 pool_debug(mypool, SAT_ERROR, "read_rel_idarray: array overflow\n");
170 data->error = SOLV_ERROR_OVERFLOW;
178 *store++ = marker; /* do not map! */
187 pool_debug(mypool, SAT_ERROR, "read_rel_idarray: id too large (%u/%u)\n", x, max);
188 data->error = SOLV_ERROR_ID_RANGE;
195 pool_debug(mypool, SAT_ERROR, "read_rel_idarray: array overflow\n");
201 if (x == 0) /* already have trailing zero? */
205 pool_debug(mypool, SAT_ERROR, "read_rel_idarray: array overflow\n");
206 data->error = SOLV_ERROR_OVERFLOW;
217 static inline unsigned char *
218 data_read_id_max(unsigned char *dp, Id *ret, Id *map, int max, int *error)
221 dp = data_read_id(dp, &x);
224 pool_debug(mypool, SAT_ERROR, "data_read_idarray: id too large (%u/%u)\n", x, max);
225 *error = SOLV_ERROR_ID_RANGE;
228 *ret = map ? map[x] : x;
233 data_read_idarray(unsigned char *dp, Id **storep, Id *map, int max, int *error)
244 x = (x << 7) ^ c ^ 128;
247 x = (x << 6) | (c & 63);
250 pool_debug(mypool, SAT_ERROR, "data_read_idarray: id too large (%u/%u)\n", x, max);
251 *error = SOLV_ERROR_ID_RANGE;
265 data_read_rel_idarray(unsigned char *dp, Id **storep, Id *map, int max, int *error, Id marker)
277 x = (x << 7) ^ c ^ 128;
280 x = (x << 6) | (c & 63);
294 pool_debug(mypool, SAT_ERROR, "data_read_rel_idarray: id too large (%u/%u)\n", x, max);
295 *error = SOLV_ERROR_ID_RANGE;
298 *store++ = map ? map[x] : x;
310 read_idarray(Repodata *data, Id max, Id *map, Id *store, Id *end)
322 pool_debug(mypool, SAT_ERROR, "unexpected EOF\n");
323 data->error = SOLV_ERROR_EOF;
328 x = (x << 7) ^ c ^ 128;
331 x = (x << 6) | (c & 63);
334 pool_debug(mypool, SAT_ERROR, "read_idarray: id too large (%u/%u)\n", x, max);
335 data->error = SOLV_ERROR_ID_RANGE;
342 pool_debug(mypool, SAT_ERROR, "read_idarray: array overflow\n");
348 if (x == 0) /* already have trailing zero? */
352 pool_debug(mypool, SAT_ERROR, "read_idarray: array overflow\n");
353 data->error = SOLV_ERROR_OVERFLOW;
364 read_str(Repodata *data, char **inbuf, unsigned *len)
366 unsigned char *buf = (unsigned char*)*inbuf;
369 buf = sat_malloc(1024);
374 while((c = getc(data->fp)) != 0)
378 pool_debug (mypool, SAT_ERROR, "unexpected EOF\n");
379 data->error = SOLV_ERROR_EOF;
382 /* Plus 1 as we also want to add the 0. */
386 /* Don't realloc on the inbuf, it might be on the stack. */
387 if (buf == (unsigned char*)*inbuf)
389 buf = sat_malloc(*len);
390 memcpy(buf, *inbuf, *len - 256);
393 buf = sat_realloc(buf, *len);
402 skip_item(Repodata *data, unsigned type, unsigned numid, unsigned numrel)
406 case REPOKEY_TYPE_VOID:
407 case REPOKEY_TYPE_CONSTANT:
408 case REPOKEY_TYPE_CONSTANTID:
410 case REPOKEY_TYPE_ID:
411 read_id(data, numid + numrel); /* just check Id */
413 case REPOKEY_TYPE_DIR:
414 read_id(data, numid + data->dirpool.ndirs); /* just check Id */
416 case REPOKEY_TYPE_NUM:
419 case REPOKEY_TYPE_U32:
422 case REPOKEY_TYPE_STR:
423 while (read_u8(data) != 0)
426 case REPOKEY_TYPE_IDARRAY:
427 case REPOKEY_TYPE_REL_IDARRAY:
428 while ((read_u8(data) & 0xc0) != 0)
431 case REPOKEY_TYPE_DIRNUMNUMARRAY:
434 read_id(data, numid + data->dirpool.ndirs); /* just check Id */
436 if (!(read_id(data, 0) & 0x40))
440 case REPOKEY_TYPE_DIRSTRARRAY:
443 Id id = read_id(data, 0);
444 while (read_u8(data) != 0)
451 pool_debug(mypool, SAT_ERROR, "unknown type %d\n", type);
452 data->error = SOLV_ERROR_CORRUPT;
458 key_cmp (const void *pa, const void *pb)
460 Repokey *a = (Repokey *)pa;
461 Repokey *b = (Repokey *)pb;
462 return a->name - b->name;
465 static void repodata_load_solv(Repodata *data);
468 parse_repodata(Repodata *maindata, Id *keyp, Repokey *keys, Id *idmap, unsigned numid, unsigned numrel, Repo *repo)
475 repo->repodata = sat_realloc2(repo->repodata, repo->nrepodata + 1, sizeof (*data));
476 data = repo->repodata + repo->nrepodata++;
477 memset(data, 0, sizeof(*data));
479 data->state = REPODATA_STUB;
480 data->loadcallback = repodata_load_solv;
482 while ((key = *keyp++) != 0)
485 switch (keys[key].type)
487 case REPOKEY_TYPE_IDARRAY:
488 if (id != REPODATA_KEYS)
490 skip_item(maindata, REPOKEY_TYPE_IDARRAY, numid, numrel);
493 /* read_idarray writes a terminating 0, that's why the + 1 */
494 ida = sat_calloc(keys[key].size + 1, sizeof(Id));
495 ide = read_idarray(maindata, 0, 0, ida, ida + keys[key].size + 1);
499 pool_debug (mypool, SAT_ERROR, "invalid attribute data\n");
500 data->error = SOLV_ERROR_CORRUPT;
503 data->nkeys = 1 + (n >> 1);
504 data->keys = sat_malloc2(data->nkeys, sizeof(data->keys[0]));
505 memset(data->keys, 0, sizeof(Repokey));
506 for (i = 1, ide = ida; i < data->nkeys; i++)
510 pool_debug (mypool, SAT_ERROR, "invalid attribute data\n");
511 data->error = SOLV_ERROR_CORRUPT;
514 data->keys[i].name = idmap ? idmap[*ide++] : *ide++;
515 data->keys[i].type = idmap ? idmap[*ide++] : *ide++;
516 data->keys[i].size = 0;
517 data->keys[i].storage = 0;
521 qsort(data->keys + 1, data->nkeys - 1, sizeof(data->keys[0]), key_cmp);
523 case REPOKEY_TYPE_STR:
524 if (id != REPODATA_LOCATION)
525 skip_item(maindata, REPOKEY_TYPE_STR, numid, numrel);
529 unsigned len = sizeof (buf);
530 char *filename = buf;
531 read_str(maindata, &filename, &len);
532 data->location = strdup(filename);
538 skip_item(maindata, keys[key].type, numid, numrel);
544 /*-----------------------------------------------------------------*/
548 skip_schema(Repodata *data, Id *keyp, Repokey *keys, unsigned int numid, unsigned int numrel)
551 while ((key = *keyp++) != 0)
552 skip_item(data, keys[key].type, numid, numrel);
555 /*-----------------------------------------------------------------*/
558 incore_add_id(Repodata *data, Id x)
561 /* make sure we have at least 5 bytes free */
562 if (data->incoredatafree < 5)
564 data->incoredata = sat_realloc(data->incoredata, data->incoredatalen + 1024);
565 data->incoredatafree = 1024;
567 dp = data->incoredata + data->incoredatalen;
573 *dp++ = (x >> 28) | 128;
575 *dp++ = (x >> 21) | 128;
576 *dp++ = (x >> 14) | 128;
579 *dp++ = (x >> 7) | 128;
581 data->incoredatafree -= dp - (data->incoredata + data->incoredatalen);
582 data->incoredatalen = dp - data->incoredata;
586 incore_add_blob(Repodata *data, unsigned char *buf, int len)
588 if (data->incoredatafree < len)
590 data->incoredata = sat_realloc(data->incoredata, data->incoredatalen + 1024 + len);
591 data->incoredatafree = 1024 + len;
593 memcpy(data->incoredata + data->incoredatalen, buf, len);
594 data->incoredatafree -= len;
595 data->incoredatalen += len;
599 incore_add_u32(Repodata *data, unsigned int x)
602 /* make sure we have at least 4 bytes free */
603 if (data->incoredatafree < 4)
605 data->incoredata = sat_realloc(data->incoredata, data->incoredatalen + 1024);
606 data->incoredatafree = 1024;
608 dp = data->incoredata + data->incoredatalen;
613 data->incoredatafree -= 4;
614 data->incoredatalen += 4;
619 incore_add_u8(Repodata *data, unsigned int x)
622 /* make sure we have at least 1 byte free */
623 if (data->incoredatafree < 1)
625 data->incoredata = sat_realloc(data->incoredata, data->incoredatalen + 1024);
626 data->incoredatafree = 1024;
628 dp = data->incoredata + data->incoredatalen;
630 data->incoredatafree--;
631 data->incoredatalen++;
637 // ----------------------------------------------
641 * read repo from .solv file
646 repo_add_solv_parent(Repo *repo, FILE *fp, Repodata *parent)
648 Pool *pool = repo->pool;
650 unsigned int numid, numrel, numdir, numsolv;
651 unsigned int numkeys, numschemata, numinfo;
654 Offset *str; /* map Id -> Offset into string space */
655 char *strsp; /* repo string space */
656 char *sp; /* pointer into string space */
657 Id *idmap; /* map of repo Ids to pool Ids */
659 unsigned int hashmask, h;
665 unsigned int size_idarray;
666 Id *idarraydatap, *idarraydataend;
669 unsigned int solvflags;
670 unsigned int solvversion;
672 Id *schemadata, *schemadatap, *schemadataend;
675 unsigned oldnrepodata;
676 int maxsize, allsize;
677 unsigned char *buf, *dp, *dps;
680 struct _Stringpool *spool;
684 memset(&data, 0, sizeof(data));
691 if (read_u32(&data) != ('S' << 24 | 'O' << 16 | 'L' << 8 | 'V'))
693 pool_debug(pool, SAT_ERROR, "not a SOLV file\n");
694 return SOLV_ERROR_NOT_SOLV;
696 solvversion = read_u32(&data);
702 pool_debug(pool, SAT_ERROR, "unsupported SOLV version\n");
703 return SOLV_ERROR_UNSUPPORTED;
706 pool_freeidhashes(pool);
708 numid = read_u32(&data);
709 numrel = read_u32(&data);
710 numdir = read_u32(&data);
711 numsolv = read_u32(&data);
712 numkeys = read_u32(&data);
713 numschemata = read_u32(&data);
714 numinfo = read_u32(&data);
715 solvflags = read_u32(&data);
717 if (numdir && numdir < 2)
719 pool_debug(pool, SAT_ERROR, "bad number of dirs\n");
720 return SOLV_ERROR_CORRUPT;
727 pool_debug(pool, SAT_ERROR, "relations are forbidden in a store\n");
728 return SOLV_ERROR_CORRUPT;
730 if (parent->end - parent->start != numsolv)
732 pool_debug(pool, SAT_ERROR, "unequal number of solvables in a store\n");
733 return SOLV_ERROR_CORRUPT;
737 pool_debug(pool, SAT_ERROR, "info blocks are forbidden in a store\n");
738 return SOLV_ERROR_CORRUPT;
742 /******* Part 1: string IDs *****************************************/
744 sizeid = read_u32(&data); /* size of string+Id space */
747 * read strings and Ids
762 spool->stringspace = sat_malloc(7);
763 strcpy(spool->stringspace, "<NULL>");
768 /* alloc string buffer */
769 spool->stringspace = sat_realloc(spool->stringspace, spool->sstrings + sizeid + 1);
770 /* alloc string offsets (Id -> Offset into string space) */
771 spool->strings = sat_realloc2(spool->strings, spool->nstrings + numid, sizeof(Offset));
773 strsp = spool->stringspace;
774 str = spool->strings; /* array of offsets into strsp, indexed by Id */
776 /* point to _BEHIND_ already allocated string/Id space */
777 strsp += spool->sstrings;
781 * read new repo at end of pool
784 if ((solvflags & SOLV_FLAG_PREFIX_POOL) == 0)
786 if (sizeid && fread(strsp, sizeid, 1, fp) != 1)
788 pool_debug(pool, SAT_ERROR, "read error while reading strings\n");
789 return SOLV_ERROR_EOF;
794 unsigned int pfsize = read_u32(&data);
795 char *prefix = sat_malloc(pfsize);
799 if (pfsize && fread(prefix, pfsize, 1, fp) != 1)
801 pool_debug(pool, SAT_ERROR, "read error while reading strings\n");
803 return SOLV_ERROR_EOF;
805 for (i = 1; i < numid; i++)
807 int same = (unsigned char)*pp++;
808 size_t len = strlen (pp) + 1;
810 memcpy(dest, old_str, same);
811 memcpy(dest + same, pp, len);
818 strsp[sizeid] = 0; /* make string space \0 terminated */
823 /* no shared pool, thus no idmap and no unification */
825 spool->nstrings = numid;
829 /* we need the '' for directories */
830 pool_debug(pool, SAT_ERROR, "store strings don't start with ''\n");
831 return SOLV_ERROR_CORRUPT;
833 for (i = 1; i < spool->nstrings; i++)
835 if (sp >= strsp + sizeid)
837 pool_debug(pool, SAT_ERROR, "not enough strings\n");
838 return SOLV_ERROR_OVERFLOW;
840 str[i] = sp - spool->stringspace;
841 sp += strlen(sp) + 1;
843 spool->sstrings = sp - spool->stringspace;
848 /* alloc id map for name and rel Ids. this maps ids in the solv files
849 * to the ids in our pool */
850 idmap = sat_calloc(numid + numrel, sizeof(Id));
853 * build hashes for all read strings
857 hashmask = mkmask(spool->nstrings + numid);
860 POOL_DEBUG(SAT_DEBUG_STATS, "read %d strings\n", numid);
861 POOL_DEBUG(SAT_DEBUG_STATS, "string hash buckets: %d\n", hashmask + 1);
865 * create hashtable with strings already in pool
868 hashtbl = sat_calloc(hashmask + 1, sizeof(Id));
869 for (i = 1; i < spool->nstrings; i++) /* leave out our dummy zero id */
871 h = strhash(spool->stringspace + spool->strings[i]) & hashmask;
872 hh = HASHCHAIN_START;
874 h = HASHCHAIN_NEXT(h, hh, hashmask);
879 * run over string space, calculate offsets
881 * build id map (maps solv Id -> pool Id)
884 for (i = 1; i < numid; i++)
886 if (sp >= strsp + sizeid)
890 pool_debug(pool, SAT_ERROR, "not enough strings\n");
891 return SOLV_ERROR_OVERFLOW;
893 if (!*sp) /* empty string */
901 h = strhash(sp) & hashmask;
902 hh = HASHCHAIN_START;
908 if (!strcmp(spool->stringspace + spool->strings[id], sp))
909 break; /* existing string */
910 h = HASHCHAIN_NEXT(h, hh, hashmask);
913 /* length == offset to next string */
915 if (id == ID_NULL) /* end of hash chain -> new string */
917 id = spool->nstrings++;
919 str[id] = spool->sstrings; /* save Offset */
920 if (sp != spool->stringspace + spool->sstrings) /* not at end-of-buffer */
921 memmove(spool->stringspace + spool->sstrings, sp, l); /* append to pool buffer */
922 spool->sstrings += l;
924 idmap[i] = id; /* repo relative -> pool relative */
925 sp += l; /* next string */
929 pool_shrink_strings(pool); /* vacuum */
932 /******* Part 2: Relation IDs ***************************************/
942 pool->rels = sat_realloc2(pool->rels, pool->nrels + numrel, sizeof(Reldep));
945 hashmask = mkmask(pool->nrels + numrel);
947 POOL_DEBUG(SAT_DEBUG_STATS, "read %d rels\n", numrel);
948 POOL_DEBUG(SAT_DEBUG_STATS, "rel hash buckets: %d\n", hashmask + 1);
951 * prep hash table with already existing RelDeps
954 hashtbl = sat_calloc(hashmask + 1, sizeof(Id));
955 for (i = 1; i < pool->nrels; i++)
957 h = relhash(ran[i].name, ran[i].evr, ran[i].flags) & hashmask;
958 hh = HASHCHAIN_START;
960 h = HASHCHAIN_NEXT(h, hh, hashmask);
965 * read RelDeps from repo
968 for (i = 0; i < numrel; i++)
970 name = read_id(&data, i + numid); /* read (repo relative) Ids */
971 evr = read_id(&data, i + numid);
972 flags = read_u8(&data);
973 name = idmap[name]; /* map to (pool relative) Ids */
975 h = relhash(name, evr, flags) & hashmask;
976 hh = HASHCHAIN_START;
980 if (id == ID_NULL) /* end of hash chain */
982 if (ran[id].name == name && ran[id].evr == evr && ran[id].flags == flags)
984 h = HASHCHAIN_NEXT(h, hh, hashmask);
986 if (id == ID_NULL) /* new RelDep */
992 ran[id].flags = flags;
994 idmap[i + numid] = MAKERELDEP(id); /* fill Id map */
997 pool_shrink_rels(pool); /* vacuum */
1001 /******* Part 3: Dirs ***********************************************/
1004 data.dirpool.dirs = sat_malloc2(numdir, sizeof(Id));
1005 data.dirpool.ndirs = numdir;
1006 data.dirpool.dirs[0] = 0; /* dir 0: virtual root */
1007 data.dirpool.dirs[1] = 1; /* dir 1: / */
1008 for (i = 2; i < numdir; i++)
1010 id = read_id(&data, i + numid);
1012 data.dirpool.dirs[i] = -(id - numid);
1014 data.dirpool.dirs[i] = idmap[id];
1016 data.dirpool.dirs[i] = id;
1020 /******* Part 4: Keys ***********************************************/
1022 keys = sat_calloc(numkeys, sizeof(*keys));
1023 /* keys start at 1 */
1024 for (i = 1; i < numkeys; i++)
1026 id = read_id(&data, numid);
1030 id = str2id(pool, stringpool_id2str(spool, id), 1);
1031 type = read_id(&data, numid);
1035 type = str2id(pool, stringpool_id2str(spool, type), 1);
1036 if (type < REPOKEY_TYPE_VOID || type > REPOKEY_TYPE_DIRNUMNUMARRAY)
1038 pool_debug(pool, SAT_ERROR, "unsupported data type '%s'\n", id2str(pool, type));
1039 data.error = SOLV_ERROR_UNSUPPORTED;
1040 type = REPOKEY_TYPE_VOID;
1043 keys[i].type = type;
1044 keys[i].size = read_id(&data, keys[i].type == REPOKEY_TYPE_CONSTANTID ? numid + numrel : 0);
1045 keys[i].storage = read_id(&data, 0);
1046 if (id >= SOLVABLE_NAME && id <= RPM_RPMDBID)
1047 keys[i].storage = KEY_STORAGE_SOLVABLE;
1048 else if (keys[i].storage == KEY_STORAGE_SOLVABLE)
1049 keys[i].storage = KEY_STORAGE_INCORE;
1050 if (keys[i].type == REPOKEY_TYPE_CONSTANTID)
1053 keys[i].size = idmap[keys[i].size];
1055 keys[i].size = str2id(pool, stringpool_id2str(spool, keys[i].size), 1);
1058 fprintf(stderr, "key %d %s %s %d %d\n", i, id2str(pool,id), id2str(pool, keys[i].type),
1059 keys[i].size, keys[i].storage);
1063 have_xdata = parent ? 1 : 0;
1064 for (i = 1; i < numkeys; i++)
1065 if (keys[i].storage == KEY_STORAGE_INCORE || keys[i].storage == KEY_STORAGE_VERTICAL_OFFSET)
1069 data.nkeys = numkeys;
1071 /******* Part 5: Schemata ********************************************/
1073 id = read_id(&data, 0);
1074 schemadata = sat_calloc(id + 1, sizeof(Id));
1075 schemadatap = schemadata + 1;
1076 schemadataend = schemadatap + id;
1077 schemata = sat_calloc(numschemata, sizeof(Id));
1078 for (i = 1; i < numschemata; i++)
1080 schemata[i] = schemadatap - schemadata;
1081 schemadatap = read_idarray(&data, numid, 0, schemadatap, schemadataend);
1083 Id *sp = schemadata + schemata[i];
1084 fprintf (stderr, "schema %d:", i);
1086 fprintf (stderr, " %d", *sp);
1087 fprintf (stderr, "\n");
1090 data.schemata = schemata;
1091 data.nschemata = numschemata;
1092 data.schemadata = schemadata;
1093 data.schemadatalen = schemadataend - data.schemadata;
1096 /******* Part 6: Info ***********************************************/
1097 oldnrepodata = repo->nrepodata;
1100 id = read_id(&data, 0);
1101 id = read_id(&data, 0);
1103 for (i = 0; i < numinfo; i++)
1105 /* for now we're just interested in data that starts with
1106 * the repodata_external id
1109 id = read_id(&data, numschemata);
1110 keyp = schemadata + schemata[id];
1112 if (keys[key].name == REPODATA_EXTERNAL && keys[key].type == REPOKEY_TYPE_VOID)
1114 /* external data for some ids */
1115 parse_repodata(&data, keyp, keys, idmap, numid, numrel, repo);
1118 skip_schema(&data, keyp, keys, numid, numrel);
1122 /******* Part 7: item data *******************************************/
1124 /* calculate idarray size */
1126 for (i = 1; i < numkeys; i++)
1129 if ((keys[i].type == REPOKEY_TYPE_IDARRAY || keys[i].type == REPOKEY_TYPE_REL_IDARRAY)
1130 && id >= INTERESTED_START && id <= INTERESTED_END)
1131 size_idarray += keys[i].size;
1136 maxsize = read_id(&data, 0);
1137 allsize = read_id(&data, 0);
1138 if (maxsize > allsize)
1140 pool_debug(pool, SAT_ERROR, "maxsize %d is greater then allsize %d\n", maxsize, allsize);
1141 data.error = SOLV_ERROR_CORRUPT;
1145 maxsize = allsize = 0;
1147 /* allocate needed space in repo */
1148 /* we add maxsize because it is an upper limit for all idarrays */
1149 repo_reserve_ids(repo, 0, size_idarray + maxsize + 1);
1150 idarraydatap = repo->idarraydata + repo->idarraysize;
1151 repo->idarraysize += size_idarray;
1152 idarraydataend = idarraydatap + size_idarray;
1155 /* read solvables */
1159 s = pool_id2solvable(pool, parent->start);
1161 s = pool_id2solvable(pool, repo_add_solvable_block(repo, numsolv));
1162 /* store start and end of our id block */
1163 data.start = s - pool->solvables;
1164 data.end = data.start + numsolv;
1165 /* In case we have info blocks, make them refer to our part of the
1167 for (i = oldnrepodata; i < repo->nrepodata; i++)
1169 repo->repodata[i].start = data.start;
1170 repo->repodata[i].end = data.end;
1177 repodata_extend_block(&data, data.start, numsolv);
1180 buf = sat_calloc(maxsize + 4, 1);
1182 for (i = 0; i < numsolv; i++, s++)
1191 pool_debug(mypool, SAT_ERROR, "buffer overrun\n");
1192 data.error = SOLV_ERROR_EOF;
1196 memmove(buf, dp, left);
1200 if (l && fread(buf + left, l, 1, data.fp) != 1)
1202 pool_debug(mypool, SAT_ERROR, "unexpected EOF\n");
1203 data.error = SOLV_ERROR_EOF;
1210 dp = data_read_id_max(dp, &id, 0, numschemata, &data.error);
1213 data.incoreoffset[i] = data.incoredatalen;
1214 incore_add_id(&data, id);
1216 keyp = schemadata + schemata[id];
1217 while ((key = *keyp++) != 0)
1222 id = keys[key].name;
1224 fprintf(stderr, "solv %d name %d type %d class %d\n", i, id, keys[key].type, keys[key].storage);
1226 if (keys[key].storage == KEY_STORAGE_VERTICAL_OFFSET)
1228 /* copy offset/length into incore */
1230 dp = data_skip(dp, REPOKEY_TYPE_ID);
1231 dp = data_skip(dp, REPOKEY_TYPE_ID);
1232 incore_add_blob(&data, dps, dp - dps);
1235 switch (keys[key].type)
1237 case REPOKEY_TYPE_ID:
1238 dp = data_read_id_max(dp, &did, idmap, numid + numrel, &data.error);
1239 if (id == SOLVABLE_NAME)
1241 else if (id == SOLVABLE_ARCH)
1243 else if (id == SOLVABLE_EVR)
1245 else if (id == SOLVABLE_VENDOR)
1247 else if (keys[key].storage == KEY_STORAGE_INCORE)
1248 incore_add_id(&data, did);
1250 POOL_DEBUG(SAT_DEBUG_STATS, "%s -> %s\n", id2str(pool, id), id2str(pool, did));
1253 case REPOKEY_TYPE_U32:
1254 dp = data_read_u32(dp, &h);
1256 POOL_DEBUG(SAT_DEBUG_STATS, "%s -> %u\n", id2str(pool, id), h);
1258 if (id == RPM_RPMDBID)
1261 repo->rpmdbid = sat_calloc(numsolv, sizeof(Id));
1262 repo->rpmdbid[i] = h;
1264 else if (keys[key].storage == KEY_STORAGE_INCORE)
1265 incore_add_u32(&data, h);
1267 case REPOKEY_TYPE_IDARRAY:
1268 case REPOKEY_TYPE_REL_IDARRAY:
1269 if (id < INTERESTED_START || id > INTERESTED_END)
1272 dp = data_skip(dp, REPOKEY_TYPE_IDARRAY);
1273 if (keys[key].storage == KEY_STORAGE_INCORE && idmap)
1275 if (keys[key].storage == KEY_STORAGE_INCORE)
1276 incore_add_blob(&data, dps, dp - dps);
1279 ido = idarraydatap - repo->idarraydata;
1280 if (keys[key].type == REPOKEY_TYPE_IDARRAY)
1281 dp = data_read_idarray(dp, &idarraydatap, idmap, numid + numrel, &data.error);
1282 else if (id == SOLVABLE_REQUIRES)
1283 dp = data_read_rel_idarray(dp, &idarraydatap, idmap, numid + numrel, &data.error, SOLVABLE_PREREQMARKER);
1284 else if (id == SOLVABLE_PROVIDES)
1285 dp = data_read_rel_idarray(dp, &idarraydatap, idmap, numid + numrel, &data.error, SOLVABLE_FILEMARKER);
1287 dp = data_read_rel_idarray(dp, &idarraydatap, idmap, numid + numrel, &data.error, 0);
1288 if (idarraydatap > idarraydataend)
1290 pool_debug(pool, SAT_ERROR, "idarray overflow\n");
1291 data.error = SOLV_ERROR_OVERFLOW;
1294 if (id == SOLVABLE_PROVIDES)
1296 else if (id == SOLVABLE_OBSOLETES)
1298 else if (id == SOLVABLE_CONFLICTS)
1300 else if (id == SOLVABLE_REQUIRES)
1302 else if (id == SOLVABLE_RECOMMENDS)
1304 else if (id == SOLVABLE_SUPPLEMENTS)
1305 s->supplements = ido;
1306 else if (id == SOLVABLE_SUGGESTS)
1308 else if (id == SOLVABLE_ENHANCES)
1310 else if (id == SOLVABLE_FRESHENS)
1313 POOL_DEBUG(SAT_DEBUG_STATS, "%s ->\n", id2str(pool, id));
1314 for (; repo->idarraydata[ido]; ido++)
1315 POOL_DEBUG(SAT_DEBUG_STATS," %s\n", dep2str(pool, repo->idarraydata[ido]));
1320 dp = data_skip(dp, keys[key].type);
1321 if (keys[key].storage == KEY_STORAGE_INCORE)
1322 incore_add_blob(&data, dps, dp - dps);
1328 /* should shrink idarraydata again */
1335 pool_debug(mypool, SAT_ERROR, "buffer overrun\n");
1336 data.error = SOLV_ERROR_EOF;
1343 /* free solvables */
1344 repo_free_solvable_block(repo, data.start, data.end - data.start, 1);
1346 repo->idarraysize -= size_idarray;
1347 /* free incore data */
1348 data.incoredata = sat_free(data.incoredata);
1349 data.incoredatalen = data.incoredatafree = 0;
1352 if (data.incoredatafree)
1354 /* shrink excess size */
1355 data.incoredata = sat_realloc(data.incoredata, data.incoredatalen);
1356 data.incoredatafree = 0;
1359 for (i = 1; i < numkeys; i++)
1360 if (keys[i].storage == KEY_STORAGE_VERTICAL_OFFSET)
1362 if (i < numkeys && !data.error)
1365 unsigned int pagesize;
1367 /* we have vertical data, make it available */
1368 data.verticaloffset = sat_calloc(numkeys, sizeof(Id));
1369 for (i = 1; i < numkeys; i++)
1370 if (keys[i].storage == KEY_STORAGE_VERTICAL_OFFSET)
1372 data.verticaloffset[i] = fileoffset;
1373 fileoffset += keys[i].size;
1375 data.lastverticaloffset = fileoffset;
1376 pagesize = read_u32(&data);
1377 repodata_read_or_setup_pages(&data, pagesize, fileoffset);
1381 /* no longer needed */
1385 if (parent && !data.error)
1388 sat_free(parent->schemata);
1389 sat_free(parent->schemadata);
1390 sat_free(parent->keys);
1391 sat_free(parent->location);
1394 else if ((data.incoredatalen || data.fp) && !data.error)
1396 /* we got some data, make it available */
1397 repo->repodata = sat_realloc2(repo->repodata, repo->nrepodata + 1, sizeof(data));
1398 repo->repodata[repo->nrepodata++] = data;
1403 sat_free(data.dirpool.dirs);
1404 sat_free(data.incoreoffset);
1406 sat_free(schemadata);
1416 repo_add_solv(Repo *repo, FILE *fp)
1418 return repo_add_solv_parent(repo, fp, 0);
1422 repodata_load_solv(Repodata *data)
1425 Pool *pool = data->repo->pool;
1426 if (!pool->loadcallback)
1428 data->state = REPODATA_ERROR;
1431 fp = pool->loadcallback(pool, data, pool->loadcallbackdata);
1434 data->state = REPODATA_ERROR;
1437 if (repo_add_solv_parent(data->repo, fp, data))
1438 data->state = REPODATA_ERROR;
1440 data->state = REPODATA_AVAILABLE;