2 * Copyright (c) 2012, Novell Inc.
4 * This program is licensed under the BSD license, read LICENSE.BSD
5 * for further information
19 #include "poolvendor.h"
21 #include "repo_solv.h"
23 #include "solverdebug.h"
26 #include "selection.h"
27 #include "solv_xfopen.h"
30 #include "tools_util.h"
32 static struct job2str {
36 { SOLVER_NOOP, "noop" },
37 { SOLVER_INSTALL, "install" },
38 { SOLVER_ERASE, "erase" },
39 { SOLVER_UPDATE, "update" },
40 { SOLVER_WEAKENDEPS, "weakendeps" },
41 { SOLVER_MULTIVERSION, "multiversion" },
42 { SOLVER_MULTIVERSION, "noobsoletes" }, /* old name */
43 { SOLVER_LOCK, "lock" },
44 { SOLVER_DISTUPGRADE, "distupgrade" },
45 { SOLVER_VERIFY, "verify" },
46 { SOLVER_DROP_ORPHANED, "droporphaned" },
47 { SOLVER_USERINSTALLED, "userinstalled" },
48 { SOLVER_ALLOWUNINSTALL, "allowuninstall" },
52 static struct jobflags2str {
56 { SOLVER_WEAK, "weak" },
57 { SOLVER_ESSENTIAL, "essential" },
58 { SOLVER_CLEANDEPS, "cleandeps" },
59 { SOLVER_ORUPDATE, "orupdate" },
60 { SOLVER_FORCEBEST, "forcebest" },
61 { SOLVER_TARGETED, "targeted" },
62 { SOLVER_NOTBYUSER, "notbyuser" },
63 { SOLVER_SETEV, "setev" },
64 { SOLVER_SETEVR, "setevr" },
65 { SOLVER_SETARCH, "setarch" },
66 { SOLVER_SETVENDOR, "setvendor" },
67 { SOLVER_SETREPO, "setrepo" },
68 { SOLVER_NOAUTOSET, "noautoset" },
72 static struct resultflags2str {
75 } resultflags2str[] = {
76 { TESTCASE_RESULT_TRANSACTION, "transaction" },
77 { TESTCASE_RESULT_PROBLEMS, "problems" },
78 { TESTCASE_RESULT_ORPHANED, "orphaned" },
79 { TESTCASE_RESULT_RECOMMENDED, "recommended" },
80 { TESTCASE_RESULT_UNNEEDED, "unneeded" },
81 { TESTCASE_RESULT_ALTERNATIVES, "alternatives" },
82 { TESTCASE_RESULT_RULES, "rules" },
83 { TESTCASE_RESULT_GENID, "genid" },
87 static struct solverflags2str {
91 } solverflags2str[] = {
92 { SOLVER_FLAG_ALLOW_DOWNGRADE, "allowdowngrade", 0 },
93 { SOLVER_FLAG_ALLOW_NAMECHANGE, "allownamechange", 1 },
94 { SOLVER_FLAG_ALLOW_ARCHCHANGE, "allowarchchange", 0 },
95 { SOLVER_FLAG_ALLOW_VENDORCHANGE, "allowvendorchange", 0 },
96 { SOLVER_FLAG_ALLOW_UNINSTALL, "allowuninstall", 0 },
97 { SOLVER_FLAG_NO_UPDATEPROVIDE, "noupdateprovide", 0 },
98 { SOLVER_FLAG_SPLITPROVIDES, "splitprovides", 0 },
99 { SOLVER_FLAG_IGNORE_RECOMMENDED, "ignorerecommended", 0 },
100 { SOLVER_FLAG_ADD_ALREADY_RECOMMENDED, "addalreadyrecommended", 0 },
101 { SOLVER_FLAG_NO_INFARCHCHECK, "noinfarchcheck", 0 },
102 { SOLVER_FLAG_KEEP_EXPLICIT_OBSOLETES, "keepexplicitobsoletes", 0 },
103 { SOLVER_FLAG_BEST_OBEY_POLICY, "bestobeypolicy", 0 },
104 { SOLVER_FLAG_NO_AUTOTARGET, "noautotarget", 0 },
105 { SOLVER_FLAG_DUP_ALLOW_DOWNGRADE, "dupallowdowngrade", 1 },
106 { SOLVER_FLAG_DUP_ALLOW_ARCHCHANGE, "dupallowarchchange", 1 },
107 { SOLVER_FLAG_DUP_ALLOW_VENDORCHANGE, "dupallowvendorchange", 1 },
108 { SOLVER_FLAG_DUP_ALLOW_NAMECHANGE, "dupallownamechange", 1 },
109 { SOLVER_FLAG_KEEP_ORPHANS, "keeporphans", 0 },
110 { SOLVER_FLAG_BREAK_ORPHANS, "breakorphans", 0 },
111 { SOLVER_FLAG_FOCUS_INSTALLED, "focusinstalled", 0 },
112 { SOLVER_FLAG_YUM_OBSOLETES, "yumobsoletes", 0 },
113 { SOLVER_FLAG_NEED_UPDATEPROVIDE, "needupdateprovide", 0 },
117 static struct poolflags2str {
121 } poolflags2str[] = {
122 { POOL_FLAG_PROMOTEEPOCH, "promoteepoch", 0 },
123 { POOL_FLAG_FORBIDSELFCONFLICTS, "forbidselfconflicts", 0 },
124 { POOL_FLAG_OBSOLETEUSESPROVIDES, "obsoleteusesprovides", 0 },
125 { POOL_FLAG_IMPLICITOBSOLETEUSESPROVIDES, "implicitobsoleteusesprovides", 0 },
126 { POOL_FLAG_OBSOLETEUSESCOLORS, "obsoleteusescolors", 0 },
127 { POOL_FLAG_IMPLICITOBSOLETEUSESCOLORS, "implicitobsoleteusescolors", 0 },
128 { POOL_FLAG_NOINSTALLEDOBSOLETES, "noinstalledobsoletes", 0 },
129 { POOL_FLAG_HAVEDISTEPOCH, "havedistepoch", 0 },
130 { POOL_FLAG_NOOBSOLETESMULTIVERSION, "noobsoletesmultiversion", 0 },
131 { POOL_FLAG_ADDFILEPROVIDESFILTERED, "addfileprovidesfiltered", 0 },
132 { POOL_FLAG_NOWHATPROVIDESAUX, "nowhatprovidesaux", 0 },
136 static struct disttype2str {
140 { DISTTYPE_RPM, "rpm" },
141 { DISTTYPE_DEB, "deb" },
142 { DISTTYPE_ARCH, "arch" },
143 { DISTTYPE_HAIKU, "haiku" },
147 static struct selflags2str {
151 { SELECTION_NAME, "name" },
152 { SELECTION_PROVIDES, "provides" },
153 { SELECTION_FILELIST, "filelist" },
154 { SELECTION_CANON, "canon" },
155 { SELECTION_DOTARCH, "dotarch" },
156 { SELECTION_REL, "rel" },
157 { SELECTION_INSTALLED_ONLY, "installedonly" },
158 { SELECTION_GLOB, "glob" },
159 { SELECTION_FLAT, "flat" },
160 { SELECTION_NOCASE, "nocase" },
161 { SELECTION_SOURCE_ONLY, "sourceonly" },
162 { SELECTION_WITH_SOURCE, "withsource" },
166 static const char *features[] = {
167 #ifdef ENABLE_LINKED_PACKAGES
170 #ifdef ENABLE_COMPLEX_DEPS
176 typedef struct strqueue {
181 #define STRQUEUE_BLOCK 63
184 strqueue_init(Strqueue *q)
191 strqueue_free(Strqueue *q)
194 for (i = 0; i < q->nstr; i++)
195 solv_free(q->str[i]);
196 q->str = solv_free(q->str);
201 strqueue_push(Strqueue *q, const char *s)
203 q->str = solv_extend(q->str, q->nstr, 1, sizeof(*q->str), STRQUEUE_BLOCK);
204 q->str[q->nstr++] = solv_strdup(s);
208 strqueue_pushjoin(Strqueue *q, const char *s1, const char *s2, const char *s3)
210 q->str = solv_extend(q->str, q->nstr, 1, sizeof(*q->str), STRQUEUE_BLOCK);
211 q->str[q->nstr++] = solv_dupjoin(s1, s2, s3);
215 strqueue_sort_cmp(const void *ap, const void *bp, void *dp)
217 const char *a = *(const char **)ap;
218 const char *b = *(const char **)bp;
219 return strcmp(a ? a : "", b ? b : "");
223 strqueue_sort(Strqueue *q)
226 solv_sort(q->str, q->nstr, sizeof(*q->str), strqueue_sort_cmp, 0);
230 strqueue_sort_u(Strqueue *q)
234 for (i = j = 0; i < q->nstr; i++)
235 if (!j || strqueue_sort_cmp(q->str + i, q->str + j - 1, 0) != 0)
236 q->str[j++] = q->str[i];
241 strqueue_join(Strqueue *q)
245 for (i = 0; i < q->nstr; i++)
247 l += strlen(q->str[i]) + 1;
248 l++; /* trailing \0 */
251 for (i = 0; i < q->nstr; i++)
254 strcpy(rp, q->str[i]);
263 strqueue_split(Strqueue *q, const char *s)
268 while ((p = strchr(s, '\n')) != 0)
270 q->str = solv_extend(q->str, q->nstr, 1, sizeof(*q->str), STRQUEUE_BLOCK);
271 q->str[q->nstr] = solv_malloc(p - s + 1);
273 memcpy(q->str[q->nstr], s, p - s);
274 q->str[q->nstr][p - s] = 0;
283 strqueue_diff(Strqueue *sq1, Strqueue *sq2, Strqueue *osq)
286 while (i < sq1->nstr && j < sq2->nstr)
288 int r = strqueue_sort_cmp(sq1->str + i, sq2->str + j, 0);
292 strqueue_pushjoin(osq, "-", sq1->str[i++], 0);
294 strqueue_pushjoin(osq, "+", sq2->str[j++], 0);
296 while (i < sq1->nstr)
297 strqueue_pushjoin(osq, "-", sq1->str[i++], 0);
298 while (j < sq2->nstr)
299 strqueue_pushjoin(osq, "+", sq2->str[j++], 0);
304 testcase_id2str(Pool *pool, Id id, int isname)
306 const char *s = pool_id2str(pool, id);
309 int bad = 0, paren = 0, parenbad = 0;
315 if (strchr("[(<=>!", *s))
317 if (!strncmp(s, "namespace:", 10))
319 for (ss = s + bad; *ss; ss++)
321 if (*ss == ' ' || *ss == '\\' || *(unsigned char *)ss < 32 || *ss == '(' || *ss == ')')
324 paren = paren == 0 ? 1 : -1;
327 paren = paren == 1 ? 0 : -1;
332 if (isname && ss - s > 4 && !strcmp(ss - 4, ":any"))
334 if (!paren && !(bad - parenbad))
337 /* we need escaping! */
338 s2 = s2p = pool_alloctmpspace(pool, strlen(s) + bad * 2 + 1);
339 if (!strncmp(s, "namespace:", 10))
341 strcpy(s2p, "namespace\\3a");
349 if ((ss == s && strchr("[(<=>!", *s)) || *ss == ' ' || *ss == '\\' || *(unsigned char *)ss < 32 || *ss == '(' || *ss == ')')
352 solv_bin2hex((unsigned char *)ss, 1, s2p);
357 if (isname && s2p - s2 > 4 && !strcmp(s2p - 4, ":any"))
358 strcpy(s2p - 4, "\\3aany");
367 { REL_GT | REL_LT | REL_EQ, "<=>" },
368 { REL_LT | REL_EQ, "<=" },
369 { REL_GT | REL_EQ, ">=" },
371 { REL_GT | REL_LT, "<>" },
375 { REL_NAMESPACE , "<NAMESPACE>" },
377 { REL_MULTIARCH, "<MULTIARCH>" },
378 { REL_FILECONFLICT, "<FILECONFLICT>" },
379 { REL_COND, "<IF>" },
380 { REL_COMPAT, "compat >=" },
381 { REL_KIND, "<KIND>" },
382 { REL_ELSE, "<ELSE>" },
388 testcase_dep2str_complex(Pool *pool, Id id, int addparens)
397 return testcase_id2str(pool, id, 1);
398 rd = GETRELDEP(pool, id);
400 /* check for special shortcuts */
401 if (rd->flags == REL_NAMESPACE && !ISRELDEP(rd->name) && !strncmp(pool_id2str(pool, rd->name), "namespace:", 10))
403 const char *ns = pool_id2str(pool, rd->name);
404 int nslen = strlen(ns);
405 /* special namespace formatting */
406 const char *evrs = testcase_dep2str_complex(pool, rd->evr, 0);
407 s = pool_tmpappend(pool, evrs, ns, "()");
408 memmove(s + nslen + 1, s, strlen(s) - nslen - 2);
409 memcpy(s, ns, nslen);
413 if (rd->flags == REL_MULTIARCH && !ISRELDEP(rd->name) && rd->evr == ARCH_ANY)
415 /* special :any suffix */
416 const char *ns = testcase_id2str(pool, rd->name, 1);
417 return pool_tmpappend(pool, ns, ":any", 0);
421 if (ISRELDEP(rd->name))
423 Reldep *rd2 = GETRELDEP(pool, rd->name);
425 if (rd->flags > 7 && rd->flags != REL_COMPAT && rd2->flags && rd2->flags <= 7)
428 s = (char *)testcase_dep2str_complex(pool, rd->name, needparens);
432 s = pool_tmpappend(pool, s, "(", 0);
433 memmove(s + 1, s, strlen(s + 1));
436 for (op = oplist; op->flags; op++)
437 if (rd->flags == op->flags)
441 s = pool_tmpappend(pool, s, " ", op->opname);
442 s = pool_tmpappend(pool, s, " ", 0);
447 sprintf(buf, " <%u> ", rd->flags);
448 s = pool_tmpappend(pool, s, buf, 0);
452 if (ISRELDEP(rd->evr))
454 Reldep *rd2 = GETRELDEP(pool, rd->evr);
456 if (rd->flags > 7 && rd2->flags && rd2->flags <= 7)
458 if (rd->flags == REL_AND && rd2->flags == REL_AND)
459 needparens = 0; /* chain */
460 if (rd->flags == REL_OR && rd2->flags == REL_OR)
461 needparens = 0; /* chain */
462 if (rd->flags > 0 && rd->flags < 8 && rd2->flags == REL_COMPAT)
463 needparens = 0; /* chain */
465 if (!ISRELDEP(rd->evr))
466 s2 = testcase_id2str(pool, rd->evr, 0);
468 s2 = testcase_dep2str_complex(pool, rd->evr, needparens);
470 s = pool_tmpappend(pool, s, s2, ")");
472 s = pool_tmpappend(pool, s, s2, 0);
473 pool_freetmpspace(pool, s2);
478 testcase_dep2str(Pool *pool, Id id)
480 return testcase_dep2str_complex(pool, id, 0);
484 /* Convert a simple string. Also handle the :any suffix */
486 testcase_str2dep_simple(Pool *pool, const char **sp, int isname)
493 for (s = *sp; *s; s++)
497 if (*s == ' ' || *(unsigned char *)s < 32)
501 if (*s == ')' && paren-- <= 0)
504 if (isname && s - *sp > 4 && !strncmp(s - 4, ":any", 4))
511 if (s - *sp == 6 && !strncmp(*sp, "<NULL>", 6))
514 id = pool_strn2id(pool, *sp, s - *sp, 1);
516 else if (s - *sp == 3 && !strncmp(*sp, "\\00", 3))
520 char buf[128], *bp, *bp2;
522 bp = s - *sp >= 128 ? solv_malloc(s - *sp + 1) : buf;
523 for (bp2 = bp, sp2 = *sp; sp2 < s;)
527 solv_hex2bin(&sp2, (unsigned char *)bp2 - 1, 1);
530 id = pool_str2id(pool, bp, 1);
536 id = pool_rel2id(pool, id, ARCH_ANY, REL_MULTIARCH, 1);
545 testcase_str2dep_complex(Pool *pool, const char **sp, int relop)
548 Id flags, id, id2, namespaceid = 0;
551 while (*s == ' ' || *s == '\t')
553 if (!strncmp(s, "namespace:", 10))
555 /* special namespace hack */
557 for (s2 = s + 10; *s2 && *s2 != '('; s2++)
561 namespaceid = pool_strn2id(pool, s, s2 - s, 1);
568 id = testcase_str2dep_complex(pool, &s, 0);
577 id = testcase_str2dep_simple(pool, &s, relop ? 0 : 1);
579 id = pool_rel2id(pool, namespaceid, id, REL_NAMESPACE, 1);
583 while (*s == ' ' || *s == '\t')
585 if (!*s || *s == ')' || (relop && strncmp(s, "compat >= ", 10) != 0))
591 /* we have an op! Find the end */
593 if (s[0] == '<' && (s[1] >= '0' && s[1] <= '9'))
596 for (s2 = s + 1; *s2 >= '0' && *s2 <= '9'; s2++)
600 flags = strtoul(s + 1, 0, 10);
606 for (op = oplist; op->flags; op++)
607 if (!strncmp(s, op->opname, strlen(op->opname)))
615 s += strlen(op->opname);
617 id2 = testcase_str2dep_complex(pool, &s, flags > 0 && flags < 8);
623 id = pool_rel2id(pool, id, id2, flags, 1);
628 testcase_str2dep(Pool *pool, const char *s)
630 Id id = testcase_str2dep_complex(pool, &s, 0);
631 return s && !*s ? id : 0;
634 /**********************************************************/
637 testcase_repoid2str(Pool *pool, Id repoid)
639 Repo *repo = pool_id2repo(pool, repoid);
642 char *r = pool_tmpjoin(pool, repo->name, 0, 0);
644 for (rp = r; *rp; rp++)
645 if (*rp == ' ' || *rp == '\t')
652 sprintf(buf, "#%d", repoid);
653 return pool_tmpjoin(pool, buf, 0, 0);
658 testcase_solvid2str(Pool *pool, Id p)
660 Solvable *s = pool->solvables + p;
661 const char *n, *e, *a;
664 if (p == SYSTEMSOLVABLE)
666 n = pool_id2str(pool, s->name);
667 e = pool_id2str(pool, s->evr);
668 a = pool_id2str(pool, s->arch);
669 str = pool_alloctmpspace(pool, strlen(n) + strlen(e) + strlen(a) + 3);
670 sprintf(str, "%s-%s.%s", n, e, a);
672 return pool_tmpappend(pool, str, "@", 0);
676 char *str2 = pool_tmpappend(pool, str, "@", s->repo->name);
678 if (str2[l] == ' ' || str2[l] == '\t')
682 sprintf(buf, "@#%d", s->repo->repoid);
683 return pool_tmpappend(pool, str, buf, 0);
687 testcase_str2repo(Pool *pool, const char *str)
691 if (str[0] == '#' && (str[1] >= '0' && str[1] <= '9'))
695 for (j = 1; str[j] >= '0' && str[j] <= '9'; j++)
696 repoid = repoid * 10 + (str[j] - '0');
697 if (!str[j] && repoid > 0 && repoid < pool->nrepos)
698 repo = pool_id2repo(pool, repoid);
702 FOR_REPOS(repoid, repo)
707 l = strlen(repo->name);
708 for (i = 0; i < l; i++)
710 int c = repo->name[i];
711 if (c == ' ' || c == '\t')
716 if (i == l && !str[l])
719 if (repoid >= pool->nrepos)
726 testcase_str2solvid(Pool *pool, const char *str)
728 int i, l = strlen(str);
735 if (*str == '@' && !strcmp(str, "@SYSTEM"))
736 return SYSTEMSOLVABLE;
738 for (i = l - 1; i >= 0; i--)
739 if (str[i] == '@' && (repo = testcase_str2repo(pool, str + i + 1)) != 0)
744 /* now find the arch (if present) */
746 for (i = repostart - 1; i > 0; i--)
749 arch = pool_strn2id(pool, str + i + 1, repostart - (i + 1), 0);
754 /* now find the name */
755 for (i = repostart - 1; i > 0; i--)
759 Id nid, evrid, p, pp;
760 nid = pool_strn2id(pool, str, i, 0);
763 evrid = pool_strn2id(pool, str + i + 1, repostart - (i + 1), 0);
766 FOR_PROVIDES(p, pp, nid)
768 Solvable *s = pool->solvables + p;
769 if (s->name != nid || s->evr != evrid)
771 if (repo && s->repo != repo)
773 if (arch && s->arch != arch)
783 testcase_job2str(Pool *pool, Id how, Id what)
790 Id select = how & SOLVER_SELECTMASK;
792 for (i = 0; job2str[i].str; i++)
793 if ((how & SOLVER_JOBMASK) == job2str[i].job)
795 jobstr = job2str[i].str ? job2str[i].str : "unknown";
796 if (select == SOLVER_SOLVABLE)
799 pkgstr = testcase_solvid2str(pool, what);
801 else if (select == SOLVER_SOLVABLE_NAME)
804 pkgstr = testcase_dep2str(pool, what);
806 else if (select == SOLVER_SOLVABLE_PROVIDES)
808 selstr = " provides ";
809 pkgstr = testcase_dep2str(pool, what);
811 else if (select == SOLVER_SOLVABLE_ONE_OF)
816 while ((p = pool->whatprovidesdata[what++]) != 0)
818 const char *s = testcase_solvid2str(pool, p);
821 pkgstr = pool_tmpappend(pool, pkgstr, " ", s);
822 pool_freetmpspace(pool, s);
830 else if (select == SOLVER_SOLVABLE_REPO)
832 Repo *repo = pool_id2repo(pool, what);
837 sprintf(buf, "#%d", repo->repoid);
838 pkgstr = pool_tmpjoin(pool, buf, 0, 0);
841 pkgstr = pool_tmpjoin(pool, repo->name, 0, 0);
843 else if (select == SOLVER_SOLVABLE_ALL)
850 selstr = " unknown ";
853 ret = pool_tmpjoin(pool, jobstr, selstr, pkgstr);
855 ret = pool_tmpappend(pool, ret, " ", 0);
856 for (i = 0; jobflags2str[i].str; i++)
857 if ((how & jobflags2str[i].flag) != 0)
858 ret = pool_tmpappend(pool, ret, ",", jobflags2str[i].str);
864 ret = pool_tmpappend(pool, ret, "]", 0);
870 str2selflags(Pool *pool, char *s) /* modifies the string! */
875 char *se = strchr(s, ',');
878 for (i = 0; selflags2str[i].str; i++)
879 if (!strcmp(s, selflags2str[i].str))
881 selflags |= selflags2str[i].flag;
884 if (!selflags2str[i].str)
885 pool_debug(pool, SOLV_ERROR, "str2job: unknown selection flag '%s'\n", s);
892 str2jobflags(Pool *pool, char *s) /* modifies the string */
897 char *se = strchr(s, ',');
900 for (i = 0; jobflags2str[i].str; i++)
901 if (!strcmp(s, jobflags2str[i].str))
903 jobflags |= jobflags2str[i].flag;
906 if (!jobflags2str[i].str)
907 pool_debug(pool, SOLV_ERROR, "str2job: unknown job flag '%s'\n", s);
914 testcase_str2job(Pool *pool, const char *str, Id *whatp)
924 /* so we can patch it */
925 s = pool_tmpjoin(pool, str, 0, 0);
926 /* split it in pieces */
929 while (*s == ' ' || *s == '\t')
933 pieces = solv_extend(pieces, npieces, 1, sizeof(*pieces), 7);
934 pieces[npieces++] = s;
935 while (*s && *s != ' ' && *s != '\t')
942 pool_debug(pool, SOLV_ERROR, "str2job: bad line '%s'\n", str);
947 for (i = 0; job2str[i].str; i++)
948 if (!strcmp(pieces[0], job2str[i].str))
952 pool_debug(pool, SOLV_ERROR, "str2job: unknown job '%s'\n", str);
956 job = job2str[i].job;
960 char *flags = pieces[npieces - 1];
961 if (*flags == '[' && flags[strlen(flags) - 1] == ']')
965 flags[strlen(flags) - 1] = 0;
966 job |= str2jobflags(pool, flags);
969 if (!strcmp(pieces[1], "pkg"))
973 pool_debug(pool, SOLV_ERROR, "str2job: bad pkg selector in '%s'\n", str);
977 job |= SOLVER_SOLVABLE;
978 what = testcase_str2solvid(pool, pieces[2]);
981 pool_debug(pool, SOLV_ERROR, "str2job: unknown package '%s'\n", pieces[2]);
986 else if (!strcmp(pieces[1], "name") || !strcmp(pieces[1], "provides"))
988 /* join em again for dep2str... */
990 for (sp = pieces[2]; sp < pieces[npieces - 1]; sp++)
994 if (pieces[1][0] == 'p' && strncmp(pieces[2], "namespace:", 10) == 0)
996 char *spe = strchr(pieces[2], '(');
997 int l = strlen(pieces[2]);
998 if (spe && pieces[2][l - 1] == ')')
1000 /* special namespace provides */
1001 if (strcmp(spe, "(<NULL>)") != 0)
1003 pieces[2][l - 1] = 0;
1004 what = testcase_str2dep(pool, spe + 1);
1005 pieces[2][l - 1] = ')';
1007 what = pool_rel2id(pool, pool_strn2id(pool, pieces[2], spe - pieces[2], 1), what, REL_NAMESPACE, 1);
1011 what = testcase_str2dep(pool, pieces[2]);
1012 if (pieces[1][0] == 'n')
1013 job |= SOLVER_SOLVABLE_NAME;
1015 job |= SOLVER_SOLVABLE_PROVIDES;
1017 else if (!strcmp(pieces[1], "oneof"))
1020 job |= SOLVER_SOLVABLE_ONE_OF;
1022 if (npieces > 3 && strcmp(pieces[2], "nothing") != 0)
1024 for (i = 2; i < npieces; i++)
1026 Id p = testcase_str2solvid(pool, pieces[i]);
1029 pool_debug(pool, SOLV_ERROR, "str2job: unknown package '%s'\n", pieces[i]);
1037 what = pool_queuetowhatprovides(pool, &q);
1040 else if (!strcmp(pieces[1], "repo"))
1045 pool_debug(pool, SOLV_ERROR, "str2job: bad line '%s'\n", str);
1049 repo = testcase_str2repo(pool, pieces[2]);
1052 pool_debug(pool, SOLV_ERROR, "str2job: unknown repo '%s'\n", pieces[2]);
1056 job |= SOLVER_SOLVABLE_REPO;
1057 what = repo->repoid;
1059 else if (!strcmp(pieces[1], "all"))
1061 if (npieces != 3 && strcmp(pieces[2], "packages") != 0)
1063 pool_debug(pool, SOLV_ERROR, "str2job: bad line '%s'\n", str);
1067 job |= SOLVER_SOLVABLE_ALL;
1072 pool_debug(pool, SOLV_ERROR, "str2job: unknown selection in '%s'\n", str);
1082 addselectionjob(Pool *pool, char **pieces, int npieces, Queue *jobqueue)
1089 for (i = 0; job2str[i].str; i++)
1090 if (!strcmp(pieces[0], job2str[i].str))
1092 if (!job2str[i].str)
1094 pool_debug(pool, SOLV_ERROR, "selstr2job: unknown job '%s'\n", pieces[0]);
1097 job = job2str[i].job;
1100 char *flags = pieces[npieces - 1];
1101 if (*flags == '[' && flags[strlen(flags) - 1] == ']')
1105 flags[strlen(flags) - 1] = 0;
1106 job |= str2jobflags(pool, flags);
1111 pool_debug(pool, SOLV_ERROR, "selstr2job: no selection flags\n");
1114 selflags = str2selflags(pool, pieces[3]);
1116 r = selection_make(pool, &sel, pieces[2], selflags);
1117 for (i = 0; i < sel.count; i += 2)
1118 queue_push2(jobqueue, job | sel.elements[i], sel.elements[i + 1]);
1124 writedeps(Repo *repo, FILE *fp, const char *tag, Id key, Solvable *s, Offset off)
1126 Pool *pool = repo->pool;
1133 dp = repo->idarraydata + off;
1134 while ((id = *dp++) != 0)
1136 if (key == SOLVABLE_REQUIRES && id == SOLVABLE_PREREQMARKER)
1139 fprintf(fp, "-%s\n", tag);
1144 if (key == SOLVABLE_PROVIDES && id == SOLVABLE_FILEMARKER)
1146 idstr = testcase_dep2str(pool, id);
1149 fprintf(fp, "+%s\n", tag);
1152 fprintf(fp, "%s\n", idstr);
1155 fprintf(fp, "-%s\n", tag);
1159 writefilelist(Repo *repo, FILE *fp, const char *tag, Solvable *s)
1161 Pool *pool = repo->pool;
1165 dataiterator_init(&di, pool, repo, s - pool->solvables, SOLVABLE_FILELIST, 0, 0);
1166 while (dataiterator_step(&di))
1168 const char *s = repodata_dir2str(di.data, di.kv.id, di.kv.str);
1171 fprintf(fp, "+%s\n", tag);
1174 fprintf(fp, "%s\n", s);
1177 fprintf(fp, "-%s\n", tag);
1178 dataiterator_free(&di);
1182 testcase_write_testtags(Repo *repo, FILE *fp)
1184 Pool *pool = repo->pool;
1190 const char *release;
1194 fprintf(fp, "=Ver: 3.0\n");
1195 FOR_REPO_SOLVABLES(repo, p, s)
1197 name = pool_id2str(pool, s->name);
1198 evr = pool_id2str(pool, s->evr);
1199 arch = pool_id2str(pool, s->arch);
1200 release = strrchr(evr, '-');
1202 release = evr + strlen(evr);
1203 fprintf(fp, "=Pkg: %s %.*s %s %s\n", name, (int)(release - evr), evr, *release && release[1] ? release + 1 : "-", arch);
1204 tmp = solvable_lookup_str(s, SOLVABLE_SUMMARY);
1206 fprintf(fp, "=Sum: %s\n", tmp);
1207 writedeps(repo, fp, "Req:", SOLVABLE_REQUIRES, s, s->requires);
1208 writedeps(repo, fp, "Prv:", SOLVABLE_PROVIDES, s, s->provides);
1209 writedeps(repo, fp, "Obs:", SOLVABLE_OBSOLETES, s, s->obsoletes);
1210 writedeps(repo, fp, "Con:", SOLVABLE_CONFLICTS, s, s->conflicts);
1211 writedeps(repo, fp, "Rec:", SOLVABLE_RECOMMENDS, s, s->recommends);
1212 writedeps(repo, fp, "Sup:", SOLVABLE_SUPPLEMENTS, s, s->supplements);
1213 writedeps(repo, fp, "Sug:", SOLVABLE_SUGGESTS, s, s->suggests);
1214 writedeps(repo, fp, "Enh:", SOLVABLE_ENHANCES, s, s->enhances);
1216 fprintf(fp, "=Vnd: %s\n", pool_id2str(pool, s->vendor));
1217 ti = solvable_lookup_num(s, SOLVABLE_BUILDTIME, 0);
1219 fprintf(fp, "=Tim: %u\n", ti);
1220 writefilelist(repo, fp, "Fls:", s);
1225 static inline Offset
1226 adddep(Repo *repo, Offset olddeps, char *str, Id marker)
1228 Id id = *str == '/' ? pool_str2id(repo->pool, str, 1) : testcase_str2dep(repo->pool, str);
1229 return repo_addid_dep(repo, olddeps, id, marker);
1233 finish_v2_solvable(Pool *pool, Repodata *data, Solvable *s, char *filelist, int nfilelist)
1239 for (l = 0; l < nfilelist; l += strlen(filelist + l) + 1)
1241 char *p = strrchr(filelist + l, '/');
1245 did = repodata_str2dir(data, filelist + l, 1);
1248 did = repodata_str2dir(data, "/", 1);
1249 repodata_add_dirstr(data, s - pool->solvables, SOLVABLE_FILELIST, did, p);
1252 s->supplements = repo_fix_supplements(s->repo, s->provides, s->supplements, 0);
1253 s->conflicts = repo_fix_conflicts(s->repo, s->conflicts);
1256 /* stripped down version of susetags parser used for testcases */
1258 testcase_add_testtags(Repo *repo, FILE *fp, int flags)
1260 Pool *pool = repo->pool;
1272 int tagsversion = 0;
1273 int addselfprovides = 1; /* for compat reasons */
1275 data = repo_add_repodata(repo, flags);
1280 line = solv_malloc(aline);
1284 if (linep - line + 16 > aline)
1286 aline = linep - line;
1287 line = solv_realloc(line, aline + 512);
1288 linep = line + aline;
1291 if (!fgets(linep, aline - (linep - line), fp))
1293 linep += strlen(linep);
1294 if (linep == line || linep[-1] != '\n')
1297 linep = line + intag;
1300 if (line[intag] == '-' && !strncmp(line + 1, line + intag + 1, intag - 2))
1307 else if (line[0] == '+' && line[1] && line[1] != ':')
1309 char *tagend = strchr(line, ':');
1314 intag = tagend + 2 - line;
1315 linep = line + intag;
1318 if (*line != '=' || !line[1] || !line[2] || !line[3] || line[4] != ':')
1320 tag = line[1] << 16 | line[2] << 8 | line[3];
1323 case 'V' << 16 | 'e' << 8 | 'r':
1324 tagsversion = atoi(line + 6);
1325 addselfprovides = tagsversion < 3 || strstr(line + 6, "addselfprovides") != 0;
1327 case 'P' << 16 | 'k' << 8 | 'g':
1330 if (tagsversion == 2)
1331 finish_v2_solvable(pool, data, s, filelist, nfilelist);
1332 if (addselfprovides && s->name && s->arch != ARCH_SRC && s->arch != ARCH_NOSRC)
1333 s->provides = repo_addid_dep(s->repo, s->provides, pool_rel2id(pool, s->name, s->evr, REL_EQ, 1), 0);
1336 if (split(line + 5, sp, 5) != 4)
1338 s = pool_id2solvable(pool, repo_add_solvable(repo));
1339 s->name = pool_str2id(pool, sp[0], 1);
1340 /* join back version and release */
1341 if (sp[2] && !(sp[2][0] == '-' && !sp[2][1]))
1343 s->evr = makeevr(pool, sp[1]);
1344 s->arch = pool_str2id(pool, sp[3], 1);
1346 case 'S' << 16 | 'u' << 8 | 'm':
1347 repodata_set_str(data, s - pool->solvables, SOLVABLE_SUMMARY, line + 6);
1349 case 'V' << 16 | 'n' << 8 | 'd':
1350 s->vendor = pool_str2id(pool, line + 6, 1);
1352 case 'T' << 16 | 'i' << 8 | 'm':
1355 repodata_set_num(data, s - pool->solvables, SOLVABLE_BUILDTIME, t);
1357 case 'R' << 16 | 'e' << 8 | 'q':
1358 s->requires = adddep(repo, s->requires, line + 6, -SOLVABLE_PREREQMARKER);
1360 case 'P' << 16 | 'r' << 8 | 'q':
1361 s->requires = adddep(repo, s->requires, line + 6, SOLVABLE_PREREQMARKER);
1363 case 'P' << 16 | 'r' << 8 | 'v':
1364 /* version 2 had the file list at the end of the provides */
1365 if (tagsversion == 2)
1369 int l = strlen(line + 6) + 1;
1370 if (nfilelist + l > afilelist)
1372 afilelist = nfilelist + l + 512;
1373 filelist = solv_realloc(filelist, afilelist);
1375 memcpy(filelist + nfilelist, line + 6, l);
1382 for (l = 0; l < nfilelist; l += strlen(filelist + l) + 1)
1383 s->provides = repo_addid_dep(repo, s->provides, pool_str2id(pool, filelist + l, 1), 0);
1387 s->provides = adddep(repo, s->provides, line + 6, 0);
1389 case 'F' << 16 | 'l' << 8 | 's':
1391 char *p = strrchr(line + 6, '/');
1396 did = repodata_str2dir(data, line + 6, 1);
1398 did = repodata_str2dir(data, "/", 1);
1399 repodata_add_dirstr(data, s - pool->solvables, SOLVABLE_FILELIST, did, p);
1402 case 'O' << 16 | 'b' << 8 | 's':
1403 s->obsoletes = adddep(repo, s->obsoletes, line + 6, 0);
1405 case 'C' << 16 | 'o' << 8 | 'n':
1406 s->conflicts = adddep(repo, s->conflicts, line + 6, 0);
1408 case 'R' << 16 | 'e' << 8 | 'c':
1409 s->recommends = adddep(repo, s->recommends, line + 6, 0);
1411 case 'S' << 16 | 'u' << 8 | 'p':
1412 s->supplements = adddep(repo, s->supplements, line + 6, 0);
1414 case 'S' << 16 | 'u' << 8 | 'g':
1415 s->suggests = adddep(repo, s->suggests, line + 6, 0);
1417 case 'E' << 16 | 'n' << 8 | 'h':
1418 s->enhances = adddep(repo, s->enhances, line + 6, 0);
1426 if (tagsversion == 2)
1427 finish_v2_solvable(pool, data, s, filelist, nfilelist);
1428 if (addselfprovides && s->name && s->arch != ARCH_SRC && s->arch != ARCH_NOSRC)
1429 s->provides = repo_addid_dep(s->repo, s->provides, pool_rel2id(pool, s->name, s->evr, REL_EQ, 1), 0);
1432 solv_free(filelist);
1433 repodata_free_dircache(data);
1434 if (!(flags & REPO_NO_INTERNALIZE))
1435 repodata_internalize(data);
1440 testcase_getpoolflags(Pool *pool)
1442 const char *str = 0;
1444 for (i = 0; poolflags2str[i].str; i++)
1446 v = pool_get_flag(pool, poolflags2str[i].flag);
1447 if (v == poolflags2str[i].def)
1449 str = pool_tmpappend(pool, str, v ? " " : " !", poolflags2str[i].str);
1451 return str ? str + 1 : "";
1455 testcase_setpoolflags(Pool *pool, const char *str)
1457 const char *p = str, *s;
1461 while (*p == ' ' || *p == '\t' || *p == ',')
1472 while (*p && *p != ' ' && *p != '\t' && *p != ',')
1474 for (i = 0; poolflags2str[i].str; i++)
1475 if (!strncmp(poolflags2str[i].str, s, p - s) && poolflags2str[i].str[p - s] == 0)
1477 if (!poolflags2str[i].str)
1479 pool_debug(pool, SOLV_ERROR, "setpoolflags: unknown flag '%.*s'\n", (int)(p - s), s);
1482 pool_set_flag(pool, poolflags2str[i].flag, v);
1488 testcase_resetpoolflags(Pool *pool)
1491 for (i = 0; poolflags2str[i].str; i++)
1492 pool_set_flag(pool, poolflags2str[i].flag, poolflags2str[i].def);
1496 testcase_getsolverflags(Solver *solv)
1498 Pool *pool = solv->pool;
1499 const char *str = 0;
1501 for (i = 0; solverflags2str[i].str; i++)
1503 v = solver_get_flag(solv, solverflags2str[i].flag);
1504 if (v == solverflags2str[i].def)
1506 str = pool_tmpappend(pool, str, v ? " " : " !", solverflags2str[i].str);
1508 return str ? str + 1 : "";
1512 testcase_setsolverflags(Solver *solv, const char *str)
1514 const char *p = str, *s;
1518 while (*p == ' ' || *p == '\t' || *p == ',')
1529 while (*p && *p != ' ' && *p != '\t' && *p != ',')
1531 for (i = 0; solverflags2str[i].str; i++)
1532 if (!strncmp(solverflags2str[i].str, s, p - s) && solverflags2str[i].str[p - s] == 0)
1534 if (!solverflags2str[i].str)
1536 pool_debug(solv->pool, SOLV_ERROR, "setsolverflags: unknown flag '%.*s'\n", (int)(p - s), s);
1539 solver_set_flag(solv, solverflags2str[i].flag, v);
1545 testcase_resetsolverflags(Solver *solv)
1548 for (i = 0; solverflags2str[i].str; i++)
1549 solver_set_flag(solv, solverflags2str[i].flag, solverflags2str[i].def);
1553 testcase_ruleid(Solver *solv, Id rid)
1559 const unsigned char *md5;
1565 solver_ruleliterals(solv, rid, &q);
1566 for (i = 0; i < q.count; i++)
1568 Id p = q.elements[i];
1569 s = testcase_solvid2str(solv->pool, p > 0 ? p : -p);
1571 s = pool_tmpjoin(solv->pool, "!", s, 0);
1572 strqueue_push(&sq, s);
1575 strqueue_sort_u(&sq);
1576 chk = solv_chksum_create(REPOKEY_TYPE_MD5);
1577 for (i = 0; i < sq.nstr; i++)
1578 solv_chksum_add(chk, sq.str[i], strlen(sq.str[i]) + 1);
1579 md5 = solv_chksum_get(chk, &md5l);
1580 s = pool_bin2hex(solv->pool, md5, md5l);
1581 chk = solv_chksum_free(chk, 0);
1587 testcase_problemid(Solver *solv, Id problem)
1592 const unsigned char *md5;
1596 /* we build a hash of all rules that define the problem */
1599 solver_findallproblemrules(solv, problem, &q);
1600 for (i = 0; i < q.count; i++)
1601 strqueue_push(&sq, testcase_ruleid(solv, q.elements[i]));
1603 strqueue_sort_u(&sq);
1604 chk = solv_chksum_create(REPOKEY_TYPE_MD5);
1605 for (i = 0; i < sq.nstr; i++)
1606 solv_chksum_add(chk, sq.str[i], strlen(sq.str[i]) + 1);
1607 md5 = solv_chksum_get(chk, &md5l);
1608 s = pool_bin2hex(solv->pool, md5, 4);
1609 chk = solv_chksum_free(chk, 0);
1615 testcase_solutionid(Solver *solv, Id problem, Id solution)
1619 const unsigned char *md5;
1623 intid = solver_solutionelement_internalid(solv, problem, solution);
1624 /* internal stuff! handle with care! */
1628 s = testcase_job2str(solv->pool, solv->job.elements[-intid - 1], solv->job.elements[-intid]);
1633 s = testcase_ruleid(solv, intid);
1635 chk = solv_chksum_create(REPOKEY_TYPE_MD5);
1636 solv_chksum_add(chk, s, strlen(s) + 1);
1637 md5 = solv_chksum_get(chk, &md5l);
1638 s = pool_bin2hex(solv->pool, md5, 4);
1639 chk = solv_chksum_free(chk, 0);
1644 testcase_alternativeid(Solver *solv, int type, Id id, Id from)
1647 Pool *pool = solv->pool;
1649 const unsigned char *md5;
1651 chk = solv_chksum_create(REPOKEY_TYPE_MD5);
1652 if (type == SOLVER_ALTERNATIVE_TYPE_RECOMMENDS)
1654 s = testcase_solvid2str(pool, from);
1655 solv_chksum_add(chk, s, strlen(s) + 1);
1656 s = testcase_dep2str(pool, id);
1657 solv_chksum_add(chk, s, strlen(s) + 1);
1659 else if (type == SOLVER_ALTERNATIVE_TYPE_RULE)
1661 s = testcase_ruleid(solv, id);
1662 solv_chksum_add(chk, s, strlen(s) + 1);
1664 md5 = solv_chksum_get(chk, &md5l);
1665 s = pool_bin2hex(pool, md5, 4);
1666 chk = solv_chksum_free(chk, 0);
1670 static struct class2str {
1674 { SOLVER_TRANSACTION_ERASE, "erase" },
1675 { SOLVER_TRANSACTION_INSTALL, "install" },
1676 { SOLVER_TRANSACTION_REINSTALLED, "reinstall" },
1677 { SOLVER_TRANSACTION_DOWNGRADED, "downgrade" },
1678 { SOLVER_TRANSACTION_CHANGED, "change" },
1679 { SOLVER_TRANSACTION_UPGRADED, "upgrade" },
1680 { SOLVER_TRANSACTION_OBSOLETED, "obsolete" },
1681 { SOLVER_TRANSACTION_MULTIINSTALL, "multiinstall" },
1682 { SOLVER_TRANSACTION_MULTIREINSTALL, "multireinstall" },
1687 dump_genid(Pool *pool, Strqueue *sq, Id id, int cnt)
1695 Reldep *rd = GETRELDEP(pool, id);
1696 for (op = oplist; op->flags; op++)
1697 if (rd->flags == op->flags)
1699 cnt = dump_genid(pool, sq, rd->name, cnt);
1700 cnt = dump_genid(pool, sq, rd->evr, cnt);
1701 sprintf(cntbuf, "genid %2d: genid ", cnt++);
1702 s = pool_tmpjoin(pool, cntbuf, "op ", op->flags ? op->opname : "unknown");
1706 sprintf(cntbuf, "genid %2d: genid ", cnt++);
1707 s = pool_tmpjoin(pool, cntbuf, id ? "lit " : "null", id ? pool_id2str(pool, id) : 0);
1709 strqueue_push(sq, s);
1714 testcase_solverresult(Solver *solv, int resultflags)
1716 Pool *pool = solv->pool;
1724 if ((resultflags & TESTCASE_RESULT_TRANSACTION) != 0)
1726 Transaction *trans = solver_create_transaction(solv);
1730 for (i = 0; class2str[i].str; i++)
1733 transaction_classify_pkgs(trans, SOLVER_TRANSACTION_KEEP_PSEUDO, class2str[i].class, 0, 0, &q);
1734 for (j = 0; j < q.count; j++)
1738 if (pool->installed && pool->solvables[p].repo == pool->installed)
1739 op = transaction_obs_pkg(trans, p);
1740 s = pool_tmpjoin(pool, class2str[i].str, " ", testcase_solvid2str(pool, p));
1742 s = pool_tmpjoin(pool, s, " ", testcase_solvid2str(pool, op));
1743 strqueue_push(&sq, s);
1747 transaction_free(trans);
1749 if ((resultflags & TESTCASE_RESULT_PROBLEMS) != 0)
1751 char *probprefix, *solprefix;
1752 int problem, solution, element;
1755 pcnt = solver_problem_count(solv);
1756 for (problem = 1; problem <= pcnt; problem++)
1758 Id rid, from, to, dep;
1759 SolverRuleinfo rinfo;
1760 rid = solver_findproblemrule(solv, problem);
1761 s = testcase_problemid(solv, problem);
1762 probprefix = solv_dupjoin("problem ", s, 0);
1763 rinfo = solver_ruleinfo(solv, rid, &from, &to, &dep);
1764 s = pool_tmpjoin(pool, probprefix, " info ", solver_problemruleinfo2str(solv, rinfo, from, to, dep));
1765 strqueue_push(&sq, s);
1766 scnt = solver_solution_count(solv, problem);
1767 for (solution = 1; solution <= scnt; solution++)
1769 s = testcase_solutionid(solv, problem, solution);
1770 solprefix = solv_dupjoin(probprefix, " solution ", s);
1772 while ((element = solver_next_solutionelement(solv, problem, solution, element, &p, &op)) != 0)
1774 if (p == SOLVER_SOLUTION_JOB)
1775 s = pool_tmpjoin(pool, solprefix, " deljob ", testcase_job2str(pool, solv->job.elements[op - 1], solv->job.elements[op]));
1776 else if (p > 0 && op == 0)
1777 s = pool_tmpjoin(pool, solprefix, " erase ", testcase_solvid2str(pool, p));
1778 else if (p > 0 && op > 0)
1780 s = pool_tmpjoin(pool, solprefix, " replace ", testcase_solvid2str(pool, p));
1781 s = pool_tmpappend(pool, s, " ", testcase_solvid2str(pool, op));
1783 else if (p < 0 && op > 0)
1784 s = pool_tmpjoin(pool, solprefix, " allow ", testcase_solvid2str(pool, op));
1786 s = pool_tmpjoin(pool, solprefix, " unknown", 0);
1787 strqueue_push(&sq, s);
1789 solv_free(solprefix);
1791 solv_free(probprefix);
1795 if ((resultflags & TESTCASE_RESULT_ORPHANED) != 0)
1800 solver_get_orphaned(solv, &q);
1801 for (i = 0; i < q.count; i++)
1803 s = pool_tmpjoin(pool, "orphaned ", testcase_solvid2str(pool, q.elements[i]), 0);
1804 strqueue_push(&sq, s);
1809 if ((resultflags & TESTCASE_RESULT_RECOMMENDED) != 0)
1815 solver_get_recommendations(solv, &qr, &qs, 0);
1816 for (i = 0; i < qr.count; i++)
1818 s = pool_tmpjoin(pool, "recommended ", testcase_solvid2str(pool, qr.elements[i]), 0);
1819 strqueue_push(&sq, s);
1821 for (i = 0; i < qs.count; i++)
1823 s = pool_tmpjoin(pool, "suggested ", testcase_solvid2str(pool, qs.elements[i]), 0);
1824 strqueue_push(&sq, s);
1830 if ((resultflags & TESTCASE_RESULT_UNNEEDED) != 0)
1836 solver_get_unneeded(solv, &q, 0);
1837 solver_get_unneeded(solv, &qf, 1);
1838 for (i = j = 0; i < q.count; i++)
1840 /* we rely on qf containing a subset of q in the same order */
1841 if (j < qf.count && q.elements[i] == qf.elements[j])
1843 s = pool_tmpjoin(pool, "unneeded_filtered ", testcase_solvid2str(pool, q.elements[i]), 0);
1847 s = pool_tmpjoin(pool, "unneeded ", testcase_solvid2str(pool, q.elements[i]), 0);
1848 strqueue_push(&sq, s);
1853 if ((resultflags & TESTCASE_RESULT_ALTERNATIVES) != 0)
1861 cnt = solver_alternatives_count(solv);
1862 for (alternative = 1; alternative <= cnt; alternative++)
1864 Id id, from, chosen;
1866 int type = solver_get_alternative(solv, alternative, &id, &from, &chosen, &q, 0);
1867 altprefix = solv_dupjoin("alternative ", testcase_alternativeid(solv, type, id, from), " ");
1869 if (type == SOLVER_ALTERNATIVE_TYPE_RECOMMENDS)
1871 char *s = pool_tmpjoin(pool, altprefix, num, testcase_solvid2str(pool, from));
1872 s = pool_tmpappend(pool, s, " recommends ", testcase_dep2str(pool, id));
1873 strqueue_push(&sq, s);
1875 else if (type == SOLVER_ALTERNATIVE_TYPE_RULE)
1877 /* map choice rules back to pkg rules */
1878 if (solver_ruleclass(solv, id) == SOLVER_RULE_CHOICE)
1879 id = solver_rule2pkgrule(solv, id);
1880 solver_allruleinfos(solv, id, &rq);
1881 for (i = 0; i < rq.count; i += 4)
1883 int rtype = rq.elements[i];
1884 if ((rtype & SOLVER_RULE_TYPEMASK) == SOLVER_RULE_JOB)
1886 const char *js = testcase_job2str(pool, rq.elements[i + 2], rq.elements[i + 3]);
1887 char *s = pool_tmpjoin(pool, altprefix, num, " job ");
1888 s = pool_tmpappend(pool, s, js, 0);
1889 strqueue_push(&sq, s);
1891 else if (rtype == SOLVER_RULE_PKG_REQUIRES)
1893 char *s = pool_tmpjoin(pool, altprefix, num, testcase_solvid2str(pool, rq.elements[i + 1]));
1894 s = pool_tmpappend(pool, s, " requires ", testcase_dep2str(pool, rq.elements[i + 3]));
1895 strqueue_push(&sq, s);
1899 for (i = 0; i < q.count; i++)
1901 Id p = q.elements[i];
1903 num[0] = '0' + (i + 1) / 10;
1904 num[1] = '0' + (i + 1) % 10;
1906 s = pool_tmpjoin(pool, altprefix, num, "+ ");
1908 s = pool_tmpjoin(pool, altprefix, num, "- ");
1910 s = pool_tmpjoin(pool, altprefix, num, " ");
1911 s = pool_tmpappend(pool, s, testcase_solvid2str(pool, p < 0 ? -p : p), 0);
1912 strqueue_push(&sq, s);
1914 solv_free(altprefix);
1919 if ((resultflags & TESTCASE_RESULT_RULES) != 0)
1921 /* dump all rules */
1923 SolverRuleinfo rclass;
1928 for (rid = 1; (rclass = solver_ruleclass(solv, rid)) != SOLVER_RULE_UNKNOWN; rid++)
1933 case SOLVER_RULE_PKG:
1936 case SOLVER_RULE_UPDATE:
1939 case SOLVER_RULE_FEATURE:
1940 prefix = "feature ";
1942 case SOLVER_RULE_JOB:
1945 case SOLVER_RULE_DISTUPGRADE:
1946 prefix = "distupgrade ";
1948 case SOLVER_RULE_INFARCH:
1949 prefix = "infarch ";
1951 case SOLVER_RULE_CHOICE:
1954 case SOLVER_RULE_LEARNT:
1957 case SOLVER_RULE_BEST:
1960 case SOLVER_RULE_YUMOBS:
1964 prefix = "unknown ";
1967 prefix = solv_dupjoin("rule ", prefix, testcase_ruleid(solv, rid));
1968 solver_ruleliterals(solv, rid, &q);
1969 if (rclass == SOLVER_RULE_FEATURE && q.count == 1 && q.elements[0] == -SYSTEMSOLVABLE)
1971 for (i = 0; i < q.count; i++)
1973 Id p = q.elements[i];
1976 s = pool_tmpjoin(pool, prefix, " -", testcase_solvid2str(pool, -p));
1978 s = pool_tmpjoin(pool, prefix, " ", testcase_solvid2str(pool, p));
1979 strqueue_push(&sq, s);
1985 if ((resultflags & TESTCASE_RESULT_GENID) != 0)
1987 for (i = 0 ; i < solv->job.count; i += 2)
1990 if (solv->job.elements[i] != (SOLVER_NOOP | SOLVER_SOLVABLE_PROVIDES))
1992 id = solv->job.elements[i + 1];
1993 s = testcase_dep2str(pool, id);
1994 strqueue_push(&sq, pool_tmpjoin(pool, "genid dep ", s, 0));
1995 if ((id2 = testcase_str2dep(pool, s)) != id)
1997 s = pool_tmpjoin(pool, "genid roundtrip error: ", testcase_dep2str(pool, id2), 0);
1998 strqueue_push(&sq, s);
2000 dump_genid(pool, &sq, id, 1);
2004 result = strqueue_join(&sq);
2011 testcase_write(Solver *solv, const char *dir, int resultflags, const char *testcasename, const char *resultname)
2013 Pool *pool = solv->pool;
2024 testcasename = "testcase.t";
2026 resultname = "solver.result";
2028 if (mkdir(dir, 0777) && errno != EEXIST)
2030 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: could not create directory '%s'\n", dir);
2034 FOR_REPOS(repoid, repo)
2036 const char *name = testcase_repoid2str(pool, repoid);
2038 if (repo->subpriority)
2039 sprintf(priobuf, "%d.%d", repo->priority, repo->subpriority);
2041 sprintf(priobuf, "%d", repo->priority);
2042 out = pool_tmpjoin(pool, name, ".repo", ".gz");
2043 cmd = pool_tmpjoin(pool, "repo ", name, " ");
2044 cmd = pool_tmpappend(pool, cmd, priobuf, " ");
2045 cmd = pool_tmpappend(pool, cmd, "testtags ", out);
2046 strqueue_push(&sq, cmd);
2047 out = pool_tmpjoin(pool, dir, "/", out);
2048 if (!(fp = solv_xfopen(out, "w")))
2050 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: could not open '%s' for writing\n", out);
2054 testcase_write_testtags(repo, fp);
2057 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: write error\n");
2062 /* hmm, this is not optimal... we currently search for the lowest score */
2064 arch = pool->solvables[SYSTEMSOLVABLE].arch;
2065 for (i = 0; i < pool->lastarch; i++)
2067 if (pool->id2arch[i] == 1 && !lowscore)
2069 if (pool->id2arch[i] > 0x10000 && (!lowscore || pool->id2arch[i] < lowscore))
2072 lowscore = pool->id2arch[i];
2075 cmd = pool_tmpjoin(pool, "system ", pool->lastarch ? pool_id2str(pool, arch) : "unset", 0);
2076 for (i = 0; disttype2str[i].str != 0; i++)
2077 if (pool->disttype == disttype2str[i].type)
2079 pool_tmpappend(pool, cmd, " ", disttype2str[i].str ? disttype2str[i].str : "unknown");
2080 if (pool->installed)
2081 cmd = pool_tmpappend(pool, cmd, " ", testcase_repoid2str(pool, pool->installed->repoid));
2082 strqueue_push(&sq, cmd);
2083 s = testcase_getpoolflags(solv->pool);
2086 cmd = pool_tmpjoin(pool, "poolflags ", s, 0);
2087 strqueue_push(&sq, cmd);
2090 if (pool->vendorclasses)
2093 for (i = 0; pool->vendorclasses[i]; i++)
2095 cmd = pool_tmpappend(pool, cmd ? cmd : "vendorclass", " ", pool->vendorclasses[i]);
2096 if (!pool->vendorclasses[i + 1])
2098 strqueue_push(&sq, cmd);
2105 /* dump disabled packages (must come before the namespace/job lines) */
2106 if (pool->considered)
2109 FOR_POOL_SOLVABLES(p)
2110 if (!MAPTST(pool->considered, p))
2112 cmd = pool_tmpjoin(pool, "disable pkg ", testcase_solvid2str(pool, p), 0);
2113 strqueue_push(&sq, cmd);
2117 s = testcase_getsolverflags(solv);
2120 cmd = pool_tmpjoin(pool, "solverflags ", s, 0);
2121 strqueue_push(&sq, cmd);
2124 /* now dump all the ns callback values we know */
2125 if (pool->nscallback)
2129 for (rid = 1; rid < pool->nrels; rid++)
2131 Reldep *rd = pool->rels + rid;
2132 if (rd->flags != REL_NAMESPACE || rd->name == NAMESPACE_OTHERPROVIDERS)
2134 /* evaluate all namespace ids, skip empty results */
2135 d = pool_whatprovides(pool, MAKERELDEP(rid));
2136 if (!d || !pool->whatprovidesdata[d])
2138 cmd = pool_tmpjoin(pool, "namespace ", pool_id2str(pool, rd->name), "(");
2139 cmd = pool_tmpappend(pool, cmd, pool_id2str(pool, rd->evr), ")");
2140 for (; pool->whatprovidesdata[d]; d++)
2141 cmd = pool_tmpappend(pool, cmd, " ", testcase_solvid2str(pool, pool->whatprovidesdata[d]));
2142 strqueue_push(&sq, cmd);
2146 for (i = 0; i < solv->job.count; i += 2)
2148 cmd = (char *)testcase_job2str(pool, solv->job.elements[i], solv->job.elements[i + 1]);
2149 cmd = pool_tmpjoin(pool, "job ", cmd, 0);
2150 strqueue_push(&sq, cmd);
2157 for (i = 0; resultflags2str[i].str; i++)
2158 if ((resultflags & resultflags2str[i].flag) != 0)
2159 cmd = pool_tmpappend(pool, cmd, cmd ? "," : 0, resultflags2str[i].str);
2160 cmd = pool_tmpjoin(pool, "result ", cmd ? cmd : "?", 0);
2161 cmd = pool_tmpappend(pool, cmd, " ", resultname);
2162 strqueue_push(&sq, cmd);
2163 result = testcase_solverresult(solv, resultflags);
2164 if (!strcmp(resultname, "<inline>"))
2168 strqueue_init(&rsq);
2169 strqueue_split(&rsq, result);
2170 for (i = 0; i < rsq.nstr; i++)
2172 cmd = pool_tmpjoin(pool, "#>", rsq.str[i], 0);
2173 strqueue_push(&sq, cmd);
2175 strqueue_free(&rsq);
2179 out = pool_tmpjoin(pool, dir, "/", resultname);
2180 if (!(fp = fopen(out, "w")))
2182 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: could not open '%s' for writing\n", out);
2187 if (result && *result && fwrite(result, strlen(result), 1, fp) != 1)
2189 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: write error\n");
2197 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: write error\n");
2205 cmd = strqueue_join(&sq);
2206 out = pool_tmpjoin(pool, dir, "/", testcasename);
2207 if (!(fp = fopen(out, "w")))
2209 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: could not open '%s' for writing\n", out);
2213 if (*cmd && fwrite(cmd, strlen(cmd), 1, fp) != 1)
2215 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: write error\n");
2222 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: write error\n");
2232 read_inline_file(FILE *fp, char **bufp, char **bufpp, int *buflp)
2234 char *result = solv_malloc(1024);
2241 if (rp - result + 256 >= resultl)
2243 resultl = rp - result;
2244 result = solv_realloc(result, resultl + 1024);
2245 rp = result + resultl;
2248 if (!fgets(rp, resultl - (rp - result), fp))
2251 if (rl && (rp == result || rp[-1] == '\n'))
2253 if (rl > 1 && rp[0] == '#' && rp[1] == '>')
2255 memmove(rp, rp + 2, rl - 2);
2260 while (rl + 16 > *buflp)
2262 *bufp = solv_realloc(*bufp, *buflp + 512);
2265 memmove(*bufp, rp, rl);
2266 if ((*bufp)[rl - 1] == '\n')
2272 (*bufpp) = *bufp + rl;
2289 char *result = solv_malloc(1024);
2296 if (rp - result + 256 >= resultl)
2298 resultl = rp - result;
2299 result = solv_realloc(result, resultl + 1024);
2300 rp = result + resultl;
2303 rl = fread(rp, 1, resultl - (rp - result), fp);
2315 str2resultflags(Pool *pool, char *s) /* modifies the string! */
2317 int i, resultflags = 0;
2320 char *se = strchr(s, ',');
2323 for (i = 0; resultflags2str[i].str; i++)
2324 if (!strcmp(s, resultflags2str[i].str))
2326 resultflags |= resultflags2str[i].flag;
2329 if (!resultflags2str[i].str)
2330 pool_debug(pool, SOLV_ERROR, "result: unknown flag '%s'\n", s);
2337 testcase_read(Pool *pool, FILE *fp, const char *testcase, Queue *job, char **resultp, int *resultflagsp)
2342 char *testcasedir, *s;
2348 int poolflagsreset = 0;
2349 int missing_features = 0;
2353 if (!fp && !(fp = fopen(testcase, "r")))
2355 pool_debug(pool, SOLV_ERROR, "testcase_read: could not open '%s'\n", testcase);
2358 testcasedir = solv_strdup(testcase);
2359 if ((s = strrchr(testcasedir, '/')) != 0)
2364 buf = solv_malloc(bufl);
2369 if (bufp - buf + 16 > bufl)
2372 buf = solv_realloc(buf, bufl + 512);
2376 if (!fgets(bufp, bufl - (bufp - buf), fp))
2380 if (!l || buf[l - 1] != '\n')
2387 while (*s && (*s == ' ' || *s == '\t'))
2389 if (!*s || *s == '#')
2392 /* split it in pieces */
2395 while (*s == ' ' || *s == '\t')
2399 pieces = solv_extend(pieces, npieces, 1, sizeof(*pieces), 7);
2400 pieces[npieces++] = s;
2401 while (*s && *s != ' ' && *s != '\t')
2406 pieces = solv_extend(pieces, npieces, 1, sizeof(*pieces), 7);
2407 pieces[npieces] = 0;
2408 if (!strcmp(pieces[0], "repo") && npieces >= 4)
2410 Repo *repo = repo_create(pool, pieces[1]);
2416 if (!poolflagsreset)
2419 testcase_resetpoolflags(pool); /* hmm */
2421 if (sscanf(pieces[2], "%d.%d", &prio, &subprio) != 2)
2424 prio = atoi(pieces[2]);
2426 repo->priority = prio;
2427 repo->subpriority = subprio;
2428 if (strcmp(pieces[3], "empty") != 0)
2430 const char *repotype = pool_tmpjoin(pool, pieces[3], 0, 0); /* gets overwritten in <inline> case */
2431 if (!strcmp(pieces[4], "<inline>"))
2433 char *idata = read_inline_file(fp, &buf, &bufp, &bufl);
2435 rfp = solv_xfopen_buf(rdata, &idata, 0, "rf");
2439 rdata = pool_tmpjoin(pool, testcasedir, pieces[4], 0);
2440 rfp = solv_xfopen(rdata, "r");
2444 pool_debug(pool, SOLV_ERROR, "testcase_read: could not open '%s'\n", rdata);
2446 else if (!strcmp(repotype, "testtags"))
2448 testcase_add_testtags(repo, rfp, 0);
2451 else if (!strcmp(repotype, "solv"))
2453 repo_add_solv(repo, rfp, 0);
2457 else if (!strcmp(repotype, "helix"))
2459 extern int repo_add_helix(Repo *repo, FILE *fp, int flags);
2460 repo_add_helix(repo, rfp, 0);
2467 pool_debug(pool, SOLV_ERROR, "testcase_read: unknown repo type for repo '%s'\n", repo->name);
2471 else if (!strcmp(pieces[0], "system") && npieces >= 3)
2475 /* must set the disttype before the arch */
2477 if (strcmp(pieces[2], "*") != 0)
2479 char *dp = pieces[2];
2482 char *dpe = strchr(dp, ',');
2485 for (i = 0; disttype2str[i].str != 0; i++)
2486 if (!strcmp(disttype2str[i].str, dp))
2490 if (disttype2str[i].str)
2492 #ifdef MULTI_SEMANTICS
2493 if (pool->disttype != disttype2str[i].type)
2494 pool_setdisttype(pool, disttype2str[i].type);
2496 if (pool->disttype == disttype2str[i].type)
2503 pool_debug(pool, SOLV_ERROR, "testcase_read: system: could not change disttype to '%s'\n", pieces[2]);
2504 missing_features = 1;
2507 if (strcmp(pieces[1], "unset") == 0)
2508 pool_setarch(pool, 0);
2509 else if (pieces[1][0] == ':')
2510 pool_setarchpolicy(pool, pieces[1] + 1);
2512 pool_setarch(pool, pieces[1]);
2515 Repo *repo = testcase_str2repo(pool, pieces[3]);
2517 pool_debug(pool, SOLV_ERROR, "testcase_read: system: unknown repo '%s'\n", pieces[3]);
2519 pool_set_installed(pool, repo);
2522 else if (!strcmp(pieces[0], "job") && npieces > 1)
2528 pool_addfileprovides(pool);
2529 pool_createwhatprovides(pool);
2532 if (npieces >= 3 && !strcmp(pieces[2], "selection"))
2534 addselectionjob(pool, pieces + 1, npieces - 1, job);
2538 for (sp = pieces[1]; sp < pieces[npieces - 1]; sp++)
2541 how = testcase_str2job(pool, pieces[1], &what);
2542 if (how >= 0 && job)
2543 queue_push2(job, how, what);
2545 else if (!strcmp(pieces[0], "vendorclass") && npieces > 1)
2547 pool_addvendorclass(pool, (const char **)(pieces + 1));
2549 else if (!strcmp(pieces[0], "namespace") && npieces > 1)
2551 int i = strlen(pieces[1]);
2552 s = strchr(pieces[1], '(');
2553 if (!s && pieces[1][i - 1] != ')')
2555 pool_debug(pool, SOLV_ERROR, "testcase_read: bad namespace '%s'\n", pieces[1]);
2563 pieces[1][i - 1] = 0;
2564 name = pool_str2id(pool, pieces[1], 1);
2565 evr = pool_str2id(pool, s + 1, 1);
2567 pieces[1][i - 1] = ')';
2568 id = pool_rel2id(pool, name, evr, REL_NAMESPACE, 1);
2569 for (i = 2; i < npieces; i++)
2570 queue_push(&q, testcase_str2solvid(pool, pieces[i]));
2571 /* now do the callback */
2574 pool_addfileprovides(pool);
2575 pool_createwhatprovides(pool);
2578 pool->whatprovides_rel[GETRELID(id)] = pool_queuetowhatprovides(pool, &q);
2582 else if (!strcmp(pieces[0], "poolflags"))
2585 if (!poolflagsreset)
2588 testcase_resetpoolflags(pool); /* hmm */
2590 for (i = 1; i < npieces; i++)
2591 testcase_setpoolflags(pool, pieces[i]);
2593 else if (!strcmp(pieces[0], "solverflags") && npieces > 1)
2598 solv = solver_create(pool);
2599 testcase_resetsolverflags(solv);
2601 for (i = 1; i < npieces; i++)
2602 testcase_setsolverflags(solv, pieces[i]);
2604 else if (!strcmp(pieces[0], "result") && npieces > 1)
2607 int resultflags = str2resultflags(pool, pieces[1]);
2611 rdata = pool_tmpjoin(pool, testcasedir, pieces[2], 0);
2612 if (!strcmp(pieces[2], "<inline>"))
2613 result = read_inline_file(fp, &buf, &bufp, &bufl);
2616 FILE *rfp = fopen(rdata, "r");
2618 pool_debug(pool, SOLV_ERROR, "testcase_read: could not open '%s'\n", rdata);
2621 result = read_file(rfp);
2631 *resultflagsp = resultflags;
2633 else if (!strcmp(pieces[0], "nextjob") && npieces == 1)
2637 else if (!strcmp(pieces[0], "disable") && npieces == 3)
2640 if (strcmp(pieces[1], "pkg"))
2642 pool_debug(pool, SOLV_ERROR, "testcase_read: bad disable type '%s'\n", pieces[1]);
2646 pool_createwhatprovides(pool);
2648 if (!pool->considered)
2650 pool->considered = solv_calloc(1, sizeof(Map));
2651 map_init(pool->considered, pool->nsolvables);
2652 map_setall(pool->considered);
2654 p = testcase_str2solvid(pool, pieces[2]);
2656 MAPCLR(pool->considered, p);
2658 pool_debug(pool, SOLV_ERROR, "disable: unknown package '%s'\n", pieces[2]);
2660 else if (!strcmp(pieces[0], "feature"))
2663 for (i = 1; i < npieces; i++)
2665 for (j = 0; features[j]; j++)
2666 if (!strcmp(pieces[i], features[j]))
2670 pool_debug(pool, SOLV_ERROR, "testcase_read: missing feature '%s'\n", pieces[i]);
2674 if (missing_features)
2677 else if (!strcmp(pieces[0], "genid") && npieces > 1)
2684 for (sp = pieces[2]; sp < pieces[npieces - 1]; sp++)
2688 genid = solv_extend(genid, ngenid, 1, sizeof(*genid), 7);
2689 if (!strcmp(pieces[1], "op") && npieces > 2)
2692 for (op = oplist; op->flags; op++)
2693 if (!strncmp(pieces[2], op->opname, strlen(op->opname)))
2697 pool_debug(pool, SOLV_ERROR, "testcase_read: genid: unknown op '%s'\n", pieces[2]);
2702 pool_debug(pool, SOLV_ERROR, "testcase_read: genid: out of stack\n");
2706 id = pool_rel2id(pool, genid[ngenid] , genid[ngenid + 1], op->flags, 1);
2708 else if (!strcmp(pieces[1], "lit"))
2709 id = pool_str2id(pool, npieces > 2 ? pieces[2] : "", 1);
2710 else if (!strcmp(pieces[1], "null"))
2712 else if (!strcmp(pieces[1], "dep"))
2713 id = testcase_str2dep(pool, pieces[2]);
2716 pool_debug(pool, SOLV_ERROR, "testcase_read: genid: unknown command '%s'\n", pieces[1]);
2719 genid[ngenid++] = id;
2723 pool_debug(pool, SOLV_ERROR, "testcase_read: cannot parse command '%s'\n", pieces[0]);
2726 while (job && ngenid > 0)
2727 queue_push2(job, SOLVER_NOOP | SOLVER_SOLVABLE_PROVIDES, genid[--ngenid]);
2728 genid = solv_free(genid);
2729 buf = solv_free(buf);
2730 pieces = solv_free(pieces);
2731 solv_free(testcasedir);
2734 pool_addfileprovides(pool);
2735 pool_createwhatprovides(pool);
2739 solv = solver_create(pool);
2740 testcase_resetsolverflags(solv);
2744 if (missing_features)
2749 *resultflagsp = 77; /* hack for testsolv */
2755 testcase_resultdiff(const char *result1, const char *result2)
2757 Strqueue sq1, sq2, osq;
2759 strqueue_init(&sq1);
2760 strqueue_init(&sq2);
2761 strqueue_init(&osq);
2762 strqueue_split(&sq1, result1);
2763 strqueue_split(&sq2, result2);
2764 strqueue_sort(&sq1);
2765 strqueue_sort(&sq2);
2766 strqueue_diff(&sq1, &sq2, &osq);
2767 r = osq.nstr ? strqueue_join(&osq) : 0;
2768 strqueue_free(&sq1);
2769 strqueue_free(&sq2);
2770 strqueue_free(&osq);