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>" },
381 { REL_ELSE, "<ELSE>" },
387 testcase_dep2str_complex(Pool *pool, Id id, int addparens)
396 return testcase_id2str(pool, id, 1);
397 rd = GETRELDEP(pool, id);
399 /* check for special shortcuts */
400 if (rd->flags == REL_NAMESPACE && !ISRELDEP(rd->name) && !strncmp(pool_id2str(pool, rd->name), "namespace:", 10))
402 const char *ns = pool_id2str(pool, rd->name);
403 int nslen = strlen(ns);
404 /* special namespace formatting */
405 const char *evrs = testcase_dep2str_complex(pool, rd->evr, 0);
406 s = pool_tmpappend(pool, evrs, ns, "()");
407 memmove(s + nslen + 1, s, strlen(s) - nslen - 2);
408 memcpy(s, ns, nslen);
412 if (rd->flags == REL_MULTIARCH && !ISRELDEP(rd->name) && rd->evr == ARCH_ANY)
414 /* special :any suffix */
415 const char *ns = testcase_id2str(pool, rd->name, 1);
416 return pool_tmpappend(pool, ns, ":any", 0);
420 if (ISRELDEP(rd->name))
422 Reldep *rd2 = GETRELDEP(pool, rd->name);
424 if (rd->flags > 7 && rd->flags != REL_COMPAT && rd2->flags && rd2->flags <= 7)
427 s = (char *)testcase_dep2str_complex(pool, rd->name, needparens);
431 s = pool_tmpappend(pool, s, "(", 0);
432 memmove(s + 1, s, strlen(s + 1));
435 for (op = oplist; op->flags; op++)
436 if (rd->flags == op->flags)
440 s = pool_tmpappend(pool, s, " ", op->opname);
441 s = pool_tmpappend(pool, s, " ", 0);
446 sprintf(buf, " <%u> ", rd->flags);
447 s = pool_tmpappend(pool, s, buf, 0);
451 if (ISRELDEP(rd->evr))
453 Reldep *rd2 = GETRELDEP(pool, rd->evr);
455 if (rd->flags > 7 && rd2->flags && rd2->flags <= 7)
457 if (rd->flags == REL_AND && rd2->flags == REL_AND)
458 needparens = 0; /* chain */
459 if (rd->flags == REL_OR && rd2->flags == REL_OR)
460 needparens = 0; /* chain */
461 if (rd->flags > 0 && rd->flags < 8 && rd2->flags == REL_COMPAT)
462 needparens = 0; /* chain */
464 if (!ISRELDEP(rd->evr))
465 s2 = testcase_id2str(pool, rd->evr, 0);
467 s2 = testcase_dep2str_complex(pool, rd->evr, needparens);
469 s = pool_tmpappend(pool, s, s2, ")");
471 s = pool_tmpappend(pool, s, s2, 0);
472 pool_freetmpspace(pool, s2);
477 testcase_dep2str(Pool *pool, Id id)
479 return testcase_dep2str_complex(pool, id, 0);
483 /* Convert a simple string. Also handle the :any suffix */
485 testcase_str2dep_simple(Pool *pool, const char **sp, int isname)
492 for (s = *sp; *s; s++)
496 if (*s == ' ' || *(unsigned char *)s < 32)
500 if (*s == ')' && paren-- <= 0)
503 if (isname && s - *sp > 4 && !strncmp(s - 4, ":any", 4))
510 if (s - *sp == 6 && !strncmp(*sp, "<NULL>", 6))
513 id = pool_strn2id(pool, *sp, s - *sp, 1);
515 else if (s - *sp == 3 && !strncmp(*sp, "\\00", 3))
519 char buf[128], *bp, *bp2;
521 bp = s - *sp >= 128 ? solv_malloc(s - *sp + 1) : buf;
522 for (bp2 = bp, sp2 = *sp; sp2 < s;)
526 solv_hex2bin(&sp2, (unsigned char *)bp2 - 1, 1);
529 id = pool_str2id(pool, bp, 1);
535 id = pool_rel2id(pool, id, ARCH_ANY, REL_MULTIARCH, 1);
544 testcase_str2dep_complex(Pool *pool, const char **sp, int relop)
547 Id flags, id, id2, namespaceid = 0;
550 while (*s == ' ' || *s == '\t')
552 if (!strncmp(s, "namespace:", 10))
554 /* special namespace hack */
556 for (s2 = s + 10; *s2 && *s2 != '('; s2++)
560 namespaceid = pool_strn2id(pool, s, s2 - s, 1);
567 id = testcase_str2dep_complex(pool, &s, 0);
576 id = testcase_str2dep_simple(pool, &s, relop ? 0 : 1);
578 id = pool_rel2id(pool, namespaceid, id, REL_NAMESPACE, 1);
582 while (*s == ' ' || *s == '\t')
584 if (!*s || *s == ')' || (relop && strncmp(s, "compat >= ", 10) != 0))
590 /* we have an op! Find the end */
592 if (s[0] == '<' && (s[1] >= '0' && s[1] <= '9'))
595 for (s2 = s + 1; *s2 >= '0' && *s2 <= '9'; s2++)
599 flags = strtoul(s + 1, 0, 10);
605 for (op = oplist; op->flags; op++)
606 if (!strncmp(s, op->opname, strlen(op->opname)))
614 s += strlen(op->opname);
616 id2 = testcase_str2dep_complex(pool, &s, flags > 0 && flags < 8);
622 id = pool_rel2id(pool, id, id2, flags, 1);
627 testcase_str2dep(Pool *pool, const char *s)
629 Id id = testcase_str2dep_complex(pool, &s, 0);
630 return s && !*s ? id : 0;
633 /**********************************************************/
636 testcase_repoid2str(Pool *pool, Id repoid)
638 Repo *repo = pool_id2repo(pool, repoid);
641 char *r = pool_tmpjoin(pool, repo->name, 0, 0);
643 for (rp = r; *rp; rp++)
644 if (*rp == ' ' || *rp == '\t')
651 sprintf(buf, "#%d", repoid);
652 return pool_tmpjoin(pool, buf, 0, 0);
657 testcase_solvid2str(Pool *pool, Id p)
659 Solvable *s = pool->solvables + p;
660 const char *n, *e, *a;
663 if (p == SYSTEMSOLVABLE)
665 n = pool_id2str(pool, s->name);
666 e = pool_id2str(pool, s->evr);
667 a = pool_id2str(pool, s->arch);
668 str = pool_alloctmpspace(pool, strlen(n) + strlen(e) + strlen(a) + 3);
669 sprintf(str, "%s-%s.%s", n, e, a);
671 return pool_tmpappend(pool, str, "@", 0);
675 char *str2 = pool_tmpappend(pool, str, "@", s->repo->name);
677 if (str2[l] == ' ' || str2[l] == '\t')
681 sprintf(buf, "@#%d", s->repo->repoid);
682 return pool_tmpappend(pool, str, buf, 0);
686 testcase_str2repo(Pool *pool, const char *str)
690 if (str[0] == '#' && (str[1] >= '0' && str[1] <= '9'))
694 for (j = 1; str[j] >= '0' && str[j] <= '9'; j++)
695 repoid = repoid * 10 + (str[j] - '0');
696 if (!str[j] && repoid > 0 && repoid < pool->nrepos)
697 repo = pool_id2repo(pool, repoid);
701 FOR_REPOS(repoid, repo)
706 l = strlen(repo->name);
707 for (i = 0; i < l; i++)
709 int c = repo->name[i];
710 if (c == ' ' || c == '\t')
715 if (i == l && !str[l])
718 if (repoid >= pool->nrepos)
725 testcase_str2solvid(Pool *pool, const char *str)
727 int i, l = strlen(str);
734 if (*str == '@' && !strcmp(str, "@SYSTEM"))
735 return SYSTEMSOLVABLE;
737 for (i = l - 1; i >= 0; i--)
738 if (str[i] == '@' && (repo = testcase_str2repo(pool, str + i + 1)) != 0)
743 /* now find the arch (if present) */
745 for (i = repostart - 1; i > 0; i--)
748 arch = pool_strn2id(pool, str + i + 1, repostart - (i + 1), 0);
753 /* now find the name */
754 for (i = repostart - 1; i > 0; i--)
758 Id nid, evrid, p, pp;
759 nid = pool_strn2id(pool, str, i, 0);
762 evrid = pool_strn2id(pool, str + i + 1, repostart - (i + 1), 0);
765 FOR_PROVIDES(p, pp, nid)
767 Solvable *s = pool->solvables + p;
768 if (s->name != nid || s->evr != evrid)
770 if (repo && s->repo != repo)
772 if (arch && s->arch != arch)
782 testcase_job2str(Pool *pool, Id how, Id what)
789 Id select = how & SOLVER_SELECTMASK;
791 for (i = 0; job2str[i].str; i++)
792 if ((how & SOLVER_JOBMASK) == job2str[i].job)
794 jobstr = job2str[i].str ? job2str[i].str : "unknown";
795 if (select == SOLVER_SOLVABLE)
798 pkgstr = testcase_solvid2str(pool, what);
800 else if (select == SOLVER_SOLVABLE_NAME)
803 pkgstr = testcase_dep2str(pool, what);
805 else if (select == SOLVER_SOLVABLE_PROVIDES)
807 selstr = " provides ";
808 pkgstr = testcase_dep2str(pool, what);
810 else if (select == SOLVER_SOLVABLE_ONE_OF)
815 while ((p = pool->whatprovidesdata[what++]) != 0)
817 const char *s = testcase_solvid2str(pool, p);
820 pkgstr = pool_tmpappend(pool, pkgstr, " ", s);
821 pool_freetmpspace(pool, s);
829 else if (select == SOLVER_SOLVABLE_REPO)
831 Repo *repo = pool_id2repo(pool, what);
836 sprintf(buf, "#%d", repo->repoid);
837 pkgstr = pool_tmpjoin(pool, buf, 0, 0);
840 pkgstr = pool_tmpjoin(pool, repo->name, 0, 0);
842 else if (select == SOLVER_SOLVABLE_ALL)
849 selstr = " unknown ";
852 ret = pool_tmpjoin(pool, jobstr, selstr, pkgstr);
854 ret = pool_tmpappend(pool, ret, " ", 0);
855 for (i = 0; jobflags2str[i].str; i++)
856 if ((how & jobflags2str[i].flag) != 0)
857 ret = pool_tmpappend(pool, ret, ",", jobflags2str[i].str);
863 ret = pool_tmpappend(pool, ret, "]", 0);
869 str2selflags(Pool *pool, char *s) /* modifies the string! */
874 char *se = strchr(s, ',');
877 for (i = 0; selflags2str[i].str; i++)
878 if (!strcmp(s, selflags2str[i].str))
880 selflags |= selflags2str[i].flag;
883 if (!selflags2str[i].str)
884 pool_debug(pool, SOLV_ERROR, "str2job: unknown selection flag '%s'\n", s);
891 str2jobflags(Pool *pool, char *s) /* modifies the string */
896 char *se = strchr(s, ',');
899 for (i = 0; jobflags2str[i].str; i++)
900 if (!strcmp(s, jobflags2str[i].str))
902 jobflags |= jobflags2str[i].flag;
905 if (!jobflags2str[i].str)
906 pool_debug(pool, SOLV_ERROR, "str2job: unknown job flag '%s'\n", s);
913 testcase_str2job(Pool *pool, const char *str, Id *whatp)
923 /* so we can patch it */
924 s = pool_tmpjoin(pool, str, 0, 0);
925 /* split it in pieces */
928 while (*s == ' ' || *s == '\t')
932 pieces = solv_extend(pieces, npieces, 1, sizeof(*pieces), 7);
933 pieces[npieces++] = s;
934 while (*s && *s != ' ' && *s != '\t')
941 pool_debug(pool, SOLV_ERROR, "str2job: bad line '%s'\n", str);
946 for (i = 0; job2str[i].str; i++)
947 if (!strcmp(pieces[0], job2str[i].str))
951 pool_debug(pool, SOLV_ERROR, "str2job: unknown job '%s'\n", str);
955 job = job2str[i].job;
959 char *flags = pieces[npieces - 1];
960 if (*flags == '[' && flags[strlen(flags) - 1] == ']')
964 flags[strlen(flags) - 1] = 0;
965 job |= str2jobflags(pool, flags);
968 if (!strcmp(pieces[1], "pkg"))
972 pool_debug(pool, SOLV_ERROR, "str2job: bad pkg selector in '%s'\n", str);
976 job |= SOLVER_SOLVABLE;
977 what = testcase_str2solvid(pool, pieces[2]);
980 pool_debug(pool, SOLV_ERROR, "str2job: unknown package '%s'\n", pieces[2]);
985 else if (!strcmp(pieces[1], "name") || !strcmp(pieces[1], "provides"))
987 /* join em again for dep2str... */
989 for (sp = pieces[2]; sp < pieces[npieces - 1]; sp++)
993 if (pieces[1][0] == 'p' && strncmp(pieces[2], "namespace:", 10) == 0)
995 char *spe = strchr(pieces[2], '(');
996 int l = strlen(pieces[2]);
997 if (spe && pieces[2][l - 1] == ')')
999 /* special namespace provides */
1000 if (strcmp(spe, "(<NULL>)") != 0)
1002 pieces[2][l - 1] = 0;
1003 what = testcase_str2dep(pool, spe + 1);
1004 pieces[2][l - 1] = ')';
1006 what = pool_rel2id(pool, pool_strn2id(pool, pieces[2], spe - pieces[2], 1), what, REL_NAMESPACE, 1);
1010 what = testcase_str2dep(pool, pieces[2]);
1011 if (pieces[1][0] == 'n')
1012 job |= SOLVER_SOLVABLE_NAME;
1014 job |= SOLVER_SOLVABLE_PROVIDES;
1016 else if (!strcmp(pieces[1], "oneof"))
1019 job |= SOLVER_SOLVABLE_ONE_OF;
1021 if (npieces > 3 && strcmp(pieces[2], "nothing") != 0)
1023 for (i = 2; i < npieces; i++)
1025 Id p = testcase_str2solvid(pool, pieces[i]);
1028 pool_debug(pool, SOLV_ERROR, "str2job: unknown package '%s'\n", pieces[i]);
1036 what = pool_queuetowhatprovides(pool, &q);
1039 else if (!strcmp(pieces[1], "repo"))
1044 pool_debug(pool, SOLV_ERROR, "str2job: bad line '%s'\n", str);
1048 repo = testcase_str2repo(pool, pieces[2]);
1051 pool_debug(pool, SOLV_ERROR, "str2job: unknown repo '%s'\n", pieces[2]);
1055 job |= SOLVER_SOLVABLE_REPO;
1056 what = repo->repoid;
1058 else if (!strcmp(pieces[1], "all"))
1060 if (npieces != 3 && strcmp(pieces[2], "packages") != 0)
1062 pool_debug(pool, SOLV_ERROR, "str2job: bad line '%s'\n", str);
1066 job |= SOLVER_SOLVABLE_ALL;
1071 pool_debug(pool, SOLV_ERROR, "str2job: unknown selection in '%s'\n", str);
1081 addselectionjob(Pool *pool, char **pieces, int npieces, Queue *jobqueue)
1088 for (i = 0; job2str[i].str; i++)
1089 if (!strcmp(pieces[0], job2str[i].str))
1091 if (!job2str[i].str)
1093 pool_debug(pool, SOLV_ERROR, "selstr2job: unknown job '%s'\n", pieces[0]);
1096 job = job2str[i].job;
1099 char *flags = pieces[npieces - 1];
1100 if (*flags == '[' && flags[strlen(flags) - 1] == ']')
1104 flags[strlen(flags) - 1] = 0;
1105 job |= str2jobflags(pool, flags);
1110 pool_debug(pool, SOLV_ERROR, "selstr2job: no selection flags\n");
1113 selflags = str2selflags(pool, pieces[3]);
1115 r = selection_make(pool, &sel, pieces[2], selflags);
1116 for (i = 0; i < sel.count; i += 2)
1117 queue_push2(jobqueue, job | sel.elements[i], sel.elements[i + 1]);
1123 writedeps(Repo *repo, FILE *fp, const char *tag, Id key, Solvable *s, Offset off)
1125 Pool *pool = repo->pool;
1132 dp = repo->idarraydata + off;
1133 while ((id = *dp++) != 0)
1135 if (key == SOLVABLE_REQUIRES && id == SOLVABLE_PREREQMARKER)
1138 fprintf(fp, "-%s\n", tag);
1143 if (key == SOLVABLE_PROVIDES && id == SOLVABLE_FILEMARKER)
1145 idstr = testcase_dep2str(pool, id);
1148 fprintf(fp, "+%s\n", tag);
1151 fprintf(fp, "%s\n", idstr);
1154 fprintf(fp, "-%s\n", tag);
1158 writefilelist(Repo *repo, FILE *fp, const char *tag, Solvable *s)
1160 Pool *pool = repo->pool;
1164 dataiterator_init(&di, pool, repo, s - pool->solvables, SOLVABLE_FILELIST, 0, 0);
1165 while (dataiterator_step(&di))
1167 const char *s = repodata_dir2str(di.data, di.kv.id, di.kv.str);
1170 fprintf(fp, "+%s\n", tag);
1173 fprintf(fp, "%s\n", s);
1176 fprintf(fp, "-%s\n", tag);
1177 dataiterator_free(&di);
1181 testcase_write_testtags(Repo *repo, FILE *fp)
1183 Pool *pool = repo->pool;
1189 const char *release;
1193 fprintf(fp, "=Ver: 3.0\n");
1194 FOR_REPO_SOLVABLES(repo, p, s)
1196 name = pool_id2str(pool, s->name);
1197 evr = pool_id2str(pool, s->evr);
1198 arch = pool_id2str(pool, s->arch);
1199 release = strrchr(evr, '-');
1201 release = evr + strlen(evr);
1202 fprintf(fp, "=Pkg: %s %.*s %s %s\n", name, (int)(release - evr), evr, *release && release[1] ? release + 1 : "-", arch);
1203 tmp = solvable_lookup_str(s, SOLVABLE_SUMMARY);
1205 fprintf(fp, "=Sum: %s\n", tmp);
1206 writedeps(repo, fp, "Req:", SOLVABLE_REQUIRES, s, s->requires);
1207 writedeps(repo, fp, "Prv:", SOLVABLE_PROVIDES, s, s->provides);
1208 writedeps(repo, fp, "Obs:", SOLVABLE_OBSOLETES, s, s->obsoletes);
1209 writedeps(repo, fp, "Con:", SOLVABLE_CONFLICTS, s, s->conflicts);
1210 writedeps(repo, fp, "Rec:", SOLVABLE_RECOMMENDS, s, s->recommends);
1211 writedeps(repo, fp, "Sup:", SOLVABLE_SUPPLEMENTS, s, s->supplements);
1212 writedeps(repo, fp, "Sug:", SOLVABLE_SUGGESTS, s, s->suggests);
1213 writedeps(repo, fp, "Enh:", SOLVABLE_ENHANCES, s, s->enhances);
1215 fprintf(fp, "=Vnd: %s\n", pool_id2str(pool, s->vendor));
1216 ti = solvable_lookup_num(s, SOLVABLE_BUILDTIME, 0);
1218 fprintf(fp, "=Tim: %u\n", ti);
1219 writefilelist(repo, fp, "Fls:", s);
1224 static inline Offset
1225 adddep(Repo *repo, Offset olddeps, char *str, Id marker)
1227 Id id = *str == '/' ? pool_str2id(repo->pool, str, 1) : testcase_str2dep(repo->pool, str);
1228 return repo_addid_dep(repo, olddeps, id, marker);
1232 finish_v2_solvable(Pool *pool, Repodata *data, Solvable *s, char *filelist, int nfilelist)
1238 for (l = 0; l < nfilelist; l += strlen(filelist + l) + 1)
1240 char *p = strrchr(filelist + l, '/');
1244 did = repodata_str2dir(data, filelist + l, 1);
1247 did = repodata_str2dir(data, "/", 1);
1248 repodata_add_dirstr(data, s - pool->solvables, SOLVABLE_FILELIST, did, p);
1251 s->supplements = repo_fix_supplements(s->repo, s->provides, s->supplements, 0);
1252 s->conflicts = repo_fix_conflicts(s->repo, s->conflicts);
1255 /* stripped down version of susetags parser used for testcases */
1257 testcase_add_testtags(Repo *repo, FILE *fp, int flags)
1259 Pool *pool = repo->pool;
1271 int tagsversion = 0;
1272 int addselfprovides = 1; /* for compat reasons */
1274 data = repo_add_repodata(repo, flags);
1279 line = solv_malloc(aline);
1283 if (linep - line + 16 > aline)
1285 aline = linep - line;
1286 line = solv_realloc(line, aline + 512);
1287 linep = line + aline;
1290 if (!fgets(linep, aline - (linep - line), fp))
1292 linep += strlen(linep);
1293 if (linep == line || linep[-1] != '\n')
1296 linep = line + intag;
1299 if (line[intag] == '-' && !strncmp(line + 1, line + intag + 1, intag - 2))
1306 else if (line[0] == '+' && line[1] && line[1] != ':')
1308 char *tagend = strchr(line, ':');
1313 intag = tagend + 2 - line;
1314 linep = line + intag;
1317 if (*line != '=' || !line[1] || !line[2] || !line[3] || line[4] != ':')
1319 tag = line[1] << 16 | line[2] << 8 | line[3];
1322 case 'V' << 16 | 'e' << 8 | 'r':
1323 tagsversion = atoi(line + 6);
1324 addselfprovides = tagsversion < 3 || strstr(line + 6, "addselfprovides") != 0;
1326 case 'P' << 16 | 'k' << 8 | 'g':
1329 if (tagsversion == 2)
1330 finish_v2_solvable(pool, data, s, filelist, nfilelist);
1331 if (addselfprovides && s->name && s->arch != ARCH_SRC && s->arch != ARCH_NOSRC)
1332 s->provides = repo_addid_dep(s->repo, s->provides, pool_rel2id(pool, s->name, s->evr, REL_EQ, 1), 0);
1335 if (split(line + 5, sp, 5) != 4)
1337 s = pool_id2solvable(pool, repo_add_solvable(repo));
1338 s->name = pool_str2id(pool, sp[0], 1);
1339 /* join back version and release */
1340 if (sp[2] && !(sp[2][0] == '-' && !sp[2][1]))
1342 s->evr = makeevr(pool, sp[1]);
1343 s->arch = pool_str2id(pool, sp[3], 1);
1345 case 'S' << 16 | 'u' << 8 | 'm':
1346 repodata_set_str(data, s - pool->solvables, SOLVABLE_SUMMARY, line + 6);
1348 case 'V' << 16 | 'n' << 8 | 'd':
1349 s->vendor = pool_str2id(pool, line + 6, 1);
1351 case 'T' << 16 | 'i' << 8 | 'm':
1354 repodata_set_num(data, s - pool->solvables, SOLVABLE_BUILDTIME, t);
1356 case 'R' << 16 | 'e' << 8 | 'q':
1357 s->requires = adddep(repo, s->requires, line + 6, -SOLVABLE_PREREQMARKER);
1359 case 'P' << 16 | 'r' << 8 | 'q':
1360 s->requires = adddep(repo, s->requires, line + 6, SOLVABLE_PREREQMARKER);
1362 case 'P' << 16 | 'r' << 8 | 'v':
1363 /* version 2 had the file list at the end of the provides */
1364 if (tagsversion == 2)
1368 int l = strlen(line + 6) + 1;
1369 if (nfilelist + l > afilelist)
1371 afilelist = nfilelist + l + 512;
1372 filelist = solv_realloc(filelist, afilelist);
1374 memcpy(filelist + nfilelist, line + 6, l);
1381 for (l = 0; l < nfilelist; l += strlen(filelist + l) + 1)
1382 s->provides = repo_addid_dep(repo, s->provides, pool_str2id(pool, filelist + l, 1), 0);
1386 s->provides = adddep(repo, s->provides, line + 6, 0);
1388 case 'F' << 16 | 'l' << 8 | 's':
1390 char *p = strrchr(line + 6, '/');
1395 did = repodata_str2dir(data, line + 6, 1);
1397 did = repodata_str2dir(data, "/", 1);
1398 repodata_add_dirstr(data, s - pool->solvables, SOLVABLE_FILELIST, did, p);
1401 case 'O' << 16 | 'b' << 8 | 's':
1402 s->obsoletes = adddep(repo, s->obsoletes, line + 6, 0);
1404 case 'C' << 16 | 'o' << 8 | 'n':
1405 s->conflicts = adddep(repo, s->conflicts, line + 6, 0);
1407 case 'R' << 16 | 'e' << 8 | 'c':
1408 s->recommends = adddep(repo, s->recommends, line + 6, 0);
1410 case 'S' << 16 | 'u' << 8 | 'p':
1411 s->supplements = adddep(repo, s->supplements, line + 6, 0);
1413 case 'S' << 16 | 'u' << 8 | 'g':
1414 s->suggests = adddep(repo, s->suggests, line + 6, 0);
1416 case 'E' << 16 | 'n' << 8 | 'h':
1417 s->enhances = adddep(repo, s->enhances, line + 6, 0);
1425 if (tagsversion == 2)
1426 finish_v2_solvable(pool, data, s, filelist, nfilelist);
1427 if (addselfprovides && s->name && s->arch != ARCH_SRC && s->arch != ARCH_NOSRC)
1428 s->provides = repo_addid_dep(s->repo, s->provides, pool_rel2id(pool, s->name, s->evr, REL_EQ, 1), 0);
1431 solv_free(filelist);
1432 repodata_free_dircache(data);
1433 if (!(flags & REPO_NO_INTERNALIZE))
1434 repodata_internalize(data);
1439 testcase_getpoolflags(Pool *pool)
1441 const char *str = 0;
1443 for (i = 0; poolflags2str[i].str; i++)
1445 v = pool_get_flag(pool, poolflags2str[i].flag);
1446 if (v == poolflags2str[i].def)
1448 str = pool_tmpappend(pool, str, v ? " " : " !", poolflags2str[i].str);
1450 return str ? str + 1 : "";
1454 testcase_setpoolflags(Pool *pool, const char *str)
1456 const char *p = str, *s;
1460 while (*p == ' ' || *p == '\t' || *p == ',')
1471 while (*p && *p != ' ' && *p != '\t' && *p != ',')
1473 for (i = 0; poolflags2str[i].str; i++)
1474 if (!strncmp(poolflags2str[i].str, s, p - s) && poolflags2str[i].str[p - s] == 0)
1476 if (!poolflags2str[i].str)
1478 pool_debug(pool, SOLV_ERROR, "setpoolflags: unknown flag '%.*s'\n", (int)(p - s), s);
1481 pool_set_flag(pool, poolflags2str[i].flag, v);
1487 testcase_resetpoolflags(Pool *pool)
1490 for (i = 0; poolflags2str[i].str; i++)
1491 pool_set_flag(pool, poolflags2str[i].flag, poolflags2str[i].def);
1495 testcase_getsolverflags(Solver *solv)
1497 Pool *pool = solv->pool;
1498 const char *str = 0;
1500 for (i = 0; solverflags2str[i].str; i++)
1502 v = solver_get_flag(solv, solverflags2str[i].flag);
1503 if (v == solverflags2str[i].def)
1505 str = pool_tmpappend(pool, str, v ? " " : " !", solverflags2str[i].str);
1507 return str ? str + 1 : "";
1511 testcase_setsolverflags(Solver *solv, const char *str)
1513 const char *p = str, *s;
1517 while (*p == ' ' || *p == '\t' || *p == ',')
1528 while (*p && *p != ' ' && *p != '\t' && *p != ',')
1530 for (i = 0; solverflags2str[i].str; i++)
1531 if (!strncmp(solverflags2str[i].str, s, p - s) && solverflags2str[i].str[p - s] == 0)
1533 if (!solverflags2str[i].str)
1535 pool_debug(solv->pool, SOLV_ERROR, "setsolverflags: unknown flag '%.*s'\n", (int)(p - s), s);
1538 solver_set_flag(solv, solverflags2str[i].flag, v);
1544 testcase_resetsolverflags(Solver *solv)
1547 for (i = 0; solverflags2str[i].str; i++)
1548 solver_set_flag(solv, solverflags2str[i].flag, solverflags2str[i].def);
1552 testcase_ruleid(Solver *solv, Id rid)
1558 const unsigned char *md5;
1564 solver_ruleliterals(solv, rid, &q);
1565 for (i = 0; i < q.count; i++)
1567 Id p = q.elements[i];
1568 s = testcase_solvid2str(solv->pool, p > 0 ? p : -p);
1570 s = pool_tmpjoin(solv->pool, "!", s, 0);
1571 strqueue_push(&sq, s);
1574 strqueue_sort_u(&sq);
1575 chk = solv_chksum_create(REPOKEY_TYPE_MD5);
1576 for (i = 0; i < sq.nstr; i++)
1577 solv_chksum_add(chk, sq.str[i], strlen(sq.str[i]) + 1);
1578 md5 = solv_chksum_get(chk, &md5l);
1579 s = pool_bin2hex(solv->pool, md5, md5l);
1580 chk = solv_chksum_free(chk, 0);
1586 testcase_problemid(Solver *solv, Id problem)
1591 const unsigned char *md5;
1595 /* we build a hash of all rules that define the problem */
1598 solver_findallproblemrules(solv, problem, &q);
1599 for (i = 0; i < q.count; i++)
1600 strqueue_push(&sq, testcase_ruleid(solv, q.elements[i]));
1602 strqueue_sort_u(&sq);
1603 chk = solv_chksum_create(REPOKEY_TYPE_MD5);
1604 for (i = 0; i < sq.nstr; i++)
1605 solv_chksum_add(chk, sq.str[i], strlen(sq.str[i]) + 1);
1606 md5 = solv_chksum_get(chk, &md5l);
1607 s = pool_bin2hex(solv->pool, md5, 4);
1608 chk = solv_chksum_free(chk, 0);
1614 testcase_solutionid(Solver *solv, Id problem, Id solution)
1618 const unsigned char *md5;
1622 intid = solver_solutionelement_internalid(solv, problem, solution);
1623 /* internal stuff! handle with care! */
1627 s = testcase_job2str(solv->pool, solv->job.elements[-intid - 1], solv->job.elements[-intid]);
1632 s = testcase_ruleid(solv, intid);
1634 chk = solv_chksum_create(REPOKEY_TYPE_MD5);
1635 solv_chksum_add(chk, s, strlen(s) + 1);
1636 md5 = solv_chksum_get(chk, &md5l);
1637 s = pool_bin2hex(solv->pool, md5, 4);
1638 chk = solv_chksum_free(chk, 0);
1643 testcase_alternativeid(Solver *solv, int type, Id id, Id from)
1646 Pool *pool = solv->pool;
1648 const unsigned char *md5;
1650 chk = solv_chksum_create(REPOKEY_TYPE_MD5);
1651 if (type == SOLVER_ALTERNATIVE_TYPE_RECOMMENDS)
1653 s = testcase_solvid2str(pool, from);
1654 solv_chksum_add(chk, s, strlen(s) + 1);
1655 s = testcase_dep2str(pool, id);
1656 solv_chksum_add(chk, s, strlen(s) + 1);
1658 else if (type == SOLVER_ALTERNATIVE_TYPE_RULE)
1660 s = testcase_ruleid(solv, id);
1661 solv_chksum_add(chk, s, strlen(s) + 1);
1663 md5 = solv_chksum_get(chk, &md5l);
1664 s = pool_bin2hex(pool, md5, 4);
1665 chk = solv_chksum_free(chk, 0);
1669 static struct class2str {
1673 { SOLVER_TRANSACTION_ERASE, "erase" },
1674 { SOLVER_TRANSACTION_INSTALL, "install" },
1675 { SOLVER_TRANSACTION_REINSTALLED, "reinstall" },
1676 { SOLVER_TRANSACTION_DOWNGRADED, "downgrade" },
1677 { SOLVER_TRANSACTION_CHANGED, "change" },
1678 { SOLVER_TRANSACTION_UPGRADED, "upgrade" },
1679 { SOLVER_TRANSACTION_OBSOLETED, "obsolete" },
1680 { SOLVER_TRANSACTION_MULTIINSTALL, "multiinstall" },
1681 { SOLVER_TRANSACTION_MULTIREINSTALL, "multireinstall" },
1686 dump_genid(Pool *pool, Strqueue *sq, Id id, int cnt)
1694 Reldep *rd = GETRELDEP(pool, id);
1695 for (op = oplist; op->flags; op++)
1696 if (rd->flags == op->flags)
1698 cnt = dump_genid(pool, sq, rd->name, cnt);
1699 cnt = dump_genid(pool, sq, rd->evr, cnt);
1700 sprintf(cntbuf, "genid %2d: genid ", cnt++);
1701 s = pool_tmpjoin(pool, cntbuf, "op ", op->flags ? op->opname : "unknown");
1705 sprintf(cntbuf, "genid %2d: genid ", cnt++);
1706 s = pool_tmpjoin(pool, cntbuf, id ? "lit " : "null", id ? pool_id2str(pool, id) : 0);
1708 strqueue_push(sq, s);
1713 testcase_solverresult(Solver *solv, int resultflags)
1715 Pool *pool = solv->pool;
1723 if ((resultflags & TESTCASE_RESULT_TRANSACTION) != 0)
1725 Transaction *trans = solver_create_transaction(solv);
1729 for (i = 0; class2str[i].str; i++)
1732 transaction_classify_pkgs(trans, SOLVER_TRANSACTION_KEEP_PSEUDO, class2str[i].class, 0, 0, &q);
1733 for (j = 0; j < q.count; j++)
1737 if (pool->installed && pool->solvables[p].repo == pool->installed)
1738 op = transaction_obs_pkg(trans, p);
1739 s = pool_tmpjoin(pool, class2str[i].str, " ", testcase_solvid2str(pool, p));
1741 s = pool_tmpjoin(pool, s, " ", testcase_solvid2str(pool, op));
1742 strqueue_push(&sq, s);
1746 transaction_free(trans);
1748 if ((resultflags & TESTCASE_RESULT_PROBLEMS) != 0)
1750 char *probprefix, *solprefix;
1751 int problem, solution, element;
1754 pcnt = solver_problem_count(solv);
1755 for (problem = 1; problem <= pcnt; problem++)
1757 Id rid, from, to, dep;
1758 SolverRuleinfo rinfo;
1759 rid = solver_findproblemrule(solv, problem);
1760 s = testcase_problemid(solv, problem);
1761 probprefix = solv_dupjoin("problem ", s, 0);
1762 rinfo = solver_ruleinfo(solv, rid, &from, &to, &dep);
1763 s = pool_tmpjoin(pool, probprefix, " info ", solver_problemruleinfo2str(solv, rinfo, from, to, dep));
1764 strqueue_push(&sq, s);
1765 scnt = solver_solution_count(solv, problem);
1766 for (solution = 1; solution <= scnt; solution++)
1768 s = testcase_solutionid(solv, problem, solution);
1769 solprefix = solv_dupjoin(probprefix, " solution ", s);
1771 while ((element = solver_next_solutionelement(solv, problem, solution, element, &p, &op)) != 0)
1773 if (p == SOLVER_SOLUTION_JOB)
1774 s = pool_tmpjoin(pool, solprefix, " deljob ", testcase_job2str(pool, solv->job.elements[op - 1], solv->job.elements[op]));
1775 else if (p > 0 && op == 0)
1776 s = pool_tmpjoin(pool, solprefix, " erase ", testcase_solvid2str(pool, p));
1777 else if (p > 0 && op > 0)
1779 s = pool_tmpjoin(pool, solprefix, " replace ", testcase_solvid2str(pool, p));
1780 s = pool_tmpappend(pool, s, " ", testcase_solvid2str(pool, op));
1782 else if (p < 0 && op > 0)
1783 s = pool_tmpjoin(pool, solprefix, " allow ", testcase_solvid2str(pool, op));
1785 s = pool_tmpjoin(pool, solprefix, " unknown", 0);
1786 strqueue_push(&sq, s);
1788 solv_free(solprefix);
1790 solv_free(probprefix);
1794 if ((resultflags & TESTCASE_RESULT_ORPHANED) != 0)
1799 solver_get_orphaned(solv, &q);
1800 for (i = 0; i < q.count; i++)
1802 s = pool_tmpjoin(pool, "orphaned ", testcase_solvid2str(pool, q.elements[i]), 0);
1803 strqueue_push(&sq, s);
1808 if ((resultflags & TESTCASE_RESULT_RECOMMENDED) != 0)
1814 solver_get_recommendations(solv, &qr, &qs, 0);
1815 for (i = 0; i < qr.count; i++)
1817 s = pool_tmpjoin(pool, "recommended ", testcase_solvid2str(pool, qr.elements[i]), 0);
1818 strqueue_push(&sq, s);
1820 for (i = 0; i < qs.count; i++)
1822 s = pool_tmpjoin(pool, "suggested ", testcase_solvid2str(pool, qs.elements[i]), 0);
1823 strqueue_push(&sq, s);
1829 if ((resultflags & TESTCASE_RESULT_UNNEEDED) != 0)
1835 solver_get_unneeded(solv, &q, 0);
1836 solver_get_unneeded(solv, &qf, 1);
1837 for (i = j = 0; i < q.count; i++)
1839 /* we rely on qf containing a subset of q in the same order */
1840 if (j < qf.count && q.elements[i] == qf.elements[j])
1842 s = pool_tmpjoin(pool, "unneeded_filtered ", testcase_solvid2str(pool, q.elements[i]), 0);
1846 s = pool_tmpjoin(pool, "unneeded ", testcase_solvid2str(pool, q.elements[i]), 0);
1847 strqueue_push(&sq, s);
1852 if ((resultflags & TESTCASE_RESULT_ALTERNATIVES) != 0)
1860 cnt = solver_alternatives_count(solv);
1861 for (alternative = 1; alternative <= cnt; alternative++)
1863 Id id, from, chosen;
1865 int type = solver_get_alternative(solv, alternative, &id, &from, &chosen, &q, 0);
1866 altprefix = solv_dupjoin("alternative ", testcase_alternativeid(solv, type, id, from), " ");
1868 if (type == SOLVER_ALTERNATIVE_TYPE_RECOMMENDS)
1870 char *s = pool_tmpjoin(pool, altprefix, num, testcase_solvid2str(pool, from));
1871 s = pool_tmpappend(pool, s, " recommends ", testcase_dep2str(pool, id));
1872 strqueue_push(&sq, s);
1874 else if (type == SOLVER_ALTERNATIVE_TYPE_RULE)
1876 /* map choice rules back to pkg rules */
1877 if (solver_ruleclass(solv, id) == SOLVER_RULE_CHOICE)
1878 id = solver_rule2pkgrule(solv, id);
1879 solver_allruleinfos(solv, id, &rq);
1880 for (i = 0; i < rq.count; i += 4)
1882 int rtype = rq.elements[i];
1883 if ((rtype & SOLVER_RULE_TYPEMASK) == SOLVER_RULE_JOB)
1885 const char *js = testcase_job2str(pool, rq.elements[i + 2], rq.elements[i + 3]);
1886 char *s = pool_tmpjoin(pool, altprefix, num, " job ");
1887 s = pool_tmpappend(pool, s, js, 0);
1888 strqueue_push(&sq, s);
1890 else if (rtype == SOLVER_RULE_PKG_REQUIRES)
1892 char *s = pool_tmpjoin(pool, altprefix, num, testcase_solvid2str(pool, rq.elements[i + 1]));
1893 s = pool_tmpappend(pool, s, " requires ", testcase_dep2str(pool, rq.elements[i + 3]));
1894 strqueue_push(&sq, s);
1898 for (i = 0; i < q.count; i++)
1900 Id p = q.elements[i];
1902 num[0] = '0' + (i + 1) / 10;
1903 num[1] = '0' + (i + 1) % 10;
1905 s = pool_tmpjoin(pool, altprefix, num, "+ ");
1907 s = pool_tmpjoin(pool, altprefix, num, "- ");
1909 s = pool_tmpjoin(pool, altprefix, num, " ");
1910 s = pool_tmpappend(pool, s, testcase_solvid2str(pool, p < 0 ? -p : p), 0);
1911 strqueue_push(&sq, s);
1913 solv_free(altprefix);
1918 if ((resultflags & TESTCASE_RESULT_RULES) != 0)
1920 /* dump all rules */
1922 SolverRuleinfo rclass;
1927 for (rid = 1; (rclass = solver_ruleclass(solv, rid)) != SOLVER_RULE_UNKNOWN; rid++)
1932 case SOLVER_RULE_PKG:
1935 case SOLVER_RULE_UPDATE:
1938 case SOLVER_RULE_FEATURE:
1939 prefix = "feature ";
1941 case SOLVER_RULE_JOB:
1944 case SOLVER_RULE_DISTUPGRADE:
1945 prefix = "distupgrade ";
1947 case SOLVER_RULE_INFARCH:
1948 prefix = "infarch ";
1950 case SOLVER_RULE_CHOICE:
1953 case SOLVER_RULE_LEARNT:
1956 case SOLVER_RULE_BEST:
1959 case SOLVER_RULE_YUMOBS:
1963 prefix = "unknown ";
1966 prefix = solv_dupjoin("rule ", prefix, testcase_ruleid(solv, rid));
1967 solver_ruleliterals(solv, rid, &q);
1968 if (rclass == SOLVER_RULE_FEATURE && q.count == 1 && q.elements[0] == -SYSTEMSOLVABLE)
1970 for (i = 0; i < q.count; i++)
1972 Id p = q.elements[i];
1975 s = pool_tmpjoin(pool, prefix, " -", testcase_solvid2str(pool, -p));
1977 s = pool_tmpjoin(pool, prefix, " ", testcase_solvid2str(pool, p));
1978 strqueue_push(&sq, s);
1984 if ((resultflags & TESTCASE_RESULT_GENID) != 0)
1986 for (i = 0 ; i < solv->job.count; i += 2)
1989 if (solv->job.elements[i] != (SOLVER_NOOP | SOLVER_SOLVABLE_PROVIDES))
1991 id = solv->job.elements[i + 1];
1992 s = testcase_dep2str(pool, id);
1993 strqueue_push(&sq, pool_tmpjoin(pool, "genid dep ", s, 0));
1994 if ((id2 = testcase_str2dep(pool, s)) != id)
1996 s = pool_tmpjoin(pool, "genid roundtrip error: ", testcase_dep2str(pool, id2), 0);
1997 strqueue_push(&sq, s);
1999 dump_genid(pool, &sq, id, 1);
2003 result = strqueue_join(&sq);
2010 testcase_write(Solver *solv, const char *dir, int resultflags, const char *testcasename, const char *resultname)
2012 Pool *pool = solv->pool;
2023 testcasename = "testcase.t";
2025 resultname = "solver.result";
2027 if (mkdir(dir, 0777) && errno != EEXIST)
2029 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: could not create directory '%s'\n", dir);
2033 FOR_REPOS(repoid, repo)
2035 const char *name = testcase_repoid2str(pool, repoid);
2037 if (repo->subpriority)
2038 sprintf(priobuf, "%d.%d", repo->priority, repo->subpriority);
2040 sprintf(priobuf, "%d", repo->priority);
2041 out = pool_tmpjoin(pool, name, ".repo", ".gz");
2042 cmd = pool_tmpjoin(pool, "repo ", name, " ");
2043 cmd = pool_tmpappend(pool, cmd, priobuf, " ");
2044 cmd = pool_tmpappend(pool, cmd, "testtags ", out);
2045 strqueue_push(&sq, cmd);
2046 out = pool_tmpjoin(pool, dir, "/", out);
2047 if (!(fp = solv_xfopen(out, "w")))
2049 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: could not open '%s' for writing\n", out);
2053 testcase_write_testtags(repo, fp);
2056 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: write error\n");
2061 /* hmm, this is not optimal... we currently search for the lowest score */
2063 arch = pool->solvables[SYSTEMSOLVABLE].arch;
2064 for (i = 0; i < pool->lastarch; i++)
2066 if (pool->id2arch[i] == 1 && !lowscore)
2068 if (pool->id2arch[i] > 0x10000 && (!lowscore || pool->id2arch[i] < lowscore))
2071 lowscore = pool->id2arch[i];
2074 cmd = pool_tmpjoin(pool, "system ", pool->lastarch ? pool_id2str(pool, arch) : "unset", 0);
2075 for (i = 0; disttype2str[i].str != 0; i++)
2076 if (pool->disttype == disttype2str[i].type)
2078 pool_tmpappend(pool, cmd, " ", disttype2str[i].str ? disttype2str[i].str : "unknown");
2079 if (pool->installed)
2080 cmd = pool_tmpappend(pool, cmd, " ", testcase_repoid2str(pool, pool->installed->repoid));
2081 strqueue_push(&sq, cmd);
2082 s = testcase_getpoolflags(solv->pool);
2085 cmd = pool_tmpjoin(pool, "poolflags ", s, 0);
2086 strqueue_push(&sq, cmd);
2089 if (pool->vendorclasses)
2092 for (i = 0; pool->vendorclasses[i]; i++)
2094 cmd = pool_tmpappend(pool, cmd ? cmd : "vendorclass", " ", pool->vendorclasses[i]);
2095 if (!pool->vendorclasses[i + 1])
2097 strqueue_push(&sq, cmd);
2104 /* dump disabled packages (must come before the namespace/job lines) */
2105 if (pool->considered)
2108 FOR_POOL_SOLVABLES(p)
2109 if (!MAPTST(pool->considered, p))
2111 cmd = pool_tmpjoin(pool, "disable pkg ", testcase_solvid2str(pool, p), 0);
2112 strqueue_push(&sq, cmd);
2116 s = testcase_getsolverflags(solv);
2119 cmd = pool_tmpjoin(pool, "solverflags ", s, 0);
2120 strqueue_push(&sq, cmd);
2123 /* now dump all the ns callback values we know */
2124 if (pool->nscallback)
2128 for (rid = 1; rid < pool->nrels; rid++)
2130 Reldep *rd = pool->rels + rid;
2131 if (rd->flags != REL_NAMESPACE || rd->name == NAMESPACE_OTHERPROVIDERS)
2133 /* evaluate all namespace ids, skip empty results */
2134 d = pool_whatprovides(pool, MAKERELDEP(rid));
2135 if (!d || !pool->whatprovidesdata[d])
2137 cmd = pool_tmpjoin(pool, "namespace ", pool_id2str(pool, rd->name), "(");
2138 cmd = pool_tmpappend(pool, cmd, pool_id2str(pool, rd->evr), ")");
2139 for (; pool->whatprovidesdata[d]; d++)
2140 cmd = pool_tmpappend(pool, cmd, " ", testcase_solvid2str(pool, pool->whatprovidesdata[d]));
2141 strqueue_push(&sq, cmd);
2145 for (i = 0; i < solv->job.count; i += 2)
2147 cmd = (char *)testcase_job2str(pool, solv->job.elements[i], solv->job.elements[i + 1]);
2148 cmd = pool_tmpjoin(pool, "job ", cmd, 0);
2149 strqueue_push(&sq, cmd);
2156 for (i = 0; resultflags2str[i].str; i++)
2157 if ((resultflags & resultflags2str[i].flag) != 0)
2158 cmd = pool_tmpappend(pool, cmd, cmd ? "," : 0, resultflags2str[i].str);
2159 cmd = pool_tmpjoin(pool, "result ", cmd ? cmd : "?", 0);
2160 cmd = pool_tmpappend(pool, cmd, " ", resultname);
2161 strqueue_push(&sq, cmd);
2162 result = testcase_solverresult(solv, resultflags);
2163 if (!strcmp(resultname, "<inline>"))
2167 strqueue_init(&rsq);
2168 strqueue_split(&rsq, result);
2169 for (i = 0; i < rsq.nstr; i++)
2171 cmd = pool_tmpjoin(pool, "#>", rsq.str[i], 0);
2172 strqueue_push(&sq, cmd);
2174 strqueue_free(&rsq);
2178 out = pool_tmpjoin(pool, dir, "/", resultname);
2179 if (!(fp = fopen(out, "w")))
2181 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: could not open '%s' for writing\n", out);
2186 if (result && *result && fwrite(result, strlen(result), 1, fp) != 1)
2188 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: write error\n");
2196 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: write error\n");
2204 cmd = strqueue_join(&sq);
2205 out = pool_tmpjoin(pool, dir, "/", testcasename);
2206 if (!(fp = fopen(out, "w")))
2208 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: could not open '%s' for writing\n", out);
2212 if (*cmd && fwrite(cmd, strlen(cmd), 1, fp) != 1)
2214 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: write error\n");
2221 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: write error\n");
2231 read_inline_file(FILE *fp, char **bufp, char **bufpp, int *buflp)
2233 char *result = solv_malloc(1024);
2240 if (rp - result + 256 >= resultl)
2242 resultl = rp - result;
2243 result = solv_realloc(result, resultl + 1024);
2244 rp = result + resultl;
2247 if (!fgets(rp, resultl - (rp - result), fp))
2250 if (rl && (rp == result || rp[-1] == '\n'))
2252 if (rl > 1 && rp[0] == '#' && rp[1] == '>')
2254 memmove(rp, rp + 2, rl - 2);
2259 while (rl + 16 > *buflp)
2261 *bufp = solv_realloc(*bufp, *buflp + 512);
2264 memmove(*bufp, rp, rl);
2265 if ((*bufp)[rl - 1] == '\n')
2271 (*bufpp) = *bufp + rl;
2288 char *result = solv_malloc(1024);
2295 if (rp - result + 256 >= resultl)
2297 resultl = rp - result;
2298 result = solv_realloc(result, resultl + 1024);
2299 rp = result + resultl;
2302 rl = fread(rp, 1, resultl - (rp - result), fp);
2314 str2resultflags(Pool *pool, char *s) /* modifies the string! */
2316 int i, resultflags = 0;
2319 char *se = strchr(s, ',');
2322 for (i = 0; resultflags2str[i].str; i++)
2323 if (!strcmp(s, resultflags2str[i].str))
2325 resultflags |= resultflags2str[i].flag;
2328 if (!resultflags2str[i].str)
2329 pool_debug(pool, SOLV_ERROR, "result: unknown flag '%s'\n", s);
2336 testcase_read(Pool *pool, FILE *fp, const char *testcase, Queue *job, char **resultp, int *resultflagsp)
2341 char *testcasedir, *s;
2347 int poolflagsreset = 0;
2348 int missing_features = 0;
2352 if (!fp && !(fp = fopen(testcase, "r")))
2354 pool_debug(pool, SOLV_ERROR, "testcase_read: could not open '%s'\n", testcase);
2357 testcasedir = solv_strdup(testcase);
2358 if ((s = strrchr(testcasedir, '/')) != 0)
2363 buf = solv_malloc(bufl);
2368 if (bufp - buf + 16 > bufl)
2371 buf = solv_realloc(buf, bufl + 512);
2375 if (!fgets(bufp, bufl - (bufp - buf), fp))
2379 if (!l || buf[l - 1] != '\n')
2386 while (*s && (*s == ' ' || *s == '\t'))
2388 if (!*s || *s == '#')
2391 /* split it in pieces */
2394 while (*s == ' ' || *s == '\t')
2398 pieces = solv_extend(pieces, npieces, 1, sizeof(*pieces), 7);
2399 pieces[npieces++] = s;
2400 while (*s && *s != ' ' && *s != '\t')
2405 pieces = solv_extend(pieces, npieces, 1, sizeof(*pieces), 7);
2406 pieces[npieces] = 0;
2407 if (!strcmp(pieces[0], "repo") && npieces >= 4)
2409 Repo *repo = repo_create(pool, pieces[1]);
2415 if (!poolflagsreset)
2418 testcase_resetpoolflags(pool); /* hmm */
2420 if (sscanf(pieces[2], "%d.%d", &prio, &subprio) != 2)
2423 prio = atoi(pieces[2]);
2425 repo->priority = prio;
2426 repo->subpriority = subprio;
2427 if (strcmp(pieces[3], "empty") != 0)
2429 const char *repotype = pool_tmpjoin(pool, pieces[3], 0, 0); /* gets overwritten in <inline> case */
2430 if (!strcmp(pieces[4], "<inline>"))
2432 char *idata = read_inline_file(fp, &buf, &bufp, &bufl);
2434 rfp = solv_xfopen_buf(rdata, &idata, 0, "rf");
2438 rdata = pool_tmpjoin(pool, testcasedir, pieces[4], 0);
2439 rfp = solv_xfopen(rdata, "r");
2443 pool_debug(pool, SOLV_ERROR, "testcase_read: could not open '%s'\n", rdata);
2445 else if (!strcmp(repotype, "testtags"))
2447 testcase_add_testtags(repo, rfp, 0);
2450 else if (!strcmp(repotype, "solv"))
2452 repo_add_solv(repo, rfp, 0);
2456 else if (!strcmp(repotype, "helix"))
2458 extern int repo_add_helix(Repo *repo, FILE *fp, int flags);
2459 repo_add_helix(repo, rfp, 0);
2466 pool_debug(pool, SOLV_ERROR, "testcase_read: unknown repo type for repo '%s'\n", repo->name);
2470 else if (!strcmp(pieces[0], "system") && npieces >= 3)
2474 /* must set the disttype before the arch */
2476 if (strcmp(pieces[2], "*") != 0)
2478 char *dp = pieces[2];
2481 char *dpe = strchr(dp, ',');
2484 for (i = 0; disttype2str[i].str != 0; i++)
2485 if (!strcmp(disttype2str[i].str, dp))
2489 if (disttype2str[i].str)
2491 #ifdef MULTI_SEMANTICS
2492 if (pool->disttype != disttype2str[i].type)
2493 pool_setdisttype(pool, disttype2str[i].type);
2495 if (pool->disttype == disttype2str[i].type)
2502 pool_debug(pool, SOLV_ERROR, "testcase_read: system: could not change disttype to '%s'\n", pieces[2]);
2503 missing_features = 1;
2506 if (strcmp(pieces[1], "unset") == 0)
2507 pool_setarch(pool, 0);
2508 else if (pieces[1][0] == ':')
2509 pool_setarchpolicy(pool, pieces[1] + 1);
2511 pool_setarch(pool, pieces[1]);
2514 Repo *repo = testcase_str2repo(pool, pieces[3]);
2516 pool_debug(pool, SOLV_ERROR, "testcase_read: system: unknown repo '%s'\n", pieces[3]);
2518 pool_set_installed(pool, repo);
2521 else if (!strcmp(pieces[0], "job") && npieces > 1)
2527 pool_addfileprovides(pool);
2528 pool_createwhatprovides(pool);
2531 if (npieces >= 3 && !strcmp(pieces[2], "selection"))
2533 addselectionjob(pool, pieces + 1, npieces - 1, job);
2537 for (sp = pieces[1]; sp < pieces[npieces - 1]; sp++)
2540 how = testcase_str2job(pool, pieces[1], &what);
2541 if (how >= 0 && job)
2542 queue_push2(job, how, what);
2544 else if (!strcmp(pieces[0], "vendorclass") && npieces > 1)
2546 pool_addvendorclass(pool, (const char **)(pieces + 1));
2548 else if (!strcmp(pieces[0], "namespace") && npieces > 1)
2550 int i = strlen(pieces[1]);
2551 s = strchr(pieces[1], '(');
2552 if (!s && pieces[1][i - 1] != ')')
2554 pool_debug(pool, SOLV_ERROR, "testcase_read: bad namespace '%s'\n", pieces[1]);
2562 pieces[1][i - 1] = 0;
2563 name = pool_str2id(pool, pieces[1], 1);
2564 evr = pool_str2id(pool, s + 1, 1);
2566 pieces[1][i - 1] = ')';
2567 id = pool_rel2id(pool, name, evr, REL_NAMESPACE, 1);
2568 for (i = 2; i < npieces; i++)
2569 queue_push(&q, testcase_str2solvid(pool, pieces[i]));
2570 /* now do the callback */
2573 pool_addfileprovides(pool);
2574 pool_createwhatprovides(pool);
2577 pool->whatprovides_rel[GETRELID(id)] = pool_queuetowhatprovides(pool, &q);
2581 else if (!strcmp(pieces[0], "poolflags"))
2584 if (!poolflagsreset)
2587 testcase_resetpoolflags(pool); /* hmm */
2589 for (i = 1; i < npieces; i++)
2590 testcase_setpoolflags(pool, pieces[i]);
2592 else if (!strcmp(pieces[0], "solverflags") && npieces > 1)
2597 solv = solver_create(pool);
2598 testcase_resetsolverflags(solv);
2600 for (i = 1; i < npieces; i++)
2601 testcase_setsolverflags(solv, pieces[i]);
2603 else if (!strcmp(pieces[0], "result") && npieces > 1)
2606 int resultflags = str2resultflags(pool, pieces[1]);
2610 rdata = pool_tmpjoin(pool, testcasedir, pieces[2], 0);
2611 if (!strcmp(pieces[2], "<inline>"))
2612 result = read_inline_file(fp, &buf, &bufp, &bufl);
2615 FILE *rfp = fopen(rdata, "r");
2617 pool_debug(pool, SOLV_ERROR, "testcase_read: could not open '%s'\n", rdata);
2620 result = read_file(rfp);
2630 *resultflagsp = resultflags;
2632 else if (!strcmp(pieces[0], "nextjob") && npieces == 1)
2636 else if (!strcmp(pieces[0], "disable") && npieces == 3)
2639 if (strcmp(pieces[1], "pkg"))
2641 pool_debug(pool, SOLV_ERROR, "testcase_read: bad disable type '%s'\n", pieces[1]);
2645 pool_createwhatprovides(pool);
2647 if (!pool->considered)
2649 pool->considered = solv_calloc(1, sizeof(Map));
2650 map_init(pool->considered, pool->nsolvables);
2651 map_setall(pool->considered);
2653 p = testcase_str2solvid(pool, pieces[2]);
2655 MAPCLR(pool->considered, p);
2657 pool_debug(pool, SOLV_ERROR, "disable: unknown package '%s'\n", pieces[2]);
2659 else if (!strcmp(pieces[0], "feature"))
2662 for (i = 1; i < npieces; i++)
2664 for (j = 0; features[j]; j++)
2665 if (!strcmp(pieces[i], features[j]))
2669 pool_debug(pool, SOLV_ERROR, "testcase_read: missing feature '%s'\n", pieces[i]);
2673 if (missing_features)
2676 else if (!strcmp(pieces[0], "genid") && npieces > 1)
2683 for (sp = pieces[2]; sp < pieces[npieces - 1]; sp++)
2687 genid = solv_extend(genid, ngenid, 1, sizeof(*genid), 7);
2688 if (!strcmp(pieces[1], "op") && npieces > 2)
2691 for (op = oplist; op->flags; op++)
2692 if (!strncmp(pieces[2], op->opname, strlen(op->opname)))
2696 pool_debug(pool, SOLV_ERROR, "testcase_read: genid: unknown op '%s'\n", pieces[2]);
2701 pool_debug(pool, SOLV_ERROR, "testcase_read: genid: out of stack\n");
2705 id = pool_rel2id(pool, genid[ngenid] , genid[ngenid + 1], op->flags, 1);
2707 else if (!strcmp(pieces[1], "lit"))
2708 id = pool_str2id(pool, npieces > 2 ? pieces[2] : "", 1);
2709 else if (!strcmp(pieces[1], "null"))
2711 else if (!strcmp(pieces[1], "dep"))
2712 id = testcase_str2dep(pool, pieces[2]);
2715 pool_debug(pool, SOLV_ERROR, "testcase_read: genid: unknown command '%s'\n", pieces[1]);
2718 genid[ngenid++] = id;
2722 pool_debug(pool, SOLV_ERROR, "testcase_read: cannot parse command '%s'\n", pieces[0]);
2725 while (job && ngenid > 0)
2726 queue_push2(job, SOLVER_NOOP | SOLVER_SOLVABLE_PROVIDES, genid[--ngenid]);
2727 genid = solv_free(genid);
2728 buf = solv_free(buf);
2729 pieces = solv_free(pieces);
2730 solv_free(testcasedir);
2733 pool_addfileprovides(pool);
2734 pool_createwhatprovides(pool);
2738 solv = solver_create(pool);
2739 testcase_resetsolverflags(solv);
2743 if (missing_features)
2748 *resultflagsp = 77; /* hack for testsolv */
2754 testcase_resultdiff(const char *result1, const char *result2)
2756 Strqueue sq1, sq2, osq;
2758 strqueue_init(&sq1);
2759 strqueue_init(&sq2);
2760 strqueue_init(&osq);
2761 strqueue_split(&sq1, result1);
2762 strqueue_split(&sq2, result2);
2763 strqueue_sort(&sq1);
2764 strqueue_sort(&sq2);
2765 strqueue_diff(&sq1, &sq2, &osq);
2766 r = osq.nstr ? strqueue_join(&osq) : 0;
2767 strqueue_free(&sq1);
2768 strqueue_free(&sq2);
2769 strqueue_free(&osq);