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"
20 #include "repo_solv.h"
22 #include "solverdebug.h"
25 #include "selection.h"
26 #include "solv_xfopen.h"
27 #if ENABLE_TESTCASE_HELIXREPO
28 #include "ext/repo_helix.h"
32 #include "tools_util.h"
34 static struct job2str {
38 { SOLVER_NOOP, "noop" },
39 { SOLVER_INSTALL, "install" },
40 { SOLVER_ERASE, "erase" },
41 { SOLVER_UPDATE, "update" },
42 { SOLVER_WEAKENDEPS, "weakendeps" },
43 { SOLVER_MULTIVERSION, "multiversion" },
44 { SOLVER_MULTIVERSION, "noobsoletes" }, /* old name */
45 { SOLVER_LOCK, "lock" },
46 { SOLVER_DISTUPGRADE, "distupgrade" },
47 { SOLVER_VERIFY, "verify" },
48 { SOLVER_DROP_ORPHANED, "droporphaned" },
49 { SOLVER_USERINSTALLED, "userinstalled" },
50 { SOLVER_ALLOWUNINSTALL, "allowuninstall" },
51 { SOLVER_FAVOR, "favor" },
52 { SOLVER_DISFAVOR, "disfavor" },
56 static struct jobflags2str {
60 { SOLVER_WEAK, "weak" },
61 { SOLVER_ESSENTIAL, "essential" },
62 { SOLVER_CLEANDEPS, "cleandeps" },
63 { SOLVER_ORUPDATE, "orupdate" },
64 { SOLVER_FORCEBEST, "forcebest" },
65 { SOLVER_TARGETED, "targeted" },
66 { SOLVER_NOTBYUSER, "notbyuser" },
67 { SOLVER_SETEV, "setev" },
68 { SOLVER_SETEVR, "setevr" },
69 { SOLVER_SETARCH, "setarch" },
70 { SOLVER_SETVENDOR, "setvendor" },
71 { SOLVER_SETREPO, "setrepo" },
72 { SOLVER_NOAUTOSET, "noautoset" },
76 static struct resultflags2str {
79 } resultflags2str[] = {
80 { TESTCASE_RESULT_TRANSACTION, "transaction" },
81 { TESTCASE_RESULT_PROBLEMS, "problems" },
82 { TESTCASE_RESULT_ORPHANED, "orphaned" },
83 { TESTCASE_RESULT_RECOMMENDED, "recommended" },
84 { TESTCASE_RESULT_UNNEEDED, "unneeded" },
85 { TESTCASE_RESULT_ALTERNATIVES, "alternatives" },
86 { TESTCASE_RESULT_RULES, "rules" },
87 { TESTCASE_RESULT_GENID, "genid" },
88 { TESTCASE_RESULT_REASON, "reason" },
89 { TESTCASE_RESULT_CLEANDEPS, "cleandeps" },
90 { TESTCASE_RESULT_JOBS, "jobs" },
94 static struct solverflags2str {
98 } solverflags2str[] = {
99 { SOLVER_FLAG_ALLOW_DOWNGRADE, "allowdowngrade", 0 },
100 { SOLVER_FLAG_ALLOW_NAMECHANGE, "allownamechange", 1 },
101 { SOLVER_FLAG_ALLOW_ARCHCHANGE, "allowarchchange", 0 },
102 { SOLVER_FLAG_ALLOW_VENDORCHANGE, "allowvendorchange", 0 },
103 { SOLVER_FLAG_ALLOW_UNINSTALL, "allowuninstall", 0 },
104 { SOLVER_FLAG_NO_UPDATEPROVIDE, "noupdateprovide", 0 },
105 { SOLVER_FLAG_SPLITPROVIDES, "splitprovides", 0 },
106 { SOLVER_FLAG_IGNORE_RECOMMENDED, "ignorerecommended", 0 },
107 { SOLVER_FLAG_ADD_ALREADY_RECOMMENDED, "addalreadyrecommended", 0 },
108 { SOLVER_FLAG_NO_INFARCHCHECK, "noinfarchcheck", 0 },
109 { SOLVER_FLAG_KEEP_EXPLICIT_OBSOLETES, "keepexplicitobsoletes", 0 },
110 { SOLVER_FLAG_BEST_OBEY_POLICY, "bestobeypolicy", 0 },
111 { SOLVER_FLAG_NO_AUTOTARGET, "noautotarget", 0 },
112 { SOLVER_FLAG_DUP_ALLOW_DOWNGRADE, "dupallowdowngrade", 1 },
113 { SOLVER_FLAG_DUP_ALLOW_ARCHCHANGE, "dupallowarchchange", 1 },
114 { SOLVER_FLAG_DUP_ALLOW_VENDORCHANGE, "dupallowvendorchange", 1 },
115 { SOLVER_FLAG_DUP_ALLOW_NAMECHANGE, "dupallownamechange", 1 },
116 { SOLVER_FLAG_KEEP_ORPHANS, "keeporphans", 0 },
117 { SOLVER_FLAG_BREAK_ORPHANS, "breakorphans", 0 },
118 { SOLVER_FLAG_FOCUS_INSTALLED, "focusinstalled", 0 },
119 { SOLVER_FLAG_YUM_OBSOLETES, "yumobsoletes", 0 },
120 { SOLVER_FLAG_NEED_UPDATEPROVIDE, "needupdateprovide", 0 },
121 { SOLVER_FLAG_URPM_REORDER, "urpmreorder", 0 },
122 { SOLVER_FLAG_FOCUS_BEST, "focusbest", 0 },
123 { SOLVER_FLAG_STRONG_RECOMMENDS, "strongrecommends", 0 },
124 { SOLVER_FLAG_INSTALL_ALSO_UPDATES, "installalsoupdates", 0 },
125 { SOLVER_FLAG_ONLY_NAMESPACE_RECOMMENDED, "onlynamespacerecommended", 0 },
129 static struct poolflags2str {
133 } poolflags2str[] = {
134 { POOL_FLAG_PROMOTEEPOCH, "promoteepoch", 0 },
135 { POOL_FLAG_FORBIDSELFCONFLICTS, "forbidselfconflicts", 0 },
136 { POOL_FLAG_OBSOLETEUSESPROVIDES, "obsoleteusesprovides", 0 },
137 { POOL_FLAG_IMPLICITOBSOLETEUSESPROVIDES, "implicitobsoleteusesprovides", 0 },
138 { POOL_FLAG_OBSOLETEUSESCOLORS, "obsoleteusescolors", 0 },
139 { POOL_FLAG_IMPLICITOBSOLETEUSESCOLORS, "implicitobsoleteusescolors", 0 },
140 { POOL_FLAG_NOINSTALLEDOBSOLETES, "noinstalledobsoletes", 0 },
141 { POOL_FLAG_HAVEDISTEPOCH, "havedistepoch", 0 },
142 { POOL_FLAG_NOOBSOLETESMULTIVERSION, "noobsoletesmultiversion", 0 },
143 { POOL_FLAG_ADDFILEPROVIDESFILTERED, "addfileprovidesfiltered", 0 },
144 { POOL_FLAG_NOWHATPROVIDESAUX, "nowhatprovidesaux", 0 },
148 static struct disttype2str {
152 { DISTTYPE_RPM, "rpm" },
153 { DISTTYPE_DEB, "deb" },
154 { DISTTYPE_ARCH, "arch" },
155 { DISTTYPE_HAIKU, "haiku" },
159 static struct selflags2str {
163 { SELECTION_NAME, "name" },
164 { SELECTION_PROVIDES, "provides" },
165 { SELECTION_FILELIST, "filelist" },
166 { SELECTION_CANON, "canon" },
167 { SELECTION_DOTARCH, "dotarch" },
168 { SELECTION_REL, "rel" },
169 { SELECTION_INSTALLED_ONLY, "installedonly" },
170 { SELECTION_GLOB, "glob" },
171 { SELECTION_FLAT, "flat" },
172 { SELECTION_NOCASE, "nocase" },
173 { SELECTION_SOURCE_ONLY, "sourceonly" },
174 { SELECTION_WITH_SOURCE, "withsource" },
175 { SELECTION_SKIP_KIND, "skipkind" },
176 { SELECTION_MATCH_DEPSTR, "depstr" },
177 { SELECTION_WITH_DISABLED, "withdisabled" },
178 { SELECTION_WITH_BADARCH, "withbadarch" },
179 { SELECTION_ADD, "add" },
180 { SELECTION_SUBTRACT, "subtract" },
181 { SELECTION_FILTER, "filter" },
185 static const char *features[] = {
186 #ifdef ENABLE_LINKED_PKGS
189 #ifdef ENABLE_COMPLEX_DEPS
192 #if ENABLE_TESTCASE_HELIXREPO
193 "testcase_helixrepo",
198 typedef struct strqueue {
203 #define STRQUEUE_BLOCK 63
206 strqueue_init(Strqueue *q)
213 strqueue_free(Strqueue *q)
216 for (i = 0; i < q->nstr; i++)
217 solv_free(q->str[i]);
218 q->str = solv_free(q->str);
223 strqueue_push(Strqueue *q, const char *s)
225 q->str = solv_extend(q->str, q->nstr, 1, sizeof(*q->str), STRQUEUE_BLOCK);
226 q->str[q->nstr++] = solv_strdup(s);
230 strqueue_pushjoin(Strqueue *q, const char *s1, const char *s2, const char *s3)
232 q->str = solv_extend(q->str, q->nstr, 1, sizeof(*q->str), STRQUEUE_BLOCK);
233 q->str[q->nstr++] = solv_dupjoin(s1, s2, s3);
237 strqueue_sort_cmp(const void *ap, const void *bp, void *dp)
239 const char *a = *(const char **)ap;
240 const char *b = *(const char **)bp;
241 return strcmp(a ? a : "", b ? b : "");
245 strqueue_sort(Strqueue *q)
248 solv_sort(q->str, q->nstr, sizeof(*q->str), strqueue_sort_cmp, 0);
252 strqueue_sort_u(Strqueue *q)
256 for (i = j = 0; i < q->nstr; i++)
257 if (!j || strqueue_sort_cmp(q->str + i, q->str + j - 1, 0) != 0)
258 q->str[j++] = q->str[i];
263 strqueue_join(Strqueue *q)
267 for (i = 0; i < q->nstr; i++)
269 l += strlen(q->str[i]) + 1;
270 l++; /* trailing \0 */
273 for (i = 0; i < q->nstr; i++)
276 strcpy(rp, q->str[i]);
285 strqueue_split(Strqueue *q, const char *s)
290 while ((p = strchr(s, '\n')) != 0)
292 q->str = solv_extend(q->str, q->nstr, 1, sizeof(*q->str), STRQUEUE_BLOCK);
293 q->str[q->nstr] = solv_malloc(p - s + 1);
295 memcpy(q->str[q->nstr], s, p - s);
296 q->str[q->nstr][p - s] = 0;
305 strqueue_diff(Strqueue *sq1, Strqueue *sq2, Strqueue *osq)
308 while (i < sq1->nstr && j < sq2->nstr)
310 int r = strqueue_sort_cmp(sq1->str + i, sq2->str + j, 0);
314 strqueue_pushjoin(osq, "-", sq1->str[i++], 0);
316 strqueue_pushjoin(osq, "+", sq2->str[j++], 0);
318 while (i < sq1->nstr)
319 strqueue_pushjoin(osq, "-", sq1->str[i++], 0);
320 while (j < sq2->nstr)
321 strqueue_pushjoin(osq, "+", sq2->str[j++], 0);
326 testcase_id2str(Pool *pool, Id id, int isname)
328 const char *s = pool_id2str(pool, id);
331 int bad = 0, paren = 0, parenbad = 0;
337 if (strchr("[(<=>!", *s))
339 if (!strncmp(s, "namespace:", 10))
341 for (ss = s + bad; *ss; ss++)
343 if (*ss == ' ' || *ss == '\\' || *(unsigned char *)ss < 32 || *ss == '(' || *ss == ')')
346 paren = paren == 0 ? 1 : -1;
349 paren = paren == 1 ? 0 : -1;
354 if (isname && ss - s > 4 && !strcmp(ss - 4, ":any"))
356 if (!paren && !(bad - parenbad))
359 /* we need escaping! */
360 s2 = s2p = pool_alloctmpspace(pool, strlen(s) + bad * 2 + 1);
361 if (!strncmp(s, "namespace:", 10))
363 strcpy(s2p, "namespace\\3a");
371 if ((ss == s && strchr("[(<=>!", *s)) || *ss == ' ' || *ss == '\\' || *(unsigned char *)ss < 32 || *ss == '(' || *ss == ')')
374 solv_bin2hex((unsigned char *)ss, 1, s2p);
379 if (isname && s2p - s2 > 4 && !strcmp(s2p - 4, ":any"))
380 strcpy(s2p - 4, "\\3aany");
389 { REL_GT | REL_LT | REL_EQ, "<=>" },
390 { REL_LT | REL_EQ, "<=" },
391 { REL_GT | REL_EQ, ">=" },
393 { REL_GT | REL_LT, "<>" },
397 { REL_WITHOUT , "-" },
398 { REL_NAMESPACE , "<NAMESPACE>" },
400 { REL_MULTIARCH, "<MULTIARCH>" },
401 { REL_FILECONFLICT, "<FILECONFLICT>" },
402 { REL_COND, "<IF>" },
403 { REL_COMPAT, "compat >=" },
404 { REL_KIND, "<KIND>" },
405 { REL_ELSE, "<ELSE>" },
406 { REL_ERROR, "<ERROR>" },
407 { REL_UNLESS, "<UNLESS>" },
413 testcase_dep2str_complex(Pool *pool, char *s, Id id, int addparens)
422 s2 = testcase_id2str(pool, id, 1);
423 s = pool_tmpappend(pool, s, s2, 0);
424 pool_freetmpspace(pool, s2);
427 rd = GETRELDEP(pool, id);
429 /* check for special shortcuts */
430 if (rd->flags == REL_NAMESPACE && !ISRELDEP(rd->name) && !strncmp(pool_id2str(pool, rd->name), "namespace:", 10))
432 s = pool_tmpappend(pool, s, pool_id2str(pool, rd->name), "(");
433 s = testcase_dep2str_complex(pool, s, rd->evr, 0);
434 return pool_tmpappend(pool, s, ")", 0);
436 if (rd->flags == REL_MULTIARCH && !ISRELDEP(rd->name) && rd->evr == ARCH_ANY)
438 /* append special :any suffix */
439 s2 = testcase_id2str(pool, rd->name, 1);
440 s = pool_tmpappend(pool, s, s2, ":any");
441 pool_freetmpspace(pool, s2);
446 if (ISRELDEP(rd->name))
448 Reldep *rd2 = GETRELDEP(pool, rd->name);
450 if (rd->flags > 7 && rd->flags != REL_COMPAT && rd2->flags && rd2->flags <= 7)
455 s = pool_tmpappend(pool, s, "(", 0);
456 s = testcase_dep2str_complex(pool, s, rd->name, needparens);
458 for (op = oplist; op->flags; op++)
459 if (rd->flags == op->flags)
463 s = pool_tmpappend(pool, s, " ", op->opname);
464 s = pool_tmpappend(pool, s, " ", 0);
469 sprintf(buf, " <%u> ", rd->flags);
470 s = pool_tmpappend(pool, s, buf, 0);
474 if (ISRELDEP(rd->evr))
476 Reldep *rd2 = GETRELDEP(pool, rd->evr);
478 if (rd->flags > 7 && rd2->flags && rd2->flags <= 7)
480 if (rd->flags == REL_AND && rd2->flags == REL_AND)
481 needparens = 0; /* chain */
482 if (rd->flags == REL_OR && rd2->flags == REL_OR)
483 needparens = 0; /* chain */
484 if (rd->flags > 0 && rd->flags < 8 && rd2->flags == REL_COMPAT)
485 needparens = 0; /* chain */
487 if (!ISRELDEP(rd->evr))
489 s2 = testcase_id2str(pool, rd->evr, 0);
490 s = pool_tmpappend(pool, s, s2, 0);
491 pool_freetmpspace(pool, s2);
494 s = (char *)testcase_dep2str_complex(pool, s, rd->evr, needparens);
496 s = pool_tmpappend(pool, s, ")", 0);
501 testcase_dep2str(Pool *pool, Id id)
505 return testcase_id2str(pool, id, 1);
506 s = pool_alloctmpspace(pool, 1);
508 return testcase_dep2str_complex(pool, s, id, 0);
512 /* Convert a simple string. Also handle the :any suffix */
514 testcase_str2dep_simple(Pool *pool, const char **sp, int isname)
521 for (s = *sp; *s; s++)
525 if (*s == ' ' || *(unsigned char *)s < 32)
529 if (*s == ')' && paren-- <= 0)
532 if (isname && s - *sp > 4 && !strncmp(s - 4, ":any", 4))
539 if (s - *sp == 6 && !strncmp(*sp, "<NULL>", 6))
542 id = pool_strn2id(pool, *sp, s - *sp, 1);
544 else if (s - *sp == 3 && !strncmp(*sp, "\\00", 3))
548 char buf[128], *bp, *bp2;
550 bp = s - *sp >= 128 ? solv_malloc(s - *sp + 1) : buf;
551 for (bp2 = bp, sp2 = *sp; sp2 < s;)
555 solv_hex2bin(&sp2, (unsigned char *)bp2 - 1, 1);
558 id = pool_str2id(pool, bp, 1);
564 id = pool_rel2id(pool, id, ARCH_ANY, REL_MULTIARCH, 1);
573 testcase_str2dep_complex(Pool *pool, const char **sp, int relop)
576 Id flags, id, id2, namespaceid = 0;
579 while (*s == ' ' || *s == '\t')
581 if (!strncmp(s, "namespace:", 10))
583 /* special namespace hack */
585 for (s2 = s + 10; *s2 && *s2 != '('; s2++)
589 namespaceid = pool_strn2id(pool, s, s2 - s, 1);
596 id = testcase_str2dep_complex(pool, &s, 0);
605 id = testcase_str2dep_simple(pool, &s, relop ? 0 : 1);
607 id = pool_rel2id(pool, namespaceid, id, REL_NAMESPACE, 1);
611 while (*s == ' ' || *s == '\t')
613 if (!*s || *s == ')' || (relop && strncmp(s, "compat >= ", 10) != 0))
619 /* we have an op! Find the end */
621 if (s[0] == '<' && (s[1] >= '0' && s[1] <= '9'))
624 for (s2 = s + 1; *s2 >= '0' && *s2 <= '9'; s2++)
628 flags = strtoul(s + 1, 0, 10);
634 for (op = oplist; op->flags; op++)
635 if (!strncmp(s, op->opname, strlen(op->opname)))
643 s += strlen(op->opname);
645 id2 = testcase_str2dep_complex(pool, &s, flags > 0 && flags < 8);
651 id = pool_rel2id(pool, id, id2, flags, 1);
656 testcase_str2dep(Pool *pool, const char *s)
658 Id id = testcase_str2dep_complex(pool, &s, 0);
659 return s && !*s ? id : 0;
662 /**********************************************************/
665 testcase_repoid2str(Pool *pool, Id repoid)
667 Repo *repo = pool_id2repo(pool, repoid);
670 char *r = pool_tmpjoin(pool, repo->name, 0, 0);
672 for (rp = r; *rp; rp++)
673 if (*rp == ' ' || *rp == '\t')
680 sprintf(buf, "#%d", repoid);
681 return pool_tmpjoin(pool, buf, 0, 0);
686 testcase_solvid2str(Pool *pool, Id p)
688 Solvable *s = pool->solvables + p;
689 const char *n, *e, *a;
692 if (p == SYSTEMSOLVABLE)
694 n = pool_id2str(pool, s->name);
695 e = pool_id2str(pool, s->evr);
696 a = pool_id2str(pool, s->arch);
697 str = pool_alloctmpspace(pool, strlen(n) + strlen(e) + strlen(a) + 3);
698 sprintf(str, "%s-%s.%s", n, e, a);
700 return pool_tmpappend(pool, str, "@", 0);
704 char *str2 = pool_tmpappend(pool, str, "@", s->repo->name);
706 if (str2[l] == ' ' || str2[l] == '\t')
710 sprintf(buf, "@#%d", s->repo->repoid);
711 return pool_tmpappend(pool, str, buf, 0);
715 testcase_str2repo(Pool *pool, const char *str)
719 if (str[0] == '#' && (str[1] >= '0' && str[1] <= '9'))
723 for (j = 1; str[j] >= '0' && str[j] <= '9'; j++)
724 repoid = repoid * 10 + (str[j] - '0');
725 if (!str[j] && repoid > 0 && repoid < pool->nrepos)
726 repo = pool_id2repo(pool, repoid);
730 FOR_REPOS(repoid, repo)
735 l = strlen(repo->name);
736 for (i = 0; i < l; i++)
738 int c = repo->name[i];
739 if (c == ' ' || c == '\t')
744 if (i == l && !str[l])
747 if (repoid >= pool->nrepos)
754 testcase_str2solvid(Pool *pool, const char *str)
756 int i, l = strlen(str);
763 if (*str == '@' && !strcmp(str, "@SYSTEM"))
764 return SYSTEMSOLVABLE;
766 for (i = l - 1; i >= 0; i--)
767 if (str[i] == '@' && (repo = testcase_str2repo(pool, str + i + 1)) != 0)
772 /* now find the arch (if present) */
774 for (i = repostart - 1; i > 0; i--)
777 arch = pool_strn2id(pool, str + i + 1, repostart - (i + 1), 0);
782 /* now find the name */
783 for (i = repostart - 1; i > 0; i--)
787 Id nid, evrid, p, pp;
788 nid = pool_strn2id(pool, str, i, 0);
791 evrid = pool_strn2id(pool, str + i + 1, repostart - (i + 1), 0);
794 /* first check whatprovides */
795 FOR_PROVIDES(p, pp, nid)
797 Solvable *s = pool->solvables + p;
798 if (s->name != nid || s->evr != evrid)
800 if (repo && s->repo != repo)
802 if (arch && s->arch != arch)
806 /* maybe it's not installable and thus not in whatprovides. do a slow search */
810 FOR_REPO_SOLVABLES(repo, p, s)
812 if (s->name != nid || s->evr != evrid)
814 if (arch && s->arch != arch)
821 FOR_POOL_SOLVABLES(p)
823 Solvable *s = pool->solvables + p;
824 if (s->name != nid || s->evr != evrid)
826 if (arch && s->arch != arch)
837 testcase_job2str(Pool *pool, Id how, Id what)
844 Id select = how & SOLVER_SELECTMASK;
846 for (i = 0; job2str[i].str; i++)
847 if ((how & SOLVER_JOBMASK) == job2str[i].job)
849 jobstr = job2str[i].str ? job2str[i].str : "unknown";
850 if (select == SOLVER_SOLVABLE)
853 pkgstr = testcase_solvid2str(pool, what);
855 else if (select == SOLVER_SOLVABLE_NAME)
858 pkgstr = testcase_dep2str(pool, what);
860 else if (select == SOLVER_SOLVABLE_PROVIDES)
862 selstr = " provides ";
863 pkgstr = testcase_dep2str(pool, what);
865 else if (select == SOLVER_SOLVABLE_ONE_OF)
870 while ((p = pool->whatprovidesdata[what++]) != 0)
872 const char *s = testcase_solvid2str(pool, p);
875 pkgstr = pool_tmpappend(pool, pkgstr, " ", s);
876 pool_freetmpspace(pool, s);
884 else if (select == SOLVER_SOLVABLE_REPO)
886 Repo *repo = pool_id2repo(pool, what);
891 sprintf(buf, "#%d", repo->repoid);
892 pkgstr = pool_tmpjoin(pool, buf, 0, 0);
895 pkgstr = pool_tmpjoin(pool, repo->name, 0, 0);
897 else if (select == SOLVER_SOLVABLE_ALL)
904 selstr = " unknown ";
907 ret = pool_tmpjoin(pool, jobstr, selstr, pkgstr);
909 ret = pool_tmpappend(pool, ret, " ", 0);
910 for (i = 0; jobflags2str[i].str; i++)
911 if ((how & jobflags2str[i].flag) != 0)
912 ret = pool_tmpappend(pool, ret, ",", jobflags2str[i].str);
918 ret = pool_tmpappend(pool, ret, "]", 0);
924 str2selflags(Pool *pool, char *s) /* modifies the string! */
929 char *se = strchr(s, ',');
932 for (i = 0; selflags2str[i].str; i++)
933 if (!strcmp(s, selflags2str[i].str))
935 selflags |= selflags2str[i].flag;
938 if (!selflags2str[i].str)
939 pool_error(pool, 0, "str2job: unknown selection flag '%s'", s);
946 str2jobflags(Pool *pool, char *s) /* modifies the string */
951 char *se = strchr(s, ',');
954 for (i = 0; jobflags2str[i].str; i++)
955 if (!strcmp(s, jobflags2str[i].str))
957 jobflags |= jobflags2str[i].flag;
960 if (!jobflags2str[i].str)
961 pool_error(pool, 0, "str2job: unknown job flag '%s'", s);
968 testcase_str2job(Pool *pool, const char *str, Id *whatp)
978 /* so we can patch it */
979 s = pool_tmpjoin(pool, str, 0, 0);
980 /* split it in pieces */
983 while (*s == ' ' || *s == '\t')
987 pieces = solv_extend(pieces, npieces, 1, sizeof(*pieces), 7);
988 pieces[npieces++] = s;
989 while (*s && *s != ' ' && *s != '\t')
996 pool_error(pool, -1, "str2job: bad line '%s'", str);
1001 for (i = 0; job2str[i].str; i++)
1002 if (!strcmp(pieces[0], job2str[i].str))
1004 if (!job2str[i].str)
1006 pool_error(pool, -1, "str2job: unknown job '%s'", str);
1010 job = job2str[i].job;
1014 char *flags = pieces[npieces - 1];
1015 if (*flags == '[' && flags[strlen(flags) - 1] == ']')
1019 flags[strlen(flags) - 1] = 0;
1020 job |= str2jobflags(pool, flags);
1023 if (!strcmp(pieces[1], "pkg"))
1027 pool_error(pool, -1, "str2job: bad pkg selector in '%s'", str);
1031 job |= SOLVER_SOLVABLE;
1032 what = testcase_str2solvid(pool, pieces[2]);
1035 pool_error(pool, -1, "str2job: unknown package '%s'", pieces[2]);
1040 else if (!strcmp(pieces[1], "name") || !strcmp(pieces[1], "provides"))
1042 /* join em again for dep2str... */
1044 for (sp = pieces[2]; sp < pieces[npieces - 1]; sp++)
1048 if (pieces[1][0] == 'p' && strncmp(pieces[2], "namespace:", 10) == 0)
1050 char *spe = strchr(pieces[2], '(');
1051 int l = strlen(pieces[2]);
1052 if (spe && pieces[2][l - 1] == ')')
1054 /* special namespace provides */
1055 if (strcmp(spe, "(<NULL>)") != 0)
1057 pieces[2][l - 1] = 0;
1058 what = testcase_str2dep(pool, spe + 1);
1059 pieces[2][l - 1] = ')';
1061 what = pool_rel2id(pool, pool_strn2id(pool, pieces[2], spe - pieces[2], 1), what, REL_NAMESPACE, 1);
1065 what = testcase_str2dep(pool, pieces[2]);
1066 if (pieces[1][0] == 'n')
1067 job |= SOLVER_SOLVABLE_NAME;
1069 job |= SOLVER_SOLVABLE_PROVIDES;
1071 else if (!strcmp(pieces[1], "oneof"))
1074 job |= SOLVER_SOLVABLE_ONE_OF;
1076 if (npieces > 2 && strcmp(pieces[2], "nothing") != 0)
1078 for (i = 2; i < npieces; i++)
1080 Id p = testcase_str2solvid(pool, pieces[i]);
1083 pool_error(pool, -1, "str2job: unknown package '%s'", pieces[i]);
1091 what = pool_queuetowhatprovides(pool, &q);
1094 else if (!strcmp(pieces[1], "repo"))
1099 pool_error(pool, -1, "str2job: bad line '%s'", str);
1103 repo = testcase_str2repo(pool, pieces[2]);
1106 pool_error(pool, -1, "str2job: unknown repo '%s'", pieces[2]);
1110 job |= SOLVER_SOLVABLE_REPO;
1111 what = repo->repoid;
1113 else if (!strcmp(pieces[1], "all"))
1115 if (npieces != 3 && strcmp(pieces[2], "packages") != 0)
1117 pool_error(pool, -1, "str2job: bad line '%s'", str);
1121 job |= SOLVER_SOLVABLE_ALL;
1126 pool_error(pool, -1, "str2job: unknown selection in '%s'", str);
1135 #define SELECTIONJOB_MATCHDEPS 1
1136 #define SELECTIONJOB_MATCHDEPID 2
1137 #define SELECTIONJOB_MATCHSOLVABLE 3
1140 addselectionjob(Pool *pool, char **pieces, int npieces, Queue *jobqueue, int type, int keyname)
1148 for (i = 0; job2str[i].str; i++)
1149 if (!strcmp(pieces[0], job2str[i].str))
1151 if (!job2str[i].str)
1152 return pool_error(pool, -1, "selstr2job: unknown job '%s'", pieces[0]);
1153 job = job2str[i].job;
1156 char *flags = pieces[npieces - 1];
1157 if (*flags == '[' && flags[strlen(flags) - 1] == ']')
1161 flags[strlen(flags) - 1] = 0;
1162 job |= str2jobflags(pool, flags);
1166 return pool_error(pool, -1, "selstr2job: no selection flags");
1167 selflags = str2selflags(pool, pieces[npieces - 1]);
1168 /* re-join pieces */
1169 for (sp = pieces[2]; sp < pieces[npieces - 2]; sp++)
1173 if (selflags & (SELECTION_ADD | SELECTION_SUBTRACT | SELECTION_FILTER))
1175 for (i = 0; i < jobqueue->count; i += 2)
1176 queue_push2(&sel, jobqueue->elements[i] & (SOLVER_SELECTMASK | SOLVER_SETMASK), jobqueue->elements[i + 1]);
1177 queue_empty(jobqueue);
1180 r = selection_make(pool, &sel, pieces[2], selflags);
1181 else if (type == SELECTIONJOB_MATCHDEPS)
1182 r = selection_make_matchdeps(pool, &sel, pieces[2], selflags, keyname, 0);
1183 else if (type == SELECTIONJOB_MATCHDEPID)
1184 r = selection_make_matchdepid(pool, &sel, testcase_str2dep(pool, pieces[2]), selflags, keyname, 0);
1185 else if (type == SELECTIONJOB_MATCHSOLVABLE)
1186 r = selection_make_matchsolvable(pool, &sel, testcase_str2solvid(pool, pieces[2]), selflags, keyname, 0);
1187 for (i = 0; i < sel.count; i += 2)
1188 queue_push2(jobqueue, job | sel.elements[i], sel.elements[i + 1]);
1194 writedeps(Repo *repo, FILE *fp, const char *tag, Id key, Solvable *s, Offset off)
1196 Pool *pool = repo->pool;
1203 dp = repo->idarraydata + off;
1204 while ((id = *dp++) != 0)
1206 if (key == SOLVABLE_REQUIRES && id == SOLVABLE_PREREQMARKER)
1209 fprintf(fp, "-%s\n", tag);
1214 if (key == SOLVABLE_PROVIDES && id == SOLVABLE_FILEMARKER)
1216 idstr = testcase_dep2str(pool, id);
1219 fprintf(fp, "+%s\n", tag);
1222 fprintf(fp, "%s\n", idstr);
1225 fprintf(fp, "-%s\n", tag);
1229 writefilelist(Repo *repo, FILE *fp, const char *tag, Solvable *s)
1231 Pool *pool = repo->pool;
1235 dataiterator_init(&di, pool, repo, s - pool->solvables, SOLVABLE_FILELIST, 0, 0);
1236 while (dataiterator_step(&di))
1238 const char *s = repodata_dir2str(di.data, di.kv.id, di.kv.str);
1241 fprintf(fp, "+%s\n", tag);
1244 fprintf(fp, "%s\n", s);
1247 fprintf(fp, "-%s\n", tag);
1248 dataiterator_free(&di);
1252 testcase_write_testtags(Repo *repo, FILE *fp)
1254 Pool *pool = repo->pool;
1260 const char *release;
1265 fprintf(fp, "=Ver: 3.0\n");
1267 FOR_REPO_SOLVABLES(repo, p, s)
1269 name = pool_id2str(pool, s->name);
1270 evr = pool_id2str(pool, s->evr);
1271 arch = pool_id2str(pool, s->arch);
1272 release = strrchr(evr, '-');
1274 release = evr + strlen(evr);
1275 fprintf(fp, "=Pkg: %s %.*s %s %s\n", name, (int)(release - evr), evr, *release && release[1] ? release + 1 : "-", arch);
1276 tmp = solvable_lookup_str(s, SOLVABLE_SUMMARY);
1278 fprintf(fp, "=Sum: %s\n", tmp);
1279 writedeps(repo, fp, "Req:", SOLVABLE_REQUIRES, s, s->requires);
1280 writedeps(repo, fp, "Prv:", SOLVABLE_PROVIDES, s, s->provides);
1281 writedeps(repo, fp, "Obs:", SOLVABLE_OBSOLETES, s, s->obsoletes);
1282 writedeps(repo, fp, "Con:", SOLVABLE_CONFLICTS, s, s->conflicts);
1283 writedeps(repo, fp, "Rec:", SOLVABLE_RECOMMENDS, s, s->recommends);
1284 writedeps(repo, fp, "Sup:", SOLVABLE_SUPPLEMENTS, s, s->supplements);
1285 writedeps(repo, fp, "Sug:", SOLVABLE_SUGGESTS, s, s->suggests);
1286 writedeps(repo, fp, "Enh:", SOLVABLE_ENHANCES, s, s->enhances);
1287 if (solvable_lookup_idarray(s, SOLVABLE_PREREQ_IGNOREINST, &q))
1290 fprintf(fp, "+Ipr:\n");
1291 for (i = 0; i < q.count; i++)
1292 fprintf(fp, "%s\n", testcase_dep2str(pool, q.elements[i]));
1293 fprintf(fp, "-Ipr:\n");
1296 fprintf(fp, "=Vnd: %s\n", pool_id2str(pool, s->vendor));
1297 ti = solvable_lookup_num(s, SOLVABLE_BUILDTIME, 0);
1299 fprintf(fp, "=Tim: %u\n", ti);
1300 writefilelist(repo, fp, "Fls:", s);
1306 static inline Offset
1307 adddep(Repo *repo, Offset olddeps, char *str, Id marker)
1309 Id id = *str == '/' ? pool_str2id(repo->pool, str, 1) : testcase_str2dep(repo->pool, str);
1310 return repo_addid_dep(repo, olddeps, id, marker);
1314 finish_v2_solvable(Pool *pool, Repodata *data, Solvable *s, char *filelist, int nfilelist)
1320 for (l = 0; l < nfilelist; l += strlen(filelist + l) + 1)
1322 char *p = strrchr(filelist + l, '/');
1326 did = repodata_str2dir(data, filelist + l, 1);
1329 did = repodata_str2dir(data, "/", 1);
1330 repodata_add_dirstr(data, s - pool->solvables, SOLVABLE_FILELIST, did, p);
1333 repo_rewrite_suse_deps(s, 0);
1336 /* stripped down version of susetags parser used for testcases */
1338 testcase_add_testtags(Repo *repo, FILE *fp, int flags)
1340 Pool *pool = repo->pool;
1352 int tagsversion = 0;
1353 int addselfprovides = 1; /* for compat reasons */
1355 data = repo_add_repodata(repo, flags);
1360 line = solv_malloc(aline);
1364 if (linep - line + 16 > aline)
1366 aline = linep - line;
1367 line = solv_realloc(line, aline + 512);
1368 linep = line + aline;
1371 if (!fgets(linep, aline - (linep - line), fp))
1373 linep += strlen(linep);
1374 if (linep == line || linep[-1] != '\n')
1377 linep = line + intag;
1380 if (line[intag] == '-' && !strncmp(line + 1, line + intag + 1, intag - 2))
1387 else if (line[0] == '+' && line[1] && line[1] != ':')
1389 char *tagend = strchr(line, ':');
1394 intag = tagend + 2 - line;
1395 linep = line + intag;
1398 if (*line != '=' || !line[1] || !line[2] || !line[3] || line[4] != ':')
1400 tag = line[1] << 16 | line[2] << 8 | line[3];
1401 /* tags that do not need a solvable */
1404 case 'V' << 16 | 'e' << 8 | 'r':
1405 tagsversion = atoi(line + 6);
1406 addselfprovides = tagsversion < 3 || strstr(line + 6, "addselfprovides") != 0;
1408 case 'P' << 16 | 'k' << 8 | 'g':
1411 if (tagsversion == 2)
1412 finish_v2_solvable(pool, data, s, filelist, nfilelist);
1413 if (addselfprovides && s->name && s->arch != ARCH_SRC && s->arch != ARCH_NOSRC)
1414 s->provides = repo_addid_dep(s->repo, s->provides, pool_rel2id(pool, s->name, s->evr, REL_EQ, 1), 0);
1417 if (split(line + 5, sp, 5) != 4)
1419 s = pool_id2solvable(pool, repo_add_solvable(repo));
1420 s->name = pool_str2id(pool, sp[0], 1);
1421 /* join back version and release */
1422 if (sp[2] && !(sp[2][0] == '-' && !sp[2][1]))
1424 s->evr = makeevr(pool, sp[1]);
1425 s->arch = pool_str2id(pool, sp[3], 1);
1432 /* tags that need a solvable */
1435 case 'S' << 16 | 'u' << 8 | 'm':
1436 repodata_set_str(data, s - pool->solvables, SOLVABLE_SUMMARY, line + 6);
1438 case 'V' << 16 | 'n' << 8 | 'd':
1439 s->vendor = pool_str2id(pool, line + 6, 1);
1441 case 'T' << 16 | 'i' << 8 | 'm':
1444 repodata_set_num(data, s - pool->solvables, SOLVABLE_BUILDTIME, t);
1446 case 'R' << 16 | 'e' << 8 | 'q':
1447 s->requires = adddep(repo, s->requires, line + 6, -SOLVABLE_PREREQMARKER);
1449 case 'P' << 16 | 'r' << 8 | 'q':
1450 s->requires = adddep(repo, s->requires, line + 6, SOLVABLE_PREREQMARKER);
1452 case 'P' << 16 | 'r' << 8 | 'v':
1453 /* version 2 had the file list at the end of the provides */
1454 if (tagsversion == 2)
1458 int l = strlen(line + 6) + 1;
1459 if (nfilelist + l > afilelist)
1461 afilelist = nfilelist + l + 512;
1462 filelist = solv_realloc(filelist, afilelist);
1464 memcpy(filelist + nfilelist, line + 6, l);
1471 for (l = 0; l < nfilelist; l += strlen(filelist + l) + 1)
1472 s->provides = repo_addid_dep(repo, s->provides, pool_str2id(pool, filelist + l, 1), 0);
1476 s->provides = adddep(repo, s->provides, line + 6, 0);
1478 case 'F' << 16 | 'l' << 8 | 's':
1480 char *p = strrchr(line + 6, '/');
1485 did = repodata_str2dir(data, line + 6, 1);
1487 did = repodata_str2dir(data, "/", 1);
1488 repodata_add_dirstr(data, s - pool->solvables, SOLVABLE_FILELIST, did, p);
1491 case 'O' << 16 | 'b' << 8 | 's':
1492 s->obsoletes = adddep(repo, s->obsoletes, line + 6, 0);
1494 case 'C' << 16 | 'o' << 8 | 'n':
1495 s->conflicts = adddep(repo, s->conflicts, line + 6, 0);
1497 case 'R' << 16 | 'e' << 8 | 'c':
1498 s->recommends = adddep(repo, s->recommends, line + 6, 0);
1500 case 'S' << 16 | 'u' << 8 | 'p':
1501 s->supplements = adddep(repo, s->supplements, line + 6, 0);
1503 case 'S' << 16 | 'u' << 8 | 'g':
1504 s->suggests = adddep(repo, s->suggests, line + 6, 0);
1506 case 'E' << 16 | 'n' << 8 | 'h':
1507 s->enhances = adddep(repo, s->enhances, line + 6, 0);
1509 case 'I' << 16 | 'p' << 8 | 'r':
1511 Id id = line[6] == '/' ? pool_str2id(pool, line + 6, 1) : testcase_str2dep(pool, line + 6);
1512 repodata_add_idarray(data, s - pool->solvables, SOLVABLE_PREREQ_IGNOREINST, id);
1521 if (tagsversion == 2)
1522 finish_v2_solvable(pool, data, s, filelist, nfilelist);
1523 if (addselfprovides && s->name && s->arch != ARCH_SRC && s->arch != ARCH_NOSRC)
1524 s->provides = repo_addid_dep(s->repo, s->provides, pool_rel2id(pool, s->name, s->evr, REL_EQ, 1), 0);
1527 solv_free(filelist);
1528 repodata_free_dircache(data);
1529 if (!(flags & REPO_NO_INTERNALIZE))
1530 repodata_internalize(data);
1535 testcase_getpoolflags(Pool *pool)
1537 const char *str = 0;
1539 for (i = 0; poolflags2str[i].str; i++)
1541 v = pool_get_flag(pool, poolflags2str[i].flag);
1542 if (v == poolflags2str[i].def)
1544 str = pool_tmpappend(pool, str, v ? " " : " !", poolflags2str[i].str);
1546 return str ? str + 1 : "";
1550 testcase_setpoolflags(Pool *pool, const char *str)
1552 const char *p = str, *s;
1556 while (*p == ' ' || *p == '\t' || *p == ',')
1567 while (*p && *p != ' ' && *p != '\t' && *p != ',')
1569 for (i = 0; poolflags2str[i].str; i++)
1570 if (!strncmp(poolflags2str[i].str, s, p - s) && poolflags2str[i].str[p - s] == 0)
1572 if (!poolflags2str[i].str)
1573 return pool_error(pool, 0, "setpoolflags: unknown flag '%.*s'", (int)(p - s), s);
1574 pool_set_flag(pool, poolflags2str[i].flag, v);
1580 testcase_resetpoolflags(Pool *pool)
1583 for (i = 0; poolflags2str[i].str; i++)
1584 pool_set_flag(pool, poolflags2str[i].flag, poolflags2str[i].def);
1588 testcase_getsolverflags(Solver *solv)
1590 Pool *pool = solv->pool;
1591 const char *str = 0;
1593 for (i = 0; solverflags2str[i].str; i++)
1595 v = solver_get_flag(solv, solverflags2str[i].flag);
1596 if (v == solverflags2str[i].def)
1598 str = pool_tmpappend(pool, str, v ? " " : " !", solverflags2str[i].str);
1600 return str ? str + 1 : "";
1604 testcase_setsolverflags(Solver *solv, const char *str)
1606 const char *p = str, *s;
1610 while (*p == ' ' || *p == '\t' || *p == ',')
1621 while (*p && *p != ' ' && *p != '\t' && *p != ',')
1623 for (i = 0; solverflags2str[i].str; i++)
1624 if (!strncmp(solverflags2str[i].str, s, p - s) && solverflags2str[i].str[p - s] == 0)
1626 if (!solverflags2str[i].str)
1627 return pool_error(solv->pool, 0, "setsolverflags: unknown flag '%.*s'", (int)(p - s), s);
1628 if (solver_set_flag(solv, solverflags2str[i].flag, v) == -1)
1629 return pool_error(solv->pool, 0, "setsolverflags: unsupported flag '%s'", solverflags2str[i].str);
1635 testcase_resetsolverflags(Solver *solv)
1638 for (i = 0; solverflags2str[i].str; i++)
1639 solver_set_flag(solv, solverflags2str[i].flag, solverflags2str[i].def);
1643 testcase_ruleid(Solver *solv, Id rid)
1649 const unsigned char *md5;
1655 solver_ruleliterals(solv, rid, &q);
1656 for (i = 0; i < q.count; i++)
1658 Id p = q.elements[i];
1659 s = testcase_solvid2str(solv->pool, p > 0 ? p : -p);
1661 s = pool_tmpjoin(solv->pool, "!", s, 0);
1662 strqueue_push(&sq, s);
1665 strqueue_sort_u(&sq);
1666 chk = solv_chksum_create(REPOKEY_TYPE_MD5);
1667 for (i = 0; i < sq.nstr; i++)
1668 solv_chksum_add(chk, sq.str[i], strlen(sq.str[i]) + 1);
1669 md5 = solv_chksum_get(chk, &md5l);
1670 s = pool_bin2hex(solv->pool, md5, md5l);
1671 chk = solv_chksum_free(chk, 0);
1677 testcase_problemid(Solver *solv, Id problem)
1682 const unsigned char *md5;
1686 /* we build a hash of all rules that define the problem */
1689 solver_findallproblemrules(solv, problem, &q);
1690 for (i = 0; i < q.count; i++)
1691 strqueue_push(&sq, testcase_ruleid(solv, q.elements[i]));
1693 strqueue_sort_u(&sq);
1694 chk = solv_chksum_create(REPOKEY_TYPE_MD5);
1695 for (i = 0; i < sq.nstr; i++)
1696 solv_chksum_add(chk, sq.str[i], strlen(sq.str[i]) + 1);
1697 md5 = solv_chksum_get(chk, &md5l);
1698 s = pool_bin2hex(solv->pool, md5, 4);
1699 chk = solv_chksum_free(chk, 0);
1705 testcase_solutionid(Solver *solv, Id problem, Id solution)
1709 const unsigned char *md5;
1713 intid = solver_solutionelement_internalid(solv, problem, solution);
1714 /* internal stuff! handle with care! */
1718 s = testcase_job2str(solv->pool, solv->job.elements[-intid - 1], solv->job.elements[-intid]);
1723 s = testcase_ruleid(solv, intid);
1725 chk = solv_chksum_create(REPOKEY_TYPE_MD5);
1726 solv_chksum_add(chk, s, strlen(s) + 1);
1727 md5 = solv_chksum_get(chk, &md5l);
1728 s = pool_bin2hex(solv->pool, md5, 4);
1729 chk = solv_chksum_free(chk, 0);
1734 testcase_alternativeid(Solver *solv, int type, Id id, Id from)
1737 Pool *pool = solv->pool;
1739 const unsigned char *md5;
1741 chk = solv_chksum_create(REPOKEY_TYPE_MD5);
1742 if (type == SOLVER_ALTERNATIVE_TYPE_RECOMMENDS)
1744 s = testcase_solvid2str(pool, from);
1745 solv_chksum_add(chk, s, strlen(s) + 1);
1746 s = testcase_dep2str(pool, id);
1747 solv_chksum_add(chk, s, strlen(s) + 1);
1749 else if (type == SOLVER_ALTERNATIVE_TYPE_RULE)
1751 s = testcase_ruleid(solv, id);
1752 solv_chksum_add(chk, s, strlen(s) + 1);
1754 md5 = solv_chksum_get(chk, &md5l);
1755 s = pool_bin2hex(pool, md5, 4);
1756 chk = solv_chksum_free(chk, 0);
1760 static struct class2str {
1764 { SOLVER_TRANSACTION_ERASE, "erase" },
1765 { SOLVER_TRANSACTION_INSTALL, "install" },
1766 { SOLVER_TRANSACTION_REINSTALLED, "reinstall" },
1767 { SOLVER_TRANSACTION_DOWNGRADED, "downgrade" },
1768 { SOLVER_TRANSACTION_CHANGED, "change" },
1769 { SOLVER_TRANSACTION_UPGRADED, "upgrade" },
1770 { SOLVER_TRANSACTION_OBSOLETED, "obsolete" },
1771 { SOLVER_TRANSACTION_MULTIINSTALL, "multiinstall" },
1772 { SOLVER_TRANSACTION_MULTIREINSTALL, "multireinstall" },
1776 static struct reason2str {
1780 { SOLVER_REASON_UNRELATED, "unrelated" },
1781 { SOLVER_REASON_UNIT_RULE, "unit" },
1782 { SOLVER_REASON_KEEP_INSTALLED, "keep" },
1783 { SOLVER_REASON_RESOLVE_JOB, "job" },
1784 { SOLVER_REASON_UPDATE_INSTALLED, "update" },
1785 { SOLVER_REASON_CLEANDEPS_ERASE, "cleandeps" },
1786 { SOLVER_REASON_RESOLVE, "resolve" },
1787 { SOLVER_REASON_WEAKDEP, "weakdep" },
1788 { SOLVER_REASON_RESOLVE_ORPHAN, "orphan" },
1790 { SOLVER_REASON_RECOMMENDED, "recommended" },
1791 { SOLVER_REASON_SUPPLEMENTED, "supplemented" },
1796 testcase_reason2str(Id reason)
1799 for (i = 0; reason2str[i].str; i++)
1800 if (reason == reason2str[i].reason)
1801 return reason2str[i].str;
1805 static struct rclass2str {
1809 { SOLVER_RULE_PKG, "pkg" },
1810 { SOLVER_RULE_UPDATE, "update" },
1811 { SOLVER_RULE_FEATURE, "feature" },
1812 { SOLVER_RULE_JOB, "job" },
1813 { SOLVER_RULE_DISTUPGRADE, "distupgrade" },
1814 { SOLVER_RULE_INFARCH, "infarch" },
1815 { SOLVER_RULE_CHOICE, "choice" },
1816 { SOLVER_RULE_LEARNT, "learnt" },
1817 { SOLVER_RULE_BEST, "best" },
1818 { SOLVER_RULE_YUMOBS, "yumobs" },
1823 testcase_rclass2str(Id rclass)
1826 for (i = 0; rclass2str[i].str; i++)
1827 if (rclass == rclass2str[i].rclass)
1828 return rclass2str[i].str;
1833 dump_genid(Pool *pool, Strqueue *sq, Id id, int cnt)
1841 Reldep *rd = GETRELDEP(pool, id);
1842 for (op = oplist; op->flags; op++)
1843 if (rd->flags == op->flags)
1845 cnt = dump_genid(pool, sq, rd->name, cnt);
1846 cnt = dump_genid(pool, sq, rd->evr, cnt);
1847 sprintf(cntbuf, "genid %2d: genid ", cnt++);
1848 s = pool_tmpjoin(pool, cntbuf, "op ", op->flags ? op->opname : "unknown");
1852 sprintf(cntbuf, "genid %2d: genid ", cnt++);
1853 s = pool_tmpjoin(pool, cntbuf, id ? "lit " : "null", id ? pool_id2str(pool, id) : 0);
1855 strqueue_push(sq, s);
1860 testcase_solverresult(Solver *solv, int resultflags)
1862 Pool *pool = solv->pool;
1870 if ((resultflags & TESTCASE_RESULT_TRANSACTION) != 0)
1872 Transaction *trans = solver_create_transaction(solv);
1876 for (i = 0; class2str[i].str; i++)
1879 transaction_classify_pkgs(trans, SOLVER_TRANSACTION_KEEP_PSEUDO, class2str[i].class, 0, 0, &q);
1880 for (j = 0; j < q.count; j++)
1884 if (pool->installed && pool->solvables[p].repo == pool->installed)
1885 op = transaction_obs_pkg(trans, p);
1886 s = pool_tmpjoin(pool, class2str[i].str, " ", testcase_solvid2str(pool, p));
1888 s = pool_tmpjoin(pool, s, " ", testcase_solvid2str(pool, op));
1889 strqueue_push(&sq, s);
1893 transaction_free(trans);
1895 if ((resultflags & TESTCASE_RESULT_PROBLEMS) != 0)
1897 char *probprefix, *solprefix;
1898 int problem, solution, element;
1901 pcnt = solver_problem_count(solv);
1902 for (problem = 1; problem <= pcnt; problem++)
1904 Id rid, from, to, dep;
1905 SolverRuleinfo rinfo;
1906 rid = solver_findproblemrule(solv, problem);
1907 s = testcase_problemid(solv, problem);
1908 probprefix = solv_dupjoin("problem ", s, 0);
1909 rinfo = solver_ruleinfo(solv, rid, &from, &to, &dep);
1910 s = pool_tmpjoin(pool, probprefix, " info ", solver_problemruleinfo2str(solv, rinfo, from, to, dep));
1911 strqueue_push(&sq, s);
1912 scnt = solver_solution_count(solv, problem);
1913 for (solution = 1; solution <= scnt; solution++)
1915 s = testcase_solutionid(solv, problem, solution);
1916 solprefix = solv_dupjoin(probprefix, " solution ", s);
1918 while ((element = solver_next_solutionelement(solv, problem, solution, element, &p, &op)) != 0)
1920 if (p == SOLVER_SOLUTION_JOB)
1921 s = pool_tmpjoin(pool, solprefix, " deljob ", testcase_job2str(pool, solv->job.elements[op - 1], solv->job.elements[op]));
1922 else if (p > 0 && op == 0)
1923 s = pool_tmpjoin(pool, solprefix, " erase ", testcase_solvid2str(pool, p));
1924 else if (p > 0 && op > 0)
1926 s = pool_tmpjoin(pool, solprefix, " replace ", testcase_solvid2str(pool, p));
1927 s = pool_tmpappend(pool, s, " ", testcase_solvid2str(pool, op));
1929 else if (p < 0 && op > 0)
1930 s = pool_tmpjoin(pool, solprefix, " allow ", testcase_solvid2str(pool, op));
1932 s = pool_tmpjoin(pool, solprefix, " unknown", 0);
1933 strqueue_push(&sq, s);
1935 solv_free(solprefix);
1937 solv_free(probprefix);
1941 if ((resultflags & TESTCASE_RESULT_ORPHANED) != 0)
1946 solver_get_orphaned(solv, &q);
1947 for (i = 0; i < q.count; i++)
1949 s = pool_tmpjoin(pool, "orphaned ", testcase_solvid2str(pool, q.elements[i]), 0);
1950 strqueue_push(&sq, s);
1955 if ((resultflags & TESTCASE_RESULT_RECOMMENDED) != 0)
1961 solver_get_recommendations(solv, &qr, &qs, 0);
1962 for (i = 0; i < qr.count; i++)
1964 s = pool_tmpjoin(pool, "recommended ", testcase_solvid2str(pool, qr.elements[i]), 0);
1965 strqueue_push(&sq, s);
1967 for (i = 0; i < qs.count; i++)
1969 s = pool_tmpjoin(pool, "suggested ", testcase_solvid2str(pool, qs.elements[i]), 0);
1970 strqueue_push(&sq, s);
1976 if ((resultflags & TESTCASE_RESULT_UNNEEDED) != 0)
1982 solver_get_unneeded(solv, &q, 0);
1983 solver_get_unneeded(solv, &qf, 1);
1984 for (i = j = 0; i < q.count; i++)
1986 /* we rely on qf containing a subset of q in the same order */
1987 if (j < qf.count && q.elements[i] == qf.elements[j])
1989 s = pool_tmpjoin(pool, "unneeded_filtered ", testcase_solvid2str(pool, q.elements[i]), 0);
1993 s = pool_tmpjoin(pool, "unneeded ", testcase_solvid2str(pool, q.elements[i]), 0);
1994 strqueue_push(&sq, s);
1999 if ((resultflags & TESTCASE_RESULT_ALTERNATIVES) != 0)
2007 cnt = solver_alternatives_count(solv);
2008 for (alternative = 1; alternative <= cnt; alternative++)
2010 Id id, from, chosen;
2012 int type = solver_get_alternative(solv, alternative, &id, &from, &chosen, &q, 0);
2013 altprefix = solv_dupjoin("alternative ", testcase_alternativeid(solv, type, id, from), " ");
2015 if (type == SOLVER_ALTERNATIVE_TYPE_RECOMMENDS)
2017 char *s = pool_tmpjoin(pool, altprefix, num, testcase_solvid2str(pool, from));
2018 s = pool_tmpappend(pool, s, " recommends ", testcase_dep2str(pool, id));
2019 strqueue_push(&sq, s);
2021 else if (type == SOLVER_ALTERNATIVE_TYPE_RULE)
2023 /* map choice rules back to pkg rules */
2024 if (solver_ruleclass(solv, id) == SOLVER_RULE_CHOICE)
2025 id = solver_rule2pkgrule(solv, id);
2026 solver_allruleinfos(solv, id, &rq);
2027 for (i = 0; i < rq.count; i += 4)
2029 int rtype = rq.elements[i];
2030 if ((rtype & SOLVER_RULE_TYPEMASK) == SOLVER_RULE_JOB)
2032 const char *js = testcase_job2str(pool, rq.elements[i + 2], rq.elements[i + 3]);
2033 char *s = pool_tmpjoin(pool, altprefix, num, " job ");
2034 s = pool_tmpappend(pool, s, js, 0);
2035 strqueue_push(&sq, s);
2037 else if (rtype == SOLVER_RULE_PKG_REQUIRES)
2039 char *s = pool_tmpjoin(pool, altprefix, num, testcase_solvid2str(pool, rq.elements[i + 1]));
2040 s = pool_tmpappend(pool, s, " requires ", testcase_dep2str(pool, rq.elements[i + 3]));
2041 strqueue_push(&sq, s);
2045 for (i = 0; i < q.count; i++)
2047 Id p = q.elements[i];
2049 num[0] = '0' + (i + 1) / 10;
2050 num[1] = '0' + (i + 1) % 10;
2052 s = pool_tmpjoin(pool, altprefix, num, "+ ");
2054 s = pool_tmpjoin(pool, altprefix, num, "- ");
2056 s = pool_tmpjoin(pool, altprefix, num, " ");
2057 s = pool_tmpappend(pool, s, testcase_solvid2str(pool, p < 0 ? -p : p), 0);
2058 strqueue_push(&sq, s);
2060 solv_free(altprefix);
2065 if ((resultflags & TESTCASE_RESULT_RULES) != 0)
2067 /* dump all rules */
2069 SolverRuleinfo rclass;
2074 for (rid = 1; (rclass = solver_ruleclass(solv, rid)) != SOLVER_RULE_UNKNOWN; rid++)
2076 char *prefix = solv_dupjoin("rule ", testcase_rclass2str(rclass), " ");
2077 prefix = solv_dupappend(prefix, testcase_ruleid(solv, rid), 0);
2078 solver_ruleliterals(solv, rid, &q);
2079 if (rclass == SOLVER_RULE_FEATURE && q.count == 1 && q.elements[0] == -SYSTEMSOLVABLE)
2081 for (i = 0; i < q.count; i++)
2083 Id p = q.elements[i];
2086 s = pool_tmpjoin(pool, prefix, " -", testcase_solvid2str(pool, -p));
2088 s = pool_tmpjoin(pool, prefix, " ", testcase_solvid2str(pool, p));
2089 strqueue_push(&sq, s);
2095 if ((resultflags & TESTCASE_RESULT_GENID) != 0)
2097 for (i = 0 ; i < solv->job.count; i += 2)
2100 if (solv->job.elements[i] != (SOLVER_NOOP | SOLVER_SOLVABLE_PROVIDES))
2102 id = solv->job.elements[i + 1];
2103 s = testcase_dep2str(pool, id);
2104 strqueue_push(&sq, pool_tmpjoin(pool, "genid dep ", s, 0));
2105 if ((id2 = testcase_str2dep(pool, s)) != id)
2107 s = pool_tmpjoin(pool, "genid roundtrip error: ", testcase_dep2str(pool, id2), 0);
2108 strqueue_push(&sq, s);
2110 dump_genid(pool, &sq, id, 1);
2113 if ((resultflags & TESTCASE_RESULT_REASON) != 0)
2117 FOR_POOL_SOLVABLES(p)
2120 int reason = solver_describe_decision(solv, p, &info);
2121 if (reason == SOLVER_REASON_UNRELATED)
2123 if (reason == SOLVER_REASON_WEAKDEP)
2125 solver_describe_weakdep_decision(solv, p, &whyq);
2128 for (i = 0; i < whyq.count; i += 3)
2130 reason = whyq.elements[i];
2131 p2 = whyq.elements[i + 1];
2132 id = whyq.elements[i + 2];
2133 s = pool_tmpjoin(pool, "reason ", testcase_solvid2str(pool, p), 0);
2134 s = pool_tmpappend(pool, s, " ", testcase_reason2str(reason));
2135 s = pool_tmpappend(pool, s, " ", testcase_dep2str(pool, id));
2137 s = pool_tmpappend(pool, s, " ", testcase_solvid2str(pool, p2));
2138 strqueue_push(&sq, s);
2143 s = pool_tmpjoin(pool, "reason ", testcase_solvid2str(pool, p), 0);
2144 s = pool_tmpappend(pool, s, " ", testcase_reason2str(reason));
2146 s = pool_tmpappend(pool, s, " ", testcase_ruleid(solv, info));
2147 strqueue_push(&sq, s);
2151 if ((resultflags & TESTCASE_RESULT_CLEANDEPS) != 0)
2156 solver_get_cleandeps(solv, &q);
2157 for (i = 0; i < q.count; i++)
2159 s = pool_tmpjoin(pool, "cleandeps ", testcase_solvid2str(pool, q.elements[i]), 0);
2160 strqueue_push(&sq, s);
2164 if ((resultflags & TESTCASE_RESULT_JOBS) != 0)
2166 for (i = 0; i < solv->job.count; i += 2)
2168 s = (char *)testcase_job2str(pool, solv->job.elements[i], solv->job.elements[i + 1]);
2169 s = pool_tmpjoin(pool, "job ", s, 0);
2170 strqueue_push(&sq, s);
2174 result = strqueue_join(&sq);
2181 testcase_write_mangled(Solver *solv, const char *dir, int resultflags, const char *testcasename, const char *resultname)
2183 Pool *pool = solv->pool;
2194 testcasename = "testcase.t";
2196 resultname = "solver.result";
2198 if (mkdir(dir, 0777) && errno != EEXIST)
2199 return pool_error(solv->pool, 0, "testcase_write: could not create directory '%s'", dir);
2201 FOR_REPOS(repoid, repo)
2203 const char *name = testcase_repoid2str(pool, repoid);
2205 if (repo->subpriority)
2206 sprintf(priobuf, "%d.%d", repo->priority, repo->subpriority);
2208 sprintf(priobuf, "%d", repo->priority);
2209 out = pool_tmpjoin(pool, name, ".repo", ".gz");
2210 for (i = 0; out[i]; i++)
2213 cmd = pool_tmpjoin(pool, "repo ", name, " ");
2214 cmd = pool_tmpappend(pool, cmd, priobuf, " ");
2215 cmd = pool_tmpappend(pool, cmd, "testtags ", out);
2216 strqueue_push(&sq, cmd);
2217 out = pool_tmpjoin(pool, dir, "/", out);
2218 if (!(fp = solv_xfopen(out, "w")))
2220 pool_error(solv->pool, 0, "testcase_write: could not open '%s' for writing", out);
2224 testcase_write_testtags(repo, fp);
2227 pool_error(solv->pool, 0, "testcase_write: write error");
2232 /* hmm, this is not optimal... we currently search for the lowest score */
2234 arch = pool->solvables[SYSTEMSOLVABLE].arch;
2235 for (i = 0; i < pool->lastarch; i++)
2237 if (pool->id2arch[i] == 1 && !lowscore)
2239 if (pool->id2arch[i] > 0x10000 && (!lowscore || pool->id2arch[i] < lowscore))
2242 lowscore = pool->id2arch[i];
2245 cmd = pool_tmpjoin(pool, "system ", pool->lastarch ? pool_id2str(pool, arch) : "unset", 0);
2246 for (i = 0; disttype2str[i].str != 0; i++)
2247 if (pool->disttype == disttype2str[i].type)
2249 pool_tmpappend(pool, cmd, " ", disttype2str[i].str ? disttype2str[i].str : "unknown");
2250 if (pool->installed)
2251 cmd = pool_tmpappend(pool, cmd, " ", testcase_repoid2str(pool, pool->installed->repoid));
2252 strqueue_push(&sq, cmd);
2253 s = testcase_getpoolflags(solv->pool);
2256 cmd = pool_tmpjoin(pool, "poolflags ", s, 0);
2257 strqueue_push(&sq, cmd);
2260 if (pool->vendorclasses)
2263 for (i = 0; pool->vendorclasses[i]; i++)
2265 cmd = pool_tmpappend(pool, cmd ? cmd : "vendorclass", " ", pool->vendorclasses[i]);
2266 if (!pool->vendorclasses[i + 1])
2268 strqueue_push(&sq, cmd);
2275 /* dump disabled packages (must come before the namespace/job lines) */
2276 if (pool->considered)
2279 FOR_POOL_SOLVABLES(p)
2280 if (!MAPTST(pool->considered, p))
2282 cmd = pool_tmpjoin(pool, "disable pkg ", testcase_solvid2str(pool, p), 0);
2283 strqueue_push(&sq, cmd);
2287 s = testcase_getsolverflags(solv);
2290 cmd = pool_tmpjoin(pool, "solverflags ", s, 0);
2291 strqueue_push(&sq, cmd);
2294 /* now dump all the ns callback values we know */
2295 if (pool->nscallback)
2299 for (rid = 1; rid < pool->nrels; rid++)
2301 Reldep *rd = pool->rels + rid;
2302 if (rd->flags != REL_NAMESPACE || rd->name == NAMESPACE_OTHERPROVIDERS)
2304 /* evaluate all namespace ids, skip empty results */
2305 d = pool_whatprovides(pool, MAKERELDEP(rid));
2306 if (!d || !pool->whatprovidesdata[d])
2308 cmd = pool_tmpjoin(pool, "namespace ", pool_id2str(pool, rd->name), "(");
2309 cmd = pool_tmpappend(pool, cmd, pool_id2str(pool, rd->evr), ")");
2310 for (; pool->whatprovidesdata[d]; d++)
2311 cmd = pool_tmpappend(pool, cmd, " ", testcase_solvid2str(pool, pool->whatprovidesdata[d]));
2312 strqueue_push(&sq, cmd);
2316 for (i = 0; i < solv->job.count; i += 2)
2318 cmd = (char *)testcase_job2str(pool, solv->job.elements[i], solv->job.elements[i + 1]);
2319 cmd = pool_tmpjoin(pool, "job ", cmd, 0);
2320 strqueue_push(&sq, cmd);
2323 if ((resultflags & ~TESTCASE_RESULT_REUSE_SOLVER) != 0)
2327 for (i = 0; resultflags2str[i].str; i++)
2328 if ((resultflags & resultflags2str[i].flag) != 0)
2329 cmd = pool_tmpappend(pool, cmd, cmd ? "," : 0, resultflags2str[i].str);
2330 cmd = pool_tmpjoin(pool, "result ", cmd ? cmd : "?", 0);
2331 cmd = pool_tmpappend(pool, cmd, " ", resultname);
2332 strqueue_push(&sq, cmd);
2333 result = testcase_solverresult(solv, resultflags);
2334 if (!strcmp(resultname, "<inline>"))
2338 strqueue_init(&rsq);
2339 strqueue_split(&rsq, result);
2340 for (i = 0; i < rsq.nstr; i++)
2342 cmd = pool_tmpjoin(pool, "#>", rsq.str[i], 0);
2343 strqueue_push(&sq, cmd);
2345 strqueue_free(&rsq);
2349 out = pool_tmpjoin(pool, dir, "/", resultname);
2350 if (!(fp = fopen(out, "w")))
2352 pool_error(solv->pool, 0, "testcase_write: could not open '%s' for writing", out);
2357 if (result && *result && fwrite(result, strlen(result), 1, fp) != 1)
2359 pool_error(solv->pool, 0, "testcase_write: write error");
2367 pool_error(solv->pool, 0, "testcase_write: write error");
2375 cmd = strqueue_join(&sq);
2376 out = pool_tmpjoin(pool, dir, "/", testcasename);
2377 if (!(fp = fopen(out, "w")))
2379 pool_error(solv->pool, 0, "testcase_write: could not open '%s' for writing", out);
2383 if (*cmd && fwrite(cmd, strlen(cmd), 1, fp) != 1)
2385 pool_error(solv->pool, 0, "testcase_write: write error");
2392 pool_error(solv->pool, 0, "testcase_write: write error");
2402 testcase_write(Solver *solv, const char *dir, int resultflags, const char *testcasename, const char *resultname)
2404 Pool *pool = solv->pool;
2407 const char **orignames;
2409 /* mangle repo names so that there are no conflicts */
2410 orignames = solv_calloc(pool->nrepos, sizeof(char *));
2411 for (repoid = 1; repoid < pool->nrepos; repoid++)
2413 Repo *repo = pool_id2repo(pool, repoid);
2414 char *buf = solv_malloc((repo->name ? strlen(repo->name) : 0) + 40);
2416 orignames[repoid] = repo->name;
2417 if (!repo->name || !repo->name[0])
2418 sprintf(buf, "#%d", repoid);
2420 strcpy(buf, repo->name);
2421 for (i = 0; buf[i]; i++)
2422 if (buf[i] == ' ' || buf[i] == '\t' || buf[i] == '/')
2424 mp = buf + strlen(buf);
2427 for (i = 1; i < repoid; i++)
2428 if (!strcmp(buf, pool_id2repo(pool, i)->name))
2432 sprintf(mp, "_%d", mangle++);
2436 r = testcase_write_mangled(solv, dir, resultflags, testcasename, resultname);
2437 for (repoid = 1; repoid < pool->nrepos; repoid++)
2439 Repo *repo = pool_id2repo(pool, repoid);
2440 solv_free((void *)repo->name);
2441 repo->name = orignames[repoid];
2443 solv_free(orignames);
2448 read_inline_file(FILE *fp, char **bufp, char **bufpp, int *buflp)
2450 char *result = solv_malloc(1024);
2457 if (rp - result + 256 >= resultl)
2459 resultl = rp - result;
2460 result = solv_realloc(result, resultl + 1024);
2461 rp = result + resultl;
2464 if (!fgets(rp, resultl - (rp - result), fp))
2467 if (rl && (rp == result || rp[-1] == '\n'))
2469 if (rl > 1 && rp[0] == '#' && rp[1] == '>')
2471 memmove(rp, rp + 2, rl - 2);
2476 while (rl + 16 > *buflp)
2478 *bufp = solv_realloc(*bufp, *buflp + 512);
2481 memmove(*bufp, rp, rl);
2482 if ((*bufp)[rl - 1] == '\n')
2488 (*bufpp) = *bufp + rl;
2505 char *result = solv_malloc(1024);
2512 if (rp - result + 256 >= resultl)
2514 resultl = rp - result;
2515 result = solv_realloc(result, resultl + 1024);
2516 rp = result + resultl;
2519 rl = fread(rp, 1, resultl - (rp - result), fp);
2531 str2resultflags(Pool *pool, char *s) /* modifies the string! */
2533 int i, resultflags = 0;
2536 char *se = strchr(s, ',');
2539 for (i = 0; resultflags2str[i].str; i++)
2540 if (!strcmp(s, resultflags2str[i].str))
2542 resultflags |= resultflags2str[i].flag;
2545 if (!resultflags2str[i].str)
2546 pool_error(pool, 0, "result: unknown flag '%s'", s);
2553 testcase_read(Pool *pool, FILE *fp, const char *testcase, Queue *job, char **resultp, int *resultflagsp)
2558 char *testcasedir, *s;
2564 int poolflagsreset = 0;
2565 int missing_features = 0;
2574 if (!fp && !(fp = fopen(testcase, "r")))
2576 pool_error(pool, 0, "testcase_read: could not open '%s'", testcase);
2579 testcasedir = solv_strdup(testcase);
2580 if ((s = strrchr(testcasedir, '/')) != 0)
2585 buf = solv_malloc(bufl);
2588 queue_init(&autoinstq);
2591 if (bufp - buf + 16 > bufl)
2594 buf = solv_realloc(buf, bufl + 512);
2598 if (!fgets(bufp, bufl - (bufp - buf), fp))
2602 if (!l || buf[l - 1] != '\n')
2609 while (*s && (*s == ' ' || *s == '\t'))
2611 if (!*s || *s == '#')
2614 /* split it in pieces */
2617 while (*s == ' ' || *s == '\t')
2621 pieces = solv_extend(pieces, npieces, 1, sizeof(*pieces), 7);
2622 pieces[npieces++] = s;
2623 while (*s && *s != ' ' && *s != '\t')
2628 pieces = solv_extend(pieces, npieces, 1, sizeof(*pieces), 7);
2629 pieces[npieces] = 0;
2630 if (!strcmp(pieces[0], "repo") && npieces >= 4)
2632 Repo *repo = repo_create(pool, pieces[1]);
2638 if (!poolflagsreset)
2641 testcase_resetpoolflags(pool); /* hmm */
2643 if (sscanf(pieces[2], "%d.%d", &prio, &subprio) != 2)
2646 prio = atoi(pieces[2]);
2648 repo->priority = prio;
2649 repo->subpriority = subprio;
2650 if (strcmp(pieces[3], "empty") != 0)
2652 const char *repotype = pool_tmpjoin(pool, pieces[3], 0, 0); /* gets overwritten in <inline> case */
2653 if (!strcmp(pieces[4], "<inline>"))
2655 char *idata = read_inline_file(fp, &buf, &bufp, &bufl);
2657 rfp = solv_xfopen_buf(rdata, &idata, 0, "rf");
2661 rdata = pool_tmpjoin(pool, testcasedir, pieces[4], 0);
2662 rfp = solv_xfopen(rdata, "r");
2666 pool_error(pool, 0, "testcase_read: could not open '%s'", rdata);
2668 else if (!strcmp(repotype, "testtags"))
2670 testcase_add_testtags(repo, rfp, 0);
2673 else if (!strcmp(repotype, "solv"))
2675 repo_add_solv(repo, rfp, 0);
2678 #if ENABLE_TESTCASE_HELIXREPO
2679 else if (!strcmp(repotype, "helix"))
2681 repo_add_helix(repo, rfp, 0);
2688 pool_error(pool, 0, "testcase_read: unknown repo type for repo '%s'", repo->name);
2692 else if (!strcmp(pieces[0], "system") && npieces >= 3)
2696 /* must set the disttype before the arch */
2698 if (strcmp(pieces[2], "*") != 0)
2700 char *dp = pieces[2];
2703 char *dpe = strchr(dp, ',');
2706 for (i = 0; disttype2str[i].str != 0; i++)
2707 if (!strcmp(disttype2str[i].str, dp))
2711 if (disttype2str[i].str)
2713 #ifdef MULTI_SEMANTICS
2714 if (pool->disttype != disttype2str[i].type)
2715 pool_setdisttype(pool, disttype2str[i].type);
2717 if (pool->disttype == disttype2str[i].type)
2724 pool_error(pool, 0, "testcase_read: system: could not change disttype to '%s'", pieces[2]);
2725 missing_features = 1;
2728 if (strcmp(pieces[1], "unset") == 0)
2729 pool_setarch(pool, 0);
2730 else if (pieces[1][0] == ':')
2731 pool_setarchpolicy(pool, pieces[1] + 1);
2733 pool_setarch(pool, pieces[1]);
2736 Repo *repo = testcase_str2repo(pool, pieces[3]);
2738 pool_error(pool, 0, "testcase_read: system: unknown repo '%s'", pieces[3]);
2740 pool_set_installed(pool, repo);
2743 else if (!strcmp(pieces[0], "job") && npieces > 1)
2749 pool_addfileprovides(pool);
2750 pool_createwhatprovides(pool);
2753 if (npieces >= 3 && !strcmp(pieces[2], "selection"))
2755 addselectionjob(pool, pieces + 1, npieces - 1, job, 0, 0);
2758 if (npieces >= 4 && !strcmp(pieces[2], "selection_matchdeps"))
2760 pieces[2] = pieces[1];
2761 addselectionjob(pool, pieces + 2, npieces - 2, job, SELECTIONJOB_MATCHDEPS, pool_str2id(pool, pieces[3], 1));
2764 if (npieces >= 4 && !strcmp(pieces[2], "selection_matchdepid"))
2766 pieces[2] = pieces[1];
2767 addselectionjob(pool, pieces + 2, npieces - 2, job, SELECTIONJOB_MATCHDEPID, pool_str2id(pool, pieces[3], 1));
2770 if (npieces >= 4 && !strcmp(pieces[2], "selection_matchsolvable"))
2772 pieces[2] = pieces[1];
2773 addselectionjob(pool, pieces + 2, npieces - 2, job, SELECTIONJOB_MATCHSOLVABLE, pool_str2id(pool, pieces[3], 1));
2777 for (sp = pieces[1]; sp < pieces[npieces - 1]; sp++)
2780 how = testcase_str2job(pool, pieces[1], &what);
2781 if (how >= 0 && job)
2782 queue_push2(job, how, what);
2784 else if (!strcmp(pieces[0], "vendorclass") && npieces > 1)
2786 pool_addvendorclass(pool, (const char **)(pieces + 1));
2788 else if (!strcmp(pieces[0], "namespace") && npieces > 1)
2790 int i = strlen(pieces[1]);
2791 s = strchr(pieces[1], '(');
2792 if (!s && pieces[1][i - 1] != ')')
2794 pool_error(pool, 0, "testcase_read: bad namespace '%s'", pieces[1]);
2802 pieces[1][i - 1] = 0;
2803 name = pool_str2id(pool, pieces[1], 1);
2804 evr = pool_str2id(pool, s + 1, 1);
2806 pieces[1][i - 1] = ')';
2807 id = pool_rel2id(pool, name, evr, REL_NAMESPACE, 1);
2808 for (i = 2; i < npieces; i++)
2809 queue_push(&q, testcase_str2solvid(pool, pieces[i]));
2810 /* now do the callback */
2813 pool_addfileprovides(pool);
2814 pool_createwhatprovides(pool);
2817 pool->whatprovides_rel[GETRELID(id)] = pool_queuetowhatprovides(pool, &q);
2821 else if (!strcmp(pieces[0], "poolflags"))
2824 if (!poolflagsreset)
2827 testcase_resetpoolflags(pool); /* hmm */
2829 for (i = 1; i < npieces; i++)
2830 testcase_setpoolflags(pool, pieces[i]);
2832 else if (!strcmp(pieces[0], "solverflags") && npieces > 1)
2837 solv = solver_create(pool);
2838 testcase_resetsolverflags(solv);
2840 for (i = 1; i < npieces; i++)
2841 testcase_setsolverflags(solv, pieces[i]);
2843 else if (!strcmp(pieces[0], "result") && npieces > 1)
2846 int resultflags = str2resultflags(pool, pieces[1]);
2850 rdata = pool_tmpjoin(pool, testcasedir, pieces[2], 0);
2851 if (!strcmp(pieces[2], "<inline>"))
2852 result = read_inline_file(fp, &buf, &bufp, &bufl);
2855 FILE *rfp = fopen(rdata, "r");
2857 pool_error(pool, 0, "testcase_read: could not open '%s'", rdata);
2860 result = read_file(rfp);
2870 *resultflagsp = resultflags;
2872 else if (!strcmp(pieces[0], "nextjob"))
2874 if (npieces == 2 && resultflagsp && !strcmp(pieces[1], "reusesolver"))
2875 *resultflagsp |= TESTCASE_RESULT_REUSE_SOLVER;
2878 else if (!strcmp(pieces[0], "disable") && npieces == 3)
2881 if (strcmp(pieces[1], "pkg"))
2883 pool_error(pool, 0, "testcase_read: bad disable type '%s'", pieces[1]);
2887 pool_createwhatprovides(pool);
2889 if (!pool->considered)
2891 pool->considered = solv_calloc(1, sizeof(Map));
2892 map_init(pool->considered, pool->nsolvables);
2893 map_setall(pool->considered);
2895 p = testcase_str2solvid(pool, pieces[2]);
2897 MAPCLR(pool->considered, p);
2899 pool_error(pool, 0, "disable: unknown package '%s'", pieces[2]);
2901 else if (!strcmp(pieces[0], "feature"))
2904 for (i = 1; i < npieces; i++)
2906 for (j = 0; features[j]; j++)
2907 if (!strcmp(pieces[i], features[j]))
2911 pool_error(pool, 0, "testcase_read: missing feature '%s'", pieces[i]);
2915 if (missing_features)
2918 else if (!strcmp(pieces[0], "genid") && npieces > 1)
2925 for (sp = pieces[2]; sp < pieces[npieces - 1]; sp++)
2929 genid = solv_extend(genid, ngenid, 1, sizeof(*genid), 7);
2930 if (!strcmp(pieces[1], "op") && npieces > 2)
2933 for (op = oplist; op->flags; op++)
2934 if (!strncmp(pieces[2], op->opname, strlen(op->opname)))
2938 pool_error(pool, 0, "testcase_read: genid: unknown op '%s'", pieces[2]);
2943 pool_error(pool, 0, "testcase_read: genid: out of stack");
2947 id = pool_rel2id(pool, genid[ngenid] , genid[ngenid + 1], op->flags, 1);
2949 else if (!strcmp(pieces[1], "lit"))
2950 id = pool_str2id(pool, npieces > 2 ? pieces[2] : "", 1);
2951 else if (!strcmp(pieces[1], "null"))
2953 else if (!strcmp(pieces[1], "dep"))
2954 id = testcase_str2dep(pool, pieces[2]);
2957 pool_error(pool, 0, "testcase_read: genid: unknown command '%s'", pieces[1]);
2960 genid[ngenid++] = id;
2962 else if (!strcmp(pieces[0], "autoinst") && npieces > 2)
2964 if (strcmp(pieces[1], "name"))
2966 pool_error(pool, 0, "testcase_read: autoinst: illegal mode");
2969 queue_push(&autoinstq, pool_str2id(pool, pieces[2], 1));
2971 else if (!strcmp(pieces[0], "evrcmp") && npieces == 3)
2973 Id evr1 = pool_str2id(pool, pieces[1], 1);
2974 Id evr2 = pool_str2id(pool, pieces[2], 1);
2975 int r = pool_evrcmp(pool, evr1, evr2, EVRCMP_COMPARE);
2976 r = r < 0 ? REL_LT : r > 0 ? REL_GT : REL_EQ;
2977 queue_push2(job, SOLVER_NOOP | SOLVER_SOLVABLE_PROVIDES, pool_rel2id(pool, evr1, evr2, r, 1));
2981 pool_error(pool, 0, "testcase_read: cannot parse command '%s'", pieces[0]);
2984 while (job && ngenid > 0)
2985 queue_push2(job, SOLVER_NOOP | SOLVER_SOLVABLE_PROVIDES, genid[--ngenid]);
2986 if (autoinstq.count)
2987 pool_add_userinstalled_jobs(pool, &autoinstq, job, GET_USERINSTALLED_NAMES | GET_USERINSTALLED_INVERTED);
2988 queue_free(&autoinstq);
2989 genid = solv_free(genid);
2990 buf = solv_free(buf);
2991 pieces = solv_free(pieces);
2992 solv_free(testcasedir);
2995 pool_addfileprovides(pool);
2996 pool_createwhatprovides(pool);
3000 solv = solver_create(pool);
3001 testcase_resetsolverflags(solv);
3005 if (missing_features)
3010 *resultflagsp = 77; /* hack for testsolv */
3016 testcase_resultdiff(const char *result1, const char *result2)
3018 Strqueue sq1, sq2, osq;
3020 strqueue_init(&sq1);
3021 strqueue_init(&sq2);
3022 strqueue_init(&osq);
3023 strqueue_split(&sq1, result1);
3024 strqueue_split(&sq2, result2);
3025 strqueue_sort(&sq1);
3026 strqueue_sort(&sq2);
3027 strqueue_diff(&sq1, &sq2, &osq);
3028 r = osq.nstr ? strqueue_join(&osq) : 0;
3029 strqueue_free(&sq1);
3030 strqueue_free(&sq2);
3031 strqueue_free(&osq);