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" },
66 static struct jobflags2str {
70 { SOLVER_WEAK, "weak" },
71 { SOLVER_ESSENTIAL, "essential" },
72 { SOLVER_CLEANDEPS, "cleandeps" },
73 { SOLVER_ORUPDATE, "orupdate" },
74 { SOLVER_FORCEBEST, "forcebest" },
75 { SOLVER_TARGETED, "targeted" },
76 { SOLVER_NOTBYUSER, "notbyuser" },
77 { SOLVER_SETEV, "setev" },
78 { SOLVER_SETEVR, "setevr" },
79 { SOLVER_SETARCH, "setarch" },
80 { SOLVER_SETVENDOR, "setvendor" },
81 { SOLVER_SETREPO, "setrepo" },
82 { SOLVER_NOAUTOSET, "noautoset" },
86 static struct resultflags2str {
89 } resultflags2str[] = {
90 { TESTCASE_RESULT_TRANSACTION, "transaction" },
91 { TESTCASE_RESULT_PROBLEMS, "problems" },
92 { TESTCASE_RESULT_ORPHANED, "orphaned" },
93 { TESTCASE_RESULT_RECOMMENDED, "recommended" },
94 { TESTCASE_RESULT_UNNEEDED, "unneeded" },
95 { TESTCASE_RESULT_ALTERNATIVES, "alternatives" },
96 { TESTCASE_RESULT_RULES, "rules" },
97 { TESTCASE_RESULT_GENID, "genid" },
98 { TESTCASE_RESULT_REASON, "reason" },
99 { TESTCASE_RESULT_CLEANDEPS, "cleandeps" },
100 { TESTCASE_RESULT_JOBS, "jobs" },
101 { TESTCASE_RESULT_USERINSTALLED, "userinstalled" },
105 static struct solverflags2str {
109 } solverflags2str[] = {
110 { SOLVER_FLAG_ALLOW_DOWNGRADE, "allowdowngrade", 0 },
111 { SOLVER_FLAG_ALLOW_NAMECHANGE, "allownamechange", 1 },
112 { SOLVER_FLAG_ALLOW_ARCHCHANGE, "allowarchchange", 0 },
113 { SOLVER_FLAG_ALLOW_VENDORCHANGE, "allowvendorchange", 0 },
114 { SOLVER_FLAG_ALLOW_UNINSTALL, "allowuninstall", 0 },
115 { SOLVER_FLAG_NO_UPDATEPROVIDE, "noupdateprovide", 0 },
116 { SOLVER_FLAG_SPLITPROVIDES, "splitprovides", 0 },
117 { SOLVER_FLAG_IGNORE_RECOMMENDED, "ignorerecommended", 0 },
118 { SOLVER_FLAG_ADD_ALREADY_RECOMMENDED, "addalreadyrecommended", 0 },
119 { SOLVER_FLAG_NO_INFARCHCHECK, "noinfarchcheck", 0 },
120 { SOLVER_FLAG_KEEP_EXPLICIT_OBSOLETES, "keepexplicitobsoletes", 0 },
121 { SOLVER_FLAG_BEST_OBEY_POLICY, "bestobeypolicy", 0 },
122 { SOLVER_FLAG_NO_AUTOTARGET, "noautotarget", 0 },
123 { SOLVER_FLAG_DUP_ALLOW_DOWNGRADE, "dupallowdowngrade", 1 },
124 { SOLVER_FLAG_DUP_ALLOW_ARCHCHANGE, "dupallowarchchange", 1 },
125 { SOLVER_FLAG_DUP_ALLOW_VENDORCHANGE, "dupallowvendorchange", 1 },
126 { SOLVER_FLAG_DUP_ALLOW_NAMECHANGE, "dupallownamechange", 1 },
127 { SOLVER_FLAG_KEEP_ORPHANS, "keeporphans", 0 },
128 { SOLVER_FLAG_BREAK_ORPHANS, "breakorphans", 0 },
129 { SOLVER_FLAG_FOCUS_INSTALLED, "focusinstalled", 0 },
130 { SOLVER_FLAG_YUM_OBSOLETES, "yumobsoletes", 0 },
131 { SOLVER_FLAG_NEED_UPDATEPROVIDE, "needupdateprovide", 0 },
132 { SOLVER_FLAG_URPM_REORDER, "urpmreorder", 0 },
133 { SOLVER_FLAG_FOCUS_BEST, "focusbest", 0 },
134 { SOLVER_FLAG_STRONG_RECOMMENDS, "strongrecommends", 0 },
135 { SOLVER_FLAG_INSTALL_ALSO_UPDATES, "installalsoupdates", 0 },
136 { SOLVER_FLAG_ONLY_NAMESPACE_RECOMMENDED, "onlynamespacerecommended", 0 },
140 static struct poolflags2str {
144 } poolflags2str[] = {
145 { POOL_FLAG_PROMOTEEPOCH, "promoteepoch", 0 },
146 { POOL_FLAG_FORBIDSELFCONFLICTS, "forbidselfconflicts", 0 },
147 { POOL_FLAG_OBSOLETEUSESPROVIDES, "obsoleteusesprovides", 0 },
148 { POOL_FLAG_IMPLICITOBSOLETEUSESPROVIDES, "implicitobsoleteusesprovides", 0 },
149 { POOL_FLAG_OBSOLETEUSESCOLORS, "obsoleteusescolors", 0 },
150 { POOL_FLAG_IMPLICITOBSOLETEUSESCOLORS, "implicitobsoleteusescolors", 0 },
151 { POOL_FLAG_NOINSTALLEDOBSOLETES, "noinstalledobsoletes", 0 },
152 { POOL_FLAG_HAVEDISTEPOCH, "havedistepoch", 0 },
153 { POOL_FLAG_NOOBSOLETESMULTIVERSION, "noobsoletesmultiversion", 0 },
154 { POOL_FLAG_ADDFILEPROVIDESFILTERED, "addfileprovidesfiltered", 0 },
155 { POOL_FLAG_NOWHATPROVIDESAUX, "nowhatprovidesaux", 0 },
156 { POOL_FLAG_WHATPROVIDESWITHDISABLED, "whatprovideswithdisabled", 0 },
160 static struct disttype2str {
164 { DISTTYPE_RPM, "rpm" },
165 { DISTTYPE_DEB, "deb" },
166 { DISTTYPE_ARCH, "arch" },
167 { DISTTYPE_HAIKU, "haiku" },
168 { DISTTYPE_CONDA, "conda" },
172 static struct selflags2str {
176 { SELECTION_NAME, "name" },
177 { SELECTION_PROVIDES, "provides" },
178 { SELECTION_FILELIST, "filelist" },
179 { SELECTION_CANON, "canon" },
180 { SELECTION_DOTARCH, "dotarch" },
181 { SELECTION_REL, "rel" },
182 { SELECTION_INSTALLED_ONLY, "installedonly" },
183 { SELECTION_GLOB, "glob" },
184 { SELECTION_FLAT, "flat" },
185 { SELECTION_NOCASE, "nocase" },
186 { SELECTION_SOURCE_ONLY, "sourceonly" },
187 { SELECTION_WITH_SOURCE, "withsource" },
188 { SELECTION_SKIP_KIND, "skipkind" },
189 { SELECTION_MATCH_DEPSTR, "depstr" },
190 { SELECTION_WITH_DISABLED, "withdisabled" },
191 { SELECTION_WITH_BADARCH, "withbadarch" },
192 { SELECTION_ADD, "add" },
193 { SELECTION_SUBTRACT, "subtract" },
194 { SELECTION_FILTER, "filter" },
198 static const char *features[] = {
199 #ifdef ENABLE_LINKED_PKGS
202 #ifdef ENABLE_COMPLEX_DEPS
205 #if ENABLE_TESTCASE_HELIXREPO
206 "testcase_helixrepo",
211 typedef struct strqueue {
216 #define STRQUEUE_BLOCK 63
219 strqueue_init(Strqueue *q)
226 strqueue_free(Strqueue *q)
229 for (i = 0; i < q->nstr; i++)
230 solv_free(q->str[i]);
231 q->str = solv_free(q->str);
236 strqueue_push(Strqueue *q, const char *s)
238 q->str = solv_extend(q->str, q->nstr, 1, sizeof(*q->str), STRQUEUE_BLOCK);
239 q->str[q->nstr++] = solv_strdup(s);
243 strqueue_pushjoin(Strqueue *q, const char *s1, const char *s2, const char *s3)
245 q->str = solv_extend(q->str, q->nstr, 1, sizeof(*q->str), STRQUEUE_BLOCK);
246 q->str[q->nstr++] = solv_dupjoin(s1, s2, s3);
250 strqueue_sort_cmp(const void *ap, const void *bp, void *dp)
252 const char *a = *(const char **)ap;
253 const char *b = *(const char **)bp;
254 return strcmp(a ? a : "", b ? b : "");
258 strqueue_sort(Strqueue *q)
261 solv_sort(q->str, q->nstr, sizeof(*q->str), strqueue_sort_cmp, 0);
265 strqueue_sort_u(Strqueue *q)
269 for (i = j = 0; i < q->nstr; i++)
270 if (!j || strqueue_sort_cmp(q->str + i, q->str + j - 1, 0) != 0)
271 q->str[j++] = q->str[i];
276 strqueue_join(Strqueue *q)
280 for (i = 0; i < q->nstr; i++)
282 l += strlen(q->str[i]) + 1;
283 l++; /* trailing \0 */
286 for (i = 0; i < q->nstr; i++)
289 strcpy(rp, q->str[i]);
298 strqueue_split(Strqueue *q, const char *s)
303 while ((p = strchr(s, '\n')) != 0)
305 q->str = solv_extend(q->str, q->nstr, 1, sizeof(*q->str), STRQUEUE_BLOCK);
306 q->str[q->nstr] = solv_malloc(p - s + 1);
308 memcpy(q->str[q->nstr], s, p - s);
309 q->str[q->nstr][p - s] = 0;
318 strqueue_diff(Strqueue *sq1, Strqueue *sq2, Strqueue *osq)
321 while (i < sq1->nstr && j < sq2->nstr)
323 int r = strqueue_sort_cmp(sq1->str + i, sq2->str + j, 0);
327 strqueue_pushjoin(osq, "-", sq1->str[i++], 0);
329 strqueue_pushjoin(osq, "+", sq2->str[j++], 0);
331 while (i < sq1->nstr)
332 strqueue_pushjoin(osq, "-", sq1->str[i++], 0);
333 while (j < sq2->nstr)
334 strqueue_pushjoin(osq, "+", sq2->str[j++], 0);
337 /**********************************************************/
340 testcase_repoid2str(Pool *pool, Id repoid)
342 Repo *repo = pool_id2repo(pool, repoid);
345 char *r = pool_tmpjoin(pool, repo->name, 0, 0);
347 for (rp = r; *rp; rp++)
348 if (*rp == ' ' || *rp == '\t')
355 sprintf(buf, "#%d", repoid);
356 return pool_tmpjoin(pool, buf, 0, 0);
361 testcase_solvid2str(Pool *pool, Id p)
363 Solvable *s = pool->solvables + p;
364 const char *n, *e, *a;
367 if (p == SYSTEMSOLVABLE)
369 n = pool_id2str(pool, s->name);
370 e = pool_id2str(pool, s->evr);
371 a = pool_id2str(pool, s->arch);
372 str = pool_alloctmpspace(pool, strlen(n) + strlen(e) + strlen(a) + 3);
373 sprintf(str, "%s-%s", n, e);
374 if (solvable_lookup_type(s, SOLVABLE_BUILDFLAVOR))
379 queue_init(&flavorq);
380 solvable_lookup_idarray(s, SOLVABLE_BUILDFLAVOR, &flavorq);
381 for (i = 0; i < flavorq.count; i++)
382 str = pool_tmpappend(pool, str, "-", pool_id2str(pool, flavorq.elements[i]));
383 queue_free(&flavorq);
386 str = pool_tmpappend(pool, str, ".", a);
388 return pool_tmpappend(pool, str, "@", 0);
392 str = pool_tmpappend(pool, str, "@", s->repo->name);
394 if (str[l] == ' ' || str[l] == '\t')
398 sprintf(buf, "@#%d", s->repo->repoid);
399 return pool_tmpappend(pool, str, buf, 0);
403 testcase_str2repo(Pool *pool, const char *str)
407 if (str[0] == '#' && (str[1] >= '0' && str[1] <= '9'))
411 for (j = 1; str[j] >= '0' && str[j] <= '9'; j++)
412 repoid = repoid * 10 + (str[j] - '0');
413 if (!str[j] && repoid > 0 && repoid < pool->nrepos)
414 repo = pool_id2repo(pool, repoid);
418 FOR_REPOS(repoid, repo)
423 l = strlen(repo->name);
424 for (i = 0; i < l; i++)
426 int c = repo->name[i];
427 if (c == ' ' || c == '\t')
432 if (i == l && !str[l])
435 if (repoid >= pool->nrepos)
441 /* check evr and buildflavors */
443 str2solvid_check(Pool *pool, Solvable *s, const char *start, const char *end, Id evrid)
445 if (!solvable_lookup_type(s, SOLVABLE_BUILDFLAVOR))
447 /* just check the evr */
448 return evrid && s->evr == evrid;
455 queue_init(&flavorq);
456 solvable_lookup_idarray(s, SOLVABLE_BUILDFLAVOR, &flavorq);
457 queue_unshift(&flavorq, s->evr);
458 for (i = 0; i < flavorq.count; i++)
460 const char *part = pool_id2str(pool, flavorq.elements[i]);
461 size_t partl = strlen(part);
462 if (start + partl > end || strncmp(start, part, partl) != 0)
465 if (i + 1 < flavorq.count)
467 if (start >= end || *start != '-')
472 if (i < flavorq.count)
474 queue_free(&flavorq);
477 queue_free(&flavorq);
483 testcase_str2solvid(Pool *pool, const char *str)
485 int i, l = strlen(str);
492 if (*str == '@' && !strcmp(str, "@SYSTEM"))
493 return SYSTEMSOLVABLE;
495 for (i = l - 1; i >= 0; i--)
496 if (str[i] == '@' && (repo = testcase_str2repo(pool, str + i + 1)) != 0)
501 /* now find the arch (if present) */
503 for (i = repostart - 1; i > 0; i--)
506 arch = pool_strn2id(pool, str + i + 1, repostart - (i + 1), 0);
511 /* now find the name */
512 for (i = repostart - 1; i > 0; i--)
516 Id nid, evrid, p, pp;
517 nid = pool_strn2id(pool, str, i, 0);
520 evrid = pool_strn2id(pool, str + i + 1, repostart - (i + 1), 0);
521 /* first check whatprovides */
522 FOR_PROVIDES(p, pp, nid)
524 Solvable *s = pool->solvables + p;
527 if (repo && s->repo != repo)
529 if (arch && s->arch != arch)
531 if (str2solvid_check(pool, s, str + i + 1, str + repostart, evrid))
534 /* maybe it's not installable and thus not in whatprovides. do a slow search */
538 FOR_REPO_SOLVABLES(repo, p, s)
542 if (arch && s->arch != arch)
544 if (str2solvid_check(pool, s, str + i + 1, str + repostart, evrid))
550 FOR_POOL_SOLVABLES(p)
552 Solvable *s = pool->solvables + p;
555 if (arch && s->arch != arch)
557 if (str2solvid_check(pool, s, str + i + 1, str + repostart, evrid))
567 testcase_job2str(Pool *pool, Id how, Id what)
574 Id select = how & SOLVER_SELECTMASK;
576 for (i = 0; job2str[i].str; i++)
577 if ((how & SOLVER_JOBMASK) == job2str[i].job)
579 jobstr = job2str[i].str ? job2str[i].str : "unknown";
580 if (select == SOLVER_SOLVABLE)
583 pkgstr = testcase_solvid2str(pool, what);
585 else if (select == SOLVER_SOLVABLE_NAME)
588 pkgstr = testcase_dep2str(pool, what);
590 else if (select == SOLVER_SOLVABLE_PROVIDES)
592 selstr = " provides ";
593 pkgstr = testcase_dep2str(pool, what);
595 else if (select == SOLVER_SOLVABLE_ONE_OF)
600 while ((p = pool->whatprovidesdata[what++]) != 0)
602 const char *s = testcase_solvid2str(pool, p);
605 pkgstr = pool_tmpappend(pool, pkgstr, " ", s);
606 pool_freetmpspace(pool, s);
614 else if (select == SOLVER_SOLVABLE_REPO)
616 Repo *repo = pool_id2repo(pool, what);
621 sprintf(buf, "#%d", repo->repoid);
622 pkgstr = pool_tmpjoin(pool, buf, 0, 0);
625 pkgstr = pool_tmpjoin(pool, repo->name, 0, 0);
627 else if (select == SOLVER_SOLVABLE_ALL)
634 selstr = " unknown ";
637 ret = pool_tmpjoin(pool, jobstr, selstr, pkgstr);
639 ret = pool_tmpappend(pool, ret, " ", 0);
640 for (i = 0; jobflags2str[i].str; i++)
641 if ((how & jobflags2str[i].flag) != 0)
642 ret = pool_tmpappend(pool, ret, ",", jobflags2str[i].str);
648 ret = pool_tmpappend(pool, ret, "]", 0);
654 str2selflags(Pool *pool, char *s) /* modifies the string! */
659 char *se = strchr(s, ',');
662 for (i = 0; selflags2str[i].str; i++)
663 if (!strcmp(s, selflags2str[i].str))
665 selflags |= selflags2str[i].flag;
668 if (!selflags2str[i].str)
669 pool_error(pool, 0, "str2job: unknown selection flag '%s'", s);
676 str2jobflags(Pool *pool, char *s) /* modifies the string */
681 char *se = strchr(s, ',');
684 for (i = 0; jobflags2str[i].str; i++)
685 if (!strcmp(s, jobflags2str[i].str))
687 jobflags |= jobflags2str[i].flag;
690 if (!jobflags2str[i].str)
691 pool_error(pool, 0, "str2job: unknown job flag '%s'", s);
698 testcase_str2jobsel(Pool *pool, const char *caller, char **pieces, int npieces, Id *whatp)
701 if (!strcmp(pieces[0], "pkg") && npieces == 2)
703 job = SOLVER_SOLVABLE;
704 what = testcase_str2solvid(pool, pieces[1]);
706 return pool_error(pool, -1, "%s: unknown package '%s'", caller, pieces[1]);
708 else if (!strcmp(pieces[0], "name") || !strcmp(pieces[0], "provides"))
710 /* join em again for dep2str... */
712 for (sp = pieces[1]; sp < pieces[npieces - 1]; sp++)
716 if (pieces[0][0] == 'p' && strncmp(pieces[1], "namespace:", 10) == 0)
718 char *spe = strchr(pieces[1], '(');
719 int l = strlen(pieces[1]);
720 if (spe && pieces[1][l - 1] == ')')
722 /* special namespace provides */
723 if (strcmp(spe, "(<NULL>)") != 0)
725 pieces[1][l - 1] = 0;
726 what = testcase_str2dep(pool, spe + 1);
727 pieces[1][l - 1] = ')';
729 what = pool_rel2id(pool, pool_strn2id(pool, pieces[1], spe - pieces[1], 1), what, REL_NAMESPACE, 1);
733 what = testcase_str2dep(pool, pieces[1]);
734 if (pieces[0][0] == 'n')
735 job = SOLVER_SOLVABLE_NAME;
737 job = SOLVER_SOLVABLE_PROVIDES;
739 else if (!strcmp(pieces[0], "oneof"))
742 job = SOLVER_SOLVABLE_ONE_OF;
744 if (npieces > 1 && strcmp(pieces[1], "nothing") != 0)
747 for (i = 1; i < npieces; i++)
749 Id p = testcase_str2solvid(pool, pieces[i]);
753 return pool_error(pool, -1, "%s: unknown package '%s'", caller, pieces[i]);
758 what = pool_queuetowhatprovides(pool, &q);
761 else if (!strcmp(pieces[0], "repo") && npieces == 2)
763 Repo *repo = testcase_str2repo(pool, pieces[1]);
765 return pool_error(pool, -1, "%s: unknown repo '%s'", caller, pieces[1]);
766 job = SOLVER_SOLVABLE_REPO;
769 else if (!strcmp(pieces[0], "all") && npieces == 2 && !strcmp(pieces[1], "packages"))
771 job = SOLVER_SOLVABLE_ALL;
776 /* join em again for the error message... */
778 for (sp = pieces[0]; sp < pieces[npieces - 1]; sp++)
781 return pool_error(pool, -1, "%s: bad line '%s'", caller, pieces[0]);
788 testcase_str2job(Pool *pool, const char *str, Id *whatp)
798 /* so we can patch it */
799 s = pool_tmpjoin(pool, str, 0, 0);
800 /* split it in pieces */
803 while (*s == ' ' || *s == '\t')
807 pieces = solv_extend(pieces, npieces, 1, sizeof(*pieces), 7);
808 pieces[npieces++] = s;
809 while (*s && *s != ' ' && *s != '\t')
816 pool_error(pool, -1, "str2job: bad line '%s'", str);
821 for (i = 0; job2str[i].str; i++)
822 if (!strcmp(pieces[0], job2str[i].str))
826 pool_error(pool, -1, "str2job: unknown job '%s'", str);
830 job = job2str[i].job;
834 char *flags = pieces[npieces - 1];
835 if (*flags == '[' && flags[strlen(flags) - 1] == ']')
839 flags[strlen(flags) - 1] = 0;
840 job |= str2jobflags(pool, flags);
843 jobsel = testcase_str2jobsel(pool, "str2job", pieces + 1, npieces - 1, &what);
851 #define SELECTIONJOB_MATCHDEPS 1
852 #define SELECTIONJOB_MATCHDEPID 2
853 #define SELECTIONJOB_MATCHSOLVABLE 3
856 addselectionjob(Pool *pool, char **pieces, int npieces, Queue *jobqueue, int type, int keyname)
864 for (i = 0; job2str[i].str; i++)
865 if (!strcmp(pieces[0], job2str[i].str))
868 return pool_error(pool, -1, "selstr2job: unknown job '%s'", pieces[0]);
869 job = job2str[i].job;
872 char *flags = pieces[npieces - 1];
873 if (*flags == '[' && flags[strlen(flags) - 1] == ']')
877 flags[strlen(flags) - 1] = 0;
878 job |= str2jobflags(pool, flags);
882 return pool_error(pool, -1, "selstr2job: no selection flags");
883 selflags = str2selflags(pool, pieces[npieces - 1]);
885 for (sp = pieces[2]; sp < pieces[npieces - 2]; sp++)
889 if (selflags & (SELECTION_ADD | SELECTION_SUBTRACT | SELECTION_FILTER))
891 for (i = 0; i < jobqueue->count; i += 2)
892 queue_push2(&sel, jobqueue->elements[i] & (SOLVER_SELECTMASK | SOLVER_SETMASK), jobqueue->elements[i + 1]);
893 queue_empty(jobqueue);
896 r = selection_make(pool, &sel, pieces[2], selflags);
897 else if (type == SELECTIONJOB_MATCHDEPS)
898 r = selection_make_matchdeps(pool, &sel, pieces[2], selflags, keyname, 0);
899 else if (type == SELECTIONJOB_MATCHDEPID)
900 r = selection_make_matchdepid(pool, &sel, testcase_str2dep(pool, pieces[2]), selflags, keyname, 0);
901 else if (type == SELECTIONJOB_MATCHSOLVABLE)
902 r = selection_make_matchsolvable(pool, &sel, testcase_str2solvid(pool, pieces[2]), selflags, keyname, 0);
903 for (i = 0; i < sel.count; i += 2)
904 queue_push2(jobqueue, job | sel.elements[i], sel.elements[i + 1]);
910 testcase_getpoolflags(Pool *pool)
914 for (i = 0; poolflags2str[i].str; i++)
916 v = pool_get_flag(pool, poolflags2str[i].flag);
917 if (v == poolflags2str[i].def)
919 str = pool_tmpappend(pool, str, v ? " " : " !", poolflags2str[i].str);
921 return str ? str + 1 : "";
925 testcase_setpoolflags(Pool *pool, const char *str)
927 const char *p = str, *s;
931 while (*p == ' ' || *p == '\t' || *p == ',')
942 while (*p && *p != ' ' && *p != '\t' && *p != ',')
944 for (i = 0; poolflags2str[i].str; i++)
945 if (!strncmp(poolflags2str[i].str, s, p - s) && poolflags2str[i].str[p - s] == 0)
947 if (!poolflags2str[i].str)
948 return pool_error(pool, 0, "setpoolflags: unknown flag '%.*s'", (int)(p - s), s);
949 pool_set_flag(pool, poolflags2str[i].flag, v);
955 testcase_resetpoolflags(Pool *pool)
958 for (i = 0; poolflags2str[i].str; i++)
959 pool_set_flag(pool, poolflags2str[i].flag, poolflags2str[i].def);
963 testcase_getsolverflags(Solver *solv)
965 Pool *pool = solv->pool;
968 for (i = 0; solverflags2str[i].str; i++)
970 v = solver_get_flag(solv, solverflags2str[i].flag);
971 if (v == solverflags2str[i].def)
973 str = pool_tmpappend(pool, str, v ? " " : " !", solverflags2str[i].str);
975 return str ? str + 1 : "";
979 testcase_setsolverflags(Solver *solv, const char *str)
981 const char *p = str, *s;
985 while (*p == ' ' || *p == '\t' || *p == ',')
996 while (*p && *p != ' ' && *p != '\t' && *p != ',')
998 for (i = 0; solverflags2str[i].str; i++)
999 if (!strncmp(solverflags2str[i].str, s, p - s) && solverflags2str[i].str[p - s] == 0)
1001 if (!solverflags2str[i].str)
1002 return pool_error(solv->pool, 0, "setsolverflags: unknown flag '%.*s'", (int)(p - s), s);
1003 if (solver_set_flag(solv, solverflags2str[i].flag, v) == -1)
1004 return pool_error(solv->pool, 0, "setsolverflags: unsupported flag '%s'", solverflags2str[i].str);
1010 testcase_resetsolverflags(Solver *solv)
1013 for (i = 0; solverflags2str[i].str; i++)
1014 solver_set_flag(solv, solverflags2str[i].flag, solverflags2str[i].def);
1018 testcase_ruleid(Solver *solv, Id rid)
1024 const unsigned char *md5;
1030 solver_ruleliterals(solv, rid, &q);
1031 for (i = 0; i < q.count; i++)
1033 Id p = q.elements[i];
1034 s = testcase_solvid2str(solv->pool, p > 0 ? p : -p);
1036 s = pool_tmpjoin(solv->pool, "!", s, 0);
1037 strqueue_push(&sq, s);
1040 strqueue_sort_u(&sq);
1041 chk = solv_chksum_create(REPOKEY_TYPE_MD5);
1042 for (i = 0; i < sq.nstr; i++)
1043 solv_chksum_add(chk, sq.str[i], strlen(sq.str[i]) + 1);
1044 md5 = solv_chksum_get(chk, &md5l);
1045 s = pool_bin2hex(solv->pool, md5, md5l);
1046 chk = solv_chksum_free(chk, 0);
1052 testcase_problemid(Solver *solv, Id problem)
1057 const unsigned char *md5;
1061 /* we build a hash of all rules that define the problem */
1064 solver_findallproblemrules(solv, problem, &q);
1065 for (i = 0; i < q.count; i++)
1066 strqueue_push(&sq, testcase_ruleid(solv, q.elements[i]));
1068 strqueue_sort_u(&sq);
1069 chk = solv_chksum_create(REPOKEY_TYPE_MD5);
1070 for (i = 0; i < sq.nstr; i++)
1071 solv_chksum_add(chk, sq.str[i], strlen(sq.str[i]) + 1);
1072 md5 = solv_chksum_get(chk, &md5l);
1073 s = pool_bin2hex(solv->pool, md5, 4);
1074 chk = solv_chksum_free(chk, 0);
1080 testcase_solutionid(Solver *solv, Id problem, Id solution)
1084 const unsigned char *md5;
1088 intid = solver_solutionelement_internalid(solv, problem, solution);
1089 /* internal stuff! handle with care! */
1093 s = testcase_job2str(solv->pool, solv->job.elements[-intid - 1], solv->job.elements[-intid]);
1098 s = testcase_ruleid(solv, intid);
1100 chk = solv_chksum_create(REPOKEY_TYPE_MD5);
1101 solv_chksum_add(chk, s, strlen(s) + 1);
1102 md5 = solv_chksum_get(chk, &md5l);
1103 s = pool_bin2hex(solv->pool, md5, 4);
1104 chk = solv_chksum_free(chk, 0);
1109 testcase_alternativeid(Solver *solv, int type, Id id, Id from)
1112 Pool *pool = solv->pool;
1114 const unsigned char *md5;
1116 chk = solv_chksum_create(REPOKEY_TYPE_MD5);
1117 if (type == SOLVER_ALTERNATIVE_TYPE_RECOMMENDS)
1119 s = testcase_solvid2str(pool, from);
1120 solv_chksum_add(chk, s, strlen(s) + 1);
1121 s = testcase_dep2str(pool, id);
1122 solv_chksum_add(chk, s, strlen(s) + 1);
1124 else if (type == SOLVER_ALTERNATIVE_TYPE_RULE)
1126 s = testcase_ruleid(solv, id);
1127 solv_chksum_add(chk, s, strlen(s) + 1);
1129 md5 = solv_chksum_get(chk, &md5l);
1130 s = pool_bin2hex(pool, md5, 4);
1131 chk = solv_chksum_free(chk, 0);
1135 static struct class2str {
1139 { SOLVER_TRANSACTION_ERASE, "erase" },
1140 { SOLVER_TRANSACTION_INSTALL, "install" },
1141 { SOLVER_TRANSACTION_REINSTALLED, "reinstall" },
1142 { SOLVER_TRANSACTION_DOWNGRADED, "downgrade" },
1143 { SOLVER_TRANSACTION_CHANGED, "change" },
1144 { SOLVER_TRANSACTION_UPGRADED, "upgrade" },
1145 { SOLVER_TRANSACTION_OBSOLETED, "obsolete" },
1146 { SOLVER_TRANSACTION_MULTIINSTALL, "multiinstall" },
1147 { SOLVER_TRANSACTION_MULTIREINSTALL, "multireinstall" },
1151 static struct reason2str {
1155 { SOLVER_REASON_UNRELATED, "unrelated" },
1156 { SOLVER_REASON_UNIT_RULE, "unit" },
1157 { SOLVER_REASON_KEEP_INSTALLED, "keep" },
1158 { SOLVER_REASON_RESOLVE_JOB, "job" },
1159 { SOLVER_REASON_UPDATE_INSTALLED, "update" },
1160 { SOLVER_REASON_CLEANDEPS_ERASE, "cleandeps" },
1161 { SOLVER_REASON_RESOLVE, "resolve" },
1162 { SOLVER_REASON_WEAKDEP, "weakdep" },
1163 { SOLVER_REASON_RESOLVE_ORPHAN, "orphan" },
1165 { SOLVER_REASON_RECOMMENDED, "recommended" },
1166 { SOLVER_REASON_SUPPLEMENTED, "supplemented" },
1171 testcase_reason2str(Id reason)
1174 for (i = 0; reason2str[i].str; i++)
1175 if (reason == reason2str[i].reason)
1176 return reason2str[i].str;
1180 static struct rclass2str {
1184 { SOLVER_RULE_PKG, "pkg" },
1185 { SOLVER_RULE_UPDATE, "update" },
1186 { SOLVER_RULE_FEATURE, "feature" },
1187 { SOLVER_RULE_JOB, "job" },
1188 { SOLVER_RULE_DISTUPGRADE, "distupgrade" },
1189 { SOLVER_RULE_INFARCH, "infarch" },
1190 { SOLVER_RULE_CHOICE, "choice" },
1191 { SOLVER_RULE_LEARNT, "learnt" },
1192 { SOLVER_RULE_BEST, "best" },
1193 { SOLVER_RULE_YUMOBS, "yumobs" },
1194 { SOLVER_RULE_BLACK, "black" },
1195 { SOLVER_RULE_RECOMMENDS, "recommends" },
1200 testcase_rclass2str(Id rclass)
1203 for (i = 0; rclass2str[i].str; i++)
1204 if (rclass == rclass2str[i].rclass)
1205 return rclass2str[i].str;
1210 dump_genid(Pool *pool, Strqueue *sq, Id id, int cnt)
1218 Reldep *rd = GETRELDEP(pool, id);
1219 for (op = oplist; op->flags; op++)
1220 if (rd->flags == op->flags)
1222 cnt = dump_genid(pool, sq, rd->name, cnt);
1223 cnt = dump_genid(pool, sq, rd->evr, cnt);
1224 sprintf(cntbuf, "genid %2d: genid ", cnt++);
1225 s = pool_tmpjoin(pool, cntbuf, "op ", op->flags ? op->opname : "unknown");
1229 sprintf(cntbuf, "genid %2d: genid ", cnt++);
1230 s = pool_tmpjoin(pool, cntbuf, id ? "lit " : "null", id ? pool_id2str(pool, id) : 0);
1232 strqueue_push(sq, s);
1237 testcase_solverresult(Solver *solv, int resultflags)
1239 Pool *pool = solv->pool;
1247 if ((resultflags & TESTCASE_RESULT_TRANSACTION) != 0)
1249 Transaction *trans = solver_create_transaction(solv);
1253 for (i = 0; class2str[i].str; i++)
1256 transaction_classify_pkgs(trans, SOLVER_TRANSACTION_KEEP_PSEUDO, class2str[i].class, 0, 0, &q);
1257 for (j = 0; j < q.count; j++)
1261 if (pool->installed && pool->solvables[p].repo == pool->installed)
1262 op = transaction_obs_pkg(trans, p);
1263 s = pool_tmpjoin(pool, class2str[i].str, " ", testcase_solvid2str(pool, p));
1265 s = pool_tmpjoin(pool, s, " ", testcase_solvid2str(pool, op));
1266 strqueue_push(&sq, s);
1270 transaction_free(trans);
1272 if ((resultflags & TESTCASE_RESULT_PROBLEMS) != 0)
1274 char *probprefix, *solprefix;
1275 int problem, solution, element;
1278 pcnt = solver_problem_count(solv);
1279 for (problem = 1; problem <= pcnt; problem++)
1281 Id rid, from, to, dep;
1282 SolverRuleinfo rinfo;
1283 rid = solver_findproblemrule(solv, problem);
1284 s = testcase_problemid(solv, problem);
1285 probprefix = solv_dupjoin("problem ", s, 0);
1286 rinfo = solver_ruleinfo(solv, rid, &from, &to, &dep);
1287 s = pool_tmpjoin(pool, probprefix, " info ", solver_problemruleinfo2str(solv, rinfo, from, to, dep));
1288 strqueue_push(&sq, s);
1289 scnt = solver_solution_count(solv, problem);
1290 for (solution = 1; solution <= scnt; solution++)
1292 s = testcase_solutionid(solv, problem, solution);
1293 solprefix = solv_dupjoin(probprefix, " solution ", s);
1295 while ((element = solver_next_solutionelement(solv, problem, solution, element, &p, &op)) != 0)
1297 if (p == SOLVER_SOLUTION_JOB)
1298 s = pool_tmpjoin(pool, solprefix, " deljob ", testcase_job2str(pool, solv->job.elements[op - 1], solv->job.elements[op]));
1299 else if (p > 0 && op == 0)
1300 s = pool_tmpjoin(pool, solprefix, " erase ", testcase_solvid2str(pool, p));
1301 else if (p > 0 && op > 0)
1303 s = pool_tmpjoin(pool, solprefix, " replace ", testcase_solvid2str(pool, p));
1304 s = pool_tmpappend(pool, s, " ", testcase_solvid2str(pool, op));
1306 else if (p < 0 && op > 0)
1307 s = pool_tmpjoin(pool, solprefix, " allow ", testcase_solvid2str(pool, op));
1309 s = pool_tmpjoin(pool, solprefix, " unknown", 0);
1310 strqueue_push(&sq, s);
1312 solv_free(solprefix);
1314 solv_free(probprefix);
1318 if ((resultflags & TESTCASE_RESULT_ORPHANED) != 0)
1323 solver_get_orphaned(solv, &q);
1324 for (i = 0; i < q.count; i++)
1326 s = pool_tmpjoin(pool, "orphaned ", testcase_solvid2str(pool, q.elements[i]), 0);
1327 strqueue_push(&sq, s);
1332 if ((resultflags & TESTCASE_RESULT_RECOMMENDED) != 0)
1338 solver_get_recommendations(solv, &qr, &qs, 0);
1339 for (i = 0; i < qr.count; i++)
1341 s = pool_tmpjoin(pool, "recommended ", testcase_solvid2str(pool, qr.elements[i]), 0);
1342 strqueue_push(&sq, s);
1344 for (i = 0; i < qs.count; i++)
1346 s = pool_tmpjoin(pool, "suggested ", testcase_solvid2str(pool, qs.elements[i]), 0);
1347 strqueue_push(&sq, s);
1353 if ((resultflags & TESTCASE_RESULT_UNNEEDED) != 0)
1359 solver_get_unneeded(solv, &q, 0);
1360 solver_get_unneeded(solv, &qf, 1);
1361 for (i = j = 0; i < q.count; i++)
1363 /* we rely on qf containing a subset of q in the same order */
1364 if (j < qf.count && q.elements[i] == qf.elements[j])
1366 s = pool_tmpjoin(pool, "unneeded_filtered ", testcase_solvid2str(pool, q.elements[i]), 0);
1370 s = pool_tmpjoin(pool, "unneeded ", testcase_solvid2str(pool, q.elements[i]), 0);
1371 strqueue_push(&sq, s);
1376 if ((resultflags & TESTCASE_RESULT_USERINSTALLED) != 0)
1379 solver_get_userinstalled(solv, &q, 0);
1380 for (i = 0; i < q.count; i++)
1382 s = pool_tmpjoin(pool, "userinstalled pkg ", testcase_solvid2str(pool, q.elements[i]), 0);
1383 strqueue_push(&sq, s);
1386 solver_get_userinstalled(solv, &q, GET_USERINSTALLED_NAMES | GET_USERINSTALLED_INVERTED);
1387 for (i = 0; i < q.count; i++)
1389 s = pool_tmpjoin(pool, "autoinst name ", pool_id2str(pool, q.elements[i]), 0);
1390 strqueue_push(&sq, s);
1394 if ((resultflags & TESTCASE_RESULT_ALTERNATIVES) != 0)
1402 cnt = solver_alternatives_count(solv);
1403 for (alternative = 1; alternative <= cnt; alternative++)
1405 Id id, from, chosen;
1407 int type = solver_get_alternative(solv, alternative, &id, &from, &chosen, &q, 0);
1408 altprefix = solv_dupjoin("alternative ", testcase_alternativeid(solv, type, id, from), " ");
1410 if (type == SOLVER_ALTERNATIVE_TYPE_RECOMMENDS)
1412 char *s = pool_tmpjoin(pool, altprefix, num, testcase_solvid2str(pool, from));
1413 s = pool_tmpappend(pool, s, " recommends ", testcase_dep2str(pool, id));
1414 strqueue_push(&sq, s);
1416 else if (type == SOLVER_ALTERNATIVE_TYPE_RULE)
1418 /* map choice rules back to pkg rules */
1419 if (solver_ruleclass(solv, id) == SOLVER_RULE_CHOICE)
1420 id = solver_rule2pkgrule(solv, id);
1421 if (solver_ruleclass(solv, id) == SOLVER_RULE_RECOMMENDS)
1422 id = solver_rule2pkgrule(solv, id);
1423 solver_allruleinfos(solv, id, &rq);
1424 for (i = 0; i < rq.count; i += 4)
1426 int rtype = rq.elements[i];
1427 if ((rtype & SOLVER_RULE_TYPEMASK) == SOLVER_RULE_JOB)
1429 const char *js = testcase_job2str(pool, rq.elements[i + 2], rq.elements[i + 3]);
1430 char *s = pool_tmpjoin(pool, altprefix, num, "job ");
1431 s = pool_tmpappend(pool, s, js, 0);
1432 strqueue_push(&sq, s);
1434 else if (rtype == SOLVER_RULE_PKG_REQUIRES)
1436 char *s = pool_tmpjoin(pool, altprefix, num, testcase_solvid2str(pool, rq.elements[i + 1]));
1437 s = pool_tmpappend(pool, s, " requires ", testcase_dep2str(pool, rq.elements[i + 3]));
1438 strqueue_push(&sq, s);
1440 else if (rtype == SOLVER_RULE_UPDATE || rtype == SOLVER_RULE_FEATURE)
1442 const char *js = testcase_solvid2str(pool, rq.elements[i + 1]);
1443 char *s = pool_tmpjoin(pool, altprefix, num, "update ");
1444 s = pool_tmpappend(pool, s, js, 0);
1445 strqueue_push(&sq, s);
1449 for (i = 0; i < q.count; i++)
1451 Id p = q.elements[i];
1453 num[0] = '0' + (i + 1) / 10;
1454 num[1] = '0' + (i + 1) % 10;
1456 s = pool_tmpjoin(pool, altprefix, num, "+ ");
1458 s = pool_tmpjoin(pool, altprefix, num, "- ");
1460 s = pool_tmpjoin(pool, altprefix, num, " ");
1461 s = pool_tmpappend(pool, s, testcase_solvid2str(pool, p < 0 ? -p : p), 0);
1462 strqueue_push(&sq, s);
1464 solv_free(altprefix);
1469 if ((resultflags & TESTCASE_RESULT_RULES) != 0)
1471 /* dump all rules */
1473 SolverRuleinfo rclass;
1478 for (rid = 1; (rclass = solver_ruleclass(solv, rid)) != SOLVER_RULE_UNKNOWN; rid++)
1480 char *prefix = solv_dupjoin("rule ", testcase_rclass2str(rclass), " ");
1481 prefix = solv_dupappend(prefix, testcase_ruleid(solv, rid), 0);
1482 solver_ruleliterals(solv, rid, &q);
1483 if (rclass == SOLVER_RULE_FEATURE && q.count == 1 && q.elements[0] == -SYSTEMSOLVABLE)
1485 for (i = 0; i < q.count; i++)
1487 Id p = q.elements[i];
1490 s = pool_tmpjoin(pool, prefix, " -", testcase_solvid2str(pool, -p));
1492 s = pool_tmpjoin(pool, prefix, " ", testcase_solvid2str(pool, p));
1493 strqueue_push(&sq, s);
1499 if ((resultflags & TESTCASE_RESULT_GENID) != 0)
1501 for (i = 0 ; i < solv->job.count; i += 2)
1504 if (solv->job.elements[i] != (SOLVER_NOOP | SOLVER_SOLVABLE_PROVIDES))
1506 id = solv->job.elements[i + 1];
1507 s = testcase_dep2str(pool, id);
1508 strqueue_push(&sq, pool_tmpjoin(pool, "genid dep ", s, 0));
1509 if ((id2 = testcase_str2dep(pool, s)) != id)
1511 s = pool_tmpjoin(pool, "genid roundtrip error: ", testcase_dep2str(pool, id2), 0);
1512 strqueue_push(&sq, s);
1514 dump_genid(pool, &sq, id, 1);
1517 if ((resultflags & TESTCASE_RESULT_REASON) != 0)
1521 FOR_POOL_SOLVABLES(p)
1524 int reason = solver_describe_decision(solv, p, &info);
1525 if (reason == SOLVER_REASON_UNRELATED)
1527 if (reason == SOLVER_REASON_WEAKDEP)
1529 solver_describe_weakdep_decision(solv, p, &whyq);
1532 for (i = 0; i < whyq.count; i += 3)
1534 reason = whyq.elements[i];
1535 p2 = whyq.elements[i + 1];
1536 id = whyq.elements[i + 2];
1537 s = pool_tmpjoin(pool, "reason ", testcase_solvid2str(pool, p), 0);
1538 s = pool_tmpappend(pool, s, " ", testcase_reason2str(reason));
1539 s = pool_tmpappend(pool, s, " ", testcase_dep2str(pool, id));
1541 s = pool_tmpappend(pool, s, " ", testcase_solvid2str(pool, p2));
1542 strqueue_push(&sq, s);
1547 s = pool_tmpjoin(pool, "reason ", testcase_solvid2str(pool, p), 0);
1548 s = pool_tmpappend(pool, s, " ", testcase_reason2str(reason));
1550 s = pool_tmpappend(pool, s, " ", testcase_ruleid(solv, info));
1551 strqueue_push(&sq, s);
1555 if ((resultflags & TESTCASE_RESULT_CLEANDEPS) != 0)
1560 solver_get_cleandeps(solv, &q);
1561 for (i = 0; i < q.count; i++)
1563 s = pool_tmpjoin(pool, "cleandeps ", testcase_solvid2str(pool, q.elements[i]), 0);
1564 strqueue_push(&sq, s);
1568 if ((resultflags & TESTCASE_RESULT_JOBS) != 0)
1570 for (i = 0; i < solv->job.count; i += 2)
1572 s = (char *)testcase_job2str(pool, solv->job.elements[i], solv->job.elements[i + 1]);
1573 s = pool_tmpjoin(pool, "job ", s, 0);
1574 strqueue_push(&sq, s);
1578 result = strqueue_join(&sq);
1585 testcase_write_mangled(Solver *solv, const char *dir, int resultflags, const char *testcasename, const char *resultname)
1587 Pool *pool = solv->pool;
1594 char *cmd, *out, *result;
1598 testcasename = "testcase.t";
1600 resultname = "solver.result";
1603 if (mkdir(dir) && errno != EEXIST)
1605 if (mkdir(dir, 0777) && errno != EEXIST)
1607 return pool_error(solv->pool, 0, "testcase_write: could not create directory '%s'", dir);
1609 FOR_REPOS(repoid, repo)
1611 const char *name = testcase_repoid2str(pool, repoid);
1613 if (repo->subpriority)
1614 sprintf(priobuf, "%d.%d", repo->priority, repo->subpriority);
1616 sprintf(priobuf, "%d", repo->priority);
1617 #if !defined(WITHOUT_COOKIEOPEN) && defined(ENABLE_ZLIB_COMPRESSION)
1618 out = pool_tmpjoin(pool, name, ".repo", ".gz");
1620 out = pool_tmpjoin(pool, name, ".repo", 0);
1622 for (i = 0; out[i]; i++)
1625 cmd = pool_tmpjoin(pool, "repo ", name, " ");
1626 cmd = pool_tmpappend(pool, cmd, priobuf, " ");
1627 cmd = pool_tmpappend(pool, cmd, "testtags ", out);
1628 strqueue_push(&sq, cmd);
1629 out = pool_tmpjoin(pool, dir, "/", out);
1630 if (!(fp = solv_xfopen(out, "w")))
1632 pool_error(solv->pool, 0, "testcase_write: could not open '%s' for writing", out);
1636 testcase_write_testtags(repo, fp);
1639 pool_error(solv->pool, 0, "testcase_write: write error");
1644 /* hmm, this is not optimal... we currently search for the lowest score */
1646 arch = pool->solvables[SYSTEMSOLVABLE].arch;
1647 for (i = 0; i < pool->lastarch; i++)
1649 if (pool->id2arch[i] == 1 && !lowscore)
1651 if (pool->id2arch[i] > 0x10000 && (!lowscore || pool->id2arch[i] < lowscore))
1654 lowscore = pool->id2arch[i];
1657 cmd = pool_tmpjoin(pool, "system ", pool->lastarch ? pool_id2str(pool, arch) : "-", 0);
1658 for (i = 0; disttype2str[i].str != 0; i++)
1659 if (pool->disttype == disttype2str[i].type)
1661 pool_tmpappend(pool, cmd, " ", disttype2str[i].str ? disttype2str[i].str : "unknown");
1662 if (pool->installed)
1663 cmd = pool_tmpappend(pool, cmd, " ", testcase_repoid2str(pool, pool->installed->repoid));
1664 strqueue_push(&sq, cmd);
1665 s = testcase_getpoolflags(solv->pool);
1668 cmd = pool_tmpjoin(pool, "poolflags ", s, 0);
1669 strqueue_push(&sq, cmd);
1672 if (pool->vendorclasses)
1675 for (i = 0; pool->vendorclasses[i]; i++)
1677 cmd = pool_tmpappend(pool, cmd ? cmd : "vendorclass", " ", pool->vendorclasses[i]);
1678 if (!pool->vendorclasses[i + 1])
1680 strqueue_push(&sq, cmd);
1687 /* dump disabled packages (must come before the namespace/job lines) */
1688 if (pool->considered)
1691 FOR_POOL_SOLVABLES(p)
1692 if (!MAPTST(pool->considered, p))
1694 cmd = pool_tmpjoin(pool, "disable pkg ", testcase_solvid2str(pool, p), 0);
1695 strqueue_push(&sq, cmd);
1699 s = testcase_getsolverflags(solv);
1702 cmd = pool_tmpjoin(pool, "solverflags ", s, 0);
1703 strqueue_push(&sq, cmd);
1706 /* now dump all the ns callback values we know */
1707 if (pool->nscallback)
1711 for (rid = 1; rid < pool->nrels; rid++)
1713 Reldep *rd = pool->rels + rid;
1714 if (rd->flags != REL_NAMESPACE || rd->name == NAMESPACE_OTHERPROVIDERS)
1716 /* evaluate all namespace ids, skip empty results */
1717 d = pool_whatprovides(pool, MAKERELDEP(rid));
1718 if (!d || !pool->whatprovidesdata[d])
1720 cmd = pool_tmpjoin(pool, "namespace ", pool_id2str(pool, rd->name), "(");
1721 cmd = pool_tmpappend(pool, cmd, pool_id2str(pool, rd->evr), ")");
1722 for (; pool->whatprovidesdata[d]; d++)
1723 cmd = pool_tmpappend(pool, cmd, " ", testcase_solvid2str(pool, pool->whatprovidesdata[d]));
1724 strqueue_push(&sq, cmd);
1728 for (i = 0; i < solv->job.count; i += 2)
1730 cmd = (char *)testcase_job2str(pool, solv->job.elements[i], solv->job.elements[i + 1]);
1731 cmd = pool_tmpjoin(pool, "job ", cmd, 0);
1732 strqueue_push(&sq, cmd);
1735 if ((resultflags & ~TESTCASE_RESULT_REUSE_SOLVER) != 0)
1738 for (i = 0; resultflags2str[i].str; i++)
1739 if ((resultflags & resultflags2str[i].flag) != 0)
1740 cmd = pool_tmpappend(pool, cmd, cmd ? "," : 0, resultflags2str[i].str);
1741 cmd = pool_tmpjoin(pool, "result ", cmd ? cmd : "?", 0);
1742 cmd = pool_tmpappend(pool, cmd, " ", resultname);
1743 strqueue_push(&sq, cmd);
1744 result = testcase_solverresult(solv, resultflags);
1745 if (!strcmp(resultname, "<inline>"))
1748 strqueue_init(&rsq);
1749 strqueue_split(&rsq, result);
1750 for (i = 0; i < rsq.nstr; i++)
1752 cmd = pool_tmpjoin(pool, "#>", rsq.str[i], 0);
1753 strqueue_push(&sq, cmd);
1755 strqueue_free(&rsq);
1759 out = pool_tmpjoin(pool, dir, "/", resultname);
1760 if (!(fp = fopen(out, "w")))
1762 pool_error(solv->pool, 0, "testcase_write: could not open '%s' for writing", out);
1767 if (result && *result && fwrite(result, strlen(result), 1, fp) != 1)
1769 pool_error(solv->pool, 0, "testcase_write: write error");
1777 pool_error(solv->pool, 0, "testcase_write: write error");
1786 result = strqueue_join(&sq);
1788 out = pool_tmpjoin(pool, dir, "/", testcasename);
1789 if (!(fp = fopen(out, "w")))
1791 pool_error(solv->pool, 0, "testcase_write: could not open '%s' for writing", out);
1795 if (*result && fwrite(result, strlen(result), 1, fp) != 1)
1797 pool_error(solv->pool, 0, "testcase_write: write error");
1804 pool_error(solv->pool, 0, "testcase_write: write error");
1813 testcase_write(Solver *solv, const char *dir, int resultflags, const char *testcasename, const char *resultname)
1815 Pool *pool = solv->pool;
1818 const char **orignames;
1820 /* mangle repo names so that there are no conflicts */
1821 orignames = solv_calloc(pool->nrepos, sizeof(char *));
1822 for (repoid = 1; repoid < pool->nrepos; repoid++)
1824 Repo *repo = pool_id2repo(pool, repoid);
1825 char *buf = solv_malloc((repo->name ? strlen(repo->name) : 0) + 40);
1827 orignames[repoid] = repo->name;
1828 if (!repo->name || !repo->name[0])
1829 sprintf(buf, "#%d", repoid);
1831 strcpy(buf, repo->name);
1832 for (i = 0; buf[i]; i++)
1833 if (buf[i] == ' ' || buf[i] == '\t' || buf[i] == '/')
1835 mp = buf + strlen(buf);
1838 for (i = 1; i < repoid; i++)
1839 if (!strcmp(buf, pool_id2repo(pool, i)->name))
1843 sprintf(mp, "_%d", mangle++);
1847 r = testcase_write_mangled(solv, dir, resultflags, testcasename, resultname);
1848 for (repoid = 1; repoid < pool->nrepos; repoid++)
1850 Repo *repo = pool_id2repo(pool, repoid);
1851 solv_free((void *)repo->name);
1852 repo->name = orignames[repoid];
1854 solv_free(orignames);
1859 read_inline_file(FILE *fp, char **bufp, char **bufpp, int *buflp)
1861 char *result = solv_malloc(1024);
1868 if (rp - result + 256 >= resultl)
1870 resultl = rp - result;
1871 result = solv_realloc(result, resultl + 1024);
1872 rp = result + resultl;
1875 if (!fgets(rp, resultl - (rp - result), fp))
1878 if (rl && (rp == result || rp[-1] == '\n'))
1880 if (rl > 1 && rp[0] == '#' && rp[1] == '>')
1882 memmove(rp, rp + 2, rl - 2);
1887 while (rl + 16 > *buflp)
1889 *bufp = solv_realloc(*bufp, *buflp + 512);
1892 memmove(*bufp, rp, rl);
1893 if ((*bufp)[rl - 1] == '\n')
1899 (*bufpp) = *bufp + rl;
1916 char *result = solv_malloc(1024);
1923 if (rp - result + 256 >= resultl)
1925 resultl = rp - result;
1926 result = solv_realloc(result, resultl + 1024);
1927 rp = result + resultl;
1930 rl = fread(rp, 1, resultl - (rp - result), fp);
1942 str2resultflags(Pool *pool, char *s) /* modifies the string! */
1944 int i, resultflags = 0;
1947 char *se = strchr(s, ',');
1950 for (i = 0; resultflags2str[i].str; i++)
1951 if (!strcmp(s, resultflags2str[i].str))
1953 resultflags |= resultflags2str[i].flag;
1956 if (!resultflags2str[i].str)
1957 pool_error(pool, 0, "result: unknown flag '%s'", s);
1964 testcase_read(Pool *pool, FILE *fp, const char *testcase, Queue *job, char **resultp, int *resultflagsp)
1969 char *testcasedir, *s;
1975 int poolflagsreset = 0;
1976 int missing_features = 0;
1985 if (!fp && !(fp = fopen(testcase, "r")))
1987 pool_error(pool, 0, "testcase_read: could not open '%s'", testcase);
1990 testcasedir = solv_strdup(testcase);
1991 s = strrchr(testcasedir, '/');
1993 buf = strrchr(testcasedir, '\\');
1994 if (!s || (buf && buf > s))
2002 buf = solv_malloc(bufl);
2005 queue_init(&autoinstq);
2008 if (bufp - buf + 16 > bufl)
2011 buf = solv_realloc(buf, bufl + 512);
2015 if (!fgets(bufp, bufl - (bufp - buf), fp))
2019 if (!l || buf[l - 1] != '\n')
2026 while (*s && (*s == ' ' || *s == '\t'))
2028 if (!*s || *s == '#')
2031 /* split it in pieces */
2034 while (*s == ' ' || *s == '\t')
2038 pieces = solv_extend(pieces, npieces, 1, sizeof(*pieces), 7);
2039 pieces[npieces++] = s;
2040 while (*s && *s != ' ' && *s != '\t')
2045 pieces = solv_extend(pieces, npieces, 1, sizeof(*pieces), 7);
2046 pieces[npieces] = 0;
2047 if (!strcmp(pieces[0], "repo") && npieces >= 4)
2049 Repo *repo = repo_create(pool, pieces[1]);
2055 if (!poolflagsreset)
2058 testcase_resetpoolflags(pool); /* hmm */
2060 if (sscanf(pieces[2], "%d.%d", &prio, &subprio) != 2)
2063 prio = atoi(pieces[2]);
2065 repo->priority = prio;
2066 repo->subpriority = subprio;
2067 if (strcmp(pieces[3], "empty") != 0)
2069 const char *repotype = pool_tmpjoin(pool, pieces[3], 0, 0); /* gets overwritten in <inline> case */
2070 if (!strcmp(pieces[4], "<inline>"))
2072 char *idata = read_inline_file(fp, &buf, &bufp, &bufl);
2074 rfp = solv_xfopen_buf(rdata, &idata, 0, "rf");
2078 rdata = pool_tmpjoin(pool, testcasedir, pieces[4], 0);
2079 rfp = solv_xfopen(rdata, "r");
2083 pool_error(pool, 0, "testcase_read: could not open '%s'", rdata);
2085 else if (!strcmp(repotype, "testtags"))
2087 testcase_add_testtags(repo, rfp, 0);
2090 else if (!strcmp(repotype, "solv"))
2092 repo_add_solv(repo, rfp, 0);
2095 #if ENABLE_TESTCASE_HELIXREPO
2096 else if (!strcmp(repotype, "helix"))
2098 repo_add_helix(repo, rfp, 0);
2105 pool_error(pool, 0, "testcase_read: unknown repo type for repo '%s'", repo->name);
2109 else if (!strcmp(pieces[0], "system") && npieces >= 3)
2113 /* must set the disttype before the arch */
2115 if (strcmp(pieces[2], "*") != 0)
2117 char *dp = pieces[2];
2120 char *dpe = strchr(dp, ',');
2123 for (i = 0; disttype2str[i].str != 0; i++)
2124 if (!strcmp(disttype2str[i].str, dp))
2128 if (disttype2str[i].str)
2130 #ifdef MULTI_SEMANTICS
2131 if (pool->disttype != disttype2str[i].type)
2132 pool_setdisttype(pool, disttype2str[i].type);
2134 if (pool->disttype == disttype2str[i].type)
2141 pool_error(pool, 0, "testcase_read: system: could not change disttype to '%s'", pieces[2]);
2142 missing_features = 1;
2145 if (strcmp(pieces[1], "unset") == 0 || strcmp(pieces[1], "-") == 0)
2146 pool_setarch(pool, 0);
2147 else if (pieces[1][0] == ':')
2148 pool_setarchpolicy(pool, pieces[1] + 1);
2150 pool_setarch(pool, pieces[1]);
2153 Repo *repo = testcase_str2repo(pool, pieces[3]);
2155 pool_error(pool, 0, "testcase_read: system: unknown repo '%s'", pieces[3]);
2157 pool_set_installed(pool, repo);
2160 else if (!strcmp(pieces[0], "job") && npieces > 1)
2166 pool_addfileprovides(pool);
2167 pool_createwhatprovides(pool);
2170 if (npieces >= 3 && !strcmp(pieces[2], "selection"))
2172 addselectionjob(pool, pieces + 1, npieces - 1, job, 0, 0);
2175 if (npieces >= 4 && !strcmp(pieces[2], "selection_matchdeps"))
2177 pieces[2] = pieces[1];
2178 addselectionjob(pool, pieces + 2, npieces - 2, job, SELECTIONJOB_MATCHDEPS, pool_str2id(pool, pieces[3], 1));
2181 if (npieces >= 4 && !strcmp(pieces[2], "selection_matchdepid"))
2183 pieces[2] = pieces[1];
2184 addselectionjob(pool, pieces + 2, npieces - 2, job, SELECTIONJOB_MATCHDEPID, pool_str2id(pool, pieces[3], 1));
2187 if (npieces >= 4 && !strcmp(pieces[2], "selection_matchsolvable"))
2189 pieces[2] = pieces[1];
2190 addselectionjob(pool, pieces + 2, npieces - 2, job, SELECTIONJOB_MATCHSOLVABLE, pool_str2id(pool, pieces[3], 1));
2194 for (sp = pieces[1]; sp < pieces[npieces - 1]; sp++)
2197 how = testcase_str2job(pool, pieces[1], &what);
2198 if (how >= 0 && job)
2199 queue_push2(job, how, what);
2201 else if (!strcmp(pieces[0], "vendorclass") && npieces > 1)
2203 pool_addvendorclass(pool, (const char **)(pieces + 1));
2205 else if (!strcmp(pieces[0], "namespace") && npieces > 1)
2207 int i = strlen(pieces[1]);
2208 s = strchr(pieces[1], '(');
2209 if (!s || pieces[1][i - 1] != ')')
2211 pool_error(pool, 0, "testcase_read: bad namespace '%s'", pieces[1]);
2219 pieces[1][i - 1] = 0;
2220 name = pool_str2id(pool, pieces[1], 1);
2221 evr = pool_str2id(pool, s + 1, 1);
2223 pieces[1][i - 1] = ')';
2224 id = pool_rel2id(pool, name, evr, REL_NAMESPACE, 1);
2225 for (i = 2; i < npieces; i++)
2226 queue_push(&q, testcase_str2solvid(pool, pieces[i]));
2227 /* now do the callback */
2230 pool_addfileprovides(pool);
2231 pool_createwhatprovides(pool);
2234 pool->whatprovides_rel[GETRELID(id)] = pool_queuetowhatprovides(pool, &q);
2238 else if (!strcmp(pieces[0], "poolflags"))
2241 if (!poolflagsreset)
2244 testcase_resetpoolflags(pool); /* hmm */
2246 for (i = 1; i < npieces; i++)
2247 testcase_setpoolflags(pool, pieces[i]);
2249 else if (!strcmp(pieces[0], "solverflags") && npieces > 1)
2254 solv = solver_create(pool);
2255 testcase_resetsolverflags(solv);
2257 for (i = 1; i < npieces; i++)
2258 testcase_setsolverflags(solv, pieces[i]);
2260 else if (!strcmp(pieces[0], "result") && npieces > 1)
2263 int resultflags = str2resultflags(pool, pieces[1]);
2267 rdata = pool_tmpjoin(pool, testcasedir, pieces[2], 0);
2268 if (!strcmp(pieces[2], "<inline>"))
2269 result = read_inline_file(fp, &buf, &bufp, &bufl);
2272 FILE *rfp = fopen(rdata, "r");
2274 pool_error(pool, 0, "testcase_read: could not open '%s'", rdata);
2277 result = read_file(rfp);
2287 *resultflagsp = resultflags;
2289 else if (!strcmp(pieces[0], "nextjob"))
2291 if (npieces == 2 && resultflagsp && !strcmp(pieces[1], "reusesolver"))
2292 *resultflagsp |= TESTCASE_RESULT_REUSE_SOLVER;
2295 else if (!strcmp(pieces[0], "disable") && npieces == 3)
2297 Id p, pp, jobsel, what = 0;
2299 pool_createwhatprovides(pool);
2301 if (!pool->considered)
2303 pool->considered = solv_calloc(1, sizeof(Map));
2304 map_init(pool->considered, pool->nsolvables);
2305 map_setall(pool->considered);
2307 jobsel = testcase_str2jobsel(pool, "disable", pieces + 1, npieces - 1, &what);
2310 if (jobsel == SOLVER_SOLVABLE_ALL)
2311 map_empty(pool->considered);
2312 else if (jobsel == SOLVER_SOLVABLE_REPO)
2314 Repo *repo = pool_id2repo(pool, what);
2316 FOR_REPO_SOLVABLES(repo, p, s)
2317 MAPCLR(pool->considered, p);
2319 FOR_JOB_SELECT(p, pp, jobsel, what)
2320 MAPCLR(pool->considered, p);
2322 else if (!strcmp(pieces[0], "feature"))
2325 for (i = 1; i < npieces; i++)
2327 for (j = 0; features[j]; j++)
2328 if (!strcmp(pieces[i], features[j]))
2332 pool_error(pool, 0, "testcase_read: missing feature '%s'", pieces[i]);
2336 if (missing_features)
2339 else if (!strcmp(pieces[0], "genid") && npieces > 1)
2346 for (sp = pieces[2]; sp < pieces[npieces - 1]; sp++)
2350 genid = solv_extend(genid, ngenid, 1, sizeof(*genid), 7);
2351 if (!strcmp(pieces[1], "op") && npieces > 2)
2354 for (op = oplist; op->flags; op++)
2355 if (!strncmp(pieces[2], op->opname, strlen(op->opname)))
2359 pool_error(pool, 0, "testcase_read: genid: unknown op '%s'", pieces[2]);
2364 pool_error(pool, 0, "testcase_read: genid: out of stack");
2368 id = pool_rel2id(pool, genid[ngenid] , genid[ngenid + 1], op->flags, 1);
2370 else if (!strcmp(pieces[1], "lit"))
2371 id = pool_str2id(pool, npieces > 2 ? pieces[2] : "", 1);
2372 else if (!strcmp(pieces[1], "null"))
2374 else if (!strcmp(pieces[1], "dep"))
2375 id = testcase_str2dep(pool, pieces[2]);
2378 pool_error(pool, 0, "testcase_read: genid: unknown command '%s'", pieces[1]);
2381 genid[ngenid++] = id;
2383 else if (!strcmp(pieces[0], "autoinst") && npieces > 2)
2385 if (strcmp(pieces[1], "name"))
2387 pool_error(pool, 0, "testcase_read: autoinst: illegal mode");
2390 queue_push(&autoinstq, pool_str2id(pool, pieces[2], 1));
2392 else if (!strcmp(pieces[0], "evrcmp") && npieces == 3)
2394 Id evr1 = pool_str2id(pool, pieces[1], 1);
2395 Id evr2 = pool_str2id(pool, pieces[2], 1);
2396 int r = pool_evrcmp(pool, evr1, evr2, EVRCMP_COMPARE);
2397 r = r < 0 ? REL_LT : r > 0 ? REL_GT : REL_EQ;
2398 queue_push2(job, SOLVER_NOOP | SOLVER_SOLVABLE_PROVIDES, pool_rel2id(pool, evr1, evr2, r, 1));
2402 pool_error(pool, 0, "testcase_read: cannot parse command '%s'", pieces[0]);
2405 while (job && ngenid > 0)
2406 queue_push2(job, SOLVER_NOOP | SOLVER_SOLVABLE_PROVIDES, genid[--ngenid]);
2407 if (autoinstq.count)
2408 pool_add_userinstalled_jobs(pool, &autoinstq, job, GET_USERINSTALLED_NAMES | GET_USERINSTALLED_INVERTED);
2409 queue_free(&autoinstq);
2410 genid = solv_free(genid);
2411 buf = solv_free(buf);
2412 pieces = solv_free(pieces);
2413 solv_free(testcasedir);
2416 pool_addfileprovides(pool);
2417 pool_createwhatprovides(pool);
2421 solv = solver_create(pool);
2422 testcase_resetsolverflags(solv);
2426 if (missing_features)
2431 *resultflagsp = 77; /* hack for testsolv */
2437 testcase_resultdiff(const char *result1, const char *result2)
2439 Strqueue sq1, sq2, osq;
2441 strqueue_init(&sq1);
2442 strqueue_init(&sq2);
2443 strqueue_init(&osq);
2444 strqueue_split(&sq1, result1);
2445 strqueue_split(&sq2, result2);
2446 strqueue_sort(&sq1);
2447 strqueue_sort(&sq2);
2448 strqueue_diff(&sq1, &sq2, &osq);
2449 r = osq.nstr ? strqueue_join(&osq) : 0;
2450 strqueue_free(&sq1);
2451 strqueue_free(&sq2);
2452 strqueue_free(&osq);