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_NAMESPACE , "<NAMESPACE>" },
388 { REL_MULTIARCH, "<MULTIARCH>" },
389 { REL_FILECONFLICT, "<FILECONFLICT>" },
390 { REL_COND, "<IF>" },
391 { REL_COMPAT, "compat >=" },
392 { REL_KIND, "<KIND>" },
393 { REL_ELSE, "<ELSE>" },
394 { REL_ERROR, "<ERROR>" },
400 testcase_dep2str_complex(Pool *pool, char *s, Id id, int addparens)
409 s2 = testcase_id2str(pool, id, 1);
410 s = pool_tmpappend(pool, s, s2, 0);
411 pool_freetmpspace(pool, s2);
414 rd = GETRELDEP(pool, id);
416 /* check for special shortcuts */
417 if (rd->flags == REL_NAMESPACE && !ISRELDEP(rd->name) && !strncmp(pool_id2str(pool, rd->name), "namespace:", 10))
419 s = pool_tmpappend(pool, s, pool_id2str(pool, rd->name), "(");
420 s = testcase_dep2str_complex(pool, s, rd->evr, 0);
421 return pool_tmpappend(pool, s, ")", 0);
423 if (rd->flags == REL_MULTIARCH && !ISRELDEP(rd->name) && rd->evr == ARCH_ANY)
425 /* append special :any suffix */
426 s2 = testcase_id2str(pool, rd->name, 1);
427 s = pool_tmpappend(pool, s, s2, ":any");
428 pool_freetmpspace(pool, s2);
433 if (ISRELDEP(rd->name))
435 Reldep *rd2 = GETRELDEP(pool, rd->name);
437 if (rd->flags > 7 && rd->flags != REL_COMPAT && rd2->flags && rd2->flags <= 7)
442 s = pool_tmpappend(pool, s, "(", 0);
443 s = testcase_dep2str_complex(pool, s, rd->name, needparens);
445 for (op = oplist; op->flags; op++)
446 if (rd->flags == op->flags)
450 s = pool_tmpappend(pool, s, " ", op->opname);
451 s = pool_tmpappend(pool, s, " ", 0);
456 sprintf(buf, " <%u> ", rd->flags);
457 s = pool_tmpappend(pool, s, buf, 0);
461 if (ISRELDEP(rd->evr))
463 Reldep *rd2 = GETRELDEP(pool, rd->evr);
465 if (rd->flags > 7 && rd2->flags && rd2->flags <= 7)
467 if (rd->flags == REL_AND && rd2->flags == REL_AND)
468 needparens = 0; /* chain */
469 if (rd->flags == REL_OR && rd2->flags == REL_OR)
470 needparens = 0; /* chain */
471 if (rd->flags > 0 && rd->flags < 8 && rd2->flags == REL_COMPAT)
472 needparens = 0; /* chain */
474 if (!ISRELDEP(rd->evr))
476 s2 = testcase_id2str(pool, rd->evr, 0);
477 s = pool_tmpappend(pool, s, s2, 0);
478 pool_freetmpspace(pool, s2);
481 s = (char *)testcase_dep2str_complex(pool, s, rd->evr, needparens);
483 s = pool_tmpappend(pool, s, ")", 0);
488 testcase_dep2str(Pool *pool, Id id)
492 return testcase_id2str(pool, id, 1);
493 s = pool_alloctmpspace(pool, 1);
495 return testcase_dep2str_complex(pool, s, id, 0);
499 /* Convert a simple string. Also handle the :any suffix */
501 testcase_str2dep_simple(Pool *pool, const char **sp, int isname)
508 for (s = *sp; *s; s++)
512 if (*s == ' ' || *(unsigned char *)s < 32)
516 if (*s == ')' && paren-- <= 0)
519 if (isname && s - *sp > 4 && !strncmp(s - 4, ":any", 4))
526 if (s - *sp == 6 && !strncmp(*sp, "<NULL>", 6))
529 id = pool_strn2id(pool, *sp, s - *sp, 1);
531 else if (s - *sp == 3 && !strncmp(*sp, "\\00", 3))
535 char buf[128], *bp, *bp2;
537 bp = s - *sp >= 128 ? solv_malloc(s - *sp + 1) : buf;
538 for (bp2 = bp, sp2 = *sp; sp2 < s;)
542 solv_hex2bin(&sp2, (unsigned char *)bp2 - 1, 1);
545 id = pool_str2id(pool, bp, 1);
551 id = pool_rel2id(pool, id, ARCH_ANY, REL_MULTIARCH, 1);
560 testcase_str2dep_complex(Pool *pool, const char **sp, int relop)
563 Id flags, id, id2, namespaceid = 0;
566 while (*s == ' ' || *s == '\t')
568 if (!strncmp(s, "namespace:", 10))
570 /* special namespace hack */
572 for (s2 = s + 10; *s2 && *s2 != '('; s2++)
576 namespaceid = pool_strn2id(pool, s, s2 - s, 1);
583 id = testcase_str2dep_complex(pool, &s, 0);
592 id = testcase_str2dep_simple(pool, &s, relop ? 0 : 1);
594 id = pool_rel2id(pool, namespaceid, id, REL_NAMESPACE, 1);
598 while (*s == ' ' || *s == '\t')
600 if (!*s || *s == ')' || (relop && strncmp(s, "compat >= ", 10) != 0))
606 /* we have an op! Find the end */
608 if (s[0] == '<' && (s[1] >= '0' && s[1] <= '9'))
611 for (s2 = s + 1; *s2 >= '0' && *s2 <= '9'; s2++)
615 flags = strtoul(s + 1, 0, 10);
621 for (op = oplist; op->flags; op++)
622 if (!strncmp(s, op->opname, strlen(op->opname)))
630 s += strlen(op->opname);
632 id2 = testcase_str2dep_complex(pool, &s, flags > 0 && flags < 8);
638 id = pool_rel2id(pool, id, id2, flags, 1);
643 testcase_str2dep(Pool *pool, const char *s)
645 Id id = testcase_str2dep_complex(pool, &s, 0);
646 return s && !*s ? id : 0;
649 /**********************************************************/
652 testcase_repoid2str(Pool *pool, Id repoid)
654 Repo *repo = pool_id2repo(pool, repoid);
657 char *r = pool_tmpjoin(pool, repo->name, 0, 0);
659 for (rp = r; *rp; rp++)
660 if (*rp == ' ' || *rp == '\t')
667 sprintf(buf, "#%d", repoid);
668 return pool_tmpjoin(pool, buf, 0, 0);
673 testcase_solvid2str(Pool *pool, Id p)
675 Solvable *s = pool->solvables + p;
676 const char *n, *e, *a;
679 if (p == SYSTEMSOLVABLE)
681 n = pool_id2str(pool, s->name);
682 e = pool_id2str(pool, s->evr);
683 a = pool_id2str(pool, s->arch);
684 str = pool_alloctmpspace(pool, strlen(n) + strlen(e) + strlen(a) + 3);
685 sprintf(str, "%s-%s.%s", n, e, a);
687 return pool_tmpappend(pool, str, "@", 0);
691 char *str2 = pool_tmpappend(pool, str, "@", s->repo->name);
693 if (str2[l] == ' ' || str2[l] == '\t')
697 sprintf(buf, "@#%d", s->repo->repoid);
698 return pool_tmpappend(pool, str, buf, 0);
702 testcase_str2repo(Pool *pool, const char *str)
706 if (str[0] == '#' && (str[1] >= '0' && str[1] <= '9'))
710 for (j = 1; str[j] >= '0' && str[j] <= '9'; j++)
711 repoid = repoid * 10 + (str[j] - '0');
712 if (!str[j] && repoid > 0 && repoid < pool->nrepos)
713 repo = pool_id2repo(pool, repoid);
717 FOR_REPOS(repoid, repo)
722 l = strlen(repo->name);
723 for (i = 0; i < l; i++)
725 int c = repo->name[i];
726 if (c == ' ' || c == '\t')
731 if (i == l && !str[l])
734 if (repoid >= pool->nrepos)
741 testcase_str2solvid(Pool *pool, const char *str)
743 int i, l = strlen(str);
750 if (*str == '@' && !strcmp(str, "@SYSTEM"))
751 return SYSTEMSOLVABLE;
753 for (i = l - 1; i >= 0; i--)
754 if (str[i] == '@' && (repo = testcase_str2repo(pool, str + i + 1)) != 0)
759 /* now find the arch (if present) */
761 for (i = repostart - 1; i > 0; i--)
764 arch = pool_strn2id(pool, str + i + 1, repostart - (i + 1), 0);
769 /* now find the name */
770 for (i = repostart - 1; i > 0; i--)
774 Id nid, evrid, p, pp;
775 nid = pool_strn2id(pool, str, i, 0);
778 evrid = pool_strn2id(pool, str + i + 1, repostart - (i + 1), 0);
781 /* first check whatprovides */
782 FOR_PROVIDES(p, pp, nid)
784 Solvable *s = pool->solvables + p;
785 if (s->name != nid || s->evr != evrid)
787 if (repo && s->repo != repo)
789 if (arch && s->arch != arch)
793 /* maybe it's not installable and thus not in whatprovides. do a slow search */
797 FOR_REPO_SOLVABLES(repo, p, s)
799 if (s->name != nid || s->evr != evrid)
801 if (arch && s->arch != arch)
808 FOR_POOL_SOLVABLES(p)
810 Solvable *s = pool->solvables + p;
811 if (s->name != nid || s->evr != evrid)
813 if (arch && s->arch != arch)
824 testcase_job2str(Pool *pool, Id how, Id what)
831 Id select = how & SOLVER_SELECTMASK;
833 for (i = 0; job2str[i].str; i++)
834 if ((how & SOLVER_JOBMASK) == job2str[i].job)
836 jobstr = job2str[i].str ? job2str[i].str : "unknown";
837 if (select == SOLVER_SOLVABLE)
840 pkgstr = testcase_solvid2str(pool, what);
842 else if (select == SOLVER_SOLVABLE_NAME)
845 pkgstr = testcase_dep2str(pool, what);
847 else if (select == SOLVER_SOLVABLE_PROVIDES)
849 selstr = " provides ";
850 pkgstr = testcase_dep2str(pool, what);
852 else if (select == SOLVER_SOLVABLE_ONE_OF)
857 while ((p = pool->whatprovidesdata[what++]) != 0)
859 const char *s = testcase_solvid2str(pool, p);
862 pkgstr = pool_tmpappend(pool, pkgstr, " ", s);
863 pool_freetmpspace(pool, s);
871 else if (select == SOLVER_SOLVABLE_REPO)
873 Repo *repo = pool_id2repo(pool, what);
878 sprintf(buf, "#%d", repo->repoid);
879 pkgstr = pool_tmpjoin(pool, buf, 0, 0);
882 pkgstr = pool_tmpjoin(pool, repo->name, 0, 0);
884 else if (select == SOLVER_SOLVABLE_ALL)
891 selstr = " unknown ";
894 ret = pool_tmpjoin(pool, jobstr, selstr, pkgstr);
896 ret = pool_tmpappend(pool, ret, " ", 0);
897 for (i = 0; jobflags2str[i].str; i++)
898 if ((how & jobflags2str[i].flag) != 0)
899 ret = pool_tmpappend(pool, ret, ",", jobflags2str[i].str);
905 ret = pool_tmpappend(pool, ret, "]", 0);
911 str2selflags(Pool *pool, char *s) /* modifies the string! */
916 char *se = strchr(s, ',');
919 for (i = 0; selflags2str[i].str; i++)
920 if (!strcmp(s, selflags2str[i].str))
922 selflags |= selflags2str[i].flag;
925 if (!selflags2str[i].str)
926 pool_debug(pool, SOLV_ERROR, "str2job: unknown selection flag '%s'\n", s);
933 str2jobflags(Pool *pool, char *s) /* modifies the string */
938 char *se = strchr(s, ',');
941 for (i = 0; jobflags2str[i].str; i++)
942 if (!strcmp(s, jobflags2str[i].str))
944 jobflags |= jobflags2str[i].flag;
947 if (!jobflags2str[i].str)
948 pool_debug(pool, SOLV_ERROR, "str2job: unknown job flag '%s'\n", s);
955 testcase_str2job(Pool *pool, const char *str, Id *whatp)
965 /* so we can patch it */
966 s = pool_tmpjoin(pool, str, 0, 0);
967 /* split it in pieces */
970 while (*s == ' ' || *s == '\t')
974 pieces = solv_extend(pieces, npieces, 1, sizeof(*pieces), 7);
975 pieces[npieces++] = s;
976 while (*s && *s != ' ' && *s != '\t')
983 pool_debug(pool, SOLV_ERROR, "str2job: bad line '%s'\n", str);
988 for (i = 0; job2str[i].str; i++)
989 if (!strcmp(pieces[0], job2str[i].str))
993 pool_debug(pool, SOLV_ERROR, "str2job: unknown job '%s'\n", str);
997 job = job2str[i].job;
1001 char *flags = pieces[npieces - 1];
1002 if (*flags == '[' && flags[strlen(flags) - 1] == ']')
1006 flags[strlen(flags) - 1] = 0;
1007 job |= str2jobflags(pool, flags);
1010 if (!strcmp(pieces[1], "pkg"))
1014 pool_debug(pool, SOLV_ERROR, "str2job: bad pkg selector in '%s'\n", str);
1018 job |= SOLVER_SOLVABLE;
1019 what = testcase_str2solvid(pool, pieces[2]);
1022 pool_debug(pool, SOLV_ERROR, "str2job: unknown package '%s'\n", pieces[2]);
1027 else if (!strcmp(pieces[1], "name") || !strcmp(pieces[1], "provides"))
1029 /* join em again for dep2str... */
1031 for (sp = pieces[2]; sp < pieces[npieces - 1]; sp++)
1035 if (pieces[1][0] == 'p' && strncmp(pieces[2], "namespace:", 10) == 0)
1037 char *spe = strchr(pieces[2], '(');
1038 int l = strlen(pieces[2]);
1039 if (spe && pieces[2][l - 1] == ')')
1041 /* special namespace provides */
1042 if (strcmp(spe, "(<NULL>)") != 0)
1044 pieces[2][l - 1] = 0;
1045 what = testcase_str2dep(pool, spe + 1);
1046 pieces[2][l - 1] = ')';
1048 what = pool_rel2id(pool, pool_strn2id(pool, pieces[2], spe - pieces[2], 1), what, REL_NAMESPACE, 1);
1052 what = testcase_str2dep(pool, pieces[2]);
1053 if (pieces[1][0] == 'n')
1054 job |= SOLVER_SOLVABLE_NAME;
1056 job |= SOLVER_SOLVABLE_PROVIDES;
1058 else if (!strcmp(pieces[1], "oneof"))
1061 job |= SOLVER_SOLVABLE_ONE_OF;
1063 if (npieces > 3 && strcmp(pieces[2], "nothing") != 0)
1065 for (i = 2; i < npieces; i++)
1067 Id p = testcase_str2solvid(pool, pieces[i]);
1070 pool_debug(pool, SOLV_ERROR, "str2job: unknown package '%s'\n", pieces[i]);
1078 what = pool_queuetowhatprovides(pool, &q);
1081 else if (!strcmp(pieces[1], "repo"))
1086 pool_debug(pool, SOLV_ERROR, "str2job: bad line '%s'\n", str);
1090 repo = testcase_str2repo(pool, pieces[2]);
1093 pool_debug(pool, SOLV_ERROR, "str2job: unknown repo '%s'\n", pieces[2]);
1097 job |= SOLVER_SOLVABLE_REPO;
1098 what = repo->repoid;
1100 else if (!strcmp(pieces[1], "all"))
1102 if (npieces != 3 && strcmp(pieces[2], "packages") != 0)
1104 pool_debug(pool, SOLV_ERROR, "str2job: bad line '%s'\n", str);
1108 job |= SOLVER_SOLVABLE_ALL;
1113 pool_debug(pool, SOLV_ERROR, "str2job: unknown selection in '%s'\n", str);
1123 addselectionjob(Pool *pool, char **pieces, int npieces, Queue *jobqueue)
1130 for (i = 0; job2str[i].str; i++)
1131 if (!strcmp(pieces[0], job2str[i].str))
1133 if (!job2str[i].str)
1135 pool_debug(pool, SOLV_ERROR, "selstr2job: unknown job '%s'\n", 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);
1152 pool_debug(pool, SOLV_ERROR, "selstr2job: no selection flags\n");
1155 selflags = str2selflags(pool, pieces[3]);
1157 r = selection_make(pool, &sel, pieces[2], selflags);
1158 for (i = 0; i < sel.count; i += 2)
1159 queue_push2(jobqueue, job | sel.elements[i], sel.elements[i + 1]);
1165 writedeps(Repo *repo, FILE *fp, const char *tag, Id key, Solvable *s, Offset off)
1167 Pool *pool = repo->pool;
1174 dp = repo->idarraydata + off;
1175 while ((id = *dp++) != 0)
1177 if (key == SOLVABLE_REQUIRES && id == SOLVABLE_PREREQMARKER)
1180 fprintf(fp, "-%s\n", tag);
1185 if (key == SOLVABLE_PROVIDES && id == SOLVABLE_FILEMARKER)
1187 idstr = testcase_dep2str(pool, id);
1190 fprintf(fp, "+%s\n", tag);
1193 fprintf(fp, "%s\n", idstr);
1196 fprintf(fp, "-%s\n", tag);
1200 writefilelist(Repo *repo, FILE *fp, const char *tag, Solvable *s)
1202 Pool *pool = repo->pool;
1206 dataiterator_init(&di, pool, repo, s - pool->solvables, SOLVABLE_FILELIST, 0, 0);
1207 while (dataiterator_step(&di))
1209 const char *s = repodata_dir2str(di.data, di.kv.id, di.kv.str);
1212 fprintf(fp, "+%s\n", tag);
1215 fprintf(fp, "%s\n", s);
1218 fprintf(fp, "-%s\n", tag);
1219 dataiterator_free(&di);
1223 testcase_write_testtags(Repo *repo, FILE *fp)
1225 Pool *pool = repo->pool;
1231 const char *release;
1236 fprintf(fp, "=Ver: 3.0\n");
1238 FOR_REPO_SOLVABLES(repo, p, s)
1240 name = pool_id2str(pool, s->name);
1241 evr = pool_id2str(pool, s->evr);
1242 arch = pool_id2str(pool, s->arch);
1243 release = strrchr(evr, '-');
1245 release = evr + strlen(evr);
1246 fprintf(fp, "=Pkg: %s %.*s %s %s\n", name, (int)(release - evr), evr, *release && release[1] ? release + 1 : "-", arch);
1247 tmp = solvable_lookup_str(s, SOLVABLE_SUMMARY);
1249 fprintf(fp, "=Sum: %s\n", tmp);
1250 writedeps(repo, fp, "Req:", SOLVABLE_REQUIRES, s, s->requires);
1251 writedeps(repo, fp, "Prv:", SOLVABLE_PROVIDES, s, s->provides);
1252 writedeps(repo, fp, "Obs:", SOLVABLE_OBSOLETES, s, s->obsoletes);
1253 writedeps(repo, fp, "Con:", SOLVABLE_CONFLICTS, s, s->conflicts);
1254 writedeps(repo, fp, "Rec:", SOLVABLE_RECOMMENDS, s, s->recommends);
1255 writedeps(repo, fp, "Sup:", SOLVABLE_SUPPLEMENTS, s, s->supplements);
1256 writedeps(repo, fp, "Sug:", SOLVABLE_SUGGESTS, s, s->suggests);
1257 writedeps(repo, fp, "Enh:", SOLVABLE_ENHANCES, s, s->enhances);
1258 if (solvable_lookup_idarray(s, SOLVABLE_PREREQ_IGNOREINST, &q))
1261 fprintf(fp, "+Ipr:\n");
1262 for (i = 0; i < q.count; i++)
1263 fprintf(fp, "%s\n", testcase_dep2str(pool, q.elements[i]));
1264 fprintf(fp, "-Ipr:\n");
1267 fprintf(fp, "=Vnd: %s\n", pool_id2str(pool, s->vendor));
1268 ti = solvable_lookup_num(s, SOLVABLE_BUILDTIME, 0);
1270 fprintf(fp, "=Tim: %u\n", ti);
1271 writefilelist(repo, fp, "Fls:", s);
1277 static inline Offset
1278 adddep(Repo *repo, Offset olddeps, char *str, Id marker)
1280 Id id = *str == '/' ? pool_str2id(repo->pool, str, 1) : testcase_str2dep(repo->pool, str);
1281 return repo_addid_dep(repo, olddeps, id, marker);
1285 finish_v2_solvable(Pool *pool, Repodata *data, Solvable *s, char *filelist, int nfilelist)
1291 for (l = 0; l < nfilelist; l += strlen(filelist + l) + 1)
1293 char *p = strrchr(filelist + l, '/');
1297 did = repodata_str2dir(data, filelist + l, 1);
1300 did = repodata_str2dir(data, "/", 1);
1301 repodata_add_dirstr(data, s - pool->solvables, SOLVABLE_FILELIST, did, p);
1304 repo_rewrite_suse_deps(s, 0);
1307 /* stripped down version of susetags parser used for testcases */
1309 testcase_add_testtags(Repo *repo, FILE *fp, int flags)
1311 Pool *pool = repo->pool;
1323 int tagsversion = 0;
1324 int addselfprovides = 1; /* for compat reasons */
1326 data = repo_add_repodata(repo, flags);
1331 line = solv_malloc(aline);
1335 if (linep - line + 16 > aline)
1337 aline = linep - line;
1338 line = solv_realloc(line, aline + 512);
1339 linep = line + aline;
1342 if (!fgets(linep, aline - (linep - line), fp))
1344 linep += strlen(linep);
1345 if (linep == line || linep[-1] != '\n')
1348 linep = line + intag;
1351 if (line[intag] == '-' && !strncmp(line + 1, line + intag + 1, intag - 2))
1358 else if (line[0] == '+' && line[1] && line[1] != ':')
1360 char *tagend = strchr(line, ':');
1365 intag = tagend + 2 - line;
1366 linep = line + intag;
1369 if (*line != '=' || !line[1] || !line[2] || !line[3] || line[4] != ':')
1371 tag = line[1] << 16 | line[2] << 8 | line[3];
1374 case 'V' << 16 | 'e' << 8 | 'r':
1375 tagsversion = atoi(line + 6);
1376 addselfprovides = tagsversion < 3 || strstr(line + 6, "addselfprovides") != 0;
1378 case 'P' << 16 | 'k' << 8 | 'g':
1381 if (tagsversion == 2)
1382 finish_v2_solvable(pool, data, s, filelist, nfilelist);
1383 if (addselfprovides && s->name && s->arch != ARCH_SRC && s->arch != ARCH_NOSRC)
1384 s->provides = repo_addid_dep(s->repo, s->provides, pool_rel2id(pool, s->name, s->evr, REL_EQ, 1), 0);
1387 if (split(line + 5, sp, 5) != 4)
1389 s = pool_id2solvable(pool, repo_add_solvable(repo));
1390 s->name = pool_str2id(pool, sp[0], 1);
1391 /* join back version and release */
1392 if (sp[2] && !(sp[2][0] == '-' && !sp[2][1]))
1394 s->evr = makeevr(pool, sp[1]);
1395 s->arch = pool_str2id(pool, sp[3], 1);
1397 case 'S' << 16 | 'u' << 8 | 'm':
1398 repodata_set_str(data, s - pool->solvables, SOLVABLE_SUMMARY, line + 6);
1400 case 'V' << 16 | 'n' << 8 | 'd':
1401 s->vendor = pool_str2id(pool, line + 6, 1);
1403 case 'T' << 16 | 'i' << 8 | 'm':
1406 repodata_set_num(data, s - pool->solvables, SOLVABLE_BUILDTIME, t);
1408 case 'R' << 16 | 'e' << 8 | 'q':
1409 s->requires = adddep(repo, s->requires, line + 6, -SOLVABLE_PREREQMARKER);
1411 case 'P' << 16 | 'r' << 8 | 'q':
1412 s->requires = adddep(repo, s->requires, line + 6, SOLVABLE_PREREQMARKER);
1414 case 'P' << 16 | 'r' << 8 | 'v':
1415 /* version 2 had the file list at the end of the provides */
1416 if (tagsversion == 2)
1420 int l = strlen(line + 6) + 1;
1421 if (nfilelist + l > afilelist)
1423 afilelist = nfilelist + l + 512;
1424 filelist = solv_realloc(filelist, afilelist);
1426 memcpy(filelist + nfilelist, line + 6, l);
1433 for (l = 0; l < nfilelist; l += strlen(filelist + l) + 1)
1434 s->provides = repo_addid_dep(repo, s->provides, pool_str2id(pool, filelist + l, 1), 0);
1438 s->provides = adddep(repo, s->provides, line + 6, 0);
1440 case 'F' << 16 | 'l' << 8 | 's':
1442 char *p = strrchr(line + 6, '/');
1447 did = repodata_str2dir(data, line + 6, 1);
1449 did = repodata_str2dir(data, "/", 1);
1450 repodata_add_dirstr(data, s - pool->solvables, SOLVABLE_FILELIST, did, p);
1453 case 'O' << 16 | 'b' << 8 | 's':
1454 s->obsoletes = adddep(repo, s->obsoletes, line + 6, 0);
1456 case 'C' << 16 | 'o' << 8 | 'n':
1457 s->conflicts = adddep(repo, s->conflicts, line + 6, 0);
1459 case 'R' << 16 | 'e' << 8 | 'c':
1460 s->recommends = adddep(repo, s->recommends, line + 6, 0);
1462 case 'S' << 16 | 'u' << 8 | 'p':
1463 s->supplements = adddep(repo, s->supplements, line + 6, 0);
1465 case 'S' << 16 | 'u' << 8 | 'g':
1466 s->suggests = adddep(repo, s->suggests, line + 6, 0);
1468 case 'E' << 16 | 'n' << 8 | 'h':
1469 s->enhances = adddep(repo, s->enhances, line + 6, 0);
1471 case 'I' << 16 | 'p' << 8 | 'r':
1473 Id id = line[6] == '/' ? pool_str2id(pool, line + 6, 1) : testcase_str2dep(pool, line + 6);
1474 repodata_add_idarray(data, s - pool->solvables, SOLVABLE_PREREQ_IGNOREINST, id);
1483 if (tagsversion == 2)
1484 finish_v2_solvable(pool, data, s, filelist, nfilelist);
1485 if (addselfprovides && s->name && s->arch != ARCH_SRC && s->arch != ARCH_NOSRC)
1486 s->provides = repo_addid_dep(s->repo, s->provides, pool_rel2id(pool, s->name, s->evr, REL_EQ, 1), 0);
1489 solv_free(filelist);
1490 repodata_free_dircache(data);
1491 if (!(flags & REPO_NO_INTERNALIZE))
1492 repodata_internalize(data);
1497 testcase_getpoolflags(Pool *pool)
1499 const char *str = 0;
1501 for (i = 0; poolflags2str[i].str; i++)
1503 v = pool_get_flag(pool, poolflags2str[i].flag);
1504 if (v == poolflags2str[i].def)
1506 str = pool_tmpappend(pool, str, v ? " " : " !", poolflags2str[i].str);
1508 return str ? str + 1 : "";
1512 testcase_setpoolflags(Pool *pool, const char *str)
1514 const char *p = str, *s;
1518 while (*p == ' ' || *p == '\t' || *p == ',')
1529 while (*p && *p != ' ' && *p != '\t' && *p != ',')
1531 for (i = 0; poolflags2str[i].str; i++)
1532 if (!strncmp(poolflags2str[i].str, s, p - s) && poolflags2str[i].str[p - s] == 0)
1534 if (!poolflags2str[i].str)
1536 pool_debug(pool, SOLV_ERROR, "setpoolflags: unknown flag '%.*s'\n", (int)(p - s), s);
1539 pool_set_flag(pool, poolflags2str[i].flag, v);
1545 testcase_resetpoolflags(Pool *pool)
1548 for (i = 0; poolflags2str[i].str; i++)
1549 pool_set_flag(pool, poolflags2str[i].flag, poolflags2str[i].def);
1553 testcase_getsolverflags(Solver *solv)
1555 Pool *pool = solv->pool;
1556 const char *str = 0;
1558 for (i = 0; solverflags2str[i].str; i++)
1560 v = solver_get_flag(solv, solverflags2str[i].flag);
1561 if (v == solverflags2str[i].def)
1563 str = pool_tmpappend(pool, str, v ? " " : " !", solverflags2str[i].str);
1565 return str ? str + 1 : "";
1569 testcase_setsolverflags(Solver *solv, const char *str)
1571 const char *p = str, *s;
1575 while (*p == ' ' || *p == '\t' || *p == ',')
1586 while (*p && *p != ' ' && *p != '\t' && *p != ',')
1588 for (i = 0; solverflags2str[i].str; i++)
1589 if (!strncmp(solverflags2str[i].str, s, p - s) && solverflags2str[i].str[p - s] == 0)
1591 if (!solverflags2str[i].str)
1593 pool_debug(solv->pool, SOLV_ERROR, "setsolverflags: unknown flag '%.*s'\n", (int)(p - s), s);
1596 if (solver_set_flag(solv, solverflags2str[i].flag, v) == -1)
1598 pool_debug(solv->pool, SOLV_ERROR, "setsolverflags: unsupported flag '%s'\n", solverflags2str[i].str);
1606 testcase_resetsolverflags(Solver *solv)
1609 for (i = 0; solverflags2str[i].str; i++)
1610 solver_set_flag(solv, solverflags2str[i].flag, solverflags2str[i].def);
1614 testcase_ruleid(Solver *solv, Id rid)
1620 const unsigned char *md5;
1626 solver_ruleliterals(solv, rid, &q);
1627 for (i = 0; i < q.count; i++)
1629 Id p = q.elements[i];
1630 s = testcase_solvid2str(solv->pool, p > 0 ? p : -p);
1632 s = pool_tmpjoin(solv->pool, "!", s, 0);
1633 strqueue_push(&sq, s);
1636 strqueue_sort_u(&sq);
1637 chk = solv_chksum_create(REPOKEY_TYPE_MD5);
1638 for (i = 0; i < sq.nstr; i++)
1639 solv_chksum_add(chk, sq.str[i], strlen(sq.str[i]) + 1);
1640 md5 = solv_chksum_get(chk, &md5l);
1641 s = pool_bin2hex(solv->pool, md5, md5l);
1642 chk = solv_chksum_free(chk, 0);
1648 testcase_problemid(Solver *solv, Id problem)
1653 const unsigned char *md5;
1657 /* we build a hash of all rules that define the problem */
1660 solver_findallproblemrules(solv, problem, &q);
1661 for (i = 0; i < q.count; i++)
1662 strqueue_push(&sq, testcase_ruleid(solv, q.elements[i]));
1664 strqueue_sort_u(&sq);
1665 chk = solv_chksum_create(REPOKEY_TYPE_MD5);
1666 for (i = 0; i < sq.nstr; i++)
1667 solv_chksum_add(chk, sq.str[i], strlen(sq.str[i]) + 1);
1668 md5 = solv_chksum_get(chk, &md5l);
1669 s = pool_bin2hex(solv->pool, md5, 4);
1670 chk = solv_chksum_free(chk, 0);
1676 testcase_solutionid(Solver *solv, Id problem, Id solution)
1680 const unsigned char *md5;
1684 intid = solver_solutionelement_internalid(solv, problem, solution);
1685 /* internal stuff! handle with care! */
1689 s = testcase_job2str(solv->pool, solv->job.elements[-intid - 1], solv->job.elements[-intid]);
1694 s = testcase_ruleid(solv, intid);
1696 chk = solv_chksum_create(REPOKEY_TYPE_MD5);
1697 solv_chksum_add(chk, s, strlen(s) + 1);
1698 md5 = solv_chksum_get(chk, &md5l);
1699 s = pool_bin2hex(solv->pool, md5, 4);
1700 chk = solv_chksum_free(chk, 0);
1705 testcase_alternativeid(Solver *solv, int type, Id id, Id from)
1708 Pool *pool = solv->pool;
1710 const unsigned char *md5;
1712 chk = solv_chksum_create(REPOKEY_TYPE_MD5);
1713 if (type == SOLVER_ALTERNATIVE_TYPE_RECOMMENDS)
1715 s = testcase_solvid2str(pool, from);
1716 solv_chksum_add(chk, s, strlen(s) + 1);
1717 s = testcase_dep2str(pool, id);
1718 solv_chksum_add(chk, s, strlen(s) + 1);
1720 else if (type == SOLVER_ALTERNATIVE_TYPE_RULE)
1722 s = testcase_ruleid(solv, id);
1723 solv_chksum_add(chk, s, strlen(s) + 1);
1725 md5 = solv_chksum_get(chk, &md5l);
1726 s = pool_bin2hex(pool, md5, 4);
1727 chk = solv_chksum_free(chk, 0);
1731 static struct class2str {
1735 { SOLVER_TRANSACTION_ERASE, "erase" },
1736 { SOLVER_TRANSACTION_INSTALL, "install" },
1737 { SOLVER_TRANSACTION_REINSTALLED, "reinstall" },
1738 { SOLVER_TRANSACTION_DOWNGRADED, "downgrade" },
1739 { SOLVER_TRANSACTION_CHANGED, "change" },
1740 { SOLVER_TRANSACTION_UPGRADED, "upgrade" },
1741 { SOLVER_TRANSACTION_OBSOLETED, "obsolete" },
1742 { SOLVER_TRANSACTION_MULTIINSTALL, "multiinstall" },
1743 { SOLVER_TRANSACTION_MULTIREINSTALL, "multireinstall" },
1747 static struct reason2str {
1751 { SOLVER_REASON_UNRELATED, "unrelated" },
1752 { SOLVER_REASON_UNIT_RULE, "unit" },
1753 { SOLVER_REASON_KEEP_INSTALLED, "keep" },
1754 { SOLVER_REASON_RESOLVE_JOB, "job" },
1755 { SOLVER_REASON_UPDATE_INSTALLED, "update" },
1756 { SOLVER_REASON_CLEANDEPS_ERASE, "cleandeps" },
1757 { SOLVER_REASON_RESOLVE, "resolve" },
1758 { SOLVER_REASON_WEAKDEP, "weakdep" },
1759 { SOLVER_REASON_RESOLVE_ORPHAN, "orphan" },
1761 { SOLVER_REASON_RECOMMENDED, "recommended" },
1762 { SOLVER_REASON_SUPPLEMENTED, "supplemented" },
1767 testcase_reason2str(Id reason)
1770 for (i = 0; reason2str[i].str; i++)
1771 if (reason == reason2str[i].reason)
1772 return reason2str[i].str;
1776 static struct rclass2str {
1780 { SOLVER_RULE_PKG, "pkg" },
1781 { SOLVER_RULE_UPDATE, "update" },
1782 { SOLVER_RULE_FEATURE, "feature" },
1783 { SOLVER_RULE_JOB, "job" },
1784 { SOLVER_RULE_DISTUPGRADE, "distupgrade" },
1785 { SOLVER_RULE_INFARCH, "infarch" },
1786 { SOLVER_RULE_CHOICE, "choice" },
1787 { SOLVER_RULE_LEARNT, "learnt" },
1788 { SOLVER_RULE_BEST, "best" },
1789 { SOLVER_RULE_YUMOBS, "yumobs" },
1794 testcase_rclass2str(Id rclass)
1797 for (i = 0; rclass2str[i].str; i++)
1798 if (rclass == rclass2str[i].rclass)
1799 return rclass2str[i].str;
1804 dump_genid(Pool *pool, Strqueue *sq, Id id, int cnt)
1812 Reldep *rd = GETRELDEP(pool, id);
1813 for (op = oplist; op->flags; op++)
1814 if (rd->flags == op->flags)
1816 cnt = dump_genid(pool, sq, rd->name, cnt);
1817 cnt = dump_genid(pool, sq, rd->evr, cnt);
1818 sprintf(cntbuf, "genid %2d: genid ", cnt++);
1819 s = pool_tmpjoin(pool, cntbuf, "op ", op->flags ? op->opname : "unknown");
1823 sprintf(cntbuf, "genid %2d: genid ", cnt++);
1824 s = pool_tmpjoin(pool, cntbuf, id ? "lit " : "null", id ? pool_id2str(pool, id) : 0);
1826 strqueue_push(sq, s);
1831 testcase_solverresult(Solver *solv, int resultflags)
1833 Pool *pool = solv->pool;
1841 if ((resultflags & TESTCASE_RESULT_TRANSACTION) != 0)
1843 Transaction *trans = solver_create_transaction(solv);
1847 for (i = 0; class2str[i].str; i++)
1850 transaction_classify_pkgs(trans, SOLVER_TRANSACTION_KEEP_PSEUDO, class2str[i].class, 0, 0, &q);
1851 for (j = 0; j < q.count; j++)
1855 if (pool->installed && pool->solvables[p].repo == pool->installed)
1856 op = transaction_obs_pkg(trans, p);
1857 s = pool_tmpjoin(pool, class2str[i].str, " ", testcase_solvid2str(pool, p));
1859 s = pool_tmpjoin(pool, s, " ", testcase_solvid2str(pool, op));
1860 strqueue_push(&sq, s);
1864 transaction_free(trans);
1866 if ((resultflags & TESTCASE_RESULT_PROBLEMS) != 0)
1868 char *probprefix, *solprefix;
1869 int problem, solution, element;
1872 pcnt = solver_problem_count(solv);
1873 for (problem = 1; problem <= pcnt; problem++)
1875 Id rid, from, to, dep;
1876 SolverRuleinfo rinfo;
1877 rid = solver_findproblemrule(solv, problem);
1878 s = testcase_problemid(solv, problem);
1879 probprefix = solv_dupjoin("problem ", s, 0);
1880 rinfo = solver_ruleinfo(solv, rid, &from, &to, &dep);
1881 s = pool_tmpjoin(pool, probprefix, " info ", solver_problemruleinfo2str(solv, rinfo, from, to, dep));
1882 strqueue_push(&sq, s);
1883 scnt = solver_solution_count(solv, problem);
1884 for (solution = 1; solution <= scnt; solution++)
1886 s = testcase_solutionid(solv, problem, solution);
1887 solprefix = solv_dupjoin(probprefix, " solution ", s);
1889 while ((element = solver_next_solutionelement(solv, problem, solution, element, &p, &op)) != 0)
1891 if (p == SOLVER_SOLUTION_JOB)
1892 s = pool_tmpjoin(pool, solprefix, " deljob ", testcase_job2str(pool, solv->job.elements[op - 1], solv->job.elements[op]));
1893 else if (p > 0 && op == 0)
1894 s = pool_tmpjoin(pool, solprefix, " erase ", testcase_solvid2str(pool, p));
1895 else if (p > 0 && op > 0)
1897 s = pool_tmpjoin(pool, solprefix, " replace ", testcase_solvid2str(pool, p));
1898 s = pool_tmpappend(pool, s, " ", testcase_solvid2str(pool, op));
1900 else if (p < 0 && op > 0)
1901 s = pool_tmpjoin(pool, solprefix, " allow ", testcase_solvid2str(pool, op));
1903 s = pool_tmpjoin(pool, solprefix, " unknown", 0);
1904 strqueue_push(&sq, s);
1906 solv_free(solprefix);
1908 solv_free(probprefix);
1912 if ((resultflags & TESTCASE_RESULT_ORPHANED) != 0)
1917 solver_get_orphaned(solv, &q);
1918 for (i = 0; i < q.count; i++)
1920 s = pool_tmpjoin(pool, "orphaned ", testcase_solvid2str(pool, q.elements[i]), 0);
1921 strqueue_push(&sq, s);
1926 if ((resultflags & TESTCASE_RESULT_RECOMMENDED) != 0)
1932 solver_get_recommendations(solv, &qr, &qs, 0);
1933 for (i = 0; i < qr.count; i++)
1935 s = pool_tmpjoin(pool, "recommended ", testcase_solvid2str(pool, qr.elements[i]), 0);
1936 strqueue_push(&sq, s);
1938 for (i = 0; i < qs.count; i++)
1940 s = pool_tmpjoin(pool, "suggested ", testcase_solvid2str(pool, qs.elements[i]), 0);
1941 strqueue_push(&sq, s);
1947 if ((resultflags & TESTCASE_RESULT_UNNEEDED) != 0)
1953 solver_get_unneeded(solv, &q, 0);
1954 solver_get_unneeded(solv, &qf, 1);
1955 for (i = j = 0; i < q.count; i++)
1957 /* we rely on qf containing a subset of q in the same order */
1958 if (j < qf.count && q.elements[i] == qf.elements[j])
1960 s = pool_tmpjoin(pool, "unneeded_filtered ", testcase_solvid2str(pool, q.elements[i]), 0);
1964 s = pool_tmpjoin(pool, "unneeded ", testcase_solvid2str(pool, q.elements[i]), 0);
1965 strqueue_push(&sq, s);
1970 if ((resultflags & TESTCASE_RESULT_ALTERNATIVES) != 0)
1978 cnt = solver_alternatives_count(solv);
1979 for (alternative = 1; alternative <= cnt; alternative++)
1981 Id id, from, chosen;
1983 int type = solver_get_alternative(solv, alternative, &id, &from, &chosen, &q, 0);
1984 altprefix = solv_dupjoin("alternative ", testcase_alternativeid(solv, type, id, from), " ");
1986 if (type == SOLVER_ALTERNATIVE_TYPE_RECOMMENDS)
1988 char *s = pool_tmpjoin(pool, altprefix, num, testcase_solvid2str(pool, from));
1989 s = pool_tmpappend(pool, s, " recommends ", testcase_dep2str(pool, id));
1990 strqueue_push(&sq, s);
1992 else if (type == SOLVER_ALTERNATIVE_TYPE_RULE)
1994 /* map choice rules back to pkg rules */
1995 if (solver_ruleclass(solv, id) == SOLVER_RULE_CHOICE)
1996 id = solver_rule2pkgrule(solv, id);
1997 solver_allruleinfos(solv, id, &rq);
1998 for (i = 0; i < rq.count; i += 4)
2000 int rtype = rq.elements[i];
2001 if ((rtype & SOLVER_RULE_TYPEMASK) == SOLVER_RULE_JOB)
2003 const char *js = testcase_job2str(pool, rq.elements[i + 2], rq.elements[i + 3]);
2004 char *s = pool_tmpjoin(pool, altprefix, num, " job ");
2005 s = pool_tmpappend(pool, s, js, 0);
2006 strqueue_push(&sq, s);
2008 else if (rtype == SOLVER_RULE_PKG_REQUIRES)
2010 char *s = pool_tmpjoin(pool, altprefix, num, testcase_solvid2str(pool, rq.elements[i + 1]));
2011 s = pool_tmpappend(pool, s, " requires ", testcase_dep2str(pool, rq.elements[i + 3]));
2012 strqueue_push(&sq, s);
2016 for (i = 0; i < q.count; i++)
2018 Id p = q.elements[i];
2020 num[0] = '0' + (i + 1) / 10;
2021 num[1] = '0' + (i + 1) % 10;
2023 s = pool_tmpjoin(pool, altprefix, num, "+ ");
2025 s = pool_tmpjoin(pool, altprefix, num, "- ");
2027 s = pool_tmpjoin(pool, altprefix, num, " ");
2028 s = pool_tmpappend(pool, s, testcase_solvid2str(pool, p < 0 ? -p : p), 0);
2029 strqueue_push(&sq, s);
2031 solv_free(altprefix);
2036 if ((resultflags & TESTCASE_RESULT_RULES) != 0)
2038 /* dump all rules */
2040 SolverRuleinfo rclass;
2045 for (rid = 1; (rclass = solver_ruleclass(solv, rid)) != SOLVER_RULE_UNKNOWN; rid++)
2047 char *prefix = solv_dupjoin("rule ", testcase_rclass2str(rclass), " ");
2048 prefix = solv_dupappend(prefix, testcase_ruleid(solv, rid), 0);
2049 solver_ruleliterals(solv, rid, &q);
2050 if (rclass == SOLVER_RULE_FEATURE && q.count == 1 && q.elements[0] == -SYSTEMSOLVABLE)
2052 for (i = 0; i < q.count; i++)
2054 Id p = q.elements[i];
2057 s = pool_tmpjoin(pool, prefix, " -", testcase_solvid2str(pool, -p));
2059 s = pool_tmpjoin(pool, prefix, " ", testcase_solvid2str(pool, p));
2060 strqueue_push(&sq, s);
2066 if ((resultflags & TESTCASE_RESULT_GENID) != 0)
2068 for (i = 0 ; i < solv->job.count; i += 2)
2071 if (solv->job.elements[i] != (SOLVER_NOOP | SOLVER_SOLVABLE_PROVIDES))
2073 id = solv->job.elements[i + 1];
2074 s = testcase_dep2str(pool, id);
2075 strqueue_push(&sq, pool_tmpjoin(pool, "genid dep ", s, 0));
2076 if ((id2 = testcase_str2dep(pool, s)) != id)
2078 s = pool_tmpjoin(pool, "genid roundtrip error: ", testcase_dep2str(pool, id2), 0);
2079 strqueue_push(&sq, s);
2081 dump_genid(pool, &sq, id, 1);
2084 if ((resultflags & TESTCASE_RESULT_REASON) != 0)
2088 FOR_POOL_SOLVABLES(p)
2091 int reason = solver_describe_decision(solv, p, &info);
2092 if (reason == SOLVER_REASON_UNRELATED)
2094 if (reason == SOLVER_REASON_WEAKDEP)
2096 solver_describe_weakdep_decision(solv, p, &whyq);
2099 for (i = 0; i < whyq.count; i += 3)
2101 reason = whyq.elements[i];
2102 p2 = whyq.elements[i + 1];
2103 id = whyq.elements[i + 2];
2104 s = pool_tmpjoin(pool, "reason ", testcase_solvid2str(pool, p), 0);
2105 s = pool_tmpappend(pool, s, " ", testcase_reason2str(reason));
2106 s = pool_tmpappend(pool, s, " ", testcase_dep2str(pool, id));
2108 s = pool_tmpappend(pool, s, " ", testcase_solvid2str(pool, p2));
2109 strqueue_push(&sq, s);
2114 s = pool_tmpjoin(pool, "reason ", testcase_solvid2str(pool, p), 0);
2115 s = pool_tmpappend(pool, s, " ", testcase_reason2str(reason));
2117 s = pool_tmpappend(pool, s, " ", testcase_ruleid(solv, info));
2118 strqueue_push(&sq, s);
2123 result = strqueue_join(&sq);
2130 testcase_write_mangled(Solver *solv, const char *dir, int resultflags, const char *testcasename, const char *resultname)
2132 Pool *pool = solv->pool;
2143 testcasename = "testcase.t";
2145 resultname = "solver.result";
2147 if (mkdir(dir, 0777) && errno != EEXIST)
2149 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: could not create directory '%s'\n", dir);
2153 FOR_REPOS(repoid, repo)
2155 const char *name = testcase_repoid2str(pool, repoid);
2157 if (repo->subpriority)
2158 sprintf(priobuf, "%d.%d", repo->priority, repo->subpriority);
2160 sprintf(priobuf, "%d", repo->priority);
2161 out = pool_tmpjoin(pool, name, ".repo", ".gz");
2162 for (i = 0; out[i]; i++)
2165 cmd = pool_tmpjoin(pool, "repo ", name, " ");
2166 cmd = pool_tmpappend(pool, cmd, priobuf, " ");
2167 cmd = pool_tmpappend(pool, cmd, "testtags ", out);
2168 strqueue_push(&sq, cmd);
2169 out = pool_tmpjoin(pool, dir, "/", out);
2170 if (!(fp = solv_xfopen(out, "w")))
2172 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: could not open '%s' for writing\n", out);
2176 testcase_write_testtags(repo, fp);
2179 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: write error\n");
2184 /* hmm, this is not optimal... we currently search for the lowest score */
2186 arch = pool->solvables[SYSTEMSOLVABLE].arch;
2187 for (i = 0; i < pool->lastarch; i++)
2189 if (pool->id2arch[i] == 1 && !lowscore)
2191 if (pool->id2arch[i] > 0x10000 && (!lowscore || pool->id2arch[i] < lowscore))
2194 lowscore = pool->id2arch[i];
2197 cmd = pool_tmpjoin(pool, "system ", pool->lastarch ? pool_id2str(pool, arch) : "unset", 0);
2198 for (i = 0; disttype2str[i].str != 0; i++)
2199 if (pool->disttype == disttype2str[i].type)
2201 pool_tmpappend(pool, cmd, " ", disttype2str[i].str ? disttype2str[i].str : "unknown");
2202 if (pool->installed)
2203 cmd = pool_tmpappend(pool, cmd, " ", testcase_repoid2str(pool, pool->installed->repoid));
2204 strqueue_push(&sq, cmd);
2205 s = testcase_getpoolflags(solv->pool);
2208 cmd = pool_tmpjoin(pool, "poolflags ", s, 0);
2209 strqueue_push(&sq, cmd);
2212 if (pool->vendorclasses)
2215 for (i = 0; pool->vendorclasses[i]; i++)
2217 cmd = pool_tmpappend(pool, cmd ? cmd : "vendorclass", " ", pool->vendorclasses[i]);
2218 if (!pool->vendorclasses[i + 1])
2220 strqueue_push(&sq, cmd);
2227 /* dump disabled packages (must come before the namespace/job lines) */
2228 if (pool->considered)
2231 FOR_POOL_SOLVABLES(p)
2232 if (!MAPTST(pool->considered, p))
2234 cmd = pool_tmpjoin(pool, "disable pkg ", testcase_solvid2str(pool, p), 0);
2235 strqueue_push(&sq, cmd);
2239 s = testcase_getsolverflags(solv);
2242 cmd = pool_tmpjoin(pool, "solverflags ", s, 0);
2243 strqueue_push(&sq, cmd);
2246 /* now dump all the ns callback values we know */
2247 if (pool->nscallback)
2251 for (rid = 1; rid < pool->nrels; rid++)
2253 Reldep *rd = pool->rels + rid;
2254 if (rd->flags != REL_NAMESPACE || rd->name == NAMESPACE_OTHERPROVIDERS)
2256 /* evaluate all namespace ids, skip empty results */
2257 d = pool_whatprovides(pool, MAKERELDEP(rid));
2258 if (!d || !pool->whatprovidesdata[d])
2260 cmd = pool_tmpjoin(pool, "namespace ", pool_id2str(pool, rd->name), "(");
2261 cmd = pool_tmpappend(pool, cmd, pool_id2str(pool, rd->evr), ")");
2262 for (; pool->whatprovidesdata[d]; d++)
2263 cmd = pool_tmpappend(pool, cmd, " ", testcase_solvid2str(pool, pool->whatprovidesdata[d]));
2264 strqueue_push(&sq, cmd);
2268 for (i = 0; i < solv->job.count; i += 2)
2270 cmd = (char *)testcase_job2str(pool, solv->job.elements[i], solv->job.elements[i + 1]);
2271 cmd = pool_tmpjoin(pool, "job ", cmd, 0);
2272 strqueue_push(&sq, cmd);
2275 if ((resultflags & ~TESTCASE_RESULT_REUSE_SOLVER) != 0)
2279 for (i = 0; resultflags2str[i].str; i++)
2280 if ((resultflags & resultflags2str[i].flag) != 0)
2281 cmd = pool_tmpappend(pool, cmd, cmd ? "," : 0, resultflags2str[i].str);
2282 cmd = pool_tmpjoin(pool, "result ", cmd ? cmd : "?", 0);
2283 cmd = pool_tmpappend(pool, cmd, " ", resultname);
2284 strqueue_push(&sq, cmd);
2285 result = testcase_solverresult(solv, resultflags);
2286 if (!strcmp(resultname, "<inline>"))
2290 strqueue_init(&rsq);
2291 strqueue_split(&rsq, result);
2292 for (i = 0; i < rsq.nstr; i++)
2294 cmd = pool_tmpjoin(pool, "#>", rsq.str[i], 0);
2295 strqueue_push(&sq, cmd);
2297 strqueue_free(&rsq);
2301 out = pool_tmpjoin(pool, dir, "/", resultname);
2302 if (!(fp = fopen(out, "w")))
2304 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: could not open '%s' for writing\n", out);
2309 if (result && *result && fwrite(result, strlen(result), 1, fp) != 1)
2311 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: write error\n");
2319 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: write error\n");
2327 cmd = strqueue_join(&sq);
2328 out = pool_tmpjoin(pool, dir, "/", testcasename);
2329 if (!(fp = fopen(out, "w")))
2331 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: could not open '%s' for writing\n", out);
2335 if (*cmd && fwrite(cmd, strlen(cmd), 1, fp) != 1)
2337 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: write error\n");
2344 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: write error\n");
2354 testcase_write(Solver *solv, const char *dir, int resultflags, const char *testcasename, const char *resultname)
2356 Pool *pool = solv->pool;
2359 const char **orignames;
2361 /* mangle repo names so that there are no conflicts */
2362 orignames = solv_calloc(pool->nrepos, sizeof(char *));
2363 for (repoid = 1; repoid < pool->nrepos; repoid++)
2365 Repo *repo = pool_id2repo(pool, repoid);
2366 char *buf = solv_malloc((repo->name ? strlen(repo->name) : 0) + 40);
2368 orignames[repoid] = repo->name;
2369 if (!repo->name || !repo->name[0])
2370 sprintf(buf, "#%d", repoid);
2372 strcpy(buf, repo->name);
2373 for (i = 0; buf[i]; i++)
2374 if (buf[i] == ' ' || buf[i] == '\t' || buf[i] == '/')
2376 mp = buf + strlen(buf);
2379 for (i = 1; i < repoid; i++)
2380 if (!strcmp(buf, pool_id2repo(pool, i)->name))
2384 sprintf(mp, "_%d", mangle++);
2388 r = testcase_write_mangled(solv, dir, resultflags, testcasename, resultname);
2389 for (repoid = 1; repoid < pool->nrepos; repoid++)
2391 Repo *repo = pool_id2repo(pool, repoid);
2392 solv_free((void *)repo->name);
2393 repo->name = orignames[repoid];
2395 solv_free(orignames);
2400 read_inline_file(FILE *fp, char **bufp, char **bufpp, int *buflp)
2402 char *result = solv_malloc(1024);
2409 if (rp - result + 256 >= resultl)
2411 resultl = rp - result;
2412 result = solv_realloc(result, resultl + 1024);
2413 rp = result + resultl;
2416 if (!fgets(rp, resultl - (rp - result), fp))
2419 if (rl && (rp == result || rp[-1] == '\n'))
2421 if (rl > 1 && rp[0] == '#' && rp[1] == '>')
2423 memmove(rp, rp + 2, rl - 2);
2428 while (rl + 16 > *buflp)
2430 *bufp = solv_realloc(*bufp, *buflp + 512);
2433 memmove(*bufp, rp, rl);
2434 if ((*bufp)[rl - 1] == '\n')
2440 (*bufpp) = *bufp + rl;
2457 char *result = solv_malloc(1024);
2464 if (rp - result + 256 >= resultl)
2466 resultl = rp - result;
2467 result = solv_realloc(result, resultl + 1024);
2468 rp = result + resultl;
2471 rl = fread(rp, 1, resultl - (rp - result), fp);
2483 str2resultflags(Pool *pool, char *s) /* modifies the string! */
2485 int i, resultflags = 0;
2488 char *se = strchr(s, ',');
2491 for (i = 0; resultflags2str[i].str; i++)
2492 if (!strcmp(s, resultflags2str[i].str))
2494 resultflags |= resultflags2str[i].flag;
2497 if (!resultflags2str[i].str)
2498 pool_debug(pool, SOLV_ERROR, "result: unknown flag '%s'\n", s);
2505 testcase_read(Pool *pool, FILE *fp, const char *testcase, Queue *job, char **resultp, int *resultflagsp)
2510 char *testcasedir, *s;
2516 int poolflagsreset = 0;
2517 int missing_features = 0;
2526 if (!fp && !(fp = fopen(testcase, "r")))
2528 pool_debug(pool, SOLV_ERROR, "testcase_read: could not open '%s'\n", testcase);
2531 testcasedir = solv_strdup(testcase);
2532 if ((s = strrchr(testcasedir, '/')) != 0)
2537 buf = solv_malloc(bufl);
2540 queue_init(&autoinstq);
2543 if (bufp - buf + 16 > bufl)
2546 buf = solv_realloc(buf, bufl + 512);
2550 if (!fgets(bufp, bufl - (bufp - buf), fp))
2554 if (!l || buf[l - 1] != '\n')
2561 while (*s && (*s == ' ' || *s == '\t'))
2563 if (!*s || *s == '#')
2566 /* split it in pieces */
2569 while (*s == ' ' || *s == '\t')
2573 pieces = solv_extend(pieces, npieces, 1, sizeof(*pieces), 7);
2574 pieces[npieces++] = s;
2575 while (*s && *s != ' ' && *s != '\t')
2580 pieces = solv_extend(pieces, npieces, 1, sizeof(*pieces), 7);
2581 pieces[npieces] = 0;
2582 if (!strcmp(pieces[0], "repo") && npieces >= 4)
2584 Repo *repo = repo_create(pool, pieces[1]);
2590 if (!poolflagsreset)
2593 testcase_resetpoolflags(pool); /* hmm */
2595 if (sscanf(pieces[2], "%d.%d", &prio, &subprio) != 2)
2598 prio = atoi(pieces[2]);
2600 repo->priority = prio;
2601 repo->subpriority = subprio;
2602 if (strcmp(pieces[3], "empty") != 0)
2604 const char *repotype = pool_tmpjoin(pool, pieces[3], 0, 0); /* gets overwritten in <inline> case */
2605 if (!strcmp(pieces[4], "<inline>"))
2607 char *idata = read_inline_file(fp, &buf, &bufp, &bufl);
2609 rfp = solv_xfopen_buf(rdata, &idata, 0, "rf");
2613 rdata = pool_tmpjoin(pool, testcasedir, pieces[4], 0);
2614 rfp = solv_xfopen(rdata, "r");
2618 pool_debug(pool, SOLV_ERROR, "testcase_read: could not open '%s'\n", rdata);
2620 else if (!strcmp(repotype, "testtags"))
2622 testcase_add_testtags(repo, rfp, 0);
2625 else if (!strcmp(repotype, "solv"))
2627 repo_add_solv(repo, rfp, 0);
2630 #if ENABLE_TESTCASE_HELIXREPO
2631 else if (!strcmp(repotype, "helix"))
2633 repo_add_helix(repo, rfp, 0);
2640 pool_debug(pool, SOLV_ERROR, "testcase_read: unknown repo type for repo '%s'\n", repo->name);
2644 else if (!strcmp(pieces[0], "system") && npieces >= 3)
2648 /* must set the disttype before the arch */
2650 if (strcmp(pieces[2], "*") != 0)
2652 char *dp = pieces[2];
2655 char *dpe = strchr(dp, ',');
2658 for (i = 0; disttype2str[i].str != 0; i++)
2659 if (!strcmp(disttype2str[i].str, dp))
2663 if (disttype2str[i].str)
2665 #ifdef MULTI_SEMANTICS
2666 if (pool->disttype != disttype2str[i].type)
2667 pool_setdisttype(pool, disttype2str[i].type);
2669 if (pool->disttype == disttype2str[i].type)
2676 pool_debug(pool, SOLV_ERROR, "testcase_read: system: could not change disttype to '%s'\n", pieces[2]);
2677 missing_features = 1;
2680 if (strcmp(pieces[1], "unset") == 0)
2681 pool_setarch(pool, 0);
2682 else if (pieces[1][0] == ':')
2683 pool_setarchpolicy(pool, pieces[1] + 1);
2685 pool_setarch(pool, pieces[1]);
2688 Repo *repo = testcase_str2repo(pool, pieces[3]);
2690 pool_debug(pool, SOLV_ERROR, "testcase_read: system: unknown repo '%s'\n", pieces[3]);
2692 pool_set_installed(pool, repo);
2695 else if (!strcmp(pieces[0], "job") && npieces > 1)
2701 pool_addfileprovides(pool);
2702 pool_createwhatprovides(pool);
2705 if (npieces >= 3 && !strcmp(pieces[2], "selection"))
2707 addselectionjob(pool, pieces + 1, npieces - 1, job);
2711 for (sp = pieces[1]; sp < pieces[npieces - 1]; sp++)
2714 how = testcase_str2job(pool, pieces[1], &what);
2715 if (how >= 0 && job)
2716 queue_push2(job, how, what);
2718 else if (!strcmp(pieces[0], "vendorclass") && npieces > 1)
2720 pool_addvendorclass(pool, (const char **)(pieces + 1));
2722 else if (!strcmp(pieces[0], "namespace") && npieces > 1)
2724 int i = strlen(pieces[1]);
2725 s = strchr(pieces[1], '(');
2726 if (!s && pieces[1][i - 1] != ')')
2728 pool_debug(pool, SOLV_ERROR, "testcase_read: bad namespace '%s'\n", pieces[1]);
2736 pieces[1][i - 1] = 0;
2737 name = pool_str2id(pool, pieces[1], 1);
2738 evr = pool_str2id(pool, s + 1, 1);
2740 pieces[1][i - 1] = ')';
2741 id = pool_rel2id(pool, name, evr, REL_NAMESPACE, 1);
2742 for (i = 2; i < npieces; i++)
2743 queue_push(&q, testcase_str2solvid(pool, pieces[i]));
2744 /* now do the callback */
2747 pool_addfileprovides(pool);
2748 pool_createwhatprovides(pool);
2751 pool->whatprovides_rel[GETRELID(id)] = pool_queuetowhatprovides(pool, &q);
2755 else if (!strcmp(pieces[0], "poolflags"))
2758 if (!poolflagsreset)
2761 testcase_resetpoolflags(pool); /* hmm */
2763 for (i = 1; i < npieces; i++)
2764 testcase_setpoolflags(pool, pieces[i]);
2766 else if (!strcmp(pieces[0], "solverflags") && npieces > 1)
2771 solv = solver_create(pool);
2772 testcase_resetsolverflags(solv);
2774 for (i = 1; i < npieces; i++)
2775 testcase_setsolverflags(solv, pieces[i]);
2777 else if (!strcmp(pieces[0], "result") && npieces > 1)
2780 int resultflags = str2resultflags(pool, pieces[1]);
2784 rdata = pool_tmpjoin(pool, testcasedir, pieces[2], 0);
2785 if (!strcmp(pieces[2], "<inline>"))
2786 result = read_inline_file(fp, &buf, &bufp, &bufl);
2789 FILE *rfp = fopen(rdata, "r");
2791 pool_debug(pool, SOLV_ERROR, "testcase_read: could not open '%s'\n", rdata);
2794 result = read_file(rfp);
2804 *resultflagsp = resultflags;
2806 else if (!strcmp(pieces[0], "nextjob"))
2808 if (npieces == 2 && resultflagsp && !strcmp(pieces[1], "reusesolver"))
2809 *resultflagsp |= TESTCASE_RESULT_REUSE_SOLVER;
2812 else if (!strcmp(pieces[0], "disable") && npieces == 3)
2815 if (strcmp(pieces[1], "pkg"))
2817 pool_debug(pool, SOLV_ERROR, "testcase_read: bad disable type '%s'\n", pieces[1]);
2821 pool_createwhatprovides(pool);
2823 if (!pool->considered)
2825 pool->considered = solv_calloc(1, sizeof(Map));
2826 map_init(pool->considered, pool->nsolvables);
2827 map_setall(pool->considered);
2829 p = testcase_str2solvid(pool, pieces[2]);
2831 MAPCLR(pool->considered, p);
2833 pool_debug(pool, SOLV_ERROR, "disable: unknown package '%s'\n", pieces[2]);
2835 else if (!strcmp(pieces[0], "feature"))
2838 for (i = 1; i < npieces; i++)
2840 for (j = 0; features[j]; j++)
2841 if (!strcmp(pieces[i], features[j]))
2845 pool_debug(pool, SOLV_ERROR, "testcase_read: missing feature '%s'\n", pieces[i]);
2849 if (missing_features)
2852 else if (!strcmp(pieces[0], "genid") && npieces > 1)
2859 for (sp = pieces[2]; sp < pieces[npieces - 1]; sp++)
2863 genid = solv_extend(genid, ngenid, 1, sizeof(*genid), 7);
2864 if (!strcmp(pieces[1], "op") && npieces > 2)
2867 for (op = oplist; op->flags; op++)
2868 if (!strncmp(pieces[2], op->opname, strlen(op->opname)))
2872 pool_debug(pool, SOLV_ERROR, "testcase_read: genid: unknown op '%s'\n", pieces[2]);
2877 pool_debug(pool, SOLV_ERROR, "testcase_read: genid: out of stack\n");
2881 id = pool_rel2id(pool, genid[ngenid] , genid[ngenid + 1], op->flags, 1);
2883 else if (!strcmp(pieces[1], "lit"))
2884 id = pool_str2id(pool, npieces > 2 ? pieces[2] : "", 1);
2885 else if (!strcmp(pieces[1], "null"))
2887 else if (!strcmp(pieces[1], "dep"))
2888 id = testcase_str2dep(pool, pieces[2]);
2891 pool_debug(pool, SOLV_ERROR, "testcase_read: genid: unknown command '%s'\n", pieces[1]);
2894 genid[ngenid++] = id;
2896 else if (!strcmp(pieces[0], "autoinst") && npieces > 2)
2898 if (strcmp(pieces[1], "name"))
2900 pool_debug(pool, SOLV_ERROR, "testcase_read: autoinst: illegal mode\n");
2903 queue_push(&autoinstq, pool_str2id(pool, pieces[2], 1));
2907 pool_debug(pool, SOLV_ERROR, "testcase_read: cannot parse command '%s'\n", pieces[0]);
2910 while (job && ngenid > 0)
2911 queue_push2(job, SOLVER_NOOP | SOLVER_SOLVABLE_PROVIDES, genid[--ngenid]);
2912 if (autoinstq.count)
2913 pool_add_userinstalled_jobs(pool, &autoinstq, job, GET_USERINSTALLED_NAMES | GET_USERINSTALLED_INVERTED);
2914 queue_free(&autoinstq);
2915 genid = solv_free(genid);
2916 buf = solv_free(buf);
2917 pieces = solv_free(pieces);
2918 solv_free(testcasedir);
2921 pool_addfileprovides(pool);
2922 pool_createwhatprovides(pool);
2926 solv = solver_create(pool);
2927 testcase_resetsolverflags(solv);
2931 if (missing_features)
2936 *resultflagsp = 77; /* hack for testsolv */
2942 testcase_resultdiff(const char *result1, const char *result2)
2944 Strqueue sq1, sq2, osq;
2946 strqueue_init(&sq1);
2947 strqueue_init(&sq2);
2948 strqueue_init(&osq);
2949 strqueue_split(&sq1, result1);
2950 strqueue_split(&sq2, result2);
2951 strqueue_sort(&sq1);
2952 strqueue_sort(&sq2);
2953 strqueue_diff(&sq1, &sq2, &osq);
2954 r = osq.nstr ? strqueue_join(&osq) : 0;
2955 strqueue_free(&sq1);
2956 strqueue_free(&sq2);
2957 strqueue_free(&osq);