2 * Copyright (c) 2012, Novell Inc.
4 * This program is licensed under the BSD license, read LICENSE.BSD
5 * for further information
17 #include "poolvendor.h"
19 #include "repo_solv.h"
21 #include "solverdebug.h"
24 #include "selection.h"
25 #include "solv_xfopen.h"
26 #if ENABLE_TESTCASE_HELIXREPO
27 #include "ext/repo_helix.h"
31 #include "tools_util.h"
33 static struct job2str {
37 { SOLVER_NOOP, "noop" },
38 { SOLVER_INSTALL, "install" },
39 { SOLVER_ERASE, "erase" },
40 { SOLVER_UPDATE, "update" },
41 { SOLVER_WEAKENDEPS, "weakendeps" },
42 { SOLVER_MULTIVERSION, "multiversion" },
43 { SOLVER_MULTIVERSION, "noobsoletes" }, /* old name */
44 { SOLVER_LOCK, "lock" },
45 { SOLVER_DISTUPGRADE, "distupgrade" },
46 { SOLVER_VERIFY, "verify" },
47 { SOLVER_DROP_ORPHANED, "droporphaned" },
48 { SOLVER_USERINSTALLED, "userinstalled" },
49 { SOLVER_ALLOWUNINSTALL, "allowuninstall" },
50 { SOLVER_FAVOR, "favor" },
51 { SOLVER_DISFAVOR, "disfavor" },
55 static struct jobflags2str {
59 { SOLVER_WEAK, "weak" },
60 { SOLVER_ESSENTIAL, "essential" },
61 { SOLVER_CLEANDEPS, "cleandeps" },
62 { SOLVER_ORUPDATE, "orupdate" },
63 { SOLVER_FORCEBEST, "forcebest" },
64 { SOLVER_TARGETED, "targeted" },
65 { SOLVER_NOTBYUSER, "notbyuser" },
66 { SOLVER_SETEV, "setev" },
67 { SOLVER_SETEVR, "setevr" },
68 { SOLVER_SETARCH, "setarch" },
69 { SOLVER_SETVENDOR, "setvendor" },
70 { SOLVER_SETREPO, "setrepo" },
71 { SOLVER_NOAUTOSET, "noautoset" },
75 static struct resultflags2str {
78 } resultflags2str[] = {
79 { TESTCASE_RESULT_TRANSACTION, "transaction" },
80 { TESTCASE_RESULT_PROBLEMS, "problems" },
81 { TESTCASE_RESULT_ORPHANED, "orphaned" },
82 { TESTCASE_RESULT_RECOMMENDED, "recommended" },
83 { TESTCASE_RESULT_UNNEEDED, "unneeded" },
84 { TESTCASE_RESULT_ALTERNATIVES, "alternatives" },
85 { TESTCASE_RESULT_RULES, "rules" },
86 { TESTCASE_RESULT_GENID, "genid" },
87 { TESTCASE_RESULT_REASON, "reason" },
88 { TESTCASE_RESULT_CLEANDEPS, "cleandeps" },
89 { TESTCASE_RESULT_JOBS, "jobs" },
93 static struct solverflags2str {
97 } solverflags2str[] = {
98 { SOLVER_FLAG_ALLOW_DOWNGRADE, "allowdowngrade", 0 },
99 { SOLVER_FLAG_ALLOW_NAMECHANGE, "allownamechange", 1 },
100 { SOLVER_FLAG_ALLOW_ARCHCHANGE, "allowarchchange", 0 },
101 { SOLVER_FLAG_ALLOW_VENDORCHANGE, "allowvendorchange", 0 },
102 { SOLVER_FLAG_ALLOW_UNINSTALL, "allowuninstall", 0 },
103 { SOLVER_FLAG_NO_UPDATEPROVIDE, "noupdateprovide", 0 },
104 { SOLVER_FLAG_SPLITPROVIDES, "splitprovides", 0 },
105 { SOLVER_FLAG_IGNORE_RECOMMENDED, "ignorerecommended", 0 },
106 { SOLVER_FLAG_ADD_ALREADY_RECOMMENDED, "addalreadyrecommended", 0 },
107 { SOLVER_FLAG_NO_INFARCHCHECK, "noinfarchcheck", 0 },
108 { SOLVER_FLAG_KEEP_EXPLICIT_OBSOLETES, "keepexplicitobsoletes", 0 },
109 { SOLVER_FLAG_BEST_OBEY_POLICY, "bestobeypolicy", 0 },
110 { SOLVER_FLAG_NO_AUTOTARGET, "noautotarget", 0 },
111 { SOLVER_FLAG_DUP_ALLOW_DOWNGRADE, "dupallowdowngrade", 1 },
112 { SOLVER_FLAG_DUP_ALLOW_ARCHCHANGE, "dupallowarchchange", 1 },
113 { SOLVER_FLAG_DUP_ALLOW_VENDORCHANGE, "dupallowvendorchange", 1 },
114 { SOLVER_FLAG_DUP_ALLOW_NAMECHANGE, "dupallownamechange", 1 },
115 { SOLVER_FLAG_KEEP_ORPHANS, "keeporphans", 0 },
116 { SOLVER_FLAG_BREAK_ORPHANS, "breakorphans", 0 },
117 { SOLVER_FLAG_FOCUS_INSTALLED, "focusinstalled", 0 },
118 { SOLVER_FLAG_YUM_OBSOLETES, "yumobsoletes", 0 },
119 { SOLVER_FLAG_NEED_UPDATEPROVIDE, "needupdateprovide", 0 },
120 { SOLVER_FLAG_URPM_REORDER, "urpmreorder", 0 },
121 { SOLVER_FLAG_FOCUS_BEST, "focusbest", 0 },
122 { SOLVER_FLAG_STRONG_RECOMMENDS, "strongrecommends", 0 },
123 { SOLVER_FLAG_INSTALL_ALSO_UPDATES, "installalsoupdates", 0 },
127 static struct poolflags2str {
131 } poolflags2str[] = {
132 { POOL_FLAG_PROMOTEEPOCH, "promoteepoch", 0 },
133 { POOL_FLAG_FORBIDSELFCONFLICTS, "forbidselfconflicts", 0 },
134 { POOL_FLAG_OBSOLETEUSESPROVIDES, "obsoleteusesprovides", 0 },
135 { POOL_FLAG_IMPLICITOBSOLETEUSESPROVIDES, "implicitobsoleteusesprovides", 0 },
136 { POOL_FLAG_OBSOLETEUSESCOLORS, "obsoleteusescolors", 0 },
137 { POOL_FLAG_IMPLICITOBSOLETEUSESCOLORS, "implicitobsoleteusescolors", 0 },
138 { POOL_FLAG_NOINSTALLEDOBSOLETES, "noinstalledobsoletes", 0 },
139 { POOL_FLAG_HAVEDISTEPOCH, "havedistepoch", 0 },
140 { POOL_FLAG_NOOBSOLETESMULTIVERSION, "noobsoletesmultiversion", 0 },
141 { POOL_FLAG_ADDFILEPROVIDESFILTERED, "addfileprovidesfiltered", 0 },
142 { POOL_FLAG_NOWHATPROVIDESAUX, "nowhatprovidesaux", 0 },
146 static struct disttype2str {
150 { DISTTYPE_RPM, "rpm" },
151 { DISTTYPE_DEB, "deb" },
152 { DISTTYPE_ARCH, "arch" },
153 { DISTTYPE_HAIKU, "haiku" },
157 static struct selflags2str {
161 { SELECTION_NAME, "name" },
162 { SELECTION_PROVIDES, "provides" },
163 { SELECTION_FILELIST, "filelist" },
164 { SELECTION_CANON, "canon" },
165 { SELECTION_DOTARCH, "dotarch" },
166 { SELECTION_REL, "rel" },
167 { SELECTION_INSTALLED_ONLY, "installedonly" },
168 { SELECTION_GLOB, "glob" },
169 { SELECTION_FLAT, "flat" },
170 { SELECTION_NOCASE, "nocase" },
171 { SELECTION_SOURCE_ONLY, "sourceonly" },
172 { SELECTION_WITH_SOURCE, "withsource" },
173 { SELECTION_SKIP_KIND, "skipkind" },
174 { SELECTION_MATCH_DEPSTR, "depstr" },
175 { SELECTION_WITH_DISABLED, "withdisabled" },
176 { SELECTION_WITH_BADARCH, "withbadarch" },
177 { SELECTION_ADD, "add" },
178 { SELECTION_SUBTRACT, "subtract" },
179 { SELECTION_FILTER, "filter" },
183 static const char *features[] = {
184 #ifdef ENABLE_LINKED_PKGS
187 #ifdef ENABLE_COMPLEX_DEPS
190 #if ENABLE_TESTCASE_HELIXREPO
191 "testcase_helixrepo",
196 typedef struct strqueue {
201 #define STRQUEUE_BLOCK 63
204 strqueue_init(Strqueue *q)
211 strqueue_free(Strqueue *q)
214 for (i = 0; i < q->nstr; i++)
215 solv_free(q->str[i]);
216 q->str = solv_free(q->str);
221 strqueue_push(Strqueue *q, const char *s)
223 q->str = solv_extend(q->str, q->nstr, 1, sizeof(*q->str), STRQUEUE_BLOCK);
224 q->str[q->nstr++] = solv_strdup(s);
228 strqueue_pushjoin(Strqueue *q, const char *s1, const char *s2, const char *s3)
230 q->str = solv_extend(q->str, q->nstr, 1, sizeof(*q->str), STRQUEUE_BLOCK);
231 q->str[q->nstr++] = solv_dupjoin(s1, s2, s3);
235 strqueue_sort_cmp(const void *ap, const void *bp, void *dp)
237 const char *a = *(const char **)ap;
238 const char *b = *(const char **)bp;
239 return strcmp(a ? a : "", b ? b : "");
243 strqueue_sort(Strqueue *q)
246 solv_sort(q->str, q->nstr, sizeof(*q->str), strqueue_sort_cmp, 0);
250 strqueue_sort_u(Strqueue *q)
254 for (i = j = 0; i < q->nstr; i++)
255 if (!j || strqueue_sort_cmp(q->str + i, q->str + j - 1, 0) != 0)
256 q->str[j++] = q->str[i];
261 strqueue_join(Strqueue *q)
265 for (i = 0; i < q->nstr; i++)
267 l += strlen(q->str[i]) + 1;
268 l++; /* trailing \0 */
271 for (i = 0; i < q->nstr; i++)
274 strcpy(rp, q->str[i]);
283 strqueue_split(Strqueue *q, const char *s)
288 while ((p = strchr(s, '\n')) != 0)
290 q->str = solv_extend(q->str, q->nstr, 1, sizeof(*q->str), STRQUEUE_BLOCK);
291 q->str[q->nstr] = solv_malloc(p - s + 1);
293 memcpy(q->str[q->nstr], s, p - s);
294 q->str[q->nstr][p - s] = 0;
303 strqueue_diff(Strqueue *sq1, Strqueue *sq2, Strqueue *osq)
306 while (i < sq1->nstr && j < sq2->nstr)
308 int r = strqueue_sort_cmp(sq1->str + i, sq2->str + j, 0);
312 strqueue_pushjoin(osq, "-", sq1->str[i++], 0);
314 strqueue_pushjoin(osq, "+", sq2->str[j++], 0);
316 while (i < sq1->nstr)
317 strqueue_pushjoin(osq, "-", sq1->str[i++], 0);
318 while (j < sq2->nstr)
319 strqueue_pushjoin(osq, "+", sq2->str[j++], 0);
324 testcase_id2str(Pool *pool, Id id, int isname)
326 const char *s = pool_id2str(pool, id);
329 int bad = 0, paren = 0, parenbad = 0;
335 if (strchr("[(<=>!", *s))
337 if (!strncmp(s, "namespace:", 10))
339 for (ss = s + bad; *ss; ss++)
341 if (*ss == ' ' || *ss == '\\' || *(unsigned char *)ss < 32 || *ss == '(' || *ss == ')')
344 paren = paren == 0 ? 1 : -1;
347 paren = paren == 1 ? 0 : -1;
352 if (isname && ss - s > 4 && !strcmp(ss - 4, ":any"))
354 if (!paren && !(bad - parenbad))
357 /* we need escaping! */
358 s2 = s2p = pool_alloctmpspace(pool, strlen(s) + bad * 2 + 1);
359 if (!strncmp(s, "namespace:", 10))
361 strcpy(s2p, "namespace\\3a");
369 if ((ss == s && strchr("[(<=>!", *s)) || *ss == ' ' || *ss == '\\' || *(unsigned char *)ss < 32 || *ss == '(' || *ss == ')')
372 solv_bin2hex((unsigned char *)ss, 1, s2p);
377 if (isname && s2p - s2 > 4 && !strcmp(s2p - 4, ":any"))
378 strcpy(s2p - 4, "\\3aany");
387 { REL_GT | REL_LT | REL_EQ, "<=>" },
388 { REL_LT | REL_EQ, "<=" },
389 { REL_GT | REL_EQ, ">=" },
391 { REL_GT | REL_LT, "<>" },
395 { REL_WITHOUT , "-" },
396 { REL_NAMESPACE , "<NAMESPACE>" },
398 { REL_MULTIARCH, "<MULTIARCH>" },
399 { REL_FILECONFLICT, "<FILECONFLICT>" },
400 { REL_COND, "<IF>" },
401 { REL_COMPAT, "compat >=" },
402 { REL_KIND, "<KIND>" },
403 { REL_ELSE, "<ELSE>" },
404 { REL_ERROR, "<ERROR>" },
405 { REL_UNLESS, "<UNLESS>" },
411 testcase_dep2str_complex(Pool *pool, char *s, Id id, int addparens)
420 s2 = testcase_id2str(pool, id, 1);
421 s = pool_tmpappend(pool, s, s2, 0);
422 pool_freetmpspace(pool, s2);
425 rd = GETRELDEP(pool, id);
427 /* check for special shortcuts */
428 if (rd->flags == REL_NAMESPACE && !ISRELDEP(rd->name) && !strncmp(pool_id2str(pool, rd->name), "namespace:", 10))
430 s = pool_tmpappend(pool, s, pool_id2str(pool, rd->name), "(");
431 s = testcase_dep2str_complex(pool, s, rd->evr, 0);
432 return pool_tmpappend(pool, s, ")", 0);
434 if (rd->flags == REL_MULTIARCH && !ISRELDEP(rd->name) && rd->evr == ARCH_ANY)
436 /* append special :any suffix */
437 s2 = testcase_id2str(pool, rd->name, 1);
438 s = pool_tmpappend(pool, s, s2, ":any");
439 pool_freetmpspace(pool, s2);
444 if (ISRELDEP(rd->name))
446 Reldep *rd2 = GETRELDEP(pool, rd->name);
448 if (rd->flags > 7 && rd->flags != REL_COMPAT && rd2->flags && rd2->flags <= 7)
453 s = pool_tmpappend(pool, s, "(", 0);
454 s = testcase_dep2str_complex(pool, s, rd->name, needparens);
456 for (op = oplist; op->flags; op++)
457 if (rd->flags == op->flags)
461 s = pool_tmpappend(pool, s, " ", op->opname);
462 s = pool_tmpappend(pool, s, " ", 0);
467 sprintf(buf, " <%u> ", rd->flags);
468 s = pool_tmpappend(pool, s, buf, 0);
472 if (ISRELDEP(rd->evr))
474 Reldep *rd2 = GETRELDEP(pool, rd->evr);
476 if (rd->flags > 7 && rd2->flags && rd2->flags <= 7)
478 if (rd->flags == REL_AND && rd2->flags == REL_AND)
479 needparens = 0; /* chain */
480 if (rd->flags == REL_OR && rd2->flags == REL_OR)
481 needparens = 0; /* chain */
482 if (rd->flags > 0 && rd->flags < 8 && rd2->flags == REL_COMPAT)
483 needparens = 0; /* chain */
485 if (!ISRELDEP(rd->evr))
487 s2 = testcase_id2str(pool, rd->evr, 0);
488 s = pool_tmpappend(pool, s, s2, 0);
489 pool_freetmpspace(pool, s2);
492 s = (char *)testcase_dep2str_complex(pool, s, rd->evr, needparens);
494 s = pool_tmpappend(pool, s, ")", 0);
499 testcase_dep2str(Pool *pool, Id id)
503 return testcase_id2str(pool, id, 1);
504 s = pool_alloctmpspace(pool, 1);
506 return testcase_dep2str_complex(pool, s, id, 0);
510 /* Convert a simple string. Also handle the :any suffix */
512 testcase_str2dep_simple(Pool *pool, const char **sp, int isname)
519 for (s = *sp; *s; s++)
523 if (*s == ' ' || *(unsigned char *)s < 32)
527 if (*s == ')' && paren-- <= 0)
530 if (isname && s - *sp > 4 && !strncmp(s - 4, ":any", 4))
537 if (s - *sp == 6 && !strncmp(*sp, "<NULL>", 6))
540 id = pool_strn2id(pool, *sp, s - *sp, 1);
542 else if (s - *sp == 3 && !strncmp(*sp, "\\00", 3))
546 char buf[128], *bp, *bp2;
548 bp = s - *sp >= 128 ? solv_malloc(s - *sp + 1) : buf;
549 for (bp2 = bp, sp2 = *sp; sp2 < s;)
553 solv_hex2bin(&sp2, (unsigned char *)bp2 - 1, 1);
556 id = pool_str2id(pool, bp, 1);
562 id = pool_rel2id(pool, id, ARCH_ANY, REL_MULTIARCH, 1);
571 testcase_str2dep_complex(Pool *pool, const char **sp, int relop)
574 Id flags, id, id2, namespaceid = 0;
577 while (*s == ' ' || *s == '\t')
579 if (!strncmp(s, "namespace:", 10))
581 /* special namespace hack */
583 for (s2 = s + 10; *s2 && *s2 != '('; s2++)
587 namespaceid = pool_strn2id(pool, s, s2 - s, 1);
594 id = testcase_str2dep_complex(pool, &s, 0);
603 id = testcase_str2dep_simple(pool, &s, relop ? 0 : 1);
605 id = pool_rel2id(pool, namespaceid, id, REL_NAMESPACE, 1);
609 while (*s == ' ' || *s == '\t')
611 if (!*s || *s == ')' || (relop && strncmp(s, "compat >= ", 10) != 0))
617 /* we have an op! Find the end */
619 if (s[0] == '<' && (s[1] >= '0' && s[1] <= '9'))
622 for (s2 = s + 1; *s2 >= '0' && *s2 <= '9'; s2++)
626 flags = strtoul(s + 1, 0, 10);
632 for (op = oplist; op->flags; op++)
633 if (!strncmp(s, op->opname, strlen(op->opname)))
641 s += strlen(op->opname);
643 id2 = testcase_str2dep_complex(pool, &s, flags > 0 && flags < 8);
649 id = pool_rel2id(pool, id, id2, flags, 1);
654 testcase_str2dep(Pool *pool, const char *s)
656 Id id = testcase_str2dep_complex(pool, &s, 0);
657 return s && !*s ? id : 0;
660 /**********************************************************/
663 testcase_repoid2str(Pool *pool, Id repoid)
665 Repo *repo = pool_id2repo(pool, repoid);
668 char *r = pool_tmpjoin(pool, repo->name, 0, 0);
670 for (rp = r; *rp; rp++)
671 if (*rp == ' ' || *rp == '\t')
678 sprintf(buf, "#%d", repoid);
679 return pool_tmpjoin(pool, buf, 0, 0);
684 testcase_solvid2str(Pool *pool, Id p)
686 Solvable *s = pool->solvables + p;
687 const char *n, *e, *a;
690 if (p == SYSTEMSOLVABLE)
692 n = pool_id2str(pool, s->name);
693 e = pool_id2str(pool, s->evr);
694 a = pool_id2str(pool, s->arch);
695 str = pool_alloctmpspace(pool, strlen(n) + strlen(e) + strlen(a) + 3);
696 sprintf(str, "%s-%s.%s", n, e, a);
698 return pool_tmpappend(pool, str, "@", 0);
702 char *str2 = pool_tmpappend(pool, str, "@", s->repo->name);
704 if (str2[l] == ' ' || str2[l] == '\t')
708 sprintf(buf, "@#%d", s->repo->repoid);
709 return pool_tmpappend(pool, str, buf, 0);
713 testcase_str2repo(Pool *pool, const char *str)
717 if (str[0] == '#' && (str[1] >= '0' && str[1] <= '9'))
721 for (j = 1; str[j] >= '0' && str[j] <= '9'; j++)
722 repoid = repoid * 10 + (str[j] - '0');
723 if (!str[j] && repoid > 0 && repoid < pool->nrepos)
724 repo = pool_id2repo(pool, repoid);
728 FOR_REPOS(repoid, repo)
733 l = strlen(repo->name);
734 for (i = 0; i < l; i++)
736 int c = repo->name[i];
737 if (c == ' ' || c == '\t')
742 if (i == l && !str[l])
745 if (repoid >= pool->nrepos)
752 testcase_str2solvid(Pool *pool, const char *str)
754 int i, l = strlen(str);
761 if (*str == '@' && !strcmp(str, "@SYSTEM"))
762 return SYSTEMSOLVABLE;
764 for (i = l - 1; i >= 0; i--)
765 if (str[i] == '@' && (repo = testcase_str2repo(pool, str + i + 1)) != 0)
770 /* now find the arch (if present) */
772 for (i = repostart - 1; i > 0; i--)
775 arch = pool_strn2id(pool, str + i + 1, repostart - (i + 1), 0);
780 /* now find the name */
781 for (i = repostart - 1; i > 0; i--)
785 Id nid, evrid, p, pp;
786 nid = pool_strn2id(pool, str, i, 0);
789 evrid = pool_strn2id(pool, str + i + 1, repostart - (i + 1), 0);
792 /* first check whatprovides */
793 FOR_PROVIDES(p, pp, nid)
795 Solvable *s = pool->solvables + p;
796 if (s->name != nid || s->evr != evrid)
798 if (repo && s->repo != repo)
800 if (arch && s->arch != arch)
804 /* maybe it's not installable and thus not in whatprovides. do a slow search */
808 FOR_REPO_SOLVABLES(repo, p, s)
810 if (s->name != nid || s->evr != evrid)
812 if (arch && s->arch != arch)
819 FOR_POOL_SOLVABLES(p)
821 Solvable *s = pool->solvables + p;
822 if (s->name != nid || s->evr != evrid)
824 if (arch && s->arch != arch)
835 testcase_job2str(Pool *pool, Id how, Id what)
842 Id select = how & SOLVER_SELECTMASK;
844 for (i = 0; job2str[i].str; i++)
845 if ((how & SOLVER_JOBMASK) == job2str[i].job)
847 jobstr = job2str[i].str ? job2str[i].str : "unknown";
848 if (select == SOLVER_SOLVABLE)
851 pkgstr = testcase_solvid2str(pool, what);
853 else if (select == SOLVER_SOLVABLE_NAME)
856 pkgstr = testcase_dep2str(pool, what);
858 else if (select == SOLVER_SOLVABLE_PROVIDES)
860 selstr = " provides ";
861 pkgstr = testcase_dep2str(pool, what);
863 else if (select == SOLVER_SOLVABLE_ONE_OF)
868 while ((p = pool->whatprovidesdata[what++]) != 0)
870 const char *s = testcase_solvid2str(pool, p);
873 pkgstr = pool_tmpappend(pool, pkgstr, " ", s);
874 pool_freetmpspace(pool, s);
882 else if (select == SOLVER_SOLVABLE_REPO)
884 Repo *repo = pool_id2repo(pool, what);
889 sprintf(buf, "#%d", repo->repoid);
890 pkgstr = pool_tmpjoin(pool, buf, 0, 0);
893 pkgstr = pool_tmpjoin(pool, repo->name, 0, 0);
895 else if (select == SOLVER_SOLVABLE_ALL)
902 selstr = " unknown ";
905 ret = pool_tmpjoin(pool, jobstr, selstr, pkgstr);
907 ret = pool_tmpappend(pool, ret, " ", 0);
908 for (i = 0; jobflags2str[i].str; i++)
909 if ((how & jobflags2str[i].flag) != 0)
910 ret = pool_tmpappend(pool, ret, ",", jobflags2str[i].str);
916 ret = pool_tmpappend(pool, ret, "]", 0);
922 str2selflags(Pool *pool, char *s) /* modifies the string! */
927 char *se = strchr(s, ',');
930 for (i = 0; selflags2str[i].str; i++)
931 if (!strcmp(s, selflags2str[i].str))
933 selflags |= selflags2str[i].flag;
936 if (!selflags2str[i].str)
937 pool_error(pool, 0, "str2job: unknown selection flag '%s'", s);
944 str2jobflags(Pool *pool, char *s) /* modifies the string */
949 char *se = strchr(s, ',');
952 for (i = 0; jobflags2str[i].str; i++)
953 if (!strcmp(s, jobflags2str[i].str))
955 jobflags |= jobflags2str[i].flag;
958 if (!jobflags2str[i].str)
959 pool_error(pool, 0, "str2job: unknown job flag '%s'", s);
966 testcase_str2job(Pool *pool, const char *str, Id *whatp)
976 /* so we can patch it */
977 s = pool_tmpjoin(pool, str, 0, 0);
978 /* split it in pieces */
981 while (*s == ' ' || *s == '\t')
985 pieces = solv_extend(pieces, npieces, 1, sizeof(*pieces), 7);
986 pieces[npieces++] = s;
987 while (*s && *s != ' ' && *s != '\t')
994 pool_error(pool, -1, "str2job: bad line '%s'", str);
999 for (i = 0; job2str[i].str; i++)
1000 if (!strcmp(pieces[0], job2str[i].str))
1002 if (!job2str[i].str)
1004 pool_error(pool, -1, "str2job: unknown job '%s'", str);
1008 job = job2str[i].job;
1012 char *flags = pieces[npieces - 1];
1013 if (*flags == '[' && flags[strlen(flags) - 1] == ']')
1017 flags[strlen(flags) - 1] = 0;
1018 job |= str2jobflags(pool, flags);
1021 if (!strcmp(pieces[1], "pkg"))
1025 pool_error(pool, -1, "str2job: bad pkg selector in '%s'", str);
1029 job |= SOLVER_SOLVABLE;
1030 what = testcase_str2solvid(pool, pieces[2]);
1033 pool_error(pool, -1, "str2job: unknown package '%s'", pieces[2]);
1038 else if (!strcmp(pieces[1], "name") || !strcmp(pieces[1], "provides"))
1040 /* join em again for dep2str... */
1042 for (sp = pieces[2]; sp < pieces[npieces - 1]; sp++)
1046 if (pieces[1][0] == 'p' && strncmp(pieces[2], "namespace:", 10) == 0)
1048 char *spe = strchr(pieces[2], '(');
1049 int l = strlen(pieces[2]);
1050 if (spe && pieces[2][l - 1] == ')')
1052 /* special namespace provides */
1053 if (strcmp(spe, "(<NULL>)") != 0)
1055 pieces[2][l - 1] = 0;
1056 what = testcase_str2dep(pool, spe + 1);
1057 pieces[2][l - 1] = ')';
1059 what = pool_rel2id(pool, pool_strn2id(pool, pieces[2], spe - pieces[2], 1), what, REL_NAMESPACE, 1);
1063 what = testcase_str2dep(pool, pieces[2]);
1064 if (pieces[1][0] == 'n')
1065 job |= SOLVER_SOLVABLE_NAME;
1067 job |= SOLVER_SOLVABLE_PROVIDES;
1069 else if (!strcmp(pieces[1], "oneof"))
1072 job |= SOLVER_SOLVABLE_ONE_OF;
1074 if (npieces > 3 && strcmp(pieces[2], "nothing") != 0)
1076 for (i = 2; i < npieces; i++)
1078 Id p = testcase_str2solvid(pool, pieces[i]);
1081 pool_error(pool, -1, "str2job: unknown package '%s'", pieces[i]);
1089 what = pool_queuetowhatprovides(pool, &q);
1092 else if (!strcmp(pieces[1], "repo"))
1097 pool_error(pool, -1, "str2job: bad line '%s'", str);
1101 repo = testcase_str2repo(pool, pieces[2]);
1104 pool_error(pool, -1, "str2job: unknown repo '%s'", pieces[2]);
1108 job |= SOLVER_SOLVABLE_REPO;
1109 what = repo->repoid;
1111 else if (!strcmp(pieces[1], "all"))
1113 if (npieces != 3 && strcmp(pieces[2], "packages") != 0)
1115 pool_error(pool, -1, "str2job: bad line '%s'", str);
1119 job |= SOLVER_SOLVABLE_ALL;
1124 pool_error(pool, -1, "str2job: unknown selection in '%s'", str);
1133 #define SELECTIONJOB_MATCHDEPS 1
1134 #define SELECTIONJOB_MATCHDEPID 2
1135 #define SELECTIONJOB_MATCHSOLVABLE 3
1138 addselectionjob(Pool *pool, char **pieces, int npieces, Queue *jobqueue, int type, int keyname)
1146 for (i = 0; job2str[i].str; i++)
1147 if (!strcmp(pieces[0], job2str[i].str))
1149 if (!job2str[i].str)
1150 return pool_error(pool, -1, "selstr2job: unknown job '%s'", pieces[0]);
1151 job = job2str[i].job;
1154 char *flags = pieces[npieces - 1];
1155 if (*flags == '[' && flags[strlen(flags) - 1] == ']')
1159 flags[strlen(flags) - 1] = 0;
1160 job |= str2jobflags(pool, flags);
1164 return pool_error(pool, -1, "selstr2job: no selection flags");
1165 selflags = str2selflags(pool, pieces[npieces - 1]);
1166 /* re-join pieces */
1167 for (sp = pieces[2]; sp < pieces[npieces - 2]; sp++)
1171 if (selflags & (SELECTION_ADD | SELECTION_SUBTRACT | SELECTION_FILTER))
1173 for (i = 0; i < jobqueue->count; i += 2)
1174 queue_push2(&sel, jobqueue->elements[i] & (SOLVER_SELECTMASK | SOLVER_SETMASK), jobqueue->elements[i + 1]);
1175 queue_empty(jobqueue);
1178 r = selection_make(pool, &sel, pieces[2], selflags);
1179 else if (type == SELECTIONJOB_MATCHDEPS)
1180 r = selection_make_matchdeps(pool, &sel, pieces[2], selflags, keyname, 0);
1181 else if (type == SELECTIONJOB_MATCHDEPID)
1182 r = selection_make_matchdepid(pool, &sel, testcase_str2dep(pool, pieces[2]), selflags, keyname, 0);
1183 else if (type == SELECTIONJOB_MATCHSOLVABLE)
1184 r = selection_make_matchsolvable(pool, &sel, testcase_str2solvid(pool, pieces[2]), selflags, keyname, 0);
1185 for (i = 0; i < sel.count; i += 2)
1186 queue_push2(jobqueue, job | sel.elements[i], sel.elements[i + 1]);
1192 writedeps(Repo *repo, FILE *fp, const char *tag, Id key, Solvable *s, Offset off)
1194 Pool *pool = repo->pool;
1201 dp = repo->idarraydata + off;
1202 while ((id = *dp++) != 0)
1204 if (key == SOLVABLE_REQUIRES && id == SOLVABLE_PREREQMARKER)
1207 fprintf(fp, "-%s\n", tag);
1212 if (key == SOLVABLE_PROVIDES && id == SOLVABLE_FILEMARKER)
1214 idstr = testcase_dep2str(pool, id);
1217 fprintf(fp, "+%s\n", tag);
1220 fprintf(fp, "%s\n", idstr);
1223 fprintf(fp, "-%s\n", tag);
1227 writefilelist(Repo *repo, FILE *fp, const char *tag, Solvable *s)
1229 Pool *pool = repo->pool;
1233 dataiterator_init(&di, pool, repo, s - pool->solvables, SOLVABLE_FILELIST, 0, 0);
1234 while (dataiterator_step(&di))
1236 const char *s = repodata_dir2str(di.data, di.kv.id, di.kv.str);
1239 fprintf(fp, "+%s\n", tag);
1242 fprintf(fp, "%s\n", s);
1245 fprintf(fp, "-%s\n", tag);
1246 dataiterator_free(&di);
1250 testcase_write_testtags(Repo *repo, FILE *fp)
1252 Pool *pool = repo->pool;
1258 const char *release;
1263 fprintf(fp, "=Ver: 3.0\n");
1265 FOR_REPO_SOLVABLES(repo, p, s)
1267 name = pool_id2str(pool, s->name);
1268 evr = pool_id2str(pool, s->evr);
1269 arch = pool_id2str(pool, s->arch);
1270 release = strrchr(evr, '-');
1272 release = evr + strlen(evr);
1273 fprintf(fp, "=Pkg: %s %.*s %s %s\n", name, (int)(release - evr), evr, *release && release[1] ? release + 1 : "-", arch);
1274 tmp = solvable_lookup_str(s, SOLVABLE_SUMMARY);
1276 fprintf(fp, "=Sum: %s\n", tmp);
1277 writedeps(repo, fp, "Req:", SOLVABLE_REQUIRES, s, s->requires);
1278 writedeps(repo, fp, "Prv:", SOLVABLE_PROVIDES, s, s->provides);
1279 writedeps(repo, fp, "Obs:", SOLVABLE_OBSOLETES, s, s->obsoletes);
1280 writedeps(repo, fp, "Con:", SOLVABLE_CONFLICTS, s, s->conflicts);
1281 writedeps(repo, fp, "Rec:", SOLVABLE_RECOMMENDS, s, s->recommends);
1282 writedeps(repo, fp, "Sup:", SOLVABLE_SUPPLEMENTS, s, s->supplements);
1283 writedeps(repo, fp, "Sug:", SOLVABLE_SUGGESTS, s, s->suggests);
1284 writedeps(repo, fp, "Enh:", SOLVABLE_ENHANCES, s, s->enhances);
1285 if (solvable_lookup_idarray(s, SOLVABLE_PREREQ_IGNOREINST, &q))
1288 fprintf(fp, "+Ipr:\n");
1289 for (i = 0; i < q.count; i++)
1290 fprintf(fp, "%s\n", testcase_dep2str(pool, q.elements[i]));
1291 fprintf(fp, "-Ipr:\n");
1294 fprintf(fp, "=Vnd: %s\n", pool_id2str(pool, s->vendor));
1295 ti = solvable_lookup_num(s, SOLVABLE_BUILDTIME, 0);
1297 fprintf(fp, "=Tim: %u\n", ti);
1298 writefilelist(repo, fp, "Fls:", s);
1304 static inline Offset
1305 adddep(Repo *repo, Offset olddeps, char *str, Id marker)
1307 Id id = *str == '/' ? pool_str2id(repo->pool, str, 1) : testcase_str2dep(repo->pool, str);
1308 return repo_addid_dep(repo, olddeps, id, marker);
1312 finish_v2_solvable(Pool *pool, Repodata *data, Solvable *s, char *filelist, int nfilelist)
1318 for (l = 0; l < nfilelist; l += strlen(filelist + l) + 1)
1320 char *p = strrchr(filelist + l, '/');
1324 did = repodata_str2dir(data, filelist + l, 1);
1327 did = repodata_str2dir(data, "/", 1);
1328 repodata_add_dirstr(data, s - pool->solvables, SOLVABLE_FILELIST, did, p);
1331 repo_rewrite_suse_deps(s, 0);
1334 /* stripped down version of susetags parser used for testcases */
1336 testcase_add_testtags(Repo *repo, FILE *fp, int flags)
1338 Pool *pool = repo->pool;
1350 int tagsversion = 0;
1351 int addselfprovides = 1; /* for compat reasons */
1353 data = repo_add_repodata(repo, flags);
1358 line = solv_malloc(aline);
1362 if (linep - line + 16 > aline)
1364 aline = linep - line;
1365 line = solv_realloc(line, aline + 512);
1366 linep = line + aline;
1369 if (!fgets(linep, aline - (linep - line), fp))
1371 linep += strlen(linep);
1372 if (linep == line || linep[-1] != '\n')
1375 linep = line + intag;
1378 if (line[intag] == '-' && !strncmp(line + 1, line + intag + 1, intag - 2))
1385 else if (line[0] == '+' && line[1] && line[1] != ':')
1387 char *tagend = strchr(line, ':');
1392 intag = tagend + 2 - line;
1393 linep = line + intag;
1396 if (*line != '=' || !line[1] || !line[2] || !line[3] || line[4] != ':')
1398 tag = line[1] << 16 | line[2] << 8 | line[3];
1399 /* tags that do not need a solvable */
1402 case 'V' << 16 | 'e' << 8 | 'r':
1403 tagsversion = atoi(line + 6);
1404 addselfprovides = tagsversion < 3 || strstr(line + 6, "addselfprovides") != 0;
1406 case 'P' << 16 | 'k' << 8 | 'g':
1409 if (tagsversion == 2)
1410 finish_v2_solvable(pool, data, s, filelist, nfilelist);
1411 if (addselfprovides && s->name && s->arch != ARCH_SRC && s->arch != ARCH_NOSRC)
1412 s->provides = repo_addid_dep(s->repo, s->provides, pool_rel2id(pool, s->name, s->evr, REL_EQ, 1), 0);
1415 if (split(line + 5, sp, 5) != 4)
1417 s = pool_id2solvable(pool, repo_add_solvable(repo));
1418 s->name = pool_str2id(pool, sp[0], 1);
1419 /* join back version and release */
1420 if (sp[2] && !(sp[2][0] == '-' && !sp[2][1]))
1422 s->evr = makeevr(pool, sp[1]);
1423 s->arch = pool_str2id(pool, sp[3], 1);
1430 /* tags that need a solvable */
1433 case 'S' << 16 | 'u' << 8 | 'm':
1434 repodata_set_str(data, s - pool->solvables, SOLVABLE_SUMMARY, line + 6);
1436 case 'V' << 16 | 'n' << 8 | 'd':
1437 s->vendor = pool_str2id(pool, line + 6, 1);
1439 case 'T' << 16 | 'i' << 8 | 'm':
1442 repodata_set_num(data, s - pool->solvables, SOLVABLE_BUILDTIME, t);
1444 case 'R' << 16 | 'e' << 8 | 'q':
1445 s->requires = adddep(repo, s->requires, line + 6, -SOLVABLE_PREREQMARKER);
1447 case 'P' << 16 | 'r' << 8 | 'q':
1448 s->requires = adddep(repo, s->requires, line + 6, SOLVABLE_PREREQMARKER);
1450 case 'P' << 16 | 'r' << 8 | 'v':
1451 /* version 2 had the file list at the end of the provides */
1452 if (tagsversion == 2)
1456 int l = strlen(line + 6) + 1;
1457 if (nfilelist + l > afilelist)
1459 afilelist = nfilelist + l + 512;
1460 filelist = solv_realloc(filelist, afilelist);
1462 memcpy(filelist + nfilelist, line + 6, l);
1469 for (l = 0; l < nfilelist; l += strlen(filelist + l) + 1)
1470 s->provides = repo_addid_dep(repo, s->provides, pool_str2id(pool, filelist + l, 1), 0);
1474 s->provides = adddep(repo, s->provides, line + 6, 0);
1476 case 'F' << 16 | 'l' << 8 | 's':
1478 char *p = strrchr(line + 6, '/');
1483 did = repodata_str2dir(data, line + 6, 1);
1485 did = repodata_str2dir(data, "/", 1);
1486 repodata_add_dirstr(data, s - pool->solvables, SOLVABLE_FILELIST, did, p);
1489 case 'O' << 16 | 'b' << 8 | 's':
1490 s->obsoletes = adddep(repo, s->obsoletes, line + 6, 0);
1492 case 'C' << 16 | 'o' << 8 | 'n':
1493 s->conflicts = adddep(repo, s->conflicts, line + 6, 0);
1495 case 'R' << 16 | 'e' << 8 | 'c':
1496 s->recommends = adddep(repo, s->recommends, line + 6, 0);
1498 case 'S' << 16 | 'u' << 8 | 'p':
1499 s->supplements = adddep(repo, s->supplements, line + 6, 0);
1501 case 'S' << 16 | 'u' << 8 | 'g':
1502 s->suggests = adddep(repo, s->suggests, line + 6, 0);
1504 case 'E' << 16 | 'n' << 8 | 'h':
1505 s->enhances = adddep(repo, s->enhances, line + 6, 0);
1507 case 'I' << 16 | 'p' << 8 | 'r':
1509 Id id = line[6] == '/' ? pool_str2id(pool, line + 6, 1) : testcase_str2dep(pool, line + 6);
1510 repodata_add_idarray(data, s - pool->solvables, SOLVABLE_PREREQ_IGNOREINST, id);
1519 if (tagsversion == 2)
1520 finish_v2_solvable(pool, data, s, filelist, nfilelist);
1521 if (addselfprovides && s->name && s->arch != ARCH_SRC && s->arch != ARCH_NOSRC)
1522 s->provides = repo_addid_dep(s->repo, s->provides, pool_rel2id(pool, s->name, s->evr, REL_EQ, 1), 0);
1525 solv_free(filelist);
1526 repodata_free_dircache(data);
1527 if (!(flags & REPO_NO_INTERNALIZE))
1528 repodata_internalize(data);
1533 testcase_getpoolflags(Pool *pool)
1535 const char *str = 0;
1537 for (i = 0; poolflags2str[i].str; i++)
1539 v = pool_get_flag(pool, poolflags2str[i].flag);
1540 if (v == poolflags2str[i].def)
1542 str = pool_tmpappend(pool, str, v ? " " : " !", poolflags2str[i].str);
1544 return str ? str + 1 : "";
1548 testcase_setpoolflags(Pool *pool, const char *str)
1550 const char *p = str, *s;
1554 while (*p == ' ' || *p == '\t' || *p == ',')
1565 while (*p && *p != ' ' && *p != '\t' && *p != ',')
1567 for (i = 0; poolflags2str[i].str; i++)
1568 if (!strncmp(poolflags2str[i].str, s, p - s) && poolflags2str[i].str[p - s] == 0)
1570 if (!poolflags2str[i].str)
1571 return pool_error(pool, 0, "setpoolflags: unknown flag '%.*s'", (int)(p - s), s);
1572 pool_set_flag(pool, poolflags2str[i].flag, v);
1578 testcase_resetpoolflags(Pool *pool)
1581 for (i = 0; poolflags2str[i].str; i++)
1582 pool_set_flag(pool, poolflags2str[i].flag, poolflags2str[i].def);
1586 testcase_getsolverflags(Solver *solv)
1588 Pool *pool = solv->pool;
1589 const char *str = 0;
1591 for (i = 0; solverflags2str[i].str; i++)
1593 v = solver_get_flag(solv, solverflags2str[i].flag);
1594 if (v == solverflags2str[i].def)
1596 str = pool_tmpappend(pool, str, v ? " " : " !", solverflags2str[i].str);
1598 return str ? str + 1 : "";
1602 testcase_setsolverflags(Solver *solv, const char *str)
1604 const char *p = str, *s;
1608 while (*p == ' ' || *p == '\t' || *p == ',')
1619 while (*p && *p != ' ' && *p != '\t' && *p != ',')
1621 for (i = 0; solverflags2str[i].str; i++)
1622 if (!strncmp(solverflags2str[i].str, s, p - s) && solverflags2str[i].str[p - s] == 0)
1624 if (!solverflags2str[i].str)
1625 return pool_error(solv->pool, 0, "setsolverflags: unknown flag '%.*s'", (int)(p - s), s);
1626 if (solver_set_flag(solv, solverflags2str[i].flag, v) == -1)
1627 return pool_error(solv->pool, 0, "setsolverflags: unsupported flag '%s'", solverflags2str[i].str);
1633 testcase_resetsolverflags(Solver *solv)
1636 for (i = 0; solverflags2str[i].str; i++)
1637 solver_set_flag(solv, solverflags2str[i].flag, solverflags2str[i].def);
1641 testcase_ruleid(Solver *solv, Id rid)
1647 const unsigned char *md5;
1653 solver_ruleliterals(solv, rid, &q);
1654 for (i = 0; i < q.count; i++)
1656 Id p = q.elements[i];
1657 s = testcase_solvid2str(solv->pool, p > 0 ? p : -p);
1659 s = pool_tmpjoin(solv->pool, "!", s, 0);
1660 strqueue_push(&sq, s);
1663 strqueue_sort_u(&sq);
1664 chk = solv_chksum_create(REPOKEY_TYPE_MD5);
1665 for (i = 0; i < sq.nstr; i++)
1666 solv_chksum_add(chk, sq.str[i], strlen(sq.str[i]) + 1);
1667 md5 = solv_chksum_get(chk, &md5l);
1668 s = pool_bin2hex(solv->pool, md5, md5l);
1669 chk = solv_chksum_free(chk, 0);
1675 testcase_problemid(Solver *solv, Id problem)
1680 const unsigned char *md5;
1684 /* we build a hash of all rules that define the problem */
1687 solver_findallproblemrules(solv, problem, &q);
1688 for (i = 0; i < q.count; i++)
1689 strqueue_push(&sq, testcase_ruleid(solv, q.elements[i]));
1691 strqueue_sort_u(&sq);
1692 chk = solv_chksum_create(REPOKEY_TYPE_MD5);
1693 for (i = 0; i < sq.nstr; i++)
1694 solv_chksum_add(chk, sq.str[i], strlen(sq.str[i]) + 1);
1695 md5 = solv_chksum_get(chk, &md5l);
1696 s = pool_bin2hex(solv->pool, md5, 4);
1697 chk = solv_chksum_free(chk, 0);
1703 testcase_solutionid(Solver *solv, Id problem, Id solution)
1707 const unsigned char *md5;
1711 intid = solver_solutionelement_internalid(solv, problem, solution);
1712 /* internal stuff! handle with care! */
1716 s = testcase_job2str(solv->pool, solv->job.elements[-intid - 1], solv->job.elements[-intid]);
1721 s = testcase_ruleid(solv, intid);
1723 chk = solv_chksum_create(REPOKEY_TYPE_MD5);
1724 solv_chksum_add(chk, s, strlen(s) + 1);
1725 md5 = solv_chksum_get(chk, &md5l);
1726 s = pool_bin2hex(solv->pool, md5, 4);
1727 chk = solv_chksum_free(chk, 0);
1732 testcase_alternativeid(Solver *solv, int type, Id id, Id from)
1735 Pool *pool = solv->pool;
1737 const unsigned char *md5;
1739 chk = solv_chksum_create(REPOKEY_TYPE_MD5);
1740 if (type == SOLVER_ALTERNATIVE_TYPE_RECOMMENDS)
1742 s = testcase_solvid2str(pool, from);
1743 solv_chksum_add(chk, s, strlen(s) + 1);
1744 s = testcase_dep2str(pool, id);
1745 solv_chksum_add(chk, s, strlen(s) + 1);
1747 else if (type == SOLVER_ALTERNATIVE_TYPE_RULE)
1749 s = testcase_ruleid(solv, id);
1750 solv_chksum_add(chk, s, strlen(s) + 1);
1752 md5 = solv_chksum_get(chk, &md5l);
1753 s = pool_bin2hex(pool, md5, 4);
1754 chk = solv_chksum_free(chk, 0);
1758 static struct class2str {
1762 { SOLVER_TRANSACTION_ERASE, "erase" },
1763 { SOLVER_TRANSACTION_INSTALL, "install" },
1764 { SOLVER_TRANSACTION_REINSTALLED, "reinstall" },
1765 { SOLVER_TRANSACTION_DOWNGRADED, "downgrade" },
1766 { SOLVER_TRANSACTION_CHANGED, "change" },
1767 { SOLVER_TRANSACTION_UPGRADED, "upgrade" },
1768 { SOLVER_TRANSACTION_OBSOLETED, "obsolete" },
1769 { SOLVER_TRANSACTION_MULTIINSTALL, "multiinstall" },
1770 { SOLVER_TRANSACTION_MULTIREINSTALL, "multireinstall" },
1774 static struct reason2str {
1778 { SOLVER_REASON_UNRELATED, "unrelated" },
1779 { SOLVER_REASON_UNIT_RULE, "unit" },
1780 { SOLVER_REASON_KEEP_INSTALLED, "keep" },
1781 { SOLVER_REASON_RESOLVE_JOB, "job" },
1782 { SOLVER_REASON_UPDATE_INSTALLED, "update" },
1783 { SOLVER_REASON_CLEANDEPS_ERASE, "cleandeps" },
1784 { SOLVER_REASON_RESOLVE, "resolve" },
1785 { SOLVER_REASON_WEAKDEP, "weakdep" },
1786 { SOLVER_REASON_RESOLVE_ORPHAN, "orphan" },
1788 { SOLVER_REASON_RECOMMENDED, "recommended" },
1789 { SOLVER_REASON_SUPPLEMENTED, "supplemented" },
1794 testcase_reason2str(Id reason)
1797 for (i = 0; reason2str[i].str; i++)
1798 if (reason == reason2str[i].reason)
1799 return reason2str[i].str;
1803 static struct rclass2str {
1807 { SOLVER_RULE_PKG, "pkg" },
1808 { SOLVER_RULE_UPDATE, "update" },
1809 { SOLVER_RULE_FEATURE, "feature" },
1810 { SOLVER_RULE_JOB, "job" },
1811 { SOLVER_RULE_DISTUPGRADE, "distupgrade" },
1812 { SOLVER_RULE_INFARCH, "infarch" },
1813 { SOLVER_RULE_CHOICE, "choice" },
1814 { SOLVER_RULE_LEARNT, "learnt" },
1815 { SOLVER_RULE_BEST, "best" },
1816 { SOLVER_RULE_YUMOBS, "yumobs" },
1821 testcase_rclass2str(Id rclass)
1824 for (i = 0; rclass2str[i].str; i++)
1825 if (rclass == rclass2str[i].rclass)
1826 return rclass2str[i].str;
1831 dump_genid(Pool *pool, Strqueue *sq, Id id, int cnt)
1839 Reldep *rd = GETRELDEP(pool, id);
1840 for (op = oplist; op->flags; op++)
1841 if (rd->flags == op->flags)
1843 cnt = dump_genid(pool, sq, rd->name, cnt);
1844 cnt = dump_genid(pool, sq, rd->evr, cnt);
1845 sprintf(cntbuf, "genid %2d: genid ", cnt++);
1846 s = pool_tmpjoin(pool, cntbuf, "op ", op->flags ? op->opname : "unknown");
1850 sprintf(cntbuf, "genid %2d: genid ", cnt++);
1851 s = pool_tmpjoin(pool, cntbuf, id ? "lit " : "null", id ? pool_id2str(pool, id) : 0);
1853 strqueue_push(sq, s);
1858 testcase_solverresult(Solver *solv, int resultflags)
1860 Pool *pool = solv->pool;
1868 if ((resultflags & TESTCASE_RESULT_TRANSACTION) != 0)
1870 Transaction *trans = solver_create_transaction(solv);
1874 for (i = 0; class2str[i].str; i++)
1877 transaction_classify_pkgs(trans, SOLVER_TRANSACTION_KEEP_PSEUDO, class2str[i].class, 0, 0, &q);
1878 for (j = 0; j < q.count; j++)
1882 if (pool->installed && pool->solvables[p].repo == pool->installed)
1883 op = transaction_obs_pkg(trans, p);
1884 s = pool_tmpjoin(pool, class2str[i].str, " ", testcase_solvid2str(pool, p));
1886 s = pool_tmpjoin(pool, s, " ", testcase_solvid2str(pool, op));
1887 strqueue_push(&sq, s);
1891 transaction_free(trans);
1893 if ((resultflags & TESTCASE_RESULT_PROBLEMS) != 0)
1895 char *probprefix, *solprefix;
1896 int problem, solution, element;
1899 pcnt = solver_problem_count(solv);
1900 for (problem = 1; problem <= pcnt; problem++)
1902 Id rid, from, to, dep;
1903 SolverRuleinfo rinfo;
1904 rid = solver_findproblemrule(solv, problem);
1905 s = testcase_problemid(solv, problem);
1906 probprefix = solv_dupjoin("problem ", s, 0);
1907 rinfo = solver_ruleinfo(solv, rid, &from, &to, &dep);
1908 s = pool_tmpjoin(pool, probprefix, " info ", solver_problemruleinfo2str(solv, rinfo, from, to, dep));
1909 strqueue_push(&sq, s);
1910 scnt = solver_solution_count(solv, problem);
1911 for (solution = 1; solution <= scnt; solution++)
1913 s = testcase_solutionid(solv, problem, solution);
1914 solprefix = solv_dupjoin(probprefix, " solution ", s);
1916 while ((element = solver_next_solutionelement(solv, problem, solution, element, &p, &op)) != 0)
1918 if (p == SOLVER_SOLUTION_JOB)
1919 s = pool_tmpjoin(pool, solprefix, " deljob ", testcase_job2str(pool, solv->job.elements[op - 1], solv->job.elements[op]));
1920 else if (p > 0 && op == 0)
1921 s = pool_tmpjoin(pool, solprefix, " erase ", testcase_solvid2str(pool, p));
1922 else if (p > 0 && op > 0)
1924 s = pool_tmpjoin(pool, solprefix, " replace ", testcase_solvid2str(pool, p));
1925 s = pool_tmpappend(pool, s, " ", testcase_solvid2str(pool, op));
1927 else if (p < 0 && op > 0)
1928 s = pool_tmpjoin(pool, solprefix, " allow ", testcase_solvid2str(pool, op));
1930 s = pool_tmpjoin(pool, solprefix, " unknown", 0);
1931 strqueue_push(&sq, s);
1933 solv_free(solprefix);
1935 solv_free(probprefix);
1939 if ((resultflags & TESTCASE_RESULT_ORPHANED) != 0)
1944 solver_get_orphaned(solv, &q);
1945 for (i = 0; i < q.count; i++)
1947 s = pool_tmpjoin(pool, "orphaned ", testcase_solvid2str(pool, q.elements[i]), 0);
1948 strqueue_push(&sq, s);
1953 if ((resultflags & TESTCASE_RESULT_RECOMMENDED) != 0)
1959 solver_get_recommendations(solv, &qr, &qs, 0);
1960 for (i = 0; i < qr.count; i++)
1962 s = pool_tmpjoin(pool, "recommended ", testcase_solvid2str(pool, qr.elements[i]), 0);
1963 strqueue_push(&sq, s);
1965 for (i = 0; i < qs.count; i++)
1967 s = pool_tmpjoin(pool, "suggested ", testcase_solvid2str(pool, qs.elements[i]), 0);
1968 strqueue_push(&sq, s);
1974 if ((resultflags & TESTCASE_RESULT_UNNEEDED) != 0)
1980 solver_get_unneeded(solv, &q, 0);
1981 solver_get_unneeded(solv, &qf, 1);
1982 for (i = j = 0; i < q.count; i++)
1984 /* we rely on qf containing a subset of q in the same order */
1985 if (j < qf.count && q.elements[i] == qf.elements[j])
1987 s = pool_tmpjoin(pool, "unneeded_filtered ", testcase_solvid2str(pool, q.elements[i]), 0);
1991 s = pool_tmpjoin(pool, "unneeded ", testcase_solvid2str(pool, q.elements[i]), 0);
1992 strqueue_push(&sq, s);
1997 if ((resultflags & TESTCASE_RESULT_ALTERNATIVES) != 0)
2005 cnt = solver_alternatives_count(solv);
2006 for (alternative = 1; alternative <= cnt; alternative++)
2008 Id id, from, chosen;
2010 int type = solver_get_alternative(solv, alternative, &id, &from, &chosen, &q, 0);
2011 altprefix = solv_dupjoin("alternative ", testcase_alternativeid(solv, type, id, from), " ");
2013 if (type == SOLVER_ALTERNATIVE_TYPE_RECOMMENDS)
2015 char *s = pool_tmpjoin(pool, altprefix, num, testcase_solvid2str(pool, from));
2016 s = pool_tmpappend(pool, s, " recommends ", testcase_dep2str(pool, id));
2017 strqueue_push(&sq, s);
2019 else if (type == SOLVER_ALTERNATIVE_TYPE_RULE)
2021 /* map choice rules back to pkg rules */
2022 if (solver_ruleclass(solv, id) == SOLVER_RULE_CHOICE)
2023 id = solver_rule2pkgrule(solv, id);
2024 solver_allruleinfos(solv, id, &rq);
2025 for (i = 0; i < rq.count; i += 4)
2027 int rtype = rq.elements[i];
2028 if ((rtype & SOLVER_RULE_TYPEMASK) == SOLVER_RULE_JOB)
2030 const char *js = testcase_job2str(pool, rq.elements[i + 2], rq.elements[i + 3]);
2031 char *s = pool_tmpjoin(pool, altprefix, num, " job ");
2032 s = pool_tmpappend(pool, s, js, 0);
2033 strqueue_push(&sq, s);
2035 else if (rtype == SOLVER_RULE_PKG_REQUIRES)
2037 char *s = pool_tmpjoin(pool, altprefix, num, testcase_solvid2str(pool, rq.elements[i + 1]));
2038 s = pool_tmpappend(pool, s, " requires ", testcase_dep2str(pool, rq.elements[i + 3]));
2039 strqueue_push(&sq, s);
2043 for (i = 0; i < q.count; i++)
2045 Id p = q.elements[i];
2047 num[0] = '0' + (i + 1) / 10;
2048 num[1] = '0' + (i + 1) % 10;
2050 s = pool_tmpjoin(pool, altprefix, num, "+ ");
2052 s = pool_tmpjoin(pool, altprefix, num, "- ");
2054 s = pool_tmpjoin(pool, altprefix, num, " ");
2055 s = pool_tmpappend(pool, s, testcase_solvid2str(pool, p < 0 ? -p : p), 0);
2056 strqueue_push(&sq, s);
2058 solv_free(altprefix);
2063 if ((resultflags & TESTCASE_RESULT_RULES) != 0)
2065 /* dump all rules */
2067 SolverRuleinfo rclass;
2072 for (rid = 1; (rclass = solver_ruleclass(solv, rid)) != SOLVER_RULE_UNKNOWN; rid++)
2074 char *prefix = solv_dupjoin("rule ", testcase_rclass2str(rclass), " ");
2075 prefix = solv_dupappend(prefix, testcase_ruleid(solv, rid), 0);
2076 solver_ruleliterals(solv, rid, &q);
2077 if (rclass == SOLVER_RULE_FEATURE && q.count == 1 && q.elements[0] == -SYSTEMSOLVABLE)
2079 for (i = 0; i < q.count; i++)
2081 Id p = q.elements[i];
2084 s = pool_tmpjoin(pool, prefix, " -", testcase_solvid2str(pool, -p));
2086 s = pool_tmpjoin(pool, prefix, " ", testcase_solvid2str(pool, p));
2087 strqueue_push(&sq, s);
2093 if ((resultflags & TESTCASE_RESULT_GENID) != 0)
2095 for (i = 0 ; i < solv->job.count; i += 2)
2098 if (solv->job.elements[i] != (SOLVER_NOOP | SOLVER_SOLVABLE_PROVIDES))
2100 id = solv->job.elements[i + 1];
2101 s = testcase_dep2str(pool, id);
2102 strqueue_push(&sq, pool_tmpjoin(pool, "genid dep ", s, 0));
2103 if ((id2 = testcase_str2dep(pool, s)) != id)
2105 s = pool_tmpjoin(pool, "genid roundtrip error: ", testcase_dep2str(pool, id2), 0);
2106 strqueue_push(&sq, s);
2108 dump_genid(pool, &sq, id, 1);
2111 if ((resultflags & TESTCASE_RESULT_REASON) != 0)
2115 FOR_POOL_SOLVABLES(p)
2118 int reason = solver_describe_decision(solv, p, &info);
2119 if (reason == SOLVER_REASON_UNRELATED)
2121 if (reason == SOLVER_REASON_WEAKDEP)
2123 solver_describe_weakdep_decision(solv, p, &whyq);
2126 for (i = 0; i < whyq.count; i += 3)
2128 reason = whyq.elements[i];
2129 p2 = whyq.elements[i + 1];
2130 id = whyq.elements[i + 2];
2131 s = pool_tmpjoin(pool, "reason ", testcase_solvid2str(pool, p), 0);
2132 s = pool_tmpappend(pool, s, " ", testcase_reason2str(reason));
2133 s = pool_tmpappend(pool, s, " ", testcase_dep2str(pool, id));
2135 s = pool_tmpappend(pool, s, " ", testcase_solvid2str(pool, p2));
2136 strqueue_push(&sq, s);
2141 s = pool_tmpjoin(pool, "reason ", testcase_solvid2str(pool, p), 0);
2142 s = pool_tmpappend(pool, s, " ", testcase_reason2str(reason));
2144 s = pool_tmpappend(pool, s, " ", testcase_ruleid(solv, info));
2145 strqueue_push(&sq, s);
2149 if ((resultflags & TESTCASE_RESULT_CLEANDEPS) != 0)
2154 solver_get_cleandeps(solv, &q);
2155 for (i = 0; i < q.count; i++)
2157 s = pool_tmpjoin(pool, "cleandeps ", testcase_solvid2str(pool, q.elements[i]), 0);
2158 strqueue_push(&sq, s);
2162 if ((resultflags & TESTCASE_RESULT_JOBS) != 0)
2164 for (i = 0; i < solv->job.count; i += 2)
2166 s = (char *)testcase_job2str(pool, solv->job.elements[i], solv->job.elements[i + 1]);
2167 s = pool_tmpjoin(pool, "job ", s, 0);
2168 strqueue_push(&sq, s);
2172 result = strqueue_join(&sq);
2179 testcase_write_mangled(Solver *solv, const char *dir, int resultflags, const char *testcasename, const char *resultname)
2181 Pool *pool = solv->pool;
2192 testcasename = "testcase.t";
2194 resultname = "solver.result";
2196 if (mkdir(dir, 0777) && errno != EEXIST)
2197 return pool_error(solv->pool, 0, "testcase_write: could not create directory '%s'", dir);
2199 FOR_REPOS(repoid, repo)
2201 const char *name = testcase_repoid2str(pool, repoid);
2203 if (repo->subpriority)
2204 sprintf(priobuf, "%d.%d", repo->priority, repo->subpriority);
2206 sprintf(priobuf, "%d", repo->priority);
2207 out = pool_tmpjoin(pool, name, ".repo", ".gz");
2208 for (i = 0; out[i]; i++)
2211 cmd = pool_tmpjoin(pool, "repo ", name, " ");
2212 cmd = pool_tmpappend(pool, cmd, priobuf, " ");
2213 cmd = pool_tmpappend(pool, cmd, "testtags ", out);
2214 strqueue_push(&sq, cmd);
2215 out = pool_tmpjoin(pool, dir, "/", out);
2216 if (!(fp = solv_xfopen(out, "w")))
2218 pool_error(solv->pool, 0, "testcase_write: could not open '%s' for writing", out);
2222 testcase_write_testtags(repo, fp);
2225 pool_error(solv->pool, 0, "testcase_write: write error");
2230 /* hmm, this is not optimal... we currently search for the lowest score */
2232 arch = pool->solvables[SYSTEMSOLVABLE].arch;
2233 for (i = 0; i < pool->lastarch; i++)
2235 if (pool->id2arch[i] == 1 && !lowscore)
2237 if (pool->id2arch[i] > 0x10000 && (!lowscore || pool->id2arch[i] < lowscore))
2240 lowscore = pool->id2arch[i];
2243 cmd = pool_tmpjoin(pool, "system ", pool->lastarch ? pool_id2str(pool, arch) : "unset", 0);
2244 for (i = 0; disttype2str[i].str != 0; i++)
2245 if (pool->disttype == disttype2str[i].type)
2247 pool_tmpappend(pool, cmd, " ", disttype2str[i].str ? disttype2str[i].str : "unknown");
2248 if (pool->installed)
2249 cmd = pool_tmpappend(pool, cmd, " ", testcase_repoid2str(pool, pool->installed->repoid));
2250 strqueue_push(&sq, cmd);
2251 s = testcase_getpoolflags(solv->pool);
2254 cmd = pool_tmpjoin(pool, "poolflags ", s, 0);
2255 strqueue_push(&sq, cmd);
2258 if (pool->vendorclasses)
2261 for (i = 0; pool->vendorclasses[i]; i++)
2263 cmd = pool_tmpappend(pool, cmd ? cmd : "vendorclass", " ", pool->vendorclasses[i]);
2264 if (!pool->vendorclasses[i + 1])
2266 strqueue_push(&sq, cmd);
2273 /* dump disabled packages (must come before the namespace/job lines) */
2274 if (pool->considered)
2277 FOR_POOL_SOLVABLES(p)
2278 if (!MAPTST(pool->considered, p))
2280 cmd = pool_tmpjoin(pool, "disable pkg ", testcase_solvid2str(pool, p), 0);
2281 strqueue_push(&sq, cmd);
2285 s = testcase_getsolverflags(solv);
2288 cmd = pool_tmpjoin(pool, "solverflags ", s, 0);
2289 strqueue_push(&sq, cmd);
2292 /* now dump all the ns callback values we know */
2293 if (pool->nscallback)
2297 for (rid = 1; rid < pool->nrels; rid++)
2299 Reldep *rd = pool->rels + rid;
2300 if (rd->flags != REL_NAMESPACE || rd->name == NAMESPACE_OTHERPROVIDERS)
2302 /* evaluate all namespace ids, skip empty results */
2303 d = pool_whatprovides(pool, MAKERELDEP(rid));
2304 if (!d || !pool->whatprovidesdata[d])
2306 cmd = pool_tmpjoin(pool, "namespace ", pool_id2str(pool, rd->name), "(");
2307 cmd = pool_tmpappend(pool, cmd, pool_id2str(pool, rd->evr), ")");
2308 for (; pool->whatprovidesdata[d]; d++)
2309 cmd = pool_tmpappend(pool, cmd, " ", testcase_solvid2str(pool, pool->whatprovidesdata[d]));
2310 strqueue_push(&sq, cmd);
2314 for (i = 0; i < solv->job.count; i += 2)
2316 cmd = (char *)testcase_job2str(pool, solv->job.elements[i], solv->job.elements[i + 1]);
2317 cmd = pool_tmpjoin(pool, "job ", cmd, 0);
2318 strqueue_push(&sq, cmd);
2321 if ((resultflags & ~TESTCASE_RESULT_REUSE_SOLVER) != 0)
2325 for (i = 0; resultflags2str[i].str; i++)
2326 if ((resultflags & resultflags2str[i].flag) != 0)
2327 cmd = pool_tmpappend(pool, cmd, cmd ? "," : 0, resultflags2str[i].str);
2328 cmd = pool_tmpjoin(pool, "result ", cmd ? cmd : "?", 0);
2329 cmd = pool_tmpappend(pool, cmd, " ", resultname);
2330 strqueue_push(&sq, cmd);
2331 result = testcase_solverresult(solv, resultflags);
2332 if (!strcmp(resultname, "<inline>"))
2336 strqueue_init(&rsq);
2337 strqueue_split(&rsq, result);
2338 for (i = 0; i < rsq.nstr; i++)
2340 cmd = pool_tmpjoin(pool, "#>", rsq.str[i], 0);
2341 strqueue_push(&sq, cmd);
2343 strqueue_free(&rsq);
2347 out = pool_tmpjoin(pool, dir, "/", resultname);
2348 if (!(fp = fopen(out, "w")))
2350 pool_error(solv->pool, 0, "testcase_write: could not open '%s' for writing", out);
2355 if (result && *result && fwrite(result, strlen(result), 1, fp) != 1)
2357 pool_error(solv->pool, 0, "testcase_write: write error");
2365 pool_error(solv->pool, 0, "testcase_write: write error");
2373 cmd = strqueue_join(&sq);
2374 out = pool_tmpjoin(pool, dir, "/", testcasename);
2375 if (!(fp = fopen(out, "w")))
2377 pool_error(solv->pool, 0, "testcase_write: could not open '%s' for writing", out);
2381 if (*cmd && fwrite(cmd, strlen(cmd), 1, fp) != 1)
2383 pool_error(solv->pool, 0, "testcase_write: write error");
2390 pool_error(solv->pool, 0, "testcase_write: write error");
2400 testcase_write(Solver *solv, const char *dir, int resultflags, const char *testcasename, const char *resultname)
2402 Pool *pool = solv->pool;
2405 const char **orignames;
2407 /* mangle repo names so that there are no conflicts */
2408 orignames = solv_calloc(pool->nrepos, sizeof(char *));
2409 for (repoid = 1; repoid < pool->nrepos; repoid++)
2411 Repo *repo = pool_id2repo(pool, repoid);
2412 char *buf = solv_malloc((repo->name ? strlen(repo->name) : 0) + 40);
2414 orignames[repoid] = repo->name;
2415 if (!repo->name || !repo->name[0])
2416 sprintf(buf, "#%d", repoid);
2418 strcpy(buf, repo->name);
2419 for (i = 0; buf[i]; i++)
2420 if (buf[i] == ' ' || buf[i] == '\t' || buf[i] == '/')
2422 mp = buf + strlen(buf);
2425 for (i = 1; i < repoid; i++)
2426 if (!strcmp(buf, pool_id2repo(pool, i)->name))
2430 sprintf(mp, "_%d", mangle++);
2434 r = testcase_write_mangled(solv, dir, resultflags, testcasename, resultname);
2435 for (repoid = 1; repoid < pool->nrepos; repoid++)
2437 Repo *repo = pool_id2repo(pool, repoid);
2438 solv_free((void *)repo->name);
2439 repo->name = orignames[repoid];
2441 solv_free(orignames);
2446 read_inline_file(FILE *fp, char **bufp, char **bufpp, int *buflp)
2448 char *result = solv_malloc(1024);
2455 if (rp - result + 256 >= resultl)
2457 resultl = rp - result;
2458 result = solv_realloc(result, resultl + 1024);
2459 rp = result + resultl;
2462 if (!fgets(rp, resultl - (rp - result), fp))
2465 if (rl && (rp == result || rp[-1] == '\n'))
2467 if (rl > 1 && rp[0] == '#' && rp[1] == '>')
2469 memmove(rp, rp + 2, rl - 2);
2474 while (rl + 16 > *buflp)
2476 *bufp = solv_realloc(*bufp, *buflp + 512);
2479 memmove(*bufp, rp, rl);
2480 if ((*bufp)[rl - 1] == '\n')
2486 (*bufpp) = *bufp + rl;
2503 char *result = solv_malloc(1024);
2510 if (rp - result + 256 >= resultl)
2512 resultl = rp - result;
2513 result = solv_realloc(result, resultl + 1024);
2514 rp = result + resultl;
2517 rl = fread(rp, 1, resultl - (rp - result), fp);
2529 str2resultflags(Pool *pool, char *s) /* modifies the string! */
2531 int i, resultflags = 0;
2534 char *se = strchr(s, ',');
2537 for (i = 0; resultflags2str[i].str; i++)
2538 if (!strcmp(s, resultflags2str[i].str))
2540 resultflags |= resultflags2str[i].flag;
2543 if (!resultflags2str[i].str)
2544 pool_error(pool, 0, "result: unknown flag '%s'", s);
2551 testcase_read(Pool *pool, FILE *fp, const char *testcase, Queue *job, char **resultp, int *resultflagsp)
2556 char *testcasedir, *s;
2562 int poolflagsreset = 0;
2563 int missing_features = 0;
2572 if (!fp && !(fp = fopen(testcase, "r")))
2574 pool_error(pool, 0, "testcase_read: could not open '%s'", testcase);
2577 testcasedir = solv_strdup(testcase);
2578 if ((s = strrchr(testcasedir, '/')) != 0)
2583 buf = solv_malloc(bufl);
2586 queue_init(&autoinstq);
2589 if (bufp - buf + 16 > bufl)
2592 buf = solv_realloc(buf, bufl + 512);
2596 if (!fgets(bufp, bufl - (bufp - buf), fp))
2600 if (!l || buf[l - 1] != '\n')
2607 while (*s && (*s == ' ' || *s == '\t'))
2609 if (!*s || *s == '#')
2612 /* split it in pieces */
2615 while (*s == ' ' || *s == '\t')
2619 pieces = solv_extend(pieces, npieces, 1, sizeof(*pieces), 7);
2620 pieces[npieces++] = s;
2621 while (*s && *s != ' ' && *s != '\t')
2626 pieces = solv_extend(pieces, npieces, 1, sizeof(*pieces), 7);
2627 pieces[npieces] = 0;
2628 if (!strcmp(pieces[0], "repo") && npieces >= 4)
2630 Repo *repo = repo_create(pool, pieces[1]);
2636 if (!poolflagsreset)
2639 testcase_resetpoolflags(pool); /* hmm */
2641 if (sscanf(pieces[2], "%d.%d", &prio, &subprio) != 2)
2644 prio = atoi(pieces[2]);
2646 repo->priority = prio;
2647 repo->subpriority = subprio;
2648 if (strcmp(pieces[3], "empty") != 0)
2650 const char *repotype = pool_tmpjoin(pool, pieces[3], 0, 0); /* gets overwritten in <inline> case */
2651 if (!strcmp(pieces[4], "<inline>"))
2653 char *idata = read_inline_file(fp, &buf, &bufp, &bufl);
2655 rfp = solv_xfopen_buf(rdata, &idata, 0, "rf");
2659 rdata = pool_tmpjoin(pool, testcasedir, pieces[4], 0);
2660 rfp = solv_xfopen(rdata, "r");
2664 pool_error(pool, 0, "testcase_read: could not open '%s'", rdata);
2666 else if (!strcmp(repotype, "testtags"))
2668 testcase_add_testtags(repo, rfp, 0);
2671 else if (!strcmp(repotype, "solv"))
2673 repo_add_solv(repo, rfp, 0);
2676 #if ENABLE_TESTCASE_HELIXREPO
2677 else if (!strcmp(repotype, "helix"))
2679 repo_add_helix(repo, rfp, 0);
2686 pool_error(pool, 0, "testcase_read: unknown repo type for repo '%s'", repo->name);
2690 else if (!strcmp(pieces[0], "system") && npieces >= 3)
2694 /* must set the disttype before the arch */
2696 if (strcmp(pieces[2], "*") != 0)
2698 char *dp = pieces[2];
2701 char *dpe = strchr(dp, ',');
2704 for (i = 0; disttype2str[i].str != 0; i++)
2705 if (!strcmp(disttype2str[i].str, dp))
2709 if (disttype2str[i].str)
2711 #ifdef MULTI_SEMANTICS
2712 if (pool->disttype != disttype2str[i].type)
2713 pool_setdisttype(pool, disttype2str[i].type);
2715 if (pool->disttype == disttype2str[i].type)
2722 pool_error(pool, 0, "testcase_read: system: could not change disttype to '%s'", pieces[2]);
2723 missing_features = 1;
2726 if (strcmp(pieces[1], "unset") == 0)
2727 pool_setarch(pool, 0);
2728 else if (pieces[1][0] == ':')
2729 pool_setarchpolicy(pool, pieces[1] + 1);
2731 pool_setarch(pool, pieces[1]);
2734 Repo *repo = testcase_str2repo(pool, pieces[3]);
2736 pool_error(pool, 0, "testcase_read: system: unknown repo '%s'", pieces[3]);
2738 pool_set_installed(pool, repo);
2741 else if (!strcmp(pieces[0], "job") && npieces > 1)
2747 pool_addfileprovides(pool);
2748 pool_createwhatprovides(pool);
2751 if (npieces >= 3 && !strcmp(pieces[2], "selection"))
2753 addselectionjob(pool, pieces + 1, npieces - 1, job, 0, 0);
2756 if (npieces >= 4 && !strcmp(pieces[2], "selection_matchdeps"))
2758 pieces[2] = pieces[1];
2759 addselectionjob(pool, pieces + 2, npieces - 2, job, SELECTIONJOB_MATCHDEPS, pool_str2id(pool, pieces[3], 1));
2762 if (npieces >= 4 && !strcmp(pieces[2], "selection_matchdepid"))
2764 pieces[2] = pieces[1];
2765 addselectionjob(pool, pieces + 2, npieces - 2, job, SELECTIONJOB_MATCHDEPID, pool_str2id(pool, pieces[3], 1));
2768 if (npieces >= 4 && !strcmp(pieces[2], "selection_matchsolvable"))
2770 pieces[2] = pieces[1];
2771 addselectionjob(pool, pieces + 2, npieces - 2, job, SELECTIONJOB_MATCHSOLVABLE, pool_str2id(pool, pieces[3], 1));
2775 for (sp = pieces[1]; sp < pieces[npieces - 1]; sp++)
2778 how = testcase_str2job(pool, pieces[1], &what);
2779 if (how >= 0 && job)
2780 queue_push2(job, how, what);
2782 else if (!strcmp(pieces[0], "vendorclass") && npieces > 1)
2784 pool_addvendorclass(pool, (const char **)(pieces + 1));
2786 else if (!strcmp(pieces[0], "namespace") && npieces > 1)
2788 int i = strlen(pieces[1]);
2789 s = strchr(pieces[1], '(');
2790 if (!s && pieces[1][i - 1] != ')')
2792 pool_error(pool, 0, "testcase_read: bad namespace '%s'", pieces[1]);
2800 pieces[1][i - 1] = 0;
2801 name = pool_str2id(pool, pieces[1], 1);
2802 evr = pool_str2id(pool, s + 1, 1);
2804 pieces[1][i - 1] = ')';
2805 id = pool_rel2id(pool, name, evr, REL_NAMESPACE, 1);
2806 for (i = 2; i < npieces; i++)
2807 queue_push(&q, testcase_str2solvid(pool, pieces[i]));
2808 /* now do the callback */
2811 pool_addfileprovides(pool);
2812 pool_createwhatprovides(pool);
2815 pool->whatprovides_rel[GETRELID(id)] = pool_queuetowhatprovides(pool, &q);
2819 else if (!strcmp(pieces[0], "poolflags"))
2822 if (!poolflagsreset)
2825 testcase_resetpoolflags(pool); /* hmm */
2827 for (i = 1; i < npieces; i++)
2828 testcase_setpoolflags(pool, pieces[i]);
2830 else if (!strcmp(pieces[0], "solverflags") && npieces > 1)
2835 solv = solver_create(pool);
2836 testcase_resetsolverflags(solv);
2838 for (i = 1; i < npieces; i++)
2839 testcase_setsolverflags(solv, pieces[i]);
2841 else if (!strcmp(pieces[0], "result") && npieces > 1)
2844 int resultflags = str2resultflags(pool, pieces[1]);
2848 rdata = pool_tmpjoin(pool, testcasedir, pieces[2], 0);
2849 if (!strcmp(pieces[2], "<inline>"))
2850 result = read_inline_file(fp, &buf, &bufp, &bufl);
2853 FILE *rfp = fopen(rdata, "r");
2855 pool_error(pool, 0, "testcase_read: could not open '%s'", rdata);
2858 result = read_file(rfp);
2868 *resultflagsp = resultflags;
2870 else if (!strcmp(pieces[0], "nextjob"))
2872 if (npieces == 2 && resultflagsp && !strcmp(pieces[1], "reusesolver"))
2873 *resultflagsp |= TESTCASE_RESULT_REUSE_SOLVER;
2876 else if (!strcmp(pieces[0], "disable") && npieces == 3)
2879 if (strcmp(pieces[1], "pkg"))
2881 pool_error(pool, 0, "testcase_read: bad disable type '%s'", pieces[1]);
2885 pool_createwhatprovides(pool);
2887 if (!pool->considered)
2889 pool->considered = solv_calloc(1, sizeof(Map));
2890 map_init(pool->considered, pool->nsolvables);
2891 map_setall(pool->considered);
2893 p = testcase_str2solvid(pool, pieces[2]);
2895 MAPCLR(pool->considered, p);
2897 pool_error(pool, 0, "disable: unknown package '%s'", pieces[2]);
2899 else if (!strcmp(pieces[0], "feature"))
2902 for (i = 1; i < npieces; i++)
2904 for (j = 0; features[j]; j++)
2905 if (!strcmp(pieces[i], features[j]))
2909 pool_error(pool, 0, "testcase_read: missing feature '%s'", pieces[i]);
2913 if (missing_features)
2916 else if (!strcmp(pieces[0], "genid") && npieces > 1)
2923 for (sp = pieces[2]; sp < pieces[npieces - 1]; sp++)
2927 genid = solv_extend(genid, ngenid, 1, sizeof(*genid), 7);
2928 if (!strcmp(pieces[1], "op") && npieces > 2)
2931 for (op = oplist; op->flags; op++)
2932 if (!strncmp(pieces[2], op->opname, strlen(op->opname)))
2936 pool_error(pool, 0, "testcase_read: genid: unknown op '%s'", pieces[2]);
2941 pool_error(pool, 0, "testcase_read: genid: out of stack");
2945 id = pool_rel2id(pool, genid[ngenid] , genid[ngenid + 1], op->flags, 1);
2947 else if (!strcmp(pieces[1], "lit"))
2948 id = pool_str2id(pool, npieces > 2 ? pieces[2] : "", 1);
2949 else if (!strcmp(pieces[1], "null"))
2951 else if (!strcmp(pieces[1], "dep"))
2952 id = testcase_str2dep(pool, pieces[2]);
2955 pool_error(pool, 0, "testcase_read: genid: unknown command '%s'", pieces[1]);
2958 genid[ngenid++] = id;
2960 else if (!strcmp(pieces[0], "autoinst") && npieces > 2)
2962 if (strcmp(pieces[1], "name"))
2964 pool_error(pool, 0, "testcase_read: autoinst: illegal mode");
2967 queue_push(&autoinstq, pool_str2id(pool, pieces[2], 1));
2971 pool_error(pool, 0, "testcase_read: cannot parse command '%s'", pieces[0]);
2974 while (job && ngenid > 0)
2975 queue_push2(job, SOLVER_NOOP | SOLVER_SOLVABLE_PROVIDES, genid[--ngenid]);
2976 if (autoinstq.count)
2977 pool_add_userinstalled_jobs(pool, &autoinstq, job, GET_USERINSTALLED_NAMES | GET_USERINSTALLED_INVERTED);
2978 queue_free(&autoinstq);
2979 genid = solv_free(genid);
2980 buf = solv_free(buf);
2981 pieces = solv_free(pieces);
2982 solv_free(testcasedir);
2985 pool_addfileprovides(pool);
2986 pool_createwhatprovides(pool);
2990 solv = solver_create(pool);
2991 testcase_resetsolverflags(solv);
2995 if (missing_features)
3000 *resultflagsp = 77; /* hack for testsolv */
3006 testcase_resultdiff(const char *result1, const char *result2)
3008 Strqueue sq1, sq2, osq;
3010 strqueue_init(&sq1);
3011 strqueue_init(&sq2);
3012 strqueue_init(&osq);
3013 strqueue_split(&sq1, result1);
3014 strqueue_split(&sq2, result2);
3015 strqueue_sort(&sq1);
3016 strqueue_sort(&sq2);
3017 strqueue_diff(&sq1, &sq2, &osq);
3018 r = osq.nstr ? strqueue_join(&osq) : 0;
3019 strqueue_free(&sq1);
3020 strqueue_free(&sq2);
3021 strqueue_free(&osq);