2 * Copyright (c) 2008, Novell Inc.
4 * This program is licensed under the BSD license, read LICENSE.BSD
5 * for further information
11 * set/retrieve data from solvables
24 #include "poolvendor.h"
26 #include "linkedpkg.h"
30 pool_solvable2str(Pool *pool, Solvable *s)
32 const char *n, *e, *a;
35 n = pool_id2str(pool, s->name);
36 e = s->evr ? pool_id2str(pool, s->evr) : "";
37 /* XXX: may want to skip the epoch here */
38 a = s->arch ? pool_id2str(pool, s->arch) : "";
42 if (pool->havedistepoch)
44 /* strip the distepoch from the evr */
45 const char *de = strrchr(e, '-');
46 if (de && (de = strchr(de, ':')) != 0)
49 p = pool_alloctmpspace(pool, nl + el + al + 3);
54 strncpy(p + nl, e, el);
59 p[nl + el] = pool->disttype == DISTTYPE_HAIKU ? '-' : '.';
60 strcpy(p + nl + el + 1, a);
62 if (pool->disttype == DISTTYPE_CONDA && solvable_lookup_type(s, SOLVABLE_BUILDFLAVOR))
67 solvable_lookup_idarray(s, SOLVABLE_BUILDFLAVOR, &flavorq);
68 for (i = 0; i < flavorq.count; i++)
69 p = pool_tmpappend(pool, p, "-", pool_id2str(pool, flavorq.elements[i]));
76 solvable_lookup_type(Solvable *s, Id keyname)
80 return repo_lookup_type(s->repo, s - s->repo->pool->solvables, keyname);
84 solvable_lookup_id(Solvable *s, Id keyname)
88 return repo_lookup_id(s->repo, s - s->repo->pool->solvables, keyname);
92 solvable_lookup_idarray(Solvable *s, Id keyname, Queue *q)
99 return repo_lookup_idarray(s->repo, s - s->repo->pool->solvables, keyname, q);
103 solvable_lookup_deparray(Solvable *s, Id keyname, Queue *q, Id marker)
110 return repo_lookup_deparray(s->repo, s - s->repo->pool->solvables, keyname, q, marker);
114 solvable_lookup_str_joinarray(Solvable *s, Id keyname, const char *joinstr)
120 queue_init_buffer(&q, qbuf, sizeof(qbuf)/sizeof(*qbuf));
121 if (solvable_lookup_idarray(s, keyname, &q) && q.count)
123 Pool *pool = s->repo->pool;
125 str = (char *)pool_id2str(pool, q.elements[0]);
129 str = pool_tmpjoin(pool, pool_id2str(pool, q.elements[0]), 0, 0);
130 for (i = 1; i < q.count; i++)
131 str = pool_tmpappend(pool, str, joinstr, pool_id2str(pool, q.elements[i]));
139 solvable_lookup_str(Solvable *s, Id keyname)
144 str = repo_lookup_str(s->repo, s - s->repo->pool->solvables, keyname);
145 if (!str && (keyname == SOLVABLE_LICENSE || keyname == SOLVABLE_GROUP || keyname == SOLVABLE_BUILDFLAVOR))
146 str = solvable_lookup_str_joinarray(s, keyname, ", ");
151 solvable_lookup_str_base(Solvable *s, Id keyname, Id basekeyname, int usebase)
154 const char *str, *basestr;
161 pool = s->repo->pool;
162 str = solvable_lookup_str(s, keyname);
163 if (str || keyname == basekeyname)
165 basestr = solvable_lookup_str(s, basekeyname);
168 /* search for a solvable with same name and same base that has the
170 if (!pool->whatprovides)
171 return usebase ? basestr : 0;
173 /* we do this in two passes, first same vendor, then all other vendors */
174 for (pass = 0; pass < 2; pass++)
176 FOR_PROVIDES(p, pp, name)
178 s2 = pool->solvables + p;
179 if (s2->name != name)
181 if ((s->vendor == s2->vendor) != (pass == 0))
183 str = solvable_lookup_str(s2, basekeyname);
184 if (!str || strcmp(str, basestr))
186 str = solvable_lookup_str(s2, keyname);
190 #ifdef ENABLE_LINKED_PKGS
191 /* autopattern/product translation magic */
192 if (pass == 1 && name == s->name)
194 name = find_autopackage_name(pool, s);
195 if (name && name != s->name)
196 pass = -1; /* start over with new name */
200 return usebase ? basestr : 0;
204 solvable_lookup_str_poollang(Solvable *s, Id keyname)
213 pool = s->repo->pool;
214 if (!pool->nlanguages)
215 return solvable_lookup_str(s, keyname);
216 cols = pool->nlanguages + 1;
217 if (!pool->languagecache)
219 pool->languagecache = solv_calloc(cols * ID_NUM_INTERNAL, sizeof(Id));
220 pool->languagecacheother = 0;
222 if (keyname >= ID_NUM_INTERNAL)
224 row = pool->languagecache + ID_NUM_INTERNAL * cols;
225 for (i = 0; i < pool->languagecacheother; i++, row += cols)
228 if (i >= pool->languagecacheother)
230 pool->languagecache = solv_realloc2(pool->languagecache, pool->languagecacheother + 1, cols * sizeof(Id));
231 row = pool->languagecache + cols * (ID_NUM_INTERNAL + pool->languagecacheother++);
236 row = pool->languagecache + keyname * cols;
237 row++; /* skip keyname */
238 for (i = 0; i < pool->nlanguages; i++, row++)
241 *row = pool_id2langid(pool, keyname, pool->languages[i], 1);
242 str = solvable_lookup_str_base(s, *row, keyname, 0);
246 return solvable_lookup_str(s, keyname);
250 solvable_lookup_str_lang(Solvable *s, Id keyname, const char *lang, int usebase)
255 id = pool_id2langid(s->repo->pool, keyname, lang, 0);
257 return solvable_lookup_str_base(s, id, keyname, usebase);
260 return solvable_lookup_str(s, keyname);
264 solvable_lookup_num(Solvable *s, Id keyname, unsigned long long notfound)
268 return repo_lookup_num(s->repo, s - s->repo->pool->solvables, keyname, notfound);
272 solvable_lookup_sizek(Solvable *s, Id keyname, unsigned long long notfound)
274 unsigned long long size;
277 size = solvable_lookup_num(s, keyname, (unsigned long long)-1);
278 return size == (unsigned long long)-1 ? notfound : ((size + 1023) >> 10);
282 solvable_lookup_void(Solvable *s, Id keyname)
286 return repo_lookup_void(s->repo, s - s->repo->pool->solvables, keyname);
290 solvable_lookup_bool(Solvable *s, Id keyname)
295 /* historic nonsense: there are two ways of storing a bool, as num == 1 or void. test both. */
296 type = repo_lookup_type(s->repo, s - s->repo->pool->solvables, keyname);
297 if (type == REPOKEY_TYPE_VOID)
299 if (type == REPOKEY_TYPE_NUM || type == REPOKEY_TYPE_CONSTANT)
300 return repo_lookup_num(s->repo, s - s->repo->pool->solvables, keyname, 0) == 1;
304 const unsigned char *
305 solvable_lookup_bin_checksum(Solvable *s, Id keyname, Id *typep)
312 return repo_lookup_bin_checksum(s->repo, s - s->repo->pool->solvables, keyname, typep);
316 solvable_lookup_checksum(Solvable *s, Id keyname, Id *typep)
318 const unsigned char *chk = solvable_lookup_bin_checksum(s, keyname, typep);
319 return chk ? pool_bin2hex(s->repo->pool, chk, solv_chksum_len(*typep)) : 0;
323 solvable_lookup_count(Solvable *s, Id keyname)
325 return s->repo ? repo_lookup_count(s->repo, s - s->repo->pool->solvables, keyname) : 0;
328 static inline const char *
329 evrid2vrstr(Pool *pool, Id evrid)
331 const char *p, *evr = pool_id2str(pool, evrid);
334 for (p = evr; *p >= '0' && *p <= '9'; p++)
336 return p != evr && *p == ':' && p[1] ? p + 1 : evr;
340 solvable_lookup_location(Solvable *s, unsigned int *medianrp)
345 const char *mediadir, *mediafile;
351 pool = s->repo->pool;
353 *medianrp = solvable_lookup_num(s, SOLVABLE_MEDIANR, 0);
354 if (solvable_lookup_void(s, SOLVABLE_MEDIADIR))
355 mediadir = pool_id2str(pool, s->arch);
357 mediadir = solvable_lookup_str(s, SOLVABLE_MEDIADIR);
359 l = strlen(mediadir) + 1;
360 if (solvable_lookup_void(s, SOLVABLE_MEDIAFILE))
362 const char *name, *evr, *arch;
363 name = pool_id2str(pool, s->name);
364 evr = evrid2vrstr(pool, s->evr);
365 arch = pool_id2str(pool, s->arch);
366 /* name-vr.arch.rpm */
367 loc = pool_alloctmpspace(pool, l + strlen(name) + strlen(evr) + strlen(arch) + 7);
369 sprintf(loc, "%s/%s-%s.%s.rpm", mediadir, name, evr, arch);
371 sprintf(loc, "%s-%s.%s.rpm", name, evr, arch);
375 mediafile = solvable_lookup_str(s, SOLVABLE_MEDIAFILE);
378 loc = pool_alloctmpspace(pool, l + strlen(mediafile) + 1);
380 sprintf(loc, "%s/%s", mediadir, mediafile);
382 strcpy(loc, mediafile);
388 solvable_get_location(Solvable *s, unsigned int *medianrp)
390 const char *loc = solvable_lookup_location(s, medianrp);
391 if (medianrp && *medianrp == 0)
392 *medianrp = 1; /* compat, to be removed */
397 solvable_lookup_sourcepkg(Solvable *s)
400 const char *evr, *name;
405 pool = s->repo->pool;
406 if (solvable_lookup_void(s, SOLVABLE_SOURCENAME))
407 name = pool_id2str(pool, s->name);
409 name = solvable_lookup_str(s, SOLVABLE_SOURCENAME);
412 archid = solvable_lookup_id(s, SOLVABLE_SOURCEARCH);
413 if (solvable_lookup_void(s, SOLVABLE_SOURCEEVR))
414 evr = evrid2vrstr(pool, s->evr);
416 evr = solvable_lookup_str(s, SOLVABLE_SOURCEEVR);
417 if (archid == ARCH_SRC || archid == ARCH_NOSRC)
420 str = pool_tmpjoin(pool, name, evr ? "-" : 0, evr);
421 str = pool_tmpappend(pool, str, ".", pool_id2str(pool, archid));
422 return pool_tmpappend(pool, str, ".rpm", 0);
425 return name; /* FIXME */
429 /*****************************************************************************/
432 * Create maps containing the state of each solvable. Input is a "installed" queue,
433 * it contains all solvable ids that are considered to be installed.
435 * The created maps can be used for * pool_calc_duchanges() and
436 * pool_calc_installsizechange().
440 pool_create_state_maps(Pool *pool, Queue *installed, Map *installedmap, Map *conflictsmap)
447 map_init(installedmap, pool->nsolvables);
449 map_init(conflictsmap, pool->nsolvables);
450 for (i = 0; i < installed->count; i++)
452 p = installed->elements[i];
453 if (p <= 0) /* makes it work with decisionq */
455 MAPSET(installedmap, p);
458 s = pool->solvables + p;
461 conp = s->repo->idarraydata + s->conflicts;
462 while ((con = *conp++) != 0)
464 dp = pool_whatprovides_ptr(pool, con);
466 MAPSET(conflictsmap, *dp);
471 /* Tests if two solvables have identical content. Currently
472 * both solvables need to come from the same pool
476 solvable_identical(Solvable *s1, Solvable *s2)
478 unsigned long long bt1, bt2;
481 if (s1->name != s2->name)
483 if (s1->arch != s2->arch)
485 if (s1->evr != s2->evr)
488 /* check vendor, map missing vendor to empty string */
489 if ((s1->vendor ? s1->vendor : 1) != (s2->vendor ? s2->vendor : 1))
491 /* workaround for bug 881493 */
492 if (s1->repo && !strncmp(pool_id2str(s1->repo->pool, s1->name), "product:", 8))
497 /* looking good, try some fancier stuff */
498 /* might also look up the package checksum here */
499 bt1 = solvable_lookup_num(s1, SOLVABLE_BUILDTIME, 0);
500 bt2 = solvable_lookup_num(s2, SOLVABLE_BUILDTIME, 0);
510 /* workaround for bugs 881493 and 885830*/
511 const char *n = pool_id2str(s1->repo->pool, s1->name);
512 if (!strncmp(n, "product:", 8) || !strncmp(n, "application:", 12))
515 /* look at requires in a last attempt to find recompiled packages */
518 for (reqp = s1->repo->idarraydata + s1->requires; *reqp; reqp++)
521 for (reqp = s2->repo->idarraydata + s2->requires; *reqp; reqp++)
526 if (s1->repo && s1->repo->pool->disttype == DISTTYPE_CONDA)
528 /* check buildflavor and buildversion */
529 const char *str1, *str2;
530 str1 = solvable_lookup_str(s1, SOLVABLE_BUILDFLAVOR);
531 str2 = solvable_lookup_str(s2, SOLVABLE_BUILDFLAVOR);
532 if (str1 != str2 && (!str1 || !str2 || strcmp(str1, str2) != 0))
534 str1 = solvable_lookup_str(s1, SOLVABLE_BUILDVERSION);
535 str2 = solvable_lookup_str(s2, SOLVABLE_BUILDVERSION);
536 if (str1 != str2 && (!str1 || !str2 || strcmp(str1, str2) != 0))
542 /* return the self provide dependency of a solvable */
544 solvable_selfprovidedep(Solvable *s)
552 pool = s->repo->pool;
555 provp = s->repo->idarraydata + s->provides;
556 while ((prov = *provp++) != 0)
560 rd = GETRELDEP(pool, prov);
561 if (rd->name == s->name && rd->evr == s->evr && rd->flags == REL_EQ)
565 return pool_rel2id(pool, s->name, s->evr, REL_EQ, 1);
568 /* setter functions, simply call the repo variants */
570 solvable_set_id(Solvable *s, Id keyname, Id id)
572 repo_set_id(s->repo, s - s->repo->pool->solvables, keyname, id);
576 solvable_set_num(Solvable *s, Id keyname, unsigned long long num)
578 repo_set_num(s->repo, s - s->repo->pool->solvables, keyname, num);
582 solvable_set_str(Solvable *s, Id keyname, const char *str)
584 repo_set_str(s->repo, s - s->repo->pool->solvables, keyname, str);
588 solvable_set_poolstr(Solvable *s, Id keyname, const char *str)
590 repo_set_poolstr(s->repo, s - s->repo->pool->solvables, keyname, str);
594 solvable_add_poolstr_array(Solvable *s, Id keyname, const char *str)
596 repo_add_poolstr_array(s->repo, s - s->repo->pool->solvables, keyname, str);
600 solvable_add_idarray(Solvable *s, Id keyname, Id id)
602 repo_add_idarray(s->repo, s - s->repo->pool->solvables, keyname, id);
606 solvable_add_deparray(Solvable *s, Id keyname, Id dep, Id marker)
608 repo_add_deparray(s->repo, s - s->repo->pool->solvables, keyname, dep, marker);
612 solvable_set_idarray(Solvable *s, Id keyname, Queue *q)
614 repo_set_idarray(s->repo, s - s->repo->pool->solvables, keyname, q);
618 solvable_set_deparray(Solvable *s, Id keyname, Queue *q, Id marker)
620 repo_set_deparray(s->repo, s - s->repo->pool->solvables, keyname, q, marker);
624 solvable_unset(Solvable *s, Id keyname)
626 repo_unset(s->repo, s - s->repo->pool->solvables, keyname);
629 /* return true if a dependency intersects dep in the keyname array */
631 solvable_matchesdep(Solvable *s, Id keyname, Id dep, int marker)
634 Pool *pool = s->repo->pool;
637 if (keyname == SOLVABLE_NAME)
638 return pool_match_nevr(pool, s, dep) ? 1 : 0; /* nevr match hack */
640 solvable_lookup_deparray(s, keyname, &q, marker);
641 for (i = 0; i < q.count; i++)
642 if (pool_match_dep(pool, q.elements[i], dep))
644 i = i == q.count ? 0 : 1;
650 solvable_matchessolvable_int(Solvable *s, Id keyname, int marker, Id solvid, Map *solvidmap, Queue *depq, Map *missc, int reloff, Queue *outdepq)
652 Pool *pool = s->repo->pool;
658 if (outdepq && outdepq->count)
659 queue_empty(outdepq);
660 solvable_lookup_deparray(s, keyname, depq, marker);
661 for (i = 0; i < depq->count; i++)
663 Id dep = depq->elements[i];
664 boff = ISRELDEP(dep) ? reloff + GETRELID(dep) : dep;
665 if (MAPTST(missc, boff))
669 Reldep *rd = GETRELDEP(pool, dep);
670 if (!ISRELDEP(rd->name) && rd->flags < 8)
672 /* do pre-filtering on the base */
673 if (MAPTST(missc, rd->name))
675 wp = pool_whatprovides_ptr(pool, rd->name);
679 if (MAPTST(solvidmap, *wp))
690 /* the base does not include solvid, no need to check the complete dep */
691 MAPSET(missc, rd->name);
697 wp = pool_whatprovides_ptr(pool, dep);
701 if (MAPTST(solvidmap, *wp))
714 queue_pushunique(outdepq, dep);
721 return outdepq && outdepq->count ? 1 : 0;
725 solvable_matchessolvable(Solvable *s, Id keyname, Id solvid, Queue *depq, int marker)
727 Pool *pool = s->repo->pool;
728 Map missc; /* cache for misses */
732 if (depq && depq->count)
734 if (s - pool->solvables == solvid)
735 return 0; /* no self-matches */
738 reloff = pool->ss.nstrings;
739 map_init(&missc, reloff + pool->nrels);
740 res = solvable_matchessolvable_int(s, keyname, marker, solvid, 0, &qq, &missc, reloff, depq);
747 solvidset2str_evrcmp(Pool *pool, Id a, Id b)
749 Solvable *as = pool->solvables + a, *bs = pool->solvables + b;
750 return as->evr != bs->evr ? pool_evrcmp(pool, as->evr, bs->evr, EVRCMP_COMPARE) : 0;
754 solvidset2str_sortcmp(const void *va, const void *vb, void *vd)
757 Solvable *as = pool->solvables + *(Id *)va, *bs = pool->solvables + *(Id *)vb;
758 if (as->name != bs->name)
760 int r = strcmp(pool_id2str(pool, as->name), pool_id2str(pool, bs->name));
763 return as->name - bs->name;
765 if (as->evr != bs->evr)
767 int r = pool_evrcmp(pool, as->evr, bs->evr, EVRCMP_COMPARE);
771 return *(Id *)va - *(Id *)vb;
775 solvidset2str_striprelease(Pool *pool, Id evr, Id otherevr)
777 const char *evrstr = pool_id2str(pool, evr);
778 const char *r = strchr(evrstr, '-');
783 evrstr2 = pool_tmpjoin(pool, evrstr, 0, 0);
784 evrstr2[r - evrstr] = 0;
785 cmp = pool_evrcmp_str(pool, evrstr2, pool_id2str(pool, otherevr), pool->disttype != DISTTYPE_DEB ? EVRCMP_MATCH_RELEASE : EVRCMP_COMPARE);
786 return cmp == 1 ? evrstr2 : evrstr;
790 pool_solvidset2str(Pool *pool, Queue *q)
801 return pool_solvid2str(pool, q->elements[0]);
802 queue_init_clone(&pq, q);
804 solv_sort(pq.elements, pq.count, sizeof(Id), solvidset2str_sortcmp, pool);
806 for (i = 0; i < pq.count; i++)
808 Id p = pq.elements[i];
810 s = pool_tmpappend(pool, s, ", ", 0);
812 if (i == 0 || pool->solvables[p].name != name)
815 name = pool->solvables[p].name;
817 FOR_PROVIDES(p2, pp2, name)
818 if (pool->solvables[p].name == name)
821 solv_sort(pr.elements, pr.count, sizeof(Id), solvidset2str_sortcmp, pool);
824 for (k = 0; k < pr.count; k++)
825 if (pr.elements[k] == p)
829 /* not in provides, list as singularity */
830 s = pool_tmpappend(pool, s, pool_solvid2str(pool, pq.elements[i]), 0);
833 if (k && solvidset2str_evrcmp(pool, pr.elements[k], pr.elements[k - 1]) == 0)
835 /* unclear start, list as single package */
836 s = pool_tmpappend(pool, s, pool_solvid2str(pool, pq.elements[i]), 0);
840 for (j = i + 1, k = k + 1; j < pq.count; j++, k++)
841 if (k == pr.count || pq.elements[j] != pr.elements[k])
843 while (j > i + 1 && k && k < pr.count && solvidset2str_evrcmp(pool, pr.elements[k], pr.elements[k - 1]) == 0)
848 if (k == 0 || j == i + 1)
850 s = pool_tmpappend(pool, s, pool_solvid2str(pool, pq.elements[i]), 0);
853 /* create an interval */
854 s = pool_tmpappend(pool, s, pool_id2str(pool, name), 0);
856 s = pool_tmpappend(pool, s, " >= ", solvidset2str_striprelease(pool, pool->solvables[pr.elements[kstart]].evr, pool->solvables[pr.elements[kstart - 1]].evr));
858 s = pool_tmpappend(pool, s, " < ", solvidset2str_striprelease(pool, pool->solvables[pr.elements[k]].evr, pool->solvables[pr.elements[k - 1]].evr));