2 * Copyright (c) 2013, SUSE Inc.
4 * This program is licensed under the BSD license, read LICENSE.BSD
5 * for further information
11 * Linked packages are "pseudo" packages that are bound to real packages but
12 * contain different information (name/summary/description). They are normally
13 * somehow generated from the real packages, either when the repositories are
14 * created or automatically from the packages by looking at the provides.
16 * We currently support:
19 * created from AppStream appdata xml in the repository (which is generated
20 * from files in /usr/share/appdata)
23 * created from product data in the repository (which is generated from files
24 * in /etc/products.d). In the future we may switch to using product()
25 * provides of packages.
28 * created from pattern() provides of packages.
43 #include "linkedpkg.h"
45 #ifdef ENABLE_LINKED_PKGS
48 find_application_link(Pool *pool, Solvable *s, Id *reqidp, Queue *qr, Id *prvidp, Queue *qp)
53 Id pkgname = 0, appdataid = 0;
55 /* find appdata requires */
58 Id *reqp = s->repo->idarraydata + s->requires;
59 while ((req = *reqp++) != 0) /* go through all requires */
63 if (!strncmp("appdata(", pool_id2str(pool, req), 8))
69 req = appdataid ? appdataid : pkgname;
72 /* find application-appdata provides */
75 Id *prvp = s->repo->idarraydata + s->provides;
76 const char *reqs = pool_id2str(pool, req);
78 while ((prv = *prvp++) != 0) /* go through all provides */
82 prvs = pool_id2str(pool, prv);
83 if (strncmp("application-appdata(", prvs, 20))
87 if (!strcmp(prvs + 12, reqs))
92 int reqsl = strlen(reqs);
93 if (!strncmp(prvs + 20, reqs, reqsl) && !strcmp(prvs + 20 + reqsl, ")"))
99 return; /* huh, no provides found? */
101 FOR_PROVIDES(p, pp, req)
102 if (pool->solvables[p].repo == s->repo)
103 if (!pkgname || pool->solvables[p].name == pkgname)
105 if (!qr->count && pkgname && appdataid)
107 /* huh, no matching package? try without pkgname filter */
108 FOR_PROVIDES(p, pp, req)
109 if (pool->solvables[p].repo == s->repo)
114 FOR_PROVIDES(p, pp, prv)
115 if (pool->solvables[p].repo == s->repo)
125 find_product_link(Pool *pool, Solvable *s, Id *reqidp, Queue *qr, Id *prvidp, Queue *qp)
129 unsigned int sbt = 0;
131 /* search for project requires */
135 Id req, *reqp = s->repo->idarraydata + s->requires;
136 const char *nn = pool_id2str(pool, s->name);
137 int nnl = strlen(nn);
138 while ((req = *reqp++) != 0) /* go through all requires */
142 Reldep *rd = GETRELDEP(pool, req);
143 if (rd->flags != REL_EQ || rd->evr != s->evr)
145 rn = pool_id2str(pool, rd->name);
146 if (!strncmp(rn, "product(", 8) && !strncmp(rn + 8, nn + 8, nnl - 8) && !strcmp( rn + nnl, ")"))
155 /* too bad. construct from scratch */
156 str = pool_tmpjoin(pool, pool_id2str(pool, s->name), ")", 0);
158 namerelid = pool_rel2id(pool, pool_str2id(pool, str, 1), s->evr, REL_EQ, 1);
160 FOR_PROVIDES(p, pp, namerelid)
162 Solvable *ps = pool->solvables + p;
163 if (ps->repo != s->repo || ps->arch != s->arch)
169 /* multiple providers. try buildtime filter */
170 sbt = solvable_lookup_num(s, SOLVABLE_BUILDTIME, 0);
176 for (i = j = 0; i < qr->count; i++)
178 bt = solvable_lookup_num(pool->solvables + qr->elements[i], SOLVABLE_BUILDTIME, 0);
180 filterqp = 0; /* can't filter */
181 if (!bt || bt == sbt)
182 qr->elements[j++] = qr->elements[i];
187 sbt = 0; /* filter failed */
190 if (!qr->count && s->repo == pool->installed)
192 /* oh no! Look up reference file */
194 const char *refbasename = solvable_lookup_str(s, PRODUCT_REFERENCEFILE);
197 dataiterator_init(&di, pool, s->repo, 0, SOLVABLE_FILELIST, refbasename, SEARCH_STRING);
198 while (dataiterator_step(&di))
200 if (di.key->type != REPOKEY_TYPE_DIRSTRARRAY)
202 if (strcmp(repodata_dir2str(di.data, di.kv.id, 0), "/etc/products.d") != 0)
204 queue_push(qr, di.solvid);
206 dataiterator_free(&di);
209 dataiterator_init(&di, pool, s->repo, 0, PRODUCT_REFERENCEFILE, refbasename, SEARCH_STRING);
210 while (dataiterator_step(&di))
211 queue_push(qp, di.solvid);
212 dataiterator_free(&di);
219 FOR_PROVIDES(p, pp, s->name)
221 Solvable *ps = pool->solvables + p;
222 if (s->name != ps->name || ps->repo != s->repo || ps->arch != s->arch || s->evr != ps->evr)
224 if (sbt && solvable_lookup_num(ps, SOLVABLE_BUILDTIME, 0) != sbt)
232 *prvidp = solvable_selfprovidedep(s);
236 find_pattern_link(Pool *pool, Solvable *s, Id *reqidp, Queue *qr, Id *prvidp, Queue *qp)
238 Id p, pp, *pr, apevr = 0, aprel = 0;
240 /* check if autopattern */
243 for (pr = s->repo->idarraydata + s->provides; (p = *pr++) != 0; )
246 Reldep *rd = GETRELDEP(pool, p);
247 if (rd->flags == REL_EQ && !strcmp(pool_id2str(pool, rd->name), "autopattern()"))
256 FOR_PROVIDES(p, pp, apevr)
258 Solvable *s2 = pool->solvables + p;
259 if (s2->repo == s->repo && s2->name == apevr && s2->evr == s->evr && s2->vendor == s->vendor)
264 FOR_PROVIDES(p, pp, aprel)
266 Solvable *s2 = pool->solvables + p;
267 if (s2->repo == s->repo && s2->evr == s->evr && s2->vendor == s->vendor)
277 /* the following two functions are used in solvable_lookup_str_base to do
278 * translated lookups on the product/pattern packages
281 find_autopattern_name(Pool *pool, Solvable *s)
286 for (prvp = s->repo->idarraydata + s->provides; (prv = *prvp++) != 0; )
289 Reldep *rd = GETRELDEP(pool, prv);
290 if (rd->flags == REL_EQ && !strcmp(pool_id2str(pool, rd->name), "autopattern()"))
291 return strncmp(pool_id2str(pool, rd->evr), "pattern:", 8) != 0 ? rd->evr : 0;
297 find_autoproduct_name(Pool *pool, Solvable *s)
302 for (prvp = s->repo->idarraydata + s->provides; (prv = *prvp++) != 0; )
305 Reldep *rd = GETRELDEP(pool, prv);
306 if (rd->flags == REL_EQ && !strcmp(pool_id2str(pool, rd->name), "autoproduct()"))
307 return strncmp(pool_id2str(pool, rd->evr), "product:", 8) != 0 ? rd->evr : 0;
313 find_package_link(Pool *pool, Solvable *s, Id *reqidp, Queue *qr, Id *prvidp, Queue *qp)
315 const char *name = pool_id2str(pool, s->name);
316 if (name[0] == 'a' && !strncmp("application:", name, 12))
317 find_application_link(pool, s, reqidp, qr, prvidp, qp);
318 else if (name[0] == 'p' && !strncmp("pattern:", name, 7))
319 find_pattern_link(pool, s, reqidp, qr, prvidp, qp);
320 else if (name[0] == 'p' && !strncmp("product:", name, 8))
321 find_product_link(pool, s, reqidp, qr, prvidp, qp);
325 name_min_max(Pool *pool, Solvable *s, Id *namep, Id *minp, Id *maxp)
332 queue_init_buffer(&q, qbuf, sizeof(qbuf)/sizeof(*qbuf));
333 find_package_link(pool, s, 0, &q, 0, 0);
339 s = pool->solvables + q.elements[0];
342 for (i = 1; i < q.count; i++)
344 s = pool->solvables + q.elements[i];
350 if (s->evr == min || s->evr == max)
352 if (pool_evrcmp(pool, min, s->evr, EVRCMP_COMPARE) >= 0)
354 else if (min == max || pool_evrcmp(pool, max, s->evr, EVRCMP_COMPARE) <= 0)
365 pool_link_evrcmp(Pool *pool, Solvable *s1, Solvable *s2)
367 Id name1, evrmin1, evrmax1;
368 Id name2, evrmin2, evrmax2;
370 if (s1->name != s2->name)
371 return 0; /* can't compare */
372 if (!name_min_max(pool, s1, &name1, &evrmin1, &evrmax1))
374 if (!name_min_max(pool, s2, &name2, &evrmin2, &evrmax2))
376 /* compare linked names */
379 if (evrmin1 == evrmin2 && evrmax1 == evrmax2)
381 /* now compare evr intervals */
382 if (evrmin1 == evrmax1 && evrmin2 == evrmax2)
383 return pool_evrcmp(pool, evrmin1, evrmax2, EVRCMP_COMPARE);
384 if (evrmin1 != evrmax2 && pool_evrcmp(pool, evrmin1, evrmax2, EVRCMP_COMPARE) > 0)
386 if (evrmax1 != evrmin2 && pool_evrcmp(pool, evrmax1, evrmin2, EVRCMP_COMPARE) < 0)
392 extend_updatemap_to_buddies(Solver *solv)
394 Pool *pool = solv->pool;
395 Repo *installed = solv->installed;
401 if (!solv->updatemap.size || !solv->instbuddy)
403 FOR_REPO_SOLVABLES(installed, p, s)
405 if (!MAPTST(&solv->updatemap, p - installed->start))
407 if ((ip = solv->instbuddy[p - installed->start]) <= 1)
409 if (!has_package_link(pool, s)) /* only look at pseudo -> real relations */
411 if (ip < installed->start || ip >= installed->end || pool->solvables[ip].repo != installed)
412 continue; /* just in case... */
413 MAPSET(&solv->updatemap, ip - installed->start);