2 * Copyright (c) 2012, Novell Inc.
4 * This program is licensed under the BSD license, read LICENSE.BSD
5 * for further information
17 #include "poolvendor.h"
20 #include "repo_solv.h"
22 #include "solverdebug.h"
25 #include "selection.h"
26 #include "solv_xfopen.h"
27 #if ENABLE_TESTCASE_HELIXREPO
28 #include "ext/repo_helix.h"
35 /* see repo_testcase.c */
40 extern struct oplist oplist[];
43 static struct job2str {
47 { SOLVER_NOOP, "noop" },
48 { SOLVER_INSTALL, "install" },
49 { SOLVER_ERASE, "erase" },
50 { SOLVER_UPDATE, "update" },
51 { SOLVER_WEAKENDEPS, "weakendeps" },
52 { SOLVER_MULTIVERSION, "multiversion" },
53 { SOLVER_MULTIVERSION, "noobsoletes" }, /* old name */
54 { SOLVER_LOCK, "lock" },
55 { SOLVER_DISTUPGRADE, "distupgrade" },
56 { SOLVER_VERIFY, "verify" },
57 { SOLVER_DROP_ORPHANED, "droporphaned" },
58 { SOLVER_USERINSTALLED, "userinstalled" },
59 { SOLVER_ALLOWUNINSTALL, "allowuninstall" },
60 { SOLVER_FAVOR, "favor" },
61 { SOLVER_DISFAVOR, "disfavor" },
62 { SOLVER_BLACKLIST, "blacklist" },
63 { SOLVER_EXCLUDEFROMWEAK, "excludefromweak" },
67 static struct jobflags2str {
71 { SOLVER_WEAK, "weak" },
72 { SOLVER_ESSENTIAL, "essential" },
73 { SOLVER_CLEANDEPS, "cleandeps" },
74 { SOLVER_ORUPDATE, "orupdate" },
75 { SOLVER_FORCEBEST, "forcebest" },
76 { SOLVER_TARGETED, "targeted" },
77 { SOLVER_NOTBYUSER, "notbyuser" },
78 { SOLVER_SETEV, "setev" },
79 { SOLVER_SETEVR, "setevr" },
80 { SOLVER_SETARCH, "setarch" },
81 { SOLVER_SETVENDOR, "setvendor" },
82 { SOLVER_SETREPO, "setrepo" },
83 { SOLVER_NOAUTOSET, "noautoset" },
87 static struct resultflags2str {
90 } resultflags2str[] = {
91 { TESTCASE_RESULT_TRANSACTION, "transaction" },
92 { TESTCASE_RESULT_PROBLEMS, "problems" },
93 { TESTCASE_RESULT_ORPHANED, "orphaned" },
94 { TESTCASE_RESULT_RECOMMENDED, "recommended" },
95 { TESTCASE_RESULT_UNNEEDED, "unneeded" },
96 { TESTCASE_RESULT_ALTERNATIVES, "alternatives" },
97 { TESTCASE_RESULT_RULES, "rules" },
98 { TESTCASE_RESULT_GENID, "genid" },
99 { TESTCASE_RESULT_REASON, "reason" },
100 { TESTCASE_RESULT_CLEANDEPS, "cleandeps" },
101 { TESTCASE_RESULT_JOBS, "jobs" },
102 { TESTCASE_RESULT_USERINSTALLED, "userinstalled" },
103 { TESTCASE_RESULT_ORDER, "order" },
104 { TESTCASE_RESULT_ORDEREDGES, "orderedges" },
105 { TESTCASE_RESULT_PROOF, "proof" },
109 static struct solverflags2str {
113 } solverflags2str[] = {
114 { SOLVER_FLAG_ALLOW_DOWNGRADE, "allowdowngrade", 0 },
115 { SOLVER_FLAG_ALLOW_NAMECHANGE, "allownamechange", 1 },
116 { SOLVER_FLAG_ALLOW_ARCHCHANGE, "allowarchchange", 0 },
117 { SOLVER_FLAG_ALLOW_VENDORCHANGE, "allowvendorchange", 0 },
118 { SOLVER_FLAG_ALLOW_UNINSTALL, "allowuninstall", 0 },
119 { SOLVER_FLAG_NO_UPDATEPROVIDE, "noupdateprovide", 0 },
120 { SOLVER_FLAG_SPLITPROVIDES, "splitprovides", 0 },
121 { SOLVER_FLAG_IGNORE_RECOMMENDED, "ignorerecommended", 0 },
122 { SOLVER_FLAG_ADD_ALREADY_RECOMMENDED, "addalreadyrecommended", 0 },
123 { SOLVER_FLAG_NO_INFARCHCHECK, "noinfarchcheck", 0 },
124 { SOLVER_FLAG_KEEP_EXPLICIT_OBSOLETES, "keepexplicitobsoletes", 0 },
125 { SOLVER_FLAG_BEST_OBEY_POLICY, "bestobeypolicy", 0 },
126 { SOLVER_FLAG_NO_AUTOTARGET, "noautotarget", 0 },
127 { SOLVER_FLAG_DUP_ALLOW_DOWNGRADE, "dupallowdowngrade", 1 },
128 { SOLVER_FLAG_DUP_ALLOW_ARCHCHANGE, "dupallowarchchange", 1 },
129 { SOLVER_FLAG_DUP_ALLOW_VENDORCHANGE, "dupallowvendorchange", 1 },
130 { SOLVER_FLAG_DUP_ALLOW_NAMECHANGE, "dupallownamechange", 1 },
131 { SOLVER_FLAG_KEEP_ORPHANS, "keeporphans", 0 },
132 { SOLVER_FLAG_BREAK_ORPHANS, "breakorphans", 0 },
133 { SOLVER_FLAG_FOCUS_INSTALLED, "focusinstalled", 0 },
134 { SOLVER_FLAG_YUM_OBSOLETES, "yumobsoletes", 0 },
135 { SOLVER_FLAG_NEED_UPDATEPROVIDE, "needupdateprovide", 0 },
136 { SOLVER_FLAG_URPM_REORDER, "urpmreorder", 0 },
137 { SOLVER_FLAG_FOCUS_BEST, "focusbest", 0 },
138 { SOLVER_FLAG_STRONG_RECOMMENDS, "strongrecommends", 0 },
139 { SOLVER_FLAG_INSTALL_ALSO_UPDATES, "installalsoupdates", 0 },
140 { SOLVER_FLAG_ONLY_NAMESPACE_RECOMMENDED, "onlynamespacerecommended", 0 },
141 { SOLVER_FLAG_STRICT_REPO_PRIORITY, "strictrepopriority", 0 },
145 static struct poolflags2str {
149 } poolflags2str[] = {
150 { POOL_FLAG_PROMOTEEPOCH, "promoteepoch", 0 },
151 { POOL_FLAG_FORBIDSELFCONFLICTS, "forbidselfconflicts", 0 },
152 { POOL_FLAG_OBSOLETEUSESPROVIDES, "obsoleteusesprovides", 0 },
153 { POOL_FLAG_IMPLICITOBSOLETEUSESPROVIDES, "implicitobsoleteusesprovides", 0 },
154 { POOL_FLAG_OBSOLETEUSESCOLORS, "obsoleteusescolors", 0 },
155 { POOL_FLAG_IMPLICITOBSOLETEUSESCOLORS, "implicitobsoleteusescolors", 0 },
156 { POOL_FLAG_NOINSTALLEDOBSOLETES, "noinstalledobsoletes", 0 },
157 { POOL_FLAG_HAVEDISTEPOCH, "havedistepoch", 0 },
158 { POOL_FLAG_NOOBSOLETESMULTIVERSION, "noobsoletesmultiversion", 0 },
159 { POOL_FLAG_ADDFILEPROVIDESFILTERED, "addfileprovidesfiltered", 0 },
160 { POOL_FLAG_NOWHATPROVIDESAUX, "nowhatprovidesaux", 0 },
161 { POOL_FLAG_WHATPROVIDESWITHDISABLED, "whatprovideswithdisabled", 0 },
165 static struct disttype2str {
169 { DISTTYPE_RPM, "rpm" },
170 { DISTTYPE_DEB, "deb" },
171 { DISTTYPE_ARCH, "arch" },
172 { DISTTYPE_HAIKU, "haiku" },
173 { DISTTYPE_CONDA, "conda" },
177 static struct selflags2str {
181 { SELECTION_NAME, "name" },
182 { SELECTION_PROVIDES, "provides" },
183 { SELECTION_FILELIST, "filelist" },
184 { SELECTION_CANON, "canon" },
185 { SELECTION_DOTARCH, "dotarch" },
186 { SELECTION_REL, "rel" },
187 { SELECTION_INSTALLED_ONLY, "installedonly" },
188 { SELECTION_GLOB, "glob" },
189 { SELECTION_FLAT, "flat" },
190 { SELECTION_NOCASE, "nocase" },
191 { SELECTION_SOURCE_ONLY, "sourceonly" },
192 { SELECTION_WITH_SOURCE, "withsource" },
193 { SELECTION_SKIP_KIND, "skipkind" },
194 { SELECTION_MATCH_DEPSTR, "depstr" },
195 { SELECTION_WITH_DISABLED, "withdisabled" },
196 { SELECTION_WITH_BADARCH, "withbadarch" },
197 { SELECTION_ADD, "add" },
198 { SELECTION_SUBTRACT, "subtract" },
199 { SELECTION_FILTER, "filter" },
203 static const char *features[] = {
204 #ifdef ENABLE_LINKED_PKGS
207 #ifdef ENABLE_COMPLEX_DEPS
210 #if ENABLE_TESTCASE_HELIXREPO
211 "testcase_helixrepo",
216 typedef struct strqueue {
221 #define STRQUEUE_BLOCK 63
224 strqueue_init(Strqueue *q)
231 strqueue_free(Strqueue *q)
234 for (i = 0; i < q->nstr; i++)
235 solv_free(q->str[i]);
236 q->str = solv_free(q->str);
241 strqueue_push(Strqueue *q, const char *s)
243 q->str = solv_extend(q->str, q->nstr, 1, sizeof(*q->str), STRQUEUE_BLOCK);
244 q->str[q->nstr++] = solv_strdup(s);
248 strqueue_pushjoin(Strqueue *q, const char *s1, const char *s2, const char *s3)
250 q->str = solv_extend(q->str, q->nstr, 1, sizeof(*q->str), STRQUEUE_BLOCK);
251 q->str[q->nstr++] = solv_dupjoin(s1, s2, s3);
255 strqueue_sort_cmp(const void *ap, const void *bp, void *dp)
257 const char *a = *(const char **)ap;
258 const char *b = *(const char **)bp;
259 return strcmp(a ? a : "", b ? b : "");
263 strqueue_sort(Strqueue *q)
266 solv_sort(q->str, q->nstr, sizeof(*q->str), strqueue_sort_cmp, 0);
270 strqueue_sort_u(Strqueue *q)
274 for (i = j = 0; i < q->nstr; i++)
275 if (!j || strqueue_sort_cmp(q->str + i, q->str + j - 1, 0) != 0)
276 q->str[j++] = q->str[i];
281 strqueue_join(Strqueue *q)
285 for (i = 0; i < q->nstr; i++)
287 l += strlen(q->str[i]) + 1;
288 l++; /* trailing \0 */
291 for (i = 0; i < q->nstr; i++)
294 strcpy(rp, q->str[i]);
303 strqueue_split(Strqueue *q, const char *s)
308 while ((p = strchr(s, '\n')) != 0)
310 q->str = solv_extend(q->str, q->nstr, 1, sizeof(*q->str), STRQUEUE_BLOCK);
311 q->str[q->nstr] = solv_malloc(p - s + 1);
313 memcpy(q->str[q->nstr], s, p - s);
314 q->str[q->nstr][p - s] = 0;
323 strqueue_diff(Strqueue *sq1, Strqueue *sq2, Strqueue *osq)
326 while (i < sq1->nstr && j < sq2->nstr)
328 int r = strqueue_sort_cmp(sq1->str + i, sq2->str + j, 0);
332 strqueue_pushjoin(osq, "-", sq1->str[i++], 0);
334 strqueue_pushjoin(osq, "+", sq2->str[j++], 0);
336 while (i < sq1->nstr)
337 strqueue_pushjoin(osq, "-", sq1->str[i++], 0);
338 while (j < sq2->nstr)
339 strqueue_pushjoin(osq, "+", sq2->str[j++], 0);
342 /**********************************************************/
345 testcase_repoid2str(Pool *pool, Id repoid)
347 Repo *repo = pool_id2repo(pool, repoid);
350 char *r = pool_tmpjoin(pool, repo->name, 0, 0);
352 for (rp = r; *rp; rp++)
353 if (*rp == ' ' || *rp == '\t')
360 sprintf(buf, "#%d", repoid);
361 return pool_tmpjoin(pool, buf, 0, 0);
366 testcase_solvid2str(Pool *pool, Id p)
368 Solvable *s = pool->solvables + p;
369 const char *n, *e, *a;
372 if (p == SYSTEMSOLVABLE)
374 n = pool_id2str(pool, s->name);
375 e = pool_id2str(pool, s->evr);
376 a = pool_id2str(pool, s->arch);
377 str = pool_alloctmpspace(pool, strlen(n) + strlen(e) + strlen(a) + 3);
378 sprintf(str, "%s-%s", n, e);
379 if (solvable_lookup_type(s, SOLVABLE_BUILDFLAVOR))
384 queue_init(&flavorq);
385 solvable_lookup_idarray(s, SOLVABLE_BUILDFLAVOR, &flavorq);
386 for (i = 0; i < flavorq.count; i++)
387 str = pool_tmpappend(pool, str, "-", pool_id2str(pool, flavorq.elements[i]));
388 queue_free(&flavorq);
391 str = pool_tmpappend(pool, str, ".", a);
393 return pool_tmpappend(pool, str, "@", 0);
397 str = pool_tmpappend(pool, str, "@", s->repo->name);
399 if (str[l] == ' ' || str[l] == '\t')
403 sprintf(buf, "@#%d", s->repo->repoid);
404 return pool_tmpappend(pool, str, buf, 0);
408 testcase_str2repo(Pool *pool, const char *str)
412 if (str[0] == '#' && (str[1] >= '0' && str[1] <= '9'))
416 for (j = 1; str[j] >= '0' && str[j] <= '9'; j++)
417 repoid = repoid * 10 + (str[j] - '0');
418 if (!str[j] && repoid > 0 && repoid < pool->nrepos)
419 repo = pool_id2repo(pool, repoid);
423 FOR_REPOS(repoid, repo)
428 l = strlen(repo->name);
429 for (i = 0; i < l; i++)
431 int c = repo->name[i];
432 if (c == ' ' || c == '\t')
437 if (i == l && !str[l])
440 if (repoid >= pool->nrepos)
447 testcase_escape(Pool *pool, const char *str)
452 for (p = str; *p; p++)
453 if (*p == '\\' || *p == ' ' || *p == '\t')
457 new = pool_alloctmpspace(pool, strlen(str) + 1 + nbad * 2);
458 for (np = new, p = str; *p; p++)
461 if (*p == '\\' || *p == ' ' || *p == '\t')
464 solv_bin2hex((unsigned char *)p, 1, np);
473 testcase_unescape_inplace(char *str)
476 for (p = q = str; *p;)
480 solv_hex2bin((const char **)&p, (unsigned char *)q - 1, 1);
485 /* check evr and buildflavors */
487 str2solvid_check(Pool *pool, Solvable *s, const char *start, const char *end, Id evrid)
489 if (!solvable_lookup_type(s, SOLVABLE_BUILDFLAVOR))
491 /* just check the evr */
492 return evrid && s->evr == evrid;
499 queue_init(&flavorq);
500 solvable_lookup_idarray(s, SOLVABLE_BUILDFLAVOR, &flavorq);
501 queue_unshift(&flavorq, s->evr);
502 for (i = 0; i < flavorq.count; i++)
504 const char *part = pool_id2str(pool, flavorq.elements[i]);
505 size_t partl = strlen(part);
506 if (start + partl > end || strncmp(start, part, partl) != 0)
509 if (i + 1 < flavorq.count)
511 if (start >= end || *start != '-')
516 if (i < flavorq.count)
518 queue_free(&flavorq);
521 queue_free(&flavorq);
527 testcase_str2solvid(Pool *pool, const char *str)
529 int i, l = strlen(str);
536 if (*str == '@' && !strcmp(str, "@SYSTEM"))
537 return SYSTEMSOLVABLE;
539 for (i = l - 1; i >= 0; i--)
540 if (str[i] == '@' && (repo = testcase_str2repo(pool, str + i + 1)) != 0)
545 /* now find the arch (if present) */
547 for (i = repostart - 1; i > 0; i--)
550 arch = pool_strn2id(pool, str + i + 1, repostart - (i + 1), 0);
555 /* now find the name */
556 for (i = repostart - 1; i > 0; i--)
560 Id nid, evrid, p, pp;
561 nid = pool_strn2id(pool, str, i, 0);
564 evrid = pool_strn2id(pool, str + i + 1, repostart - (i + 1), 0);
565 /* first check whatprovides */
566 FOR_PROVIDES(p, pp, nid)
568 Solvable *s = pool->solvables + p;
571 if (repo && s->repo != repo)
573 if (arch && s->arch != arch)
575 if (str2solvid_check(pool, s, str + i + 1, str + repostart, evrid))
578 /* maybe it's not installable and thus not in whatprovides. do a slow search */
582 FOR_REPO_SOLVABLES(repo, p, s)
586 if (arch && s->arch != arch)
588 if (str2solvid_check(pool, s, str + i + 1, str + repostart, evrid))
594 FOR_POOL_SOLVABLES(p)
596 Solvable *s = pool->solvables + p;
599 if (arch && s->arch != arch)
601 if (str2solvid_check(pool, s, str + i + 1, str + repostart, evrid))
611 testcase_job2str(Pool *pool, Id how, Id what)
618 Id select = how & SOLVER_SELECTMASK;
620 for (i = 0; job2str[i].str; i++)
621 if ((how & SOLVER_JOBMASK) == job2str[i].job)
623 jobstr = job2str[i].str ? job2str[i].str : "unknown";
624 if (select == SOLVER_SOLVABLE)
627 pkgstr = testcase_solvid2str(pool, what);
629 else if (select == SOLVER_SOLVABLE_NAME)
632 pkgstr = testcase_dep2str(pool, what);
634 else if (select == SOLVER_SOLVABLE_PROVIDES)
636 selstr = " provides ";
637 pkgstr = testcase_dep2str(pool, what);
639 else if (select == SOLVER_SOLVABLE_ONE_OF)
644 while ((p = pool->whatprovidesdata[what++]) != 0)
646 const char *s = testcase_solvid2str(pool, p);
649 pkgstr = pool_tmpappend(pool, pkgstr, " ", s);
650 pool_freetmpspace(pool, s);
658 else if (select == SOLVER_SOLVABLE_REPO)
660 Repo *repo = pool_id2repo(pool, what);
665 sprintf(buf, "#%d", repo->repoid);
666 pkgstr = pool_tmpjoin(pool, buf, 0, 0);
669 pkgstr = pool_tmpjoin(pool, repo->name, 0, 0);
671 else if (select == SOLVER_SOLVABLE_ALL)
678 selstr = " unknown ";
681 ret = pool_tmpjoin(pool, jobstr, selstr, pkgstr);
683 ret = pool_tmpappend(pool, ret, " ", 0);
684 for (i = 0; jobflags2str[i].str; i++)
685 if ((how & jobflags2str[i].flag) != 0)
686 ret = pool_tmpappend(pool, ret, ",", jobflags2str[i].str);
692 ret = pool_tmpappend(pool, ret, "]", 0);
698 str2selflags(Pool *pool, char *s) /* modifies the string! */
703 char *se = strchr(s, ',');
706 for (i = 0; selflags2str[i].str; i++)
707 if (!strcmp(s, selflags2str[i].str))
709 selflags |= selflags2str[i].flag;
712 if (!selflags2str[i].str)
713 pool_error(pool, 0, "str2job: unknown selection flag '%s'", s);
720 str2jobflags(Pool *pool, char *s) /* modifies the string */
725 char *se = strchr(s, ',');
728 for (i = 0; jobflags2str[i].str; i++)
729 if (!strcmp(s, jobflags2str[i].str))
731 jobflags |= jobflags2str[i].flag;
734 if (!jobflags2str[i].str)
735 pool_error(pool, 0, "str2job: unknown job flag '%s'", s);
742 testcase_str2jobsel(Pool *pool, const char *caller, char **pieces, int npieces, Id *whatp)
745 if (!strcmp(pieces[0], "pkg") && npieces == 2)
747 job = SOLVER_SOLVABLE;
748 what = testcase_str2solvid(pool, pieces[1]);
750 return pool_error(pool, -1, "%s: unknown package '%s'", caller, pieces[1]);
752 else if (!strcmp(pieces[0], "name") || !strcmp(pieces[0], "provides"))
754 /* join em again for dep2str... */
756 for (sp = pieces[1]; sp < pieces[npieces - 1]; sp++)
760 if (pieces[0][0] == 'p' && strncmp(pieces[1], "namespace:", 10) == 0)
762 char *spe = strchr(pieces[1], '(');
763 int l = strlen(pieces[1]);
764 if (spe && pieces[1][l - 1] == ')')
766 /* special namespace provides */
767 if (strcmp(spe, "(<NULL>)") != 0)
769 pieces[1][l - 1] = 0;
770 what = testcase_str2dep(pool, spe + 1);
771 pieces[1][l - 1] = ')';
773 what = pool_rel2id(pool, pool_strn2id(pool, pieces[1], spe - pieces[1], 1), what, REL_NAMESPACE, 1);
777 what = testcase_str2dep(pool, pieces[1]);
778 if (pieces[0][0] == 'n')
779 job = SOLVER_SOLVABLE_NAME;
781 job = SOLVER_SOLVABLE_PROVIDES;
783 else if (!strcmp(pieces[0], "oneof"))
786 job = SOLVER_SOLVABLE_ONE_OF;
788 if (npieces > 1 && strcmp(pieces[1], "nothing") != 0)
791 for (i = 1; i < npieces; i++)
793 Id p = testcase_str2solvid(pool, pieces[i]);
797 return pool_error(pool, -1, "%s: unknown package '%s'", caller, pieces[i]);
802 what = pool_queuetowhatprovides(pool, &q);
805 else if (!strcmp(pieces[0], "repo") && npieces == 2)
807 Repo *repo = testcase_str2repo(pool, pieces[1]);
809 return pool_error(pool, -1, "%s: unknown repo '%s'", caller, pieces[1]);
810 job = SOLVER_SOLVABLE_REPO;
813 else if (!strcmp(pieces[0], "all") && npieces == 2 && !strcmp(pieces[1], "packages"))
815 job = SOLVER_SOLVABLE_ALL;
820 /* join em again for the error message... */
822 for (sp = pieces[0]; sp < pieces[npieces - 1]; sp++)
825 return pool_error(pool, -1, "%s: bad line '%s'", caller, pieces[0]);
832 testcase_str2job(Pool *pool, const char *str, Id *whatp)
842 /* so we can patch it */
843 s = pool_tmpjoin(pool, str, 0, 0);
844 /* split it in pieces */
847 while (*s == ' ' || *s == '\t')
851 pieces = solv_extend(pieces, npieces, 1, sizeof(*pieces), 7);
852 pieces[npieces++] = s;
853 while (*s && *s != ' ' && *s != '\t')
860 pool_error(pool, -1, "str2job: bad line '%s'", str);
865 for (i = 0; job2str[i].str; i++)
866 if (!strcmp(pieces[0], job2str[i].str))
870 pool_error(pool, -1, "str2job: unknown job '%s'", str);
874 job = job2str[i].job;
878 char *flags = pieces[npieces - 1];
879 if (*flags == '[' && flags[strlen(flags) - 1] == ']')
883 flags[strlen(flags) - 1] = 0;
884 job |= str2jobflags(pool, flags);
887 jobsel = testcase_str2jobsel(pool, "str2job", pieces + 1, npieces - 1, &what);
895 #define SELECTIONJOB_MATCHDEPS 1
896 #define SELECTIONJOB_MATCHDEPID 2
897 #define SELECTIONJOB_MATCHSOLVABLE 3
900 addselectionjob(Pool *pool, char **pieces, int npieces, Queue *jobqueue, int type, int keyname)
908 for (i = 0; job2str[i].str; i++)
909 if (!strcmp(pieces[0], job2str[i].str))
912 return pool_error(pool, -1, "selstr2job: unknown job '%s'", pieces[0]);
913 job = job2str[i].job;
916 char *flags = pieces[npieces - 1];
917 if (*flags == '[' && flags[strlen(flags) - 1] == ']')
921 flags[strlen(flags) - 1] = 0;
922 job |= str2jobflags(pool, flags);
926 return pool_error(pool, -1, "selstr2job: no selection flags");
927 selflags = str2selflags(pool, pieces[npieces - 1]);
929 for (sp = pieces[2]; sp < pieces[npieces - 2]; sp++)
933 if (selflags & (SELECTION_ADD | SELECTION_SUBTRACT | SELECTION_FILTER))
935 for (i = 0; i < jobqueue->count; i += 2)
936 queue_push2(&sel, jobqueue->elements[i] & (SOLVER_SELECTMASK | SOLVER_SETMASK), jobqueue->elements[i + 1]);
937 queue_empty(jobqueue);
940 r = selection_make(pool, &sel, pieces[2], selflags);
941 else if (type == SELECTIONJOB_MATCHDEPS)
942 r = selection_make_matchdeps(pool, &sel, pieces[2], selflags, keyname, 0);
943 else if (type == SELECTIONJOB_MATCHDEPID)
944 r = selection_make_matchdepid(pool, &sel, testcase_str2dep(pool, pieces[2]), selflags, keyname, 0);
945 else if (type == SELECTIONJOB_MATCHSOLVABLE)
946 r = selection_make_matchsolvable(pool, &sel, testcase_str2solvid(pool, pieces[2]), selflags, keyname, 0);
947 for (i = 0; i < sel.count; i += 2)
948 queue_push2(jobqueue, job | sel.elements[i], sel.elements[i + 1]);
954 testcase_getpoolflags(Pool *pool)
958 for (i = 0; poolflags2str[i].str; i++)
960 v = pool_get_flag(pool, poolflags2str[i].flag);
961 if (v == poolflags2str[i].def)
963 str = pool_tmpappend(pool, str, v ? " " : " !", poolflags2str[i].str);
965 return str ? str + 1 : "";
969 testcase_setpoolflags(Pool *pool, const char *str)
971 const char *p = str, *s;
975 while (*p == ' ' || *p == '\t' || *p == ',')
986 while (*p && *p != ' ' && *p != '\t' && *p != ',')
988 for (i = 0; poolflags2str[i].str; i++)
989 if (!strncmp(poolflags2str[i].str, s, p - s) && poolflags2str[i].str[p - s] == 0)
991 if (!poolflags2str[i].str)
992 return pool_error(pool, 0, "setpoolflags: unknown flag '%.*s'", (int)(p - s), s);
993 pool_set_flag(pool, poolflags2str[i].flag, v);
999 testcase_resetpoolflags(Pool *pool)
1002 for (i = 0; poolflags2str[i].str; i++)
1003 pool_set_flag(pool, poolflags2str[i].flag, poolflags2str[i].def);
1007 testcase_getsolverflags(Solver *solv)
1009 Pool *pool = solv->pool;
1010 const char *str = 0;
1012 for (i = 0; solverflags2str[i].str; i++)
1014 v = solver_get_flag(solv, solverflags2str[i].flag);
1015 if (v == solverflags2str[i].def)
1017 str = pool_tmpappend(pool, str, v ? " " : " !", solverflags2str[i].str);
1019 return str ? str + 1 : "";
1023 testcase_setsolverflags(Solver *solv, const char *str)
1025 const char *p = str, *s;
1029 while (*p == ' ' || *p == '\t' || *p == ',')
1040 while (*p && *p != ' ' && *p != '\t' && *p != ',')
1042 for (i = 0; solverflags2str[i].str; i++)
1043 if (!strncmp(solverflags2str[i].str, s, p - s) && solverflags2str[i].str[p - s] == 0)
1045 if (!solverflags2str[i].str)
1046 return pool_error(solv->pool, 0, "setsolverflags: unknown flag '%.*s'", (int)(p - s), s);
1047 if (solver_set_flag(solv, solverflags2str[i].flag, v) == -1)
1048 return pool_error(solv->pool, 0, "setsolverflags: unsupported flag '%s'", solverflags2str[i].str);
1054 testcase_resetsolverflags(Solver *solv)
1057 for (i = 0; solverflags2str[i].str; i++)
1058 solver_set_flag(solv, solverflags2str[i].flag, solverflags2str[i].def);
1062 testcase_ruleid(Solver *solv, Id rid)
1068 const unsigned char *md5;
1074 solver_ruleliterals(solv, rid, &q);
1075 for (i = 0; i < q.count; i++)
1077 Id p = q.elements[i];
1078 s = testcase_solvid2str(solv->pool, p > 0 ? p : -p);
1080 s = pool_tmpjoin(solv->pool, "!", s, 0);
1081 strqueue_push(&sq, s);
1084 strqueue_sort_u(&sq);
1085 chk = solv_chksum_create(REPOKEY_TYPE_MD5);
1086 for (i = 0; i < sq.nstr; i++)
1087 solv_chksum_add(chk, sq.str[i], strlen(sq.str[i]) + 1);
1088 md5 = solv_chksum_get(chk, &md5l);
1089 s = pool_bin2hex(solv->pool, md5, md5l);
1090 chk = solv_chksum_free(chk, 0);
1096 testcase_problemid(Solver *solv, Id problem)
1101 const unsigned char *md5;
1105 /* we build a hash of all rules that define the problem */
1108 solver_findallproblemrules(solv, problem, &q);
1109 for (i = 0; i < q.count; i++)
1110 strqueue_push(&sq, testcase_ruleid(solv, q.elements[i]));
1112 strqueue_sort_u(&sq);
1113 chk = solv_chksum_create(REPOKEY_TYPE_MD5);
1114 for (i = 0; i < sq.nstr; i++)
1115 solv_chksum_add(chk, sq.str[i], strlen(sq.str[i]) + 1);
1116 md5 = solv_chksum_get(chk, &md5l);
1117 s = pool_bin2hex(solv->pool, md5, 4);
1118 chk = solv_chksum_free(chk, 0);
1124 testcase_solutionid(Solver *solv, Id problem, Id solution)
1128 const unsigned char *md5;
1132 intid = solver_solutionelement_internalid(solv, problem, solution);
1133 /* internal stuff! handle with care! */
1137 s = testcase_job2str(solv->pool, solv->job.elements[-intid - 1], solv->job.elements[-intid]);
1142 s = testcase_ruleid(solv, intid);
1144 chk = solv_chksum_create(REPOKEY_TYPE_MD5);
1145 solv_chksum_add(chk, s, strlen(s) + 1);
1146 md5 = solv_chksum_get(chk, &md5l);
1147 s = pool_bin2hex(solv->pool, md5, 4);
1148 chk = solv_chksum_free(chk, 0);
1153 testcase_alternativeid(Solver *solv, int type, Id id, Id from)
1156 Pool *pool = solv->pool;
1158 const unsigned char *md5;
1160 chk = solv_chksum_create(REPOKEY_TYPE_MD5);
1161 if (type == SOLVER_ALTERNATIVE_TYPE_RECOMMENDS)
1163 s = testcase_solvid2str(pool, from);
1164 solv_chksum_add(chk, s, strlen(s) + 1);
1165 s = testcase_dep2str(pool, id);
1166 solv_chksum_add(chk, s, strlen(s) + 1);
1168 else if (type == SOLVER_ALTERNATIVE_TYPE_RULE)
1170 s = testcase_ruleid(solv, id);
1171 solv_chksum_add(chk, s, strlen(s) + 1);
1173 md5 = solv_chksum_get(chk, &md5l);
1174 s = pool_bin2hex(pool, md5, 4);
1175 chk = solv_chksum_free(chk, 0);
1179 static struct class2str {
1183 { SOLVER_TRANSACTION_ERASE, "erase" },
1184 { SOLVER_TRANSACTION_INSTALL, "install" },
1185 { SOLVER_TRANSACTION_REINSTALLED, "reinstall" },
1186 { SOLVER_TRANSACTION_DOWNGRADED, "downgrade" },
1187 { SOLVER_TRANSACTION_CHANGED, "change" },
1188 { SOLVER_TRANSACTION_UPGRADED, "upgrade" },
1189 { SOLVER_TRANSACTION_OBSOLETED, "obsolete" },
1190 { SOLVER_TRANSACTION_MULTIINSTALL, "multiinstall" },
1191 { SOLVER_TRANSACTION_MULTIREINSTALL, "multireinstall" },
1195 static struct reason2str {
1199 { SOLVER_REASON_UNRELATED, "unrelated" },
1200 { SOLVER_REASON_UNIT_RULE, "unit" },
1201 { SOLVER_REASON_KEEP_INSTALLED, "keep" },
1202 { SOLVER_REASON_RESOLVE_JOB, "job" },
1203 { SOLVER_REASON_UPDATE_INSTALLED, "update" },
1204 { SOLVER_REASON_CLEANDEPS_ERASE, "cleandeps" },
1205 { SOLVER_REASON_RESOLVE, "resolve" },
1206 { SOLVER_REASON_WEAKDEP, "weakdep" },
1207 { SOLVER_REASON_RESOLVE_ORPHAN, "orphan" },
1209 { SOLVER_REASON_RECOMMENDED, "recommended" },
1210 { SOLVER_REASON_SUPPLEMENTED, "supplemented" },
1215 testcase_reason2str(Id reason)
1218 for (i = 0; reason2str[i].str; i++)
1219 if (reason == reason2str[i].reason)
1220 return reason2str[i].str;
1224 static struct rclass2str {
1228 { SOLVER_RULE_PKG, "pkg" },
1229 { SOLVER_RULE_UPDATE, "update" },
1230 { SOLVER_RULE_FEATURE, "feature" },
1231 { SOLVER_RULE_JOB, "job" },
1232 { SOLVER_RULE_DISTUPGRADE, "distupgrade" },
1233 { SOLVER_RULE_INFARCH, "infarch" },
1234 { SOLVER_RULE_CHOICE, "choice" },
1235 { SOLVER_RULE_LEARNT, "learnt" },
1236 { SOLVER_RULE_BEST, "best" },
1237 { SOLVER_RULE_YUMOBS, "yumobs" },
1238 { SOLVER_RULE_BLACK, "black" },
1239 { SOLVER_RULE_RECOMMENDS, "recommends" },
1240 { SOLVER_RULE_STRICT_REPO_PRIORITY, "strictrepoprio" },
1245 testcase_rclass2str(Id rclass)
1248 for (i = 0; rclass2str[i].str; i++)
1249 if (rclass == rclass2str[i].rclass)
1250 return rclass2str[i].str;
1255 dump_genid(Pool *pool, Strqueue *sq, Id id, int cnt)
1263 Reldep *rd = GETRELDEP(pool, id);
1264 for (op = oplist; op->flags; op++)
1265 if (rd->flags == op->flags)
1267 cnt = dump_genid(pool, sq, rd->name, cnt);
1268 cnt = dump_genid(pool, sq, rd->evr, cnt);
1269 sprintf(cntbuf, "genid %2d: genid ", cnt++);
1270 s = pool_tmpjoin(pool, cntbuf, "op ", op->flags ? op->opname : "unknown");
1274 sprintf(cntbuf, "genid %2d: genid ", cnt++);
1275 s = pool_tmpjoin(pool, cntbuf, id ? "lit " : "null", id ? pool_id2str(pool, id) : 0);
1277 strqueue_push(sq, s);
1282 testcase_solverresult(Solver *solv, int resultflags)
1284 Pool *pool = solv->pool;
1292 if ((resultflags & TESTCASE_RESULT_TRANSACTION) != 0)
1294 Transaction *trans = solver_create_transaction(solv);
1298 for (i = 0; class2str[i].str; i++)
1301 transaction_classify_pkgs(trans, SOLVER_TRANSACTION_KEEP_PSEUDO, class2str[i].class, 0, 0, &q);
1302 for (j = 0; j < q.count; j++)
1306 if (pool->installed && pool->solvables[p].repo == pool->installed)
1307 op = transaction_obs_pkg(trans, p);
1308 s = pool_tmpjoin(pool, class2str[i].str, " ", testcase_solvid2str(pool, p));
1310 s = pool_tmpjoin(pool, s, " ", testcase_solvid2str(pool, op));
1311 strqueue_push(&sq, s);
1315 transaction_free(trans);
1317 if ((resultflags & TESTCASE_RESULT_PROBLEMS) != 0)
1319 char *probprefix, *solprefix;
1320 int problem, solution, element;
1323 pcnt = solver_problem_count(solv);
1324 for (problem = 1; problem <= pcnt; problem++)
1326 Id rid, from, to, dep;
1327 SolverRuleinfo rinfo;
1328 rid = solver_findproblemrule(solv, problem);
1329 s = testcase_problemid(solv, problem);
1330 probprefix = solv_dupjoin("problem ", s, 0);
1331 rinfo = solver_ruleinfo(solv, rid, &from, &to, &dep);
1332 s = pool_tmpjoin(pool, probprefix, " info ", solver_problemruleinfo2str(solv, rinfo, from, to, dep));
1333 strqueue_push(&sq, s);
1334 scnt = solver_solution_count(solv, problem);
1335 for (solution = 1; solution <= scnt; solution++)
1337 s = testcase_solutionid(solv, problem, solution);
1338 solprefix = solv_dupjoin(probprefix, " solution ", s);
1340 while ((element = solver_next_solutionelement(solv, problem, solution, element, &p, &op)) != 0)
1342 if (p == SOLVER_SOLUTION_JOB)
1343 s = pool_tmpjoin(pool, solprefix, " deljob ", testcase_job2str(pool, solv->job.elements[op - 1], solv->job.elements[op]));
1344 else if (p > 0 && op == 0)
1345 s = pool_tmpjoin(pool, solprefix, " erase ", testcase_solvid2str(pool, p));
1346 else if (p > 0 && op > 0)
1348 s = pool_tmpjoin(pool, solprefix, " replace ", testcase_solvid2str(pool, p));
1349 s = pool_tmpappend(pool, s, " ", testcase_solvid2str(pool, op));
1351 else if (p < 0 && op > 0)
1352 s = pool_tmpjoin(pool, solprefix, " allow ", testcase_solvid2str(pool, op));
1354 s = pool_tmpjoin(pool, solprefix, " unknown", 0);
1355 strqueue_push(&sq, s);
1357 solv_free(solprefix);
1359 solv_free(probprefix);
1363 if ((resultflags & TESTCASE_RESULT_PROOF) != 0)
1371 pcnt = solver_problem_count(solv);
1372 for (problem = 1; problem <= pcnt + lq.count; problem++)
1374 if (problem <= pcnt)
1376 s = testcase_problemid(solv, problem);
1377 solver_get_decisionlist(solv, problem, SOLVER_DECISIONLIST_PROBLEM, &q);
1381 s = testcase_ruleid(solv, lq.elements[problem - pcnt - 1]);
1382 solver_get_decisionlist(solv, lq.elements[problem - pcnt - 1], SOLVER_DECISIONLIST_LEARNTRULE, &q);
1384 probprefix = solv_dupjoin("proof ", s, 0);
1385 for (i = 0; i < q.count; i += 3)
1387 SolverRuleinfo rclass;
1389 Id truelit = q.elements[i];
1390 Id rid = q.elements[i + 2];
1394 rclass = solver_ruleclass(solv, rid);
1395 if (rclass == SOLVER_RULE_LEARNT)
1396 queue_pushunique(&lq, rid);
1398 solver_ruleliterals(solv, rid, &rq);
1399 sprintf(nbuf, "%3d", i / 3);
1400 rprefix = solv_dupjoin(probprefix, " ", nbuf);
1401 if (q.elements[i + 1] == SOLVER_REASON_PREMISE)
1403 rprefix = solv_dupappend(rprefix, " premise", 0);
1405 queue_push(&rq, truelit);
1409 rprefix = solv_dupappend(rprefix, " ", testcase_rclass2str(rclass));
1410 rprefix = solv_dupappend(rprefix, " ", testcase_ruleid(solv, rid));
1412 strqueue_push(&sq, rprefix);
1414 rprefix = solv_dupjoin(probprefix, " ", nbuf);
1415 rprefix = solv_dupappend(rprefix, ": ", 0);
1416 for (j = 0; j < rq.count; j++)
1419 Id p = rq.elements[j];
1421 s = pool_tmpjoin(pool, rprefix, "-->", 0);
1423 s = pool_tmpjoin(pool, rprefix, " ", 0);
1425 s = pool_tmpappend(pool, s, " -", testcase_solvid2str(pool, -p));
1427 s = pool_tmpappend(pool, s, " ", testcase_solvid2str(pool, p));
1428 strqueue_push(&sq, s);
1433 solv_free(probprefix);
1439 if ((resultflags & TESTCASE_RESULT_ORPHANED) != 0)
1444 solver_get_orphaned(solv, &q);
1445 for (i = 0; i < q.count; i++)
1447 s = pool_tmpjoin(pool, "orphaned ", testcase_solvid2str(pool, q.elements[i]), 0);
1448 strqueue_push(&sq, s);
1453 if ((resultflags & TESTCASE_RESULT_RECOMMENDED) != 0)
1459 solver_get_recommendations(solv, &qr, &qs, 0);
1460 for (i = 0; i < qr.count; i++)
1462 s = pool_tmpjoin(pool, "recommended ", testcase_solvid2str(pool, qr.elements[i]), 0);
1463 strqueue_push(&sq, s);
1465 for (i = 0; i < qs.count; i++)
1467 s = pool_tmpjoin(pool, "suggested ", testcase_solvid2str(pool, qs.elements[i]), 0);
1468 strqueue_push(&sq, s);
1474 if ((resultflags & TESTCASE_RESULT_UNNEEDED) != 0)
1480 solver_get_unneeded(solv, &q, 0);
1481 solver_get_unneeded(solv, &qf, 1);
1482 for (i = j = 0; i < q.count; i++)
1484 /* we rely on qf containing a subset of q in the same order */
1485 if (j < qf.count && q.elements[i] == qf.elements[j])
1487 s = pool_tmpjoin(pool, "unneeded_filtered ", testcase_solvid2str(pool, q.elements[i]), 0);
1491 s = pool_tmpjoin(pool, "unneeded ", testcase_solvid2str(pool, q.elements[i]), 0);
1492 strqueue_push(&sq, s);
1497 if ((resultflags & TESTCASE_RESULT_USERINSTALLED) != 0)
1500 solver_get_userinstalled(solv, &q, 0);
1501 for (i = 0; i < q.count; i++)
1503 s = pool_tmpjoin(pool, "userinstalled pkg ", testcase_solvid2str(pool, q.elements[i]), 0);
1504 strqueue_push(&sq, s);
1507 solver_get_userinstalled(solv, &q, GET_USERINSTALLED_NAMES | GET_USERINSTALLED_INVERTED);
1508 for (i = 0; i < q.count; i++)
1510 s = pool_tmpjoin(pool, "autoinst name ", pool_id2str(pool, q.elements[i]), 0);
1511 strqueue_push(&sq, s);
1515 if ((resultflags & TESTCASE_RESULT_ORDER) != 0)
1520 Transaction *trans = solver_create_transaction(solv);
1521 transaction_order(trans, 0);
1522 for (i = 0; i < trans->steps.count; i++)
1524 p = trans->steps.elements[i];
1525 if (pool->installed && pool->solvables[p].repo == pool->installed)
1526 sprintf(buf, "%4d erase ", i + 1);
1528 sprintf(buf, "%4d install ", i + 1);
1529 s = pool_tmpjoin(pool, "order ", buf, testcase_solvid2str(pool, p));
1530 strqueue_push(&sq, s);
1532 transaction_free(trans);
1534 if ((resultflags & TESTCASE_RESULT_ORDEREDGES) != 0)
1539 Transaction *trans = solver_create_transaction(solv);
1540 transaction_order(trans, SOLVER_TRANSACTION_KEEP_ORDEREDGES);
1542 for (i = 0; i < trans->steps.count; i++)
1544 p = trans->steps.elements[i];
1545 transaction_order_get_edges(trans, p, &q, 1);
1546 for (j = 0; j < q.count; j += 2)
1548 char typebuf[32], *s;
1550 sprintf(typebuf, " -%x-> ", q.elements[j + 1]);
1551 s = pool_tmpjoin(pool, "orderedge ", testcase_solvid2str(pool, p), typebuf);
1552 s = pool_tmpappend(pool, s, testcase_solvid2str(pool, p2), 0);
1553 strqueue_push(&sq, s);
1557 transaction_free(trans);
1559 if ((resultflags & TESTCASE_RESULT_ALTERNATIVES) != 0)
1565 cnt = solver_alternatives_count(solv);
1566 for (alternative = 1; alternative <= cnt; alternative++)
1568 Id id, from, chosen;
1570 int type = solver_get_alternative(solv, alternative, &id, &from, &chosen, &q, 0);
1571 char *altprefix = solv_dupjoin("alternative ", testcase_alternativeid(solv, type, id, from), " ");
1573 s = pool_tmpjoin(pool, altprefix, num, solver_alternative2str(solv, type, id, from));
1574 strqueue_push(&sq, s);
1575 for (i = 0; i < q.count; i++)
1577 Id p = q.elements[i];
1579 num[0] = '0' + (i + 1) / 10;
1580 num[1] = '0' + (i + 1) % 10;
1582 s = pool_tmpjoin(pool, altprefix, num, "+ ");
1584 s = pool_tmpjoin(pool, altprefix, num, "- ");
1586 s = pool_tmpjoin(pool, altprefix, num, " ");
1587 s = pool_tmpappend(pool, s, testcase_solvid2str(pool, p < 0 ? -p : p), 0);
1588 strqueue_push(&sq, s);
1590 solv_free(altprefix);
1594 if ((resultflags & TESTCASE_RESULT_RULES) != 0)
1596 /* dump all rules */
1598 SolverRuleinfo rclass;
1604 for (rid = 1; (rclass = solver_ruleclass(solv, rid)) != SOLVER_RULE_UNKNOWN; rid++)
1606 solver_ruleliterals(solv, rid, &q);
1607 if (rclass == SOLVER_RULE_FEATURE && q.count == 1 && q.elements[0] == -SYSTEMSOLVABLE)
1609 prefix = solv_dupjoin("rule ", testcase_rclass2str(rclass), " ");
1610 prefix = solv_dupappend(prefix, testcase_ruleid(solv, rid), 0);
1611 for (i = 0; i < q.count; i++)
1613 Id p = q.elements[i];
1616 s = pool_tmpjoin(pool, prefix, " -", testcase_solvid2str(pool, -p));
1618 s = pool_tmpjoin(pool, prefix, " ", testcase_solvid2str(pool, p));
1619 strqueue_push(&sq, s);
1625 if ((resultflags & TESTCASE_RESULT_GENID) != 0)
1627 for (i = 0 ; i < solv->job.count; i += 2)
1630 if (solv->job.elements[i] != (SOLVER_NOOP | SOLVER_SOLVABLE_PROVIDES))
1632 id = solv->job.elements[i + 1];
1633 s = testcase_dep2str(pool, id);
1634 strqueue_push(&sq, pool_tmpjoin(pool, "genid dep ", s, 0));
1635 if ((id2 = testcase_str2dep(pool, s)) != id)
1637 s = pool_tmpjoin(pool, "genid roundtrip error: ", testcase_dep2str(pool, id2), 0);
1638 strqueue_push(&sq, s);
1640 dump_genid(pool, &sq, id, 1);
1643 if ((resultflags & TESTCASE_RESULT_REASON) != 0)
1647 FOR_POOL_SOLVABLES(p)
1650 int reason = solver_describe_decision(solv, p, &info);
1651 if (reason == SOLVER_REASON_UNRELATED)
1653 if (reason == SOLVER_REASON_WEAKDEP)
1655 solver_describe_weakdep_decision(solv, p, &whyq);
1658 for (i = 0; i < whyq.count; i += 3)
1660 reason = whyq.elements[i];
1661 p2 = whyq.elements[i + 1];
1662 id = whyq.elements[i + 2];
1663 s = pool_tmpjoin(pool, "reason ", testcase_solvid2str(pool, p), 0);
1664 s = pool_tmpappend(pool, s, " ", testcase_reason2str(reason));
1665 s = pool_tmpappend(pool, s, " ", testcase_dep2str(pool, id));
1667 s = pool_tmpappend(pool, s, " ", testcase_solvid2str(pool, p2));
1668 strqueue_push(&sq, s);
1673 s = pool_tmpjoin(pool, "reason ", testcase_solvid2str(pool, p), 0);
1674 s = pool_tmpappend(pool, s, " ", testcase_reason2str(reason));
1676 s = pool_tmpappend(pool, s, " ", testcase_ruleid(solv, info));
1677 strqueue_push(&sq, s);
1681 if ((resultflags & TESTCASE_RESULT_CLEANDEPS) != 0)
1686 solver_get_cleandeps(solv, &q);
1687 for (i = 0; i < q.count; i++)
1689 s = pool_tmpjoin(pool, "cleandeps ", testcase_solvid2str(pool, q.elements[i]), 0);
1690 strqueue_push(&sq, s);
1694 if ((resultflags & TESTCASE_RESULT_JOBS) != 0)
1696 for (i = 0; i < solv->job.count; i += 2)
1698 s = (char *)testcase_job2str(pool, solv->job.elements[i], solv->job.elements[i + 1]);
1699 s = pool_tmpjoin(pool, "job ", s, 0);
1700 strqueue_push(&sq, s);
1704 result = strqueue_join(&sq);
1710 dump_custom_vendorcheck(Pool *pool, Strqueue *sq, int (*vendorcheck)(Pool *, Solvable *, Solvable *))
1712 Id p, lastvendor = 0;
1718 FOR_POOL_SOLVABLES(p)
1720 Id vendor = pool->solvables[p].vendor;
1721 if (!vendor || vendor == lastvendor)
1723 lastvendor = vendor;
1724 for (i = 0; i < vq.count; i += 2)
1725 if (vq.elements[i] == vendor)
1728 queue_push2(&vq, vendor, p);
1730 for (i = 0; i < vq.count; i += 2)
1732 Solvable *s1 = pool->solvables + vq.elements[i + 1];
1733 for (j = i + 2; j < vq.count; j += 2)
1735 Solvable *s2 = pool->solvables + vq.elements[j + 1];
1736 if (vendorcheck(pool, s1, s2) || vendorcheck(pool, s2, s1))
1738 cmd = pool_tmpjoin(pool, "vendorclass", 0, 0);
1739 cmd = pool_tmpappend(pool, cmd, " ", testcase_escape(pool, pool_id2str(pool, vq.elements[i])));
1740 cmd = pool_tmpappend(pool, cmd, " ", testcase_escape(pool, pool_id2str(pool, vq.elements[j])));
1741 strqueue_push(sq, cmd);
1748 testcase_write_mangled(Solver *solv, const char *dir, int resultflags, const char *testcasename, const char *resultname)
1750 Pool *pool = solv->pool;
1757 char *cmd, *out, *result;
1759 int (*vendorcheck)(Pool *, Solvable *, Solvable *);
1762 testcasename = "testcase.t";
1764 resultname = "solver.result";
1767 if (mkdir(dir) && errno != EEXIST)
1769 if (mkdir(dir, 0777) && errno != EEXIST)
1771 return pool_error(solv->pool, 0, "testcase_write: could not create directory '%s'", dir);
1773 FOR_REPOS(repoid, repo)
1775 const char *name = testcase_repoid2str(pool, repoid);
1777 if (repo->subpriority)
1778 sprintf(priobuf, "%d.%d", repo->priority, repo->subpriority);
1780 sprintf(priobuf, "%d", repo->priority);
1781 #if !defined(WITHOUT_COOKIEOPEN) && defined(ENABLE_ZLIB_COMPRESSION)
1782 out = pool_tmpjoin(pool, name, ".repo", ".gz");
1784 out = pool_tmpjoin(pool, name, ".repo", 0);
1786 for (i = 0; out[i]; i++)
1789 cmd = pool_tmpjoin(pool, "repo ", name, " ");
1790 cmd = pool_tmpappend(pool, cmd, priobuf, " ");
1791 cmd = pool_tmpappend(pool, cmd, "testtags ", out);
1792 strqueue_push(&sq, cmd);
1793 out = pool_tmpjoin(pool, dir, "/", out);
1794 if (!(fp = solv_xfopen(out, "w")))
1796 pool_error(solv->pool, 0, "testcase_write: could not open '%s' for writing", out);
1800 testcase_write_testtags(repo, fp);
1803 pool_error(solv->pool, 0, "testcase_write: write error");
1808 /* hmm, this is not optimal... we currently search for the lowest score */
1810 arch = pool->solvables[SYSTEMSOLVABLE].arch;
1811 for (i = 0; i < pool->lastarch; i++)
1813 if (pool->id2arch[i] == 1 && !lowscore)
1815 if (pool->id2arch[i] > 0x10000 && (!lowscore || pool->id2arch[i] < lowscore))
1818 lowscore = pool->id2arch[i];
1821 cmd = pool_tmpjoin(pool, "system ", pool->lastarch ? pool_id2str(pool, arch) : "-", 0);
1822 for (i = 0; disttype2str[i].str != 0; i++)
1823 if (pool->disttype == disttype2str[i].type)
1825 pool_tmpappend(pool, cmd, " ", disttype2str[i].str ? disttype2str[i].str : "unknown");
1826 if (pool->installed)
1827 cmd = pool_tmpappend(pool, cmd, " ", testcase_repoid2str(pool, pool->installed->repoid));
1828 strqueue_push(&sq, cmd);
1829 s = testcase_getpoolflags(solv->pool);
1832 cmd = pool_tmpjoin(pool, "poolflags ", s, 0);
1833 strqueue_push(&sq, cmd);
1836 vendorcheck = pool_get_custom_vendorcheck(pool);
1838 dump_custom_vendorcheck(pool, &sq, vendorcheck);
1839 else if (pool->vendorclasses)
1842 for (i = 0; pool->vendorclasses[i]; i++)
1844 cmd = pool_tmpappend(pool, cmd ? cmd : "vendorclass", " ", testcase_escape(pool, pool->vendorclasses[i]));
1845 if (!pool->vendorclasses[i + 1])
1847 strqueue_push(&sq, cmd);
1854 /* dump disabled packages (must come before the namespace/job lines) */
1855 if (pool->considered)
1858 FOR_POOL_SOLVABLES(p)
1859 if (!MAPTST(pool->considered, p))
1861 cmd = pool_tmpjoin(pool, "disable pkg ", testcase_solvid2str(pool, p), 0);
1862 strqueue_push(&sq, cmd);
1866 s = testcase_getsolverflags(solv);
1869 cmd = pool_tmpjoin(pool, "solverflags ", s, 0);
1870 strqueue_push(&sq, cmd);
1873 /* now dump all the ns callback values we know */
1874 if (pool->nscallback)
1878 for (rid = 1; rid < pool->nrels; rid++)
1880 Reldep *rd = pool->rels + rid;
1881 if (rd->flags != REL_NAMESPACE || rd->name == NAMESPACE_OTHERPROVIDERS || rd->name == NAMESPACE_SPLITPROVIDES)
1883 /* evaluate all namespace ids, skip empty results */
1884 d = pool_whatprovides(pool, MAKERELDEP(rid));
1885 if (!d || !pool->whatprovidesdata[d])
1887 cmd = pool_tmpjoin(pool, "namespace ", pool_id2str(pool, rd->name), "(");
1888 cmd = pool_tmpappend(pool, cmd, pool_id2str(pool, rd->evr), ")");
1889 for (; pool->whatprovidesdata[d]; d++)
1890 cmd = pool_tmpappend(pool, cmd, " ", testcase_solvid2str(pool, pool->whatprovidesdata[d]));
1891 strqueue_push(&sq, cmd);
1895 for (i = 0; i < solv->job.count; i += 2)
1897 cmd = (char *)testcase_job2str(pool, solv->job.elements[i], solv->job.elements[i + 1]);
1898 cmd = pool_tmpjoin(pool, "job ", cmd, 0);
1899 strqueue_push(&sq, cmd);
1902 if ((resultflags & ~TESTCASE_RESULT_REUSE_SOLVER) != 0)
1905 for (i = 0; resultflags2str[i].str; i++)
1906 if ((resultflags & resultflags2str[i].flag) != 0)
1907 cmd = pool_tmpappend(pool, cmd, cmd ? "," : 0, resultflags2str[i].str);
1908 cmd = pool_tmpjoin(pool, "result ", cmd ? cmd : "?", 0);
1909 cmd = pool_tmpappend(pool, cmd, " ", resultname);
1910 strqueue_push(&sq, cmd);
1911 result = testcase_solverresult(solv, resultflags);
1912 if (!strcmp(resultname, "<inline>"))
1915 strqueue_init(&rsq);
1916 strqueue_split(&rsq, result);
1917 for (i = 0; i < rsq.nstr; i++)
1919 cmd = pool_tmpjoin(pool, "#>", rsq.str[i], 0);
1920 strqueue_push(&sq, cmd);
1922 strqueue_free(&rsq);
1926 out = pool_tmpjoin(pool, dir, "/", resultname);
1927 if (!(fp = fopen(out, "w")))
1929 pool_error(solv->pool, 0, "testcase_write: could not open '%s' for writing", out);
1934 if (result && *result && fwrite(result, strlen(result), 1, fp) != 1)
1936 pool_error(solv->pool, 0, "testcase_write: write error");
1944 pool_error(solv->pool, 0, "testcase_write: write error");
1953 result = strqueue_join(&sq);
1955 out = pool_tmpjoin(pool, dir, "/", testcasename);
1956 if (!(fp = fopen(out, "w")))
1958 pool_error(solv->pool, 0, "testcase_write: could not open '%s' for writing", out);
1962 if (*result && fwrite(result, strlen(result), 1, fp) != 1)
1964 pool_error(solv->pool, 0, "testcase_write: write error");
1971 pool_error(solv->pool, 0, "testcase_write: write error");
1980 testcase_mangle_repo_names(Pool *pool)
1982 int i, repoid, mangle = 1;
1984 const char **names = solv_calloc(pool->nrepos, sizeof(char *));
1985 FOR_REPOS(repoid, repo)
1988 buf = solv_malloc((repo->name ? strlen(repo->name) : 0) + 40);
1989 if (!repo->name || !repo->name[0])
1990 sprintf(buf, "#%d", repoid);
1992 strcpy(buf, repo->name);
1993 for (mp = buf; *mp; mp++)
1994 if (*mp == ' ' || *mp == '\t' || *mp == '/')
1996 for (i = 1; i < repoid; i++)
1998 if (!names[i] || strcmp(buf, names[i]) != 0)
2000 sprintf(mp, "_%d", mangle++);
2001 i = 0; /* restart conflict check */
2003 names[repoid] = buf;
2009 swap_repo_names(Pool *pool, const char **names)
2013 FOR_REPOS(repoid, repo)
2015 const char *n = repo->name;
2016 repo->name = names[repoid];
2022 testcase_write(Solver *solv, const char *dir, int resultflags, const char *testcasename, const char *resultname)
2024 Pool *pool = solv->pool;
2028 /* mangle repo names so that there are no conflicts */
2029 names = testcase_mangle_repo_names(pool);
2030 swap_repo_names(pool, names);
2031 r = testcase_write_mangled(solv, dir, resultflags, testcasename, resultname);
2032 swap_repo_names(pool, names);
2033 for (repoid = 1; repoid < pool->nrepos; repoid++)
2034 solv_free((void *)names[repoid]);
2035 solv_free((void *)names);
2040 read_inline_file(FILE *fp, char **bufp, char **bufpp, int *buflp)
2042 char *result = solv_malloc(1024);
2049 if (rp - result + 256 >= resultl)
2051 resultl = rp - result;
2052 result = solv_realloc(result, resultl + 1024);
2053 rp = result + resultl;
2056 if (!fgets(rp, resultl - (rp - result), fp))
2059 if (rl && (rp == result || rp[-1] == '\n'))
2061 if (rl > 1 && rp[0] == '#' && rp[1] == '>')
2063 memmove(rp, rp + 2, rl - 2);
2068 while (rl + 16 > *buflp)
2070 *bufp = solv_realloc(*bufp, *buflp + 512);
2073 memmove(*bufp, rp, rl);
2074 if ((*bufp)[rl - 1] == '\n')
2080 (*bufpp) = *bufp + rl;
2097 char *result = solv_malloc(1024);
2104 if (rp - result + 256 >= resultl)
2106 resultl = rp - result;
2107 result = solv_realloc(result, resultl + 1024);
2108 rp = result + resultl;
2111 rl = fread(rp, 1, resultl - (rp - result), fp);
2123 str2resultflags(Pool *pool, char *s) /* modifies the string! */
2125 int i, resultflags = 0;
2128 char *se = strchr(s, ',');
2131 for (i = 0; resultflags2str[i].str; i++)
2132 if (!strcmp(s, resultflags2str[i].str))
2134 resultflags |= resultflags2str[i].flag;
2137 if (!resultflags2str[i].str)
2138 pool_error(pool, 0, "result: unknown flag '%s'", s);
2145 testcase_read(Pool *pool, FILE *fp, const char *testcase, Queue *job, char **resultp, int *resultflagsp)
2150 char *testcasedir, *s;
2156 int poolflagsreset = 0;
2157 int missing_features = 0;
2161 int oldjobsize = job ? job->count : 0;
2167 if (!fp && !(fp = fopen(testcase, "r")))
2169 pool_error(pool, 0, "testcase_read: could not open '%s'", testcase);
2172 testcasedir = solv_strdup(testcase);
2173 s = strrchr(testcasedir, '/');
2175 buf = strrchr(testcasedir, '\\');
2176 if (!s || (buf && buf > s))
2184 buf = solv_malloc(bufl);
2187 queue_init(&autoinstq);
2190 if (bufp - buf + 16 > bufl)
2193 buf = solv_realloc(buf, bufl + 512);
2197 if (!fgets(bufp, bufl - (bufp - buf), fp))
2201 if (!l || buf[l - 1] != '\n')
2208 while (*s && (*s == ' ' || *s == '\t'))
2210 if (!*s || *s == '#')
2213 /* split it in pieces */
2216 while (*s == ' ' || *s == '\t')
2220 pieces = solv_extend(pieces, npieces, 1, sizeof(*pieces), 7);
2221 pieces[npieces++] = s;
2222 while (*s && *s != ' ' && *s != '\t')
2227 pieces = solv_extend(pieces, npieces, 1, sizeof(*pieces), 7);
2228 pieces[npieces] = 0;
2229 if (!strcmp(pieces[0], "repo") && npieces >= 4)
2231 Repo *repo = repo_create(pool, pieces[1]);
2236 if (pool->considered)
2238 pool_error(pool, 0, "testcase_read: cannot add repos after packages were disabled");
2243 pool_error(pool, 0, "testcase_read: cannot add repos after the solver was created");
2246 if (job && job->count != oldjobsize)
2248 pool_error(pool, 0, "testcase_read: cannot add repos after jobs have been created");
2252 if (!poolflagsreset)
2255 testcase_resetpoolflags(pool); /* hmm */
2257 if (sscanf(pieces[2], "%d.%d", &prio, &subprio) != 2)
2260 prio = atoi(pieces[2]);
2262 repo->priority = prio;
2263 repo->subpriority = subprio;
2264 if (strcmp(pieces[3], "empty") != 0 && npieces > 4)
2266 const char *repotype = pool_tmpjoin(pool, pieces[3], 0, 0); /* gets overwritten in <inline> case */
2267 if (!strcmp(pieces[4], "<inline>"))
2269 char *idata = read_inline_file(fp, &buf, &bufp, &bufl);
2271 rfp = solv_fmemopen(idata, strlen(idata), "rf");
2275 rdata = pool_tmpjoin(pool, testcasedir, pieces[4], 0);
2276 rfp = solv_xfopen(rdata, "r");
2280 pool_error(pool, 0, "testcase_read: could not open '%s'", rdata);
2282 else if (!strcmp(repotype, "testtags"))
2284 testcase_add_testtags(repo, rfp, 0);
2287 else if (!strcmp(repotype, "solv"))
2289 repo_add_solv(repo, rfp, 0);
2292 #if ENABLE_TESTCASE_HELIXREPO
2293 else if (!strcmp(repotype, "helix"))
2295 repo_add_helix(repo, rfp, 0);
2302 pool_error(pool, 0, "testcase_read: unknown repo type for repo '%s'", repo->name);
2306 else if (!strcmp(pieces[0], "system") && npieces >= 3)
2310 /* must set the disttype before the arch */
2311 if (job && job->count != oldjobsize)
2313 pool_error(pool, 0, "testcase_read: cannot change the system after jobs have been created");
2317 if (strcmp(pieces[2], "*") != 0)
2319 char *dp = pieces[2];
2322 char *dpe = strchr(dp, ',');
2325 for (i = 0; disttype2str[i].str != 0; i++)
2326 if (!strcmp(disttype2str[i].str, dp))
2330 if (disttype2str[i].str)
2332 #ifdef MULTI_SEMANTICS
2333 if (pool->disttype != disttype2str[i].type)
2334 pool_setdisttype(pool, disttype2str[i].type);
2336 if (pool->disttype == disttype2str[i].type)
2343 pool_error(pool, 0, "testcase_read: system: could not change disttype to '%s'", pieces[2]);
2344 missing_features = 1;
2347 if (strcmp(pieces[1], "unset") == 0 || strcmp(pieces[1], "-") == 0)
2348 pool_setarch(pool, 0);
2349 else if (pieces[1][0] == ':')
2350 pool_setarchpolicy(pool, pieces[1] + 1);
2352 pool_setarch(pool, pieces[1]);
2355 Repo *repo = testcase_str2repo(pool, pieces[3]);
2357 pool_error(pool, 0, "testcase_read: system: unknown repo '%s'", pieces[3]);
2359 pool_set_installed(pool, repo);
2362 else if (!strcmp(pieces[0], "job") && npieces > 1)
2368 pool_addfileprovides(pool);
2369 pool_createwhatprovides(pool);
2372 if (npieces >= 3 && !strcmp(pieces[2], "selection"))
2374 addselectionjob(pool, pieces + 1, npieces - 1, job, 0, 0);
2377 if (npieces >= 4 && !strcmp(pieces[2], "selection_matchdeps"))
2379 pieces[2] = pieces[1];
2380 addselectionjob(pool, pieces + 2, npieces - 2, job, SELECTIONJOB_MATCHDEPS, pool_str2id(pool, pieces[3], 1));
2383 if (npieces >= 4 && !strcmp(pieces[2], "selection_matchdepid"))
2385 pieces[2] = pieces[1];
2386 addselectionjob(pool, pieces + 2, npieces - 2, job, SELECTIONJOB_MATCHDEPID, pool_str2id(pool, pieces[3], 1));
2389 if (npieces >= 4 && !strcmp(pieces[2], "selection_matchsolvable"))
2391 pieces[2] = pieces[1];
2392 addselectionjob(pool, pieces + 2, npieces - 2, job, SELECTIONJOB_MATCHSOLVABLE, pool_str2id(pool, pieces[3], 1));
2396 for (sp = pieces[1]; sp < pieces[npieces - 1]; sp++)
2399 how = testcase_str2job(pool, pieces[1], &what);
2400 if (how >= 0 && job)
2401 queue_push2(job, how, what);
2403 else if (!strcmp(pieces[0], "vendorclass") && npieces > 1)
2406 for (i = 1; i < npieces; i++)
2407 testcase_unescape_inplace(pieces[i]);
2408 pool_addvendorclass(pool, (const char **)(pieces + 1));
2410 else if (!strcmp(pieces[0], "namespace") && npieces > 1)
2412 int i = strlen(pieces[1]);
2413 s = strchr(pieces[1], '(');
2414 if (!s || pieces[1][i - 1] != ')')
2416 pool_error(pool, 0, "testcase_read: bad namespace '%s'", pieces[1]);
2424 pieces[1][i - 1] = 0;
2425 name = pool_str2id(pool, pieces[1], 1);
2426 evr = pool_str2id(pool, s + 1, 1);
2428 pieces[1][i - 1] = ')';
2429 id = pool_rel2id(pool, name, evr, REL_NAMESPACE, 1);
2430 for (i = 2; i < npieces; i++)
2431 queue_push(&q, testcase_str2solvid(pool, pieces[i]));
2432 /* now do the callback */
2435 pool_addfileprovides(pool);
2436 pool_createwhatprovides(pool);
2439 pool->whatprovides_rel[GETRELID(id)] = pool_queuetowhatprovides(pool, &q);
2443 else if (!strcmp(pieces[0], "poolflags"))
2446 if (!poolflagsreset)
2449 testcase_resetpoolflags(pool); /* hmm */
2451 for (i = 1; i < npieces; i++)
2452 testcase_setpoolflags(pool, pieces[i]);
2454 else if (!strcmp(pieces[0], "solverflags") && npieces > 1)
2459 solv = solver_create(pool);
2460 testcase_resetsolverflags(solv);
2462 for (i = 1; i < npieces; i++)
2463 testcase_setsolverflags(solv, pieces[i]);
2465 else if (!strcmp(pieces[0], "result") && npieces > 1)
2468 int resultflags = str2resultflags(pool, pieces[1]);
2472 rdata = pool_tmpjoin(pool, testcasedir, pieces[2], 0);
2473 if (!strcmp(pieces[2], "<inline>"))
2474 result = read_inline_file(fp, &buf, &bufp, &bufl);
2477 FILE *rfp = fopen(rdata, "r");
2479 pool_error(pool, 0, "testcase_read: could not open '%s'", rdata);
2482 result = read_file(rfp);
2489 solv_free(*resultp);
2495 *resultflagsp = resultflags;
2497 else if (!strcmp(pieces[0], "nextjob"))
2499 if (npieces == 2 && resultflagsp && !strcmp(pieces[1], "reusesolver"))
2500 *resultflagsp |= TESTCASE_RESULT_REUSE_SOLVER;
2503 else if (!strcmp(pieces[0], "disable") && npieces == 3)
2505 Id p, pp, jobsel, what = 0;
2507 pool_createwhatprovides(pool);
2509 if (!pool->considered)
2511 pool->considered = solv_calloc(1, sizeof(Map));
2512 map_init(pool->considered, pool->nsolvables);
2513 map_setall(pool->considered);
2515 jobsel = testcase_str2jobsel(pool, "disable", pieces + 1, npieces - 1, &what);
2518 if (jobsel == SOLVER_SOLVABLE_ALL)
2519 map_empty(pool->considered);
2520 else if (jobsel == SOLVER_SOLVABLE_REPO)
2522 Repo *repo = pool_id2repo(pool, what);
2524 FOR_REPO_SOLVABLES(repo, p, s)
2525 MAPCLR(pool->considered, p);
2527 FOR_JOB_SELECT(p, pp, jobsel, what)
2528 MAPCLR(pool->considered, p);
2530 else if (!strcmp(pieces[0], "feature"))
2533 for (i = 1; i < npieces; i++)
2535 for (j = 0; features[j]; j++)
2536 if (!strcmp(pieces[i], features[j]))
2540 pool_error(pool, 0, "testcase_read: missing feature '%s'", pieces[i]);
2544 if (missing_features)
2547 else if (!strcmp(pieces[0], "genid") && npieces > 1)
2554 for (sp = pieces[2]; sp < pieces[npieces - 1]; sp++)
2558 genid = solv_extend(genid, ngenid, 1, sizeof(*genid), 7);
2559 if (!strcmp(pieces[1], "op") && npieces > 2)
2562 for (op = oplist; op->flags; op++)
2563 if (!strncmp(pieces[2], op->opname, strlen(op->opname)))
2567 pool_error(pool, 0, "testcase_read: genid: unknown op '%s'", pieces[2]);
2572 pool_error(pool, 0, "testcase_read: genid: out of stack");
2576 id = pool_rel2id(pool, genid[ngenid] , genid[ngenid + 1], op->flags, 1);
2578 else if (!strcmp(pieces[1], "lit"))
2579 id = pool_str2id(pool, npieces > 2 ? pieces[2] : "", 1);
2580 else if (!strcmp(pieces[1], "null"))
2582 else if (!strcmp(pieces[1], "dep"))
2583 id = testcase_str2dep(pool, pieces[2]);
2586 pool_error(pool, 0, "testcase_read: genid: unknown command '%s'", pieces[1]);
2589 genid[ngenid++] = id;
2591 else if (!strcmp(pieces[0], "autoinst") && npieces > 2)
2593 if (strcmp(pieces[1], "name"))
2595 pool_error(pool, 0, "testcase_read: autoinst: illegal mode");
2598 queue_push(&autoinstq, pool_str2id(pool, pieces[2], 1));
2600 else if (!strcmp(pieces[0], "evrcmp") && npieces == 3)
2602 Id evr1 = pool_str2id(pool, pieces[1], 1);
2603 Id evr2 = pool_str2id(pool, pieces[2], 1);
2604 int r = pool_evrcmp(pool, evr1, evr2, EVRCMP_COMPARE);
2605 r = r < 0 ? REL_LT : r > 0 ? REL_GT : REL_EQ;
2606 queue_push2(job, SOLVER_NOOP | SOLVER_SOLVABLE_PROVIDES, pool_rel2id(pool, evr1, evr2, r, 1));
2610 pool_error(pool, 0, "testcase_read: cannot parse command '%s'", pieces[0]);
2613 while (job && ngenid > 0)
2614 queue_push2(job, SOLVER_NOOP | SOLVER_SOLVABLE_PROVIDES, genid[--ngenid]);
2615 if (autoinstq.count)
2616 pool_add_userinstalled_jobs(pool, &autoinstq, job, GET_USERINSTALLED_NAMES | GET_USERINSTALLED_INVERTED);
2617 queue_free(&autoinstq);
2618 genid = solv_free(genid);
2619 buf = solv_free(buf);
2620 pieces = solv_free(pieces);
2621 solv_free(testcasedir);
2624 pool_addfileprovides(pool);
2625 pool_createwhatprovides(pool);
2629 solv = solver_create(pool);
2630 testcase_resetsolverflags(solv);
2634 if (missing_features)
2639 *resultflagsp = 77; /* hack for testsolv */
2645 testcase_resultdiff(const char *result1, const char *result2)
2647 Strqueue sq1, sq2, osq;
2649 strqueue_init(&sq1);
2650 strqueue_init(&sq2);
2651 strqueue_init(&osq);
2652 strqueue_split(&sq1, result1);
2653 strqueue_split(&sq2, result2);
2654 strqueue_sort(&sq1);
2655 strqueue_sort(&sq2);
2656 strqueue_diff(&sq1, &sq2, &osq);
2657 r = osq.nstr ? strqueue_join(&osq) : 0;
2658 strqueue_free(&sq1);
2659 strqueue_free(&sq2);
2660 strqueue_free(&osq);