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" },
91 static struct solverflags2str {
95 } solverflags2str[] = {
96 { SOLVER_FLAG_ALLOW_DOWNGRADE, "allowdowngrade", 0 },
97 { SOLVER_FLAG_ALLOW_NAMECHANGE, "allownamechange", 1 },
98 { SOLVER_FLAG_ALLOW_ARCHCHANGE, "allowarchchange", 0 },
99 { SOLVER_FLAG_ALLOW_VENDORCHANGE, "allowvendorchange", 0 },
100 { SOLVER_FLAG_ALLOW_UNINSTALL, "allowuninstall", 0 },
101 { SOLVER_FLAG_NO_UPDATEPROVIDE, "noupdateprovide", 0 },
102 { SOLVER_FLAG_SPLITPROVIDES, "splitprovides", 0 },
103 { SOLVER_FLAG_IGNORE_RECOMMENDED, "ignorerecommended", 0 },
104 { SOLVER_FLAG_ADD_ALREADY_RECOMMENDED, "addalreadyrecommended", 0 },
105 { SOLVER_FLAG_NO_INFARCHCHECK, "noinfarchcheck", 0 },
106 { SOLVER_FLAG_KEEP_EXPLICIT_OBSOLETES, "keepexplicitobsoletes", 0 },
107 { SOLVER_FLAG_BEST_OBEY_POLICY, "bestobeypolicy", 0 },
108 { SOLVER_FLAG_NO_AUTOTARGET, "noautotarget", 0 },
109 { SOLVER_FLAG_DUP_ALLOW_DOWNGRADE, "dupallowdowngrade", 1 },
110 { SOLVER_FLAG_DUP_ALLOW_ARCHCHANGE, "dupallowarchchange", 1 },
111 { SOLVER_FLAG_DUP_ALLOW_VENDORCHANGE, "dupallowvendorchange", 1 },
112 { SOLVER_FLAG_DUP_ALLOW_NAMECHANGE, "dupallownamechange", 1 },
113 { SOLVER_FLAG_KEEP_ORPHANS, "keeporphans", 0 },
114 { SOLVER_FLAG_BREAK_ORPHANS, "breakorphans", 0 },
115 { SOLVER_FLAG_FOCUS_INSTALLED, "focusinstalled", 0 },
116 { SOLVER_FLAG_YUM_OBSOLETES, "yumobsoletes", 0 },
117 { SOLVER_FLAG_NEED_UPDATEPROVIDE, "needupdateprovide", 0 },
118 { SOLVER_FLAG_URPM_REORDER, "urpmreorder", 0 },
119 { SOLVER_FLAG_FOCUS_BEST, "focusbest", 0 },
120 { SOLVER_FLAG_STRONG_RECOMMENDS, "strongrecommends", 0 },
121 { SOLVER_FLAG_INSTALL_ALSO_UPDATES, "installalsoupdates", 0 },
125 static struct poolflags2str {
129 } poolflags2str[] = {
130 { POOL_FLAG_PROMOTEEPOCH, "promoteepoch", 0 },
131 { POOL_FLAG_FORBIDSELFCONFLICTS, "forbidselfconflicts", 0 },
132 { POOL_FLAG_OBSOLETEUSESPROVIDES, "obsoleteusesprovides", 0 },
133 { POOL_FLAG_IMPLICITOBSOLETEUSESPROVIDES, "implicitobsoleteusesprovides", 0 },
134 { POOL_FLAG_OBSOLETEUSESCOLORS, "obsoleteusescolors", 0 },
135 { POOL_FLAG_IMPLICITOBSOLETEUSESCOLORS, "implicitobsoleteusescolors", 0 },
136 { POOL_FLAG_NOINSTALLEDOBSOLETES, "noinstalledobsoletes", 0 },
137 { POOL_FLAG_HAVEDISTEPOCH, "havedistepoch", 0 },
138 { POOL_FLAG_NOOBSOLETESMULTIVERSION, "noobsoletesmultiversion", 0 },
139 { POOL_FLAG_ADDFILEPROVIDESFILTERED, "addfileprovidesfiltered", 0 },
140 { POOL_FLAG_NOWHATPROVIDESAUX, "nowhatprovidesaux", 0 },
144 static struct disttype2str {
148 { DISTTYPE_RPM, "rpm" },
149 { DISTTYPE_DEB, "deb" },
150 { DISTTYPE_ARCH, "arch" },
151 { DISTTYPE_HAIKU, "haiku" },
155 static struct selflags2str {
159 { SELECTION_NAME, "name" },
160 { SELECTION_PROVIDES, "provides" },
161 { SELECTION_FILELIST, "filelist" },
162 { SELECTION_CANON, "canon" },
163 { SELECTION_DOTARCH, "dotarch" },
164 { SELECTION_REL, "rel" },
165 { SELECTION_INSTALLED_ONLY, "installedonly" },
166 { SELECTION_GLOB, "glob" },
167 { SELECTION_FLAT, "flat" },
168 { SELECTION_NOCASE, "nocase" },
169 { SELECTION_SOURCE_ONLY, "sourceonly" },
170 { SELECTION_WITH_SOURCE, "withsource" },
174 static const char *features[] = {
175 #ifdef ENABLE_LINKED_PKGS
178 #ifdef ENABLE_COMPLEX_DEPS
181 #if ENABLE_TESTCASE_HELIXREPO
182 "testcase_helixrepo",
187 typedef struct strqueue {
192 #define STRQUEUE_BLOCK 63
195 strqueue_init(Strqueue *q)
202 strqueue_free(Strqueue *q)
205 for (i = 0; i < q->nstr; i++)
206 solv_free(q->str[i]);
207 q->str = solv_free(q->str);
212 strqueue_push(Strqueue *q, const char *s)
214 q->str = solv_extend(q->str, q->nstr, 1, sizeof(*q->str), STRQUEUE_BLOCK);
215 q->str[q->nstr++] = solv_strdup(s);
219 strqueue_pushjoin(Strqueue *q, const char *s1, const char *s2, const char *s3)
221 q->str = solv_extend(q->str, q->nstr, 1, sizeof(*q->str), STRQUEUE_BLOCK);
222 q->str[q->nstr++] = solv_dupjoin(s1, s2, s3);
226 strqueue_sort_cmp(const void *ap, const void *bp, void *dp)
228 const char *a = *(const char **)ap;
229 const char *b = *(const char **)bp;
230 return strcmp(a ? a : "", b ? b : "");
234 strqueue_sort(Strqueue *q)
237 solv_sort(q->str, q->nstr, sizeof(*q->str), strqueue_sort_cmp, 0);
241 strqueue_sort_u(Strqueue *q)
245 for (i = j = 0; i < q->nstr; i++)
246 if (!j || strqueue_sort_cmp(q->str + i, q->str + j - 1, 0) != 0)
247 q->str[j++] = q->str[i];
252 strqueue_join(Strqueue *q)
256 for (i = 0; i < q->nstr; i++)
258 l += strlen(q->str[i]) + 1;
259 l++; /* trailing \0 */
262 for (i = 0; i < q->nstr; i++)
265 strcpy(rp, q->str[i]);
274 strqueue_split(Strqueue *q, const char *s)
279 while ((p = strchr(s, '\n')) != 0)
281 q->str = solv_extend(q->str, q->nstr, 1, sizeof(*q->str), STRQUEUE_BLOCK);
282 q->str[q->nstr] = solv_malloc(p - s + 1);
284 memcpy(q->str[q->nstr], s, p - s);
285 q->str[q->nstr][p - s] = 0;
294 strqueue_diff(Strqueue *sq1, Strqueue *sq2, Strqueue *osq)
297 while (i < sq1->nstr && j < sq2->nstr)
299 int r = strqueue_sort_cmp(sq1->str + i, sq2->str + j, 0);
303 strqueue_pushjoin(osq, "-", sq1->str[i++], 0);
305 strqueue_pushjoin(osq, "+", sq2->str[j++], 0);
307 while (i < sq1->nstr)
308 strqueue_pushjoin(osq, "-", sq1->str[i++], 0);
309 while (j < sq2->nstr)
310 strqueue_pushjoin(osq, "+", sq2->str[j++], 0);
315 testcase_id2str(Pool *pool, Id id, int isname)
317 const char *s = pool_id2str(pool, id);
320 int bad = 0, paren = 0, parenbad = 0;
326 if (strchr("[(<=>!", *s))
328 if (!strncmp(s, "namespace:", 10))
330 for (ss = s + bad; *ss; ss++)
332 if (*ss == ' ' || *ss == '\\' || *(unsigned char *)ss < 32 || *ss == '(' || *ss == ')')
335 paren = paren == 0 ? 1 : -1;
338 paren = paren == 1 ? 0 : -1;
343 if (isname && ss - s > 4 && !strcmp(ss - 4, ":any"))
345 if (!paren && !(bad - parenbad))
348 /* we need escaping! */
349 s2 = s2p = pool_alloctmpspace(pool, strlen(s) + bad * 2 + 1);
350 if (!strncmp(s, "namespace:", 10))
352 strcpy(s2p, "namespace\\3a");
360 if ((ss == s && strchr("[(<=>!", *s)) || *ss == ' ' || *ss == '\\' || *(unsigned char *)ss < 32 || *ss == '(' || *ss == ')')
363 solv_bin2hex((unsigned char *)ss, 1, s2p);
368 if (isname && s2p - s2 > 4 && !strcmp(s2p - 4, ":any"))
369 strcpy(s2p - 4, "\\3aany");
378 { REL_GT | REL_LT | REL_EQ, "<=>" },
379 { REL_LT | REL_EQ, "<=" },
380 { REL_GT | REL_EQ, ">=" },
382 { REL_GT | REL_LT, "<>" },
386 { REL_WITHOUT , "-" },
387 { REL_NAMESPACE , "<NAMESPACE>" },
389 { REL_MULTIARCH, "<MULTIARCH>" },
390 { REL_FILECONFLICT, "<FILECONFLICT>" },
391 { REL_COND, "<IF>" },
392 { REL_COMPAT, "compat >=" },
393 { REL_KIND, "<KIND>" },
394 { REL_ELSE, "<ELSE>" },
395 { REL_ERROR, "<ERROR>" },
396 { REL_UNLESS, "<UNLESS>" },
402 testcase_dep2str_complex(Pool *pool, char *s, Id id, int addparens)
411 s2 = testcase_id2str(pool, id, 1);
412 s = pool_tmpappend(pool, s, s2, 0);
413 pool_freetmpspace(pool, s2);
416 rd = GETRELDEP(pool, id);
418 /* check for special shortcuts */
419 if (rd->flags == REL_NAMESPACE && !ISRELDEP(rd->name) && !strncmp(pool_id2str(pool, rd->name), "namespace:", 10))
421 s = pool_tmpappend(pool, s, pool_id2str(pool, rd->name), "(");
422 s = testcase_dep2str_complex(pool, s, rd->evr, 0);
423 return pool_tmpappend(pool, s, ")", 0);
425 if (rd->flags == REL_MULTIARCH && !ISRELDEP(rd->name) && rd->evr == ARCH_ANY)
427 /* append special :any suffix */
428 s2 = testcase_id2str(pool, rd->name, 1);
429 s = pool_tmpappend(pool, s, s2, ":any");
430 pool_freetmpspace(pool, s2);
435 if (ISRELDEP(rd->name))
437 Reldep *rd2 = GETRELDEP(pool, rd->name);
439 if (rd->flags > 7 && rd->flags != REL_COMPAT && rd2->flags && rd2->flags <= 7)
444 s = pool_tmpappend(pool, s, "(", 0);
445 s = testcase_dep2str_complex(pool, s, rd->name, needparens);
447 for (op = oplist; op->flags; op++)
448 if (rd->flags == op->flags)
452 s = pool_tmpappend(pool, s, " ", op->opname);
453 s = pool_tmpappend(pool, s, " ", 0);
458 sprintf(buf, " <%u> ", rd->flags);
459 s = pool_tmpappend(pool, s, buf, 0);
463 if (ISRELDEP(rd->evr))
465 Reldep *rd2 = GETRELDEP(pool, rd->evr);
467 if (rd->flags > 7 && rd2->flags && rd2->flags <= 7)
469 if (rd->flags == REL_AND && rd2->flags == REL_AND)
470 needparens = 0; /* chain */
471 if (rd->flags == REL_OR && rd2->flags == REL_OR)
472 needparens = 0; /* chain */
473 if (rd->flags > 0 && rd->flags < 8 && rd2->flags == REL_COMPAT)
474 needparens = 0; /* chain */
476 if (!ISRELDEP(rd->evr))
478 s2 = testcase_id2str(pool, rd->evr, 0);
479 s = pool_tmpappend(pool, s, s2, 0);
480 pool_freetmpspace(pool, s2);
483 s = (char *)testcase_dep2str_complex(pool, s, rd->evr, needparens);
485 s = pool_tmpappend(pool, s, ")", 0);
490 testcase_dep2str(Pool *pool, Id id)
494 return testcase_id2str(pool, id, 1);
495 s = pool_alloctmpspace(pool, 1);
497 return testcase_dep2str_complex(pool, s, id, 0);
501 /* Convert a simple string. Also handle the :any suffix */
503 testcase_str2dep_simple(Pool *pool, const char **sp, int isname)
510 for (s = *sp; *s; s++)
514 if (*s == ' ' || *(unsigned char *)s < 32)
518 if (*s == ')' && paren-- <= 0)
521 if (isname && s - *sp > 4 && !strncmp(s - 4, ":any", 4))
528 if (s - *sp == 6 && !strncmp(*sp, "<NULL>", 6))
531 id = pool_strn2id(pool, *sp, s - *sp, 1);
533 else if (s - *sp == 3 && !strncmp(*sp, "\\00", 3))
537 char buf[128], *bp, *bp2;
539 bp = s - *sp >= 128 ? solv_malloc(s - *sp + 1) : buf;
540 for (bp2 = bp, sp2 = *sp; sp2 < s;)
544 solv_hex2bin(&sp2, (unsigned char *)bp2 - 1, 1);
547 id = pool_str2id(pool, bp, 1);
553 id = pool_rel2id(pool, id, ARCH_ANY, REL_MULTIARCH, 1);
562 testcase_str2dep_complex(Pool *pool, const char **sp, int relop)
565 Id flags, id, id2, namespaceid = 0;
568 while (*s == ' ' || *s == '\t')
570 if (!strncmp(s, "namespace:", 10))
572 /* special namespace hack */
574 for (s2 = s + 10; *s2 && *s2 != '('; s2++)
578 namespaceid = pool_strn2id(pool, s, s2 - s, 1);
585 id = testcase_str2dep_complex(pool, &s, 0);
594 id = testcase_str2dep_simple(pool, &s, relop ? 0 : 1);
596 id = pool_rel2id(pool, namespaceid, id, REL_NAMESPACE, 1);
600 while (*s == ' ' || *s == '\t')
602 if (!*s || *s == ')' || (relop && strncmp(s, "compat >= ", 10) != 0))
608 /* we have an op! Find the end */
610 if (s[0] == '<' && (s[1] >= '0' && s[1] <= '9'))
613 for (s2 = s + 1; *s2 >= '0' && *s2 <= '9'; s2++)
617 flags = strtoul(s + 1, 0, 10);
623 for (op = oplist; op->flags; op++)
624 if (!strncmp(s, op->opname, strlen(op->opname)))
632 s += strlen(op->opname);
634 id2 = testcase_str2dep_complex(pool, &s, flags > 0 && flags < 8);
640 id = pool_rel2id(pool, id, id2, flags, 1);
645 testcase_str2dep(Pool *pool, const char *s)
647 Id id = testcase_str2dep_complex(pool, &s, 0);
648 return s && !*s ? id : 0;
651 /**********************************************************/
654 testcase_repoid2str(Pool *pool, Id repoid)
656 Repo *repo = pool_id2repo(pool, repoid);
659 char *r = pool_tmpjoin(pool, repo->name, 0, 0);
661 for (rp = r; *rp; rp++)
662 if (*rp == ' ' || *rp == '\t')
669 sprintf(buf, "#%d", repoid);
670 return pool_tmpjoin(pool, buf, 0, 0);
675 testcase_solvid2str(Pool *pool, Id p)
677 Solvable *s = pool->solvables + p;
678 const char *n, *e, *a;
681 if (p == SYSTEMSOLVABLE)
683 n = pool_id2str(pool, s->name);
684 e = pool_id2str(pool, s->evr);
685 a = pool_id2str(pool, s->arch);
686 str = pool_alloctmpspace(pool, strlen(n) + strlen(e) + strlen(a) + 3);
687 sprintf(str, "%s-%s.%s", n, e, a);
689 return pool_tmpappend(pool, str, "@", 0);
693 char *str2 = pool_tmpappend(pool, str, "@", s->repo->name);
695 if (str2[l] == ' ' || str2[l] == '\t')
699 sprintf(buf, "@#%d", s->repo->repoid);
700 return pool_tmpappend(pool, str, buf, 0);
704 testcase_str2repo(Pool *pool, const char *str)
708 if (str[0] == '#' && (str[1] >= '0' && str[1] <= '9'))
712 for (j = 1; str[j] >= '0' && str[j] <= '9'; j++)
713 repoid = repoid * 10 + (str[j] - '0');
714 if (!str[j] && repoid > 0 && repoid < pool->nrepos)
715 repo = pool_id2repo(pool, repoid);
719 FOR_REPOS(repoid, repo)
724 l = strlen(repo->name);
725 for (i = 0; i < l; i++)
727 int c = repo->name[i];
728 if (c == ' ' || c == '\t')
733 if (i == l && !str[l])
736 if (repoid >= pool->nrepos)
743 testcase_str2solvid(Pool *pool, const char *str)
745 int i, l = strlen(str);
752 if (*str == '@' && !strcmp(str, "@SYSTEM"))
753 return SYSTEMSOLVABLE;
755 for (i = l - 1; i >= 0; i--)
756 if (str[i] == '@' && (repo = testcase_str2repo(pool, str + i + 1)) != 0)
761 /* now find the arch (if present) */
763 for (i = repostart - 1; i > 0; i--)
766 arch = pool_strn2id(pool, str + i + 1, repostart - (i + 1), 0);
771 /* now find the name */
772 for (i = repostart - 1; i > 0; i--)
776 Id nid, evrid, p, pp;
777 nid = pool_strn2id(pool, str, i, 0);
780 evrid = pool_strn2id(pool, str + i + 1, repostart - (i + 1), 0);
783 /* first check whatprovides */
784 FOR_PROVIDES(p, pp, nid)
786 Solvable *s = pool->solvables + p;
787 if (s->name != nid || s->evr != evrid)
789 if (repo && s->repo != repo)
791 if (arch && s->arch != arch)
795 /* maybe it's not installable and thus not in whatprovides. do a slow search */
799 FOR_REPO_SOLVABLES(repo, p, s)
801 if (s->name != nid || s->evr != evrid)
803 if (arch && s->arch != arch)
810 FOR_POOL_SOLVABLES(p)
812 Solvable *s = pool->solvables + p;
813 if (s->name != nid || s->evr != evrid)
815 if (arch && s->arch != arch)
826 testcase_job2str(Pool *pool, Id how, Id what)
833 Id select = how & SOLVER_SELECTMASK;
835 for (i = 0; job2str[i].str; i++)
836 if ((how & SOLVER_JOBMASK) == job2str[i].job)
838 jobstr = job2str[i].str ? job2str[i].str : "unknown";
839 if (select == SOLVER_SOLVABLE)
842 pkgstr = testcase_solvid2str(pool, what);
844 else if (select == SOLVER_SOLVABLE_NAME)
847 pkgstr = testcase_dep2str(pool, what);
849 else if (select == SOLVER_SOLVABLE_PROVIDES)
851 selstr = " provides ";
852 pkgstr = testcase_dep2str(pool, what);
854 else if (select == SOLVER_SOLVABLE_ONE_OF)
859 while ((p = pool->whatprovidesdata[what++]) != 0)
861 const char *s = testcase_solvid2str(pool, p);
864 pkgstr = pool_tmpappend(pool, pkgstr, " ", s);
865 pool_freetmpspace(pool, s);
873 else if (select == SOLVER_SOLVABLE_REPO)
875 Repo *repo = pool_id2repo(pool, what);
880 sprintf(buf, "#%d", repo->repoid);
881 pkgstr = pool_tmpjoin(pool, buf, 0, 0);
884 pkgstr = pool_tmpjoin(pool, repo->name, 0, 0);
886 else if (select == SOLVER_SOLVABLE_ALL)
893 selstr = " unknown ";
896 ret = pool_tmpjoin(pool, jobstr, selstr, pkgstr);
898 ret = pool_tmpappend(pool, ret, " ", 0);
899 for (i = 0; jobflags2str[i].str; i++)
900 if ((how & jobflags2str[i].flag) != 0)
901 ret = pool_tmpappend(pool, ret, ",", jobflags2str[i].str);
907 ret = pool_tmpappend(pool, ret, "]", 0);
913 str2selflags(Pool *pool, char *s) /* modifies the string! */
918 char *se = strchr(s, ',');
921 for (i = 0; selflags2str[i].str; i++)
922 if (!strcmp(s, selflags2str[i].str))
924 selflags |= selflags2str[i].flag;
927 if (!selflags2str[i].str)
928 pool_debug(pool, SOLV_ERROR, "str2job: unknown selection flag '%s'\n", s);
935 str2jobflags(Pool *pool, char *s) /* modifies the string */
940 char *se = strchr(s, ',');
943 for (i = 0; jobflags2str[i].str; i++)
944 if (!strcmp(s, jobflags2str[i].str))
946 jobflags |= jobflags2str[i].flag;
949 if (!jobflags2str[i].str)
950 pool_debug(pool, SOLV_ERROR, "str2job: unknown job flag '%s'\n", s);
957 testcase_str2job(Pool *pool, const char *str, Id *whatp)
967 /* so we can patch it */
968 s = pool_tmpjoin(pool, str, 0, 0);
969 /* split it in pieces */
972 while (*s == ' ' || *s == '\t')
976 pieces = solv_extend(pieces, npieces, 1, sizeof(*pieces), 7);
977 pieces[npieces++] = s;
978 while (*s && *s != ' ' && *s != '\t')
985 pool_debug(pool, SOLV_ERROR, "str2job: bad line '%s'\n", str);
990 for (i = 0; job2str[i].str; i++)
991 if (!strcmp(pieces[0], job2str[i].str))
995 pool_debug(pool, SOLV_ERROR, "str2job: unknown job '%s'\n", str);
999 job = job2str[i].job;
1003 char *flags = pieces[npieces - 1];
1004 if (*flags == '[' && flags[strlen(flags) - 1] == ']')
1008 flags[strlen(flags) - 1] = 0;
1009 job |= str2jobflags(pool, flags);
1012 if (!strcmp(pieces[1], "pkg"))
1016 pool_debug(pool, SOLV_ERROR, "str2job: bad pkg selector in '%s'\n", str);
1020 job |= SOLVER_SOLVABLE;
1021 what = testcase_str2solvid(pool, pieces[2]);
1024 pool_debug(pool, SOLV_ERROR, "str2job: unknown package '%s'\n", pieces[2]);
1029 else if (!strcmp(pieces[1], "name") || !strcmp(pieces[1], "provides"))
1031 /* join em again for dep2str... */
1033 for (sp = pieces[2]; sp < pieces[npieces - 1]; sp++)
1037 if (pieces[1][0] == 'p' && strncmp(pieces[2], "namespace:", 10) == 0)
1039 char *spe = strchr(pieces[2], '(');
1040 int l = strlen(pieces[2]);
1041 if (spe && pieces[2][l - 1] == ')')
1043 /* special namespace provides */
1044 if (strcmp(spe, "(<NULL>)") != 0)
1046 pieces[2][l - 1] = 0;
1047 what = testcase_str2dep(pool, spe + 1);
1048 pieces[2][l - 1] = ')';
1050 what = pool_rel2id(pool, pool_strn2id(pool, pieces[2], spe - pieces[2], 1), what, REL_NAMESPACE, 1);
1054 what = testcase_str2dep(pool, pieces[2]);
1055 if (pieces[1][0] == 'n')
1056 job |= SOLVER_SOLVABLE_NAME;
1058 job |= SOLVER_SOLVABLE_PROVIDES;
1060 else if (!strcmp(pieces[1], "oneof"))
1063 job |= SOLVER_SOLVABLE_ONE_OF;
1065 if (npieces > 3 && strcmp(pieces[2], "nothing") != 0)
1067 for (i = 2; i < npieces; i++)
1069 Id p = testcase_str2solvid(pool, pieces[i]);
1072 pool_debug(pool, SOLV_ERROR, "str2job: unknown package '%s'\n", pieces[i]);
1080 what = pool_queuetowhatprovides(pool, &q);
1083 else if (!strcmp(pieces[1], "repo"))
1088 pool_debug(pool, SOLV_ERROR, "str2job: bad line '%s'\n", str);
1092 repo = testcase_str2repo(pool, pieces[2]);
1095 pool_debug(pool, SOLV_ERROR, "str2job: unknown repo '%s'\n", pieces[2]);
1099 job |= SOLVER_SOLVABLE_REPO;
1100 what = repo->repoid;
1102 else if (!strcmp(pieces[1], "all"))
1104 if (npieces != 3 && strcmp(pieces[2], "packages") != 0)
1106 pool_debug(pool, SOLV_ERROR, "str2job: bad line '%s'\n", str);
1110 job |= SOLVER_SOLVABLE_ALL;
1115 pool_debug(pool, SOLV_ERROR, "str2job: unknown selection in '%s'\n", str);
1125 addselectionjob(Pool *pool, char **pieces, int npieces, Queue *jobqueue)
1132 for (i = 0; job2str[i].str; i++)
1133 if (!strcmp(pieces[0], job2str[i].str))
1135 if (!job2str[i].str)
1137 pool_debug(pool, SOLV_ERROR, "selstr2job: unknown job '%s'\n", pieces[0]);
1140 job = job2str[i].job;
1143 char *flags = pieces[npieces - 1];
1144 if (*flags == '[' && flags[strlen(flags) - 1] == ']')
1148 flags[strlen(flags) - 1] = 0;
1149 job |= str2jobflags(pool, flags);
1154 pool_debug(pool, SOLV_ERROR, "selstr2job: no selection flags\n");
1157 selflags = str2selflags(pool, pieces[3]);
1159 r = selection_make(pool, &sel, pieces[2], selflags);
1160 for (i = 0; i < sel.count; i += 2)
1161 queue_push2(jobqueue, job | sel.elements[i], sel.elements[i + 1]);
1167 writedeps(Repo *repo, FILE *fp, const char *tag, Id key, Solvable *s, Offset off)
1169 Pool *pool = repo->pool;
1176 dp = repo->idarraydata + off;
1177 while ((id = *dp++) != 0)
1179 if (key == SOLVABLE_REQUIRES && id == SOLVABLE_PREREQMARKER)
1182 fprintf(fp, "-%s\n", tag);
1187 if (key == SOLVABLE_PROVIDES && id == SOLVABLE_FILEMARKER)
1189 idstr = testcase_dep2str(pool, id);
1192 fprintf(fp, "+%s\n", tag);
1195 fprintf(fp, "%s\n", idstr);
1198 fprintf(fp, "-%s\n", tag);
1202 writefilelist(Repo *repo, FILE *fp, const char *tag, Solvable *s)
1204 Pool *pool = repo->pool;
1208 dataiterator_init(&di, pool, repo, s - pool->solvables, SOLVABLE_FILELIST, 0, 0);
1209 while (dataiterator_step(&di))
1211 const char *s = repodata_dir2str(di.data, di.kv.id, di.kv.str);
1214 fprintf(fp, "+%s\n", tag);
1217 fprintf(fp, "%s\n", s);
1220 fprintf(fp, "-%s\n", tag);
1221 dataiterator_free(&di);
1225 testcase_write_testtags(Repo *repo, FILE *fp)
1227 Pool *pool = repo->pool;
1233 const char *release;
1238 fprintf(fp, "=Ver: 3.0\n");
1240 FOR_REPO_SOLVABLES(repo, p, s)
1242 name = pool_id2str(pool, s->name);
1243 evr = pool_id2str(pool, s->evr);
1244 arch = pool_id2str(pool, s->arch);
1245 release = strrchr(evr, '-');
1247 release = evr + strlen(evr);
1248 fprintf(fp, "=Pkg: %s %.*s %s %s\n", name, (int)(release - evr), evr, *release && release[1] ? release + 1 : "-", arch);
1249 tmp = solvable_lookup_str(s, SOLVABLE_SUMMARY);
1251 fprintf(fp, "=Sum: %s\n", tmp);
1252 writedeps(repo, fp, "Req:", SOLVABLE_REQUIRES, s, s->requires);
1253 writedeps(repo, fp, "Prv:", SOLVABLE_PROVIDES, s, s->provides);
1254 writedeps(repo, fp, "Obs:", SOLVABLE_OBSOLETES, s, s->obsoletes);
1255 writedeps(repo, fp, "Con:", SOLVABLE_CONFLICTS, s, s->conflicts);
1256 writedeps(repo, fp, "Rec:", SOLVABLE_RECOMMENDS, s, s->recommends);
1257 writedeps(repo, fp, "Sup:", SOLVABLE_SUPPLEMENTS, s, s->supplements);
1258 writedeps(repo, fp, "Sug:", SOLVABLE_SUGGESTS, s, s->suggests);
1259 writedeps(repo, fp, "Enh:", SOLVABLE_ENHANCES, s, s->enhances);
1260 if (solvable_lookup_idarray(s, SOLVABLE_PREREQ_IGNOREINST, &q))
1263 fprintf(fp, "+Ipr:\n");
1264 for (i = 0; i < q.count; i++)
1265 fprintf(fp, "%s\n", testcase_dep2str(pool, q.elements[i]));
1266 fprintf(fp, "-Ipr:\n");
1269 fprintf(fp, "=Vnd: %s\n", pool_id2str(pool, s->vendor));
1270 ti = solvable_lookup_num(s, SOLVABLE_BUILDTIME, 0);
1272 fprintf(fp, "=Tim: %u\n", ti);
1273 writefilelist(repo, fp, "Fls:", s);
1279 static inline Offset
1280 adddep(Repo *repo, Offset olddeps, char *str, Id marker)
1282 Id id = *str == '/' ? pool_str2id(repo->pool, str, 1) : testcase_str2dep(repo->pool, str);
1283 return repo_addid_dep(repo, olddeps, id, marker);
1287 finish_v2_solvable(Pool *pool, Repodata *data, Solvable *s, char *filelist, int nfilelist)
1293 for (l = 0; l < nfilelist; l += strlen(filelist + l) + 1)
1295 char *p = strrchr(filelist + l, '/');
1299 did = repodata_str2dir(data, filelist + l, 1);
1302 did = repodata_str2dir(data, "/", 1);
1303 repodata_add_dirstr(data, s - pool->solvables, SOLVABLE_FILELIST, did, p);
1306 repo_rewrite_suse_deps(s, 0);
1309 /* stripped down version of susetags parser used for testcases */
1311 testcase_add_testtags(Repo *repo, FILE *fp, int flags)
1313 Pool *pool = repo->pool;
1325 int tagsversion = 0;
1326 int addselfprovides = 1; /* for compat reasons */
1328 data = repo_add_repodata(repo, flags);
1333 line = solv_malloc(aline);
1337 if (linep - line + 16 > aline)
1339 aline = linep - line;
1340 line = solv_realloc(line, aline + 512);
1341 linep = line + aline;
1344 if (!fgets(linep, aline - (linep - line), fp))
1346 linep += strlen(linep);
1347 if (linep == line || linep[-1] != '\n')
1350 linep = line + intag;
1353 if (line[intag] == '-' && !strncmp(line + 1, line + intag + 1, intag - 2))
1360 else if (line[0] == '+' && line[1] && line[1] != ':')
1362 char *tagend = strchr(line, ':');
1367 intag = tagend + 2 - line;
1368 linep = line + intag;
1371 if (*line != '=' || !line[1] || !line[2] || !line[3] || line[4] != ':')
1373 tag = line[1] << 16 | line[2] << 8 | line[3];
1376 case 'V' << 16 | 'e' << 8 | 'r':
1377 tagsversion = atoi(line + 6);
1378 addselfprovides = tagsversion < 3 || strstr(line + 6, "addselfprovides") != 0;
1380 case 'P' << 16 | 'k' << 8 | 'g':
1383 if (tagsversion == 2)
1384 finish_v2_solvable(pool, data, s, filelist, nfilelist);
1385 if (addselfprovides && s->name && s->arch != ARCH_SRC && s->arch != ARCH_NOSRC)
1386 s->provides = repo_addid_dep(s->repo, s->provides, pool_rel2id(pool, s->name, s->evr, REL_EQ, 1), 0);
1389 if (split(line + 5, sp, 5) != 4)
1391 s = pool_id2solvable(pool, repo_add_solvable(repo));
1392 s->name = pool_str2id(pool, sp[0], 1);
1393 /* join back version and release */
1394 if (sp[2] && !(sp[2][0] == '-' && !sp[2][1]))
1396 s->evr = makeevr(pool, sp[1]);
1397 s->arch = pool_str2id(pool, sp[3], 1);
1399 case 'S' << 16 | 'u' << 8 | 'm':
1400 repodata_set_str(data, s - pool->solvables, SOLVABLE_SUMMARY, line + 6);
1402 case 'V' << 16 | 'n' << 8 | 'd':
1403 s->vendor = pool_str2id(pool, line + 6, 1);
1405 case 'T' << 16 | 'i' << 8 | 'm':
1408 repodata_set_num(data, s - pool->solvables, SOLVABLE_BUILDTIME, t);
1410 case 'R' << 16 | 'e' << 8 | 'q':
1411 s->requires = adddep(repo, s->requires, line + 6, -SOLVABLE_PREREQMARKER);
1413 case 'P' << 16 | 'r' << 8 | 'q':
1414 s->requires = adddep(repo, s->requires, line + 6, SOLVABLE_PREREQMARKER);
1416 case 'P' << 16 | 'r' << 8 | 'v':
1417 /* version 2 had the file list at the end of the provides */
1418 if (tagsversion == 2)
1422 int l = strlen(line + 6) + 1;
1423 if (nfilelist + l > afilelist)
1425 afilelist = nfilelist + l + 512;
1426 filelist = solv_realloc(filelist, afilelist);
1428 memcpy(filelist + nfilelist, line + 6, l);
1435 for (l = 0; l < nfilelist; l += strlen(filelist + l) + 1)
1436 s->provides = repo_addid_dep(repo, s->provides, pool_str2id(pool, filelist + l, 1), 0);
1440 s->provides = adddep(repo, s->provides, line + 6, 0);
1442 case 'F' << 16 | 'l' << 8 | 's':
1444 char *p = strrchr(line + 6, '/');
1449 did = repodata_str2dir(data, line + 6, 1);
1451 did = repodata_str2dir(data, "/", 1);
1452 repodata_add_dirstr(data, s - pool->solvables, SOLVABLE_FILELIST, did, p);
1455 case 'O' << 16 | 'b' << 8 | 's':
1456 s->obsoletes = adddep(repo, s->obsoletes, line + 6, 0);
1458 case 'C' << 16 | 'o' << 8 | 'n':
1459 s->conflicts = adddep(repo, s->conflicts, line + 6, 0);
1461 case 'R' << 16 | 'e' << 8 | 'c':
1462 s->recommends = adddep(repo, s->recommends, line + 6, 0);
1464 case 'S' << 16 | 'u' << 8 | 'p':
1465 s->supplements = adddep(repo, s->supplements, line + 6, 0);
1467 case 'S' << 16 | 'u' << 8 | 'g':
1468 s->suggests = adddep(repo, s->suggests, line + 6, 0);
1470 case 'E' << 16 | 'n' << 8 | 'h':
1471 s->enhances = adddep(repo, s->enhances, line + 6, 0);
1473 case 'I' << 16 | 'p' << 8 | 'r':
1475 Id id = line[6] == '/' ? pool_str2id(pool, line + 6, 1) : testcase_str2dep(pool, line + 6);
1476 repodata_add_idarray(data, s - pool->solvables, SOLVABLE_PREREQ_IGNOREINST, id);
1485 if (tagsversion == 2)
1486 finish_v2_solvable(pool, data, s, filelist, nfilelist);
1487 if (addselfprovides && s->name && s->arch != ARCH_SRC && s->arch != ARCH_NOSRC)
1488 s->provides = repo_addid_dep(s->repo, s->provides, pool_rel2id(pool, s->name, s->evr, REL_EQ, 1), 0);
1491 solv_free(filelist);
1492 repodata_free_dircache(data);
1493 if (!(flags & REPO_NO_INTERNALIZE))
1494 repodata_internalize(data);
1499 testcase_getpoolflags(Pool *pool)
1501 const char *str = 0;
1503 for (i = 0; poolflags2str[i].str; i++)
1505 v = pool_get_flag(pool, poolflags2str[i].flag);
1506 if (v == poolflags2str[i].def)
1508 str = pool_tmpappend(pool, str, v ? " " : " !", poolflags2str[i].str);
1510 return str ? str + 1 : "";
1514 testcase_setpoolflags(Pool *pool, const char *str)
1516 const char *p = str, *s;
1520 while (*p == ' ' || *p == '\t' || *p == ',')
1531 while (*p && *p != ' ' && *p != '\t' && *p != ',')
1533 for (i = 0; poolflags2str[i].str; i++)
1534 if (!strncmp(poolflags2str[i].str, s, p - s) && poolflags2str[i].str[p - s] == 0)
1536 if (!poolflags2str[i].str)
1538 pool_debug(pool, SOLV_ERROR, "setpoolflags: unknown flag '%.*s'\n", (int)(p - s), s);
1541 pool_set_flag(pool, poolflags2str[i].flag, v);
1547 testcase_resetpoolflags(Pool *pool)
1550 for (i = 0; poolflags2str[i].str; i++)
1551 pool_set_flag(pool, poolflags2str[i].flag, poolflags2str[i].def);
1555 testcase_getsolverflags(Solver *solv)
1557 Pool *pool = solv->pool;
1558 const char *str = 0;
1560 for (i = 0; solverflags2str[i].str; i++)
1562 v = solver_get_flag(solv, solverflags2str[i].flag);
1563 if (v == solverflags2str[i].def)
1565 str = pool_tmpappend(pool, str, v ? " " : " !", solverflags2str[i].str);
1567 return str ? str + 1 : "";
1571 testcase_setsolverflags(Solver *solv, const char *str)
1573 const char *p = str, *s;
1577 while (*p == ' ' || *p == '\t' || *p == ',')
1588 while (*p && *p != ' ' && *p != '\t' && *p != ',')
1590 for (i = 0; solverflags2str[i].str; i++)
1591 if (!strncmp(solverflags2str[i].str, s, p - s) && solverflags2str[i].str[p - s] == 0)
1593 if (!solverflags2str[i].str)
1595 pool_debug(solv->pool, SOLV_ERROR, "setsolverflags: unknown flag '%.*s'\n", (int)(p - s), s);
1598 if (solver_set_flag(solv, solverflags2str[i].flag, v) == -1)
1600 pool_debug(solv->pool, SOLV_ERROR, "setsolverflags: unsupported flag '%s'\n", solverflags2str[i].str);
1608 testcase_resetsolverflags(Solver *solv)
1611 for (i = 0; solverflags2str[i].str; i++)
1612 solver_set_flag(solv, solverflags2str[i].flag, solverflags2str[i].def);
1616 testcase_ruleid(Solver *solv, Id rid)
1622 const unsigned char *md5;
1628 solver_ruleliterals(solv, rid, &q);
1629 for (i = 0; i < q.count; i++)
1631 Id p = q.elements[i];
1632 s = testcase_solvid2str(solv->pool, p > 0 ? p : -p);
1634 s = pool_tmpjoin(solv->pool, "!", s, 0);
1635 strqueue_push(&sq, s);
1638 strqueue_sort_u(&sq);
1639 chk = solv_chksum_create(REPOKEY_TYPE_MD5);
1640 for (i = 0; i < sq.nstr; i++)
1641 solv_chksum_add(chk, sq.str[i], strlen(sq.str[i]) + 1);
1642 md5 = solv_chksum_get(chk, &md5l);
1643 s = pool_bin2hex(solv->pool, md5, md5l);
1644 chk = solv_chksum_free(chk, 0);
1650 testcase_problemid(Solver *solv, Id problem)
1655 const unsigned char *md5;
1659 /* we build a hash of all rules that define the problem */
1662 solver_findallproblemrules(solv, problem, &q);
1663 for (i = 0; i < q.count; i++)
1664 strqueue_push(&sq, testcase_ruleid(solv, q.elements[i]));
1666 strqueue_sort_u(&sq);
1667 chk = solv_chksum_create(REPOKEY_TYPE_MD5);
1668 for (i = 0; i < sq.nstr; i++)
1669 solv_chksum_add(chk, sq.str[i], strlen(sq.str[i]) + 1);
1670 md5 = solv_chksum_get(chk, &md5l);
1671 s = pool_bin2hex(solv->pool, md5, 4);
1672 chk = solv_chksum_free(chk, 0);
1678 testcase_solutionid(Solver *solv, Id problem, Id solution)
1682 const unsigned char *md5;
1686 intid = solver_solutionelement_internalid(solv, problem, solution);
1687 /* internal stuff! handle with care! */
1691 s = testcase_job2str(solv->pool, solv->job.elements[-intid - 1], solv->job.elements[-intid]);
1696 s = testcase_ruleid(solv, intid);
1698 chk = solv_chksum_create(REPOKEY_TYPE_MD5);
1699 solv_chksum_add(chk, s, strlen(s) + 1);
1700 md5 = solv_chksum_get(chk, &md5l);
1701 s = pool_bin2hex(solv->pool, md5, 4);
1702 chk = solv_chksum_free(chk, 0);
1707 testcase_alternativeid(Solver *solv, int type, Id id, Id from)
1710 Pool *pool = solv->pool;
1712 const unsigned char *md5;
1714 chk = solv_chksum_create(REPOKEY_TYPE_MD5);
1715 if (type == SOLVER_ALTERNATIVE_TYPE_RECOMMENDS)
1717 s = testcase_solvid2str(pool, from);
1718 solv_chksum_add(chk, s, strlen(s) + 1);
1719 s = testcase_dep2str(pool, id);
1720 solv_chksum_add(chk, s, strlen(s) + 1);
1722 else if (type == SOLVER_ALTERNATIVE_TYPE_RULE)
1724 s = testcase_ruleid(solv, id);
1725 solv_chksum_add(chk, s, strlen(s) + 1);
1727 md5 = solv_chksum_get(chk, &md5l);
1728 s = pool_bin2hex(pool, md5, 4);
1729 chk = solv_chksum_free(chk, 0);
1733 static struct class2str {
1737 { SOLVER_TRANSACTION_ERASE, "erase" },
1738 { SOLVER_TRANSACTION_INSTALL, "install" },
1739 { SOLVER_TRANSACTION_REINSTALLED, "reinstall" },
1740 { SOLVER_TRANSACTION_DOWNGRADED, "downgrade" },
1741 { SOLVER_TRANSACTION_CHANGED, "change" },
1742 { SOLVER_TRANSACTION_UPGRADED, "upgrade" },
1743 { SOLVER_TRANSACTION_OBSOLETED, "obsolete" },
1744 { SOLVER_TRANSACTION_MULTIINSTALL, "multiinstall" },
1745 { SOLVER_TRANSACTION_MULTIREINSTALL, "multireinstall" },
1749 static struct reason2str {
1753 { SOLVER_REASON_UNRELATED, "unrelated" },
1754 { SOLVER_REASON_UNIT_RULE, "unit" },
1755 { SOLVER_REASON_KEEP_INSTALLED, "keep" },
1756 { SOLVER_REASON_RESOLVE_JOB, "job" },
1757 { SOLVER_REASON_UPDATE_INSTALLED, "update" },
1758 { SOLVER_REASON_CLEANDEPS_ERASE, "cleandeps" },
1759 { SOLVER_REASON_RESOLVE, "resolve" },
1760 { SOLVER_REASON_WEAKDEP, "weakdep" },
1761 { SOLVER_REASON_RESOLVE_ORPHAN, "orphan" },
1763 { SOLVER_REASON_RECOMMENDED, "recommended" },
1764 { SOLVER_REASON_SUPPLEMENTED, "supplemented" },
1769 testcase_reason2str(Id reason)
1772 for (i = 0; reason2str[i].str; i++)
1773 if (reason == reason2str[i].reason)
1774 return reason2str[i].str;
1778 static struct rclass2str {
1782 { SOLVER_RULE_PKG, "pkg" },
1783 { SOLVER_RULE_UPDATE, "update" },
1784 { SOLVER_RULE_FEATURE, "feature" },
1785 { SOLVER_RULE_JOB, "job" },
1786 { SOLVER_RULE_DISTUPGRADE, "distupgrade" },
1787 { SOLVER_RULE_INFARCH, "infarch" },
1788 { SOLVER_RULE_CHOICE, "choice" },
1789 { SOLVER_RULE_LEARNT, "learnt" },
1790 { SOLVER_RULE_BEST, "best" },
1791 { SOLVER_RULE_YUMOBS, "yumobs" },
1796 testcase_rclass2str(Id rclass)
1799 for (i = 0; rclass2str[i].str; i++)
1800 if (rclass == rclass2str[i].rclass)
1801 return rclass2str[i].str;
1806 dump_genid(Pool *pool, Strqueue *sq, Id id, int cnt)
1814 Reldep *rd = GETRELDEP(pool, id);
1815 for (op = oplist; op->flags; op++)
1816 if (rd->flags == op->flags)
1818 cnt = dump_genid(pool, sq, rd->name, cnt);
1819 cnt = dump_genid(pool, sq, rd->evr, cnt);
1820 sprintf(cntbuf, "genid %2d: genid ", cnt++);
1821 s = pool_tmpjoin(pool, cntbuf, "op ", op->flags ? op->opname : "unknown");
1825 sprintf(cntbuf, "genid %2d: genid ", cnt++);
1826 s = pool_tmpjoin(pool, cntbuf, id ? "lit " : "null", id ? pool_id2str(pool, id) : 0);
1828 strqueue_push(sq, s);
1833 testcase_solverresult(Solver *solv, int resultflags)
1835 Pool *pool = solv->pool;
1843 if ((resultflags & TESTCASE_RESULT_TRANSACTION) != 0)
1845 Transaction *trans = solver_create_transaction(solv);
1849 for (i = 0; class2str[i].str; i++)
1852 transaction_classify_pkgs(trans, SOLVER_TRANSACTION_KEEP_PSEUDO, class2str[i].class, 0, 0, &q);
1853 for (j = 0; j < q.count; j++)
1857 if (pool->installed && pool->solvables[p].repo == pool->installed)
1858 op = transaction_obs_pkg(trans, p);
1859 s = pool_tmpjoin(pool, class2str[i].str, " ", testcase_solvid2str(pool, p));
1861 s = pool_tmpjoin(pool, s, " ", testcase_solvid2str(pool, op));
1862 strqueue_push(&sq, s);
1866 transaction_free(trans);
1868 if ((resultflags & TESTCASE_RESULT_PROBLEMS) != 0)
1870 char *probprefix, *solprefix;
1871 int problem, solution, element;
1874 pcnt = solver_problem_count(solv);
1875 for (problem = 1; problem <= pcnt; problem++)
1877 Id rid, from, to, dep;
1878 SolverRuleinfo rinfo;
1879 rid = solver_findproblemrule(solv, problem);
1880 s = testcase_problemid(solv, problem);
1881 probprefix = solv_dupjoin("problem ", s, 0);
1882 rinfo = solver_ruleinfo(solv, rid, &from, &to, &dep);
1883 s = pool_tmpjoin(pool, probprefix, " info ", solver_problemruleinfo2str(solv, rinfo, from, to, dep));
1884 strqueue_push(&sq, s);
1885 scnt = solver_solution_count(solv, problem);
1886 for (solution = 1; solution <= scnt; solution++)
1888 s = testcase_solutionid(solv, problem, solution);
1889 solprefix = solv_dupjoin(probprefix, " solution ", s);
1891 while ((element = solver_next_solutionelement(solv, problem, solution, element, &p, &op)) != 0)
1893 if (p == SOLVER_SOLUTION_JOB)
1894 s = pool_tmpjoin(pool, solprefix, " deljob ", testcase_job2str(pool, solv->job.elements[op - 1], solv->job.elements[op]));
1895 else if (p > 0 && op == 0)
1896 s = pool_tmpjoin(pool, solprefix, " erase ", testcase_solvid2str(pool, p));
1897 else if (p > 0 && op > 0)
1899 s = pool_tmpjoin(pool, solprefix, " replace ", testcase_solvid2str(pool, p));
1900 s = pool_tmpappend(pool, s, " ", testcase_solvid2str(pool, op));
1902 else if (p < 0 && op > 0)
1903 s = pool_tmpjoin(pool, solprefix, " allow ", testcase_solvid2str(pool, op));
1905 s = pool_tmpjoin(pool, solprefix, " unknown", 0);
1906 strqueue_push(&sq, s);
1908 solv_free(solprefix);
1910 solv_free(probprefix);
1914 if ((resultflags & TESTCASE_RESULT_ORPHANED) != 0)
1919 solver_get_orphaned(solv, &q);
1920 for (i = 0; i < q.count; i++)
1922 s = pool_tmpjoin(pool, "orphaned ", testcase_solvid2str(pool, q.elements[i]), 0);
1923 strqueue_push(&sq, s);
1928 if ((resultflags & TESTCASE_RESULT_RECOMMENDED) != 0)
1934 solver_get_recommendations(solv, &qr, &qs, 0);
1935 for (i = 0; i < qr.count; i++)
1937 s = pool_tmpjoin(pool, "recommended ", testcase_solvid2str(pool, qr.elements[i]), 0);
1938 strqueue_push(&sq, s);
1940 for (i = 0; i < qs.count; i++)
1942 s = pool_tmpjoin(pool, "suggested ", testcase_solvid2str(pool, qs.elements[i]), 0);
1943 strqueue_push(&sq, s);
1949 if ((resultflags & TESTCASE_RESULT_UNNEEDED) != 0)
1955 solver_get_unneeded(solv, &q, 0);
1956 solver_get_unneeded(solv, &qf, 1);
1957 for (i = j = 0; i < q.count; i++)
1959 /* we rely on qf containing a subset of q in the same order */
1960 if (j < qf.count && q.elements[i] == qf.elements[j])
1962 s = pool_tmpjoin(pool, "unneeded_filtered ", testcase_solvid2str(pool, q.elements[i]), 0);
1966 s = pool_tmpjoin(pool, "unneeded ", testcase_solvid2str(pool, q.elements[i]), 0);
1967 strqueue_push(&sq, s);
1972 if ((resultflags & TESTCASE_RESULT_ALTERNATIVES) != 0)
1980 cnt = solver_alternatives_count(solv);
1981 for (alternative = 1; alternative <= cnt; alternative++)
1983 Id id, from, chosen;
1985 int type = solver_get_alternative(solv, alternative, &id, &from, &chosen, &q, 0);
1986 altprefix = solv_dupjoin("alternative ", testcase_alternativeid(solv, type, id, from), " ");
1988 if (type == SOLVER_ALTERNATIVE_TYPE_RECOMMENDS)
1990 char *s = pool_tmpjoin(pool, altprefix, num, testcase_solvid2str(pool, from));
1991 s = pool_tmpappend(pool, s, " recommends ", testcase_dep2str(pool, id));
1992 strqueue_push(&sq, s);
1994 else if (type == SOLVER_ALTERNATIVE_TYPE_RULE)
1996 /* map choice rules back to pkg rules */
1997 if (solver_ruleclass(solv, id) == SOLVER_RULE_CHOICE)
1998 id = solver_rule2pkgrule(solv, id);
1999 solver_allruleinfos(solv, id, &rq);
2000 for (i = 0; i < rq.count; i += 4)
2002 int rtype = rq.elements[i];
2003 if ((rtype & SOLVER_RULE_TYPEMASK) == SOLVER_RULE_JOB)
2005 const char *js = testcase_job2str(pool, rq.elements[i + 2], rq.elements[i + 3]);
2006 char *s = pool_tmpjoin(pool, altprefix, num, " job ");
2007 s = pool_tmpappend(pool, s, js, 0);
2008 strqueue_push(&sq, s);
2010 else if (rtype == SOLVER_RULE_PKG_REQUIRES)
2012 char *s = pool_tmpjoin(pool, altprefix, num, testcase_solvid2str(pool, rq.elements[i + 1]));
2013 s = pool_tmpappend(pool, s, " requires ", testcase_dep2str(pool, rq.elements[i + 3]));
2014 strqueue_push(&sq, s);
2018 for (i = 0; i < q.count; i++)
2020 Id p = q.elements[i];
2022 num[0] = '0' + (i + 1) / 10;
2023 num[1] = '0' + (i + 1) % 10;
2025 s = pool_tmpjoin(pool, altprefix, num, "+ ");
2027 s = pool_tmpjoin(pool, altprefix, num, "- ");
2029 s = pool_tmpjoin(pool, altprefix, num, " ");
2030 s = pool_tmpappend(pool, s, testcase_solvid2str(pool, p < 0 ? -p : p), 0);
2031 strqueue_push(&sq, s);
2033 solv_free(altprefix);
2038 if ((resultflags & TESTCASE_RESULT_RULES) != 0)
2040 /* dump all rules */
2042 SolverRuleinfo rclass;
2047 for (rid = 1; (rclass = solver_ruleclass(solv, rid)) != SOLVER_RULE_UNKNOWN; rid++)
2049 char *prefix = solv_dupjoin("rule ", testcase_rclass2str(rclass), " ");
2050 prefix = solv_dupappend(prefix, testcase_ruleid(solv, rid), 0);
2051 solver_ruleliterals(solv, rid, &q);
2052 if (rclass == SOLVER_RULE_FEATURE && q.count == 1 && q.elements[0] == -SYSTEMSOLVABLE)
2054 for (i = 0; i < q.count; i++)
2056 Id p = q.elements[i];
2059 s = pool_tmpjoin(pool, prefix, " -", testcase_solvid2str(pool, -p));
2061 s = pool_tmpjoin(pool, prefix, " ", testcase_solvid2str(pool, p));
2062 strqueue_push(&sq, s);
2068 if ((resultflags & TESTCASE_RESULT_GENID) != 0)
2070 for (i = 0 ; i < solv->job.count; i += 2)
2073 if (solv->job.elements[i] != (SOLVER_NOOP | SOLVER_SOLVABLE_PROVIDES))
2075 id = solv->job.elements[i + 1];
2076 s = testcase_dep2str(pool, id);
2077 strqueue_push(&sq, pool_tmpjoin(pool, "genid dep ", s, 0));
2078 if ((id2 = testcase_str2dep(pool, s)) != id)
2080 s = pool_tmpjoin(pool, "genid roundtrip error: ", testcase_dep2str(pool, id2), 0);
2081 strqueue_push(&sq, s);
2083 dump_genid(pool, &sq, id, 1);
2086 if ((resultflags & TESTCASE_RESULT_REASON) != 0)
2090 FOR_POOL_SOLVABLES(p)
2093 int reason = solver_describe_decision(solv, p, &info);
2094 if (reason == SOLVER_REASON_UNRELATED)
2096 if (reason == SOLVER_REASON_WEAKDEP)
2098 solver_describe_weakdep_decision(solv, p, &whyq);
2101 for (i = 0; i < whyq.count; i += 3)
2103 reason = whyq.elements[i];
2104 p2 = whyq.elements[i + 1];
2105 id = whyq.elements[i + 2];
2106 s = pool_tmpjoin(pool, "reason ", testcase_solvid2str(pool, p), 0);
2107 s = pool_tmpappend(pool, s, " ", testcase_reason2str(reason));
2108 s = pool_tmpappend(pool, s, " ", testcase_dep2str(pool, id));
2110 s = pool_tmpappend(pool, s, " ", testcase_solvid2str(pool, p2));
2111 strqueue_push(&sq, s);
2116 s = pool_tmpjoin(pool, "reason ", testcase_solvid2str(pool, p), 0);
2117 s = pool_tmpappend(pool, s, " ", testcase_reason2str(reason));
2119 s = pool_tmpappend(pool, s, " ", testcase_ruleid(solv, info));
2120 strqueue_push(&sq, s);
2125 result = strqueue_join(&sq);
2132 testcase_write_mangled(Solver *solv, const char *dir, int resultflags, const char *testcasename, const char *resultname)
2134 Pool *pool = solv->pool;
2145 testcasename = "testcase.t";
2147 resultname = "solver.result";
2149 if (mkdir(dir, 0777) && errno != EEXIST)
2151 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: could not create directory '%s'\n", dir);
2155 FOR_REPOS(repoid, repo)
2157 const char *name = testcase_repoid2str(pool, repoid);
2159 if (repo->subpriority)
2160 sprintf(priobuf, "%d.%d", repo->priority, repo->subpriority);
2162 sprintf(priobuf, "%d", repo->priority);
2163 out = pool_tmpjoin(pool, name, ".repo", ".gz");
2164 for (i = 0; out[i]; i++)
2167 cmd = pool_tmpjoin(pool, "repo ", name, " ");
2168 cmd = pool_tmpappend(pool, cmd, priobuf, " ");
2169 cmd = pool_tmpappend(pool, cmd, "testtags ", out);
2170 strqueue_push(&sq, cmd);
2171 out = pool_tmpjoin(pool, dir, "/", out);
2172 if (!(fp = solv_xfopen(out, "w")))
2174 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: could not open '%s' for writing\n", out);
2178 testcase_write_testtags(repo, fp);
2181 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: write error\n");
2186 /* hmm, this is not optimal... we currently search for the lowest score */
2188 arch = pool->solvables[SYSTEMSOLVABLE].arch;
2189 for (i = 0; i < pool->lastarch; i++)
2191 if (pool->id2arch[i] == 1 && !lowscore)
2193 if (pool->id2arch[i] > 0x10000 && (!lowscore || pool->id2arch[i] < lowscore))
2196 lowscore = pool->id2arch[i];
2199 cmd = pool_tmpjoin(pool, "system ", pool->lastarch ? pool_id2str(pool, arch) : "unset", 0);
2200 for (i = 0; disttype2str[i].str != 0; i++)
2201 if (pool->disttype == disttype2str[i].type)
2203 pool_tmpappend(pool, cmd, " ", disttype2str[i].str ? disttype2str[i].str : "unknown");
2204 if (pool->installed)
2205 cmd = pool_tmpappend(pool, cmd, " ", testcase_repoid2str(pool, pool->installed->repoid));
2206 strqueue_push(&sq, cmd);
2207 s = testcase_getpoolflags(solv->pool);
2210 cmd = pool_tmpjoin(pool, "poolflags ", s, 0);
2211 strqueue_push(&sq, cmd);
2214 if (pool->vendorclasses)
2217 for (i = 0; pool->vendorclasses[i]; i++)
2219 cmd = pool_tmpappend(pool, cmd ? cmd : "vendorclass", " ", pool->vendorclasses[i]);
2220 if (!pool->vendorclasses[i + 1])
2222 strqueue_push(&sq, cmd);
2229 /* dump disabled packages (must come before the namespace/job lines) */
2230 if (pool->considered)
2233 FOR_POOL_SOLVABLES(p)
2234 if (!MAPTST(pool->considered, p))
2236 cmd = pool_tmpjoin(pool, "disable pkg ", testcase_solvid2str(pool, p), 0);
2237 strqueue_push(&sq, cmd);
2241 s = testcase_getsolverflags(solv);
2244 cmd = pool_tmpjoin(pool, "solverflags ", s, 0);
2245 strqueue_push(&sq, cmd);
2248 /* now dump all the ns callback values we know */
2249 if (pool->nscallback)
2253 for (rid = 1; rid < pool->nrels; rid++)
2255 Reldep *rd = pool->rels + rid;
2256 if (rd->flags != REL_NAMESPACE || rd->name == NAMESPACE_OTHERPROVIDERS)
2258 /* evaluate all namespace ids, skip empty results */
2259 d = pool_whatprovides(pool, MAKERELDEP(rid));
2260 if (!d || !pool->whatprovidesdata[d])
2262 cmd = pool_tmpjoin(pool, "namespace ", pool_id2str(pool, rd->name), "(");
2263 cmd = pool_tmpappend(pool, cmd, pool_id2str(pool, rd->evr), ")");
2264 for (; pool->whatprovidesdata[d]; d++)
2265 cmd = pool_tmpappend(pool, cmd, " ", testcase_solvid2str(pool, pool->whatprovidesdata[d]));
2266 strqueue_push(&sq, cmd);
2270 for (i = 0; i < solv->job.count; i += 2)
2272 cmd = (char *)testcase_job2str(pool, solv->job.elements[i], solv->job.elements[i + 1]);
2273 cmd = pool_tmpjoin(pool, "job ", cmd, 0);
2274 strqueue_push(&sq, cmd);
2277 if ((resultflags & ~TESTCASE_RESULT_REUSE_SOLVER) != 0)
2281 for (i = 0; resultflags2str[i].str; i++)
2282 if ((resultflags & resultflags2str[i].flag) != 0)
2283 cmd = pool_tmpappend(pool, cmd, cmd ? "," : 0, resultflags2str[i].str);
2284 cmd = pool_tmpjoin(pool, "result ", cmd ? cmd : "?", 0);
2285 cmd = pool_tmpappend(pool, cmd, " ", resultname);
2286 strqueue_push(&sq, cmd);
2287 result = testcase_solverresult(solv, resultflags);
2288 if (!strcmp(resultname, "<inline>"))
2292 strqueue_init(&rsq);
2293 strqueue_split(&rsq, result);
2294 for (i = 0; i < rsq.nstr; i++)
2296 cmd = pool_tmpjoin(pool, "#>", rsq.str[i], 0);
2297 strqueue_push(&sq, cmd);
2299 strqueue_free(&rsq);
2303 out = pool_tmpjoin(pool, dir, "/", resultname);
2304 if (!(fp = fopen(out, "w")))
2306 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: could not open '%s' for writing\n", out);
2311 if (result && *result && fwrite(result, strlen(result), 1, fp) != 1)
2313 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: write error\n");
2321 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: write error\n");
2329 cmd = strqueue_join(&sq);
2330 out = pool_tmpjoin(pool, dir, "/", testcasename);
2331 if (!(fp = fopen(out, "w")))
2333 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: could not open '%s' for writing\n", out);
2337 if (*cmd && fwrite(cmd, strlen(cmd), 1, fp) != 1)
2339 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: write error\n");
2346 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: write error\n");
2356 testcase_write(Solver *solv, const char *dir, int resultflags, const char *testcasename, const char *resultname)
2358 Pool *pool = solv->pool;
2361 const char **orignames;
2363 /* mangle repo names so that there are no conflicts */
2364 orignames = solv_calloc(pool->nrepos, sizeof(char *));
2365 for (repoid = 1; repoid < pool->nrepos; repoid++)
2367 Repo *repo = pool_id2repo(pool, repoid);
2368 char *buf = solv_malloc((repo->name ? strlen(repo->name) : 0) + 40);
2370 orignames[repoid] = repo->name;
2371 if (!repo->name || !repo->name[0])
2372 sprintf(buf, "#%d", repoid);
2374 strcpy(buf, repo->name);
2375 for (i = 0; buf[i]; i++)
2376 if (buf[i] == ' ' || buf[i] == '\t' || buf[i] == '/')
2378 mp = buf + strlen(buf);
2381 for (i = 1; i < repoid; i++)
2382 if (!strcmp(buf, pool_id2repo(pool, i)->name))
2386 sprintf(mp, "_%d", mangle++);
2390 r = testcase_write_mangled(solv, dir, resultflags, testcasename, resultname);
2391 for (repoid = 1; repoid < pool->nrepos; repoid++)
2393 Repo *repo = pool_id2repo(pool, repoid);
2394 solv_free((void *)repo->name);
2395 repo->name = orignames[repoid];
2397 solv_free(orignames);
2402 read_inline_file(FILE *fp, char **bufp, char **bufpp, int *buflp)
2404 char *result = solv_malloc(1024);
2411 if (rp - result + 256 >= resultl)
2413 resultl = rp - result;
2414 result = solv_realloc(result, resultl + 1024);
2415 rp = result + resultl;
2418 if (!fgets(rp, resultl - (rp - result), fp))
2421 if (rl && (rp == result || rp[-1] == '\n'))
2423 if (rl > 1 && rp[0] == '#' && rp[1] == '>')
2425 memmove(rp, rp + 2, rl - 2);
2430 while (rl + 16 > *buflp)
2432 *bufp = solv_realloc(*bufp, *buflp + 512);
2435 memmove(*bufp, rp, rl);
2436 if ((*bufp)[rl - 1] == '\n')
2442 (*bufpp) = *bufp + rl;
2459 char *result = solv_malloc(1024);
2466 if (rp - result + 256 >= resultl)
2468 resultl = rp - result;
2469 result = solv_realloc(result, resultl + 1024);
2470 rp = result + resultl;
2473 rl = fread(rp, 1, resultl - (rp - result), fp);
2485 str2resultflags(Pool *pool, char *s) /* modifies the string! */
2487 int i, resultflags = 0;
2490 char *se = strchr(s, ',');
2493 for (i = 0; resultflags2str[i].str; i++)
2494 if (!strcmp(s, resultflags2str[i].str))
2496 resultflags |= resultflags2str[i].flag;
2499 if (!resultflags2str[i].str)
2500 pool_debug(pool, SOLV_ERROR, "result: unknown flag '%s'\n", s);
2507 testcase_read(Pool *pool, FILE *fp, const char *testcase, Queue *job, char **resultp, int *resultflagsp)
2512 char *testcasedir, *s;
2518 int poolflagsreset = 0;
2519 int missing_features = 0;
2528 if (!fp && !(fp = fopen(testcase, "r")))
2530 pool_debug(pool, SOLV_ERROR, "testcase_read: could not open '%s'\n", testcase);
2533 testcasedir = solv_strdup(testcase);
2534 if ((s = strrchr(testcasedir, '/')) != 0)
2539 buf = solv_malloc(bufl);
2542 queue_init(&autoinstq);
2545 if (bufp - buf + 16 > bufl)
2548 buf = solv_realloc(buf, bufl + 512);
2552 if (!fgets(bufp, bufl - (bufp - buf), fp))
2556 if (!l || buf[l - 1] != '\n')
2563 while (*s && (*s == ' ' || *s == '\t'))
2565 if (!*s || *s == '#')
2568 /* split it in pieces */
2571 while (*s == ' ' || *s == '\t')
2575 pieces = solv_extend(pieces, npieces, 1, sizeof(*pieces), 7);
2576 pieces[npieces++] = s;
2577 while (*s && *s != ' ' && *s != '\t')
2582 pieces = solv_extend(pieces, npieces, 1, sizeof(*pieces), 7);
2583 pieces[npieces] = 0;
2584 if (!strcmp(pieces[0], "repo") && npieces >= 4)
2586 Repo *repo = repo_create(pool, pieces[1]);
2592 if (!poolflagsreset)
2595 testcase_resetpoolflags(pool); /* hmm */
2597 if (sscanf(pieces[2], "%d.%d", &prio, &subprio) != 2)
2600 prio = atoi(pieces[2]);
2602 repo->priority = prio;
2603 repo->subpriority = subprio;
2604 if (strcmp(pieces[3], "empty") != 0)
2606 const char *repotype = pool_tmpjoin(pool, pieces[3], 0, 0); /* gets overwritten in <inline> case */
2607 if (!strcmp(pieces[4], "<inline>"))
2609 char *idata = read_inline_file(fp, &buf, &bufp, &bufl);
2611 rfp = solv_xfopen_buf(rdata, &idata, 0, "rf");
2615 rdata = pool_tmpjoin(pool, testcasedir, pieces[4], 0);
2616 rfp = solv_xfopen(rdata, "r");
2620 pool_debug(pool, SOLV_ERROR, "testcase_read: could not open '%s'\n", rdata);
2622 else if (!strcmp(repotype, "testtags"))
2624 testcase_add_testtags(repo, rfp, 0);
2627 else if (!strcmp(repotype, "solv"))
2629 repo_add_solv(repo, rfp, 0);
2632 #if ENABLE_TESTCASE_HELIXREPO
2633 else if (!strcmp(repotype, "helix"))
2635 repo_add_helix(repo, rfp, 0);
2642 pool_debug(pool, SOLV_ERROR, "testcase_read: unknown repo type for repo '%s'\n", repo->name);
2646 else if (!strcmp(pieces[0], "system") && npieces >= 3)
2650 /* must set the disttype before the arch */
2652 if (strcmp(pieces[2], "*") != 0)
2654 char *dp = pieces[2];
2657 char *dpe = strchr(dp, ',');
2660 for (i = 0; disttype2str[i].str != 0; i++)
2661 if (!strcmp(disttype2str[i].str, dp))
2665 if (disttype2str[i].str)
2667 #ifdef MULTI_SEMANTICS
2668 if (pool->disttype != disttype2str[i].type)
2669 pool_setdisttype(pool, disttype2str[i].type);
2671 if (pool->disttype == disttype2str[i].type)
2678 pool_debug(pool, SOLV_ERROR, "testcase_read: system: could not change disttype to '%s'\n", pieces[2]);
2679 missing_features = 1;
2682 if (strcmp(pieces[1], "unset") == 0)
2683 pool_setarch(pool, 0);
2684 else if (pieces[1][0] == ':')
2685 pool_setarchpolicy(pool, pieces[1] + 1);
2687 pool_setarch(pool, pieces[1]);
2690 Repo *repo = testcase_str2repo(pool, pieces[3]);
2692 pool_debug(pool, SOLV_ERROR, "testcase_read: system: unknown repo '%s'\n", pieces[3]);
2694 pool_set_installed(pool, repo);
2697 else if (!strcmp(pieces[0], "job") && npieces > 1)
2703 pool_addfileprovides(pool);
2704 pool_createwhatprovides(pool);
2707 if (npieces >= 3 && !strcmp(pieces[2], "selection"))
2709 addselectionjob(pool, pieces + 1, npieces - 1, job);
2713 for (sp = pieces[1]; sp < pieces[npieces - 1]; sp++)
2716 how = testcase_str2job(pool, pieces[1], &what);
2717 if (how >= 0 && job)
2718 queue_push2(job, how, what);
2720 else if (!strcmp(pieces[0], "vendorclass") && npieces > 1)
2722 pool_addvendorclass(pool, (const char **)(pieces + 1));
2724 else if (!strcmp(pieces[0], "namespace") && npieces > 1)
2726 int i = strlen(pieces[1]);
2727 s = strchr(pieces[1], '(');
2728 if (!s && pieces[1][i - 1] != ')')
2730 pool_debug(pool, SOLV_ERROR, "testcase_read: bad namespace '%s'\n", pieces[1]);
2738 pieces[1][i - 1] = 0;
2739 name = pool_str2id(pool, pieces[1], 1);
2740 evr = pool_str2id(pool, s + 1, 1);
2742 pieces[1][i - 1] = ')';
2743 id = pool_rel2id(pool, name, evr, REL_NAMESPACE, 1);
2744 for (i = 2; i < npieces; i++)
2745 queue_push(&q, testcase_str2solvid(pool, pieces[i]));
2746 /* now do the callback */
2749 pool_addfileprovides(pool);
2750 pool_createwhatprovides(pool);
2753 pool->whatprovides_rel[GETRELID(id)] = pool_queuetowhatprovides(pool, &q);
2757 else if (!strcmp(pieces[0], "poolflags"))
2760 if (!poolflagsreset)
2763 testcase_resetpoolflags(pool); /* hmm */
2765 for (i = 1; i < npieces; i++)
2766 testcase_setpoolflags(pool, pieces[i]);
2768 else if (!strcmp(pieces[0], "solverflags") && npieces > 1)
2773 solv = solver_create(pool);
2774 testcase_resetsolverflags(solv);
2776 for (i = 1; i < npieces; i++)
2777 testcase_setsolverflags(solv, pieces[i]);
2779 else if (!strcmp(pieces[0], "result") && npieces > 1)
2782 int resultflags = str2resultflags(pool, pieces[1]);
2786 rdata = pool_tmpjoin(pool, testcasedir, pieces[2], 0);
2787 if (!strcmp(pieces[2], "<inline>"))
2788 result = read_inline_file(fp, &buf, &bufp, &bufl);
2791 FILE *rfp = fopen(rdata, "r");
2793 pool_debug(pool, SOLV_ERROR, "testcase_read: could not open '%s'\n", rdata);
2796 result = read_file(rfp);
2806 *resultflagsp = resultflags;
2808 else if (!strcmp(pieces[0], "nextjob"))
2810 if (npieces == 2 && resultflagsp && !strcmp(pieces[1], "reusesolver"))
2811 *resultflagsp |= TESTCASE_RESULT_REUSE_SOLVER;
2814 else if (!strcmp(pieces[0], "disable") && npieces == 3)
2817 if (strcmp(pieces[1], "pkg"))
2819 pool_debug(pool, SOLV_ERROR, "testcase_read: bad disable type '%s'\n", pieces[1]);
2823 pool_createwhatprovides(pool);
2825 if (!pool->considered)
2827 pool->considered = solv_calloc(1, sizeof(Map));
2828 map_init(pool->considered, pool->nsolvables);
2829 map_setall(pool->considered);
2831 p = testcase_str2solvid(pool, pieces[2]);
2833 MAPCLR(pool->considered, p);
2835 pool_debug(pool, SOLV_ERROR, "disable: unknown package '%s'\n", pieces[2]);
2837 else if (!strcmp(pieces[0], "feature"))
2840 for (i = 1; i < npieces; i++)
2842 for (j = 0; features[j]; j++)
2843 if (!strcmp(pieces[i], features[j]))
2847 pool_debug(pool, SOLV_ERROR, "testcase_read: missing feature '%s'\n", pieces[i]);
2851 if (missing_features)
2854 else if (!strcmp(pieces[0], "genid") && npieces > 1)
2861 for (sp = pieces[2]; sp < pieces[npieces - 1]; sp++)
2865 genid = solv_extend(genid, ngenid, 1, sizeof(*genid), 7);
2866 if (!strcmp(pieces[1], "op") && npieces > 2)
2869 for (op = oplist; op->flags; op++)
2870 if (!strncmp(pieces[2], op->opname, strlen(op->opname)))
2874 pool_debug(pool, SOLV_ERROR, "testcase_read: genid: unknown op '%s'\n", pieces[2]);
2879 pool_debug(pool, SOLV_ERROR, "testcase_read: genid: out of stack\n");
2883 id = pool_rel2id(pool, genid[ngenid] , genid[ngenid + 1], op->flags, 1);
2885 else if (!strcmp(pieces[1], "lit"))
2886 id = pool_str2id(pool, npieces > 2 ? pieces[2] : "", 1);
2887 else if (!strcmp(pieces[1], "null"))
2889 else if (!strcmp(pieces[1], "dep"))
2890 id = testcase_str2dep(pool, pieces[2]);
2893 pool_debug(pool, SOLV_ERROR, "testcase_read: genid: unknown command '%s'\n", pieces[1]);
2896 genid[ngenid++] = id;
2898 else if (!strcmp(pieces[0], "autoinst") && npieces > 2)
2900 if (strcmp(pieces[1], "name"))
2902 pool_debug(pool, SOLV_ERROR, "testcase_read: autoinst: illegal mode\n");
2905 queue_push(&autoinstq, pool_str2id(pool, pieces[2], 1));
2909 pool_debug(pool, SOLV_ERROR, "testcase_read: cannot parse command '%s'\n", pieces[0]);
2912 while (job && ngenid > 0)
2913 queue_push2(job, SOLVER_NOOP | SOLVER_SOLVABLE_PROVIDES, genid[--ngenid]);
2914 if (autoinstq.count)
2915 pool_add_userinstalled_jobs(pool, &autoinstq, job, GET_USERINSTALLED_NAMES | GET_USERINSTALLED_INVERTED);
2916 queue_free(&autoinstq);
2917 genid = solv_free(genid);
2918 buf = solv_free(buf);
2919 pieces = solv_free(pieces);
2920 solv_free(testcasedir);
2923 pool_addfileprovides(pool);
2924 pool_createwhatprovides(pool);
2928 solv = solver_create(pool);
2929 testcase_resetsolverflags(solv);
2933 if (missing_features)
2938 *resultflagsp = 77; /* hack for testsolv */
2944 testcase_resultdiff(const char *result1, const char *result2)
2946 Strqueue sq1, sq2, osq;
2948 strqueue_init(&sq1);
2949 strqueue_init(&sq2);
2950 strqueue_init(&osq);
2951 strqueue_split(&sq1, result1);
2952 strqueue_split(&sq2, result2);
2953 strqueue_sort(&sq1);
2954 strqueue_sort(&sq2);
2955 strqueue_diff(&sq1, &sq2, &osq);
2956 r = osq.nstr ? strqueue_join(&osq) : 0;
2957 strqueue_free(&sq1);
2958 strqueue_free(&sq2);
2959 strqueue_free(&osq);