2 * Copyright (c) 2012, Novell Inc.
4 * This program is licensed under the BSD license, read LICENSE.BSD
5 * for further information
19 #include "poolvendor.h"
21 #include "repo_solv.h"
23 #include "solverdebug.h"
26 #include "selection.h"
27 #include "solv_xfopen.h"
30 #include "tools_util.h"
32 static struct job2str {
36 { SOLVER_NOOP, "noop" },
37 { SOLVER_INSTALL, "install" },
38 { SOLVER_ERASE, "erase" },
39 { SOLVER_UPDATE, "update" },
40 { SOLVER_WEAKENDEPS, "weakendeps" },
41 { SOLVER_MULTIVERSION, "multiversion" },
42 { SOLVER_MULTIVERSION, "noobsoletes" }, /* old name */
43 { SOLVER_LOCK, "lock" },
44 { SOLVER_DISTUPGRADE, "distupgrade" },
45 { SOLVER_VERIFY, "verify" },
46 { SOLVER_DROP_ORPHANED, "droporphaned" },
47 { SOLVER_USERINSTALLED, "userinstalled" },
48 { SOLVER_ALLOWUNINSTALL, "allowuninstall" },
49 { SOLVER_FAVOR, "favor" },
50 { SOLVER_DISFAVOR, "disfavor" },
54 static struct jobflags2str {
58 { SOLVER_WEAK, "weak" },
59 { SOLVER_ESSENTIAL, "essential" },
60 { SOLVER_CLEANDEPS, "cleandeps" },
61 { SOLVER_ORUPDATE, "orupdate" },
62 { SOLVER_FORCEBEST, "forcebest" },
63 { SOLVER_TARGETED, "targeted" },
64 { SOLVER_NOTBYUSER, "notbyuser" },
65 { SOLVER_SETEV, "setev" },
66 { SOLVER_SETEVR, "setevr" },
67 { SOLVER_SETARCH, "setarch" },
68 { SOLVER_SETVENDOR, "setvendor" },
69 { SOLVER_SETREPO, "setrepo" },
70 { SOLVER_NOAUTOSET, "noautoset" },
74 static struct resultflags2str {
77 } resultflags2str[] = {
78 { TESTCASE_RESULT_TRANSACTION, "transaction" },
79 { TESTCASE_RESULT_PROBLEMS, "problems" },
80 { TESTCASE_RESULT_ORPHANED, "orphaned" },
81 { TESTCASE_RESULT_RECOMMENDED, "recommended" },
82 { TESTCASE_RESULT_UNNEEDED, "unneeded" },
83 { TESTCASE_RESULT_ALTERNATIVES, "alternatives" },
84 { TESTCASE_RESULT_RULES, "rules" },
85 { TESTCASE_RESULT_GENID, "genid" },
86 { TESTCASE_RESULT_REASON, "reason" },
90 static struct solverflags2str {
94 } solverflags2str[] = {
95 { SOLVER_FLAG_ALLOW_DOWNGRADE, "allowdowngrade", 0 },
96 { SOLVER_FLAG_ALLOW_NAMECHANGE, "allownamechange", 1 },
97 { SOLVER_FLAG_ALLOW_ARCHCHANGE, "allowarchchange", 0 },
98 { SOLVER_FLAG_ALLOW_VENDORCHANGE, "allowvendorchange", 0 },
99 { SOLVER_FLAG_ALLOW_UNINSTALL, "allowuninstall", 0 },
100 { SOLVER_FLAG_NO_UPDATEPROVIDE, "noupdateprovide", 0 },
101 { SOLVER_FLAG_SPLITPROVIDES, "splitprovides", 0 },
102 { SOLVER_FLAG_IGNORE_RECOMMENDED, "ignorerecommended", 0 },
103 { SOLVER_FLAG_ADD_ALREADY_RECOMMENDED, "addalreadyrecommended", 0 },
104 { SOLVER_FLAG_NO_INFARCHCHECK, "noinfarchcheck", 0 },
105 { SOLVER_FLAG_KEEP_EXPLICIT_OBSOLETES, "keepexplicitobsoletes", 0 },
106 { SOLVER_FLAG_BEST_OBEY_POLICY, "bestobeypolicy", 0 },
107 { SOLVER_FLAG_NO_AUTOTARGET, "noautotarget", 0 },
108 { SOLVER_FLAG_DUP_ALLOW_DOWNGRADE, "dupallowdowngrade", 1 },
109 { SOLVER_FLAG_DUP_ALLOW_ARCHCHANGE, "dupallowarchchange", 1 },
110 { SOLVER_FLAG_DUP_ALLOW_VENDORCHANGE, "dupallowvendorchange", 1 },
111 { SOLVER_FLAG_DUP_ALLOW_NAMECHANGE, "dupallownamechange", 1 },
112 { SOLVER_FLAG_KEEP_ORPHANS, "keeporphans", 0 },
113 { SOLVER_FLAG_BREAK_ORPHANS, "breakorphans", 0 },
114 { SOLVER_FLAG_FOCUS_INSTALLED, "focusinstalled", 0 },
115 { SOLVER_FLAG_YUM_OBSOLETES, "yumobsoletes", 0 },
116 { SOLVER_FLAG_NEED_UPDATEPROVIDE, "needupdateprovide", 0 },
117 { SOLVER_FLAG_URPM_REORDER, "urpmreorder", 0 },
118 { SOLVER_FLAG_FOCUS_BEST, "focusbest", 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>" },
393 testcase_dep2str_complex(Pool *pool, Id id, int addparens)
402 return testcase_id2str(pool, id, 1);
403 rd = GETRELDEP(pool, id);
405 /* check for special shortcuts */
406 if (rd->flags == REL_NAMESPACE && !ISRELDEP(rd->name) && !strncmp(pool_id2str(pool, rd->name), "namespace:", 10))
408 const char *ns = pool_id2str(pool, rd->name);
409 int nslen = strlen(ns);
410 /* special namespace formatting */
411 const char *evrs = testcase_dep2str_complex(pool, rd->evr, 0);
412 s = pool_tmpappend(pool, evrs, ns, "()");
413 memmove(s + nslen + 1, s, strlen(s) - nslen - 2);
414 memcpy(s, ns, nslen);
418 if (rd->flags == REL_MULTIARCH && !ISRELDEP(rd->name) && rd->evr == ARCH_ANY)
420 /* special :any suffix */
421 const char *ns = testcase_id2str(pool, rd->name, 1);
422 return pool_tmpappend(pool, ns, ":any", 0);
426 if (ISRELDEP(rd->name))
428 Reldep *rd2 = GETRELDEP(pool, rd->name);
430 if (rd->flags > 7 && rd->flags != REL_COMPAT && rd2->flags && rd2->flags <= 7)
433 s = (char *)testcase_dep2str_complex(pool, rd->name, needparens);
437 s = pool_tmpappend(pool, s, "(", 0);
438 memmove(s + 1, s, strlen(s + 1));
441 for (op = oplist; op->flags; op++)
442 if (rd->flags == op->flags)
446 s = pool_tmpappend(pool, s, " ", op->opname);
447 s = pool_tmpappend(pool, s, " ", 0);
452 sprintf(buf, " <%u> ", rd->flags);
453 s = pool_tmpappend(pool, s, buf, 0);
457 if (ISRELDEP(rd->evr))
459 Reldep *rd2 = GETRELDEP(pool, rd->evr);
461 if (rd->flags > 7 && rd2->flags && rd2->flags <= 7)
463 if (rd->flags == REL_AND && rd2->flags == REL_AND)
464 needparens = 0; /* chain */
465 if (rd->flags == REL_OR && rd2->flags == REL_OR)
466 needparens = 0; /* chain */
467 if (rd->flags > 0 && rd->flags < 8 && rd2->flags == REL_COMPAT)
468 needparens = 0; /* chain */
470 if (!ISRELDEP(rd->evr))
471 s2 = testcase_id2str(pool, rd->evr, 0);
473 s2 = testcase_dep2str_complex(pool, rd->evr, needparens);
475 s = pool_tmpappend(pool, s, s2, ")");
477 s = pool_tmpappend(pool, s, s2, 0);
478 pool_freetmpspace(pool, s2);
483 testcase_dep2str(Pool *pool, Id id)
485 return testcase_dep2str_complex(pool, id, 0);
489 /* Convert a simple string. Also handle the :any suffix */
491 testcase_str2dep_simple(Pool *pool, const char **sp, int isname)
498 for (s = *sp; *s; s++)
502 if (*s == ' ' || *(unsigned char *)s < 32)
506 if (*s == ')' && paren-- <= 0)
509 if (isname && s - *sp > 4 && !strncmp(s - 4, ":any", 4))
516 if (s - *sp == 6 && !strncmp(*sp, "<NULL>", 6))
519 id = pool_strn2id(pool, *sp, s - *sp, 1);
521 else if (s - *sp == 3 && !strncmp(*sp, "\\00", 3))
525 char buf[128], *bp, *bp2;
527 bp = s - *sp >= 128 ? solv_malloc(s - *sp + 1) : buf;
528 for (bp2 = bp, sp2 = *sp; sp2 < s;)
532 solv_hex2bin(&sp2, (unsigned char *)bp2 - 1, 1);
535 id = pool_str2id(pool, bp, 1);
541 id = pool_rel2id(pool, id, ARCH_ANY, REL_MULTIARCH, 1);
550 testcase_str2dep_complex(Pool *pool, const char **sp, int relop)
553 Id flags, id, id2, namespaceid = 0;
556 while (*s == ' ' || *s == '\t')
558 if (!strncmp(s, "namespace:", 10))
560 /* special namespace hack */
562 for (s2 = s + 10; *s2 && *s2 != '('; s2++)
566 namespaceid = pool_strn2id(pool, s, s2 - s, 1);
573 id = testcase_str2dep_complex(pool, &s, 0);
582 id = testcase_str2dep_simple(pool, &s, relop ? 0 : 1);
584 id = pool_rel2id(pool, namespaceid, id, REL_NAMESPACE, 1);
588 while (*s == ' ' || *s == '\t')
590 if (!*s || *s == ')' || (relop && strncmp(s, "compat >= ", 10) != 0))
596 /* we have an op! Find the end */
598 if (s[0] == '<' && (s[1] >= '0' && s[1] <= '9'))
601 for (s2 = s + 1; *s2 >= '0' && *s2 <= '9'; s2++)
605 flags = strtoul(s + 1, 0, 10);
611 for (op = oplist; op->flags; op++)
612 if (!strncmp(s, op->opname, strlen(op->opname)))
620 s += strlen(op->opname);
622 id2 = testcase_str2dep_complex(pool, &s, flags > 0 && flags < 8);
628 id = pool_rel2id(pool, id, id2, flags, 1);
633 testcase_str2dep(Pool *pool, const char *s)
635 Id id = testcase_str2dep_complex(pool, &s, 0);
636 return s && !*s ? id : 0;
639 /**********************************************************/
642 testcase_repoid2str(Pool *pool, Id repoid)
644 Repo *repo = pool_id2repo(pool, repoid);
647 char *r = pool_tmpjoin(pool, repo->name, 0, 0);
649 for (rp = r; *rp; rp++)
650 if (*rp == ' ' || *rp == '\t')
657 sprintf(buf, "#%d", repoid);
658 return pool_tmpjoin(pool, buf, 0, 0);
663 testcase_solvid2str(Pool *pool, Id p)
665 Solvable *s = pool->solvables + p;
666 const char *n, *e, *a;
669 if (p == SYSTEMSOLVABLE)
671 n = pool_id2str(pool, s->name);
672 e = pool_id2str(pool, s->evr);
673 a = pool_id2str(pool, s->arch);
674 str = pool_alloctmpspace(pool, strlen(n) + strlen(e) + strlen(a) + 3);
675 sprintf(str, "%s-%s.%s", n, e, a);
677 return pool_tmpappend(pool, str, "@", 0);
681 char *str2 = pool_tmpappend(pool, str, "@", s->repo->name);
683 if (str2[l] == ' ' || str2[l] == '\t')
687 sprintf(buf, "@#%d", s->repo->repoid);
688 return pool_tmpappend(pool, str, buf, 0);
692 testcase_str2repo(Pool *pool, const char *str)
696 if (str[0] == '#' && (str[1] >= '0' && str[1] <= '9'))
700 for (j = 1; str[j] >= '0' && str[j] <= '9'; j++)
701 repoid = repoid * 10 + (str[j] - '0');
702 if (!str[j] && repoid > 0 && repoid < pool->nrepos)
703 repo = pool_id2repo(pool, repoid);
707 FOR_REPOS(repoid, repo)
712 l = strlen(repo->name);
713 for (i = 0; i < l; i++)
715 int c = repo->name[i];
716 if (c == ' ' || c == '\t')
721 if (i == l && !str[l])
724 if (repoid >= pool->nrepos)
731 testcase_str2solvid(Pool *pool, const char *str)
733 int i, l = strlen(str);
740 if (*str == '@' && !strcmp(str, "@SYSTEM"))
741 return SYSTEMSOLVABLE;
743 for (i = l - 1; i >= 0; i--)
744 if (str[i] == '@' && (repo = testcase_str2repo(pool, str + i + 1)) != 0)
749 /* now find the arch (if present) */
751 for (i = repostart - 1; i > 0; i--)
754 arch = pool_strn2id(pool, str + i + 1, repostart - (i + 1), 0);
759 /* now find the name */
760 for (i = repostart - 1; i > 0; i--)
764 Id nid, evrid, p, pp;
765 nid = pool_strn2id(pool, str, i, 0);
768 evrid = pool_strn2id(pool, str + i + 1, repostart - (i + 1), 0);
771 /* first check whatprovides */
772 FOR_PROVIDES(p, pp, nid)
774 Solvable *s = pool->solvables + p;
775 if (s->name != nid || s->evr != evrid)
777 if (repo && s->repo != repo)
779 if (arch && s->arch != arch)
783 /* maybe it's not installable and thus not in whatprovides. do a slow search */
787 FOR_REPO_SOLVABLES(repo, p, s)
789 if (s->name != nid || s->evr != evrid)
791 if (arch && s->arch != arch)
798 FOR_POOL_SOLVABLES(p)
800 Solvable *s = pool->solvables + p;
801 if (s->name != nid || s->evr != evrid)
803 if (arch && s->arch != arch)
814 testcase_job2str(Pool *pool, Id how, Id what)
821 Id select = how & SOLVER_SELECTMASK;
823 for (i = 0; job2str[i].str; i++)
824 if ((how & SOLVER_JOBMASK) == job2str[i].job)
826 jobstr = job2str[i].str ? job2str[i].str : "unknown";
827 if (select == SOLVER_SOLVABLE)
830 pkgstr = testcase_solvid2str(pool, what);
832 else if (select == SOLVER_SOLVABLE_NAME)
835 pkgstr = testcase_dep2str(pool, what);
837 else if (select == SOLVER_SOLVABLE_PROVIDES)
839 selstr = " provides ";
840 pkgstr = testcase_dep2str(pool, what);
842 else if (select == SOLVER_SOLVABLE_ONE_OF)
847 while ((p = pool->whatprovidesdata[what++]) != 0)
849 const char *s = testcase_solvid2str(pool, p);
852 pkgstr = pool_tmpappend(pool, pkgstr, " ", s);
853 pool_freetmpspace(pool, s);
861 else if (select == SOLVER_SOLVABLE_REPO)
863 Repo *repo = pool_id2repo(pool, what);
868 sprintf(buf, "#%d", repo->repoid);
869 pkgstr = pool_tmpjoin(pool, buf, 0, 0);
872 pkgstr = pool_tmpjoin(pool, repo->name, 0, 0);
874 else if (select == SOLVER_SOLVABLE_ALL)
881 selstr = " unknown ";
884 ret = pool_tmpjoin(pool, jobstr, selstr, pkgstr);
886 ret = pool_tmpappend(pool, ret, " ", 0);
887 for (i = 0; jobflags2str[i].str; i++)
888 if ((how & jobflags2str[i].flag) != 0)
889 ret = pool_tmpappend(pool, ret, ",", jobflags2str[i].str);
895 ret = pool_tmpappend(pool, ret, "]", 0);
901 str2selflags(Pool *pool, char *s) /* modifies the string! */
906 char *se = strchr(s, ',');
909 for (i = 0; selflags2str[i].str; i++)
910 if (!strcmp(s, selflags2str[i].str))
912 selflags |= selflags2str[i].flag;
915 if (!selflags2str[i].str)
916 pool_debug(pool, SOLV_ERROR, "str2job: unknown selection flag '%s'\n", s);
923 str2jobflags(Pool *pool, char *s) /* modifies the string */
928 char *se = strchr(s, ',');
931 for (i = 0; jobflags2str[i].str; i++)
932 if (!strcmp(s, jobflags2str[i].str))
934 jobflags |= jobflags2str[i].flag;
937 if (!jobflags2str[i].str)
938 pool_debug(pool, SOLV_ERROR, "str2job: unknown job flag '%s'\n", s);
945 testcase_str2job(Pool *pool, const char *str, Id *whatp)
955 /* so we can patch it */
956 s = pool_tmpjoin(pool, str, 0, 0);
957 /* split it in pieces */
960 while (*s == ' ' || *s == '\t')
964 pieces = solv_extend(pieces, npieces, 1, sizeof(*pieces), 7);
965 pieces[npieces++] = s;
966 while (*s && *s != ' ' && *s != '\t')
973 pool_debug(pool, SOLV_ERROR, "str2job: bad line '%s'\n", str);
978 for (i = 0; job2str[i].str; i++)
979 if (!strcmp(pieces[0], job2str[i].str))
983 pool_debug(pool, SOLV_ERROR, "str2job: unknown job '%s'\n", str);
987 job = job2str[i].job;
991 char *flags = pieces[npieces - 1];
992 if (*flags == '[' && flags[strlen(flags) - 1] == ']')
996 flags[strlen(flags) - 1] = 0;
997 job |= str2jobflags(pool, flags);
1000 if (!strcmp(pieces[1], "pkg"))
1004 pool_debug(pool, SOLV_ERROR, "str2job: bad pkg selector in '%s'\n", str);
1008 job |= SOLVER_SOLVABLE;
1009 what = testcase_str2solvid(pool, pieces[2]);
1012 pool_debug(pool, SOLV_ERROR, "str2job: unknown package '%s'\n", pieces[2]);
1017 else if (!strcmp(pieces[1], "name") || !strcmp(pieces[1], "provides"))
1019 /* join em again for dep2str... */
1021 for (sp = pieces[2]; sp < pieces[npieces - 1]; sp++)
1025 if (pieces[1][0] == 'p' && strncmp(pieces[2], "namespace:", 10) == 0)
1027 char *spe = strchr(pieces[2], '(');
1028 int l = strlen(pieces[2]);
1029 if (spe && pieces[2][l - 1] == ')')
1031 /* special namespace provides */
1032 if (strcmp(spe, "(<NULL>)") != 0)
1034 pieces[2][l - 1] = 0;
1035 what = testcase_str2dep(pool, spe + 1);
1036 pieces[2][l - 1] = ')';
1038 what = pool_rel2id(pool, pool_strn2id(pool, pieces[2], spe - pieces[2], 1), what, REL_NAMESPACE, 1);
1042 what = testcase_str2dep(pool, pieces[2]);
1043 if (pieces[1][0] == 'n')
1044 job |= SOLVER_SOLVABLE_NAME;
1046 job |= SOLVER_SOLVABLE_PROVIDES;
1048 else if (!strcmp(pieces[1], "oneof"))
1051 job |= SOLVER_SOLVABLE_ONE_OF;
1053 if (npieces > 3 && strcmp(pieces[2], "nothing") != 0)
1055 for (i = 2; i < npieces; i++)
1057 Id p = testcase_str2solvid(pool, pieces[i]);
1060 pool_debug(pool, SOLV_ERROR, "str2job: unknown package '%s'\n", pieces[i]);
1068 what = pool_queuetowhatprovides(pool, &q);
1071 else if (!strcmp(pieces[1], "repo"))
1076 pool_debug(pool, SOLV_ERROR, "str2job: bad line '%s'\n", str);
1080 repo = testcase_str2repo(pool, pieces[2]);
1083 pool_debug(pool, SOLV_ERROR, "str2job: unknown repo '%s'\n", pieces[2]);
1087 job |= SOLVER_SOLVABLE_REPO;
1088 what = repo->repoid;
1090 else if (!strcmp(pieces[1], "all"))
1092 if (npieces != 3 && strcmp(pieces[2], "packages") != 0)
1094 pool_debug(pool, SOLV_ERROR, "str2job: bad line '%s'\n", str);
1098 job |= SOLVER_SOLVABLE_ALL;
1103 pool_debug(pool, SOLV_ERROR, "str2job: unknown selection in '%s'\n", str);
1113 addselectionjob(Pool *pool, char **pieces, int npieces, Queue *jobqueue)
1120 for (i = 0; job2str[i].str; i++)
1121 if (!strcmp(pieces[0], job2str[i].str))
1123 if (!job2str[i].str)
1125 pool_debug(pool, SOLV_ERROR, "selstr2job: unknown job '%s'\n", pieces[0]);
1128 job = job2str[i].job;
1131 char *flags = pieces[npieces - 1];
1132 if (*flags == '[' && flags[strlen(flags) - 1] == ']')
1136 flags[strlen(flags) - 1] = 0;
1137 job |= str2jobflags(pool, flags);
1142 pool_debug(pool, SOLV_ERROR, "selstr2job: no selection flags\n");
1145 selflags = str2selflags(pool, pieces[3]);
1147 r = selection_make(pool, &sel, pieces[2], selflags);
1148 for (i = 0; i < sel.count; i += 2)
1149 queue_push2(jobqueue, job | sel.elements[i], sel.elements[i + 1]);
1155 writedeps(Repo *repo, FILE *fp, const char *tag, Id key, Solvable *s, Offset off)
1157 Pool *pool = repo->pool;
1164 dp = repo->idarraydata + off;
1165 while ((id = *dp++) != 0)
1167 if (key == SOLVABLE_REQUIRES && id == SOLVABLE_PREREQMARKER)
1170 fprintf(fp, "-%s\n", tag);
1175 if (key == SOLVABLE_PROVIDES && id == SOLVABLE_FILEMARKER)
1177 idstr = testcase_dep2str(pool, id);
1180 fprintf(fp, "+%s\n", tag);
1183 fprintf(fp, "%s\n", idstr);
1186 fprintf(fp, "-%s\n", tag);
1190 writefilelist(Repo *repo, FILE *fp, const char *tag, Solvable *s)
1192 Pool *pool = repo->pool;
1196 dataiterator_init(&di, pool, repo, s - pool->solvables, SOLVABLE_FILELIST, 0, 0);
1197 while (dataiterator_step(&di))
1199 const char *s = repodata_dir2str(di.data, di.kv.id, di.kv.str);
1202 fprintf(fp, "+%s\n", tag);
1205 fprintf(fp, "%s\n", s);
1208 fprintf(fp, "-%s\n", tag);
1209 dataiterator_free(&di);
1213 testcase_write_testtags(Repo *repo, FILE *fp)
1215 Pool *pool = repo->pool;
1221 const char *release;
1226 fprintf(fp, "=Ver: 3.0\n");
1228 FOR_REPO_SOLVABLES(repo, p, s)
1230 name = pool_id2str(pool, s->name);
1231 evr = pool_id2str(pool, s->evr);
1232 arch = pool_id2str(pool, s->arch);
1233 release = strrchr(evr, '-');
1235 release = evr + strlen(evr);
1236 fprintf(fp, "=Pkg: %s %.*s %s %s\n", name, (int)(release - evr), evr, *release && release[1] ? release + 1 : "-", arch);
1237 tmp = solvable_lookup_str(s, SOLVABLE_SUMMARY);
1239 fprintf(fp, "=Sum: %s\n", tmp);
1240 writedeps(repo, fp, "Req:", SOLVABLE_REQUIRES, s, s->requires);
1241 writedeps(repo, fp, "Prv:", SOLVABLE_PROVIDES, s, s->provides);
1242 writedeps(repo, fp, "Obs:", SOLVABLE_OBSOLETES, s, s->obsoletes);
1243 writedeps(repo, fp, "Con:", SOLVABLE_CONFLICTS, s, s->conflicts);
1244 writedeps(repo, fp, "Rec:", SOLVABLE_RECOMMENDS, s, s->recommends);
1245 writedeps(repo, fp, "Sup:", SOLVABLE_SUPPLEMENTS, s, s->supplements);
1246 writedeps(repo, fp, "Sug:", SOLVABLE_SUGGESTS, s, s->suggests);
1247 writedeps(repo, fp, "Enh:", SOLVABLE_ENHANCES, s, s->enhances);
1248 if (solvable_lookup_idarray(s, SOLVABLE_PREREQ_IGNOREINST, &q))
1251 fprintf(fp, "+Ipr:\n");
1252 for (i = 0; i < q.count; i++)
1253 fprintf(fp, "%s\n", testcase_dep2str(pool, q.elements[i]));
1254 fprintf(fp, "-Ipr:\n");
1257 fprintf(fp, "=Vnd: %s\n", pool_id2str(pool, s->vendor));
1258 ti = solvable_lookup_num(s, SOLVABLE_BUILDTIME, 0);
1260 fprintf(fp, "=Tim: %u\n", ti);
1261 writefilelist(repo, fp, "Fls:", s);
1267 static inline Offset
1268 adddep(Repo *repo, Offset olddeps, char *str, Id marker)
1270 Id id = *str == '/' ? pool_str2id(repo->pool, str, 1) : testcase_str2dep(repo->pool, str);
1271 return repo_addid_dep(repo, olddeps, id, marker);
1275 finish_v2_solvable(Pool *pool, Repodata *data, Solvable *s, char *filelist, int nfilelist)
1281 for (l = 0; l < nfilelist; l += strlen(filelist + l) + 1)
1283 char *p = strrchr(filelist + l, '/');
1287 did = repodata_str2dir(data, filelist + l, 1);
1290 did = repodata_str2dir(data, "/", 1);
1291 repodata_add_dirstr(data, s - pool->solvables, SOLVABLE_FILELIST, did, p);
1294 repo_rewrite_suse_deps(s, 0);
1297 /* stripped down version of susetags parser used for testcases */
1299 testcase_add_testtags(Repo *repo, FILE *fp, int flags)
1301 Pool *pool = repo->pool;
1313 int tagsversion = 0;
1314 int addselfprovides = 1; /* for compat reasons */
1316 data = repo_add_repodata(repo, flags);
1321 line = solv_malloc(aline);
1325 if (linep - line + 16 > aline)
1327 aline = linep - line;
1328 line = solv_realloc(line, aline + 512);
1329 linep = line + aline;
1332 if (!fgets(linep, aline - (linep - line), fp))
1334 linep += strlen(linep);
1335 if (linep == line || linep[-1] != '\n')
1338 linep = line + intag;
1341 if (line[intag] == '-' && !strncmp(line + 1, line + intag + 1, intag - 2))
1348 else if (line[0] == '+' && line[1] && line[1] != ':')
1350 char *tagend = strchr(line, ':');
1355 intag = tagend + 2 - line;
1356 linep = line + intag;
1359 if (*line != '=' || !line[1] || !line[2] || !line[3] || line[4] != ':')
1361 tag = line[1] << 16 | line[2] << 8 | line[3];
1364 case 'V' << 16 | 'e' << 8 | 'r':
1365 tagsversion = atoi(line + 6);
1366 addselfprovides = tagsversion < 3 || strstr(line + 6, "addselfprovides") != 0;
1368 case 'P' << 16 | 'k' << 8 | 'g':
1371 if (tagsversion == 2)
1372 finish_v2_solvable(pool, data, s, filelist, nfilelist);
1373 if (addselfprovides && s->name && s->arch != ARCH_SRC && s->arch != ARCH_NOSRC)
1374 s->provides = repo_addid_dep(s->repo, s->provides, pool_rel2id(pool, s->name, s->evr, REL_EQ, 1), 0);
1377 if (split(line + 5, sp, 5) != 4)
1379 s = pool_id2solvable(pool, repo_add_solvable(repo));
1380 s->name = pool_str2id(pool, sp[0], 1);
1381 /* join back version and release */
1382 if (sp[2] && !(sp[2][0] == '-' && !sp[2][1]))
1384 s->evr = makeevr(pool, sp[1]);
1385 s->arch = pool_str2id(pool, sp[3], 1);
1387 case 'S' << 16 | 'u' << 8 | 'm':
1388 repodata_set_str(data, s - pool->solvables, SOLVABLE_SUMMARY, line + 6);
1390 case 'V' << 16 | 'n' << 8 | 'd':
1391 s->vendor = pool_str2id(pool, line + 6, 1);
1393 case 'T' << 16 | 'i' << 8 | 'm':
1396 repodata_set_num(data, s - pool->solvables, SOLVABLE_BUILDTIME, t);
1398 case 'R' << 16 | 'e' << 8 | 'q':
1399 s->requires = adddep(repo, s->requires, line + 6, -SOLVABLE_PREREQMARKER);
1401 case 'P' << 16 | 'r' << 8 | 'q':
1402 s->requires = adddep(repo, s->requires, line + 6, SOLVABLE_PREREQMARKER);
1404 case 'P' << 16 | 'r' << 8 | 'v':
1405 /* version 2 had the file list at the end of the provides */
1406 if (tagsversion == 2)
1410 int l = strlen(line + 6) + 1;
1411 if (nfilelist + l > afilelist)
1413 afilelist = nfilelist + l + 512;
1414 filelist = solv_realloc(filelist, afilelist);
1416 memcpy(filelist + nfilelist, line + 6, l);
1423 for (l = 0; l < nfilelist; l += strlen(filelist + l) + 1)
1424 s->provides = repo_addid_dep(repo, s->provides, pool_str2id(pool, filelist + l, 1), 0);
1428 s->provides = adddep(repo, s->provides, line + 6, 0);
1430 case 'F' << 16 | 'l' << 8 | 's':
1432 char *p = strrchr(line + 6, '/');
1437 did = repodata_str2dir(data, line + 6, 1);
1439 did = repodata_str2dir(data, "/", 1);
1440 repodata_add_dirstr(data, s - pool->solvables, SOLVABLE_FILELIST, did, p);
1443 case 'O' << 16 | 'b' << 8 | 's':
1444 s->obsoletes = adddep(repo, s->obsoletes, line + 6, 0);
1446 case 'C' << 16 | 'o' << 8 | 'n':
1447 s->conflicts = adddep(repo, s->conflicts, line + 6, 0);
1449 case 'R' << 16 | 'e' << 8 | 'c':
1450 s->recommends = adddep(repo, s->recommends, line + 6, 0);
1452 case 'S' << 16 | 'u' << 8 | 'p':
1453 s->supplements = adddep(repo, s->supplements, line + 6, 0);
1455 case 'S' << 16 | 'u' << 8 | 'g':
1456 s->suggests = adddep(repo, s->suggests, line + 6, 0);
1458 case 'E' << 16 | 'n' << 8 | 'h':
1459 s->enhances = adddep(repo, s->enhances, line + 6, 0);
1461 case 'I' << 16 | 'p' << 8 | 'r':
1463 Id id = line[6] == '/' ? pool_str2id(pool, line + 6, 1) : testcase_str2dep(pool, line + 6);
1464 repodata_add_idarray(data, s - pool->solvables, SOLVABLE_PREREQ_IGNOREINST, id);
1473 if (tagsversion == 2)
1474 finish_v2_solvable(pool, data, s, filelist, nfilelist);
1475 if (addselfprovides && s->name && s->arch != ARCH_SRC && s->arch != ARCH_NOSRC)
1476 s->provides = repo_addid_dep(s->repo, s->provides, pool_rel2id(pool, s->name, s->evr, REL_EQ, 1), 0);
1479 solv_free(filelist);
1480 repodata_free_dircache(data);
1481 if (!(flags & REPO_NO_INTERNALIZE))
1482 repodata_internalize(data);
1487 testcase_getpoolflags(Pool *pool)
1489 const char *str = 0;
1491 for (i = 0; poolflags2str[i].str; i++)
1493 v = pool_get_flag(pool, poolflags2str[i].flag);
1494 if (v == poolflags2str[i].def)
1496 str = pool_tmpappend(pool, str, v ? " " : " !", poolflags2str[i].str);
1498 return str ? str + 1 : "";
1502 testcase_setpoolflags(Pool *pool, const char *str)
1504 const char *p = str, *s;
1508 while (*p == ' ' || *p == '\t' || *p == ',')
1519 while (*p && *p != ' ' && *p != '\t' && *p != ',')
1521 for (i = 0; poolflags2str[i].str; i++)
1522 if (!strncmp(poolflags2str[i].str, s, p - s) && poolflags2str[i].str[p - s] == 0)
1524 if (!poolflags2str[i].str)
1526 pool_debug(pool, SOLV_ERROR, "setpoolflags: unknown flag '%.*s'\n", (int)(p - s), s);
1529 pool_set_flag(pool, poolflags2str[i].flag, v);
1535 testcase_resetpoolflags(Pool *pool)
1538 for (i = 0; poolflags2str[i].str; i++)
1539 pool_set_flag(pool, poolflags2str[i].flag, poolflags2str[i].def);
1543 testcase_getsolverflags(Solver *solv)
1545 Pool *pool = solv->pool;
1546 const char *str = 0;
1548 for (i = 0; solverflags2str[i].str; i++)
1550 v = solver_get_flag(solv, solverflags2str[i].flag);
1551 if (v == solverflags2str[i].def)
1553 str = pool_tmpappend(pool, str, v ? " " : " !", solverflags2str[i].str);
1555 return str ? str + 1 : "";
1559 testcase_setsolverflags(Solver *solv, const char *str)
1561 const char *p = str, *s;
1565 while (*p == ' ' || *p == '\t' || *p == ',')
1576 while (*p && *p != ' ' && *p != '\t' && *p != ',')
1578 for (i = 0; solverflags2str[i].str; i++)
1579 if (!strncmp(solverflags2str[i].str, s, p - s) && solverflags2str[i].str[p - s] == 0)
1581 if (!solverflags2str[i].str)
1583 pool_debug(solv->pool, SOLV_ERROR, "setsolverflags: unknown flag '%.*s'\n", (int)(p - s), s);
1586 if (solver_set_flag(solv, solverflags2str[i].flag, v) == -1)
1588 pool_debug(solv->pool, SOLV_ERROR, "setsolverflags: unsupported flag '%s'\n", solverflags2str[i].str);
1596 testcase_resetsolverflags(Solver *solv)
1599 for (i = 0; solverflags2str[i].str; i++)
1600 solver_set_flag(solv, solverflags2str[i].flag, solverflags2str[i].def);
1604 testcase_ruleid(Solver *solv, Id rid)
1610 const unsigned char *md5;
1616 solver_ruleliterals(solv, rid, &q);
1617 for (i = 0; i < q.count; i++)
1619 Id p = q.elements[i];
1620 s = testcase_solvid2str(solv->pool, p > 0 ? p : -p);
1622 s = pool_tmpjoin(solv->pool, "!", s, 0);
1623 strqueue_push(&sq, s);
1626 strqueue_sort_u(&sq);
1627 chk = solv_chksum_create(REPOKEY_TYPE_MD5);
1628 for (i = 0; i < sq.nstr; i++)
1629 solv_chksum_add(chk, sq.str[i], strlen(sq.str[i]) + 1);
1630 md5 = solv_chksum_get(chk, &md5l);
1631 s = pool_bin2hex(solv->pool, md5, md5l);
1632 chk = solv_chksum_free(chk, 0);
1638 testcase_problemid(Solver *solv, Id problem)
1643 const unsigned char *md5;
1647 /* we build a hash of all rules that define the problem */
1650 solver_findallproblemrules(solv, problem, &q);
1651 for (i = 0; i < q.count; i++)
1652 strqueue_push(&sq, testcase_ruleid(solv, q.elements[i]));
1654 strqueue_sort_u(&sq);
1655 chk = solv_chksum_create(REPOKEY_TYPE_MD5);
1656 for (i = 0; i < sq.nstr; i++)
1657 solv_chksum_add(chk, sq.str[i], strlen(sq.str[i]) + 1);
1658 md5 = solv_chksum_get(chk, &md5l);
1659 s = pool_bin2hex(solv->pool, md5, 4);
1660 chk = solv_chksum_free(chk, 0);
1666 testcase_solutionid(Solver *solv, Id problem, Id solution)
1670 const unsigned char *md5;
1674 intid = solver_solutionelement_internalid(solv, problem, solution);
1675 /* internal stuff! handle with care! */
1679 s = testcase_job2str(solv->pool, solv->job.elements[-intid - 1], solv->job.elements[-intid]);
1684 s = testcase_ruleid(solv, intid);
1686 chk = solv_chksum_create(REPOKEY_TYPE_MD5);
1687 solv_chksum_add(chk, s, strlen(s) + 1);
1688 md5 = solv_chksum_get(chk, &md5l);
1689 s = pool_bin2hex(solv->pool, md5, 4);
1690 chk = solv_chksum_free(chk, 0);
1695 testcase_alternativeid(Solver *solv, int type, Id id, Id from)
1698 Pool *pool = solv->pool;
1700 const unsigned char *md5;
1702 chk = solv_chksum_create(REPOKEY_TYPE_MD5);
1703 if (type == SOLVER_ALTERNATIVE_TYPE_RECOMMENDS)
1705 s = testcase_solvid2str(pool, from);
1706 solv_chksum_add(chk, s, strlen(s) + 1);
1707 s = testcase_dep2str(pool, id);
1708 solv_chksum_add(chk, s, strlen(s) + 1);
1710 else if (type == SOLVER_ALTERNATIVE_TYPE_RULE)
1712 s = testcase_ruleid(solv, id);
1713 solv_chksum_add(chk, s, strlen(s) + 1);
1715 md5 = solv_chksum_get(chk, &md5l);
1716 s = pool_bin2hex(pool, md5, 4);
1717 chk = solv_chksum_free(chk, 0);
1721 static struct class2str {
1725 { SOLVER_TRANSACTION_ERASE, "erase" },
1726 { SOLVER_TRANSACTION_INSTALL, "install" },
1727 { SOLVER_TRANSACTION_REINSTALLED, "reinstall" },
1728 { SOLVER_TRANSACTION_DOWNGRADED, "downgrade" },
1729 { SOLVER_TRANSACTION_CHANGED, "change" },
1730 { SOLVER_TRANSACTION_UPGRADED, "upgrade" },
1731 { SOLVER_TRANSACTION_OBSOLETED, "obsolete" },
1732 { SOLVER_TRANSACTION_MULTIINSTALL, "multiinstall" },
1733 { SOLVER_TRANSACTION_MULTIREINSTALL, "multireinstall" },
1737 static struct reason2str {
1741 { SOLVER_REASON_UNRELATED, "unrelated" },
1742 { SOLVER_REASON_UNIT_RULE, "unit" },
1743 { SOLVER_REASON_KEEP_INSTALLED, "keep" },
1744 { SOLVER_REASON_RESOLVE_JOB, "job" },
1745 { SOLVER_REASON_UPDATE_INSTALLED, "update" },
1746 { SOLVER_REASON_CLEANDEPS_ERASE, "cleandeps" },
1747 { SOLVER_REASON_RESOLVE, "resolve" },
1748 { SOLVER_REASON_WEAKDEP, "weakdep" },
1749 { SOLVER_REASON_RESOLVE_ORPHAN, "orphan" },
1751 { SOLVER_REASON_RECOMMENDED, "recommended" },
1752 { SOLVER_REASON_SUPPLEMENTED, "supplemented" },
1757 testcase_reason2str(Id reason)
1760 for (i = 0; reason2str[i].str; i++)
1761 if (reason == reason2str[i].reason)
1762 return reason2str[i].str;
1766 static struct rclass2str {
1770 { SOLVER_RULE_PKG, "pkg" },
1771 { SOLVER_RULE_UPDATE, "update" },
1772 { SOLVER_RULE_FEATURE, "feature" },
1773 { SOLVER_RULE_JOB, "job" },
1774 { SOLVER_RULE_DISTUPGRADE, "distupgrade" },
1775 { SOLVER_RULE_INFARCH, "infarch" },
1776 { SOLVER_RULE_CHOICE, "choice" },
1777 { SOLVER_RULE_LEARNT, "learnt" },
1778 { SOLVER_RULE_BEST, "best" },
1779 { SOLVER_RULE_YUMOBS, "yumobs" },
1784 testcase_rclass2str(Id rclass)
1787 for (i = 0; rclass2str[i].str; i++)
1788 if (rclass == rclass2str[i].rclass)
1789 return rclass2str[i].str;
1794 dump_genid(Pool *pool, Strqueue *sq, Id id, int cnt)
1802 Reldep *rd = GETRELDEP(pool, id);
1803 for (op = oplist; op->flags; op++)
1804 if (rd->flags == op->flags)
1806 cnt = dump_genid(pool, sq, rd->name, cnt);
1807 cnt = dump_genid(pool, sq, rd->evr, cnt);
1808 sprintf(cntbuf, "genid %2d: genid ", cnt++);
1809 s = pool_tmpjoin(pool, cntbuf, "op ", op->flags ? op->opname : "unknown");
1813 sprintf(cntbuf, "genid %2d: genid ", cnt++);
1814 s = pool_tmpjoin(pool, cntbuf, id ? "lit " : "null", id ? pool_id2str(pool, id) : 0);
1816 strqueue_push(sq, s);
1821 testcase_solverresult(Solver *solv, int resultflags)
1823 Pool *pool = solv->pool;
1831 if ((resultflags & TESTCASE_RESULT_TRANSACTION) != 0)
1833 Transaction *trans = solver_create_transaction(solv);
1837 for (i = 0; class2str[i].str; i++)
1840 transaction_classify_pkgs(trans, SOLVER_TRANSACTION_KEEP_PSEUDO, class2str[i].class, 0, 0, &q);
1841 for (j = 0; j < q.count; j++)
1845 if (pool->installed && pool->solvables[p].repo == pool->installed)
1846 op = transaction_obs_pkg(trans, p);
1847 s = pool_tmpjoin(pool, class2str[i].str, " ", testcase_solvid2str(pool, p));
1849 s = pool_tmpjoin(pool, s, " ", testcase_solvid2str(pool, op));
1850 strqueue_push(&sq, s);
1854 transaction_free(trans);
1856 if ((resultflags & TESTCASE_RESULT_PROBLEMS) != 0)
1858 char *probprefix, *solprefix;
1859 int problem, solution, element;
1862 pcnt = solver_problem_count(solv);
1863 for (problem = 1; problem <= pcnt; problem++)
1865 Id rid, from, to, dep;
1866 SolverRuleinfo rinfo;
1867 rid = solver_findproblemrule(solv, problem);
1868 s = testcase_problemid(solv, problem);
1869 probprefix = solv_dupjoin("problem ", s, 0);
1870 rinfo = solver_ruleinfo(solv, rid, &from, &to, &dep);
1871 s = pool_tmpjoin(pool, probprefix, " info ", solver_problemruleinfo2str(solv, rinfo, from, to, dep));
1872 strqueue_push(&sq, s);
1873 scnt = solver_solution_count(solv, problem);
1874 for (solution = 1; solution <= scnt; solution++)
1876 s = testcase_solutionid(solv, problem, solution);
1877 solprefix = solv_dupjoin(probprefix, " solution ", s);
1879 while ((element = solver_next_solutionelement(solv, problem, solution, element, &p, &op)) != 0)
1881 if (p == SOLVER_SOLUTION_JOB)
1882 s = pool_tmpjoin(pool, solprefix, " deljob ", testcase_job2str(pool, solv->job.elements[op - 1], solv->job.elements[op]));
1883 else if (p > 0 && op == 0)
1884 s = pool_tmpjoin(pool, solprefix, " erase ", testcase_solvid2str(pool, p));
1885 else if (p > 0 && op > 0)
1887 s = pool_tmpjoin(pool, solprefix, " replace ", testcase_solvid2str(pool, p));
1888 s = pool_tmpappend(pool, s, " ", testcase_solvid2str(pool, op));
1890 else if (p < 0 && op > 0)
1891 s = pool_tmpjoin(pool, solprefix, " allow ", testcase_solvid2str(pool, op));
1893 s = pool_tmpjoin(pool, solprefix, " unknown", 0);
1894 strqueue_push(&sq, s);
1896 solv_free(solprefix);
1898 solv_free(probprefix);
1902 if ((resultflags & TESTCASE_RESULT_ORPHANED) != 0)
1907 solver_get_orphaned(solv, &q);
1908 for (i = 0; i < q.count; i++)
1910 s = pool_tmpjoin(pool, "orphaned ", testcase_solvid2str(pool, q.elements[i]), 0);
1911 strqueue_push(&sq, s);
1916 if ((resultflags & TESTCASE_RESULT_RECOMMENDED) != 0)
1922 solver_get_recommendations(solv, &qr, &qs, 0);
1923 for (i = 0; i < qr.count; i++)
1925 s = pool_tmpjoin(pool, "recommended ", testcase_solvid2str(pool, qr.elements[i]), 0);
1926 strqueue_push(&sq, s);
1928 for (i = 0; i < qs.count; i++)
1930 s = pool_tmpjoin(pool, "suggested ", testcase_solvid2str(pool, qs.elements[i]), 0);
1931 strqueue_push(&sq, s);
1937 if ((resultflags & TESTCASE_RESULT_UNNEEDED) != 0)
1943 solver_get_unneeded(solv, &q, 0);
1944 solver_get_unneeded(solv, &qf, 1);
1945 for (i = j = 0; i < q.count; i++)
1947 /* we rely on qf containing a subset of q in the same order */
1948 if (j < qf.count && q.elements[i] == qf.elements[j])
1950 s = pool_tmpjoin(pool, "unneeded_filtered ", testcase_solvid2str(pool, q.elements[i]), 0);
1954 s = pool_tmpjoin(pool, "unneeded ", testcase_solvid2str(pool, q.elements[i]), 0);
1955 strqueue_push(&sq, s);
1960 if ((resultflags & TESTCASE_RESULT_ALTERNATIVES) != 0)
1968 cnt = solver_alternatives_count(solv);
1969 for (alternative = 1; alternative <= cnt; alternative++)
1971 Id id, from, chosen;
1973 int type = solver_get_alternative(solv, alternative, &id, &from, &chosen, &q, 0);
1974 altprefix = solv_dupjoin("alternative ", testcase_alternativeid(solv, type, id, from), " ");
1976 if (type == SOLVER_ALTERNATIVE_TYPE_RECOMMENDS)
1978 char *s = pool_tmpjoin(pool, altprefix, num, testcase_solvid2str(pool, from));
1979 s = pool_tmpappend(pool, s, " recommends ", testcase_dep2str(pool, id));
1980 strqueue_push(&sq, s);
1982 else if (type == SOLVER_ALTERNATIVE_TYPE_RULE)
1984 /* map choice rules back to pkg rules */
1985 if (solver_ruleclass(solv, id) == SOLVER_RULE_CHOICE)
1986 id = solver_rule2pkgrule(solv, id);
1987 solver_allruleinfos(solv, id, &rq);
1988 for (i = 0; i < rq.count; i += 4)
1990 int rtype = rq.elements[i];
1991 if ((rtype & SOLVER_RULE_TYPEMASK) == SOLVER_RULE_JOB)
1993 const char *js = testcase_job2str(pool, rq.elements[i + 2], rq.elements[i + 3]);
1994 char *s = pool_tmpjoin(pool, altprefix, num, " job ");
1995 s = pool_tmpappend(pool, s, js, 0);
1996 strqueue_push(&sq, s);
1998 else if (rtype == SOLVER_RULE_PKG_REQUIRES)
2000 char *s = pool_tmpjoin(pool, altprefix, num, testcase_solvid2str(pool, rq.elements[i + 1]));
2001 s = pool_tmpappend(pool, s, " requires ", testcase_dep2str(pool, rq.elements[i + 3]));
2002 strqueue_push(&sq, s);
2006 for (i = 0; i < q.count; i++)
2008 Id p = q.elements[i];
2010 num[0] = '0' + (i + 1) / 10;
2011 num[1] = '0' + (i + 1) % 10;
2013 s = pool_tmpjoin(pool, altprefix, num, "+ ");
2015 s = pool_tmpjoin(pool, altprefix, num, "- ");
2017 s = pool_tmpjoin(pool, altprefix, num, " ");
2018 s = pool_tmpappend(pool, s, testcase_solvid2str(pool, p < 0 ? -p : p), 0);
2019 strqueue_push(&sq, s);
2021 solv_free(altprefix);
2026 if ((resultflags & TESTCASE_RESULT_RULES) != 0)
2028 /* dump all rules */
2030 SolverRuleinfo rclass;
2035 for (rid = 1; (rclass = solver_ruleclass(solv, rid)) != SOLVER_RULE_UNKNOWN; rid++)
2037 char *prefix = solv_dupjoin("rule ", testcase_rclass2str(rclass), " ");
2038 prefix = solv_dupappend(prefix, testcase_ruleid(solv, rid), 0);
2039 solver_ruleliterals(solv, rid, &q);
2040 if (rclass == SOLVER_RULE_FEATURE && q.count == 1 && q.elements[0] == -SYSTEMSOLVABLE)
2042 for (i = 0; i < q.count; i++)
2044 Id p = q.elements[i];
2047 s = pool_tmpjoin(pool, prefix, " -", testcase_solvid2str(pool, -p));
2049 s = pool_tmpjoin(pool, prefix, " ", testcase_solvid2str(pool, p));
2050 strqueue_push(&sq, s);
2056 if ((resultflags & TESTCASE_RESULT_GENID) != 0)
2058 for (i = 0 ; i < solv->job.count; i += 2)
2061 if (solv->job.elements[i] != (SOLVER_NOOP | SOLVER_SOLVABLE_PROVIDES))
2063 id = solv->job.elements[i + 1];
2064 s = testcase_dep2str(pool, id);
2065 strqueue_push(&sq, pool_tmpjoin(pool, "genid dep ", s, 0));
2066 if ((id2 = testcase_str2dep(pool, s)) != id)
2068 s = pool_tmpjoin(pool, "genid roundtrip error: ", testcase_dep2str(pool, id2), 0);
2069 strqueue_push(&sq, s);
2071 dump_genid(pool, &sq, id, 1);
2074 if ((resultflags & TESTCASE_RESULT_REASON) != 0)
2078 FOR_POOL_SOLVABLES(p)
2081 int reason = solver_describe_decision(solv, p, &info);
2082 if (reason == SOLVER_REASON_UNRELATED)
2084 if (reason == SOLVER_REASON_WEAKDEP)
2086 solver_describe_weakdep_decision(solv, p, &whyq);
2089 for (i = 0; i < whyq.count; i += 3)
2091 reason = whyq.elements[i];
2092 p2 = whyq.elements[i + 1];
2093 id = whyq.elements[i + 2];
2094 s = pool_tmpjoin(pool, "reason ", testcase_solvid2str(pool, p), 0);
2095 s = pool_tmpappend(pool, s, " ", testcase_reason2str(reason));
2096 s = pool_tmpappend(pool, s, " ", testcase_dep2str(pool, id));
2098 s = pool_tmpappend(pool, s, " ", testcase_solvid2str(pool, p2));
2099 strqueue_push(&sq, s);
2104 s = pool_tmpjoin(pool, "reason ", testcase_solvid2str(pool, p), 0);
2105 s = pool_tmpappend(pool, s, " ", testcase_reason2str(reason));
2107 s = pool_tmpappend(pool, s, " ", testcase_ruleid(solv, info));
2108 strqueue_push(&sq, s);
2113 result = strqueue_join(&sq);
2120 testcase_write_mangled(Solver *solv, const char *dir, int resultflags, const char *testcasename, const char *resultname)
2122 Pool *pool = solv->pool;
2133 testcasename = "testcase.t";
2135 resultname = "solver.result";
2137 if (mkdir(dir, 0777) && errno != EEXIST)
2139 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: could not create directory '%s'\n", dir);
2143 FOR_REPOS(repoid, repo)
2145 const char *name = testcase_repoid2str(pool, repoid);
2147 if (repo->subpriority)
2148 sprintf(priobuf, "%d.%d", repo->priority, repo->subpriority);
2150 sprintf(priobuf, "%d", repo->priority);
2151 out = pool_tmpjoin(pool, name, ".repo", ".gz");
2152 for (i = 0; out[i]; i++)
2155 cmd = pool_tmpjoin(pool, "repo ", name, " ");
2156 cmd = pool_tmpappend(pool, cmd, priobuf, " ");
2157 cmd = pool_tmpappend(pool, cmd, "testtags ", out);
2158 strqueue_push(&sq, cmd);
2159 out = pool_tmpjoin(pool, dir, "/", out);
2160 if (!(fp = solv_xfopen(out, "w")))
2162 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: could not open '%s' for writing\n", out);
2166 testcase_write_testtags(repo, fp);
2169 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: write error\n");
2174 /* hmm, this is not optimal... we currently search for the lowest score */
2176 arch = pool->solvables[SYSTEMSOLVABLE].arch;
2177 for (i = 0; i < pool->lastarch; i++)
2179 if (pool->id2arch[i] == 1 && !lowscore)
2181 if (pool->id2arch[i] > 0x10000 && (!lowscore || pool->id2arch[i] < lowscore))
2184 lowscore = pool->id2arch[i];
2187 cmd = pool_tmpjoin(pool, "system ", pool->lastarch ? pool_id2str(pool, arch) : "unset", 0);
2188 for (i = 0; disttype2str[i].str != 0; i++)
2189 if (pool->disttype == disttype2str[i].type)
2191 pool_tmpappend(pool, cmd, " ", disttype2str[i].str ? disttype2str[i].str : "unknown");
2192 if (pool->installed)
2193 cmd = pool_tmpappend(pool, cmd, " ", testcase_repoid2str(pool, pool->installed->repoid));
2194 strqueue_push(&sq, cmd);
2195 s = testcase_getpoolflags(solv->pool);
2198 cmd = pool_tmpjoin(pool, "poolflags ", s, 0);
2199 strqueue_push(&sq, cmd);
2202 if (pool->vendorclasses)
2205 for (i = 0; pool->vendorclasses[i]; i++)
2207 cmd = pool_tmpappend(pool, cmd ? cmd : "vendorclass", " ", pool->vendorclasses[i]);
2208 if (!pool->vendorclasses[i + 1])
2210 strqueue_push(&sq, cmd);
2217 /* dump disabled packages (must come before the namespace/job lines) */
2218 if (pool->considered)
2221 FOR_POOL_SOLVABLES(p)
2222 if (!MAPTST(pool->considered, p))
2224 cmd = pool_tmpjoin(pool, "disable pkg ", testcase_solvid2str(pool, p), 0);
2225 strqueue_push(&sq, cmd);
2229 s = testcase_getsolverflags(solv);
2232 cmd = pool_tmpjoin(pool, "solverflags ", s, 0);
2233 strqueue_push(&sq, cmd);
2236 /* now dump all the ns callback values we know */
2237 if (pool->nscallback)
2241 for (rid = 1; rid < pool->nrels; rid++)
2243 Reldep *rd = pool->rels + rid;
2244 if (rd->flags != REL_NAMESPACE || rd->name == NAMESPACE_OTHERPROVIDERS)
2246 /* evaluate all namespace ids, skip empty results */
2247 d = pool_whatprovides(pool, MAKERELDEP(rid));
2248 if (!d || !pool->whatprovidesdata[d])
2250 cmd = pool_tmpjoin(pool, "namespace ", pool_id2str(pool, rd->name), "(");
2251 cmd = pool_tmpappend(pool, cmd, pool_id2str(pool, rd->evr), ")");
2252 for (; pool->whatprovidesdata[d]; d++)
2253 cmd = pool_tmpappend(pool, cmd, " ", testcase_solvid2str(pool, pool->whatprovidesdata[d]));
2254 strqueue_push(&sq, cmd);
2258 for (i = 0; i < solv->job.count; i += 2)
2260 cmd = (char *)testcase_job2str(pool, solv->job.elements[i], solv->job.elements[i + 1]);
2261 cmd = pool_tmpjoin(pool, "job ", cmd, 0);
2262 strqueue_push(&sq, cmd);
2269 for (i = 0; resultflags2str[i].str; i++)
2270 if ((resultflags & resultflags2str[i].flag) != 0)
2271 cmd = pool_tmpappend(pool, cmd, cmd ? "," : 0, resultflags2str[i].str);
2272 cmd = pool_tmpjoin(pool, "result ", cmd ? cmd : "?", 0);
2273 cmd = pool_tmpappend(pool, cmd, " ", resultname);
2274 strqueue_push(&sq, cmd);
2275 result = testcase_solverresult(solv, resultflags);
2276 if (!strcmp(resultname, "<inline>"))
2280 strqueue_init(&rsq);
2281 strqueue_split(&rsq, result);
2282 for (i = 0; i < rsq.nstr; i++)
2284 cmd = pool_tmpjoin(pool, "#>", rsq.str[i], 0);
2285 strqueue_push(&sq, cmd);
2287 strqueue_free(&rsq);
2291 out = pool_tmpjoin(pool, dir, "/", resultname);
2292 if (!(fp = fopen(out, "w")))
2294 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: could not open '%s' for writing\n", out);
2299 if (result && *result && fwrite(result, strlen(result), 1, fp) != 1)
2301 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: write error\n");
2309 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: write error\n");
2317 cmd = strqueue_join(&sq);
2318 out = pool_tmpjoin(pool, dir, "/", testcasename);
2319 if (!(fp = fopen(out, "w")))
2321 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: could not open '%s' for writing\n", out);
2325 if (*cmd && fwrite(cmd, strlen(cmd), 1, fp) != 1)
2327 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: write error\n");
2334 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: write error\n");
2344 testcase_write(Solver *solv, const char *dir, int resultflags, const char *testcasename, const char *resultname)
2346 Pool *pool = solv->pool;
2349 const char **orignames;
2351 /* mangle repo names so that there are no conflicts */
2352 orignames = solv_calloc(pool->nrepos, sizeof(char *));
2353 for (repoid = 1; repoid < pool->nrepos; repoid++)
2355 Repo *repo = pool_id2repo(pool, repoid);
2356 char *buf = solv_malloc((repo->name ? strlen(repo->name) : 0) + 40);
2358 orignames[repoid] = repo->name;
2359 if (!repo->name || !repo->name[0])
2360 sprintf(buf, "#%d", repoid);
2362 strcpy(buf, repo->name);
2363 for (i = 0; buf[i]; i++)
2364 if (buf[i] == ' ' || buf[i] == '\t' || buf[i] == '/')
2366 mp = buf + strlen(buf);
2369 for (i = 1; i < repoid; i++)
2370 if (!strcmp(buf, pool_id2repo(pool, i)->name))
2374 sprintf(mp, "_%d", mangle++);
2378 r = testcase_write_mangled(solv, dir, resultflags, testcasename, resultname);
2379 for (repoid = 1; repoid < pool->nrepos; repoid++)
2381 Repo *repo = pool_id2repo(pool, repoid);
2382 solv_free((void *)repo->name);
2383 repo->name = orignames[repoid];
2385 solv_free(orignames);
2390 read_inline_file(FILE *fp, char **bufp, char **bufpp, int *buflp)
2392 char *result = solv_malloc(1024);
2399 if (rp - result + 256 >= resultl)
2401 resultl = rp - result;
2402 result = solv_realloc(result, resultl + 1024);
2403 rp = result + resultl;
2406 if (!fgets(rp, resultl - (rp - result), fp))
2409 if (rl && (rp == result || rp[-1] == '\n'))
2411 if (rl > 1 && rp[0] == '#' && rp[1] == '>')
2413 memmove(rp, rp + 2, rl - 2);
2418 while (rl + 16 > *buflp)
2420 *bufp = solv_realloc(*bufp, *buflp + 512);
2423 memmove(*bufp, rp, rl);
2424 if ((*bufp)[rl - 1] == '\n')
2430 (*bufpp) = *bufp + rl;
2447 char *result = solv_malloc(1024);
2454 if (rp - result + 256 >= resultl)
2456 resultl = rp - result;
2457 result = solv_realloc(result, resultl + 1024);
2458 rp = result + resultl;
2461 rl = fread(rp, 1, resultl - (rp - result), fp);
2473 str2resultflags(Pool *pool, char *s) /* modifies the string! */
2475 int i, resultflags = 0;
2478 char *se = strchr(s, ',');
2481 for (i = 0; resultflags2str[i].str; i++)
2482 if (!strcmp(s, resultflags2str[i].str))
2484 resultflags |= resultflags2str[i].flag;
2487 if (!resultflags2str[i].str)
2488 pool_debug(pool, SOLV_ERROR, "result: unknown flag '%s'\n", s);
2495 testcase_read(Pool *pool, FILE *fp, const char *testcase, Queue *job, char **resultp, int *resultflagsp)
2500 char *testcasedir, *s;
2506 int poolflagsreset = 0;
2507 int missing_features = 0;
2512 if (!fp && !(fp = fopen(testcase, "r")))
2514 pool_debug(pool, SOLV_ERROR, "testcase_read: could not open '%s'\n", testcase);
2517 testcasedir = solv_strdup(testcase);
2518 if ((s = strrchr(testcasedir, '/')) != 0)
2523 buf = solv_malloc(bufl);
2526 queue_init(&autoinstq);
2529 if (bufp - buf + 16 > bufl)
2532 buf = solv_realloc(buf, bufl + 512);
2536 if (!fgets(bufp, bufl - (bufp - buf), fp))
2540 if (!l || buf[l - 1] != '\n')
2547 while (*s && (*s == ' ' || *s == '\t'))
2549 if (!*s || *s == '#')
2552 /* split it in pieces */
2555 while (*s == ' ' || *s == '\t')
2559 pieces = solv_extend(pieces, npieces, 1, sizeof(*pieces), 7);
2560 pieces[npieces++] = s;
2561 while (*s && *s != ' ' && *s != '\t')
2566 pieces = solv_extend(pieces, npieces, 1, sizeof(*pieces), 7);
2567 pieces[npieces] = 0;
2568 if (!strcmp(pieces[0], "repo") && npieces >= 4)
2570 Repo *repo = repo_create(pool, pieces[1]);
2576 if (!poolflagsreset)
2579 testcase_resetpoolflags(pool); /* hmm */
2581 if (sscanf(pieces[2], "%d.%d", &prio, &subprio) != 2)
2584 prio = atoi(pieces[2]);
2586 repo->priority = prio;
2587 repo->subpriority = subprio;
2588 if (strcmp(pieces[3], "empty") != 0)
2590 const char *repotype = pool_tmpjoin(pool, pieces[3], 0, 0); /* gets overwritten in <inline> case */
2591 if (!strcmp(pieces[4], "<inline>"))
2593 char *idata = read_inline_file(fp, &buf, &bufp, &bufl);
2595 rfp = solv_xfopen_buf(rdata, &idata, 0, "rf");
2599 rdata = pool_tmpjoin(pool, testcasedir, pieces[4], 0);
2600 rfp = solv_xfopen(rdata, "r");
2604 pool_debug(pool, SOLV_ERROR, "testcase_read: could not open '%s'\n", rdata);
2606 else if (!strcmp(repotype, "testtags"))
2608 testcase_add_testtags(repo, rfp, 0);
2611 else if (!strcmp(repotype, "solv"))
2613 repo_add_solv(repo, rfp, 0);
2617 else if (!strcmp(repotype, "helix"))
2619 extern int repo_add_helix(Repo *repo, FILE *fp, int flags);
2620 repo_add_helix(repo, rfp, 0);
2627 pool_debug(pool, SOLV_ERROR, "testcase_read: unknown repo type for repo '%s'\n", repo->name);
2631 else if (!strcmp(pieces[0], "system") && npieces >= 3)
2635 /* must set the disttype before the arch */
2637 if (strcmp(pieces[2], "*") != 0)
2639 char *dp = pieces[2];
2642 char *dpe = strchr(dp, ',');
2645 for (i = 0; disttype2str[i].str != 0; i++)
2646 if (!strcmp(disttype2str[i].str, dp))
2650 if (disttype2str[i].str)
2652 #ifdef MULTI_SEMANTICS
2653 if (pool->disttype != disttype2str[i].type)
2654 pool_setdisttype(pool, disttype2str[i].type);
2656 if (pool->disttype == disttype2str[i].type)
2663 pool_debug(pool, SOLV_ERROR, "testcase_read: system: could not change disttype to '%s'\n", pieces[2]);
2664 missing_features = 1;
2667 if (strcmp(pieces[1], "unset") == 0)
2668 pool_setarch(pool, 0);
2669 else if (pieces[1][0] == ':')
2670 pool_setarchpolicy(pool, pieces[1] + 1);
2672 pool_setarch(pool, pieces[1]);
2675 Repo *repo = testcase_str2repo(pool, pieces[3]);
2677 pool_debug(pool, SOLV_ERROR, "testcase_read: system: unknown repo '%s'\n", pieces[3]);
2679 pool_set_installed(pool, repo);
2682 else if (!strcmp(pieces[0], "job") && npieces > 1)
2688 pool_addfileprovides(pool);
2689 pool_createwhatprovides(pool);
2692 if (npieces >= 3 && !strcmp(pieces[2], "selection"))
2694 addselectionjob(pool, pieces + 1, npieces - 1, job);
2698 for (sp = pieces[1]; sp < pieces[npieces - 1]; sp++)
2701 how = testcase_str2job(pool, pieces[1], &what);
2702 if (how >= 0 && job)
2703 queue_push2(job, how, what);
2705 else if (!strcmp(pieces[0], "vendorclass") && npieces > 1)
2707 pool_addvendorclass(pool, (const char **)(pieces + 1));
2709 else if (!strcmp(pieces[0], "namespace") && npieces > 1)
2711 int i = strlen(pieces[1]);
2712 s = strchr(pieces[1], '(');
2713 if (!s && pieces[1][i - 1] != ')')
2715 pool_debug(pool, SOLV_ERROR, "testcase_read: bad namespace '%s'\n", pieces[1]);
2723 pieces[1][i - 1] = 0;
2724 name = pool_str2id(pool, pieces[1], 1);
2725 evr = pool_str2id(pool, s + 1, 1);
2727 pieces[1][i - 1] = ')';
2728 id = pool_rel2id(pool, name, evr, REL_NAMESPACE, 1);
2729 for (i = 2; i < npieces; i++)
2730 queue_push(&q, testcase_str2solvid(pool, pieces[i]));
2731 /* now do the callback */
2734 pool_addfileprovides(pool);
2735 pool_createwhatprovides(pool);
2738 pool->whatprovides_rel[GETRELID(id)] = pool_queuetowhatprovides(pool, &q);
2742 else if (!strcmp(pieces[0], "poolflags"))
2745 if (!poolflagsreset)
2748 testcase_resetpoolflags(pool); /* hmm */
2750 for (i = 1; i < npieces; i++)
2751 testcase_setpoolflags(pool, pieces[i]);
2753 else if (!strcmp(pieces[0], "solverflags") && npieces > 1)
2758 solv = solver_create(pool);
2759 testcase_resetsolverflags(solv);
2761 for (i = 1; i < npieces; i++)
2762 testcase_setsolverflags(solv, pieces[i]);
2764 else if (!strcmp(pieces[0], "result") && npieces > 1)
2767 int resultflags = str2resultflags(pool, pieces[1]);
2771 rdata = pool_tmpjoin(pool, testcasedir, pieces[2], 0);
2772 if (!strcmp(pieces[2], "<inline>"))
2773 result = read_inline_file(fp, &buf, &bufp, &bufl);
2776 FILE *rfp = fopen(rdata, "r");
2778 pool_debug(pool, SOLV_ERROR, "testcase_read: could not open '%s'\n", rdata);
2781 result = read_file(rfp);
2791 *resultflagsp = resultflags;
2793 else if (!strcmp(pieces[0], "nextjob") && npieces == 1)
2797 else if (!strcmp(pieces[0], "disable") && npieces == 3)
2800 if (strcmp(pieces[1], "pkg"))
2802 pool_debug(pool, SOLV_ERROR, "testcase_read: bad disable type '%s'\n", pieces[1]);
2806 pool_createwhatprovides(pool);
2808 if (!pool->considered)
2810 pool->considered = solv_calloc(1, sizeof(Map));
2811 map_init(pool->considered, pool->nsolvables);
2812 map_setall(pool->considered);
2814 p = testcase_str2solvid(pool, pieces[2]);
2816 MAPCLR(pool->considered, p);
2818 pool_debug(pool, SOLV_ERROR, "disable: unknown package '%s'\n", pieces[2]);
2820 else if (!strcmp(pieces[0], "feature"))
2823 for (i = 1; i < npieces; i++)
2825 for (j = 0; features[j]; j++)
2826 if (!strcmp(pieces[i], features[j]))
2830 pool_debug(pool, SOLV_ERROR, "testcase_read: missing feature '%s'\n", pieces[i]);
2834 if (missing_features)
2837 else if (!strcmp(pieces[0], "genid") && npieces > 1)
2844 for (sp = pieces[2]; sp < pieces[npieces - 1]; sp++)
2848 genid = solv_extend(genid, ngenid, 1, sizeof(*genid), 7);
2849 if (!strcmp(pieces[1], "op") && npieces > 2)
2852 for (op = oplist; op->flags; op++)
2853 if (!strncmp(pieces[2], op->opname, strlen(op->opname)))
2857 pool_debug(pool, SOLV_ERROR, "testcase_read: genid: unknown op '%s'\n", pieces[2]);
2862 pool_debug(pool, SOLV_ERROR, "testcase_read: genid: out of stack\n");
2866 id = pool_rel2id(pool, genid[ngenid] , genid[ngenid + 1], op->flags, 1);
2868 else if (!strcmp(pieces[1], "lit"))
2869 id = pool_str2id(pool, npieces > 2 ? pieces[2] : "", 1);
2870 else if (!strcmp(pieces[1], "null"))
2872 else if (!strcmp(pieces[1], "dep"))
2873 id = testcase_str2dep(pool, pieces[2]);
2876 pool_debug(pool, SOLV_ERROR, "testcase_read: genid: unknown command '%s'\n", pieces[1]);
2879 genid[ngenid++] = id;
2881 else if (!strcmp(pieces[0], "autoinst") && npieces > 2)
2883 if (strcmp(pieces[1], "name"))
2885 pool_debug(pool, SOLV_ERROR, "testcase_read: autoinst: illegal mode\n");
2888 queue_push(&autoinstq, pool_str2id(pool, pieces[2], 1));
2892 pool_debug(pool, SOLV_ERROR, "testcase_read: cannot parse command '%s'\n", pieces[0]);
2895 while (job && ngenid > 0)
2896 queue_push2(job, SOLVER_NOOP | SOLVER_SOLVABLE_PROVIDES, genid[--ngenid]);
2897 if (autoinstq.count)
2898 pool_add_userinstalled_jobs(pool, &autoinstq, job, GET_USERINSTALLED_NAMES | GET_USERINSTALLED_INVERTED);
2899 queue_free(&autoinstq);
2900 genid = solv_free(genid);
2901 buf = solv_free(buf);
2902 pieces = solv_free(pieces);
2903 solv_free(testcasedir);
2906 pool_addfileprovides(pool);
2907 pool_createwhatprovides(pool);
2911 solv = solver_create(pool);
2912 testcase_resetsolverflags(solv);
2916 if (missing_features)
2921 *resultflagsp = 77; /* hack for testsolv */
2927 testcase_resultdiff(const char *result1, const char *result2)
2929 Strqueue sq1, sq2, osq;
2931 strqueue_init(&sq1);
2932 strqueue_init(&sq2);
2933 strqueue_init(&osq);
2934 strqueue_split(&sq1, result1);
2935 strqueue_split(&sq2, result2);
2936 strqueue_sort(&sq1);
2937 strqueue_sort(&sq2);
2938 strqueue_diff(&sq1, &sq2, &osq);
2939 r = osq.nstr ? strqueue_join(&osq) : 0;
2940 strqueue_free(&sq1);
2941 strqueue_free(&sq2);
2942 strqueue_free(&osq);