2 * Copyright (c) 2012, Novell Inc.
4 * This program is licensed under the BSD license, read LICENSE.BSD
5 * for further information
17 #include "poolvendor.h"
19 #include "repo_solv.h"
21 #include "solverdebug.h"
24 #include "selection.h"
25 #include "solv_xfopen.h"
26 #if ENABLE_TESTCASE_HELIXREPO
27 #include "ext/repo_helix.h"
31 #include "tools_util.h"
33 static struct job2str {
37 { SOLVER_NOOP, "noop" },
38 { SOLVER_INSTALL, "install" },
39 { SOLVER_ERASE, "erase" },
40 { SOLVER_UPDATE, "update" },
41 { SOLVER_WEAKENDEPS, "weakendeps" },
42 { SOLVER_MULTIVERSION, "multiversion" },
43 { SOLVER_MULTIVERSION, "noobsoletes" }, /* old name */
44 { SOLVER_LOCK, "lock" },
45 { SOLVER_DISTUPGRADE, "distupgrade" },
46 { SOLVER_VERIFY, "verify" },
47 { SOLVER_DROP_ORPHANED, "droporphaned" },
48 { SOLVER_USERINSTALLED, "userinstalled" },
49 { SOLVER_ALLOWUNINSTALL, "allowuninstall" },
50 { SOLVER_FAVOR, "favor" },
51 { SOLVER_DISFAVOR, "disfavor" },
55 static struct jobflags2str {
59 { SOLVER_WEAK, "weak" },
60 { SOLVER_ESSENTIAL, "essential" },
61 { SOLVER_CLEANDEPS, "cleandeps" },
62 { SOLVER_ORUPDATE, "orupdate" },
63 { SOLVER_FORCEBEST, "forcebest" },
64 { SOLVER_TARGETED, "targeted" },
65 { SOLVER_NOTBYUSER, "notbyuser" },
66 { SOLVER_SETEV, "setev" },
67 { SOLVER_SETEVR, "setevr" },
68 { SOLVER_SETARCH, "setarch" },
69 { SOLVER_SETVENDOR, "setvendor" },
70 { SOLVER_SETREPO, "setrepo" },
71 { SOLVER_NOAUTOSET, "noautoset" },
75 static struct resultflags2str {
78 } resultflags2str[] = {
79 { TESTCASE_RESULT_TRANSACTION, "transaction" },
80 { TESTCASE_RESULT_PROBLEMS, "problems" },
81 { TESTCASE_RESULT_ORPHANED, "orphaned" },
82 { TESTCASE_RESULT_RECOMMENDED, "recommended" },
83 { TESTCASE_RESULT_UNNEEDED, "unneeded" },
84 { TESTCASE_RESULT_ALTERNATIVES, "alternatives" },
85 { TESTCASE_RESULT_RULES, "rules" },
86 { TESTCASE_RESULT_GENID, "genid" },
87 { TESTCASE_RESULT_REASON, "reason" },
88 { TESTCASE_RESULT_CLEANDEPS, "cleandeps" },
92 static struct solverflags2str {
96 } solverflags2str[] = {
97 { SOLVER_FLAG_ALLOW_DOWNGRADE, "allowdowngrade", 0 },
98 { SOLVER_FLAG_ALLOW_NAMECHANGE, "allownamechange", 1 },
99 { SOLVER_FLAG_ALLOW_ARCHCHANGE, "allowarchchange", 0 },
100 { SOLVER_FLAG_ALLOW_VENDORCHANGE, "allowvendorchange", 0 },
101 { SOLVER_FLAG_ALLOW_UNINSTALL, "allowuninstall", 0 },
102 { SOLVER_FLAG_NO_UPDATEPROVIDE, "noupdateprovide", 0 },
103 { SOLVER_FLAG_SPLITPROVIDES, "splitprovides", 0 },
104 { SOLVER_FLAG_IGNORE_RECOMMENDED, "ignorerecommended", 0 },
105 { SOLVER_FLAG_ADD_ALREADY_RECOMMENDED, "addalreadyrecommended", 0 },
106 { SOLVER_FLAG_NO_INFARCHCHECK, "noinfarchcheck", 0 },
107 { SOLVER_FLAG_KEEP_EXPLICIT_OBSOLETES, "keepexplicitobsoletes", 0 },
108 { SOLVER_FLAG_BEST_OBEY_POLICY, "bestobeypolicy", 0 },
109 { SOLVER_FLAG_NO_AUTOTARGET, "noautotarget", 0 },
110 { SOLVER_FLAG_DUP_ALLOW_DOWNGRADE, "dupallowdowngrade", 1 },
111 { SOLVER_FLAG_DUP_ALLOW_ARCHCHANGE, "dupallowarchchange", 1 },
112 { SOLVER_FLAG_DUP_ALLOW_VENDORCHANGE, "dupallowvendorchange", 1 },
113 { SOLVER_FLAG_DUP_ALLOW_NAMECHANGE, "dupallownamechange", 1 },
114 { SOLVER_FLAG_KEEP_ORPHANS, "keeporphans", 0 },
115 { SOLVER_FLAG_BREAK_ORPHANS, "breakorphans", 0 },
116 { SOLVER_FLAG_FOCUS_INSTALLED, "focusinstalled", 0 },
117 { SOLVER_FLAG_YUM_OBSOLETES, "yumobsoletes", 0 },
118 { SOLVER_FLAG_NEED_UPDATEPROVIDE, "needupdateprovide", 0 },
119 { SOLVER_FLAG_URPM_REORDER, "urpmreorder", 0 },
120 { SOLVER_FLAG_FOCUS_BEST, "focusbest", 0 },
121 { SOLVER_FLAG_STRONG_RECOMMENDS, "strongrecommends", 0 },
122 { SOLVER_FLAG_INSTALL_ALSO_UPDATES, "installalsoupdates", 0 },
126 static struct poolflags2str {
130 } poolflags2str[] = {
131 { POOL_FLAG_PROMOTEEPOCH, "promoteepoch", 0 },
132 { POOL_FLAG_FORBIDSELFCONFLICTS, "forbidselfconflicts", 0 },
133 { POOL_FLAG_OBSOLETEUSESPROVIDES, "obsoleteusesprovides", 0 },
134 { POOL_FLAG_IMPLICITOBSOLETEUSESPROVIDES, "implicitobsoleteusesprovides", 0 },
135 { POOL_FLAG_OBSOLETEUSESCOLORS, "obsoleteusescolors", 0 },
136 { POOL_FLAG_IMPLICITOBSOLETEUSESCOLORS, "implicitobsoleteusescolors", 0 },
137 { POOL_FLAG_NOINSTALLEDOBSOLETES, "noinstalledobsoletes", 0 },
138 { POOL_FLAG_HAVEDISTEPOCH, "havedistepoch", 0 },
139 { POOL_FLAG_NOOBSOLETESMULTIVERSION, "noobsoletesmultiversion", 0 },
140 { POOL_FLAG_ADDFILEPROVIDESFILTERED, "addfileprovidesfiltered", 0 },
141 { POOL_FLAG_NOWHATPROVIDESAUX, "nowhatprovidesaux", 0 },
145 static struct disttype2str {
149 { DISTTYPE_RPM, "rpm" },
150 { DISTTYPE_DEB, "deb" },
151 { DISTTYPE_ARCH, "arch" },
152 { DISTTYPE_HAIKU, "haiku" },
156 static struct selflags2str {
160 { SELECTION_NAME, "name" },
161 { SELECTION_PROVIDES, "provides" },
162 { SELECTION_FILELIST, "filelist" },
163 { SELECTION_CANON, "canon" },
164 { SELECTION_DOTARCH, "dotarch" },
165 { SELECTION_REL, "rel" },
166 { SELECTION_INSTALLED_ONLY, "installedonly" },
167 { SELECTION_GLOB, "glob" },
168 { SELECTION_FLAT, "flat" },
169 { SELECTION_NOCASE, "nocase" },
170 { SELECTION_SOURCE_ONLY, "sourceonly" },
171 { SELECTION_WITH_SOURCE, "withsource" },
175 static const char *features[] = {
176 #ifdef ENABLE_LINKED_PKGS
179 #ifdef ENABLE_COMPLEX_DEPS
182 #if ENABLE_TESTCASE_HELIXREPO
183 "testcase_helixrepo",
188 typedef struct strqueue {
193 #define STRQUEUE_BLOCK 63
196 strqueue_init(Strqueue *q)
203 strqueue_free(Strqueue *q)
206 for (i = 0; i < q->nstr; i++)
207 solv_free(q->str[i]);
208 q->str = solv_free(q->str);
213 strqueue_push(Strqueue *q, const char *s)
215 q->str = solv_extend(q->str, q->nstr, 1, sizeof(*q->str), STRQUEUE_BLOCK);
216 q->str[q->nstr++] = solv_strdup(s);
220 strqueue_pushjoin(Strqueue *q, const char *s1, const char *s2, const char *s3)
222 q->str = solv_extend(q->str, q->nstr, 1, sizeof(*q->str), STRQUEUE_BLOCK);
223 q->str[q->nstr++] = solv_dupjoin(s1, s2, s3);
227 strqueue_sort_cmp(const void *ap, const void *bp, void *dp)
229 const char *a = *(const char **)ap;
230 const char *b = *(const char **)bp;
231 return strcmp(a ? a : "", b ? b : "");
235 strqueue_sort(Strqueue *q)
238 solv_sort(q->str, q->nstr, sizeof(*q->str), strqueue_sort_cmp, 0);
242 strqueue_sort_u(Strqueue *q)
246 for (i = j = 0; i < q->nstr; i++)
247 if (!j || strqueue_sort_cmp(q->str + i, q->str + j - 1, 0) != 0)
248 q->str[j++] = q->str[i];
253 strqueue_join(Strqueue *q)
257 for (i = 0; i < q->nstr; i++)
259 l += strlen(q->str[i]) + 1;
260 l++; /* trailing \0 */
263 for (i = 0; i < q->nstr; i++)
266 strcpy(rp, q->str[i]);
275 strqueue_split(Strqueue *q, const char *s)
280 while ((p = strchr(s, '\n')) != 0)
282 q->str = solv_extend(q->str, q->nstr, 1, sizeof(*q->str), STRQUEUE_BLOCK);
283 q->str[q->nstr] = solv_malloc(p - s + 1);
285 memcpy(q->str[q->nstr], s, p - s);
286 q->str[q->nstr][p - s] = 0;
295 strqueue_diff(Strqueue *sq1, Strqueue *sq2, Strqueue *osq)
298 while (i < sq1->nstr && j < sq2->nstr)
300 int r = strqueue_sort_cmp(sq1->str + i, sq2->str + j, 0);
304 strqueue_pushjoin(osq, "-", sq1->str[i++], 0);
306 strqueue_pushjoin(osq, "+", sq2->str[j++], 0);
308 while (i < sq1->nstr)
309 strqueue_pushjoin(osq, "-", sq1->str[i++], 0);
310 while (j < sq2->nstr)
311 strqueue_pushjoin(osq, "+", sq2->str[j++], 0);
316 testcase_id2str(Pool *pool, Id id, int isname)
318 const char *s = pool_id2str(pool, id);
321 int bad = 0, paren = 0, parenbad = 0;
327 if (strchr("[(<=>!", *s))
329 if (!strncmp(s, "namespace:", 10))
331 for (ss = s + bad; *ss; ss++)
333 if (*ss == ' ' || *ss == '\\' || *(unsigned char *)ss < 32 || *ss == '(' || *ss == ')')
336 paren = paren == 0 ? 1 : -1;
339 paren = paren == 1 ? 0 : -1;
344 if (isname && ss - s > 4 && !strcmp(ss - 4, ":any"))
346 if (!paren && !(bad - parenbad))
349 /* we need escaping! */
350 s2 = s2p = pool_alloctmpspace(pool, strlen(s) + bad * 2 + 1);
351 if (!strncmp(s, "namespace:", 10))
353 strcpy(s2p, "namespace\\3a");
361 if ((ss == s && strchr("[(<=>!", *s)) || *ss == ' ' || *ss == '\\' || *(unsigned char *)ss < 32 || *ss == '(' || *ss == ')')
364 solv_bin2hex((unsigned char *)ss, 1, s2p);
369 if (isname && s2p - s2 > 4 && !strcmp(s2p - 4, ":any"))
370 strcpy(s2p - 4, "\\3aany");
379 { REL_GT | REL_LT | REL_EQ, "<=>" },
380 { REL_LT | REL_EQ, "<=" },
381 { REL_GT | REL_EQ, ">=" },
383 { REL_GT | REL_LT, "<>" },
387 { REL_WITHOUT , "-" },
388 { REL_NAMESPACE , "<NAMESPACE>" },
390 { REL_MULTIARCH, "<MULTIARCH>" },
391 { REL_FILECONFLICT, "<FILECONFLICT>" },
392 { REL_COND, "<IF>" },
393 { REL_COMPAT, "compat >=" },
394 { REL_KIND, "<KIND>" },
395 { REL_ELSE, "<ELSE>" },
396 { REL_ERROR, "<ERROR>" },
397 { REL_UNLESS, "<UNLESS>" },
403 testcase_dep2str_complex(Pool *pool, char *s, Id id, int addparens)
412 s2 = testcase_id2str(pool, id, 1);
413 s = pool_tmpappend(pool, s, s2, 0);
414 pool_freetmpspace(pool, s2);
417 rd = GETRELDEP(pool, id);
419 /* check for special shortcuts */
420 if (rd->flags == REL_NAMESPACE && !ISRELDEP(rd->name) && !strncmp(pool_id2str(pool, rd->name), "namespace:", 10))
422 s = pool_tmpappend(pool, s, pool_id2str(pool, rd->name), "(");
423 s = testcase_dep2str_complex(pool, s, rd->evr, 0);
424 return pool_tmpappend(pool, s, ")", 0);
426 if (rd->flags == REL_MULTIARCH && !ISRELDEP(rd->name) && rd->evr == ARCH_ANY)
428 /* append special :any suffix */
429 s2 = testcase_id2str(pool, rd->name, 1);
430 s = pool_tmpappend(pool, s, s2, ":any");
431 pool_freetmpspace(pool, s2);
436 if (ISRELDEP(rd->name))
438 Reldep *rd2 = GETRELDEP(pool, rd->name);
440 if (rd->flags > 7 && rd->flags != REL_COMPAT && rd2->flags && rd2->flags <= 7)
445 s = pool_tmpappend(pool, s, "(", 0);
446 s = testcase_dep2str_complex(pool, s, rd->name, needparens);
448 for (op = oplist; op->flags; op++)
449 if (rd->flags == op->flags)
453 s = pool_tmpappend(pool, s, " ", op->opname);
454 s = pool_tmpappend(pool, s, " ", 0);
459 sprintf(buf, " <%u> ", rd->flags);
460 s = pool_tmpappend(pool, s, buf, 0);
464 if (ISRELDEP(rd->evr))
466 Reldep *rd2 = GETRELDEP(pool, rd->evr);
468 if (rd->flags > 7 && rd2->flags && rd2->flags <= 7)
470 if (rd->flags == REL_AND && rd2->flags == REL_AND)
471 needparens = 0; /* chain */
472 if (rd->flags == REL_OR && rd2->flags == REL_OR)
473 needparens = 0; /* chain */
474 if (rd->flags > 0 && rd->flags < 8 && rd2->flags == REL_COMPAT)
475 needparens = 0; /* chain */
477 if (!ISRELDEP(rd->evr))
479 s2 = testcase_id2str(pool, rd->evr, 0);
480 s = pool_tmpappend(pool, s, s2, 0);
481 pool_freetmpspace(pool, s2);
484 s = (char *)testcase_dep2str_complex(pool, s, rd->evr, needparens);
486 s = pool_tmpappend(pool, s, ")", 0);
491 testcase_dep2str(Pool *pool, Id id)
495 return testcase_id2str(pool, id, 1);
496 s = pool_alloctmpspace(pool, 1);
498 return testcase_dep2str_complex(pool, s, id, 0);
502 /* Convert a simple string. Also handle the :any suffix */
504 testcase_str2dep_simple(Pool *pool, const char **sp, int isname)
511 for (s = *sp; *s; s++)
515 if (*s == ' ' || *(unsigned char *)s < 32)
519 if (*s == ')' && paren-- <= 0)
522 if (isname && s - *sp > 4 && !strncmp(s - 4, ":any", 4))
529 if (s - *sp == 6 && !strncmp(*sp, "<NULL>", 6))
532 id = pool_strn2id(pool, *sp, s - *sp, 1);
534 else if (s - *sp == 3 && !strncmp(*sp, "\\00", 3))
538 char buf[128], *bp, *bp2;
540 bp = s - *sp >= 128 ? solv_malloc(s - *sp + 1) : buf;
541 for (bp2 = bp, sp2 = *sp; sp2 < s;)
545 solv_hex2bin(&sp2, (unsigned char *)bp2 - 1, 1);
548 id = pool_str2id(pool, bp, 1);
554 id = pool_rel2id(pool, id, ARCH_ANY, REL_MULTIARCH, 1);
563 testcase_str2dep_complex(Pool *pool, const char **sp, int relop)
566 Id flags, id, id2, namespaceid = 0;
569 while (*s == ' ' || *s == '\t')
571 if (!strncmp(s, "namespace:", 10))
573 /* special namespace hack */
575 for (s2 = s + 10; *s2 && *s2 != '('; s2++)
579 namespaceid = pool_strn2id(pool, s, s2 - s, 1);
586 id = testcase_str2dep_complex(pool, &s, 0);
595 id = testcase_str2dep_simple(pool, &s, relop ? 0 : 1);
597 id = pool_rel2id(pool, namespaceid, id, REL_NAMESPACE, 1);
601 while (*s == ' ' || *s == '\t')
603 if (!*s || *s == ')' || (relop && strncmp(s, "compat >= ", 10) != 0))
609 /* we have an op! Find the end */
611 if (s[0] == '<' && (s[1] >= '0' && s[1] <= '9'))
614 for (s2 = s + 1; *s2 >= '0' && *s2 <= '9'; s2++)
618 flags = strtoul(s + 1, 0, 10);
624 for (op = oplist; op->flags; op++)
625 if (!strncmp(s, op->opname, strlen(op->opname)))
633 s += strlen(op->opname);
635 id2 = testcase_str2dep_complex(pool, &s, flags > 0 && flags < 8);
641 id = pool_rel2id(pool, id, id2, flags, 1);
646 testcase_str2dep(Pool *pool, const char *s)
648 Id id = testcase_str2dep_complex(pool, &s, 0);
649 return s && !*s ? id : 0;
652 /**********************************************************/
655 testcase_repoid2str(Pool *pool, Id repoid)
657 Repo *repo = pool_id2repo(pool, repoid);
660 char *r = pool_tmpjoin(pool, repo->name, 0, 0);
662 for (rp = r; *rp; rp++)
663 if (*rp == ' ' || *rp == '\t')
670 sprintf(buf, "#%d", repoid);
671 return pool_tmpjoin(pool, buf, 0, 0);
676 testcase_solvid2str(Pool *pool, Id p)
678 Solvable *s = pool->solvables + p;
679 const char *n, *e, *a;
682 if (p == SYSTEMSOLVABLE)
684 n = pool_id2str(pool, s->name);
685 e = pool_id2str(pool, s->evr);
686 a = pool_id2str(pool, s->arch);
687 str = pool_alloctmpspace(pool, strlen(n) + strlen(e) + strlen(a) + 3);
688 sprintf(str, "%s-%s.%s", n, e, a);
690 return pool_tmpappend(pool, str, "@", 0);
694 char *str2 = pool_tmpappend(pool, str, "@", s->repo->name);
696 if (str2[l] == ' ' || str2[l] == '\t')
700 sprintf(buf, "@#%d", s->repo->repoid);
701 return pool_tmpappend(pool, str, buf, 0);
705 testcase_str2repo(Pool *pool, const char *str)
709 if (str[0] == '#' && (str[1] >= '0' && str[1] <= '9'))
713 for (j = 1; str[j] >= '0' && str[j] <= '9'; j++)
714 repoid = repoid * 10 + (str[j] - '0');
715 if (!str[j] && repoid > 0 && repoid < pool->nrepos)
716 repo = pool_id2repo(pool, repoid);
720 FOR_REPOS(repoid, repo)
725 l = strlen(repo->name);
726 for (i = 0; i < l; i++)
728 int c = repo->name[i];
729 if (c == ' ' || c == '\t')
734 if (i == l && !str[l])
737 if (repoid >= pool->nrepos)
744 testcase_str2solvid(Pool *pool, const char *str)
746 int i, l = strlen(str);
753 if (*str == '@' && !strcmp(str, "@SYSTEM"))
754 return SYSTEMSOLVABLE;
756 for (i = l - 1; i >= 0; i--)
757 if (str[i] == '@' && (repo = testcase_str2repo(pool, str + i + 1)) != 0)
762 /* now find the arch (if present) */
764 for (i = repostart - 1; i > 0; i--)
767 arch = pool_strn2id(pool, str + i + 1, repostart - (i + 1), 0);
772 /* now find the name */
773 for (i = repostart - 1; i > 0; i--)
777 Id nid, evrid, p, pp;
778 nid = pool_strn2id(pool, str, i, 0);
781 evrid = pool_strn2id(pool, str + i + 1, repostart - (i + 1), 0);
784 /* first check whatprovides */
785 FOR_PROVIDES(p, pp, nid)
787 Solvable *s = pool->solvables + p;
788 if (s->name != nid || s->evr != evrid)
790 if (repo && s->repo != repo)
792 if (arch && s->arch != arch)
796 /* maybe it's not installable and thus not in whatprovides. do a slow search */
800 FOR_REPO_SOLVABLES(repo, p, s)
802 if (s->name != nid || s->evr != evrid)
804 if (arch && s->arch != arch)
811 FOR_POOL_SOLVABLES(p)
813 Solvable *s = pool->solvables + p;
814 if (s->name != nid || s->evr != evrid)
816 if (arch && s->arch != arch)
827 testcase_job2str(Pool *pool, Id how, Id what)
834 Id select = how & SOLVER_SELECTMASK;
836 for (i = 0; job2str[i].str; i++)
837 if ((how & SOLVER_JOBMASK) == job2str[i].job)
839 jobstr = job2str[i].str ? job2str[i].str : "unknown";
840 if (select == SOLVER_SOLVABLE)
843 pkgstr = testcase_solvid2str(pool, what);
845 else if (select == SOLVER_SOLVABLE_NAME)
848 pkgstr = testcase_dep2str(pool, what);
850 else if (select == SOLVER_SOLVABLE_PROVIDES)
852 selstr = " provides ";
853 pkgstr = testcase_dep2str(pool, what);
855 else if (select == SOLVER_SOLVABLE_ONE_OF)
860 while ((p = pool->whatprovidesdata[what++]) != 0)
862 const char *s = testcase_solvid2str(pool, p);
865 pkgstr = pool_tmpappend(pool, pkgstr, " ", s);
866 pool_freetmpspace(pool, s);
874 else if (select == SOLVER_SOLVABLE_REPO)
876 Repo *repo = pool_id2repo(pool, what);
881 sprintf(buf, "#%d", repo->repoid);
882 pkgstr = pool_tmpjoin(pool, buf, 0, 0);
885 pkgstr = pool_tmpjoin(pool, repo->name, 0, 0);
887 else if (select == SOLVER_SOLVABLE_ALL)
894 selstr = " unknown ";
897 ret = pool_tmpjoin(pool, jobstr, selstr, pkgstr);
899 ret = pool_tmpappend(pool, ret, " ", 0);
900 for (i = 0; jobflags2str[i].str; i++)
901 if ((how & jobflags2str[i].flag) != 0)
902 ret = pool_tmpappend(pool, ret, ",", jobflags2str[i].str);
908 ret = pool_tmpappend(pool, ret, "]", 0);
914 str2selflags(Pool *pool, char *s) /* modifies the string! */
919 char *se = strchr(s, ',');
922 for (i = 0; selflags2str[i].str; i++)
923 if (!strcmp(s, selflags2str[i].str))
925 selflags |= selflags2str[i].flag;
928 if (!selflags2str[i].str)
929 pool_error(pool, 0, "str2job: unknown selection flag '%s'", s);
936 str2jobflags(Pool *pool, char *s) /* modifies the string */
941 char *se = strchr(s, ',');
944 for (i = 0; jobflags2str[i].str; i++)
945 if (!strcmp(s, jobflags2str[i].str))
947 jobflags |= jobflags2str[i].flag;
950 if (!jobflags2str[i].str)
951 pool_error(pool, 0, "str2job: unknown job flag '%s'", s);
958 testcase_str2job(Pool *pool, const char *str, Id *whatp)
968 /* so we can patch it */
969 s = pool_tmpjoin(pool, str, 0, 0);
970 /* split it in pieces */
973 while (*s == ' ' || *s == '\t')
977 pieces = solv_extend(pieces, npieces, 1, sizeof(*pieces), 7);
978 pieces[npieces++] = s;
979 while (*s && *s != ' ' && *s != '\t')
986 pool_error(pool, -1, "str2job: bad line '%s'", str);
991 for (i = 0; job2str[i].str; i++)
992 if (!strcmp(pieces[0], job2str[i].str))
996 pool_error(pool, -1, "str2job: unknown job '%s'", str);
1000 job = job2str[i].job;
1004 char *flags = pieces[npieces - 1];
1005 if (*flags == '[' && flags[strlen(flags) - 1] == ']')
1009 flags[strlen(flags) - 1] = 0;
1010 job |= str2jobflags(pool, flags);
1013 if (!strcmp(pieces[1], "pkg"))
1017 pool_error(pool, -1, "str2job: bad pkg selector in '%s'", str);
1021 job |= SOLVER_SOLVABLE;
1022 what = testcase_str2solvid(pool, pieces[2]);
1025 pool_error(pool, -1, "str2job: unknown package '%s'", pieces[2]);
1030 else if (!strcmp(pieces[1], "name") || !strcmp(pieces[1], "provides"))
1032 /* join em again for dep2str... */
1034 for (sp = pieces[2]; sp < pieces[npieces - 1]; sp++)
1038 if (pieces[1][0] == 'p' && strncmp(pieces[2], "namespace:", 10) == 0)
1040 char *spe = strchr(pieces[2], '(');
1041 int l = strlen(pieces[2]);
1042 if (spe && pieces[2][l - 1] == ')')
1044 /* special namespace provides */
1045 if (strcmp(spe, "(<NULL>)") != 0)
1047 pieces[2][l - 1] = 0;
1048 what = testcase_str2dep(pool, spe + 1);
1049 pieces[2][l - 1] = ')';
1051 what = pool_rel2id(pool, pool_strn2id(pool, pieces[2], spe - pieces[2], 1), what, REL_NAMESPACE, 1);
1055 what = testcase_str2dep(pool, pieces[2]);
1056 if (pieces[1][0] == 'n')
1057 job |= SOLVER_SOLVABLE_NAME;
1059 job |= SOLVER_SOLVABLE_PROVIDES;
1061 else if (!strcmp(pieces[1], "oneof"))
1064 job |= SOLVER_SOLVABLE_ONE_OF;
1066 if (npieces > 3 && strcmp(pieces[2], "nothing") != 0)
1068 for (i = 2; i < npieces; i++)
1070 Id p = testcase_str2solvid(pool, pieces[i]);
1073 pool_error(pool, -1, "str2job: unknown package '%s'", pieces[i]);
1081 what = pool_queuetowhatprovides(pool, &q);
1084 else if (!strcmp(pieces[1], "repo"))
1089 pool_error(pool, -1, "str2job: bad line '%s'", str);
1093 repo = testcase_str2repo(pool, pieces[2]);
1096 pool_error(pool, -1, "str2job: unknown repo '%s'", pieces[2]);
1100 job |= SOLVER_SOLVABLE_REPO;
1101 what = repo->repoid;
1103 else if (!strcmp(pieces[1], "all"))
1105 if (npieces != 3 && strcmp(pieces[2], "packages") != 0)
1107 pool_error(pool, -1, "str2job: bad line '%s'", str);
1111 job |= SOLVER_SOLVABLE_ALL;
1116 pool_error(pool, -1, "str2job: unknown selection in '%s'", str);
1126 addselectionjob(Pool *pool, char **pieces, int npieces, Queue *jobqueue)
1133 for (i = 0; job2str[i].str; i++)
1134 if (!strcmp(pieces[0], job2str[i].str))
1136 if (!job2str[i].str)
1137 return pool_error(pool, -1, "selstr2job: unknown job '%s'", pieces[0]);
1138 job = job2str[i].job;
1141 char *flags = pieces[npieces - 1];
1142 if (*flags == '[' && flags[strlen(flags) - 1] == ']')
1146 flags[strlen(flags) - 1] = 0;
1147 job |= str2jobflags(pool, flags);
1151 return pool_error(pool, -1, "selstr2job: no selection flags");
1152 selflags = str2selflags(pool, pieces[3]);
1154 r = selection_make(pool, &sel, pieces[2], selflags);
1155 for (i = 0; i < sel.count; i += 2)
1156 queue_push2(jobqueue, job | sel.elements[i], sel.elements[i + 1]);
1162 writedeps(Repo *repo, FILE *fp, const char *tag, Id key, Solvable *s, Offset off)
1164 Pool *pool = repo->pool;
1171 dp = repo->idarraydata + off;
1172 while ((id = *dp++) != 0)
1174 if (key == SOLVABLE_REQUIRES && id == SOLVABLE_PREREQMARKER)
1177 fprintf(fp, "-%s\n", tag);
1182 if (key == SOLVABLE_PROVIDES && id == SOLVABLE_FILEMARKER)
1184 idstr = testcase_dep2str(pool, id);
1187 fprintf(fp, "+%s\n", tag);
1190 fprintf(fp, "%s\n", idstr);
1193 fprintf(fp, "-%s\n", tag);
1197 writefilelist(Repo *repo, FILE *fp, const char *tag, Solvable *s)
1199 Pool *pool = repo->pool;
1203 dataiterator_init(&di, pool, repo, s - pool->solvables, SOLVABLE_FILELIST, 0, 0);
1204 while (dataiterator_step(&di))
1206 const char *s = repodata_dir2str(di.data, di.kv.id, di.kv.str);
1209 fprintf(fp, "+%s\n", tag);
1212 fprintf(fp, "%s\n", s);
1215 fprintf(fp, "-%s\n", tag);
1216 dataiterator_free(&di);
1220 testcase_write_testtags(Repo *repo, FILE *fp)
1222 Pool *pool = repo->pool;
1228 const char *release;
1233 fprintf(fp, "=Ver: 3.0\n");
1235 FOR_REPO_SOLVABLES(repo, p, s)
1237 name = pool_id2str(pool, s->name);
1238 evr = pool_id2str(pool, s->evr);
1239 arch = pool_id2str(pool, s->arch);
1240 release = strrchr(evr, '-');
1242 release = evr + strlen(evr);
1243 fprintf(fp, "=Pkg: %s %.*s %s %s\n", name, (int)(release - evr), evr, *release && release[1] ? release + 1 : "-", arch);
1244 tmp = solvable_lookup_str(s, SOLVABLE_SUMMARY);
1246 fprintf(fp, "=Sum: %s\n", tmp);
1247 writedeps(repo, fp, "Req:", SOLVABLE_REQUIRES, s, s->requires);
1248 writedeps(repo, fp, "Prv:", SOLVABLE_PROVIDES, s, s->provides);
1249 writedeps(repo, fp, "Obs:", SOLVABLE_OBSOLETES, s, s->obsoletes);
1250 writedeps(repo, fp, "Con:", SOLVABLE_CONFLICTS, s, s->conflicts);
1251 writedeps(repo, fp, "Rec:", SOLVABLE_RECOMMENDS, s, s->recommends);
1252 writedeps(repo, fp, "Sup:", SOLVABLE_SUPPLEMENTS, s, s->supplements);
1253 writedeps(repo, fp, "Sug:", SOLVABLE_SUGGESTS, s, s->suggests);
1254 writedeps(repo, fp, "Enh:", SOLVABLE_ENHANCES, s, s->enhances);
1255 if (solvable_lookup_idarray(s, SOLVABLE_PREREQ_IGNOREINST, &q))
1258 fprintf(fp, "+Ipr:\n");
1259 for (i = 0; i < q.count; i++)
1260 fprintf(fp, "%s\n", testcase_dep2str(pool, q.elements[i]));
1261 fprintf(fp, "-Ipr:\n");
1264 fprintf(fp, "=Vnd: %s\n", pool_id2str(pool, s->vendor));
1265 ti = solvable_lookup_num(s, SOLVABLE_BUILDTIME, 0);
1267 fprintf(fp, "=Tim: %u\n", ti);
1268 writefilelist(repo, fp, "Fls:", s);
1274 static inline Offset
1275 adddep(Repo *repo, Offset olddeps, char *str, Id marker)
1277 Id id = *str == '/' ? pool_str2id(repo->pool, str, 1) : testcase_str2dep(repo->pool, str);
1278 return repo_addid_dep(repo, olddeps, id, marker);
1282 finish_v2_solvable(Pool *pool, Repodata *data, Solvable *s, char *filelist, int nfilelist)
1288 for (l = 0; l < nfilelist; l += strlen(filelist + l) + 1)
1290 char *p = strrchr(filelist + l, '/');
1294 did = repodata_str2dir(data, filelist + l, 1);
1297 did = repodata_str2dir(data, "/", 1);
1298 repodata_add_dirstr(data, s - pool->solvables, SOLVABLE_FILELIST, did, p);
1301 repo_rewrite_suse_deps(s, 0);
1304 /* stripped down version of susetags parser used for testcases */
1306 testcase_add_testtags(Repo *repo, FILE *fp, int flags)
1308 Pool *pool = repo->pool;
1320 int tagsversion = 0;
1321 int addselfprovides = 1; /* for compat reasons */
1323 data = repo_add_repodata(repo, flags);
1328 line = solv_malloc(aline);
1332 if (linep - line + 16 > aline)
1334 aline = linep - line;
1335 line = solv_realloc(line, aline + 512);
1336 linep = line + aline;
1339 if (!fgets(linep, aline - (linep - line), fp))
1341 linep += strlen(linep);
1342 if (linep == line || linep[-1] != '\n')
1345 linep = line + intag;
1348 if (line[intag] == '-' && !strncmp(line + 1, line + intag + 1, intag - 2))
1355 else if (line[0] == '+' && line[1] && line[1] != ':')
1357 char *tagend = strchr(line, ':');
1362 intag = tagend + 2 - line;
1363 linep = line + intag;
1366 if (*line != '=' || !line[1] || !line[2] || !line[3] || line[4] != ':')
1368 tag = line[1] << 16 | line[2] << 8 | line[3];
1371 case 'V' << 16 | 'e' << 8 | 'r':
1372 tagsversion = atoi(line + 6);
1373 addselfprovides = tagsversion < 3 || strstr(line + 6, "addselfprovides") != 0;
1375 case 'P' << 16 | 'k' << 8 | 'g':
1378 if (tagsversion == 2)
1379 finish_v2_solvable(pool, data, s, filelist, nfilelist);
1380 if (addselfprovides && s->name && s->arch != ARCH_SRC && s->arch != ARCH_NOSRC)
1381 s->provides = repo_addid_dep(s->repo, s->provides, pool_rel2id(pool, s->name, s->evr, REL_EQ, 1), 0);
1384 if (split(line + 5, sp, 5) != 4)
1386 s = pool_id2solvable(pool, repo_add_solvable(repo));
1387 s->name = pool_str2id(pool, sp[0], 1);
1388 /* join back version and release */
1389 if (sp[2] && !(sp[2][0] == '-' && !sp[2][1]))
1391 s->evr = makeevr(pool, sp[1]);
1392 s->arch = pool_str2id(pool, sp[3], 1);
1394 case 'S' << 16 | 'u' << 8 | 'm':
1395 repodata_set_str(data, s - pool->solvables, SOLVABLE_SUMMARY, line + 6);
1397 case 'V' << 16 | 'n' << 8 | 'd':
1398 s->vendor = pool_str2id(pool, line + 6, 1);
1400 case 'T' << 16 | 'i' << 8 | 'm':
1403 repodata_set_num(data, s - pool->solvables, SOLVABLE_BUILDTIME, t);
1405 case 'R' << 16 | 'e' << 8 | 'q':
1406 s->requires = adddep(repo, s->requires, line + 6, -SOLVABLE_PREREQMARKER);
1408 case 'P' << 16 | 'r' << 8 | 'q':
1409 s->requires = adddep(repo, s->requires, line + 6, SOLVABLE_PREREQMARKER);
1411 case 'P' << 16 | 'r' << 8 | 'v':
1412 /* version 2 had the file list at the end of the provides */
1413 if (tagsversion == 2)
1417 int l = strlen(line + 6) + 1;
1418 if (nfilelist + l > afilelist)
1420 afilelist = nfilelist + l + 512;
1421 filelist = solv_realloc(filelist, afilelist);
1423 memcpy(filelist + nfilelist, line + 6, l);
1430 for (l = 0; l < nfilelist; l += strlen(filelist + l) + 1)
1431 s->provides = repo_addid_dep(repo, s->provides, pool_str2id(pool, filelist + l, 1), 0);
1435 s->provides = adddep(repo, s->provides, line + 6, 0);
1437 case 'F' << 16 | 'l' << 8 | 's':
1439 char *p = strrchr(line + 6, '/');
1444 did = repodata_str2dir(data, line + 6, 1);
1446 did = repodata_str2dir(data, "/", 1);
1447 repodata_add_dirstr(data, s - pool->solvables, SOLVABLE_FILELIST, did, p);
1450 case 'O' << 16 | 'b' << 8 | 's':
1451 s->obsoletes = adddep(repo, s->obsoletes, line + 6, 0);
1453 case 'C' << 16 | 'o' << 8 | 'n':
1454 s->conflicts = adddep(repo, s->conflicts, line + 6, 0);
1456 case 'R' << 16 | 'e' << 8 | 'c':
1457 s->recommends = adddep(repo, s->recommends, line + 6, 0);
1459 case 'S' << 16 | 'u' << 8 | 'p':
1460 s->supplements = adddep(repo, s->supplements, line + 6, 0);
1462 case 'S' << 16 | 'u' << 8 | 'g':
1463 s->suggests = adddep(repo, s->suggests, line + 6, 0);
1465 case 'E' << 16 | 'n' << 8 | 'h':
1466 s->enhances = adddep(repo, s->enhances, line + 6, 0);
1468 case 'I' << 16 | 'p' << 8 | 'r':
1470 Id id = line[6] == '/' ? pool_str2id(pool, line + 6, 1) : testcase_str2dep(pool, line + 6);
1471 repodata_add_idarray(data, s - pool->solvables, SOLVABLE_PREREQ_IGNOREINST, id);
1480 if (tagsversion == 2)
1481 finish_v2_solvable(pool, data, s, filelist, nfilelist);
1482 if (addselfprovides && s->name && s->arch != ARCH_SRC && s->arch != ARCH_NOSRC)
1483 s->provides = repo_addid_dep(s->repo, s->provides, pool_rel2id(pool, s->name, s->evr, REL_EQ, 1), 0);
1486 solv_free(filelist);
1487 repodata_free_dircache(data);
1488 if (!(flags & REPO_NO_INTERNALIZE))
1489 repodata_internalize(data);
1494 testcase_getpoolflags(Pool *pool)
1496 const char *str = 0;
1498 for (i = 0; poolflags2str[i].str; i++)
1500 v = pool_get_flag(pool, poolflags2str[i].flag);
1501 if (v == poolflags2str[i].def)
1503 str = pool_tmpappend(pool, str, v ? " " : " !", poolflags2str[i].str);
1505 return str ? str + 1 : "";
1509 testcase_setpoolflags(Pool *pool, const char *str)
1511 const char *p = str, *s;
1515 while (*p == ' ' || *p == '\t' || *p == ',')
1526 while (*p && *p != ' ' && *p != '\t' && *p != ',')
1528 for (i = 0; poolflags2str[i].str; i++)
1529 if (!strncmp(poolflags2str[i].str, s, p - s) && poolflags2str[i].str[p - s] == 0)
1531 if (!poolflags2str[i].str)
1532 return pool_error(pool, 0, "setpoolflags: unknown flag '%.*s'", (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)
1586 return pool_error(solv->pool, 0, "setsolverflags: unknown flag '%.*s'", (int)(p - s), s);
1587 if (solver_set_flag(solv, solverflags2str[i].flag, v) == -1)
1588 return pool_error(solv->pool, 0, "setsolverflags: unsupported flag '%s'", solverflags2str[i].str);
1594 testcase_resetsolverflags(Solver *solv)
1597 for (i = 0; solverflags2str[i].str; i++)
1598 solver_set_flag(solv, solverflags2str[i].flag, solverflags2str[i].def);
1602 testcase_ruleid(Solver *solv, Id rid)
1608 const unsigned char *md5;
1614 solver_ruleliterals(solv, rid, &q);
1615 for (i = 0; i < q.count; i++)
1617 Id p = q.elements[i];
1618 s = testcase_solvid2str(solv->pool, p > 0 ? p : -p);
1620 s = pool_tmpjoin(solv->pool, "!", s, 0);
1621 strqueue_push(&sq, s);
1624 strqueue_sort_u(&sq);
1625 chk = solv_chksum_create(REPOKEY_TYPE_MD5);
1626 for (i = 0; i < sq.nstr; i++)
1627 solv_chksum_add(chk, sq.str[i], strlen(sq.str[i]) + 1);
1628 md5 = solv_chksum_get(chk, &md5l);
1629 s = pool_bin2hex(solv->pool, md5, md5l);
1630 chk = solv_chksum_free(chk, 0);
1636 testcase_problemid(Solver *solv, Id problem)
1641 const unsigned char *md5;
1645 /* we build a hash of all rules that define the problem */
1648 solver_findallproblemrules(solv, problem, &q);
1649 for (i = 0; i < q.count; i++)
1650 strqueue_push(&sq, testcase_ruleid(solv, q.elements[i]));
1652 strqueue_sort_u(&sq);
1653 chk = solv_chksum_create(REPOKEY_TYPE_MD5);
1654 for (i = 0; i < sq.nstr; i++)
1655 solv_chksum_add(chk, sq.str[i], strlen(sq.str[i]) + 1);
1656 md5 = solv_chksum_get(chk, &md5l);
1657 s = pool_bin2hex(solv->pool, md5, 4);
1658 chk = solv_chksum_free(chk, 0);
1664 testcase_solutionid(Solver *solv, Id problem, Id solution)
1668 const unsigned char *md5;
1672 intid = solver_solutionelement_internalid(solv, problem, solution);
1673 /* internal stuff! handle with care! */
1677 s = testcase_job2str(solv->pool, solv->job.elements[-intid - 1], solv->job.elements[-intid]);
1682 s = testcase_ruleid(solv, intid);
1684 chk = solv_chksum_create(REPOKEY_TYPE_MD5);
1685 solv_chksum_add(chk, s, strlen(s) + 1);
1686 md5 = solv_chksum_get(chk, &md5l);
1687 s = pool_bin2hex(solv->pool, md5, 4);
1688 chk = solv_chksum_free(chk, 0);
1693 testcase_alternativeid(Solver *solv, int type, Id id, Id from)
1696 Pool *pool = solv->pool;
1698 const unsigned char *md5;
1700 chk = solv_chksum_create(REPOKEY_TYPE_MD5);
1701 if (type == SOLVER_ALTERNATIVE_TYPE_RECOMMENDS)
1703 s = testcase_solvid2str(pool, from);
1704 solv_chksum_add(chk, s, strlen(s) + 1);
1705 s = testcase_dep2str(pool, id);
1706 solv_chksum_add(chk, s, strlen(s) + 1);
1708 else if (type == SOLVER_ALTERNATIVE_TYPE_RULE)
1710 s = testcase_ruleid(solv, id);
1711 solv_chksum_add(chk, s, strlen(s) + 1);
1713 md5 = solv_chksum_get(chk, &md5l);
1714 s = pool_bin2hex(pool, md5, 4);
1715 chk = solv_chksum_free(chk, 0);
1719 static struct class2str {
1723 { SOLVER_TRANSACTION_ERASE, "erase" },
1724 { SOLVER_TRANSACTION_INSTALL, "install" },
1725 { SOLVER_TRANSACTION_REINSTALLED, "reinstall" },
1726 { SOLVER_TRANSACTION_DOWNGRADED, "downgrade" },
1727 { SOLVER_TRANSACTION_CHANGED, "change" },
1728 { SOLVER_TRANSACTION_UPGRADED, "upgrade" },
1729 { SOLVER_TRANSACTION_OBSOLETED, "obsolete" },
1730 { SOLVER_TRANSACTION_MULTIINSTALL, "multiinstall" },
1731 { SOLVER_TRANSACTION_MULTIREINSTALL, "multireinstall" },
1735 static struct reason2str {
1739 { SOLVER_REASON_UNRELATED, "unrelated" },
1740 { SOLVER_REASON_UNIT_RULE, "unit" },
1741 { SOLVER_REASON_KEEP_INSTALLED, "keep" },
1742 { SOLVER_REASON_RESOLVE_JOB, "job" },
1743 { SOLVER_REASON_UPDATE_INSTALLED, "update" },
1744 { SOLVER_REASON_CLEANDEPS_ERASE, "cleandeps" },
1745 { SOLVER_REASON_RESOLVE, "resolve" },
1746 { SOLVER_REASON_WEAKDEP, "weakdep" },
1747 { SOLVER_REASON_RESOLVE_ORPHAN, "orphan" },
1749 { SOLVER_REASON_RECOMMENDED, "recommended" },
1750 { SOLVER_REASON_SUPPLEMENTED, "supplemented" },
1755 testcase_reason2str(Id reason)
1758 for (i = 0; reason2str[i].str; i++)
1759 if (reason == reason2str[i].reason)
1760 return reason2str[i].str;
1764 static struct rclass2str {
1768 { SOLVER_RULE_PKG, "pkg" },
1769 { SOLVER_RULE_UPDATE, "update" },
1770 { SOLVER_RULE_FEATURE, "feature" },
1771 { SOLVER_RULE_JOB, "job" },
1772 { SOLVER_RULE_DISTUPGRADE, "distupgrade" },
1773 { SOLVER_RULE_INFARCH, "infarch" },
1774 { SOLVER_RULE_CHOICE, "choice" },
1775 { SOLVER_RULE_LEARNT, "learnt" },
1776 { SOLVER_RULE_BEST, "best" },
1777 { SOLVER_RULE_YUMOBS, "yumobs" },
1782 testcase_rclass2str(Id rclass)
1785 for (i = 0; rclass2str[i].str; i++)
1786 if (rclass == rclass2str[i].rclass)
1787 return rclass2str[i].str;
1792 dump_genid(Pool *pool, Strqueue *sq, Id id, int cnt)
1800 Reldep *rd = GETRELDEP(pool, id);
1801 for (op = oplist; op->flags; op++)
1802 if (rd->flags == op->flags)
1804 cnt = dump_genid(pool, sq, rd->name, cnt);
1805 cnt = dump_genid(pool, sq, rd->evr, cnt);
1806 sprintf(cntbuf, "genid %2d: genid ", cnt++);
1807 s = pool_tmpjoin(pool, cntbuf, "op ", op->flags ? op->opname : "unknown");
1811 sprintf(cntbuf, "genid %2d: genid ", cnt++);
1812 s = pool_tmpjoin(pool, cntbuf, id ? "lit " : "null", id ? pool_id2str(pool, id) : 0);
1814 strqueue_push(sq, s);
1819 testcase_solverresult(Solver *solv, int resultflags)
1821 Pool *pool = solv->pool;
1829 if ((resultflags & TESTCASE_RESULT_TRANSACTION) != 0)
1831 Transaction *trans = solver_create_transaction(solv);
1835 for (i = 0; class2str[i].str; i++)
1838 transaction_classify_pkgs(trans, SOLVER_TRANSACTION_KEEP_PSEUDO, class2str[i].class, 0, 0, &q);
1839 for (j = 0; j < q.count; j++)
1843 if (pool->installed && pool->solvables[p].repo == pool->installed)
1844 op = transaction_obs_pkg(trans, p);
1845 s = pool_tmpjoin(pool, class2str[i].str, " ", testcase_solvid2str(pool, p));
1847 s = pool_tmpjoin(pool, s, " ", testcase_solvid2str(pool, op));
1848 strqueue_push(&sq, s);
1852 transaction_free(trans);
1854 if ((resultflags & TESTCASE_RESULT_PROBLEMS) != 0)
1856 char *probprefix, *solprefix;
1857 int problem, solution, element;
1860 pcnt = solver_problem_count(solv);
1861 for (problem = 1; problem <= pcnt; problem++)
1863 Id rid, from, to, dep;
1864 SolverRuleinfo rinfo;
1865 rid = solver_findproblemrule(solv, problem);
1866 s = testcase_problemid(solv, problem);
1867 probprefix = solv_dupjoin("problem ", s, 0);
1868 rinfo = solver_ruleinfo(solv, rid, &from, &to, &dep);
1869 s = pool_tmpjoin(pool, probprefix, " info ", solver_problemruleinfo2str(solv, rinfo, from, to, dep));
1870 strqueue_push(&sq, s);
1871 scnt = solver_solution_count(solv, problem);
1872 for (solution = 1; solution <= scnt; solution++)
1874 s = testcase_solutionid(solv, problem, solution);
1875 solprefix = solv_dupjoin(probprefix, " solution ", s);
1877 while ((element = solver_next_solutionelement(solv, problem, solution, element, &p, &op)) != 0)
1879 if (p == SOLVER_SOLUTION_JOB)
1880 s = pool_tmpjoin(pool, solprefix, " deljob ", testcase_job2str(pool, solv->job.elements[op - 1], solv->job.elements[op]));
1881 else if (p > 0 && op == 0)
1882 s = pool_tmpjoin(pool, solprefix, " erase ", testcase_solvid2str(pool, p));
1883 else if (p > 0 && op > 0)
1885 s = pool_tmpjoin(pool, solprefix, " replace ", testcase_solvid2str(pool, p));
1886 s = pool_tmpappend(pool, s, " ", testcase_solvid2str(pool, op));
1888 else if (p < 0 && op > 0)
1889 s = pool_tmpjoin(pool, solprefix, " allow ", testcase_solvid2str(pool, op));
1891 s = pool_tmpjoin(pool, solprefix, " unknown", 0);
1892 strqueue_push(&sq, s);
1894 solv_free(solprefix);
1896 solv_free(probprefix);
1900 if ((resultflags & TESTCASE_RESULT_ORPHANED) != 0)
1905 solver_get_orphaned(solv, &q);
1906 for (i = 0; i < q.count; i++)
1908 s = pool_tmpjoin(pool, "orphaned ", testcase_solvid2str(pool, q.elements[i]), 0);
1909 strqueue_push(&sq, s);
1914 if ((resultflags & TESTCASE_RESULT_RECOMMENDED) != 0)
1920 solver_get_recommendations(solv, &qr, &qs, 0);
1921 for (i = 0; i < qr.count; i++)
1923 s = pool_tmpjoin(pool, "recommended ", testcase_solvid2str(pool, qr.elements[i]), 0);
1924 strqueue_push(&sq, s);
1926 for (i = 0; i < qs.count; i++)
1928 s = pool_tmpjoin(pool, "suggested ", testcase_solvid2str(pool, qs.elements[i]), 0);
1929 strqueue_push(&sq, s);
1935 if ((resultflags & TESTCASE_RESULT_UNNEEDED) != 0)
1941 solver_get_unneeded(solv, &q, 0);
1942 solver_get_unneeded(solv, &qf, 1);
1943 for (i = j = 0; i < q.count; i++)
1945 /* we rely on qf containing a subset of q in the same order */
1946 if (j < qf.count && q.elements[i] == qf.elements[j])
1948 s = pool_tmpjoin(pool, "unneeded_filtered ", testcase_solvid2str(pool, q.elements[i]), 0);
1952 s = pool_tmpjoin(pool, "unneeded ", testcase_solvid2str(pool, q.elements[i]), 0);
1953 strqueue_push(&sq, s);
1958 if ((resultflags & TESTCASE_RESULT_ALTERNATIVES) != 0)
1966 cnt = solver_alternatives_count(solv);
1967 for (alternative = 1; alternative <= cnt; alternative++)
1969 Id id, from, chosen;
1971 int type = solver_get_alternative(solv, alternative, &id, &from, &chosen, &q, 0);
1972 altprefix = solv_dupjoin("alternative ", testcase_alternativeid(solv, type, id, from), " ");
1974 if (type == SOLVER_ALTERNATIVE_TYPE_RECOMMENDS)
1976 char *s = pool_tmpjoin(pool, altprefix, num, testcase_solvid2str(pool, from));
1977 s = pool_tmpappend(pool, s, " recommends ", testcase_dep2str(pool, id));
1978 strqueue_push(&sq, s);
1980 else if (type == SOLVER_ALTERNATIVE_TYPE_RULE)
1982 /* map choice rules back to pkg rules */
1983 if (solver_ruleclass(solv, id) == SOLVER_RULE_CHOICE)
1984 id = solver_rule2pkgrule(solv, id);
1985 solver_allruleinfos(solv, id, &rq);
1986 for (i = 0; i < rq.count; i += 4)
1988 int rtype = rq.elements[i];
1989 if ((rtype & SOLVER_RULE_TYPEMASK) == SOLVER_RULE_JOB)
1991 const char *js = testcase_job2str(pool, rq.elements[i + 2], rq.elements[i + 3]);
1992 char *s = pool_tmpjoin(pool, altprefix, num, " job ");
1993 s = pool_tmpappend(pool, s, js, 0);
1994 strqueue_push(&sq, s);
1996 else if (rtype == SOLVER_RULE_PKG_REQUIRES)
1998 char *s = pool_tmpjoin(pool, altprefix, num, testcase_solvid2str(pool, rq.elements[i + 1]));
1999 s = pool_tmpappend(pool, s, " requires ", testcase_dep2str(pool, rq.elements[i + 3]));
2000 strqueue_push(&sq, s);
2004 for (i = 0; i < q.count; i++)
2006 Id p = q.elements[i];
2008 num[0] = '0' + (i + 1) / 10;
2009 num[1] = '0' + (i + 1) % 10;
2011 s = pool_tmpjoin(pool, altprefix, num, "+ ");
2013 s = pool_tmpjoin(pool, altprefix, num, "- ");
2015 s = pool_tmpjoin(pool, altprefix, num, " ");
2016 s = pool_tmpappend(pool, s, testcase_solvid2str(pool, p < 0 ? -p : p), 0);
2017 strqueue_push(&sq, s);
2019 solv_free(altprefix);
2024 if ((resultflags & TESTCASE_RESULT_RULES) != 0)
2026 /* dump all rules */
2028 SolverRuleinfo rclass;
2033 for (rid = 1; (rclass = solver_ruleclass(solv, rid)) != SOLVER_RULE_UNKNOWN; rid++)
2035 char *prefix = solv_dupjoin("rule ", testcase_rclass2str(rclass), " ");
2036 prefix = solv_dupappend(prefix, testcase_ruleid(solv, rid), 0);
2037 solver_ruleliterals(solv, rid, &q);
2038 if (rclass == SOLVER_RULE_FEATURE && q.count == 1 && q.elements[0] == -SYSTEMSOLVABLE)
2040 for (i = 0; i < q.count; i++)
2042 Id p = q.elements[i];
2045 s = pool_tmpjoin(pool, prefix, " -", testcase_solvid2str(pool, -p));
2047 s = pool_tmpjoin(pool, prefix, " ", testcase_solvid2str(pool, p));
2048 strqueue_push(&sq, s);
2054 if ((resultflags & TESTCASE_RESULT_GENID) != 0)
2056 for (i = 0 ; i < solv->job.count; i += 2)
2059 if (solv->job.elements[i] != (SOLVER_NOOP | SOLVER_SOLVABLE_PROVIDES))
2061 id = solv->job.elements[i + 1];
2062 s = testcase_dep2str(pool, id);
2063 strqueue_push(&sq, pool_tmpjoin(pool, "genid dep ", s, 0));
2064 if ((id2 = testcase_str2dep(pool, s)) != id)
2066 s = pool_tmpjoin(pool, "genid roundtrip error: ", testcase_dep2str(pool, id2), 0);
2067 strqueue_push(&sq, s);
2069 dump_genid(pool, &sq, id, 1);
2072 if ((resultflags & TESTCASE_RESULT_REASON) != 0)
2076 FOR_POOL_SOLVABLES(p)
2079 int reason = solver_describe_decision(solv, p, &info);
2080 if (reason == SOLVER_REASON_UNRELATED)
2082 if (reason == SOLVER_REASON_WEAKDEP)
2084 solver_describe_weakdep_decision(solv, p, &whyq);
2087 for (i = 0; i < whyq.count; i += 3)
2089 reason = whyq.elements[i];
2090 p2 = whyq.elements[i + 1];
2091 id = whyq.elements[i + 2];
2092 s = pool_tmpjoin(pool, "reason ", testcase_solvid2str(pool, p), 0);
2093 s = pool_tmpappend(pool, s, " ", testcase_reason2str(reason));
2094 s = pool_tmpappend(pool, s, " ", testcase_dep2str(pool, id));
2096 s = pool_tmpappend(pool, s, " ", testcase_solvid2str(pool, p2));
2097 strqueue_push(&sq, s);
2102 s = pool_tmpjoin(pool, "reason ", testcase_solvid2str(pool, p), 0);
2103 s = pool_tmpappend(pool, s, " ", testcase_reason2str(reason));
2105 s = pool_tmpappend(pool, s, " ", testcase_ruleid(solv, info));
2106 strqueue_push(&sq, s);
2110 if ((resultflags & TESTCASE_RESULT_CLEANDEPS) != 0)
2115 solver_get_cleandeps(solv, &q);
2116 for (i = 0; i < q.count; i++)
2118 s = pool_tmpjoin(pool, "cleandeps ", testcase_solvid2str(pool, q.elements[i]), 0);
2119 strqueue_push(&sq, s);
2124 result = strqueue_join(&sq);
2131 testcase_write_mangled(Solver *solv, const char *dir, int resultflags, const char *testcasename, const char *resultname)
2133 Pool *pool = solv->pool;
2144 testcasename = "testcase.t";
2146 resultname = "solver.result";
2148 if (mkdir(dir, 0777) && errno != EEXIST)
2149 return pool_error(solv->pool, 0, "testcase_write: could not create directory '%s'", dir);
2151 FOR_REPOS(repoid, repo)
2153 const char *name = testcase_repoid2str(pool, repoid);
2155 if (repo->subpriority)
2156 sprintf(priobuf, "%d.%d", repo->priority, repo->subpriority);
2158 sprintf(priobuf, "%d", repo->priority);
2159 out = pool_tmpjoin(pool, name, ".repo", ".gz");
2160 for (i = 0; out[i]; i++)
2163 cmd = pool_tmpjoin(pool, "repo ", name, " ");
2164 cmd = pool_tmpappend(pool, cmd, priobuf, " ");
2165 cmd = pool_tmpappend(pool, cmd, "testtags ", out);
2166 strqueue_push(&sq, cmd);
2167 out = pool_tmpjoin(pool, dir, "/", out);
2168 if (!(fp = solv_xfopen(out, "w")))
2170 pool_error(solv->pool, 0, "testcase_write: could not open '%s' for writing", out);
2174 testcase_write_testtags(repo, fp);
2177 pool_error(solv->pool, 0, "testcase_write: write error");
2182 /* hmm, this is not optimal... we currently search for the lowest score */
2184 arch = pool->solvables[SYSTEMSOLVABLE].arch;
2185 for (i = 0; i < pool->lastarch; i++)
2187 if (pool->id2arch[i] == 1 && !lowscore)
2189 if (pool->id2arch[i] > 0x10000 && (!lowscore || pool->id2arch[i] < lowscore))
2192 lowscore = pool->id2arch[i];
2195 cmd = pool_tmpjoin(pool, "system ", pool->lastarch ? pool_id2str(pool, arch) : "unset", 0);
2196 for (i = 0; disttype2str[i].str != 0; i++)
2197 if (pool->disttype == disttype2str[i].type)
2199 pool_tmpappend(pool, cmd, " ", disttype2str[i].str ? disttype2str[i].str : "unknown");
2200 if (pool->installed)
2201 cmd = pool_tmpappend(pool, cmd, " ", testcase_repoid2str(pool, pool->installed->repoid));
2202 strqueue_push(&sq, cmd);
2203 s = testcase_getpoolflags(solv->pool);
2206 cmd = pool_tmpjoin(pool, "poolflags ", s, 0);
2207 strqueue_push(&sq, cmd);
2210 if (pool->vendorclasses)
2213 for (i = 0; pool->vendorclasses[i]; i++)
2215 cmd = pool_tmpappend(pool, cmd ? cmd : "vendorclass", " ", pool->vendorclasses[i]);
2216 if (!pool->vendorclasses[i + 1])
2218 strqueue_push(&sq, cmd);
2225 /* dump disabled packages (must come before the namespace/job lines) */
2226 if (pool->considered)
2229 FOR_POOL_SOLVABLES(p)
2230 if (!MAPTST(pool->considered, p))
2232 cmd = pool_tmpjoin(pool, "disable pkg ", testcase_solvid2str(pool, p), 0);
2233 strqueue_push(&sq, cmd);
2237 s = testcase_getsolverflags(solv);
2240 cmd = pool_tmpjoin(pool, "solverflags ", s, 0);
2241 strqueue_push(&sq, cmd);
2244 /* now dump all the ns callback values we know */
2245 if (pool->nscallback)
2249 for (rid = 1; rid < pool->nrels; rid++)
2251 Reldep *rd = pool->rels + rid;
2252 if (rd->flags != REL_NAMESPACE || rd->name == NAMESPACE_OTHERPROVIDERS)
2254 /* evaluate all namespace ids, skip empty results */
2255 d = pool_whatprovides(pool, MAKERELDEP(rid));
2256 if (!d || !pool->whatprovidesdata[d])
2258 cmd = pool_tmpjoin(pool, "namespace ", pool_id2str(pool, rd->name), "(");
2259 cmd = pool_tmpappend(pool, cmd, pool_id2str(pool, rd->evr), ")");
2260 for (; pool->whatprovidesdata[d]; d++)
2261 cmd = pool_tmpappend(pool, cmd, " ", testcase_solvid2str(pool, pool->whatprovidesdata[d]));
2262 strqueue_push(&sq, cmd);
2266 for (i = 0; i < solv->job.count; i += 2)
2268 cmd = (char *)testcase_job2str(pool, solv->job.elements[i], solv->job.elements[i + 1]);
2269 cmd = pool_tmpjoin(pool, "job ", cmd, 0);
2270 strqueue_push(&sq, cmd);
2273 if ((resultflags & ~TESTCASE_RESULT_REUSE_SOLVER) != 0)
2277 for (i = 0; resultflags2str[i].str; i++)
2278 if ((resultflags & resultflags2str[i].flag) != 0)
2279 cmd = pool_tmpappend(pool, cmd, cmd ? "," : 0, resultflags2str[i].str);
2280 cmd = pool_tmpjoin(pool, "result ", cmd ? cmd : "?", 0);
2281 cmd = pool_tmpappend(pool, cmd, " ", resultname);
2282 strqueue_push(&sq, cmd);
2283 result = testcase_solverresult(solv, resultflags);
2284 if (!strcmp(resultname, "<inline>"))
2288 strqueue_init(&rsq);
2289 strqueue_split(&rsq, result);
2290 for (i = 0; i < rsq.nstr; i++)
2292 cmd = pool_tmpjoin(pool, "#>", rsq.str[i], 0);
2293 strqueue_push(&sq, cmd);
2295 strqueue_free(&rsq);
2299 out = pool_tmpjoin(pool, dir, "/", resultname);
2300 if (!(fp = fopen(out, "w")))
2302 pool_error(solv->pool, 0, "testcase_write: could not open '%s' for writing", out);
2307 if (result && *result && fwrite(result, strlen(result), 1, fp) != 1)
2309 pool_error(solv->pool, 0, "testcase_write: write error");
2317 pool_error(solv->pool, 0, "testcase_write: write error");
2325 cmd = strqueue_join(&sq);
2326 out = pool_tmpjoin(pool, dir, "/", testcasename);
2327 if (!(fp = fopen(out, "w")))
2329 pool_error(solv->pool, 0, "testcase_write: could not open '%s' for writing", out);
2333 if (*cmd && fwrite(cmd, strlen(cmd), 1, fp) != 1)
2335 pool_error(solv->pool, 0, "testcase_write: write error");
2342 pool_error(solv->pool, 0, "testcase_write: write error");
2352 testcase_write(Solver *solv, const char *dir, int resultflags, const char *testcasename, const char *resultname)
2354 Pool *pool = solv->pool;
2357 const char **orignames;
2359 /* mangle repo names so that there are no conflicts */
2360 orignames = solv_calloc(pool->nrepos, sizeof(char *));
2361 for (repoid = 1; repoid < pool->nrepos; repoid++)
2363 Repo *repo = pool_id2repo(pool, repoid);
2364 char *buf = solv_malloc((repo->name ? strlen(repo->name) : 0) + 40);
2366 orignames[repoid] = repo->name;
2367 if (!repo->name || !repo->name[0])
2368 sprintf(buf, "#%d", repoid);
2370 strcpy(buf, repo->name);
2371 for (i = 0; buf[i]; i++)
2372 if (buf[i] == ' ' || buf[i] == '\t' || buf[i] == '/')
2374 mp = buf + strlen(buf);
2377 for (i = 1; i < repoid; i++)
2378 if (!strcmp(buf, pool_id2repo(pool, i)->name))
2382 sprintf(mp, "_%d", mangle++);
2386 r = testcase_write_mangled(solv, dir, resultflags, testcasename, resultname);
2387 for (repoid = 1; repoid < pool->nrepos; repoid++)
2389 Repo *repo = pool_id2repo(pool, repoid);
2390 solv_free((void *)repo->name);
2391 repo->name = orignames[repoid];
2393 solv_free(orignames);
2398 read_inline_file(FILE *fp, char **bufp, char **bufpp, int *buflp)
2400 char *result = solv_malloc(1024);
2407 if (rp - result + 256 >= resultl)
2409 resultl = rp - result;
2410 result = solv_realloc(result, resultl + 1024);
2411 rp = result + resultl;
2414 if (!fgets(rp, resultl - (rp - result), fp))
2417 if (rl && (rp == result || rp[-1] == '\n'))
2419 if (rl > 1 && rp[0] == '#' && rp[1] == '>')
2421 memmove(rp, rp + 2, rl - 2);
2426 while (rl + 16 > *buflp)
2428 *bufp = solv_realloc(*bufp, *buflp + 512);
2431 memmove(*bufp, rp, rl);
2432 if ((*bufp)[rl - 1] == '\n')
2438 (*bufpp) = *bufp + rl;
2455 char *result = solv_malloc(1024);
2462 if (rp - result + 256 >= resultl)
2464 resultl = rp - result;
2465 result = solv_realloc(result, resultl + 1024);
2466 rp = result + resultl;
2469 rl = fread(rp, 1, resultl - (rp - result), fp);
2481 str2resultflags(Pool *pool, char *s) /* modifies the string! */
2483 int i, resultflags = 0;
2486 char *se = strchr(s, ',');
2489 for (i = 0; resultflags2str[i].str; i++)
2490 if (!strcmp(s, resultflags2str[i].str))
2492 resultflags |= resultflags2str[i].flag;
2495 if (!resultflags2str[i].str)
2496 pool_error(pool, 0, "result: unknown flag '%s'", s);
2503 testcase_read(Pool *pool, FILE *fp, const char *testcase, Queue *job, char **resultp, int *resultflagsp)
2508 char *testcasedir, *s;
2514 int poolflagsreset = 0;
2515 int missing_features = 0;
2524 if (!fp && !(fp = fopen(testcase, "r")))
2526 pool_error(pool, 0, "testcase_read: could not open '%s'", testcase);
2529 testcasedir = solv_strdup(testcase);
2530 if ((s = strrchr(testcasedir, '/')) != 0)
2535 buf = solv_malloc(bufl);
2538 queue_init(&autoinstq);
2541 if (bufp - buf + 16 > bufl)
2544 buf = solv_realloc(buf, bufl + 512);
2548 if (!fgets(bufp, bufl - (bufp - buf), fp))
2552 if (!l || buf[l - 1] != '\n')
2559 while (*s && (*s == ' ' || *s == '\t'))
2561 if (!*s || *s == '#')
2564 /* split it in pieces */
2567 while (*s == ' ' || *s == '\t')
2571 pieces = solv_extend(pieces, npieces, 1, sizeof(*pieces), 7);
2572 pieces[npieces++] = s;
2573 while (*s && *s != ' ' && *s != '\t')
2578 pieces = solv_extend(pieces, npieces, 1, sizeof(*pieces), 7);
2579 pieces[npieces] = 0;
2580 if (!strcmp(pieces[0], "repo") && npieces >= 4)
2582 Repo *repo = repo_create(pool, pieces[1]);
2588 if (!poolflagsreset)
2591 testcase_resetpoolflags(pool); /* hmm */
2593 if (sscanf(pieces[2], "%d.%d", &prio, &subprio) != 2)
2596 prio = atoi(pieces[2]);
2598 repo->priority = prio;
2599 repo->subpriority = subprio;
2600 if (strcmp(pieces[3], "empty") != 0)
2602 const char *repotype = pool_tmpjoin(pool, pieces[3], 0, 0); /* gets overwritten in <inline> case */
2603 if (!strcmp(pieces[4], "<inline>"))
2605 char *idata = read_inline_file(fp, &buf, &bufp, &bufl);
2607 rfp = solv_xfopen_buf(rdata, &idata, 0, "rf");
2611 rdata = pool_tmpjoin(pool, testcasedir, pieces[4], 0);
2612 rfp = solv_xfopen(rdata, "r");
2616 pool_error(pool, 0, "testcase_read: could not open '%s'", rdata);
2618 else if (!strcmp(repotype, "testtags"))
2620 testcase_add_testtags(repo, rfp, 0);
2623 else if (!strcmp(repotype, "solv"))
2625 repo_add_solv(repo, rfp, 0);
2628 #if ENABLE_TESTCASE_HELIXREPO
2629 else if (!strcmp(repotype, "helix"))
2631 repo_add_helix(repo, rfp, 0);
2638 pool_error(pool, 0, "testcase_read: unknown repo type for repo '%s'", repo->name);
2642 else if (!strcmp(pieces[0], "system") && npieces >= 3)
2646 /* must set the disttype before the arch */
2648 if (strcmp(pieces[2], "*") != 0)
2650 char *dp = pieces[2];
2653 char *dpe = strchr(dp, ',');
2656 for (i = 0; disttype2str[i].str != 0; i++)
2657 if (!strcmp(disttype2str[i].str, dp))
2661 if (disttype2str[i].str)
2663 #ifdef MULTI_SEMANTICS
2664 if (pool->disttype != disttype2str[i].type)
2665 pool_setdisttype(pool, disttype2str[i].type);
2667 if (pool->disttype == disttype2str[i].type)
2674 pool_error(pool, 0, "testcase_read: system: could not change disttype to '%s'", pieces[2]);
2675 missing_features = 1;
2678 if (strcmp(pieces[1], "unset") == 0)
2679 pool_setarch(pool, 0);
2680 else if (pieces[1][0] == ':')
2681 pool_setarchpolicy(pool, pieces[1] + 1);
2683 pool_setarch(pool, pieces[1]);
2686 Repo *repo = testcase_str2repo(pool, pieces[3]);
2688 pool_error(pool, 0, "testcase_read: system: unknown repo '%s'", pieces[3]);
2690 pool_set_installed(pool, repo);
2693 else if (!strcmp(pieces[0], "job") && npieces > 1)
2699 pool_addfileprovides(pool);
2700 pool_createwhatprovides(pool);
2703 if (npieces >= 3 && !strcmp(pieces[2], "selection"))
2705 addselectionjob(pool, pieces + 1, npieces - 1, job);
2709 for (sp = pieces[1]; sp < pieces[npieces - 1]; sp++)
2712 how = testcase_str2job(pool, pieces[1], &what);
2713 if (how >= 0 && job)
2714 queue_push2(job, how, what);
2716 else if (!strcmp(pieces[0], "vendorclass") && npieces > 1)
2718 pool_addvendorclass(pool, (const char **)(pieces + 1));
2720 else if (!strcmp(pieces[0], "namespace") && npieces > 1)
2722 int i = strlen(pieces[1]);
2723 s = strchr(pieces[1], '(');
2724 if (!s && pieces[1][i - 1] != ')')
2726 pool_error(pool, 0, "testcase_read: bad namespace '%s'", pieces[1]);
2734 pieces[1][i - 1] = 0;
2735 name = pool_str2id(pool, pieces[1], 1);
2736 evr = pool_str2id(pool, s + 1, 1);
2738 pieces[1][i - 1] = ')';
2739 id = pool_rel2id(pool, name, evr, REL_NAMESPACE, 1);
2740 for (i = 2; i < npieces; i++)
2741 queue_push(&q, testcase_str2solvid(pool, pieces[i]));
2742 /* now do the callback */
2745 pool_addfileprovides(pool);
2746 pool_createwhatprovides(pool);
2749 pool->whatprovides_rel[GETRELID(id)] = pool_queuetowhatprovides(pool, &q);
2753 else if (!strcmp(pieces[0], "poolflags"))
2756 if (!poolflagsreset)
2759 testcase_resetpoolflags(pool); /* hmm */
2761 for (i = 1; i < npieces; i++)
2762 testcase_setpoolflags(pool, pieces[i]);
2764 else if (!strcmp(pieces[0], "solverflags") && npieces > 1)
2769 solv = solver_create(pool);
2770 testcase_resetsolverflags(solv);
2772 for (i = 1; i < npieces; i++)
2773 testcase_setsolverflags(solv, pieces[i]);
2775 else if (!strcmp(pieces[0], "result") && npieces > 1)
2778 int resultflags = str2resultflags(pool, pieces[1]);
2782 rdata = pool_tmpjoin(pool, testcasedir, pieces[2], 0);
2783 if (!strcmp(pieces[2], "<inline>"))
2784 result = read_inline_file(fp, &buf, &bufp, &bufl);
2787 FILE *rfp = fopen(rdata, "r");
2789 pool_error(pool, 0, "testcase_read: could not open '%s'", rdata);
2792 result = read_file(rfp);
2802 *resultflagsp = resultflags;
2804 else if (!strcmp(pieces[0], "nextjob"))
2806 if (npieces == 2 && resultflagsp && !strcmp(pieces[1], "reusesolver"))
2807 *resultflagsp |= TESTCASE_RESULT_REUSE_SOLVER;
2810 else if (!strcmp(pieces[0], "disable") && npieces == 3)
2813 if (strcmp(pieces[1], "pkg"))
2815 pool_error(pool, 0, "testcase_read: bad disable type '%s'", pieces[1]);
2819 pool_createwhatprovides(pool);
2821 if (!pool->considered)
2823 pool->considered = solv_calloc(1, sizeof(Map));
2824 map_init(pool->considered, pool->nsolvables);
2825 map_setall(pool->considered);
2827 p = testcase_str2solvid(pool, pieces[2]);
2829 MAPCLR(pool->considered, p);
2831 pool_error(pool, 0, "disable: unknown package '%s'", pieces[2]);
2833 else if (!strcmp(pieces[0], "feature"))
2836 for (i = 1; i < npieces; i++)
2838 for (j = 0; features[j]; j++)
2839 if (!strcmp(pieces[i], features[j]))
2843 pool_error(pool, 0, "testcase_read: missing feature '%s'", pieces[i]);
2847 if (missing_features)
2850 else if (!strcmp(pieces[0], "genid") && npieces > 1)
2857 for (sp = pieces[2]; sp < pieces[npieces - 1]; sp++)
2861 genid = solv_extend(genid, ngenid, 1, sizeof(*genid), 7);
2862 if (!strcmp(pieces[1], "op") && npieces > 2)
2865 for (op = oplist; op->flags; op++)
2866 if (!strncmp(pieces[2], op->opname, strlen(op->opname)))
2870 pool_error(pool, 0, "testcase_read: genid: unknown op '%s'", pieces[2]);
2875 pool_error(pool, 0, "testcase_read: genid: out of stack");
2879 id = pool_rel2id(pool, genid[ngenid] , genid[ngenid + 1], op->flags, 1);
2881 else if (!strcmp(pieces[1], "lit"))
2882 id = pool_str2id(pool, npieces > 2 ? pieces[2] : "", 1);
2883 else if (!strcmp(pieces[1], "null"))
2885 else if (!strcmp(pieces[1], "dep"))
2886 id = testcase_str2dep(pool, pieces[2]);
2889 pool_error(pool, 0, "testcase_read: genid: unknown command '%s'", pieces[1]);
2892 genid[ngenid++] = id;
2894 else if (!strcmp(pieces[0], "autoinst") && npieces > 2)
2896 if (strcmp(pieces[1], "name"))
2898 pool_error(pool, 0, "testcase_read: autoinst: illegal mode");
2901 queue_push(&autoinstq, pool_str2id(pool, pieces[2], 1));
2905 pool_error(pool, 0, "testcase_read: cannot parse command '%s'", pieces[0]);
2908 while (job && ngenid > 0)
2909 queue_push2(job, SOLVER_NOOP | SOLVER_SOLVABLE_PROVIDES, genid[--ngenid]);
2910 if (autoinstq.count)
2911 pool_add_userinstalled_jobs(pool, &autoinstq, job, GET_USERINSTALLED_NAMES | GET_USERINSTALLED_INVERTED);
2912 queue_free(&autoinstq);
2913 genid = solv_free(genid);
2914 buf = solv_free(buf);
2915 pieces = solv_free(pieces);
2916 solv_free(testcasedir);
2919 pool_addfileprovides(pool);
2920 pool_createwhatprovides(pool);
2924 solv = solver_create(pool);
2925 testcase_resetsolverflags(solv);
2929 if (missing_features)
2934 *resultflagsp = 77; /* hack for testsolv */
2940 testcase_resultdiff(const char *result1, const char *result2)
2942 Strqueue sq1, sq2, osq;
2944 strqueue_init(&sq1);
2945 strqueue_init(&sq2);
2946 strqueue_init(&osq);
2947 strqueue_split(&sq1, result1);
2948 strqueue_split(&sq2, result2);
2949 strqueue_sort(&sq1);
2950 strqueue_sort(&sq2);
2951 strqueue_diff(&sq1, &sq2, &osq);
2952 r = osq.nstr ? strqueue_join(&osq) : 0;
2953 strqueue_free(&sq1);
2954 strqueue_free(&sq2);
2955 strqueue_free(&osq);