2 * Copyright (c) 2012, Novell Inc.
4 * This program is licensed under the BSD license, read LICENSE.BSD
5 * for further information
17 #include "poolvendor.h"
19 #include "repo_solv.h"
21 #include "solverdebug.h"
24 #include "selection.h"
25 #include "solv_xfopen.h"
26 #if ENABLE_TESTCASE_HELIXREPO
27 #include "ext/repo_helix.h"
31 #include "tools_util.h"
33 static struct job2str {
37 { SOLVER_NOOP, "noop" },
38 { SOLVER_INSTALL, "install" },
39 { SOLVER_ERASE, "erase" },
40 { SOLVER_UPDATE, "update" },
41 { SOLVER_WEAKENDEPS, "weakendeps" },
42 { SOLVER_MULTIVERSION, "multiversion" },
43 { SOLVER_MULTIVERSION, "noobsoletes" }, /* old name */
44 { SOLVER_LOCK, "lock" },
45 { SOLVER_DISTUPGRADE, "distupgrade" },
46 { SOLVER_VERIFY, "verify" },
47 { SOLVER_DROP_ORPHANED, "droporphaned" },
48 { SOLVER_USERINSTALLED, "userinstalled" },
49 { SOLVER_ALLOWUNINSTALL, "allowuninstall" },
50 { SOLVER_FAVOR, "favor" },
51 { SOLVER_DISFAVOR, "disfavor" },
55 static struct jobflags2str {
59 { SOLVER_WEAK, "weak" },
60 { SOLVER_ESSENTIAL, "essential" },
61 { SOLVER_CLEANDEPS, "cleandeps" },
62 { SOLVER_ORUPDATE, "orupdate" },
63 { SOLVER_FORCEBEST, "forcebest" },
64 { SOLVER_TARGETED, "targeted" },
65 { SOLVER_NOTBYUSER, "notbyuser" },
66 { SOLVER_SETEV, "setev" },
67 { SOLVER_SETEVR, "setevr" },
68 { SOLVER_SETARCH, "setarch" },
69 { SOLVER_SETVENDOR, "setvendor" },
70 { SOLVER_SETREPO, "setrepo" },
71 { SOLVER_NOAUTOSET, "noautoset" },
75 static struct resultflags2str {
78 } resultflags2str[] = {
79 { TESTCASE_RESULT_TRANSACTION, "transaction" },
80 { TESTCASE_RESULT_PROBLEMS, "problems" },
81 { TESTCASE_RESULT_ORPHANED, "orphaned" },
82 { TESTCASE_RESULT_RECOMMENDED, "recommended" },
83 { TESTCASE_RESULT_UNNEEDED, "unneeded" },
84 { TESTCASE_RESULT_ALTERNATIVES, "alternatives" },
85 { TESTCASE_RESULT_RULES, "rules" },
86 { TESTCASE_RESULT_GENID, "genid" },
87 { TESTCASE_RESULT_REASON, "reason" },
88 { TESTCASE_RESULT_CLEANDEPS, "cleandeps" },
89 { TESTCASE_RESULT_JOBS, "jobs" },
93 static struct solverflags2str {
97 } solverflags2str[] = {
98 { SOLVER_FLAG_ALLOW_DOWNGRADE, "allowdowngrade", 0 },
99 { SOLVER_FLAG_ALLOW_NAMECHANGE, "allownamechange", 1 },
100 { SOLVER_FLAG_ALLOW_ARCHCHANGE, "allowarchchange", 0 },
101 { SOLVER_FLAG_ALLOW_VENDORCHANGE, "allowvendorchange", 0 },
102 { SOLVER_FLAG_ALLOW_UNINSTALL, "allowuninstall", 0 },
103 { SOLVER_FLAG_NO_UPDATEPROVIDE, "noupdateprovide", 0 },
104 { SOLVER_FLAG_SPLITPROVIDES, "splitprovides", 0 },
105 { SOLVER_FLAG_IGNORE_RECOMMENDED, "ignorerecommended", 0 },
106 { SOLVER_FLAG_ADD_ALREADY_RECOMMENDED, "addalreadyrecommended", 0 },
107 { SOLVER_FLAG_NO_INFARCHCHECK, "noinfarchcheck", 0 },
108 { SOLVER_FLAG_KEEP_EXPLICIT_OBSOLETES, "keepexplicitobsoletes", 0 },
109 { SOLVER_FLAG_BEST_OBEY_POLICY, "bestobeypolicy", 0 },
110 { SOLVER_FLAG_NO_AUTOTARGET, "noautotarget", 0 },
111 { SOLVER_FLAG_DUP_ALLOW_DOWNGRADE, "dupallowdowngrade", 1 },
112 { SOLVER_FLAG_DUP_ALLOW_ARCHCHANGE, "dupallowarchchange", 1 },
113 { SOLVER_FLAG_DUP_ALLOW_VENDORCHANGE, "dupallowvendorchange", 1 },
114 { SOLVER_FLAG_DUP_ALLOW_NAMECHANGE, "dupallownamechange", 1 },
115 { SOLVER_FLAG_KEEP_ORPHANS, "keeporphans", 0 },
116 { SOLVER_FLAG_BREAK_ORPHANS, "breakorphans", 0 },
117 { SOLVER_FLAG_FOCUS_INSTALLED, "focusinstalled", 0 },
118 { SOLVER_FLAG_YUM_OBSOLETES, "yumobsoletes", 0 },
119 { SOLVER_FLAG_NEED_UPDATEPROVIDE, "needupdateprovide", 0 },
120 { SOLVER_FLAG_URPM_REORDER, "urpmreorder", 0 },
121 { SOLVER_FLAG_FOCUS_BEST, "focusbest", 0 },
122 { SOLVER_FLAG_STRONG_RECOMMENDS, "strongrecommends", 0 },
123 { SOLVER_FLAG_INSTALL_ALSO_UPDATES, "installalsoupdates", 0 },
127 static struct poolflags2str {
131 } poolflags2str[] = {
132 { POOL_FLAG_PROMOTEEPOCH, "promoteepoch", 0 },
133 { POOL_FLAG_FORBIDSELFCONFLICTS, "forbidselfconflicts", 0 },
134 { POOL_FLAG_OBSOLETEUSESPROVIDES, "obsoleteusesprovides", 0 },
135 { POOL_FLAG_IMPLICITOBSOLETEUSESPROVIDES, "implicitobsoleteusesprovides", 0 },
136 { POOL_FLAG_OBSOLETEUSESCOLORS, "obsoleteusescolors", 0 },
137 { POOL_FLAG_IMPLICITOBSOLETEUSESCOLORS, "implicitobsoleteusescolors", 0 },
138 { POOL_FLAG_NOINSTALLEDOBSOLETES, "noinstalledobsoletes", 0 },
139 { POOL_FLAG_HAVEDISTEPOCH, "havedistepoch", 0 },
140 { POOL_FLAG_NOOBSOLETESMULTIVERSION, "noobsoletesmultiversion", 0 },
141 { POOL_FLAG_ADDFILEPROVIDESFILTERED, "addfileprovidesfiltered", 0 },
142 { POOL_FLAG_NOWHATPROVIDESAUX, "nowhatprovidesaux", 0 },
146 static struct disttype2str {
150 { DISTTYPE_RPM, "rpm" },
151 { DISTTYPE_DEB, "deb" },
152 { DISTTYPE_ARCH, "arch" },
153 { DISTTYPE_HAIKU, "haiku" },
157 static struct selflags2str {
161 { SELECTION_NAME, "name" },
162 { SELECTION_PROVIDES, "provides" },
163 { SELECTION_FILELIST, "filelist" },
164 { SELECTION_CANON, "canon" },
165 { SELECTION_DOTARCH, "dotarch" },
166 { SELECTION_REL, "rel" },
167 { SELECTION_INSTALLED_ONLY, "installedonly" },
168 { SELECTION_GLOB, "glob" },
169 { SELECTION_FLAT, "flat" },
170 { SELECTION_NOCASE, "nocase" },
171 { SELECTION_SOURCE_ONLY, "sourceonly" },
172 { SELECTION_WITH_SOURCE, "withsource" },
173 { SELECTION_SKIP_KIND, "skipkind" },
174 { SELECTION_MATCH_DEPSTR, "depstr" },
175 { SELECTION_WITH_DISABLED, "withdisabled" },
176 { SELECTION_WITH_BADARCH, "withbadarch" },
180 static const char *features[] = {
181 #ifdef ENABLE_LINKED_PKGS
184 #ifdef ENABLE_COMPLEX_DEPS
187 #if ENABLE_TESTCASE_HELIXREPO
188 "testcase_helixrepo",
193 typedef struct strqueue {
198 #define STRQUEUE_BLOCK 63
201 strqueue_init(Strqueue *q)
208 strqueue_free(Strqueue *q)
211 for (i = 0; i < q->nstr; i++)
212 solv_free(q->str[i]);
213 q->str = solv_free(q->str);
218 strqueue_push(Strqueue *q, const char *s)
220 q->str = solv_extend(q->str, q->nstr, 1, sizeof(*q->str), STRQUEUE_BLOCK);
221 q->str[q->nstr++] = solv_strdup(s);
225 strqueue_pushjoin(Strqueue *q, const char *s1, const char *s2, const char *s3)
227 q->str = solv_extend(q->str, q->nstr, 1, sizeof(*q->str), STRQUEUE_BLOCK);
228 q->str[q->nstr++] = solv_dupjoin(s1, s2, s3);
232 strqueue_sort_cmp(const void *ap, const void *bp, void *dp)
234 const char *a = *(const char **)ap;
235 const char *b = *(const char **)bp;
236 return strcmp(a ? a : "", b ? b : "");
240 strqueue_sort(Strqueue *q)
243 solv_sort(q->str, q->nstr, sizeof(*q->str), strqueue_sort_cmp, 0);
247 strqueue_sort_u(Strqueue *q)
251 for (i = j = 0; i < q->nstr; i++)
252 if (!j || strqueue_sort_cmp(q->str + i, q->str + j - 1, 0) != 0)
253 q->str[j++] = q->str[i];
258 strqueue_join(Strqueue *q)
262 for (i = 0; i < q->nstr; i++)
264 l += strlen(q->str[i]) + 1;
265 l++; /* trailing \0 */
268 for (i = 0; i < q->nstr; i++)
271 strcpy(rp, q->str[i]);
280 strqueue_split(Strqueue *q, const char *s)
285 while ((p = strchr(s, '\n')) != 0)
287 q->str = solv_extend(q->str, q->nstr, 1, sizeof(*q->str), STRQUEUE_BLOCK);
288 q->str[q->nstr] = solv_malloc(p - s + 1);
290 memcpy(q->str[q->nstr], s, p - s);
291 q->str[q->nstr][p - s] = 0;
300 strqueue_diff(Strqueue *sq1, Strqueue *sq2, Strqueue *osq)
303 while (i < sq1->nstr && j < sq2->nstr)
305 int r = strqueue_sort_cmp(sq1->str + i, sq2->str + j, 0);
309 strqueue_pushjoin(osq, "-", sq1->str[i++], 0);
311 strqueue_pushjoin(osq, "+", sq2->str[j++], 0);
313 while (i < sq1->nstr)
314 strqueue_pushjoin(osq, "-", sq1->str[i++], 0);
315 while (j < sq2->nstr)
316 strqueue_pushjoin(osq, "+", sq2->str[j++], 0);
321 testcase_id2str(Pool *pool, Id id, int isname)
323 const char *s = pool_id2str(pool, id);
326 int bad = 0, paren = 0, parenbad = 0;
332 if (strchr("[(<=>!", *s))
334 if (!strncmp(s, "namespace:", 10))
336 for (ss = s + bad; *ss; ss++)
338 if (*ss == ' ' || *ss == '\\' || *(unsigned char *)ss < 32 || *ss == '(' || *ss == ')')
341 paren = paren == 0 ? 1 : -1;
344 paren = paren == 1 ? 0 : -1;
349 if (isname && ss - s > 4 && !strcmp(ss - 4, ":any"))
351 if (!paren && !(bad - parenbad))
354 /* we need escaping! */
355 s2 = s2p = pool_alloctmpspace(pool, strlen(s) + bad * 2 + 1);
356 if (!strncmp(s, "namespace:", 10))
358 strcpy(s2p, "namespace\\3a");
366 if ((ss == s && strchr("[(<=>!", *s)) || *ss == ' ' || *ss == '\\' || *(unsigned char *)ss < 32 || *ss == '(' || *ss == ')')
369 solv_bin2hex((unsigned char *)ss, 1, s2p);
374 if (isname && s2p - s2 > 4 && !strcmp(s2p - 4, ":any"))
375 strcpy(s2p - 4, "\\3aany");
384 { REL_GT | REL_LT | REL_EQ, "<=>" },
385 { REL_LT | REL_EQ, "<=" },
386 { REL_GT | REL_EQ, ">=" },
388 { REL_GT | REL_LT, "<>" },
392 { REL_WITHOUT , "-" },
393 { REL_NAMESPACE , "<NAMESPACE>" },
395 { REL_MULTIARCH, "<MULTIARCH>" },
396 { REL_FILECONFLICT, "<FILECONFLICT>" },
397 { REL_COND, "<IF>" },
398 { REL_COMPAT, "compat >=" },
399 { REL_KIND, "<KIND>" },
400 { REL_ELSE, "<ELSE>" },
401 { REL_ERROR, "<ERROR>" },
402 { REL_UNLESS, "<UNLESS>" },
408 testcase_dep2str_complex(Pool *pool, char *s, Id id, int addparens)
417 s2 = testcase_id2str(pool, id, 1);
418 s = pool_tmpappend(pool, s, s2, 0);
419 pool_freetmpspace(pool, s2);
422 rd = GETRELDEP(pool, id);
424 /* check for special shortcuts */
425 if (rd->flags == REL_NAMESPACE && !ISRELDEP(rd->name) && !strncmp(pool_id2str(pool, rd->name), "namespace:", 10))
427 s = pool_tmpappend(pool, s, pool_id2str(pool, rd->name), "(");
428 s = testcase_dep2str_complex(pool, s, rd->evr, 0);
429 return pool_tmpappend(pool, s, ")", 0);
431 if (rd->flags == REL_MULTIARCH && !ISRELDEP(rd->name) && rd->evr == ARCH_ANY)
433 /* append special :any suffix */
434 s2 = testcase_id2str(pool, rd->name, 1);
435 s = pool_tmpappend(pool, s, s2, ":any");
436 pool_freetmpspace(pool, s2);
441 if (ISRELDEP(rd->name))
443 Reldep *rd2 = GETRELDEP(pool, rd->name);
445 if (rd->flags > 7 && rd->flags != REL_COMPAT && rd2->flags && rd2->flags <= 7)
450 s = pool_tmpappend(pool, s, "(", 0);
451 s = testcase_dep2str_complex(pool, s, rd->name, needparens);
453 for (op = oplist; op->flags; op++)
454 if (rd->flags == op->flags)
458 s = pool_tmpappend(pool, s, " ", op->opname);
459 s = pool_tmpappend(pool, s, " ", 0);
464 sprintf(buf, " <%u> ", rd->flags);
465 s = pool_tmpappend(pool, s, buf, 0);
469 if (ISRELDEP(rd->evr))
471 Reldep *rd2 = GETRELDEP(pool, rd->evr);
473 if (rd->flags > 7 && rd2->flags && rd2->flags <= 7)
475 if (rd->flags == REL_AND && rd2->flags == REL_AND)
476 needparens = 0; /* chain */
477 if (rd->flags == REL_OR && rd2->flags == REL_OR)
478 needparens = 0; /* chain */
479 if (rd->flags > 0 && rd->flags < 8 && rd2->flags == REL_COMPAT)
480 needparens = 0; /* chain */
482 if (!ISRELDEP(rd->evr))
484 s2 = testcase_id2str(pool, rd->evr, 0);
485 s = pool_tmpappend(pool, s, s2, 0);
486 pool_freetmpspace(pool, s2);
489 s = (char *)testcase_dep2str_complex(pool, s, rd->evr, needparens);
491 s = pool_tmpappend(pool, s, ")", 0);
496 testcase_dep2str(Pool *pool, Id id)
500 return testcase_id2str(pool, id, 1);
501 s = pool_alloctmpspace(pool, 1);
503 return testcase_dep2str_complex(pool, s, id, 0);
507 /* Convert a simple string. Also handle the :any suffix */
509 testcase_str2dep_simple(Pool *pool, const char **sp, int isname)
516 for (s = *sp; *s; s++)
520 if (*s == ' ' || *(unsigned char *)s < 32)
524 if (*s == ')' && paren-- <= 0)
527 if (isname && s - *sp > 4 && !strncmp(s - 4, ":any", 4))
534 if (s - *sp == 6 && !strncmp(*sp, "<NULL>", 6))
537 id = pool_strn2id(pool, *sp, s - *sp, 1);
539 else if (s - *sp == 3 && !strncmp(*sp, "\\00", 3))
543 char buf[128], *bp, *bp2;
545 bp = s - *sp >= 128 ? solv_malloc(s - *sp + 1) : buf;
546 for (bp2 = bp, sp2 = *sp; sp2 < s;)
550 solv_hex2bin(&sp2, (unsigned char *)bp2 - 1, 1);
553 id = pool_str2id(pool, bp, 1);
559 id = pool_rel2id(pool, id, ARCH_ANY, REL_MULTIARCH, 1);
568 testcase_str2dep_complex(Pool *pool, const char **sp, int relop)
571 Id flags, id, id2, namespaceid = 0;
574 while (*s == ' ' || *s == '\t')
576 if (!strncmp(s, "namespace:", 10))
578 /* special namespace hack */
580 for (s2 = s + 10; *s2 && *s2 != '('; s2++)
584 namespaceid = pool_strn2id(pool, s, s2 - s, 1);
591 id = testcase_str2dep_complex(pool, &s, 0);
600 id = testcase_str2dep_simple(pool, &s, relop ? 0 : 1);
602 id = pool_rel2id(pool, namespaceid, id, REL_NAMESPACE, 1);
606 while (*s == ' ' || *s == '\t')
608 if (!*s || *s == ')' || (relop && strncmp(s, "compat >= ", 10) != 0))
614 /* we have an op! Find the end */
616 if (s[0] == '<' && (s[1] >= '0' && s[1] <= '9'))
619 for (s2 = s + 1; *s2 >= '0' && *s2 <= '9'; s2++)
623 flags = strtoul(s + 1, 0, 10);
629 for (op = oplist; op->flags; op++)
630 if (!strncmp(s, op->opname, strlen(op->opname)))
638 s += strlen(op->opname);
640 id2 = testcase_str2dep_complex(pool, &s, flags > 0 && flags < 8);
646 id = pool_rel2id(pool, id, id2, flags, 1);
651 testcase_str2dep(Pool *pool, const char *s)
653 Id id = testcase_str2dep_complex(pool, &s, 0);
654 return s && !*s ? id : 0;
657 /**********************************************************/
660 testcase_repoid2str(Pool *pool, Id repoid)
662 Repo *repo = pool_id2repo(pool, repoid);
665 char *r = pool_tmpjoin(pool, repo->name, 0, 0);
667 for (rp = r; *rp; rp++)
668 if (*rp == ' ' || *rp == '\t')
675 sprintf(buf, "#%d", repoid);
676 return pool_tmpjoin(pool, buf, 0, 0);
681 testcase_solvid2str(Pool *pool, Id p)
683 Solvable *s = pool->solvables + p;
684 const char *n, *e, *a;
687 if (p == SYSTEMSOLVABLE)
689 n = pool_id2str(pool, s->name);
690 e = pool_id2str(pool, s->evr);
691 a = pool_id2str(pool, s->arch);
692 str = pool_alloctmpspace(pool, strlen(n) + strlen(e) + strlen(a) + 3);
693 sprintf(str, "%s-%s.%s", n, e, a);
695 return pool_tmpappend(pool, str, "@", 0);
699 char *str2 = pool_tmpappend(pool, str, "@", s->repo->name);
701 if (str2[l] == ' ' || str2[l] == '\t')
705 sprintf(buf, "@#%d", s->repo->repoid);
706 return pool_tmpappend(pool, str, buf, 0);
710 testcase_str2repo(Pool *pool, const char *str)
714 if (str[0] == '#' && (str[1] >= '0' && str[1] <= '9'))
718 for (j = 1; str[j] >= '0' && str[j] <= '9'; j++)
719 repoid = repoid * 10 + (str[j] - '0');
720 if (!str[j] && repoid > 0 && repoid < pool->nrepos)
721 repo = pool_id2repo(pool, repoid);
725 FOR_REPOS(repoid, repo)
730 l = strlen(repo->name);
731 for (i = 0; i < l; i++)
733 int c = repo->name[i];
734 if (c == ' ' || c == '\t')
739 if (i == l && !str[l])
742 if (repoid >= pool->nrepos)
749 testcase_str2solvid(Pool *pool, const char *str)
751 int i, l = strlen(str);
758 if (*str == '@' && !strcmp(str, "@SYSTEM"))
759 return SYSTEMSOLVABLE;
761 for (i = l - 1; i >= 0; i--)
762 if (str[i] == '@' && (repo = testcase_str2repo(pool, str + i + 1)) != 0)
767 /* now find the arch (if present) */
769 for (i = repostart - 1; i > 0; i--)
772 arch = pool_strn2id(pool, str + i + 1, repostart - (i + 1), 0);
777 /* now find the name */
778 for (i = repostart - 1; i > 0; i--)
782 Id nid, evrid, p, pp;
783 nid = pool_strn2id(pool, str, i, 0);
786 evrid = pool_strn2id(pool, str + i + 1, repostart - (i + 1), 0);
789 /* first check whatprovides */
790 FOR_PROVIDES(p, pp, nid)
792 Solvable *s = pool->solvables + p;
793 if (s->name != nid || s->evr != evrid)
795 if (repo && s->repo != repo)
797 if (arch && s->arch != arch)
801 /* maybe it's not installable and thus not in whatprovides. do a slow search */
805 FOR_REPO_SOLVABLES(repo, p, s)
807 if (s->name != nid || s->evr != evrid)
809 if (arch && s->arch != arch)
816 FOR_POOL_SOLVABLES(p)
818 Solvable *s = pool->solvables + p;
819 if (s->name != nid || s->evr != evrid)
821 if (arch && s->arch != arch)
832 testcase_job2str(Pool *pool, Id how, Id what)
839 Id select = how & SOLVER_SELECTMASK;
841 for (i = 0; job2str[i].str; i++)
842 if ((how & SOLVER_JOBMASK) == job2str[i].job)
844 jobstr = job2str[i].str ? job2str[i].str : "unknown";
845 if (select == SOLVER_SOLVABLE)
848 pkgstr = testcase_solvid2str(pool, what);
850 else if (select == SOLVER_SOLVABLE_NAME)
853 pkgstr = testcase_dep2str(pool, what);
855 else if (select == SOLVER_SOLVABLE_PROVIDES)
857 selstr = " provides ";
858 pkgstr = testcase_dep2str(pool, what);
860 else if (select == SOLVER_SOLVABLE_ONE_OF)
865 while ((p = pool->whatprovidesdata[what++]) != 0)
867 const char *s = testcase_solvid2str(pool, p);
870 pkgstr = pool_tmpappend(pool, pkgstr, " ", s);
871 pool_freetmpspace(pool, s);
879 else if (select == SOLVER_SOLVABLE_REPO)
881 Repo *repo = pool_id2repo(pool, what);
886 sprintf(buf, "#%d", repo->repoid);
887 pkgstr = pool_tmpjoin(pool, buf, 0, 0);
890 pkgstr = pool_tmpjoin(pool, repo->name, 0, 0);
892 else if (select == SOLVER_SOLVABLE_ALL)
899 selstr = " unknown ";
902 ret = pool_tmpjoin(pool, jobstr, selstr, pkgstr);
904 ret = pool_tmpappend(pool, ret, " ", 0);
905 for (i = 0; jobflags2str[i].str; i++)
906 if ((how & jobflags2str[i].flag) != 0)
907 ret = pool_tmpappend(pool, ret, ",", jobflags2str[i].str);
913 ret = pool_tmpappend(pool, ret, "]", 0);
919 str2selflags(Pool *pool, char *s) /* modifies the string! */
924 char *se = strchr(s, ',');
927 for (i = 0; selflags2str[i].str; i++)
928 if (!strcmp(s, selflags2str[i].str))
930 selflags |= selflags2str[i].flag;
933 if (!selflags2str[i].str)
934 pool_error(pool, 0, "str2job: unknown selection flag '%s'", s);
941 str2jobflags(Pool *pool, char *s) /* modifies the string */
946 char *se = strchr(s, ',');
949 for (i = 0; jobflags2str[i].str; i++)
950 if (!strcmp(s, jobflags2str[i].str))
952 jobflags |= jobflags2str[i].flag;
955 if (!jobflags2str[i].str)
956 pool_error(pool, 0, "str2job: unknown job flag '%s'", s);
963 testcase_str2job(Pool *pool, const char *str, Id *whatp)
973 /* so we can patch it */
974 s = pool_tmpjoin(pool, str, 0, 0);
975 /* split it in pieces */
978 while (*s == ' ' || *s == '\t')
982 pieces = solv_extend(pieces, npieces, 1, sizeof(*pieces), 7);
983 pieces[npieces++] = s;
984 while (*s && *s != ' ' && *s != '\t')
991 pool_error(pool, -1, "str2job: bad line '%s'", str);
996 for (i = 0; job2str[i].str; i++)
997 if (!strcmp(pieces[0], job2str[i].str))
1001 pool_error(pool, -1, "str2job: unknown job '%s'", str);
1005 job = job2str[i].job;
1009 char *flags = pieces[npieces - 1];
1010 if (*flags == '[' && flags[strlen(flags) - 1] == ']')
1014 flags[strlen(flags) - 1] = 0;
1015 job |= str2jobflags(pool, flags);
1018 if (!strcmp(pieces[1], "pkg"))
1022 pool_error(pool, -1, "str2job: bad pkg selector in '%s'", str);
1026 job |= SOLVER_SOLVABLE;
1027 what = testcase_str2solvid(pool, pieces[2]);
1030 pool_error(pool, -1, "str2job: unknown package '%s'", pieces[2]);
1035 else if (!strcmp(pieces[1], "name") || !strcmp(pieces[1], "provides"))
1037 /* join em again for dep2str... */
1039 for (sp = pieces[2]; sp < pieces[npieces - 1]; sp++)
1043 if (pieces[1][0] == 'p' && strncmp(pieces[2], "namespace:", 10) == 0)
1045 char *spe = strchr(pieces[2], '(');
1046 int l = strlen(pieces[2]);
1047 if (spe && pieces[2][l - 1] == ')')
1049 /* special namespace provides */
1050 if (strcmp(spe, "(<NULL>)") != 0)
1052 pieces[2][l - 1] = 0;
1053 what = testcase_str2dep(pool, spe + 1);
1054 pieces[2][l - 1] = ')';
1056 what = pool_rel2id(pool, pool_strn2id(pool, pieces[2], spe - pieces[2], 1), what, REL_NAMESPACE, 1);
1060 what = testcase_str2dep(pool, pieces[2]);
1061 if (pieces[1][0] == 'n')
1062 job |= SOLVER_SOLVABLE_NAME;
1064 job |= SOLVER_SOLVABLE_PROVIDES;
1066 else if (!strcmp(pieces[1], "oneof"))
1069 job |= SOLVER_SOLVABLE_ONE_OF;
1071 if (npieces > 3 && strcmp(pieces[2], "nothing") != 0)
1073 for (i = 2; i < npieces; i++)
1075 Id p = testcase_str2solvid(pool, pieces[i]);
1078 pool_error(pool, -1, "str2job: unknown package '%s'", pieces[i]);
1086 what = pool_queuetowhatprovides(pool, &q);
1089 else if (!strcmp(pieces[1], "repo"))
1094 pool_error(pool, -1, "str2job: bad line '%s'", str);
1098 repo = testcase_str2repo(pool, pieces[2]);
1101 pool_error(pool, -1, "str2job: unknown repo '%s'", pieces[2]);
1105 job |= SOLVER_SOLVABLE_REPO;
1106 what = repo->repoid;
1108 else if (!strcmp(pieces[1], "all"))
1110 if (npieces != 3 && strcmp(pieces[2], "packages") != 0)
1112 pool_error(pool, -1, "str2job: bad line '%s'", str);
1116 job |= SOLVER_SOLVABLE_ALL;
1121 pool_error(pool, -1, "str2job: unknown selection in '%s'", str);
1131 addselectionjob(Pool *pool, char **pieces, int npieces, Queue *jobqueue, int keyname)
1139 for (i = 0; job2str[i].str; i++)
1140 if (!strcmp(pieces[0], job2str[i].str))
1142 if (!job2str[i].str)
1143 return pool_error(pool, -1, "selstr2job: unknown job '%s'", pieces[0]);
1144 job = job2str[i].job;
1147 char *flags = pieces[npieces - 1];
1148 if (*flags == '[' && flags[strlen(flags) - 1] == ']')
1152 flags[strlen(flags) - 1] = 0;
1153 job |= str2jobflags(pool, flags);
1157 return pool_error(pool, -1, "selstr2job: no selection flags");
1158 selflags = str2selflags(pool, pieces[npieces - 1]);
1159 /* re-join pieces */
1160 for (sp = pieces[2]; sp < pieces[npieces - 2]; sp++)
1165 r = selection_make_matchdeps(pool, &sel, pieces[2], selflags, keyname, 0);
1166 else if (keyname < 0)
1167 r = selection_make_matchdepid(pool, &sel, testcase_str2dep(pool, pieces[2]), selflags, -keyname, 0);
1169 r = selection_make(pool, &sel, pieces[2], selflags);
1170 for (i = 0; i < sel.count; i += 2)
1171 queue_push2(jobqueue, job | sel.elements[i], sel.elements[i + 1]);
1177 writedeps(Repo *repo, FILE *fp, const char *tag, Id key, Solvable *s, Offset off)
1179 Pool *pool = repo->pool;
1186 dp = repo->idarraydata + off;
1187 while ((id = *dp++) != 0)
1189 if (key == SOLVABLE_REQUIRES && id == SOLVABLE_PREREQMARKER)
1192 fprintf(fp, "-%s\n", tag);
1197 if (key == SOLVABLE_PROVIDES && id == SOLVABLE_FILEMARKER)
1199 idstr = testcase_dep2str(pool, id);
1202 fprintf(fp, "+%s\n", tag);
1205 fprintf(fp, "%s\n", idstr);
1208 fprintf(fp, "-%s\n", tag);
1212 writefilelist(Repo *repo, FILE *fp, const char *tag, Solvable *s)
1214 Pool *pool = repo->pool;
1218 dataiterator_init(&di, pool, repo, s - pool->solvables, SOLVABLE_FILELIST, 0, 0);
1219 while (dataiterator_step(&di))
1221 const char *s = repodata_dir2str(di.data, di.kv.id, di.kv.str);
1224 fprintf(fp, "+%s\n", tag);
1227 fprintf(fp, "%s\n", s);
1230 fprintf(fp, "-%s\n", tag);
1231 dataiterator_free(&di);
1235 testcase_write_testtags(Repo *repo, FILE *fp)
1237 Pool *pool = repo->pool;
1243 const char *release;
1248 fprintf(fp, "=Ver: 3.0\n");
1250 FOR_REPO_SOLVABLES(repo, p, s)
1252 name = pool_id2str(pool, s->name);
1253 evr = pool_id2str(pool, s->evr);
1254 arch = pool_id2str(pool, s->arch);
1255 release = strrchr(evr, '-');
1257 release = evr + strlen(evr);
1258 fprintf(fp, "=Pkg: %s %.*s %s %s\n", name, (int)(release - evr), evr, *release && release[1] ? release + 1 : "-", arch);
1259 tmp = solvable_lookup_str(s, SOLVABLE_SUMMARY);
1261 fprintf(fp, "=Sum: %s\n", tmp);
1262 writedeps(repo, fp, "Req:", SOLVABLE_REQUIRES, s, s->requires);
1263 writedeps(repo, fp, "Prv:", SOLVABLE_PROVIDES, s, s->provides);
1264 writedeps(repo, fp, "Obs:", SOLVABLE_OBSOLETES, s, s->obsoletes);
1265 writedeps(repo, fp, "Con:", SOLVABLE_CONFLICTS, s, s->conflicts);
1266 writedeps(repo, fp, "Rec:", SOLVABLE_RECOMMENDS, s, s->recommends);
1267 writedeps(repo, fp, "Sup:", SOLVABLE_SUPPLEMENTS, s, s->supplements);
1268 writedeps(repo, fp, "Sug:", SOLVABLE_SUGGESTS, s, s->suggests);
1269 writedeps(repo, fp, "Enh:", SOLVABLE_ENHANCES, s, s->enhances);
1270 if (solvable_lookup_idarray(s, SOLVABLE_PREREQ_IGNOREINST, &q))
1273 fprintf(fp, "+Ipr:\n");
1274 for (i = 0; i < q.count; i++)
1275 fprintf(fp, "%s\n", testcase_dep2str(pool, q.elements[i]));
1276 fprintf(fp, "-Ipr:\n");
1279 fprintf(fp, "=Vnd: %s\n", pool_id2str(pool, s->vendor));
1280 ti = solvable_lookup_num(s, SOLVABLE_BUILDTIME, 0);
1282 fprintf(fp, "=Tim: %u\n", ti);
1283 writefilelist(repo, fp, "Fls:", s);
1289 static inline Offset
1290 adddep(Repo *repo, Offset olddeps, char *str, Id marker)
1292 Id id = *str == '/' ? pool_str2id(repo->pool, str, 1) : testcase_str2dep(repo->pool, str);
1293 return repo_addid_dep(repo, olddeps, id, marker);
1297 finish_v2_solvable(Pool *pool, Repodata *data, Solvable *s, char *filelist, int nfilelist)
1303 for (l = 0; l < nfilelist; l += strlen(filelist + l) + 1)
1305 char *p = strrchr(filelist + l, '/');
1309 did = repodata_str2dir(data, filelist + l, 1);
1312 did = repodata_str2dir(data, "/", 1);
1313 repodata_add_dirstr(data, s - pool->solvables, SOLVABLE_FILELIST, did, p);
1316 repo_rewrite_suse_deps(s, 0);
1319 /* stripped down version of susetags parser used for testcases */
1321 testcase_add_testtags(Repo *repo, FILE *fp, int flags)
1323 Pool *pool = repo->pool;
1335 int tagsversion = 0;
1336 int addselfprovides = 1; /* for compat reasons */
1338 data = repo_add_repodata(repo, flags);
1343 line = solv_malloc(aline);
1347 if (linep - line + 16 > aline)
1349 aline = linep - line;
1350 line = solv_realloc(line, aline + 512);
1351 linep = line + aline;
1354 if (!fgets(linep, aline - (linep - line), fp))
1356 linep += strlen(linep);
1357 if (linep == line || linep[-1] != '\n')
1360 linep = line + intag;
1363 if (line[intag] == '-' && !strncmp(line + 1, line + intag + 1, intag - 2))
1370 else if (line[0] == '+' && line[1] && line[1] != ':')
1372 char *tagend = strchr(line, ':');
1377 intag = tagend + 2 - line;
1378 linep = line + intag;
1381 if (*line != '=' || !line[1] || !line[2] || !line[3] || line[4] != ':')
1383 tag = line[1] << 16 | line[2] << 8 | line[3];
1384 /* tags that do not need a solvable */
1387 case 'V' << 16 | 'e' << 8 | 'r':
1388 tagsversion = atoi(line + 6);
1389 addselfprovides = tagsversion < 3 || strstr(line + 6, "addselfprovides") != 0;
1391 case 'P' << 16 | 'k' << 8 | 'g':
1394 if (tagsversion == 2)
1395 finish_v2_solvable(pool, data, s, filelist, nfilelist);
1396 if (addselfprovides && s->name && s->arch != ARCH_SRC && s->arch != ARCH_NOSRC)
1397 s->provides = repo_addid_dep(s->repo, s->provides, pool_rel2id(pool, s->name, s->evr, REL_EQ, 1), 0);
1400 if (split(line + 5, sp, 5) != 4)
1402 s = pool_id2solvable(pool, repo_add_solvable(repo));
1403 s->name = pool_str2id(pool, sp[0], 1);
1404 /* join back version and release */
1405 if (sp[2] && !(sp[2][0] == '-' && !sp[2][1]))
1407 s->evr = makeevr(pool, sp[1]);
1408 s->arch = pool_str2id(pool, sp[3], 1);
1415 /* tags that need a solvable */
1418 case 'S' << 16 | 'u' << 8 | 'm':
1419 repodata_set_str(data, s - pool->solvables, SOLVABLE_SUMMARY, line + 6);
1421 case 'V' << 16 | 'n' << 8 | 'd':
1422 s->vendor = pool_str2id(pool, line + 6, 1);
1424 case 'T' << 16 | 'i' << 8 | 'm':
1427 repodata_set_num(data, s - pool->solvables, SOLVABLE_BUILDTIME, t);
1429 case 'R' << 16 | 'e' << 8 | 'q':
1430 s->requires = adddep(repo, s->requires, line + 6, -SOLVABLE_PREREQMARKER);
1432 case 'P' << 16 | 'r' << 8 | 'q':
1433 s->requires = adddep(repo, s->requires, line + 6, SOLVABLE_PREREQMARKER);
1435 case 'P' << 16 | 'r' << 8 | 'v':
1436 /* version 2 had the file list at the end of the provides */
1437 if (tagsversion == 2)
1441 int l = strlen(line + 6) + 1;
1442 if (nfilelist + l > afilelist)
1444 afilelist = nfilelist + l + 512;
1445 filelist = solv_realloc(filelist, afilelist);
1447 memcpy(filelist + nfilelist, line + 6, l);
1454 for (l = 0; l < nfilelist; l += strlen(filelist + l) + 1)
1455 s->provides = repo_addid_dep(repo, s->provides, pool_str2id(pool, filelist + l, 1), 0);
1459 s->provides = adddep(repo, s->provides, line + 6, 0);
1461 case 'F' << 16 | 'l' << 8 | 's':
1463 char *p = strrchr(line + 6, '/');
1468 did = repodata_str2dir(data, line + 6, 1);
1470 did = repodata_str2dir(data, "/", 1);
1471 repodata_add_dirstr(data, s - pool->solvables, SOLVABLE_FILELIST, did, p);
1474 case 'O' << 16 | 'b' << 8 | 's':
1475 s->obsoletes = adddep(repo, s->obsoletes, line + 6, 0);
1477 case 'C' << 16 | 'o' << 8 | 'n':
1478 s->conflicts = adddep(repo, s->conflicts, line + 6, 0);
1480 case 'R' << 16 | 'e' << 8 | 'c':
1481 s->recommends = adddep(repo, s->recommends, line + 6, 0);
1483 case 'S' << 16 | 'u' << 8 | 'p':
1484 s->supplements = adddep(repo, s->supplements, line + 6, 0);
1486 case 'S' << 16 | 'u' << 8 | 'g':
1487 s->suggests = adddep(repo, s->suggests, line + 6, 0);
1489 case 'E' << 16 | 'n' << 8 | 'h':
1490 s->enhances = adddep(repo, s->enhances, line + 6, 0);
1492 case 'I' << 16 | 'p' << 8 | 'r':
1494 Id id = line[6] == '/' ? pool_str2id(pool, line + 6, 1) : testcase_str2dep(pool, line + 6);
1495 repodata_add_idarray(data, s - pool->solvables, SOLVABLE_PREREQ_IGNOREINST, id);
1504 if (tagsversion == 2)
1505 finish_v2_solvable(pool, data, s, filelist, nfilelist);
1506 if (addselfprovides && s->name && s->arch != ARCH_SRC && s->arch != ARCH_NOSRC)
1507 s->provides = repo_addid_dep(s->repo, s->provides, pool_rel2id(pool, s->name, s->evr, REL_EQ, 1), 0);
1510 solv_free(filelist);
1511 repodata_free_dircache(data);
1512 if (!(flags & REPO_NO_INTERNALIZE))
1513 repodata_internalize(data);
1518 testcase_getpoolflags(Pool *pool)
1520 const char *str = 0;
1522 for (i = 0; poolflags2str[i].str; i++)
1524 v = pool_get_flag(pool, poolflags2str[i].flag);
1525 if (v == poolflags2str[i].def)
1527 str = pool_tmpappend(pool, str, v ? " " : " !", poolflags2str[i].str);
1529 return str ? str + 1 : "";
1533 testcase_setpoolflags(Pool *pool, const char *str)
1535 const char *p = str, *s;
1539 while (*p == ' ' || *p == '\t' || *p == ',')
1550 while (*p && *p != ' ' && *p != '\t' && *p != ',')
1552 for (i = 0; poolflags2str[i].str; i++)
1553 if (!strncmp(poolflags2str[i].str, s, p - s) && poolflags2str[i].str[p - s] == 0)
1555 if (!poolflags2str[i].str)
1556 return pool_error(pool, 0, "setpoolflags: unknown flag '%.*s'", (int)(p - s), s);
1557 pool_set_flag(pool, poolflags2str[i].flag, v);
1563 testcase_resetpoolflags(Pool *pool)
1566 for (i = 0; poolflags2str[i].str; i++)
1567 pool_set_flag(pool, poolflags2str[i].flag, poolflags2str[i].def);
1571 testcase_getsolverflags(Solver *solv)
1573 Pool *pool = solv->pool;
1574 const char *str = 0;
1576 for (i = 0; solverflags2str[i].str; i++)
1578 v = solver_get_flag(solv, solverflags2str[i].flag);
1579 if (v == solverflags2str[i].def)
1581 str = pool_tmpappend(pool, str, v ? " " : " !", solverflags2str[i].str);
1583 return str ? str + 1 : "";
1587 testcase_setsolverflags(Solver *solv, const char *str)
1589 const char *p = str, *s;
1593 while (*p == ' ' || *p == '\t' || *p == ',')
1604 while (*p && *p != ' ' && *p != '\t' && *p != ',')
1606 for (i = 0; solverflags2str[i].str; i++)
1607 if (!strncmp(solverflags2str[i].str, s, p - s) && solverflags2str[i].str[p - s] == 0)
1609 if (!solverflags2str[i].str)
1610 return pool_error(solv->pool, 0, "setsolverflags: unknown flag '%.*s'", (int)(p - s), s);
1611 if (solver_set_flag(solv, solverflags2str[i].flag, v) == -1)
1612 return pool_error(solv->pool, 0, "setsolverflags: unsupported flag '%s'", solverflags2str[i].str);
1618 testcase_resetsolverflags(Solver *solv)
1621 for (i = 0; solverflags2str[i].str; i++)
1622 solver_set_flag(solv, solverflags2str[i].flag, solverflags2str[i].def);
1626 testcase_ruleid(Solver *solv, Id rid)
1632 const unsigned char *md5;
1638 solver_ruleliterals(solv, rid, &q);
1639 for (i = 0; i < q.count; i++)
1641 Id p = q.elements[i];
1642 s = testcase_solvid2str(solv->pool, p > 0 ? p : -p);
1644 s = pool_tmpjoin(solv->pool, "!", s, 0);
1645 strqueue_push(&sq, s);
1648 strqueue_sort_u(&sq);
1649 chk = solv_chksum_create(REPOKEY_TYPE_MD5);
1650 for (i = 0; i < sq.nstr; i++)
1651 solv_chksum_add(chk, sq.str[i], strlen(sq.str[i]) + 1);
1652 md5 = solv_chksum_get(chk, &md5l);
1653 s = pool_bin2hex(solv->pool, md5, md5l);
1654 chk = solv_chksum_free(chk, 0);
1660 testcase_problemid(Solver *solv, Id problem)
1665 const unsigned char *md5;
1669 /* we build a hash of all rules that define the problem */
1672 solver_findallproblemrules(solv, problem, &q);
1673 for (i = 0; i < q.count; i++)
1674 strqueue_push(&sq, testcase_ruleid(solv, q.elements[i]));
1676 strqueue_sort_u(&sq);
1677 chk = solv_chksum_create(REPOKEY_TYPE_MD5);
1678 for (i = 0; i < sq.nstr; i++)
1679 solv_chksum_add(chk, sq.str[i], strlen(sq.str[i]) + 1);
1680 md5 = solv_chksum_get(chk, &md5l);
1681 s = pool_bin2hex(solv->pool, md5, 4);
1682 chk = solv_chksum_free(chk, 0);
1688 testcase_solutionid(Solver *solv, Id problem, Id solution)
1692 const unsigned char *md5;
1696 intid = solver_solutionelement_internalid(solv, problem, solution);
1697 /* internal stuff! handle with care! */
1701 s = testcase_job2str(solv->pool, solv->job.elements[-intid - 1], solv->job.elements[-intid]);
1706 s = testcase_ruleid(solv, intid);
1708 chk = solv_chksum_create(REPOKEY_TYPE_MD5);
1709 solv_chksum_add(chk, s, strlen(s) + 1);
1710 md5 = solv_chksum_get(chk, &md5l);
1711 s = pool_bin2hex(solv->pool, md5, 4);
1712 chk = solv_chksum_free(chk, 0);
1717 testcase_alternativeid(Solver *solv, int type, Id id, Id from)
1720 Pool *pool = solv->pool;
1722 const unsigned char *md5;
1724 chk = solv_chksum_create(REPOKEY_TYPE_MD5);
1725 if (type == SOLVER_ALTERNATIVE_TYPE_RECOMMENDS)
1727 s = testcase_solvid2str(pool, from);
1728 solv_chksum_add(chk, s, strlen(s) + 1);
1729 s = testcase_dep2str(pool, id);
1730 solv_chksum_add(chk, s, strlen(s) + 1);
1732 else if (type == SOLVER_ALTERNATIVE_TYPE_RULE)
1734 s = testcase_ruleid(solv, id);
1735 solv_chksum_add(chk, s, strlen(s) + 1);
1737 md5 = solv_chksum_get(chk, &md5l);
1738 s = pool_bin2hex(pool, md5, 4);
1739 chk = solv_chksum_free(chk, 0);
1743 static struct class2str {
1747 { SOLVER_TRANSACTION_ERASE, "erase" },
1748 { SOLVER_TRANSACTION_INSTALL, "install" },
1749 { SOLVER_TRANSACTION_REINSTALLED, "reinstall" },
1750 { SOLVER_TRANSACTION_DOWNGRADED, "downgrade" },
1751 { SOLVER_TRANSACTION_CHANGED, "change" },
1752 { SOLVER_TRANSACTION_UPGRADED, "upgrade" },
1753 { SOLVER_TRANSACTION_OBSOLETED, "obsolete" },
1754 { SOLVER_TRANSACTION_MULTIINSTALL, "multiinstall" },
1755 { SOLVER_TRANSACTION_MULTIREINSTALL, "multireinstall" },
1759 static struct reason2str {
1763 { SOLVER_REASON_UNRELATED, "unrelated" },
1764 { SOLVER_REASON_UNIT_RULE, "unit" },
1765 { SOLVER_REASON_KEEP_INSTALLED, "keep" },
1766 { SOLVER_REASON_RESOLVE_JOB, "job" },
1767 { SOLVER_REASON_UPDATE_INSTALLED, "update" },
1768 { SOLVER_REASON_CLEANDEPS_ERASE, "cleandeps" },
1769 { SOLVER_REASON_RESOLVE, "resolve" },
1770 { SOLVER_REASON_WEAKDEP, "weakdep" },
1771 { SOLVER_REASON_RESOLVE_ORPHAN, "orphan" },
1773 { SOLVER_REASON_RECOMMENDED, "recommended" },
1774 { SOLVER_REASON_SUPPLEMENTED, "supplemented" },
1779 testcase_reason2str(Id reason)
1782 for (i = 0; reason2str[i].str; i++)
1783 if (reason == reason2str[i].reason)
1784 return reason2str[i].str;
1788 static struct rclass2str {
1792 { SOLVER_RULE_PKG, "pkg" },
1793 { SOLVER_RULE_UPDATE, "update" },
1794 { SOLVER_RULE_FEATURE, "feature" },
1795 { SOLVER_RULE_JOB, "job" },
1796 { SOLVER_RULE_DISTUPGRADE, "distupgrade" },
1797 { SOLVER_RULE_INFARCH, "infarch" },
1798 { SOLVER_RULE_CHOICE, "choice" },
1799 { SOLVER_RULE_LEARNT, "learnt" },
1800 { SOLVER_RULE_BEST, "best" },
1801 { SOLVER_RULE_YUMOBS, "yumobs" },
1806 testcase_rclass2str(Id rclass)
1809 for (i = 0; rclass2str[i].str; i++)
1810 if (rclass == rclass2str[i].rclass)
1811 return rclass2str[i].str;
1816 dump_genid(Pool *pool, Strqueue *sq, Id id, int cnt)
1824 Reldep *rd = GETRELDEP(pool, id);
1825 for (op = oplist; op->flags; op++)
1826 if (rd->flags == op->flags)
1828 cnt = dump_genid(pool, sq, rd->name, cnt);
1829 cnt = dump_genid(pool, sq, rd->evr, cnt);
1830 sprintf(cntbuf, "genid %2d: genid ", cnt++);
1831 s = pool_tmpjoin(pool, cntbuf, "op ", op->flags ? op->opname : "unknown");
1835 sprintf(cntbuf, "genid %2d: genid ", cnt++);
1836 s = pool_tmpjoin(pool, cntbuf, id ? "lit " : "null", id ? pool_id2str(pool, id) : 0);
1838 strqueue_push(sq, s);
1843 testcase_solverresult(Solver *solv, int resultflags)
1845 Pool *pool = solv->pool;
1853 if ((resultflags & TESTCASE_RESULT_TRANSACTION) != 0)
1855 Transaction *trans = solver_create_transaction(solv);
1859 for (i = 0; class2str[i].str; i++)
1862 transaction_classify_pkgs(trans, SOLVER_TRANSACTION_KEEP_PSEUDO, class2str[i].class, 0, 0, &q);
1863 for (j = 0; j < q.count; j++)
1867 if (pool->installed && pool->solvables[p].repo == pool->installed)
1868 op = transaction_obs_pkg(trans, p);
1869 s = pool_tmpjoin(pool, class2str[i].str, " ", testcase_solvid2str(pool, p));
1871 s = pool_tmpjoin(pool, s, " ", testcase_solvid2str(pool, op));
1872 strqueue_push(&sq, s);
1876 transaction_free(trans);
1878 if ((resultflags & TESTCASE_RESULT_PROBLEMS) != 0)
1880 char *probprefix, *solprefix;
1881 int problem, solution, element;
1884 pcnt = solver_problem_count(solv);
1885 for (problem = 1; problem <= pcnt; problem++)
1887 Id rid, from, to, dep;
1888 SolverRuleinfo rinfo;
1889 rid = solver_findproblemrule(solv, problem);
1890 s = testcase_problemid(solv, problem);
1891 probprefix = solv_dupjoin("problem ", s, 0);
1892 rinfo = solver_ruleinfo(solv, rid, &from, &to, &dep);
1893 s = pool_tmpjoin(pool, probprefix, " info ", solver_problemruleinfo2str(solv, rinfo, from, to, dep));
1894 strqueue_push(&sq, s);
1895 scnt = solver_solution_count(solv, problem);
1896 for (solution = 1; solution <= scnt; solution++)
1898 s = testcase_solutionid(solv, problem, solution);
1899 solprefix = solv_dupjoin(probprefix, " solution ", s);
1901 while ((element = solver_next_solutionelement(solv, problem, solution, element, &p, &op)) != 0)
1903 if (p == SOLVER_SOLUTION_JOB)
1904 s = pool_tmpjoin(pool, solprefix, " deljob ", testcase_job2str(pool, solv->job.elements[op - 1], solv->job.elements[op]));
1905 else if (p > 0 && op == 0)
1906 s = pool_tmpjoin(pool, solprefix, " erase ", testcase_solvid2str(pool, p));
1907 else if (p > 0 && op > 0)
1909 s = pool_tmpjoin(pool, solprefix, " replace ", testcase_solvid2str(pool, p));
1910 s = pool_tmpappend(pool, s, " ", testcase_solvid2str(pool, op));
1912 else if (p < 0 && op > 0)
1913 s = pool_tmpjoin(pool, solprefix, " allow ", testcase_solvid2str(pool, op));
1915 s = pool_tmpjoin(pool, solprefix, " unknown", 0);
1916 strqueue_push(&sq, s);
1918 solv_free(solprefix);
1920 solv_free(probprefix);
1924 if ((resultflags & TESTCASE_RESULT_ORPHANED) != 0)
1929 solver_get_orphaned(solv, &q);
1930 for (i = 0; i < q.count; i++)
1932 s = pool_tmpjoin(pool, "orphaned ", testcase_solvid2str(pool, q.elements[i]), 0);
1933 strqueue_push(&sq, s);
1938 if ((resultflags & TESTCASE_RESULT_RECOMMENDED) != 0)
1944 solver_get_recommendations(solv, &qr, &qs, 0);
1945 for (i = 0; i < qr.count; i++)
1947 s = pool_tmpjoin(pool, "recommended ", testcase_solvid2str(pool, qr.elements[i]), 0);
1948 strqueue_push(&sq, s);
1950 for (i = 0; i < qs.count; i++)
1952 s = pool_tmpjoin(pool, "suggested ", testcase_solvid2str(pool, qs.elements[i]), 0);
1953 strqueue_push(&sq, s);
1959 if ((resultflags & TESTCASE_RESULT_UNNEEDED) != 0)
1965 solver_get_unneeded(solv, &q, 0);
1966 solver_get_unneeded(solv, &qf, 1);
1967 for (i = j = 0; i < q.count; i++)
1969 /* we rely on qf containing a subset of q in the same order */
1970 if (j < qf.count && q.elements[i] == qf.elements[j])
1972 s = pool_tmpjoin(pool, "unneeded_filtered ", testcase_solvid2str(pool, q.elements[i]), 0);
1976 s = pool_tmpjoin(pool, "unneeded ", testcase_solvid2str(pool, q.elements[i]), 0);
1977 strqueue_push(&sq, s);
1982 if ((resultflags & TESTCASE_RESULT_ALTERNATIVES) != 0)
1990 cnt = solver_alternatives_count(solv);
1991 for (alternative = 1; alternative <= cnt; alternative++)
1993 Id id, from, chosen;
1995 int type = solver_get_alternative(solv, alternative, &id, &from, &chosen, &q, 0);
1996 altprefix = solv_dupjoin("alternative ", testcase_alternativeid(solv, type, id, from), " ");
1998 if (type == SOLVER_ALTERNATIVE_TYPE_RECOMMENDS)
2000 char *s = pool_tmpjoin(pool, altprefix, num, testcase_solvid2str(pool, from));
2001 s = pool_tmpappend(pool, s, " recommends ", testcase_dep2str(pool, id));
2002 strqueue_push(&sq, s);
2004 else if (type == SOLVER_ALTERNATIVE_TYPE_RULE)
2006 /* map choice rules back to pkg rules */
2007 if (solver_ruleclass(solv, id) == SOLVER_RULE_CHOICE)
2008 id = solver_rule2pkgrule(solv, id);
2009 solver_allruleinfos(solv, id, &rq);
2010 for (i = 0; i < rq.count; i += 4)
2012 int rtype = rq.elements[i];
2013 if ((rtype & SOLVER_RULE_TYPEMASK) == SOLVER_RULE_JOB)
2015 const char *js = testcase_job2str(pool, rq.elements[i + 2], rq.elements[i + 3]);
2016 char *s = pool_tmpjoin(pool, altprefix, num, " job ");
2017 s = pool_tmpappend(pool, s, js, 0);
2018 strqueue_push(&sq, s);
2020 else if (rtype == SOLVER_RULE_PKG_REQUIRES)
2022 char *s = pool_tmpjoin(pool, altprefix, num, testcase_solvid2str(pool, rq.elements[i + 1]));
2023 s = pool_tmpappend(pool, s, " requires ", testcase_dep2str(pool, rq.elements[i + 3]));
2024 strqueue_push(&sq, s);
2028 for (i = 0; i < q.count; i++)
2030 Id p = q.elements[i];
2032 num[0] = '0' + (i + 1) / 10;
2033 num[1] = '0' + (i + 1) % 10;
2035 s = pool_tmpjoin(pool, altprefix, num, "+ ");
2037 s = pool_tmpjoin(pool, altprefix, num, "- ");
2039 s = pool_tmpjoin(pool, altprefix, num, " ");
2040 s = pool_tmpappend(pool, s, testcase_solvid2str(pool, p < 0 ? -p : p), 0);
2041 strqueue_push(&sq, s);
2043 solv_free(altprefix);
2048 if ((resultflags & TESTCASE_RESULT_RULES) != 0)
2050 /* dump all rules */
2052 SolverRuleinfo rclass;
2057 for (rid = 1; (rclass = solver_ruleclass(solv, rid)) != SOLVER_RULE_UNKNOWN; rid++)
2059 char *prefix = solv_dupjoin("rule ", testcase_rclass2str(rclass), " ");
2060 prefix = solv_dupappend(prefix, testcase_ruleid(solv, rid), 0);
2061 solver_ruleliterals(solv, rid, &q);
2062 if (rclass == SOLVER_RULE_FEATURE && q.count == 1 && q.elements[0] == -SYSTEMSOLVABLE)
2064 for (i = 0; i < q.count; i++)
2066 Id p = q.elements[i];
2069 s = pool_tmpjoin(pool, prefix, " -", testcase_solvid2str(pool, -p));
2071 s = pool_tmpjoin(pool, prefix, " ", testcase_solvid2str(pool, p));
2072 strqueue_push(&sq, s);
2078 if ((resultflags & TESTCASE_RESULT_GENID) != 0)
2080 for (i = 0 ; i < solv->job.count; i += 2)
2083 if (solv->job.elements[i] != (SOLVER_NOOP | SOLVER_SOLVABLE_PROVIDES))
2085 id = solv->job.elements[i + 1];
2086 s = testcase_dep2str(pool, id);
2087 strqueue_push(&sq, pool_tmpjoin(pool, "genid dep ", s, 0));
2088 if ((id2 = testcase_str2dep(pool, s)) != id)
2090 s = pool_tmpjoin(pool, "genid roundtrip error: ", testcase_dep2str(pool, id2), 0);
2091 strqueue_push(&sq, s);
2093 dump_genid(pool, &sq, id, 1);
2096 if ((resultflags & TESTCASE_RESULT_REASON) != 0)
2100 FOR_POOL_SOLVABLES(p)
2103 int reason = solver_describe_decision(solv, p, &info);
2104 if (reason == SOLVER_REASON_UNRELATED)
2106 if (reason == SOLVER_REASON_WEAKDEP)
2108 solver_describe_weakdep_decision(solv, p, &whyq);
2111 for (i = 0; i < whyq.count; i += 3)
2113 reason = whyq.elements[i];
2114 p2 = whyq.elements[i + 1];
2115 id = whyq.elements[i + 2];
2116 s = pool_tmpjoin(pool, "reason ", testcase_solvid2str(pool, p), 0);
2117 s = pool_tmpappend(pool, s, " ", testcase_reason2str(reason));
2118 s = pool_tmpappend(pool, s, " ", testcase_dep2str(pool, id));
2120 s = pool_tmpappend(pool, s, " ", testcase_solvid2str(pool, p2));
2121 strqueue_push(&sq, s);
2126 s = pool_tmpjoin(pool, "reason ", testcase_solvid2str(pool, p), 0);
2127 s = pool_tmpappend(pool, s, " ", testcase_reason2str(reason));
2129 s = pool_tmpappend(pool, s, " ", testcase_ruleid(solv, info));
2130 strqueue_push(&sq, s);
2134 if ((resultflags & TESTCASE_RESULT_CLEANDEPS) != 0)
2139 solver_get_cleandeps(solv, &q);
2140 for (i = 0; i < q.count; i++)
2142 s = pool_tmpjoin(pool, "cleandeps ", testcase_solvid2str(pool, q.elements[i]), 0);
2143 strqueue_push(&sq, s);
2147 if ((resultflags & TESTCASE_RESULT_JOBS) != 0)
2149 for (i = 0; i < solv->job.count; i += 2)
2151 s = (char *)testcase_job2str(pool, solv->job.elements[i], solv->job.elements[i + 1]);
2152 s = pool_tmpjoin(pool, "job ", s, 0);
2153 strqueue_push(&sq, s);
2157 result = strqueue_join(&sq);
2164 testcase_write_mangled(Solver *solv, const char *dir, int resultflags, const char *testcasename, const char *resultname)
2166 Pool *pool = solv->pool;
2177 testcasename = "testcase.t";
2179 resultname = "solver.result";
2181 if (mkdir(dir, 0777) && errno != EEXIST)
2182 return pool_error(solv->pool, 0, "testcase_write: could not create directory '%s'", dir);
2184 FOR_REPOS(repoid, repo)
2186 const char *name = testcase_repoid2str(pool, repoid);
2188 if (repo->subpriority)
2189 sprintf(priobuf, "%d.%d", repo->priority, repo->subpriority);
2191 sprintf(priobuf, "%d", repo->priority);
2192 out = pool_tmpjoin(pool, name, ".repo", ".gz");
2193 for (i = 0; out[i]; i++)
2196 cmd = pool_tmpjoin(pool, "repo ", name, " ");
2197 cmd = pool_tmpappend(pool, cmd, priobuf, " ");
2198 cmd = pool_tmpappend(pool, cmd, "testtags ", out);
2199 strqueue_push(&sq, cmd);
2200 out = pool_tmpjoin(pool, dir, "/", out);
2201 if (!(fp = solv_xfopen(out, "w")))
2203 pool_error(solv->pool, 0, "testcase_write: could not open '%s' for writing", out);
2207 testcase_write_testtags(repo, fp);
2210 pool_error(solv->pool, 0, "testcase_write: write error");
2215 /* hmm, this is not optimal... we currently search for the lowest score */
2217 arch = pool->solvables[SYSTEMSOLVABLE].arch;
2218 for (i = 0; i < pool->lastarch; i++)
2220 if (pool->id2arch[i] == 1 && !lowscore)
2222 if (pool->id2arch[i] > 0x10000 && (!lowscore || pool->id2arch[i] < lowscore))
2225 lowscore = pool->id2arch[i];
2228 cmd = pool_tmpjoin(pool, "system ", pool->lastarch ? pool_id2str(pool, arch) : "unset", 0);
2229 for (i = 0; disttype2str[i].str != 0; i++)
2230 if (pool->disttype == disttype2str[i].type)
2232 pool_tmpappend(pool, cmd, " ", disttype2str[i].str ? disttype2str[i].str : "unknown");
2233 if (pool->installed)
2234 cmd = pool_tmpappend(pool, cmd, " ", testcase_repoid2str(pool, pool->installed->repoid));
2235 strqueue_push(&sq, cmd);
2236 s = testcase_getpoolflags(solv->pool);
2239 cmd = pool_tmpjoin(pool, "poolflags ", s, 0);
2240 strqueue_push(&sq, cmd);
2243 if (pool->vendorclasses)
2246 for (i = 0; pool->vendorclasses[i]; i++)
2248 cmd = pool_tmpappend(pool, cmd ? cmd : "vendorclass", " ", pool->vendorclasses[i]);
2249 if (!pool->vendorclasses[i + 1])
2251 strqueue_push(&sq, cmd);
2258 /* dump disabled packages (must come before the namespace/job lines) */
2259 if (pool->considered)
2262 FOR_POOL_SOLVABLES(p)
2263 if (!MAPTST(pool->considered, p))
2265 cmd = pool_tmpjoin(pool, "disable pkg ", testcase_solvid2str(pool, p), 0);
2266 strqueue_push(&sq, cmd);
2270 s = testcase_getsolverflags(solv);
2273 cmd = pool_tmpjoin(pool, "solverflags ", s, 0);
2274 strqueue_push(&sq, cmd);
2277 /* now dump all the ns callback values we know */
2278 if (pool->nscallback)
2282 for (rid = 1; rid < pool->nrels; rid++)
2284 Reldep *rd = pool->rels + rid;
2285 if (rd->flags != REL_NAMESPACE || rd->name == NAMESPACE_OTHERPROVIDERS)
2287 /* evaluate all namespace ids, skip empty results */
2288 d = pool_whatprovides(pool, MAKERELDEP(rid));
2289 if (!d || !pool->whatprovidesdata[d])
2291 cmd = pool_tmpjoin(pool, "namespace ", pool_id2str(pool, rd->name), "(");
2292 cmd = pool_tmpappend(pool, cmd, pool_id2str(pool, rd->evr), ")");
2293 for (; pool->whatprovidesdata[d]; d++)
2294 cmd = pool_tmpappend(pool, cmd, " ", testcase_solvid2str(pool, pool->whatprovidesdata[d]));
2295 strqueue_push(&sq, cmd);
2299 for (i = 0; i < solv->job.count; i += 2)
2301 cmd = (char *)testcase_job2str(pool, solv->job.elements[i], solv->job.elements[i + 1]);
2302 cmd = pool_tmpjoin(pool, "job ", cmd, 0);
2303 strqueue_push(&sq, cmd);
2306 if ((resultflags & ~TESTCASE_RESULT_REUSE_SOLVER) != 0)
2310 for (i = 0; resultflags2str[i].str; i++)
2311 if ((resultflags & resultflags2str[i].flag) != 0)
2312 cmd = pool_tmpappend(pool, cmd, cmd ? "," : 0, resultflags2str[i].str);
2313 cmd = pool_tmpjoin(pool, "result ", cmd ? cmd : "?", 0);
2314 cmd = pool_tmpappend(pool, cmd, " ", resultname);
2315 strqueue_push(&sq, cmd);
2316 result = testcase_solverresult(solv, resultflags);
2317 if (!strcmp(resultname, "<inline>"))
2321 strqueue_init(&rsq);
2322 strqueue_split(&rsq, result);
2323 for (i = 0; i < rsq.nstr; i++)
2325 cmd = pool_tmpjoin(pool, "#>", rsq.str[i], 0);
2326 strqueue_push(&sq, cmd);
2328 strqueue_free(&rsq);
2332 out = pool_tmpjoin(pool, dir, "/", resultname);
2333 if (!(fp = fopen(out, "w")))
2335 pool_error(solv->pool, 0, "testcase_write: could not open '%s' for writing", out);
2340 if (result && *result && fwrite(result, strlen(result), 1, fp) != 1)
2342 pool_error(solv->pool, 0, "testcase_write: write error");
2350 pool_error(solv->pool, 0, "testcase_write: write error");
2358 cmd = strqueue_join(&sq);
2359 out = pool_tmpjoin(pool, dir, "/", testcasename);
2360 if (!(fp = fopen(out, "w")))
2362 pool_error(solv->pool, 0, "testcase_write: could not open '%s' for writing", out);
2366 if (*cmd && fwrite(cmd, strlen(cmd), 1, fp) != 1)
2368 pool_error(solv->pool, 0, "testcase_write: write error");
2375 pool_error(solv->pool, 0, "testcase_write: write error");
2385 testcase_write(Solver *solv, const char *dir, int resultflags, const char *testcasename, const char *resultname)
2387 Pool *pool = solv->pool;
2390 const char **orignames;
2392 /* mangle repo names so that there are no conflicts */
2393 orignames = solv_calloc(pool->nrepos, sizeof(char *));
2394 for (repoid = 1; repoid < pool->nrepos; repoid++)
2396 Repo *repo = pool_id2repo(pool, repoid);
2397 char *buf = solv_malloc((repo->name ? strlen(repo->name) : 0) + 40);
2399 orignames[repoid] = repo->name;
2400 if (!repo->name || !repo->name[0])
2401 sprintf(buf, "#%d", repoid);
2403 strcpy(buf, repo->name);
2404 for (i = 0; buf[i]; i++)
2405 if (buf[i] == ' ' || buf[i] == '\t' || buf[i] == '/')
2407 mp = buf + strlen(buf);
2410 for (i = 1; i < repoid; i++)
2411 if (!strcmp(buf, pool_id2repo(pool, i)->name))
2415 sprintf(mp, "_%d", mangle++);
2419 r = testcase_write_mangled(solv, dir, resultflags, testcasename, resultname);
2420 for (repoid = 1; repoid < pool->nrepos; repoid++)
2422 Repo *repo = pool_id2repo(pool, repoid);
2423 solv_free((void *)repo->name);
2424 repo->name = orignames[repoid];
2426 solv_free(orignames);
2431 read_inline_file(FILE *fp, char **bufp, char **bufpp, int *buflp)
2433 char *result = solv_malloc(1024);
2440 if (rp - result + 256 >= resultl)
2442 resultl = rp - result;
2443 result = solv_realloc(result, resultl + 1024);
2444 rp = result + resultl;
2447 if (!fgets(rp, resultl - (rp - result), fp))
2450 if (rl && (rp == result || rp[-1] == '\n'))
2452 if (rl > 1 && rp[0] == '#' && rp[1] == '>')
2454 memmove(rp, rp + 2, rl - 2);
2459 while (rl + 16 > *buflp)
2461 *bufp = solv_realloc(*bufp, *buflp + 512);
2464 memmove(*bufp, rp, rl);
2465 if ((*bufp)[rl - 1] == '\n')
2471 (*bufpp) = *bufp + rl;
2488 char *result = solv_malloc(1024);
2495 if (rp - result + 256 >= resultl)
2497 resultl = rp - result;
2498 result = solv_realloc(result, resultl + 1024);
2499 rp = result + resultl;
2502 rl = fread(rp, 1, resultl - (rp - result), fp);
2514 str2resultflags(Pool *pool, char *s) /* modifies the string! */
2516 int i, resultflags = 0;
2519 char *se = strchr(s, ',');
2522 for (i = 0; resultflags2str[i].str; i++)
2523 if (!strcmp(s, resultflags2str[i].str))
2525 resultflags |= resultflags2str[i].flag;
2528 if (!resultflags2str[i].str)
2529 pool_error(pool, 0, "result: unknown flag '%s'", s);
2536 testcase_read(Pool *pool, FILE *fp, const char *testcase, Queue *job, char **resultp, int *resultflagsp)
2541 char *testcasedir, *s;
2547 int poolflagsreset = 0;
2548 int missing_features = 0;
2557 if (!fp && !(fp = fopen(testcase, "r")))
2559 pool_error(pool, 0, "testcase_read: could not open '%s'", testcase);
2562 testcasedir = solv_strdup(testcase);
2563 if ((s = strrchr(testcasedir, '/')) != 0)
2568 buf = solv_malloc(bufl);
2571 queue_init(&autoinstq);
2574 if (bufp - buf + 16 > bufl)
2577 buf = solv_realloc(buf, bufl + 512);
2581 if (!fgets(bufp, bufl - (bufp - buf), fp))
2585 if (!l || buf[l - 1] != '\n')
2592 while (*s && (*s == ' ' || *s == '\t'))
2594 if (!*s || *s == '#')
2597 /* split it in pieces */
2600 while (*s == ' ' || *s == '\t')
2604 pieces = solv_extend(pieces, npieces, 1, sizeof(*pieces), 7);
2605 pieces[npieces++] = s;
2606 while (*s && *s != ' ' && *s != '\t')
2611 pieces = solv_extend(pieces, npieces, 1, sizeof(*pieces), 7);
2612 pieces[npieces] = 0;
2613 if (!strcmp(pieces[0], "repo") && npieces >= 4)
2615 Repo *repo = repo_create(pool, pieces[1]);
2621 if (!poolflagsreset)
2624 testcase_resetpoolflags(pool); /* hmm */
2626 if (sscanf(pieces[2], "%d.%d", &prio, &subprio) != 2)
2629 prio = atoi(pieces[2]);
2631 repo->priority = prio;
2632 repo->subpriority = subprio;
2633 if (strcmp(pieces[3], "empty") != 0)
2635 const char *repotype = pool_tmpjoin(pool, pieces[3], 0, 0); /* gets overwritten in <inline> case */
2636 if (!strcmp(pieces[4], "<inline>"))
2638 char *idata = read_inline_file(fp, &buf, &bufp, &bufl);
2640 rfp = solv_xfopen_buf(rdata, &idata, 0, "rf");
2644 rdata = pool_tmpjoin(pool, testcasedir, pieces[4], 0);
2645 rfp = solv_xfopen(rdata, "r");
2649 pool_error(pool, 0, "testcase_read: could not open '%s'", rdata);
2651 else if (!strcmp(repotype, "testtags"))
2653 testcase_add_testtags(repo, rfp, 0);
2656 else if (!strcmp(repotype, "solv"))
2658 repo_add_solv(repo, rfp, 0);
2661 #if ENABLE_TESTCASE_HELIXREPO
2662 else if (!strcmp(repotype, "helix"))
2664 repo_add_helix(repo, rfp, 0);
2671 pool_error(pool, 0, "testcase_read: unknown repo type for repo '%s'", repo->name);
2675 else if (!strcmp(pieces[0], "system") && npieces >= 3)
2679 /* must set the disttype before the arch */
2681 if (strcmp(pieces[2], "*") != 0)
2683 char *dp = pieces[2];
2686 char *dpe = strchr(dp, ',');
2689 for (i = 0; disttype2str[i].str != 0; i++)
2690 if (!strcmp(disttype2str[i].str, dp))
2694 if (disttype2str[i].str)
2696 #ifdef MULTI_SEMANTICS
2697 if (pool->disttype != disttype2str[i].type)
2698 pool_setdisttype(pool, disttype2str[i].type);
2700 if (pool->disttype == disttype2str[i].type)
2707 pool_error(pool, 0, "testcase_read: system: could not change disttype to '%s'", pieces[2]);
2708 missing_features = 1;
2711 if (strcmp(pieces[1], "unset") == 0)
2712 pool_setarch(pool, 0);
2713 else if (pieces[1][0] == ':')
2714 pool_setarchpolicy(pool, pieces[1] + 1);
2716 pool_setarch(pool, pieces[1]);
2719 Repo *repo = testcase_str2repo(pool, pieces[3]);
2721 pool_error(pool, 0, "testcase_read: system: unknown repo '%s'", pieces[3]);
2723 pool_set_installed(pool, repo);
2726 else if (!strcmp(pieces[0], "job") && npieces > 1)
2732 pool_addfileprovides(pool);
2733 pool_createwhatprovides(pool);
2736 if (npieces >= 3 && !strcmp(pieces[2], "selection"))
2738 addselectionjob(pool, pieces + 1, npieces - 1, job, 0);
2741 if (npieces >= 4 && !strcmp(pieces[2], "selection_matchdeps"))
2743 pieces[2] = pieces[1];
2744 addselectionjob(pool, pieces + 2, npieces - 2, job, pool_str2id(pool, pieces[3], 1));
2747 if (npieces >= 4 && !strcmp(pieces[2], "selection_matchdepid"))
2749 pieces[2] = pieces[1];
2750 addselectionjob(pool, pieces + 2, npieces - 2, job, -pool_str2id(pool, pieces[3], 1));
2754 for (sp = pieces[1]; sp < pieces[npieces - 1]; sp++)
2757 how = testcase_str2job(pool, pieces[1], &what);
2758 if (how >= 0 && job)
2759 queue_push2(job, how, what);
2761 else if (!strcmp(pieces[0], "vendorclass") && npieces > 1)
2763 pool_addvendorclass(pool, (const char **)(pieces + 1));
2765 else if (!strcmp(pieces[0], "namespace") && npieces > 1)
2767 int i = strlen(pieces[1]);
2768 s = strchr(pieces[1], '(');
2769 if (!s && pieces[1][i - 1] != ')')
2771 pool_error(pool, 0, "testcase_read: bad namespace '%s'", pieces[1]);
2779 pieces[1][i - 1] = 0;
2780 name = pool_str2id(pool, pieces[1], 1);
2781 evr = pool_str2id(pool, s + 1, 1);
2783 pieces[1][i - 1] = ')';
2784 id = pool_rel2id(pool, name, evr, REL_NAMESPACE, 1);
2785 for (i = 2; i < npieces; i++)
2786 queue_push(&q, testcase_str2solvid(pool, pieces[i]));
2787 /* now do the callback */
2790 pool_addfileprovides(pool);
2791 pool_createwhatprovides(pool);
2794 pool->whatprovides_rel[GETRELID(id)] = pool_queuetowhatprovides(pool, &q);
2798 else if (!strcmp(pieces[0], "poolflags"))
2801 if (!poolflagsreset)
2804 testcase_resetpoolflags(pool); /* hmm */
2806 for (i = 1; i < npieces; i++)
2807 testcase_setpoolflags(pool, pieces[i]);
2809 else if (!strcmp(pieces[0], "solverflags") && npieces > 1)
2814 solv = solver_create(pool);
2815 testcase_resetsolverflags(solv);
2817 for (i = 1; i < npieces; i++)
2818 testcase_setsolverflags(solv, pieces[i]);
2820 else if (!strcmp(pieces[0], "result") && npieces > 1)
2823 int resultflags = str2resultflags(pool, pieces[1]);
2827 rdata = pool_tmpjoin(pool, testcasedir, pieces[2], 0);
2828 if (!strcmp(pieces[2], "<inline>"))
2829 result = read_inline_file(fp, &buf, &bufp, &bufl);
2832 FILE *rfp = fopen(rdata, "r");
2834 pool_error(pool, 0, "testcase_read: could not open '%s'", rdata);
2837 result = read_file(rfp);
2847 *resultflagsp = resultflags;
2849 else if (!strcmp(pieces[0], "nextjob"))
2851 if (npieces == 2 && resultflagsp && !strcmp(pieces[1], "reusesolver"))
2852 *resultflagsp |= TESTCASE_RESULT_REUSE_SOLVER;
2855 else if (!strcmp(pieces[0], "disable") && npieces == 3)
2858 if (strcmp(pieces[1], "pkg"))
2860 pool_error(pool, 0, "testcase_read: bad disable type '%s'", pieces[1]);
2864 pool_createwhatprovides(pool);
2866 if (!pool->considered)
2868 pool->considered = solv_calloc(1, sizeof(Map));
2869 map_init(pool->considered, pool->nsolvables);
2870 map_setall(pool->considered);
2872 p = testcase_str2solvid(pool, pieces[2]);
2874 MAPCLR(pool->considered, p);
2876 pool_error(pool, 0, "disable: unknown package '%s'", pieces[2]);
2878 else if (!strcmp(pieces[0], "feature"))
2881 for (i = 1; i < npieces; i++)
2883 for (j = 0; features[j]; j++)
2884 if (!strcmp(pieces[i], features[j]))
2888 pool_error(pool, 0, "testcase_read: missing feature '%s'", pieces[i]);
2892 if (missing_features)
2895 else if (!strcmp(pieces[0], "genid") && npieces > 1)
2902 for (sp = pieces[2]; sp < pieces[npieces - 1]; sp++)
2906 genid = solv_extend(genid, ngenid, 1, sizeof(*genid), 7);
2907 if (!strcmp(pieces[1], "op") && npieces > 2)
2910 for (op = oplist; op->flags; op++)
2911 if (!strncmp(pieces[2], op->opname, strlen(op->opname)))
2915 pool_error(pool, 0, "testcase_read: genid: unknown op '%s'", pieces[2]);
2920 pool_error(pool, 0, "testcase_read: genid: out of stack");
2924 id = pool_rel2id(pool, genid[ngenid] , genid[ngenid + 1], op->flags, 1);
2926 else if (!strcmp(pieces[1], "lit"))
2927 id = pool_str2id(pool, npieces > 2 ? pieces[2] : "", 1);
2928 else if (!strcmp(pieces[1], "null"))
2930 else if (!strcmp(pieces[1], "dep"))
2931 id = testcase_str2dep(pool, pieces[2]);
2934 pool_error(pool, 0, "testcase_read: genid: unknown command '%s'", pieces[1]);
2937 genid[ngenid++] = id;
2939 else if (!strcmp(pieces[0], "autoinst") && npieces > 2)
2941 if (strcmp(pieces[1], "name"))
2943 pool_error(pool, 0, "testcase_read: autoinst: illegal mode");
2946 queue_push(&autoinstq, pool_str2id(pool, pieces[2], 1));
2950 pool_error(pool, 0, "testcase_read: cannot parse command '%s'", pieces[0]);
2953 while (job && ngenid > 0)
2954 queue_push2(job, SOLVER_NOOP | SOLVER_SOLVABLE_PROVIDES, genid[--ngenid]);
2955 if (autoinstq.count)
2956 pool_add_userinstalled_jobs(pool, &autoinstq, job, GET_USERINSTALLED_NAMES | GET_USERINSTALLED_INVERTED);
2957 queue_free(&autoinstq);
2958 genid = solv_free(genid);
2959 buf = solv_free(buf);
2960 pieces = solv_free(pieces);
2961 solv_free(testcasedir);
2964 pool_addfileprovides(pool);
2965 pool_createwhatprovides(pool);
2969 solv = solver_create(pool);
2970 testcase_resetsolverflags(solv);
2974 if (missing_features)
2979 *resultflagsp = 77; /* hack for testsolv */
2985 testcase_resultdiff(const char *result1, const char *result2)
2987 Strqueue sq1, sq2, osq;
2989 strqueue_init(&sq1);
2990 strqueue_init(&sq2);
2991 strqueue_init(&osq);
2992 strqueue_split(&sq1, result1);
2993 strqueue_split(&sq2, result2);
2994 strqueue_sort(&sq1);
2995 strqueue_sort(&sq2);
2996 strqueue_diff(&sq1, &sq2, &osq);
2997 r = osq.nstr ? strqueue_join(&osq) : 0;
2998 strqueue_free(&sq1);
2999 strqueue_free(&sq2);
3000 strqueue_free(&osq);