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_external_repodata(Repodata *maindata, Id *keyp, Repokey *keys, Id *idmap, unsigned numid, unsigned numrel)
470 Repo *repo = maindata->repo;
476 repo->repodata = sat_realloc2(repo->repodata, repo->nrepodata + 1, sizeof (*data));
477 data = repo->repodata + repo->nrepodata++;
478 memset(data, 0, sizeof(*data));
481 data->state = REPODATA_STUB;
482 data->loadcallback = repodata_load_solv;
484 while ((key = *keyp++) != 0)
487 switch (keys[key].type)
489 case REPOKEY_TYPE_IDARRAY:
490 if (id != REPODATA_KEYS)
492 skip_item(maindata, REPOKEY_TYPE_IDARRAY, numid, numrel);
495 /* read_idarray writes a terminating 0, that's why the + 1 */
496 ida = sat_calloc(keys[key].size + 1, sizeof(Id));
497 ide = read_idarray(maindata, numid, idmap, ida, ida + keys[key].size + 1);
501 pool_debug (mypool, SAT_ERROR, "invalid attribute data\n");
502 maindata->error = SOLV_ERROR_CORRUPT;
505 data->nkeys = 1 + (n >> 1);
506 data->keys = sat_malloc2(data->nkeys, sizeof(data->keys[0]));
507 memset(data->keys, 0, sizeof(Repokey));
508 for (i = 1, ide = ida; i < data->nkeys; i++)
510 data->keys[i].name = *ide++;
511 data->keys[i].type = *ide++;
512 data->keys[i].size = 0;
513 data->keys[i].storage = 0;
517 qsort(data->keys + 1, data->nkeys - 1, sizeof(data->keys[0]), key_cmp);
519 case REPOKEY_TYPE_STR:
520 if (id != REPODATA_LOCATION)
521 skip_item(maindata, REPOKEY_TYPE_STR, numid, numrel);
525 unsigned len = sizeof(buf);
526 char *filename = buf;
527 read_str(maindata, &filename, &len);
528 data->location = strdup(filename);
534 skip_item(maindata, keys[key].type, numid, numrel);
541 parse_info_repodata(Repodata *maindata, Id *keyp, Repokey *keys, Id *idmap, unsigned numid, unsigned numrel)
545 while ((key = *keyp++) != 0)
548 if (id == REPODATA_ADDEDFILEPROVIDES && keys[key].type == REPOKEY_TYPE_IDARRAY)
550 /* + 1 just in case */
551 ida = sat_calloc(keys[key].size + 1, sizeof(Id));
552 read_idarray(maindata, numid, idmap, ida, ida + keys[key].size + 1);
553 maindata->addedfileprovides = ida;
556 skip_item(maindata, keys[key].type, numid, numrel);
560 /*-----------------------------------------------------------------*/
564 skip_schema(Repodata *data, Id *keyp, Repokey *keys, unsigned int numid, unsigned int numrel)
567 while ((key = *keyp++) != 0)
568 skip_item(data, keys[key].type, numid, numrel);
571 /*-----------------------------------------------------------------*/
574 incore_add_id(Repodata *data, Id x)
577 /* make sure we have at least 5 bytes free */
578 if (data->incoredatafree < 5)
580 data->incoredata = sat_realloc(data->incoredata, data->incoredatalen + 1024);
581 data->incoredatafree = 1024;
583 dp = data->incoredata + data->incoredatalen;
589 *dp++ = (x >> 28) | 128;
591 *dp++ = (x >> 21) | 128;
592 *dp++ = (x >> 14) | 128;
595 *dp++ = (x >> 7) | 128;
597 data->incoredatafree -= dp - (data->incoredata + data->incoredatalen);
598 data->incoredatalen = dp - data->incoredata;
602 incore_add_blob(Repodata *data, unsigned char *buf, int len)
604 if (data->incoredatafree < len)
606 data->incoredata = sat_realloc(data->incoredata, data->incoredatalen + 1024 + len);
607 data->incoredatafree = 1024 + len;
609 memcpy(data->incoredata + data->incoredatalen, buf, len);
610 data->incoredatafree -= len;
611 data->incoredatalen += len;
615 incore_add_u32(Repodata *data, unsigned int x)
618 /* make sure we have at least 4 bytes free */
619 if (data->incoredatafree < 4)
621 data->incoredata = sat_realloc(data->incoredata, data->incoredatalen + 1024);
622 data->incoredatafree = 1024;
624 dp = data->incoredata + data->incoredatalen;
629 data->incoredatafree -= 4;
630 data->incoredatalen += 4;
635 incore_add_u8(Repodata *data, unsigned int x)
638 /* make sure we have at least 1 byte free */
639 if (data->incoredatafree < 1)
641 data->incoredata = sat_realloc(data->incoredata, data->incoredatalen + 1024);
642 data->incoredatafree = 1024;
644 dp = data->incoredata + data->incoredatalen;
646 data->incoredatafree--;
647 data->incoredatalen++;
653 // ----------------------------------------------
657 * read repo from .solv file
662 repo_add_solv_parent(Repo *repo, FILE *fp, Repodata *parent)
664 Pool *pool = repo->pool;
666 unsigned int numid, numrel, numdir, numsolv;
667 unsigned int numkeys, numschemata, numinfo;
670 Offset *str; /* map Id -> Offset into string space */
671 char *strsp; /* repo string space */
672 char *sp; /* pointer into string space */
673 Id *idmap; /* map of repo Ids to pool Ids */
675 unsigned int hashmask, h;
681 unsigned int size_idarray;
682 Id *idarraydatap, *idarraydataend;
685 unsigned int solvflags;
686 unsigned int solvversion;
688 Id *schemadata, *schemadatap, *schemadataend;
691 unsigned oldnrepodata;
692 int maxsize, allsize;
693 unsigned char *buf, *dp, *dps;
696 struct _Stringpool *spool;
700 memset(&data, 0, sizeof(data));
707 if (read_u32(&data) != ('S' << 24 | 'O' << 16 | 'L' << 8 | 'V'))
709 pool_debug(pool, SAT_ERROR, "not a SOLV file\n");
710 return SOLV_ERROR_NOT_SOLV;
712 solvversion = read_u32(&data);
718 pool_debug(pool, SAT_ERROR, "unsupported SOLV version\n");
719 return SOLV_ERROR_UNSUPPORTED;
722 pool_freeidhashes(pool);
724 numid = read_u32(&data);
725 numrel = read_u32(&data);
726 numdir = read_u32(&data);
727 numsolv = read_u32(&data);
728 numkeys = read_u32(&data);
729 numschemata = read_u32(&data);
730 numinfo = read_u32(&data);
731 solvflags = read_u32(&data);
733 if (numdir && numdir < 2)
735 pool_debug(pool, SAT_ERROR, "bad number of dirs\n");
736 return SOLV_ERROR_CORRUPT;
743 pool_debug(pool, SAT_ERROR, "relations are forbidden in a store\n");
744 return SOLV_ERROR_CORRUPT;
746 if (parent->end - parent->start != numsolv)
748 pool_debug(pool, SAT_ERROR, "unequal number of solvables in a store\n");
749 return SOLV_ERROR_CORRUPT;
753 pool_debug(pool, SAT_ERROR, "info blocks are forbidden in a store\n");
754 return SOLV_ERROR_CORRUPT;
758 /******* Part 1: string IDs *****************************************/
760 sizeid = read_u32(&data); /* size of string+Id space */
763 * read strings and Ids
778 spool->stringspace = sat_malloc(7);
779 strcpy(spool->stringspace, "<NULL>");
784 /* alloc string buffer */
785 spool->stringspace = sat_realloc(spool->stringspace, spool->sstrings + sizeid + 1);
786 /* alloc string offsets (Id -> Offset into string space) */
787 spool->strings = sat_realloc2(spool->strings, spool->nstrings + numid, sizeof(Offset));
789 strsp = spool->stringspace;
790 str = spool->strings; /* array of offsets into strsp, indexed by Id */
792 /* point to _BEHIND_ already allocated string/Id space */
793 strsp += spool->sstrings;
797 * read new repo at end of pool
800 if ((solvflags & SOLV_FLAG_PREFIX_POOL) == 0)
802 if (sizeid && fread(strsp, sizeid, 1, fp) != 1)
804 pool_debug(pool, SAT_ERROR, "read error while reading strings\n");
805 return SOLV_ERROR_EOF;
810 unsigned int pfsize = read_u32(&data);
811 char *prefix = sat_malloc(pfsize);
817 if (pfsize && fread(prefix, pfsize, 1, fp) != 1)
819 pool_debug(pool, SAT_ERROR, "read error while reading strings\n");
821 return SOLV_ERROR_EOF;
823 for (i = 1; i < numid; i++)
825 int same = (unsigned char)*pp++;
826 size_t len = strlen(pp) + 1;
827 freesp -= same + len;
830 pool_debug(pool, SAT_ERROR, "overflow while expanding strings\n");
832 return SOLV_ERROR_OVERFLOW;
835 memcpy(dest, old_str, same);
836 memcpy(dest + same, pp, len);
844 pool_debug(pool, SAT_ERROR, "expanding strings size mismatch\n");
845 return SOLV_ERROR_CORRUPT;
848 strsp[sizeid] = 0; /* make string space \0 terminated */
853 /* no shared pool, thus no idmap and no unification */
855 spool->nstrings = numid;
859 /* we need the '' for directories */
860 pool_debug(pool, SAT_ERROR, "store strings don't start with ''\n");
861 return SOLV_ERROR_CORRUPT;
863 for (i = 1; i < spool->nstrings; i++)
865 if (sp >= strsp + sizeid)
867 pool_debug(pool, SAT_ERROR, "not enough strings\n");
868 return SOLV_ERROR_OVERFLOW;
870 str[i] = sp - spool->stringspace;
871 sp += strlen(sp) + 1;
873 spool->sstrings = sp - spool->stringspace;
878 /* alloc id map for name and rel Ids. this maps ids in the solv files
879 * to the ids in our pool */
880 idmap = sat_calloc(numid + numrel, sizeof(Id));
883 * build hashes for all read strings
887 hashmask = mkmask(spool->nstrings + numid);
890 POOL_DEBUG(SAT_DEBUG_STATS, "read %d strings\n", numid);
891 POOL_DEBUG(SAT_DEBUG_STATS, "string hash buckets: %d\n", hashmask + 1);
895 * create hashtable with strings already in pool
898 hashtbl = sat_calloc(hashmask + 1, sizeof(Id));
899 for (i = 1; i < spool->nstrings; i++) /* leave out our dummy zero id */
901 h = strhash(spool->stringspace + spool->strings[i]) & hashmask;
902 hh = HASHCHAIN_START;
904 h = HASHCHAIN_NEXT(h, hh, hashmask);
909 * run over string space, calculate offsets
911 * build id map (maps solv Id -> pool Id)
914 for (i = 1; i < numid; i++)
916 if (sp >= strsp + sizeid)
920 pool_debug(pool, SAT_ERROR, "not enough strings %d %d\n", i, numid);
921 return SOLV_ERROR_OVERFLOW;
923 if (!*sp) /* empty string */
931 h = strhash(sp) & hashmask;
932 hh = HASHCHAIN_START;
938 if (!strcmp(spool->stringspace + spool->strings[id], sp))
939 break; /* existing string */
940 h = HASHCHAIN_NEXT(h, hh, hashmask);
943 /* length == offset to next string */
945 if (id == ID_NULL) /* end of hash chain -> new string */
947 id = spool->nstrings++;
949 str[id] = spool->sstrings; /* save Offset */
950 if (sp != spool->stringspace + spool->sstrings) /* not at end-of-buffer */
951 memmove(spool->stringspace + spool->sstrings, sp, l); /* append to pool buffer */
952 spool->sstrings += l;
954 idmap[i] = id; /* repo relative -> pool relative */
955 sp += l; /* next string */
959 pool_shrink_strings(pool); /* vacuum */
962 /******* Part 2: Relation IDs ***************************************/
972 pool->rels = sat_realloc2(pool->rels, pool->nrels + numrel, sizeof(Reldep));
975 hashmask = mkmask(pool->nrels + numrel);
977 POOL_DEBUG(SAT_DEBUG_STATS, "read %d rels\n", numrel);
978 POOL_DEBUG(SAT_DEBUG_STATS, "rel hash buckets: %d\n", hashmask + 1);
981 * prep hash table with already existing RelDeps
984 hashtbl = sat_calloc(hashmask + 1, sizeof(Id));
985 for (i = 1; i < pool->nrels; i++)
987 h = relhash(ran[i].name, ran[i].evr, ran[i].flags) & hashmask;
988 hh = HASHCHAIN_START;
990 h = HASHCHAIN_NEXT(h, hh, hashmask);
995 * read RelDeps from repo
998 for (i = 0; i < numrel; i++)
1000 name = read_id(&data, i + numid); /* read (repo relative) Ids */
1001 evr = read_id(&data, i + numid);
1002 flags = read_u8(&data);
1003 name = idmap[name]; /* map to (pool relative) Ids */
1005 h = relhash(name, evr, flags) & hashmask;
1006 hh = HASHCHAIN_START;
1010 if (id == ID_NULL) /* end of hash chain */
1012 if (ran[id].name == name && ran[id].evr == evr && ran[id].flags == flags)
1014 h = HASHCHAIN_NEXT(h, hh, hashmask);
1016 if (id == ID_NULL) /* new RelDep */
1020 ran[id].name = name;
1022 ran[id].flags = flags;
1024 idmap[i + numid] = MAKERELDEP(id); /* fill Id map */
1027 pool_shrink_rels(pool); /* vacuum */
1031 /******* Part 3: Dirs ***********************************************/
1034 data.dirpool.dirs = sat_malloc2(numdir, sizeof(Id));
1035 data.dirpool.ndirs = numdir;
1036 data.dirpool.dirs[0] = 0; /* dir 0: virtual root */
1037 data.dirpool.dirs[1] = 1; /* dir 1: / */
1038 for (i = 2; i < numdir; i++)
1040 id = read_id(&data, i + numid);
1042 data.dirpool.dirs[i] = -(id - numid);
1044 data.dirpool.dirs[i] = idmap[id];
1046 data.dirpool.dirs[i] = id;
1050 /******* Part 4: Keys ***********************************************/
1052 keys = sat_calloc(numkeys, sizeof(*keys));
1053 /* keys start at 1 */
1054 for (i = 1; i < numkeys; i++)
1056 id = read_id(&data, numid);
1060 id = str2id(pool, stringpool_id2str(spool, id), 1);
1061 type = read_id(&data, numid);
1065 type = str2id(pool, stringpool_id2str(spool, type), 1);
1066 if (type < REPOKEY_TYPE_VOID || type > REPOKEY_TYPE_DIRNUMNUMARRAY)
1068 pool_debug(pool, SAT_ERROR, "unsupported data type '%s'\n", id2str(pool, type));
1069 data.error = SOLV_ERROR_UNSUPPORTED;
1070 type = REPOKEY_TYPE_VOID;
1073 keys[i].type = type;
1074 keys[i].size = read_id(&data, keys[i].type == REPOKEY_TYPE_CONSTANTID ? numid + numrel : 0);
1075 keys[i].storage = read_id(&data, 0);
1076 if (id >= SOLVABLE_NAME && id <= RPM_RPMDBID)
1077 keys[i].storage = KEY_STORAGE_SOLVABLE;
1078 else if (keys[i].storage == KEY_STORAGE_SOLVABLE)
1079 keys[i].storage = KEY_STORAGE_INCORE;
1080 if (keys[i].type == REPOKEY_TYPE_CONSTANTID)
1083 keys[i].size = idmap[keys[i].size];
1085 keys[i].size = str2id(pool, stringpool_id2str(spool, keys[i].size), 1);
1088 fprintf(stderr, "key %d %s %s %d %d\n", i, id2str(pool,id), id2str(pool, keys[i].type),
1089 keys[i].size, keys[i].storage);
1093 have_xdata = parent ? 1 : 0;
1094 for (i = 1; i < numkeys; i++)
1095 if (keys[i].storage == KEY_STORAGE_INCORE || keys[i].storage == KEY_STORAGE_VERTICAL_OFFSET)
1099 data.nkeys = numkeys;
1101 /******* Part 5: Schemata ********************************************/
1103 id = read_id(&data, 0);
1104 schemadata = sat_calloc(id + 1, sizeof(Id));
1105 schemadatap = schemadata + 1;
1106 schemadataend = schemadatap + id;
1107 schemata = sat_calloc(numschemata, sizeof(Id));
1108 for (i = 1; i < numschemata; i++)
1110 schemata[i] = schemadatap - schemadata;
1111 schemadatap = read_idarray(&data, numid, 0, schemadatap, schemadataend);
1113 Id *sp = schemadata + schemata[i];
1114 fprintf (stderr, "schema %d:", i);
1116 fprintf (stderr, " %d", *sp);
1117 fprintf (stderr, "\n");
1120 data.schemata = schemata;
1121 data.nschemata = numschemata;
1122 data.schemadata = schemadata;
1123 data.schemadatalen = schemadataend - data.schemadata;
1126 /******* Part 6: Info ***********************************************/
1127 oldnrepodata = repo->nrepodata;
1130 id = read_id(&data, 0);
1131 id = read_id(&data, 0);
1133 for (i = 0; i < numinfo; i++)
1135 /* for now we're just interested in data that starts with
1136 * the repodata_external id
1139 id = read_id(&data, numschemata);
1140 keyp = schemadata + schemata[id];
1142 if (keys[key].name == REPODATA_EXTERNAL && keys[key].type == REPOKEY_TYPE_VOID)
1144 /* external data for some ids */
1145 parse_external_repodata(&data, keyp, keys, idmap, numid, numrel);
1147 else if (keys[key].name == REPODATA_INFO)
1149 parse_info_repodata(&data, keyp, keys, idmap, numid, numrel);
1153 skip_schema(&data, keyp, keys, numid, numrel);
1158 /******* Part 7: item data *******************************************/
1160 /* calculate idarray size */
1162 for (i = 1; i < numkeys; i++)
1165 if ((keys[i].type == REPOKEY_TYPE_IDARRAY || keys[i].type == REPOKEY_TYPE_REL_IDARRAY)
1166 && id >= INTERESTED_START && id <= INTERESTED_END)
1167 size_idarray += keys[i].size;
1172 maxsize = read_id(&data, 0);
1173 allsize = read_id(&data, 0);
1174 if (maxsize > allsize)
1176 pool_debug(pool, SAT_ERROR, "maxsize %d is greater then allsize %d\n", maxsize, allsize);
1177 data.error = SOLV_ERROR_CORRUPT;
1181 maxsize = allsize = 0;
1183 /* allocate needed space in repo */
1184 /* we add maxsize because it is an upper limit for all idarrays */
1185 repo_reserve_ids(repo, 0, size_idarray + maxsize + 1);
1186 idarraydatap = repo->idarraydata + repo->idarraysize;
1187 repo->idarraysize += size_idarray;
1188 idarraydataend = idarraydatap + size_idarray;
1191 /* read solvables */
1195 s = pool_id2solvable(pool, parent->start);
1197 s = pool_id2solvable(pool, repo_add_solvable_block(repo, numsolv));
1198 /* store start and end of our id block */
1199 data.start = s - pool->solvables;
1200 data.end = data.start + numsolv;
1201 /* In case we have info blocks, make them refer to our part of the
1203 for (i = oldnrepodata; i < repo->nrepodata; i++)
1205 repo->repodata[i].start = data.start;
1206 repo->repodata[i].end = data.end;
1214 /* reserve one byte so that all offsets are not zero */
1215 incore_add_id(&data, 0);
1216 repodata_extend_block(&data, data.start, numsolv);
1220 buf = sat_calloc(maxsize + 4, 1);
1222 for (i = 0; i < numsolv; i++, s++)
1231 pool_debug(mypool, SAT_ERROR, "buffer overrun\n");
1232 data.error = SOLV_ERROR_EOF;
1236 memmove(buf, dp, left);
1240 if (l && fread(buf + left, l, 1, data.fp) != 1)
1242 pool_debug(mypool, SAT_ERROR, "unexpected EOF\n");
1243 data.error = SOLV_ERROR_EOF;
1250 dp = data_read_id_max(dp, &id, 0, numschemata, &data.error);
1253 data.incoreoffset[i] = data.incoredatalen;
1254 incore_add_id(&data, id);
1256 keyp = schemadata + schemata[id];
1257 while ((key = *keyp++) != 0)
1262 id = keys[key].name;
1264 fprintf(stderr, "solv %d name %d type %d class %d\n", i, id, keys[key].type, keys[key].storage);
1266 if (keys[key].storage == KEY_STORAGE_VERTICAL_OFFSET)
1268 /* copy offset/length into incore */
1270 dp = data_skip(dp, REPOKEY_TYPE_ID);
1271 dp = data_skip(dp, REPOKEY_TYPE_ID);
1272 incore_add_blob(&data, dps, dp - dps);
1275 switch (keys[key].type)
1277 case REPOKEY_TYPE_ID:
1278 dp = data_read_id_max(dp, &did, idmap, numid + numrel, &data.error);
1279 if (id == SOLVABLE_NAME)
1281 else if (id == SOLVABLE_ARCH)
1283 else if (id == SOLVABLE_EVR)
1285 else if (id == SOLVABLE_VENDOR)
1287 else if (keys[key].storage == KEY_STORAGE_INCORE)
1288 incore_add_id(&data, did);
1290 POOL_DEBUG(SAT_DEBUG_STATS, "%s -> %s\n", id2str(pool, id), id2str(pool, did));
1293 case REPOKEY_TYPE_U32:
1294 dp = data_read_u32(dp, &h);
1296 POOL_DEBUG(SAT_DEBUG_STATS, "%s -> %u\n", id2str(pool, id), h);
1298 if (id == RPM_RPMDBID)
1301 repo->rpmdbid = sat_calloc(numsolv, sizeof(Id));
1302 repo->rpmdbid[i] = h;
1304 else if (keys[key].storage == KEY_STORAGE_INCORE)
1305 incore_add_u32(&data, h);
1307 case REPOKEY_TYPE_IDARRAY:
1308 case REPOKEY_TYPE_REL_IDARRAY:
1309 if (id < INTERESTED_START || id > INTERESTED_END)
1312 dp = data_skip(dp, REPOKEY_TYPE_IDARRAY);
1313 if (keys[key].storage == KEY_STORAGE_INCORE && idmap)
1315 if (keys[key].storage == KEY_STORAGE_INCORE)
1316 incore_add_blob(&data, dps, dp - dps);
1319 ido = idarraydatap - repo->idarraydata;
1320 if (keys[key].type == REPOKEY_TYPE_IDARRAY)
1321 dp = data_read_idarray(dp, &idarraydatap, idmap, numid + numrel, &data.error);
1322 else if (id == SOLVABLE_REQUIRES)
1323 dp = data_read_rel_idarray(dp, &idarraydatap, idmap, numid + numrel, &data.error, SOLVABLE_PREREQMARKER);
1324 else if (id == SOLVABLE_PROVIDES)
1325 dp = data_read_rel_idarray(dp, &idarraydatap, idmap, numid + numrel, &data.error, SOLVABLE_FILEMARKER);
1327 dp = data_read_rel_idarray(dp, &idarraydatap, idmap, numid + numrel, &data.error, 0);
1328 if (idarraydatap > idarraydataend)
1330 pool_debug(pool, SAT_ERROR, "idarray overflow\n");
1331 data.error = SOLV_ERROR_OVERFLOW;
1334 if (id == SOLVABLE_PROVIDES)
1336 else if (id == SOLVABLE_OBSOLETES)
1338 else if (id == SOLVABLE_CONFLICTS)
1340 else if (id == SOLVABLE_REQUIRES)
1342 else if (id == SOLVABLE_RECOMMENDS)
1344 else if (id == SOLVABLE_SUPPLEMENTS)
1345 s->supplements = ido;
1346 else if (id == SOLVABLE_SUGGESTS)
1348 else if (id == SOLVABLE_ENHANCES)
1350 else if (id == SOLVABLE_FRESHENS)
1353 POOL_DEBUG(SAT_DEBUG_STATS, "%s ->\n", id2str(pool, id));
1354 for (; repo->idarraydata[ido]; ido++)
1355 POOL_DEBUG(SAT_DEBUG_STATS," %s\n", dep2str(pool, repo->idarraydata[ido]));
1360 dp = data_skip(dp, keys[key].type);
1361 if (keys[key].storage == KEY_STORAGE_INCORE)
1362 incore_add_blob(&data, dps, dp - dps);
1368 /* should shrink idarraydata again */
1375 pool_debug(mypool, SAT_ERROR, "buffer overrun\n");
1376 data.error = SOLV_ERROR_EOF;
1383 /* free solvables */
1384 repo_free_solvable_block(repo, data.start, data.end - data.start, 1);
1386 repo->idarraysize -= size_idarray;
1387 /* free incore data */
1388 data.incoredata = sat_free(data.incoredata);
1389 data.incoredatalen = data.incoredatafree = 0;
1392 if (data.incoredatafree)
1394 /* shrink excess size */
1395 data.incoredata = sat_realloc(data.incoredata, data.incoredatalen);
1396 data.incoredatafree = 0;
1399 for (i = 1; i < numkeys; i++)
1400 if (keys[i].storage == KEY_STORAGE_VERTICAL_OFFSET)
1402 if (i < numkeys && !data.error)
1405 unsigned int pagesize;
1407 /* we have vertical data, make it available */
1408 data.verticaloffset = sat_calloc(numkeys, sizeof(Id));
1409 for (i = 1; i < numkeys; i++)
1410 if (keys[i].storage == KEY_STORAGE_VERTICAL_OFFSET)
1412 data.verticaloffset[i] = fileoffset;
1413 fileoffset += keys[i].size;
1415 data.lastverticaloffset = fileoffset;
1416 pagesize = read_u32(&data);
1417 repodata_read_or_setup_pages(&data, pagesize, fileoffset);
1421 /* no longer needed */
1425 if (parent && !data.error)
1428 sat_free(parent->schemata);
1429 sat_free(parent->schemadata);
1430 sat_free(parent->keys);
1431 sat_free(parent->location);
1434 else if ((data.incoredatalen || data.fp) && !data.error)
1436 /* we got some data, make it available */
1437 repo->repodata = sat_realloc2(repo->repodata, repo->nrepodata + 1, sizeof(data));
1438 repo->repodata[repo->nrepodata++] = data;
1443 sat_free(data.dirpool.dirs);
1444 sat_free(data.incoreoffset);
1446 sat_free(schemadata);
1456 repo_add_solv(Repo *repo, FILE *fp)
1458 return repo_add_solv_parent(repo, fp, 0);
1462 repodata_load_solv(Repodata *data)
1465 Pool *pool = data->repo->pool;
1466 if (!pool->loadcallback)
1468 data->state = REPODATA_ERROR;
1471 fp = pool->loadcallback(pool, data, pool->loadcallbackdata);
1474 data->state = REPODATA_ERROR;
1477 if (repo_add_solv_parent(data->repo, fp, data))
1478 data->state = REPODATA_ERROR;
1480 data->state = REPODATA_AVAILABLE;