2 * Copyright (c) 2007, Novell Inc.
4 * This program is licensed under the BSD license, read LICENSE.BSD
5 * for further information
11 * Manage data coming from one repository
13 * a repository can contain multiple repodata entries, consisting of
14 * different sets of keys and different sets of solvables
29 #include "poolid_private.h"
37 #define REPODATA_BLOCK 255
39 static unsigned char *data_skip_key(Repodata *data, unsigned char *dp, Repokey *key);
42 repodata_initdata(Repodata *data, Repo *repo, int localpool)
44 memset(data, 0, sizeof (*data));
45 data->repodataid = data - repo->repodata;
47 data->localpool = localpool;
49 stringpool_init_empty(&data->spool);
50 /* dirpool_init(&data->dirpool); just zeros out again */
51 data->keys = solv_calloc(1, sizeof(Repokey));
53 data->schemata = solv_calloc(1, sizeof(Id));
54 data->schemadata = solv_calloc(1, sizeof(Id));
56 data->schemadatalen = 1;
57 repopagestore_init(&data->store);
61 repodata_freedata(Repodata *data)
65 solv_free(data->keys);
67 solv_free(data->schemata);
68 solv_free(data->schemadata);
69 solv_free(data->schematahash);
71 stringpool_free(&data->spool);
72 dirpool_free(&data->dirpool);
74 solv_free(data->mainschemaoffsets);
75 solv_free(data->incoredata);
76 solv_free(data->incoreoffset);
77 solv_free(data->verticaloffset);
79 repopagestore_free(&data->store);
81 solv_free(data->vincore);
84 for (i = 0; i < data->end - data->start; i++)
85 solv_free(data->attrs[i]);
86 solv_free(data->attrs);
88 for (i = 0; i < data->nxattrs; i++)
89 solv_free(data->xattrs[i]);
90 solv_free(data->xattrs);
92 solv_free(data->attrdata);
93 solv_free(data->attriddata);
94 solv_free(data->attrnum64data);
96 solv_free(data->dircache);
100 repodata_free(Repodata *data)
102 Repo *repo = data->repo;
103 int i = data - repo->repodata;
106 repodata_freedata(data);
107 if (i < repo->nrepodata - 1)
109 /* whoa! this changes the repodataids! */
110 memmove(repo->repodata + i, repo->repodata + i + 1, (repo->nrepodata - 1 - i) * sizeof(Repodata));
111 for (; i < repo->nrepodata - 1; i++)
112 repo->repodata[i].repodataid = i;
115 if (repo->nrepodata == 1)
117 repo->repodata = solv_free(repo->repodata);
123 repodata_empty(Repodata *data, int localpool)
125 void (*loadcallback)(Repodata *) = data->loadcallback;
126 int state = data->state;
127 repodata_freedata(data);
128 repodata_initdata(data, data->repo, localpool);
130 data->loadcallback = loadcallback;
134 /***************************************************************
135 * key pool management
138 /* this is not so time critical that we need a hash, so we do a simple
141 repodata_key2id(Repodata *data, Repokey *key, int create)
145 for (keyid = 1; keyid < data->nkeys; keyid++)
146 if (data->keys[keyid].name == key->name && data->keys[keyid].type == key->type)
148 if ((key->type == REPOKEY_TYPE_CONSTANT || key->type == REPOKEY_TYPE_CONSTANTID) && key->size != data->keys[keyid].size)
152 if (keyid == data->nkeys)
156 /* allocate new key */
157 data->keys = solv_realloc2(data->keys, data->nkeys + 1, sizeof(Repokey));
158 data->keys[data->nkeys++] = *key;
159 if (data->verticaloffset)
161 data->verticaloffset = solv_realloc2(data->verticaloffset, data->nkeys, sizeof(Id));
162 data->verticaloffset[data->nkeys - 1] = 0;
164 data->keybits[(key->name >> 3) & (sizeof(data->keybits) - 1)] |= 1 << (key->name & 7);
170 /***************************************************************
171 * schema pool management
174 #define SCHEMATA_BLOCK 31
175 #define SCHEMATADATA_BLOCK 255
178 repodata_schema2id(Repodata *data, Id *schema, int create)
185 return 0; /* XXX: allow empty schema? */
186 if ((schematahash = data->schematahash) == 0)
188 data->schematahash = schematahash = solv_calloc(256, sizeof(Id));
189 for (i = 1; i < data->nschemata; i++)
191 for (sp = data->schemadata + data->schemata[i], h = 0; *sp;)
196 data->schemadata = solv_extend_resize(data->schemadata, data->schemadatalen, sizeof(Id), SCHEMATADATA_BLOCK);
197 data->schemata = solv_extend_resize(data->schemata, data->nschemata, sizeof(Id), SCHEMATA_BLOCK);
200 for (sp = schema, len = 0, h = 0; *sp; len++)
205 cid = schematahash[h];
208 if (!memcmp(data->schemadata + data->schemata[cid], schema, len * sizeof(Id)))
210 /* cache conflict, do a slow search */
211 for (cid = 1; cid < data->nschemata; cid++)
212 if (!memcmp(data->schemadata + data->schemata[cid], schema, len * sizeof(Id)))
218 data->schemadata = solv_extend(data->schemadata, data->schemadatalen, len, sizeof(Id), SCHEMATADATA_BLOCK);
219 data->schemata = solv_extend(data->schemata, data->nschemata, 1, sizeof(Id), SCHEMATA_BLOCK);
221 memcpy(data->schemadata + data->schemadatalen, schema, len * sizeof(Id));
222 data->schemata[data->nschemata] = data->schemadatalen;
223 data->schemadatalen += len;
224 schematahash[h] = data->nschemata;
226 fprintf(stderr, "schema2id: new schema\n");
228 return data->nschemata++;
232 repodata_free_schemahash(Repodata *data)
234 data->schematahash = solv_free(data->schematahash);
236 data->schemata = solv_realloc2(data->schemata, data->nschemata, sizeof(Id));
237 data->schemadata = solv_realloc2(data->schemadata, data->schemadatalen, sizeof(Id));
241 /***************************************************************
242 * dir pool management
245 #ifndef HAVE_STRCHRNUL
246 static inline const char *strchrnul(const char *str, char x)
248 const char *p = strchr(str, x);
249 return p ? p : str + strlen(str);
253 #define DIRCACHE_SIZE 41 /* < 1k */
257 Id ids[DIRCACHE_SIZE];
258 char str[(DIRCACHE_SIZE * (DIRCACHE_SIZE - 1)) / 2];
263 repodata_str2dir(Repodata *data, const char *dir, int create)
274 while (*dir == '/' && dir[1] == '/')
276 if (*dir == '/' && !dir[1])
278 if (data->dirpool.ndirs)
280 return dirpool_add_dir(&data->dirpool, 0, 1, create);
287 struct dircache *dircache = data->dircache;
291 if (l < DIRCACHE_SIZE && dircache->ids[l] && !memcmp(dircache->str + l * (l - 1) / 2, dir, l))
293 parent = dircache->ids[l];
309 dire = strchrnul(dir, '/');
311 id = stringpool_strn2id(&data->spool, dir, dire - dir, create);
313 id = pool_strn2id(data->repo->pool, dir, dire - dir, create);
316 parent = dirpool_add_dir(&data->dirpool, parent, id, create);
321 data->dircache = solv_calloc(1, sizeof(struct dircache));
325 if (l < DIRCACHE_SIZE)
327 data->dircache->ids[l] = parent;
328 memcpy(data->dircache->str + l * (l - 1) / 2, dirs, l);
342 repodata_free_dircache(Repodata *data)
344 data->dircache = solv_free(data->dircache);
348 repodata_dir2str(Repodata *data, Id did, const char *suf)
350 Pool *pool = data->repo->pool;
357 return suf ? suf : "";
361 comp = dirpool_compid(&data->dirpool, parent);
362 comps = stringpool_id2str(data->localpool ? &data->spool : &pool->ss, comp);
364 parent = dirpool_parent(&data->dirpool, parent);
369 l += strlen(suf) + 1;
370 p = pool_alloctmpspace(pool, l + 1) + l;
381 comp = dirpool_compid(&data->dirpool, parent);
382 comps = stringpool_id2str(data->localpool ? &data->spool : &pool->ss, comp);
385 strncpy(p, comps, l);
386 parent = dirpool_parent(&data->dirpool, parent);
394 /***************************************************************
398 static inline unsigned char *
399 data_skip_schema(Repodata *data, unsigned char *dp, Id schema)
401 Id *keyp = data->schemadata + data->schemata[schema];
402 for (; *keyp; keyp++)
403 dp = data_skip_key(data, dp, data->keys + *keyp);
407 static unsigned char *
408 data_skip_key(Repodata *data, unsigned char *dp, Repokey *key)
410 int nentries, schema;
413 case REPOKEY_TYPE_FIXARRAY:
414 dp = data_read_id(dp, &nentries);
417 dp = data_read_id(dp, &schema);
419 dp = data_skip_schema(data, dp, schema);
421 case REPOKEY_TYPE_FLEXARRAY:
422 dp = data_read_id(dp, &nentries);
425 dp = data_read_id(dp, &schema);
426 dp = data_skip_schema(data, dp, schema);
430 if (key->storage == KEY_STORAGE_INCORE)
431 dp = data_skip(dp, key->type);
432 else if (key->storage == KEY_STORAGE_VERTICAL_OFFSET)
434 dp = data_skip(dp, REPOKEY_TYPE_ID);
435 dp = data_skip(dp, REPOKEY_TYPE_ID);
441 static unsigned char *
442 forward_to_key(Repodata *data, Id keyid, Id *keyp, unsigned char *dp)
448 if (data->mainschemaoffsets && dp == data->incoredata + data->mainschemaoffsets[0] && keyp == data->schemadata + data->schemata[data->mainschema])
451 for (i = 0; (k = *keyp++) != 0; i++)
453 return data->incoredata + data->mainschemaoffsets[i];
456 while ((k = *keyp++) != 0)
460 if (data->keys[k].storage == KEY_STORAGE_VERTICAL_OFFSET)
462 dp = data_skip(dp, REPOKEY_TYPE_ID); /* skip offset */
463 dp = data_skip(dp, REPOKEY_TYPE_ID); /* skip length */
466 if (data->keys[k].storage != KEY_STORAGE_INCORE)
468 dp = data_skip_key(data, dp, data->keys + k);
473 static unsigned char *
474 get_vertical_data(Repodata *data, Repokey *key, Id off, Id len)
479 if (off >= data->lastverticaloffset)
481 off -= data->lastverticaloffset;
482 if ((unsigned int)off + len > data->vincorelen)
484 return data->vincore + off;
486 if ((unsigned int)off + len > key->size)
488 /* we now have the offset, go into vertical */
489 off += data->verticaloffset[key - data->keys];
490 /* fprintf(stderr, "key %d page %d\n", key->name, off / REPOPAGE_BLOBSIZE); */
491 dp = repopagestore_load_page_range(&data->store, off / REPOPAGE_BLOBSIZE, (off + len - 1) / REPOPAGE_BLOBSIZE);
494 dp += off % REPOPAGE_BLOBSIZE;
498 static inline unsigned char *
499 get_data(Repodata *data, Repokey *key, unsigned char **dpp, int advance)
501 unsigned char *dp = *dpp;
505 if (key->storage == KEY_STORAGE_INCORE)
508 *dpp = data_skip_key(data, dp, key);
511 else if (key->storage == KEY_STORAGE_VERTICAL_OFFSET)
514 dp = data_read_id(dp, &off);
515 dp = data_read_id(dp, &len);
518 return get_vertical_data(data, key, off, len);
524 load_repodata(Repodata *data)
526 if (data->loadcallback)
528 data->loadcallback(data);
529 if (data->state == REPODATA_AVAILABLE)
532 data->state = REPODATA_ERROR;
537 maybe_load_repodata(Repodata *data, Id keyname)
539 if (keyname && !repodata_precheck_keyname(data, keyname))
540 return 0; /* do not bother... */
547 for (i = 1; i < data->nkeys; i++)
548 if (keyname == data->keys[i].name)
550 if (i == data->nkeys)
553 return load_repodata(data);
556 case REPODATA_AVAILABLE:
557 case REPODATA_LOADING:
560 data->state = REPODATA_ERROR;
565 static inline unsigned char *
566 solvid2data(Repodata *data, Id solvid, Id *schemap)
568 unsigned char *dp = data->incoredata;
571 if (solvid == SOLVID_META)
572 dp += 1; /* offset of "meta" solvable */
573 else if (solvid == SOLVID_POS)
575 Pool *pool = data->repo->pool;
576 if (data->repo != pool->pos.repo)
578 if (data != data->repo->repodata + pool->pos.repodataid)
581 if (pool->pos.dp != 1)
583 *schemap = pool->pos.schema;
589 if (solvid < data->start || solvid >= data->end)
591 dp += data->incoreoffset[solvid - data->start];
593 return data_read_id(dp, schemap);
596 /************************************************************************
600 static unsigned char *
601 find_key_data(Repodata *data, Id solvid, Id keyname, Repokey **keypp)
604 Id schema, *keyp, *kp;
607 if (!maybe_load_repodata(data, keyname))
609 dp = solvid2data(data, solvid, &schema);
612 keyp = data->schemadata + data->schemata[schema];
613 for (kp = keyp; *kp; kp++)
614 if (data->keys[*kp].name == keyname)
618 *keypp = key = data->keys + *kp;
619 if (key->type == REPOKEY_TYPE_DELETED)
621 if (key->type == REPOKEY_TYPE_VOID || key->type == REPOKEY_TYPE_CONSTANT || key->type == REPOKEY_TYPE_CONSTANTID)
622 return dp; /* no need to forward... */
623 if (key->storage != KEY_STORAGE_INCORE && key->storage != KEY_STORAGE_VERTICAL_OFFSET)
624 return 0; /* get_data will not work, no need to forward */
625 dp = forward_to_key(data, *kp, keyp, dp);
628 return get_data(data, key, &dp, 0);
632 repodata_lookup_type(Repodata *data, Id solvid, Id keyname)
634 Id schema, *keyp, *kp;
635 if (!maybe_load_repodata(data, keyname))
637 if (!solvid2data(data, solvid, &schema))
639 keyp = data->schemadata + data->schemata[schema];
640 for (kp = keyp; *kp; kp++)
641 if (data->keys[*kp].name == keyname)
642 return data->keys[*kp].type;
647 repodata_lookup_id(Repodata *data, Id solvid, Id keyname)
653 dp = find_key_data(data, solvid, keyname, &key);
656 if (key->type == REPOKEY_TYPE_CONSTANTID)
658 if (key->type != REPOKEY_TYPE_ID)
660 dp = data_read_id(dp, &id);
665 repodata_lookup_str(Repodata *data, Id solvid, Id keyname)
671 dp = find_key_data(data, solvid, keyname, &key);
674 if (key->type == REPOKEY_TYPE_STR)
675 return (const char *)dp;
676 if (key->type == REPOKEY_TYPE_CONSTANTID)
678 else if (key->type == REPOKEY_TYPE_ID)
679 dp = data_read_id(dp, &id);
683 return stringpool_id2str(&data->spool, id);
684 return pool_id2str(data->repo->pool, id);
688 repodata_lookup_num(Repodata *data, Id solvid, Id keyname, unsigned long long *value)
692 unsigned int high, low;
695 dp = find_key_data(data, solvid, keyname, &key);
700 case REPOKEY_TYPE_NUM:
701 data_read_num64(dp, &low, &high);
702 *value = (unsigned long long)high << 32 | low;
704 case REPOKEY_TYPE_U32:
705 data_read_u32(dp, &low);
708 case REPOKEY_TYPE_CONSTANT:
717 repodata_lookup_void(Repodata *data, Id solvid, Id keyname)
723 if (!maybe_load_repodata(data, keyname))
725 dp = solvid2data(data, solvid, &schema);
728 /* can't use find_key_data as we need to test the type */
729 for (keyp = data->schemadata + data->schemata[schema]; *keyp; keyp++)
730 if (data->keys[*keyp].name == keyname && data->keys[*keyp].type == REPOKEY_TYPE_VOID)
735 const unsigned char *
736 repodata_lookup_bin_checksum(Repodata *data, Id solvid, Id keyname, Id *typep)
741 dp = find_key_data(data, solvid, keyname, &key);
756 repodata_lookup_idarray(Repodata *data, Id solvid, Id keyname, Queue *q)
764 dp = find_key_data(data, solvid, keyname, &key);
767 if (key->type != REPOKEY_TYPE_IDARRAY)
771 dp = data_read_ideof(dp, &id, &eof);
780 repodata_lookup_binary(Repodata *data, Id solvid, Id keyname, int *lenp)
786 dp = find_key_data(data, solvid, keyname, &key);
787 if (!dp || key->type != REPOKEY_TYPE_BINARY)
792 dp = data_read_id(dp, &len);
798 repodata_globalize_id(Repodata *data, Id id, int create)
800 if (!id || !data || !data->localpool)
802 return pool_str2id(data->repo->pool, stringpool_id2str(&data->spool, id), create);
806 repodata_localize_id(Repodata *data, Id id, int create)
808 if (!id || !data || !data->localpool)
810 return stringpool_str2id(&data->spool, pool_id2str(data->repo->pool, id), create);
814 repodata_translate_id(Repodata *data, Repodata *fromdata, Id id, int create)
816 if (!id || !data || !fromdata)
818 if (!data->localpool || !fromdata->localpool)
820 if (fromdata->localpool)
821 id = repodata_globalize_id(fromdata, id, create);
823 id = repodata_localize_id(data, id, create);
826 /* localpool is set in both data and fromdata */
827 return stringpool_str2id(&data->spool, stringpool_id2str(&fromdata->spool, id), create);
831 repodata_lookup_id_uninternalized(Repodata *data, Id solvid, Id keyname, Id voidid)
836 ap = data->attrs[solvid - data->start];
841 if (data->keys[*ap].name != keyname)
843 if (data->keys[*ap].type == REPOKEY_TYPE_VOID)
845 if (data->keys[*ap].type == REPOKEY_TYPE_ID)
853 repodata_lookup_dirstrarray_uninternalized(Repodata *data, Id solvid, Id keyname, Id *didp, Id *iterp)
857 if (iter == 0) /* find key data */
861 ap = data->attrs[solvid - data->start];
865 if (data->keys[*ap].name == keyname && data->keys[*ap].type == REPOKEY_TYPE_DIRSTRARRAY)
872 for (ap = data->attriddata + iter; *ap; ap += 2)
874 if (did && ap[0] != did)
877 *iterp = ap - data->attriddata + 2;
878 return (const char *)data->attrdata + ap[1];
884 /************************************************************************
890 repodata_stringify(Pool *pool, Repodata *data, Repokey *key, KeyValue *kv, int flags)
894 case REPOKEY_TYPE_ID:
895 case REPOKEY_TYPE_CONSTANTID:
896 case REPOKEY_TYPE_IDARRAY:
897 if (data && data->localpool)
898 kv->str = stringpool_id2str(&data->spool, kv->id);
900 kv->str = pool_id2str(pool, kv->id);
901 if ((flags & SEARCH_SKIP_KIND) != 0 && key->storage == KEY_STORAGE_SOLVABLE)
904 for (s = kv->str; *s >= 'a' && *s <= 'z'; s++)
906 if (*s == ':' && s > kv->str)
910 case REPOKEY_TYPE_STR:
912 case REPOKEY_TYPE_DIRSTRARRAY:
913 if (!(flags & SEARCH_FILES))
914 return kv->str; /* match just the basename */
916 return kv->str; /* already stringified */
917 /* Put the full filename into kv->str. */
918 kv->str = repodata_dir2str(data, kv->id, kv->str);
919 kv->num = 1; /* mark stringification */
922 if (!(flags & SEARCH_CHECKSUMS))
923 return 0; /* skip em */
925 return kv->str; /* already stringified */
926 kv->str = repodata_chk2str(data, key->type, (const unsigned char *)kv->str);
927 kv->num = 1; /* mark stringification */
935 struct subschema_data {
941 /* search a specific repodata */
943 repodata_search(Repodata *data, Id solvid, Id keyname, int flags, int (*callback)(void *cbdata, Solvable *s, Repodata *data, Repokey *key, KeyValue *kv), void *cbdata)
947 Id keyid, *kp, *keyp;
948 unsigned char *dp, *ddp;
954 if (!maybe_load_repodata(data, keyname))
956 if (solvid == SOLVID_SUBSCHEMA)
958 struct subschema_data *subd = cbdata;
959 cbdata = subd->cbdata;
961 schema = subd->parent->id;
962 dp = (unsigned char *)subd->parent->str;
963 kv.parent = subd->parent;
968 dp = solvid2data(data, solvid, &schema);
971 s = data->repo->pool->solvables + solvid;
974 keyp = data->schemadata + data->schemata[schema];
977 /* search for a specific key */
978 for (kp = keyp; *kp; kp++)
979 if (data->keys[*kp].name == keyname)
983 dp = forward_to_key(data, *kp, keyp, dp);
989 while ((keyid = *keyp++) != 0)
992 key = data->keys + keyid;
993 ddp = get_data(data, key, &dp, *keyp ? 1 : 0);
995 if (key->type == REPOKEY_TYPE_DELETED)
997 if (key->type == REPOKEY_TYPE_FLEXARRAY || key->type == REPOKEY_TYPE_FIXARRAY)
999 struct subschema_data subd;
1003 subd.cbdata = cbdata;
1006 ddp = data_read_id(ddp, &nentries);
1010 while (ddp && nentries > 0)
1014 if (key->type == REPOKEY_TYPE_FLEXARRAY || !kv.entry)
1015 ddp = data_read_id(ddp, &schema);
1017 kv.str = (char *)ddp;
1018 stop = callback(cbdata, s, data, key, &kv);
1019 if (stop > SEARCH_NEXT_KEY)
1021 if (stop && stop != SEARCH_ENTERSUB)
1023 if ((flags & SEARCH_SUB) != 0 || stop == SEARCH_ENTERSUB)
1024 repodata_search(data, SOLVID_SUBSCHEMA, 0, flags, callback, &subd);
1025 ddp = data_skip_schema(data, ddp, schema);
1028 if (!nentries && (flags & SEARCH_ARRAYSENTINEL) != 0)
1032 kv.str = (char *)ddp;
1033 stop = callback(cbdata, s, data, key, &kv);
1034 if (stop > SEARCH_NEXT_KEY)
1044 ddp = data_fetch(ddp, &kv, key);
1047 stop = callback(cbdata, s, data, key, &kv);
1050 while (!kv.eof && !stop);
1051 if (onekey || stop > SEARCH_NEXT_KEY)
1057 repodata_setpos_kv(Repodata *data, KeyValue *kv)
1059 Pool *pool = data->repo->pool;
1061 pool_clear_pos(pool);
1064 pool->pos.repo = data->repo;
1065 pool->pos.repodataid = data - data->repo->repodata;
1066 pool->pos.dp = (unsigned char *)kv->str - data->incoredata;
1067 pool->pos.schema = kv->id;
1071 /************************************************************************
1072 * data iterator functions
1076 solvabledata_fetch(Solvable *s, KeyValue *kv, Id keyname)
1090 case SOLVABLE_VENDOR:
1093 case SOLVABLE_PROVIDES:
1095 return s->provides ? s->repo->idarraydata + s->provides : 0;
1096 case SOLVABLE_OBSOLETES:
1098 return s->obsoletes ? s->repo->idarraydata + s->obsoletes : 0;
1099 case SOLVABLE_CONFLICTS:
1101 return s->conflicts ? s->repo->idarraydata + s->conflicts : 0;
1102 case SOLVABLE_REQUIRES:
1104 return s->requires ? s->repo->idarraydata + s->requires : 0;
1105 case SOLVABLE_RECOMMENDS:
1107 return s->recommends ? s->repo->idarraydata + s->recommends : 0;
1108 case SOLVABLE_SUPPLEMENTS:
1110 return s->supplements ? s->repo->idarraydata + s->supplements : 0;
1111 case SOLVABLE_SUGGESTS:
1113 return s->suggests ? s->repo->idarraydata + s->suggests : 0;
1114 case SOLVABLE_ENHANCES:
1116 return s->enhances ? s->repo->idarraydata + s->enhances : 0;
1119 return s->repo->rpmdbid ? s->repo->rpmdbid + (s - s->repo->pool->solvables - s->repo->start) : 0;
1126 datamatcher_init(Datamatcher *ma, const char *match, int flags)
1128 match = match ? solv_strdup(match) : 0;
1133 if ((flags & SEARCH_STRINGMASK) == SEARCH_REGEX)
1135 ma->matchdata = solv_calloc(1, sizeof(regex_t));
1136 ma->error = regcomp((regex_t *)ma->matchdata, match, REG_EXTENDED | REG_NOSUB | REG_NEWLINE | ((flags & SEARCH_NOCASE) ? REG_ICASE : 0));
1139 solv_free(ma->matchdata);
1140 ma->flags = (flags & ~SEARCH_STRINGMASK) | SEARCH_ERROR;
1143 if ((flags & SEARCH_FILES) != 0 && match)
1145 /* prepare basename check */
1146 if ((flags & SEARCH_STRINGMASK) == SEARCH_STRING || (flags & SEARCH_STRINGMASK) == SEARCH_STRINGEND)
1148 const char *p = strrchr(match, '/');
1149 ma->matchdata = (void *)(p ? p + 1 : match);
1151 else if ((flags & SEARCH_STRINGMASK) == SEARCH_GLOB)
1154 for (p = match + strlen(match) - 1; p >= match; p--)
1155 if (*p == '[' || *p == ']' || *p == '*' || *p == '?' || *p == '/')
1157 ma->matchdata = (void *)(p + 1);
1164 datamatcher_free(Datamatcher *ma)
1167 ma->match = solv_free((char *)ma->match);
1168 if ((ma->flags & SEARCH_STRINGMASK) == SEARCH_REGEX && ma->matchdata)
1170 regfree(ma->matchdata);
1171 solv_free(ma->matchdata);
1177 datamatcher_match(Datamatcher *ma, const char *str)
1180 switch ((ma->flags & SEARCH_STRINGMASK))
1182 case SEARCH_SUBSTRING:
1183 if (ma->flags & SEARCH_NOCASE)
1184 return strcasestr(str, ma->match) != 0;
1186 return strstr(str, ma->match) != 0;
1188 if (ma->flags & SEARCH_NOCASE)
1189 return !strcasecmp(ma->match, str);
1191 return !strcmp(ma->match, str);
1192 case SEARCH_STRINGSTART:
1193 if (ma->flags & SEARCH_NOCASE)
1194 return !strncasecmp(ma->match, str, strlen(ma->match));
1196 return !strncmp(ma->match, str, strlen(ma->match));
1197 case SEARCH_STRINGEND:
1198 l = strlen(str) - strlen(ma->match);
1201 if (ma->flags & SEARCH_NOCASE)
1202 return !strcasecmp(ma->match, str + l);
1204 return !strcmp(ma->match, str + l);
1206 return !fnmatch(ma->match, str, (ma->flags & SEARCH_NOCASE) ? FNM_CASEFOLD : 0);
1208 return !regexec((const regex_t *)ma->matchdata, str, 0, NULL, 0);
1214 /* check if the matcher can match the provides basename */
1217 datamatcher_checkbasename(Datamatcher *ma, const char *basename)
1220 const char *match = ma->matchdata;
1223 switch (ma->flags & SEARCH_STRINGMASK)
1227 case SEARCH_STRINGEND:
1228 if (match != ma->match)
1229 break; /* had slash, do exact match on basename */
1232 /* check if the basename ends with match */
1233 l = strlen(basename) - strlen(match);
1239 return 1; /* maybe matches */
1241 if ((ma->flags & SEARCH_NOCASE) != 0)
1242 return !strcasecmp(match, basename);
1244 return !strcmp(match, basename);
1248 repodata_filelistfilter_matches(Repodata *data, const char *str)
1250 /* '.*bin\/.*', '^\/etc\/.*', '^\/usr\/lib\/sendmail$' */
1251 /* for now hardcoded */
1252 if (strstr(str, "bin/"))
1254 if (!strncmp(str, "/etc/", 5))
1256 if (!strcmp(str, "/usr/lib/sendmail"))
1278 di_nextarrayelement,
1284 di_entersolvablekey,
1288 /* see dataiterator.h for documentation */
1290 dataiterator_init(Dataiterator *di, Pool *pool, Repo *repo, Id p, Id keyname, const char *match, int flags)
1292 memset(di, 0, sizeof(*di));
1294 di->flags = flags & ~SEARCH_THISSOLVID;
1295 if (!pool || (repo && repo->pool != pool))
1303 if ((error = datamatcher_init(&di->matcher, match, flags)) != 0)
1309 di->keyname = keyname;
1310 di->keynames[0] = keyname;
1311 dataiterator_set_search(di, repo, p);
1316 dataiterator_init_clone(Dataiterator *di, Dataiterator *from)
1321 if (di->dupstr == di->kv.str)
1322 di->dupstr = solv_memdup(di->dupstr, di->dupstrn);
1329 memset(&di->matcher, 0, sizeof(di->matcher));
1330 if (from->matcher.match)
1331 datamatcher_init(&di->matcher, from->matcher.match, from->matcher.flags);
1336 for (i = 1; i < di->nparents; i++)
1337 di->parents[i].kv.parent = &di->parents[i - 1].kv;
1338 di->kv.parent = &di->parents[di->nparents - 1].kv;
1343 dataiterator_set_match(Dataiterator *di, const char *match, int flags)
1345 di->flags = (flags & ~SEARCH_THISSOLVID) | (di->flags & SEARCH_THISSOLVID);
1346 datamatcher_free(&di->matcher);
1347 memset(&di->matcher, 0, sizeof(di->matcher));
1351 if ((error = datamatcher_init(&di->matcher, match, flags)) != 0)
1361 dataiterator_set_search(Dataiterator *di, Repo *repo, Id p)
1365 di->flags &= ~SEARCH_THISSOLVID;
1369 if (!di->pool->urepos)
1377 di->repo = di->pool->repos[di->repoid];
1379 di->state = di_enterrepo;
1381 dataiterator_jump_to_solvid(di, p);
1385 dataiterator_set_keyname(Dataiterator *di, Id keyname)
1388 di->keyname = keyname;
1389 di->keynames[0] = keyname;
1393 dataiterator_prepend_keyname(Dataiterator *di, Id keyname)
1397 if (di->nkeynames >= sizeof(di->keynames)/sizeof(*di->keynames) - 2)
1399 di->state = di_bye; /* sorry */
1402 for (i = di->nkeynames + 1; i > 0; i--)
1403 di->keynames[i] = di->keynames[i - 1];
1404 di->keynames[0] = di->keyname = keyname;
1409 dataiterator_free(Dataiterator *di)
1411 if (di->matcher.match)
1412 datamatcher_free(&di->matcher);
1414 solv_free(di->dupstr);
1417 static unsigned char *
1418 dataiterator_find_keyname(Dataiterator *di, Id keyname)
1421 Repokey *keys = di->data->keys, *key;
1424 for (keyp = di->keyp; *keyp; keyp++)
1425 if (keys[*keyp].name == keyname)
1430 if (key->type == REPOKEY_TYPE_DELETED)
1432 if (key->storage != KEY_STORAGE_INCORE && key->storage != KEY_STORAGE_VERTICAL_OFFSET)
1433 return 0; /* get_data will not work, no need to forward */
1434 dp = forward_to_key(di->data, *keyp, di->keyp, di->dp);
1442 is_filelist_extension(Repodata *data)
1445 if (!repodata_precheck_keyname(data, SOLVABLE_FILELIST))
1447 for (j = 1; j < data->nkeys; j++)
1448 if (data->keys[j].name == SOLVABLE_FILELIST)
1450 if (j == data->nkeys)
1452 if (data->state != REPODATA_AVAILABLE)
1454 for (j = 1; j < data->nkeys; j++)
1455 if (data->keys[j].name != REPOSITORY_SOLVABLES && data->keys[j].name != SOLVABLE_FILELIST)
1461 dataiterator_filelistcheck(Dataiterator *di)
1464 int needcomplete = 0;
1465 Repodata *data = di->data;
1467 if ((di->flags & SEARCH_COMPLETE_FILELIST) != 0)
1468 if (!di->matcher.match
1469 || ((di->matcher.flags & (SEARCH_STRINGMASK|SEARCH_NOCASE)) != SEARCH_STRING
1470 && (di->matcher.flags & (SEARCH_STRINGMASK|SEARCH_NOCASE)) != SEARCH_GLOB)
1471 || !repodata_filelistfilter_matches(data, di->matcher.match))
1473 if (data->state != REPODATA_AVAILABLE)
1474 return needcomplete ? 1 : 0;
1477 /* we don't need the complete filelist, so ignore all stubs */
1478 if (data->repo->nrepodata == 2)
1480 for (j = 1; j < data->nkeys; j++)
1481 if (data->keys[j].name != REPOSITORY_SOLVABLES && data->keys[j].name != SOLVABLE_FILELIST)
1487 /* we need the complete filelist. check if we habe a filtered filelist and there's
1488 * a extension with the complete filelist later on */
1489 for (j = 1; j < data->nkeys; j++)
1490 if (data->keys[j].name == SOLVABLE_FILELIST)
1492 if (j == data->nkeys)
1493 return 0; /* does not have filelist */
1494 for (j = 1; j < data->nkeys; j++)
1495 if (data->keys[j].name != REPOSITORY_SOLVABLES && data->keys[j].name != SOLVABLE_FILELIST)
1497 if (j == data->nkeys)
1498 return 1; /* this is the externsion */
1499 while (data - data->repo->repodata + 1 < data->repo->nrepodata)
1502 if (is_filelist_extension(data))
1510 dataiterator_step(Dataiterator *di)
1514 if (di->state == di_nextattr && di->key->storage == KEY_STORAGE_VERTICAL_OFFSET && di->vert_ddp && di->vert_storestate != di->data->storestate) {
1515 unsigned int ddpoff = di->ddp - di->vert_ddp;
1516 di->vert_off += ddpoff;
1517 di->vert_len -= ddpoff;
1518 di->ddp = di->vert_ddp = get_vertical_data(di->data, di->key, di->vert_off, di->vert_len);
1519 di->vert_storestate = di->data->storestate;
1521 di->state = di_nextkey;
1527 case di_enterrepo: di_enterrepo:
1528 if (!di->repo || (di->repo->disabled && !(di->flags & SEARCH_DISABLED_REPOS)))
1530 if (!(di->flags & SEARCH_THISSOLVID))
1532 di->solvid = di->repo->start - 1; /* reset solvid iterator */
1533 goto di_nextsolvable;
1537 case di_entersolvable: di_entersolvable:
1540 di->repodataid = 1; /* reset repodata iterator */
1541 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)
1543 extern Repokey repo_solvablekeys[RPM_RPMDBID - SOLVABLE_NAME + 1];
1545 di->key = repo_solvablekeys + (di->keyname ? di->keyname - SOLVABLE_NAME : 0);
1547 goto di_entersolvablekey;
1552 case di_enterrepodata: di_enterrepodata:
1555 if (di->repodataid >= di->repo->nrepodata)
1556 goto di_nextsolvable;
1557 di->data = di->repo->repodata + di->repodataid;
1559 if (di->repodataid && di->keyname == SOLVABLE_FILELIST && !dataiterator_filelistcheck(di))
1560 goto di_nextrepodata;
1561 if (!maybe_load_repodata(di->data, di->keyname))
1562 goto di_nextrepodata;
1563 di->dp = solvid2data(di->data, di->solvid, &schema);
1565 goto di_nextrepodata;
1566 if (di->solvid == SOLVID_POS)
1567 di->solvid = di->pool->pos.solvid;
1568 /* reset key iterator */
1569 di->keyp = di->data->schemadata + di->data->schemata[schema];
1572 case di_enterschema: di_enterschema:
1574 di->dp = dataiterator_find_keyname(di, di->keyname);
1575 if (!di->dp || !*di->keyp)
1579 goto di_nextrepodata;
1583 case di_enterkey: di_enterkey:
1585 di->key = di->data->keys + *di->keyp;
1588 /* this is get_data() modified to store vert_ data */
1589 if (di->key->storage == KEY_STORAGE_VERTICAL_OFFSET)
1592 di->dp = data_read_id(di->dp, &off);
1593 di->dp = data_read_id(di->dp, &len);
1594 di->vert_ddp = di->ddp = get_vertical_data(di->data, di->key, off, len);
1597 di->vert_storestate = di->data->storestate;
1599 else if (di->key->storage == KEY_STORAGE_INCORE)
1602 if (di->keyp[1] && (!di->keyname || (di->flags & SEARCH_SUB) != 0))
1603 di->dp = data_skip_key(di->data, di->dp, di->key);
1609 if (di->key->type == REPOKEY_TYPE_DELETED)
1611 if (di->key->type == REPOKEY_TYPE_FIXARRAY || di->key->type == REPOKEY_TYPE_FLEXARRAY)
1613 if (di->nkeynames && di->nparents - di->rootlevel < di->nkeynames)
1619 di->ddp = data_fetch(di->ddp, &di->kv, di->key);
1621 di->state = di_nextkey;
1623 di->state = di_nextattr;
1626 case di_nextkey: di_nextkey:
1627 if (!di->keyname && *++di->keyp)
1633 case di_nextrepodata: di_nextrepodata:
1634 if (di->repodataid && ++di->repodataid < di->repo->nrepodata)
1635 goto di_enterrepodata;
1638 case di_nextsolvable: di_nextsolvable:
1639 if (!(di->flags & SEARCH_THISSOLVID))
1642 di->solvid = di->repo->start;
1645 for (; di->solvid < di->repo->end; di->solvid++)
1647 if (di->pool->solvables[di->solvid].repo == di->repo)
1648 goto di_entersolvable;
1653 case di_nextrepo: di_nextrepo:
1658 if (di->repoid < di->pool->nrepos)
1660 di->repo = di->pool->repos[di->repoid];
1666 case di_bye: di_bye:
1670 case di_enterarray: di_enterarray:
1671 if (di->key->name == REPOSITORY_SOLVABLES)
1673 di->ddp = data_read_id(di->ddp, (Id *)&di->kv.num);
1678 case di_nextarrayelement: di_nextarrayelement:
1681 di->ddp = data_skip_schema(di->data, di->ddp, di->kv.id);
1682 if (di->kv.entry == di->kv.num)
1684 if (di->nkeynames && di->nparents - di->rootlevel < di->nkeynames)
1686 if (!(di->flags & SEARCH_ARRAYSENTINEL))
1688 di->kv.str = (char *)di->ddp;
1690 di->state = di_nextkey;
1693 if (di->kv.entry == di->kv.num - 1)
1695 if (di->key->type == REPOKEY_TYPE_FLEXARRAY || !di->kv.entry)
1696 di->ddp = data_read_id(di->ddp, &di->kv.id);
1697 di->kv.str = (char *)di->ddp;
1698 if (di->nkeynames && di->nparents - di->rootlevel < di->nkeynames)
1700 if ((di->flags & SEARCH_SUB) != 0)
1701 di->state = di_entersub;
1703 di->state = di_nextarrayelement;
1706 case di_entersub: di_entersub:
1707 if (di->nparents == sizeof(di->parents)/sizeof(*di->parents) - 1)
1708 goto di_nextarrayelement; /* sorry, full */
1709 di->parents[di->nparents].kv = di->kv;
1710 di->parents[di->nparents].dp = di->dp;
1711 di->parents[di->nparents].keyp = di->keyp;
1712 di->dp = (unsigned char *)di->kv.str;
1713 di->keyp = di->data->schemadata + di->data->schemata[di->kv.id];
1714 memset(&di->kv, 0, sizeof(di->kv));
1715 di->kv.parent = &di->parents[di->nparents].kv;
1717 di->keyname = di->keynames[di->nparents - di->rootlevel];
1718 goto di_enterschema;
1720 case di_leavesub: di_leavesub:
1721 if (di->nparents - 1 < di->rootlevel)
1724 di->dp = di->parents[di->nparents].dp;
1725 di->kv = di->parents[di->nparents].kv;
1726 di->keyp = di->parents[di->nparents].keyp;
1727 di->key = di->data->keys + *di->keyp;
1728 di->ddp = (unsigned char *)di->kv.str;
1729 di->keyname = di->keynames[di->nparents - di->rootlevel];
1730 goto di_nextarrayelement;
1732 /* special solvable attr handling follows */
1734 case di_nextsolvablekey: di_nextsolvablekey:
1735 if (di->keyname || di->key->name == RPM_RPMDBID)
1736 goto di_enterrepodata;
1740 case di_entersolvablekey: di_entersolvablekey:
1741 di->idp = solvabledata_fetch(di->pool->solvables + di->solvid, &di->kv, di->key->name);
1742 if (!di->idp || !*di->idp)
1743 goto di_nextsolvablekey;
1747 di->kv.id = *di->idp;
1748 di->kv.num = *di->idp; /* for rpmdbid */
1749 di->kv.num2 = 0; /* for rpmdbid */
1751 di->state = di_nextsolvablekey;
1757 case di_nextsolvableattr:
1758 di->state = di_nextsolvableattr;
1759 di->kv.id = *di->idp++;
1764 di->state = di_nextsolvablekey;
1770 if (di->matcher.match)
1773 /* simple pre-check so that we don't need to stringify */
1774 if (di->keyname == SOLVABLE_FILELIST && di->key->type == REPOKEY_TYPE_DIRSTRARRAY && (di->matcher.flags & SEARCH_FILES) != 0)
1775 if (!datamatcher_checkbasename(&di->matcher, di->kv.str))
1777 if (!(str = repodata_stringify(di->pool, di->data, di->key, &di->kv, di->flags)))
1779 if (di->keyname && (di->key->type == REPOKEY_TYPE_FIXARRAY || di->key->type == REPOKEY_TYPE_FLEXARRAY))
1783 if (!datamatcher_match(&di->matcher, str))
1788 if (di->keyname == SOLVABLE_FILELIST && di->key->type == REPOKEY_TYPE_DIRSTRARRAY && (di->flags & SEARCH_FILES) != 0)
1789 repodata_stringify(di->pool, di->data, di->key, &di->kv, di->flags);
1791 /* found something! */
1797 dataiterator_entersub(Dataiterator *di)
1799 if (di->state == di_nextarrayelement)
1800 di->state = di_entersub;
1804 dataiterator_setpos(Dataiterator *di)
1806 if (di->kv.eof == 2)
1808 pool_clear_pos(di->pool);
1811 di->pool->pos.solvid = di->solvid;
1812 di->pool->pos.repo = di->repo;
1813 di->pool->pos.repodataid = di->data - di->repo->repodata;
1814 di->pool->pos.schema = di->kv.id;
1815 di->pool->pos.dp = (unsigned char *)di->kv.str - di->data->incoredata;
1819 dataiterator_setpos_parent(Dataiterator *di)
1821 if (!di->kv.parent || di->kv.parent->eof == 2)
1823 pool_clear_pos(di->pool);
1826 di->pool->pos.solvid = di->solvid;
1827 di->pool->pos.repo = di->repo;
1828 di->pool->pos.repodataid = di->data - di->repo->repodata;
1829 di->pool->pos.schema = di->kv.parent->id;
1830 di->pool->pos.dp = (unsigned char *)di->kv.parent->str - di->data->incoredata;
1833 /* clones just the position, not the search keys/matcher */
1835 dataiterator_clonepos(Dataiterator *di, Dataiterator *from)
1837 di->state = from->state;
1838 di->flags &= ~SEARCH_THISSOLVID;
1839 di->flags |= (from->flags & SEARCH_THISSOLVID);
1840 di->repo = from->repo;
1841 di->data = from->data;
1843 di->ddp = from->ddp;
1844 di->idp = from->idp;
1845 di->keyp = from->keyp;
1846 di->key = from->key;
1848 di->repodataid = from->repodataid;
1849 di->solvid = from->solvid;
1850 di->repoid = from->repoid;
1851 di->rootlevel = from->rootlevel;
1852 memcpy(di->parents, from->parents, sizeof(from->parents));
1853 di->nparents = from->nparents;
1857 for (i = 1; i < di->nparents; i++)
1858 di->parents[i].kv.parent = &di->parents[i - 1].kv;
1859 di->kv.parent = &di->parents[di->nparents - 1].kv;
1863 if (from->dupstr && from->dupstr == from->kv.str)
1865 di->dupstrn = from->dupstrn;
1866 di->dupstr = solv_memdup(from->dupstr, from->dupstrn);
1871 dataiterator_seek(Dataiterator *di, int whence)
1873 if ((whence & DI_SEEK_STAY) != 0)
1874 di->rootlevel = di->nparents;
1875 switch (whence & ~DI_SEEK_STAY)
1878 if (di->state != di_nextarrayelement)
1880 if ((whence & DI_SEEK_STAY) != 0)
1881 di->rootlevel = di->nparents + 1; /* XXX: dangerous! */
1882 di->state = di_entersub;
1884 case DI_SEEK_PARENT:
1891 if (di->rootlevel > di->nparents)
1892 di->rootlevel = di->nparents;
1893 di->dp = di->parents[di->nparents].dp;
1894 di->kv = di->parents[di->nparents].kv;
1895 di->keyp = di->parents[di->nparents].keyp;
1896 di->key = di->data->keys + *di->keyp;
1897 di->ddp = (unsigned char *)di->kv.str;
1898 di->keyname = di->keynames[di->nparents - di->rootlevel];
1899 di->state = di_nextarrayelement;
1901 case DI_SEEK_REWIND:
1907 di->dp = (unsigned char *)di->kv.parent->str;
1908 di->keyp = di->data->schemadata + di->data->schemata[di->kv.parent->id];
1909 di->state = di_enterschema;
1917 dataiterator_skip_attribute(Dataiterator *di)
1919 if (di->state == di_nextsolvableattr)
1920 di->state = di_nextsolvablekey;
1922 di->state = di_nextkey;
1926 dataiterator_skip_solvable(Dataiterator *di)
1931 di->keyname = di->keynames[0];
1932 di->state = di_nextsolvable;
1936 dataiterator_skip_repo(Dataiterator *di)
1941 di->keyname = di->keynames[0];
1942 di->state = di_nextrepo;
1946 dataiterator_jump_to_solvid(Dataiterator *di, Id solvid)
1951 di->keyname = di->keynames[0];
1952 if (solvid == SOLVID_POS)
1954 di->repo = di->pool->pos.repo;
1961 if (!di->pool->pos.repodataid && di->pool->pos.solvid == SOLVID_META) {
1962 solvid = SOLVID_META; /* META pos hack */
1964 di->data = di->repo->repodata + di->pool->pos.repodataid;
1968 else if (solvid > 0)
1970 di->repo = di->pool->solvables[solvid].repo;
1975 if (!di->pool->urepos)
1981 di->repo = di->pool->repos[di->repoid];
1983 if (solvid != SOLVID_POS)
1985 di->solvid = solvid;
1987 di->flags |= SEARCH_THISSOLVID;
1988 di->state = di_enterrepo;
1992 dataiterator_jump_to_repo(Dataiterator *di, Repo *repo)
1998 di->repoid = 0; /* 0 means stay at repo */
2001 di->flags &= ~SEARCH_THISSOLVID;
2002 di->state = di_enterrepo;
2006 dataiterator_match(Dataiterator *di, Datamatcher *ma)
2009 if (!(str = repodata_stringify(di->pool, di->data, di->key, &di->kv, di->flags)))
2011 return ma ? datamatcher_match(ma, str) : 1;
2015 dataiterator_strdup(Dataiterator *di)
2019 if (!di->kv.str || di->kv.str == di->dupstr)
2021 switch (di->key->type)
2024 case REPOKEY_TYPE_DIRSTRARRAY:
2025 if (di->kv.num) /* was it stringified into tmp space? */
2026 l = strlen(di->kv.str) + 1;
2031 if (l < 0 && di->key->storage == KEY_STORAGE_VERTICAL_OFFSET)
2033 switch (di->key->type)
2035 case REPOKEY_TYPE_STR:
2036 case REPOKEY_TYPE_DIRSTRARRAY:
2037 l = strlen(di->kv.str) + 1;
2040 l = solv_chksum_len(di->key->type);
2042 case REPOKEY_TYPE_BINARY:
2049 if (!di->dupstrn || di->dupstrn < l)
2051 di->dupstrn = l + 16;
2052 di->dupstr = solv_realloc(di->dupstr, di->dupstrn);
2055 memcpy(di->dupstr, di->kv.str, l);
2056 di->kv.str = di->dupstr;
2060 /************************************************************************
2061 * data modify functions
2064 /* extend repodata so that it includes solvables p */
2066 repodata_extend(Repodata *data, Id p)
2068 if (data->start == data->end)
2069 data->start = data->end = p;
2072 int old = data->end - data->start;
2073 int new = p - data->end + 1;
2076 data->attrs = solv_extend(data->attrs, old, new, sizeof(Id *), REPODATA_BLOCK);
2077 memset(data->attrs + old, 0, new * sizeof(Id *));
2079 data->incoreoffset = solv_extend(data->incoreoffset, old, new, sizeof(Id), REPODATA_BLOCK);
2080 memset(data->incoreoffset + old, 0, new * sizeof(Id));
2083 if (p < data->start)
2085 int old = data->end - data->start;
2086 int new = data->start - p;
2089 data->attrs = solv_extend_resize(data->attrs, old + new, sizeof(Id *), REPODATA_BLOCK);
2090 memmove(data->attrs + new, data->attrs, old * sizeof(Id *));
2091 memset(data->attrs, 0, new * sizeof(Id *));
2093 data->incoreoffset = solv_extend_resize(data->incoreoffset, old + new, sizeof(Id), REPODATA_BLOCK);
2094 memmove(data->incoreoffset + new, data->incoreoffset, old * sizeof(Id));
2095 memset(data->incoreoffset, 0, new * sizeof(Id));
2100 /* shrink end of repodata */
2102 repodata_shrink(Repodata *data, int end)
2106 if (data->end <= end)
2108 if (data->start >= end)
2112 for (i = 0; i < data->end - data->start; i++)
2113 solv_free(data->attrs[i]);
2114 data->attrs = solv_free(data->attrs);
2116 data->incoreoffset = solv_free(data->incoreoffset);
2117 data->start = data->end = 0;
2122 for (i = end; i < data->end; i++)
2123 solv_free(data->attrs[i - data->start]);
2124 data->attrs = solv_extend_resize(data->attrs, end - data->start, sizeof(Id *), REPODATA_BLOCK);
2126 if (data->incoreoffset)
2127 data->incoreoffset = solv_extend_resize(data->incoreoffset, end - data->start, sizeof(Id), REPODATA_BLOCK);
2131 /* extend repodata so that it includes solvables from start to start + num - 1 */
2133 repodata_extend_block(Repodata *data, Id start, Id num)
2137 if (!data->incoreoffset)
2139 /* this also means that data->attrs is NULL */
2140 data->incoreoffset = solv_calloc_block(num, sizeof(Id), REPODATA_BLOCK);
2141 data->start = start;
2142 data->end = start + num;
2145 repodata_extend(data, start);
2147 repodata_extend(data, start + num - 1);
2150 /**********************************************************************/
2153 #define REPODATA_ATTRS_BLOCK 31
2154 #define REPODATA_ATTRDATA_BLOCK 1023
2155 #define REPODATA_ATTRIDDATA_BLOCK 63
2156 #define REPODATA_ATTRNUM64DATA_BLOCK 15
2160 repodata_new_handle(Repodata *data)
2164 data->xattrs = solv_calloc_block(1, sizeof(Id *), REPODATA_BLOCK);
2165 data->nxattrs = 2; /* -1: SOLVID_META */
2167 data->xattrs = solv_extend(data->xattrs, data->nxattrs, 1, sizeof(Id *), REPODATA_BLOCK);
2168 data->xattrs[data->nxattrs] = 0;
2169 return -(data->nxattrs++);
2173 repodata_get_attrp(Repodata *data, Id handle)
2177 if (handle == SOLVID_META && !data->xattrs)
2179 data->xattrs = solv_calloc_block(1, sizeof(Id *), REPODATA_BLOCK);
2182 return data->xattrs - handle;
2184 if (handle < data->start || handle >= data->end)
2185 repodata_extend(data, handle);
2187 data->attrs = solv_calloc_block(data->end - data->start, sizeof(Id *), REPODATA_BLOCK);
2188 return data->attrs + (handle - data->start);
2192 repodata_insert_keyid(Repodata *data, Id handle, Id keyid, Id val, int overwrite)
2198 app = repodata_get_attrp(data, handle);
2203 /* Determine equality based on the name only, allows us to change
2204 type (when overwrite is set), and makes TYPE_CONSTANT work. */
2205 for (pp = ap; *pp; pp += 2)
2206 if (data->keys[*pp].name == data->keys[keyid].name)
2210 if (overwrite || data->keys[*pp].type == REPOKEY_TYPE_DELETED)
2219 ap = solv_extend(ap, i, 3, sizeof(Id), REPODATA_ATTRS_BLOCK);
2229 repodata_set(Repodata *data, Id solvid, Repokey *key, Id val)
2233 keyid = repodata_key2id(data, key, 1);
2234 repodata_insert_keyid(data, solvid, keyid, val, 1);
2238 repodata_set_id(Repodata *data, Id solvid, Id keyname, Id id)
2242 key.type = REPOKEY_TYPE_ID;
2244 key.storage = KEY_STORAGE_INCORE;
2245 repodata_set(data, solvid, &key, id);
2249 repodata_set_num(Repodata *data, Id solvid, Id keyname, unsigned long long num)
2253 key.type = REPOKEY_TYPE_NUM;
2255 key.storage = KEY_STORAGE_INCORE;
2256 if (num >= 0x80000000)
2258 data->attrnum64data = solv_extend(data->attrnum64data, data->attrnum64datalen, 1, sizeof(unsigned long long), REPODATA_ATTRNUM64DATA_BLOCK);
2259 data->attrnum64data[data->attrnum64datalen] = num;
2260 num = 0x80000000 | data->attrnum64datalen++;
2262 repodata_set(data, solvid, &key, (Id)num);
2266 repodata_set_poolstr(Repodata *data, Id solvid, Id keyname, const char *str)
2270 if (data->localpool)
2271 id = stringpool_str2id(&data->spool, str, 1);
2273 id = pool_str2id(data->repo->pool, str, 1);
2275 key.type = REPOKEY_TYPE_ID;
2277 key.storage = KEY_STORAGE_INCORE;
2278 repodata_set(data, solvid, &key, id);
2282 repodata_set_constant(Repodata *data, Id solvid, Id keyname, unsigned int constant)
2286 key.type = REPOKEY_TYPE_CONSTANT;
2287 key.size = constant;
2288 key.storage = KEY_STORAGE_INCORE;
2289 repodata_set(data, solvid, &key, 0);
2293 repodata_set_constantid(Repodata *data, Id solvid, Id keyname, Id id)
2297 key.type = REPOKEY_TYPE_CONSTANTID;
2299 key.storage = KEY_STORAGE_INCORE;
2300 repodata_set(data, solvid, &key, 0);
2304 repodata_set_void(Repodata *data, Id solvid, Id keyname)
2308 key.type = REPOKEY_TYPE_VOID;
2310 key.storage = KEY_STORAGE_INCORE;
2311 repodata_set(data, solvid, &key, 0);
2315 repodata_set_str(Repodata *data, Id solvid, Id keyname, const char *str)
2320 l = strlen(str) + 1;
2322 key.type = REPOKEY_TYPE_STR;
2324 key.storage = KEY_STORAGE_INCORE;
2325 data->attrdata = solv_extend(data->attrdata, data->attrdatalen, l, 1, REPODATA_ATTRDATA_BLOCK);
2326 memcpy(data->attrdata + data->attrdatalen, str, l);
2327 repodata_set(data, solvid, &key, data->attrdatalen);
2328 data->attrdatalen += l;
2332 repodata_set_binary(Repodata *data, Id solvid, Id keyname, void *buf, int len)
2340 key.type = REPOKEY_TYPE_BINARY;
2342 key.storage = KEY_STORAGE_INCORE;
2343 data->attrdata = solv_extend(data->attrdata, data->attrdatalen, len + 5, 1, REPODATA_ATTRDATA_BLOCK);
2344 dp = data->attrdata + data->attrdatalen;
2345 if (len >= (1 << 14))
2347 if (len >= (1 << 28))
2348 *dp++ = (len >> 28) | 128;
2349 if (len >= (1 << 21))
2350 *dp++ = (len >> 21) | 128;
2351 *dp++ = (len >> 14) | 128;
2353 if (len >= (1 << 7))
2354 *dp++ = (len >> 7) | 128;
2357 memcpy(dp, buf, len);
2358 repodata_set(data, solvid, &key, data->attrdatalen);
2359 data->attrdatalen = dp + len - data->attrdata;
2362 /* add an array element consisting of entrysize Ids to the repodata. modifies attriddata
2363 * so that the caller can append entrysize new elements plus the termination zero there */
2365 repodata_add_array(Repodata *data, Id handle, Id keyname, Id keytype, int entrysize)
2368 Id *ida, *pp, **ppp;
2370 /* check if it is the same as last time, this speeds things up a lot */
2371 if (handle == data->lasthandle && data->keys[data->lastkey].name == keyname && data->keys[data->lastkey].type == keytype && data->attriddatalen == data->lastdatalen)
2373 /* great! just append the new data */
2374 data->attriddata = solv_extend(data->attriddata, data->attriddatalen, entrysize, sizeof(Id), REPODATA_ATTRIDDATA_BLOCK);
2375 data->attriddatalen--; /* overwrite terminating 0 */
2376 data->lastdatalen += entrysize;
2380 ppp = repodata_get_attrp(data, handle);
2384 for (; *pp; pp += 2)
2385 if (data->keys[*pp].name == keyname)
2388 if (!pp || !*pp || data->keys[*pp].type != keytype)
2390 /* not found. allocate new key */
2396 key.storage = KEY_STORAGE_INCORE;
2397 data->attriddata = solv_extend(data->attriddata, data->attriddatalen, entrysize + 1, sizeof(Id), REPODATA_ATTRIDDATA_BLOCK);
2398 keyid = repodata_key2id(data, &key, 1);
2399 repodata_insert_keyid(data, handle, keyid, data->attriddatalen, 1);
2400 data->lasthandle = handle;
2401 data->lastkey = keyid;
2402 data->lastdatalen = data->attriddatalen + entrysize + 1;
2406 for (ida = data->attriddata + pp[1]; *ida; ida += entrysize)
2407 oldsize += entrysize;
2408 if (ida + 1 == data->attriddata + data->attriddatalen)
2410 /* this was the last entry, just append it */
2411 data->attriddata = solv_extend(data->attriddata, data->attriddatalen, entrysize, sizeof(Id), REPODATA_ATTRIDDATA_BLOCK);
2412 data->attriddatalen--; /* overwrite terminating 0 */
2416 /* too bad. move to back. */
2417 data->attriddata = solv_extend(data->attriddata, data->attriddatalen, oldsize + entrysize + 1, sizeof(Id), REPODATA_ATTRIDDATA_BLOCK);
2418 memcpy(data->attriddata + data->attriddatalen, data->attriddata + pp[1], oldsize * sizeof(Id));
2419 pp[1] = data->attriddatalen;
2420 data->attriddatalen += oldsize;
2422 data->lasthandle = handle;
2423 data->lastkey = *pp;
2424 data->lastdatalen = data->attriddatalen + entrysize + 1;
2428 repodata_set_bin_checksum(Repodata *data, Id solvid, Id keyname, Id type,
2429 const unsigned char *str)
2434 if (!(l = solv_chksum_len(type)))
2439 key.storage = KEY_STORAGE_INCORE;
2440 data->attrdata = solv_extend(data->attrdata, data->attrdatalen, l, 1, REPODATA_ATTRDATA_BLOCK);
2441 memcpy(data->attrdata + data->attrdatalen, str, l);
2442 repodata_set(data, solvid, &key, data->attrdatalen);
2443 data->attrdatalen += l;
2447 repodata_set_checksum(Repodata *data, Id solvid, Id keyname, Id type,
2450 unsigned char buf[64];
2453 if (!(l = solv_chksum_len(type)))
2455 if (l > sizeof(buf) || solv_hex2bin(&str, buf, l) != l)
2457 repodata_set_bin_checksum(data, solvid, keyname, type, buf);
2461 repodata_chk2str(Repodata *data, Id type, const unsigned char *buf)
2465 if (!(l = solv_chksum_len(type)))
2467 return pool_bin2hex(data->repo->pool, buf, l);
2470 /* rpm filenames don't contain the epoch, so strip it */
2471 static inline const char *
2472 evrid2vrstr(Pool *pool, Id evrid)
2474 const char *p, *evr = pool_id2str(pool, evrid);
2477 for (p = evr; *p >= '0' && *p <= '9'; p++)
2479 return p != evr && *p == ':' && p[1] ? p + 1 : evr;
2483 repodata_set_poolstrn(Repodata *data, Id solvid, Id keyname, const char *str, int l)
2486 if (data->localpool)
2487 id = stringpool_strn2id(&data->spool, str, l, 1);
2489 id = pool_strn2id(data->repo->pool, str, l, 1);
2490 repodata_set_id(data, solvid, keyname, id);
2494 repodata_set_strn(Repodata *data, Id solvid, Id keyname, const char *str, int l)
2497 repodata_set_str(data, solvid, keyname, str);
2500 char *s = solv_strdup(str);
2502 repodata_set_str(data, solvid, keyname, s);
2508 repodata_set_location(Repodata *data, Id solvid, int medianr, const char *dir, const char *file)
2510 Pool *pool = data->repo->pool;
2512 const char *str, *fp;
2516 repodata_set_constant(data, solvid, SOLVABLE_MEDIANR, medianr);
2519 if ((dir = strrchr(file, '/')) != 0)
2530 if (l >= 2 && dir[0] == '.' && dir[1] == '/' && (l == 2 || dir[2] != '/'))
2535 if (l == 1 && dir[0] == '.')
2537 s = pool->solvables + solvid;
2540 str = pool_id2str(pool, s->arch);
2541 if (!strncmp(dir, str, l) && !str[l])
2542 repodata_set_void(data, solvid, SOLVABLE_MEDIADIR);
2544 repodata_set_strn(data, solvid, SOLVABLE_MEDIADIR, dir, l);
2547 str = pool_id2str(pool, s->name);
2549 if ((!l || !strncmp(fp, str, l)) && fp[l] == '-')
2552 str = evrid2vrstr(pool, s->evr);
2554 if ((!l || !strncmp(fp, str, l)) && fp[l] == '.')
2557 str = pool_id2str(pool, s->arch);
2559 if ((!l || !strncmp(fp, str, l)) && !strcmp(fp + l, ".rpm"))
2561 repodata_set_void(data, solvid, SOLVABLE_MEDIAFILE);
2566 repodata_set_str(data, solvid, SOLVABLE_MEDIAFILE, file);
2569 /* XXX: medianr is currently not stored */
2571 repodata_set_deltalocation(Repodata *data, Id handle, int medianr, const char *dir, const char *file)
2574 const char *evr, *suf, *s;
2578 if ((dir = strrchr(file, '/')) != 0)
2589 if (l >= 2 && dir[0] == '.' && dir[1] == '/' && (l == 2 || dir[2] != '/'))
2594 if (l == 1 && dir[0] == '.')
2597 repodata_set_poolstrn(data, handle, DELTA_LOCATION_DIR, dir, l);
2598 evr = strchr(file, '-');
2601 for (s = evr - 1; s > file; s--)
2608 suf = strrchr(file, '.');
2611 for (s = suf - 1; s > file; s--)
2617 if (!strcmp(suf, ".delta.rpm") || !strcmp(suf, ".patch.rpm"))
2619 /* We accept one more item as suffix. */
2620 for (s = suf - 1; s > file; s--)
2630 if (suf && evr && suf < evr)
2632 repodata_set_poolstrn(data, handle, DELTA_LOCATION_NAME, file, evr ? evr - file : strlen(file));
2634 repodata_set_poolstrn(data, handle, DELTA_LOCATION_EVR, evr + 1, suf ? suf - evr - 1: strlen(evr + 1));
2636 repodata_set_poolstr(data, handle, DELTA_LOCATION_SUFFIX, suf + 1);
2640 repodata_set_sourcepkg(Repodata *data, Id solvid, const char *sourcepkg)
2642 Pool *pool = data->repo->pool;
2643 Solvable *s = pool->solvables + solvid;
2644 const char *p, *sevr, *sarch, *name, *evr;
2646 p = strrchr(sourcepkg, '.');
2647 if (!p || strcmp(p, ".rpm") != 0)
2650 repodata_set_str(data, solvid, SOLVABLE_SOURCENAME, sourcepkg);
2654 while (p > sourcepkg && *p != '.')
2656 if (*p != '.' || p == sourcepkg)
2659 while (p > sourcepkg && *p != '-')
2661 if (*p != '-' || p == sourcepkg)
2664 while (p > sourcepkg && *p != '-')
2666 if (*p != '-' || p == sourcepkg)
2669 pool = s->repo->pool;
2671 name = pool_id2str(pool, s->name);
2672 if (name && !strncmp(sourcepkg, name, sevr - sourcepkg - 1) && name[sevr - sourcepkg - 1] == 0)
2673 repodata_set_void(data, solvid, SOLVABLE_SOURCENAME);
2675 repodata_set_id(data, solvid, SOLVABLE_SOURCENAME, pool_strn2id(pool, sourcepkg, sevr - sourcepkg - 1, 1));
2677 evr = evrid2vrstr(pool, s->evr);
2678 if (evr && !strncmp(sevr, evr, sarch - sevr - 1) && evr[sarch - sevr - 1] == 0)
2679 repodata_set_void(data, solvid, SOLVABLE_SOURCEEVR);
2681 repodata_set_id(data, solvid, SOLVABLE_SOURCEEVR, pool_strn2id(pool, sevr, sarch - sevr - 1, 1));
2683 if (!strcmp(sarch, "src.rpm"))
2684 repodata_set_constantid(data, solvid, SOLVABLE_SOURCEARCH, ARCH_SRC);
2685 else if (!strcmp(sarch, "nosrc.rpm"))
2686 repodata_set_constantid(data, solvid, SOLVABLE_SOURCEARCH, ARCH_NOSRC);
2688 repodata_set_constantid(data, solvid, SOLVABLE_SOURCEARCH, pool_strn2id(pool, sarch, strlen(sarch) - 4, 1));
2692 repodata_set_idarray(Repodata *data, Id solvid, Id keyname, Queue *q)
2698 key.type = REPOKEY_TYPE_IDARRAY;
2700 key.storage = KEY_STORAGE_INCORE;
2701 repodata_set(data, solvid, &key, data->attriddatalen);
2702 data->attriddata = solv_extend(data->attriddata, data->attriddatalen, q->count + 1, sizeof(Id), REPODATA_ATTRIDDATA_BLOCK);
2703 for (i = 0; i < q->count; i++)
2704 data->attriddata[data->attriddatalen++] = q->elements[i];
2705 data->attriddata[data->attriddatalen++] = 0;
2709 repodata_add_dirnumnum(Repodata *data, Id solvid, Id keyname, Id dir, Id num, Id num2)
2713 fprintf(stderr, "repodata_add_dirnumnum %d %d %d %d (%d)\n", solvid, dir, num, num2, data->attriddatalen);
2715 repodata_add_array(data, solvid, keyname, REPOKEY_TYPE_DIRNUMNUMARRAY, 3);
2716 data->attriddata[data->attriddatalen++] = dir;
2717 data->attriddata[data->attriddatalen++] = num;
2718 data->attriddata[data->attriddatalen++] = num2;
2719 data->attriddata[data->attriddatalen++] = 0;
2723 repodata_add_dirstr(Repodata *data, Id solvid, Id keyname, Id dir, const char *str)
2729 l = strlen(str) + 1;
2730 data->attrdata = solv_extend(data->attrdata, data->attrdatalen, l, 1, REPODATA_ATTRDATA_BLOCK);
2731 memcpy(data->attrdata + data->attrdatalen, str, l);
2732 stroff = data->attrdatalen;
2733 data->attrdatalen += l;
2736 fprintf(stderr, "repodata_add_dirstr %d %d %s (%d)\n", solvid, dir, str, data->attriddatalen);
2738 repodata_add_array(data, solvid, keyname, REPOKEY_TYPE_DIRSTRARRAY, 2);
2739 data->attriddata[data->attriddatalen++] = dir;
2740 data->attriddata[data->attriddatalen++] = stroff;
2741 data->attriddata[data->attriddatalen++] = 0;
2745 repodata_add_idarray(Repodata *data, Id solvid, Id keyname, Id id)
2748 fprintf(stderr, "repodata_add_idarray %d %d (%d)\n", solvid, id, data->attriddatalen);
2750 repodata_add_array(data, solvid, keyname, REPOKEY_TYPE_IDARRAY, 1);
2751 data->attriddata[data->attriddatalen++] = id;
2752 data->attriddata[data->attriddatalen++] = 0;
2756 repodata_add_poolstr_array(Repodata *data, Id solvid, Id keyname,
2760 if (data->localpool)
2761 id = stringpool_str2id(&data->spool, str, 1);
2763 id = pool_str2id(data->repo->pool, str, 1);
2764 repodata_add_idarray(data, solvid, keyname, id);
2768 repodata_add_fixarray(Repodata *data, Id solvid, Id keyname, Id ghandle)
2770 repodata_add_array(data, solvid, keyname, REPOKEY_TYPE_FIXARRAY, 1);
2771 data->attriddata[data->attriddatalen++] = ghandle;
2772 data->attriddata[data->attriddatalen++] = 0;
2776 repodata_add_flexarray(Repodata *data, Id solvid, Id keyname, Id ghandle)
2778 repodata_add_array(data, solvid, keyname, REPOKEY_TYPE_FLEXARRAY, 1);
2779 data->attriddata[data->attriddatalen++] = ghandle;
2780 data->attriddata[data->attriddatalen++] = 0;
2784 repodata_unset_uninternalized(Repodata *data, Id solvid, Id keyname)
2787 app = repodata_get_attrp(data, solvid);
2791 for (; *ap; ap += 2)
2792 if (data->keys[*ap].name == keyname)
2798 for (; *ap; ap += 2)
2800 if (data->keys[*ap].name == keyname)
2808 /* XXX: does not work correctly, needs fix in iterators! */
2810 repodata_unset(Repodata *data, Id solvid, Id keyname)
2814 key.type = REPOKEY_TYPE_DELETED;
2816 key.storage = KEY_STORAGE_INCORE;
2817 repodata_set(data, solvid, &key, 0);
2820 /* add all (uninternalized) attrs from src to dest */
2822 repodata_merge_attrs(Repodata *data, Id dest, Id src)
2825 if (dest == src || !data->attrs || !(keyp = data->attrs[src - data->start]))
2827 for (; *keyp; keyp += 2)
2828 repodata_insert_keyid(data, dest, keyp[0], keyp[1], 0);
2831 /* add some (uninternalized) attrs from src to dest */
2833 repodata_merge_some_attrs(Repodata *data, Id dest, Id src, Map *keyidmap, int overwrite)
2836 if (dest == src || !data->attrs || !(keyp = data->attrs[src - data->start]))
2838 for (; *keyp; keyp += 2)
2839 if (!keyidmap || MAPTST(keyidmap, keyp[0]))
2840 repodata_insert_keyid(data, dest, keyp[0], keyp[1], overwrite);
2843 /* swap (uninternalized) attrs from src and dest */
2845 repodata_swap_attrs(Repodata *data, Id dest, Id src)
2848 if (!data->attrs || dest == src)
2850 if (dest < data->start || dest >= data->end)
2851 repodata_extend(data, dest);
2852 if (src < data->start || src >= data->end)
2853 repodata_extend(data, src);
2854 tmpattrs = data->attrs[dest - data->start];
2855 data->attrs[dest - data->start] = data->attrs[src - data->start];
2856 data->attrs[src - data->start] = tmpattrs;
2860 /**********************************************************************/
2862 /* TODO: unify with repo_write and repo_solv! */
2864 #define EXTDATA_BLOCK 1023
2872 data_addid(struct extdata *xd, Id sx)
2874 unsigned int x = (unsigned int)sx;
2877 xd->buf = solv_extend(xd->buf, xd->len, 5, 1, EXTDATA_BLOCK);
2878 dp = xd->buf + xd->len;
2883 *dp++ = (x >> 28) | 128;
2885 *dp++ = (x >> 21) | 128;
2886 *dp++ = (x >> 14) | 128;
2889 *dp++ = (x >> 7) | 128;
2891 xd->len = dp - xd->buf;
2895 data_addid64(struct extdata *xd, unsigned long long x)
2897 if (x >= 0x100000000)
2901 data_addid(xd, (Id)(x >> 35));
2902 xd->buf[xd->len - 1] |= 128;
2904 data_addid(xd, (Id)((unsigned int)x | 0x80000000));
2905 xd->buf[xd->len - 5] = (x >> 28) | 128;
2908 data_addid(xd, (Id)x);
2912 data_addideof(struct extdata *xd, Id sx, int eof)
2914 unsigned int x = (unsigned int)sx;
2917 xd->buf = solv_extend(xd->buf, xd->len, 5, 1, EXTDATA_BLOCK);
2918 dp = xd->buf + xd->len;
2923 *dp++ = (x >> 27) | 128;
2925 *dp++ = (x >> 20) | 128;
2926 *dp++ = (x >> 13) | 128;
2929 *dp++ = (x >> 6) | 128;
2930 *dp++ = eof ? (x & 63) : (x & 63) | 64;
2931 xd->len = dp - xd->buf;
2935 data_addblob(struct extdata *xd, unsigned char *blob, int len)
2937 xd->buf = solv_extend(xd->buf, xd->len, len, 1, EXTDATA_BLOCK);
2938 memcpy(xd->buf + xd->len, blob, len);
2942 /*********************************/
2944 /* this is to reduct memory usage when internalizing oversized repos */
2946 compact_attrdata(Repodata *data, int entry, int nentry)
2949 unsigned int attrdatastart = data->attrdatalen;
2950 unsigned int attriddatastart = data->attriddatalen;
2951 if (attrdatastart < 1024 * 1024 * 4 && attriddatastart < 1024 * 1024)
2953 for (i = entry; i < nentry; i++)
2955 Id v, *attrs = data->attrs[i];
2958 for (; *attrs; attrs += 2)
2960 switch (data->keys[*attrs].type)
2962 case REPOKEY_TYPE_STR:
2963 case REPOKEY_TYPE_BINARY:
2965 if ((unsigned int)attrs[1] < attrdatastart)
2966 attrdatastart = attrs[1];
2968 case REPOKEY_TYPE_DIRSTRARRAY:
2969 for (v = attrs[1]; data->attriddata[v] ; v += 2)
2970 if (data->attriddata[v + 1] < attrdatastart)
2971 attrdatastart = data->attriddata[v + 1];
2973 case REPOKEY_TYPE_IDARRAY:
2974 case REPOKEY_TYPE_DIRNUMNUMARRAY:
2975 if ((unsigned int)attrs[1] < attriddatastart)
2976 attriddatastart = attrs[1];
2978 case REPOKEY_TYPE_FIXARRAY:
2979 case REPOKEY_TYPE_FLEXARRAY:
2987 printf("compact_attrdata %d %d\n", entry, nentry);
2988 printf("attrdatastart: %d\n", attrdatastart);
2989 printf("attriddatastart: %d\n", attriddatastart);
2991 if (attrdatastart < 1024 * 1024 * 4 && attriddatastart < 1024 * 1024)
2993 for (i = entry; i < nentry; i++)
2995 Id v, *attrs = data->attrs[i];
2998 for (; *attrs; attrs += 2)
3000 switch (data->keys[*attrs].type)
3002 case REPOKEY_TYPE_STR:
3003 case REPOKEY_TYPE_BINARY:
3005 attrs[1] -= attrdatastart;
3007 case REPOKEY_TYPE_DIRSTRARRAY:
3008 for (v = attrs[1]; data->attriddata[v] ; v += 2)
3009 data->attriddata[v + 1] -= attrdatastart;
3011 case REPOKEY_TYPE_IDARRAY:
3012 case REPOKEY_TYPE_DIRNUMNUMARRAY:
3013 attrs[1] -= attriddatastart;
3022 data->attrdatalen -= attrdatastart;
3023 memmove(data->attrdata, data->attrdata + attrdatastart, data->attrdatalen);
3024 data->attrdata = solv_extend_resize(data->attrdata, data->attrdatalen, 1, REPODATA_ATTRDATA_BLOCK);
3026 if (attriddatastart)
3028 data->attriddatalen -= attriddatastart;
3029 memmove(data->attriddata, data->attriddata + attriddatastart, data->attriddatalen * sizeof(Id));
3030 data->attriddata = solv_extend_resize(data->attriddata, data->attriddatalen, sizeof(Id), REPODATA_ATTRIDDATA_BLOCK);
3034 /* internalalize some key into incore/vincore data */
3037 repodata_serialize_key(Repodata *data, struct extdata *newincore,
3038 struct extdata *newvincore,
3040 Repokey *key, Id val)
3044 unsigned int oldvincorelen = 0;
3048 if (key->storage == KEY_STORAGE_VERTICAL_OFFSET)
3051 oldvincorelen = xd->len;
3055 case REPOKEY_TYPE_VOID:
3056 case REPOKEY_TYPE_CONSTANT:
3057 case REPOKEY_TYPE_CONSTANTID:
3058 case REPOKEY_TYPE_DELETED:
3060 case REPOKEY_TYPE_STR:
3061 data_addblob(xd, data->attrdata + val, strlen((char *)(data->attrdata + val)) + 1);
3063 case REPOKEY_TYPE_MD5:
3064 data_addblob(xd, data->attrdata + val, SIZEOF_MD5);
3066 case REPOKEY_TYPE_SHA1:
3067 data_addblob(xd, data->attrdata + val, SIZEOF_SHA1);
3069 case REPOKEY_TYPE_SHA224:
3070 data_addblob(xd, data->attrdata + val, SIZEOF_SHA224);
3072 case REPOKEY_TYPE_SHA256:
3073 data_addblob(xd, data->attrdata + val, SIZEOF_SHA256);
3075 case REPOKEY_TYPE_SHA384:
3076 data_addblob(xd, data->attrdata + val, SIZEOF_SHA384);
3078 case REPOKEY_TYPE_SHA512:
3079 data_addblob(xd, data->attrdata + val, SIZEOF_SHA512);
3081 case REPOKEY_TYPE_NUM:
3082 if (val & 0x80000000)
3084 data_addid64(xd, data->attrnum64data[val ^ 0x80000000]);
3088 case REPOKEY_TYPE_ID:
3089 case REPOKEY_TYPE_DIR:
3090 data_addid(xd, val);
3092 case REPOKEY_TYPE_BINARY:
3095 unsigned char *dp = data_read_id(data->attrdata + val, &len);
3096 dp += (unsigned int)len;
3097 data_addblob(xd, data->attrdata + val, dp - (data->attrdata + val));
3100 case REPOKEY_TYPE_IDARRAY:
3101 for (ida = data->attriddata + val; *ida; ida++)
3102 data_addideof(xd, ida[0], ida[1] ? 0 : 1);
3104 case REPOKEY_TYPE_DIRNUMNUMARRAY:
3105 for (ida = data->attriddata + val; *ida; ida += 3)
3107 data_addid(xd, ida[0]);
3108 data_addid(xd, ida[1]);
3109 data_addideof(xd, ida[2], ida[3] ? 0 : 1);
3112 case REPOKEY_TYPE_DIRSTRARRAY:
3113 for (ida = data->attriddata + val; *ida; ida += 2)
3115 data_addideof(xd, ida[0], ida[2] ? 0 : 1);
3116 data_addblob(xd, data->attrdata + ida[1], strlen((char *)(data->attrdata + ida[1])) + 1);
3119 case REPOKEY_TYPE_FIXARRAY:
3123 for (ida = data->attriddata + val; *ida; ida++)
3127 kp = data->xattrs[-*ida];
3129 continue; /* ignore empty elements */
3131 for (; *kp; kp += 2)
3135 schemaid = repodata_schema2id(data, schema, 1);
3136 else if (schemaid != repodata_schema2id(data, schema, 0))
3138 pool_debug(data->repo->pool, SOLV_ERROR, "repodata_serialize_key: fixarray substructs with different schemas\n");
3143 data_addid(xd, num);
3146 data_addid(xd, schemaid);
3147 for (ida = data->attriddata + val; *ida; ida++)
3149 Id *kp = data->xattrs[-*ida];
3152 for (; *kp; kp += 2)
3153 repodata_serialize_key(data, newincore, newvincore, schema, data->keys + *kp, kp[1]);
3157 case REPOKEY_TYPE_FLEXARRAY:
3160 for (ida = data->attriddata + val; *ida; ida++)
3162 data_addid(xd, num);
3163 for (ida = data->attriddata + val; *ida; ida++)
3165 Id *kp = data->xattrs[-*ida];
3168 data_addid(xd, 0); /* XXX */
3175 schemaid = repodata_schema2id(data, schema, 1);
3176 data_addid(xd, schemaid);
3177 kp = data->xattrs[-*ida];
3179 repodata_serialize_key(data, newincore, newvincore, schema, data->keys + *kp, kp[1]);
3184 pool_debug(data->repo->pool, SOLV_FATAL, "repodata_serialize_key: don't know how to handle type %d\n", key->type);
3187 if (key->storage == KEY_STORAGE_VERTICAL_OFFSET)
3189 /* put offset/len in incore */
3190 data_addid(newincore, data->lastverticaloffset + oldvincorelen);
3191 oldvincorelen = xd->len - oldvincorelen;
3192 data_addid(newincore, oldvincorelen);
3196 /* create a circular linked list of all keys that share
3197 * the same keyname */
3199 calculate_keylink(Repodata *data)
3203 Id maxkeyname = 0, *keytable = 0;
3204 link = solv_calloc(data->nkeys, sizeof(Id));
3205 if (data->nkeys <= 2)
3207 for (i = 1; i < data->nkeys; i++)
3209 Id n = data->keys[i].name;
3210 if (n >= maxkeyname)
3212 keytable = solv_realloc2(keytable, n + 128, sizeof(Id));
3213 memset(keytable + maxkeyname, 0, (n + 128 - maxkeyname) * sizeof(Id));
3214 maxkeyname = n + 128;
3224 /* remove links that just point to themselfs */
3225 for (i = 1; i < data->nkeys; i++)
3228 solv_free(keytable);
3233 repodata_internalize(Repodata *data)
3235 Repokey *key, solvkey;
3237 Id schemaid, keyid, *schema, *sp, oldschemaid, *keyp, *seen;
3238 Offset *oldincoreoffs = 0;
3240 unsigned char *dp, *ndp;
3242 struct extdata newincore;
3243 struct extdata newvincore;
3248 if (!data->attrs && !data->xattrs)
3252 printf("repodata_internalize %d\n", data->repodataid);
3253 printf(" attr data: %d K\n", data->attrdatalen / 1024);
3254 printf(" attrid data: %d K\n", data->attriddatalen / (1024 / 4));
3256 newvincore.buf = data->vincore;
3257 newvincore.len = data->vincorelen;
3259 /* find the solvables key, create if needed */
3260 memset(&solvkey, 0, sizeof(solvkey));
3261 solvkey.name = REPOSITORY_SOLVABLES;
3262 solvkey.type = REPOKEY_TYPE_FLEXARRAY;
3264 solvkey.storage = KEY_STORAGE_INCORE;
3265 solvkeyid = repodata_key2id(data, &solvkey, data->end != data->start ? 1 : 0);
3267 schema = solv_malloc2(data->nkeys, sizeof(Id));
3268 seen = solv_malloc2(data->nkeys, sizeof(Id));
3270 /* Merge the data already existing (in data->schemata, ->incoredata and
3271 friends) with the new attributes in data->attrs[]. */
3272 nentry = data->end - data->start;
3273 memset(&newincore, 0, sizeof(newincore));
3274 data_addid(&newincore, 0); /* start data at offset 1 */
3276 data->mainschema = 0;
3277 data->mainschemaoffsets = solv_free(data->mainschemaoffsets);
3279 keylink = calculate_keylink(data);
3280 /* join entry data */
3281 /* we start with the meta data, entry -1 */
3282 for (entry = -1; entry < nentry; entry++)
3285 dp = data->incoredata;
3288 dp += entry >= 0 ? data->incoreoffset[entry] : 1;
3289 dp = data_read_id(dp, &oldschemaid);
3291 memset(seen, 0, data->nkeys * sizeof(Id));
3293 fprintf(stderr, "oldschemaid %d\n", oldschemaid);
3294 fprintf(stderr, "schemata %d\n", data->schemata[oldschemaid]);
3295 fprintf(stderr, "schemadata %p\n", data->schemadata);
3298 /* seen: -1: old data, 0: skipped, >0: id + 1 */
3302 for (keyp = data->schemadata + data->schemata[oldschemaid]; *keyp; keyp++)
3306 /* oops, should not happen */
3310 seen[*keyp] = -1; /* use old marker */
3313 haveoldkl = 1; /* potential keylink conflict */
3316 /* strip solvables key */
3317 if (entry < 0 && solvkeyid && seen[solvkeyid])
3320 for (sp = keyp = schema; *sp; sp++)
3321 if (*sp != solvkeyid)
3324 seen[solvkeyid] = 0;
3328 /* add new entries */
3330 keyp = data->attrs ? data->attrs[entry] : 0;
3332 keyp = data->xattrs ? data->xattrs[1] : 0;
3334 for (; *keyp; keyp += 2)
3340 if (haveoldkl && keylink[*keyp]) /* this should be pretty rare */
3343 for (kl = keylink[*keyp]; kl != *keyp; kl = keylink[kl])
3346 /* replacing old key kl, remove from schema and seen */
3348 for (osp = schema; osp < sp; osp++)
3351 memmove(osp, osp + 1, (sp - osp) * sizeof(Id));
3359 seen[*keyp] = keyp[1] + 1;
3362 /* add solvables key if needed */
3363 if (entry < 0 && data->end != data->start)
3365 *sp++ = solvkeyid; /* always last in schema */
3372 /* Ideally we'd like to sort the new schema here, to ensure
3373 schema equality independend of the ordering. */
3374 schemaid = repodata_schema2id(data, schema, 1);
3376 schemaid = oldschemaid;
3380 data->mainschemaoffsets = solv_calloc(sp - schema, sizeof(Id));
3381 data->mainschema = schemaid;
3384 /* find offsets in old incore data */
3388 for (sp = data->schemadata + data->schemata[oldschemaid]; *sp; sp++)
3389 if (seen[*sp] == -1)
3390 lastneeded = sp + 1;
3394 oldincoreoffs = solv_malloc2(data->nkeys, 2 * sizeof(Offset));
3395 for (sp = data->schemadata + data->schemata[oldschemaid]; sp != lastneeded; sp++)
3397 /* Skip the data associated with this old key. */
3398 key = data->keys + *sp;
3400 if (key->storage == KEY_STORAGE_VERTICAL_OFFSET)
3402 ndp = data_skip(ndp, REPOKEY_TYPE_ID);
3403 ndp = data_skip(ndp, REPOKEY_TYPE_ID);
3405 else if (key->storage == KEY_STORAGE_INCORE)
3406 ndp = data_skip_key(data, ndp, key);
3407 oldincoreoffs[*sp * 2] = dp - data->incoredata;
3408 oldincoreoffs[*sp * 2 + 1] = ndp - dp;
3414 /* just copy over the complete old entry (including the schemaid) if there was no new data */
3415 if (entry >= 0 && !neednewschema && oldschemaid && (!data->attrs || !data->attrs[entry]) && dp)
3417 ndp = data->incoredata + data->incoreoffset[entry];
3418 data->incoreoffset[entry] = newincore.len;
3419 data_addblob(&newincore, ndp, dp - ndp);
3423 /* Now create data blob. We walk through the (possibly new) schema
3424 and either copy over old data, or insert the new. */
3426 data->incoreoffset[entry] = newincore.len;
3427 data_addid(&newincore, schemaid);
3429 /* we don't use a pointer to the schemadata here as repodata_serialize_key
3430 * may call repodata_schema2id() which might realloc our schemadata */
3431 for (schemaidx = data->schemata[schemaid]; (keyid = data->schemadata[schemaidx]) != 0; schemaidx++)
3435 data->mainschemaoffsets[schemaidx - data->schemata[schemaid]] = newincore.len;
3436 if (keyid == solvkeyid)
3438 /* add flexarray entry count */
3439 data_addid(&newincore, data->end - data->start);
3440 break; /* always the last entry */
3443 if (seen[keyid] == -1)
3445 if (oldincoreoffs[keyid * 2 + 1])
3446 data_addblob(&newincore, data->incoredata + oldincoreoffs[keyid * 2], oldincoreoffs[keyid * 2 + 1]);
3448 else if (seen[keyid])
3449 repodata_serialize_key(data, &newincore, &newvincore, schema, data->keys + keyid, seen[keyid] - 1);
3454 if (entry >= 0 && data->attrs)
3456 if (data->attrs[entry])
3457 data->attrs[entry] = solv_free(data->attrs[entry]);
3458 if (entry && entry % 4096 == 0 && data->nxattrs <= 2 && entry + 64 < nentry)
3460 compact_attrdata(data, entry + 1, nentry); /* try to free some memory */
3462 printf(" attr data: %d K\n", data->attrdatalen / 1024);
3463 printf(" attrid data: %d K\n", data->attriddatalen / (1024 / 4));
3464 printf(" incore data: %d K\n", newincore.len / 1024);
3465 printf(" sum: %d K\n", (newincore.len + data->attrdatalen + data->attriddatalen * 4) / 1024);
3466 /* malloc_stats(); */
3471 /* free all xattrs */
3472 for (entry = 0; entry < data->nxattrs; entry++)
3473 if (data->xattrs[entry])
3474 solv_free(data->xattrs[entry]);
3475 data->xattrs = solv_free(data->xattrs);
3478 data->lasthandle = 0;
3480 data->lastdatalen = 0;
3484 solv_free(oldincoreoffs);
3485 repodata_free_schemahash(data);
3487 solv_free(data->incoredata);
3488 data->incoredata = newincore.buf;
3489 data->incoredatalen = newincore.len;
3490 data->incoredatafree = 0;
3492 solv_free(data->vincore);
3493 data->vincore = newvincore.buf;
3494 data->vincorelen = newvincore.len;
3496 data->attrs = solv_free(data->attrs);
3497 data->attrdata = solv_free(data->attrdata);
3498 data->attriddata = solv_free(data->attriddata);
3499 data->attrnum64data = solv_free(data->attrnum64data);
3500 data->attrdatalen = 0;
3501 data->attriddatalen = 0;
3502 data->attrnum64datalen = 0;
3504 printf("repodata_internalize %d done\n", data->repodataid);
3505 printf(" incore data: %d K\n", data->incoredatalen / 1024);
3510 repodata_disable_paging(Repodata *data)
3512 if (maybe_load_repodata(data, 0))
3514 repopagestore_disable_paging(&data->store);
3520 repodata_load_stub(Repodata *data)
3522 Repo *repo = data->repo;
3523 Pool *pool = repo->pool;
3525 struct _Pool_tmpspace oldtmpspace;
3528 if (!pool->loadcallback)
3530 data->state = REPODATA_ERROR;
3533 data->state = REPODATA_LOADING;
3535 /* save tmp space and pos */
3536 oldtmpspace = pool->tmpspace;
3537 memset(&pool->tmpspace, 0, sizeof(pool->tmpspace));
3540 r = pool->loadcallback(pool, data, pool->loadcallbackdata);
3542 /* restore tmp space and pos */
3543 for (i = 0; i < POOL_TMPSPACEBUF; i++)
3544 solv_free(pool->tmpspace.buf[i]);
3545 pool->tmpspace = oldtmpspace;
3546 if (r && oldpos.repo == repo && oldpos.repodataid == data->repodataid)
3547 memset(&oldpos, 0, sizeof(oldpos));
3550 data->state = r ? REPODATA_AVAILABLE : REPODATA_ERROR;
3554 repodata_add_stubkey(Repodata *data, Id keyname, Id keytype)
3558 xkey.name = keyname;
3559 xkey.type = keytype;
3560 xkey.storage = KEY_STORAGE_INCORE;
3562 repodata_key2id(data, &xkey, 1);
3566 repodata_add_stub(Repodata **datap)
3568 Repodata *data = *datap;
3569 Repo *repo = data->repo;
3570 Id repodataid = data - repo->repodata;
3571 Repodata *sdata = repo_add_repodata(repo, 0);
3572 data = repo->repodata + repodataid;
3573 if (data->end > data->start)
3574 repodata_extend_block(sdata, data->start, data->end - data->start);
3575 sdata->state = REPODATA_STUB;
3576 sdata->loadcallback = repodata_load_stub;
3582 repodata_create_stubs(Repodata *data)
3584 Repo *repo = data->repo;
3585 Pool *pool = repo->pool;
3592 dataiterator_init(&di, pool, repo, SOLVID_META, REPOSITORY_EXTERNAL, 0, 0);
3593 while (dataiterator_step(&di))
3594 if (di.data == data)
3596 dataiterator_free(&di);
3599 stubdataids = solv_calloc(cnt, sizeof(*stubdataids));
3600 for (i = 0; i < cnt; i++)
3602 sdata = repodata_add_stub(&data);
3603 stubdataids[i] = sdata - repo->repodata;
3606 dataiterator_init(&di, pool, repo, SOLVID_META, REPOSITORY_EXTERNAL, 0, 0);
3608 while (dataiterator_step(&di))
3610 if (di.data != data)
3612 if (di.key->name == REPOSITORY_EXTERNAL && !di.nparents)
3614 dataiterator_entersub(&di);
3615 sdata = repo->repodata + stubdataids[i++];
3619 switch (di.key->type)
3621 case REPOKEY_TYPE_ID:
3622 repodata_set_id(sdata, SOLVID_META, di.key->name, di.kv.id);
3624 case REPOKEY_TYPE_CONSTANTID:
3625 repodata_set_constantid(sdata, SOLVID_META, di.key->name, di.kv.id);
3627 case REPOKEY_TYPE_STR:
3628 repodata_set_str(sdata, SOLVID_META, di.key->name, di.kv.str);
3630 case REPOKEY_TYPE_VOID:
3631 repodata_set_void(sdata, SOLVID_META, di.key->name);
3633 case REPOKEY_TYPE_NUM:
3634 repodata_set_num(sdata, SOLVID_META, di.key->name, SOLV_KV_NUM64(&di.kv));
3637 repodata_set_bin_checksum(sdata, SOLVID_META, di.key->name, di.key->type, (const unsigned char *)di.kv.str);
3639 case REPOKEY_TYPE_IDARRAY:
3640 repodata_add_idarray(sdata, SOLVID_META, di.key->name, di.kv.id);
3641 if (di.key->name == REPOSITORY_KEYS)
3646 xkeyname = di.kv.id;
3650 repodata_add_stubkey(sdata, xkeyname, di.kv.id);
3659 dataiterator_free(&di);
3660 for (i = 0; i < cnt; i++)
3661 repodata_internalize(repo->repodata + stubdataids[i]);
3662 solv_free(stubdataids);
3667 repodata_memused(Repodata *data)
3669 return data->incoredatalen + data->vincorelen;