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 ((data->schemata[cid] + len <= data->schemadatalen) &&
215 !memcmp(data->schemadata + data->schemata[cid], schema, len * sizeof(Id)))
217 /* cache conflict, do a slow search */
218 for (cid = 1; cid < data->nschemata; cid++)
219 if ((data->schemata[cid] + len <= data->schemadatalen) &&
220 !memcmp(data->schemadata + data->schemata[cid], schema, len * sizeof(Id)))
226 data->schemadata = solv_extend(data->schemadata, data->schemadatalen, len, sizeof(Id), SCHEMATADATA_BLOCK);
227 data->schemata = solv_extend(data->schemata, data->nschemata, 1, sizeof(Id), SCHEMATA_BLOCK);
229 memcpy(data->schemadata + data->schemadatalen, schema, len * sizeof(Id));
230 data->schemata[data->nschemata] = data->schemadatalen;
231 data->schemadatalen += len;
232 schematahash[h] = data->nschemata;
234 fprintf(stderr, "schema2id: new schema\n");
236 return data->nschemata++;
240 repodata_free_schemahash(Repodata *data)
242 data->schematahash = solv_free(data->schematahash);
244 data->schemata = solv_realloc2(data->schemata, data->nschemata, sizeof(Id));
245 data->schemadata = solv_realloc2(data->schemadata, data->schemadatalen, sizeof(Id));
249 /***************************************************************
250 * dir pool management
253 #ifndef HAVE_STRCHRNUL
254 static inline const char *strchrnul(const char *str, char x)
256 const char *p = strchr(str, x);
257 return p ? p : str + strlen(str);
261 #define DIRCACHE_SIZE 41 /* < 1k */
265 Id ids[DIRCACHE_SIZE];
266 char str[(DIRCACHE_SIZE * (DIRCACHE_SIZE - 1)) / 2];
271 repodata_str2dir(Repodata *data, const char *dir, int create)
280 return data->dirpool.ndirs ? 0 : dirpool_add_dir(&data->dirpool, 0, 0, create);
281 while (*dir == '/' && dir[1] == '/')
283 if (*dir == '/' && !dir[1])
284 return data->dirpool.ndirs ? 1 : dirpool_add_dir(&data->dirpool, 0, 1, create);
291 struct dircache *dircache = data->dircache;
295 if (l < DIRCACHE_SIZE && dircache->ids[l] && !memcmp(dircache->str + l * (l - 1) / 2, dir, l))
297 parent = dircache->ids[l];
313 dire = strchrnul(dir, '/');
315 id = stringpool_strn2id(&data->spool, dir, dire - dir, create);
317 id = pool_strn2id(data->repo->pool, dir, dire - dir, create);
320 parent = dirpool_add_dir(&data->dirpool, parent, id, create);
325 data->dircache = solv_calloc(1, sizeof(struct dircache));
329 if (l < DIRCACHE_SIZE)
331 data->dircache->ids[l] = parent;
332 memcpy(data->dircache->str + l * (l - 1) / 2, dirs, l);
346 repodata_free_dircache(Repodata *data)
348 data->dircache = solv_free(data->dircache);
352 repodata_dir2str(Repodata *data, Id did, const char *suf)
354 Pool *pool = data->repo->pool;
361 return suf ? suf : "";
362 if (did == 1 && !suf)
367 comp = dirpool_compid(&data->dirpool, parent);
368 comps = stringpool_id2str(data->localpool ? &data->spool : &pool->ss, comp);
370 parent = dirpool_parent(&data->dirpool, parent);
375 l += strlen(suf) + 1;
376 p = pool_alloctmpspace(pool, l + 1) + l;
387 comp = dirpool_compid(&data->dirpool, parent);
388 comps = stringpool_id2str(data->localpool ? &data->spool : &pool->ss, comp);
391 strncpy(p, comps, l);
392 parent = dirpool_parent(&data->dirpool, parent);
400 /***************************************************************
404 static inline unsigned char *
405 data_skip_schema(Repodata *data, unsigned char *dp, Id schema)
407 Id *keyp = data->schemadata + data->schemata[schema];
408 for (; *keyp; keyp++)
409 dp = data_skip_key(data, dp, data->keys + *keyp);
413 static unsigned char *
414 data_skip_key(Repodata *data, unsigned char *dp, Repokey *key)
416 int nentries, schema;
419 case REPOKEY_TYPE_FIXARRAY:
420 dp = data_read_id(dp, &nentries);
423 dp = data_read_id(dp, &schema);
425 dp = data_skip_schema(data, dp, schema);
427 case REPOKEY_TYPE_FLEXARRAY:
428 dp = data_read_id(dp, &nentries);
431 dp = data_read_id(dp, &schema);
432 dp = data_skip_schema(data, dp, schema);
436 if (key->storage == KEY_STORAGE_INCORE)
437 dp = data_skip(dp, key->type);
438 else if (key->storage == KEY_STORAGE_VERTICAL_OFFSET)
440 dp = data_skip(dp, REPOKEY_TYPE_ID);
441 dp = data_skip(dp, REPOKEY_TYPE_ID);
447 static unsigned char *
448 forward_to_key(Repodata *data, Id keyid, Id *keyp, unsigned char *dp)
454 if (data->mainschemaoffsets && dp == data->incoredata + data->mainschemaoffsets[0] && keyp == data->schemadata + data->schemata[data->mainschema])
457 for (i = 0; (k = *keyp++) != 0; i++)
459 return data->incoredata + data->mainschemaoffsets[i];
462 while ((k = *keyp++) != 0)
466 if (data->keys[k].storage == KEY_STORAGE_VERTICAL_OFFSET)
468 dp = data_skip(dp, REPOKEY_TYPE_ID); /* skip offset */
469 dp = data_skip(dp, REPOKEY_TYPE_ID); /* skip length */
472 if (data->keys[k].storage != KEY_STORAGE_INCORE)
474 dp = data_skip_key(data, dp, data->keys + k);
479 static unsigned char *
480 get_vertical_data(Repodata *data, Repokey *key, Id off, Id len)
485 if (off >= data->lastverticaloffset)
487 off -= data->lastverticaloffset;
488 if ((unsigned int)off + len > data->vincorelen)
490 return data->vincore + off;
492 if ((unsigned int)off + len > key->size)
494 /* we now have the offset, go into vertical */
495 off += data->verticaloffset[key - data->keys];
496 /* fprintf(stderr, "key %d page %d\n", key->name, off / REPOPAGE_BLOBSIZE); */
497 dp = repopagestore_load_page_range(&data->store, off / REPOPAGE_BLOBSIZE, (off + len - 1) / REPOPAGE_BLOBSIZE);
500 dp += off % REPOPAGE_BLOBSIZE;
504 static inline unsigned char *
505 get_data(Repodata *data, Repokey *key, unsigned char **dpp, int advance)
507 unsigned char *dp = *dpp;
511 if (key->storage == KEY_STORAGE_INCORE)
514 *dpp = data_skip_key(data, dp, key);
517 else if (key->storage == KEY_STORAGE_VERTICAL_OFFSET)
520 dp = data_read_id(dp, &off);
521 dp = data_read_id(dp, &len);
524 return get_vertical_data(data, key, off, len);
530 repodata_load(Repodata *data)
532 if (data->state != REPODATA_STUB)
534 if (data->loadcallback)
535 data->loadcallback(data);
537 data->state = REPODATA_ERROR;
541 maybe_load_repodata_stub(Repodata *data, Id keyname)
543 if (data->state != REPODATA_STUB)
545 data->state = REPODATA_ERROR;
551 for (i = 1; i < data->nkeys; i++)
552 if (keyname == data->keys[i].name)
554 if (i == data->nkeys)
558 return data->state == REPODATA_AVAILABLE ? 1 : 0;
562 maybe_load_repodata(Repodata *data, Id keyname)
564 if (keyname && !repodata_precheck_keyname(data, keyname))
565 return 0; /* do not bother... */
566 if (data->state == REPODATA_AVAILABLE || data->state == REPODATA_LOADING)
568 if (data->state == REPODATA_ERROR)
570 return maybe_load_repodata_stub(data, keyname);
573 static inline unsigned char *
574 solvid2data(Repodata *data, Id solvid, Id *schemap)
576 unsigned char *dp = data->incoredata;
579 if (solvid == SOLVID_META)
580 dp += 1; /* offset of "meta" solvable */
581 else if (solvid == SOLVID_POS)
583 Pool *pool = data->repo->pool;
584 if (data->repo != pool->pos.repo)
586 if (data != data->repo->repodata + pool->pos.repodataid)
589 if (pool->pos.dp != 1)
591 *schemap = pool->pos.schema;
597 if (solvid < data->start || solvid >= data->end)
599 dp += data->incoreoffset[solvid - data->start];
601 return data_read_id(dp, schemap);
604 /************************************************************************
608 static unsigned char *
609 find_key_data(Repodata *data, Id solvid, Id keyname, Repokey **keypp)
612 Id schema, *keyp, *kp;
615 if (!maybe_load_repodata(data, keyname))
617 dp = solvid2data(data, solvid, &schema);
620 keyp = data->schemadata + data->schemata[schema];
621 for (kp = keyp; *kp; kp++)
622 if (data->keys[*kp].name == keyname)
626 *keypp = key = data->keys + *kp;
627 if (key->type == REPOKEY_TYPE_DELETED)
629 if (key->type == REPOKEY_TYPE_VOID || key->type == REPOKEY_TYPE_CONSTANT || key->type == REPOKEY_TYPE_CONSTANTID)
630 return dp; /* no need to forward... */
631 if (key->storage != KEY_STORAGE_INCORE && key->storage != KEY_STORAGE_VERTICAL_OFFSET)
632 return 0; /* get_data will not work, no need to forward */
633 dp = forward_to_key(data, *kp, keyp, dp);
636 return get_data(data, key, &dp, 0);
640 repodata_lookup_schemakeys(Repodata *data, Id solvid)
643 if (!maybe_load_repodata(data, 0))
645 if (!solvid2data(data, solvid, &schema))
647 return data->schemadata + data->schemata[schema];
653 Id *keyskip = solv_calloc(3 + 256, sizeof(Id));
655 keyskip[1] = keyskip[2] = 1;
660 repodata_fill_keyskip(Repodata *data, Id solvid, Id *keyskip)
663 Id maxkeyname, value;
664 keyp = repodata_lookup_schemakeys(data, solvid);
666 return keyskip; /* no keys for this solvid */
668 keyskip = alloc_keyskip();
669 maxkeyname = keyskip[0];
670 value = keyskip[1] + data->repodataid;
671 for (; *keyp; keyp++)
673 Id keyname = data->keys[*keyp].name;
674 if (keyname >= maxkeyname)
676 int newmax = (keyname | 255) + 1;
677 keyskip = solv_realloc2(keyskip, 3 + newmax, sizeof(Id));
678 memset(keyskip + (3 + maxkeyname), 0, (newmax - maxkeyname) * sizeof(Id));
679 keyskip[0] = maxkeyname = newmax;
681 keyskip[3 + keyname] = value;
687 repodata_lookup_type(Repodata *data, Id solvid, Id keyname)
689 Id schema, *keyp, *kp;
690 if (!maybe_load_repodata(data, keyname))
692 if (!solvid2data(data, solvid, &schema))
694 keyp = data->schemadata + data->schemata[schema];
695 for (kp = keyp; *kp; kp++)
696 if (data->keys[*kp].name == keyname)
697 return data->keys[*kp].type;
702 repodata_lookup_id(Repodata *data, Id solvid, Id keyname)
708 dp = find_key_data(data, solvid, keyname, &key);
711 if (key->type == REPOKEY_TYPE_CONSTANTID)
713 if (key->type != REPOKEY_TYPE_ID)
715 dp = data_read_id(dp, &id);
720 repodata_lookup_str(Repodata *data, Id solvid, Id keyname)
726 dp = find_key_data(data, solvid, keyname, &key);
729 if (key->type == REPOKEY_TYPE_STR)
730 return (const char *)dp;
731 if (key->type == REPOKEY_TYPE_CONSTANTID)
733 else if (key->type == REPOKEY_TYPE_ID)
734 dp = data_read_id(dp, &id);
738 return stringpool_id2str(&data->spool, id);
739 return pool_id2str(data->repo->pool, id);
743 repodata_lookup_num(Repodata *data, Id solvid, Id keyname, unsigned long long notfound)
747 unsigned int high, low;
749 dp = find_key_data(data, solvid, keyname, &key);
754 case REPOKEY_TYPE_NUM:
755 data_read_num64(dp, &low, &high);
756 return (unsigned long long)high << 32 | low;
757 case REPOKEY_TYPE_CONSTANT:
765 repodata_lookup_void(Repodata *data, Id solvid, Id keyname)
767 return repodata_lookup_type(data, solvid, keyname) == REPOKEY_TYPE_VOID ? 1 : 0;
770 const unsigned char *
771 repodata_lookup_bin_checksum(Repodata *data, Id solvid, Id keyname, Id *typep)
776 dp = find_key_data(data, solvid, keyname, &key);
791 repodata_lookup_idarray(Repodata *data, Id solvid, Id keyname, Queue *q)
799 dp = find_key_data(data, solvid, keyname, &key);
804 case REPOKEY_TYPE_CONSTANTID:
805 queue_push(q, key->size);
807 case REPOKEY_TYPE_ID:
808 dp = data_read_id(dp, &id);
811 case REPOKEY_TYPE_IDARRAY:
814 dp = data_read_ideof(dp, &id, &eof);
827 repodata_lookup_binary(Repodata *data, Id solvid, Id keyname, int *lenp)
833 dp = find_key_data(data, solvid, keyname, &key);
834 if (!dp || key->type != REPOKEY_TYPE_BINARY)
839 dp = data_read_id(dp, &len);
845 repodata_lookup_count(Repodata *data, Id solvid, Id keyname)
849 unsigned int cnt = 0;
851 dp = find_key_data(data, solvid, keyname, &key);
856 case REPOKEY_TYPE_IDARRAY:
857 case REPOKEY_TYPE_REL_IDARRAY:
858 for (cnt = 1; (*dp & 0xc0) != 0; dp++)
859 if ((*dp & 0xc0) == 0x40)
862 case REPOKEY_TYPE_FIXARRAY:
863 case REPOKEY_TYPE_FLEXARRAY:
864 data_read_id(dp, (int *)&cnt);
866 case REPOKEY_TYPE_DIRSTRARRAY:
874 dp += strlen((const char *)dp) + 1;
876 case REPOKEY_TYPE_DIRNUMNUMARRAY:
895 /* highly specialized function to speed up fileprovides adding.
896 * - repodata must be available
897 * - solvid must be >= data->start and < data->end
898 * - returns NULL is not found, a "" entry if wrong type
899 * - also returns wrong type for REPOKEY_TYPE_DELETED
901 const unsigned char *
902 repodata_lookup_packed_dirstrarray(Repodata *data, Id solvid, Id keyname)
904 static unsigned char wrongtype[2] = { 0x00 /* dir id 0 */, 0 /* "" */ };
906 Id schema, *keyp, *kp;
909 if (!data->incoredata || !data->incoreoffset[solvid - data->start])
911 dp = data->incoredata + data->incoreoffset[solvid - data->start];
912 dp = data_read_id(dp, &schema);
913 keyp = data->schemadata + data->schemata[schema];
914 for (kp = keyp; *kp; kp++)
915 if (data->keys[*kp].name == keyname)
919 key = data->keys + *kp;
920 if (key->type != REPOKEY_TYPE_DIRSTRARRAY)
922 dp = forward_to_key(data, *kp, keyp, dp);
923 if (key->storage == KEY_STORAGE_INCORE)
925 if (key->storage == KEY_STORAGE_VERTICAL_OFFSET && dp)
928 dp = data_read_id(dp, &off);
929 data_read_id(dp, &len);
930 return get_vertical_data(data, key, off, len);
935 /* id translation functions */
938 repodata_globalize_id(Repodata *data, Id id, int create)
940 if (!id || !data || !data->localpool)
942 return pool_str2id(data->repo->pool, stringpool_id2str(&data->spool, id), create);
946 repodata_localize_id(Repodata *data, Id id, int create)
948 if (!id || !data || !data->localpool)
950 return stringpool_str2id(&data->spool, pool_id2str(data->repo->pool, id), create);
954 repodata_translate_id(Repodata *data, Repodata *fromdata, Id id, int create)
957 if (!id || !data || !fromdata)
959 if (data == fromdata || (!data->localpool && !fromdata->localpool))
961 if (fromdata->localpool)
962 s = stringpool_id2str(&fromdata->spool, id);
964 s = pool_id2str(data->repo->pool, id);
966 return stringpool_str2id(&data->spool, s, create);
968 return pool_str2id(data->repo->pool, s, create);
972 repodata_translate_dir_slow(Repodata *data, Repodata *fromdata, Id dir, int create, Id *cache)
977 /* make sure that the dirpool has an entry */
978 if (create && !data->dirpool.ndirs)
979 dirpool_add_dir(&data->dirpool, 0, 0, create);
982 parent = dirpool_parent(&fromdata->dirpool, dir);
985 if (!(parent = repodata_translate_dir(data, fromdata, parent, create, cache)))
988 compid = dirpool_compid(&fromdata->dirpool, dir);
989 if (compid > 1 && (data->localpool || fromdata->localpool))
991 if (!(compid = repodata_translate_id(data, fromdata, compid, create)))
994 if (!(compid = dirpool_add_dir(&data->dirpool, parent, compid, create)))
998 cache[(dir & 255) * 2] = dir;
999 cache[(dir & 255) * 2 + 1] = compid;
1004 /************************************************************************
1005 * uninternalized lookup / search
1009 data_fetch_uninternalized(Repodata *data, Repokey *key, Id value, KeyValue *kv)
1015 case REPOKEY_TYPE_STR:
1016 kv->str = (const char *)data->attrdata + value;
1018 case REPOKEY_TYPE_CONSTANT:
1020 kv->num = key->size;
1022 case REPOKEY_TYPE_CONSTANTID:
1025 case REPOKEY_TYPE_NUM:
1028 if (value & 0x80000000)
1030 kv->num = (unsigned int)data->attrnum64data[value ^ 0x80000000];
1031 kv->num2 = (unsigned int)(data->attrnum64data[value ^ 0x80000000] >> 32);
1035 kv->num = 0; /* not stringified */
1036 kv->str = (const char *)data->attrdata + value;
1038 case REPOKEY_TYPE_BINARY:
1039 kv->str = (const char *)data_read_id(data->attrdata + value, (Id *)&kv->num);
1041 case REPOKEY_TYPE_IDARRAY:
1042 array = data->attriddata + (value + kv->entry);
1044 kv->eof = array[1] ? 0 : 1;
1046 case REPOKEY_TYPE_DIRSTRARRAY:
1047 kv->num = 0; /* not stringified */
1048 array = data->attriddata + (value + kv->entry * 2);
1050 kv->str = (const char *)data->attrdata + array[1];
1051 kv->eof = array[2] ? 0 : 1;
1053 case REPOKEY_TYPE_DIRNUMNUMARRAY:
1054 array = data->attriddata + (value + kv->entry * 3);
1057 kv->num2 = array[2];
1058 kv->eof = array[3] ? 0 : 1;
1060 case REPOKEY_TYPE_FIXARRAY:
1061 case REPOKEY_TYPE_FLEXARRAY:
1062 array = data->attriddata + (value + kv->entry);
1063 kv->id = array[0]; /* the handle */
1064 kv->eof = array[1] ? 0 : 1;
1073 repodata_lookup_kv_uninternalized(Repodata *data, Id solvid, Id keyname, KeyValue *kv)
1076 if (!data->attrs || solvid < data->start || solvid >= data->end)
1078 ap = data->attrs[solvid - data->start];
1081 for (; *ap; ap += 2)
1083 Repokey *key = data->keys + *ap;
1084 if (key->name != keyname)
1086 data_fetch_uninternalized(data, key, ap[1], kv);
1093 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)
1100 if (!data->attrs || solvid < data->start || solvid >= data->end)
1102 ap = data->attrs[solvid - data->start];
1105 for (; *ap; ap += 2)
1107 Repokey *key = data->keys + *ap;
1108 if (keyname && key->name != keyname)
1110 s = solvid > 0 ? data->repo->pool->solvables + solvid : 0;
1114 data_fetch_uninternalized(data, key, ap[1], &kv);
1115 stop = callback(cbdata, s, data, key, &kv);
1118 while (!kv.eof && !stop);
1119 if (keyname || stop > SEARCH_NEXT_KEY)
1124 /************************************************************************
1130 repodata_stringify(Pool *pool, Repodata *data, Repokey *key, KeyValue *kv, int flags)
1134 case REPOKEY_TYPE_ID:
1135 case REPOKEY_TYPE_CONSTANTID:
1136 case REPOKEY_TYPE_IDARRAY:
1137 if (data && data->localpool)
1138 kv->str = stringpool_id2str(&data->spool, kv->id);
1140 kv->str = pool_id2str(pool, kv->id);
1141 if ((flags & SEARCH_SKIP_KIND) != 0 && key->storage == KEY_STORAGE_SOLVABLE && (key->name == SOLVABLE_NAME || key->type == REPOKEY_TYPE_IDARRAY))
1144 for (s = kv->str; *s >= 'a' && *s <= 'z'; s++)
1146 if (*s == ':' && s > kv->str)
1150 case REPOKEY_TYPE_STR:
1152 case REPOKEY_TYPE_DIRSTRARRAY:
1153 if (!(flags & SEARCH_FILES))
1154 return kv->str; /* match just the basename */
1156 return kv->str; /* already stringified */
1157 /* Put the full filename into kv->str. */
1158 kv->str = repodata_dir2str(data, kv->id, kv->str);
1159 kv->num = 1; /* mark stringification */
1162 if (!(flags & SEARCH_CHECKSUMS))
1163 return 0; /* skip em */
1165 return kv->str; /* already stringified */
1166 kv->str = repodata_chk2str(data, key->type, (const unsigned char *)kv->str);
1167 kv->num = 1; /* mark stringification */
1175 /* this is an internal hack to pass the parent kv to repodata_search_keyskip */
1176 struct subschema_data {
1183 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)
1185 repodata_search_keyskip(data, solvid, keyname, flags | SEARCH_SUBSCHEMA, (Id *)kv, callback, cbdata);
1189 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)
1191 Solvable *s = solvid > 0 ? data->repo->pool->solvables + solvid : 0;
1192 unsigned char *dp = (unsigned char *)kv->str;
1196 if (!dp || kv->entry != -1)
1198 while (++kv->entry < (int)kv->num)
1201 dp = data_skip_schema(data, dp, schema);
1202 if (kv->entry == 0 || key->type == REPOKEY_TYPE_FLEXARRAY)
1203 dp = data_read_id(dp, &schema);
1205 kv->str = (const char *)dp;
1206 kv->eof = kv->entry == kv->num - 1 ? 1 : 0;
1207 stop = callback(cbdata, s, data, key, kv);
1208 if (stop && stop != SEARCH_ENTERSUB)
1210 if ((flags & SEARCH_SUB) != 0 || stop == SEARCH_ENTERSUB)
1211 repodata_search_keyskip(data, solvid, keyname, flags | SEARCH_SUBSCHEMA, (Id *)kv, callback, cbdata);
1213 if ((flags & SEARCH_ARRAYSENTINEL) != 0)
1216 dp = data_skip_schema(data, dp, schema);
1218 kv->str = (const char *)dp;
1220 return callback(cbdata, s, data, key, kv);
1225 /* search a specific repodata */
1227 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)
1231 Id keyid, *kp, *keyp;
1232 unsigned char *dp, *ddp;
1238 if (!maybe_load_repodata(data, keyname))
1240 if ((flags & SEARCH_SUBSCHEMA) != 0)
1242 flags ^= SEARCH_SUBSCHEMA;
1243 kv.parent = (KeyValue *)keyskip;
1245 schema = kv.parent->id;
1246 dp = (unsigned char *)kv.parent->str;
1251 dp = solvid2data(data, solvid, &schema);
1256 s = solvid > 0 ? data->repo->pool->solvables + solvid : 0;
1257 keyp = data->schemadata + data->schemata[schema];
1260 /* search for a specific key */
1261 for (kp = keyp; *kp; kp++)
1262 if (data->keys[*kp].name == keyname)
1266 dp = forward_to_key(data, *kp, keyp, dp);
1272 while ((keyid = *keyp++) != 0)
1275 key = data->keys + keyid;
1276 ddp = get_data(data, key, &dp, *keyp && !onekey ? 1 : 0);
1278 if (keyskip && (key->name >= keyskip[0] || keyskip[3 + key->name] != keyskip[1] + data->repodataid))
1284 if (key->type == REPOKEY_TYPE_DELETED && !(flags & SEARCH_KEEP_TYPE_DELETED))
1290 if (key->type == REPOKEY_TYPE_FLEXARRAY || key->type == REPOKEY_TYPE_FIXARRAY)
1293 ddp = data_read_id(ddp, (Id *)&kv.num);
1294 kv.str = (const char *)ddp;
1295 stop = repodata_search_array(data, solvid, 0, flags, key, &kv, callback, cbdata);
1296 if (onekey || stop > SEARCH_NEXT_KEY)
1303 ddp = data_fetch(ddp, &kv, key);
1306 stop = callback(cbdata, s, data, key, &kv);
1309 while (!kv.eof && !stop);
1310 if (onekey || stop > SEARCH_NEXT_KEY)
1316 repodata_search(Repodata *data, Id solvid, Id keyname, int flags, int (*callback)(void *cbdata, Solvable *s, Repodata *data, Repokey *key, KeyValue *kv), void *cbdata)
1318 repodata_search_keyskip(data, solvid, keyname, flags, 0, callback, cbdata);
1322 repodata_setpos_kv(Repodata *data, KeyValue *kv)
1324 Pool *pool = data->repo->pool;
1326 pool_clear_pos(pool);
1329 pool->pos.repo = data->repo;
1330 pool->pos.repodataid = data - data->repo->repodata;
1331 pool->pos.dp = (unsigned char *)kv->str - data->incoredata;
1332 pool->pos.schema = kv->id;
1336 /************************************************************************
1337 * data iterator functions
1341 solvabledata_fetch(Solvable *s, KeyValue *kv, Id keyname)
1355 case SOLVABLE_VENDOR:
1358 case SOLVABLE_PROVIDES:
1360 return s->provides ? s->repo->idarraydata + s->provides : 0;
1361 case SOLVABLE_OBSOLETES:
1363 return s->obsoletes ? s->repo->idarraydata + s->obsoletes : 0;
1364 case SOLVABLE_CONFLICTS:
1366 return s->conflicts ? s->repo->idarraydata + s->conflicts : 0;
1367 case SOLVABLE_REQUIRES:
1369 return s->requires ? s->repo->idarraydata + s->requires : 0;
1370 case SOLVABLE_RECOMMENDS:
1372 return s->recommends ? s->repo->idarraydata + s->recommends : 0;
1373 case SOLVABLE_SUPPLEMENTS:
1375 return s->supplements ? s->repo->idarraydata + s->supplements : 0;
1376 case SOLVABLE_SUGGESTS:
1378 return s->suggests ? s->repo->idarraydata + s->suggests : 0;
1379 case SOLVABLE_ENHANCES:
1381 return s->enhances ? s->repo->idarraydata + s->enhances : 0;
1384 return s->repo->rpmdbid ? s->repo->rpmdbid + (s - s->repo->pool->solvables - s->repo->start) : 0;
1391 datamatcher_init(Datamatcher *ma, const char *match, int flags)
1393 match = match ? solv_strdup(match) : 0;
1398 if ((flags & SEARCH_STRINGMASK) == SEARCH_REGEX)
1400 ma->matchdata = solv_calloc(1, sizeof(regex_t));
1401 ma->error = regcomp((regex_t *)ma->matchdata, match, REG_EXTENDED | REG_NOSUB | REG_NEWLINE | ((flags & SEARCH_NOCASE) ? REG_ICASE : 0));
1404 solv_free(ma->matchdata);
1405 ma->flags = (flags & ~SEARCH_STRINGMASK) | SEARCH_ERROR;
1408 if ((flags & SEARCH_FILES) != 0 && match)
1410 /* prepare basename check */
1411 if ((flags & SEARCH_STRINGMASK) == SEARCH_STRING || (flags & SEARCH_STRINGMASK) == SEARCH_STRINGEND)
1413 const char *p = strrchr(match, '/');
1414 ma->matchdata = (void *)(p ? p + 1 : match);
1416 else if ((flags & SEARCH_STRINGMASK) == SEARCH_GLOB)
1419 for (p = match + strlen(match) - 1; p >= match; p--)
1420 if (*p == '[' || *p == ']' || *p == '*' || *p == '?' || *p == '/')
1422 ma->matchdata = (void *)(p + 1);
1429 datamatcher_free(Datamatcher *ma)
1432 ma->match = solv_free((char *)ma->match);
1433 if ((ma->flags & SEARCH_STRINGMASK) == SEARCH_REGEX && ma->matchdata)
1435 regfree(ma->matchdata);
1436 solv_free(ma->matchdata);
1442 datamatcher_match(Datamatcher *ma, const char *str)
1445 switch ((ma->flags & SEARCH_STRINGMASK))
1447 case SEARCH_SUBSTRING:
1448 if (ma->flags & SEARCH_NOCASE)
1449 return strcasestr(str, ma->match) != 0;
1451 return strstr(str, ma->match) != 0;
1453 if (ma->flags & SEARCH_NOCASE)
1454 return !strcasecmp(ma->match, str);
1456 return !strcmp(ma->match, str);
1457 case SEARCH_STRINGSTART:
1458 if (ma->flags & SEARCH_NOCASE)
1459 return !strncasecmp(ma->match, str, strlen(ma->match));
1461 return !strncmp(ma->match, str, strlen(ma->match));
1462 case SEARCH_STRINGEND:
1463 l = strlen(str) - strlen(ma->match);
1466 if (ma->flags & SEARCH_NOCASE)
1467 return !strcasecmp(ma->match, str + l);
1469 return !strcmp(ma->match, str + l);
1471 return !fnmatch(ma->match, str, (ma->flags & SEARCH_NOCASE) ? FNM_CASEFOLD : 0);
1473 return !regexec((const regex_t *)ma->matchdata, str, 0, NULL, 0);
1479 /* check if the matcher can match the provides basename */
1482 datamatcher_checkbasename(Datamatcher *ma, const char *basename)
1485 const char *match = ma->matchdata;
1488 switch (ma->flags & SEARCH_STRINGMASK)
1492 case SEARCH_STRINGEND:
1493 if (match != ma->match)
1494 break; /* had slash, do exact match on basename */
1497 /* check if the basename ends with match */
1498 l = strlen(basename) - strlen(match);
1504 return 1; /* maybe matches */
1506 if ((ma->flags & SEARCH_NOCASE) != 0)
1507 return !strcasecmp(match, basename);
1509 return !strcmp(match, basename);
1528 di_nextarrayelement,
1534 di_entersolvablekey,
1538 /* see dataiterator.h for documentation */
1540 dataiterator_init(Dataiterator *di, Pool *pool, Repo *repo, Id p, Id keyname, const char *match, int flags)
1542 memset(di, 0, sizeof(*di));
1544 di->flags = flags & ~SEARCH_THISSOLVID;
1545 if (!pool || (repo && repo->pool != pool))
1553 if ((error = datamatcher_init(&di->matcher, match, flags)) != 0)
1559 di->keyname = keyname;
1560 di->keynames[0] = keyname;
1561 dataiterator_set_search(di, repo, p);
1566 dataiterator_init_clone(Dataiterator *di, Dataiterator *from)
1571 if (di->dupstr == di->kv.str)
1572 di->dupstr = solv_memdup(di->dupstr, di->dupstrn);
1579 memset(&di->matcher, 0, sizeof(di->matcher));
1580 if (from->matcher.match)
1581 datamatcher_init(&di->matcher, from->matcher.match, from->matcher.flags);
1586 for (i = 1; i < di->nparents; i++)
1587 di->parents[i].kv.parent = &di->parents[i - 1].kv;
1588 di->kv.parent = &di->parents[di->nparents - 1].kv;
1591 di->oldkeyskip = solv_memdup2(di->oldkeyskip, 3 + di->oldkeyskip[0], sizeof(Id));
1593 di->keyskip = di->oldkeyskip;
1597 dataiterator_set_match(Dataiterator *di, const char *match, int flags)
1599 di->flags = (flags & ~SEARCH_THISSOLVID) | (di->flags & SEARCH_THISSOLVID);
1600 datamatcher_free(&di->matcher);
1601 memset(&di->matcher, 0, sizeof(di->matcher));
1605 if ((error = datamatcher_init(&di->matcher, match, flags)) != 0)
1615 dataiterator_set_search(Dataiterator *di, Repo *repo, Id p)
1619 di->flags &= ~SEARCH_THISSOLVID;
1623 if (!di->pool->urepos)
1631 di->repo = di->pool->repos[di->repoid];
1633 di->state = di_enterrepo;
1635 dataiterator_jump_to_solvid(di, p);
1639 dataiterator_set_keyname(Dataiterator *di, Id keyname)
1642 di->keyname = keyname;
1643 di->keynames[0] = keyname;
1647 dataiterator_prepend_keyname(Dataiterator *di, Id keyname)
1651 if (di->nkeynames >= sizeof(di->keynames)/sizeof(*di->keynames) - 2)
1653 di->state = di_bye; /* sorry */
1656 for (i = di->nkeynames + 1; i > 0; i--)
1657 di->keynames[i] = di->keynames[i - 1];
1658 di->keynames[0] = di->keyname = keyname;
1663 dataiterator_free(Dataiterator *di)
1665 if (di->matcher.match)
1666 datamatcher_free(&di->matcher);
1668 solv_free(di->dupstr);
1670 solv_free(di->oldkeyskip);
1673 static unsigned char *
1674 dataiterator_find_keyname(Dataiterator *di, Id keyname)
1677 Repokey *keys = di->data->keys, *key;
1680 for (keyp = di->keyp; *keyp; keyp++)
1681 if (keys[*keyp].name == keyname)
1686 if (key->type == REPOKEY_TYPE_DELETED)
1688 if (key->storage != KEY_STORAGE_INCORE && key->storage != KEY_STORAGE_VERTICAL_OFFSET)
1689 return 0; /* get_data will not work, no need to forward */
1690 dp = forward_to_key(di->data, *keyp, di->keyp, di->dp);
1698 dataiterator_step(Dataiterator *di)
1702 if (di->state == di_nextattr && di->key->storage == KEY_STORAGE_VERTICAL_OFFSET && di->vert_ddp && di->vert_storestate != di->data->storestate)
1704 unsigned int ddpoff = di->ddp - di->vert_ddp;
1705 di->vert_off += ddpoff;
1706 di->vert_len -= ddpoff;
1707 di->ddp = di->vert_ddp = get_vertical_data(di->data, di->key, di->vert_off, di->vert_len);
1708 di->vert_storestate = di->data->storestate;
1710 di->state = di_nextkey;
1716 case di_enterrepo: di_enterrepo:
1717 if (!di->repo || (di->repo->disabled && !(di->flags & SEARCH_DISABLED_REPOS)))
1719 if (!(di->flags & SEARCH_THISSOLVID))
1721 di->solvid = di->repo->start - 1; /* reset solvid iterator */
1722 goto di_nextsolvable;
1726 case di_entersolvable: di_entersolvable:
1727 if (!di->repodataid)
1728 goto di_enterrepodata; /* POS case, repodata is set */
1729 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)
1731 extern Repokey repo_solvablekeys[RPM_RPMDBID - SOLVABLE_NAME + 1];
1732 di->key = repo_solvablekeys + (di->keyname ? di->keyname - SOLVABLE_NAME : 0);
1734 goto di_entersolvablekey;
1739 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);
1741 goto di_nextsolvable;
1742 di->repodataid = di->data - di->repo->repodata;
1744 goto di_enterrepodata;
1746 di_leavesolvablekey:
1747 di->repodataid = 1; /* reset repodata iterator */
1748 di->keyskip = repo_create_keyskip(di->repo, di->solvid, &di->oldkeyskip);
1751 case di_enterrepodata: di_enterrepodata:
1754 if (di->repodataid >= di->repo->nrepodata)
1755 goto di_nextsolvable;
1756 di->data = di->repo->repodata + di->repodataid;
1758 if (!maybe_load_repodata(di->data, di->keyname))
1759 goto di_nextrepodata;
1760 di->dp = solvid2data(di->data, di->solvid, &schema);
1762 goto di_nextrepodata;
1763 if (di->solvid == SOLVID_POS)
1764 di->solvid = di->pool->pos.solvid;
1765 /* reset key iterator */
1766 di->keyp = di->data->schemadata + di->data->schemata[schema];
1769 case di_enterschema: di_enterschema:
1771 di->dp = dataiterator_find_keyname(di, di->keyname);
1772 if (!di->dp || !*di->keyp)
1776 goto di_nextrepodata;
1780 case di_enterkey: di_enterkey:
1782 di->key = di->data->keys + *di->keyp;
1785 /* this is get_data() modified to store vert_ data */
1786 if (di->key->storage == KEY_STORAGE_VERTICAL_OFFSET)
1789 di->dp = data_read_id(di->dp, &off);
1790 di->dp = data_read_id(di->dp, &len);
1791 di->vert_ddp = di->ddp = get_vertical_data(di->data, di->key, off, len);
1794 di->vert_storestate = di->data->storestate;
1796 else if (di->key->storage == KEY_STORAGE_INCORE)
1798 di->ddp = di->dp; /* start of data */
1799 if (di->keyp[1] && (!di->keyname || (di->flags & SEARCH_SUB) != 0))
1800 di->dp = data_skip_key(di->data, di->dp, di->key); /* advance to next key */
1806 if (di->keyskip && (di->key->name >= di->keyskip[0] || di->keyskip[3 + di->key->name] != di->keyskip[1] + di->data->repodataid))
1808 if (di->key->type == REPOKEY_TYPE_DELETED && !(di->flags & SEARCH_KEEP_TYPE_DELETED))
1810 if (di->key->type == REPOKEY_TYPE_FIXARRAY || di->key->type == REPOKEY_TYPE_FLEXARRAY)
1812 if (di->nkeynames && di->nparents - di->rootlevel < di->nkeynames)
1818 di->ddp = data_fetch(di->ddp, &di->kv, di->key);
1819 di->state = di->kv.eof ? di_nextkey : di_nextattr;
1822 case di_nextkey: di_nextkey:
1823 if (!di->keyname && *++di->keyp)
1829 case di_nextrepodata: di_nextrepodata:
1830 if (!di->keyname && di->repodataid && ++di->repodataid < di->repo->nrepodata)
1831 goto di_enterrepodata;
1834 case di_nextsolvable: di_nextsolvable:
1835 if (!(di->flags & SEARCH_THISSOLVID))
1838 di->solvid = di->repo->start;
1841 for (; di->solvid < di->repo->end; di->solvid++)
1843 if (di->pool->solvables[di->solvid].repo == di->repo)
1844 goto di_entersolvable;
1849 case di_nextrepo: di_nextrepo:
1854 if (di->repoid < di->pool->nrepos)
1856 di->repo = di->pool->repos[di->repoid];
1862 case di_bye: di_bye:
1866 case di_enterarray: di_enterarray:
1867 if (di->key->name == REPOSITORY_SOLVABLES)
1869 di->ddp = data_read_id(di->ddp, (Id *)&di->kv.num);
1874 case di_nextarrayelement: di_nextarrayelement:
1877 di->ddp = data_skip_schema(di->data, di->ddp, di->kv.id);
1878 if (di->kv.entry == di->kv.num)
1880 if (di->nkeynames && di->nparents - di->rootlevel < di->nkeynames)
1882 if (!(di->flags & SEARCH_ARRAYSENTINEL))
1884 di->kv.str = (char *)di->ddp;
1886 di->state = di_nextkey;
1889 if (di->kv.entry == di->kv.num - 1)
1891 if (di->key->type == REPOKEY_TYPE_FLEXARRAY || !di->kv.entry)
1892 di->ddp = data_read_id(di->ddp, &di->kv.id);
1893 di->kv.str = (char *)di->ddp;
1894 if (di->nkeynames && di->nparents - di->rootlevel < di->nkeynames)
1896 if ((di->flags & SEARCH_SUB) != 0)
1897 di->state = di_entersub;
1899 di->state = di_nextarrayelement;
1902 case di_entersub: di_entersub:
1903 if (di->nparents == sizeof(di->parents)/sizeof(*di->parents) - 1)
1904 goto di_nextarrayelement; /* sorry, full */
1905 di->parents[di->nparents].kv = di->kv;
1906 di->parents[di->nparents].dp = di->dp;
1907 di->parents[di->nparents].keyp = di->keyp;
1908 di->dp = (unsigned char *)di->kv.str;
1909 di->keyp = di->data->schemadata + di->data->schemata[di->kv.id];
1910 memset(&di->kv, 0, sizeof(di->kv));
1911 di->kv.parent = &di->parents[di->nparents].kv;
1913 di->keyname = di->keynames[di->nparents - di->rootlevel];
1914 goto di_enterschema;
1916 case di_leavesub: di_leavesub:
1917 if (di->nparents - 1 < di->rootlevel)
1920 di->dp = di->parents[di->nparents].dp;
1921 di->kv = di->parents[di->nparents].kv;
1922 di->keyp = di->parents[di->nparents].keyp;
1923 di->key = di->data->keys + *di->keyp;
1924 di->ddp = (unsigned char *)di->kv.str;
1925 di->keyname = di->keynames[di->nparents - di->rootlevel];
1926 goto di_nextarrayelement;
1928 /* special solvable attr handling follows */
1930 case di_nextsolvablekey: di_nextsolvablekey:
1932 goto di_nextsolvable;
1933 if (di->key->name == RPM_RPMDBID) /* reached end of list? */
1934 goto di_leavesolvablekey;
1938 case di_entersolvablekey: di_entersolvablekey:
1939 di->idp = solvabledata_fetch(di->pool->solvables + di->solvid, &di->kv, di->key->name);
1940 if (!di->idp || !*di->idp)
1941 goto di_nextsolvablekey;
1945 di->kv.id = *di->idp;
1946 di->kv.num = *di->idp; /* for rpmdbid */
1947 di->kv.num2 = 0; /* for rpmdbid */
1949 di->state = di_nextsolvablekey;
1955 case di_nextsolvableattr:
1956 di->state = di_nextsolvableattr;
1957 di->kv.id = *di->idp++;
1962 di->state = di_nextsolvablekey;
1968 /* we have a potential match */
1969 if (di->matcher.match)
1972 /* simple pre-check so that we don't need to stringify */
1973 if (di->keyname == SOLVABLE_FILELIST && di->key->type == REPOKEY_TYPE_DIRSTRARRAY && (di->matcher.flags & SEARCH_FILES) != 0)
1974 if (!datamatcher_checkbasename(&di->matcher, di->kv.str))
1976 /* now stringify so that we can do the matching */
1977 if (!(str = repodata_stringify(di->pool, di->data, di->key, &di->kv, di->flags)))
1979 if (di->keyname && (di->key->type == REPOKEY_TYPE_FIXARRAY || di->key->type == REPOKEY_TYPE_FLEXARRAY))
1983 if (!datamatcher_match(&di->matcher, str))
1988 /* stringify filelist if requested */
1989 if (di->keyname == SOLVABLE_FILELIST && di->key->type == REPOKEY_TYPE_DIRSTRARRAY && (di->flags & SEARCH_FILES) != 0)
1990 repodata_stringify(di->pool, di->data, di->key, &di->kv, di->flags);
1992 /* found something! */
1998 dataiterator_entersub(Dataiterator *di)
2000 if (di->state == di_nextarrayelement)
2001 di->state = di_entersub;
2005 dataiterator_setpos(Dataiterator *di)
2007 if (di->kv.eof == 2)
2009 pool_clear_pos(di->pool);
2012 di->pool->pos.solvid = di->solvid;
2013 di->pool->pos.repo = di->repo;
2014 di->pool->pos.repodataid = di->data - di->repo->repodata;
2015 di->pool->pos.schema = di->kv.id;
2016 di->pool->pos.dp = (unsigned char *)di->kv.str - di->data->incoredata;
2020 dataiterator_setpos_parent(Dataiterator *di)
2022 if (!di->kv.parent || di->kv.parent->eof == 2)
2024 pool_clear_pos(di->pool);
2027 di->pool->pos.solvid = di->solvid;
2028 di->pool->pos.repo = di->repo;
2029 di->pool->pos.repodataid = di->data - di->repo->repodata;
2030 di->pool->pos.schema = di->kv.parent->id;
2031 di->pool->pos.dp = (unsigned char *)di->kv.parent->str - di->data->incoredata;
2034 /* clones just the position, not the search keys/matcher */
2036 dataiterator_clonepos(Dataiterator *di, Dataiterator *from)
2038 di->state = from->state;
2039 di->flags &= ~SEARCH_THISSOLVID;
2040 di->flags |= (from->flags & SEARCH_THISSOLVID);
2041 di->repo = from->repo;
2042 di->data = from->data;
2044 di->ddp = from->ddp;
2045 di->idp = from->idp;
2046 di->keyp = from->keyp;
2047 di->key = from->key;
2049 di->repodataid = from->repodataid;
2050 di->solvid = from->solvid;
2051 di->repoid = from->repoid;
2052 di->rootlevel = from->rootlevel;
2053 memcpy(di->parents, from->parents, sizeof(from->parents));
2054 di->nparents = from->nparents;
2058 for (i = 1; i < di->nparents; i++)
2059 di->parents[i].kv.parent = &di->parents[i - 1].kv;
2060 di->kv.parent = &di->parents[di->nparents - 1].kv;
2064 if (from->dupstr && from->dupstr == from->kv.str)
2066 di->dupstrn = from->dupstrn;
2067 di->dupstr = solv_memdup(from->dupstr, from->dupstrn);
2072 dataiterator_seek(Dataiterator *di, int whence)
2074 if ((whence & DI_SEEK_STAY) != 0)
2075 di->rootlevel = di->nparents;
2076 switch (whence & ~DI_SEEK_STAY)
2079 if (di->state != di_nextarrayelement)
2081 if ((whence & DI_SEEK_STAY) != 0)
2082 di->rootlevel = di->nparents + 1; /* XXX: dangerous! */
2083 di->state = di_entersub;
2085 case DI_SEEK_PARENT:
2092 if (di->rootlevel > di->nparents)
2093 di->rootlevel = di->nparents;
2094 di->dp = di->parents[di->nparents].dp;
2095 di->kv = di->parents[di->nparents].kv;
2096 di->keyp = di->parents[di->nparents].keyp;
2097 di->key = di->data->keys + *di->keyp;
2098 di->ddp = (unsigned char *)di->kv.str;
2099 di->keyname = di->keynames[di->nparents - di->rootlevel];
2100 di->state = di_nextarrayelement;
2102 case DI_SEEK_REWIND:
2108 di->dp = (unsigned char *)di->kv.parent->str;
2109 di->keyp = di->data->schemadata + di->data->schemata[di->kv.parent->id];
2110 di->state = di_enterschema;
2118 dataiterator_skip_attribute(Dataiterator *di)
2120 if (di->state == di_nextsolvableattr)
2121 di->state = di_nextsolvablekey;
2123 di->state = di_nextkey;
2127 dataiterator_skip_solvable(Dataiterator *di)
2132 di->keyname = di->keynames[0];
2133 di->state = di_nextsolvable;
2137 dataiterator_skip_repo(Dataiterator *di)
2142 di->keyname = di->keynames[0];
2143 di->state = di_nextrepo;
2147 dataiterator_jump_to_solvid(Dataiterator *di, Id solvid)
2152 di->keyname = di->keynames[0];
2153 if (solvid == SOLVID_POS)
2155 di->repo = di->pool->pos.repo;
2162 if (!di->pool->pos.repodataid && di->pool->pos.solvid == SOLVID_META) {
2163 solvid = SOLVID_META; /* META pos hack */
2165 di->data = di->repo->repodata + di->pool->pos.repodataid;
2169 else if (solvid > 0)
2171 di->repo = di->pool->solvables[solvid].repo;
2176 if (!di->pool->urepos)
2182 di->repo = di->pool->repos[di->repoid];
2184 if (solvid != SOLVID_POS)
2186 di->solvid = solvid;
2188 di->flags |= SEARCH_THISSOLVID;
2189 di->state = di_enterrepo;
2193 dataiterator_jump_to_repo(Dataiterator *di, Repo *repo)
2199 di->repoid = 0; /* 0 means stay at repo */
2202 di->flags &= ~SEARCH_THISSOLVID;
2203 di->state = di_enterrepo;
2207 dataiterator_match(Dataiterator *di, Datamatcher *ma)
2210 if (!(str = repodata_stringify(di->pool, di->data, di->key, &di->kv, di->flags)))
2212 return ma ? datamatcher_match(ma, str) : 1;
2216 dataiterator_strdup(Dataiterator *di)
2220 if (!di->kv.str || di->kv.str == di->dupstr)
2222 switch (di->key->type)
2225 case REPOKEY_TYPE_DIRSTRARRAY:
2226 if (di->kv.num) /* was it stringified into tmp space? */
2227 l = strlen(di->kv.str) + 1;
2232 if (l < 0 && di->key->storage == KEY_STORAGE_VERTICAL_OFFSET)
2234 switch (di->key->type)
2236 case REPOKEY_TYPE_STR:
2237 case REPOKEY_TYPE_DIRSTRARRAY:
2238 l = strlen(di->kv.str) + 1;
2241 l = solv_chksum_len(di->key->type);
2243 case REPOKEY_TYPE_BINARY:
2250 if (!di->dupstrn || di->dupstrn < l)
2252 di->dupstrn = l + 16;
2253 di->dupstr = solv_realloc(di->dupstr, di->dupstrn);
2256 memcpy(di->dupstr, di->kv.str, l);
2257 di->kv.str = di->dupstr;
2261 /************************************************************************
2262 * data modify functions
2265 /* extend repodata so that it includes solvables p */
2267 repodata_extend(Repodata *data, Id p)
2269 if (data->start == data->end)
2270 data->start = data->end = p;
2273 int old = data->end - data->start;
2274 int new = p - data->end + 1;
2277 data->attrs = solv_extend(data->attrs, old, new, sizeof(Id *), REPODATA_BLOCK);
2278 memset(data->attrs + old, 0, new * sizeof(Id *));
2280 data->incoreoffset = solv_extend(data->incoreoffset, old, new, sizeof(Id), REPODATA_BLOCK);
2281 memset(data->incoreoffset + old, 0, new * sizeof(Id));
2284 if (p < data->start)
2286 int old = data->end - data->start;
2287 int new = data->start - p;
2290 data->attrs = solv_extend_resize(data->attrs, old + new, sizeof(Id *), REPODATA_BLOCK);
2291 memmove(data->attrs + new, data->attrs, old * sizeof(Id *));
2292 memset(data->attrs, 0, new * sizeof(Id *));
2294 data->incoreoffset = solv_extend_resize(data->incoreoffset, old + new, sizeof(Id), REPODATA_BLOCK);
2295 memmove(data->incoreoffset + new, data->incoreoffset, old * sizeof(Id));
2296 memset(data->incoreoffset, 0, new * sizeof(Id));
2301 /* shrink end of repodata */
2303 repodata_shrink(Repodata *data, int end)
2307 if (data->end <= end)
2309 if (data->start >= end)
2313 for (i = 0; i < data->end - data->start; i++)
2314 solv_free(data->attrs[i]);
2315 data->attrs = solv_free(data->attrs);
2317 data->incoreoffset = solv_free(data->incoreoffset);
2318 data->start = data->end = 0;
2323 for (i = end; i < data->end; i++)
2324 solv_free(data->attrs[i - data->start]);
2325 data->attrs = solv_extend_resize(data->attrs, end - data->start, sizeof(Id *), REPODATA_BLOCK);
2327 if (data->incoreoffset)
2328 data->incoreoffset = solv_extend_resize(data->incoreoffset, end - data->start, sizeof(Id), REPODATA_BLOCK);
2332 /* extend repodata so that it includes solvables from start to start + num - 1 */
2334 repodata_extend_block(Repodata *data, Id start, Id num)
2338 if (!data->incoreoffset)
2340 /* this also means that data->attrs is NULL */
2341 data->incoreoffset = solv_calloc_block(num, sizeof(Id), REPODATA_BLOCK);
2342 data->start = start;
2343 data->end = start + num;
2346 repodata_extend(data, start);
2348 repodata_extend(data, start + num - 1);
2351 /**********************************************************************/
2354 #define REPODATA_ATTRS_BLOCK 31
2355 #define REPODATA_ATTRDATA_BLOCK 1023
2356 #define REPODATA_ATTRIDDATA_BLOCK 63
2357 #define REPODATA_ATTRNUM64DATA_BLOCK 15
2361 repodata_new_handle(Repodata *data)
2365 data->xattrs = solv_calloc_block(1, sizeof(Id *), REPODATA_BLOCK);
2366 data->nxattrs = 2; /* -1: SOLVID_META */
2368 data->xattrs = solv_extend(data->xattrs, data->nxattrs, 1, sizeof(Id *), REPODATA_BLOCK);
2369 data->xattrs[data->nxattrs] = 0;
2370 return -(data->nxattrs++);
2374 repodata_get_attrp(Repodata *data, Id handle)
2378 if (handle == SOLVID_META && !data->xattrs)
2380 data->xattrs = solv_calloc_block(1, sizeof(Id *), REPODATA_BLOCK);
2383 return data->xattrs - handle;
2385 if (handle < data->start || handle >= data->end)
2386 repodata_extend(data, handle);
2388 data->attrs = solv_calloc_block(data->end - data->start, sizeof(Id *), REPODATA_BLOCK);
2389 return data->attrs + (handle - data->start);
2393 repodata_insert_keyid(Repodata *data, Id handle, Id keyid, Id val, int overwrite)
2399 app = repodata_get_attrp(data, handle);
2404 /* Determine equality based on the name only, allows us to change
2405 type (when overwrite is set), and makes TYPE_CONSTANT work. */
2406 for (pp = ap; *pp; pp += 2)
2407 if (data->keys[*pp].name == data->keys[keyid].name)
2411 if (overwrite || data->keys[*pp].type == REPOKEY_TYPE_DELETED)
2420 ap = solv_extend(ap, i, 3, sizeof(Id), REPODATA_ATTRS_BLOCK);
2430 repodata_set(Repodata *data, Id solvid, Repokey *key, Id val)
2434 keyid = repodata_key2id(data, key, 1);
2435 repodata_insert_keyid(data, solvid, keyid, val, 1);
2439 repodata_set_id(Repodata *data, Id solvid, Id keyname, Id id)
2443 key.type = REPOKEY_TYPE_ID;
2445 key.storage = KEY_STORAGE_INCORE;
2446 repodata_set(data, solvid, &key, id);
2450 repodata_set_num(Repodata *data, Id solvid, Id keyname, unsigned long long num)
2454 key.type = REPOKEY_TYPE_NUM;
2456 key.storage = KEY_STORAGE_INCORE;
2457 if (num >= 0x80000000)
2459 data->attrnum64data = solv_extend(data->attrnum64data, data->attrnum64datalen, 1, sizeof(unsigned long long), REPODATA_ATTRNUM64DATA_BLOCK);
2460 data->attrnum64data[data->attrnum64datalen] = num;
2461 num = 0x80000000 | data->attrnum64datalen++;
2463 repodata_set(data, solvid, &key, (Id)num);
2467 repodata_set_poolstr(Repodata *data, Id solvid, Id keyname, const char *str)
2471 if (data->localpool)
2472 id = stringpool_str2id(&data->spool, str, 1);
2474 id = pool_str2id(data->repo->pool, str, 1);
2476 key.type = REPOKEY_TYPE_ID;
2478 key.storage = KEY_STORAGE_INCORE;
2479 repodata_set(data, solvid, &key, id);
2483 repodata_set_constant(Repodata *data, Id solvid, Id keyname, unsigned int constant)
2487 key.type = REPOKEY_TYPE_CONSTANT;
2488 key.size = constant;
2489 key.storage = KEY_STORAGE_INCORE;
2490 repodata_set(data, solvid, &key, 0);
2494 repodata_set_constantid(Repodata *data, Id solvid, Id keyname, Id id)
2498 key.type = REPOKEY_TYPE_CONSTANTID;
2500 key.storage = KEY_STORAGE_INCORE;
2501 repodata_set(data, solvid, &key, 0);
2505 repodata_set_void(Repodata *data, Id solvid, Id keyname)
2509 key.type = REPOKEY_TYPE_VOID;
2511 key.storage = KEY_STORAGE_INCORE;
2512 repodata_set(data, solvid, &key, 0);
2516 repodata_set_str(Repodata *data, Id solvid, Id keyname, const char *str)
2521 l = strlen(str) + 1;
2523 key.type = REPOKEY_TYPE_STR;
2525 key.storage = KEY_STORAGE_INCORE;
2526 data->attrdata = solv_extend(data->attrdata, data->attrdatalen, l, 1, REPODATA_ATTRDATA_BLOCK);
2527 memcpy(data->attrdata + data->attrdatalen, str, l);
2528 repodata_set(data, solvid, &key, data->attrdatalen);
2529 data->attrdatalen += l;
2533 repodata_set_binary(Repodata *data, Id solvid, Id keyname, void *buf, int len)
2541 key.type = REPOKEY_TYPE_BINARY;
2543 key.storage = KEY_STORAGE_INCORE;
2544 data->attrdata = solv_extend(data->attrdata, data->attrdatalen, len + 5, 1, REPODATA_ATTRDATA_BLOCK);
2545 dp = data->attrdata + data->attrdatalen;
2546 if (len >= (1 << 14))
2548 if (len >= (1 << 28))
2549 *dp++ = (len >> 28) | 128;
2550 if (len >= (1 << 21))
2551 *dp++ = (len >> 21) | 128;
2552 *dp++ = (len >> 14) | 128;
2554 if (len >= (1 << 7))
2555 *dp++ = (len >> 7) | 128;
2558 memcpy(dp, buf, len);
2559 repodata_set(data, solvid, &key, data->attrdatalen);
2560 data->attrdatalen = dp + len - data->attrdata;
2563 /* add an array element consisting of entrysize Ids to the repodata. modifies attriddata
2564 * so that the caller can append entrysize new elements plus the termination zero there */
2566 repodata_add_array(Repodata *data, Id handle, Id keyname, Id keytype, int entrysize)
2569 Id *ida, *pp, **ppp;
2571 /* check if it is the same as last time, this speeds things up a lot */
2572 if (handle == data->lasthandle && data->keys[data->lastkey].name == keyname && data->keys[data->lastkey].type == keytype && data->attriddatalen == data->lastdatalen)
2574 /* great! just append the new data */
2575 data->attriddata = solv_extend(data->attriddata, data->attriddatalen, entrysize, sizeof(Id), REPODATA_ATTRIDDATA_BLOCK);
2576 data->attriddatalen--; /* overwrite terminating 0 */
2577 data->lastdatalen += entrysize;
2581 ppp = repodata_get_attrp(data, handle);
2585 for (; *pp; pp += 2)
2586 if (data->keys[*pp].name == keyname)
2589 if (!pp || !*pp || data->keys[*pp].type != keytype)
2591 /* not found. allocate new key */
2597 key.storage = KEY_STORAGE_INCORE;
2598 data->attriddata = solv_extend(data->attriddata, data->attriddatalen, entrysize + 1, sizeof(Id), REPODATA_ATTRIDDATA_BLOCK);
2599 keyid = repodata_key2id(data, &key, 1);
2600 repodata_insert_keyid(data, handle, keyid, data->attriddatalen, 1);
2601 data->lasthandle = handle;
2602 data->lastkey = keyid;
2603 data->lastdatalen = data->attriddatalen + entrysize + 1;
2607 for (ida = data->attriddata + pp[1]; *ida; ida += entrysize)
2608 oldsize += entrysize;
2609 if (ida + 1 == data->attriddata + data->attriddatalen)
2611 /* this was the last entry, just append it */
2612 data->attriddata = solv_extend(data->attriddata, data->attriddatalen, entrysize, sizeof(Id), REPODATA_ATTRIDDATA_BLOCK);
2613 data->attriddatalen--; /* overwrite terminating 0 */
2617 /* too bad. move to back. */
2618 data->attriddata = solv_extend(data->attriddata, data->attriddatalen, oldsize + entrysize + 1, sizeof(Id), REPODATA_ATTRIDDATA_BLOCK);
2619 memcpy(data->attriddata + data->attriddatalen, data->attriddata + pp[1], oldsize * sizeof(Id));
2620 pp[1] = data->attriddatalen;
2621 data->attriddatalen += oldsize;
2623 data->lasthandle = handle;
2624 data->lastkey = *pp;
2625 data->lastdatalen = data->attriddatalen + entrysize + 1;
2629 repodata_set_bin_checksum(Repodata *data, Id solvid, Id keyname, Id type,
2630 const unsigned char *str)
2635 if (!(l = solv_chksum_len(type)))
2640 key.storage = KEY_STORAGE_INCORE;
2641 data->attrdata = solv_extend(data->attrdata, data->attrdatalen, l, 1, REPODATA_ATTRDATA_BLOCK);
2642 memcpy(data->attrdata + data->attrdatalen, str, l);
2643 repodata_set(data, solvid, &key, data->attrdatalen);
2644 data->attrdatalen += l;
2648 repodata_set_checksum(Repodata *data, Id solvid, Id keyname, Id type,
2651 unsigned char buf[64];
2654 if (!(l = solv_chksum_len(type)))
2656 if (l > sizeof(buf) || solv_hex2bin(&str, buf, l) != l)
2658 repodata_set_bin_checksum(data, solvid, keyname, type, buf);
2662 repodata_chk2str(Repodata *data, Id type, const unsigned char *buf)
2666 if (!(l = solv_chksum_len(type)))
2668 return pool_bin2hex(data->repo->pool, buf, l);
2671 /* rpm filenames don't contain the epoch, so strip it */
2672 static inline const char *
2673 evrid2vrstr(Pool *pool, Id evrid)
2675 const char *p, *evr = pool_id2str(pool, evrid);
2678 for (p = evr; *p >= '0' && *p <= '9'; p++)
2680 return p != evr && *p == ':' && p[1] ? p + 1 : evr;
2684 repodata_set_poolstrn(Repodata *data, Id solvid, Id keyname, const char *str, int l)
2687 if (data->localpool)
2688 id = stringpool_strn2id(&data->spool, str, l, 1);
2690 id = pool_strn2id(data->repo->pool, str, l, 1);
2691 repodata_set_id(data, solvid, keyname, id);
2695 repodata_set_strn(Repodata *data, Id solvid, Id keyname, const char *str, int l)
2698 repodata_set_str(data, solvid, keyname, str);
2701 char *s = solv_strdup(str);
2703 repodata_set_str(data, solvid, keyname, s);
2709 repodata_set_location(Repodata *data, Id solvid, int medianr, const char *dir, const char *file)
2711 Pool *pool = data->repo->pool;
2713 const char *str, *fp;
2717 repodata_set_constant(data, solvid, SOLVABLE_MEDIANR, medianr);
2720 if ((dir = strrchr(file, '/')) != 0)
2731 if (l >= 2 && dir[0] == '.' && dir[1] == '/' && (l == 2 || dir[2] != '/'))
2736 if (l == 1 && dir[0] == '.')
2738 s = pool->solvables + solvid;
2741 str = pool_id2str(pool, s->arch);
2742 if (!strncmp(dir, str, l) && !str[l])
2743 repodata_set_void(data, solvid, SOLVABLE_MEDIADIR);
2745 repodata_set_strn(data, solvid, SOLVABLE_MEDIADIR, dir, l);
2748 str = pool_id2str(pool, s->name);
2750 if ((!l || !strncmp(fp, str, l)) && fp[l] == '-')
2753 str = evrid2vrstr(pool, s->evr);
2755 if ((!l || !strncmp(fp, str, l)) && fp[l] == '.')
2758 str = pool_id2str(pool, s->arch);
2760 if ((!l || !strncmp(fp, str, l)) && !strcmp(fp + l, ".rpm"))
2762 repodata_set_void(data, solvid, SOLVABLE_MEDIAFILE);
2767 repodata_set_str(data, solvid, SOLVABLE_MEDIAFILE, file);
2770 /* XXX: medianr is currently not stored */
2772 repodata_set_deltalocation(Repodata *data, Id handle, int medianr, const char *dir, const char *file)
2775 const char *evr, *suf, *s;
2779 if ((dir = strrchr(file, '/')) != 0)
2790 if (l >= 2 && dir[0] == '.' && dir[1] == '/' && (l == 2 || dir[2] != '/'))
2795 if (l == 1 && dir[0] == '.')
2798 repodata_set_poolstrn(data, handle, DELTA_LOCATION_DIR, dir, l);
2799 evr = strchr(file, '-');
2802 for (s = evr - 1; s > file; s--)
2809 suf = strrchr(file, '.');
2812 for (s = suf - 1; s > file; s--)
2818 if (!strcmp(suf, ".delta.rpm") || !strcmp(suf, ".patch.rpm"))
2820 /* We accept one more item as suffix. */
2821 for (s = suf - 1; s > file; s--)
2831 if (suf && evr && suf < evr)
2833 repodata_set_poolstrn(data, handle, DELTA_LOCATION_NAME, file, evr ? evr - file : strlen(file));
2835 repodata_set_poolstrn(data, handle, DELTA_LOCATION_EVR, evr + 1, suf ? suf - evr - 1: strlen(evr + 1));
2837 repodata_set_poolstr(data, handle, DELTA_LOCATION_SUFFIX, suf + 1);
2841 repodata_set_sourcepkg(Repodata *data, Id solvid, const char *sourcepkg)
2843 Pool *pool = data->repo->pool;
2844 Solvable *s = pool->solvables + solvid;
2845 const char *p, *sevr, *sarch, *name, *evr;
2847 p = strrchr(sourcepkg, '.');
2848 if (!p || strcmp(p, ".rpm") != 0)
2851 repodata_set_str(data, solvid, SOLVABLE_SOURCENAME, sourcepkg);
2855 while (p > sourcepkg && *p != '.')
2857 if (*p != '.' || p == sourcepkg)
2860 while (p > sourcepkg && *p != '-')
2862 if (*p != '-' || p == sourcepkg)
2865 while (p > sourcepkg && *p != '-')
2867 if (*p != '-' || p == sourcepkg)
2870 pool = s->repo->pool;
2872 name = pool_id2str(pool, s->name);
2873 if (name && !strncmp(sourcepkg, name, sevr - sourcepkg - 1) && name[sevr - sourcepkg - 1] == 0)
2874 repodata_set_void(data, solvid, SOLVABLE_SOURCENAME);
2876 repodata_set_id(data, solvid, SOLVABLE_SOURCENAME, pool_strn2id(pool, sourcepkg, sevr - sourcepkg - 1, 1));
2878 evr = evrid2vrstr(pool, s->evr);
2879 if (evr && !strncmp(sevr, evr, sarch - sevr - 1) && evr[sarch - sevr - 1] == 0)
2880 repodata_set_void(data, solvid, SOLVABLE_SOURCEEVR);
2882 repodata_set_id(data, solvid, SOLVABLE_SOURCEEVR, pool_strn2id(pool, sevr, sarch - sevr - 1, 1));
2884 if (!strcmp(sarch, "src.rpm"))
2885 repodata_set_constantid(data, solvid, SOLVABLE_SOURCEARCH, ARCH_SRC);
2886 else if (!strcmp(sarch, "nosrc.rpm"))
2887 repodata_set_constantid(data, solvid, SOLVABLE_SOURCEARCH, ARCH_NOSRC);
2889 repodata_set_constantid(data, solvid, SOLVABLE_SOURCEARCH, pool_strn2id(pool, sarch, strlen(sarch) - 4, 1));
2893 repodata_set_idarray(Repodata *data, Id solvid, Id keyname, Queue *q)
2899 key.type = REPOKEY_TYPE_IDARRAY;
2901 key.storage = KEY_STORAGE_INCORE;
2902 repodata_set(data, solvid, &key, data->attriddatalen);
2903 data->attriddata = solv_extend(data->attriddata, data->attriddatalen, q->count + 1, sizeof(Id), REPODATA_ATTRIDDATA_BLOCK);
2904 for (i = 0; i < q->count; i++)
2905 data->attriddata[data->attriddatalen++] = q->elements[i];
2906 data->attriddata[data->attriddatalen++] = 0;
2910 repodata_add_dirnumnum(Repodata *data, Id solvid, Id keyname, Id dir, Id num, Id num2)
2914 fprintf(stderr, "repodata_add_dirnumnum %d %d %d %d (%d)\n", solvid, dir, num, num2, data->attriddatalen);
2916 repodata_add_array(data, solvid, keyname, REPOKEY_TYPE_DIRNUMNUMARRAY, 3);
2917 data->attriddata[data->attriddatalen++] = dir;
2918 data->attriddata[data->attriddatalen++] = num;
2919 data->attriddata[data->attriddatalen++] = num2;
2920 data->attriddata[data->attriddatalen++] = 0;
2924 repodata_add_dirstr(Repodata *data, Id solvid, Id keyname, Id dir, const char *str)
2930 l = strlen(str) + 1;
2931 data->attrdata = solv_extend(data->attrdata, data->attrdatalen, l, 1, REPODATA_ATTRDATA_BLOCK);
2932 memcpy(data->attrdata + data->attrdatalen, str, l);
2933 stroff = data->attrdatalen;
2934 data->attrdatalen += l;
2937 fprintf(stderr, "repodata_add_dirstr %d %d %s (%d)\n", solvid, dir, str, data->attriddatalen);
2939 repodata_add_array(data, solvid, keyname, REPOKEY_TYPE_DIRSTRARRAY, 2);
2940 data->attriddata[data->attriddatalen++] = dir;
2941 data->attriddata[data->attriddatalen++] = stroff;
2942 data->attriddata[data->attriddatalen++] = 0;
2946 repodata_add_idarray(Repodata *data, Id solvid, Id keyname, Id id)
2949 fprintf(stderr, "repodata_add_idarray %d %d (%d)\n", solvid, id, data->attriddatalen);
2951 repodata_add_array(data, solvid, keyname, REPOKEY_TYPE_IDARRAY, 1);
2952 data->attriddata[data->attriddatalen++] = id;
2953 data->attriddata[data->attriddatalen++] = 0;
2957 repodata_add_poolstr_array(Repodata *data, Id solvid, Id keyname,
2961 if (data->localpool)
2962 id = stringpool_str2id(&data->spool, str, 1);
2964 id = pool_str2id(data->repo->pool, str, 1);
2965 repodata_add_idarray(data, solvid, keyname, id);
2969 repodata_add_fixarray(Repodata *data, Id solvid, Id keyname, Id handle)
2971 repodata_add_array(data, solvid, keyname, REPOKEY_TYPE_FIXARRAY, 1);
2972 data->attriddata[data->attriddatalen++] = handle;
2973 data->attriddata[data->attriddatalen++] = 0;
2977 repodata_add_flexarray(Repodata *data, Id solvid, Id keyname, Id handle)
2979 repodata_add_array(data, solvid, keyname, REPOKEY_TYPE_FLEXARRAY, 1);
2980 data->attriddata[data->attriddatalen++] = handle;
2981 data->attriddata[data->attriddatalen++] = 0;
2985 repodata_set_kv(Repodata *data, Id solvid, Id keyname, Id keytype, KeyValue *kv)
2989 case REPOKEY_TYPE_ID:
2990 repodata_set_id(data, solvid, keyname, kv->id);
2992 case REPOKEY_TYPE_CONSTANTID:
2993 repodata_set_constantid(data, solvid, keyname, kv->id);
2995 case REPOKEY_TYPE_IDARRAY:
2996 repodata_add_idarray(data, solvid, keyname, kv->id);
2998 case REPOKEY_TYPE_STR:
2999 repodata_set_str(data, solvid, keyname, kv->str);
3001 case REPOKEY_TYPE_VOID:
3002 repodata_set_void(data, solvid, keyname);
3004 case REPOKEY_TYPE_NUM:
3005 repodata_set_num(data, solvid, keyname, SOLV_KV_NUM64(kv));
3007 case REPOKEY_TYPE_CONSTANT:
3008 repodata_set_constant(data, solvid, keyname, kv->num);
3010 case REPOKEY_TYPE_DIRNUMNUMARRAY:
3012 repodata_add_dirnumnum(data, solvid, keyname, kv->id, kv->num, kv->num2);
3014 case REPOKEY_TYPE_DIRSTRARRAY:
3015 repodata_add_dirstr(data, solvid, keyname, kv->id, kv->str);
3018 repodata_set_bin_checksum(data, solvid, keyname, keytype, (const unsigned char *)kv->str);
3026 repodata_unset_uninternalized(Repodata *data, Id solvid, Id keyname)
3029 app = repodata_get_attrp(data, solvid);
3035 *app = 0; /* delete all attributes */
3038 for (; *ap; ap += 2)
3039 if (data->keys[*ap].name == keyname)
3045 for (; *ap; ap += 2)
3047 if (data->keys[*ap].name == keyname)
3056 repodata_unset(Repodata *data, Id solvid, Id keyname)
3060 key.type = REPOKEY_TYPE_DELETED;
3062 key.storage = KEY_STORAGE_INCORE;
3063 repodata_set(data, solvid, &key, 0);
3066 /* add all (uninternalized) attrs from src to dest */
3068 repodata_merge_attrs(Repodata *data, Id dest, Id src)
3071 if (dest == src || !data->attrs || !(keyp = data->attrs[src - data->start]))
3073 for (; *keyp; keyp += 2)
3074 repodata_insert_keyid(data, dest, keyp[0], keyp[1], 0);
3077 /* add some (uninternalized) attrs from src to dest */
3079 repodata_merge_some_attrs(Repodata *data, Id dest, Id src, Map *keyidmap, int overwrite)
3082 if (dest == src || !data->attrs || !(keyp = data->attrs[src - data->start]))
3084 for (; *keyp; keyp += 2)
3085 if (!keyidmap || MAPTST(keyidmap, keyp[0]))
3086 repodata_insert_keyid(data, dest, keyp[0], keyp[1], overwrite);
3089 /* swap (uninternalized) attrs from src and dest */
3091 repodata_swap_attrs(Repodata *data, Id dest, Id src)
3094 if (!data->attrs || dest == src)
3096 if (dest < data->start || dest >= data->end)
3097 repodata_extend(data, dest);
3098 if (src < data->start || src >= data->end)
3099 repodata_extend(data, src);
3100 tmpattrs = data->attrs[dest - data->start];
3101 data->attrs[dest - data->start] = data->attrs[src - data->start];
3102 data->attrs[src - data->start] = tmpattrs;
3103 if (data->lasthandle == src || data->lasthandle == dest)
3104 data->lasthandle = 0;
3108 /**********************************************************************/
3110 /* TODO: unify with repo_write and repo_solv! */
3112 #define EXTDATA_BLOCK 1023
3120 data_addid(struct extdata *xd, Id sx)
3122 unsigned int x = (unsigned int)sx;
3125 xd->buf = solv_extend(xd->buf, xd->len, 5, 1, EXTDATA_BLOCK);
3126 dp = xd->buf + xd->len;
3131 *dp++ = (x >> 28) | 128;
3133 *dp++ = (x >> 21) | 128;
3134 *dp++ = (x >> 14) | 128;
3137 *dp++ = (x >> 7) | 128;
3139 xd->len = dp - xd->buf;
3143 data_addid64(struct extdata *xd, unsigned long long x)
3145 if (x >= 0x100000000)
3149 data_addid(xd, (Id)(x >> 35));
3150 xd->buf[xd->len - 1] |= 128;
3152 data_addid(xd, (Id)((unsigned int)x | 0x80000000));
3153 xd->buf[xd->len - 5] = (x >> 28) | 128;
3156 data_addid(xd, (Id)x);
3160 data_addideof(struct extdata *xd, Id sx, int eof)
3162 unsigned int x = (unsigned int)sx;
3165 xd->buf = solv_extend(xd->buf, xd->len, 5, 1, EXTDATA_BLOCK);
3166 dp = xd->buf + xd->len;
3171 *dp++ = (x >> 27) | 128;
3173 *dp++ = (x >> 20) | 128;
3174 *dp++ = (x >> 13) | 128;
3177 *dp++ = (x >> 6) | 128;
3178 *dp++ = eof ? (x & 63) : (x & 63) | 64;
3179 xd->len = dp - xd->buf;
3183 data_addblob(struct extdata *xd, unsigned char *blob, int len)
3185 xd->buf = solv_extend(xd->buf, xd->len, len, 1, EXTDATA_BLOCK);
3186 memcpy(xd->buf + xd->len, blob, len);
3190 /*********************************/
3192 /* this is to reduct memory usage when internalizing oversized repos */
3194 compact_attrdata(Repodata *data, int entry, int nentry)
3197 unsigned int attrdatastart = data->attrdatalen;
3198 unsigned int attriddatastart = data->attriddatalen;
3199 if (attrdatastart < 1024 * 1024 * 4 && attriddatastart < 1024 * 1024)
3201 for (i = entry; i < nentry; i++)
3203 Id v, *attrs = data->attrs[i];
3206 for (; *attrs; attrs += 2)
3208 switch (data->keys[*attrs].type)
3210 case REPOKEY_TYPE_STR:
3211 case REPOKEY_TYPE_BINARY:
3213 if ((unsigned int)attrs[1] < attrdatastart)
3214 attrdatastart = attrs[1];
3216 case REPOKEY_TYPE_DIRSTRARRAY:
3217 for (v = attrs[1]; data->attriddata[v] ; v += 2)
3218 if ((unsigned int)data->attriddata[v + 1] < attrdatastart)
3219 attrdatastart = data->attriddata[v + 1];
3221 case REPOKEY_TYPE_IDARRAY:
3222 case REPOKEY_TYPE_DIRNUMNUMARRAY:
3223 if ((unsigned int)attrs[1] < attriddatastart)
3224 attriddatastart = attrs[1];
3226 case REPOKEY_TYPE_FIXARRAY:
3227 case REPOKEY_TYPE_FLEXARRAY:
3235 printf("compact_attrdata %d %d\n", entry, nentry);
3236 printf("attrdatastart: %d\n", attrdatastart);
3237 printf("attriddatastart: %d\n", attriddatastart);
3239 if (attrdatastart < 1024 * 1024 * 4 && attriddatastart < 1024 * 1024)
3241 for (i = entry; i < nentry; i++)
3243 Id v, *attrs = data->attrs[i];
3246 for (; *attrs; attrs += 2)
3248 switch (data->keys[*attrs].type)
3250 case REPOKEY_TYPE_STR:
3251 case REPOKEY_TYPE_BINARY:
3253 attrs[1] -= attrdatastart;
3255 case REPOKEY_TYPE_DIRSTRARRAY:
3256 for (v = attrs[1]; data->attriddata[v] ; v += 2)
3257 data->attriddata[v + 1] -= attrdatastart;
3259 case REPOKEY_TYPE_IDARRAY:
3260 case REPOKEY_TYPE_DIRNUMNUMARRAY:
3261 attrs[1] -= attriddatastart;
3270 data->attrdatalen -= attrdatastart;
3271 memmove(data->attrdata, data->attrdata + attrdatastart, data->attrdatalen);
3272 data->attrdata = solv_extend_resize(data->attrdata, data->attrdatalen, 1, REPODATA_ATTRDATA_BLOCK);
3274 if (attriddatastart)
3276 data->attriddatalen -= attriddatastart;
3277 memmove(data->attriddata, data->attriddata + attriddatastart, data->attriddatalen * sizeof(Id));
3278 data->attriddata = solv_extend_resize(data->attriddata, data->attriddatalen, sizeof(Id), REPODATA_ATTRIDDATA_BLOCK);
3282 /* internalalize some key into incore/vincore data */
3285 repodata_serialize_key(Repodata *data, struct extdata *newincore,
3286 struct extdata *newvincore,
3288 Repokey *key, Id val)
3292 unsigned int oldvincorelen = 0;
3296 if (key->storage == KEY_STORAGE_VERTICAL_OFFSET)
3299 oldvincorelen = xd->len;
3303 case REPOKEY_TYPE_VOID:
3304 case REPOKEY_TYPE_CONSTANT:
3305 case REPOKEY_TYPE_CONSTANTID:
3306 case REPOKEY_TYPE_DELETED:
3308 case REPOKEY_TYPE_STR:
3309 data_addblob(xd, data->attrdata + val, strlen((char *)(data->attrdata + val)) + 1);
3311 case REPOKEY_TYPE_MD5:
3312 data_addblob(xd, data->attrdata + val, SIZEOF_MD5);
3314 case REPOKEY_TYPE_SHA1:
3315 data_addblob(xd, data->attrdata + val, SIZEOF_SHA1);
3317 case REPOKEY_TYPE_SHA224:
3318 data_addblob(xd, data->attrdata + val, SIZEOF_SHA224);
3320 case REPOKEY_TYPE_SHA256:
3321 data_addblob(xd, data->attrdata + val, SIZEOF_SHA256);
3323 case REPOKEY_TYPE_SHA384:
3324 data_addblob(xd, data->attrdata + val, SIZEOF_SHA384);
3326 case REPOKEY_TYPE_SHA512:
3327 data_addblob(xd, data->attrdata + val, SIZEOF_SHA512);
3329 case REPOKEY_TYPE_NUM:
3330 if (val & 0x80000000)
3332 data_addid64(xd, data->attrnum64data[val ^ 0x80000000]);
3336 case REPOKEY_TYPE_ID:
3337 case REPOKEY_TYPE_DIR:
3338 data_addid(xd, val);
3340 case REPOKEY_TYPE_BINARY:
3343 unsigned char *dp = data_read_id(data->attrdata + val, &len);
3344 dp += (unsigned int)len;
3345 data_addblob(xd, data->attrdata + val, dp - (data->attrdata + val));
3348 case REPOKEY_TYPE_IDARRAY:
3349 for (ida = data->attriddata + val; *ida; ida++)
3350 data_addideof(xd, ida[0], ida[1] ? 0 : 1);
3352 case REPOKEY_TYPE_DIRNUMNUMARRAY:
3353 for (ida = data->attriddata + val; *ida; ida += 3)
3355 data_addid(xd, ida[0]);
3356 data_addid(xd, ida[1]);
3357 data_addideof(xd, ida[2], ida[3] ? 0 : 1);
3360 case REPOKEY_TYPE_DIRSTRARRAY:
3361 for (ida = data->attriddata + val; *ida; ida += 2)
3363 data_addideof(xd, ida[0], ida[2] ? 0 : 1);
3364 data_addblob(xd, data->attrdata + ida[1], strlen((char *)(data->attrdata + ida[1])) + 1);
3367 case REPOKEY_TYPE_FIXARRAY:
3371 for (ida = data->attriddata + val; *ida; ida++)
3375 kp = data->xattrs[-*ida];
3377 continue; /* ignore empty elements */
3379 for (; *kp; kp += 2)
3383 schemaid = repodata_schema2id(data, schema, 1);
3384 else if (schemaid != repodata_schema2id(data, schema, 0))
3386 pool_debug(data->repo->pool, SOLV_ERROR, "repodata_serialize_key: fixarray substructs with different schemas\n");
3391 data_addid(xd, num);
3394 data_addid(xd, schemaid);
3395 for (ida = data->attriddata + val; *ida; ida++)
3397 Id *kp = data->xattrs[-*ida];
3400 for (; *kp; kp += 2)
3401 repodata_serialize_key(data, newincore, newvincore, schema, data->keys + *kp, kp[1]);
3405 case REPOKEY_TYPE_FLEXARRAY:
3408 for (ida = data->attriddata + val; *ida; ida++)
3410 data_addid(xd, num);
3411 for (ida = data->attriddata + val; *ida; ida++)
3413 Id *kp = data->xattrs[-*ida];
3416 data_addid(xd, 0); /* XXX */
3423 schemaid = repodata_schema2id(data, schema, 1);
3424 data_addid(xd, schemaid);
3425 kp = data->xattrs[-*ida];
3427 repodata_serialize_key(data, newincore, newvincore, schema, data->keys + *kp, kp[1]);
3432 pool_debug(data->repo->pool, SOLV_FATAL, "repodata_serialize_key: don't know how to handle type %d\n", key->type);
3435 if (key->storage == KEY_STORAGE_VERTICAL_OFFSET)
3437 /* put offset/len in incore */
3438 data_addid(newincore, data->lastverticaloffset + oldvincorelen);
3439 oldvincorelen = xd->len - oldvincorelen;
3440 data_addid(newincore, oldvincorelen);
3444 /* create a circular linked list of all keys that share
3445 * the same keyname */
3447 calculate_keylink(Repodata *data)
3451 Id maxkeyname = 0, *keytable = 0;
3452 link = solv_calloc(data->nkeys, sizeof(Id));
3453 if (data->nkeys <= 2)
3455 for (i = 1; i < data->nkeys; i++)
3457 Id n = data->keys[i].name;
3458 if (n >= maxkeyname)
3460 keytable = solv_realloc2(keytable, n + 128, sizeof(Id));
3461 memset(keytable + maxkeyname, 0, (n + 128 - maxkeyname) * sizeof(Id));
3462 maxkeyname = n + 128;
3472 /* remove links that just point to themselfs */
3473 for (i = 1; i < data->nkeys; i++)
3476 solv_free(keytable);
3481 repodata_internalize(Repodata *data)
3483 Repokey *key, solvkey;
3485 Id schemaid, keyid, *schema, *sp, oldschemaid, *keyp, *seen;
3486 Offset *oldincoreoffs = 0;
3488 unsigned char *dp, *ndp;
3490 struct extdata newincore;
3491 struct extdata newvincore;
3496 if (!data->attrs && !data->xattrs)
3500 printf("repodata_internalize %d\n", data->repodataid);
3501 printf(" attr data: %d K\n", data->attrdatalen / 1024);
3502 printf(" attrid data: %d K\n", data->attriddatalen / (1024 / 4));
3504 newvincore.buf = data->vincore;
3505 newvincore.len = data->vincorelen;
3507 /* find the solvables key, create if needed */
3508 memset(&solvkey, 0, sizeof(solvkey));
3509 solvkey.name = REPOSITORY_SOLVABLES;
3510 solvkey.type = REPOKEY_TYPE_FLEXARRAY;
3512 solvkey.storage = KEY_STORAGE_INCORE;
3513 solvkeyid = repodata_key2id(data, &solvkey, data->end != data->start ? 1 : 0);
3515 schema = solv_malloc2(data->nkeys, sizeof(Id));
3516 seen = solv_malloc2(data->nkeys, sizeof(Id));
3518 /* Merge the data already existing (in data->schemata, ->incoredata and
3519 friends) with the new attributes in data->attrs[]. */
3520 nentry = data->end - data->start;
3521 memset(&newincore, 0, sizeof(newincore));
3522 data_addid(&newincore, 0); /* start data at offset 1 */
3524 data->mainschema = 0;
3525 data->mainschemaoffsets = solv_free(data->mainschemaoffsets);
3527 keylink = calculate_keylink(data);
3528 /* join entry data */
3529 /* we start with the meta data, entry -1 */
3530 for (entry = -1; entry < nentry; entry++)
3533 dp = data->incoredata;
3536 dp += entry >= 0 ? data->incoreoffset[entry] : 1;
3537 dp = data_read_id(dp, &oldschemaid);
3539 memset(seen, 0, data->nkeys * sizeof(Id));
3541 fprintf(stderr, "oldschemaid %d\n", oldschemaid);
3542 fprintf(stderr, "schemata %d\n", data->schemata[oldschemaid]);
3543 fprintf(stderr, "schemadata %p\n", data->schemadata);
3546 /* seen: -1: old data, 0: skipped, >0: id + 1 */
3550 for (keyp = data->schemadata + data->schemata[oldschemaid]; *keyp; keyp++)
3554 /* oops, should not happen */
3558 seen[*keyp] = -1; /* use old marker */
3561 haveoldkl = 1; /* potential keylink conflict */
3564 /* strip solvables key */
3565 if (entry < 0 && solvkeyid && seen[solvkeyid])
3568 for (sp = keyp = schema; *sp; sp++)
3569 if (*sp != solvkeyid)
3572 seen[solvkeyid] = 0;
3576 /* add new entries */
3578 keyp = data->attrs ? data->attrs[entry] : 0;
3580 keyp = data->xattrs ? data->xattrs[1] : 0;
3582 for (; *keyp; keyp += 2)
3588 if (haveoldkl && keylink[*keyp]) /* this should be pretty rare */
3591 for (kl = keylink[*keyp]; kl != *keyp; kl = keylink[kl])
3594 /* replacing old key kl, remove from schema and seen */
3596 for (osp = schema; osp < sp; osp++)
3599 memmove(osp, osp + 1, (sp - osp) * sizeof(Id));
3607 seen[*keyp] = keyp[1] + 1;
3610 /* add solvables key if needed */
3611 if (entry < 0 && data->end != data->start)
3613 *sp++ = solvkeyid; /* always last in schema */
3620 /* Ideally we'd like to sort the new schema here, to ensure
3621 schema equality independend of the ordering. */
3622 schemaid = repodata_schema2id(data, schema, 1);
3624 schemaid = oldschemaid;
3628 data->mainschemaoffsets = solv_calloc(sp - schema, sizeof(Id));
3629 data->mainschema = schemaid;
3632 /* find offsets in old incore data */
3636 for (sp = data->schemadata + data->schemata[oldschemaid]; *sp; sp++)
3637 if (seen[*sp] == -1)
3638 lastneeded = sp + 1;
3642 oldincoreoffs = solv_malloc2(data->nkeys, 2 * sizeof(Offset));
3643 for (sp = data->schemadata + data->schemata[oldschemaid]; sp != lastneeded; sp++)
3645 /* Skip the data associated with this old key. */
3646 key = data->keys + *sp;
3648 if (key->storage == KEY_STORAGE_VERTICAL_OFFSET)
3650 ndp = data_skip(ndp, REPOKEY_TYPE_ID);
3651 ndp = data_skip(ndp, REPOKEY_TYPE_ID);
3653 else if (key->storage == KEY_STORAGE_INCORE)
3654 ndp = data_skip_key(data, ndp, key);
3655 oldincoreoffs[*sp * 2] = dp - data->incoredata;
3656 oldincoreoffs[*sp * 2 + 1] = ndp - dp;
3662 /* just copy over the complete old entry (including the schemaid) if there was no new data */
3663 if (entry >= 0 && !neednewschema && oldschemaid && (!data->attrs || !data->attrs[entry]) && dp)
3665 ndp = data->incoredata + data->incoreoffset[entry];
3666 data->incoreoffset[entry] = newincore.len;
3667 data_addblob(&newincore, ndp, dp - ndp);
3671 /* Now create data blob. We walk through the (possibly new) schema
3672 and either copy over old data, or insert the new. */
3674 data->incoreoffset[entry] = newincore.len;
3675 data_addid(&newincore, schemaid);
3677 /* we don't use a pointer to the schemadata here as repodata_serialize_key
3678 * may call repodata_schema2id() which might realloc our schemadata */
3679 for (schemaidx = data->schemata[schemaid]; (keyid = data->schemadata[schemaidx]) != 0; schemaidx++)
3683 data->mainschemaoffsets[schemaidx - data->schemata[schemaid]] = newincore.len;
3684 if (keyid == solvkeyid)
3686 /* add flexarray entry count */
3687 data_addid(&newincore, data->end - data->start);
3688 break; /* always the last entry */
3691 if (seen[keyid] == -1)
3693 if (oldincoreoffs[keyid * 2 + 1])
3694 data_addblob(&newincore, data->incoredata + oldincoreoffs[keyid * 2], oldincoreoffs[keyid * 2 + 1]);
3696 else if (seen[keyid])
3697 repodata_serialize_key(data, &newincore, &newvincore, schema, data->keys + keyid, seen[keyid] - 1);
3702 if (entry >= 0 && data->attrs)
3704 if (data->attrs[entry])
3705 data->attrs[entry] = solv_free(data->attrs[entry]);
3706 if (entry && entry % 4096 == 0 && data->nxattrs <= 2 && entry + 64 < nentry)
3708 compact_attrdata(data, entry + 1, nentry); /* try to free some memory */
3710 printf(" attr data: %d K\n", data->attrdatalen / 1024);
3711 printf(" attrid data: %d K\n", data->attriddatalen / (1024 / 4));
3712 printf(" incore data: %d K\n", newincore.len / 1024);
3713 printf(" sum: %d K\n", (newincore.len + data->attrdatalen + data->attriddatalen * 4) / 1024);
3714 /* malloc_stats(); */
3719 /* free all xattrs */
3720 for (entry = 0; entry < data->nxattrs; entry++)
3721 if (data->xattrs[entry])
3722 solv_free(data->xattrs[entry]);
3723 data->xattrs = solv_free(data->xattrs);
3726 data->lasthandle = 0;
3728 data->lastdatalen = 0;
3732 solv_free(oldincoreoffs);
3733 repodata_free_schemahash(data);
3735 solv_free(data->incoredata);
3736 data->incoredata = newincore.buf;
3737 data->incoredatalen = newincore.len;
3738 data->incoredatafree = 0;
3740 data->vincore = newvincore.buf;
3741 data->vincorelen = newvincore.len;
3743 data->attrs = solv_free(data->attrs);
3744 data->attrdata = solv_free(data->attrdata);
3745 data->attriddata = solv_free(data->attriddata);
3746 data->attrnum64data = solv_free(data->attrnum64data);
3747 data->attrdatalen = 0;
3748 data->attriddatalen = 0;
3749 data->attrnum64datalen = 0;
3751 printf("repodata_internalize %d done\n", data->repodataid);
3752 printf(" incore data: %d K\n", data->incoredatalen / 1024);
3757 repodata_disable_paging(Repodata *data)
3759 if (maybe_load_repodata(data, 0))
3761 repopagestore_disable_paging(&data->store);
3766 /* call the pool's loadcallback to load a stub repodata */
3768 repodata_stub_loader(Repodata *data)
3770 Repo *repo = data->repo;
3771 Pool *pool = repo->pool;
3773 struct s_Pool_tmpspace oldtmpspace;
3776 if (!pool->loadcallback)
3778 data->state = REPODATA_ERROR;
3781 data->state = REPODATA_LOADING;
3783 /* save tmp space and pos */
3784 oldtmpspace = pool->tmpspace;
3785 memset(&pool->tmpspace, 0, sizeof(pool->tmpspace));
3788 r = pool->loadcallback(pool, data, pool->loadcallbackdata);
3790 /* restore tmp space and pos */
3791 for (i = 0; i < POOL_TMPSPACEBUF; i++)
3792 solv_free(pool->tmpspace.buf[i]);
3793 pool->tmpspace = oldtmpspace;
3794 if (r && oldpos.repo == repo && oldpos.repodataid == data->repodataid)
3795 memset(&oldpos, 0, sizeof(oldpos));
3798 data->state = r ? REPODATA_AVAILABLE : REPODATA_ERROR;
3802 repodata_add_stubkey(Repodata *data, Id keyname, Id keytype)
3806 xkey.name = keyname;
3807 xkey.type = keytype;
3808 xkey.storage = KEY_STORAGE_INCORE;
3810 repodata_key2id(data, &xkey, 1);
3814 repodata_add_stub(Repodata **datap)
3816 Repodata *data = *datap;
3817 Repo *repo = data->repo;
3818 Id repodataid = data - repo->repodata;
3819 Repodata *sdata = repo_add_repodata(repo, 0);
3820 data = repo->repodata + repodataid;
3821 if (data->end > data->start)
3822 repodata_extend_block(sdata, data->start, data->end - data->start);
3823 sdata->state = REPODATA_STUB;
3824 sdata->loadcallback = repodata_stub_loader;
3830 repodata_create_stubs(Repodata *data)
3832 Repo *repo = data->repo;
3833 Pool *pool = repo->pool;
3840 dataiterator_init(&di, pool, repo, SOLVID_META, REPOSITORY_EXTERNAL, 0, 0);
3841 while (dataiterator_step(&di))
3842 if (di.data == data)
3844 dataiterator_free(&di);
3847 stubdataids = solv_calloc(cnt, sizeof(*stubdataids));
3848 for (i = 0; i < cnt; i++)
3850 sdata = repodata_add_stub(&data);
3851 stubdataids[i] = sdata - repo->repodata;
3854 dataiterator_init(&di, pool, repo, SOLVID_META, REPOSITORY_EXTERNAL, 0, 0);
3856 while (dataiterator_step(&di))
3858 if (di.data != data)
3860 if (di.key->name == REPOSITORY_EXTERNAL && !di.nparents)
3862 dataiterator_entersub(&di);
3863 sdata = repo->repodata + stubdataids[i++];
3867 repodata_set_kv(sdata, SOLVID_META, di.key->name, di.key->type, &di.kv);
3868 if (di.key->name == REPOSITORY_KEYS && di.key->type == REPOKEY_TYPE_IDARRAY)
3873 xkeyname = di.kv.id;
3877 repodata_add_stubkey(sdata, xkeyname, di.kv.id);
3878 if (xkeyname == SOLVABLE_FILELIST)
3879 repodata_set_filelisttype(sdata, REPODATA_FILELIST_EXTENSION);
3884 dataiterator_free(&di);
3885 for (i = 0; i < cnt; i++)
3886 repodata_internalize(repo->repodata + stubdataids[i]);
3887 solv_free(stubdataids);
3892 repodata_set_filelisttype(Repodata *data, int type)
3894 data->filelisttype = type;
3898 repodata_memused(Repodata *data)
3900 return data->incoredatalen + data->vincorelen;