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"
41 #define REPODATA_BLOCK 255
43 static unsigned char *data_skip_key(Repodata *data, unsigned char *dp, Repokey *key);
46 repodata_initdata(Repodata *data, Repo *repo, int localpool)
48 memset(data, 0, sizeof (*data));
49 data->repodataid = data - repo->repodata;
51 data->localpool = localpool;
53 stringpool_init_empty(&data->spool);
54 /* dirpool_init(&data->dirpool); just zeros out again */
55 data->keys = solv_calloc(1, sizeof(Repokey));
57 data->schemata = solv_calloc(1, sizeof(Id));
58 data->schemadata = solv_calloc(1, sizeof(Id));
60 data->schemadatalen = 1;
61 repopagestore_init(&data->store);
65 repodata_freedata(Repodata *data)
69 solv_free(data->keys);
71 solv_free(data->schemata);
72 solv_free(data->schemadata);
73 solv_free(data->schematahash);
75 stringpool_free(&data->spool);
76 dirpool_free(&data->dirpool);
78 solv_free(data->mainschemaoffsets);
79 solv_free(data->incoredata);
80 solv_free(data->incoreoffset);
81 solv_free(data->verticaloffset);
83 repopagestore_free(&data->store);
85 solv_free(data->vincore);
88 for (i = 0; i < data->end - data->start; i++)
89 solv_free(data->attrs[i]);
90 solv_free(data->attrs);
92 for (i = 0; i < data->nxattrs; i++)
93 solv_free(data->xattrs[i]);
94 solv_free(data->xattrs);
96 solv_free(data->attrdata);
97 solv_free(data->attriddata);
98 solv_free(data->attrnum64data);
100 solv_free(data->dircache);
102 repodata_free_filelistfilter(data);
106 repodata_free(Repodata *data)
108 Repo *repo = data->repo;
109 int i = data - repo->repodata;
112 repodata_freedata(data);
113 if (i < repo->nrepodata - 1)
115 /* whoa! this changes the repodataids! */
116 memmove(repo->repodata + i, repo->repodata + i + 1, (repo->nrepodata - 1 - i) * sizeof(Repodata));
117 for (; i < repo->nrepodata - 1; i++)
118 repo->repodata[i].repodataid = i;
121 if (repo->nrepodata == 1)
123 repo->repodata = solv_free(repo->repodata);
129 repodata_empty(Repodata *data, int localpool)
131 void (*loadcallback)(Repodata *) = data->loadcallback;
132 int state = data->state;
133 repodata_freedata(data);
134 repodata_initdata(data, data->repo, localpool);
136 data->loadcallback = loadcallback;
140 /***************************************************************
141 * key pool management
144 /* this is not so time critical that we need a hash, so we do a simple
147 repodata_key2id(Repodata *data, Repokey *key, int create)
151 for (keyid = 1; keyid < data->nkeys; keyid++)
152 if (data->keys[keyid].name == key->name && data->keys[keyid].type == key->type)
154 if ((key->type == REPOKEY_TYPE_CONSTANT || key->type == REPOKEY_TYPE_CONSTANTID) && key->size != data->keys[keyid].size)
158 if (keyid == data->nkeys)
162 /* allocate new key */
163 data->keys = solv_realloc2(data->keys, data->nkeys + 1, sizeof(Repokey));
164 data->keys[data->nkeys++] = *key;
165 if (data->verticaloffset)
167 data->verticaloffset = solv_realloc2(data->verticaloffset, data->nkeys, sizeof(Id));
168 data->verticaloffset[data->nkeys - 1] = 0;
170 data->keybits[(key->name >> 3) & (sizeof(data->keybits) - 1)] |= 1 << (key->name & 7);
176 /***************************************************************
177 * schema pool management
180 #define SCHEMATA_BLOCK 31
181 #define SCHEMATADATA_BLOCK 255
184 repodata_schema2id(Repodata *data, Id *schema, int create)
191 return 0; /* XXX: allow empty schema? */
192 if ((schematahash = data->schematahash) == 0)
194 data->schematahash = schematahash = solv_calloc(256, sizeof(Id));
195 for (i = 1; i < data->nschemata; i++)
197 for (sp = data->schemadata + data->schemata[i], h = 0; *sp;)
202 data->schemadata = solv_extend_resize(data->schemadata, data->schemadatalen, sizeof(Id), SCHEMATADATA_BLOCK);
203 data->schemata = solv_extend_resize(data->schemata, data->nschemata, sizeof(Id), SCHEMATA_BLOCK);
206 for (sp = schema, len = 0, h = 0; *sp; len++)
211 cid = schematahash[h];
214 if (!memcmp(data->schemadata + data->schemata[cid], schema, len * sizeof(Id)))
216 /* cache conflict, do a slow search */
217 for (cid = 1; cid < data->nschemata; cid++)
218 if (!memcmp(data->schemadata + data->schemata[cid], schema, len * sizeof(Id)))
224 data->schemadata = solv_extend(data->schemadata, data->schemadatalen, len, sizeof(Id), SCHEMATADATA_BLOCK);
225 data->schemata = solv_extend(data->schemata, data->nschemata, 1, sizeof(Id), SCHEMATA_BLOCK);
227 memcpy(data->schemadata + data->schemadatalen, schema, len * sizeof(Id));
228 data->schemata[data->nschemata] = data->schemadatalen;
229 data->schemadatalen += len;
230 schematahash[h] = data->nschemata;
232 fprintf(stderr, "schema2id: new schema\n");
234 return data->nschemata++;
238 repodata_free_schemahash(Repodata *data)
240 data->schematahash = solv_free(data->schematahash);
242 data->schemata = solv_realloc2(data->schemata, data->nschemata, sizeof(Id));
243 data->schemadata = solv_realloc2(data->schemadata, data->schemadatalen, sizeof(Id));
247 /***************************************************************
248 * dir pool management
251 #ifndef HAVE_STRCHRNUL
252 static inline const char *strchrnul(const char *str, char x)
254 const char *p = strchr(str, x);
255 return p ? p : str + strlen(str);
259 #define DIRCACHE_SIZE 41 /* < 1k */
263 Id ids[DIRCACHE_SIZE];
264 char str[(DIRCACHE_SIZE * (DIRCACHE_SIZE - 1)) / 2];
269 repodata_str2dir(Repodata *data, const char *dir, int create)
278 return data->dirpool.ndirs ? 0 : dirpool_add_dir(&data->dirpool, 0, 0, create);
279 while (*dir == '/' && dir[1] == '/')
281 if (*dir == '/' && !dir[1])
282 return data->dirpool.ndirs ? 1 : dirpool_add_dir(&data->dirpool, 0, 1, create);
289 struct dircache *dircache = data->dircache;
293 if (l < DIRCACHE_SIZE && dircache->ids[l] && !memcmp(dircache->str + l * (l - 1) / 2, dir, l))
295 parent = dircache->ids[l];
311 dire = strchrnul(dir, '/');
313 id = stringpool_strn2id(&data->spool, dir, dire - dir, create);
315 id = pool_strn2id(data->repo->pool, dir, dire - dir, create);
318 parent = dirpool_add_dir(&data->dirpool, parent, id, create);
323 data->dircache = solv_calloc(1, sizeof(struct dircache));
327 if (l < DIRCACHE_SIZE)
329 data->dircache->ids[l] = parent;
330 memcpy(data->dircache->str + l * (l - 1) / 2, dirs, l);
344 repodata_free_dircache(Repodata *data)
346 data->dircache = solv_free(data->dircache);
350 repodata_dir2str(Repodata *data, Id did, const char *suf)
352 Pool *pool = data->repo->pool;
359 return suf ? suf : "";
360 if (did == 1 && !suf)
365 comp = dirpool_compid(&data->dirpool, parent);
366 comps = stringpool_id2str(data->localpool ? &data->spool : &pool->ss, comp);
368 parent = dirpool_parent(&data->dirpool, parent);
373 l += strlen(suf) + 1;
374 p = pool_alloctmpspace(pool, l + 1) + l;
385 comp = dirpool_compid(&data->dirpool, parent);
386 comps = stringpool_id2str(data->localpool ? &data->spool : &pool->ss, comp);
389 strncpy(p, comps, l);
390 parent = dirpool_parent(&data->dirpool, parent);
398 /***************************************************************
402 static inline unsigned char *
403 data_skip_schema(Repodata *data, unsigned char *dp, Id schema)
405 Id *keyp = data->schemadata + data->schemata[schema];
406 for (; *keyp; keyp++)
407 dp = data_skip_key(data, dp, data->keys + *keyp);
411 static unsigned char *
412 data_skip_key(Repodata *data, unsigned char *dp, Repokey *key)
414 int nentries, schema;
417 case REPOKEY_TYPE_FIXARRAY:
418 dp = data_read_id(dp, &nentries);
421 dp = data_read_id(dp, &schema);
423 dp = data_skip_schema(data, dp, schema);
425 case REPOKEY_TYPE_FLEXARRAY:
426 dp = data_read_id(dp, &nentries);
429 dp = data_read_id(dp, &schema);
430 dp = data_skip_schema(data, dp, schema);
434 if (key->storage == KEY_STORAGE_INCORE)
435 dp = data_skip(dp, key->type);
436 else if (key->storage == KEY_STORAGE_VERTICAL_OFFSET)
438 dp = data_skip(dp, REPOKEY_TYPE_ID);
439 dp = data_skip(dp, REPOKEY_TYPE_ID);
445 static unsigned char *
446 forward_to_key(Repodata *data, Id keyid, Id *keyp, unsigned char *dp)
452 if (data->mainschemaoffsets && dp == data->incoredata + data->mainschemaoffsets[0] && keyp == data->schemadata + data->schemata[data->mainschema])
455 for (i = 0; (k = *keyp++) != 0; i++)
457 return data->incoredata + data->mainschemaoffsets[i];
460 while ((k = *keyp++) != 0)
464 if (data->keys[k].storage == KEY_STORAGE_VERTICAL_OFFSET)
466 dp = data_skip(dp, REPOKEY_TYPE_ID); /* skip offset */
467 dp = data_skip(dp, REPOKEY_TYPE_ID); /* skip length */
470 if (data->keys[k].storage != KEY_STORAGE_INCORE)
472 dp = data_skip_key(data, dp, data->keys + k);
477 static unsigned char *
478 get_vertical_data(Repodata *data, Repokey *key, Id off, Id len)
483 if (off >= data->lastverticaloffset)
485 off -= data->lastverticaloffset;
486 if ((unsigned int)off + len > data->vincorelen)
488 return data->vincore + off;
490 if ((unsigned int)off + len > key->size)
492 /* we now have the offset, go into vertical */
493 off += data->verticaloffset[key - data->keys];
494 /* fprintf(stderr, "key %d page %d\n", key->name, off / REPOPAGE_BLOBSIZE); */
495 dp = repopagestore_load_page_range(&data->store, off / REPOPAGE_BLOBSIZE, (off + len - 1) / REPOPAGE_BLOBSIZE);
498 dp += off % REPOPAGE_BLOBSIZE;
502 static inline unsigned char *
503 get_data(Repodata *data, Repokey *key, unsigned char **dpp, int advance)
505 unsigned char *dp = *dpp;
509 if (key->storage == KEY_STORAGE_INCORE)
512 *dpp = data_skip_key(data, dp, key);
515 else if (key->storage == KEY_STORAGE_VERTICAL_OFFSET)
518 dp = data_read_id(dp, &off);
519 dp = data_read_id(dp, &len);
522 return get_vertical_data(data, key, off, len);
528 repodata_load(Repodata *data)
530 if (data->state != REPODATA_STUB)
532 if (data->loadcallback)
533 data->loadcallback(data);
535 data->state = REPODATA_ERROR;
539 maybe_load_repodata_stub(Repodata *data, Id keyname)
541 if (data->state != REPODATA_STUB)
543 data->state = REPODATA_ERROR;
549 for (i = 1; i < data->nkeys; i++)
550 if (keyname == data->keys[i].name)
552 if (i == data->nkeys)
556 return data->state == REPODATA_AVAILABLE ? 1 : 0;
560 maybe_load_repodata(Repodata *data, Id keyname)
562 if (keyname && !repodata_precheck_keyname(data, keyname))
563 return 0; /* do not bother... */
564 if (data->state == REPODATA_AVAILABLE || data->state == REPODATA_LOADING)
566 if (data->state == REPODATA_ERROR)
568 return maybe_load_repodata_stub(data, keyname);
571 static inline unsigned char *
572 solvid2data(Repodata *data, Id solvid, Id *schemap)
574 unsigned char *dp = data->incoredata;
577 if (solvid == SOLVID_META)
578 dp += 1; /* offset of "meta" solvable */
579 else if (solvid == SOLVID_POS)
581 Pool *pool = data->repo->pool;
582 if (data->repo != pool->pos.repo)
584 if (data != data->repo->repodata + pool->pos.repodataid)
587 if (pool->pos.dp != 1)
589 *schemap = pool->pos.schema;
595 if (solvid < data->start || solvid >= data->end)
597 dp += data->incoreoffset[solvid - data->start];
599 return data_read_id(dp, schemap);
602 /************************************************************************
606 static unsigned char *
607 find_key_data(Repodata *data, Id solvid, Id keyname, Repokey **keypp)
610 Id schema, *keyp, *kp;
613 if (!maybe_load_repodata(data, keyname))
615 dp = solvid2data(data, solvid, &schema);
618 keyp = data->schemadata + data->schemata[schema];
619 for (kp = keyp; *kp; kp++)
620 if (data->keys[*kp].name == keyname)
624 *keypp = key = data->keys + *kp;
625 if (key->type == REPOKEY_TYPE_DELETED)
627 if (key->type == REPOKEY_TYPE_VOID || key->type == REPOKEY_TYPE_CONSTANT || key->type == REPOKEY_TYPE_CONSTANTID)
628 return dp; /* no need to forward... */
629 if (key->storage != KEY_STORAGE_INCORE && key->storage != KEY_STORAGE_VERTICAL_OFFSET)
630 return 0; /* get_data will not work, no need to forward */
631 dp = forward_to_key(data, *kp, keyp, dp);
634 return get_data(data, key, &dp, 0);
638 repodata_lookup_schemakeys(Repodata *data, Id solvid)
641 if (!maybe_load_repodata(data, 0))
643 if (!solvid2data(data, solvid, &schema))
645 return data->schemadata + data->schemata[schema];
651 Id *keyskip = solv_calloc(3 + 256, sizeof(Id));
653 keyskip[1] = keyskip[2] = 1;
658 repodata_fill_keyskip(Repodata *data, Id solvid, Id *keyskip)
661 Id maxkeyname, value;
662 keyp = repodata_lookup_schemakeys(data, solvid);
664 return keyskip; /* no keys for this solvid */
666 keyskip = alloc_keyskip();
667 maxkeyname = keyskip[0];
668 value = keyskip[1] + data->repodataid;
669 for (; *keyp; keyp++)
671 Id keyname = data->keys[*keyp].name;
672 if (keyname >= maxkeyname)
674 int newmax = (keyname | 255) + 1;
675 keyskip = solv_realloc2(keyskip, 3 + newmax, sizeof(Id));
676 memset(keyskip + (3 + maxkeyname), 0, (newmax - maxkeyname) * sizeof(Id));
677 keyskip[0] = maxkeyname = newmax;
679 keyskip[3 + keyname] = value;
685 repodata_lookup_type(Repodata *data, Id solvid, Id keyname)
687 Id schema, *keyp, *kp;
688 if (!maybe_load_repodata(data, keyname))
690 if (!solvid2data(data, solvid, &schema))
692 keyp = data->schemadata + data->schemata[schema];
693 for (kp = keyp; *kp; kp++)
694 if (data->keys[*kp].name == keyname)
695 return data->keys[*kp].type;
700 repodata_lookup_id(Repodata *data, Id solvid, Id keyname)
706 dp = find_key_data(data, solvid, keyname, &key);
709 if (key->type == REPOKEY_TYPE_CONSTANTID)
711 if (key->type != REPOKEY_TYPE_ID)
713 dp = data_read_id(dp, &id);
718 repodata_lookup_str(Repodata *data, Id solvid, Id keyname)
724 dp = find_key_data(data, solvid, keyname, &key);
727 if (key->type == REPOKEY_TYPE_STR)
728 return (const char *)dp;
729 if (key->type == REPOKEY_TYPE_CONSTANTID)
731 else if (key->type == REPOKEY_TYPE_ID)
732 dp = data_read_id(dp, &id);
736 return stringpool_id2str(&data->spool, id);
737 return pool_id2str(data->repo->pool, id);
741 repodata_lookup_num(Repodata *data, Id solvid, Id keyname, unsigned long long notfound)
745 unsigned int high, low;
747 dp = find_key_data(data, solvid, keyname, &key);
752 case REPOKEY_TYPE_NUM:
753 data_read_num64(dp, &low, &high);
754 return (unsigned long long)high << 32 | low;
755 case REPOKEY_TYPE_CONSTANT:
763 repodata_lookup_void(Repodata *data, Id solvid, Id keyname)
765 return repodata_lookup_type(data, solvid, keyname) == REPOKEY_TYPE_VOID ? 1 : 0;
768 const unsigned char *
769 repodata_lookup_bin_checksum(Repodata *data, Id solvid, Id keyname, Id *typep)
774 dp = find_key_data(data, solvid, keyname, &key);
789 repodata_lookup_idarray(Repodata *data, Id solvid, Id keyname, Queue *q)
797 dp = find_key_data(data, solvid, keyname, &key);
802 case REPOKEY_TYPE_CONSTANTID:
803 queue_push(q, key->size);
805 case REPOKEY_TYPE_ID:
806 dp = data_read_id(dp, &id);
809 case REPOKEY_TYPE_IDARRAY:
812 dp = data_read_ideof(dp, &id, &eof);
825 repodata_lookup_binary(Repodata *data, Id solvid, Id keyname, int *lenp)
831 dp = find_key_data(data, solvid, keyname, &key);
832 if (!dp || key->type != REPOKEY_TYPE_BINARY)
837 dp = data_read_id(dp, &len);
842 /* highly specialized function to speed up fileprovides adding.
843 * - repodata must be available
844 * - solvid must be >= data->start and < data->end
845 * - returns NULL is not found, a "" entry if wrong type
846 * - also returns wrong type for REPOKEY_TYPE_DELETED
848 const unsigned char *
849 repodata_lookup_packed_dirstrarray(Repodata *data, Id solvid, Id keyname)
851 static unsigned char wrongtype[2] = { 0x00 /* dir id 0 */, 0 /* "" */ };
853 Id schema, *keyp, *kp;
856 if (!data->incoredata || !data->incoreoffset[solvid - data->start])
858 dp = data->incoredata + data->incoreoffset[solvid - data->start];
859 dp = data_read_id(dp, &schema);
860 keyp = data->schemadata + data->schemata[schema];
861 for (kp = keyp; *kp; kp++)
862 if (data->keys[*kp].name == keyname)
866 key = data->keys + *kp;
867 if (key->type != REPOKEY_TYPE_DIRSTRARRAY)
869 dp = forward_to_key(data, *kp, keyp, dp);
870 if (key->storage == KEY_STORAGE_INCORE)
872 if (key->storage == KEY_STORAGE_VERTICAL_OFFSET && dp)
875 dp = data_read_id(dp, &off);
876 data_read_id(dp, &len);
877 return get_vertical_data(data, key, off, len);
882 /* id translation functions */
885 repodata_globalize_id(Repodata *data, Id id, int create)
887 if (!id || !data || !data->localpool)
889 return pool_str2id(data->repo->pool, stringpool_id2str(&data->spool, id), create);
893 repodata_localize_id(Repodata *data, Id id, int create)
895 if (!id || !data || !data->localpool)
897 return stringpool_str2id(&data->spool, pool_id2str(data->repo->pool, id), create);
901 repodata_translate_id(Repodata *data, Repodata *fromdata, Id id, int create)
904 if (!id || !data || !fromdata)
906 if (data == fromdata || (!data->localpool && !fromdata->localpool))
908 if (fromdata->localpool)
909 s = stringpool_id2str(&fromdata->spool, id);
911 s = pool_id2str(data->repo->pool, id);
913 return stringpool_str2id(&data->spool, s, create);
915 return pool_str2id(data->repo->pool, s, create);
919 repodata_translate_dir_slow(Repodata *data, Repodata *fromdata, Id dir, int create, Id *cache)
924 /* make sure that the dirpool has an entry */
925 if (create && !data->dirpool.ndirs)
926 dirpool_add_dir(&data->dirpool, 0, 0, create);
929 parent = dirpool_parent(&fromdata->dirpool, dir);
932 if (!(parent = repodata_translate_dir(data, fromdata, parent, create, cache)))
935 compid = dirpool_compid(&fromdata->dirpool, dir);
936 if (compid > 1 && (data->localpool || fromdata->localpool))
938 if (!(compid = repodata_translate_id(data, fromdata, compid, create)))
941 if (!(compid = dirpool_add_dir(&data->dirpool, parent, compid, create)))
945 cache[(dir & 255) * 2] = dir;
946 cache[(dir & 255) * 2 + 1] = compid;
951 /************************************************************************
952 * uninternalized lookup / search
956 data_fetch_uninternalized(Repodata *data, Repokey *key, Id value, KeyValue *kv)
962 case REPOKEY_TYPE_STR:
963 kv->str = (const char *)data->attrdata + value;
965 case REPOKEY_TYPE_CONSTANT:
969 case REPOKEY_TYPE_CONSTANTID:
972 case REPOKEY_TYPE_NUM:
975 if (value & 0x80000000)
977 kv->num = (unsigned int)data->attrnum64data[value ^ 0x80000000];
978 kv->num2 = (unsigned int)(data->attrnum64data[value ^ 0x80000000] >> 32);
982 kv->num = 0; /* not stringified */
983 kv->str = (const char *)data->attrdata + value;
985 case REPOKEY_TYPE_BINARY:
986 kv->str = (const char *)data_read_id(data->attrdata + value, (Id *)&kv->num);
988 case REPOKEY_TYPE_IDARRAY:
989 array = data->attriddata + (value + kv->entry);
991 kv->eof = array[1] ? 0 : 1;
993 case REPOKEY_TYPE_DIRSTRARRAY:
994 kv->num = 0; /* not stringified */
995 array = data->attriddata + (value + kv->entry * 2);
997 kv->str = (const char *)data->attrdata + array[1];
998 kv->eof = array[2] ? 0 : 1;
1000 case REPOKEY_TYPE_DIRNUMNUMARRAY:
1001 array = data->attriddata + (value + kv->entry * 3);
1004 kv->num2 = array[2];
1005 kv->eof = array[3] ? 0 : 1;
1007 case REPOKEY_TYPE_FIXARRAY:
1008 case REPOKEY_TYPE_FLEXARRAY:
1009 array = data->attriddata + (value + kv->entry);
1010 kv->id = array[0]; /* the handle */
1011 kv->eof = array[1] ? 0 : 1;
1020 repodata_lookup_kv_uninternalized(Repodata *data, Id solvid, Id keyname, KeyValue *kv)
1023 if (!data->attrs || solvid < data->start || solvid >= data->end)
1025 ap = data->attrs[solvid - data->start];
1028 for (; *ap; ap += 2)
1030 Repokey *key = data->keys + *ap;
1031 if (key->name != keyname)
1033 data_fetch_uninternalized(data, key, ap[1], kv);
1040 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)
1047 if (!data->attrs || solvid < data->start || solvid >= data->end)
1049 ap = data->attrs[solvid - data->start];
1052 for (; *ap; ap += 2)
1054 Repokey *key = data->keys + *ap;
1055 if (keyname && key->name != keyname)
1057 s = solvid > 0 ? data->repo->pool->solvables + solvid : 0;
1061 data_fetch_uninternalized(data, key, ap[1], &kv);
1062 stop = callback(cbdata, s, data, key, &kv);
1065 while (!kv.eof && !stop);
1066 if (keyname || stop > SEARCH_NEXT_KEY)
1071 /************************************************************************
1077 repodata_stringify(Pool *pool, Repodata *data, Repokey *key, KeyValue *kv, int flags)
1081 case REPOKEY_TYPE_ID:
1082 case REPOKEY_TYPE_CONSTANTID:
1083 case REPOKEY_TYPE_IDARRAY:
1084 if (data && data->localpool)
1085 kv->str = stringpool_id2str(&data->spool, kv->id);
1087 kv->str = pool_id2str(pool, kv->id);
1088 if ((flags & SEARCH_SKIP_KIND) != 0 && key->storage == KEY_STORAGE_SOLVABLE && (key->name == SOLVABLE_NAME || key->type == REPOKEY_TYPE_IDARRAY))
1091 for (s = kv->str; *s >= 'a' && *s <= 'z'; s++)
1093 if (*s == ':' && s > kv->str)
1097 case REPOKEY_TYPE_STR:
1099 case REPOKEY_TYPE_DIRSTRARRAY:
1100 if (!(flags & SEARCH_FILES))
1101 return kv->str; /* match just the basename */
1103 return kv->str; /* already stringified */
1104 /* Put the full filename into kv->str. */
1105 kv->str = repodata_dir2str(data, kv->id, kv->str);
1106 kv->num = 1; /* mark stringification */
1109 if (!(flags & SEARCH_CHECKSUMS))
1110 return 0; /* skip em */
1112 return kv->str; /* already stringified */
1113 kv->str = repodata_chk2str(data, key->type, (const unsigned char *)kv->str);
1114 kv->num = 1; /* mark stringification */
1122 /* this is an internal hack to pass the parent kv to repodata_search_keyskip */
1123 struct subschema_data {
1130 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)
1132 repodata_search_keyskip(data, solvid, keyname, flags | SEARCH_SUBSCHEMA, (Id *)kv, callback, cbdata);
1136 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)
1138 Solvable *s = solvid > 0 ? data->repo->pool->solvables + solvid : 0;
1139 unsigned char *dp = (unsigned char *)kv->str;
1143 if (!dp || kv->entry != -1)
1145 while (++kv->entry < (int)kv->num)
1148 dp = data_skip_schema(data, dp, schema);
1149 if (kv->entry == 0 || key->type == REPOKEY_TYPE_FLEXARRAY)
1150 dp = data_read_id(dp, &schema);
1152 kv->str = (const char *)dp;
1153 kv->eof = kv->entry == kv->num - 1 ? 1 : 0;
1154 stop = callback(cbdata, s, data, key, kv);
1155 if (stop && stop != SEARCH_ENTERSUB)
1157 if ((flags & SEARCH_SUB) != 0 || stop == SEARCH_ENTERSUB)
1158 repodata_search_keyskip(data, solvid, keyname, flags | SEARCH_SUBSCHEMA, (Id *)kv, callback, cbdata);
1160 if ((flags & SEARCH_ARRAYSENTINEL) != 0)
1163 dp = data_skip_schema(data, dp, schema);
1165 kv->str = (const char *)dp;
1167 return callback(cbdata, s, data, key, kv);
1172 /* search a specific repodata */
1174 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)
1178 Id keyid, *kp, *keyp;
1179 unsigned char *dp, *ddp;
1185 if (!maybe_load_repodata(data, keyname))
1187 if ((flags & SEARCH_SUBSCHEMA) != 0)
1189 flags ^= SEARCH_SUBSCHEMA;
1190 kv.parent = (KeyValue *)keyskip;
1192 schema = kv.parent->id;
1193 dp = (unsigned char *)kv.parent->str;
1198 dp = solvid2data(data, solvid, &schema);
1203 s = solvid > 0 ? data->repo->pool->solvables + solvid : 0;
1204 keyp = data->schemadata + data->schemata[schema];
1207 /* search for a specific key */
1208 for (kp = keyp; *kp; kp++)
1209 if (data->keys[*kp].name == keyname)
1213 dp = forward_to_key(data, *kp, keyp, dp);
1219 while ((keyid = *keyp++) != 0)
1222 key = data->keys + keyid;
1223 ddp = get_data(data, key, &dp, *keyp && !onekey ? 1 : 0);
1225 if (keyskip && (key->name >= keyskip[0] || keyskip[3 + key->name] != keyskip[1] + data->repodataid))
1231 if (key->type == REPOKEY_TYPE_DELETED && !(flags & SEARCH_KEEP_TYPE_DELETED))
1237 if (key->type == REPOKEY_TYPE_FLEXARRAY || key->type == REPOKEY_TYPE_FIXARRAY)
1240 ddp = data_read_id(ddp, (Id *)&kv.num);
1241 kv.str = (const char *)ddp;
1242 stop = repodata_search_array(data, solvid, 0, flags, key, &kv, callback, cbdata);
1243 if (onekey || stop > SEARCH_NEXT_KEY)
1250 ddp = data_fetch(ddp, &kv, key);
1253 stop = callback(cbdata, s, data, key, &kv);
1256 while (!kv.eof && !stop);
1257 if (onekey || stop > SEARCH_NEXT_KEY)
1263 repodata_search(Repodata *data, Id solvid, Id keyname, int flags, int (*callback)(void *cbdata, Solvable *s, Repodata *data, Repokey *key, KeyValue *kv), void *cbdata)
1265 repodata_search_keyskip(data, solvid, keyname, flags, 0, callback, cbdata);
1269 repodata_setpos_kv(Repodata *data, KeyValue *kv)
1271 Pool *pool = data->repo->pool;
1273 pool_clear_pos(pool);
1276 pool->pos.repo = data->repo;
1277 pool->pos.repodataid = data - data->repo->repodata;
1278 pool->pos.dp = (unsigned char *)kv->str - data->incoredata;
1279 pool->pos.schema = kv->id;
1283 /************************************************************************
1284 * data iterator functions
1288 solvabledata_fetch(Solvable *s, KeyValue *kv, Id keyname)
1302 case SOLVABLE_VENDOR:
1305 case SOLVABLE_PROVIDES:
1307 return s->provides ? s->repo->idarraydata + s->provides : 0;
1308 case SOLVABLE_OBSOLETES:
1310 return s->obsoletes ? s->repo->idarraydata + s->obsoletes : 0;
1311 case SOLVABLE_CONFLICTS:
1313 return s->conflicts ? s->repo->idarraydata + s->conflicts : 0;
1314 case SOLVABLE_REQUIRES:
1316 return s->requires ? s->repo->idarraydata + s->requires : 0;
1317 case SOLVABLE_RECOMMENDS:
1319 return s->recommends ? s->repo->idarraydata + s->recommends : 0;
1320 case SOLVABLE_SUPPLEMENTS:
1322 return s->supplements ? s->repo->idarraydata + s->supplements : 0;
1323 case SOLVABLE_SUGGESTS:
1325 return s->suggests ? s->repo->idarraydata + s->suggests : 0;
1326 case SOLVABLE_ENHANCES:
1328 return s->enhances ? s->repo->idarraydata + s->enhances : 0;
1331 return s->repo->rpmdbid ? s->repo->rpmdbid + (s - s->repo->pool->solvables - s->repo->start) : 0;
1338 datamatcher_init(Datamatcher *ma, const char *match, int flags)
1340 match = match ? solv_strdup(match) : 0;
1345 if ((flags & SEARCH_STRINGMASK) == SEARCH_REGEX)
1347 ma->matchdata = solv_calloc(1, sizeof(regex_t));
1348 ma->error = regcomp((regex_t *)ma->matchdata, match, REG_EXTENDED | REG_NOSUB | REG_NEWLINE | ((flags & SEARCH_NOCASE) ? REG_ICASE : 0));
1351 solv_free(ma->matchdata);
1352 ma->flags = (flags & ~SEARCH_STRINGMASK) | SEARCH_ERROR;
1355 if ((flags & SEARCH_FILES) != 0 && match)
1357 /* prepare basename check */
1358 if ((flags & SEARCH_STRINGMASK) == SEARCH_STRING || (flags & SEARCH_STRINGMASK) == SEARCH_STRINGEND)
1360 const char *p = strrchr(match, '/');
1361 ma->matchdata = (void *)(p ? p + 1 : match);
1363 else if ((flags & SEARCH_STRINGMASK) == SEARCH_GLOB)
1366 for (p = match + strlen(match) - 1; p >= match; p--)
1367 if (*p == '[' || *p == ']' || *p == '*' || *p == '?' || *p == '/')
1369 ma->matchdata = (void *)(p + 1);
1376 datamatcher_free(Datamatcher *ma)
1379 ma->match = solv_free((char *)ma->match);
1380 if ((ma->flags & SEARCH_STRINGMASK) == SEARCH_REGEX && ma->matchdata)
1382 regfree(ma->matchdata);
1383 solv_free(ma->matchdata);
1389 datamatcher_match(Datamatcher *ma, const char *str)
1392 switch ((ma->flags & SEARCH_STRINGMASK))
1394 case SEARCH_SUBSTRING:
1395 if (ma->flags & SEARCH_NOCASE)
1396 return strcasestr(str, ma->match) != 0;
1398 return strstr(str, ma->match) != 0;
1400 if (ma->flags & SEARCH_NOCASE)
1401 return !strcasecmp(ma->match, str);
1403 return !strcmp(ma->match, str);
1404 case SEARCH_STRINGSTART:
1405 if (ma->flags & SEARCH_NOCASE)
1406 return !strncasecmp(ma->match, str, strlen(ma->match));
1408 return !strncmp(ma->match, str, strlen(ma->match));
1409 case SEARCH_STRINGEND:
1410 l = strlen(str) - strlen(ma->match);
1413 if (ma->flags & SEARCH_NOCASE)
1414 return !strcasecmp(ma->match, str + l);
1416 return !strcmp(ma->match, str + l);
1418 return !fnmatch(ma->match, str, (ma->flags & SEARCH_NOCASE) ? FNM_CASEFOLD : 0);
1420 return !regexec((const regex_t *)ma->matchdata, str, 0, NULL, 0);
1426 /* check if the matcher can match the provides basename */
1429 datamatcher_checkbasename(Datamatcher *ma, const char *basename)
1432 const char *match = ma->matchdata;
1435 switch (ma->flags & SEARCH_STRINGMASK)
1439 case SEARCH_STRINGEND:
1440 if (match != ma->match)
1441 break; /* had slash, do exact match on basename */
1444 /* check if the basename ends with match */
1445 l = strlen(basename) - strlen(match);
1451 return 1; /* maybe matches */
1453 if ((ma->flags & SEARCH_NOCASE) != 0)
1454 return !strcasecmp(match, basename);
1456 return !strcmp(match, basename);
1475 di_nextarrayelement,
1481 di_entersolvablekey,
1485 /* see dataiterator.h for documentation */
1487 dataiterator_init(Dataiterator *di, Pool *pool, Repo *repo, Id p, Id keyname, const char *match, int flags)
1489 memset(di, 0, sizeof(*di));
1491 di->flags = flags & ~SEARCH_THISSOLVID;
1492 if (!pool || (repo && repo->pool != pool))
1500 if ((error = datamatcher_init(&di->matcher, match, flags)) != 0)
1506 di->keyname = keyname;
1507 di->keynames[0] = keyname;
1508 dataiterator_set_search(di, repo, p);
1513 dataiterator_init_clone(Dataiterator *di, Dataiterator *from)
1518 if (di->dupstr == di->kv.str)
1519 di->dupstr = solv_memdup(di->dupstr, di->dupstrn);
1526 memset(&di->matcher, 0, sizeof(di->matcher));
1527 if (from->matcher.match)
1528 datamatcher_init(&di->matcher, from->matcher.match, from->matcher.flags);
1533 for (i = 1; i < di->nparents; i++)
1534 di->parents[i].kv.parent = &di->parents[i - 1].kv;
1535 di->kv.parent = &di->parents[di->nparents - 1].kv;
1538 di->oldkeyskip = solv_memdup2(di->oldkeyskip, 3 + di->oldkeyskip[0], sizeof(Id));
1540 di->keyskip = di->oldkeyskip;
1544 dataiterator_set_match(Dataiterator *di, const char *match, int flags)
1546 di->flags = (flags & ~SEARCH_THISSOLVID) | (di->flags & SEARCH_THISSOLVID);
1547 datamatcher_free(&di->matcher);
1548 memset(&di->matcher, 0, sizeof(di->matcher));
1552 if ((error = datamatcher_init(&di->matcher, match, flags)) != 0)
1562 dataiterator_set_search(Dataiterator *di, Repo *repo, Id p)
1566 di->flags &= ~SEARCH_THISSOLVID;
1570 if (!di->pool->urepos)
1578 di->repo = di->pool->repos[di->repoid];
1580 di->state = di_enterrepo;
1582 dataiterator_jump_to_solvid(di, p);
1586 dataiterator_set_keyname(Dataiterator *di, Id keyname)
1589 di->keyname = keyname;
1590 di->keynames[0] = keyname;
1594 dataiterator_prepend_keyname(Dataiterator *di, Id keyname)
1598 if (di->nkeynames >= sizeof(di->keynames)/sizeof(*di->keynames) - 2)
1600 di->state = di_bye; /* sorry */
1603 for (i = di->nkeynames + 1; i > 0; i--)
1604 di->keynames[i] = di->keynames[i - 1];
1605 di->keynames[0] = di->keyname = keyname;
1610 dataiterator_free(Dataiterator *di)
1612 if (di->matcher.match)
1613 datamatcher_free(&di->matcher);
1615 solv_free(di->dupstr);
1617 solv_free(di->oldkeyskip);
1620 static unsigned char *
1621 dataiterator_find_keyname(Dataiterator *di, Id keyname)
1624 Repokey *keys = di->data->keys, *key;
1627 for (keyp = di->keyp; *keyp; keyp++)
1628 if (keys[*keyp].name == keyname)
1633 if (key->type == REPOKEY_TYPE_DELETED)
1635 if (key->storage != KEY_STORAGE_INCORE && key->storage != KEY_STORAGE_VERTICAL_OFFSET)
1636 return 0; /* get_data will not work, no need to forward */
1637 dp = forward_to_key(di->data, *keyp, di->keyp, di->dp);
1645 dataiterator_step(Dataiterator *di)
1649 if (di->state == di_nextattr && di->key->storage == KEY_STORAGE_VERTICAL_OFFSET && di->vert_ddp && di->vert_storestate != di->data->storestate)
1651 unsigned int ddpoff = di->ddp - di->vert_ddp;
1652 di->vert_off += ddpoff;
1653 di->vert_len -= ddpoff;
1654 di->ddp = di->vert_ddp = get_vertical_data(di->data, di->key, di->vert_off, di->vert_len);
1655 di->vert_storestate = di->data->storestate;
1657 di->state = di_nextkey;
1663 case di_enterrepo: di_enterrepo:
1664 if (!di->repo || (di->repo->disabled && !(di->flags & SEARCH_DISABLED_REPOS)))
1666 if (!(di->flags & SEARCH_THISSOLVID))
1668 di->solvid = di->repo->start - 1; /* reset solvid iterator */
1669 goto di_nextsolvable;
1673 case di_entersolvable: di_entersolvable:
1674 if (!di->repodataid)
1675 goto di_enterrepodata; /* POS case, repodata is set */
1676 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)
1678 extern Repokey repo_solvablekeys[RPM_RPMDBID - SOLVABLE_NAME + 1];
1679 di->key = repo_solvablekeys + (di->keyname ? di->keyname - SOLVABLE_NAME : 0);
1681 goto di_entersolvablekey;
1686 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);
1688 goto di_nextsolvable;
1689 di->repodataid = di->data - di->repo->repodata;
1691 goto di_enterrepodata;
1693 di_leavesolvablekey:
1694 di->repodataid = 1; /* reset repodata iterator */
1695 di->keyskip = repo_create_keyskip(di->repo, di->solvid, &di->oldkeyskip);
1698 case di_enterrepodata: di_enterrepodata:
1701 if (di->repodataid >= di->repo->nrepodata)
1702 goto di_nextsolvable;
1703 di->data = di->repo->repodata + di->repodataid;
1705 if (!maybe_load_repodata(di->data, di->keyname))
1706 goto di_nextrepodata;
1707 di->dp = solvid2data(di->data, di->solvid, &schema);
1709 goto di_nextrepodata;
1710 if (di->solvid == SOLVID_POS)
1711 di->solvid = di->pool->pos.solvid;
1712 /* reset key iterator */
1713 di->keyp = di->data->schemadata + di->data->schemata[schema];
1716 case di_enterschema: di_enterschema:
1718 di->dp = dataiterator_find_keyname(di, di->keyname);
1719 if (!di->dp || !*di->keyp)
1723 goto di_nextrepodata;
1727 case di_enterkey: di_enterkey:
1729 di->key = di->data->keys + *di->keyp;
1732 /* this is get_data() modified to store vert_ data */
1733 if (di->key->storage == KEY_STORAGE_VERTICAL_OFFSET)
1736 di->dp = data_read_id(di->dp, &off);
1737 di->dp = data_read_id(di->dp, &len);
1738 di->vert_ddp = di->ddp = get_vertical_data(di->data, di->key, off, len);
1741 di->vert_storestate = di->data->storestate;
1743 else if (di->key->storage == KEY_STORAGE_INCORE)
1745 di->ddp = di->dp; /* start of data */
1746 if (di->keyp[1] && (!di->keyname || (di->flags & SEARCH_SUB) != 0))
1747 di->dp = data_skip_key(di->data, di->dp, di->key); /* advance to next key */
1753 if (di->keyskip && (di->key->name >= di->keyskip[0] || di->keyskip[3 + di->key->name] != di->keyskip[1] + di->data->repodataid))
1755 if (di->key->type == REPOKEY_TYPE_DELETED && !(di->flags & SEARCH_KEEP_TYPE_DELETED))
1757 if (di->key->type == REPOKEY_TYPE_FIXARRAY || di->key->type == REPOKEY_TYPE_FLEXARRAY)
1759 if (di->nkeynames && di->nparents - di->rootlevel < di->nkeynames)
1765 di->ddp = data_fetch(di->ddp, &di->kv, di->key);
1766 di->state = di->kv.eof ? di_nextkey : di_nextattr;
1769 case di_nextkey: di_nextkey:
1770 if (!di->keyname && *++di->keyp)
1776 case di_nextrepodata: di_nextrepodata:
1777 if (!di->keyname && di->repodataid && ++di->repodataid < di->repo->nrepodata)
1778 goto di_enterrepodata;
1781 case di_nextsolvable: di_nextsolvable:
1782 if (!(di->flags & SEARCH_THISSOLVID))
1785 di->solvid = di->repo->start;
1788 for (; di->solvid < di->repo->end; di->solvid++)
1790 if (di->pool->solvables[di->solvid].repo == di->repo)
1791 goto di_entersolvable;
1796 case di_nextrepo: di_nextrepo:
1801 if (di->repoid < di->pool->nrepos)
1803 di->repo = di->pool->repos[di->repoid];
1809 case di_bye: di_bye:
1813 case di_enterarray: di_enterarray:
1814 if (di->key->name == REPOSITORY_SOLVABLES)
1816 di->ddp = data_read_id(di->ddp, (Id *)&di->kv.num);
1821 case di_nextarrayelement: di_nextarrayelement:
1824 di->ddp = data_skip_schema(di->data, di->ddp, di->kv.id);
1825 if (di->kv.entry == di->kv.num)
1827 if (di->nkeynames && di->nparents - di->rootlevel < di->nkeynames)
1829 if (!(di->flags & SEARCH_ARRAYSENTINEL))
1831 di->kv.str = (char *)di->ddp;
1833 di->state = di_nextkey;
1836 if (di->kv.entry == di->kv.num - 1)
1838 if (di->key->type == REPOKEY_TYPE_FLEXARRAY || !di->kv.entry)
1839 di->ddp = data_read_id(di->ddp, &di->kv.id);
1840 di->kv.str = (char *)di->ddp;
1841 if (di->nkeynames && di->nparents - di->rootlevel < di->nkeynames)
1843 if ((di->flags & SEARCH_SUB) != 0)
1844 di->state = di_entersub;
1846 di->state = di_nextarrayelement;
1849 case di_entersub: di_entersub:
1850 if (di->nparents == sizeof(di->parents)/sizeof(*di->parents) - 1)
1851 goto di_nextarrayelement; /* sorry, full */
1852 di->parents[di->nparents].kv = di->kv;
1853 di->parents[di->nparents].dp = di->dp;
1854 di->parents[di->nparents].keyp = di->keyp;
1855 di->dp = (unsigned char *)di->kv.str;
1856 di->keyp = di->data->schemadata + di->data->schemata[di->kv.id];
1857 memset(&di->kv, 0, sizeof(di->kv));
1858 di->kv.parent = &di->parents[di->nparents].kv;
1860 di->keyname = di->keynames[di->nparents - di->rootlevel];
1861 goto di_enterschema;
1863 case di_leavesub: di_leavesub:
1864 if (di->nparents - 1 < di->rootlevel)
1867 di->dp = di->parents[di->nparents].dp;
1868 di->kv = di->parents[di->nparents].kv;
1869 di->keyp = di->parents[di->nparents].keyp;
1870 di->key = di->data->keys + *di->keyp;
1871 di->ddp = (unsigned char *)di->kv.str;
1872 di->keyname = di->keynames[di->nparents - di->rootlevel];
1873 goto di_nextarrayelement;
1875 /* special solvable attr handling follows */
1877 case di_nextsolvablekey: di_nextsolvablekey:
1879 goto di_nextsolvable;
1880 if (di->key->name == RPM_RPMDBID) /* reached end of list? */
1881 goto di_leavesolvablekey;
1885 case di_entersolvablekey: di_entersolvablekey:
1886 di->idp = solvabledata_fetch(di->pool->solvables + di->solvid, &di->kv, di->key->name);
1887 if (!di->idp || !*di->idp)
1888 goto di_nextsolvablekey;
1892 di->kv.id = *di->idp;
1893 di->kv.num = *di->idp; /* for rpmdbid */
1894 di->kv.num2 = 0; /* for rpmdbid */
1896 di->state = di_nextsolvablekey;
1902 case di_nextsolvableattr:
1903 di->state = di_nextsolvableattr;
1904 di->kv.id = *di->idp++;
1909 di->state = di_nextsolvablekey;
1915 /* we have a potential match */
1916 if (di->matcher.match)
1919 /* simple pre-check so that we don't need to stringify */
1920 if (di->keyname == SOLVABLE_FILELIST && di->key->type == REPOKEY_TYPE_DIRSTRARRAY && (di->matcher.flags & SEARCH_FILES) != 0)
1921 if (!datamatcher_checkbasename(&di->matcher, di->kv.str))
1923 /* now stringify so that we can do the matching */
1924 if (!(str = repodata_stringify(di->pool, di->data, di->key, &di->kv, di->flags)))
1926 if (di->keyname && (di->key->type == REPOKEY_TYPE_FIXARRAY || di->key->type == REPOKEY_TYPE_FLEXARRAY))
1930 if (!datamatcher_match(&di->matcher, str))
1935 /* stringify filelist if requested */
1936 if (di->keyname == SOLVABLE_FILELIST && di->key->type == REPOKEY_TYPE_DIRSTRARRAY && (di->flags & SEARCH_FILES) != 0)
1937 repodata_stringify(di->pool, di->data, di->key, &di->kv, di->flags);
1939 /* found something! */
1945 dataiterator_entersub(Dataiterator *di)
1947 if (di->state == di_nextarrayelement)
1948 di->state = di_entersub;
1952 dataiterator_setpos(Dataiterator *di)
1954 if (di->kv.eof == 2)
1956 pool_clear_pos(di->pool);
1959 di->pool->pos.solvid = di->solvid;
1960 di->pool->pos.repo = di->repo;
1961 di->pool->pos.repodataid = di->data - di->repo->repodata;
1962 di->pool->pos.schema = di->kv.id;
1963 di->pool->pos.dp = (unsigned char *)di->kv.str - di->data->incoredata;
1967 dataiterator_setpos_parent(Dataiterator *di)
1969 if (!di->kv.parent || di->kv.parent->eof == 2)
1971 pool_clear_pos(di->pool);
1974 di->pool->pos.solvid = di->solvid;
1975 di->pool->pos.repo = di->repo;
1976 di->pool->pos.repodataid = di->data - di->repo->repodata;
1977 di->pool->pos.schema = di->kv.parent->id;
1978 di->pool->pos.dp = (unsigned char *)di->kv.parent->str - di->data->incoredata;
1981 /* clones just the position, not the search keys/matcher */
1983 dataiterator_clonepos(Dataiterator *di, Dataiterator *from)
1985 di->state = from->state;
1986 di->flags &= ~SEARCH_THISSOLVID;
1987 di->flags |= (from->flags & SEARCH_THISSOLVID);
1988 di->repo = from->repo;
1989 di->data = from->data;
1991 di->ddp = from->ddp;
1992 di->idp = from->idp;
1993 di->keyp = from->keyp;
1994 di->key = from->key;
1996 di->repodataid = from->repodataid;
1997 di->solvid = from->solvid;
1998 di->repoid = from->repoid;
1999 di->rootlevel = from->rootlevel;
2000 memcpy(di->parents, from->parents, sizeof(from->parents));
2001 di->nparents = from->nparents;
2005 for (i = 1; i < di->nparents; i++)
2006 di->parents[i].kv.parent = &di->parents[i - 1].kv;
2007 di->kv.parent = &di->parents[di->nparents - 1].kv;
2011 if (from->dupstr && from->dupstr == from->kv.str)
2013 di->dupstrn = from->dupstrn;
2014 di->dupstr = solv_memdup(from->dupstr, from->dupstrn);
2019 dataiterator_seek(Dataiterator *di, int whence)
2021 if ((whence & DI_SEEK_STAY) != 0)
2022 di->rootlevel = di->nparents;
2023 switch (whence & ~DI_SEEK_STAY)
2026 if (di->state != di_nextarrayelement)
2028 if ((whence & DI_SEEK_STAY) != 0)
2029 di->rootlevel = di->nparents + 1; /* XXX: dangerous! */
2030 di->state = di_entersub;
2032 case DI_SEEK_PARENT:
2039 if (di->rootlevel > di->nparents)
2040 di->rootlevel = di->nparents;
2041 di->dp = di->parents[di->nparents].dp;
2042 di->kv = di->parents[di->nparents].kv;
2043 di->keyp = di->parents[di->nparents].keyp;
2044 di->key = di->data->keys + *di->keyp;
2045 di->ddp = (unsigned char *)di->kv.str;
2046 di->keyname = di->keynames[di->nparents - di->rootlevel];
2047 di->state = di_nextarrayelement;
2049 case DI_SEEK_REWIND:
2055 di->dp = (unsigned char *)di->kv.parent->str;
2056 di->keyp = di->data->schemadata + di->data->schemata[di->kv.parent->id];
2057 di->state = di_enterschema;
2065 dataiterator_skip_attribute(Dataiterator *di)
2067 if (di->state == di_nextsolvableattr)
2068 di->state = di_nextsolvablekey;
2070 di->state = di_nextkey;
2074 dataiterator_skip_solvable(Dataiterator *di)
2079 di->keyname = di->keynames[0];
2080 di->state = di_nextsolvable;
2084 dataiterator_skip_repo(Dataiterator *di)
2089 di->keyname = di->keynames[0];
2090 di->state = di_nextrepo;
2094 dataiterator_jump_to_solvid(Dataiterator *di, Id solvid)
2099 di->keyname = di->keynames[0];
2100 if (solvid == SOLVID_POS)
2102 di->repo = di->pool->pos.repo;
2109 if (!di->pool->pos.repodataid && di->pool->pos.solvid == SOLVID_META) {
2110 solvid = SOLVID_META; /* META pos hack */
2112 di->data = di->repo->repodata + di->pool->pos.repodataid;
2116 else if (solvid > 0)
2118 di->repo = di->pool->solvables[solvid].repo;
2123 if (!di->pool->urepos)
2129 di->repo = di->pool->repos[di->repoid];
2131 if (solvid != SOLVID_POS)
2133 di->solvid = solvid;
2135 di->flags |= SEARCH_THISSOLVID;
2136 di->state = di_enterrepo;
2140 dataiterator_jump_to_repo(Dataiterator *di, Repo *repo)
2146 di->repoid = 0; /* 0 means stay at repo */
2149 di->flags &= ~SEARCH_THISSOLVID;
2150 di->state = di_enterrepo;
2154 dataiterator_match(Dataiterator *di, Datamatcher *ma)
2157 if (!(str = repodata_stringify(di->pool, di->data, di->key, &di->kv, di->flags)))
2159 return ma ? datamatcher_match(ma, str) : 1;
2163 dataiterator_strdup(Dataiterator *di)
2167 if (!di->kv.str || di->kv.str == di->dupstr)
2169 switch (di->key->type)
2172 case REPOKEY_TYPE_DIRSTRARRAY:
2173 if (di->kv.num) /* was it stringified into tmp space? */
2174 l = strlen(di->kv.str) + 1;
2179 if (l < 0 && di->key->storage == KEY_STORAGE_VERTICAL_OFFSET)
2181 switch (di->key->type)
2183 case REPOKEY_TYPE_STR:
2184 case REPOKEY_TYPE_DIRSTRARRAY:
2185 l = strlen(di->kv.str) + 1;
2188 l = solv_chksum_len(di->key->type);
2190 case REPOKEY_TYPE_BINARY:
2197 if (!di->dupstrn || di->dupstrn < l)
2199 di->dupstrn = l + 16;
2200 di->dupstr = solv_realloc(di->dupstr, di->dupstrn);
2203 memcpy(di->dupstr, di->kv.str, l);
2204 di->kv.str = di->dupstr;
2208 /************************************************************************
2209 * data modify functions
2212 /* extend repodata so that it includes solvables p */
2214 repodata_extend(Repodata *data, Id p)
2216 if (data->start == data->end)
2217 data->start = data->end = p;
2220 int old = data->end - data->start;
2221 int new = p - data->end + 1;
2224 data->attrs = solv_extend(data->attrs, old, new, sizeof(Id *), REPODATA_BLOCK);
2225 memset(data->attrs + old, 0, new * sizeof(Id *));
2227 data->incoreoffset = solv_extend(data->incoreoffset, old, new, sizeof(Id), REPODATA_BLOCK);
2228 memset(data->incoreoffset + old, 0, new * sizeof(Id));
2231 if (p < data->start)
2233 int old = data->end - data->start;
2234 int new = data->start - p;
2237 data->attrs = solv_extend_resize(data->attrs, old + new, sizeof(Id *), REPODATA_BLOCK);
2238 memmove(data->attrs + new, data->attrs, old * sizeof(Id *));
2239 memset(data->attrs, 0, new * sizeof(Id *));
2241 data->incoreoffset = solv_extend_resize(data->incoreoffset, old + new, sizeof(Id), REPODATA_BLOCK);
2242 memmove(data->incoreoffset + new, data->incoreoffset, old * sizeof(Id));
2243 memset(data->incoreoffset, 0, new * sizeof(Id));
2248 /* shrink end of repodata */
2250 repodata_shrink(Repodata *data, int end)
2254 if (data->end <= end)
2256 if (data->start >= end)
2260 for (i = 0; i < data->end - data->start; i++)
2261 solv_free(data->attrs[i]);
2262 data->attrs = solv_free(data->attrs);
2264 data->incoreoffset = solv_free(data->incoreoffset);
2265 data->start = data->end = 0;
2270 for (i = end; i < data->end; i++)
2271 solv_free(data->attrs[i - data->start]);
2272 data->attrs = solv_extend_resize(data->attrs, end - data->start, sizeof(Id *), REPODATA_BLOCK);
2274 if (data->incoreoffset)
2275 data->incoreoffset = solv_extend_resize(data->incoreoffset, end - data->start, sizeof(Id), REPODATA_BLOCK);
2279 /* extend repodata so that it includes solvables from start to start + num - 1 */
2281 repodata_extend_block(Repodata *data, Id start, Id num)
2285 if (!data->incoreoffset)
2287 /* this also means that data->attrs is NULL */
2288 data->incoreoffset = solv_calloc_block(num, sizeof(Id), REPODATA_BLOCK);
2289 data->start = start;
2290 data->end = start + num;
2293 repodata_extend(data, start);
2295 repodata_extend(data, start + num - 1);
2298 /**********************************************************************/
2301 #define REPODATA_ATTRS_BLOCK 31
2302 #define REPODATA_ATTRDATA_BLOCK 1023
2303 #define REPODATA_ATTRIDDATA_BLOCK 63
2304 #define REPODATA_ATTRNUM64DATA_BLOCK 15
2308 repodata_new_handle(Repodata *data)
2312 data->xattrs = solv_calloc_block(1, sizeof(Id *), REPODATA_BLOCK);
2313 data->nxattrs = 2; /* -1: SOLVID_META */
2315 data->xattrs = solv_extend(data->xattrs, data->nxattrs, 1, sizeof(Id *), REPODATA_BLOCK);
2316 data->xattrs[data->nxattrs] = 0;
2317 return -(data->nxattrs++);
2321 repodata_get_attrp(Repodata *data, Id handle)
2325 if (handle == SOLVID_META && !data->xattrs)
2327 data->xattrs = solv_calloc_block(1, sizeof(Id *), REPODATA_BLOCK);
2330 return data->xattrs - handle;
2332 if (handle < data->start || handle >= data->end)
2333 repodata_extend(data, handle);
2335 data->attrs = solv_calloc_block(data->end - data->start, sizeof(Id *), REPODATA_BLOCK);
2336 return data->attrs + (handle - data->start);
2340 repodata_insert_keyid(Repodata *data, Id handle, Id keyid, Id val, int overwrite)
2346 app = repodata_get_attrp(data, handle);
2351 /* Determine equality based on the name only, allows us to change
2352 type (when overwrite is set), and makes TYPE_CONSTANT work. */
2353 for (pp = ap; *pp; pp += 2)
2354 if (data->keys[*pp].name == data->keys[keyid].name)
2358 if (overwrite || data->keys[*pp].type == REPOKEY_TYPE_DELETED)
2367 ap = solv_extend(ap, i, 3, sizeof(Id), REPODATA_ATTRS_BLOCK);
2377 repodata_set(Repodata *data, Id solvid, Repokey *key, Id val)
2381 keyid = repodata_key2id(data, key, 1);
2382 repodata_insert_keyid(data, solvid, keyid, val, 1);
2386 repodata_set_id(Repodata *data, Id solvid, Id keyname, Id id)
2390 key.type = REPOKEY_TYPE_ID;
2392 key.storage = KEY_STORAGE_INCORE;
2393 repodata_set(data, solvid, &key, id);
2397 repodata_set_num(Repodata *data, Id solvid, Id keyname, unsigned long long num)
2401 key.type = REPOKEY_TYPE_NUM;
2403 key.storage = KEY_STORAGE_INCORE;
2404 if (num >= 0x80000000)
2406 data->attrnum64data = solv_extend(data->attrnum64data, data->attrnum64datalen, 1, sizeof(unsigned long long), REPODATA_ATTRNUM64DATA_BLOCK);
2407 data->attrnum64data[data->attrnum64datalen] = num;
2408 num = 0x80000000 | data->attrnum64datalen++;
2410 repodata_set(data, solvid, &key, (Id)num);
2414 repodata_set_poolstr(Repodata *data, Id solvid, Id keyname, const char *str)
2418 if (data->localpool)
2419 id = stringpool_str2id(&data->spool, str, 1);
2421 id = pool_str2id(data->repo->pool, str, 1);
2423 key.type = REPOKEY_TYPE_ID;
2425 key.storage = KEY_STORAGE_INCORE;
2426 repodata_set(data, solvid, &key, id);
2430 repodata_set_constant(Repodata *data, Id solvid, Id keyname, unsigned int constant)
2434 key.type = REPOKEY_TYPE_CONSTANT;
2435 key.size = constant;
2436 key.storage = KEY_STORAGE_INCORE;
2437 repodata_set(data, solvid, &key, 0);
2441 repodata_set_constantid(Repodata *data, Id solvid, Id keyname, Id id)
2445 key.type = REPOKEY_TYPE_CONSTANTID;
2447 key.storage = KEY_STORAGE_INCORE;
2448 repodata_set(data, solvid, &key, 0);
2452 repodata_set_void(Repodata *data, Id solvid, Id keyname)
2456 key.type = REPOKEY_TYPE_VOID;
2458 key.storage = KEY_STORAGE_INCORE;
2459 repodata_set(data, solvid, &key, 0);
2463 repodata_set_str(Repodata *data, Id solvid, Id keyname, const char *str)
2468 l = strlen(str) + 1;
2470 key.type = REPOKEY_TYPE_STR;
2472 key.storage = KEY_STORAGE_INCORE;
2473 data->attrdata = solv_extend(data->attrdata, data->attrdatalen, l, 1, REPODATA_ATTRDATA_BLOCK);
2474 memcpy(data->attrdata + data->attrdatalen, str, l);
2475 repodata_set(data, solvid, &key, data->attrdatalen);
2476 data->attrdatalen += l;
2480 repodata_set_binary(Repodata *data, Id solvid, Id keyname, void *buf, int len)
2488 key.type = REPOKEY_TYPE_BINARY;
2490 key.storage = KEY_STORAGE_INCORE;
2491 data->attrdata = solv_extend(data->attrdata, data->attrdatalen, len + 5, 1, REPODATA_ATTRDATA_BLOCK);
2492 dp = data->attrdata + data->attrdatalen;
2493 if (len >= (1 << 14))
2495 if (len >= (1 << 28))
2496 *dp++ = (len >> 28) | 128;
2497 if (len >= (1 << 21))
2498 *dp++ = (len >> 21) | 128;
2499 *dp++ = (len >> 14) | 128;
2501 if (len >= (1 << 7))
2502 *dp++ = (len >> 7) | 128;
2505 memcpy(dp, buf, len);
2506 repodata_set(data, solvid, &key, data->attrdatalen);
2507 data->attrdatalen = dp + len - data->attrdata;
2510 /* add an array element consisting of entrysize Ids to the repodata. modifies attriddata
2511 * so that the caller can append entrysize new elements plus the termination zero there */
2513 repodata_add_array(Repodata *data, Id handle, Id keyname, Id keytype, int entrysize)
2516 Id *ida, *pp, **ppp;
2518 /* check if it is the same as last time, this speeds things up a lot */
2519 if (handle == data->lasthandle && data->keys[data->lastkey].name == keyname && data->keys[data->lastkey].type == keytype && data->attriddatalen == data->lastdatalen)
2521 /* great! just append the new data */
2522 data->attriddata = solv_extend(data->attriddata, data->attriddatalen, entrysize, sizeof(Id), REPODATA_ATTRIDDATA_BLOCK);
2523 data->attriddatalen--; /* overwrite terminating 0 */
2524 data->lastdatalen += entrysize;
2528 ppp = repodata_get_attrp(data, handle);
2532 for (; *pp; pp += 2)
2533 if (data->keys[*pp].name == keyname)
2536 if (!pp || !*pp || data->keys[*pp].type != keytype)
2538 /* not found. allocate new key */
2544 key.storage = KEY_STORAGE_INCORE;
2545 data->attriddata = solv_extend(data->attriddata, data->attriddatalen, entrysize + 1, sizeof(Id), REPODATA_ATTRIDDATA_BLOCK);
2546 keyid = repodata_key2id(data, &key, 1);
2547 repodata_insert_keyid(data, handle, keyid, data->attriddatalen, 1);
2548 data->lasthandle = handle;
2549 data->lastkey = keyid;
2550 data->lastdatalen = data->attriddatalen + entrysize + 1;
2554 for (ida = data->attriddata + pp[1]; *ida; ida += entrysize)
2555 oldsize += entrysize;
2556 if (ida + 1 == data->attriddata + data->attriddatalen)
2558 /* this was the last entry, just append it */
2559 data->attriddata = solv_extend(data->attriddata, data->attriddatalen, entrysize, sizeof(Id), REPODATA_ATTRIDDATA_BLOCK);
2560 data->attriddatalen--; /* overwrite terminating 0 */
2564 /* too bad. move to back. */
2565 data->attriddata = solv_extend(data->attriddata, data->attriddatalen, oldsize + entrysize + 1, sizeof(Id), REPODATA_ATTRIDDATA_BLOCK);
2566 memcpy(data->attriddata + data->attriddatalen, data->attriddata + pp[1], oldsize * sizeof(Id));
2567 pp[1] = data->attriddatalen;
2568 data->attriddatalen += oldsize;
2570 data->lasthandle = handle;
2571 data->lastkey = *pp;
2572 data->lastdatalen = data->attriddatalen + entrysize + 1;
2576 repodata_set_bin_checksum(Repodata *data, Id solvid, Id keyname, Id type,
2577 const unsigned char *str)
2582 if (!(l = solv_chksum_len(type)))
2587 key.storage = KEY_STORAGE_INCORE;
2588 data->attrdata = solv_extend(data->attrdata, data->attrdatalen, l, 1, REPODATA_ATTRDATA_BLOCK);
2589 memcpy(data->attrdata + data->attrdatalen, str, l);
2590 repodata_set(data, solvid, &key, data->attrdatalen);
2591 data->attrdatalen += l;
2595 repodata_set_checksum(Repodata *data, Id solvid, Id keyname, Id type,
2598 unsigned char buf[64];
2601 if (!(l = solv_chksum_len(type)))
2603 if (l > sizeof(buf) || solv_hex2bin(&str, buf, l) != l)
2605 repodata_set_bin_checksum(data, solvid, keyname, type, buf);
2609 repodata_chk2str(Repodata *data, Id type, const unsigned char *buf)
2613 if (!(l = solv_chksum_len(type)))
2615 return pool_bin2hex(data->repo->pool, buf, l);
2618 /* rpm filenames don't contain the epoch, so strip it */
2619 static inline const char *
2620 evrid2vrstr(Pool *pool, Id evrid)
2622 const char *p, *evr = pool_id2str(pool, evrid);
2625 for (p = evr; *p >= '0' && *p <= '9'; p++)
2627 return p != evr && *p == ':' && p[1] ? p + 1 : evr;
2631 repodata_set_poolstrn(Repodata *data, Id solvid, Id keyname, const char *str, int l)
2634 if (data->localpool)
2635 id = stringpool_strn2id(&data->spool, str, l, 1);
2637 id = pool_strn2id(data->repo->pool, str, l, 1);
2638 repodata_set_id(data, solvid, keyname, id);
2642 repodata_set_strn(Repodata *data, Id solvid, Id keyname, const char *str, int l)
2645 repodata_set_str(data, solvid, keyname, str);
2648 char *s = solv_strdup(str);
2650 repodata_set_str(data, solvid, keyname, s);
2656 repodata_set_location(Repodata *data, Id solvid, int medianr, const char *dir, const char *file)
2658 Pool *pool = data->repo->pool;
2660 const char *str, *fp;
2664 repodata_set_constant(data, solvid, SOLVABLE_MEDIANR, medianr);
2667 if ((dir = strrchr(file, '/')) != 0)
2678 if (l >= 2 && dir[0] == '.' && dir[1] == '/' && (l == 2 || dir[2] != '/'))
2683 if (l == 1 && dir[0] == '.')
2685 s = pool->solvables + solvid;
2688 str = pool_id2str(pool, s->arch);
2689 if (!strncmp(dir, str, l) && !str[l])
2690 repodata_set_void(data, solvid, SOLVABLE_MEDIADIR);
2692 repodata_set_strn(data, solvid, SOLVABLE_MEDIADIR, dir, l);
2695 str = pool_id2str(pool, s->name);
2697 if ((!l || !strncmp(fp, str, l)) && fp[l] == '-')
2700 str = evrid2vrstr(pool, s->evr);
2702 if ((!l || !strncmp(fp, str, l)) && fp[l] == '.')
2705 str = pool_id2str(pool, s->arch);
2707 if ((!l || !strncmp(fp, str, l)) && !strcmp(fp + l, ".rpm"))
2709 repodata_set_void(data, solvid, SOLVABLE_MEDIAFILE);
2714 repodata_set_str(data, solvid, SOLVABLE_MEDIAFILE, file);
2717 /* XXX: medianr is currently not stored */
2719 repodata_set_deltalocation(Repodata *data, Id handle, int medianr, const char *dir, const char *file)
2722 const char *evr, *suf, *s;
2726 if ((dir = strrchr(file, '/')) != 0)
2737 if (l >= 2 && dir[0] == '.' && dir[1] == '/' && (l == 2 || dir[2] != '/'))
2742 if (l == 1 && dir[0] == '.')
2745 repodata_set_poolstrn(data, handle, DELTA_LOCATION_DIR, dir, l);
2746 evr = strchr(file, '-');
2749 for (s = evr - 1; s > file; s--)
2756 suf = strrchr(file, '.');
2759 for (s = suf - 1; s > file; s--)
2765 if (!strcmp(suf, ".delta.rpm") || !strcmp(suf, ".patch.rpm"))
2767 /* We accept one more item as suffix. */
2768 for (s = suf - 1; s > file; s--)
2778 if (suf && evr && suf < evr)
2780 repodata_set_poolstrn(data, handle, DELTA_LOCATION_NAME, file, evr ? evr - file : strlen(file));
2782 repodata_set_poolstrn(data, handle, DELTA_LOCATION_EVR, evr + 1, suf ? suf - evr - 1: strlen(evr + 1));
2784 repodata_set_poolstr(data, handle, DELTA_LOCATION_SUFFIX, suf + 1);
2788 repodata_set_sourcepkg(Repodata *data, Id solvid, const char *sourcepkg)
2790 Pool *pool = data->repo->pool;
2791 Solvable *s = pool->solvables + solvid;
2792 const char *p, *sevr, *sarch, *name, *evr;
2794 p = strrchr(sourcepkg, '.');
2795 if (!p || strcmp(p, ".rpm") != 0)
2798 repodata_set_str(data, solvid, SOLVABLE_SOURCENAME, sourcepkg);
2802 while (p > sourcepkg && *p != '.')
2804 if (*p != '.' || p == sourcepkg)
2807 while (p > sourcepkg && *p != '-')
2809 if (*p != '-' || p == sourcepkg)
2812 while (p > sourcepkg && *p != '-')
2814 if (*p != '-' || p == sourcepkg)
2817 pool = s->repo->pool;
2819 name = pool_id2str(pool, s->name);
2820 if (name && !strncmp(sourcepkg, name, sevr - sourcepkg - 1) && name[sevr - sourcepkg - 1] == 0)
2821 repodata_set_void(data, solvid, SOLVABLE_SOURCENAME);
2823 repodata_set_id(data, solvid, SOLVABLE_SOURCENAME, pool_strn2id(pool, sourcepkg, sevr - sourcepkg - 1, 1));
2825 evr = evrid2vrstr(pool, s->evr);
2826 if (evr && !strncmp(sevr, evr, sarch - sevr - 1) && evr[sarch - sevr - 1] == 0)
2827 repodata_set_void(data, solvid, SOLVABLE_SOURCEEVR);
2829 repodata_set_id(data, solvid, SOLVABLE_SOURCEEVR, pool_strn2id(pool, sevr, sarch - sevr - 1, 1));
2831 if (!strcmp(sarch, "src.rpm"))
2832 repodata_set_constantid(data, solvid, SOLVABLE_SOURCEARCH, ARCH_SRC);
2833 else if (!strcmp(sarch, "nosrc.rpm"))
2834 repodata_set_constantid(data, solvid, SOLVABLE_SOURCEARCH, ARCH_NOSRC);
2836 repodata_set_constantid(data, solvid, SOLVABLE_SOURCEARCH, pool_strn2id(pool, sarch, strlen(sarch) - 4, 1));
2840 repodata_set_idarray(Repodata *data, Id solvid, Id keyname, Queue *q)
2846 key.type = REPOKEY_TYPE_IDARRAY;
2848 key.storage = KEY_STORAGE_INCORE;
2849 repodata_set(data, solvid, &key, data->attriddatalen);
2850 data->attriddata = solv_extend(data->attriddata, data->attriddatalen, q->count + 1, sizeof(Id), REPODATA_ATTRIDDATA_BLOCK);
2851 for (i = 0; i < q->count; i++)
2852 data->attriddata[data->attriddatalen++] = q->elements[i];
2853 data->attriddata[data->attriddatalen++] = 0;
2857 repodata_add_dirnumnum(Repodata *data, Id solvid, Id keyname, Id dir, Id num, Id num2)
2861 fprintf(stderr, "repodata_add_dirnumnum %d %d %d %d (%d)\n", solvid, dir, num, num2, data->attriddatalen);
2863 repodata_add_array(data, solvid, keyname, REPOKEY_TYPE_DIRNUMNUMARRAY, 3);
2864 data->attriddata[data->attriddatalen++] = dir;
2865 data->attriddata[data->attriddatalen++] = num;
2866 data->attriddata[data->attriddatalen++] = num2;
2867 data->attriddata[data->attriddatalen++] = 0;
2871 repodata_add_dirstr(Repodata *data, Id solvid, Id keyname, Id dir, const char *str)
2877 l = strlen(str) + 1;
2878 data->attrdata = solv_extend(data->attrdata, data->attrdatalen, l, 1, REPODATA_ATTRDATA_BLOCK);
2879 memcpy(data->attrdata + data->attrdatalen, str, l);
2880 stroff = data->attrdatalen;
2881 data->attrdatalen += l;
2884 fprintf(stderr, "repodata_add_dirstr %d %d %s (%d)\n", solvid, dir, str, data->attriddatalen);
2886 repodata_add_array(data, solvid, keyname, REPOKEY_TYPE_DIRSTRARRAY, 2);
2887 data->attriddata[data->attriddatalen++] = dir;
2888 data->attriddata[data->attriddatalen++] = stroff;
2889 data->attriddata[data->attriddatalen++] = 0;
2893 repodata_add_idarray(Repodata *data, Id solvid, Id keyname, Id id)
2896 fprintf(stderr, "repodata_add_idarray %d %d (%d)\n", solvid, id, data->attriddatalen);
2898 repodata_add_array(data, solvid, keyname, REPOKEY_TYPE_IDARRAY, 1);
2899 data->attriddata[data->attriddatalen++] = id;
2900 data->attriddata[data->attriddatalen++] = 0;
2904 repodata_add_poolstr_array(Repodata *data, Id solvid, Id keyname,
2908 if (data->localpool)
2909 id = stringpool_str2id(&data->spool, str, 1);
2911 id = pool_str2id(data->repo->pool, str, 1);
2912 repodata_add_idarray(data, solvid, keyname, id);
2916 repodata_add_fixarray(Repodata *data, Id solvid, Id keyname, Id handle)
2918 repodata_add_array(data, solvid, keyname, REPOKEY_TYPE_FIXARRAY, 1);
2919 data->attriddata[data->attriddatalen++] = handle;
2920 data->attriddata[data->attriddatalen++] = 0;
2924 repodata_add_flexarray(Repodata *data, Id solvid, Id keyname, Id handle)
2926 repodata_add_array(data, solvid, keyname, REPOKEY_TYPE_FLEXARRAY, 1);
2927 data->attriddata[data->attriddatalen++] = handle;
2928 data->attriddata[data->attriddatalen++] = 0;
2932 repodata_set_kv(Repodata *data, Id solvid, Id keyname, Id keytype, KeyValue *kv)
2936 case REPOKEY_TYPE_ID:
2937 repodata_set_id(data, solvid, keyname, kv->id);
2939 case REPOKEY_TYPE_CONSTANTID:
2940 repodata_set_constantid(data, solvid, keyname, kv->id);
2942 case REPOKEY_TYPE_IDARRAY:
2943 repodata_add_idarray(data, solvid, keyname, kv->id);
2945 case REPOKEY_TYPE_STR:
2946 repodata_set_str(data, solvid, keyname, kv->str);
2948 case REPOKEY_TYPE_VOID:
2949 repodata_set_void(data, solvid, keyname);
2951 case REPOKEY_TYPE_NUM:
2952 repodata_set_num(data, solvid, keyname, SOLV_KV_NUM64(kv));
2954 case REPOKEY_TYPE_CONSTANT:
2955 repodata_set_constant(data, solvid, keyname, kv->num);
2957 case REPOKEY_TYPE_DIRNUMNUMARRAY:
2959 repodata_add_dirnumnum(data, solvid, keyname, kv->id, kv->num, kv->num2);
2961 case REPOKEY_TYPE_DIRSTRARRAY:
2962 repodata_add_dirstr(data, solvid, keyname, kv->id, kv->str);
2965 repodata_set_bin_checksum(data, solvid, keyname, keytype, (const unsigned char *)kv->str);
2973 repodata_unset_uninternalized(Repodata *data, Id solvid, Id keyname)
2976 app = repodata_get_attrp(data, solvid);
2982 *app = 0; /* delete all attributes */
2985 for (; *ap; ap += 2)
2986 if (data->keys[*ap].name == keyname)
2992 for (; *ap; ap += 2)
2994 if (data->keys[*ap].name == keyname)
3003 repodata_unset(Repodata *data, Id solvid, Id keyname)
3007 key.type = REPOKEY_TYPE_DELETED;
3009 key.storage = KEY_STORAGE_INCORE;
3010 repodata_set(data, solvid, &key, 0);
3013 /* add all (uninternalized) attrs from src to dest */
3015 repodata_merge_attrs(Repodata *data, Id dest, Id src)
3018 if (dest == src || !data->attrs || !(keyp = data->attrs[src - data->start]))
3020 for (; *keyp; keyp += 2)
3021 repodata_insert_keyid(data, dest, keyp[0], keyp[1], 0);
3024 /* add some (uninternalized) attrs from src to dest */
3026 repodata_merge_some_attrs(Repodata *data, Id dest, Id src, Map *keyidmap, int overwrite)
3029 if (dest == src || !data->attrs || !(keyp = data->attrs[src - data->start]))
3031 for (; *keyp; keyp += 2)
3032 if (!keyidmap || MAPTST(keyidmap, keyp[0]))
3033 repodata_insert_keyid(data, dest, keyp[0], keyp[1], overwrite);
3036 /* swap (uninternalized) attrs from src and dest */
3038 repodata_swap_attrs(Repodata *data, Id dest, Id src)
3041 if (!data->attrs || dest == src)
3043 if (dest < data->start || dest >= data->end)
3044 repodata_extend(data, dest);
3045 if (src < data->start || src >= data->end)
3046 repodata_extend(data, src);
3047 tmpattrs = data->attrs[dest - data->start];
3048 data->attrs[dest - data->start] = data->attrs[src - data->start];
3049 data->attrs[src - data->start] = tmpattrs;
3053 /**********************************************************************/
3055 /* TODO: unify with repo_write and repo_solv! */
3057 #define EXTDATA_BLOCK 1023
3065 data_addid(struct extdata *xd, Id sx)
3067 unsigned int x = (unsigned int)sx;
3070 xd->buf = solv_extend(xd->buf, xd->len, 5, 1, EXTDATA_BLOCK);
3071 dp = xd->buf + xd->len;
3076 *dp++ = (x >> 28) | 128;
3078 *dp++ = (x >> 21) | 128;
3079 *dp++ = (x >> 14) | 128;
3082 *dp++ = (x >> 7) | 128;
3084 xd->len = dp - xd->buf;
3088 data_addid64(struct extdata *xd, unsigned long long x)
3090 if (x >= 0x100000000)
3094 data_addid(xd, (Id)(x >> 35));
3095 xd->buf[xd->len - 1] |= 128;
3097 data_addid(xd, (Id)((unsigned int)x | 0x80000000));
3098 xd->buf[xd->len - 5] = (x >> 28) | 128;
3101 data_addid(xd, (Id)x);
3105 data_addideof(struct extdata *xd, Id sx, int eof)
3107 unsigned int x = (unsigned int)sx;
3110 xd->buf = solv_extend(xd->buf, xd->len, 5, 1, EXTDATA_BLOCK);
3111 dp = xd->buf + xd->len;
3116 *dp++ = (x >> 27) | 128;
3118 *dp++ = (x >> 20) | 128;
3119 *dp++ = (x >> 13) | 128;
3122 *dp++ = (x >> 6) | 128;
3123 *dp++ = eof ? (x & 63) : (x & 63) | 64;
3124 xd->len = dp - xd->buf;
3128 data_addblob(struct extdata *xd, unsigned char *blob, int len)
3130 xd->buf = solv_extend(xd->buf, xd->len, len, 1, EXTDATA_BLOCK);
3131 memcpy(xd->buf + xd->len, blob, len);
3135 /*********************************/
3137 /* this is to reduct memory usage when internalizing oversized repos */
3139 compact_attrdata(Repodata *data, int entry, int nentry)
3142 unsigned int attrdatastart = data->attrdatalen;
3143 unsigned int attriddatastart = data->attriddatalen;
3144 if (attrdatastart < 1024 * 1024 * 4 && attriddatastart < 1024 * 1024)
3146 for (i = entry; i < nentry; i++)
3148 Id v, *attrs = data->attrs[i];
3151 for (; *attrs; attrs += 2)
3153 switch (data->keys[*attrs].type)
3155 case REPOKEY_TYPE_STR:
3156 case REPOKEY_TYPE_BINARY:
3158 if ((unsigned int)attrs[1] < attrdatastart)
3159 attrdatastart = attrs[1];
3161 case REPOKEY_TYPE_DIRSTRARRAY:
3162 for (v = attrs[1]; data->attriddata[v] ; v += 2)
3163 if ((unsigned int)data->attriddata[v + 1] < attrdatastart)
3164 attrdatastart = data->attriddata[v + 1];
3166 case REPOKEY_TYPE_IDARRAY:
3167 case REPOKEY_TYPE_DIRNUMNUMARRAY:
3168 if ((unsigned int)attrs[1] < attriddatastart)
3169 attriddatastart = attrs[1];
3171 case REPOKEY_TYPE_FIXARRAY:
3172 case REPOKEY_TYPE_FLEXARRAY:
3180 printf("compact_attrdata %d %d\n", entry, nentry);
3181 printf("attrdatastart: %d\n", attrdatastart);
3182 printf("attriddatastart: %d\n", attriddatastart);
3184 if (attrdatastart < 1024 * 1024 * 4 && attriddatastart < 1024 * 1024)
3186 for (i = entry; i < nentry; i++)
3188 Id v, *attrs = data->attrs[i];
3191 for (; *attrs; attrs += 2)
3193 switch (data->keys[*attrs].type)
3195 case REPOKEY_TYPE_STR:
3196 case REPOKEY_TYPE_BINARY:
3198 attrs[1] -= attrdatastart;
3200 case REPOKEY_TYPE_DIRSTRARRAY:
3201 for (v = attrs[1]; data->attriddata[v] ; v += 2)
3202 data->attriddata[v + 1] -= attrdatastart;
3204 case REPOKEY_TYPE_IDARRAY:
3205 case REPOKEY_TYPE_DIRNUMNUMARRAY:
3206 attrs[1] -= attriddatastart;
3215 data->attrdatalen -= attrdatastart;
3216 memmove(data->attrdata, data->attrdata + attrdatastart, data->attrdatalen);
3217 data->attrdata = solv_extend_resize(data->attrdata, data->attrdatalen, 1, REPODATA_ATTRDATA_BLOCK);
3219 if (attriddatastart)
3221 data->attriddatalen -= attriddatastart;
3222 memmove(data->attriddata, data->attriddata + attriddatastart, data->attriddatalen * sizeof(Id));
3223 data->attriddata = solv_extend_resize(data->attriddata, data->attriddatalen, sizeof(Id), REPODATA_ATTRIDDATA_BLOCK);
3227 /* internalalize some key into incore/vincore data */
3230 repodata_serialize_key(Repodata *data, struct extdata *newincore,
3231 struct extdata *newvincore,
3233 Repokey *key, Id val)
3237 unsigned int oldvincorelen = 0;
3241 if (key->storage == KEY_STORAGE_VERTICAL_OFFSET)
3244 oldvincorelen = xd->len;
3248 case REPOKEY_TYPE_VOID:
3249 case REPOKEY_TYPE_CONSTANT:
3250 case REPOKEY_TYPE_CONSTANTID:
3251 case REPOKEY_TYPE_DELETED:
3253 case REPOKEY_TYPE_STR:
3254 data_addblob(xd, data->attrdata + val, strlen((char *)(data->attrdata + val)) + 1);
3256 case REPOKEY_TYPE_MD5:
3257 data_addblob(xd, data->attrdata + val, SIZEOF_MD5);
3259 case REPOKEY_TYPE_SHA1:
3260 data_addblob(xd, data->attrdata + val, SIZEOF_SHA1);
3262 case REPOKEY_TYPE_SHA224:
3263 data_addblob(xd, data->attrdata + val, SIZEOF_SHA224);
3265 case REPOKEY_TYPE_SHA256:
3266 data_addblob(xd, data->attrdata + val, SIZEOF_SHA256);
3268 case REPOKEY_TYPE_SHA384:
3269 data_addblob(xd, data->attrdata + val, SIZEOF_SHA384);
3271 case REPOKEY_TYPE_SHA512:
3272 data_addblob(xd, data->attrdata + val, SIZEOF_SHA512);
3274 case REPOKEY_TYPE_NUM:
3275 if (val & 0x80000000)
3277 data_addid64(xd, data->attrnum64data[val ^ 0x80000000]);
3281 case REPOKEY_TYPE_ID:
3282 case REPOKEY_TYPE_DIR:
3283 data_addid(xd, val);
3285 case REPOKEY_TYPE_BINARY:
3288 unsigned char *dp = data_read_id(data->attrdata + val, &len);
3289 dp += (unsigned int)len;
3290 data_addblob(xd, data->attrdata + val, dp - (data->attrdata + val));
3293 case REPOKEY_TYPE_IDARRAY:
3294 for (ida = data->attriddata + val; *ida; ida++)
3295 data_addideof(xd, ida[0], ida[1] ? 0 : 1);
3297 case REPOKEY_TYPE_DIRNUMNUMARRAY:
3298 for (ida = data->attriddata + val; *ida; ida += 3)
3300 data_addid(xd, ida[0]);
3301 data_addid(xd, ida[1]);
3302 data_addideof(xd, ida[2], ida[3] ? 0 : 1);
3305 case REPOKEY_TYPE_DIRSTRARRAY:
3306 for (ida = data->attriddata + val; *ida; ida += 2)
3308 data_addideof(xd, ida[0], ida[2] ? 0 : 1);
3309 data_addblob(xd, data->attrdata + ida[1], strlen((char *)(data->attrdata + ida[1])) + 1);
3312 case REPOKEY_TYPE_FIXARRAY:
3316 for (ida = data->attriddata + val; *ida; ida++)
3320 kp = data->xattrs[-*ida];
3322 continue; /* ignore empty elements */
3324 for (; *kp; kp += 2)
3328 schemaid = repodata_schema2id(data, schema, 1);
3329 else if (schemaid != repodata_schema2id(data, schema, 0))
3331 pool_debug(data->repo->pool, SOLV_ERROR, "repodata_serialize_key: fixarray substructs with different schemas\n");
3336 data_addid(xd, num);
3339 data_addid(xd, schemaid);
3340 for (ida = data->attriddata + val; *ida; ida++)
3342 Id *kp = data->xattrs[-*ida];
3345 for (; *kp; kp += 2)
3346 repodata_serialize_key(data, newincore, newvincore, schema, data->keys + *kp, kp[1]);
3350 case REPOKEY_TYPE_FLEXARRAY:
3353 for (ida = data->attriddata + val; *ida; ida++)
3355 data_addid(xd, num);
3356 for (ida = data->attriddata + val; *ida; ida++)
3358 Id *kp = data->xattrs[-*ida];
3361 data_addid(xd, 0); /* XXX */
3368 schemaid = repodata_schema2id(data, schema, 1);
3369 data_addid(xd, schemaid);
3370 kp = data->xattrs[-*ida];
3372 repodata_serialize_key(data, newincore, newvincore, schema, data->keys + *kp, kp[1]);
3377 pool_debug(data->repo->pool, SOLV_FATAL, "repodata_serialize_key: don't know how to handle type %d\n", key->type);
3380 if (key->storage == KEY_STORAGE_VERTICAL_OFFSET)
3382 /* put offset/len in incore */
3383 data_addid(newincore, data->lastverticaloffset + oldvincorelen);
3384 oldvincorelen = xd->len - oldvincorelen;
3385 data_addid(newincore, oldvincorelen);
3389 /* create a circular linked list of all keys that share
3390 * the same keyname */
3392 calculate_keylink(Repodata *data)
3396 Id maxkeyname = 0, *keytable = 0;
3397 link = solv_calloc(data->nkeys, sizeof(Id));
3398 if (data->nkeys <= 2)
3400 for (i = 1; i < data->nkeys; i++)
3402 Id n = data->keys[i].name;
3403 if (n >= maxkeyname)
3405 keytable = solv_realloc2(keytable, n + 128, sizeof(Id));
3406 memset(keytable + maxkeyname, 0, (n + 128 - maxkeyname) * sizeof(Id));
3407 maxkeyname = n + 128;
3417 /* remove links that just point to themselfs */
3418 for (i = 1; i < data->nkeys; i++)
3421 solv_free(keytable);
3426 repodata_internalize(Repodata *data)
3428 Repokey *key, solvkey;
3430 Id schemaid, keyid, *schema, *sp, oldschemaid, *keyp, *seen;
3431 Offset *oldincoreoffs = 0;
3433 unsigned char *dp, *ndp;
3435 struct extdata newincore;
3436 struct extdata newvincore;
3441 if (!data->attrs && !data->xattrs)
3445 printf("repodata_internalize %d\n", data->repodataid);
3446 printf(" attr data: %d K\n", data->attrdatalen / 1024);
3447 printf(" attrid data: %d K\n", data->attriddatalen / (1024 / 4));
3449 newvincore.buf = data->vincore;
3450 newvincore.len = data->vincorelen;
3452 /* find the solvables key, create if needed */
3453 memset(&solvkey, 0, sizeof(solvkey));
3454 solvkey.name = REPOSITORY_SOLVABLES;
3455 solvkey.type = REPOKEY_TYPE_FLEXARRAY;
3457 solvkey.storage = KEY_STORAGE_INCORE;
3458 solvkeyid = repodata_key2id(data, &solvkey, data->end != data->start ? 1 : 0);
3460 schema = solv_malloc2(data->nkeys, sizeof(Id));
3461 seen = solv_malloc2(data->nkeys, sizeof(Id));
3463 /* Merge the data already existing (in data->schemata, ->incoredata and
3464 friends) with the new attributes in data->attrs[]. */
3465 nentry = data->end - data->start;
3466 memset(&newincore, 0, sizeof(newincore));
3467 data_addid(&newincore, 0); /* start data at offset 1 */
3469 data->mainschema = 0;
3470 data->mainschemaoffsets = solv_free(data->mainschemaoffsets);
3472 keylink = calculate_keylink(data);
3473 /* join entry data */
3474 /* we start with the meta data, entry -1 */
3475 for (entry = -1; entry < nentry; entry++)
3478 dp = data->incoredata;
3481 dp += entry >= 0 ? data->incoreoffset[entry] : 1;
3482 dp = data_read_id(dp, &oldschemaid);
3484 memset(seen, 0, data->nkeys * sizeof(Id));
3486 fprintf(stderr, "oldschemaid %d\n", oldschemaid);
3487 fprintf(stderr, "schemata %d\n", data->schemata[oldschemaid]);
3488 fprintf(stderr, "schemadata %p\n", data->schemadata);
3491 /* seen: -1: old data, 0: skipped, >0: id + 1 */
3495 for (keyp = data->schemadata + data->schemata[oldschemaid]; *keyp; keyp++)
3499 /* oops, should not happen */
3503 seen[*keyp] = -1; /* use old marker */
3506 haveoldkl = 1; /* potential keylink conflict */
3509 /* strip solvables key */
3510 if (entry < 0 && solvkeyid && seen[solvkeyid])
3513 for (sp = keyp = schema; *sp; sp++)
3514 if (*sp != solvkeyid)
3517 seen[solvkeyid] = 0;
3521 /* add new entries */
3523 keyp = data->attrs ? data->attrs[entry] : 0;
3525 keyp = data->xattrs ? data->xattrs[1] : 0;
3527 for (; *keyp; keyp += 2)
3533 if (haveoldkl && keylink[*keyp]) /* this should be pretty rare */
3536 for (kl = keylink[*keyp]; kl != *keyp; kl = keylink[kl])
3539 /* replacing old key kl, remove from schema and seen */
3541 for (osp = schema; osp < sp; osp++)
3544 memmove(osp, osp + 1, (sp - osp) * sizeof(Id));
3552 seen[*keyp] = keyp[1] + 1;
3555 /* add solvables key if needed */
3556 if (entry < 0 && data->end != data->start)
3558 *sp++ = solvkeyid; /* always last in schema */
3565 /* Ideally we'd like to sort the new schema here, to ensure
3566 schema equality independend of the ordering. */
3567 schemaid = repodata_schema2id(data, schema, 1);
3569 schemaid = oldschemaid;
3573 data->mainschemaoffsets = solv_calloc(sp - schema, sizeof(Id));
3574 data->mainschema = schemaid;
3577 /* find offsets in old incore data */
3581 for (sp = data->schemadata + data->schemata[oldschemaid]; *sp; sp++)
3582 if (seen[*sp] == -1)
3583 lastneeded = sp + 1;
3587 oldincoreoffs = solv_malloc2(data->nkeys, 2 * sizeof(Offset));
3588 for (sp = data->schemadata + data->schemata[oldschemaid]; sp != lastneeded; sp++)
3590 /* Skip the data associated with this old key. */
3591 key = data->keys + *sp;
3593 if (key->storage == KEY_STORAGE_VERTICAL_OFFSET)
3595 ndp = data_skip(ndp, REPOKEY_TYPE_ID);
3596 ndp = data_skip(ndp, REPOKEY_TYPE_ID);
3598 else if (key->storage == KEY_STORAGE_INCORE)
3599 ndp = data_skip_key(data, ndp, key);
3600 oldincoreoffs[*sp * 2] = dp - data->incoredata;
3601 oldincoreoffs[*sp * 2 + 1] = ndp - dp;
3607 /* just copy over the complete old entry (including the schemaid) if there was no new data */
3608 if (entry >= 0 && !neednewschema && oldschemaid && (!data->attrs || !data->attrs[entry]) && dp)
3610 ndp = data->incoredata + data->incoreoffset[entry];
3611 data->incoreoffset[entry] = newincore.len;
3612 data_addblob(&newincore, ndp, dp - ndp);
3616 /* Now create data blob. We walk through the (possibly new) schema
3617 and either copy over old data, or insert the new. */
3619 data->incoreoffset[entry] = newincore.len;
3620 data_addid(&newincore, schemaid);
3622 /* we don't use a pointer to the schemadata here as repodata_serialize_key
3623 * may call repodata_schema2id() which might realloc our schemadata */
3624 for (schemaidx = data->schemata[schemaid]; (keyid = data->schemadata[schemaidx]) != 0; schemaidx++)
3628 data->mainschemaoffsets[schemaidx - data->schemata[schemaid]] = newincore.len;
3629 if (keyid == solvkeyid)
3631 /* add flexarray entry count */
3632 data_addid(&newincore, data->end - data->start);
3633 break; /* always the last entry */
3636 if (seen[keyid] == -1)
3638 if (oldincoreoffs[keyid * 2 + 1])
3639 data_addblob(&newincore, data->incoredata + oldincoreoffs[keyid * 2], oldincoreoffs[keyid * 2 + 1]);
3641 else if (seen[keyid])
3642 repodata_serialize_key(data, &newincore, &newvincore, schema, data->keys + keyid, seen[keyid] - 1);
3647 if (entry >= 0 && data->attrs)
3649 if (data->attrs[entry])
3650 data->attrs[entry] = solv_free(data->attrs[entry]);
3651 if (entry && entry % 4096 == 0 && data->nxattrs <= 2 && entry + 64 < nentry)
3653 compact_attrdata(data, entry + 1, nentry); /* try to free some memory */
3655 printf(" attr data: %d K\n", data->attrdatalen / 1024);
3656 printf(" attrid data: %d K\n", data->attriddatalen / (1024 / 4));
3657 printf(" incore data: %d K\n", newincore.len / 1024);
3658 printf(" sum: %d K\n", (newincore.len + data->attrdatalen + data->attriddatalen * 4) / 1024);
3659 /* malloc_stats(); */
3664 /* free all xattrs */
3665 for (entry = 0; entry < data->nxattrs; entry++)
3666 if (data->xattrs[entry])
3667 solv_free(data->xattrs[entry]);
3668 data->xattrs = solv_free(data->xattrs);
3671 data->lasthandle = 0;
3673 data->lastdatalen = 0;
3677 solv_free(oldincoreoffs);
3678 repodata_free_schemahash(data);
3680 solv_free(data->incoredata);
3681 data->incoredata = newincore.buf;
3682 data->incoredatalen = newincore.len;
3683 data->incoredatafree = 0;
3685 data->vincore = newvincore.buf;
3686 data->vincorelen = newvincore.len;
3688 data->attrs = solv_free(data->attrs);
3689 data->attrdata = solv_free(data->attrdata);
3690 data->attriddata = solv_free(data->attriddata);
3691 data->attrnum64data = solv_free(data->attrnum64data);
3692 data->attrdatalen = 0;
3693 data->attriddatalen = 0;
3694 data->attrnum64datalen = 0;
3696 printf("repodata_internalize %d done\n", data->repodataid);
3697 printf(" incore data: %d K\n", data->incoredatalen / 1024);
3702 repodata_disable_paging(Repodata *data)
3704 if (maybe_load_repodata(data, 0))
3706 repopagestore_disable_paging(&data->store);
3711 /* call the pool's loadcallback to load a stub repodata */
3713 repodata_stub_loader(Repodata *data)
3715 Repo *repo = data->repo;
3716 Pool *pool = repo->pool;
3718 struct s_Pool_tmpspace oldtmpspace;
3721 if (!pool->loadcallback)
3723 data->state = REPODATA_ERROR;
3726 data->state = REPODATA_LOADING;
3728 /* save tmp space and pos */
3729 oldtmpspace = pool->tmpspace;
3730 memset(&pool->tmpspace, 0, sizeof(pool->tmpspace));
3733 r = pool->loadcallback(pool, data, pool->loadcallbackdata);
3735 /* restore tmp space and pos */
3736 for (i = 0; i < POOL_TMPSPACEBUF; i++)
3737 solv_free(pool->tmpspace.buf[i]);
3738 pool->tmpspace = oldtmpspace;
3739 if (r && oldpos.repo == repo && oldpos.repodataid == data->repodataid)
3740 memset(&oldpos, 0, sizeof(oldpos));
3743 data->state = r ? REPODATA_AVAILABLE : REPODATA_ERROR;
3747 repodata_add_stubkey(Repodata *data, Id keyname, Id keytype)
3751 xkey.name = keyname;
3752 xkey.type = keytype;
3753 xkey.storage = KEY_STORAGE_INCORE;
3755 repodata_key2id(data, &xkey, 1);
3759 repodata_add_stub(Repodata **datap)
3761 Repodata *data = *datap;
3762 Repo *repo = data->repo;
3763 Id repodataid = data - repo->repodata;
3764 Repodata *sdata = repo_add_repodata(repo, 0);
3765 data = repo->repodata + repodataid;
3766 if (data->end > data->start)
3767 repodata_extend_block(sdata, data->start, data->end - data->start);
3768 sdata->state = REPODATA_STUB;
3769 sdata->loadcallback = repodata_stub_loader;
3775 repodata_create_stubs(Repodata *data)
3777 Repo *repo = data->repo;
3778 Pool *pool = repo->pool;
3785 dataiterator_init(&di, pool, repo, SOLVID_META, REPOSITORY_EXTERNAL, 0, 0);
3786 while (dataiterator_step(&di))
3787 if (di.data == data)
3789 dataiterator_free(&di);
3792 stubdataids = solv_calloc(cnt, sizeof(*stubdataids));
3793 for (i = 0; i < cnt; i++)
3795 sdata = repodata_add_stub(&data);
3796 stubdataids[i] = sdata - repo->repodata;
3799 dataiterator_init(&di, pool, repo, SOLVID_META, REPOSITORY_EXTERNAL, 0, 0);
3801 while (dataiterator_step(&di))
3803 if (di.data != data)
3805 if (di.key->name == REPOSITORY_EXTERNAL && !di.nparents)
3807 dataiterator_entersub(&di);
3808 sdata = repo->repodata + stubdataids[i++];
3812 repodata_set_kv(sdata, SOLVID_META, di.key->name, di.key->type, &di.kv);
3813 if (di.key->name == REPOSITORY_KEYS && di.key->type == REPOKEY_TYPE_IDARRAY)
3818 xkeyname = di.kv.id;
3822 repodata_add_stubkey(sdata, xkeyname, di.kv.id);
3823 if (xkeyname == SOLVABLE_FILELIST)
3824 repodata_set_filelisttype(sdata, REPODATA_FILELIST_EXTENSION);
3829 dataiterator_free(&di);
3830 for (i = 0; i < cnt; i++)
3831 repodata_internalize(repo->repodata + stubdataids[i]);
3832 solv_free(stubdataids);
3837 repodata_set_filelisttype(Repodata *data, int type)
3839 data->filelisttype = type;
3843 repodata_memused(Repodata *data)
3845 return data->incoredatalen + data->vincorelen;