2 * Copyright (c) 2012, Novell Inc.
4 * This program is licensed under the BSD license, read LICENSE.BSD
5 * for further information
19 #include "poolvendor.h"
21 #include "repo_solv.h"
23 #include "solverdebug.h"
26 #include "selection.h"
27 #include "solv_xfopen.h"
30 #include "tools_util.h"
32 static struct job2str {
36 { SOLVER_NOOP, "noop" },
37 { SOLVER_INSTALL, "install" },
38 { SOLVER_ERASE, "erase" },
39 { SOLVER_UPDATE, "update" },
40 { SOLVER_WEAKENDEPS, "weakendeps" },
41 { SOLVER_MULTIVERSION, "multiversion" },
42 { SOLVER_MULTIVERSION, "noobsoletes" }, /* old name */
43 { SOLVER_LOCK, "lock" },
44 { SOLVER_DISTUPGRADE, "distupgrade" },
45 { SOLVER_VERIFY, "verify" },
46 { SOLVER_DROP_ORPHANED, "droporphaned" },
47 { SOLVER_USERINSTALLED, "userinstalled" },
51 static struct jobflags2str {
55 { SOLVER_WEAK, "weak" },
56 { SOLVER_ESSENTIAL, "essential" },
57 { SOLVER_CLEANDEPS, "cleandeps" },
58 { SOLVER_ORUPDATE, "orupdate" },
59 { SOLVER_FORCEBEST, "forcebest" },
60 { SOLVER_TARGETED, "targeted" },
61 { SOLVER_NOTBYUSER, "notbyuser" },
62 { SOLVER_SETEV, "setev" },
63 { SOLVER_SETEVR, "setevr" },
64 { SOLVER_SETARCH, "setarch" },
65 { SOLVER_SETVENDOR, "setvendor" },
66 { SOLVER_SETREPO, "setrepo" },
67 { SOLVER_NOAUTOSET, "noautoset" },
71 static struct resultflags2str {
74 } resultflags2str[] = {
75 { TESTCASE_RESULT_TRANSACTION, "transaction" },
76 { TESTCASE_RESULT_PROBLEMS, "problems" },
77 { TESTCASE_RESULT_ORPHANED, "orphaned" },
78 { TESTCASE_RESULT_RECOMMENDED, "recommended" },
79 { TESTCASE_RESULT_UNNEEDED, "unneeded" },
80 { TESTCASE_RESULT_ALTERNATIVES, "alternatives" },
81 { TESTCASE_RESULT_RULES, "rules" },
82 { TESTCASE_RESULT_GENID, "genid" },
86 static struct solverflags2str {
90 } solverflags2str[] = {
91 { SOLVER_FLAG_ALLOW_DOWNGRADE, "allowdowngrade", 0 },
92 { SOLVER_FLAG_ALLOW_NAMECHANGE, "allownamechange", 1 },
93 { SOLVER_FLAG_ALLOW_ARCHCHANGE, "allowarchchange", 0 },
94 { SOLVER_FLAG_ALLOW_VENDORCHANGE, "allowvendorchange", 0 },
95 { SOLVER_FLAG_ALLOW_UNINSTALL, "allowuninstall", 0 },
96 { SOLVER_FLAG_NO_UPDATEPROVIDE, "noupdateprovide", 0 },
97 { SOLVER_FLAG_SPLITPROVIDES, "splitprovides", 0 },
98 { SOLVER_FLAG_IGNORE_RECOMMENDED, "ignorerecommended", 0 },
99 { SOLVER_FLAG_ADD_ALREADY_RECOMMENDED, "addalreadyrecommended", 0 },
100 { SOLVER_FLAG_NO_INFARCHCHECK, "noinfarchcheck", 0 },
101 { SOLVER_FLAG_KEEP_EXPLICIT_OBSOLETES, "keepexplicitobsoletes", 0 },
102 { SOLVER_FLAG_BEST_OBEY_POLICY, "bestobeypolicy", 0 },
103 { SOLVER_FLAG_NO_AUTOTARGET, "noautotarget", 0 },
104 { SOLVER_FLAG_DUP_ALLOW_DOWNGRADE, "dupallowdowngrade", 1 },
105 { SOLVER_FLAG_DUP_ALLOW_ARCHCHANGE, "dupallowarchchange", 1 },
106 { SOLVER_FLAG_DUP_ALLOW_VENDORCHANGE, "dupallowvendorchange", 1 },
107 { SOLVER_FLAG_DUP_ALLOW_NAMECHANGE, "dupallownamechange", 1 },
108 { SOLVER_FLAG_KEEP_ORPHANS, "keeporphans", 0 },
109 { SOLVER_FLAG_BREAK_ORPHANS, "breakorphans", 0 },
110 { SOLVER_FLAG_FOCUS_INSTALLED, "focusinstalled", 0 },
111 { SOLVER_FLAG_YUM_OBSOLETES, "yumobsoletes", 0 },
112 { SOLVER_FLAG_NEED_UPDATEPROVIDE, "needupdateprovide", 0 },
116 static struct poolflags2str {
120 } poolflags2str[] = {
121 { POOL_FLAG_PROMOTEEPOCH, "promoteepoch", 0 },
122 { POOL_FLAG_FORBIDSELFCONFLICTS, "forbidselfconflicts", 0 },
123 { POOL_FLAG_OBSOLETEUSESPROVIDES, "obsoleteusesprovides", 0 },
124 { POOL_FLAG_IMPLICITOBSOLETEUSESPROVIDES, "implicitobsoleteusesprovides", 0 },
125 { POOL_FLAG_OBSOLETEUSESCOLORS, "obsoleteusescolors", 0 },
126 { POOL_FLAG_IMPLICITOBSOLETEUSESCOLORS, "implicitobsoleteusescolors", 0 },
127 { POOL_FLAG_NOINSTALLEDOBSOLETES, "noinstalledobsoletes", 0 },
128 { POOL_FLAG_HAVEDISTEPOCH, "havedistepoch", 0 },
129 { POOL_FLAG_NOOBSOLETESMULTIVERSION, "noobsoletesmultiversion", 0 },
130 { POOL_FLAG_ADDFILEPROVIDESFILTERED, "addfileprovidesfiltered", 0 },
131 { POOL_FLAG_NOWHATPROVIDESAUX, "nowhatprovidesaux", 0 },
135 static struct disttype2str {
139 { DISTTYPE_RPM, "rpm" },
140 { DISTTYPE_DEB, "deb" },
141 { DISTTYPE_ARCH, "arch" },
142 { DISTTYPE_HAIKU, "haiku" },
146 static struct selflags2str {
150 { SELECTION_NAME, "name" },
151 { SELECTION_PROVIDES, "provides" },
152 { SELECTION_FILELIST, "filelist" },
153 { SELECTION_CANON, "canon" },
154 { SELECTION_DOTARCH, "dotarch" },
155 { SELECTION_REL, "rel" },
156 { SELECTION_INSTALLED_ONLY, "installedonly" },
157 { SELECTION_GLOB, "glob" },
158 { SELECTION_FLAT, "flat" },
159 { SELECTION_NOCASE, "nocase" },
160 { SELECTION_SOURCE_ONLY, "sourceonly" },
161 { SELECTION_WITH_SOURCE, "withsource" },
165 static const char *features[] = {
166 #ifdef ENABLE_LINKED_PACKAGES
169 #ifdef ENABLE_COMPLEX_DEPS
175 typedef struct strqueue {
180 #define STRQUEUE_BLOCK 63
183 strqueue_init(Strqueue *q)
190 strqueue_free(Strqueue *q)
193 for (i = 0; i < q->nstr; i++)
194 solv_free(q->str[i]);
195 q->str = solv_free(q->str);
200 strqueue_push(Strqueue *q, const char *s)
202 q->str = solv_extend(q->str, q->nstr, 1, sizeof(*q->str), STRQUEUE_BLOCK);
203 q->str[q->nstr++] = solv_strdup(s);
207 strqueue_pushjoin(Strqueue *q, const char *s1, const char *s2, const char *s3)
209 q->str = solv_extend(q->str, q->nstr, 1, sizeof(*q->str), STRQUEUE_BLOCK);
210 q->str[q->nstr++] = solv_dupjoin(s1, s2, s3);
214 strqueue_sort_cmp(const void *ap, const void *bp, void *dp)
216 const char *a = *(const char **)ap;
217 const char *b = *(const char **)bp;
218 return strcmp(a ? a : "", b ? b : "");
222 strqueue_sort(Strqueue *q)
225 solv_sort(q->str, q->nstr, sizeof(*q->str), strqueue_sort_cmp, 0);
229 strqueue_sort_u(Strqueue *q)
233 for (i = j = 0; i < q->nstr; i++)
234 if (!j || strqueue_sort_cmp(q->str + i, q->str + j - 1, 0) != 0)
235 q->str[j++] = q->str[i];
240 strqueue_join(Strqueue *q)
244 for (i = 0; i < q->nstr; i++)
246 l += strlen(q->str[i]) + 1;
247 l++; /* trailing \0 */
250 for (i = 0; i < q->nstr; i++)
253 strcpy(rp, q->str[i]);
262 strqueue_split(Strqueue *q, const char *s)
267 while ((p = strchr(s, '\n')) != 0)
269 q->str = solv_extend(q->str, q->nstr, 1, sizeof(*q->str), STRQUEUE_BLOCK);
270 q->str[q->nstr] = solv_malloc(p - s + 1);
272 memcpy(q->str[q->nstr], s, p - s);
273 q->str[q->nstr][p - s] = 0;
282 strqueue_diff(Strqueue *sq1, Strqueue *sq2, Strqueue *osq)
285 while (i < sq1->nstr && j < sq2->nstr)
287 int r = strqueue_sort_cmp(sq1->str + i, sq2->str + j, 0);
291 strqueue_pushjoin(osq, "-", sq1->str[i++], 0);
293 strqueue_pushjoin(osq, "+", sq2->str[j++], 0);
295 while (i < sq1->nstr)
296 strqueue_pushjoin(osq, "-", sq1->str[i++], 0);
297 while (j < sq2->nstr)
298 strqueue_pushjoin(osq, "+", sq2->str[j++], 0);
303 testcase_id2str(Pool *pool, Id id, int isname)
305 const char *s = pool_id2str(pool, id);
308 int bad = 0, paren = 0, parenbad = 0;
314 if (strchr("[(<=>!", *s))
316 if (!strncmp(s, "namespace:", 10))
318 for (ss = s + bad; *ss; ss++)
320 if (*ss == ' ' || *ss == '\\' || *(unsigned char *)ss < 32 || *ss == '(' || *ss == ')')
323 paren = paren == 0 ? 1 : -1;
326 paren = paren == 1 ? 0 : -1;
331 if (isname && ss - s > 4 && !strcmp(ss - 4, ":any"))
333 if (!paren && !(bad - parenbad))
336 /* we need escaping! */
337 s2 = s2p = pool_alloctmpspace(pool, strlen(s) + bad * 2 + 1);
338 if (!strncmp(s, "namespace:", 10))
340 strcpy(s2p, "namespace\\3a");
348 if ((ss == s && strchr("[(<=>!", *s)) || *ss == ' ' || *ss == '\\' || *(unsigned char *)ss < 32 || *ss == '(' || *ss == ')')
351 solv_bin2hex((unsigned char *)ss, 1, s2p);
356 if (isname && s2p - s2 > 4 && !strcmp(s2p - 4, ":any"))
357 strcpy(s2p - 4, "\\3aany");
366 { REL_GT | REL_LT | REL_EQ, "<=>" },
367 { REL_LT | REL_EQ, "<=" },
368 { REL_GT | REL_EQ, ">=" },
370 { REL_GT | REL_LT, "<>" },
374 { REL_NAMESPACE , "<NAMESPACE>" },
376 { REL_MULTIARCH, "<MULTIARCH>" },
377 { REL_FILECONFLICT, "<FILECONFLICT>" },
378 { REL_COND, "<IF>" },
379 { REL_COMPAT, "compat >=" },
380 { REL_KIND, "<KIND>" },
386 testcase_dep2str_complex(Pool *pool, Id id, int addparens)
395 return testcase_id2str(pool, id, 1);
396 rd = GETRELDEP(pool, id);
398 /* check for special shortcuts */
399 if (rd->flags == REL_NAMESPACE && !ISRELDEP(rd->name) && !strncmp(pool_id2str(pool, rd->name), "namespace:", 10))
401 const char *ns = pool_id2str(pool, rd->name);
402 int nslen = strlen(ns);
403 /* special namespace formatting */
404 const char *evrs = testcase_dep2str_complex(pool, rd->evr, 0);
405 s = pool_tmpappend(pool, evrs, ns, "()");
406 memmove(s + nslen + 1, s, strlen(s) - nslen - 2);
407 memcpy(s, ns, nslen);
411 if (rd->flags == REL_MULTIARCH && !ISRELDEP(rd->name) && rd->evr == ARCH_ANY)
413 /* special :any suffix */
414 const char *ns = testcase_id2str(pool, rd->name, 1);
415 return pool_tmpappend(pool, ns, ":any", 0);
419 if (ISRELDEP(rd->name))
421 Reldep *rd2 = GETRELDEP(pool, rd->name);
423 if (rd->flags > 7 && rd->flags != REL_COMPAT && rd2->flags && rd2->flags <= 7)
426 s = (char *)testcase_dep2str_complex(pool, rd->name, needparens);
430 s = pool_tmpappend(pool, s, "(", 0);
431 memmove(s + 1, s, strlen(s + 1));
434 for (op = oplist; op->flags; op++)
435 if (rd->flags == op->flags)
439 s = pool_tmpappend(pool, s, " ", op->opname);
440 s = pool_tmpappend(pool, s, " ", 0);
445 sprintf(buf, " <%u> ", rd->flags);
446 s = pool_tmpappend(pool, s, buf, 0);
450 if (ISRELDEP(rd->evr))
452 Reldep *rd2 = GETRELDEP(pool, rd->evr);
454 if (rd->flags > 7 && rd2->flags && rd2->flags <= 7)
456 if (rd->flags == REL_AND && rd2->flags == REL_AND)
457 needparens = 0; /* chain */
458 if (rd->flags == REL_OR && rd2->flags == REL_OR)
459 needparens = 0; /* chain */
460 if (rd->flags > 0 && rd->flags < 8 && rd2->flags == REL_COMPAT)
461 needparens = 0; /* chain */
463 if (!ISRELDEP(rd->evr))
464 s2 = testcase_id2str(pool, rd->evr, 0);
466 s2 = testcase_dep2str_complex(pool, rd->evr, needparens);
468 s = pool_tmpappend(pool, s, s2, ")");
470 s = pool_tmpappend(pool, s, s2, 0);
471 pool_freetmpspace(pool, s2);
476 testcase_dep2str(Pool *pool, Id id)
478 return testcase_dep2str_complex(pool, id, 0);
482 /* Convert a simple string. Also handle the :any suffix */
484 testcase_str2dep_simple(Pool *pool, const char **sp, int isname)
491 for (s = *sp; *s; s++)
495 if (*s == ' ' || *(unsigned char *)s < 32)
499 if (*s == ')' && paren-- <= 0)
502 if (isname && s - *sp > 4 && !strncmp(s - 4, ":any", 4))
509 if (s - *sp == 6 && !strncmp(*sp, "<NULL>", 6))
512 id = pool_strn2id(pool, *sp, s - *sp, 1);
514 else if (s - *sp == 3 && !strncmp(*sp, "\\00", 3))
518 char buf[128], *bp, *bp2;
520 bp = s - *sp >= 128 ? solv_malloc(s - *sp + 1) : buf;
521 for (bp2 = bp, sp2 = *sp; sp2 < s;)
525 solv_hex2bin(&sp2, (unsigned char *)bp2 - 1, 1);
528 id = pool_str2id(pool, bp, 1);
534 id = pool_rel2id(pool, id, ARCH_ANY, REL_MULTIARCH, 1);
543 testcase_str2dep_complex(Pool *pool, const char **sp, int relop)
546 Id flags, id, id2, namespaceid = 0;
549 while (*s == ' ' || *s == '\t')
551 if (!strncmp(s, "namespace:", 10))
553 /* special namespace hack */
555 for (s2 = s + 10; *s2 && *s2 != '('; s2++)
559 namespaceid = pool_strn2id(pool, s, s2 - s, 1);
566 id = testcase_str2dep_complex(pool, &s, 0);
575 id = testcase_str2dep_simple(pool, &s, relop ? 0 : 1);
577 id = pool_rel2id(pool, namespaceid, id, REL_NAMESPACE, 1);
581 while (*s == ' ' || *s == '\t')
583 if (!*s || *s == ')' || (relop && strncmp(s, "compat >= ", 10) != 0))
589 /* we have an op! Find the end */
591 if (s[0] == '<' && (s[1] >= '0' && s[1] <= '9'))
594 for (s2 = s + 1; *s2 >= '0' && *s2 <= '9'; s2++)
598 flags = strtoul(s + 1, 0, 10);
604 for (op = oplist; op->flags; op++)
605 if (!strncmp(s, op->opname, strlen(op->opname)))
613 s += strlen(op->opname);
615 id2 = testcase_str2dep_complex(pool, &s, flags > 0 && flags < 8);
621 id = pool_rel2id(pool, id, id2, flags, 1);
626 testcase_str2dep(Pool *pool, const char *s)
628 Id id = testcase_str2dep_complex(pool, &s, 0);
629 return s && !*s ? id : 0;
632 /**********************************************************/
635 testcase_repoid2str(Pool *pool, Id repoid)
637 Repo *repo = pool_id2repo(pool, repoid);
640 char *r = pool_tmpjoin(pool, repo->name, 0, 0);
642 for (rp = r; *rp; rp++)
643 if (*rp == ' ' || *rp == '\t')
650 sprintf(buf, "#%d", repoid);
651 return pool_tmpjoin(pool, buf, 0, 0);
656 testcase_solvid2str(Pool *pool, Id p)
658 Solvable *s = pool->solvables + p;
659 const char *n, *e, *a;
662 if (p == SYSTEMSOLVABLE)
664 n = pool_id2str(pool, s->name);
665 e = pool_id2str(pool, s->evr);
666 a = pool_id2str(pool, s->arch);
667 str = pool_alloctmpspace(pool, strlen(n) + strlen(e) + strlen(a) + 3);
668 sprintf(str, "%s-%s.%s", n, e, a);
670 return pool_tmpappend(pool, str, "@", 0);
674 char *str2 = pool_tmpappend(pool, str, "@", s->repo->name);
676 if (str2[l] == ' ' || str2[l] == '\t')
680 sprintf(buf, "@#%d", s->repo->repoid);
681 return pool_tmpappend(pool, str, buf, 0);
685 testcase_str2repo(Pool *pool, const char *str)
689 if (str[0] == '#' && (str[1] >= '0' && str[1] <= '9'))
693 for (j = 1; str[j] >= '0' && str[j] <= '9'; j++)
694 repoid = repoid * 10 + (str[j] - '0');
695 if (!str[j] && repoid > 0 && repoid < pool->nrepos)
696 repo = pool_id2repo(pool, repoid);
700 FOR_REPOS(repoid, repo)
705 l = strlen(repo->name);
706 for (i = 0; i < l; i++)
708 int c = repo->name[i];
709 if (c == ' ' || c == '\t')
714 if (i == l && !str[l])
717 if (repoid >= pool->nrepos)
724 testcase_str2solvid(Pool *pool, const char *str)
726 int i, l = strlen(str);
733 if (*str == '@' && !strcmp(str, "@SYSTEM"))
734 return SYSTEMSOLVABLE;
736 for (i = l - 1; i >= 0; i--)
737 if (str[i] == '@' && (repo = testcase_str2repo(pool, str + i + 1)) != 0)
742 /* now find the arch (if present) */
744 for (i = repostart - 1; i > 0; i--)
747 arch = pool_strn2id(pool, str + i + 1, repostart - (i + 1), 0);
752 /* now find the name */
753 for (i = repostart - 1; i > 0; i--)
757 Id nid, evrid, p, pp;
758 nid = pool_strn2id(pool, str, i, 0);
761 evrid = pool_strn2id(pool, str + i + 1, repostart - (i + 1), 0);
764 FOR_PROVIDES(p, pp, nid)
766 Solvable *s = pool->solvables + p;
767 if (s->name != nid || s->evr != evrid)
769 if (repo && s->repo != repo)
771 if (arch && s->arch != arch)
781 testcase_job2str(Pool *pool, Id how, Id what)
788 Id select = how & SOLVER_SELECTMASK;
790 for (i = 0; job2str[i].str; i++)
791 if ((how & SOLVER_JOBMASK) == job2str[i].job)
793 jobstr = job2str[i].str ? job2str[i].str : "unknown";
794 if (select == SOLVER_SOLVABLE)
797 pkgstr = testcase_solvid2str(pool, what);
799 else if (select == SOLVER_SOLVABLE_NAME)
802 pkgstr = testcase_dep2str(pool, what);
804 else if (select == SOLVER_SOLVABLE_PROVIDES)
806 selstr = " provides ";
807 pkgstr = testcase_dep2str(pool, what);
809 else if (select == SOLVER_SOLVABLE_ONE_OF)
814 while ((p = pool->whatprovidesdata[what++]) != 0)
816 const char *s = testcase_solvid2str(pool, p);
819 pkgstr = pool_tmpappend(pool, pkgstr, " ", s);
820 pool_freetmpspace(pool, s);
828 else if (select == SOLVER_SOLVABLE_REPO)
830 Repo *repo = pool_id2repo(pool, what);
835 sprintf(buf, "#%d", repo->repoid);
836 pkgstr = pool_tmpjoin(pool, buf, 0, 0);
839 pkgstr = pool_tmpjoin(pool, repo->name, 0, 0);
841 else if (select == SOLVER_SOLVABLE_ALL)
848 selstr = " unknown ";
851 ret = pool_tmpjoin(pool, jobstr, selstr, pkgstr);
853 ret = pool_tmpappend(pool, ret, " ", 0);
854 for (i = 0; jobflags2str[i].str; i++)
855 if ((how & jobflags2str[i].flag) != 0)
856 ret = pool_tmpappend(pool, ret, ",", jobflags2str[i].str);
862 ret = pool_tmpappend(pool, ret, "]", 0);
868 str2selflags(Pool *pool, char *s) /* modifies the string! */
873 char *se = strchr(s, ',');
876 for (i = 0; selflags2str[i].str; i++)
877 if (!strcmp(s, selflags2str[i].str))
879 selflags |= selflags2str[i].flag;
882 if (!selflags2str[i].str)
883 pool_debug(pool, SOLV_ERROR, "str2job: unknown selection flag '%s'\n", s);
890 str2jobflags(Pool *pool, char *s) /* modifies the string */
895 char *se = strchr(s, ',');
898 for (i = 0; jobflags2str[i].str; i++)
899 if (!strcmp(s, jobflags2str[i].str))
901 jobflags |= jobflags2str[i].flag;
904 if (!jobflags2str[i].str)
905 pool_debug(pool, SOLV_ERROR, "str2job: unknown job flag '%s'\n", s);
912 testcase_str2job(Pool *pool, const char *str, Id *whatp)
922 /* so we can patch it */
923 s = pool_tmpjoin(pool, str, 0, 0);
924 /* split it in pieces */
927 while (*s == ' ' || *s == '\t')
931 pieces = solv_extend(pieces, npieces, 1, sizeof(*pieces), 7);
932 pieces[npieces++] = s;
933 while (*s && *s != ' ' && *s != '\t')
940 pool_debug(pool, SOLV_ERROR, "str2job: bad line '%s'\n", str);
945 for (i = 0; job2str[i].str; i++)
946 if (!strcmp(pieces[0], job2str[i].str))
950 pool_debug(pool, SOLV_ERROR, "str2job: unknown job '%s'\n", str);
954 job = job2str[i].job;
958 char *flags = pieces[npieces - 1];
959 if (*flags == '[' && flags[strlen(flags) - 1] == ']')
963 flags[strlen(flags) - 1] = 0;
964 job |= str2jobflags(pool, flags);
967 if (!strcmp(pieces[1], "pkg"))
971 pool_debug(pool, SOLV_ERROR, "str2job: bad pkg selector in '%s'\n", str);
975 job |= SOLVER_SOLVABLE;
976 what = testcase_str2solvid(pool, pieces[2]);
979 pool_debug(pool, SOLV_ERROR, "str2job: unknown package '%s'\n", pieces[2]);
984 else if (!strcmp(pieces[1], "name") || !strcmp(pieces[1], "provides"))
986 /* join em again for dep2str... */
988 for (sp = pieces[2]; sp < pieces[npieces - 1]; sp++)
992 if (pieces[1][0] == 'p' && strncmp(pieces[2], "namespace:", 10) == 0)
994 char *spe = strchr(pieces[2], '(');
995 int l = strlen(pieces[2]);
996 if (spe && pieces[2][l - 1] == ')')
998 /* special namespace provides */
999 if (strcmp(spe, "(<NULL>)") != 0)
1001 pieces[2][l - 1] = 0;
1002 what = testcase_str2dep(pool, spe + 1);
1003 pieces[2][l - 1] = ')';
1005 what = pool_rel2id(pool, pool_strn2id(pool, pieces[2], spe - pieces[2], 1), what, REL_NAMESPACE, 1);
1009 what = testcase_str2dep(pool, pieces[2]);
1010 if (pieces[1][0] == 'n')
1011 job |= SOLVER_SOLVABLE_NAME;
1013 job |= SOLVER_SOLVABLE_PROVIDES;
1015 else if (!strcmp(pieces[1], "oneof"))
1018 job |= SOLVER_SOLVABLE_ONE_OF;
1020 if (npieces > 3 && strcmp(pieces[2], "nothing") != 0)
1022 for (i = 2; i < npieces; i++)
1024 Id p = testcase_str2solvid(pool, pieces[i]);
1027 pool_debug(pool, SOLV_ERROR, "str2job: unknown package '%s'\n", pieces[i]);
1035 what = pool_queuetowhatprovides(pool, &q);
1038 else if (!strcmp(pieces[1], "repo"))
1043 pool_debug(pool, SOLV_ERROR, "str2job: bad line '%s'\n", str);
1047 repo = testcase_str2repo(pool, pieces[2]);
1050 pool_debug(pool, SOLV_ERROR, "str2job: unknown repo '%s'\n", pieces[2]);
1054 job |= SOLVER_SOLVABLE_REPO;
1055 what = repo->repoid;
1057 else if (!strcmp(pieces[1], "all"))
1059 if (npieces != 3 && strcmp(pieces[2], "packages") != 0)
1061 pool_debug(pool, SOLV_ERROR, "str2job: bad line '%s'\n", str);
1065 job |= SOLVER_SOLVABLE_ALL;
1070 pool_debug(pool, SOLV_ERROR, "str2job: unknown selection in '%s'\n", str);
1080 addselectionjob(Pool *pool, char **pieces, int npieces, Queue *jobqueue)
1087 for (i = 0; job2str[i].str; i++)
1088 if (!strcmp(pieces[0], job2str[i].str))
1090 if (!job2str[i].str)
1092 pool_debug(pool, SOLV_ERROR, "selstr2job: unknown job '%s'\n", pieces[0]);
1095 job = job2str[i].job;
1098 char *flags = pieces[npieces - 1];
1099 if (*flags == '[' && flags[strlen(flags) - 1] == ']')
1103 flags[strlen(flags) - 1] = 0;
1104 job |= str2jobflags(pool, flags);
1109 pool_debug(pool, SOLV_ERROR, "selstr2job: no selection flags\n");
1112 selflags = str2selflags(pool, pieces[3]);
1114 r = selection_make(pool, &sel, pieces[2], selflags);
1115 for (i = 0; i < sel.count; i += 2)
1116 queue_push2(jobqueue, job | sel.elements[i], sel.elements[i + 1]);
1122 writedeps(Repo *repo, FILE *fp, const char *tag, Id key, Solvable *s, Offset off)
1124 Pool *pool = repo->pool;
1131 dp = repo->idarraydata + off;
1132 while ((id = *dp++) != 0)
1134 if (key == SOLVABLE_REQUIRES && id == SOLVABLE_PREREQMARKER)
1137 fprintf(fp, "-%s\n", tag);
1142 if (key == SOLVABLE_PROVIDES && id == SOLVABLE_FILEMARKER)
1144 idstr = testcase_dep2str(pool, id);
1147 fprintf(fp, "+%s\n", tag);
1150 fprintf(fp, "%s\n", idstr);
1153 fprintf(fp, "-%s\n", tag);
1157 writefilelist(Repo *repo, FILE *fp, const char *tag, Solvable *s)
1159 Pool *pool = repo->pool;
1163 dataiterator_init(&di, pool, repo, s - pool->solvables, SOLVABLE_FILELIST, 0, 0);
1164 while (dataiterator_step(&di))
1166 const char *s = repodata_dir2str(di.data, di.kv.id, di.kv.str);
1169 fprintf(fp, "+%s\n", tag);
1172 fprintf(fp, "%s\n", s);
1175 fprintf(fp, "-%s\n", tag);
1176 dataiterator_free(&di);
1180 testcase_write_testtags(Repo *repo, FILE *fp)
1182 Pool *pool = repo->pool;
1188 const char *release;
1192 fprintf(fp, "=Ver: 3.0\n");
1193 FOR_REPO_SOLVABLES(repo, p, s)
1195 name = pool_id2str(pool, s->name);
1196 evr = pool_id2str(pool, s->evr);
1197 arch = pool_id2str(pool, s->arch);
1198 release = strrchr(evr, '-');
1200 release = evr + strlen(evr);
1201 fprintf(fp, "=Pkg: %s %.*s %s %s\n", name, (int)(release - evr), evr, *release && release[1] ? release + 1 : "-", arch);
1202 tmp = solvable_lookup_str(s, SOLVABLE_SUMMARY);
1204 fprintf(fp, "=Sum: %s\n", tmp);
1205 writedeps(repo, fp, "Req:", SOLVABLE_REQUIRES, s, s->requires);
1206 writedeps(repo, fp, "Prv:", SOLVABLE_PROVIDES, s, s->provides);
1207 writedeps(repo, fp, "Obs:", SOLVABLE_OBSOLETES, s, s->obsoletes);
1208 writedeps(repo, fp, "Con:", SOLVABLE_CONFLICTS, s, s->conflicts);
1209 writedeps(repo, fp, "Rec:", SOLVABLE_RECOMMENDS, s, s->recommends);
1210 writedeps(repo, fp, "Sup:", SOLVABLE_SUPPLEMENTS, s, s->supplements);
1211 writedeps(repo, fp, "Sug:", SOLVABLE_SUGGESTS, s, s->suggests);
1212 writedeps(repo, fp, "Enh:", SOLVABLE_ENHANCES, s, s->enhances);
1214 fprintf(fp, "=Vnd: %s\n", pool_id2str(pool, s->vendor));
1215 ti = solvable_lookup_num(s, SOLVABLE_BUILDTIME, 0);
1217 fprintf(fp, "=Tim: %u\n", ti);
1218 writefilelist(repo, fp, "Fls:", s);
1223 static inline Offset
1224 adddep(Repo *repo, Offset olddeps, char *str, Id marker)
1226 Id id = *str == '/' ? pool_str2id(repo->pool, str, 1) : testcase_str2dep(repo->pool, str);
1227 return repo_addid_dep(repo, olddeps, id, marker);
1231 finish_v2_solvable(Pool *pool, Repodata *data, Solvable *s, char *filelist, int nfilelist)
1237 for (l = 0; l < nfilelist; l += strlen(filelist + l) + 1)
1239 char *p = strrchr(filelist + l, '/');
1243 did = repodata_str2dir(data, filelist + l, 1);
1246 did = repodata_str2dir(data, "/", 1);
1247 repodata_add_dirstr(data, s - pool->solvables, SOLVABLE_FILELIST, did, p);
1250 s->supplements = repo_fix_supplements(s->repo, s->provides, s->supplements, 0);
1251 s->conflicts = repo_fix_conflicts(s->repo, s->conflicts);
1254 /* stripped down version of susetags parser used for testcases */
1256 testcase_add_testtags(Repo *repo, FILE *fp, int flags)
1258 Pool *pool = repo->pool;
1270 int tagsversion = 0;
1271 int addselfprovides = 1; /* for compat reasons */
1273 data = repo_add_repodata(repo, flags);
1278 line = solv_malloc(aline);
1282 if (linep - line + 16 > aline)
1284 aline = linep - line;
1285 line = solv_realloc(line, aline + 512);
1286 linep = line + aline;
1289 if (!fgets(linep, aline - (linep - line), fp))
1291 linep += strlen(linep);
1292 if (linep == line || linep[-1] != '\n')
1295 linep = line + intag;
1298 if (line[intag] == '-' && !strncmp(line + 1, line + intag + 1, intag - 2))
1305 else if (line[0] == '+' && line[1] && line[1] != ':')
1307 char *tagend = strchr(line, ':');
1312 intag = tagend + 2 - line;
1313 linep = line + intag;
1316 if (*line != '=' || !line[1] || !line[2] || !line[3] || line[4] != ':')
1318 tag = line[1] << 16 | line[2] << 8 | line[3];
1321 case 'V' << 16 | 'e' << 8 | 'r':
1322 tagsversion = atoi(line + 6);
1323 addselfprovides = tagsversion < 3 || strstr(line + 6, "addselfprovides") != 0;
1325 case 'P' << 16 | 'k' << 8 | 'g':
1328 if (tagsversion == 2)
1329 finish_v2_solvable(pool, data, s, filelist, nfilelist);
1330 if (addselfprovides && s->name && s->arch != ARCH_SRC && s->arch != ARCH_NOSRC)
1331 s->provides = repo_addid_dep(s->repo, s->provides, pool_rel2id(pool, s->name, s->evr, REL_EQ, 1), 0);
1334 if (split(line + 5, sp, 5) != 4)
1336 s = pool_id2solvable(pool, repo_add_solvable(repo));
1337 s->name = pool_str2id(pool, sp[0], 1);
1338 /* join back version and release */
1339 if (sp[2] && !(sp[2][0] == '-' && !sp[2][1]))
1341 s->evr = makeevr(pool, sp[1]);
1342 s->arch = pool_str2id(pool, sp[3], 1);
1344 case 'S' << 16 | 'u' << 8 | 'm':
1345 repodata_set_str(data, s - pool->solvables, SOLVABLE_SUMMARY, line + 6);
1347 case 'V' << 16 | 'n' << 8 | 'd':
1348 s->vendor = pool_str2id(pool, line + 6, 1);
1350 case 'T' << 16 | 'i' << 8 | 'm':
1353 repodata_set_num(data, s - pool->solvables, SOLVABLE_BUILDTIME, t);
1355 case 'R' << 16 | 'e' << 8 | 'q':
1356 s->requires = adddep(repo, s->requires, line + 6, -SOLVABLE_PREREQMARKER);
1358 case 'P' << 16 | 'r' << 8 | 'q':
1359 s->requires = adddep(repo, s->requires, line + 6, SOLVABLE_PREREQMARKER);
1361 case 'P' << 16 | 'r' << 8 | 'v':
1362 /* version 2 had the file list at the end of the provides */
1363 if (tagsversion == 2)
1367 int l = strlen(line + 6) + 1;
1368 if (nfilelist + l > afilelist)
1370 afilelist = nfilelist + l + 512;
1371 filelist = solv_realloc(filelist, afilelist);
1373 memcpy(filelist + nfilelist, line + 6, l);
1380 for (l = 0; l < nfilelist; l += strlen(filelist + l) + 1)
1381 s->provides = repo_addid_dep(repo, s->provides, pool_str2id(pool, filelist + l, 1), 0);
1385 s->provides = adddep(repo, s->provides, line + 6, 0);
1387 case 'F' << 16 | 'l' << 8 | 's':
1389 char *p = strrchr(line + 6, '/');
1394 did = repodata_str2dir(data, line + 6, 1);
1396 did = repodata_str2dir(data, "/", 1);
1397 repodata_add_dirstr(data, s - pool->solvables, SOLVABLE_FILELIST, did, p);
1400 case 'O' << 16 | 'b' << 8 | 's':
1401 s->obsoletes = adddep(repo, s->obsoletes, line + 6, 0);
1403 case 'C' << 16 | 'o' << 8 | 'n':
1404 s->conflicts = adddep(repo, s->conflicts, line + 6, 0);
1406 case 'R' << 16 | 'e' << 8 | 'c':
1407 s->recommends = adddep(repo, s->recommends, line + 6, 0);
1409 case 'S' << 16 | 'u' << 8 | 'p':
1410 s->supplements = adddep(repo, s->supplements, line + 6, 0);
1412 case 'S' << 16 | 'u' << 8 | 'g':
1413 s->suggests = adddep(repo, s->suggests, line + 6, 0);
1415 case 'E' << 16 | 'n' << 8 | 'h':
1416 s->enhances = adddep(repo, s->enhances, line + 6, 0);
1424 if (tagsversion == 2)
1425 finish_v2_solvable(pool, data, s, filelist, nfilelist);
1426 if (addselfprovides && s->name && s->arch != ARCH_SRC && s->arch != ARCH_NOSRC)
1427 s->provides = repo_addid_dep(s->repo, s->provides, pool_rel2id(pool, s->name, s->evr, REL_EQ, 1), 0);
1430 solv_free(filelist);
1431 repodata_free_dircache(data);
1432 if (!(flags & REPO_NO_INTERNALIZE))
1433 repodata_internalize(data);
1438 testcase_getpoolflags(Pool *pool)
1440 const char *str = 0;
1442 for (i = 0; poolflags2str[i].str; i++)
1444 v = pool_get_flag(pool, poolflags2str[i].flag);
1445 if (v == poolflags2str[i].def)
1447 str = pool_tmpappend(pool, str, v ? " " : " !", poolflags2str[i].str);
1449 return str ? str + 1 : "";
1453 testcase_setpoolflags(Pool *pool, const char *str)
1455 const char *p = str, *s;
1459 while (*p == ' ' || *p == '\t' || *p == ',')
1470 while (*p && *p != ' ' && *p != '\t' && *p != ',')
1472 for (i = 0; poolflags2str[i].str; i++)
1473 if (!strncmp(poolflags2str[i].str, s, p - s) && poolflags2str[i].str[p - s] == 0)
1475 if (!poolflags2str[i].str)
1477 pool_debug(pool, SOLV_ERROR, "setpoolflags: unknown flag '%.*s'\n", (int)(p - s), s);
1480 pool_set_flag(pool, poolflags2str[i].flag, v);
1486 testcase_resetpoolflags(Pool *pool)
1489 for (i = 0; poolflags2str[i].str; i++)
1490 pool_set_flag(pool, poolflags2str[i].flag, poolflags2str[i].def);
1494 testcase_getsolverflags(Solver *solv)
1496 Pool *pool = solv->pool;
1497 const char *str = 0;
1499 for (i = 0; solverflags2str[i].str; i++)
1501 v = solver_get_flag(solv, solverflags2str[i].flag);
1502 if (v == solverflags2str[i].def)
1504 str = pool_tmpappend(pool, str, v ? " " : " !", solverflags2str[i].str);
1506 return str ? str + 1 : "";
1510 testcase_setsolverflags(Solver *solv, const char *str)
1512 const char *p = str, *s;
1516 while (*p == ' ' || *p == '\t' || *p == ',')
1527 while (*p && *p != ' ' && *p != '\t' && *p != ',')
1529 for (i = 0; solverflags2str[i].str; i++)
1530 if (!strncmp(solverflags2str[i].str, s, p - s) && solverflags2str[i].str[p - s] == 0)
1532 if (!solverflags2str[i].str)
1534 pool_debug(solv->pool, SOLV_ERROR, "setsolverflags: unknown flag '%.*s'\n", (int)(p - s), s);
1537 solver_set_flag(solv, solverflags2str[i].flag, v);
1543 testcase_resetsolverflags(Solver *solv)
1546 for (i = 0; solverflags2str[i].str; i++)
1547 solver_set_flag(solv, solverflags2str[i].flag, solverflags2str[i].def);
1551 testcase_ruleid(Solver *solv, Id rid)
1557 const unsigned char *md5;
1563 solver_ruleliterals(solv, rid, &q);
1564 for (i = 0; i < q.count; i++)
1566 Id p = q.elements[i];
1567 s = testcase_solvid2str(solv->pool, p > 0 ? p : -p);
1569 s = pool_tmpjoin(solv->pool, "!", s, 0);
1570 strqueue_push(&sq, s);
1573 strqueue_sort_u(&sq);
1574 chk = solv_chksum_create(REPOKEY_TYPE_MD5);
1575 for (i = 0; i < sq.nstr; i++)
1576 solv_chksum_add(chk, sq.str[i], strlen(sq.str[i]) + 1);
1577 md5 = solv_chksum_get(chk, &md5l);
1578 s = pool_bin2hex(solv->pool, md5, md5l);
1579 chk = solv_chksum_free(chk, 0);
1585 testcase_problemid(Solver *solv, Id problem)
1590 const unsigned char *md5;
1594 /* we build a hash of all rules that define the problem */
1597 solver_findallproblemrules(solv, problem, &q);
1598 for (i = 0; i < q.count; i++)
1599 strqueue_push(&sq, testcase_ruleid(solv, q.elements[i]));
1601 strqueue_sort_u(&sq);
1602 chk = solv_chksum_create(REPOKEY_TYPE_MD5);
1603 for (i = 0; i < sq.nstr; i++)
1604 solv_chksum_add(chk, sq.str[i], strlen(sq.str[i]) + 1);
1605 md5 = solv_chksum_get(chk, &md5l);
1606 s = pool_bin2hex(solv->pool, md5, 4);
1607 chk = solv_chksum_free(chk, 0);
1613 testcase_solutionid(Solver *solv, Id problem, Id solution)
1617 const unsigned char *md5;
1621 intid = solver_solutionelement_internalid(solv, problem, solution);
1622 /* internal stuff! handle with care! */
1626 s = testcase_job2str(solv->pool, solv->job.elements[-intid - 1], solv->job.elements[-intid]);
1631 s = testcase_ruleid(solv, intid);
1633 chk = solv_chksum_create(REPOKEY_TYPE_MD5);
1634 solv_chksum_add(chk, s, strlen(s) + 1);
1635 md5 = solv_chksum_get(chk, &md5l);
1636 s = pool_bin2hex(solv->pool, md5, 4);
1637 chk = solv_chksum_free(chk, 0);
1642 testcase_alternativeid(Solver *solv, int type, Id id, Id from)
1645 Pool *pool = solv->pool;
1647 const unsigned char *md5;
1649 chk = solv_chksum_create(REPOKEY_TYPE_MD5);
1650 if (type == SOLVER_ALTERNATIVE_TYPE_RECOMMENDS)
1652 s = testcase_solvid2str(pool, from);
1653 solv_chksum_add(chk, s, strlen(s) + 1);
1654 s = testcase_dep2str(pool, id);
1655 solv_chksum_add(chk, s, strlen(s) + 1);
1657 else if (type == SOLVER_ALTERNATIVE_TYPE_RULE)
1659 s = testcase_ruleid(solv, id);
1660 solv_chksum_add(chk, s, strlen(s) + 1);
1662 md5 = solv_chksum_get(chk, &md5l);
1663 s = pool_bin2hex(pool, md5, 4);
1664 chk = solv_chksum_free(chk, 0);
1668 static struct class2str {
1672 { SOLVER_TRANSACTION_ERASE, "erase" },
1673 { SOLVER_TRANSACTION_INSTALL, "install" },
1674 { SOLVER_TRANSACTION_REINSTALLED, "reinstall" },
1675 { SOLVER_TRANSACTION_DOWNGRADED, "downgrade" },
1676 { SOLVER_TRANSACTION_CHANGED, "change" },
1677 { SOLVER_TRANSACTION_UPGRADED, "upgrade" },
1678 { SOLVER_TRANSACTION_OBSOLETED, "obsolete" },
1679 { SOLVER_TRANSACTION_MULTIINSTALL, "multiinstall" },
1680 { SOLVER_TRANSACTION_MULTIREINSTALL, "multireinstall" },
1685 dump_genid(Pool *pool, Strqueue *sq, Id id, int cnt)
1693 Reldep *rd = GETRELDEP(pool, id);
1694 for (op = oplist; op->flags; op++)
1695 if (rd->flags == op->flags)
1697 cnt = dump_genid(pool, sq, rd->name, cnt);
1698 cnt = dump_genid(pool, sq, rd->evr, cnt);
1699 sprintf(cntbuf, "genid %2d: genid ", cnt++);
1700 s = pool_tmpjoin(pool, cntbuf, "op ", op->flags ? op->opname : "unknown");
1704 sprintf(cntbuf, "genid %2d: genid ", cnt++);
1705 s = pool_tmpjoin(pool, cntbuf, id ? "lit " : "null", id ? pool_id2str(pool, id) : 0);
1707 strqueue_push(sq, s);
1712 testcase_solverresult(Solver *solv, int resultflags)
1714 Pool *pool = solv->pool;
1722 if ((resultflags & TESTCASE_RESULT_TRANSACTION) != 0)
1724 Transaction *trans = solver_create_transaction(solv);
1728 for (i = 0; class2str[i].str; i++)
1731 transaction_classify_pkgs(trans, SOLVER_TRANSACTION_KEEP_PSEUDO, class2str[i].class, 0, 0, &q);
1732 for (j = 0; j < q.count; j++)
1736 if (pool->installed && pool->solvables[p].repo == pool->installed)
1737 op = transaction_obs_pkg(trans, p);
1738 s = pool_tmpjoin(pool, class2str[i].str, " ", testcase_solvid2str(pool, p));
1740 s = pool_tmpjoin(pool, s, " ", testcase_solvid2str(pool, op));
1741 strqueue_push(&sq, s);
1745 transaction_free(trans);
1747 if ((resultflags & TESTCASE_RESULT_PROBLEMS) != 0)
1749 char *probprefix, *solprefix;
1750 int problem, solution, element;
1753 pcnt = solver_problem_count(solv);
1754 for (problem = 1; problem <= pcnt; problem++)
1756 Id rid, from, to, dep;
1757 SolverRuleinfo rinfo;
1758 rid = solver_findproblemrule(solv, problem);
1759 s = testcase_problemid(solv, problem);
1760 probprefix = solv_dupjoin("problem ", s, 0);
1761 rinfo = solver_ruleinfo(solv, rid, &from, &to, &dep);
1762 s = pool_tmpjoin(pool, probprefix, " info ", solver_problemruleinfo2str(solv, rinfo, from, to, dep));
1763 strqueue_push(&sq, s);
1764 scnt = solver_solution_count(solv, problem);
1765 for (solution = 1; solution <= scnt; solution++)
1767 s = testcase_solutionid(solv, problem, solution);
1768 solprefix = solv_dupjoin(probprefix, " solution ", s);
1770 while ((element = solver_next_solutionelement(solv, problem, solution, element, &p, &op)) != 0)
1772 if (p == SOLVER_SOLUTION_JOB)
1773 s = pool_tmpjoin(pool, solprefix, " deljob ", testcase_job2str(pool, solv->job.elements[op - 1], solv->job.elements[op]));
1774 else if (p > 0 && op == 0)
1775 s = pool_tmpjoin(pool, solprefix, " erase ", testcase_solvid2str(pool, p));
1776 else if (p > 0 && op > 0)
1778 s = pool_tmpjoin(pool, solprefix, " replace ", testcase_solvid2str(pool, p));
1779 s = pool_tmpappend(pool, s, " ", testcase_solvid2str(pool, op));
1781 else if (p < 0 && op > 0)
1782 s = pool_tmpjoin(pool, solprefix, " allow ", testcase_solvid2str(pool, op));
1784 s = pool_tmpjoin(pool, solprefix, " unknown", 0);
1785 strqueue_push(&sq, s);
1787 solv_free(solprefix);
1789 solv_free(probprefix);
1793 if ((resultflags & TESTCASE_RESULT_ORPHANED) != 0)
1798 solver_get_orphaned(solv, &q);
1799 for (i = 0; i < q.count; i++)
1801 s = pool_tmpjoin(pool, "orphaned ", testcase_solvid2str(pool, q.elements[i]), 0);
1802 strqueue_push(&sq, s);
1807 if ((resultflags & TESTCASE_RESULT_RECOMMENDED) != 0)
1813 solver_get_recommendations(solv, &qr, &qs, 0);
1814 for (i = 0; i < qr.count; i++)
1816 s = pool_tmpjoin(pool, "recommended ", testcase_solvid2str(pool, qr.elements[i]), 0);
1817 strqueue_push(&sq, s);
1819 for (i = 0; i < qs.count; i++)
1821 s = pool_tmpjoin(pool, "suggested ", testcase_solvid2str(pool, qs.elements[i]), 0);
1822 strqueue_push(&sq, s);
1828 if ((resultflags & TESTCASE_RESULT_UNNEEDED) != 0)
1834 solver_get_unneeded(solv, &q, 0);
1835 solver_get_unneeded(solv, &qf, 1);
1836 for (i = j = 0; i < q.count; i++)
1838 /* we rely on qf containing a subset of q in the same order */
1839 if (j < qf.count && q.elements[i] == qf.elements[j])
1841 s = pool_tmpjoin(pool, "unneeded_filtered ", testcase_solvid2str(pool, q.elements[i]), 0);
1845 s = pool_tmpjoin(pool, "unneeded ", testcase_solvid2str(pool, q.elements[i]), 0);
1846 strqueue_push(&sq, s);
1851 if ((resultflags & TESTCASE_RESULT_ALTERNATIVES) != 0)
1859 cnt = solver_alternatives_count(solv);
1860 for (alternative = 1; alternative <= cnt; alternative++)
1862 Id id, from, chosen;
1864 int type = solver_get_alternative(solv, alternative, &id, &from, &chosen, &q, 0);
1865 altprefix = solv_dupjoin("alternative ", testcase_alternativeid(solv, type, id, from), " ");
1867 if (type == SOLVER_ALTERNATIVE_TYPE_RECOMMENDS)
1869 char *s = pool_tmpjoin(pool, altprefix, num, testcase_solvid2str(pool, from));
1870 s = pool_tmpappend(pool, s, " recommends ", testcase_dep2str(pool, id));
1871 strqueue_push(&sq, s);
1873 else if (type == SOLVER_ALTERNATIVE_TYPE_RULE)
1875 /* map choice rules back to pkg rules */
1876 if (solver_ruleclass(solv, id) == SOLVER_RULE_CHOICE)
1877 id = solver_rule2pkgrule(solv, id);
1878 solver_allruleinfos(solv, id, &rq);
1879 for (i = 0; i < rq.count; i += 4)
1881 int rtype = rq.elements[i];
1882 if ((rtype & SOLVER_RULE_TYPEMASK) == SOLVER_RULE_JOB)
1884 const char *js = testcase_job2str(pool, rq.elements[i + 2], rq.elements[i + 3]);
1885 char *s = pool_tmpjoin(pool, altprefix, num, " job ");
1886 s = pool_tmpappend(pool, s, js, 0);
1887 strqueue_push(&sq, s);
1889 else if (rtype == SOLVER_RULE_PKG_REQUIRES)
1891 char *s = pool_tmpjoin(pool, altprefix, num, testcase_solvid2str(pool, rq.elements[i + 1]));
1892 s = pool_tmpappend(pool, s, " requires ", testcase_dep2str(pool, rq.elements[i + 3]));
1893 strqueue_push(&sq, s);
1897 for (i = 0; i < q.count; i++)
1899 Id p = q.elements[i];
1901 num[0] = '0' + (i + 1) / 10;
1902 num[1] = '0' + (i + 1) % 10;
1904 s = pool_tmpjoin(pool, altprefix, num, "+ ");
1906 s = pool_tmpjoin(pool, altprefix, num, "- ");
1908 s = pool_tmpjoin(pool, altprefix, num, " ");
1909 s = pool_tmpappend(pool, s, testcase_solvid2str(pool, p < 0 ? -p : p), 0);
1910 strqueue_push(&sq, s);
1912 solv_free(altprefix);
1917 if ((resultflags & TESTCASE_RESULT_RULES) != 0)
1919 /* dump all rules */
1921 SolverRuleinfo rclass;
1926 for (rid = 1; (rclass = solver_ruleclass(solv, rid)) != SOLVER_RULE_UNKNOWN; rid++)
1931 case SOLVER_RULE_PKG:
1934 case SOLVER_RULE_UPDATE:
1937 case SOLVER_RULE_FEATURE:
1938 prefix = "feature ";
1940 case SOLVER_RULE_JOB:
1943 case SOLVER_RULE_DISTUPGRADE:
1944 prefix = "distupgrade ";
1946 case SOLVER_RULE_INFARCH:
1947 prefix = "infarch ";
1949 case SOLVER_RULE_CHOICE:
1952 case SOLVER_RULE_LEARNT:
1955 case SOLVER_RULE_BEST:
1958 case SOLVER_RULE_YUMOBS:
1962 prefix = "unknown ";
1965 prefix = solv_dupjoin("rule ", prefix, testcase_ruleid(solv, rid));
1966 solver_ruleliterals(solv, rid, &q);
1967 if (rclass == SOLVER_RULE_FEATURE && q.count == 1 && q.elements[0] == -SYSTEMSOLVABLE)
1969 for (i = 0; i < q.count; i++)
1971 Id p = q.elements[i];
1974 s = pool_tmpjoin(pool, prefix, " -", testcase_solvid2str(pool, -p));
1976 s = pool_tmpjoin(pool, prefix, " ", testcase_solvid2str(pool, p));
1977 strqueue_push(&sq, s);
1983 if ((resultflags & TESTCASE_RESULT_GENID) != 0)
1985 for (i = 0 ; i < solv->job.count; i += 2)
1988 if (solv->job.elements[i] != (SOLVER_NOOP | SOLVER_SOLVABLE_PROVIDES))
1990 id = solv->job.elements[i + 1];
1991 s = testcase_dep2str(pool, id);
1992 strqueue_push(&sq, pool_tmpjoin(pool, "genid dep ", s, 0));
1993 if ((id2 = testcase_str2dep(pool, s)) != id)
1995 s = pool_tmpjoin(pool, "genid roundtrip error: ", testcase_dep2str(pool, id2), 0);
1996 strqueue_push(&sq, s);
1998 dump_genid(pool, &sq, id, 1);
2002 result = strqueue_join(&sq);
2009 testcase_write(Solver *solv, char *dir, int resultflags, const char *testcasename, const char *resultname)
2011 Pool *pool = solv->pool;
2022 testcasename = "testcase.t";
2024 resultname = "solver.result";
2026 if (mkdir(dir, 0777) && errno != EEXIST)
2028 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: could not create directory '%s'\n", dir);
2032 FOR_REPOS(repoid, repo)
2034 const char *name = testcase_repoid2str(pool, repoid);
2036 if (repo->subpriority)
2037 sprintf(priobuf, "%d.%d", repo->priority, repo->subpriority);
2039 sprintf(priobuf, "%d", repo->priority);
2040 out = pool_tmpjoin(pool, name, ".repo", ".gz");
2041 cmd = pool_tmpjoin(pool, "repo ", name, " ");
2042 cmd = pool_tmpappend(pool, cmd, priobuf, " ");
2043 cmd = pool_tmpappend(pool, cmd, "testtags ", out);
2044 strqueue_push(&sq, cmd);
2045 out = pool_tmpjoin(pool, dir, "/", out);
2046 if (!(fp = solv_xfopen(out, "w")))
2048 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: could not open '%s' for writing\n", out);
2052 testcase_write_testtags(repo, fp);
2055 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: write error\n");
2060 /* hmm, this is not optimal... we currently search for the lowest score */
2062 arch = pool->solvables[SYSTEMSOLVABLE].arch;
2063 for (i = 0; i < pool->lastarch; i++)
2065 if (pool->id2arch[i] == 1 && !lowscore)
2067 if (pool->id2arch[i] > 0x10000 && (!lowscore || pool->id2arch[i] < lowscore))
2070 lowscore = pool->id2arch[i];
2073 cmd = pool_tmpjoin(pool, "system ", pool->lastarch ? pool_id2str(pool, arch) : "unset", 0);
2074 for (i = 0; disttype2str[i].str != 0; i++)
2075 if (pool->disttype == disttype2str[i].type)
2077 pool_tmpappend(pool, cmd, " ", disttype2str[i].str ? disttype2str[i].str : "unknown");
2078 if (pool->installed)
2079 cmd = pool_tmpappend(pool, cmd, " ", testcase_repoid2str(pool, pool->installed->repoid));
2080 strqueue_push(&sq, cmd);
2081 s = testcase_getpoolflags(solv->pool);
2084 cmd = pool_tmpjoin(pool, "poolflags ", s, 0);
2085 strqueue_push(&sq, cmd);
2088 if (pool->vendorclasses)
2091 for (i = 0; pool->vendorclasses[i]; i++)
2093 cmd = pool_tmpappend(pool, cmd ? cmd : "vendorclass", " ", pool->vendorclasses[i]);
2094 if (!pool->vendorclasses[i + 1])
2096 strqueue_push(&sq, cmd);
2103 /* dump disabled packages (must come before the namespace/job lines) */
2104 if (pool->considered)
2107 FOR_POOL_SOLVABLES(p)
2108 if (!MAPTST(pool->considered, p))
2110 cmd = pool_tmpjoin(pool, "disable pkg ", testcase_solvid2str(pool, p), 0);
2111 strqueue_push(&sq, cmd);
2115 s = testcase_getsolverflags(solv);
2118 cmd = pool_tmpjoin(pool, "solverflags ", s, 0);
2119 strqueue_push(&sq, cmd);
2122 /* now dump all the ns callback values we know */
2123 if (pool->nscallback)
2127 for (rid = 1; rid < pool->nrels; rid++)
2129 Reldep *rd = pool->rels + rid;
2130 if (rd->flags != REL_NAMESPACE || rd->name == NAMESPACE_OTHERPROVIDERS)
2132 /* evaluate all namespace ids, skip empty results */
2133 d = pool_whatprovides(pool, MAKERELDEP(rid));
2134 if (!d || !pool->whatprovidesdata[d])
2136 cmd = pool_tmpjoin(pool, "namespace ", pool_id2str(pool, rd->name), "(");
2137 cmd = pool_tmpappend(pool, cmd, pool_id2str(pool, rd->evr), ")");
2138 for (; pool->whatprovidesdata[d]; d++)
2139 cmd = pool_tmpappend(pool, cmd, " ", testcase_solvid2str(pool, pool->whatprovidesdata[d]));
2140 strqueue_push(&sq, cmd);
2144 for (i = 0; i < solv->job.count; i += 2)
2146 cmd = (char *)testcase_job2str(pool, solv->job.elements[i], solv->job.elements[i + 1]);
2147 cmd = pool_tmpjoin(pool, "job ", cmd, 0);
2148 strqueue_push(&sq, cmd);
2155 for (i = 0; resultflags2str[i].str; i++)
2156 if ((resultflags & resultflags2str[i].flag) != 0)
2157 cmd = pool_tmpappend(pool, cmd, cmd ? "," : 0, resultflags2str[i].str);
2158 cmd = pool_tmpjoin(pool, "result ", cmd ? cmd : "?", 0);
2159 cmd = pool_tmpappend(pool, cmd, " ", resultname);
2160 strqueue_push(&sq, cmd);
2161 result = testcase_solverresult(solv, resultflags);
2162 if (!strcmp(resultname, "<inline>"))
2166 strqueue_init(&rsq);
2167 strqueue_split(&rsq, result);
2168 for (i = 0; i < rsq.nstr; i++)
2170 cmd = pool_tmpjoin(pool, "#>", rsq.str[i], 0);
2171 strqueue_push(&sq, cmd);
2173 strqueue_free(&rsq);
2177 out = pool_tmpjoin(pool, dir, "/", resultname);
2178 if (!(fp = fopen(out, "w")))
2180 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: could not open '%s' for writing\n", out);
2185 if (result && *result && fwrite(result, strlen(result), 1, fp) != 1)
2187 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: write error\n");
2195 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: write error\n");
2203 cmd = strqueue_join(&sq);
2204 out = pool_tmpjoin(pool, dir, "/", testcasename);
2205 if (!(fp = fopen(out, "w")))
2207 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: could not open '%s' for writing\n", out);
2211 if (*cmd && fwrite(cmd, strlen(cmd), 1, fp) != 1)
2213 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: write error\n");
2220 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: write error\n");
2230 read_inline_file(FILE *fp, char **bufp, char **bufpp, int *buflp)
2232 char *result = solv_malloc(1024);
2239 if (rp - result + 256 >= resultl)
2241 resultl = rp - result;
2242 result = solv_realloc(result, resultl + 1024);
2243 rp = result + resultl;
2246 if (!fgets(rp, resultl - (rp - result), fp))
2249 if (rl && (rp == result || rp[-1] == '\n'))
2251 if (rl > 1 && rp[0] == '#' && rp[1] == '>')
2253 memmove(rp, rp + 2, rl - 2);
2258 while (rl + 16 > *buflp)
2260 *bufp = solv_realloc(*bufp, *buflp + 512);
2263 memmove(*bufp, rp, rl);
2264 if ((*bufp)[rl - 1] == '\n')
2270 (*bufpp) = *bufp + rl;
2287 char *result = solv_malloc(1024);
2294 if (rp - result + 256 >= resultl)
2296 resultl = rp - result;
2297 result = solv_realloc(result, resultl + 1024);
2298 rp = result + resultl;
2301 rl = fread(rp, 1, resultl - (rp - result), fp);
2313 str2resultflags(Pool *pool, char *s) /* modifies the string! */
2315 int i, resultflags = 0;
2318 char *se = strchr(s, ',');
2321 for (i = 0; resultflags2str[i].str; i++)
2322 if (!strcmp(s, resultflags2str[i].str))
2324 resultflags |= resultflags2str[i].flag;
2327 if (!resultflags2str[i].str)
2328 pool_debug(pool, SOLV_ERROR, "result: unknown flag '%s'\n", s);
2335 testcase_read(Pool *pool, FILE *fp, char *testcase, Queue *job, char **resultp, int *resultflagsp)
2340 char *testcasedir, *s;
2346 int poolflagsreset = 0;
2347 int missing_features = 0;
2351 if (!fp && !(fp = fopen(testcase, "r")))
2353 pool_debug(pool, SOLV_ERROR, "testcase_read: could not open '%s'\n", testcase);
2356 testcasedir = solv_strdup(testcase);
2357 if ((s = strrchr(testcasedir, '/')) != 0)
2362 buf = solv_malloc(bufl);
2367 if (bufp - buf + 16 > bufl)
2370 buf = solv_realloc(buf, bufl + 512);
2374 if (!fgets(bufp, bufl - (bufp - buf), fp))
2378 if (!l || buf[l - 1] != '\n')
2385 while (*s && (*s == ' ' || *s == '\t'))
2387 if (!*s || *s == '#')
2390 /* split it in pieces */
2393 while (*s == ' ' || *s == '\t')
2397 pieces = solv_extend(pieces, npieces, 1, sizeof(*pieces), 7);
2398 pieces[npieces++] = s;
2399 while (*s && *s != ' ' && *s != '\t')
2404 pieces = solv_extend(pieces, npieces, 1, sizeof(*pieces), 7);
2405 pieces[npieces] = 0;
2406 if (!strcmp(pieces[0], "repo") && npieces >= 4)
2408 Repo *repo = repo_create(pool, pieces[1]);
2414 if (!poolflagsreset)
2417 testcase_resetpoolflags(pool); /* hmm */
2419 if (sscanf(pieces[2], "%d.%d", &prio, &subprio) != 2)
2422 prio = atoi(pieces[2]);
2424 repo->priority = prio;
2425 repo->subpriority = subprio;
2426 if (strcmp(pieces[3], "empty") != 0)
2428 const char *repotype = pool_tmpjoin(pool, pieces[3], 0, 0); /* gets overwritten in <inline> case */
2429 if (!strcmp(pieces[4], "<inline>"))
2431 char *idata = read_inline_file(fp, &buf, &bufp, &bufl);
2433 rfp = solv_xfopen_buf(rdata, &idata, 0, "rf");
2437 rdata = pool_tmpjoin(pool, testcasedir, pieces[4], 0);
2438 rfp = solv_xfopen(rdata, "r");
2442 pool_debug(pool, SOLV_ERROR, "testcase_read: could not open '%s'\n", rdata);
2444 else if (!strcmp(repotype, "testtags"))
2446 testcase_add_testtags(repo, rfp, 0);
2449 else if (!strcmp(repotype, "solv"))
2451 repo_add_solv(repo, rfp, 0);
2455 else if (!strcmp(repotype, "helix"))
2457 extern int repo_add_helix(Repo *repo, FILE *fp, int flags);
2458 repo_add_helix(repo, rfp, 0);
2465 pool_debug(pool, SOLV_ERROR, "testcase_read: unknown repo type for repo '%s'\n", repo->name);
2469 else if (!strcmp(pieces[0], "system") && npieces >= 3)
2473 /* must set the disttype before the arch */
2475 if (strcmp(pieces[2], "*") != 0)
2477 char *dp = pieces[2];
2480 char *dpe = strchr(dp, ',');
2483 for (i = 0; disttype2str[i].str != 0; i++)
2484 if (!strcmp(disttype2str[i].str, dp))
2488 if (disttype2str[i].str)
2490 #ifdef MULTI_SEMANTICS
2491 if (pool->disttype != disttype2str[i].type)
2492 pool_setdisttype(pool, disttype2str[i].type);
2494 if (pool->disttype == disttype2str[i].type)
2501 pool_debug(pool, SOLV_ERROR, "testcase_read: system: could not change disttype to '%s'\n", pieces[2]);
2502 missing_features = 1;
2505 if (strcmp(pieces[1], "unset") == 0)
2506 pool_setarch(pool, 0);
2507 else if (pieces[1][0] == ':')
2508 pool_setarchpolicy(pool, pieces[1] + 1);
2510 pool_setarch(pool, pieces[1]);
2513 Repo *repo = testcase_str2repo(pool, pieces[3]);
2515 pool_debug(pool, SOLV_ERROR, "testcase_read: system: unknown repo '%s'\n", pieces[3]);
2517 pool_set_installed(pool, repo);
2520 else if (!strcmp(pieces[0], "job") && npieces > 1)
2526 pool_addfileprovides(pool);
2527 pool_createwhatprovides(pool);
2530 if (npieces >= 3 && !strcmp(pieces[2], "selection"))
2532 addselectionjob(pool, pieces + 1, npieces - 1, job);
2536 for (sp = pieces[1]; sp < pieces[npieces - 1]; sp++)
2539 how = testcase_str2job(pool, pieces[1], &what);
2540 if (how >= 0 && job)
2541 queue_push2(job, how, what);
2543 else if (!strcmp(pieces[0], "vendorclass") && npieces > 1)
2545 pool_addvendorclass(pool, (const char **)(pieces + 1));
2547 else if (!strcmp(pieces[0], "namespace") && npieces > 1)
2549 int i = strlen(pieces[1]);
2550 s = strchr(pieces[1], '(');
2551 if (!s && pieces[1][i - 1] != ')')
2553 pool_debug(pool, SOLV_ERROR, "testcase_read: bad namespace '%s'\n", pieces[1]);
2561 pieces[1][i - 1] = 0;
2562 name = pool_str2id(pool, pieces[1], 1);
2563 evr = pool_str2id(pool, s + 1, 1);
2565 pieces[1][i - 1] = ')';
2566 id = pool_rel2id(pool, name, evr, REL_NAMESPACE, 1);
2567 for (i = 2; i < npieces; i++)
2568 queue_push(&q, testcase_str2solvid(pool, pieces[i]));
2569 /* now do the callback */
2572 pool_addfileprovides(pool);
2573 pool_createwhatprovides(pool);
2576 pool->whatprovides_rel[GETRELID(id)] = pool_queuetowhatprovides(pool, &q);
2580 else if (!strcmp(pieces[0], "poolflags"))
2583 if (!poolflagsreset)
2586 testcase_resetpoolflags(pool); /* hmm */
2588 for (i = 1; i < npieces; i++)
2589 testcase_setpoolflags(pool, pieces[i]);
2591 else if (!strcmp(pieces[0], "solverflags") && npieces > 1)
2596 solv = solver_create(pool);
2597 testcase_resetsolverflags(solv);
2599 for (i = 1; i < npieces; i++)
2600 testcase_setsolverflags(solv, pieces[i]);
2602 else if (!strcmp(pieces[0], "result") && npieces > 1)
2605 int resultflags = str2resultflags(pool, pieces[1]);
2609 rdata = pool_tmpjoin(pool, testcasedir, pieces[2], 0);
2610 if (!strcmp(pieces[2], "<inline>"))
2611 result = read_inline_file(fp, &buf, &bufp, &bufl);
2614 FILE *rfp = fopen(rdata, "r");
2616 pool_debug(pool, SOLV_ERROR, "testcase_read: could not open '%s'\n", rdata);
2619 result = read_file(rfp);
2629 *resultflagsp = resultflags;
2631 else if (!strcmp(pieces[0], "nextjob") && npieces == 1)
2635 else if (!strcmp(pieces[0], "disable") && npieces == 3)
2638 if (strcmp(pieces[1], "pkg"))
2640 pool_debug(pool, SOLV_ERROR, "testcase_read: bad disable type '%s'\n", pieces[1]);
2644 pool_createwhatprovides(pool);
2646 if (!pool->considered)
2648 pool->considered = solv_calloc(1, sizeof(Map));
2649 map_init(pool->considered, pool->nsolvables);
2650 map_setall(pool->considered);
2652 p = testcase_str2solvid(pool, pieces[2]);
2654 MAPCLR(pool->considered, p);
2656 pool_debug(pool, SOLV_ERROR, "disable: unknown package '%s'\n", pieces[2]);
2658 else if (!strcmp(pieces[0], "feature"))
2661 for (i = 1; i < npieces; i++)
2663 for (j = 0; features[j]; j++)
2664 if (!strcmp(pieces[i], features[j]))
2668 pool_debug(pool, SOLV_ERROR, "testcase_read: missing feature '%s'\n", pieces[i]);
2672 if (missing_features)
2675 else if (!strcmp(pieces[0], "genid") && npieces > 1)
2682 for (sp = pieces[2]; sp < pieces[npieces - 1]; sp++)
2686 genid = solv_extend(genid, ngenid, 1, sizeof(*genid), 7);
2687 if (!strcmp(pieces[1], "op") && npieces > 2)
2690 for (op = oplist; op->flags; op++)
2691 if (!strncmp(pieces[2], op->opname, strlen(op->opname)))
2695 pool_debug(pool, SOLV_ERROR, "testcase_read: genid: unknown op '%s'\n", pieces[2]);
2700 pool_debug(pool, SOLV_ERROR, "testcase_read: genid: out of stack\n");
2704 id = pool_rel2id(pool, genid[ngenid] , genid[ngenid + 1], op->flags, 1);
2706 else if (!strcmp(pieces[1], "lit"))
2707 id = pool_str2id(pool, npieces > 2 ? pieces[2] : "", 1);
2708 else if (!strcmp(pieces[1], "null"))
2710 else if (!strcmp(pieces[1], "dep"))
2711 id = testcase_str2dep(pool, pieces[2]);
2714 pool_debug(pool, SOLV_ERROR, "testcase_read: genid: unknown command '%s'\n", pieces[1]);
2717 genid[ngenid++] = id;
2721 pool_debug(pool, SOLV_ERROR, "testcase_read: cannot parse command '%s'\n", pieces[0]);
2724 while (job && ngenid > 0)
2725 queue_push2(job, SOLVER_NOOP | SOLVER_SOLVABLE_PROVIDES, genid[--ngenid]);
2726 genid = solv_free(genid);
2727 buf = solv_free(buf);
2728 pieces = solv_free(pieces);
2729 solv_free(testcasedir);
2732 pool_addfileprovides(pool);
2733 pool_createwhatprovides(pool);
2737 solv = solver_create(pool);
2738 testcase_resetsolverflags(solv);
2742 if (missing_features)
2747 *resultflagsp = 77; /* hack for testsolv */
2753 testcase_resultdiff(char *result1, char *result2)
2755 Strqueue sq1, sq2, osq;
2757 strqueue_init(&sq1);
2758 strqueue_init(&sq2);
2759 strqueue_init(&osq);
2760 strqueue_split(&sq1, result1);
2761 strqueue_split(&sq2, result2);
2762 strqueue_sort(&sq1);
2763 strqueue_sort(&sq2);
2764 strqueue_diff(&sq1, &sq2, &osq);
2765 r = osq.nstr ? strqueue_join(&osq) : 0;
2766 strqueue_free(&sq1);
2767 strqueue_free(&sq2);
2768 strqueue_free(&osq);