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.
40 #include "linkedpkg.h"
42 #ifdef ENABLE_LINKED_PKGS
45 find_application_link(Pool *pool, Solvable *s, Id *reqidp, Queue *qr, Id *prvidp, Queue *qp)
51 /* find appdata requires */
54 Id *reqp = s->repo->idarraydata + s->requires;
55 while ((req = *reqp++) != 0) /* go through all requires */
59 if (!strncmp("appdata(", pool_id2str(pool, req), 8))
65 /* find application-appdata provides */
68 Id *prvp = s->repo->idarraydata + s->provides;
69 while ((prv = *prvp++) != 0) /* go through all provides */
73 if (strncmp("application-appdata(", pool_id2str(pool, prv), 20))
75 if (!strcmp(pool_id2str(pool, prv) + 12, pool_id2str(pool, req)))
82 FOR_PROVIDES(p, pp, req)
83 if (pool->solvables[p].repo == s->repo)
89 FOR_PROVIDES(p, pp, prv)
90 if (pool->solvables[p].repo == s->repo)
98 find_product_link(Pool *pool, Solvable *s, Id *reqidp, Queue *qr, Id *prvidp, Queue *qp)
100 Id n = s - pool->solvables;
104 if (pool->nscallback)
106 Id buddy = pool->nscallback(pool, pool->nscallbackdata, NAMESPACE_PRODUCTBUDDY, n);
107 if (buddy > 0 && buddy != SYSTEMSOLVABLE && buddy != n && buddy < pool->nsolvables)
110 *reqidp = solvable_selfprovidedep(pool->solvables + buddy);
111 queue_push(qr, buddy);
113 *prvidp = solvable_selfprovidedep(s);
119 /* search for project requires */
123 Id req, *reqp = s->repo->idarraydata + s->requires;
124 const char *nn = pool_id2str(pool, s->name);
125 int nnl = strlen(nn);
126 while ((req = *reqp++) != 0) /* go through all requires */
130 Reldep *rd = GETRELDEP(pool, req);
131 if (rd->flags != REL_EQ || rd->evr != s->evr)
133 rn = pool_id2str(pool, rd->name);
134 if (!strncmp(rn, "product(", 8) && !strncmp(rn + 8, nn + 8, nnl - 8) && !strcmp( rn + nnl, ")"))
143 /* too bad. construct from scratch */
144 str = pool_tmpjoin(pool, pool_id2str(pool, s->name), ")", 0);
146 namerelid = pool_rel2id(pool, pool_str2id(pool, str, 1), s->evr, REL_EQ, 1);
148 FOR_PROVIDES(p, pp, namerelid)
150 Solvable *ps = pool->solvables + p;
151 if (ps->repo != s->repo || ps->arch != s->arch)
155 if (!qr->count && s->repo == pool->installed)
157 /* oh no! Look up reference file */
159 const char *refbasename = solvable_lookup_str(s, PRODUCT_REFERENCEFILE);
160 dataiterator_init(&di, pool, s->repo, 0, SOLVABLE_FILELIST, refbasename, SEARCH_STRING);
161 while (dataiterator_step(&di))
162 queue_push(qr, di.solvid);
163 dataiterator_free(&di);
166 dataiterator_init(&di, pool, s->repo, 0, PRODUCT_REFERENCEFILE, refbasename, SEARCH_STRING);
167 while (dataiterator_step(&di))
168 queue_push(qp, di.solvid);
169 dataiterator_free(&di);
175 FOR_PROVIDES(p, pp, s->name)
177 Solvable *ps = pool->solvables + p;
178 if (s->name != ps->name || ps->repo != s->repo || ps->arch != s->arch || s->evr != ps->evr)
186 *prvidp = solvable_selfprovidedep(s);
190 find_pattern_link(Pool *pool, Solvable *s, Id *reqidp, Queue *qr, Id *prvidp, Queue *qp)
192 Id p, pp, *pr, apevr = 0, aprel = 0;
194 /* check if autopattern */
197 for (pr = s->repo->idarraydata + s->provides; (p = *pr++) != 0; )
200 Reldep *rd = GETRELDEP(pool, p);
201 if (rd->flags == REL_EQ && !strcmp(pool_id2str(pool, rd->name), "autopattern()"))
210 FOR_PROVIDES(p, pp, apevr)
212 Solvable *s2 = pool->solvables + p;
213 if (s2->repo == s->repo && s2->name == apevr && s2->evr == s->evr && s2->vendor == s->vendor)
218 FOR_PROVIDES(p, pp, aprel)
220 Solvable *s2 = pool->solvables + p;
221 if (s2->repo == s->repo && s2->evr == s->evr && s2->vendor == s->vendor)
232 find_autopattern_name(Pool *pool, Solvable *s)
237 for (prvp = s->repo->idarraydata + s->provides; (prv = *prvp++) != 0; )
240 Reldep *rd = GETRELDEP(pool, prv);
241 if (rd->flags == REL_EQ && !strcmp(pool_id2str(pool, rd->name), "autopattern()"))
242 return strncmp(pool_id2str(pool, rd->evr), "pattern:", 8) != 0 ? rd->evr : 0;
248 find_package_link(Pool *pool, Solvable *s, Id *reqidp, Queue *qr, Id *prvidp, Queue *qp)
250 const char *name = pool_id2str(pool, s->name);
251 if (name[0] == 'a' && !strncmp("application:", name, 12))
252 find_application_link(pool, s, reqidp, qr, prvidp, qp);
253 else if (name[0] == 'p' && !strncmp("pattern:", name, 7))
254 find_pattern_link(pool, s, reqidp, qr, prvidp, qp);
255 else if (name[0] == 'p' && !strncmp("product:", name, 8))
256 find_product_link(pool, s, reqidp, qr, prvidp, qp);