2 * Copyright (c) 2018, SUSE LLC.
4 * This program is licensed under the BSD license, read LICENSE.BSD
5 * for further information
11 * Manage data coming from one repository
13 * a repository can contain multiple repodata entries, consisting of
14 * different sets of keys and different sets of solvables
29 #include "poolid_private.h"
37 #define REPODATA_BLOCK 255
39 static unsigned char *data_skip_key(Repodata *data, unsigned char *dp, Repokey *key);
42 repodata_initdata(Repodata *data, Repo *repo, int localpool)
44 memset(data, 0, sizeof (*data));
45 data->repodataid = data - repo->repodata;
47 data->localpool = localpool;
49 stringpool_init_empty(&data->spool);
50 /* dirpool_init(&data->dirpool); just zeros out again */
51 data->keys = solv_calloc(1, sizeof(Repokey));
53 data->schemata = solv_calloc(1, sizeof(Id));
54 data->schemadata = solv_calloc(1, sizeof(Id));
56 data->schemadatalen = 1;
57 repopagestore_init(&data->store);
61 repodata_freedata(Repodata *data)
65 solv_free(data->keys);
67 solv_free(data->schemata);
68 solv_free(data->schemadata);
69 solv_free(data->schematahash);
71 stringpool_free(&data->spool);
72 dirpool_free(&data->dirpool);
74 solv_free(data->mainschemaoffsets);
75 solv_free(data->incoredata);
76 solv_free(data->incoreoffset);
77 solv_free(data->verticaloffset);
79 repopagestore_free(&data->store);
81 solv_free(data->vincore);
84 for (i = 0; i < data->end - data->start; i++)
85 solv_free(data->attrs[i]);
86 solv_free(data->attrs);
88 for (i = 0; i < data->nxattrs; i++)
89 solv_free(data->xattrs[i]);
90 solv_free(data->xattrs);
92 solv_free(data->attrdata);
93 solv_free(data->attriddata);
94 solv_free(data->attrnum64data);
96 solv_free(data->dircache);
98 repodata_free_filelistfilter(data);
102 repodata_free(Repodata *data)
104 Repo *repo = data->repo;
105 int i = data - repo->repodata;
108 repodata_freedata(data);
109 if (i < repo->nrepodata - 1)
111 /* whoa! this changes the repodataids! */
112 memmove(repo->repodata + i, repo->repodata + i + 1, (repo->nrepodata - 1 - i) * sizeof(Repodata));
113 for (; i < repo->nrepodata - 1; i++)
114 repo->repodata[i].repodataid = i;
117 if (repo->nrepodata == 1)
119 repo->repodata = solv_free(repo->repodata);
125 repodata_empty(Repodata *data, int localpool)
127 void (*loadcallback)(Repodata *) = data->loadcallback;
128 int state = data->state;
129 repodata_freedata(data);
130 repodata_initdata(data, data->repo, localpool);
132 data->loadcallback = loadcallback;
136 /***************************************************************
137 * key pool management
140 /* this is not so time critical that we need a hash, so we do a simple
143 repodata_key2id(Repodata *data, Repokey *key, int create)
147 for (keyid = 1; keyid < data->nkeys; keyid++)
148 if (data->keys[keyid].name == key->name && data->keys[keyid].type == key->type)
150 if ((key->type == REPOKEY_TYPE_CONSTANT || key->type == REPOKEY_TYPE_CONSTANTID) && key->size != data->keys[keyid].size)
154 if (keyid == data->nkeys)
158 /* allocate new key */
159 data->keys = solv_realloc2(data->keys, data->nkeys + 1, sizeof(Repokey));
160 data->keys[data->nkeys++] = *key;
161 if (data->verticaloffset)
163 data->verticaloffset = solv_realloc2(data->verticaloffset, data->nkeys, sizeof(Id));
164 data->verticaloffset[data->nkeys - 1] = 0;
166 data->keybits[(key->name >> 3) & (sizeof(data->keybits) - 1)] |= 1 << (key->name & 7);
172 /***************************************************************
173 * schema pool management
176 #define SCHEMATA_BLOCK 31
177 #define SCHEMATADATA_BLOCK 255
180 repodata_schema2id(Repodata *data, Id *schema, int create)
187 return 0; /* XXX: allow empty schema? */
188 if ((schematahash = data->schematahash) == 0)
190 data->schematahash = schematahash = solv_calloc(256, sizeof(Id));
191 for (i = 1; i < data->nschemata; i++)
193 for (sp = data->schemadata + data->schemata[i], h = 0; *sp;)
198 data->schemadata = solv_extend_resize(data->schemadata, data->schemadatalen, sizeof(Id), SCHEMATADATA_BLOCK);
199 data->schemata = solv_extend_resize(data->schemata, data->nschemata, sizeof(Id), SCHEMATA_BLOCK);
202 for (sp = schema, len = 0, h = 0; *sp; len++)
207 cid = schematahash[h];
210 if (!memcmp(data->schemadata + data->schemata[cid], schema, len * sizeof(Id)))
212 /* cache conflict, do a slow search */
213 for (cid = 1; cid < data->nschemata; cid++)
214 if (!memcmp(data->schemadata + data->schemata[cid], schema, len * sizeof(Id)))
220 data->schemadata = solv_extend(data->schemadata, data->schemadatalen, len, sizeof(Id), SCHEMATADATA_BLOCK);
221 data->schemata = solv_extend(data->schemata, data->nschemata, 1, sizeof(Id), SCHEMATA_BLOCK);
223 memcpy(data->schemadata + data->schemadatalen, schema, len * sizeof(Id));
224 data->schemata[data->nschemata] = data->schemadatalen;
225 data->schemadatalen += len;
226 schematahash[h] = data->nschemata;
228 fprintf(stderr, "schema2id: new schema\n");
230 return data->nschemata++;
234 repodata_free_schemahash(Repodata *data)
236 data->schematahash = solv_free(data->schematahash);
238 data->schemata = solv_realloc2(data->schemata, data->nschemata, sizeof(Id));
239 data->schemadata = solv_realloc2(data->schemadata, data->schemadatalen, sizeof(Id));
243 /***************************************************************
244 * dir pool management
247 #ifndef HAVE_STRCHRNUL
248 static inline const char *strchrnul(const char *str, char x)
250 const char *p = strchr(str, x);
251 return p ? p : str + strlen(str);
255 #define DIRCACHE_SIZE 41 /* < 1k */
259 Id ids[DIRCACHE_SIZE];
260 char str[(DIRCACHE_SIZE * (DIRCACHE_SIZE - 1)) / 2];
265 repodata_str2dir(Repodata *data, const char *dir, int create)
274 return data->dirpool.ndirs ? 0 : dirpool_add_dir(&data->dirpool, 0, 0, create);
275 while (*dir == '/' && dir[1] == '/')
277 if (*dir == '/' && !dir[1])
278 return data->dirpool.ndirs ? 1 : dirpool_add_dir(&data->dirpool, 0, 1, create);
285 struct dircache *dircache = data->dircache;
289 if (l < DIRCACHE_SIZE && dircache->ids[l] && !memcmp(dircache->str + l * (l - 1) / 2, dir, l))
291 parent = dircache->ids[l];
307 dire = strchrnul(dir, '/');
309 id = stringpool_strn2id(&data->spool, dir, dire - dir, create);
311 id = pool_strn2id(data->repo->pool, dir, dire - dir, create);
314 parent = dirpool_add_dir(&data->dirpool, parent, id, create);
319 data->dircache = solv_calloc(1, sizeof(struct dircache));
323 if (l < DIRCACHE_SIZE)
325 data->dircache->ids[l] = parent;
326 memcpy(data->dircache->str + l * (l - 1) / 2, dirs, l);
340 repodata_free_dircache(Repodata *data)
342 data->dircache = solv_free(data->dircache);
346 repodata_dir2str(Repodata *data, Id did, const char *suf)
348 Pool *pool = data->repo->pool;
355 return suf ? suf : "";
356 if (did == 1 && !suf)
361 comp = dirpool_compid(&data->dirpool, parent);
362 comps = stringpool_id2str(data->localpool ? &data->spool : &pool->ss, comp);
364 parent = dirpool_parent(&data->dirpool, parent);
369 l += strlen(suf) + 1;
370 p = pool_alloctmpspace(pool, l + 1) + l;
381 comp = dirpool_compid(&data->dirpool, parent);
382 comps = stringpool_id2str(data->localpool ? &data->spool : &pool->ss, comp);
385 strncpy(p, comps, l);
386 parent = dirpool_parent(&data->dirpool, parent);
394 /***************************************************************
398 static inline unsigned char *
399 data_skip_schema(Repodata *data, unsigned char *dp, Id schema)
401 Id *keyp = data->schemadata + data->schemata[schema];
402 for (; *keyp; keyp++)
403 dp = data_skip_key(data, dp, data->keys + *keyp);
407 static unsigned char *
408 data_skip_key(Repodata *data, unsigned char *dp, Repokey *key)
410 int nentries, schema;
413 case REPOKEY_TYPE_FIXARRAY:
414 dp = data_read_id(dp, &nentries);
417 dp = data_read_id(dp, &schema);
419 dp = data_skip_schema(data, dp, schema);
421 case REPOKEY_TYPE_FLEXARRAY:
422 dp = data_read_id(dp, &nentries);
425 dp = data_read_id(dp, &schema);
426 dp = data_skip_schema(data, dp, schema);
430 if (key->storage == KEY_STORAGE_INCORE)
431 dp = data_skip(dp, key->type);
432 else if (key->storage == KEY_STORAGE_VERTICAL_OFFSET)
434 dp = data_skip(dp, REPOKEY_TYPE_ID);
435 dp = data_skip(dp, REPOKEY_TYPE_ID);
441 static unsigned char *
442 forward_to_key(Repodata *data, Id keyid, Id *keyp, unsigned char *dp)
448 if (data->mainschemaoffsets && dp == data->incoredata + data->mainschemaoffsets[0] && keyp == data->schemadata + data->schemata[data->mainschema])
451 for (i = 0; (k = *keyp++) != 0; i++)
453 return data->incoredata + data->mainschemaoffsets[i];
456 while ((k = *keyp++) != 0)
460 if (data->keys[k].storage == KEY_STORAGE_VERTICAL_OFFSET)
462 dp = data_skip(dp, REPOKEY_TYPE_ID); /* skip offset */
463 dp = data_skip(dp, REPOKEY_TYPE_ID); /* skip length */
466 if (data->keys[k].storage != KEY_STORAGE_INCORE)
468 dp = data_skip_key(data, dp, data->keys + k);
473 static unsigned char *
474 get_vertical_data(Repodata *data, Repokey *key, Id off, Id len)
479 if (off >= data->lastverticaloffset)
481 off -= data->lastverticaloffset;
482 if ((unsigned int)off + len > data->vincorelen)
484 return data->vincore + off;
486 if ((unsigned int)off + len > key->size)
488 /* we now have the offset, go into vertical */
489 off += data->verticaloffset[key - data->keys];
490 /* fprintf(stderr, "key %d page %d\n", key->name, off / REPOPAGE_BLOBSIZE); */
491 dp = repopagestore_load_page_range(&data->store, off / REPOPAGE_BLOBSIZE, (off + len - 1) / REPOPAGE_BLOBSIZE);
494 dp += off % REPOPAGE_BLOBSIZE;
498 static inline unsigned char *
499 get_data(Repodata *data, Repokey *key, unsigned char **dpp, int advance)
501 unsigned char *dp = *dpp;
505 if (key->storage == KEY_STORAGE_INCORE)
508 *dpp = data_skip_key(data, dp, key);
511 else if (key->storage == KEY_STORAGE_VERTICAL_OFFSET)
514 dp = data_read_id(dp, &off);
515 dp = data_read_id(dp, &len);
518 return get_vertical_data(data, key, off, len);
524 repodata_load(Repodata *data)
526 if (data->state != REPODATA_STUB)
528 if (data->loadcallback)
529 data->loadcallback(data);
531 data->state = REPODATA_ERROR;
535 maybe_load_repodata_stub(Repodata *data, Id keyname)
537 if (data->state != REPODATA_STUB)
539 data->state = REPODATA_ERROR;
545 for (i = 1; i < data->nkeys; i++)
546 if (keyname == data->keys[i].name)
548 if (i == data->nkeys)
552 return data->state == REPODATA_AVAILABLE ? 1 : 0;
556 maybe_load_repodata(Repodata *data, Id keyname)
558 if (keyname && !repodata_precheck_keyname(data, keyname))
559 return 0; /* do not bother... */
560 if (data->state == REPODATA_AVAILABLE || data->state == REPODATA_LOADING)
562 if (data->state == REPODATA_ERROR)
564 return maybe_load_repodata_stub(data, keyname);
567 static inline unsigned char *
568 solvid2data(Repodata *data, Id solvid, Id *schemap)
570 unsigned char *dp = data->incoredata;
573 if (solvid == SOLVID_META)
574 dp += 1; /* offset of "meta" solvable */
575 else if (solvid == SOLVID_POS)
577 Pool *pool = data->repo->pool;
578 if (data->repo != pool->pos.repo)
580 if (data != data->repo->repodata + pool->pos.repodataid)
583 if (pool->pos.dp != 1)
585 *schemap = pool->pos.schema;
591 if (solvid < data->start || solvid >= data->end)
593 dp += data->incoreoffset[solvid - data->start];
595 return data_read_id(dp, schemap);
598 /************************************************************************
602 static unsigned char *
603 find_key_data(Repodata *data, Id solvid, Id keyname, Repokey **keypp)
606 Id schema, *keyp, *kp;
609 if (!maybe_load_repodata(data, keyname))
611 dp = solvid2data(data, solvid, &schema);
614 keyp = data->schemadata + data->schemata[schema];
615 for (kp = keyp; *kp; kp++)
616 if (data->keys[*kp].name == keyname)
620 *keypp = key = data->keys + *kp;
621 if (key->type == REPOKEY_TYPE_DELETED)
623 if (key->type == REPOKEY_TYPE_VOID || key->type == REPOKEY_TYPE_CONSTANT || key->type == REPOKEY_TYPE_CONSTANTID)
624 return dp; /* no need to forward... */
625 if (key->storage != KEY_STORAGE_INCORE && key->storage != KEY_STORAGE_VERTICAL_OFFSET)
626 return 0; /* get_data will not work, no need to forward */
627 dp = forward_to_key(data, *kp, keyp, dp);
630 return get_data(data, key, &dp, 0);
634 repodata_lookup_schemakeys(Repodata *data, Id solvid)
637 if (!maybe_load_repodata(data, 0))
639 if (!solvid2data(data, solvid, &schema))
641 return data->schemadata + data->schemata[schema];
647 Id *keyskip = solv_calloc(3 + 256, sizeof(Id));
649 keyskip[1] = keyskip[2] = 1;
654 repodata_fill_keyskip(Repodata *data, Id solvid, Id *keyskip)
657 Id maxkeyname, value;
658 keyp = repodata_lookup_schemakeys(data, solvid);
660 return keyskip; /* no keys for this solvid */
662 keyskip = alloc_keyskip();
663 maxkeyname = keyskip[0];
664 value = keyskip[1] + data->repodataid;
665 for (; *keyp; keyp++)
667 Id keyname = data->keys[*keyp].name;
668 if (keyname >= maxkeyname)
670 int newmax = (keyname | 255) + 1;
671 keyskip = solv_realloc2(keyskip, 3 + newmax, sizeof(Id));
672 memset(keyskip + (3 + maxkeyname), 0, (newmax - maxkeyname) * sizeof(Id));
673 keyskip[0] = maxkeyname = newmax;
675 keyskip[3 + keyname] = value;
681 repodata_lookup_type(Repodata *data, Id solvid, Id keyname)
683 Id schema, *keyp, *kp;
684 if (!maybe_load_repodata(data, keyname))
686 if (!solvid2data(data, solvid, &schema))
688 keyp = data->schemadata + data->schemata[schema];
689 for (kp = keyp; *kp; kp++)
690 if (data->keys[*kp].name == keyname)
691 return data->keys[*kp].type;
696 repodata_lookup_id(Repodata *data, Id solvid, Id keyname)
702 dp = find_key_data(data, solvid, keyname, &key);
705 if (key->type == REPOKEY_TYPE_CONSTANTID)
707 if (key->type != REPOKEY_TYPE_ID)
709 dp = data_read_id(dp, &id);
714 repodata_lookup_str(Repodata *data, Id solvid, Id keyname)
720 dp = find_key_data(data, solvid, keyname, &key);
723 if (key->type == REPOKEY_TYPE_STR)
724 return (const char *)dp;
725 if (key->type == REPOKEY_TYPE_CONSTANTID)
727 else if (key->type == REPOKEY_TYPE_ID)
728 dp = data_read_id(dp, &id);
732 return stringpool_id2str(&data->spool, id);
733 return pool_id2str(data->repo->pool, id);
737 repodata_lookup_num(Repodata *data, Id solvid, Id keyname, unsigned long long notfound)
741 unsigned int high, low;
743 dp = find_key_data(data, solvid, keyname, &key);
748 case REPOKEY_TYPE_NUM:
749 data_read_num64(dp, &low, &high);
750 return (unsigned long long)high << 32 | low;
751 case REPOKEY_TYPE_CONSTANT:
759 repodata_lookup_void(Repodata *data, Id solvid, Id keyname)
761 return repodata_lookup_type(data, solvid, keyname) == REPOKEY_TYPE_VOID ? 1 : 0;
764 const unsigned char *
765 repodata_lookup_bin_checksum(Repodata *data, Id solvid, Id keyname, Id *typep)
770 dp = find_key_data(data, solvid, keyname, &key);
785 repodata_lookup_idarray(Repodata *data, Id solvid, Id keyname, Queue *q)
793 dp = find_key_data(data, solvid, keyname, &key);
794 if (!dp || key->type != REPOKEY_TYPE_IDARRAY)
798 dp = data_read_ideof(dp, &id, &eof);
807 repodata_lookup_binary(Repodata *data, Id solvid, Id keyname, int *lenp)
813 dp = find_key_data(data, solvid, keyname, &key);
814 if (!dp || key->type != REPOKEY_TYPE_BINARY)
819 dp = data_read_id(dp, &len);
824 /* highly specialized function to speed up fileprovides adding.
825 * - repodata must be available
826 * - solvid must be >= data->start and < data->end
827 * - returns NULL is not found, a "" entry if wrong type
828 * - also returns wrong type for REPOKEY_TYPE_DELETED
830 const unsigned char *
831 repodata_lookup_packed_dirstrarray(Repodata *data, Id solvid, Id keyname)
833 static unsigned char wrongtype[2] = { 0x00 /* dir id 0 */, 0 /* "" */ };
835 Id schema, *keyp, *kp;
838 if (!data->incoredata || !data->incoreoffset[solvid - data->start])
840 dp = data->incoredata + data->incoreoffset[solvid - data->start];
841 dp = data_read_id(dp, &schema);
842 keyp = data->schemadata + data->schemata[schema];
843 for (kp = keyp; *kp; kp++)
844 if (data->keys[*kp].name == keyname)
848 key = data->keys + *kp;
849 if (key->type != REPOKEY_TYPE_DIRSTRARRAY)
851 dp = forward_to_key(data, *kp, keyp, dp);
852 if (key->storage == KEY_STORAGE_INCORE)
854 if (key->storage == KEY_STORAGE_VERTICAL_OFFSET && dp)
857 dp = data_read_id(dp, &off);
858 data_read_id(dp, &len);
859 return get_vertical_data(data, key, off, len);
864 /* id translation functions */
867 repodata_globalize_id(Repodata *data, Id id, int create)
869 if (!id || !data || !data->localpool)
871 return pool_str2id(data->repo->pool, stringpool_id2str(&data->spool, id), create);
875 repodata_localize_id(Repodata *data, Id id, int create)
877 if (!id || !data || !data->localpool)
879 return stringpool_str2id(&data->spool, pool_id2str(data->repo->pool, id), create);
883 repodata_translate_id(Repodata *data, Repodata *fromdata, Id id, int create)
886 if (!id || !data || !fromdata)
888 if (data == fromdata || (!data->localpool && !fromdata->localpool))
890 if (fromdata->localpool)
891 s = stringpool_id2str(&fromdata->spool, id);
893 s = pool_id2str(data->repo->pool, id);
895 return stringpool_str2id(&data->spool, s, create);
897 return pool_str2id(data->repo->pool, s, create);
901 repodata_translate_dir_slow(Repodata *data, Repodata *fromdata, Id dir, int create, Id *cache)
906 /* make sure that the dirpool has an entry */
907 if (create && !data->dirpool.ndirs)
908 dirpool_add_dir(&data->dirpool, 0, 0, create);
911 parent = dirpool_parent(&fromdata->dirpool, dir);
914 if (!(parent = repodata_translate_dir(data, fromdata, parent, create, cache)))
917 compid = dirpool_compid(&fromdata->dirpool, dir);
918 if (compid > 1 && (data->localpool || fromdata->localpool))
920 if (!(compid = repodata_translate_id(data, fromdata, compid, create)))
923 if (!(compid = dirpool_add_dir(&data->dirpool, parent, compid, create)))
927 cache[(dir & 255) * 2] = dir;
928 cache[(dir & 255) * 2 + 1] = compid;
933 /************************************************************************
934 * uninternalized lookup / search
938 data_fetch_uninternalized(Repodata *data, Repokey *key, Id value, KeyValue *kv)
944 case REPOKEY_TYPE_STR:
945 kv->str = (const char *)data->attrdata + value;
947 case REPOKEY_TYPE_CONSTANT:
951 case REPOKEY_TYPE_CONSTANTID:
954 case REPOKEY_TYPE_NUM:
957 if (value & 0x80000000)
959 kv->num = (unsigned int)data->attrnum64data[value ^ 0x80000000];
960 kv->num2 = (unsigned int)(data->attrnum64data[value ^ 0x80000000] >> 32);
964 kv->num = 0; /* not stringified */
965 kv->str = (const char *)data->attrdata + value;
967 case REPOKEY_TYPE_BINARY:
968 kv->str = (const char *)data_read_id(data->attrdata + value, (Id *)&kv->num);
970 case REPOKEY_TYPE_IDARRAY:
971 array = data->attriddata + (value + kv->entry);
973 kv->eof = array[1] ? 0 : 1;
975 case REPOKEY_TYPE_DIRSTRARRAY:
976 kv->num = 0; /* not stringified */
977 array = data->attriddata + (value + kv->entry * 2);
979 kv->str = (const char *)data->attrdata + array[1];
980 kv->eof = array[2] ? 0 : 1;
982 case REPOKEY_TYPE_DIRNUMNUMARRAY:
983 array = data->attriddata + (value + kv->entry * 3);
987 kv->eof = array[3] ? 0 : 1;
989 case REPOKEY_TYPE_FIXARRAY:
990 case REPOKEY_TYPE_FLEXARRAY:
991 array = data->attriddata + (value + kv->entry);
992 kv->id = array[0]; /* the handle */
993 kv->eof = array[1] ? 0 : 1;
1002 repodata_lookup_kv_uninternalized(Repodata *data, Id solvid, Id keyname, KeyValue *kv)
1005 if (!data->attrs || solvid < data->start || solvid >= data->end)
1007 ap = data->attrs[solvid - data->start];
1010 for (; *ap; ap += 2)
1012 Repokey *key = data->keys + *ap;
1013 if (key->name != keyname)
1015 data_fetch_uninternalized(data, key, ap[1], kv);
1022 repodata_search_uninternalized(Repodata *data, Id solvid, Id keyname, int flags, int (*callback)(void *cbdata, Solvable *s, Repodata *data, Repokey *key, KeyValue *kv), void *cbdata)
1029 if (!data->attrs || solvid < data->start || solvid >= data->end)
1031 ap = data->attrs[solvid - data->start];
1034 for (; *ap; ap += 2)
1036 Repokey *key = data->keys + *ap;
1037 if (keyname && key->name != keyname)
1039 s = solvid > 0 ? data->repo->pool->solvables + solvid : 0;
1043 data_fetch_uninternalized(data, key, ap[1], &kv);
1044 stop = callback(cbdata, s, data, key, &kv);
1047 while (!kv.eof && !stop);
1048 if (keyname || stop > SEARCH_NEXT_KEY)
1053 /************************************************************************
1059 repodata_stringify(Pool *pool, Repodata *data, Repokey *key, KeyValue *kv, int flags)
1063 case REPOKEY_TYPE_ID:
1064 case REPOKEY_TYPE_CONSTANTID:
1065 case REPOKEY_TYPE_IDARRAY:
1066 if (data && data->localpool)
1067 kv->str = stringpool_id2str(&data->spool, kv->id);
1069 kv->str = pool_id2str(pool, kv->id);
1070 if ((flags & SEARCH_SKIP_KIND) != 0 && key->storage == KEY_STORAGE_SOLVABLE && (key->name == SOLVABLE_NAME || key->type == REPOKEY_TYPE_IDARRAY))
1073 for (s = kv->str; *s >= 'a' && *s <= 'z'; s++)
1075 if (*s == ':' && s > kv->str)
1079 case REPOKEY_TYPE_STR:
1081 case REPOKEY_TYPE_DIRSTRARRAY:
1082 if (!(flags & SEARCH_FILES))
1083 return kv->str; /* match just the basename */
1085 return kv->str; /* already stringified */
1086 /* Put the full filename into kv->str. */
1087 kv->str = repodata_dir2str(data, kv->id, kv->str);
1088 kv->num = 1; /* mark stringification */
1091 if (!(flags & SEARCH_CHECKSUMS))
1092 return 0; /* skip em */
1094 return kv->str; /* already stringified */
1095 kv->str = repodata_chk2str(data, key->type, (const unsigned char *)kv->str);
1096 kv->num = 1; /* mark stringification */
1104 /* this is an internal hack to pass the parent kv to repodata_search_keyskip */
1105 struct subschema_data {
1112 repodata_search_arrayelement(Repodata *data, Id solvid, Id keyname, int flags, KeyValue *kv, int (*callback)(void *cbdata, Solvable *s, Repodata *data, Repokey *key, KeyValue *kv), void *cbdata)
1114 repodata_search_keyskip(data, solvid, keyname, flags | SEARCH_SUBSCHEMA, (Id *)kv, callback, cbdata);
1118 repodata_search_array(Repodata *data, Id solvid, Id keyname, int flags, Repokey *key, KeyValue *kv, int (*callback)(void *cbdata, Solvable *s, Repodata *data, Repokey *key, KeyValue *kv), void *cbdata)
1120 Solvable *s = solvid > 0 ? data->repo->pool->solvables + solvid : 0;
1121 unsigned char *dp = (unsigned char *)kv->str;
1125 if (!dp || kv->entry != -1)
1127 while (++kv->entry < kv->num)
1130 dp = data_skip_schema(data, dp, schema);
1131 if (kv->entry == 0 || key->type == REPOKEY_TYPE_FLEXARRAY)
1132 dp = data_read_id(dp, &schema);
1134 kv->str = (const char *)dp;
1135 kv->eof = kv->entry == kv->num - 1 ? 1 : 0;
1136 stop = callback(cbdata, s, data, key, kv);
1137 if (stop && stop != SEARCH_ENTERSUB)
1139 if ((flags & SEARCH_SUB) != 0 || stop == SEARCH_ENTERSUB)
1140 repodata_search_keyskip(data, solvid, keyname, flags | SEARCH_SUBSCHEMA, (Id *)kv, callback, cbdata);
1142 if ((flags & SEARCH_ARRAYSENTINEL) != 0)
1145 dp = data_skip_schema(data, dp, schema);
1147 kv->str = (const char *)dp;
1149 return callback(cbdata, s, data, key, kv);
1154 /* search a specific repodata */
1156 repodata_search_keyskip(Repodata *data, Id solvid, Id keyname, int flags, Id *keyskip, int (*callback)(void *cbdata, Solvable *s, Repodata *data, Repokey *key, KeyValue *kv), void *cbdata)
1160 Id keyid, *kp, *keyp;
1161 unsigned char *dp, *ddp;
1167 if (!maybe_load_repodata(data, keyname))
1169 if ((flags & SEARCH_SUBSCHEMA) != 0)
1171 flags ^= SEARCH_SUBSCHEMA;
1172 kv.parent = (KeyValue *)keyskip;
1174 schema = kv.parent->id;
1175 dp = (unsigned char *)kv.parent->str;
1180 dp = solvid2data(data, solvid, &schema);
1185 s = solvid > 0 ? data->repo->pool->solvables + solvid : 0;
1186 keyp = data->schemadata + data->schemata[schema];
1189 /* search for a specific key */
1190 for (kp = keyp; *kp; kp++)
1191 if (data->keys[*kp].name == keyname)
1195 dp = forward_to_key(data, *kp, keyp, dp);
1201 while ((keyid = *keyp++) != 0)
1204 key = data->keys + keyid;
1205 ddp = get_data(data, key, &dp, *keyp && !onekey ? 1 : 0);
1207 if (keyskip && (key->name >= keyskip[0] || keyskip[3 + key->name] != keyskip[1] + data->repodataid))
1213 if (key->type == REPOKEY_TYPE_DELETED && !(flags & SEARCH_KEEP_TYPE_DELETED))
1219 if (key->type == REPOKEY_TYPE_FLEXARRAY || key->type == REPOKEY_TYPE_FIXARRAY)
1222 ddp = data_read_id(ddp, (Id *)&kv.num);
1223 kv.str = (const char *)ddp;
1224 stop = repodata_search_array(data, solvid, 0, flags, key, &kv, callback, cbdata);
1225 if (onekey || stop > SEARCH_NEXT_KEY)
1232 ddp = data_fetch(ddp, &kv, key);
1235 stop = callback(cbdata, s, data, key, &kv);
1238 while (!kv.eof && !stop);
1239 if (onekey || stop > SEARCH_NEXT_KEY)
1245 repodata_search(Repodata *data, Id solvid, Id keyname, int flags, int (*callback)(void *cbdata, Solvable *s, Repodata *data, Repokey *key, KeyValue *kv), void *cbdata)
1247 repodata_search_keyskip(data, solvid, keyname, flags, 0, callback, cbdata);
1251 repodata_setpos_kv(Repodata *data, KeyValue *kv)
1253 Pool *pool = data->repo->pool;
1255 pool_clear_pos(pool);
1258 pool->pos.repo = data->repo;
1259 pool->pos.repodataid = data - data->repo->repodata;
1260 pool->pos.dp = (unsigned char *)kv->str - data->incoredata;
1261 pool->pos.schema = kv->id;
1265 /************************************************************************
1266 * data iterator functions
1270 solvabledata_fetch(Solvable *s, KeyValue *kv, Id keyname)
1284 case SOLVABLE_VENDOR:
1287 case SOLVABLE_PROVIDES:
1289 return s->provides ? s->repo->idarraydata + s->provides : 0;
1290 case SOLVABLE_OBSOLETES:
1292 return s->obsoletes ? s->repo->idarraydata + s->obsoletes : 0;
1293 case SOLVABLE_CONFLICTS:
1295 return s->conflicts ? s->repo->idarraydata + s->conflicts : 0;
1296 case SOLVABLE_REQUIRES:
1298 return s->requires ? s->repo->idarraydata + s->requires : 0;
1299 case SOLVABLE_RECOMMENDS:
1301 return s->recommends ? s->repo->idarraydata + s->recommends : 0;
1302 case SOLVABLE_SUPPLEMENTS:
1304 return s->supplements ? s->repo->idarraydata + s->supplements : 0;
1305 case SOLVABLE_SUGGESTS:
1307 return s->suggests ? s->repo->idarraydata + s->suggests : 0;
1308 case SOLVABLE_ENHANCES:
1310 return s->enhances ? s->repo->idarraydata + s->enhances : 0;
1313 return s->repo->rpmdbid ? s->repo->rpmdbid + (s - s->repo->pool->solvables - s->repo->start) : 0;
1320 datamatcher_init(Datamatcher *ma, const char *match, int flags)
1322 match = match ? solv_strdup(match) : 0;
1327 if ((flags & SEARCH_STRINGMASK) == SEARCH_REGEX)
1329 ma->matchdata = solv_calloc(1, sizeof(regex_t));
1330 ma->error = regcomp((regex_t *)ma->matchdata, match, REG_EXTENDED | REG_NOSUB | REG_NEWLINE | ((flags & SEARCH_NOCASE) ? REG_ICASE : 0));
1333 solv_free(ma->matchdata);
1334 ma->flags = (flags & ~SEARCH_STRINGMASK) | SEARCH_ERROR;
1337 if ((flags & SEARCH_FILES) != 0 && match)
1339 /* prepare basename check */
1340 if ((flags & SEARCH_STRINGMASK) == SEARCH_STRING || (flags & SEARCH_STRINGMASK) == SEARCH_STRINGEND)
1342 const char *p = strrchr(match, '/');
1343 ma->matchdata = (void *)(p ? p + 1 : match);
1345 else if ((flags & SEARCH_STRINGMASK) == SEARCH_GLOB)
1348 for (p = match + strlen(match) - 1; p >= match; p--)
1349 if (*p == '[' || *p == ']' || *p == '*' || *p == '?' || *p == '/')
1351 ma->matchdata = (void *)(p + 1);
1358 datamatcher_free(Datamatcher *ma)
1361 ma->match = solv_free((char *)ma->match);
1362 if ((ma->flags & SEARCH_STRINGMASK) == SEARCH_REGEX && ma->matchdata)
1364 regfree(ma->matchdata);
1365 solv_free(ma->matchdata);
1371 datamatcher_match(Datamatcher *ma, const char *str)
1374 switch ((ma->flags & SEARCH_STRINGMASK))
1376 case SEARCH_SUBSTRING:
1377 if (ma->flags & SEARCH_NOCASE)
1378 return strcasestr(str, ma->match) != 0;
1380 return strstr(str, ma->match) != 0;
1382 if (ma->flags & SEARCH_NOCASE)
1383 return !strcasecmp(ma->match, str);
1385 return !strcmp(ma->match, str);
1386 case SEARCH_STRINGSTART:
1387 if (ma->flags & SEARCH_NOCASE)
1388 return !strncasecmp(ma->match, str, strlen(ma->match));
1390 return !strncmp(ma->match, str, strlen(ma->match));
1391 case SEARCH_STRINGEND:
1392 l = strlen(str) - strlen(ma->match);
1395 if (ma->flags & SEARCH_NOCASE)
1396 return !strcasecmp(ma->match, str + l);
1398 return !strcmp(ma->match, str + l);
1400 return !fnmatch(ma->match, str, (ma->flags & SEARCH_NOCASE) ? FNM_CASEFOLD : 0);
1402 return !regexec((const regex_t *)ma->matchdata, str, 0, NULL, 0);
1408 /* check if the matcher can match the provides basename */
1411 datamatcher_checkbasename(Datamatcher *ma, const char *basename)
1414 const char *match = ma->matchdata;
1417 switch (ma->flags & SEARCH_STRINGMASK)
1421 case SEARCH_STRINGEND:
1422 if (match != ma->match)
1423 break; /* had slash, do exact match on basename */
1426 /* check if the basename ends with match */
1427 l = strlen(basename) - strlen(match);
1433 return 1; /* maybe matches */
1435 if ((ma->flags & SEARCH_NOCASE) != 0)
1436 return !strcasecmp(match, basename);
1438 return !strcmp(match, basename);
1457 di_nextarrayelement,
1463 di_entersolvablekey,
1467 /* see dataiterator.h for documentation */
1469 dataiterator_init(Dataiterator *di, Pool *pool, Repo *repo, Id p, Id keyname, const char *match, int flags)
1471 memset(di, 0, sizeof(*di));
1473 di->flags = flags & ~SEARCH_THISSOLVID;
1474 if (!pool || (repo && repo->pool != pool))
1482 if ((error = datamatcher_init(&di->matcher, match, flags)) != 0)
1488 di->keyname = keyname;
1489 di->keynames[0] = keyname;
1490 dataiterator_set_search(di, repo, p);
1495 dataiterator_init_clone(Dataiterator *di, Dataiterator *from)
1500 if (di->dupstr == di->kv.str)
1501 di->dupstr = solv_memdup(di->dupstr, di->dupstrn);
1508 memset(&di->matcher, 0, sizeof(di->matcher));
1509 if (from->matcher.match)
1510 datamatcher_init(&di->matcher, from->matcher.match, from->matcher.flags);
1515 for (i = 1; i < di->nparents; i++)
1516 di->parents[i].kv.parent = &di->parents[i - 1].kv;
1517 di->kv.parent = &di->parents[di->nparents - 1].kv;
1520 di->oldkeyskip = solv_memdup2(di->oldkeyskip, 3 + di->oldkeyskip[0], sizeof(Id));
1522 di->keyskip = di->oldkeyskip;
1526 dataiterator_set_match(Dataiterator *di, const char *match, int flags)
1528 di->flags = (flags & ~SEARCH_THISSOLVID) | (di->flags & SEARCH_THISSOLVID);
1529 datamatcher_free(&di->matcher);
1530 memset(&di->matcher, 0, sizeof(di->matcher));
1534 if ((error = datamatcher_init(&di->matcher, match, flags)) != 0)
1544 dataiterator_set_search(Dataiterator *di, Repo *repo, Id p)
1548 di->flags &= ~SEARCH_THISSOLVID;
1552 if (!di->pool->urepos)
1560 di->repo = di->pool->repos[di->repoid];
1562 di->state = di_enterrepo;
1564 dataiterator_jump_to_solvid(di, p);
1568 dataiterator_set_keyname(Dataiterator *di, Id keyname)
1571 di->keyname = keyname;
1572 di->keynames[0] = keyname;
1576 dataiterator_prepend_keyname(Dataiterator *di, Id keyname)
1580 if (di->nkeynames >= sizeof(di->keynames)/sizeof(*di->keynames) - 2)
1582 di->state = di_bye; /* sorry */
1585 for (i = di->nkeynames + 1; i > 0; i--)
1586 di->keynames[i] = di->keynames[i - 1];
1587 di->keynames[0] = di->keyname = keyname;
1592 dataiterator_free(Dataiterator *di)
1594 if (di->matcher.match)
1595 datamatcher_free(&di->matcher);
1597 solv_free(di->dupstr);
1599 solv_free(di->oldkeyskip);
1602 static unsigned char *
1603 dataiterator_find_keyname(Dataiterator *di, Id keyname)
1606 Repokey *keys = di->data->keys, *key;
1609 for (keyp = di->keyp; *keyp; keyp++)
1610 if (keys[*keyp].name == keyname)
1615 if (key->type == REPOKEY_TYPE_DELETED)
1617 if (key->storage != KEY_STORAGE_INCORE && key->storage != KEY_STORAGE_VERTICAL_OFFSET)
1618 return 0; /* get_data will not work, no need to forward */
1619 dp = forward_to_key(di->data, *keyp, di->keyp, di->dp);
1627 dataiterator_step(Dataiterator *di)
1631 if (di->state == di_nextattr && di->key->storage == KEY_STORAGE_VERTICAL_OFFSET && di->vert_ddp && di->vert_storestate != di->data->storestate)
1633 unsigned int ddpoff = di->ddp - di->vert_ddp;
1634 di->vert_off += ddpoff;
1635 di->vert_len -= ddpoff;
1636 di->ddp = di->vert_ddp = get_vertical_data(di->data, di->key, di->vert_off, di->vert_len);
1637 di->vert_storestate = di->data->storestate;
1639 di->state = di_nextkey;
1645 case di_enterrepo: di_enterrepo:
1646 if (!di->repo || (di->repo->disabled && !(di->flags & SEARCH_DISABLED_REPOS)))
1648 if (!(di->flags & SEARCH_THISSOLVID))
1650 di->solvid = di->repo->start - 1; /* reset solvid iterator */
1651 goto di_nextsolvable;
1655 case di_entersolvable: di_entersolvable:
1656 if (!di->repodataid)
1657 goto di_enterrepodata; /* POS case, repodata is set */
1658 if (di->solvid > 0 && !(di->flags & SEARCH_NO_STORAGE_SOLVABLE) && (!di->keyname || (di->keyname >= SOLVABLE_NAME && di->keyname <= RPM_RPMDBID)) && di->nparents - di->rootlevel == di->nkeynames)
1660 extern Repokey repo_solvablekeys[RPM_RPMDBID - SOLVABLE_NAME + 1];
1661 di->key = repo_solvablekeys + (di->keyname ? di->keyname - SOLVABLE_NAME : 0);
1663 goto di_entersolvablekey;
1668 di->data = di->keyname == SOLVABLE_FILELIST ? repo_lookup_filelist_repodata(di->repo, di->solvid, &di->matcher) : repo_lookup_repodata_opt(di->repo, di->solvid, di->keyname);
1670 goto di_nextsolvable;
1671 di->repodataid = di->data - di->repo->repodata;
1673 goto di_enterrepodata;
1675 di_leavesolvablekey:
1676 di->repodataid = 1; /* reset repodata iterator */
1677 di->keyskip = repo_create_keyskip(di->repo, di->solvid, &di->oldkeyskip);
1680 case di_enterrepodata: di_enterrepodata:
1683 if (di->repodataid >= di->repo->nrepodata)
1684 goto di_nextsolvable;
1685 di->data = di->repo->repodata + di->repodataid;
1687 if (!maybe_load_repodata(di->data, di->keyname))
1688 goto di_nextrepodata;
1689 di->dp = solvid2data(di->data, di->solvid, &schema);
1691 goto di_nextrepodata;
1692 if (di->solvid == SOLVID_POS)
1693 di->solvid = di->pool->pos.solvid;
1694 /* reset key iterator */
1695 di->keyp = di->data->schemadata + di->data->schemata[schema];
1698 case di_enterschema: di_enterschema:
1700 di->dp = dataiterator_find_keyname(di, di->keyname);
1701 if (!di->dp || !*di->keyp)
1705 goto di_nextrepodata;
1709 case di_enterkey: di_enterkey:
1711 di->key = di->data->keys + *di->keyp;
1714 /* this is get_data() modified to store vert_ data */
1715 if (di->key->storage == KEY_STORAGE_VERTICAL_OFFSET)
1718 di->dp = data_read_id(di->dp, &off);
1719 di->dp = data_read_id(di->dp, &len);
1720 di->vert_ddp = di->ddp = get_vertical_data(di->data, di->key, off, len);
1723 di->vert_storestate = di->data->storestate;
1725 else if (di->key->storage == KEY_STORAGE_INCORE)
1727 di->ddp = di->dp; /* start of data */
1728 if (di->keyp[1] && (!di->keyname || (di->flags & SEARCH_SUB) != 0))
1729 di->dp = data_skip_key(di->data, di->dp, di->key); /* advance to next key */
1735 if (di->keyskip && (di->key->name >= di->keyskip[0] || di->keyskip[3 + di->key->name] != di->keyskip[1] + di->data->repodataid))
1737 if (di->key->type == REPOKEY_TYPE_DELETED && !(di->flags & SEARCH_KEEP_TYPE_DELETED))
1739 if (di->key->type == REPOKEY_TYPE_FIXARRAY || di->key->type == REPOKEY_TYPE_FLEXARRAY)
1741 if (di->nkeynames && di->nparents - di->rootlevel < di->nkeynames)
1747 di->ddp = data_fetch(di->ddp, &di->kv, di->key);
1748 di->state = di->kv.eof ? di_nextkey : di_nextattr;
1751 case di_nextkey: di_nextkey:
1752 if (!di->keyname && *++di->keyp)
1758 case di_nextrepodata: di_nextrepodata:
1759 if (!di->keyname && di->repodataid && ++di->repodataid < di->repo->nrepodata)
1760 goto di_enterrepodata;
1763 case di_nextsolvable: di_nextsolvable:
1764 if (!(di->flags & SEARCH_THISSOLVID))
1767 di->solvid = di->repo->start;
1770 for (; di->solvid < di->repo->end; di->solvid++)
1772 if (di->pool->solvables[di->solvid].repo == di->repo)
1773 goto di_entersolvable;
1778 case di_nextrepo: di_nextrepo:
1783 if (di->repoid < di->pool->nrepos)
1785 di->repo = di->pool->repos[di->repoid];
1791 case di_bye: di_bye:
1795 case di_enterarray: di_enterarray:
1796 if (di->key->name == REPOSITORY_SOLVABLES)
1798 di->ddp = data_read_id(di->ddp, (Id *)&di->kv.num);
1803 case di_nextarrayelement: di_nextarrayelement:
1806 di->ddp = data_skip_schema(di->data, di->ddp, di->kv.id);
1807 if (di->kv.entry == di->kv.num)
1809 if (di->nkeynames && di->nparents - di->rootlevel < di->nkeynames)
1811 if (!(di->flags & SEARCH_ARRAYSENTINEL))
1813 di->kv.str = (char *)di->ddp;
1815 di->state = di_nextkey;
1818 if (di->kv.entry == di->kv.num - 1)
1820 if (di->key->type == REPOKEY_TYPE_FLEXARRAY || !di->kv.entry)
1821 di->ddp = data_read_id(di->ddp, &di->kv.id);
1822 di->kv.str = (char *)di->ddp;
1823 if (di->nkeynames && di->nparents - di->rootlevel < di->nkeynames)
1825 if ((di->flags & SEARCH_SUB) != 0)
1826 di->state = di_entersub;
1828 di->state = di_nextarrayelement;
1831 case di_entersub: di_entersub:
1832 if (di->nparents == sizeof(di->parents)/sizeof(*di->parents) - 1)
1833 goto di_nextarrayelement; /* sorry, full */
1834 di->parents[di->nparents].kv = di->kv;
1835 di->parents[di->nparents].dp = di->dp;
1836 di->parents[di->nparents].keyp = di->keyp;
1837 di->dp = (unsigned char *)di->kv.str;
1838 di->keyp = di->data->schemadata + di->data->schemata[di->kv.id];
1839 memset(&di->kv, 0, sizeof(di->kv));
1840 di->kv.parent = &di->parents[di->nparents].kv;
1842 di->keyname = di->keynames[di->nparents - di->rootlevel];
1843 goto di_enterschema;
1845 case di_leavesub: di_leavesub:
1846 if (di->nparents - 1 < di->rootlevel)
1849 di->dp = di->parents[di->nparents].dp;
1850 di->kv = di->parents[di->nparents].kv;
1851 di->keyp = di->parents[di->nparents].keyp;
1852 di->key = di->data->keys + *di->keyp;
1853 di->ddp = (unsigned char *)di->kv.str;
1854 di->keyname = di->keynames[di->nparents - di->rootlevel];
1855 goto di_nextarrayelement;
1857 /* special solvable attr handling follows */
1859 case di_nextsolvablekey: di_nextsolvablekey:
1861 goto di_nextsolvable;
1862 if (di->key->name == RPM_RPMDBID) /* reached end of list? */
1863 goto di_leavesolvablekey;
1867 case di_entersolvablekey: di_entersolvablekey:
1868 di->idp = solvabledata_fetch(di->pool->solvables + di->solvid, &di->kv, di->key->name);
1869 if (!di->idp || !*di->idp)
1870 goto di_nextsolvablekey;
1874 di->kv.id = *di->idp;
1875 di->kv.num = *di->idp; /* for rpmdbid */
1876 di->kv.num2 = 0; /* for rpmdbid */
1878 di->state = di_nextsolvablekey;
1884 case di_nextsolvableattr:
1885 di->state = di_nextsolvableattr;
1886 di->kv.id = *di->idp++;
1891 di->state = di_nextsolvablekey;
1897 /* we have a potential match */
1898 if (di->matcher.match)
1901 /* simple pre-check so that we don't need to stringify */
1902 if (di->keyname == SOLVABLE_FILELIST && di->key->type == REPOKEY_TYPE_DIRSTRARRAY && (di->matcher.flags & SEARCH_FILES) != 0)
1903 if (!datamatcher_checkbasename(&di->matcher, di->kv.str))
1905 /* now stringify so that we can do the matching */
1906 if (!(str = repodata_stringify(di->pool, di->data, di->key, &di->kv, di->flags)))
1908 if (di->keyname && (di->key->type == REPOKEY_TYPE_FIXARRAY || di->key->type == REPOKEY_TYPE_FLEXARRAY))
1912 if (!datamatcher_match(&di->matcher, str))
1917 /* stringify filelist if requested */
1918 if (di->keyname == SOLVABLE_FILELIST && di->key->type == REPOKEY_TYPE_DIRSTRARRAY && (di->flags & SEARCH_FILES) != 0)
1919 repodata_stringify(di->pool, di->data, di->key, &di->kv, di->flags);
1921 /* found something! */
1927 dataiterator_entersub(Dataiterator *di)
1929 if (di->state == di_nextarrayelement)
1930 di->state = di_entersub;
1934 dataiterator_setpos(Dataiterator *di)
1936 if (di->kv.eof == 2)
1938 pool_clear_pos(di->pool);
1941 di->pool->pos.solvid = di->solvid;
1942 di->pool->pos.repo = di->repo;
1943 di->pool->pos.repodataid = di->data - di->repo->repodata;
1944 di->pool->pos.schema = di->kv.id;
1945 di->pool->pos.dp = (unsigned char *)di->kv.str - di->data->incoredata;
1949 dataiterator_setpos_parent(Dataiterator *di)
1951 if (!di->kv.parent || di->kv.parent->eof == 2)
1953 pool_clear_pos(di->pool);
1956 di->pool->pos.solvid = di->solvid;
1957 di->pool->pos.repo = di->repo;
1958 di->pool->pos.repodataid = di->data - di->repo->repodata;
1959 di->pool->pos.schema = di->kv.parent->id;
1960 di->pool->pos.dp = (unsigned char *)di->kv.parent->str - di->data->incoredata;
1963 /* clones just the position, not the search keys/matcher */
1965 dataiterator_clonepos(Dataiterator *di, Dataiterator *from)
1967 di->state = from->state;
1968 di->flags &= ~SEARCH_THISSOLVID;
1969 di->flags |= (from->flags & SEARCH_THISSOLVID);
1970 di->repo = from->repo;
1971 di->data = from->data;
1973 di->ddp = from->ddp;
1974 di->idp = from->idp;
1975 di->keyp = from->keyp;
1976 di->key = from->key;
1978 di->repodataid = from->repodataid;
1979 di->solvid = from->solvid;
1980 di->repoid = from->repoid;
1981 di->rootlevel = from->rootlevel;
1982 memcpy(di->parents, from->parents, sizeof(from->parents));
1983 di->nparents = from->nparents;
1987 for (i = 1; i < di->nparents; i++)
1988 di->parents[i].kv.parent = &di->parents[i - 1].kv;
1989 di->kv.parent = &di->parents[di->nparents - 1].kv;
1993 if (from->dupstr && from->dupstr == from->kv.str)
1995 di->dupstrn = from->dupstrn;
1996 di->dupstr = solv_memdup(from->dupstr, from->dupstrn);
2001 dataiterator_seek(Dataiterator *di, int whence)
2003 if ((whence & DI_SEEK_STAY) != 0)
2004 di->rootlevel = di->nparents;
2005 switch (whence & ~DI_SEEK_STAY)
2008 if (di->state != di_nextarrayelement)
2010 if ((whence & DI_SEEK_STAY) != 0)
2011 di->rootlevel = di->nparents + 1; /* XXX: dangerous! */
2012 di->state = di_entersub;
2014 case DI_SEEK_PARENT:
2021 if (di->rootlevel > di->nparents)
2022 di->rootlevel = di->nparents;
2023 di->dp = di->parents[di->nparents].dp;
2024 di->kv = di->parents[di->nparents].kv;
2025 di->keyp = di->parents[di->nparents].keyp;
2026 di->key = di->data->keys + *di->keyp;
2027 di->ddp = (unsigned char *)di->kv.str;
2028 di->keyname = di->keynames[di->nparents - di->rootlevel];
2029 di->state = di_nextarrayelement;
2031 case DI_SEEK_REWIND:
2037 di->dp = (unsigned char *)di->kv.parent->str;
2038 di->keyp = di->data->schemadata + di->data->schemata[di->kv.parent->id];
2039 di->state = di_enterschema;
2047 dataiterator_skip_attribute(Dataiterator *di)
2049 if (di->state == di_nextsolvableattr)
2050 di->state = di_nextsolvablekey;
2052 di->state = di_nextkey;
2056 dataiterator_skip_solvable(Dataiterator *di)
2061 di->keyname = di->keynames[0];
2062 di->state = di_nextsolvable;
2066 dataiterator_skip_repo(Dataiterator *di)
2071 di->keyname = di->keynames[0];
2072 di->state = di_nextrepo;
2076 dataiterator_jump_to_solvid(Dataiterator *di, Id solvid)
2081 di->keyname = di->keynames[0];
2082 if (solvid == SOLVID_POS)
2084 di->repo = di->pool->pos.repo;
2091 if (!di->pool->pos.repodataid && di->pool->pos.solvid == SOLVID_META) {
2092 solvid = SOLVID_META; /* META pos hack */
2094 di->data = di->repo->repodata + di->pool->pos.repodataid;
2098 else if (solvid > 0)
2100 di->repo = di->pool->solvables[solvid].repo;
2105 if (!di->pool->urepos)
2111 di->repo = di->pool->repos[di->repoid];
2113 if (solvid != SOLVID_POS)
2115 di->solvid = solvid;
2117 di->flags |= SEARCH_THISSOLVID;
2118 di->state = di_enterrepo;
2122 dataiterator_jump_to_repo(Dataiterator *di, Repo *repo)
2128 di->repoid = 0; /* 0 means stay at repo */
2131 di->flags &= ~SEARCH_THISSOLVID;
2132 di->state = di_enterrepo;
2136 dataiterator_match(Dataiterator *di, Datamatcher *ma)
2139 if (!(str = repodata_stringify(di->pool, di->data, di->key, &di->kv, di->flags)))
2141 return ma ? datamatcher_match(ma, str) : 1;
2145 dataiterator_strdup(Dataiterator *di)
2149 if (!di->kv.str || di->kv.str == di->dupstr)
2151 switch (di->key->type)
2154 case REPOKEY_TYPE_DIRSTRARRAY:
2155 if (di->kv.num) /* was it stringified into tmp space? */
2156 l = strlen(di->kv.str) + 1;
2161 if (l < 0 && di->key->storage == KEY_STORAGE_VERTICAL_OFFSET)
2163 switch (di->key->type)
2165 case REPOKEY_TYPE_STR:
2166 case REPOKEY_TYPE_DIRSTRARRAY:
2167 l = strlen(di->kv.str) + 1;
2170 l = solv_chksum_len(di->key->type);
2172 case REPOKEY_TYPE_BINARY:
2179 if (!di->dupstrn || di->dupstrn < l)
2181 di->dupstrn = l + 16;
2182 di->dupstr = solv_realloc(di->dupstr, di->dupstrn);
2185 memcpy(di->dupstr, di->kv.str, l);
2186 di->kv.str = di->dupstr;
2190 /************************************************************************
2191 * data modify functions
2194 /* extend repodata so that it includes solvables p */
2196 repodata_extend(Repodata *data, Id p)
2198 if (data->start == data->end)
2199 data->start = data->end = p;
2202 int old = data->end - data->start;
2203 int new = p - data->end + 1;
2206 data->attrs = solv_extend(data->attrs, old, new, sizeof(Id *), REPODATA_BLOCK);
2207 memset(data->attrs + old, 0, new * sizeof(Id *));
2209 data->incoreoffset = solv_extend(data->incoreoffset, old, new, sizeof(Id), REPODATA_BLOCK);
2210 memset(data->incoreoffset + old, 0, new * sizeof(Id));
2213 if (p < data->start)
2215 int old = data->end - data->start;
2216 int new = data->start - p;
2219 data->attrs = solv_extend_resize(data->attrs, old + new, sizeof(Id *), REPODATA_BLOCK);
2220 memmove(data->attrs + new, data->attrs, old * sizeof(Id *));
2221 memset(data->attrs, 0, new * sizeof(Id *));
2223 data->incoreoffset = solv_extend_resize(data->incoreoffset, old + new, sizeof(Id), REPODATA_BLOCK);
2224 memmove(data->incoreoffset + new, data->incoreoffset, old * sizeof(Id));
2225 memset(data->incoreoffset, 0, new * sizeof(Id));
2230 /* shrink end of repodata */
2232 repodata_shrink(Repodata *data, int end)
2236 if (data->end <= end)
2238 if (data->start >= end)
2242 for (i = 0; i < data->end - data->start; i++)
2243 solv_free(data->attrs[i]);
2244 data->attrs = solv_free(data->attrs);
2246 data->incoreoffset = solv_free(data->incoreoffset);
2247 data->start = data->end = 0;
2252 for (i = end; i < data->end; i++)
2253 solv_free(data->attrs[i - data->start]);
2254 data->attrs = solv_extend_resize(data->attrs, end - data->start, sizeof(Id *), REPODATA_BLOCK);
2256 if (data->incoreoffset)
2257 data->incoreoffset = solv_extend_resize(data->incoreoffset, end - data->start, sizeof(Id), REPODATA_BLOCK);
2261 /* extend repodata so that it includes solvables from start to start + num - 1 */
2263 repodata_extend_block(Repodata *data, Id start, Id num)
2267 if (!data->incoreoffset)
2269 /* this also means that data->attrs is NULL */
2270 data->incoreoffset = solv_calloc_block(num, sizeof(Id), REPODATA_BLOCK);
2271 data->start = start;
2272 data->end = start + num;
2275 repodata_extend(data, start);
2277 repodata_extend(data, start + num - 1);
2280 /**********************************************************************/
2283 #define REPODATA_ATTRS_BLOCK 31
2284 #define REPODATA_ATTRDATA_BLOCK 1023
2285 #define REPODATA_ATTRIDDATA_BLOCK 63
2286 #define REPODATA_ATTRNUM64DATA_BLOCK 15
2290 repodata_new_handle(Repodata *data)
2294 data->xattrs = solv_calloc_block(1, sizeof(Id *), REPODATA_BLOCK);
2295 data->nxattrs = 2; /* -1: SOLVID_META */
2297 data->xattrs = solv_extend(data->xattrs, data->nxattrs, 1, sizeof(Id *), REPODATA_BLOCK);
2298 data->xattrs[data->nxattrs] = 0;
2299 return -(data->nxattrs++);
2303 repodata_get_attrp(Repodata *data, Id handle)
2307 if (handle == SOLVID_META && !data->xattrs)
2309 data->xattrs = solv_calloc_block(1, sizeof(Id *), REPODATA_BLOCK);
2312 return data->xattrs - handle;
2314 if (handle < data->start || handle >= data->end)
2315 repodata_extend(data, handle);
2317 data->attrs = solv_calloc_block(data->end - data->start, sizeof(Id *), REPODATA_BLOCK);
2318 return data->attrs + (handle - data->start);
2322 repodata_insert_keyid(Repodata *data, Id handle, Id keyid, Id val, int overwrite)
2328 app = repodata_get_attrp(data, handle);
2333 /* Determine equality based on the name only, allows us to change
2334 type (when overwrite is set), and makes TYPE_CONSTANT work. */
2335 for (pp = ap; *pp; pp += 2)
2336 if (data->keys[*pp].name == data->keys[keyid].name)
2340 if (overwrite || data->keys[*pp].type == REPOKEY_TYPE_DELETED)
2349 ap = solv_extend(ap, i, 3, sizeof(Id), REPODATA_ATTRS_BLOCK);
2359 repodata_set(Repodata *data, Id solvid, Repokey *key, Id val)
2363 keyid = repodata_key2id(data, key, 1);
2364 repodata_insert_keyid(data, solvid, keyid, val, 1);
2368 repodata_set_id(Repodata *data, Id solvid, Id keyname, Id id)
2372 key.type = REPOKEY_TYPE_ID;
2374 key.storage = KEY_STORAGE_INCORE;
2375 repodata_set(data, solvid, &key, id);
2379 repodata_set_num(Repodata *data, Id solvid, Id keyname, unsigned long long num)
2383 key.type = REPOKEY_TYPE_NUM;
2385 key.storage = KEY_STORAGE_INCORE;
2386 if (num >= 0x80000000)
2388 data->attrnum64data = solv_extend(data->attrnum64data, data->attrnum64datalen, 1, sizeof(unsigned long long), REPODATA_ATTRNUM64DATA_BLOCK);
2389 data->attrnum64data[data->attrnum64datalen] = num;
2390 num = 0x80000000 | data->attrnum64datalen++;
2392 repodata_set(data, solvid, &key, (Id)num);
2396 repodata_set_poolstr(Repodata *data, Id solvid, Id keyname, const char *str)
2400 if (data->localpool)
2401 id = stringpool_str2id(&data->spool, str, 1);
2403 id = pool_str2id(data->repo->pool, str, 1);
2405 key.type = REPOKEY_TYPE_ID;
2407 key.storage = KEY_STORAGE_INCORE;
2408 repodata_set(data, solvid, &key, id);
2412 repodata_set_constant(Repodata *data, Id solvid, Id keyname, unsigned int constant)
2416 key.type = REPOKEY_TYPE_CONSTANT;
2417 key.size = constant;
2418 key.storage = KEY_STORAGE_INCORE;
2419 repodata_set(data, solvid, &key, 0);
2423 repodata_set_constantid(Repodata *data, Id solvid, Id keyname, Id id)
2427 key.type = REPOKEY_TYPE_CONSTANTID;
2429 key.storage = KEY_STORAGE_INCORE;
2430 repodata_set(data, solvid, &key, 0);
2434 repodata_set_void(Repodata *data, Id solvid, Id keyname)
2438 key.type = REPOKEY_TYPE_VOID;
2440 key.storage = KEY_STORAGE_INCORE;
2441 repodata_set(data, solvid, &key, 0);
2445 repodata_set_str(Repodata *data, Id solvid, Id keyname, const char *str)
2450 l = strlen(str) + 1;
2452 key.type = REPOKEY_TYPE_STR;
2454 key.storage = KEY_STORAGE_INCORE;
2455 data->attrdata = solv_extend(data->attrdata, data->attrdatalen, l, 1, REPODATA_ATTRDATA_BLOCK);
2456 memcpy(data->attrdata + data->attrdatalen, str, l);
2457 repodata_set(data, solvid, &key, data->attrdatalen);
2458 data->attrdatalen += l;
2462 repodata_set_binary(Repodata *data, Id solvid, Id keyname, void *buf, int len)
2470 key.type = REPOKEY_TYPE_BINARY;
2472 key.storage = KEY_STORAGE_INCORE;
2473 data->attrdata = solv_extend(data->attrdata, data->attrdatalen, len + 5, 1, REPODATA_ATTRDATA_BLOCK);
2474 dp = data->attrdata + data->attrdatalen;
2475 if (len >= (1 << 14))
2477 if (len >= (1 << 28))
2478 *dp++ = (len >> 28) | 128;
2479 if (len >= (1 << 21))
2480 *dp++ = (len >> 21) | 128;
2481 *dp++ = (len >> 14) | 128;
2483 if (len >= (1 << 7))
2484 *dp++ = (len >> 7) | 128;
2487 memcpy(dp, buf, len);
2488 repodata_set(data, solvid, &key, data->attrdatalen);
2489 data->attrdatalen = dp + len - data->attrdata;
2492 /* add an array element consisting of entrysize Ids to the repodata. modifies attriddata
2493 * so that the caller can append entrysize new elements plus the termination zero there */
2495 repodata_add_array(Repodata *data, Id handle, Id keyname, Id keytype, int entrysize)
2498 Id *ida, *pp, **ppp;
2500 /* check if it is the same as last time, this speeds things up a lot */
2501 if (handle == data->lasthandle && data->keys[data->lastkey].name == keyname && data->keys[data->lastkey].type == keytype && data->attriddatalen == data->lastdatalen)
2503 /* great! just append the new data */
2504 data->attriddata = solv_extend(data->attriddata, data->attriddatalen, entrysize, sizeof(Id), REPODATA_ATTRIDDATA_BLOCK);
2505 data->attriddatalen--; /* overwrite terminating 0 */
2506 data->lastdatalen += entrysize;
2510 ppp = repodata_get_attrp(data, handle);
2514 for (; *pp; pp += 2)
2515 if (data->keys[*pp].name == keyname)
2518 if (!pp || !*pp || data->keys[*pp].type != keytype)
2520 /* not found. allocate new key */
2526 key.storage = KEY_STORAGE_INCORE;
2527 data->attriddata = solv_extend(data->attriddata, data->attriddatalen, entrysize + 1, sizeof(Id), REPODATA_ATTRIDDATA_BLOCK);
2528 keyid = repodata_key2id(data, &key, 1);
2529 repodata_insert_keyid(data, handle, keyid, data->attriddatalen, 1);
2530 data->lasthandle = handle;
2531 data->lastkey = keyid;
2532 data->lastdatalen = data->attriddatalen + entrysize + 1;
2536 for (ida = data->attriddata + pp[1]; *ida; ida += entrysize)
2537 oldsize += entrysize;
2538 if (ida + 1 == data->attriddata + data->attriddatalen)
2540 /* this was the last entry, just append it */
2541 data->attriddata = solv_extend(data->attriddata, data->attriddatalen, entrysize, sizeof(Id), REPODATA_ATTRIDDATA_BLOCK);
2542 data->attriddatalen--; /* overwrite terminating 0 */
2546 /* too bad. move to back. */
2547 data->attriddata = solv_extend(data->attriddata, data->attriddatalen, oldsize + entrysize + 1, sizeof(Id), REPODATA_ATTRIDDATA_BLOCK);
2548 memcpy(data->attriddata + data->attriddatalen, data->attriddata + pp[1], oldsize * sizeof(Id));
2549 pp[1] = data->attriddatalen;
2550 data->attriddatalen += oldsize;
2552 data->lasthandle = handle;
2553 data->lastkey = *pp;
2554 data->lastdatalen = data->attriddatalen + entrysize + 1;
2558 repodata_set_bin_checksum(Repodata *data, Id solvid, Id keyname, Id type,
2559 const unsigned char *str)
2564 if (!(l = solv_chksum_len(type)))
2569 key.storage = KEY_STORAGE_INCORE;
2570 data->attrdata = solv_extend(data->attrdata, data->attrdatalen, l, 1, REPODATA_ATTRDATA_BLOCK);
2571 memcpy(data->attrdata + data->attrdatalen, str, l);
2572 repodata_set(data, solvid, &key, data->attrdatalen);
2573 data->attrdatalen += l;
2577 repodata_set_checksum(Repodata *data, Id solvid, Id keyname, Id type,
2580 unsigned char buf[64];
2583 if (!(l = solv_chksum_len(type)))
2585 if (l > sizeof(buf) || solv_hex2bin(&str, buf, l) != l)
2587 repodata_set_bin_checksum(data, solvid, keyname, type, buf);
2591 repodata_chk2str(Repodata *data, Id type, const unsigned char *buf)
2595 if (!(l = solv_chksum_len(type)))
2597 return pool_bin2hex(data->repo->pool, buf, l);
2600 /* rpm filenames don't contain the epoch, so strip it */
2601 static inline const char *
2602 evrid2vrstr(Pool *pool, Id evrid)
2604 const char *p, *evr = pool_id2str(pool, evrid);
2607 for (p = evr; *p >= '0' && *p <= '9'; p++)
2609 return p != evr && *p == ':' && p[1] ? p + 1 : evr;
2613 repodata_set_poolstrn(Repodata *data, Id solvid, Id keyname, const char *str, int l)
2616 if (data->localpool)
2617 id = stringpool_strn2id(&data->spool, str, l, 1);
2619 id = pool_strn2id(data->repo->pool, str, l, 1);
2620 repodata_set_id(data, solvid, keyname, id);
2624 repodata_set_strn(Repodata *data, Id solvid, Id keyname, const char *str, int l)
2627 repodata_set_str(data, solvid, keyname, str);
2630 char *s = solv_strdup(str);
2632 repodata_set_str(data, solvid, keyname, s);
2638 repodata_set_location(Repodata *data, Id solvid, int medianr, const char *dir, const char *file)
2640 Pool *pool = data->repo->pool;
2642 const char *str, *fp;
2646 repodata_set_constant(data, solvid, SOLVABLE_MEDIANR, medianr);
2649 if ((dir = strrchr(file, '/')) != 0)
2660 if (l >= 2 && dir[0] == '.' && dir[1] == '/' && (l == 2 || dir[2] != '/'))
2665 if (l == 1 && dir[0] == '.')
2667 s = pool->solvables + solvid;
2670 str = pool_id2str(pool, s->arch);
2671 if (!strncmp(dir, str, l) && !str[l])
2672 repodata_set_void(data, solvid, SOLVABLE_MEDIADIR);
2674 repodata_set_strn(data, solvid, SOLVABLE_MEDIADIR, dir, l);
2677 str = pool_id2str(pool, s->name);
2679 if ((!l || !strncmp(fp, str, l)) && fp[l] == '-')
2682 str = evrid2vrstr(pool, s->evr);
2684 if ((!l || !strncmp(fp, str, l)) && fp[l] == '.')
2687 str = pool_id2str(pool, s->arch);
2689 if ((!l || !strncmp(fp, str, l)) && !strcmp(fp + l, ".rpm"))
2691 repodata_set_void(data, solvid, SOLVABLE_MEDIAFILE);
2696 repodata_set_str(data, solvid, SOLVABLE_MEDIAFILE, file);
2699 /* XXX: medianr is currently not stored */
2701 repodata_set_deltalocation(Repodata *data, Id handle, int medianr, const char *dir, const char *file)
2704 const char *evr, *suf, *s;
2708 if ((dir = strrchr(file, '/')) != 0)
2719 if (l >= 2 && dir[0] == '.' && dir[1] == '/' && (l == 2 || dir[2] != '/'))
2724 if (l == 1 && dir[0] == '.')
2727 repodata_set_poolstrn(data, handle, DELTA_LOCATION_DIR, dir, l);
2728 evr = strchr(file, '-');
2731 for (s = evr - 1; s > file; s--)
2738 suf = strrchr(file, '.');
2741 for (s = suf - 1; s > file; s--)
2747 if (!strcmp(suf, ".delta.rpm") || !strcmp(suf, ".patch.rpm"))
2749 /* We accept one more item as suffix. */
2750 for (s = suf - 1; s > file; s--)
2760 if (suf && evr && suf < evr)
2762 repodata_set_poolstrn(data, handle, DELTA_LOCATION_NAME, file, evr ? evr - file : strlen(file));
2764 repodata_set_poolstrn(data, handle, DELTA_LOCATION_EVR, evr + 1, suf ? suf - evr - 1: strlen(evr + 1));
2766 repodata_set_poolstr(data, handle, DELTA_LOCATION_SUFFIX, suf + 1);
2770 repodata_set_sourcepkg(Repodata *data, Id solvid, const char *sourcepkg)
2772 Pool *pool = data->repo->pool;
2773 Solvable *s = pool->solvables + solvid;
2774 const char *p, *sevr, *sarch, *name, *evr;
2776 p = strrchr(sourcepkg, '.');
2777 if (!p || strcmp(p, ".rpm") != 0)
2780 repodata_set_str(data, solvid, SOLVABLE_SOURCENAME, sourcepkg);
2784 while (p > sourcepkg && *p != '.')
2786 if (*p != '.' || p == sourcepkg)
2789 while (p > sourcepkg && *p != '-')
2791 if (*p != '-' || p == sourcepkg)
2794 while (p > sourcepkg && *p != '-')
2796 if (*p != '-' || p == sourcepkg)
2799 pool = s->repo->pool;
2801 name = pool_id2str(pool, s->name);
2802 if (name && !strncmp(sourcepkg, name, sevr - sourcepkg - 1) && name[sevr - sourcepkg - 1] == 0)
2803 repodata_set_void(data, solvid, SOLVABLE_SOURCENAME);
2805 repodata_set_id(data, solvid, SOLVABLE_SOURCENAME, pool_strn2id(pool, sourcepkg, sevr - sourcepkg - 1, 1));
2807 evr = evrid2vrstr(pool, s->evr);
2808 if (evr && !strncmp(sevr, evr, sarch - sevr - 1) && evr[sarch - sevr - 1] == 0)
2809 repodata_set_void(data, solvid, SOLVABLE_SOURCEEVR);
2811 repodata_set_id(data, solvid, SOLVABLE_SOURCEEVR, pool_strn2id(pool, sevr, sarch - sevr - 1, 1));
2813 if (!strcmp(sarch, "src.rpm"))
2814 repodata_set_constantid(data, solvid, SOLVABLE_SOURCEARCH, ARCH_SRC);
2815 else if (!strcmp(sarch, "nosrc.rpm"))
2816 repodata_set_constantid(data, solvid, SOLVABLE_SOURCEARCH, ARCH_NOSRC);
2818 repodata_set_constantid(data, solvid, SOLVABLE_SOURCEARCH, pool_strn2id(pool, sarch, strlen(sarch) - 4, 1));
2822 repodata_set_idarray(Repodata *data, Id solvid, Id keyname, Queue *q)
2828 key.type = REPOKEY_TYPE_IDARRAY;
2830 key.storage = KEY_STORAGE_INCORE;
2831 repodata_set(data, solvid, &key, data->attriddatalen);
2832 data->attriddata = solv_extend(data->attriddata, data->attriddatalen, q->count + 1, sizeof(Id), REPODATA_ATTRIDDATA_BLOCK);
2833 for (i = 0; i < q->count; i++)
2834 data->attriddata[data->attriddatalen++] = q->elements[i];
2835 data->attriddata[data->attriddatalen++] = 0;
2839 repodata_add_dirnumnum(Repodata *data, Id solvid, Id keyname, Id dir, Id num, Id num2)
2843 fprintf(stderr, "repodata_add_dirnumnum %d %d %d %d (%d)\n", solvid, dir, num, num2, data->attriddatalen);
2845 repodata_add_array(data, solvid, keyname, REPOKEY_TYPE_DIRNUMNUMARRAY, 3);
2846 data->attriddata[data->attriddatalen++] = dir;
2847 data->attriddata[data->attriddatalen++] = num;
2848 data->attriddata[data->attriddatalen++] = num2;
2849 data->attriddata[data->attriddatalen++] = 0;
2853 repodata_add_dirstr(Repodata *data, Id solvid, Id keyname, Id dir, const char *str)
2859 l = strlen(str) + 1;
2860 data->attrdata = solv_extend(data->attrdata, data->attrdatalen, l, 1, REPODATA_ATTRDATA_BLOCK);
2861 memcpy(data->attrdata + data->attrdatalen, str, l);
2862 stroff = data->attrdatalen;
2863 data->attrdatalen += l;
2866 fprintf(stderr, "repodata_add_dirstr %d %d %s (%d)\n", solvid, dir, str, data->attriddatalen);
2868 repodata_add_array(data, solvid, keyname, REPOKEY_TYPE_DIRSTRARRAY, 2);
2869 data->attriddata[data->attriddatalen++] = dir;
2870 data->attriddata[data->attriddatalen++] = stroff;
2871 data->attriddata[data->attriddatalen++] = 0;
2875 repodata_add_idarray(Repodata *data, Id solvid, Id keyname, Id id)
2878 fprintf(stderr, "repodata_add_idarray %d %d (%d)\n", solvid, id, data->attriddatalen);
2880 repodata_add_array(data, solvid, keyname, REPOKEY_TYPE_IDARRAY, 1);
2881 data->attriddata[data->attriddatalen++] = id;
2882 data->attriddata[data->attriddatalen++] = 0;
2886 repodata_add_poolstr_array(Repodata *data, Id solvid, Id keyname,
2890 if (data->localpool)
2891 id = stringpool_str2id(&data->spool, str, 1);
2893 id = pool_str2id(data->repo->pool, str, 1);
2894 repodata_add_idarray(data, solvid, keyname, id);
2898 repodata_add_fixarray(Repodata *data, Id solvid, Id keyname, Id handle)
2900 repodata_add_array(data, solvid, keyname, REPOKEY_TYPE_FIXARRAY, 1);
2901 data->attriddata[data->attriddatalen++] = handle;
2902 data->attriddata[data->attriddatalen++] = 0;
2906 repodata_add_flexarray(Repodata *data, Id solvid, Id keyname, Id handle)
2908 repodata_add_array(data, solvid, keyname, REPOKEY_TYPE_FLEXARRAY, 1);
2909 data->attriddata[data->attriddatalen++] = handle;
2910 data->attriddata[data->attriddatalen++] = 0;
2914 repodata_set_kv(Repodata *data, Id solvid, Id keyname, Id keytype, KeyValue *kv)
2918 case REPOKEY_TYPE_ID:
2919 repodata_set_id(data, solvid, keyname, kv->id);
2921 case REPOKEY_TYPE_CONSTANTID:
2922 repodata_set_constantid(data, solvid, keyname, kv->id);
2924 case REPOKEY_TYPE_IDARRAY:
2925 repodata_add_idarray(data, solvid, keyname, kv->id);
2927 case REPOKEY_TYPE_STR:
2928 repodata_set_str(data, solvid, keyname, kv->str);
2930 case REPOKEY_TYPE_VOID:
2931 repodata_set_void(data, solvid, keyname);
2933 case REPOKEY_TYPE_NUM:
2934 repodata_set_num(data, solvid, keyname, SOLV_KV_NUM64(kv));
2936 case REPOKEY_TYPE_CONSTANT:
2937 repodata_set_constant(data, solvid, keyname, kv->num);
2939 case REPOKEY_TYPE_DIRNUMNUMARRAY:
2941 repodata_add_dirnumnum(data, solvid, keyname, kv->id, kv->num, kv->num2);
2943 case REPOKEY_TYPE_DIRSTRARRAY:
2944 repodata_add_dirstr(data, solvid, keyname, kv->id, kv->str);
2947 repodata_set_bin_checksum(data, solvid, keyname, keytype, (const unsigned char *)kv->str);
2955 repodata_unset_uninternalized(Repodata *data, Id solvid, Id keyname)
2958 app = repodata_get_attrp(data, solvid);
2964 *app = 0; /* delete all attributes */
2967 for (; *ap; ap += 2)
2968 if (data->keys[*ap].name == keyname)
2974 for (; *ap; ap += 2)
2976 if (data->keys[*ap].name == keyname)
2985 repodata_unset(Repodata *data, Id solvid, Id keyname)
2989 key.type = REPOKEY_TYPE_DELETED;
2991 key.storage = KEY_STORAGE_INCORE;
2992 repodata_set(data, solvid, &key, 0);
2995 /* add all (uninternalized) attrs from src to dest */
2997 repodata_merge_attrs(Repodata *data, Id dest, Id src)
3000 if (dest == src || !data->attrs || !(keyp = data->attrs[src - data->start]))
3002 for (; *keyp; keyp += 2)
3003 repodata_insert_keyid(data, dest, keyp[0], keyp[1], 0);
3006 /* add some (uninternalized) attrs from src to dest */
3008 repodata_merge_some_attrs(Repodata *data, Id dest, Id src, Map *keyidmap, int overwrite)
3011 if (dest == src || !data->attrs || !(keyp = data->attrs[src - data->start]))
3013 for (; *keyp; keyp += 2)
3014 if (!keyidmap || MAPTST(keyidmap, keyp[0]))
3015 repodata_insert_keyid(data, dest, keyp[0], keyp[1], overwrite);
3018 /* swap (uninternalized) attrs from src and dest */
3020 repodata_swap_attrs(Repodata *data, Id dest, Id src)
3023 if (!data->attrs || dest == src)
3025 if (dest < data->start || dest >= data->end)
3026 repodata_extend(data, dest);
3027 if (src < data->start || src >= data->end)
3028 repodata_extend(data, src);
3029 tmpattrs = data->attrs[dest - data->start];
3030 data->attrs[dest - data->start] = data->attrs[src - data->start];
3031 data->attrs[src - data->start] = tmpattrs;
3035 /**********************************************************************/
3037 /* TODO: unify with repo_write and repo_solv! */
3039 #define EXTDATA_BLOCK 1023
3047 data_addid(struct extdata *xd, Id sx)
3049 unsigned int x = (unsigned int)sx;
3052 xd->buf = solv_extend(xd->buf, xd->len, 5, 1, EXTDATA_BLOCK);
3053 dp = xd->buf + xd->len;
3058 *dp++ = (x >> 28) | 128;
3060 *dp++ = (x >> 21) | 128;
3061 *dp++ = (x >> 14) | 128;
3064 *dp++ = (x >> 7) | 128;
3066 xd->len = dp - xd->buf;
3070 data_addid64(struct extdata *xd, unsigned long long x)
3072 if (x >= 0x100000000)
3076 data_addid(xd, (Id)(x >> 35));
3077 xd->buf[xd->len - 1] |= 128;
3079 data_addid(xd, (Id)((unsigned int)x | 0x80000000));
3080 xd->buf[xd->len - 5] = (x >> 28) | 128;
3083 data_addid(xd, (Id)x);
3087 data_addideof(struct extdata *xd, Id sx, int eof)
3089 unsigned int x = (unsigned int)sx;
3092 xd->buf = solv_extend(xd->buf, xd->len, 5, 1, EXTDATA_BLOCK);
3093 dp = xd->buf + xd->len;
3098 *dp++ = (x >> 27) | 128;
3100 *dp++ = (x >> 20) | 128;
3101 *dp++ = (x >> 13) | 128;
3104 *dp++ = (x >> 6) | 128;
3105 *dp++ = eof ? (x & 63) : (x & 63) | 64;
3106 xd->len = dp - xd->buf;
3110 data_addblob(struct extdata *xd, unsigned char *blob, int len)
3112 xd->buf = solv_extend(xd->buf, xd->len, len, 1, EXTDATA_BLOCK);
3113 memcpy(xd->buf + xd->len, blob, len);
3117 /*********************************/
3119 /* this is to reduct memory usage when internalizing oversized repos */
3121 compact_attrdata(Repodata *data, int entry, int nentry)
3124 unsigned int attrdatastart = data->attrdatalen;
3125 unsigned int attriddatastart = data->attriddatalen;
3126 if (attrdatastart < 1024 * 1024 * 4 && attriddatastart < 1024 * 1024)
3128 for (i = entry; i < nentry; i++)
3130 Id v, *attrs = data->attrs[i];
3133 for (; *attrs; attrs += 2)
3135 switch (data->keys[*attrs].type)
3137 case REPOKEY_TYPE_STR:
3138 case REPOKEY_TYPE_BINARY:
3140 if ((unsigned int)attrs[1] < attrdatastart)
3141 attrdatastart = attrs[1];
3143 case REPOKEY_TYPE_DIRSTRARRAY:
3144 for (v = attrs[1]; data->attriddata[v] ; v += 2)
3145 if (data->attriddata[v + 1] < attrdatastart)
3146 attrdatastart = data->attriddata[v + 1];
3148 case REPOKEY_TYPE_IDARRAY:
3149 case REPOKEY_TYPE_DIRNUMNUMARRAY:
3150 if ((unsigned int)attrs[1] < attriddatastart)
3151 attriddatastart = attrs[1];
3153 case REPOKEY_TYPE_FIXARRAY:
3154 case REPOKEY_TYPE_FLEXARRAY:
3162 printf("compact_attrdata %d %d\n", entry, nentry);
3163 printf("attrdatastart: %d\n", attrdatastart);
3164 printf("attriddatastart: %d\n", attriddatastart);
3166 if (attrdatastart < 1024 * 1024 * 4 && attriddatastart < 1024 * 1024)
3168 for (i = entry; i < nentry; i++)
3170 Id v, *attrs = data->attrs[i];
3173 for (; *attrs; attrs += 2)
3175 switch (data->keys[*attrs].type)
3177 case REPOKEY_TYPE_STR:
3178 case REPOKEY_TYPE_BINARY:
3180 attrs[1] -= attrdatastart;
3182 case REPOKEY_TYPE_DIRSTRARRAY:
3183 for (v = attrs[1]; data->attriddata[v] ; v += 2)
3184 data->attriddata[v + 1] -= attrdatastart;
3186 case REPOKEY_TYPE_IDARRAY:
3187 case REPOKEY_TYPE_DIRNUMNUMARRAY:
3188 attrs[1] -= attriddatastart;
3197 data->attrdatalen -= attrdatastart;
3198 memmove(data->attrdata, data->attrdata + attrdatastart, data->attrdatalen);
3199 data->attrdata = solv_extend_resize(data->attrdata, data->attrdatalen, 1, REPODATA_ATTRDATA_BLOCK);
3201 if (attriddatastart)
3203 data->attriddatalen -= attriddatastart;
3204 memmove(data->attriddata, data->attriddata + attriddatastart, data->attriddatalen * sizeof(Id));
3205 data->attriddata = solv_extend_resize(data->attriddata, data->attriddatalen, sizeof(Id), REPODATA_ATTRIDDATA_BLOCK);
3209 /* internalalize some key into incore/vincore data */
3212 repodata_serialize_key(Repodata *data, struct extdata *newincore,
3213 struct extdata *newvincore,
3215 Repokey *key, Id val)
3219 unsigned int oldvincorelen = 0;
3223 if (key->storage == KEY_STORAGE_VERTICAL_OFFSET)
3226 oldvincorelen = xd->len;
3230 case REPOKEY_TYPE_VOID:
3231 case REPOKEY_TYPE_CONSTANT:
3232 case REPOKEY_TYPE_CONSTANTID:
3233 case REPOKEY_TYPE_DELETED:
3235 case REPOKEY_TYPE_STR:
3236 data_addblob(xd, data->attrdata + val, strlen((char *)(data->attrdata + val)) + 1);
3238 case REPOKEY_TYPE_MD5:
3239 data_addblob(xd, data->attrdata + val, SIZEOF_MD5);
3241 case REPOKEY_TYPE_SHA1:
3242 data_addblob(xd, data->attrdata + val, SIZEOF_SHA1);
3244 case REPOKEY_TYPE_SHA224:
3245 data_addblob(xd, data->attrdata + val, SIZEOF_SHA224);
3247 case REPOKEY_TYPE_SHA256:
3248 data_addblob(xd, data->attrdata + val, SIZEOF_SHA256);
3250 case REPOKEY_TYPE_SHA384:
3251 data_addblob(xd, data->attrdata + val, SIZEOF_SHA384);
3253 case REPOKEY_TYPE_SHA512:
3254 data_addblob(xd, data->attrdata + val, SIZEOF_SHA512);
3256 case REPOKEY_TYPE_NUM:
3257 if (val & 0x80000000)
3259 data_addid64(xd, data->attrnum64data[val ^ 0x80000000]);
3263 case REPOKEY_TYPE_ID:
3264 case REPOKEY_TYPE_DIR:
3265 data_addid(xd, val);
3267 case REPOKEY_TYPE_BINARY:
3270 unsigned char *dp = data_read_id(data->attrdata + val, &len);
3271 dp += (unsigned int)len;
3272 data_addblob(xd, data->attrdata + val, dp - (data->attrdata + val));
3275 case REPOKEY_TYPE_IDARRAY:
3276 for (ida = data->attriddata + val; *ida; ida++)
3277 data_addideof(xd, ida[0], ida[1] ? 0 : 1);
3279 case REPOKEY_TYPE_DIRNUMNUMARRAY:
3280 for (ida = data->attriddata + val; *ida; ida += 3)
3282 data_addid(xd, ida[0]);
3283 data_addid(xd, ida[1]);
3284 data_addideof(xd, ida[2], ida[3] ? 0 : 1);
3287 case REPOKEY_TYPE_DIRSTRARRAY:
3288 for (ida = data->attriddata + val; *ida; ida += 2)
3290 data_addideof(xd, ida[0], ida[2] ? 0 : 1);
3291 data_addblob(xd, data->attrdata + ida[1], strlen((char *)(data->attrdata + ida[1])) + 1);
3294 case REPOKEY_TYPE_FIXARRAY:
3298 for (ida = data->attriddata + val; *ida; ida++)
3302 kp = data->xattrs[-*ida];
3304 continue; /* ignore empty elements */
3306 for (; *kp; kp += 2)
3310 schemaid = repodata_schema2id(data, schema, 1);
3311 else if (schemaid != repodata_schema2id(data, schema, 0))
3313 pool_debug(data->repo->pool, SOLV_ERROR, "repodata_serialize_key: fixarray substructs with different schemas\n");
3318 data_addid(xd, num);
3321 data_addid(xd, schemaid);
3322 for (ida = data->attriddata + val; *ida; ida++)
3324 Id *kp = data->xattrs[-*ida];
3327 for (; *kp; kp += 2)
3328 repodata_serialize_key(data, newincore, newvincore, schema, data->keys + *kp, kp[1]);
3332 case REPOKEY_TYPE_FLEXARRAY:
3335 for (ida = data->attriddata + val; *ida; ida++)
3337 data_addid(xd, num);
3338 for (ida = data->attriddata + val; *ida; ida++)
3340 Id *kp = data->xattrs[-*ida];
3343 data_addid(xd, 0); /* XXX */
3350 schemaid = repodata_schema2id(data, schema, 1);
3351 data_addid(xd, schemaid);
3352 kp = data->xattrs[-*ida];
3354 repodata_serialize_key(data, newincore, newvincore, schema, data->keys + *kp, kp[1]);
3359 pool_debug(data->repo->pool, SOLV_FATAL, "repodata_serialize_key: don't know how to handle type %d\n", key->type);
3362 if (key->storage == KEY_STORAGE_VERTICAL_OFFSET)
3364 /* put offset/len in incore */
3365 data_addid(newincore, data->lastverticaloffset + oldvincorelen);
3366 oldvincorelen = xd->len - oldvincorelen;
3367 data_addid(newincore, oldvincorelen);
3371 /* create a circular linked list of all keys that share
3372 * the same keyname */
3374 calculate_keylink(Repodata *data)
3378 Id maxkeyname = 0, *keytable = 0;
3379 link = solv_calloc(data->nkeys, sizeof(Id));
3380 if (data->nkeys <= 2)
3382 for (i = 1; i < data->nkeys; i++)
3384 Id n = data->keys[i].name;
3385 if (n >= maxkeyname)
3387 keytable = solv_realloc2(keytable, n + 128, sizeof(Id));
3388 memset(keytable + maxkeyname, 0, (n + 128 - maxkeyname) * sizeof(Id));
3389 maxkeyname = n + 128;
3399 /* remove links that just point to themselfs */
3400 for (i = 1; i < data->nkeys; i++)
3403 solv_free(keytable);
3408 repodata_internalize(Repodata *data)
3410 Repokey *key, solvkey;
3412 Id schemaid, keyid, *schema, *sp, oldschemaid, *keyp, *seen;
3413 Offset *oldincoreoffs = 0;
3415 unsigned char *dp, *ndp;
3417 struct extdata newincore;
3418 struct extdata newvincore;
3423 if (!data->attrs && !data->xattrs)
3427 printf("repodata_internalize %d\n", data->repodataid);
3428 printf(" attr data: %d K\n", data->attrdatalen / 1024);
3429 printf(" attrid data: %d K\n", data->attriddatalen / (1024 / 4));
3431 newvincore.buf = data->vincore;
3432 newvincore.len = data->vincorelen;
3434 /* find the solvables key, create if needed */
3435 memset(&solvkey, 0, sizeof(solvkey));
3436 solvkey.name = REPOSITORY_SOLVABLES;
3437 solvkey.type = REPOKEY_TYPE_FLEXARRAY;
3439 solvkey.storage = KEY_STORAGE_INCORE;
3440 solvkeyid = repodata_key2id(data, &solvkey, data->end != data->start ? 1 : 0);
3442 schema = solv_malloc2(data->nkeys, sizeof(Id));
3443 seen = solv_malloc2(data->nkeys, sizeof(Id));
3445 /* Merge the data already existing (in data->schemata, ->incoredata and
3446 friends) with the new attributes in data->attrs[]. */
3447 nentry = data->end - data->start;
3448 memset(&newincore, 0, sizeof(newincore));
3449 data_addid(&newincore, 0); /* start data at offset 1 */
3451 data->mainschema = 0;
3452 data->mainschemaoffsets = solv_free(data->mainschemaoffsets);
3454 keylink = calculate_keylink(data);
3455 /* join entry data */
3456 /* we start with the meta data, entry -1 */
3457 for (entry = -1; entry < nentry; entry++)
3460 dp = data->incoredata;
3463 dp += entry >= 0 ? data->incoreoffset[entry] : 1;
3464 dp = data_read_id(dp, &oldschemaid);
3466 memset(seen, 0, data->nkeys * sizeof(Id));
3468 fprintf(stderr, "oldschemaid %d\n", oldschemaid);
3469 fprintf(stderr, "schemata %d\n", data->schemata[oldschemaid]);
3470 fprintf(stderr, "schemadata %p\n", data->schemadata);
3473 /* seen: -1: old data, 0: skipped, >0: id + 1 */
3477 for (keyp = data->schemadata + data->schemata[oldschemaid]; *keyp; keyp++)
3481 /* oops, should not happen */
3485 seen[*keyp] = -1; /* use old marker */
3488 haveoldkl = 1; /* potential keylink conflict */
3491 /* strip solvables key */
3492 if (entry < 0 && solvkeyid && seen[solvkeyid])
3495 for (sp = keyp = schema; *sp; sp++)
3496 if (*sp != solvkeyid)
3499 seen[solvkeyid] = 0;
3503 /* add new entries */
3505 keyp = data->attrs ? data->attrs[entry] : 0;
3507 keyp = data->xattrs ? data->xattrs[1] : 0;
3509 for (; *keyp; keyp += 2)
3515 if (haveoldkl && keylink[*keyp]) /* this should be pretty rare */
3518 for (kl = keylink[*keyp]; kl != *keyp; kl = keylink[kl])
3521 /* replacing old key kl, remove from schema and seen */
3523 for (osp = schema; osp < sp; osp++)
3526 memmove(osp, osp + 1, (sp - osp) * sizeof(Id));
3534 seen[*keyp] = keyp[1] + 1;
3537 /* add solvables key if needed */
3538 if (entry < 0 && data->end != data->start)
3540 *sp++ = solvkeyid; /* always last in schema */
3547 /* Ideally we'd like to sort the new schema here, to ensure
3548 schema equality independend of the ordering. */
3549 schemaid = repodata_schema2id(data, schema, 1);
3551 schemaid = oldschemaid;
3555 data->mainschemaoffsets = solv_calloc(sp - schema, sizeof(Id));
3556 data->mainschema = schemaid;
3559 /* find offsets in old incore data */
3563 for (sp = data->schemadata + data->schemata[oldschemaid]; *sp; sp++)
3564 if (seen[*sp] == -1)
3565 lastneeded = sp + 1;
3569 oldincoreoffs = solv_malloc2(data->nkeys, 2 * sizeof(Offset));
3570 for (sp = data->schemadata + data->schemata[oldschemaid]; sp != lastneeded; sp++)
3572 /* Skip the data associated with this old key. */
3573 key = data->keys + *sp;
3575 if (key->storage == KEY_STORAGE_VERTICAL_OFFSET)
3577 ndp = data_skip(ndp, REPOKEY_TYPE_ID);
3578 ndp = data_skip(ndp, REPOKEY_TYPE_ID);
3580 else if (key->storage == KEY_STORAGE_INCORE)
3581 ndp = data_skip_key(data, ndp, key);
3582 oldincoreoffs[*sp * 2] = dp - data->incoredata;
3583 oldincoreoffs[*sp * 2 + 1] = ndp - dp;
3589 /* just copy over the complete old entry (including the schemaid) if there was no new data */
3590 if (entry >= 0 && !neednewschema && oldschemaid && (!data->attrs || !data->attrs[entry]) && dp)
3592 ndp = data->incoredata + data->incoreoffset[entry];
3593 data->incoreoffset[entry] = newincore.len;
3594 data_addblob(&newincore, ndp, dp - ndp);
3598 /* Now create data blob. We walk through the (possibly new) schema
3599 and either copy over old data, or insert the new. */
3601 data->incoreoffset[entry] = newincore.len;
3602 data_addid(&newincore, schemaid);
3604 /* we don't use a pointer to the schemadata here as repodata_serialize_key
3605 * may call repodata_schema2id() which might realloc our schemadata */
3606 for (schemaidx = data->schemata[schemaid]; (keyid = data->schemadata[schemaidx]) != 0; schemaidx++)
3610 data->mainschemaoffsets[schemaidx - data->schemata[schemaid]] = newincore.len;
3611 if (keyid == solvkeyid)
3613 /* add flexarray entry count */
3614 data_addid(&newincore, data->end - data->start);
3615 break; /* always the last entry */
3618 if (seen[keyid] == -1)
3620 if (oldincoreoffs[keyid * 2 + 1])
3621 data_addblob(&newincore, data->incoredata + oldincoreoffs[keyid * 2], oldincoreoffs[keyid * 2 + 1]);
3623 else if (seen[keyid])
3624 repodata_serialize_key(data, &newincore, &newvincore, schema, data->keys + keyid, seen[keyid] - 1);
3629 if (entry >= 0 && data->attrs)
3631 if (data->attrs[entry])
3632 data->attrs[entry] = solv_free(data->attrs[entry]);
3633 if (entry && entry % 4096 == 0 && data->nxattrs <= 2 && entry + 64 < nentry)
3635 compact_attrdata(data, entry + 1, nentry); /* try to free some memory */
3637 printf(" attr data: %d K\n", data->attrdatalen / 1024);
3638 printf(" attrid data: %d K\n", data->attriddatalen / (1024 / 4));
3639 printf(" incore data: %d K\n", newincore.len / 1024);
3640 printf(" sum: %d K\n", (newincore.len + data->attrdatalen + data->attriddatalen * 4) / 1024);
3641 /* malloc_stats(); */
3646 /* free all xattrs */
3647 for (entry = 0; entry < data->nxattrs; entry++)
3648 if (data->xattrs[entry])
3649 solv_free(data->xattrs[entry]);
3650 data->xattrs = solv_free(data->xattrs);
3653 data->lasthandle = 0;
3655 data->lastdatalen = 0;
3659 solv_free(oldincoreoffs);
3660 repodata_free_schemahash(data);
3662 solv_free(data->incoredata);
3663 data->incoredata = newincore.buf;
3664 data->incoredatalen = newincore.len;
3665 data->incoredatafree = 0;
3667 data->vincore = newvincore.buf;
3668 data->vincorelen = newvincore.len;
3670 data->attrs = solv_free(data->attrs);
3671 data->attrdata = solv_free(data->attrdata);
3672 data->attriddata = solv_free(data->attriddata);
3673 data->attrnum64data = solv_free(data->attrnum64data);
3674 data->attrdatalen = 0;
3675 data->attriddatalen = 0;
3676 data->attrnum64datalen = 0;
3678 printf("repodata_internalize %d done\n", data->repodataid);
3679 printf(" incore data: %d K\n", data->incoredatalen / 1024);
3684 repodata_disable_paging(Repodata *data)
3686 if (maybe_load_repodata(data, 0))
3688 repopagestore_disable_paging(&data->store);
3693 /* call the pool's loadcallback to load a stub repodata */
3695 repodata_stub_loader(Repodata *data)
3697 Repo *repo = data->repo;
3698 Pool *pool = repo->pool;
3700 struct s_Pool_tmpspace oldtmpspace;
3703 if (!pool->loadcallback)
3705 data->state = REPODATA_ERROR;
3708 data->state = REPODATA_LOADING;
3710 /* save tmp space and pos */
3711 oldtmpspace = pool->tmpspace;
3712 memset(&pool->tmpspace, 0, sizeof(pool->tmpspace));
3715 r = pool->loadcallback(pool, data, pool->loadcallbackdata);
3717 /* restore tmp space and pos */
3718 for (i = 0; i < POOL_TMPSPACEBUF; i++)
3719 solv_free(pool->tmpspace.buf[i]);
3720 pool->tmpspace = oldtmpspace;
3721 if (r && oldpos.repo == repo && oldpos.repodataid == data->repodataid)
3722 memset(&oldpos, 0, sizeof(oldpos));
3725 data->state = r ? REPODATA_AVAILABLE : REPODATA_ERROR;
3729 repodata_add_stubkey(Repodata *data, Id keyname, Id keytype)
3733 xkey.name = keyname;
3734 xkey.type = keytype;
3735 xkey.storage = KEY_STORAGE_INCORE;
3737 repodata_key2id(data, &xkey, 1);
3741 repodata_add_stub(Repodata **datap)
3743 Repodata *data = *datap;
3744 Repo *repo = data->repo;
3745 Id repodataid = data - repo->repodata;
3746 Repodata *sdata = repo_add_repodata(repo, 0);
3747 data = repo->repodata + repodataid;
3748 if (data->end > data->start)
3749 repodata_extend_block(sdata, data->start, data->end - data->start);
3750 sdata->state = REPODATA_STUB;
3751 sdata->loadcallback = repodata_stub_loader;
3757 repodata_create_stubs(Repodata *data)
3759 Repo *repo = data->repo;
3760 Pool *pool = repo->pool;
3767 dataiterator_init(&di, pool, repo, SOLVID_META, REPOSITORY_EXTERNAL, 0, 0);
3768 while (dataiterator_step(&di))
3769 if (di.data == data)
3771 dataiterator_free(&di);
3774 stubdataids = solv_calloc(cnt, sizeof(*stubdataids));
3775 for (i = 0; i < cnt; i++)
3777 sdata = repodata_add_stub(&data);
3778 stubdataids[i] = sdata - repo->repodata;
3781 dataiterator_init(&di, pool, repo, SOLVID_META, REPOSITORY_EXTERNAL, 0, 0);
3783 while (dataiterator_step(&di))
3785 if (di.data != data)
3787 if (di.key->name == REPOSITORY_EXTERNAL && !di.nparents)
3789 dataiterator_entersub(&di);
3790 sdata = repo->repodata + stubdataids[i++];
3794 repodata_set_kv(sdata, SOLVID_META, di.key->name, di.key->type, &di.kv);
3795 if (di.key->name == REPOSITORY_KEYS && di.key->type == REPOKEY_TYPE_IDARRAY)
3800 xkeyname = di.kv.id;
3804 repodata_add_stubkey(sdata, xkeyname, di.kv.id);
3805 if (xkeyname == SOLVABLE_FILELIST)
3806 repodata_set_filelisttype(sdata, REPODATA_FILELIST_EXTENSION);
3811 dataiterator_free(&di);
3812 for (i = 0; i < cnt; i++)
3813 repodata_internalize(repo->repodata + stubdataids[i]);
3814 solv_free(stubdataids);
3819 repodata_set_filelisttype(Repodata *data, int type)
3821 data->filelisttype = type;
3825 repodata_memused(Repodata *data)
3827 return data->incoredatalen + data->vincorelen;