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" },
48 { SOLVER_ALLOWUNINSTALL, "allowuninstall" },
49 { SOLVER_FAVOR, "favor" },
50 { SOLVER_DISFAVOR, "disfavor" },
54 static struct jobflags2str {
58 { SOLVER_WEAK, "weak" },
59 { SOLVER_ESSENTIAL, "essential" },
60 { SOLVER_CLEANDEPS, "cleandeps" },
61 { SOLVER_ORUPDATE, "orupdate" },
62 { SOLVER_FORCEBEST, "forcebest" },
63 { SOLVER_TARGETED, "targeted" },
64 { SOLVER_NOTBYUSER, "notbyuser" },
65 { SOLVER_SETEV, "setev" },
66 { SOLVER_SETEVR, "setevr" },
67 { SOLVER_SETARCH, "setarch" },
68 { SOLVER_SETVENDOR, "setvendor" },
69 { SOLVER_SETREPO, "setrepo" },
70 { SOLVER_NOAUTOSET, "noautoset" },
74 static struct resultflags2str {
77 } resultflags2str[] = {
78 { TESTCASE_RESULT_TRANSACTION, "transaction" },
79 { TESTCASE_RESULT_PROBLEMS, "problems" },
80 { TESTCASE_RESULT_ORPHANED, "orphaned" },
81 { TESTCASE_RESULT_RECOMMENDED, "recommended" },
82 { TESTCASE_RESULT_UNNEEDED, "unneeded" },
83 { TESTCASE_RESULT_ALTERNATIVES, "alternatives" },
84 { TESTCASE_RESULT_RULES, "rules" },
85 { TESTCASE_RESULT_GENID, "genid" },
86 { TESTCASE_RESULT_REASON, "reason" },
90 static struct solverflags2str {
94 } solverflags2str[] = {
95 { SOLVER_FLAG_ALLOW_DOWNGRADE, "allowdowngrade", 0 },
96 { SOLVER_FLAG_ALLOW_NAMECHANGE, "allownamechange", 1 },
97 { SOLVER_FLAG_ALLOW_ARCHCHANGE, "allowarchchange", 0 },
98 { SOLVER_FLAG_ALLOW_VENDORCHANGE, "allowvendorchange", 0 },
99 { SOLVER_FLAG_ALLOW_UNINSTALL, "allowuninstall", 0 },
100 { SOLVER_FLAG_NO_UPDATEPROVIDE, "noupdateprovide", 0 },
101 { SOLVER_FLAG_SPLITPROVIDES, "splitprovides", 0 },
102 { SOLVER_FLAG_IGNORE_RECOMMENDED, "ignorerecommended", 0 },
103 { SOLVER_FLAG_ADD_ALREADY_RECOMMENDED, "addalreadyrecommended", 0 },
104 { SOLVER_FLAG_NO_INFARCHCHECK, "noinfarchcheck", 0 },
105 { SOLVER_FLAG_KEEP_EXPLICIT_OBSOLETES, "keepexplicitobsoletes", 0 },
106 { SOLVER_FLAG_BEST_OBEY_POLICY, "bestobeypolicy", 0 },
107 { SOLVER_FLAG_NO_AUTOTARGET, "noautotarget", 0 },
108 { SOLVER_FLAG_DUP_ALLOW_DOWNGRADE, "dupallowdowngrade", 1 },
109 { SOLVER_FLAG_DUP_ALLOW_ARCHCHANGE, "dupallowarchchange", 1 },
110 { SOLVER_FLAG_DUP_ALLOW_VENDORCHANGE, "dupallowvendorchange", 1 },
111 { SOLVER_FLAG_DUP_ALLOW_NAMECHANGE, "dupallownamechange", 1 },
112 { SOLVER_FLAG_KEEP_ORPHANS, "keeporphans", 0 },
113 { SOLVER_FLAG_BREAK_ORPHANS, "breakorphans", 0 },
114 { SOLVER_FLAG_FOCUS_INSTALLED, "focusinstalled", 0 },
115 { SOLVER_FLAG_YUM_OBSOLETES, "yumobsoletes", 0 },
116 { SOLVER_FLAG_NEED_UPDATEPROVIDE, "needupdateprovide", 0 },
117 { SOLVER_FLAG_URPM_REORDER, "urpmreorder", 0 },
121 static struct poolflags2str {
125 } poolflags2str[] = {
126 { POOL_FLAG_PROMOTEEPOCH, "promoteepoch", 0 },
127 { POOL_FLAG_FORBIDSELFCONFLICTS, "forbidselfconflicts", 0 },
128 { POOL_FLAG_OBSOLETEUSESPROVIDES, "obsoleteusesprovides", 0 },
129 { POOL_FLAG_IMPLICITOBSOLETEUSESPROVIDES, "implicitobsoleteusesprovides", 0 },
130 { POOL_FLAG_OBSOLETEUSESCOLORS, "obsoleteusescolors", 0 },
131 { POOL_FLAG_IMPLICITOBSOLETEUSESCOLORS, "implicitobsoleteusescolors", 0 },
132 { POOL_FLAG_NOINSTALLEDOBSOLETES, "noinstalledobsoletes", 0 },
133 { POOL_FLAG_HAVEDISTEPOCH, "havedistepoch", 0 },
134 { POOL_FLAG_NOOBSOLETESMULTIVERSION, "noobsoletesmultiversion", 0 },
135 { POOL_FLAG_ADDFILEPROVIDESFILTERED, "addfileprovidesfiltered", 0 },
136 { POOL_FLAG_NOWHATPROVIDESAUX, "nowhatprovidesaux", 0 },
140 static struct disttype2str {
144 { DISTTYPE_RPM, "rpm" },
145 { DISTTYPE_DEB, "deb" },
146 { DISTTYPE_ARCH, "arch" },
147 { DISTTYPE_HAIKU, "haiku" },
151 static struct selflags2str {
155 { SELECTION_NAME, "name" },
156 { SELECTION_PROVIDES, "provides" },
157 { SELECTION_FILELIST, "filelist" },
158 { SELECTION_CANON, "canon" },
159 { SELECTION_DOTARCH, "dotarch" },
160 { SELECTION_REL, "rel" },
161 { SELECTION_INSTALLED_ONLY, "installedonly" },
162 { SELECTION_GLOB, "glob" },
163 { SELECTION_FLAT, "flat" },
164 { SELECTION_NOCASE, "nocase" },
165 { SELECTION_SOURCE_ONLY, "sourceonly" },
166 { SELECTION_WITH_SOURCE, "withsource" },
170 static const char *features[] = {
171 #ifdef ENABLE_LINKED_PKGS
174 #ifdef ENABLE_COMPLEX_DEPS
180 typedef struct strqueue {
185 #define STRQUEUE_BLOCK 63
188 strqueue_init(Strqueue *q)
195 strqueue_free(Strqueue *q)
198 for (i = 0; i < q->nstr; i++)
199 solv_free(q->str[i]);
200 q->str = solv_free(q->str);
205 strqueue_push(Strqueue *q, const char *s)
207 q->str = solv_extend(q->str, q->nstr, 1, sizeof(*q->str), STRQUEUE_BLOCK);
208 q->str[q->nstr++] = solv_strdup(s);
212 strqueue_pushjoin(Strqueue *q, const char *s1, const char *s2, const char *s3)
214 q->str = solv_extend(q->str, q->nstr, 1, sizeof(*q->str), STRQUEUE_BLOCK);
215 q->str[q->nstr++] = solv_dupjoin(s1, s2, s3);
219 strqueue_sort_cmp(const void *ap, const void *bp, void *dp)
221 const char *a = *(const char **)ap;
222 const char *b = *(const char **)bp;
223 return strcmp(a ? a : "", b ? b : "");
227 strqueue_sort(Strqueue *q)
230 solv_sort(q->str, q->nstr, sizeof(*q->str), strqueue_sort_cmp, 0);
234 strqueue_sort_u(Strqueue *q)
238 for (i = j = 0; i < q->nstr; i++)
239 if (!j || strqueue_sort_cmp(q->str + i, q->str + j - 1, 0) != 0)
240 q->str[j++] = q->str[i];
245 strqueue_join(Strqueue *q)
249 for (i = 0; i < q->nstr; i++)
251 l += strlen(q->str[i]) + 1;
252 l++; /* trailing \0 */
255 for (i = 0; i < q->nstr; i++)
258 strcpy(rp, q->str[i]);
267 strqueue_split(Strqueue *q, const char *s)
272 while ((p = strchr(s, '\n')) != 0)
274 q->str = solv_extend(q->str, q->nstr, 1, sizeof(*q->str), STRQUEUE_BLOCK);
275 q->str[q->nstr] = solv_malloc(p - s + 1);
277 memcpy(q->str[q->nstr], s, p - s);
278 q->str[q->nstr][p - s] = 0;
287 strqueue_diff(Strqueue *sq1, Strqueue *sq2, Strqueue *osq)
290 while (i < sq1->nstr && j < sq2->nstr)
292 int r = strqueue_sort_cmp(sq1->str + i, sq2->str + j, 0);
296 strqueue_pushjoin(osq, "-", sq1->str[i++], 0);
298 strqueue_pushjoin(osq, "+", sq2->str[j++], 0);
300 while (i < sq1->nstr)
301 strqueue_pushjoin(osq, "-", sq1->str[i++], 0);
302 while (j < sq2->nstr)
303 strqueue_pushjoin(osq, "+", sq2->str[j++], 0);
308 testcase_id2str(Pool *pool, Id id, int isname)
310 const char *s = pool_id2str(pool, id);
313 int bad = 0, paren = 0, parenbad = 0;
319 if (strchr("[(<=>!", *s))
321 if (!strncmp(s, "namespace:", 10))
323 for (ss = s + bad; *ss; ss++)
325 if (*ss == ' ' || *ss == '\\' || *(unsigned char *)ss < 32 || *ss == '(' || *ss == ')')
328 paren = paren == 0 ? 1 : -1;
331 paren = paren == 1 ? 0 : -1;
336 if (isname && ss - s > 4 && !strcmp(ss - 4, ":any"))
338 if (!paren && !(bad - parenbad))
341 /* we need escaping! */
342 s2 = s2p = pool_alloctmpspace(pool, strlen(s) + bad * 2 + 1);
343 if (!strncmp(s, "namespace:", 10))
345 strcpy(s2p, "namespace\\3a");
353 if ((ss == s && strchr("[(<=>!", *s)) || *ss == ' ' || *ss == '\\' || *(unsigned char *)ss < 32 || *ss == '(' || *ss == ')')
356 solv_bin2hex((unsigned char *)ss, 1, s2p);
361 if (isname && s2p - s2 > 4 && !strcmp(s2p - 4, ":any"))
362 strcpy(s2p - 4, "\\3aany");
371 { REL_GT | REL_LT | REL_EQ, "<=>" },
372 { REL_LT | REL_EQ, "<=" },
373 { REL_GT | REL_EQ, ">=" },
375 { REL_GT | REL_LT, "<>" },
379 { REL_NAMESPACE , "<NAMESPACE>" },
381 { REL_MULTIARCH, "<MULTIARCH>" },
382 { REL_FILECONFLICT, "<FILECONFLICT>" },
383 { REL_COND, "<IF>" },
384 { REL_COMPAT, "compat >=" },
385 { REL_KIND, "<KIND>" },
386 { REL_ELSE, "<ELSE>" },
392 testcase_dep2str_complex(Pool *pool, Id id, int addparens)
401 return testcase_id2str(pool, id, 1);
402 rd = GETRELDEP(pool, id);
404 /* check for special shortcuts */
405 if (rd->flags == REL_NAMESPACE && !ISRELDEP(rd->name) && !strncmp(pool_id2str(pool, rd->name), "namespace:", 10))
407 const char *ns = pool_id2str(pool, rd->name);
408 int nslen = strlen(ns);
409 /* special namespace formatting */
410 const char *evrs = testcase_dep2str_complex(pool, rd->evr, 0);
411 s = pool_tmpappend(pool, evrs, ns, "()");
412 memmove(s + nslen + 1, s, strlen(s) - nslen - 2);
413 memcpy(s, ns, nslen);
417 if (rd->flags == REL_MULTIARCH && !ISRELDEP(rd->name) && rd->evr == ARCH_ANY)
419 /* special :any suffix */
420 const char *ns = testcase_id2str(pool, rd->name, 1);
421 return pool_tmpappend(pool, ns, ":any", 0);
425 if (ISRELDEP(rd->name))
427 Reldep *rd2 = GETRELDEP(pool, rd->name);
429 if (rd->flags > 7 && rd->flags != REL_COMPAT && rd2->flags && rd2->flags <= 7)
432 s = (char *)testcase_dep2str_complex(pool, rd->name, needparens);
436 s = pool_tmpappend(pool, s, "(", 0);
437 memmove(s + 1, s, strlen(s + 1));
440 for (op = oplist; op->flags; op++)
441 if (rd->flags == op->flags)
445 s = pool_tmpappend(pool, s, " ", op->opname);
446 s = pool_tmpappend(pool, s, " ", 0);
451 sprintf(buf, " <%u> ", rd->flags);
452 s = pool_tmpappend(pool, s, buf, 0);
456 if (ISRELDEP(rd->evr))
458 Reldep *rd2 = GETRELDEP(pool, rd->evr);
460 if (rd->flags > 7 && rd2->flags && rd2->flags <= 7)
462 if (rd->flags == REL_AND && rd2->flags == REL_AND)
463 needparens = 0; /* chain */
464 if (rd->flags == REL_OR && rd2->flags == REL_OR)
465 needparens = 0; /* chain */
466 if (rd->flags > 0 && rd->flags < 8 && rd2->flags == REL_COMPAT)
467 needparens = 0; /* chain */
469 if (!ISRELDEP(rd->evr))
470 s2 = testcase_id2str(pool, rd->evr, 0);
472 s2 = testcase_dep2str_complex(pool, rd->evr, needparens);
474 s = pool_tmpappend(pool, s, s2, ")");
476 s = pool_tmpappend(pool, s, s2, 0);
477 pool_freetmpspace(pool, s2);
482 testcase_dep2str(Pool *pool, Id id)
484 return testcase_dep2str_complex(pool, id, 0);
488 /* Convert a simple string. Also handle the :any suffix */
490 testcase_str2dep_simple(Pool *pool, const char **sp, int isname)
497 for (s = *sp; *s; s++)
501 if (*s == ' ' || *(unsigned char *)s < 32)
505 if (*s == ')' && paren-- <= 0)
508 if (isname && s - *sp > 4 && !strncmp(s - 4, ":any", 4))
515 if (s - *sp == 6 && !strncmp(*sp, "<NULL>", 6))
518 id = pool_strn2id(pool, *sp, s - *sp, 1);
520 else if (s - *sp == 3 && !strncmp(*sp, "\\00", 3))
524 char buf[128], *bp, *bp2;
526 bp = s - *sp >= 128 ? solv_malloc(s - *sp + 1) : buf;
527 for (bp2 = bp, sp2 = *sp; sp2 < s;)
531 solv_hex2bin(&sp2, (unsigned char *)bp2 - 1, 1);
534 id = pool_str2id(pool, bp, 1);
540 id = pool_rel2id(pool, id, ARCH_ANY, REL_MULTIARCH, 1);
549 testcase_str2dep_complex(Pool *pool, const char **sp, int relop)
552 Id flags, id, id2, namespaceid = 0;
555 while (*s == ' ' || *s == '\t')
557 if (!strncmp(s, "namespace:", 10))
559 /* special namespace hack */
561 for (s2 = s + 10; *s2 && *s2 != '('; s2++)
565 namespaceid = pool_strn2id(pool, s, s2 - s, 1);
572 id = testcase_str2dep_complex(pool, &s, 0);
581 id = testcase_str2dep_simple(pool, &s, relop ? 0 : 1);
583 id = pool_rel2id(pool, namespaceid, id, REL_NAMESPACE, 1);
587 while (*s == ' ' || *s == '\t')
589 if (!*s || *s == ')' || (relop && strncmp(s, "compat >= ", 10) != 0))
595 /* we have an op! Find the end */
597 if (s[0] == '<' && (s[1] >= '0' && s[1] <= '9'))
600 for (s2 = s + 1; *s2 >= '0' && *s2 <= '9'; s2++)
604 flags = strtoul(s + 1, 0, 10);
610 for (op = oplist; op->flags; op++)
611 if (!strncmp(s, op->opname, strlen(op->opname)))
619 s += strlen(op->opname);
621 id2 = testcase_str2dep_complex(pool, &s, flags > 0 && flags < 8);
627 id = pool_rel2id(pool, id, id2, flags, 1);
632 testcase_str2dep(Pool *pool, const char *s)
634 Id id = testcase_str2dep_complex(pool, &s, 0);
635 return s && !*s ? id : 0;
638 /**********************************************************/
641 testcase_repoid2str(Pool *pool, Id repoid)
643 Repo *repo = pool_id2repo(pool, repoid);
646 char *r = pool_tmpjoin(pool, repo->name, 0, 0);
648 for (rp = r; *rp; rp++)
649 if (*rp == ' ' || *rp == '\t')
656 sprintf(buf, "#%d", repoid);
657 return pool_tmpjoin(pool, buf, 0, 0);
662 testcase_solvid2str(Pool *pool, Id p)
664 Solvable *s = pool->solvables + p;
665 const char *n, *e, *a;
668 if (p == SYSTEMSOLVABLE)
670 n = pool_id2str(pool, s->name);
671 e = pool_id2str(pool, s->evr);
672 a = pool_id2str(pool, s->arch);
673 str = pool_alloctmpspace(pool, strlen(n) + strlen(e) + strlen(a) + 3);
674 sprintf(str, "%s-%s.%s", n, e, a);
676 return pool_tmpappend(pool, str, "@", 0);
680 char *str2 = pool_tmpappend(pool, str, "@", s->repo->name);
682 if (str2[l] == ' ' || str2[l] == '\t')
686 sprintf(buf, "@#%d", s->repo->repoid);
687 return pool_tmpappend(pool, str, buf, 0);
691 testcase_str2repo(Pool *pool, const char *str)
695 if (str[0] == '#' && (str[1] >= '0' && str[1] <= '9'))
699 for (j = 1; str[j] >= '0' && str[j] <= '9'; j++)
700 repoid = repoid * 10 + (str[j] - '0');
701 if (!str[j] && repoid > 0 && repoid < pool->nrepos)
702 repo = pool_id2repo(pool, repoid);
706 FOR_REPOS(repoid, repo)
711 l = strlen(repo->name);
712 for (i = 0; i < l; i++)
714 int c = repo->name[i];
715 if (c == ' ' || c == '\t')
720 if (i == l && !str[l])
723 if (repoid >= pool->nrepos)
730 testcase_str2solvid(Pool *pool, const char *str)
732 int i, l = strlen(str);
739 if (*str == '@' && !strcmp(str, "@SYSTEM"))
740 return SYSTEMSOLVABLE;
742 for (i = l - 1; i >= 0; i--)
743 if (str[i] == '@' && (repo = testcase_str2repo(pool, str + i + 1)) != 0)
748 /* now find the arch (if present) */
750 for (i = repostart - 1; i > 0; i--)
753 arch = pool_strn2id(pool, str + i + 1, repostart - (i + 1), 0);
758 /* now find the name */
759 for (i = repostart - 1; i > 0; i--)
763 Id nid, evrid, p, pp;
764 nid = pool_strn2id(pool, str, i, 0);
767 evrid = pool_strn2id(pool, str + i + 1, repostart - (i + 1), 0);
770 FOR_PROVIDES(p, pp, nid)
772 Solvable *s = pool->solvables + p;
773 if (s->name != nid || s->evr != evrid)
775 if (repo && s->repo != repo)
777 if (arch && s->arch != arch)
787 testcase_job2str(Pool *pool, Id how, Id what)
794 Id select = how & SOLVER_SELECTMASK;
796 for (i = 0; job2str[i].str; i++)
797 if ((how & SOLVER_JOBMASK) == job2str[i].job)
799 jobstr = job2str[i].str ? job2str[i].str : "unknown";
800 if (select == SOLVER_SOLVABLE)
803 pkgstr = testcase_solvid2str(pool, what);
805 else if (select == SOLVER_SOLVABLE_NAME)
808 pkgstr = testcase_dep2str(pool, what);
810 else if (select == SOLVER_SOLVABLE_PROVIDES)
812 selstr = " provides ";
813 pkgstr = testcase_dep2str(pool, what);
815 else if (select == SOLVER_SOLVABLE_ONE_OF)
820 while ((p = pool->whatprovidesdata[what++]) != 0)
822 const char *s = testcase_solvid2str(pool, p);
825 pkgstr = pool_tmpappend(pool, pkgstr, " ", s);
826 pool_freetmpspace(pool, s);
834 else if (select == SOLVER_SOLVABLE_REPO)
836 Repo *repo = pool_id2repo(pool, what);
841 sprintf(buf, "#%d", repo->repoid);
842 pkgstr = pool_tmpjoin(pool, buf, 0, 0);
845 pkgstr = pool_tmpjoin(pool, repo->name, 0, 0);
847 else if (select == SOLVER_SOLVABLE_ALL)
854 selstr = " unknown ";
857 ret = pool_tmpjoin(pool, jobstr, selstr, pkgstr);
859 ret = pool_tmpappend(pool, ret, " ", 0);
860 for (i = 0; jobflags2str[i].str; i++)
861 if ((how & jobflags2str[i].flag) != 0)
862 ret = pool_tmpappend(pool, ret, ",", jobflags2str[i].str);
868 ret = pool_tmpappend(pool, ret, "]", 0);
874 str2selflags(Pool *pool, char *s) /* modifies the string! */
879 char *se = strchr(s, ',');
882 for (i = 0; selflags2str[i].str; i++)
883 if (!strcmp(s, selflags2str[i].str))
885 selflags |= selflags2str[i].flag;
888 if (!selflags2str[i].str)
889 pool_debug(pool, SOLV_ERROR, "str2job: unknown selection flag '%s'\n", s);
896 str2jobflags(Pool *pool, char *s) /* modifies the string */
901 char *se = strchr(s, ',');
904 for (i = 0; jobflags2str[i].str; i++)
905 if (!strcmp(s, jobflags2str[i].str))
907 jobflags |= jobflags2str[i].flag;
910 if (!jobflags2str[i].str)
911 pool_debug(pool, SOLV_ERROR, "str2job: unknown job flag '%s'\n", s);
918 testcase_str2job(Pool *pool, const char *str, Id *whatp)
928 /* so we can patch it */
929 s = pool_tmpjoin(pool, str, 0, 0);
930 /* split it in pieces */
933 while (*s == ' ' || *s == '\t')
937 pieces = solv_extend(pieces, npieces, 1, sizeof(*pieces), 7);
938 pieces[npieces++] = s;
939 while (*s && *s != ' ' && *s != '\t')
946 pool_debug(pool, SOLV_ERROR, "str2job: bad line '%s'\n", str);
951 for (i = 0; job2str[i].str; i++)
952 if (!strcmp(pieces[0], job2str[i].str))
956 pool_debug(pool, SOLV_ERROR, "str2job: unknown job '%s'\n", str);
960 job = job2str[i].job;
964 char *flags = pieces[npieces - 1];
965 if (*flags == '[' && flags[strlen(flags) - 1] == ']')
969 flags[strlen(flags) - 1] = 0;
970 job |= str2jobflags(pool, flags);
973 if (!strcmp(pieces[1], "pkg"))
977 pool_debug(pool, SOLV_ERROR, "str2job: bad pkg selector in '%s'\n", str);
981 job |= SOLVER_SOLVABLE;
982 what = testcase_str2solvid(pool, pieces[2]);
985 pool_debug(pool, SOLV_ERROR, "str2job: unknown package '%s'\n", pieces[2]);
990 else if (!strcmp(pieces[1], "name") || !strcmp(pieces[1], "provides"))
992 /* join em again for dep2str... */
994 for (sp = pieces[2]; sp < pieces[npieces - 1]; sp++)
998 if (pieces[1][0] == 'p' && strncmp(pieces[2], "namespace:", 10) == 0)
1000 char *spe = strchr(pieces[2], '(');
1001 int l = strlen(pieces[2]);
1002 if (spe && pieces[2][l - 1] == ')')
1004 /* special namespace provides */
1005 if (strcmp(spe, "(<NULL>)") != 0)
1007 pieces[2][l - 1] = 0;
1008 what = testcase_str2dep(pool, spe + 1);
1009 pieces[2][l - 1] = ')';
1011 what = pool_rel2id(pool, pool_strn2id(pool, pieces[2], spe - pieces[2], 1), what, REL_NAMESPACE, 1);
1015 what = testcase_str2dep(pool, pieces[2]);
1016 if (pieces[1][0] == 'n')
1017 job |= SOLVER_SOLVABLE_NAME;
1019 job |= SOLVER_SOLVABLE_PROVIDES;
1021 else if (!strcmp(pieces[1], "oneof"))
1024 job |= SOLVER_SOLVABLE_ONE_OF;
1026 if (npieces > 3 && strcmp(pieces[2], "nothing") != 0)
1028 for (i = 2; i < npieces; i++)
1030 Id p = testcase_str2solvid(pool, pieces[i]);
1033 pool_debug(pool, SOLV_ERROR, "str2job: unknown package '%s'\n", pieces[i]);
1041 what = pool_queuetowhatprovides(pool, &q);
1044 else if (!strcmp(pieces[1], "repo"))
1049 pool_debug(pool, SOLV_ERROR, "str2job: bad line '%s'\n", str);
1053 repo = testcase_str2repo(pool, pieces[2]);
1056 pool_debug(pool, SOLV_ERROR, "str2job: unknown repo '%s'\n", pieces[2]);
1060 job |= SOLVER_SOLVABLE_REPO;
1061 what = repo->repoid;
1063 else if (!strcmp(pieces[1], "all"))
1065 if (npieces != 3 && strcmp(pieces[2], "packages") != 0)
1067 pool_debug(pool, SOLV_ERROR, "str2job: bad line '%s'\n", str);
1071 job |= SOLVER_SOLVABLE_ALL;
1076 pool_debug(pool, SOLV_ERROR, "str2job: unknown selection in '%s'\n", str);
1086 addselectionjob(Pool *pool, char **pieces, int npieces, Queue *jobqueue)
1093 for (i = 0; job2str[i].str; i++)
1094 if (!strcmp(pieces[0], job2str[i].str))
1096 if (!job2str[i].str)
1098 pool_debug(pool, SOLV_ERROR, "selstr2job: unknown job '%s'\n", pieces[0]);
1101 job = job2str[i].job;
1104 char *flags = pieces[npieces - 1];
1105 if (*flags == '[' && flags[strlen(flags) - 1] == ']')
1109 flags[strlen(flags) - 1] = 0;
1110 job |= str2jobflags(pool, flags);
1115 pool_debug(pool, SOLV_ERROR, "selstr2job: no selection flags\n");
1118 selflags = str2selflags(pool, pieces[3]);
1120 r = selection_make(pool, &sel, pieces[2], selflags);
1121 for (i = 0; i < sel.count; i += 2)
1122 queue_push2(jobqueue, job | sel.elements[i], sel.elements[i + 1]);
1128 writedeps(Repo *repo, FILE *fp, const char *tag, Id key, Solvable *s, Offset off)
1130 Pool *pool = repo->pool;
1137 dp = repo->idarraydata + off;
1138 while ((id = *dp++) != 0)
1140 if (key == SOLVABLE_REQUIRES && id == SOLVABLE_PREREQMARKER)
1143 fprintf(fp, "-%s\n", tag);
1148 if (key == SOLVABLE_PROVIDES && id == SOLVABLE_FILEMARKER)
1150 idstr = testcase_dep2str(pool, id);
1153 fprintf(fp, "+%s\n", tag);
1156 fprintf(fp, "%s\n", idstr);
1159 fprintf(fp, "-%s\n", tag);
1163 writefilelist(Repo *repo, FILE *fp, const char *tag, Solvable *s)
1165 Pool *pool = repo->pool;
1169 dataiterator_init(&di, pool, repo, s - pool->solvables, SOLVABLE_FILELIST, 0, 0);
1170 while (dataiterator_step(&di))
1172 const char *s = repodata_dir2str(di.data, di.kv.id, di.kv.str);
1175 fprintf(fp, "+%s\n", tag);
1178 fprintf(fp, "%s\n", s);
1181 fprintf(fp, "-%s\n", tag);
1182 dataiterator_free(&di);
1186 testcase_write_testtags(Repo *repo, FILE *fp)
1188 Pool *pool = repo->pool;
1194 const char *release;
1199 fprintf(fp, "=Ver: 3.0\n");
1201 FOR_REPO_SOLVABLES(repo, p, s)
1203 name = pool_id2str(pool, s->name);
1204 evr = pool_id2str(pool, s->evr);
1205 arch = pool_id2str(pool, s->arch);
1206 release = strrchr(evr, '-');
1208 release = evr + strlen(evr);
1209 fprintf(fp, "=Pkg: %s %.*s %s %s\n", name, (int)(release - evr), evr, *release && release[1] ? release + 1 : "-", arch);
1210 tmp = solvable_lookup_str(s, SOLVABLE_SUMMARY);
1212 fprintf(fp, "=Sum: %s\n", tmp);
1213 writedeps(repo, fp, "Req:", SOLVABLE_REQUIRES, s, s->requires);
1214 writedeps(repo, fp, "Prv:", SOLVABLE_PROVIDES, s, s->provides);
1215 writedeps(repo, fp, "Obs:", SOLVABLE_OBSOLETES, s, s->obsoletes);
1216 writedeps(repo, fp, "Con:", SOLVABLE_CONFLICTS, s, s->conflicts);
1217 writedeps(repo, fp, "Rec:", SOLVABLE_RECOMMENDS, s, s->recommends);
1218 writedeps(repo, fp, "Sup:", SOLVABLE_SUPPLEMENTS, s, s->supplements);
1219 writedeps(repo, fp, "Sug:", SOLVABLE_SUGGESTS, s, s->suggests);
1220 writedeps(repo, fp, "Enh:", SOLVABLE_ENHANCES, s, s->enhances);
1221 if (solvable_lookup_idarray(s, SOLVABLE_PREREQ_IGNOREINST, &q))
1224 fprintf(fp, "+Ipr:\n");
1225 for (i = 0; i < q.count; i++)
1226 fprintf(fp, "%s\n", testcase_dep2str(pool, q.elements[i]));
1227 fprintf(fp, "-Ipr:\n");
1230 fprintf(fp, "=Vnd: %s\n", pool_id2str(pool, s->vendor));
1231 ti = solvable_lookup_num(s, SOLVABLE_BUILDTIME, 0);
1233 fprintf(fp, "=Tim: %u\n", ti);
1234 writefilelist(repo, fp, "Fls:", s);
1240 static inline Offset
1241 adddep(Repo *repo, Offset olddeps, char *str, Id marker)
1243 Id id = *str == '/' ? pool_str2id(repo->pool, str, 1) : testcase_str2dep(repo->pool, str);
1244 return repo_addid_dep(repo, olddeps, id, marker);
1248 finish_v2_solvable(Pool *pool, Repodata *data, Solvable *s, char *filelist, int nfilelist)
1254 for (l = 0; l < nfilelist; l += strlen(filelist + l) + 1)
1256 char *p = strrchr(filelist + l, '/');
1260 did = repodata_str2dir(data, filelist + l, 1);
1263 did = repodata_str2dir(data, "/", 1);
1264 repodata_add_dirstr(data, s - pool->solvables, SOLVABLE_FILELIST, did, p);
1267 s->supplements = repo_fix_supplements(s->repo, s->provides, s->supplements, 0);
1268 s->conflicts = repo_fix_conflicts(s->repo, s->conflicts);
1271 /* stripped down version of susetags parser used for testcases */
1273 testcase_add_testtags(Repo *repo, FILE *fp, int flags)
1275 Pool *pool = repo->pool;
1287 int tagsversion = 0;
1288 int addselfprovides = 1; /* for compat reasons */
1290 data = repo_add_repodata(repo, flags);
1295 line = solv_malloc(aline);
1299 if (linep - line + 16 > aline)
1301 aline = linep - line;
1302 line = solv_realloc(line, aline + 512);
1303 linep = line + aline;
1306 if (!fgets(linep, aline - (linep - line), fp))
1308 linep += strlen(linep);
1309 if (linep == line || linep[-1] != '\n')
1312 linep = line + intag;
1315 if (line[intag] == '-' && !strncmp(line + 1, line + intag + 1, intag - 2))
1322 else if (line[0] == '+' && line[1] && line[1] != ':')
1324 char *tagend = strchr(line, ':');
1329 intag = tagend + 2 - line;
1330 linep = line + intag;
1333 if (*line != '=' || !line[1] || !line[2] || !line[3] || line[4] != ':')
1335 tag = line[1] << 16 | line[2] << 8 | line[3];
1338 case 'V' << 16 | 'e' << 8 | 'r':
1339 tagsversion = atoi(line + 6);
1340 addselfprovides = tagsversion < 3 || strstr(line + 6, "addselfprovides") != 0;
1342 case 'P' << 16 | 'k' << 8 | 'g':
1345 if (tagsversion == 2)
1346 finish_v2_solvable(pool, data, s, filelist, nfilelist);
1347 if (addselfprovides && s->name && s->arch != ARCH_SRC && s->arch != ARCH_NOSRC)
1348 s->provides = repo_addid_dep(s->repo, s->provides, pool_rel2id(pool, s->name, s->evr, REL_EQ, 1), 0);
1351 if (split(line + 5, sp, 5) != 4)
1353 s = pool_id2solvable(pool, repo_add_solvable(repo));
1354 s->name = pool_str2id(pool, sp[0], 1);
1355 /* join back version and release */
1356 if (sp[2] && !(sp[2][0] == '-' && !sp[2][1]))
1358 s->evr = makeevr(pool, sp[1]);
1359 s->arch = pool_str2id(pool, sp[3], 1);
1361 case 'S' << 16 | 'u' << 8 | 'm':
1362 repodata_set_str(data, s - pool->solvables, SOLVABLE_SUMMARY, line + 6);
1364 case 'V' << 16 | 'n' << 8 | 'd':
1365 s->vendor = pool_str2id(pool, line + 6, 1);
1367 case 'T' << 16 | 'i' << 8 | 'm':
1370 repodata_set_num(data, s - pool->solvables, SOLVABLE_BUILDTIME, t);
1372 case 'R' << 16 | 'e' << 8 | 'q':
1373 s->requires = adddep(repo, s->requires, line + 6, -SOLVABLE_PREREQMARKER);
1375 case 'P' << 16 | 'r' << 8 | 'q':
1376 s->requires = adddep(repo, s->requires, line + 6, SOLVABLE_PREREQMARKER);
1378 case 'P' << 16 | 'r' << 8 | 'v':
1379 /* version 2 had the file list at the end of the provides */
1380 if (tagsversion == 2)
1384 int l = strlen(line + 6) + 1;
1385 if (nfilelist + l > afilelist)
1387 afilelist = nfilelist + l + 512;
1388 filelist = solv_realloc(filelist, afilelist);
1390 memcpy(filelist + nfilelist, line + 6, l);
1397 for (l = 0; l < nfilelist; l += strlen(filelist + l) + 1)
1398 s->provides = repo_addid_dep(repo, s->provides, pool_str2id(pool, filelist + l, 1), 0);
1402 s->provides = adddep(repo, s->provides, line + 6, 0);
1404 case 'F' << 16 | 'l' << 8 | 's':
1406 char *p = strrchr(line + 6, '/');
1411 did = repodata_str2dir(data, line + 6, 1);
1413 did = repodata_str2dir(data, "/", 1);
1414 repodata_add_dirstr(data, s - pool->solvables, SOLVABLE_FILELIST, did, p);
1417 case 'O' << 16 | 'b' << 8 | 's':
1418 s->obsoletes = adddep(repo, s->obsoletes, line + 6, 0);
1420 case 'C' << 16 | 'o' << 8 | 'n':
1421 s->conflicts = adddep(repo, s->conflicts, line + 6, 0);
1423 case 'R' << 16 | 'e' << 8 | 'c':
1424 s->recommends = adddep(repo, s->recommends, line + 6, 0);
1426 case 'S' << 16 | 'u' << 8 | 'p':
1427 s->supplements = adddep(repo, s->supplements, line + 6, 0);
1429 case 'S' << 16 | 'u' << 8 | 'g':
1430 s->suggests = adddep(repo, s->suggests, line + 6, 0);
1432 case 'E' << 16 | 'n' << 8 | 'h':
1433 s->enhances = adddep(repo, s->enhances, line + 6, 0);
1435 case 'I' << 16 | 'p' << 8 | 'r':
1437 Id id = line[6] == '/' ? pool_str2id(pool, line + 6, 1) : testcase_str2dep(pool, line + 6);
1438 repodata_add_idarray(data, s - pool->solvables, SOLVABLE_PREREQ_IGNOREINST, id);
1447 if (tagsversion == 2)
1448 finish_v2_solvable(pool, data, s, filelist, nfilelist);
1449 if (addselfprovides && s->name && s->arch != ARCH_SRC && s->arch != ARCH_NOSRC)
1450 s->provides = repo_addid_dep(s->repo, s->provides, pool_rel2id(pool, s->name, s->evr, REL_EQ, 1), 0);
1453 solv_free(filelist);
1454 repodata_free_dircache(data);
1455 if (!(flags & REPO_NO_INTERNALIZE))
1456 repodata_internalize(data);
1461 testcase_getpoolflags(Pool *pool)
1463 const char *str = 0;
1465 for (i = 0; poolflags2str[i].str; i++)
1467 v = pool_get_flag(pool, poolflags2str[i].flag);
1468 if (v == poolflags2str[i].def)
1470 str = pool_tmpappend(pool, str, v ? " " : " !", poolflags2str[i].str);
1472 return str ? str + 1 : "";
1476 testcase_setpoolflags(Pool *pool, const char *str)
1478 const char *p = str, *s;
1482 while (*p == ' ' || *p == '\t' || *p == ',')
1493 while (*p && *p != ' ' && *p != '\t' && *p != ',')
1495 for (i = 0; poolflags2str[i].str; i++)
1496 if (!strncmp(poolflags2str[i].str, s, p - s) && poolflags2str[i].str[p - s] == 0)
1498 if (!poolflags2str[i].str)
1500 pool_debug(pool, SOLV_ERROR, "setpoolflags: unknown flag '%.*s'\n", (int)(p - s), s);
1503 pool_set_flag(pool, poolflags2str[i].flag, v);
1509 testcase_resetpoolflags(Pool *pool)
1512 for (i = 0; poolflags2str[i].str; i++)
1513 pool_set_flag(pool, poolflags2str[i].flag, poolflags2str[i].def);
1517 testcase_getsolverflags(Solver *solv)
1519 Pool *pool = solv->pool;
1520 const char *str = 0;
1522 for (i = 0; solverflags2str[i].str; i++)
1524 v = solver_get_flag(solv, solverflags2str[i].flag);
1525 if (v == solverflags2str[i].def)
1527 str = pool_tmpappend(pool, str, v ? " " : " !", solverflags2str[i].str);
1529 return str ? str + 1 : "";
1533 testcase_setsolverflags(Solver *solv, const char *str)
1535 const char *p = str, *s;
1539 while (*p == ' ' || *p == '\t' || *p == ',')
1550 while (*p && *p != ' ' && *p != '\t' && *p != ',')
1552 for (i = 0; solverflags2str[i].str; i++)
1553 if (!strncmp(solverflags2str[i].str, s, p - s) && solverflags2str[i].str[p - s] == 0)
1555 if (!solverflags2str[i].str)
1557 pool_debug(solv->pool, SOLV_ERROR, "setsolverflags: unknown flag '%.*s'\n", (int)(p - s), s);
1560 if (solver_set_flag(solv, solverflags2str[i].flag, v) == -1)
1562 pool_debug(solv->pool, SOLV_ERROR, "setsolverflags: unsupported flag '%s'\n", solverflags2str[i].str);
1570 testcase_resetsolverflags(Solver *solv)
1573 for (i = 0; solverflags2str[i].str; i++)
1574 solver_set_flag(solv, solverflags2str[i].flag, solverflags2str[i].def);
1578 testcase_ruleid(Solver *solv, Id rid)
1584 const unsigned char *md5;
1590 solver_ruleliterals(solv, rid, &q);
1591 for (i = 0; i < q.count; i++)
1593 Id p = q.elements[i];
1594 s = testcase_solvid2str(solv->pool, p > 0 ? p : -p);
1596 s = pool_tmpjoin(solv->pool, "!", s, 0);
1597 strqueue_push(&sq, s);
1600 strqueue_sort_u(&sq);
1601 chk = solv_chksum_create(REPOKEY_TYPE_MD5);
1602 for (i = 0; i < sq.nstr; i++)
1603 solv_chksum_add(chk, sq.str[i], strlen(sq.str[i]) + 1);
1604 md5 = solv_chksum_get(chk, &md5l);
1605 s = pool_bin2hex(solv->pool, md5, md5l);
1606 chk = solv_chksum_free(chk, 0);
1612 testcase_problemid(Solver *solv, Id problem)
1617 const unsigned char *md5;
1621 /* we build a hash of all rules that define the problem */
1624 solver_findallproblemrules(solv, problem, &q);
1625 for (i = 0; i < q.count; i++)
1626 strqueue_push(&sq, testcase_ruleid(solv, q.elements[i]));
1628 strqueue_sort_u(&sq);
1629 chk = solv_chksum_create(REPOKEY_TYPE_MD5);
1630 for (i = 0; i < sq.nstr; i++)
1631 solv_chksum_add(chk, sq.str[i], strlen(sq.str[i]) + 1);
1632 md5 = solv_chksum_get(chk, &md5l);
1633 s = pool_bin2hex(solv->pool, md5, 4);
1634 chk = solv_chksum_free(chk, 0);
1640 testcase_solutionid(Solver *solv, Id problem, Id solution)
1644 const unsigned char *md5;
1648 intid = solver_solutionelement_internalid(solv, problem, solution);
1649 /* internal stuff! handle with care! */
1653 s = testcase_job2str(solv->pool, solv->job.elements[-intid - 1], solv->job.elements[-intid]);
1658 s = testcase_ruleid(solv, intid);
1660 chk = solv_chksum_create(REPOKEY_TYPE_MD5);
1661 solv_chksum_add(chk, s, strlen(s) + 1);
1662 md5 = solv_chksum_get(chk, &md5l);
1663 s = pool_bin2hex(solv->pool, md5, 4);
1664 chk = solv_chksum_free(chk, 0);
1669 testcase_alternativeid(Solver *solv, int type, Id id, Id from)
1672 Pool *pool = solv->pool;
1674 const unsigned char *md5;
1676 chk = solv_chksum_create(REPOKEY_TYPE_MD5);
1677 if (type == SOLVER_ALTERNATIVE_TYPE_RECOMMENDS)
1679 s = testcase_solvid2str(pool, from);
1680 solv_chksum_add(chk, s, strlen(s) + 1);
1681 s = testcase_dep2str(pool, id);
1682 solv_chksum_add(chk, s, strlen(s) + 1);
1684 else if (type == SOLVER_ALTERNATIVE_TYPE_RULE)
1686 s = testcase_ruleid(solv, id);
1687 solv_chksum_add(chk, s, strlen(s) + 1);
1689 md5 = solv_chksum_get(chk, &md5l);
1690 s = pool_bin2hex(pool, md5, 4);
1691 chk = solv_chksum_free(chk, 0);
1695 static struct class2str {
1699 { SOLVER_TRANSACTION_ERASE, "erase" },
1700 { SOLVER_TRANSACTION_INSTALL, "install" },
1701 { SOLVER_TRANSACTION_REINSTALLED, "reinstall" },
1702 { SOLVER_TRANSACTION_DOWNGRADED, "downgrade" },
1703 { SOLVER_TRANSACTION_CHANGED, "change" },
1704 { SOLVER_TRANSACTION_UPGRADED, "upgrade" },
1705 { SOLVER_TRANSACTION_OBSOLETED, "obsolete" },
1706 { SOLVER_TRANSACTION_MULTIINSTALL, "multiinstall" },
1707 { SOLVER_TRANSACTION_MULTIREINSTALL, "multireinstall" },
1711 static struct reason2str {
1715 { SOLVER_REASON_UNRELATED, "unrelated" },
1716 { SOLVER_REASON_UNIT_RULE, "unit" },
1717 { SOLVER_REASON_KEEP_INSTALLED, "keep" },
1718 { SOLVER_REASON_RESOLVE_JOB, "job" },
1719 { SOLVER_REASON_UPDATE_INSTALLED, "update" },
1720 { SOLVER_REASON_CLEANDEPS_ERASE, "cleandeps" },
1721 { SOLVER_REASON_RESOLVE, "resolve" },
1722 { SOLVER_REASON_WEAKDEP, "weakdep" },
1723 { SOLVER_REASON_RESOLVE_ORPHAN, "orphan" },
1725 { SOLVER_REASON_RECOMMENDED, "recommended" },
1726 { SOLVER_REASON_SUPPLEMENTED, "supplemented" },
1731 testcase_reason2str(Id reason)
1734 for (i = 0; reason2str[i].str; i++)
1735 if (reason == reason2str[i].reason)
1736 return reason2str[i].str;
1741 dump_genid(Pool *pool, Strqueue *sq, Id id, int cnt)
1749 Reldep *rd = GETRELDEP(pool, id);
1750 for (op = oplist; op->flags; op++)
1751 if (rd->flags == op->flags)
1753 cnt = dump_genid(pool, sq, rd->name, cnt);
1754 cnt = dump_genid(pool, sq, rd->evr, cnt);
1755 sprintf(cntbuf, "genid %2d: genid ", cnt++);
1756 s = pool_tmpjoin(pool, cntbuf, "op ", op->flags ? op->opname : "unknown");
1760 sprintf(cntbuf, "genid %2d: genid ", cnt++);
1761 s = pool_tmpjoin(pool, cntbuf, id ? "lit " : "null", id ? pool_id2str(pool, id) : 0);
1763 strqueue_push(sq, s);
1768 testcase_solverresult(Solver *solv, int resultflags)
1770 Pool *pool = solv->pool;
1778 if ((resultflags & TESTCASE_RESULT_TRANSACTION) != 0)
1780 Transaction *trans = solver_create_transaction(solv);
1784 for (i = 0; class2str[i].str; i++)
1787 transaction_classify_pkgs(trans, SOLVER_TRANSACTION_KEEP_PSEUDO, class2str[i].class, 0, 0, &q);
1788 for (j = 0; j < q.count; j++)
1792 if (pool->installed && pool->solvables[p].repo == pool->installed)
1793 op = transaction_obs_pkg(trans, p);
1794 s = pool_tmpjoin(pool, class2str[i].str, " ", testcase_solvid2str(pool, p));
1796 s = pool_tmpjoin(pool, s, " ", testcase_solvid2str(pool, op));
1797 strqueue_push(&sq, s);
1801 transaction_free(trans);
1803 if ((resultflags & TESTCASE_RESULT_PROBLEMS) != 0)
1805 char *probprefix, *solprefix;
1806 int problem, solution, element;
1809 pcnt = solver_problem_count(solv);
1810 for (problem = 1; problem <= pcnt; problem++)
1812 Id rid, from, to, dep;
1813 SolverRuleinfo rinfo;
1814 rid = solver_findproblemrule(solv, problem);
1815 s = testcase_problemid(solv, problem);
1816 probprefix = solv_dupjoin("problem ", s, 0);
1817 rinfo = solver_ruleinfo(solv, rid, &from, &to, &dep);
1818 s = pool_tmpjoin(pool, probprefix, " info ", solver_problemruleinfo2str(solv, rinfo, from, to, dep));
1819 strqueue_push(&sq, s);
1820 scnt = solver_solution_count(solv, problem);
1821 for (solution = 1; solution <= scnt; solution++)
1823 s = testcase_solutionid(solv, problem, solution);
1824 solprefix = solv_dupjoin(probprefix, " solution ", s);
1826 while ((element = solver_next_solutionelement(solv, problem, solution, element, &p, &op)) != 0)
1828 if (p == SOLVER_SOLUTION_JOB)
1829 s = pool_tmpjoin(pool, solprefix, " deljob ", testcase_job2str(pool, solv->job.elements[op - 1], solv->job.elements[op]));
1830 else if (p > 0 && op == 0)
1831 s = pool_tmpjoin(pool, solprefix, " erase ", testcase_solvid2str(pool, p));
1832 else if (p > 0 && op > 0)
1834 s = pool_tmpjoin(pool, solprefix, " replace ", testcase_solvid2str(pool, p));
1835 s = pool_tmpappend(pool, s, " ", testcase_solvid2str(pool, op));
1837 else if (p < 0 && op > 0)
1838 s = pool_tmpjoin(pool, solprefix, " allow ", testcase_solvid2str(pool, op));
1840 s = pool_tmpjoin(pool, solprefix, " unknown", 0);
1841 strqueue_push(&sq, s);
1843 solv_free(solprefix);
1845 solv_free(probprefix);
1849 if ((resultflags & TESTCASE_RESULT_ORPHANED) != 0)
1854 solver_get_orphaned(solv, &q);
1855 for (i = 0; i < q.count; i++)
1857 s = pool_tmpjoin(pool, "orphaned ", testcase_solvid2str(pool, q.elements[i]), 0);
1858 strqueue_push(&sq, s);
1863 if ((resultflags & TESTCASE_RESULT_RECOMMENDED) != 0)
1869 solver_get_recommendations(solv, &qr, &qs, 0);
1870 for (i = 0; i < qr.count; i++)
1872 s = pool_tmpjoin(pool, "recommended ", testcase_solvid2str(pool, qr.elements[i]), 0);
1873 strqueue_push(&sq, s);
1875 for (i = 0; i < qs.count; i++)
1877 s = pool_tmpjoin(pool, "suggested ", testcase_solvid2str(pool, qs.elements[i]), 0);
1878 strqueue_push(&sq, s);
1884 if ((resultflags & TESTCASE_RESULT_UNNEEDED) != 0)
1890 solver_get_unneeded(solv, &q, 0);
1891 solver_get_unneeded(solv, &qf, 1);
1892 for (i = j = 0; i < q.count; i++)
1894 /* we rely on qf containing a subset of q in the same order */
1895 if (j < qf.count && q.elements[i] == qf.elements[j])
1897 s = pool_tmpjoin(pool, "unneeded_filtered ", testcase_solvid2str(pool, q.elements[i]), 0);
1901 s = pool_tmpjoin(pool, "unneeded ", testcase_solvid2str(pool, q.elements[i]), 0);
1902 strqueue_push(&sq, s);
1907 if ((resultflags & TESTCASE_RESULT_ALTERNATIVES) != 0)
1915 cnt = solver_alternatives_count(solv);
1916 for (alternative = 1; alternative <= cnt; alternative++)
1918 Id id, from, chosen;
1920 int type = solver_get_alternative(solv, alternative, &id, &from, &chosen, &q, 0);
1921 altprefix = solv_dupjoin("alternative ", testcase_alternativeid(solv, type, id, from), " ");
1923 if (type == SOLVER_ALTERNATIVE_TYPE_RECOMMENDS)
1925 char *s = pool_tmpjoin(pool, altprefix, num, testcase_solvid2str(pool, from));
1926 s = pool_tmpappend(pool, s, " recommends ", testcase_dep2str(pool, id));
1927 strqueue_push(&sq, s);
1929 else if (type == SOLVER_ALTERNATIVE_TYPE_RULE)
1931 /* map choice rules back to pkg rules */
1932 if (solver_ruleclass(solv, id) == SOLVER_RULE_CHOICE)
1933 id = solver_rule2pkgrule(solv, id);
1934 solver_allruleinfos(solv, id, &rq);
1935 for (i = 0; i < rq.count; i += 4)
1937 int rtype = rq.elements[i];
1938 if ((rtype & SOLVER_RULE_TYPEMASK) == SOLVER_RULE_JOB)
1940 const char *js = testcase_job2str(pool, rq.elements[i + 2], rq.elements[i + 3]);
1941 char *s = pool_tmpjoin(pool, altprefix, num, " job ");
1942 s = pool_tmpappend(pool, s, js, 0);
1943 strqueue_push(&sq, s);
1945 else if (rtype == SOLVER_RULE_PKG_REQUIRES)
1947 char *s = pool_tmpjoin(pool, altprefix, num, testcase_solvid2str(pool, rq.elements[i + 1]));
1948 s = pool_tmpappend(pool, s, " requires ", testcase_dep2str(pool, rq.elements[i + 3]));
1949 strqueue_push(&sq, s);
1953 for (i = 0; i < q.count; i++)
1955 Id p = q.elements[i];
1957 num[0] = '0' + (i + 1) / 10;
1958 num[1] = '0' + (i + 1) % 10;
1960 s = pool_tmpjoin(pool, altprefix, num, "+ ");
1962 s = pool_tmpjoin(pool, altprefix, num, "- ");
1964 s = pool_tmpjoin(pool, altprefix, num, " ");
1965 s = pool_tmpappend(pool, s, testcase_solvid2str(pool, p < 0 ? -p : p), 0);
1966 strqueue_push(&sq, s);
1968 solv_free(altprefix);
1973 if ((resultflags & TESTCASE_RESULT_RULES) != 0)
1975 /* dump all rules */
1977 SolverRuleinfo rclass;
1982 for (rid = 1; (rclass = solver_ruleclass(solv, rid)) != SOLVER_RULE_UNKNOWN; rid++)
1987 case SOLVER_RULE_PKG:
1990 case SOLVER_RULE_UPDATE:
1993 case SOLVER_RULE_FEATURE:
1994 prefix = "feature ";
1996 case SOLVER_RULE_JOB:
1999 case SOLVER_RULE_DISTUPGRADE:
2000 prefix = "distupgrade ";
2002 case SOLVER_RULE_INFARCH:
2003 prefix = "infarch ";
2005 case SOLVER_RULE_CHOICE:
2008 case SOLVER_RULE_LEARNT:
2011 case SOLVER_RULE_BEST:
2014 case SOLVER_RULE_YUMOBS:
2018 prefix = "unknown ";
2021 prefix = solv_dupjoin("rule ", prefix, testcase_ruleid(solv, rid));
2022 solver_ruleliterals(solv, rid, &q);
2023 if (rclass == SOLVER_RULE_FEATURE && q.count == 1 && q.elements[0] == -SYSTEMSOLVABLE)
2025 for (i = 0; i < q.count; i++)
2027 Id p = q.elements[i];
2030 s = pool_tmpjoin(pool, prefix, " -", testcase_solvid2str(pool, -p));
2032 s = pool_tmpjoin(pool, prefix, " ", testcase_solvid2str(pool, p));
2033 strqueue_push(&sq, s);
2039 if ((resultflags & TESTCASE_RESULT_GENID) != 0)
2041 for (i = 0 ; i < solv->job.count; i += 2)
2044 if (solv->job.elements[i] != (SOLVER_NOOP | SOLVER_SOLVABLE_PROVIDES))
2046 id = solv->job.elements[i + 1];
2047 s = testcase_dep2str(pool, id);
2048 strqueue_push(&sq, pool_tmpjoin(pool, "genid dep ", s, 0));
2049 if ((id2 = testcase_str2dep(pool, s)) != id)
2051 s = pool_tmpjoin(pool, "genid roundtrip error: ", testcase_dep2str(pool, id2), 0);
2052 strqueue_push(&sq, s);
2054 dump_genid(pool, &sq, id, 1);
2057 if ((resultflags & TESTCASE_RESULT_REASON) != 0)
2061 FOR_POOL_SOLVABLES(p)
2064 int reason = solver_describe_decision(solv, p, &info);
2065 if (reason == SOLVER_REASON_UNRELATED)
2067 if (reason == SOLVER_REASON_WEAKDEP)
2069 solver_describe_weakdep_decision(solv, p, &whyq);
2072 for (i = 0; i < whyq.count; i += 3)
2074 reason = whyq.elements[i];
2075 p2 = whyq.elements[i + 1];
2076 id = whyq.elements[i + 2];
2077 s = pool_tmpjoin(pool, "reason ", testcase_solvid2str(pool, p), 0);
2078 s = pool_tmpappend(pool, s, " ", testcase_reason2str(reason));
2079 s = pool_tmpappend(pool, s, " ", testcase_dep2str(pool, id));
2081 s = pool_tmpappend(pool, s, " ", testcase_solvid2str(pool, p2));
2082 strqueue_push(&sq, s);
2087 s = pool_tmpjoin(pool, "reason ", testcase_solvid2str(pool, p), 0);
2088 s = pool_tmpappend(pool, s, " ", testcase_reason2str(reason));
2090 s = pool_tmpappend(pool, s, " ", testcase_ruleid(solv, info));
2091 strqueue_push(&sq, s);
2096 result = strqueue_join(&sq);
2103 testcase_write(Solver *solv, const char *dir, int resultflags, const char *testcasename, const char *resultname)
2105 Pool *pool = solv->pool;
2116 testcasename = "testcase.t";
2118 resultname = "solver.result";
2120 if (mkdir(dir, 0777) && errno != EEXIST)
2122 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: could not create directory '%s'\n", dir);
2126 FOR_REPOS(repoid, repo)
2128 const char *name = testcase_repoid2str(pool, repoid);
2130 if (repo->subpriority)
2131 sprintf(priobuf, "%d.%d", repo->priority, repo->subpriority);
2133 sprintf(priobuf, "%d", repo->priority);
2134 out = pool_tmpjoin(pool, name, ".repo", ".gz");
2135 cmd = pool_tmpjoin(pool, "repo ", name, " ");
2136 cmd = pool_tmpappend(pool, cmd, priobuf, " ");
2137 cmd = pool_tmpappend(pool, cmd, "testtags ", out);
2138 strqueue_push(&sq, cmd);
2139 out = pool_tmpjoin(pool, dir, "/", out);
2140 if (!(fp = solv_xfopen(out, "w")))
2142 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: could not open '%s' for writing\n", out);
2146 testcase_write_testtags(repo, fp);
2149 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: write error\n");
2154 /* hmm, this is not optimal... we currently search for the lowest score */
2156 arch = pool->solvables[SYSTEMSOLVABLE].arch;
2157 for (i = 0; i < pool->lastarch; i++)
2159 if (pool->id2arch[i] == 1 && !lowscore)
2161 if (pool->id2arch[i] > 0x10000 && (!lowscore || pool->id2arch[i] < lowscore))
2164 lowscore = pool->id2arch[i];
2167 cmd = pool_tmpjoin(pool, "system ", pool->lastarch ? pool_id2str(pool, arch) : "unset", 0);
2168 for (i = 0; disttype2str[i].str != 0; i++)
2169 if (pool->disttype == disttype2str[i].type)
2171 pool_tmpappend(pool, cmd, " ", disttype2str[i].str ? disttype2str[i].str : "unknown");
2172 if (pool->installed)
2173 cmd = pool_tmpappend(pool, cmd, " ", testcase_repoid2str(pool, pool->installed->repoid));
2174 strqueue_push(&sq, cmd);
2175 s = testcase_getpoolflags(solv->pool);
2178 cmd = pool_tmpjoin(pool, "poolflags ", s, 0);
2179 strqueue_push(&sq, cmd);
2182 if (pool->vendorclasses)
2185 for (i = 0; pool->vendorclasses[i]; i++)
2187 cmd = pool_tmpappend(pool, cmd ? cmd : "vendorclass", " ", pool->vendorclasses[i]);
2188 if (!pool->vendorclasses[i + 1])
2190 strqueue_push(&sq, cmd);
2197 /* dump disabled packages (must come before the namespace/job lines) */
2198 if (pool->considered)
2201 FOR_POOL_SOLVABLES(p)
2202 if (!MAPTST(pool->considered, p))
2204 cmd = pool_tmpjoin(pool, "disable pkg ", testcase_solvid2str(pool, p), 0);
2205 strqueue_push(&sq, cmd);
2209 s = testcase_getsolverflags(solv);
2212 cmd = pool_tmpjoin(pool, "solverflags ", s, 0);
2213 strqueue_push(&sq, cmd);
2216 /* now dump all the ns callback values we know */
2217 if (pool->nscallback)
2221 for (rid = 1; rid < pool->nrels; rid++)
2223 Reldep *rd = pool->rels + rid;
2224 if (rd->flags != REL_NAMESPACE || rd->name == NAMESPACE_OTHERPROVIDERS)
2226 /* evaluate all namespace ids, skip empty results */
2227 d = pool_whatprovides(pool, MAKERELDEP(rid));
2228 if (!d || !pool->whatprovidesdata[d])
2230 cmd = pool_tmpjoin(pool, "namespace ", pool_id2str(pool, rd->name), "(");
2231 cmd = pool_tmpappend(pool, cmd, pool_id2str(pool, rd->evr), ")");
2232 for (; pool->whatprovidesdata[d]; d++)
2233 cmd = pool_tmpappend(pool, cmd, " ", testcase_solvid2str(pool, pool->whatprovidesdata[d]));
2234 strqueue_push(&sq, cmd);
2238 for (i = 0; i < solv->job.count; i += 2)
2240 cmd = (char *)testcase_job2str(pool, solv->job.elements[i], solv->job.elements[i + 1]);
2241 cmd = pool_tmpjoin(pool, "job ", cmd, 0);
2242 strqueue_push(&sq, cmd);
2249 for (i = 0; resultflags2str[i].str; i++)
2250 if ((resultflags & resultflags2str[i].flag) != 0)
2251 cmd = pool_tmpappend(pool, cmd, cmd ? "," : 0, resultflags2str[i].str);
2252 cmd = pool_tmpjoin(pool, "result ", cmd ? cmd : "?", 0);
2253 cmd = pool_tmpappend(pool, cmd, " ", resultname);
2254 strqueue_push(&sq, cmd);
2255 result = testcase_solverresult(solv, resultflags);
2256 if (!strcmp(resultname, "<inline>"))
2260 strqueue_init(&rsq);
2261 strqueue_split(&rsq, result);
2262 for (i = 0; i < rsq.nstr; i++)
2264 cmd = pool_tmpjoin(pool, "#>", rsq.str[i], 0);
2265 strqueue_push(&sq, cmd);
2267 strqueue_free(&rsq);
2271 out = pool_tmpjoin(pool, dir, "/", resultname);
2272 if (!(fp = fopen(out, "w")))
2274 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: could not open '%s' for writing\n", out);
2279 if (result && *result && fwrite(result, strlen(result), 1, fp) != 1)
2281 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: write error\n");
2289 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: write error\n");
2297 cmd = strqueue_join(&sq);
2298 out = pool_tmpjoin(pool, dir, "/", testcasename);
2299 if (!(fp = fopen(out, "w")))
2301 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: could not open '%s' for writing\n", out);
2305 if (*cmd && fwrite(cmd, strlen(cmd), 1, fp) != 1)
2307 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: write error\n");
2314 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: write error\n");
2324 read_inline_file(FILE *fp, char **bufp, char **bufpp, int *buflp)
2326 char *result = solv_malloc(1024);
2333 if (rp - result + 256 >= resultl)
2335 resultl = rp - result;
2336 result = solv_realloc(result, resultl + 1024);
2337 rp = result + resultl;
2340 if (!fgets(rp, resultl - (rp - result), fp))
2343 if (rl && (rp == result || rp[-1] == '\n'))
2345 if (rl > 1 && rp[0] == '#' && rp[1] == '>')
2347 memmove(rp, rp + 2, rl - 2);
2352 while (rl + 16 > *buflp)
2354 *bufp = solv_realloc(*bufp, *buflp + 512);
2357 memmove(*bufp, rp, rl);
2358 if ((*bufp)[rl - 1] == '\n')
2364 (*bufpp) = *bufp + rl;
2381 char *result = solv_malloc(1024);
2388 if (rp - result + 256 >= resultl)
2390 resultl = rp - result;
2391 result = solv_realloc(result, resultl + 1024);
2392 rp = result + resultl;
2395 rl = fread(rp, 1, resultl - (rp - result), fp);
2407 str2resultflags(Pool *pool, char *s) /* modifies the string! */
2409 int i, resultflags = 0;
2412 char *se = strchr(s, ',');
2415 for (i = 0; resultflags2str[i].str; i++)
2416 if (!strcmp(s, resultflags2str[i].str))
2418 resultflags |= resultflags2str[i].flag;
2421 if (!resultflags2str[i].str)
2422 pool_debug(pool, SOLV_ERROR, "result: unknown flag '%s'\n", s);
2429 testcase_read(Pool *pool, FILE *fp, const char *testcase, Queue *job, char **resultp, int *resultflagsp)
2434 char *testcasedir, *s;
2440 int poolflagsreset = 0;
2441 int missing_features = 0;
2445 if (!fp && !(fp = fopen(testcase, "r")))
2447 pool_debug(pool, SOLV_ERROR, "testcase_read: could not open '%s'\n", testcase);
2450 testcasedir = solv_strdup(testcase);
2451 if ((s = strrchr(testcasedir, '/')) != 0)
2456 buf = solv_malloc(bufl);
2461 if (bufp - buf + 16 > bufl)
2464 buf = solv_realloc(buf, bufl + 512);
2468 if (!fgets(bufp, bufl - (bufp - buf), fp))
2472 if (!l || buf[l - 1] != '\n')
2479 while (*s && (*s == ' ' || *s == '\t'))
2481 if (!*s || *s == '#')
2484 /* split it in pieces */
2487 while (*s == ' ' || *s == '\t')
2491 pieces = solv_extend(pieces, npieces, 1, sizeof(*pieces), 7);
2492 pieces[npieces++] = s;
2493 while (*s && *s != ' ' && *s != '\t')
2498 pieces = solv_extend(pieces, npieces, 1, sizeof(*pieces), 7);
2499 pieces[npieces] = 0;
2500 if (!strcmp(pieces[0], "repo") && npieces >= 4)
2502 Repo *repo = repo_create(pool, pieces[1]);
2508 if (!poolflagsreset)
2511 testcase_resetpoolflags(pool); /* hmm */
2513 if (sscanf(pieces[2], "%d.%d", &prio, &subprio) != 2)
2516 prio = atoi(pieces[2]);
2518 repo->priority = prio;
2519 repo->subpriority = subprio;
2520 if (strcmp(pieces[3], "empty") != 0)
2522 const char *repotype = pool_tmpjoin(pool, pieces[3], 0, 0); /* gets overwritten in <inline> case */
2523 if (!strcmp(pieces[4], "<inline>"))
2525 char *idata = read_inline_file(fp, &buf, &bufp, &bufl);
2527 rfp = solv_xfopen_buf(rdata, &idata, 0, "rf");
2531 rdata = pool_tmpjoin(pool, testcasedir, pieces[4], 0);
2532 rfp = solv_xfopen(rdata, "r");
2536 pool_debug(pool, SOLV_ERROR, "testcase_read: could not open '%s'\n", rdata);
2538 else if (!strcmp(repotype, "testtags"))
2540 testcase_add_testtags(repo, rfp, 0);
2543 else if (!strcmp(repotype, "solv"))
2545 repo_add_solv(repo, rfp, 0);
2549 else if (!strcmp(repotype, "helix"))
2551 extern int repo_add_helix(Repo *repo, FILE *fp, int flags);
2552 repo_add_helix(repo, rfp, 0);
2559 pool_debug(pool, SOLV_ERROR, "testcase_read: unknown repo type for repo '%s'\n", repo->name);
2563 else if (!strcmp(pieces[0], "system") && npieces >= 3)
2567 /* must set the disttype before the arch */
2569 if (strcmp(pieces[2], "*") != 0)
2571 char *dp = pieces[2];
2574 char *dpe = strchr(dp, ',');
2577 for (i = 0; disttype2str[i].str != 0; i++)
2578 if (!strcmp(disttype2str[i].str, dp))
2582 if (disttype2str[i].str)
2584 #ifdef MULTI_SEMANTICS
2585 if (pool->disttype != disttype2str[i].type)
2586 pool_setdisttype(pool, disttype2str[i].type);
2588 if (pool->disttype == disttype2str[i].type)
2595 pool_debug(pool, SOLV_ERROR, "testcase_read: system: could not change disttype to '%s'\n", pieces[2]);
2596 missing_features = 1;
2599 if (strcmp(pieces[1], "unset") == 0)
2600 pool_setarch(pool, 0);
2601 else if (pieces[1][0] == ':')
2602 pool_setarchpolicy(pool, pieces[1] + 1);
2604 pool_setarch(pool, pieces[1]);
2607 Repo *repo = testcase_str2repo(pool, pieces[3]);
2609 pool_debug(pool, SOLV_ERROR, "testcase_read: system: unknown repo '%s'\n", pieces[3]);
2611 pool_set_installed(pool, repo);
2614 else if (!strcmp(pieces[0], "job") && npieces > 1)
2620 pool_addfileprovides(pool);
2621 pool_createwhatprovides(pool);
2624 if (npieces >= 3 && !strcmp(pieces[2], "selection"))
2626 addselectionjob(pool, pieces + 1, npieces - 1, job);
2630 for (sp = pieces[1]; sp < pieces[npieces - 1]; sp++)
2633 how = testcase_str2job(pool, pieces[1], &what);
2634 if (how >= 0 && job)
2635 queue_push2(job, how, what);
2637 else if (!strcmp(pieces[0], "vendorclass") && npieces > 1)
2639 pool_addvendorclass(pool, (const char **)(pieces + 1));
2641 else if (!strcmp(pieces[0], "namespace") && npieces > 1)
2643 int i = strlen(pieces[1]);
2644 s = strchr(pieces[1], '(');
2645 if (!s && pieces[1][i - 1] != ')')
2647 pool_debug(pool, SOLV_ERROR, "testcase_read: bad namespace '%s'\n", pieces[1]);
2655 pieces[1][i - 1] = 0;
2656 name = pool_str2id(pool, pieces[1], 1);
2657 evr = pool_str2id(pool, s + 1, 1);
2659 pieces[1][i - 1] = ')';
2660 id = pool_rel2id(pool, name, evr, REL_NAMESPACE, 1);
2661 for (i = 2; i < npieces; i++)
2662 queue_push(&q, testcase_str2solvid(pool, pieces[i]));
2663 /* now do the callback */
2666 pool_addfileprovides(pool);
2667 pool_createwhatprovides(pool);
2670 pool->whatprovides_rel[GETRELID(id)] = pool_queuetowhatprovides(pool, &q);
2674 else if (!strcmp(pieces[0], "poolflags"))
2677 if (!poolflagsreset)
2680 testcase_resetpoolflags(pool); /* hmm */
2682 for (i = 1; i < npieces; i++)
2683 testcase_setpoolflags(pool, pieces[i]);
2685 else if (!strcmp(pieces[0], "solverflags") && npieces > 1)
2690 solv = solver_create(pool);
2691 testcase_resetsolverflags(solv);
2693 for (i = 1; i < npieces; i++)
2694 testcase_setsolverflags(solv, pieces[i]);
2696 else if (!strcmp(pieces[0], "result") && npieces > 1)
2699 int resultflags = str2resultflags(pool, pieces[1]);
2703 rdata = pool_tmpjoin(pool, testcasedir, pieces[2], 0);
2704 if (!strcmp(pieces[2], "<inline>"))
2705 result = read_inline_file(fp, &buf, &bufp, &bufl);
2708 FILE *rfp = fopen(rdata, "r");
2710 pool_debug(pool, SOLV_ERROR, "testcase_read: could not open '%s'\n", rdata);
2713 result = read_file(rfp);
2723 *resultflagsp = resultflags;
2725 else if (!strcmp(pieces[0], "nextjob") && npieces == 1)
2729 else if (!strcmp(pieces[0], "disable") && npieces == 3)
2732 if (strcmp(pieces[1], "pkg"))
2734 pool_debug(pool, SOLV_ERROR, "testcase_read: bad disable type '%s'\n", pieces[1]);
2738 pool_createwhatprovides(pool);
2740 if (!pool->considered)
2742 pool->considered = solv_calloc(1, sizeof(Map));
2743 map_init(pool->considered, pool->nsolvables);
2744 map_setall(pool->considered);
2746 p = testcase_str2solvid(pool, pieces[2]);
2748 MAPCLR(pool->considered, p);
2750 pool_debug(pool, SOLV_ERROR, "disable: unknown package '%s'\n", pieces[2]);
2752 else if (!strcmp(pieces[0], "feature"))
2755 for (i = 1; i < npieces; i++)
2757 for (j = 0; features[j]; j++)
2758 if (!strcmp(pieces[i], features[j]))
2762 pool_debug(pool, SOLV_ERROR, "testcase_read: missing feature '%s'\n", pieces[i]);
2766 if (missing_features)
2769 else if (!strcmp(pieces[0], "genid") && npieces > 1)
2776 for (sp = pieces[2]; sp < pieces[npieces - 1]; sp++)
2780 genid = solv_extend(genid, ngenid, 1, sizeof(*genid), 7);
2781 if (!strcmp(pieces[1], "op") && npieces > 2)
2784 for (op = oplist; op->flags; op++)
2785 if (!strncmp(pieces[2], op->opname, strlen(op->opname)))
2789 pool_debug(pool, SOLV_ERROR, "testcase_read: genid: unknown op '%s'\n", pieces[2]);
2794 pool_debug(pool, SOLV_ERROR, "testcase_read: genid: out of stack\n");
2798 id = pool_rel2id(pool, genid[ngenid] , genid[ngenid + 1], op->flags, 1);
2800 else if (!strcmp(pieces[1], "lit"))
2801 id = pool_str2id(pool, npieces > 2 ? pieces[2] : "", 1);
2802 else if (!strcmp(pieces[1], "null"))
2804 else if (!strcmp(pieces[1], "dep"))
2805 id = testcase_str2dep(pool, pieces[2]);
2808 pool_debug(pool, SOLV_ERROR, "testcase_read: genid: unknown command '%s'\n", pieces[1]);
2811 genid[ngenid++] = id;
2815 pool_debug(pool, SOLV_ERROR, "testcase_read: cannot parse command '%s'\n", pieces[0]);
2818 while (job && ngenid > 0)
2819 queue_push2(job, SOLVER_NOOP | SOLVER_SOLVABLE_PROVIDES, genid[--ngenid]);
2820 genid = solv_free(genid);
2821 buf = solv_free(buf);
2822 pieces = solv_free(pieces);
2823 solv_free(testcasedir);
2826 pool_addfileprovides(pool);
2827 pool_createwhatprovides(pool);
2831 solv = solver_create(pool);
2832 testcase_resetsolverflags(solv);
2836 if (missing_features)
2841 *resultflagsp = 77; /* hack for testsolv */
2847 testcase_resultdiff(const char *result1, const char *result2)
2849 Strqueue sq1, sq2, osq;
2851 strqueue_init(&sq1);
2852 strqueue_init(&sq2);
2853 strqueue_init(&osq);
2854 strqueue_split(&sq1, result1);
2855 strqueue_split(&sq2, result2);
2856 strqueue_sort(&sq1);
2857 strqueue_sort(&sq2);
2858 strqueue_diff(&sq1, &sq2, &osq);
2859 r = osq.nstr ? strqueue_join(&osq) : 0;
2860 strqueue_free(&sq1);
2861 strqueue_free(&sq2);
2862 strqueue_free(&osq);