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" },
156 { DISTTYPE_CONDA, "conda" },
160 static struct selflags2str {
164 { SELECTION_NAME, "name" },
165 { SELECTION_PROVIDES, "provides" },
166 { SELECTION_FILELIST, "filelist" },
167 { SELECTION_CANON, "canon" },
168 { SELECTION_DOTARCH, "dotarch" },
169 { SELECTION_REL, "rel" },
170 { SELECTION_INSTALLED_ONLY, "installedonly" },
171 { SELECTION_GLOB, "glob" },
172 { SELECTION_FLAT, "flat" },
173 { SELECTION_NOCASE, "nocase" },
174 { SELECTION_SOURCE_ONLY, "sourceonly" },
175 { SELECTION_WITH_SOURCE, "withsource" },
176 { SELECTION_SKIP_KIND, "skipkind" },
177 { SELECTION_MATCH_DEPSTR, "depstr" },
178 { SELECTION_WITH_DISABLED, "withdisabled" },
179 { SELECTION_WITH_BADARCH, "withbadarch" },
180 { SELECTION_ADD, "add" },
181 { SELECTION_SUBTRACT, "subtract" },
182 { SELECTION_FILTER, "filter" },
186 static const char *features[] = {
187 #ifdef ENABLE_LINKED_PKGS
190 #ifdef ENABLE_COMPLEX_DEPS
193 #if ENABLE_TESTCASE_HELIXREPO
194 "testcase_helixrepo",
199 typedef struct strqueue {
204 #define STRQUEUE_BLOCK 63
207 strqueue_init(Strqueue *q)
214 strqueue_free(Strqueue *q)
217 for (i = 0; i < q->nstr; i++)
218 solv_free(q->str[i]);
219 q->str = solv_free(q->str);
224 strqueue_push(Strqueue *q, const char *s)
226 q->str = solv_extend(q->str, q->nstr, 1, sizeof(*q->str), STRQUEUE_BLOCK);
227 q->str[q->nstr++] = solv_strdup(s);
231 strqueue_pushjoin(Strqueue *q, const char *s1, const char *s2, const char *s3)
233 q->str = solv_extend(q->str, q->nstr, 1, sizeof(*q->str), STRQUEUE_BLOCK);
234 q->str[q->nstr++] = solv_dupjoin(s1, s2, s3);
238 strqueue_sort_cmp(const void *ap, const void *bp, void *dp)
240 const char *a = *(const char **)ap;
241 const char *b = *(const char **)bp;
242 return strcmp(a ? a : "", b ? b : "");
246 strqueue_sort(Strqueue *q)
249 solv_sort(q->str, q->nstr, sizeof(*q->str), strqueue_sort_cmp, 0);
253 strqueue_sort_u(Strqueue *q)
257 for (i = j = 0; i < q->nstr; i++)
258 if (!j || strqueue_sort_cmp(q->str + i, q->str + j - 1, 0) != 0)
259 q->str[j++] = q->str[i];
264 strqueue_join(Strqueue *q)
268 for (i = 0; i < q->nstr; i++)
270 l += strlen(q->str[i]) + 1;
271 l++; /* trailing \0 */
274 for (i = 0; i < q->nstr; i++)
277 strcpy(rp, q->str[i]);
286 strqueue_split(Strqueue *q, const char *s)
291 while ((p = strchr(s, '\n')) != 0)
293 q->str = solv_extend(q->str, q->nstr, 1, sizeof(*q->str), STRQUEUE_BLOCK);
294 q->str[q->nstr] = solv_malloc(p - s + 1);
296 memcpy(q->str[q->nstr], s, p - s);
297 q->str[q->nstr][p - s] = 0;
306 strqueue_diff(Strqueue *sq1, Strqueue *sq2, Strqueue *osq)
309 while (i < sq1->nstr && j < sq2->nstr)
311 int r = strqueue_sort_cmp(sq1->str + i, sq2->str + j, 0);
315 strqueue_pushjoin(osq, "-", sq1->str[i++], 0);
317 strqueue_pushjoin(osq, "+", sq2->str[j++], 0);
319 while (i < sq1->nstr)
320 strqueue_pushjoin(osq, "-", sq1->str[i++], 0);
321 while (j < sq2->nstr)
322 strqueue_pushjoin(osq, "+", sq2->str[j++], 0);
327 testcase_id2str(Pool *pool, Id id, int isname)
329 const char *s = pool_id2str(pool, id);
332 int bad = 0, paren = 0, parenbad = 0;
338 if (strchr("[(<=>!", *s))
340 if (!strncmp(s, "namespace:", 10))
342 for (ss = s + bad; *ss; ss++)
344 if (*ss == ' ' || *ss == '\\' || *(unsigned char *)ss < 32 || *ss == '(' || *ss == ')')
347 paren = paren == 0 ? 1 : -1;
350 paren = paren == 1 ? 0 : -1;
355 if (isname && ss - s > 4 && !strcmp(ss - 4, ":any"))
357 if (!paren && !(bad - parenbad))
360 /* we need escaping! */
361 s2 = s2p = pool_alloctmpspace(pool, strlen(s) + bad * 2 + 1);
362 if (!strncmp(s, "namespace:", 10))
364 strcpy(s2p, "namespace\\3a");
372 if ((ss == s && strchr("[(<=>!", *s)) || *ss == ' ' || *ss == '\\' || *(unsigned char *)ss < 32 || *ss == '(' || *ss == ')')
375 solv_bin2hex((unsigned char *)ss, 1, s2p);
380 if (isname && s2p - s2 > 4 && !strcmp(s2p - 4, ":any"))
381 strcpy(s2p - 4, "\\3aany");
390 { REL_GT | REL_LT | REL_EQ, "<=>" },
391 { REL_LT | REL_EQ, "<=" },
392 { REL_GT | REL_EQ, ">=" },
394 { REL_GT | REL_LT, "<>" },
398 { REL_WITHOUT , "-" },
399 { REL_NAMESPACE , "<NAMESPACE>" },
401 { REL_MULTIARCH, "<MULTIARCH>" },
402 { REL_FILECONFLICT, "<FILECONFLICT>" },
403 { REL_COND, "<IF>" },
404 { REL_COMPAT, "compat >=" },
405 { REL_KIND, "<KIND>" },
406 { REL_ELSE, "<ELSE>" },
407 { REL_ERROR, "<ERROR>" },
408 { REL_UNLESS, "<UNLESS>" },
409 { REL_CONDA, "<CONDA>" },
415 testcase_dep2str_complex(Pool *pool, char *s, Id id, int addparens)
424 s2 = testcase_id2str(pool, id, 1);
425 s = pool_tmpappend(pool, s, s2, 0);
426 pool_freetmpspace(pool, s2);
429 rd = GETRELDEP(pool, id);
431 /* check for special shortcuts */
432 if (rd->flags == REL_NAMESPACE && !ISRELDEP(rd->name) && !strncmp(pool_id2str(pool, rd->name), "namespace:", 10))
434 s = pool_tmpappend(pool, s, pool_id2str(pool, rd->name), "(");
435 s = testcase_dep2str_complex(pool, s, rd->evr, 0);
436 return pool_tmpappend(pool, s, ")", 0);
438 if (rd->flags == REL_MULTIARCH && !ISRELDEP(rd->name) && rd->evr == ARCH_ANY)
440 /* append special :any suffix */
441 s2 = testcase_id2str(pool, rd->name, 1);
442 s = pool_tmpappend(pool, s, s2, ":any");
443 pool_freetmpspace(pool, s2);
448 if (ISRELDEP(rd->name))
450 Reldep *rd2 = GETRELDEP(pool, rd->name);
452 if (rd->flags > 7 && rd->flags != REL_COMPAT && rd2->flags && rd2->flags <= 7)
457 s = pool_tmpappend(pool, s, "(", 0);
458 s = testcase_dep2str_complex(pool, s, rd->name, needparens);
460 for (op = oplist; op->flags; op++)
461 if (rd->flags == op->flags)
465 s = pool_tmpappend(pool, s, " ", op->opname);
466 s = pool_tmpappend(pool, s, " ", 0);
471 sprintf(buf, " <%u> ", rd->flags);
472 s = pool_tmpappend(pool, s, buf, 0);
476 if (ISRELDEP(rd->evr))
478 Reldep *rd2 = GETRELDEP(pool, rd->evr);
480 if (rd->flags > 7 && rd2->flags && rd2->flags <= 7)
482 if (rd->flags == REL_AND && rd2->flags == REL_AND)
483 needparens = 0; /* chain */
484 if (rd->flags == REL_OR && rd2->flags == REL_OR)
485 needparens = 0; /* chain */
486 if (rd->flags > 0 && rd->flags < 8 && rd2->flags == REL_COMPAT)
487 needparens = 0; /* chain */
489 if (!ISRELDEP(rd->evr))
491 s2 = testcase_id2str(pool, rd->evr, 0);
492 s = pool_tmpappend(pool, s, s2, 0);
493 pool_freetmpspace(pool, s2);
496 s = (char *)testcase_dep2str_complex(pool, s, rd->evr, needparens);
498 s = pool_tmpappend(pool, s, ")", 0);
503 testcase_dep2str(Pool *pool, Id id)
507 return testcase_id2str(pool, id, 1);
508 s = pool_alloctmpspace(pool, 1);
510 return testcase_dep2str_complex(pool, s, id, 0);
514 /* Convert a simple string. Also handle the :any suffix */
516 testcase_str2dep_simple(Pool *pool, const char **sp, int isname)
523 for (s = *sp; *s; s++)
527 if (*s == ' ' || *(unsigned char *)s < 32)
531 if (*s == ')' && paren-- <= 0)
534 if (isname && s - *sp > 4 && !strncmp(s - 4, ":any", 4))
541 if (s - *sp == 6 && !strncmp(*sp, "<NULL>", 6))
544 id = pool_strn2id(pool, *sp, s - *sp, 1);
546 else if (s - *sp == 3 && !strncmp(*sp, "\\00", 3))
550 char buf[128], *bp, *bp2;
552 bp = s - *sp >= 128 ? solv_malloc(s - *sp + 1) : buf;
553 for (bp2 = bp, sp2 = *sp; sp2 < s;)
557 solv_hex2bin(&sp2, (unsigned char *)bp2 - 1, 1);
560 id = pool_str2id(pool, bp, 1);
566 id = pool_rel2id(pool, id, ARCH_ANY, REL_MULTIARCH, 1);
575 testcase_str2dep_complex(Pool *pool, const char **sp, int relop)
578 Id flags, id, id2, namespaceid = 0;
583 while (*s == ' ' || *s == '\t')
585 if (!strncmp(s, "namespace:", 10))
587 /* special namespace hack */
589 for (s2 = s + 10; *s2 && *s2 != '('; s2++)
593 namespaceid = pool_strn2id(pool, s, s2 - s, 1);
600 id = testcase_str2dep_complex(pool, &s, 0);
609 id = testcase_str2dep_simple(pool, &s, relop ? 0 : 1);
611 id = pool_rel2id(pool, namespaceid, id, REL_NAMESPACE, 1);
615 while (*s == ' ' || *s == '\t')
617 if (!*s || *s == ')' || (relop && strncmp(s, "compat >= ", 10) != 0))
623 /* we have an op! Find the end */
625 if (s[0] == '<' && (s[1] >= '0' && s[1] <= '9'))
628 for (s2 = s + 1; *s2 >= '0' && *s2 <= '9'; s2++)
632 flags = strtoul(s + 1, 0, 10);
638 for (op = oplist; op->flags; op++)
639 if (!strncmp(s, op->opname, strlen(op->opname)))
647 s += strlen(op->opname);
649 id2 = testcase_str2dep_complex(pool, &s, flags > 0 && flags < 8);
655 id = pool_rel2id(pool, id, id2, flags, 1);
660 testcase_str2dep(Pool *pool, const char *s)
662 Id id = testcase_str2dep_complex(pool, &s, 0);
663 return s && !*s ? id : 0;
666 /**********************************************************/
669 testcase_repoid2str(Pool *pool, Id repoid)
671 Repo *repo = pool_id2repo(pool, repoid);
674 char *r = pool_tmpjoin(pool, repo->name, 0, 0);
676 for (rp = r; *rp; rp++)
677 if (*rp == ' ' || *rp == '\t')
684 sprintf(buf, "#%d", repoid);
685 return pool_tmpjoin(pool, buf, 0, 0);
690 testcase_solvid2str(Pool *pool, Id p)
692 Solvable *s = pool->solvables + p;
693 const char *n, *e, *a;
696 if (p == SYSTEMSOLVABLE)
698 n = pool_id2str(pool, s->name);
699 e = pool_id2str(pool, s->evr);
700 a = pool_id2str(pool, s->arch);
701 str = pool_alloctmpspace(pool, strlen(n) + strlen(e) + strlen(a) + 3);
702 sprintf(str, "%s-%s.%s", n, e, a);
704 return pool_tmpappend(pool, str, "@", 0);
708 char *str2 = pool_tmpappend(pool, str, "@", s->repo->name);
710 if (str2[l] == ' ' || str2[l] == '\t')
714 sprintf(buf, "@#%d", s->repo->repoid);
715 return pool_tmpappend(pool, str, buf, 0);
719 testcase_str2repo(Pool *pool, const char *str)
723 if (str[0] == '#' && (str[1] >= '0' && str[1] <= '9'))
727 for (j = 1; str[j] >= '0' && str[j] <= '9'; j++)
728 repoid = repoid * 10 + (str[j] - '0');
729 if (!str[j] && repoid > 0 && repoid < pool->nrepos)
730 repo = pool_id2repo(pool, repoid);
734 FOR_REPOS(repoid, repo)
739 l = strlen(repo->name);
740 for (i = 0; i < l; i++)
742 int c = repo->name[i];
743 if (c == ' ' || c == '\t')
748 if (i == l && !str[l])
751 if (repoid >= pool->nrepos)
758 testcase_str2solvid(Pool *pool, const char *str)
760 int i, l = strlen(str);
767 if (*str == '@' && !strcmp(str, "@SYSTEM"))
768 return SYSTEMSOLVABLE;
770 for (i = l - 1; i >= 0; i--)
771 if (str[i] == '@' && (repo = testcase_str2repo(pool, str + i + 1)) != 0)
776 /* now find the arch (if present) */
778 for (i = repostart - 1; i > 0; i--)
781 arch = pool_strn2id(pool, str + i + 1, repostart - (i + 1), 0);
786 /* now find the name */
787 for (i = repostart - 1; i > 0; i--)
791 Id nid, evrid, p, pp;
792 nid = pool_strn2id(pool, str, i, 0);
795 evrid = pool_strn2id(pool, str + i + 1, repostart - (i + 1), 0);
798 /* first check whatprovides */
799 FOR_PROVIDES(p, pp, nid)
801 Solvable *s = pool->solvables + p;
802 if (s->name != nid || s->evr != evrid)
804 if (repo && s->repo != repo)
806 if (arch && s->arch != arch)
810 /* maybe it's not installable and thus not in whatprovides. do a slow search */
814 FOR_REPO_SOLVABLES(repo, p, s)
816 if (s->name != nid || s->evr != evrid)
818 if (arch && s->arch != arch)
825 FOR_POOL_SOLVABLES(p)
827 Solvable *s = pool->solvables + p;
828 if (s->name != nid || s->evr != evrid)
830 if (arch && s->arch != arch)
841 testcase_job2str(Pool *pool, Id how, Id what)
848 Id select = how & SOLVER_SELECTMASK;
850 for (i = 0; job2str[i].str; i++)
851 if ((how & SOLVER_JOBMASK) == job2str[i].job)
853 jobstr = job2str[i].str ? job2str[i].str : "unknown";
854 if (select == SOLVER_SOLVABLE)
857 pkgstr = testcase_solvid2str(pool, what);
859 else if (select == SOLVER_SOLVABLE_NAME)
862 pkgstr = testcase_dep2str(pool, what);
864 else if (select == SOLVER_SOLVABLE_PROVIDES)
866 selstr = " provides ";
867 pkgstr = testcase_dep2str(pool, what);
869 else if (select == SOLVER_SOLVABLE_ONE_OF)
874 while ((p = pool->whatprovidesdata[what++]) != 0)
876 const char *s = testcase_solvid2str(pool, p);
879 pkgstr = pool_tmpappend(pool, pkgstr, " ", s);
880 pool_freetmpspace(pool, s);
888 else if (select == SOLVER_SOLVABLE_REPO)
890 Repo *repo = pool_id2repo(pool, what);
895 sprintf(buf, "#%d", repo->repoid);
896 pkgstr = pool_tmpjoin(pool, buf, 0, 0);
899 pkgstr = pool_tmpjoin(pool, repo->name, 0, 0);
901 else if (select == SOLVER_SOLVABLE_ALL)
908 selstr = " unknown ";
911 ret = pool_tmpjoin(pool, jobstr, selstr, pkgstr);
913 ret = pool_tmpappend(pool, ret, " ", 0);
914 for (i = 0; jobflags2str[i].str; i++)
915 if ((how & jobflags2str[i].flag) != 0)
916 ret = pool_tmpappend(pool, ret, ",", jobflags2str[i].str);
922 ret = pool_tmpappend(pool, ret, "]", 0);
928 str2selflags(Pool *pool, char *s) /* modifies the string! */
933 char *se = strchr(s, ',');
936 for (i = 0; selflags2str[i].str; i++)
937 if (!strcmp(s, selflags2str[i].str))
939 selflags |= selflags2str[i].flag;
942 if (!selflags2str[i].str)
943 pool_error(pool, 0, "str2job: unknown selection flag '%s'", s);
950 str2jobflags(Pool *pool, char *s) /* modifies the string */
955 char *se = strchr(s, ',');
958 for (i = 0; jobflags2str[i].str; i++)
959 if (!strcmp(s, jobflags2str[i].str))
961 jobflags |= jobflags2str[i].flag;
964 if (!jobflags2str[i].str)
965 pool_error(pool, 0, "str2job: unknown job flag '%s'", s);
972 testcase_str2jobsel(Pool *pool, const char *caller, char **pieces, int npieces, Id *whatp)
975 if (!strcmp(pieces[0], "pkg") && npieces == 2)
977 job = SOLVER_SOLVABLE;
978 what = testcase_str2solvid(pool, pieces[1]);
980 return pool_error(pool, -1, "%s: unknown package '%s'", caller, pieces[1]);
982 else if (!strcmp(pieces[0], "name") || !strcmp(pieces[0], "provides"))
984 /* join em again for dep2str... */
986 for (sp = pieces[1]; sp < pieces[npieces - 1]; sp++)
990 if (pieces[0][0] == 'p' && strncmp(pieces[1], "namespace:", 10) == 0)
992 char *spe = strchr(pieces[1], '(');
993 int l = strlen(pieces[1]);
994 if (spe && pieces[1][l - 1] == ')')
996 /* special namespace provides */
997 if (strcmp(spe, "(<NULL>)") != 0)
999 pieces[1][l - 1] = 0;
1000 what = testcase_str2dep(pool, spe + 1);
1001 pieces[1][l - 1] = ')';
1003 what = pool_rel2id(pool, pool_strn2id(pool, pieces[1], spe - pieces[1], 1), what, REL_NAMESPACE, 1);
1007 what = testcase_str2dep(pool, pieces[1]);
1008 if (pieces[0][0] == 'n')
1009 job = SOLVER_SOLVABLE_NAME;
1011 job = SOLVER_SOLVABLE_PROVIDES;
1013 else if (!strcmp(pieces[0], "oneof"))
1016 job = SOLVER_SOLVABLE_ONE_OF;
1018 if (npieces > 1 && strcmp(pieces[1], "nothing") != 0)
1021 for (i = 1; i < npieces; i++)
1023 Id p = testcase_str2solvid(pool, pieces[i]);
1027 return pool_error(pool, -1, "%s: unknown package '%s'", caller, pieces[i]);
1032 what = pool_queuetowhatprovides(pool, &q);
1035 else if (!strcmp(pieces[0], "repo") && npieces == 2)
1037 Repo *repo = testcase_str2repo(pool, pieces[1]);
1039 return pool_error(pool, -1, "%s: unknown repo '%s'", caller, pieces[1]);
1040 job = SOLVER_SOLVABLE_REPO;
1041 what = repo->repoid;
1043 else if (!strcmp(pieces[0], "all") && npieces == 2 && !strcmp(pieces[1], "packages"))
1045 job = SOLVER_SOLVABLE_ALL;
1050 /* join em again for the error message... */
1052 for (sp = pieces[0]; sp < pieces[npieces - 1]; sp++)
1055 return pool_error(pool, -1, "%s: bad line '%s'", caller, pieces[0]);
1062 testcase_str2job(Pool *pool, const char *str, Id *whatp)
1072 /* so we can patch it */
1073 s = pool_tmpjoin(pool, str, 0, 0);
1074 /* split it in pieces */
1077 while (*s == ' ' || *s == '\t')
1081 pieces = solv_extend(pieces, npieces, 1, sizeof(*pieces), 7);
1082 pieces[npieces++] = s;
1083 while (*s && *s != ' ' && *s != '\t')
1090 pool_error(pool, -1, "str2job: bad line '%s'", str);
1095 for (i = 0; job2str[i].str; i++)
1096 if (!strcmp(pieces[0], job2str[i].str))
1098 if (!job2str[i].str)
1100 pool_error(pool, -1, "str2job: unknown job '%s'", str);
1104 job = job2str[i].job;
1108 char *flags = pieces[npieces - 1];
1109 if (*flags == '[' && flags[strlen(flags) - 1] == ']')
1113 flags[strlen(flags) - 1] = 0;
1114 job |= str2jobflags(pool, flags);
1117 jobsel = testcase_str2jobsel(pool, "str2job", pieces + 1, npieces - 1, &what);
1122 return job | jobsel;
1125 #define SELECTIONJOB_MATCHDEPS 1
1126 #define SELECTIONJOB_MATCHDEPID 2
1127 #define SELECTIONJOB_MATCHSOLVABLE 3
1130 addselectionjob(Pool *pool, char **pieces, int npieces, Queue *jobqueue, int type, int keyname)
1138 for (i = 0; job2str[i].str; i++)
1139 if (!strcmp(pieces[0], job2str[i].str))
1141 if (!job2str[i].str)
1142 return pool_error(pool, -1, "selstr2job: unknown job '%s'", pieces[0]);
1143 job = job2str[i].job;
1146 char *flags = pieces[npieces - 1];
1147 if (*flags == '[' && flags[strlen(flags) - 1] == ']')
1151 flags[strlen(flags) - 1] = 0;
1152 job |= str2jobflags(pool, flags);
1156 return pool_error(pool, -1, "selstr2job: no selection flags");
1157 selflags = str2selflags(pool, pieces[npieces - 1]);
1158 /* re-join pieces */
1159 for (sp = pieces[2]; sp < pieces[npieces - 2]; sp++)
1163 if (selflags & (SELECTION_ADD | SELECTION_SUBTRACT | SELECTION_FILTER))
1165 for (i = 0; i < jobqueue->count; i += 2)
1166 queue_push2(&sel, jobqueue->elements[i] & (SOLVER_SELECTMASK | SOLVER_SETMASK), jobqueue->elements[i + 1]);
1167 queue_empty(jobqueue);
1170 r = selection_make(pool, &sel, pieces[2], selflags);
1171 else if (type == SELECTIONJOB_MATCHDEPS)
1172 r = selection_make_matchdeps(pool, &sel, pieces[2], selflags, keyname, 0);
1173 else if (type == SELECTIONJOB_MATCHDEPID)
1174 r = selection_make_matchdepid(pool, &sel, testcase_str2dep(pool, pieces[2]), selflags, keyname, 0);
1175 else if (type == SELECTIONJOB_MATCHSOLVABLE)
1176 r = selection_make_matchsolvable(pool, &sel, testcase_str2solvid(pool, pieces[2]), selflags, keyname, 0);
1177 for (i = 0; i < sel.count; i += 2)
1178 queue_push2(jobqueue, job | sel.elements[i], sel.elements[i + 1]);
1184 writedeps(Repo *repo, FILE *fp, const char *tag, Id key, Solvable *s, Offset off)
1186 Pool *pool = repo->pool;
1193 dp = repo->idarraydata + off;
1194 while ((id = *dp++) != 0)
1196 if (key == SOLVABLE_REQUIRES && id == SOLVABLE_PREREQMARKER)
1199 fprintf(fp, "-%s\n", tag);
1204 if (key == SOLVABLE_PROVIDES && id == SOLVABLE_FILEMARKER)
1206 idstr = testcase_dep2str(pool, id);
1209 fprintf(fp, "+%s\n", tag);
1212 fprintf(fp, "%s\n", idstr);
1215 fprintf(fp, "-%s\n", tag);
1219 writefilelist(Repo *repo, FILE *fp, const char *tag, Solvable *s)
1221 Pool *pool = repo->pool;
1225 dataiterator_init(&di, pool, repo, s - pool->solvables, SOLVABLE_FILELIST, 0, 0);
1226 while (dataiterator_step(&di))
1228 const char *s = repodata_dir2str(di.data, di.kv.id, di.kv.str);
1231 fprintf(fp, "+%s\n", tag);
1234 fprintf(fp, "%s\n", s);
1237 fprintf(fp, "-%s\n", tag);
1238 dataiterator_free(&di);
1242 testcase_write_testtags(Repo *repo, FILE *fp)
1244 Pool *pool = repo->pool;
1250 const char *release;
1255 fprintf(fp, "=Ver: 3.0\n");
1257 FOR_REPO_SOLVABLES(repo, p, s)
1259 name = pool_id2str(pool, s->name);
1260 evr = pool_id2str(pool, s->evr);
1261 arch = pool_id2str(pool, s->arch);
1262 release = strrchr(evr, '-');
1264 release = evr + strlen(evr);
1265 fprintf(fp, "=Pkg: %s %.*s %s %s\n", name, (int)(release - evr), evr, *release && release[1] ? release + 1 : "-", arch);
1266 tmp = solvable_lookup_str(s, SOLVABLE_SUMMARY);
1268 fprintf(fp, "=Sum: %s\n", tmp);
1269 writedeps(repo, fp, "Req:", SOLVABLE_REQUIRES, s, s->requires);
1270 writedeps(repo, fp, "Prv:", SOLVABLE_PROVIDES, s, s->provides);
1271 writedeps(repo, fp, "Obs:", SOLVABLE_OBSOLETES, s, s->obsoletes);
1272 writedeps(repo, fp, "Con:", SOLVABLE_CONFLICTS, s, s->conflicts);
1273 writedeps(repo, fp, "Rec:", SOLVABLE_RECOMMENDS, s, s->recommends);
1274 writedeps(repo, fp, "Sup:", SOLVABLE_SUPPLEMENTS, s, s->supplements);
1275 writedeps(repo, fp, "Sug:", SOLVABLE_SUGGESTS, s, s->suggests);
1276 writedeps(repo, fp, "Enh:", SOLVABLE_ENHANCES, s, s->enhances);
1277 if (solvable_lookup_idarray(s, SOLVABLE_PREREQ_IGNOREINST, &q))
1280 fprintf(fp, "+Ipr:\n");
1281 for (i = 0; i < q.count; i++)
1282 fprintf(fp, "%s\n", testcase_dep2str(pool, q.elements[i]));
1283 fprintf(fp, "-Ipr:\n");
1286 fprintf(fp, "=Vnd: %s\n", pool_id2str(pool, s->vendor));
1287 ti = solvable_lookup_num(s, SOLVABLE_BUILDTIME, 0);
1289 fprintf(fp, "=Tim: %u\n", ti);
1290 writefilelist(repo, fp, "Fls:", s);
1296 static inline Offset
1297 adddep(Repo *repo, Offset olddeps, char *str, Id marker)
1299 Id id = *str == '/' ? pool_str2id(repo->pool, str, 1) : testcase_str2dep(repo->pool, str);
1300 return repo_addid_dep(repo, olddeps, id, marker);
1304 finish_v2_solvable(Pool *pool, Repodata *data, Solvable *s, char *filelist, int nfilelist)
1310 for (l = 0; l < nfilelist; l += strlen(filelist + l) + 1)
1312 char *p = strrchr(filelist + l, '/');
1316 did = repodata_str2dir(data, filelist + l, 1);
1319 did = repodata_str2dir(data, "/", 1);
1320 repodata_add_dirstr(data, s - pool->solvables, SOLVABLE_FILELIST, did, p);
1323 repo_rewrite_suse_deps(s, 0);
1326 /* stripped down version of susetags parser used for testcases */
1328 testcase_add_testtags(Repo *repo, FILE *fp, int flags)
1330 Pool *pool = repo->pool;
1342 int tagsversion = 0;
1343 int addselfprovides = 1; /* for compat reasons */
1345 data = repo_add_repodata(repo, flags);
1350 line = solv_malloc(aline);
1354 if (linep - line + 16 > aline)
1356 aline = linep - line;
1357 line = solv_realloc(line, aline + 512);
1358 linep = line + aline;
1361 if (!fgets(linep, aline - (linep - line), fp))
1363 linep += strlen(linep);
1364 if (linep == line || linep[-1] != '\n')
1367 linep = line + intag;
1370 if (line[intag] == '-' && !strncmp(line + 1, line + intag + 1, intag - 2))
1377 else if (line[0] == '+' && line[1] && line[1] != ':')
1379 char *tagend = strchr(line, ':');
1384 intag = tagend + 2 - line;
1385 linep = line + intag;
1388 if (*line != '=' || !line[1] || !line[2] || !line[3] || line[4] != ':')
1390 tag = line[1] << 16 | line[2] << 8 | line[3];
1391 /* tags that do not need a solvable */
1394 case 'V' << 16 | 'e' << 8 | 'r':
1395 tagsversion = atoi(line + 6);
1396 addselfprovides = tagsversion < 3 || strstr(line + 6, "addselfprovides") != 0;
1398 case 'P' << 16 | 'k' << 8 | 'g':
1401 if (tagsversion == 2)
1402 finish_v2_solvable(pool, data, s, filelist, nfilelist);
1403 if (addselfprovides && s->name && s->arch != ARCH_SRC && s->arch != ARCH_NOSRC)
1404 s->provides = repo_addid_dep(s->repo, s->provides, pool_rel2id(pool, s->name, s->evr, REL_EQ, 1), 0);
1407 if (split(line + 5, sp, 5) != 4)
1409 s = pool_id2solvable(pool, repo_add_solvable(repo));
1410 s->name = pool_str2id(pool, sp[0], 1);
1411 /* join back version and release */
1412 if (sp[2] && !(sp[2][0] == '-' && !sp[2][1]))
1414 s->evr = makeevr(pool, sp[1]);
1415 s->arch = pool_str2id(pool, sp[3], 1);
1422 /* tags that need a solvable */
1425 case 'S' << 16 | 'u' << 8 | 'm':
1426 repodata_set_str(data, s - pool->solvables, SOLVABLE_SUMMARY, line + 6);
1428 case 'V' << 16 | 'n' << 8 | 'd':
1429 s->vendor = pool_str2id(pool, line + 6, 1);
1431 case 'T' << 16 | 'i' << 8 | 'm':
1434 repodata_set_num(data, s - pool->solvables, SOLVABLE_BUILDTIME, t);
1436 case 'R' << 16 | 'e' << 8 | 'q':
1437 s->requires = adddep(repo, s->requires, line + 6, -SOLVABLE_PREREQMARKER);
1439 case 'P' << 16 | 'r' << 8 | 'q':
1440 s->requires = adddep(repo, s->requires, line + 6, SOLVABLE_PREREQMARKER);
1442 case 'P' << 16 | 'r' << 8 | 'v':
1443 /* version 2 had the file list at the end of the provides */
1444 if (tagsversion == 2)
1448 int l = strlen(line + 6) + 1;
1449 if (nfilelist + l > afilelist)
1451 afilelist = nfilelist + l + 512;
1452 filelist = solv_realloc(filelist, afilelist);
1454 memcpy(filelist + nfilelist, line + 6, l);
1461 for (l = 0; l < nfilelist; l += strlen(filelist + l) + 1)
1462 s->provides = repo_addid_dep(repo, s->provides, pool_str2id(pool, filelist + l, 1), 0);
1466 s->provides = adddep(repo, s->provides, line + 6, 0);
1468 case 'F' << 16 | 'l' << 8 | 's':
1470 char *p = strrchr(line + 6, '/');
1475 did = repodata_str2dir(data, line + 6, 1);
1477 did = repodata_str2dir(data, "/", 1);
1478 repodata_add_dirstr(data, s - pool->solvables, SOLVABLE_FILELIST, did, p);
1481 case 'O' << 16 | 'b' << 8 | 's':
1482 s->obsoletes = adddep(repo, s->obsoletes, line + 6, 0);
1484 case 'C' << 16 | 'o' << 8 | 'n':
1485 s->conflicts = adddep(repo, s->conflicts, line + 6, 0);
1487 case 'R' << 16 | 'e' << 8 | 'c':
1488 s->recommends = adddep(repo, s->recommends, line + 6, 0);
1490 case 'S' << 16 | 'u' << 8 | 'p':
1491 s->supplements = adddep(repo, s->supplements, line + 6, 0);
1493 case 'S' << 16 | 'u' << 8 | 'g':
1494 s->suggests = adddep(repo, s->suggests, line + 6, 0);
1496 case 'E' << 16 | 'n' << 8 | 'h':
1497 s->enhances = adddep(repo, s->enhances, line + 6, 0);
1499 case 'I' << 16 | 'p' << 8 | 'r':
1501 Id id = line[6] == '/' ? pool_str2id(pool, line + 6, 1) : testcase_str2dep(pool, line + 6);
1502 repodata_add_idarray(data, s - pool->solvables, SOLVABLE_PREREQ_IGNOREINST, id);
1511 if (tagsversion == 2)
1512 finish_v2_solvable(pool, data, s, filelist, nfilelist);
1513 if (addselfprovides && s->name && s->arch != ARCH_SRC && s->arch != ARCH_NOSRC)
1514 s->provides = repo_addid_dep(s->repo, s->provides, pool_rel2id(pool, s->name, s->evr, REL_EQ, 1), 0);
1517 solv_free(filelist);
1518 repodata_free_dircache(data);
1519 if (!(flags & REPO_NO_INTERNALIZE))
1520 repodata_internalize(data);
1525 testcase_getpoolflags(Pool *pool)
1527 const char *str = 0;
1529 for (i = 0; poolflags2str[i].str; i++)
1531 v = pool_get_flag(pool, poolflags2str[i].flag);
1532 if (v == poolflags2str[i].def)
1534 str = pool_tmpappend(pool, str, v ? " " : " !", poolflags2str[i].str);
1536 return str ? str + 1 : "";
1540 testcase_setpoolflags(Pool *pool, const char *str)
1542 const char *p = str, *s;
1546 while (*p == ' ' || *p == '\t' || *p == ',')
1557 while (*p && *p != ' ' && *p != '\t' && *p != ',')
1559 for (i = 0; poolflags2str[i].str; i++)
1560 if (!strncmp(poolflags2str[i].str, s, p - s) && poolflags2str[i].str[p - s] == 0)
1562 if (!poolflags2str[i].str)
1563 return pool_error(pool, 0, "setpoolflags: unknown flag '%.*s'", (int)(p - s), s);
1564 pool_set_flag(pool, poolflags2str[i].flag, v);
1570 testcase_resetpoolflags(Pool *pool)
1573 for (i = 0; poolflags2str[i].str; i++)
1574 pool_set_flag(pool, poolflags2str[i].flag, poolflags2str[i].def);
1578 testcase_getsolverflags(Solver *solv)
1580 Pool *pool = solv->pool;
1581 const char *str = 0;
1583 for (i = 0; solverflags2str[i].str; i++)
1585 v = solver_get_flag(solv, solverflags2str[i].flag);
1586 if (v == solverflags2str[i].def)
1588 str = pool_tmpappend(pool, str, v ? " " : " !", solverflags2str[i].str);
1590 return str ? str + 1 : "";
1594 testcase_setsolverflags(Solver *solv, const char *str)
1596 const char *p = str, *s;
1600 while (*p == ' ' || *p == '\t' || *p == ',')
1611 while (*p && *p != ' ' && *p != '\t' && *p != ',')
1613 for (i = 0; solverflags2str[i].str; i++)
1614 if (!strncmp(solverflags2str[i].str, s, p - s) && solverflags2str[i].str[p - s] == 0)
1616 if (!solverflags2str[i].str)
1617 return pool_error(solv->pool, 0, "setsolverflags: unknown flag '%.*s'", (int)(p - s), s);
1618 if (solver_set_flag(solv, solverflags2str[i].flag, v) == -1)
1619 return pool_error(solv->pool, 0, "setsolverflags: unsupported flag '%s'", solverflags2str[i].str);
1625 testcase_resetsolverflags(Solver *solv)
1628 for (i = 0; solverflags2str[i].str; i++)
1629 solver_set_flag(solv, solverflags2str[i].flag, solverflags2str[i].def);
1633 testcase_ruleid(Solver *solv, Id rid)
1639 const unsigned char *md5;
1645 solver_ruleliterals(solv, rid, &q);
1646 for (i = 0; i < q.count; i++)
1648 Id p = q.elements[i];
1649 s = testcase_solvid2str(solv->pool, p > 0 ? p : -p);
1651 s = pool_tmpjoin(solv->pool, "!", s, 0);
1652 strqueue_push(&sq, s);
1655 strqueue_sort_u(&sq);
1656 chk = solv_chksum_create(REPOKEY_TYPE_MD5);
1657 for (i = 0; i < sq.nstr; i++)
1658 solv_chksum_add(chk, sq.str[i], strlen(sq.str[i]) + 1);
1659 md5 = solv_chksum_get(chk, &md5l);
1660 s = pool_bin2hex(solv->pool, md5, md5l);
1661 chk = solv_chksum_free(chk, 0);
1667 testcase_problemid(Solver *solv, Id problem)
1672 const unsigned char *md5;
1676 /* we build a hash of all rules that define the problem */
1679 solver_findallproblemrules(solv, problem, &q);
1680 for (i = 0; i < q.count; i++)
1681 strqueue_push(&sq, testcase_ruleid(solv, q.elements[i]));
1683 strqueue_sort_u(&sq);
1684 chk = solv_chksum_create(REPOKEY_TYPE_MD5);
1685 for (i = 0; i < sq.nstr; i++)
1686 solv_chksum_add(chk, sq.str[i], strlen(sq.str[i]) + 1);
1687 md5 = solv_chksum_get(chk, &md5l);
1688 s = pool_bin2hex(solv->pool, md5, 4);
1689 chk = solv_chksum_free(chk, 0);
1695 testcase_solutionid(Solver *solv, Id problem, Id solution)
1699 const unsigned char *md5;
1703 intid = solver_solutionelement_internalid(solv, problem, solution);
1704 /* internal stuff! handle with care! */
1708 s = testcase_job2str(solv->pool, solv->job.elements[-intid - 1], solv->job.elements[-intid]);
1713 s = testcase_ruleid(solv, intid);
1715 chk = solv_chksum_create(REPOKEY_TYPE_MD5);
1716 solv_chksum_add(chk, s, strlen(s) + 1);
1717 md5 = solv_chksum_get(chk, &md5l);
1718 s = pool_bin2hex(solv->pool, md5, 4);
1719 chk = solv_chksum_free(chk, 0);
1724 testcase_alternativeid(Solver *solv, int type, Id id, Id from)
1727 Pool *pool = solv->pool;
1729 const unsigned char *md5;
1731 chk = solv_chksum_create(REPOKEY_TYPE_MD5);
1732 if (type == SOLVER_ALTERNATIVE_TYPE_RECOMMENDS)
1734 s = testcase_solvid2str(pool, from);
1735 solv_chksum_add(chk, s, strlen(s) + 1);
1736 s = testcase_dep2str(pool, id);
1737 solv_chksum_add(chk, s, strlen(s) + 1);
1739 else if (type == SOLVER_ALTERNATIVE_TYPE_RULE)
1741 s = testcase_ruleid(solv, id);
1742 solv_chksum_add(chk, s, strlen(s) + 1);
1744 md5 = solv_chksum_get(chk, &md5l);
1745 s = pool_bin2hex(pool, md5, 4);
1746 chk = solv_chksum_free(chk, 0);
1750 static struct class2str {
1754 { SOLVER_TRANSACTION_ERASE, "erase" },
1755 { SOLVER_TRANSACTION_INSTALL, "install" },
1756 { SOLVER_TRANSACTION_REINSTALLED, "reinstall" },
1757 { SOLVER_TRANSACTION_DOWNGRADED, "downgrade" },
1758 { SOLVER_TRANSACTION_CHANGED, "change" },
1759 { SOLVER_TRANSACTION_UPGRADED, "upgrade" },
1760 { SOLVER_TRANSACTION_OBSOLETED, "obsolete" },
1761 { SOLVER_TRANSACTION_MULTIINSTALL, "multiinstall" },
1762 { SOLVER_TRANSACTION_MULTIREINSTALL, "multireinstall" },
1766 static struct reason2str {
1770 { SOLVER_REASON_UNRELATED, "unrelated" },
1771 { SOLVER_REASON_UNIT_RULE, "unit" },
1772 { SOLVER_REASON_KEEP_INSTALLED, "keep" },
1773 { SOLVER_REASON_RESOLVE_JOB, "job" },
1774 { SOLVER_REASON_UPDATE_INSTALLED, "update" },
1775 { SOLVER_REASON_CLEANDEPS_ERASE, "cleandeps" },
1776 { SOLVER_REASON_RESOLVE, "resolve" },
1777 { SOLVER_REASON_WEAKDEP, "weakdep" },
1778 { SOLVER_REASON_RESOLVE_ORPHAN, "orphan" },
1780 { SOLVER_REASON_RECOMMENDED, "recommended" },
1781 { SOLVER_REASON_SUPPLEMENTED, "supplemented" },
1786 testcase_reason2str(Id reason)
1789 for (i = 0; reason2str[i].str; i++)
1790 if (reason == reason2str[i].reason)
1791 return reason2str[i].str;
1795 static struct rclass2str {
1799 { SOLVER_RULE_PKG, "pkg" },
1800 { SOLVER_RULE_UPDATE, "update" },
1801 { SOLVER_RULE_FEATURE, "feature" },
1802 { SOLVER_RULE_JOB, "job" },
1803 { SOLVER_RULE_DISTUPGRADE, "distupgrade" },
1804 { SOLVER_RULE_INFARCH, "infarch" },
1805 { SOLVER_RULE_CHOICE, "choice" },
1806 { SOLVER_RULE_LEARNT, "learnt" },
1807 { SOLVER_RULE_BEST, "best" },
1808 { SOLVER_RULE_YUMOBS, "yumobs" },
1809 { SOLVER_RULE_RECOMMENDS, "recommends" },
1814 testcase_rclass2str(Id rclass)
1817 for (i = 0; rclass2str[i].str; i++)
1818 if (rclass == rclass2str[i].rclass)
1819 return rclass2str[i].str;
1824 dump_genid(Pool *pool, Strqueue *sq, Id id, int cnt)
1832 Reldep *rd = GETRELDEP(pool, id);
1833 for (op = oplist; op->flags; op++)
1834 if (rd->flags == op->flags)
1836 cnt = dump_genid(pool, sq, rd->name, cnt);
1837 cnt = dump_genid(pool, sq, rd->evr, cnt);
1838 sprintf(cntbuf, "genid %2d: genid ", cnt++);
1839 s = pool_tmpjoin(pool, cntbuf, "op ", op->flags ? op->opname : "unknown");
1843 sprintf(cntbuf, "genid %2d: genid ", cnt++);
1844 s = pool_tmpjoin(pool, cntbuf, id ? "lit " : "null", id ? pool_id2str(pool, id) : 0);
1846 strqueue_push(sq, s);
1851 testcase_solverresult(Solver *solv, int resultflags)
1853 Pool *pool = solv->pool;
1861 if ((resultflags & TESTCASE_RESULT_TRANSACTION) != 0)
1863 Transaction *trans = solver_create_transaction(solv);
1867 for (i = 0; class2str[i].str; i++)
1870 transaction_classify_pkgs(trans, SOLVER_TRANSACTION_KEEP_PSEUDO, class2str[i].class, 0, 0, &q);
1871 for (j = 0; j < q.count; j++)
1875 if (pool->installed && pool->solvables[p].repo == pool->installed)
1876 op = transaction_obs_pkg(trans, p);
1877 s = pool_tmpjoin(pool, class2str[i].str, " ", testcase_solvid2str(pool, p));
1879 s = pool_tmpjoin(pool, s, " ", testcase_solvid2str(pool, op));
1880 strqueue_push(&sq, s);
1884 transaction_free(trans);
1886 if ((resultflags & TESTCASE_RESULT_PROBLEMS) != 0)
1888 char *probprefix, *solprefix;
1889 int problem, solution, element;
1892 pcnt = solver_problem_count(solv);
1893 for (problem = 1; problem <= pcnt; problem++)
1895 Id rid, from, to, dep;
1896 SolverRuleinfo rinfo;
1897 rid = solver_findproblemrule(solv, problem);
1898 s = testcase_problemid(solv, problem);
1899 probprefix = solv_dupjoin("problem ", s, 0);
1900 rinfo = solver_ruleinfo(solv, rid, &from, &to, &dep);
1901 s = pool_tmpjoin(pool, probprefix, " info ", solver_problemruleinfo2str(solv, rinfo, from, to, dep));
1902 strqueue_push(&sq, s);
1903 scnt = solver_solution_count(solv, problem);
1904 for (solution = 1; solution <= scnt; solution++)
1906 s = testcase_solutionid(solv, problem, solution);
1907 solprefix = solv_dupjoin(probprefix, " solution ", s);
1909 while ((element = solver_next_solutionelement(solv, problem, solution, element, &p, &op)) != 0)
1911 if (p == SOLVER_SOLUTION_JOB)
1912 s = pool_tmpjoin(pool, solprefix, " deljob ", testcase_job2str(pool, solv->job.elements[op - 1], solv->job.elements[op]));
1913 else if (p > 0 && op == 0)
1914 s = pool_tmpjoin(pool, solprefix, " erase ", testcase_solvid2str(pool, p));
1915 else if (p > 0 && op > 0)
1917 s = pool_tmpjoin(pool, solprefix, " replace ", testcase_solvid2str(pool, p));
1918 s = pool_tmpappend(pool, s, " ", testcase_solvid2str(pool, op));
1920 else if (p < 0 && op > 0)
1921 s = pool_tmpjoin(pool, solprefix, " allow ", testcase_solvid2str(pool, op));
1923 s = pool_tmpjoin(pool, solprefix, " unknown", 0);
1924 strqueue_push(&sq, s);
1926 solv_free(solprefix);
1928 solv_free(probprefix);
1932 if ((resultflags & TESTCASE_RESULT_ORPHANED) != 0)
1937 solver_get_orphaned(solv, &q);
1938 for (i = 0; i < q.count; i++)
1940 s = pool_tmpjoin(pool, "orphaned ", testcase_solvid2str(pool, q.elements[i]), 0);
1941 strqueue_push(&sq, s);
1946 if ((resultflags & TESTCASE_RESULT_RECOMMENDED) != 0)
1952 solver_get_recommendations(solv, &qr, &qs, 0);
1953 for (i = 0; i < qr.count; i++)
1955 s = pool_tmpjoin(pool, "recommended ", testcase_solvid2str(pool, qr.elements[i]), 0);
1956 strqueue_push(&sq, s);
1958 for (i = 0; i < qs.count; i++)
1960 s = pool_tmpjoin(pool, "suggested ", testcase_solvid2str(pool, qs.elements[i]), 0);
1961 strqueue_push(&sq, s);
1967 if ((resultflags & TESTCASE_RESULT_UNNEEDED) != 0)
1973 solver_get_unneeded(solv, &q, 0);
1974 solver_get_unneeded(solv, &qf, 1);
1975 for (i = j = 0; i < q.count; i++)
1977 /* we rely on qf containing a subset of q in the same order */
1978 if (j < qf.count && q.elements[i] == qf.elements[j])
1980 s = pool_tmpjoin(pool, "unneeded_filtered ", testcase_solvid2str(pool, q.elements[i]), 0);
1984 s = pool_tmpjoin(pool, "unneeded ", testcase_solvid2str(pool, q.elements[i]), 0);
1985 strqueue_push(&sq, s);
1990 if ((resultflags & TESTCASE_RESULT_ALTERNATIVES) != 0)
1998 cnt = solver_alternatives_count(solv);
1999 for (alternative = 1; alternative <= cnt; alternative++)
2001 Id id, from, chosen;
2003 int type = solver_get_alternative(solv, alternative, &id, &from, &chosen, &q, 0);
2004 altprefix = solv_dupjoin("alternative ", testcase_alternativeid(solv, type, id, from), " ");
2006 if (type == SOLVER_ALTERNATIVE_TYPE_RECOMMENDS)
2008 char *s = pool_tmpjoin(pool, altprefix, num, testcase_solvid2str(pool, from));
2009 s = pool_tmpappend(pool, s, " recommends ", testcase_dep2str(pool, id));
2010 strqueue_push(&sq, s);
2012 else if (type == SOLVER_ALTERNATIVE_TYPE_RULE)
2014 /* map choice rules back to pkg rules */
2015 if (solver_ruleclass(solv, id) == SOLVER_RULE_CHOICE)
2016 id = solver_rule2pkgrule(solv, id);
2017 if (solver_ruleclass(solv, id) == SOLVER_RULE_RECOMMENDS)
2018 id = solver_rule2pkgrule(solv, id);
2019 solver_allruleinfos(solv, id, &rq);
2020 for (i = 0; i < rq.count; i += 4)
2022 int rtype = rq.elements[i];
2023 if ((rtype & SOLVER_RULE_TYPEMASK) == SOLVER_RULE_JOB)
2025 const char *js = testcase_job2str(pool, rq.elements[i + 2], rq.elements[i + 3]);
2026 char *s = pool_tmpjoin(pool, altprefix, num, " job ");
2027 s = pool_tmpappend(pool, s, js, 0);
2028 strqueue_push(&sq, s);
2030 else if (rtype == SOLVER_RULE_PKG_REQUIRES)
2032 char *s = pool_tmpjoin(pool, altprefix, num, testcase_solvid2str(pool, rq.elements[i + 1]));
2033 s = pool_tmpappend(pool, s, " requires ", testcase_dep2str(pool, rq.elements[i + 3]));
2034 strqueue_push(&sq, s);
2038 for (i = 0; i < q.count; i++)
2040 Id p = q.elements[i];
2042 num[0] = '0' + (i + 1) / 10;
2043 num[1] = '0' + (i + 1) % 10;
2045 s = pool_tmpjoin(pool, altprefix, num, "+ ");
2047 s = pool_tmpjoin(pool, altprefix, num, "- ");
2049 s = pool_tmpjoin(pool, altprefix, num, " ");
2050 s = pool_tmpappend(pool, s, testcase_solvid2str(pool, p < 0 ? -p : p), 0);
2051 strqueue_push(&sq, s);
2053 solv_free(altprefix);
2058 if ((resultflags & TESTCASE_RESULT_RULES) != 0)
2060 /* dump all rules */
2062 SolverRuleinfo rclass;
2067 for (rid = 1; (rclass = solver_ruleclass(solv, rid)) != SOLVER_RULE_UNKNOWN; rid++)
2069 char *prefix = solv_dupjoin("rule ", testcase_rclass2str(rclass), " ");
2070 prefix = solv_dupappend(prefix, testcase_ruleid(solv, rid), 0);
2071 solver_ruleliterals(solv, rid, &q);
2072 if (rclass == SOLVER_RULE_FEATURE && q.count == 1 && q.elements[0] == -SYSTEMSOLVABLE)
2074 for (i = 0; i < q.count; i++)
2076 Id p = q.elements[i];
2079 s = pool_tmpjoin(pool, prefix, " -", testcase_solvid2str(pool, -p));
2081 s = pool_tmpjoin(pool, prefix, " ", testcase_solvid2str(pool, p));
2082 strqueue_push(&sq, s);
2088 if ((resultflags & TESTCASE_RESULT_GENID) != 0)
2090 for (i = 0 ; i < solv->job.count; i += 2)
2093 if (solv->job.elements[i] != (SOLVER_NOOP | SOLVER_SOLVABLE_PROVIDES))
2095 id = solv->job.elements[i + 1];
2096 s = testcase_dep2str(pool, id);
2097 strqueue_push(&sq, pool_tmpjoin(pool, "genid dep ", s, 0));
2098 if ((id2 = testcase_str2dep(pool, s)) != id)
2100 s = pool_tmpjoin(pool, "genid roundtrip error: ", testcase_dep2str(pool, id2), 0);
2101 strqueue_push(&sq, s);
2103 dump_genid(pool, &sq, id, 1);
2106 if ((resultflags & TESTCASE_RESULT_REASON) != 0)
2110 FOR_POOL_SOLVABLES(p)
2113 int reason = solver_describe_decision(solv, p, &info);
2114 if (reason == SOLVER_REASON_UNRELATED)
2116 if (reason == SOLVER_REASON_WEAKDEP)
2118 solver_describe_weakdep_decision(solv, p, &whyq);
2121 for (i = 0; i < whyq.count; i += 3)
2123 reason = whyq.elements[i];
2124 p2 = whyq.elements[i + 1];
2125 id = whyq.elements[i + 2];
2126 s = pool_tmpjoin(pool, "reason ", testcase_solvid2str(pool, p), 0);
2127 s = pool_tmpappend(pool, s, " ", testcase_reason2str(reason));
2128 s = pool_tmpappend(pool, s, " ", testcase_dep2str(pool, id));
2130 s = pool_tmpappend(pool, s, " ", testcase_solvid2str(pool, p2));
2131 strqueue_push(&sq, s);
2136 s = pool_tmpjoin(pool, "reason ", testcase_solvid2str(pool, p), 0);
2137 s = pool_tmpappend(pool, s, " ", testcase_reason2str(reason));
2139 s = pool_tmpappend(pool, s, " ", testcase_ruleid(solv, info));
2140 strqueue_push(&sq, s);
2144 if ((resultflags & TESTCASE_RESULT_CLEANDEPS) != 0)
2149 solver_get_cleandeps(solv, &q);
2150 for (i = 0; i < q.count; i++)
2152 s = pool_tmpjoin(pool, "cleandeps ", testcase_solvid2str(pool, q.elements[i]), 0);
2153 strqueue_push(&sq, s);
2157 if ((resultflags & TESTCASE_RESULT_JOBS) != 0)
2159 for (i = 0; i < solv->job.count; i += 2)
2161 s = (char *)testcase_job2str(pool, solv->job.elements[i], solv->job.elements[i + 1]);
2162 s = pool_tmpjoin(pool, "job ", s, 0);
2163 strqueue_push(&sq, s);
2167 result = strqueue_join(&sq);
2174 testcase_write_mangled(Solver *solv, const char *dir, int resultflags, const char *testcasename, const char *resultname)
2176 Pool *pool = solv->pool;
2183 char *cmd, *out, *result;
2187 testcasename = "testcase.t";
2189 resultname = "solver.result";
2191 if (mkdir(dir, 0777) && errno != EEXIST)
2192 return pool_error(solv->pool, 0, "testcase_write: could not create directory '%s'", dir);
2194 FOR_REPOS(repoid, repo)
2196 const char *name = testcase_repoid2str(pool, repoid);
2198 if (repo->subpriority)
2199 sprintf(priobuf, "%d.%d", repo->priority, repo->subpriority);
2201 sprintf(priobuf, "%d", repo->priority);
2202 out = pool_tmpjoin(pool, name, ".repo", ".gz");
2203 for (i = 0; out[i]; i++)
2206 cmd = pool_tmpjoin(pool, "repo ", name, " ");
2207 cmd = pool_tmpappend(pool, cmd, priobuf, " ");
2208 cmd = pool_tmpappend(pool, cmd, "testtags ", out);
2209 strqueue_push(&sq, cmd);
2210 out = pool_tmpjoin(pool, dir, "/", out);
2211 if (!(fp = solv_xfopen(out, "w")))
2213 pool_error(solv->pool, 0, "testcase_write: could not open '%s' for writing", out);
2217 testcase_write_testtags(repo, fp);
2220 pool_error(solv->pool, 0, "testcase_write: write error");
2225 /* hmm, this is not optimal... we currently search for the lowest score */
2227 arch = pool->solvables[SYSTEMSOLVABLE].arch;
2228 for (i = 0; i < pool->lastarch; i++)
2230 if (pool->id2arch[i] == 1 && !lowscore)
2232 if (pool->id2arch[i] > 0x10000 && (!lowscore || pool->id2arch[i] < lowscore))
2235 lowscore = pool->id2arch[i];
2238 cmd = pool_tmpjoin(pool, "system ", pool->lastarch ? pool_id2str(pool, arch) : "unset", 0);
2239 for (i = 0; disttype2str[i].str != 0; i++)
2240 if (pool->disttype == disttype2str[i].type)
2242 pool_tmpappend(pool, cmd, " ", disttype2str[i].str ? disttype2str[i].str : "unknown");
2243 if (pool->installed)
2244 cmd = pool_tmpappend(pool, cmd, " ", testcase_repoid2str(pool, pool->installed->repoid));
2245 strqueue_push(&sq, cmd);
2246 s = testcase_getpoolflags(solv->pool);
2249 cmd = pool_tmpjoin(pool, "poolflags ", s, 0);
2250 strqueue_push(&sq, cmd);
2253 if (pool->vendorclasses)
2256 for (i = 0; pool->vendorclasses[i]; i++)
2258 cmd = pool_tmpappend(pool, cmd ? cmd : "vendorclass", " ", pool->vendorclasses[i]);
2259 if (!pool->vendorclasses[i + 1])
2261 strqueue_push(&sq, cmd);
2268 /* dump disabled packages (must come before the namespace/job lines) */
2269 if (pool->considered)
2272 FOR_POOL_SOLVABLES(p)
2273 if (!MAPTST(pool->considered, p))
2275 cmd = pool_tmpjoin(pool, "disable pkg ", testcase_solvid2str(pool, p), 0);
2276 strqueue_push(&sq, cmd);
2280 s = testcase_getsolverflags(solv);
2283 cmd = pool_tmpjoin(pool, "solverflags ", s, 0);
2284 strqueue_push(&sq, cmd);
2287 /* now dump all the ns callback values we know */
2288 if (pool->nscallback)
2292 for (rid = 1; rid < pool->nrels; rid++)
2294 Reldep *rd = pool->rels + rid;
2295 if (rd->flags != REL_NAMESPACE || rd->name == NAMESPACE_OTHERPROVIDERS)
2297 /* evaluate all namespace ids, skip empty results */
2298 d = pool_whatprovides(pool, MAKERELDEP(rid));
2299 if (!d || !pool->whatprovidesdata[d])
2301 cmd = pool_tmpjoin(pool, "namespace ", pool_id2str(pool, rd->name), "(");
2302 cmd = pool_tmpappend(pool, cmd, pool_id2str(pool, rd->evr), ")");
2303 for (; pool->whatprovidesdata[d]; d++)
2304 cmd = pool_tmpappend(pool, cmd, " ", testcase_solvid2str(pool, pool->whatprovidesdata[d]));
2305 strqueue_push(&sq, cmd);
2309 for (i = 0; i < solv->job.count; i += 2)
2311 cmd = (char *)testcase_job2str(pool, solv->job.elements[i], solv->job.elements[i + 1]);
2312 cmd = pool_tmpjoin(pool, "job ", cmd, 0);
2313 strqueue_push(&sq, cmd);
2316 if ((resultflags & ~TESTCASE_RESULT_REUSE_SOLVER) != 0)
2319 for (i = 0; resultflags2str[i].str; i++)
2320 if ((resultflags & resultflags2str[i].flag) != 0)
2321 cmd = pool_tmpappend(pool, cmd, cmd ? "," : 0, resultflags2str[i].str);
2322 cmd = pool_tmpjoin(pool, "result ", cmd ? cmd : "?", 0);
2323 cmd = pool_tmpappend(pool, cmd, " ", resultname);
2324 strqueue_push(&sq, cmd);
2325 result = testcase_solverresult(solv, resultflags);
2326 if (!strcmp(resultname, "<inline>"))
2329 strqueue_init(&rsq);
2330 strqueue_split(&rsq, result);
2331 for (i = 0; i < rsq.nstr; i++)
2333 cmd = pool_tmpjoin(pool, "#>", rsq.str[i], 0);
2334 strqueue_push(&sq, cmd);
2336 strqueue_free(&rsq);
2340 out = pool_tmpjoin(pool, dir, "/", resultname);
2341 if (!(fp = fopen(out, "w")))
2343 pool_error(solv->pool, 0, "testcase_write: could not open '%s' for writing", out);
2348 if (result && *result && fwrite(result, strlen(result), 1, fp) != 1)
2350 pool_error(solv->pool, 0, "testcase_write: write error");
2358 pool_error(solv->pool, 0, "testcase_write: write error");
2367 result = strqueue_join(&sq);
2369 out = pool_tmpjoin(pool, dir, "/", testcasename);
2370 if (!(fp = fopen(out, "w")))
2372 pool_error(solv->pool, 0, "testcase_write: could not open '%s' for writing", out);
2376 if (*result && fwrite(result, strlen(result), 1, fp) != 1)
2378 pool_error(solv->pool, 0, "testcase_write: write error");
2385 pool_error(solv->pool, 0, "testcase_write: write error");
2394 testcase_write(Solver *solv, const char *dir, int resultflags, const char *testcasename, const char *resultname)
2396 Pool *pool = solv->pool;
2399 const char **orignames;
2401 /* mangle repo names so that there are no conflicts */
2402 orignames = solv_calloc(pool->nrepos, sizeof(char *));
2403 for (repoid = 1; repoid < pool->nrepos; repoid++)
2405 Repo *repo = pool_id2repo(pool, repoid);
2406 char *buf = solv_malloc((repo->name ? strlen(repo->name) : 0) + 40);
2408 orignames[repoid] = repo->name;
2409 if (!repo->name || !repo->name[0])
2410 sprintf(buf, "#%d", repoid);
2412 strcpy(buf, repo->name);
2413 for (i = 0; buf[i]; i++)
2414 if (buf[i] == ' ' || buf[i] == '\t' || buf[i] == '/')
2416 mp = buf + strlen(buf);
2419 for (i = 1; i < repoid; i++)
2420 if (!strcmp(buf, pool_id2repo(pool, i)->name))
2424 sprintf(mp, "_%d", mangle++);
2428 r = testcase_write_mangled(solv, dir, resultflags, testcasename, resultname);
2429 for (repoid = 1; repoid < pool->nrepos; repoid++)
2431 Repo *repo = pool_id2repo(pool, repoid);
2432 solv_free((void *)repo->name);
2433 repo->name = orignames[repoid];
2435 solv_free(orignames);
2440 read_inline_file(FILE *fp, char **bufp, char **bufpp, int *buflp)
2442 char *result = solv_malloc(1024);
2449 if (rp - result + 256 >= resultl)
2451 resultl = rp - result;
2452 result = solv_realloc(result, resultl + 1024);
2453 rp = result + resultl;
2456 if (!fgets(rp, resultl - (rp - result), fp))
2459 if (rl && (rp == result || rp[-1] == '\n'))
2461 if (rl > 1 && rp[0] == '#' && rp[1] == '>')
2463 memmove(rp, rp + 2, rl - 2);
2468 while (rl + 16 > *buflp)
2470 *bufp = solv_realloc(*bufp, *buflp + 512);
2473 memmove(*bufp, rp, rl);
2474 if ((*bufp)[rl - 1] == '\n')
2480 (*bufpp) = *bufp + rl;
2497 char *result = solv_malloc(1024);
2504 if (rp - result + 256 >= resultl)
2506 resultl = rp - result;
2507 result = solv_realloc(result, resultl + 1024);
2508 rp = result + resultl;
2511 rl = fread(rp, 1, resultl - (rp - result), fp);
2523 str2resultflags(Pool *pool, char *s) /* modifies the string! */
2525 int i, resultflags = 0;
2528 char *se = strchr(s, ',');
2531 for (i = 0; resultflags2str[i].str; i++)
2532 if (!strcmp(s, resultflags2str[i].str))
2534 resultflags |= resultflags2str[i].flag;
2537 if (!resultflags2str[i].str)
2538 pool_error(pool, 0, "result: unknown flag '%s'", s);
2545 testcase_read(Pool *pool, FILE *fp, const char *testcase, Queue *job, char **resultp, int *resultflagsp)
2550 char *testcasedir, *s;
2556 int poolflagsreset = 0;
2557 int missing_features = 0;
2566 if (!fp && !(fp = fopen(testcase, "r")))
2568 pool_error(pool, 0, "testcase_read: could not open '%s'", testcase);
2571 testcasedir = solv_strdup(testcase);
2572 if ((s = strrchr(testcasedir, '/')) != 0)
2577 buf = solv_malloc(bufl);
2580 queue_init(&autoinstq);
2583 if (bufp - buf + 16 > bufl)
2586 buf = solv_realloc(buf, bufl + 512);
2590 if (!fgets(bufp, bufl - (bufp - buf), fp))
2594 if (!l || buf[l - 1] != '\n')
2601 while (*s && (*s == ' ' || *s == '\t'))
2603 if (!*s || *s == '#')
2606 /* split it in pieces */
2609 while (*s == ' ' || *s == '\t')
2613 pieces = solv_extend(pieces, npieces, 1, sizeof(*pieces), 7);
2614 pieces[npieces++] = s;
2615 while (*s && *s != ' ' && *s != '\t')
2620 pieces = solv_extend(pieces, npieces, 1, sizeof(*pieces), 7);
2621 pieces[npieces] = 0;
2622 if (!strcmp(pieces[0], "repo") && npieces >= 4)
2624 Repo *repo = repo_create(pool, pieces[1]);
2630 if (!poolflagsreset)
2633 testcase_resetpoolflags(pool); /* hmm */
2635 if (sscanf(pieces[2], "%d.%d", &prio, &subprio) != 2)
2638 prio = atoi(pieces[2]);
2640 repo->priority = prio;
2641 repo->subpriority = subprio;
2642 if (strcmp(pieces[3], "empty") != 0)
2644 const char *repotype = pool_tmpjoin(pool, pieces[3], 0, 0); /* gets overwritten in <inline> case */
2645 if (!strcmp(pieces[4], "<inline>"))
2647 char *idata = read_inline_file(fp, &buf, &bufp, &bufl);
2649 rfp = solv_xfopen_buf(rdata, &idata, 0, "rf");
2653 rdata = pool_tmpjoin(pool, testcasedir, pieces[4], 0);
2654 rfp = solv_xfopen(rdata, "r");
2658 pool_error(pool, 0, "testcase_read: could not open '%s'", rdata);
2660 else if (!strcmp(repotype, "testtags"))
2662 testcase_add_testtags(repo, rfp, 0);
2665 else if (!strcmp(repotype, "solv"))
2667 repo_add_solv(repo, rfp, 0);
2670 #if ENABLE_TESTCASE_HELIXREPO
2671 else if (!strcmp(repotype, "helix"))
2673 repo_add_helix(repo, rfp, 0);
2680 pool_error(pool, 0, "testcase_read: unknown repo type for repo '%s'", repo->name);
2684 else if (!strcmp(pieces[0], "system") && npieces >= 3)
2688 /* must set the disttype before the arch */
2690 if (strcmp(pieces[2], "*") != 0)
2692 char *dp = pieces[2];
2695 char *dpe = strchr(dp, ',');
2698 for (i = 0; disttype2str[i].str != 0; i++)
2699 if (!strcmp(disttype2str[i].str, dp))
2703 if (disttype2str[i].str)
2705 #ifdef MULTI_SEMANTICS
2706 if (pool->disttype != disttype2str[i].type)
2707 pool_setdisttype(pool, disttype2str[i].type);
2709 if (pool->disttype == disttype2str[i].type)
2716 pool_error(pool, 0, "testcase_read: system: could not change disttype to '%s'", pieces[2]);
2717 missing_features = 1;
2720 if (strcmp(pieces[1], "unset") == 0)
2721 pool_setarch(pool, 0);
2722 else if (pieces[1][0] == ':')
2723 pool_setarchpolicy(pool, pieces[1] + 1);
2725 pool_setarch(pool, pieces[1]);
2728 Repo *repo = testcase_str2repo(pool, pieces[3]);
2730 pool_error(pool, 0, "testcase_read: system: unknown repo '%s'", pieces[3]);
2732 pool_set_installed(pool, repo);
2735 else if (!strcmp(pieces[0], "job") && npieces > 1)
2741 pool_addfileprovides(pool);
2742 pool_createwhatprovides(pool);
2745 if (npieces >= 3 && !strcmp(pieces[2], "selection"))
2747 addselectionjob(pool, pieces + 1, npieces - 1, job, 0, 0);
2750 if (npieces >= 4 && !strcmp(pieces[2], "selection_matchdeps"))
2752 pieces[2] = pieces[1];
2753 addselectionjob(pool, pieces + 2, npieces - 2, job, SELECTIONJOB_MATCHDEPS, pool_str2id(pool, pieces[3], 1));
2756 if (npieces >= 4 && !strcmp(pieces[2], "selection_matchdepid"))
2758 pieces[2] = pieces[1];
2759 addselectionjob(pool, pieces + 2, npieces - 2, job, SELECTIONJOB_MATCHDEPID, pool_str2id(pool, pieces[3], 1));
2762 if (npieces >= 4 && !strcmp(pieces[2], "selection_matchsolvable"))
2764 pieces[2] = pieces[1];
2765 addselectionjob(pool, pieces + 2, npieces - 2, job, SELECTIONJOB_MATCHSOLVABLE, pool_str2id(pool, pieces[3], 1));
2769 for (sp = pieces[1]; sp < pieces[npieces - 1]; sp++)
2772 how = testcase_str2job(pool, pieces[1], &what);
2773 if (how >= 0 && job)
2774 queue_push2(job, how, what);
2776 else if (!strcmp(pieces[0], "vendorclass") && npieces > 1)
2778 pool_addvendorclass(pool, (const char **)(pieces + 1));
2780 else if (!strcmp(pieces[0], "namespace") && npieces > 1)
2782 int i = strlen(pieces[1]);
2783 s = strchr(pieces[1], '(');
2784 if (!s || pieces[1][i - 1] != ')')
2786 pool_error(pool, 0, "testcase_read: bad namespace '%s'", pieces[1]);
2794 pieces[1][i - 1] = 0;
2795 name = pool_str2id(pool, pieces[1], 1);
2796 evr = pool_str2id(pool, s + 1, 1);
2798 pieces[1][i - 1] = ')';
2799 id = pool_rel2id(pool, name, evr, REL_NAMESPACE, 1);
2800 for (i = 2; i < npieces; i++)
2801 queue_push(&q, testcase_str2solvid(pool, pieces[i]));
2802 /* now do the callback */
2805 pool_addfileprovides(pool);
2806 pool_createwhatprovides(pool);
2809 pool->whatprovides_rel[GETRELID(id)] = pool_queuetowhatprovides(pool, &q);
2813 else if (!strcmp(pieces[0], "poolflags"))
2816 if (!poolflagsreset)
2819 testcase_resetpoolflags(pool); /* hmm */
2821 for (i = 1; i < npieces; i++)
2822 testcase_setpoolflags(pool, pieces[i]);
2824 else if (!strcmp(pieces[0], "solverflags") && npieces > 1)
2829 solv = solver_create(pool);
2830 testcase_resetsolverflags(solv);
2832 for (i = 1; i < npieces; i++)
2833 testcase_setsolverflags(solv, pieces[i]);
2835 else if (!strcmp(pieces[0], "result") && npieces > 1)
2838 int resultflags = str2resultflags(pool, pieces[1]);
2842 rdata = pool_tmpjoin(pool, testcasedir, pieces[2], 0);
2843 if (!strcmp(pieces[2], "<inline>"))
2844 result = read_inline_file(fp, &buf, &bufp, &bufl);
2847 FILE *rfp = fopen(rdata, "r");
2849 pool_error(pool, 0, "testcase_read: could not open '%s'", rdata);
2852 result = read_file(rfp);
2862 *resultflagsp = resultflags;
2864 else if (!strcmp(pieces[0], "nextjob"))
2866 if (npieces == 2 && resultflagsp && !strcmp(pieces[1], "reusesolver"))
2867 *resultflagsp |= TESTCASE_RESULT_REUSE_SOLVER;
2870 else if (!strcmp(pieces[0], "disable") && npieces == 3)
2872 Id p, pp, jobsel, what = 0;
2874 pool_createwhatprovides(pool);
2876 if (!pool->considered)
2878 pool->considered = solv_calloc(1, sizeof(Map));
2879 map_init(pool->considered, pool->nsolvables);
2880 map_setall(pool->considered);
2882 jobsel = testcase_str2jobsel(pool, "disable", pieces + 1, npieces - 1, &what);
2885 if (jobsel == SOLVER_SOLVABLE_ALL)
2886 map_empty(pool->considered);
2887 else if (jobsel == SOLVER_SOLVABLE_REPO)
2889 Repo *repo = pool_id2repo(pool, what);
2891 FOR_REPO_SOLVABLES(repo, p, s)
2892 MAPCLR(pool->considered, p);
2894 FOR_JOB_SELECT(p, pp, jobsel, what)
2895 MAPCLR(pool->considered, p);
2897 else if (!strcmp(pieces[0], "feature"))
2900 for (i = 1; i < npieces; i++)
2902 for (j = 0; features[j]; j++)
2903 if (!strcmp(pieces[i], features[j]))
2907 pool_error(pool, 0, "testcase_read: missing feature '%s'", pieces[i]);
2911 if (missing_features)
2914 else if (!strcmp(pieces[0], "genid") && npieces > 1)
2921 for (sp = pieces[2]; sp < pieces[npieces - 1]; sp++)
2925 genid = solv_extend(genid, ngenid, 1, sizeof(*genid), 7);
2926 if (!strcmp(pieces[1], "op") && npieces > 2)
2929 for (op = oplist; op->flags; op++)
2930 if (!strncmp(pieces[2], op->opname, strlen(op->opname)))
2934 pool_error(pool, 0, "testcase_read: genid: unknown op '%s'", pieces[2]);
2939 pool_error(pool, 0, "testcase_read: genid: out of stack");
2943 id = pool_rel2id(pool, genid[ngenid] , genid[ngenid + 1], op->flags, 1);
2945 else if (!strcmp(pieces[1], "lit"))
2946 id = pool_str2id(pool, npieces > 2 ? pieces[2] : "", 1);
2947 else if (!strcmp(pieces[1], "null"))
2949 else if (!strcmp(pieces[1], "dep"))
2950 id = testcase_str2dep(pool, pieces[2]);
2953 pool_error(pool, 0, "testcase_read: genid: unknown command '%s'", pieces[1]);
2956 genid[ngenid++] = id;
2958 else if (!strcmp(pieces[0], "autoinst") && npieces > 2)
2960 if (strcmp(pieces[1], "name"))
2962 pool_error(pool, 0, "testcase_read: autoinst: illegal mode");
2965 queue_push(&autoinstq, pool_str2id(pool, pieces[2], 1));
2967 else if (!strcmp(pieces[0], "evrcmp") && npieces == 3)
2969 Id evr1 = pool_str2id(pool, pieces[1], 1);
2970 Id evr2 = pool_str2id(pool, pieces[2], 1);
2971 int r = pool_evrcmp(pool, evr1, evr2, EVRCMP_COMPARE);
2972 r = r < 0 ? REL_LT : r > 0 ? REL_GT : REL_EQ;
2973 queue_push2(job, SOLVER_NOOP | SOLVER_SOLVABLE_PROVIDES, pool_rel2id(pool, evr1, evr2, r, 1));
2977 pool_error(pool, 0, "testcase_read: cannot parse command '%s'", pieces[0]);
2980 while (job && ngenid > 0)
2981 queue_push2(job, SOLVER_NOOP | SOLVER_SOLVABLE_PROVIDES, genid[--ngenid]);
2982 if (autoinstq.count)
2983 pool_add_userinstalled_jobs(pool, &autoinstq, job, GET_USERINSTALLED_NAMES | GET_USERINSTALLED_INVERTED);
2984 queue_free(&autoinstq);
2985 genid = solv_free(genid);
2986 buf = solv_free(buf);
2987 pieces = solv_free(pieces);
2988 solv_free(testcasedir);
2991 pool_addfileprovides(pool);
2992 pool_createwhatprovides(pool);
2996 solv = solver_create(pool);
2997 testcase_resetsolverflags(solv);
3001 if (missing_features)
3006 *resultflagsp = 77; /* hack for testsolv */
3012 testcase_resultdiff(const char *result1, const char *result2)
3014 Strqueue sq1, sq2, osq;
3016 strqueue_init(&sq1);
3017 strqueue_init(&sq2);
3018 strqueue_init(&osq);
3019 strqueue_split(&sq1, result1);
3020 strqueue_split(&sq2, result2);
3021 strqueue_sort(&sq1);
3022 strqueue_sort(&sq2);
3023 strqueue_diff(&sq1, &sq2, &osq);
3024 r = osq.nstr ? strqueue_join(&osq) : 0;
3025 strqueue_free(&sq1);
3026 strqueue_free(&sq2);
3027 strqueue_free(&osq);