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"
28 #include "tools_util.h"
30 static struct job2str {
34 { SOLVER_NOOP, "noop" },
35 { SOLVER_INSTALL, "install" },
36 { SOLVER_ERASE, "erase" },
37 { SOLVER_UPDATE, "update" },
38 { SOLVER_WEAKENDEPS, "weakendeps" },
39 { SOLVER_MULTIVERSION, "multiversion" },
40 { SOLVER_MULTIVERSION, "noobsoletes" }, /* old name */
41 { SOLVER_LOCK, "lock" },
42 { SOLVER_DISTUPGRADE, "distupgrade" },
43 { SOLVER_VERIFY, "verify" },
44 { SOLVER_DROP_ORPHANED, "droporphaned" },
45 { SOLVER_USERINSTALLED, "userinstalled" },
46 { SOLVER_ALLOWUNINSTALL, "allowuninstall" },
47 { SOLVER_FAVOR, "favor" },
48 { SOLVER_DISFAVOR, "disfavor" },
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" },
84 { TESTCASE_RESULT_REASON, "reason" },
88 static struct solverflags2str {
92 } solverflags2str[] = {
93 { SOLVER_FLAG_ALLOW_DOWNGRADE, "allowdowngrade", 0 },
94 { SOLVER_FLAG_ALLOW_NAMECHANGE, "allownamechange", 1 },
95 { SOLVER_FLAG_ALLOW_ARCHCHANGE, "allowarchchange", 0 },
96 { SOLVER_FLAG_ALLOW_VENDORCHANGE, "allowvendorchange", 0 },
97 { SOLVER_FLAG_ALLOW_UNINSTALL, "allowuninstall", 0 },
98 { SOLVER_FLAG_NO_UPDATEPROVIDE, "noupdateprovide", 0 },
99 { SOLVER_FLAG_SPLITPROVIDES, "splitprovides", 0 },
100 { SOLVER_FLAG_IGNORE_RECOMMENDED, "ignorerecommended", 0 },
101 { SOLVER_FLAG_ADD_ALREADY_RECOMMENDED, "addalreadyrecommended", 0 },
102 { SOLVER_FLAG_NO_INFARCHCHECK, "noinfarchcheck", 0 },
103 { SOLVER_FLAG_KEEP_EXPLICIT_OBSOLETES, "keepexplicitobsoletes", 0 },
104 { SOLVER_FLAG_BEST_OBEY_POLICY, "bestobeypolicy", 0 },
105 { SOLVER_FLAG_NO_AUTOTARGET, "noautotarget", 0 },
106 { SOLVER_FLAG_DUP_ALLOW_DOWNGRADE, "dupallowdowngrade", 1 },
107 { SOLVER_FLAG_DUP_ALLOW_ARCHCHANGE, "dupallowarchchange", 1 },
108 { SOLVER_FLAG_DUP_ALLOW_VENDORCHANGE, "dupallowvendorchange", 1 },
109 { SOLVER_FLAG_DUP_ALLOW_NAMECHANGE, "dupallownamechange", 1 },
110 { SOLVER_FLAG_KEEP_ORPHANS, "keeporphans", 0 },
111 { SOLVER_FLAG_BREAK_ORPHANS, "breakorphans", 0 },
112 { SOLVER_FLAG_FOCUS_INSTALLED, "focusinstalled", 0 },
113 { SOLVER_FLAG_YUM_OBSOLETES, "yumobsoletes", 0 },
114 { SOLVER_FLAG_NEED_UPDATEPROVIDE, "needupdateprovide", 0 },
115 { SOLVER_FLAG_URPM_REORDER, "urpmreorder", 0 },
116 { SOLVER_FLAG_FOCUS_BEST, "focusbest", 0 },
117 { SOLVER_FLAG_STRONG_RECOMMENDS, "strongrecommends", 0 },
118 { SOLVER_FLAG_INSTALL_ALSO_UPDATES, "installalsoupdates", 0 },
122 static struct poolflags2str {
126 } poolflags2str[] = {
127 { POOL_FLAG_PROMOTEEPOCH, "promoteepoch", 0 },
128 { POOL_FLAG_FORBIDSELFCONFLICTS, "forbidselfconflicts", 0 },
129 { POOL_FLAG_OBSOLETEUSESPROVIDES, "obsoleteusesprovides", 0 },
130 { POOL_FLAG_IMPLICITOBSOLETEUSESPROVIDES, "implicitobsoleteusesprovides", 0 },
131 { POOL_FLAG_OBSOLETEUSESCOLORS, "obsoleteusescolors", 0 },
132 { POOL_FLAG_IMPLICITOBSOLETEUSESCOLORS, "implicitobsoleteusescolors", 0 },
133 { POOL_FLAG_NOINSTALLEDOBSOLETES, "noinstalledobsoletes", 0 },
134 { POOL_FLAG_HAVEDISTEPOCH, "havedistepoch", 0 },
135 { POOL_FLAG_NOOBSOLETESMULTIVERSION, "noobsoletesmultiversion", 0 },
136 { POOL_FLAG_ADDFILEPROVIDESFILTERED, "addfileprovidesfiltered", 0 },
137 { POOL_FLAG_NOWHATPROVIDESAUX, "nowhatprovidesaux", 0 },
141 static struct disttype2str {
145 { DISTTYPE_RPM, "rpm" },
146 { DISTTYPE_DEB, "deb" },
147 { DISTTYPE_ARCH, "arch" },
148 { DISTTYPE_HAIKU, "haiku" },
152 static struct selflags2str {
156 { SELECTION_NAME, "name" },
157 { SELECTION_PROVIDES, "provides" },
158 { SELECTION_FILELIST, "filelist" },
159 { SELECTION_CANON, "canon" },
160 { SELECTION_DOTARCH, "dotarch" },
161 { SELECTION_REL, "rel" },
162 { SELECTION_INSTALLED_ONLY, "installedonly" },
163 { SELECTION_GLOB, "glob" },
164 { SELECTION_FLAT, "flat" },
165 { SELECTION_NOCASE, "nocase" },
166 { SELECTION_SOURCE_ONLY, "sourceonly" },
167 { SELECTION_WITH_SOURCE, "withsource" },
171 static const char *features[] = {
172 #ifdef ENABLE_LINKED_PKGS
175 #ifdef ENABLE_COMPLEX_DEPS
181 typedef struct strqueue {
186 #define STRQUEUE_BLOCK 63
189 strqueue_init(Strqueue *q)
196 strqueue_free(Strqueue *q)
199 for (i = 0; i < q->nstr; i++)
200 solv_free(q->str[i]);
201 q->str = solv_free(q->str);
206 strqueue_push(Strqueue *q, const char *s)
208 q->str = solv_extend(q->str, q->nstr, 1, sizeof(*q->str), STRQUEUE_BLOCK);
209 q->str[q->nstr++] = solv_strdup(s);
213 strqueue_pushjoin(Strqueue *q, const char *s1, const char *s2, const char *s3)
215 q->str = solv_extend(q->str, q->nstr, 1, sizeof(*q->str), STRQUEUE_BLOCK);
216 q->str[q->nstr++] = solv_dupjoin(s1, s2, s3);
220 strqueue_sort_cmp(const void *ap, const void *bp, void *dp)
222 const char *a = *(const char **)ap;
223 const char *b = *(const char **)bp;
224 return strcmp(a ? a : "", b ? b : "");
228 strqueue_sort(Strqueue *q)
231 solv_sort(q->str, q->nstr, sizeof(*q->str), strqueue_sort_cmp, 0);
235 strqueue_sort_u(Strqueue *q)
239 for (i = j = 0; i < q->nstr; i++)
240 if (!j || strqueue_sort_cmp(q->str + i, q->str + j - 1, 0) != 0)
241 q->str[j++] = q->str[i];
246 strqueue_join(Strqueue *q)
250 for (i = 0; i < q->nstr; i++)
252 l += strlen(q->str[i]) + 1;
253 l++; /* trailing \0 */
256 for (i = 0; i < q->nstr; i++)
259 strcpy(rp, q->str[i]);
268 strqueue_split(Strqueue *q, const char *s)
273 while ((p = strchr(s, '\n')) != 0)
275 q->str = solv_extend(q->str, q->nstr, 1, sizeof(*q->str), STRQUEUE_BLOCK);
276 q->str[q->nstr] = solv_malloc(p - s + 1);
278 memcpy(q->str[q->nstr], s, p - s);
279 q->str[q->nstr][p - s] = 0;
288 strqueue_diff(Strqueue *sq1, Strqueue *sq2, Strqueue *osq)
291 while (i < sq1->nstr && j < sq2->nstr)
293 int r = strqueue_sort_cmp(sq1->str + i, sq2->str + j, 0);
297 strqueue_pushjoin(osq, "-", sq1->str[i++], 0);
299 strqueue_pushjoin(osq, "+", sq2->str[j++], 0);
301 while (i < sq1->nstr)
302 strqueue_pushjoin(osq, "-", sq1->str[i++], 0);
303 while (j < sq2->nstr)
304 strqueue_pushjoin(osq, "+", sq2->str[j++], 0);
309 testcase_id2str(Pool *pool, Id id, int isname)
311 const char *s = pool_id2str(pool, id);
314 int bad = 0, paren = 0, parenbad = 0;
320 if (strchr("[(<=>!", *s))
322 if (!strncmp(s, "namespace:", 10))
324 for (ss = s + bad; *ss; ss++)
326 if (*ss == ' ' || *ss == '\\' || *(unsigned char *)ss < 32 || *ss == '(' || *ss == ')')
329 paren = paren == 0 ? 1 : -1;
332 paren = paren == 1 ? 0 : -1;
337 if (isname && ss - s > 4 && !strcmp(ss - 4, ":any"))
339 if (!paren && !(bad - parenbad))
342 /* we need escaping! */
343 s2 = s2p = pool_alloctmpspace(pool, strlen(s) + bad * 2 + 1);
344 if (!strncmp(s, "namespace:", 10))
346 strcpy(s2p, "namespace\\3a");
354 if ((ss == s && strchr("[(<=>!", *s)) || *ss == ' ' || *ss == '\\' || *(unsigned char *)ss < 32 || *ss == '(' || *ss == ')')
357 solv_bin2hex((unsigned char *)ss, 1, s2p);
362 if (isname && s2p - s2 > 4 && !strcmp(s2p - 4, ":any"))
363 strcpy(s2p - 4, "\\3aany");
372 { REL_GT | REL_LT | REL_EQ, "<=>" },
373 { REL_LT | REL_EQ, "<=" },
374 { REL_GT | REL_EQ, ">=" },
376 { REL_GT | REL_LT, "<>" },
380 { REL_NAMESPACE , "<NAMESPACE>" },
382 { REL_MULTIARCH, "<MULTIARCH>" },
383 { REL_FILECONFLICT, "<FILECONFLICT>" },
384 { REL_COND, "<IF>" },
385 { REL_COMPAT, "compat >=" },
386 { REL_KIND, "<KIND>" },
387 { REL_ELSE, "<ELSE>" },
388 { REL_ERROR, "<ERROR>" },
394 testcase_dep2str_complex(Pool *pool, char *s, Id id, int addparens)
403 s2 = testcase_id2str(pool, id, 1);
404 s = pool_tmpappend(pool, s, s2, 0);
405 pool_freetmpspace(pool, s2);
408 rd = GETRELDEP(pool, id);
410 /* check for special shortcuts */
411 if (rd->flags == REL_NAMESPACE && !ISRELDEP(rd->name) && !strncmp(pool_id2str(pool, rd->name), "namespace:", 10))
413 s = pool_tmpappend(pool, s, pool_id2str(pool, rd->name), "(");
414 s = testcase_dep2str_complex(pool, s, rd->evr, 0);
415 return pool_tmpappend(pool, s, ")", 0);
417 if (rd->flags == REL_MULTIARCH && !ISRELDEP(rd->name) && rd->evr == ARCH_ANY)
419 /* append special :any suffix */
420 s2 = testcase_id2str(pool, rd->name, 1);
421 s = pool_tmpappend(pool, s, s2, ":any");
422 pool_freetmpspace(pool, s2);
427 if (ISRELDEP(rd->name))
429 Reldep *rd2 = GETRELDEP(pool, rd->name);
431 if (rd->flags > 7 && rd->flags != REL_COMPAT && rd2->flags && rd2->flags <= 7)
436 s = pool_tmpappend(pool, s, "(", 0);
437 s = testcase_dep2str_complex(pool, s, rd->name, needparens);
439 for (op = oplist; op->flags; op++)
440 if (rd->flags == op->flags)
444 s = pool_tmpappend(pool, s, " ", op->opname);
445 s = pool_tmpappend(pool, s, " ", 0);
450 sprintf(buf, " <%u> ", rd->flags);
451 s = pool_tmpappend(pool, s, buf, 0);
455 if (ISRELDEP(rd->evr))
457 Reldep *rd2 = GETRELDEP(pool, rd->evr);
459 if (rd->flags > 7 && rd2->flags && rd2->flags <= 7)
461 if (rd->flags == REL_AND && rd2->flags == REL_AND)
462 needparens = 0; /* chain */
463 if (rd->flags == REL_OR && rd2->flags == REL_OR)
464 needparens = 0; /* chain */
465 if (rd->flags > 0 && rd->flags < 8 && rd2->flags == REL_COMPAT)
466 needparens = 0; /* chain */
468 if (!ISRELDEP(rd->evr))
470 s2 = testcase_id2str(pool, rd->evr, 0);
471 s = pool_tmpappend(pool, s, s2, 0);
472 pool_freetmpspace(pool, s2);
475 s = (char *)testcase_dep2str_complex(pool, s, rd->evr, needparens);
477 s = pool_tmpappend(pool, s, ")", 0);
482 testcase_dep2str(Pool *pool, Id id)
486 return testcase_id2str(pool, id, 1);
487 s = pool_alloctmpspace(pool, 1);
489 return testcase_dep2str_complex(pool, s, id, 0);
493 /* Convert a simple string. Also handle the :any suffix */
495 testcase_str2dep_simple(Pool *pool, const char **sp, int isname)
502 for (s = *sp; *s; s++)
506 if (*s == ' ' || *(unsigned char *)s < 32)
510 if (*s == ')' && paren-- <= 0)
513 if (isname && s - *sp > 4 && !strncmp(s - 4, ":any", 4))
520 if (s - *sp == 6 && !strncmp(*sp, "<NULL>", 6))
523 id = pool_strn2id(pool, *sp, s - *sp, 1);
525 else if (s - *sp == 3 && !strncmp(*sp, "\\00", 3))
529 char buf[128], *bp, *bp2;
531 bp = s - *sp >= 128 ? solv_malloc(s - *sp + 1) : buf;
532 for (bp2 = bp, sp2 = *sp; sp2 < s;)
536 solv_hex2bin(&sp2, (unsigned char *)bp2 - 1, 1);
539 id = pool_str2id(pool, bp, 1);
545 id = pool_rel2id(pool, id, ARCH_ANY, REL_MULTIARCH, 1);
554 testcase_str2dep_complex(Pool *pool, const char **sp, int relop)
557 Id flags, id, id2, namespaceid = 0;
560 while (*s == ' ' || *s == '\t')
562 if (!strncmp(s, "namespace:", 10))
564 /* special namespace hack */
566 for (s2 = s + 10; *s2 && *s2 != '('; s2++)
570 namespaceid = pool_strn2id(pool, s, s2 - s, 1);
577 id = testcase_str2dep_complex(pool, &s, 0);
586 id = testcase_str2dep_simple(pool, &s, relop ? 0 : 1);
588 id = pool_rel2id(pool, namespaceid, id, REL_NAMESPACE, 1);
592 while (*s == ' ' || *s == '\t')
594 if (!*s || *s == ')' || (relop && strncmp(s, "compat >= ", 10) != 0))
600 /* we have an op! Find the end */
602 if (s[0] == '<' && (s[1] >= '0' && s[1] <= '9'))
605 for (s2 = s + 1; *s2 >= '0' && *s2 <= '9'; s2++)
609 flags = strtoul(s + 1, 0, 10);
615 for (op = oplist; op->flags; op++)
616 if (!strncmp(s, op->opname, strlen(op->opname)))
624 s += strlen(op->opname);
626 id2 = testcase_str2dep_complex(pool, &s, flags > 0 && flags < 8);
632 id = pool_rel2id(pool, id, id2, flags, 1);
637 testcase_str2dep(Pool *pool, const char *s)
639 Id id = testcase_str2dep_complex(pool, &s, 0);
640 return s && !*s ? id : 0;
643 /**********************************************************/
646 testcase_repoid2str(Pool *pool, Id repoid)
648 Repo *repo = pool_id2repo(pool, repoid);
651 char *r = pool_tmpjoin(pool, repo->name, 0, 0);
653 for (rp = r; *rp; rp++)
654 if (*rp == ' ' || *rp == '\t')
661 sprintf(buf, "#%d", repoid);
662 return pool_tmpjoin(pool, buf, 0, 0);
667 testcase_solvid2str(Pool *pool, Id p)
669 Solvable *s = pool->solvables + p;
670 const char *n, *e, *a;
673 if (p == SYSTEMSOLVABLE)
675 n = pool_id2str(pool, s->name);
676 e = pool_id2str(pool, s->evr);
677 a = pool_id2str(pool, s->arch);
678 str = pool_alloctmpspace(pool, strlen(n) + strlen(e) + strlen(a) + 3);
679 sprintf(str, "%s-%s.%s", n, e, a);
681 return pool_tmpappend(pool, str, "@", 0);
685 char *str2 = pool_tmpappend(pool, str, "@", s->repo->name);
687 if (str2[l] == ' ' || str2[l] == '\t')
691 sprintf(buf, "@#%d", s->repo->repoid);
692 return pool_tmpappend(pool, str, buf, 0);
696 testcase_str2repo(Pool *pool, const char *str)
700 if (str[0] == '#' && (str[1] >= '0' && str[1] <= '9'))
704 for (j = 1; str[j] >= '0' && str[j] <= '9'; j++)
705 repoid = repoid * 10 + (str[j] - '0');
706 if (!str[j] && repoid > 0 && repoid < pool->nrepos)
707 repo = pool_id2repo(pool, repoid);
711 FOR_REPOS(repoid, repo)
716 l = strlen(repo->name);
717 for (i = 0; i < l; i++)
719 int c = repo->name[i];
720 if (c == ' ' || c == '\t')
725 if (i == l && !str[l])
728 if (repoid >= pool->nrepos)
735 testcase_str2solvid(Pool *pool, const char *str)
737 int i, l = strlen(str);
744 if (*str == '@' && !strcmp(str, "@SYSTEM"))
745 return SYSTEMSOLVABLE;
747 for (i = l - 1; i >= 0; i--)
748 if (str[i] == '@' && (repo = testcase_str2repo(pool, str + i + 1)) != 0)
753 /* now find the arch (if present) */
755 for (i = repostart - 1; i > 0; i--)
758 arch = pool_strn2id(pool, str + i + 1, repostart - (i + 1), 0);
763 /* now find the name */
764 for (i = repostart - 1; i > 0; i--)
768 Id nid, evrid, p, pp;
769 nid = pool_strn2id(pool, str, i, 0);
772 evrid = pool_strn2id(pool, str + i + 1, repostart - (i + 1), 0);
775 /* first check whatprovides */
776 FOR_PROVIDES(p, pp, nid)
778 Solvable *s = pool->solvables + p;
779 if (s->name != nid || s->evr != evrid)
781 if (repo && s->repo != repo)
783 if (arch && s->arch != arch)
787 /* maybe it's not installable and thus not in whatprovides. do a slow search */
791 FOR_REPO_SOLVABLES(repo, p, s)
793 if (s->name != nid || s->evr != evrid)
795 if (arch && s->arch != arch)
802 FOR_POOL_SOLVABLES(p)
804 Solvable *s = pool->solvables + p;
805 if (s->name != nid || s->evr != evrid)
807 if (arch && s->arch != arch)
818 testcase_job2str(Pool *pool, Id how, Id what)
825 Id select = how & SOLVER_SELECTMASK;
827 for (i = 0; job2str[i].str; i++)
828 if ((how & SOLVER_JOBMASK) == job2str[i].job)
830 jobstr = job2str[i].str ? job2str[i].str : "unknown";
831 if (select == SOLVER_SOLVABLE)
834 pkgstr = testcase_solvid2str(pool, what);
836 else if (select == SOLVER_SOLVABLE_NAME)
839 pkgstr = testcase_dep2str(pool, what);
841 else if (select == SOLVER_SOLVABLE_PROVIDES)
843 selstr = " provides ";
844 pkgstr = testcase_dep2str(pool, what);
846 else if (select == SOLVER_SOLVABLE_ONE_OF)
851 while ((p = pool->whatprovidesdata[what++]) != 0)
853 const char *s = testcase_solvid2str(pool, p);
856 pkgstr = pool_tmpappend(pool, pkgstr, " ", s);
857 pool_freetmpspace(pool, s);
865 else if (select == SOLVER_SOLVABLE_REPO)
867 Repo *repo = pool_id2repo(pool, what);
872 sprintf(buf, "#%d", repo->repoid);
873 pkgstr = pool_tmpjoin(pool, buf, 0, 0);
876 pkgstr = pool_tmpjoin(pool, repo->name, 0, 0);
878 else if (select == SOLVER_SOLVABLE_ALL)
885 selstr = " unknown ";
888 ret = pool_tmpjoin(pool, jobstr, selstr, pkgstr);
890 ret = pool_tmpappend(pool, ret, " ", 0);
891 for (i = 0; jobflags2str[i].str; i++)
892 if ((how & jobflags2str[i].flag) != 0)
893 ret = pool_tmpappend(pool, ret, ",", jobflags2str[i].str);
899 ret = pool_tmpappend(pool, ret, "]", 0);
905 str2selflags(Pool *pool, char *s) /* modifies the string! */
910 char *se = strchr(s, ',');
913 for (i = 0; selflags2str[i].str; i++)
914 if (!strcmp(s, selflags2str[i].str))
916 selflags |= selflags2str[i].flag;
919 if (!selflags2str[i].str)
920 pool_debug(pool, SOLV_ERROR, "str2job: unknown selection flag '%s'\n", s);
927 str2jobflags(Pool *pool, char *s) /* modifies the string */
932 char *se = strchr(s, ',');
935 for (i = 0; jobflags2str[i].str; i++)
936 if (!strcmp(s, jobflags2str[i].str))
938 jobflags |= jobflags2str[i].flag;
941 if (!jobflags2str[i].str)
942 pool_debug(pool, SOLV_ERROR, "str2job: unknown job flag '%s'\n", s);
949 testcase_str2job(Pool *pool, const char *str, Id *whatp)
959 /* so we can patch it */
960 s = pool_tmpjoin(pool, str, 0, 0);
961 /* split it in pieces */
964 while (*s == ' ' || *s == '\t')
968 pieces = solv_extend(pieces, npieces, 1, sizeof(*pieces), 7);
969 pieces[npieces++] = s;
970 while (*s && *s != ' ' && *s != '\t')
977 pool_debug(pool, SOLV_ERROR, "str2job: bad line '%s'\n", str);
982 for (i = 0; job2str[i].str; i++)
983 if (!strcmp(pieces[0], job2str[i].str))
987 pool_debug(pool, SOLV_ERROR, "str2job: unknown job '%s'\n", str);
991 job = job2str[i].job;
995 char *flags = pieces[npieces - 1];
996 if (*flags == '[' && flags[strlen(flags) - 1] == ']')
1000 flags[strlen(flags) - 1] = 0;
1001 job |= str2jobflags(pool, flags);
1004 if (!strcmp(pieces[1], "pkg"))
1008 pool_debug(pool, SOLV_ERROR, "str2job: bad pkg selector in '%s'\n", str);
1012 job |= SOLVER_SOLVABLE;
1013 what = testcase_str2solvid(pool, pieces[2]);
1016 pool_debug(pool, SOLV_ERROR, "str2job: unknown package '%s'\n", pieces[2]);
1021 else if (!strcmp(pieces[1], "name") || !strcmp(pieces[1], "provides"))
1023 /* join em again for dep2str... */
1025 for (sp = pieces[2]; sp < pieces[npieces - 1]; sp++)
1029 if (pieces[1][0] == 'p' && strncmp(pieces[2], "namespace:", 10) == 0)
1031 char *spe = strchr(pieces[2], '(');
1032 int l = strlen(pieces[2]);
1033 if (spe && pieces[2][l - 1] == ')')
1035 /* special namespace provides */
1036 if (strcmp(spe, "(<NULL>)") != 0)
1038 pieces[2][l - 1] = 0;
1039 what = testcase_str2dep(pool, spe + 1);
1040 pieces[2][l - 1] = ')';
1042 what = pool_rel2id(pool, pool_strn2id(pool, pieces[2], spe - pieces[2], 1), what, REL_NAMESPACE, 1);
1046 what = testcase_str2dep(pool, pieces[2]);
1047 if (pieces[1][0] == 'n')
1048 job |= SOLVER_SOLVABLE_NAME;
1050 job |= SOLVER_SOLVABLE_PROVIDES;
1052 else if (!strcmp(pieces[1], "oneof"))
1055 job |= SOLVER_SOLVABLE_ONE_OF;
1057 if (npieces > 3 && strcmp(pieces[2], "nothing") != 0)
1059 for (i = 2; i < npieces; i++)
1061 Id p = testcase_str2solvid(pool, pieces[i]);
1064 pool_debug(pool, SOLV_ERROR, "str2job: unknown package '%s'\n", pieces[i]);
1072 what = pool_queuetowhatprovides(pool, &q);
1075 else if (!strcmp(pieces[1], "repo"))
1080 pool_debug(pool, SOLV_ERROR, "str2job: bad line '%s'\n", str);
1084 repo = testcase_str2repo(pool, pieces[2]);
1087 pool_debug(pool, SOLV_ERROR, "str2job: unknown repo '%s'\n", pieces[2]);
1091 job |= SOLVER_SOLVABLE_REPO;
1092 what = repo->repoid;
1094 else if (!strcmp(pieces[1], "all"))
1096 if (npieces != 3 && strcmp(pieces[2], "packages") != 0)
1098 pool_debug(pool, SOLV_ERROR, "str2job: bad line '%s'\n", str);
1102 job |= SOLVER_SOLVABLE_ALL;
1107 pool_debug(pool, SOLV_ERROR, "str2job: unknown selection in '%s'\n", str);
1117 addselectionjob(Pool *pool, char **pieces, int npieces, Queue *jobqueue)
1124 for (i = 0; job2str[i].str; i++)
1125 if (!strcmp(pieces[0], job2str[i].str))
1127 if (!job2str[i].str)
1129 pool_debug(pool, SOLV_ERROR, "selstr2job: unknown job '%s'\n", pieces[0]);
1132 job = job2str[i].job;
1135 char *flags = pieces[npieces - 1];
1136 if (*flags == '[' && flags[strlen(flags) - 1] == ']')
1140 flags[strlen(flags) - 1] = 0;
1141 job |= str2jobflags(pool, flags);
1146 pool_debug(pool, SOLV_ERROR, "selstr2job: no selection flags\n");
1149 selflags = str2selflags(pool, pieces[3]);
1151 r = selection_make(pool, &sel, pieces[2], selflags);
1152 for (i = 0; i < sel.count; i += 2)
1153 queue_push2(jobqueue, job | sel.elements[i], sel.elements[i + 1]);
1159 writedeps(Repo *repo, FILE *fp, const char *tag, Id key, Solvable *s, Offset off)
1161 Pool *pool = repo->pool;
1168 dp = repo->idarraydata + off;
1169 while ((id = *dp++) != 0)
1171 if (key == SOLVABLE_REQUIRES && id == SOLVABLE_PREREQMARKER)
1174 fprintf(fp, "-%s\n", tag);
1179 if (key == SOLVABLE_PROVIDES && id == SOLVABLE_FILEMARKER)
1181 idstr = testcase_dep2str(pool, id);
1184 fprintf(fp, "+%s\n", tag);
1187 fprintf(fp, "%s\n", idstr);
1190 fprintf(fp, "-%s\n", tag);
1194 writefilelist(Repo *repo, FILE *fp, const char *tag, Solvable *s)
1196 Pool *pool = repo->pool;
1200 dataiterator_init(&di, pool, repo, s - pool->solvables, SOLVABLE_FILELIST, 0, 0);
1201 while (dataiterator_step(&di))
1203 const char *s = repodata_dir2str(di.data, di.kv.id, di.kv.str);
1206 fprintf(fp, "+%s\n", tag);
1209 fprintf(fp, "%s\n", s);
1212 fprintf(fp, "-%s\n", tag);
1213 dataiterator_free(&di);
1217 testcase_write_testtags(Repo *repo, FILE *fp)
1219 Pool *pool = repo->pool;
1225 const char *release;
1230 fprintf(fp, "=Ver: 3.0\n");
1232 FOR_REPO_SOLVABLES(repo, p, s)
1234 name = pool_id2str(pool, s->name);
1235 evr = pool_id2str(pool, s->evr);
1236 arch = pool_id2str(pool, s->arch);
1237 release = strrchr(evr, '-');
1239 release = evr + strlen(evr);
1240 fprintf(fp, "=Pkg: %s %.*s %s %s\n", name, (int)(release - evr), evr, *release && release[1] ? release + 1 : "-", arch);
1241 tmp = solvable_lookup_str(s, SOLVABLE_SUMMARY);
1243 fprintf(fp, "=Sum: %s\n", tmp);
1244 writedeps(repo, fp, "Req:", SOLVABLE_REQUIRES, s, s->requires);
1245 writedeps(repo, fp, "Prv:", SOLVABLE_PROVIDES, s, s->provides);
1246 writedeps(repo, fp, "Obs:", SOLVABLE_OBSOLETES, s, s->obsoletes);
1247 writedeps(repo, fp, "Con:", SOLVABLE_CONFLICTS, s, s->conflicts);
1248 writedeps(repo, fp, "Rec:", SOLVABLE_RECOMMENDS, s, s->recommends);
1249 writedeps(repo, fp, "Sup:", SOLVABLE_SUPPLEMENTS, s, s->supplements);
1250 writedeps(repo, fp, "Sug:", SOLVABLE_SUGGESTS, s, s->suggests);
1251 writedeps(repo, fp, "Enh:", SOLVABLE_ENHANCES, s, s->enhances);
1252 if (solvable_lookup_idarray(s, SOLVABLE_PREREQ_IGNOREINST, &q))
1255 fprintf(fp, "+Ipr:\n");
1256 for (i = 0; i < q.count; i++)
1257 fprintf(fp, "%s\n", testcase_dep2str(pool, q.elements[i]));
1258 fprintf(fp, "-Ipr:\n");
1261 fprintf(fp, "=Vnd: %s\n", pool_id2str(pool, s->vendor));
1262 ti = solvable_lookup_num(s, SOLVABLE_BUILDTIME, 0);
1264 fprintf(fp, "=Tim: %u\n", ti);
1265 writefilelist(repo, fp, "Fls:", s);
1271 static inline Offset
1272 adddep(Repo *repo, Offset olddeps, char *str, Id marker)
1274 Id id = *str == '/' ? pool_str2id(repo->pool, str, 1) : testcase_str2dep(repo->pool, str);
1275 return repo_addid_dep(repo, olddeps, id, marker);
1279 finish_v2_solvable(Pool *pool, Repodata *data, Solvable *s, char *filelist, int nfilelist)
1285 for (l = 0; l < nfilelist; l += strlen(filelist + l) + 1)
1287 char *p = strrchr(filelist + l, '/');
1291 did = repodata_str2dir(data, filelist + l, 1);
1294 did = repodata_str2dir(data, "/", 1);
1295 repodata_add_dirstr(data, s - pool->solvables, SOLVABLE_FILELIST, did, p);
1298 repo_rewrite_suse_deps(s, 0);
1301 /* stripped down version of susetags parser used for testcases */
1303 testcase_add_testtags(Repo *repo, FILE *fp, int flags)
1305 Pool *pool = repo->pool;
1317 int tagsversion = 0;
1318 int addselfprovides = 1; /* for compat reasons */
1320 data = repo_add_repodata(repo, flags);
1325 line = solv_malloc(aline);
1329 if (linep - line + 16 > aline)
1331 aline = linep - line;
1332 line = solv_realloc(line, aline + 512);
1333 linep = line + aline;
1336 if (!fgets(linep, aline - (linep - line), fp))
1338 linep += strlen(linep);
1339 if (linep == line || linep[-1] != '\n')
1342 linep = line + intag;
1345 if (line[intag] == '-' && !strncmp(line + 1, line + intag + 1, intag - 2))
1352 else if (line[0] == '+' && line[1] && line[1] != ':')
1354 char *tagend = strchr(line, ':');
1359 intag = tagend + 2 - line;
1360 linep = line + intag;
1363 if (*line != '=' || !line[1] || !line[2] || !line[3] || line[4] != ':')
1365 tag = line[1] << 16 | line[2] << 8 | line[3];
1368 case 'V' << 16 | 'e' << 8 | 'r':
1369 tagsversion = atoi(line + 6);
1370 addselfprovides = tagsversion < 3 || strstr(line + 6, "addselfprovides") != 0;
1372 case 'P' << 16 | 'k' << 8 | 'g':
1375 if (tagsversion == 2)
1376 finish_v2_solvable(pool, data, s, filelist, nfilelist);
1377 if (addselfprovides && s->name && s->arch != ARCH_SRC && s->arch != ARCH_NOSRC)
1378 s->provides = repo_addid_dep(s->repo, s->provides, pool_rel2id(pool, s->name, s->evr, REL_EQ, 1), 0);
1381 if (split(line + 5, sp, 5) != 4)
1383 s = pool_id2solvable(pool, repo_add_solvable(repo));
1384 s->name = pool_str2id(pool, sp[0], 1);
1385 /* join back version and release */
1386 if (sp[2] && !(sp[2][0] == '-' && !sp[2][1]))
1388 s->evr = makeevr(pool, sp[1]);
1389 s->arch = pool_str2id(pool, sp[3], 1);
1391 case 'S' << 16 | 'u' << 8 | 'm':
1392 repodata_set_str(data, s - pool->solvables, SOLVABLE_SUMMARY, line + 6);
1394 case 'V' << 16 | 'n' << 8 | 'd':
1395 s->vendor = pool_str2id(pool, line + 6, 1);
1397 case 'T' << 16 | 'i' << 8 | 'm':
1400 repodata_set_num(data, s - pool->solvables, SOLVABLE_BUILDTIME, t);
1402 case 'R' << 16 | 'e' << 8 | 'q':
1403 s->requires = adddep(repo, s->requires, line + 6, -SOLVABLE_PREREQMARKER);
1405 case 'P' << 16 | 'r' << 8 | 'q':
1406 s->requires = adddep(repo, s->requires, line + 6, SOLVABLE_PREREQMARKER);
1408 case 'P' << 16 | 'r' << 8 | 'v':
1409 /* version 2 had the file list at the end of the provides */
1410 if (tagsversion == 2)
1414 int l = strlen(line + 6) + 1;
1415 if (nfilelist + l > afilelist)
1417 afilelist = nfilelist + l + 512;
1418 filelist = solv_realloc(filelist, afilelist);
1420 memcpy(filelist + nfilelist, line + 6, l);
1427 for (l = 0; l < nfilelist; l += strlen(filelist + l) + 1)
1428 s->provides = repo_addid_dep(repo, s->provides, pool_str2id(pool, filelist + l, 1), 0);
1432 s->provides = adddep(repo, s->provides, line + 6, 0);
1434 case 'F' << 16 | 'l' << 8 | 's':
1436 char *p = strrchr(line + 6, '/');
1441 did = repodata_str2dir(data, line + 6, 1);
1443 did = repodata_str2dir(data, "/", 1);
1444 repodata_add_dirstr(data, s - pool->solvables, SOLVABLE_FILELIST, did, p);
1447 case 'O' << 16 | 'b' << 8 | 's':
1448 s->obsoletes = adddep(repo, s->obsoletes, line + 6, 0);
1450 case 'C' << 16 | 'o' << 8 | 'n':
1451 s->conflicts = adddep(repo, s->conflicts, line + 6, 0);
1453 case 'R' << 16 | 'e' << 8 | 'c':
1454 s->recommends = adddep(repo, s->recommends, line + 6, 0);
1456 case 'S' << 16 | 'u' << 8 | 'p':
1457 s->supplements = adddep(repo, s->supplements, line + 6, 0);
1459 case 'S' << 16 | 'u' << 8 | 'g':
1460 s->suggests = adddep(repo, s->suggests, line + 6, 0);
1462 case 'E' << 16 | 'n' << 8 | 'h':
1463 s->enhances = adddep(repo, s->enhances, line + 6, 0);
1465 case 'I' << 16 | 'p' << 8 | 'r':
1467 Id id = line[6] == '/' ? pool_str2id(pool, line + 6, 1) : testcase_str2dep(pool, line + 6);
1468 repodata_add_idarray(data, s - pool->solvables, SOLVABLE_PREREQ_IGNOREINST, id);
1477 if (tagsversion == 2)
1478 finish_v2_solvable(pool, data, s, filelist, nfilelist);
1479 if (addselfprovides && s->name && s->arch != ARCH_SRC && s->arch != ARCH_NOSRC)
1480 s->provides = repo_addid_dep(s->repo, s->provides, pool_rel2id(pool, s->name, s->evr, REL_EQ, 1), 0);
1483 solv_free(filelist);
1484 repodata_free_dircache(data);
1485 if (!(flags & REPO_NO_INTERNALIZE))
1486 repodata_internalize(data);
1491 testcase_getpoolflags(Pool *pool)
1493 const char *str = 0;
1495 for (i = 0; poolflags2str[i].str; i++)
1497 v = pool_get_flag(pool, poolflags2str[i].flag);
1498 if (v == poolflags2str[i].def)
1500 str = pool_tmpappend(pool, str, v ? " " : " !", poolflags2str[i].str);
1502 return str ? str + 1 : "";
1506 testcase_setpoolflags(Pool *pool, const char *str)
1508 const char *p = str, *s;
1512 while (*p == ' ' || *p == '\t' || *p == ',')
1523 while (*p && *p != ' ' && *p != '\t' && *p != ',')
1525 for (i = 0; poolflags2str[i].str; i++)
1526 if (!strncmp(poolflags2str[i].str, s, p - s) && poolflags2str[i].str[p - s] == 0)
1528 if (!poolflags2str[i].str)
1530 pool_debug(pool, SOLV_ERROR, "setpoolflags: unknown flag '%.*s'\n", (int)(p - s), s);
1533 pool_set_flag(pool, poolflags2str[i].flag, v);
1539 testcase_resetpoolflags(Pool *pool)
1542 for (i = 0; poolflags2str[i].str; i++)
1543 pool_set_flag(pool, poolflags2str[i].flag, poolflags2str[i].def);
1547 testcase_getsolverflags(Solver *solv)
1549 Pool *pool = solv->pool;
1550 const char *str = 0;
1552 for (i = 0; solverflags2str[i].str; i++)
1554 v = solver_get_flag(solv, solverflags2str[i].flag);
1555 if (v == solverflags2str[i].def)
1557 str = pool_tmpappend(pool, str, v ? " " : " !", solverflags2str[i].str);
1559 return str ? str + 1 : "";
1563 testcase_setsolverflags(Solver *solv, const char *str)
1565 const char *p = str, *s;
1569 while (*p == ' ' || *p == '\t' || *p == ',')
1580 while (*p && *p != ' ' && *p != '\t' && *p != ',')
1582 for (i = 0; solverflags2str[i].str; i++)
1583 if (!strncmp(solverflags2str[i].str, s, p - s) && solverflags2str[i].str[p - s] == 0)
1585 if (!solverflags2str[i].str)
1587 pool_debug(solv->pool, SOLV_ERROR, "setsolverflags: unknown flag '%.*s'\n", (int)(p - s), s);
1590 if (solver_set_flag(solv, solverflags2str[i].flag, v) == -1)
1592 pool_debug(solv->pool, SOLV_ERROR, "setsolverflags: unsupported flag '%s'\n", solverflags2str[i].str);
1600 testcase_resetsolverflags(Solver *solv)
1603 for (i = 0; solverflags2str[i].str; i++)
1604 solver_set_flag(solv, solverflags2str[i].flag, solverflags2str[i].def);
1608 testcase_ruleid(Solver *solv, Id rid)
1614 const unsigned char *md5;
1620 solver_ruleliterals(solv, rid, &q);
1621 for (i = 0; i < q.count; i++)
1623 Id p = q.elements[i];
1624 s = testcase_solvid2str(solv->pool, p > 0 ? p : -p);
1626 s = pool_tmpjoin(solv->pool, "!", s, 0);
1627 strqueue_push(&sq, s);
1630 strqueue_sort_u(&sq);
1631 chk = solv_chksum_create(REPOKEY_TYPE_MD5);
1632 for (i = 0; i < sq.nstr; i++)
1633 solv_chksum_add(chk, sq.str[i], strlen(sq.str[i]) + 1);
1634 md5 = solv_chksum_get(chk, &md5l);
1635 s = pool_bin2hex(solv->pool, md5, md5l);
1636 chk = solv_chksum_free(chk, 0);
1642 testcase_problemid(Solver *solv, Id problem)
1647 const unsigned char *md5;
1651 /* we build a hash of all rules that define the problem */
1654 solver_findallproblemrules(solv, problem, &q);
1655 for (i = 0; i < q.count; i++)
1656 strqueue_push(&sq, testcase_ruleid(solv, q.elements[i]));
1658 strqueue_sort_u(&sq);
1659 chk = solv_chksum_create(REPOKEY_TYPE_MD5);
1660 for (i = 0; i < sq.nstr; i++)
1661 solv_chksum_add(chk, sq.str[i], strlen(sq.str[i]) + 1);
1662 md5 = solv_chksum_get(chk, &md5l);
1663 s = pool_bin2hex(solv->pool, md5, 4);
1664 chk = solv_chksum_free(chk, 0);
1670 testcase_solutionid(Solver *solv, Id problem, Id solution)
1674 const unsigned char *md5;
1678 intid = solver_solutionelement_internalid(solv, problem, solution);
1679 /* internal stuff! handle with care! */
1683 s = testcase_job2str(solv->pool, solv->job.elements[-intid - 1], solv->job.elements[-intid]);
1688 s = testcase_ruleid(solv, intid);
1690 chk = solv_chksum_create(REPOKEY_TYPE_MD5);
1691 solv_chksum_add(chk, s, strlen(s) + 1);
1692 md5 = solv_chksum_get(chk, &md5l);
1693 s = pool_bin2hex(solv->pool, md5, 4);
1694 chk = solv_chksum_free(chk, 0);
1699 testcase_alternativeid(Solver *solv, int type, Id id, Id from)
1702 Pool *pool = solv->pool;
1704 const unsigned char *md5;
1706 chk = solv_chksum_create(REPOKEY_TYPE_MD5);
1707 if (type == SOLVER_ALTERNATIVE_TYPE_RECOMMENDS)
1709 s = testcase_solvid2str(pool, from);
1710 solv_chksum_add(chk, s, strlen(s) + 1);
1711 s = testcase_dep2str(pool, id);
1712 solv_chksum_add(chk, s, strlen(s) + 1);
1714 else if (type == SOLVER_ALTERNATIVE_TYPE_RULE)
1716 s = testcase_ruleid(solv, id);
1717 solv_chksum_add(chk, s, strlen(s) + 1);
1719 md5 = solv_chksum_get(chk, &md5l);
1720 s = pool_bin2hex(pool, md5, 4);
1721 chk = solv_chksum_free(chk, 0);
1725 static struct class2str {
1729 { SOLVER_TRANSACTION_ERASE, "erase" },
1730 { SOLVER_TRANSACTION_INSTALL, "install" },
1731 { SOLVER_TRANSACTION_REINSTALLED, "reinstall" },
1732 { SOLVER_TRANSACTION_DOWNGRADED, "downgrade" },
1733 { SOLVER_TRANSACTION_CHANGED, "change" },
1734 { SOLVER_TRANSACTION_UPGRADED, "upgrade" },
1735 { SOLVER_TRANSACTION_OBSOLETED, "obsolete" },
1736 { SOLVER_TRANSACTION_MULTIINSTALL, "multiinstall" },
1737 { SOLVER_TRANSACTION_MULTIREINSTALL, "multireinstall" },
1741 static struct reason2str {
1745 { SOLVER_REASON_UNRELATED, "unrelated" },
1746 { SOLVER_REASON_UNIT_RULE, "unit" },
1747 { SOLVER_REASON_KEEP_INSTALLED, "keep" },
1748 { SOLVER_REASON_RESOLVE_JOB, "job" },
1749 { SOLVER_REASON_UPDATE_INSTALLED, "update" },
1750 { SOLVER_REASON_CLEANDEPS_ERASE, "cleandeps" },
1751 { SOLVER_REASON_RESOLVE, "resolve" },
1752 { SOLVER_REASON_WEAKDEP, "weakdep" },
1753 { SOLVER_REASON_RESOLVE_ORPHAN, "orphan" },
1755 { SOLVER_REASON_RECOMMENDED, "recommended" },
1756 { SOLVER_REASON_SUPPLEMENTED, "supplemented" },
1761 testcase_reason2str(Id reason)
1764 for (i = 0; reason2str[i].str; i++)
1765 if (reason == reason2str[i].reason)
1766 return reason2str[i].str;
1770 static struct rclass2str {
1774 { SOLVER_RULE_PKG, "pkg" },
1775 { SOLVER_RULE_UPDATE, "update" },
1776 { SOLVER_RULE_FEATURE, "feature" },
1777 { SOLVER_RULE_JOB, "job" },
1778 { SOLVER_RULE_DISTUPGRADE, "distupgrade" },
1779 { SOLVER_RULE_INFARCH, "infarch" },
1780 { SOLVER_RULE_CHOICE, "choice" },
1781 { SOLVER_RULE_LEARNT, "learnt" },
1782 { SOLVER_RULE_BEST, "best" },
1783 { SOLVER_RULE_YUMOBS, "yumobs" },
1788 testcase_rclass2str(Id rclass)
1791 for (i = 0; rclass2str[i].str; i++)
1792 if (rclass == rclass2str[i].rclass)
1793 return rclass2str[i].str;
1798 dump_genid(Pool *pool, Strqueue *sq, Id id, int cnt)
1806 Reldep *rd = GETRELDEP(pool, id);
1807 for (op = oplist; op->flags; op++)
1808 if (rd->flags == op->flags)
1810 cnt = dump_genid(pool, sq, rd->name, cnt);
1811 cnt = dump_genid(pool, sq, rd->evr, cnt);
1812 sprintf(cntbuf, "genid %2d: genid ", cnt++);
1813 s = pool_tmpjoin(pool, cntbuf, "op ", op->flags ? op->opname : "unknown");
1817 sprintf(cntbuf, "genid %2d: genid ", cnt++);
1818 s = pool_tmpjoin(pool, cntbuf, id ? "lit " : "null", id ? pool_id2str(pool, id) : 0);
1820 strqueue_push(sq, s);
1825 testcase_solverresult(Solver *solv, int resultflags)
1827 Pool *pool = solv->pool;
1835 if ((resultflags & TESTCASE_RESULT_TRANSACTION) != 0)
1837 Transaction *trans = solver_create_transaction(solv);
1841 for (i = 0; class2str[i].str; i++)
1844 transaction_classify_pkgs(trans, SOLVER_TRANSACTION_KEEP_PSEUDO, class2str[i].class, 0, 0, &q);
1845 for (j = 0; j < q.count; j++)
1849 if (pool->installed && pool->solvables[p].repo == pool->installed)
1850 op = transaction_obs_pkg(trans, p);
1851 s = pool_tmpjoin(pool, class2str[i].str, " ", testcase_solvid2str(pool, p));
1853 s = pool_tmpjoin(pool, s, " ", testcase_solvid2str(pool, op));
1854 strqueue_push(&sq, s);
1858 transaction_free(trans);
1860 if ((resultflags & TESTCASE_RESULT_PROBLEMS) != 0)
1862 char *probprefix, *solprefix;
1863 int problem, solution, element;
1866 pcnt = solver_problem_count(solv);
1867 for (problem = 1; problem <= pcnt; problem++)
1869 Id rid, from, to, dep;
1870 SolverRuleinfo rinfo;
1871 rid = solver_findproblemrule(solv, problem);
1872 s = testcase_problemid(solv, problem);
1873 probprefix = solv_dupjoin("problem ", s, 0);
1874 rinfo = solver_ruleinfo(solv, rid, &from, &to, &dep);
1875 s = pool_tmpjoin(pool, probprefix, " info ", solver_problemruleinfo2str(solv, rinfo, from, to, dep));
1876 strqueue_push(&sq, s);
1877 scnt = solver_solution_count(solv, problem);
1878 for (solution = 1; solution <= scnt; solution++)
1880 s = testcase_solutionid(solv, problem, solution);
1881 solprefix = solv_dupjoin(probprefix, " solution ", s);
1883 while ((element = solver_next_solutionelement(solv, problem, solution, element, &p, &op)) != 0)
1885 if (p == SOLVER_SOLUTION_JOB)
1886 s = pool_tmpjoin(pool, solprefix, " deljob ", testcase_job2str(pool, solv->job.elements[op - 1], solv->job.elements[op]));
1887 else if (p > 0 && op == 0)
1888 s = pool_tmpjoin(pool, solprefix, " erase ", testcase_solvid2str(pool, p));
1889 else if (p > 0 && op > 0)
1891 s = pool_tmpjoin(pool, solprefix, " replace ", testcase_solvid2str(pool, p));
1892 s = pool_tmpappend(pool, s, " ", testcase_solvid2str(pool, op));
1894 else if (p < 0 && op > 0)
1895 s = pool_tmpjoin(pool, solprefix, " allow ", testcase_solvid2str(pool, op));
1897 s = pool_tmpjoin(pool, solprefix, " unknown", 0);
1898 strqueue_push(&sq, s);
1900 solv_free(solprefix);
1902 solv_free(probprefix);
1906 if ((resultflags & TESTCASE_RESULT_ORPHANED) != 0)
1911 solver_get_orphaned(solv, &q);
1912 for (i = 0; i < q.count; i++)
1914 s = pool_tmpjoin(pool, "orphaned ", testcase_solvid2str(pool, q.elements[i]), 0);
1915 strqueue_push(&sq, s);
1920 if ((resultflags & TESTCASE_RESULT_RECOMMENDED) != 0)
1926 solver_get_recommendations(solv, &qr, &qs, 0);
1927 for (i = 0; i < qr.count; i++)
1929 s = pool_tmpjoin(pool, "recommended ", testcase_solvid2str(pool, qr.elements[i]), 0);
1930 strqueue_push(&sq, s);
1932 for (i = 0; i < qs.count; i++)
1934 s = pool_tmpjoin(pool, "suggested ", testcase_solvid2str(pool, qs.elements[i]), 0);
1935 strqueue_push(&sq, s);
1941 if ((resultflags & TESTCASE_RESULT_UNNEEDED) != 0)
1947 solver_get_unneeded(solv, &q, 0);
1948 solver_get_unneeded(solv, &qf, 1);
1949 for (i = j = 0; i < q.count; i++)
1951 /* we rely on qf containing a subset of q in the same order */
1952 if (j < qf.count && q.elements[i] == qf.elements[j])
1954 s = pool_tmpjoin(pool, "unneeded_filtered ", testcase_solvid2str(pool, q.elements[i]), 0);
1958 s = pool_tmpjoin(pool, "unneeded ", testcase_solvid2str(pool, q.elements[i]), 0);
1959 strqueue_push(&sq, s);
1964 if ((resultflags & TESTCASE_RESULT_ALTERNATIVES) != 0)
1972 cnt = solver_alternatives_count(solv);
1973 for (alternative = 1; alternative <= cnt; alternative++)
1975 Id id, from, chosen;
1977 int type = solver_get_alternative(solv, alternative, &id, &from, &chosen, &q, 0);
1978 altprefix = solv_dupjoin("alternative ", testcase_alternativeid(solv, type, id, from), " ");
1980 if (type == SOLVER_ALTERNATIVE_TYPE_RECOMMENDS)
1982 char *s = pool_tmpjoin(pool, altprefix, num, testcase_solvid2str(pool, from));
1983 s = pool_tmpappend(pool, s, " recommends ", testcase_dep2str(pool, id));
1984 strqueue_push(&sq, s);
1986 else if (type == SOLVER_ALTERNATIVE_TYPE_RULE)
1988 /* map choice rules back to pkg rules */
1989 if (solver_ruleclass(solv, id) == SOLVER_RULE_CHOICE)
1990 id = solver_rule2pkgrule(solv, id);
1991 solver_allruleinfos(solv, id, &rq);
1992 for (i = 0; i < rq.count; i += 4)
1994 int rtype = rq.elements[i];
1995 if ((rtype & SOLVER_RULE_TYPEMASK) == SOLVER_RULE_JOB)
1997 const char *js = testcase_job2str(pool, rq.elements[i + 2], rq.elements[i + 3]);
1998 char *s = pool_tmpjoin(pool, altprefix, num, " job ");
1999 s = pool_tmpappend(pool, s, js, 0);
2000 strqueue_push(&sq, s);
2002 else if (rtype == SOLVER_RULE_PKG_REQUIRES)
2004 char *s = pool_tmpjoin(pool, altprefix, num, testcase_solvid2str(pool, rq.elements[i + 1]));
2005 s = pool_tmpappend(pool, s, " requires ", testcase_dep2str(pool, rq.elements[i + 3]));
2006 strqueue_push(&sq, s);
2010 for (i = 0; i < q.count; i++)
2012 Id p = q.elements[i];
2014 num[0] = '0' + (i + 1) / 10;
2015 num[1] = '0' + (i + 1) % 10;
2017 s = pool_tmpjoin(pool, altprefix, num, "+ ");
2019 s = pool_tmpjoin(pool, altprefix, num, "- ");
2021 s = pool_tmpjoin(pool, altprefix, num, " ");
2022 s = pool_tmpappend(pool, s, testcase_solvid2str(pool, p < 0 ? -p : p), 0);
2023 strqueue_push(&sq, s);
2025 solv_free(altprefix);
2030 if ((resultflags & TESTCASE_RESULT_RULES) != 0)
2032 /* dump all rules */
2034 SolverRuleinfo rclass;
2039 for (rid = 1; (rclass = solver_ruleclass(solv, rid)) != SOLVER_RULE_UNKNOWN; rid++)
2041 char *prefix = solv_dupjoin("rule ", testcase_rclass2str(rclass), " ");
2042 prefix = solv_dupappend(prefix, testcase_ruleid(solv, rid), 0);
2043 solver_ruleliterals(solv, rid, &q);
2044 if (rclass == SOLVER_RULE_FEATURE && q.count == 1 && q.elements[0] == -SYSTEMSOLVABLE)
2046 for (i = 0; i < q.count; i++)
2048 Id p = q.elements[i];
2051 s = pool_tmpjoin(pool, prefix, " -", testcase_solvid2str(pool, -p));
2053 s = pool_tmpjoin(pool, prefix, " ", testcase_solvid2str(pool, p));
2054 strqueue_push(&sq, s);
2060 if ((resultflags & TESTCASE_RESULT_GENID) != 0)
2062 for (i = 0 ; i < solv->job.count; i += 2)
2065 if (solv->job.elements[i] != (SOLVER_NOOP | SOLVER_SOLVABLE_PROVIDES))
2067 id = solv->job.elements[i + 1];
2068 s = testcase_dep2str(pool, id);
2069 strqueue_push(&sq, pool_tmpjoin(pool, "genid dep ", s, 0));
2070 if ((id2 = testcase_str2dep(pool, s)) != id)
2072 s = pool_tmpjoin(pool, "genid roundtrip error: ", testcase_dep2str(pool, id2), 0);
2073 strqueue_push(&sq, s);
2075 dump_genid(pool, &sq, id, 1);
2078 if ((resultflags & TESTCASE_RESULT_REASON) != 0)
2082 FOR_POOL_SOLVABLES(p)
2085 int reason = solver_describe_decision(solv, p, &info);
2086 if (reason == SOLVER_REASON_UNRELATED)
2088 if (reason == SOLVER_REASON_WEAKDEP)
2090 solver_describe_weakdep_decision(solv, p, &whyq);
2093 for (i = 0; i < whyq.count; i += 3)
2095 reason = whyq.elements[i];
2096 p2 = whyq.elements[i + 1];
2097 id = whyq.elements[i + 2];
2098 s = pool_tmpjoin(pool, "reason ", testcase_solvid2str(pool, p), 0);
2099 s = pool_tmpappend(pool, s, " ", testcase_reason2str(reason));
2100 s = pool_tmpappend(pool, s, " ", testcase_dep2str(pool, id));
2102 s = pool_tmpappend(pool, s, " ", testcase_solvid2str(pool, p2));
2103 strqueue_push(&sq, s);
2108 s = pool_tmpjoin(pool, "reason ", testcase_solvid2str(pool, p), 0);
2109 s = pool_tmpappend(pool, s, " ", testcase_reason2str(reason));
2111 s = pool_tmpappend(pool, s, " ", testcase_ruleid(solv, info));
2112 strqueue_push(&sq, s);
2117 result = strqueue_join(&sq);
2124 testcase_write_mangled(Solver *solv, const char *dir, int resultflags, const char *testcasename, const char *resultname)
2126 Pool *pool = solv->pool;
2137 testcasename = "testcase.t";
2139 resultname = "solver.result";
2141 if (mkdir(dir, 0777) && errno != EEXIST)
2143 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: could not create directory '%s'\n", dir);
2147 FOR_REPOS(repoid, repo)
2149 const char *name = testcase_repoid2str(pool, repoid);
2151 if (repo->subpriority)
2152 sprintf(priobuf, "%d.%d", repo->priority, repo->subpriority);
2154 sprintf(priobuf, "%d", repo->priority);
2155 out = pool_tmpjoin(pool, name, ".repo", ".gz");
2156 for (i = 0; out[i]; i++)
2159 cmd = pool_tmpjoin(pool, "repo ", name, " ");
2160 cmd = pool_tmpappend(pool, cmd, priobuf, " ");
2161 cmd = pool_tmpappend(pool, cmd, "testtags ", out);
2162 strqueue_push(&sq, cmd);
2163 out = pool_tmpjoin(pool, dir, "/", out);
2164 if (!(fp = solv_xfopen(out, "w")))
2166 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: could not open '%s' for writing\n", out);
2170 testcase_write_testtags(repo, fp);
2173 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: write error\n");
2178 /* hmm, this is not optimal... we currently search for the lowest score */
2180 arch = pool->solvables[SYSTEMSOLVABLE].arch;
2181 for (i = 0; i < pool->lastarch; i++)
2183 if (pool->id2arch[i] == 1 && !lowscore)
2185 if (pool->id2arch[i] > 0x10000 && (!lowscore || pool->id2arch[i] < lowscore))
2188 lowscore = pool->id2arch[i];
2191 cmd = pool_tmpjoin(pool, "system ", pool->lastarch ? pool_id2str(pool, arch) : "unset", 0);
2192 for (i = 0; disttype2str[i].str != 0; i++)
2193 if (pool->disttype == disttype2str[i].type)
2195 pool_tmpappend(pool, cmd, " ", disttype2str[i].str ? disttype2str[i].str : "unknown");
2196 if (pool->installed)
2197 cmd = pool_tmpappend(pool, cmd, " ", testcase_repoid2str(pool, pool->installed->repoid));
2198 strqueue_push(&sq, cmd);
2199 s = testcase_getpoolflags(solv->pool);
2202 cmd = pool_tmpjoin(pool, "poolflags ", s, 0);
2203 strqueue_push(&sq, cmd);
2206 if (pool->vendorclasses)
2209 for (i = 0; pool->vendorclasses[i]; i++)
2211 cmd = pool_tmpappend(pool, cmd ? cmd : "vendorclass", " ", pool->vendorclasses[i]);
2212 if (!pool->vendorclasses[i + 1])
2214 strqueue_push(&sq, cmd);
2221 /* dump disabled packages (must come before the namespace/job lines) */
2222 if (pool->considered)
2225 FOR_POOL_SOLVABLES(p)
2226 if (!MAPTST(pool->considered, p))
2228 cmd = pool_tmpjoin(pool, "disable pkg ", testcase_solvid2str(pool, p), 0);
2229 strqueue_push(&sq, cmd);
2233 s = testcase_getsolverflags(solv);
2236 cmd = pool_tmpjoin(pool, "solverflags ", s, 0);
2237 strqueue_push(&sq, cmd);
2240 /* now dump all the ns callback values we know */
2241 if (pool->nscallback)
2245 for (rid = 1; rid < pool->nrels; rid++)
2247 Reldep *rd = pool->rels + rid;
2248 if (rd->flags != REL_NAMESPACE || rd->name == NAMESPACE_OTHERPROVIDERS)
2250 /* evaluate all namespace ids, skip empty results */
2251 d = pool_whatprovides(pool, MAKERELDEP(rid));
2252 if (!d || !pool->whatprovidesdata[d])
2254 cmd = pool_tmpjoin(pool, "namespace ", pool_id2str(pool, rd->name), "(");
2255 cmd = pool_tmpappend(pool, cmd, pool_id2str(pool, rd->evr), ")");
2256 for (; pool->whatprovidesdata[d]; d++)
2257 cmd = pool_tmpappend(pool, cmd, " ", testcase_solvid2str(pool, pool->whatprovidesdata[d]));
2258 strqueue_push(&sq, cmd);
2262 for (i = 0; i < solv->job.count; i += 2)
2264 cmd = (char *)testcase_job2str(pool, solv->job.elements[i], solv->job.elements[i + 1]);
2265 cmd = pool_tmpjoin(pool, "job ", cmd, 0);
2266 strqueue_push(&sq, cmd);
2273 for (i = 0; resultflags2str[i].str; i++)
2274 if ((resultflags & resultflags2str[i].flag) != 0)
2275 cmd = pool_tmpappend(pool, cmd, cmd ? "," : 0, resultflags2str[i].str);
2276 cmd = pool_tmpjoin(pool, "result ", cmd ? cmd : "?", 0);
2277 cmd = pool_tmpappend(pool, cmd, " ", resultname);
2278 strqueue_push(&sq, cmd);
2279 result = testcase_solverresult(solv, resultflags);
2280 if (!strcmp(resultname, "<inline>"))
2284 strqueue_init(&rsq);
2285 strqueue_split(&rsq, result);
2286 for (i = 0; i < rsq.nstr; i++)
2288 cmd = pool_tmpjoin(pool, "#>", rsq.str[i], 0);
2289 strqueue_push(&sq, cmd);
2291 strqueue_free(&rsq);
2295 out = pool_tmpjoin(pool, dir, "/", resultname);
2296 if (!(fp = fopen(out, "w")))
2298 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: could not open '%s' for writing\n", out);
2303 if (result && *result && fwrite(result, strlen(result), 1, fp) != 1)
2305 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: write error\n");
2313 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: write error\n");
2321 cmd = strqueue_join(&sq);
2322 out = pool_tmpjoin(pool, dir, "/", testcasename);
2323 if (!(fp = fopen(out, "w")))
2325 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: could not open '%s' for writing\n", out);
2329 if (*cmd && fwrite(cmd, strlen(cmd), 1, fp) != 1)
2331 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: write error\n");
2338 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: write error\n");
2348 testcase_write(Solver *solv, const char *dir, int resultflags, const char *testcasename, const char *resultname)
2350 Pool *pool = solv->pool;
2353 const char **orignames;
2355 /* mangle repo names so that there are no conflicts */
2356 orignames = solv_calloc(pool->nrepos, sizeof(char *));
2357 for (repoid = 1; repoid < pool->nrepos; repoid++)
2359 Repo *repo = pool_id2repo(pool, repoid);
2360 char *buf = solv_malloc((repo->name ? strlen(repo->name) : 0) + 40);
2362 orignames[repoid] = repo->name;
2363 if (!repo->name || !repo->name[0])
2364 sprintf(buf, "#%d", repoid);
2366 strcpy(buf, repo->name);
2367 for (i = 0; buf[i]; i++)
2368 if (buf[i] == ' ' || buf[i] == '\t' || buf[i] == '/')
2370 mp = buf + strlen(buf);
2373 for (i = 1; i < repoid; i++)
2374 if (!strcmp(buf, pool_id2repo(pool, i)->name))
2378 sprintf(mp, "_%d", mangle++);
2382 r = testcase_write_mangled(solv, dir, resultflags, testcasename, resultname);
2383 for (repoid = 1; repoid < pool->nrepos; repoid++)
2385 Repo *repo = pool_id2repo(pool, repoid);
2386 solv_free((void *)repo->name);
2387 repo->name = orignames[repoid];
2389 solv_free(orignames);
2394 read_inline_file(FILE *fp, char **bufp, char **bufpp, int *buflp)
2396 char *result = solv_malloc(1024);
2403 if (rp - result + 256 >= resultl)
2405 resultl = rp - result;
2406 result = solv_realloc(result, resultl + 1024);
2407 rp = result + resultl;
2410 if (!fgets(rp, resultl - (rp - result), fp))
2413 if (rl && (rp == result || rp[-1] == '\n'))
2415 if (rl > 1 && rp[0] == '#' && rp[1] == '>')
2417 memmove(rp, rp + 2, rl - 2);
2422 while (rl + 16 > *buflp)
2424 *bufp = solv_realloc(*bufp, *buflp + 512);
2427 memmove(*bufp, rp, rl);
2428 if ((*bufp)[rl - 1] == '\n')
2434 (*bufpp) = *bufp + rl;
2451 char *result = solv_malloc(1024);
2458 if (rp - result + 256 >= resultl)
2460 resultl = rp - result;
2461 result = solv_realloc(result, resultl + 1024);
2462 rp = result + resultl;
2465 rl = fread(rp, 1, resultl - (rp - result), fp);
2477 str2resultflags(Pool *pool, char *s) /* modifies the string! */
2479 int i, resultflags = 0;
2482 char *se = strchr(s, ',');
2485 for (i = 0; resultflags2str[i].str; i++)
2486 if (!strcmp(s, resultflags2str[i].str))
2488 resultflags |= resultflags2str[i].flag;
2491 if (!resultflags2str[i].str)
2492 pool_debug(pool, SOLV_ERROR, "result: unknown flag '%s'\n", s);
2499 testcase_read(Pool *pool, FILE *fp, const char *testcase, Queue *job, char **resultp, int *resultflagsp)
2504 char *testcasedir, *s;
2510 int poolflagsreset = 0;
2511 int missing_features = 0;
2516 if (!fp && !(fp = fopen(testcase, "r")))
2518 pool_debug(pool, SOLV_ERROR, "testcase_read: could not open '%s'\n", testcase);
2521 testcasedir = solv_strdup(testcase);
2522 if ((s = strrchr(testcasedir, '/')) != 0)
2527 buf = solv_malloc(bufl);
2530 queue_init(&autoinstq);
2533 if (bufp - buf + 16 > bufl)
2536 buf = solv_realloc(buf, bufl + 512);
2540 if (!fgets(bufp, bufl - (bufp - buf), fp))
2544 if (!l || buf[l - 1] != '\n')
2551 while (*s && (*s == ' ' || *s == '\t'))
2553 if (!*s || *s == '#')
2556 /* split it in pieces */
2559 while (*s == ' ' || *s == '\t')
2563 pieces = solv_extend(pieces, npieces, 1, sizeof(*pieces), 7);
2564 pieces[npieces++] = s;
2565 while (*s && *s != ' ' && *s != '\t')
2570 pieces = solv_extend(pieces, npieces, 1, sizeof(*pieces), 7);
2571 pieces[npieces] = 0;
2572 if (!strcmp(pieces[0], "repo") && npieces >= 4)
2574 Repo *repo = repo_create(pool, pieces[1]);
2580 if (!poolflagsreset)
2583 testcase_resetpoolflags(pool); /* hmm */
2585 if (sscanf(pieces[2], "%d.%d", &prio, &subprio) != 2)
2588 prio = atoi(pieces[2]);
2590 repo->priority = prio;
2591 repo->subpriority = subprio;
2592 if (strcmp(pieces[3], "empty") != 0)
2594 const char *repotype = pool_tmpjoin(pool, pieces[3], 0, 0); /* gets overwritten in <inline> case */
2595 if (!strcmp(pieces[4], "<inline>"))
2597 char *idata = read_inline_file(fp, &buf, &bufp, &bufl);
2599 rfp = solv_xfopen_buf(rdata, &idata, 0, "rf");
2603 rdata = pool_tmpjoin(pool, testcasedir, pieces[4], 0);
2604 rfp = solv_xfopen(rdata, "r");
2608 pool_debug(pool, SOLV_ERROR, "testcase_read: could not open '%s'\n", rdata);
2610 else if (!strcmp(repotype, "testtags"))
2612 testcase_add_testtags(repo, rfp, 0);
2615 else if (!strcmp(repotype, "solv"))
2617 repo_add_solv(repo, rfp, 0);
2621 else if (!strcmp(repotype, "helix"))
2623 extern int repo_add_helix(Repo *repo, FILE *fp, int flags);
2624 repo_add_helix(repo, rfp, 0);
2631 pool_debug(pool, SOLV_ERROR, "testcase_read: unknown repo type for repo '%s'\n", repo->name);
2635 else if (!strcmp(pieces[0], "system") && npieces >= 3)
2639 /* must set the disttype before the arch */
2641 if (strcmp(pieces[2], "*") != 0)
2643 char *dp = pieces[2];
2646 char *dpe = strchr(dp, ',');
2649 for (i = 0; disttype2str[i].str != 0; i++)
2650 if (!strcmp(disttype2str[i].str, dp))
2654 if (disttype2str[i].str)
2656 #ifdef MULTI_SEMANTICS
2657 if (pool->disttype != disttype2str[i].type)
2658 pool_setdisttype(pool, disttype2str[i].type);
2660 if (pool->disttype == disttype2str[i].type)
2667 pool_debug(pool, SOLV_ERROR, "testcase_read: system: could not change disttype to '%s'\n", pieces[2]);
2668 missing_features = 1;
2671 if (strcmp(pieces[1], "unset") == 0)
2672 pool_setarch(pool, 0);
2673 else if (pieces[1][0] == ':')
2674 pool_setarchpolicy(pool, pieces[1] + 1);
2676 pool_setarch(pool, pieces[1]);
2679 Repo *repo = testcase_str2repo(pool, pieces[3]);
2681 pool_debug(pool, SOLV_ERROR, "testcase_read: system: unknown repo '%s'\n", pieces[3]);
2683 pool_set_installed(pool, repo);
2686 else if (!strcmp(pieces[0], "job") && npieces > 1)
2692 pool_addfileprovides(pool);
2693 pool_createwhatprovides(pool);
2696 if (npieces >= 3 && !strcmp(pieces[2], "selection"))
2698 addselectionjob(pool, pieces + 1, npieces - 1, job);
2702 for (sp = pieces[1]; sp < pieces[npieces - 1]; sp++)
2705 how = testcase_str2job(pool, pieces[1], &what);
2706 if (how >= 0 && job)
2707 queue_push2(job, how, what);
2709 else if (!strcmp(pieces[0], "vendorclass") && npieces > 1)
2711 pool_addvendorclass(pool, (const char **)(pieces + 1));
2713 else if (!strcmp(pieces[0], "namespace") && npieces > 1)
2715 int i = strlen(pieces[1]);
2716 s = strchr(pieces[1], '(');
2717 if (!s && pieces[1][i - 1] != ')')
2719 pool_debug(pool, SOLV_ERROR, "testcase_read: bad namespace '%s'\n", pieces[1]);
2727 pieces[1][i - 1] = 0;
2728 name = pool_str2id(pool, pieces[1], 1);
2729 evr = pool_str2id(pool, s + 1, 1);
2731 pieces[1][i - 1] = ')';
2732 id = pool_rel2id(pool, name, evr, REL_NAMESPACE, 1);
2733 for (i = 2; i < npieces; i++)
2734 queue_push(&q, testcase_str2solvid(pool, pieces[i]));
2735 /* now do the callback */
2738 pool_addfileprovides(pool);
2739 pool_createwhatprovides(pool);
2742 pool->whatprovides_rel[GETRELID(id)] = pool_queuetowhatprovides(pool, &q);
2746 else if (!strcmp(pieces[0], "poolflags"))
2749 if (!poolflagsreset)
2752 testcase_resetpoolflags(pool); /* hmm */
2754 for (i = 1; i < npieces; i++)
2755 testcase_setpoolflags(pool, pieces[i]);
2757 else if (!strcmp(pieces[0], "solverflags") && npieces > 1)
2762 solv = solver_create(pool);
2763 testcase_resetsolverflags(solv);
2765 for (i = 1; i < npieces; i++)
2766 testcase_setsolverflags(solv, pieces[i]);
2768 else if (!strcmp(pieces[0], "result") && npieces > 1)
2771 int resultflags = str2resultflags(pool, pieces[1]);
2775 rdata = pool_tmpjoin(pool, testcasedir, pieces[2], 0);
2776 if (!strcmp(pieces[2], "<inline>"))
2777 result = read_inline_file(fp, &buf, &bufp, &bufl);
2780 FILE *rfp = fopen(rdata, "r");
2782 pool_debug(pool, SOLV_ERROR, "testcase_read: could not open '%s'\n", rdata);
2785 result = read_file(rfp);
2795 *resultflagsp = resultflags;
2797 else if (!strcmp(pieces[0], "nextjob") && npieces == 1)
2801 else if (!strcmp(pieces[0], "disable") && npieces == 3)
2804 if (strcmp(pieces[1], "pkg"))
2806 pool_debug(pool, SOLV_ERROR, "testcase_read: bad disable type '%s'\n", pieces[1]);
2810 pool_createwhatprovides(pool);
2812 if (!pool->considered)
2814 pool->considered = solv_calloc(1, sizeof(Map));
2815 map_init(pool->considered, pool->nsolvables);
2816 map_setall(pool->considered);
2818 p = testcase_str2solvid(pool, pieces[2]);
2820 MAPCLR(pool->considered, p);
2822 pool_debug(pool, SOLV_ERROR, "disable: unknown package '%s'\n", pieces[2]);
2824 else if (!strcmp(pieces[0], "feature"))
2827 for (i = 1; i < npieces; i++)
2829 for (j = 0; features[j]; j++)
2830 if (!strcmp(pieces[i], features[j]))
2834 pool_debug(pool, SOLV_ERROR, "testcase_read: missing feature '%s'\n", pieces[i]);
2838 if (missing_features)
2841 else if (!strcmp(pieces[0], "genid") && npieces > 1)
2848 for (sp = pieces[2]; sp < pieces[npieces - 1]; sp++)
2852 genid = solv_extend(genid, ngenid, 1, sizeof(*genid), 7);
2853 if (!strcmp(pieces[1], "op") && npieces > 2)
2856 for (op = oplist; op->flags; op++)
2857 if (!strncmp(pieces[2], op->opname, strlen(op->opname)))
2861 pool_debug(pool, SOLV_ERROR, "testcase_read: genid: unknown op '%s'\n", pieces[2]);
2866 pool_debug(pool, SOLV_ERROR, "testcase_read: genid: out of stack\n");
2870 id = pool_rel2id(pool, genid[ngenid] , genid[ngenid + 1], op->flags, 1);
2872 else if (!strcmp(pieces[1], "lit"))
2873 id = pool_str2id(pool, npieces > 2 ? pieces[2] : "", 1);
2874 else if (!strcmp(pieces[1], "null"))
2876 else if (!strcmp(pieces[1], "dep"))
2877 id = testcase_str2dep(pool, pieces[2]);
2880 pool_debug(pool, SOLV_ERROR, "testcase_read: genid: unknown command '%s'\n", pieces[1]);
2883 genid[ngenid++] = id;
2885 else if (!strcmp(pieces[0], "autoinst") && npieces > 2)
2887 if (strcmp(pieces[1], "name"))
2889 pool_debug(pool, SOLV_ERROR, "testcase_read: autoinst: illegal mode\n");
2892 queue_push(&autoinstq, pool_str2id(pool, pieces[2], 1));
2896 pool_debug(pool, SOLV_ERROR, "testcase_read: cannot parse command '%s'\n", pieces[0]);
2899 while (job && ngenid > 0)
2900 queue_push2(job, SOLVER_NOOP | SOLVER_SOLVABLE_PROVIDES, genid[--ngenid]);
2901 if (autoinstq.count)
2902 pool_add_userinstalled_jobs(pool, &autoinstq, job, GET_USERINSTALLED_NAMES | GET_USERINSTALLED_INVERTED);
2903 queue_free(&autoinstq);
2904 genid = solv_free(genid);
2905 buf = solv_free(buf);
2906 pieces = solv_free(pieces);
2907 solv_free(testcasedir);
2910 pool_addfileprovides(pool);
2911 pool_createwhatprovides(pool);
2915 solv = solver_create(pool);
2916 testcase_resetsolverflags(solv);
2920 if (missing_features)
2925 *resultflagsp = 77; /* hack for testsolv */
2931 testcase_resultdiff(const char *result1, const char *result2)
2933 Strqueue sq1, sq2, osq;
2935 strqueue_init(&sq1);
2936 strqueue_init(&sq2);
2937 strqueue_init(&osq);
2938 strqueue_split(&sq1, result1);
2939 strqueue_split(&sq2, result2);
2940 strqueue_sort(&sq1);
2941 strqueue_sort(&sq2);
2942 strqueue_diff(&sq1, &sq2, &osq);
2943 r = osq.nstr ? strqueue_join(&osq) : 0;
2944 strqueue_free(&sq1);
2945 strqueue_free(&sq2);
2946 strqueue_free(&osq);