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" },
65 static struct jobflags2str {
69 { SOLVER_WEAK, "weak" },
70 { SOLVER_ESSENTIAL, "essential" },
71 { SOLVER_CLEANDEPS, "cleandeps" },
72 { SOLVER_ORUPDATE, "orupdate" },
73 { SOLVER_FORCEBEST, "forcebest" },
74 { SOLVER_TARGETED, "targeted" },
75 { SOLVER_NOTBYUSER, "notbyuser" },
76 { SOLVER_SETEV, "setev" },
77 { SOLVER_SETEVR, "setevr" },
78 { SOLVER_SETARCH, "setarch" },
79 { SOLVER_SETVENDOR, "setvendor" },
80 { SOLVER_SETREPO, "setrepo" },
81 { SOLVER_NOAUTOSET, "noautoset" },
85 static struct resultflags2str {
88 } resultflags2str[] = {
89 { TESTCASE_RESULT_TRANSACTION, "transaction" },
90 { TESTCASE_RESULT_PROBLEMS, "problems" },
91 { TESTCASE_RESULT_ORPHANED, "orphaned" },
92 { TESTCASE_RESULT_RECOMMENDED, "recommended" },
93 { TESTCASE_RESULT_UNNEEDED, "unneeded" },
94 { TESTCASE_RESULT_ALTERNATIVES, "alternatives" },
95 { TESTCASE_RESULT_RULES, "rules" },
96 { TESTCASE_RESULT_GENID, "genid" },
97 { TESTCASE_RESULT_REASON, "reason" },
98 { TESTCASE_RESULT_CLEANDEPS, "cleandeps" },
99 { TESTCASE_RESULT_JOBS, "jobs" },
100 { TESTCASE_RESULT_USERINSTALLED, "userinstalled" },
104 static struct solverflags2str {
108 } solverflags2str[] = {
109 { SOLVER_FLAG_ALLOW_DOWNGRADE, "allowdowngrade", 0 },
110 { SOLVER_FLAG_ALLOW_NAMECHANGE, "allownamechange", 1 },
111 { SOLVER_FLAG_ALLOW_ARCHCHANGE, "allowarchchange", 0 },
112 { SOLVER_FLAG_ALLOW_VENDORCHANGE, "allowvendorchange", 0 },
113 { SOLVER_FLAG_ALLOW_UNINSTALL, "allowuninstall", 0 },
114 { SOLVER_FLAG_NO_UPDATEPROVIDE, "noupdateprovide", 0 },
115 { SOLVER_FLAG_SPLITPROVIDES, "splitprovides", 0 },
116 { SOLVER_FLAG_IGNORE_RECOMMENDED, "ignorerecommended", 0 },
117 { SOLVER_FLAG_ADD_ALREADY_RECOMMENDED, "addalreadyrecommended", 0 },
118 { SOLVER_FLAG_NO_INFARCHCHECK, "noinfarchcheck", 0 },
119 { SOLVER_FLAG_KEEP_EXPLICIT_OBSOLETES, "keepexplicitobsoletes", 0 },
120 { SOLVER_FLAG_BEST_OBEY_POLICY, "bestobeypolicy", 0 },
121 { SOLVER_FLAG_NO_AUTOTARGET, "noautotarget", 0 },
122 { SOLVER_FLAG_DUP_ALLOW_DOWNGRADE, "dupallowdowngrade", 1 },
123 { SOLVER_FLAG_DUP_ALLOW_ARCHCHANGE, "dupallowarchchange", 1 },
124 { SOLVER_FLAG_DUP_ALLOW_VENDORCHANGE, "dupallowvendorchange", 1 },
125 { SOLVER_FLAG_DUP_ALLOW_NAMECHANGE, "dupallownamechange", 1 },
126 { SOLVER_FLAG_KEEP_ORPHANS, "keeporphans", 0 },
127 { SOLVER_FLAG_BREAK_ORPHANS, "breakorphans", 0 },
128 { SOLVER_FLAG_FOCUS_INSTALLED, "focusinstalled", 0 },
129 { SOLVER_FLAG_YUM_OBSOLETES, "yumobsoletes", 0 },
130 { SOLVER_FLAG_NEED_UPDATEPROVIDE, "needupdateprovide", 0 },
131 { SOLVER_FLAG_URPM_REORDER, "urpmreorder", 0 },
132 { SOLVER_FLAG_FOCUS_BEST, "focusbest", 0 },
133 { SOLVER_FLAG_STRONG_RECOMMENDS, "strongrecommends", 0 },
134 { SOLVER_FLAG_INSTALL_ALSO_UPDATES, "installalsoupdates", 0 },
135 { SOLVER_FLAG_ONLY_NAMESPACE_RECOMMENDED, "onlynamespacerecommended", 0 },
139 static struct poolflags2str {
143 } poolflags2str[] = {
144 { POOL_FLAG_PROMOTEEPOCH, "promoteepoch", 0 },
145 { POOL_FLAG_FORBIDSELFCONFLICTS, "forbidselfconflicts", 0 },
146 { POOL_FLAG_OBSOLETEUSESPROVIDES, "obsoleteusesprovides", 0 },
147 { POOL_FLAG_IMPLICITOBSOLETEUSESPROVIDES, "implicitobsoleteusesprovides", 0 },
148 { POOL_FLAG_OBSOLETEUSESCOLORS, "obsoleteusescolors", 0 },
149 { POOL_FLAG_IMPLICITOBSOLETEUSESCOLORS, "implicitobsoleteusescolors", 0 },
150 { POOL_FLAG_NOINSTALLEDOBSOLETES, "noinstalledobsoletes", 0 },
151 { POOL_FLAG_HAVEDISTEPOCH, "havedistepoch", 0 },
152 { POOL_FLAG_NOOBSOLETESMULTIVERSION, "noobsoletesmultiversion", 0 },
153 { POOL_FLAG_ADDFILEPROVIDESFILTERED, "addfileprovidesfiltered", 0 },
154 { POOL_FLAG_NOWHATPROVIDESAUX, "nowhatprovidesaux", 0 },
155 { POOL_FLAG_WHATPROVIDESWITHDISABLED, "whatprovideswithdisabled", 0 },
159 static struct disttype2str {
163 { DISTTYPE_RPM, "rpm" },
164 { DISTTYPE_DEB, "deb" },
165 { DISTTYPE_ARCH, "arch" },
166 { DISTTYPE_HAIKU, "haiku" },
167 { DISTTYPE_CONDA, "conda" },
171 static struct selflags2str {
175 { SELECTION_NAME, "name" },
176 { SELECTION_PROVIDES, "provides" },
177 { SELECTION_FILELIST, "filelist" },
178 { SELECTION_CANON, "canon" },
179 { SELECTION_DOTARCH, "dotarch" },
180 { SELECTION_REL, "rel" },
181 { SELECTION_INSTALLED_ONLY, "installedonly" },
182 { SELECTION_GLOB, "glob" },
183 { SELECTION_FLAT, "flat" },
184 { SELECTION_NOCASE, "nocase" },
185 { SELECTION_SOURCE_ONLY, "sourceonly" },
186 { SELECTION_WITH_SOURCE, "withsource" },
187 { SELECTION_SKIP_KIND, "skipkind" },
188 { SELECTION_MATCH_DEPSTR, "depstr" },
189 { SELECTION_WITH_DISABLED, "withdisabled" },
190 { SELECTION_WITH_BADARCH, "withbadarch" },
191 { SELECTION_ADD, "add" },
192 { SELECTION_SUBTRACT, "subtract" },
193 { SELECTION_FILTER, "filter" },
197 static const char *features[] = {
198 #ifdef ENABLE_LINKED_PKGS
201 #ifdef ENABLE_COMPLEX_DEPS
204 #if ENABLE_TESTCASE_HELIXREPO
205 "testcase_helixrepo",
210 typedef struct strqueue {
215 #define STRQUEUE_BLOCK 63
218 strqueue_init(Strqueue *q)
225 strqueue_free(Strqueue *q)
228 for (i = 0; i < q->nstr; i++)
229 solv_free(q->str[i]);
230 q->str = solv_free(q->str);
235 strqueue_push(Strqueue *q, const char *s)
237 q->str = solv_extend(q->str, q->nstr, 1, sizeof(*q->str), STRQUEUE_BLOCK);
238 q->str[q->nstr++] = solv_strdup(s);
242 strqueue_pushjoin(Strqueue *q, const char *s1, const char *s2, const char *s3)
244 q->str = solv_extend(q->str, q->nstr, 1, sizeof(*q->str), STRQUEUE_BLOCK);
245 q->str[q->nstr++] = solv_dupjoin(s1, s2, s3);
249 strqueue_sort_cmp(const void *ap, const void *bp, void *dp)
251 const char *a = *(const char **)ap;
252 const char *b = *(const char **)bp;
253 return strcmp(a ? a : "", b ? b : "");
257 strqueue_sort(Strqueue *q)
260 solv_sort(q->str, q->nstr, sizeof(*q->str), strqueue_sort_cmp, 0);
264 strqueue_sort_u(Strqueue *q)
268 for (i = j = 0; i < q->nstr; i++)
269 if (!j || strqueue_sort_cmp(q->str + i, q->str + j - 1, 0) != 0)
270 q->str[j++] = q->str[i];
275 strqueue_join(Strqueue *q)
279 for (i = 0; i < q->nstr; i++)
281 l += strlen(q->str[i]) + 1;
282 l++; /* trailing \0 */
285 for (i = 0; i < q->nstr; i++)
288 strcpy(rp, q->str[i]);
297 strqueue_split(Strqueue *q, const char *s)
302 while ((p = strchr(s, '\n')) != 0)
304 q->str = solv_extend(q->str, q->nstr, 1, sizeof(*q->str), STRQUEUE_BLOCK);
305 q->str[q->nstr] = solv_malloc(p - s + 1);
307 memcpy(q->str[q->nstr], s, p - s);
308 q->str[q->nstr][p - s] = 0;
317 strqueue_diff(Strqueue *sq1, Strqueue *sq2, Strqueue *osq)
320 while (i < sq1->nstr && j < sq2->nstr)
322 int r = strqueue_sort_cmp(sq1->str + i, sq2->str + j, 0);
326 strqueue_pushjoin(osq, "-", sq1->str[i++], 0);
328 strqueue_pushjoin(osq, "+", sq2->str[j++], 0);
330 while (i < sq1->nstr)
331 strqueue_pushjoin(osq, "-", sq1->str[i++], 0);
332 while (j < sq2->nstr)
333 strqueue_pushjoin(osq, "+", sq2->str[j++], 0);
336 /**********************************************************/
339 testcase_repoid2str(Pool *pool, Id repoid)
341 Repo *repo = pool_id2repo(pool, repoid);
344 char *r = pool_tmpjoin(pool, repo->name, 0, 0);
346 for (rp = r; *rp; rp++)
347 if (*rp == ' ' || *rp == '\t')
354 sprintf(buf, "#%d", repoid);
355 return pool_tmpjoin(pool, buf, 0, 0);
360 testcase_solvid2str(Pool *pool, Id p)
362 Solvable *s = pool->solvables + p;
363 const char *n, *e, *a;
366 if (p == SYSTEMSOLVABLE)
368 n = pool_id2str(pool, s->name);
369 e = pool_id2str(pool, s->evr);
370 a = pool_id2str(pool, s->arch);
371 str = pool_alloctmpspace(pool, strlen(n) + strlen(e) + strlen(a) + 3);
372 sprintf(str, "%s-%s", n, e);
373 if (solvable_lookup_type(s, SOLVABLE_BUILDFLAVOR))
378 queue_init(&flavorq);
379 solvable_lookup_idarray(s, SOLVABLE_BUILDFLAVOR, &flavorq);
380 for (i = 0; i < flavorq.count; i++)
381 str = pool_tmpappend(pool, str, "-", pool_id2str(pool, flavorq.elements[i]));
382 queue_free(&flavorq);
385 str = pool_tmpappend(pool, str, ".", a);
387 return pool_tmpappend(pool, str, "@", 0);
391 str = pool_tmpappend(pool, str, "@", s->repo->name);
393 if (str[l] == ' ' || str[l] == '\t')
397 sprintf(buf, "@#%d", s->repo->repoid);
398 return pool_tmpappend(pool, str, buf, 0);
402 testcase_str2repo(Pool *pool, const char *str)
406 if (str[0] == '#' && (str[1] >= '0' && str[1] <= '9'))
410 for (j = 1; str[j] >= '0' && str[j] <= '9'; j++)
411 repoid = repoid * 10 + (str[j] - '0');
412 if (!str[j] && repoid > 0 && repoid < pool->nrepos)
413 repo = pool_id2repo(pool, repoid);
417 FOR_REPOS(repoid, repo)
422 l = strlen(repo->name);
423 for (i = 0; i < l; i++)
425 int c = repo->name[i];
426 if (c == ' ' || c == '\t')
431 if (i == l && !str[l])
434 if (repoid >= pool->nrepos)
440 /* check evr and buildflavors */
442 str2solvid_check(Pool *pool, Solvable *s, const char *start, const char *end, Id evrid)
444 if (!solvable_lookup_type(s, SOLVABLE_BUILDFLAVOR))
446 /* just check the evr */
447 return evrid && s->evr == evrid;
454 queue_init(&flavorq);
455 solvable_lookup_idarray(s, SOLVABLE_BUILDFLAVOR, &flavorq);
456 queue_unshift(&flavorq, s->evr);
457 for (i = 0; i < flavorq.count; i++)
459 const char *part = pool_id2str(pool, flavorq.elements[i]);
460 size_t partl = strlen(part);
461 if (start + partl > end || strncmp(start, part, partl) != 0)
464 if (i + 1 < flavorq.count)
466 if (start >= end || *start != '-')
471 if (i < flavorq.count)
473 queue_free(&flavorq);
476 queue_free(&flavorq);
482 testcase_str2solvid(Pool *pool, const char *str)
484 int i, l = strlen(str);
491 if (*str == '@' && !strcmp(str, "@SYSTEM"))
492 return SYSTEMSOLVABLE;
494 for (i = l - 1; i >= 0; i--)
495 if (str[i] == '@' && (repo = testcase_str2repo(pool, str + i + 1)) != 0)
500 /* now find the arch (if present) */
502 for (i = repostart - 1; i > 0; i--)
505 arch = pool_strn2id(pool, str + i + 1, repostart - (i + 1), 0);
510 /* now find the name */
511 for (i = repostart - 1; i > 0; i--)
515 Id nid, evrid, p, pp;
516 nid = pool_strn2id(pool, str, i, 0);
519 evrid = pool_strn2id(pool, str + i + 1, repostart - (i + 1), 0);
520 /* first check whatprovides */
521 FOR_PROVIDES(p, pp, nid)
523 Solvable *s = pool->solvables + p;
526 if (repo && s->repo != repo)
528 if (arch && s->arch != arch)
530 if (str2solvid_check(pool, s, str + i + 1, str + repostart, evrid))
533 /* maybe it's not installable and thus not in whatprovides. do a slow search */
537 FOR_REPO_SOLVABLES(repo, p, s)
541 if (arch && s->arch != arch)
543 if (str2solvid_check(pool, s, str + i + 1, str + repostart, evrid))
549 FOR_POOL_SOLVABLES(p)
551 Solvable *s = pool->solvables + p;
554 if (arch && s->arch != arch)
556 if (str2solvid_check(pool, s, str + i + 1, str + repostart, evrid))
566 testcase_job2str(Pool *pool, Id how, Id what)
573 Id select = how & SOLVER_SELECTMASK;
575 for (i = 0; job2str[i].str; i++)
576 if ((how & SOLVER_JOBMASK) == job2str[i].job)
578 jobstr = job2str[i].str ? job2str[i].str : "unknown";
579 if (select == SOLVER_SOLVABLE)
582 pkgstr = testcase_solvid2str(pool, what);
584 else if (select == SOLVER_SOLVABLE_NAME)
587 pkgstr = testcase_dep2str(pool, what);
589 else if (select == SOLVER_SOLVABLE_PROVIDES)
591 selstr = " provides ";
592 pkgstr = testcase_dep2str(pool, what);
594 else if (select == SOLVER_SOLVABLE_ONE_OF)
599 while ((p = pool->whatprovidesdata[what++]) != 0)
601 const char *s = testcase_solvid2str(pool, p);
604 pkgstr = pool_tmpappend(pool, pkgstr, " ", s);
605 pool_freetmpspace(pool, s);
613 else if (select == SOLVER_SOLVABLE_REPO)
615 Repo *repo = pool_id2repo(pool, what);
620 sprintf(buf, "#%d", repo->repoid);
621 pkgstr = pool_tmpjoin(pool, buf, 0, 0);
624 pkgstr = pool_tmpjoin(pool, repo->name, 0, 0);
626 else if (select == SOLVER_SOLVABLE_ALL)
633 selstr = " unknown ";
636 ret = pool_tmpjoin(pool, jobstr, selstr, pkgstr);
638 ret = pool_tmpappend(pool, ret, " ", 0);
639 for (i = 0; jobflags2str[i].str; i++)
640 if ((how & jobflags2str[i].flag) != 0)
641 ret = pool_tmpappend(pool, ret, ",", jobflags2str[i].str);
647 ret = pool_tmpappend(pool, ret, "]", 0);
653 str2selflags(Pool *pool, char *s) /* modifies the string! */
658 char *se = strchr(s, ',');
661 for (i = 0; selflags2str[i].str; i++)
662 if (!strcmp(s, selflags2str[i].str))
664 selflags |= selflags2str[i].flag;
667 if (!selflags2str[i].str)
668 pool_error(pool, 0, "str2job: unknown selection flag '%s'", s);
675 str2jobflags(Pool *pool, char *s) /* modifies the string */
680 char *se = strchr(s, ',');
683 for (i = 0; jobflags2str[i].str; i++)
684 if (!strcmp(s, jobflags2str[i].str))
686 jobflags |= jobflags2str[i].flag;
689 if (!jobflags2str[i].str)
690 pool_error(pool, 0, "str2job: unknown job flag '%s'", s);
697 testcase_str2jobsel(Pool *pool, const char *caller, char **pieces, int npieces, Id *whatp)
700 if (!strcmp(pieces[0], "pkg") && npieces == 2)
702 job = SOLVER_SOLVABLE;
703 what = testcase_str2solvid(pool, pieces[1]);
705 return pool_error(pool, -1, "%s: unknown package '%s'", caller, pieces[1]);
707 else if (!strcmp(pieces[0], "name") || !strcmp(pieces[0], "provides"))
709 /* join em again for dep2str... */
711 for (sp = pieces[1]; sp < pieces[npieces - 1]; sp++)
715 if (pieces[0][0] == 'p' && strncmp(pieces[1], "namespace:", 10) == 0)
717 char *spe = strchr(pieces[1], '(');
718 int l = strlen(pieces[1]);
719 if (spe && pieces[1][l - 1] == ')')
721 /* special namespace provides */
722 if (strcmp(spe, "(<NULL>)") != 0)
724 pieces[1][l - 1] = 0;
725 what = testcase_str2dep(pool, spe + 1);
726 pieces[1][l - 1] = ')';
728 what = pool_rel2id(pool, pool_strn2id(pool, pieces[1], spe - pieces[1], 1), what, REL_NAMESPACE, 1);
732 what = testcase_str2dep(pool, pieces[1]);
733 if (pieces[0][0] == 'n')
734 job = SOLVER_SOLVABLE_NAME;
736 job = SOLVER_SOLVABLE_PROVIDES;
738 else if (!strcmp(pieces[0], "oneof"))
741 job = SOLVER_SOLVABLE_ONE_OF;
743 if (npieces > 1 && strcmp(pieces[1], "nothing") != 0)
746 for (i = 1; i < npieces; i++)
748 Id p = testcase_str2solvid(pool, pieces[i]);
752 return pool_error(pool, -1, "%s: unknown package '%s'", caller, pieces[i]);
757 what = pool_queuetowhatprovides(pool, &q);
760 else if (!strcmp(pieces[0], "repo") && npieces == 2)
762 Repo *repo = testcase_str2repo(pool, pieces[1]);
764 return pool_error(pool, -1, "%s: unknown repo '%s'", caller, pieces[1]);
765 job = SOLVER_SOLVABLE_REPO;
768 else if (!strcmp(pieces[0], "all") && npieces == 2 && !strcmp(pieces[1], "packages"))
770 job = SOLVER_SOLVABLE_ALL;
775 /* join em again for the error message... */
777 for (sp = pieces[0]; sp < pieces[npieces - 1]; sp++)
780 return pool_error(pool, -1, "%s: bad line '%s'", caller, pieces[0]);
787 testcase_str2job(Pool *pool, const char *str, Id *whatp)
797 /* so we can patch it */
798 s = pool_tmpjoin(pool, str, 0, 0);
799 /* split it in pieces */
802 while (*s == ' ' || *s == '\t')
806 pieces = solv_extend(pieces, npieces, 1, sizeof(*pieces), 7);
807 pieces[npieces++] = s;
808 while (*s && *s != ' ' && *s != '\t')
815 pool_error(pool, -1, "str2job: bad line '%s'", str);
820 for (i = 0; job2str[i].str; i++)
821 if (!strcmp(pieces[0], job2str[i].str))
825 pool_error(pool, -1, "str2job: unknown job '%s'", str);
829 job = job2str[i].job;
833 char *flags = pieces[npieces - 1];
834 if (*flags == '[' && flags[strlen(flags) - 1] == ']')
838 flags[strlen(flags) - 1] = 0;
839 job |= str2jobflags(pool, flags);
842 jobsel = testcase_str2jobsel(pool, "str2job", pieces + 1, npieces - 1, &what);
850 #define SELECTIONJOB_MATCHDEPS 1
851 #define SELECTIONJOB_MATCHDEPID 2
852 #define SELECTIONJOB_MATCHSOLVABLE 3
855 addselectionjob(Pool *pool, char **pieces, int npieces, Queue *jobqueue, int type, int keyname)
863 for (i = 0; job2str[i].str; i++)
864 if (!strcmp(pieces[0], job2str[i].str))
867 return pool_error(pool, -1, "selstr2job: unknown job '%s'", pieces[0]);
868 job = job2str[i].job;
871 char *flags = pieces[npieces - 1];
872 if (*flags == '[' && flags[strlen(flags) - 1] == ']')
876 flags[strlen(flags) - 1] = 0;
877 job |= str2jobflags(pool, flags);
881 return pool_error(pool, -1, "selstr2job: no selection flags");
882 selflags = str2selflags(pool, pieces[npieces - 1]);
884 for (sp = pieces[2]; sp < pieces[npieces - 2]; sp++)
888 if (selflags & (SELECTION_ADD | SELECTION_SUBTRACT | SELECTION_FILTER))
890 for (i = 0; i < jobqueue->count; i += 2)
891 queue_push2(&sel, jobqueue->elements[i] & (SOLVER_SELECTMASK | SOLVER_SETMASK), jobqueue->elements[i + 1]);
892 queue_empty(jobqueue);
895 r = selection_make(pool, &sel, pieces[2], selflags);
896 else if (type == SELECTIONJOB_MATCHDEPS)
897 r = selection_make_matchdeps(pool, &sel, pieces[2], selflags, keyname, 0);
898 else if (type == SELECTIONJOB_MATCHDEPID)
899 r = selection_make_matchdepid(pool, &sel, testcase_str2dep(pool, pieces[2]), selflags, keyname, 0);
900 else if (type == SELECTIONJOB_MATCHSOLVABLE)
901 r = selection_make_matchsolvable(pool, &sel, testcase_str2solvid(pool, pieces[2]), selflags, keyname, 0);
902 for (i = 0; i < sel.count; i += 2)
903 queue_push2(jobqueue, job | sel.elements[i], sel.elements[i + 1]);
909 testcase_getpoolflags(Pool *pool)
913 for (i = 0; poolflags2str[i].str; i++)
915 v = pool_get_flag(pool, poolflags2str[i].flag);
916 if (v == poolflags2str[i].def)
918 str = pool_tmpappend(pool, str, v ? " " : " !", poolflags2str[i].str);
920 return str ? str + 1 : "";
924 testcase_setpoolflags(Pool *pool, const char *str)
926 const char *p = str, *s;
930 while (*p == ' ' || *p == '\t' || *p == ',')
941 while (*p && *p != ' ' && *p != '\t' && *p != ',')
943 for (i = 0; poolflags2str[i].str; i++)
944 if (!strncmp(poolflags2str[i].str, s, p - s) && poolflags2str[i].str[p - s] == 0)
946 if (!poolflags2str[i].str)
947 return pool_error(pool, 0, "setpoolflags: unknown flag '%.*s'", (int)(p - s), s);
948 pool_set_flag(pool, poolflags2str[i].flag, v);
954 testcase_resetpoolflags(Pool *pool)
957 for (i = 0; poolflags2str[i].str; i++)
958 pool_set_flag(pool, poolflags2str[i].flag, poolflags2str[i].def);
962 testcase_getsolverflags(Solver *solv)
964 Pool *pool = solv->pool;
967 for (i = 0; solverflags2str[i].str; i++)
969 v = solver_get_flag(solv, solverflags2str[i].flag);
970 if (v == solverflags2str[i].def)
972 str = pool_tmpappend(pool, str, v ? " " : " !", solverflags2str[i].str);
974 return str ? str + 1 : "";
978 testcase_setsolverflags(Solver *solv, const char *str)
980 const char *p = str, *s;
984 while (*p == ' ' || *p == '\t' || *p == ',')
995 while (*p && *p != ' ' && *p != '\t' && *p != ',')
997 for (i = 0; solverflags2str[i].str; i++)
998 if (!strncmp(solverflags2str[i].str, s, p - s) && solverflags2str[i].str[p - s] == 0)
1000 if (!solverflags2str[i].str)
1001 return pool_error(solv->pool, 0, "setsolverflags: unknown flag '%.*s'", (int)(p - s), s);
1002 if (solver_set_flag(solv, solverflags2str[i].flag, v) == -1)
1003 return pool_error(solv->pool, 0, "setsolverflags: unsupported flag '%s'", solverflags2str[i].str);
1009 testcase_resetsolverflags(Solver *solv)
1012 for (i = 0; solverflags2str[i].str; i++)
1013 solver_set_flag(solv, solverflags2str[i].flag, solverflags2str[i].def);
1017 testcase_ruleid(Solver *solv, Id rid)
1023 const unsigned char *md5;
1029 solver_ruleliterals(solv, rid, &q);
1030 for (i = 0; i < q.count; i++)
1032 Id p = q.elements[i];
1033 s = testcase_solvid2str(solv->pool, p > 0 ? p : -p);
1035 s = pool_tmpjoin(solv->pool, "!", s, 0);
1036 strqueue_push(&sq, s);
1039 strqueue_sort_u(&sq);
1040 chk = solv_chksum_create(REPOKEY_TYPE_MD5);
1041 for (i = 0; i < sq.nstr; i++)
1042 solv_chksum_add(chk, sq.str[i], strlen(sq.str[i]) + 1);
1043 md5 = solv_chksum_get(chk, &md5l);
1044 s = pool_bin2hex(solv->pool, md5, md5l);
1045 chk = solv_chksum_free(chk, 0);
1051 testcase_problemid(Solver *solv, Id problem)
1056 const unsigned char *md5;
1060 /* we build a hash of all rules that define the problem */
1063 solver_findallproblemrules(solv, problem, &q);
1064 for (i = 0; i < q.count; i++)
1065 strqueue_push(&sq, testcase_ruleid(solv, q.elements[i]));
1067 strqueue_sort_u(&sq);
1068 chk = solv_chksum_create(REPOKEY_TYPE_MD5);
1069 for (i = 0; i < sq.nstr; i++)
1070 solv_chksum_add(chk, sq.str[i], strlen(sq.str[i]) + 1);
1071 md5 = solv_chksum_get(chk, &md5l);
1072 s = pool_bin2hex(solv->pool, md5, 4);
1073 chk = solv_chksum_free(chk, 0);
1079 testcase_solutionid(Solver *solv, Id problem, Id solution)
1083 const unsigned char *md5;
1087 intid = solver_solutionelement_internalid(solv, problem, solution);
1088 /* internal stuff! handle with care! */
1092 s = testcase_job2str(solv->pool, solv->job.elements[-intid - 1], solv->job.elements[-intid]);
1097 s = testcase_ruleid(solv, intid);
1099 chk = solv_chksum_create(REPOKEY_TYPE_MD5);
1100 solv_chksum_add(chk, s, strlen(s) + 1);
1101 md5 = solv_chksum_get(chk, &md5l);
1102 s = pool_bin2hex(solv->pool, md5, 4);
1103 chk = solv_chksum_free(chk, 0);
1108 testcase_alternativeid(Solver *solv, int type, Id id, Id from)
1111 Pool *pool = solv->pool;
1113 const unsigned char *md5;
1115 chk = solv_chksum_create(REPOKEY_TYPE_MD5);
1116 if (type == SOLVER_ALTERNATIVE_TYPE_RECOMMENDS)
1118 s = testcase_solvid2str(pool, from);
1119 solv_chksum_add(chk, s, strlen(s) + 1);
1120 s = testcase_dep2str(pool, id);
1121 solv_chksum_add(chk, s, strlen(s) + 1);
1123 else if (type == SOLVER_ALTERNATIVE_TYPE_RULE)
1125 s = testcase_ruleid(solv, id);
1126 solv_chksum_add(chk, s, strlen(s) + 1);
1128 md5 = solv_chksum_get(chk, &md5l);
1129 s = pool_bin2hex(pool, md5, 4);
1130 chk = solv_chksum_free(chk, 0);
1134 static struct class2str {
1138 { SOLVER_TRANSACTION_ERASE, "erase" },
1139 { SOLVER_TRANSACTION_INSTALL, "install" },
1140 { SOLVER_TRANSACTION_REINSTALLED, "reinstall" },
1141 { SOLVER_TRANSACTION_DOWNGRADED, "downgrade" },
1142 { SOLVER_TRANSACTION_CHANGED, "change" },
1143 { SOLVER_TRANSACTION_UPGRADED, "upgrade" },
1144 { SOLVER_TRANSACTION_OBSOLETED, "obsolete" },
1145 { SOLVER_TRANSACTION_MULTIINSTALL, "multiinstall" },
1146 { SOLVER_TRANSACTION_MULTIREINSTALL, "multireinstall" },
1150 static struct reason2str {
1154 { SOLVER_REASON_UNRELATED, "unrelated" },
1155 { SOLVER_REASON_UNIT_RULE, "unit" },
1156 { SOLVER_REASON_KEEP_INSTALLED, "keep" },
1157 { SOLVER_REASON_RESOLVE_JOB, "job" },
1158 { SOLVER_REASON_UPDATE_INSTALLED, "update" },
1159 { SOLVER_REASON_CLEANDEPS_ERASE, "cleandeps" },
1160 { SOLVER_REASON_RESOLVE, "resolve" },
1161 { SOLVER_REASON_WEAKDEP, "weakdep" },
1162 { SOLVER_REASON_RESOLVE_ORPHAN, "orphan" },
1164 { SOLVER_REASON_RECOMMENDED, "recommended" },
1165 { SOLVER_REASON_SUPPLEMENTED, "supplemented" },
1170 testcase_reason2str(Id reason)
1173 for (i = 0; reason2str[i].str; i++)
1174 if (reason == reason2str[i].reason)
1175 return reason2str[i].str;
1179 static struct rclass2str {
1183 { SOLVER_RULE_PKG, "pkg" },
1184 { SOLVER_RULE_UPDATE, "update" },
1185 { SOLVER_RULE_FEATURE, "feature" },
1186 { SOLVER_RULE_JOB, "job" },
1187 { SOLVER_RULE_DISTUPGRADE, "distupgrade" },
1188 { SOLVER_RULE_INFARCH, "infarch" },
1189 { SOLVER_RULE_CHOICE, "choice" },
1190 { SOLVER_RULE_LEARNT, "learnt" },
1191 { SOLVER_RULE_BEST, "best" },
1192 { SOLVER_RULE_YUMOBS, "yumobs" },
1193 { SOLVER_RULE_RECOMMENDS, "recommends" },
1198 testcase_rclass2str(Id rclass)
1201 for (i = 0; rclass2str[i].str; i++)
1202 if (rclass == rclass2str[i].rclass)
1203 return rclass2str[i].str;
1208 dump_genid(Pool *pool, Strqueue *sq, Id id, int cnt)
1216 Reldep *rd = GETRELDEP(pool, id);
1217 for (op = oplist; op->flags; op++)
1218 if (rd->flags == op->flags)
1220 cnt = dump_genid(pool, sq, rd->name, cnt);
1221 cnt = dump_genid(pool, sq, rd->evr, cnt);
1222 sprintf(cntbuf, "genid %2d: genid ", cnt++);
1223 s = pool_tmpjoin(pool, cntbuf, "op ", op->flags ? op->opname : "unknown");
1227 sprintf(cntbuf, "genid %2d: genid ", cnt++);
1228 s = pool_tmpjoin(pool, cntbuf, id ? "lit " : "null", id ? pool_id2str(pool, id) : 0);
1230 strqueue_push(sq, s);
1235 testcase_solverresult(Solver *solv, int resultflags)
1237 Pool *pool = solv->pool;
1245 if ((resultflags & TESTCASE_RESULT_TRANSACTION) != 0)
1247 Transaction *trans = solver_create_transaction(solv);
1251 for (i = 0; class2str[i].str; i++)
1254 transaction_classify_pkgs(trans, SOLVER_TRANSACTION_KEEP_PSEUDO, class2str[i].class, 0, 0, &q);
1255 for (j = 0; j < q.count; j++)
1259 if (pool->installed && pool->solvables[p].repo == pool->installed)
1260 op = transaction_obs_pkg(trans, p);
1261 s = pool_tmpjoin(pool, class2str[i].str, " ", testcase_solvid2str(pool, p));
1263 s = pool_tmpjoin(pool, s, " ", testcase_solvid2str(pool, op));
1264 strqueue_push(&sq, s);
1268 transaction_free(trans);
1270 if ((resultflags & TESTCASE_RESULT_PROBLEMS) != 0)
1272 char *probprefix, *solprefix;
1273 int problem, solution, element;
1276 pcnt = solver_problem_count(solv);
1277 for (problem = 1; problem <= pcnt; problem++)
1279 Id rid, from, to, dep;
1280 SolverRuleinfo rinfo;
1281 rid = solver_findproblemrule(solv, problem);
1282 s = testcase_problemid(solv, problem);
1283 probprefix = solv_dupjoin("problem ", s, 0);
1284 rinfo = solver_ruleinfo(solv, rid, &from, &to, &dep);
1285 s = pool_tmpjoin(pool, probprefix, " info ", solver_problemruleinfo2str(solv, rinfo, from, to, dep));
1286 strqueue_push(&sq, s);
1287 scnt = solver_solution_count(solv, problem);
1288 for (solution = 1; solution <= scnt; solution++)
1290 s = testcase_solutionid(solv, problem, solution);
1291 solprefix = solv_dupjoin(probprefix, " solution ", s);
1293 while ((element = solver_next_solutionelement(solv, problem, solution, element, &p, &op)) != 0)
1295 if (p == SOLVER_SOLUTION_JOB)
1296 s = pool_tmpjoin(pool, solprefix, " deljob ", testcase_job2str(pool, solv->job.elements[op - 1], solv->job.elements[op]));
1297 else if (p > 0 && op == 0)
1298 s = pool_tmpjoin(pool, solprefix, " erase ", testcase_solvid2str(pool, p));
1299 else if (p > 0 && op > 0)
1301 s = pool_tmpjoin(pool, solprefix, " replace ", testcase_solvid2str(pool, p));
1302 s = pool_tmpappend(pool, s, " ", testcase_solvid2str(pool, op));
1304 else if (p < 0 && op > 0)
1305 s = pool_tmpjoin(pool, solprefix, " allow ", testcase_solvid2str(pool, op));
1307 s = pool_tmpjoin(pool, solprefix, " unknown", 0);
1308 strqueue_push(&sq, s);
1310 solv_free(solprefix);
1312 solv_free(probprefix);
1316 if ((resultflags & TESTCASE_RESULT_ORPHANED) != 0)
1321 solver_get_orphaned(solv, &q);
1322 for (i = 0; i < q.count; i++)
1324 s = pool_tmpjoin(pool, "orphaned ", testcase_solvid2str(pool, q.elements[i]), 0);
1325 strqueue_push(&sq, s);
1330 if ((resultflags & TESTCASE_RESULT_RECOMMENDED) != 0)
1336 solver_get_recommendations(solv, &qr, &qs, 0);
1337 for (i = 0; i < qr.count; i++)
1339 s = pool_tmpjoin(pool, "recommended ", testcase_solvid2str(pool, qr.elements[i]), 0);
1340 strqueue_push(&sq, s);
1342 for (i = 0; i < qs.count; i++)
1344 s = pool_tmpjoin(pool, "suggested ", testcase_solvid2str(pool, qs.elements[i]), 0);
1345 strqueue_push(&sq, s);
1351 if ((resultflags & TESTCASE_RESULT_UNNEEDED) != 0)
1357 solver_get_unneeded(solv, &q, 0);
1358 solver_get_unneeded(solv, &qf, 1);
1359 for (i = j = 0; i < q.count; i++)
1361 /* we rely on qf containing a subset of q in the same order */
1362 if (j < qf.count && q.elements[i] == qf.elements[j])
1364 s = pool_tmpjoin(pool, "unneeded_filtered ", testcase_solvid2str(pool, q.elements[i]), 0);
1368 s = pool_tmpjoin(pool, "unneeded ", testcase_solvid2str(pool, q.elements[i]), 0);
1369 strqueue_push(&sq, s);
1374 if ((resultflags & TESTCASE_RESULT_USERINSTALLED) != 0)
1377 solver_get_userinstalled(solv, &q, 0);
1378 for (i = 0; i < q.count; i++)
1380 s = pool_tmpjoin(pool, "userinstalled pkg ", testcase_solvid2str(pool, q.elements[i]), 0);
1381 strqueue_push(&sq, s);
1384 solver_get_userinstalled(solv, &q, GET_USERINSTALLED_NAMES | GET_USERINSTALLED_INVERTED);
1385 for (i = 0; i < q.count; i++)
1387 s = pool_tmpjoin(pool, "autoinst name ", pool_id2str(pool, q.elements[i]), 0);
1388 strqueue_push(&sq, s);
1392 if ((resultflags & TESTCASE_RESULT_ALTERNATIVES) != 0)
1400 cnt = solver_alternatives_count(solv);
1401 for (alternative = 1; alternative <= cnt; alternative++)
1403 Id id, from, chosen;
1405 int type = solver_get_alternative(solv, alternative, &id, &from, &chosen, &q, 0);
1406 altprefix = solv_dupjoin("alternative ", testcase_alternativeid(solv, type, id, from), " ");
1408 if (type == SOLVER_ALTERNATIVE_TYPE_RECOMMENDS)
1410 char *s = pool_tmpjoin(pool, altprefix, num, testcase_solvid2str(pool, from));
1411 s = pool_tmpappend(pool, s, " recommends ", testcase_dep2str(pool, id));
1412 strqueue_push(&sq, s);
1414 else if (type == SOLVER_ALTERNATIVE_TYPE_RULE)
1416 /* map choice rules back to pkg rules */
1417 if (solver_ruleclass(solv, id) == SOLVER_RULE_CHOICE)
1418 id = solver_rule2pkgrule(solv, id);
1419 if (solver_ruleclass(solv, id) == SOLVER_RULE_RECOMMENDS)
1420 id = solver_rule2pkgrule(solv, id);
1421 solver_allruleinfos(solv, id, &rq);
1422 for (i = 0; i < rq.count; i += 4)
1424 int rtype = rq.elements[i];
1425 if ((rtype & SOLVER_RULE_TYPEMASK) == SOLVER_RULE_JOB)
1427 const char *js = testcase_job2str(pool, rq.elements[i + 2], rq.elements[i + 3]);
1428 char *s = pool_tmpjoin(pool, altprefix, num, "job ");
1429 s = pool_tmpappend(pool, s, js, 0);
1430 strqueue_push(&sq, s);
1432 else if (rtype == SOLVER_RULE_PKG_REQUIRES)
1434 char *s = pool_tmpjoin(pool, altprefix, num, testcase_solvid2str(pool, rq.elements[i + 1]));
1435 s = pool_tmpappend(pool, s, " requires ", testcase_dep2str(pool, rq.elements[i + 3]));
1436 strqueue_push(&sq, s);
1438 else if (rtype == SOLVER_RULE_UPDATE || rtype == SOLVER_RULE_FEATURE)
1440 const char *js = testcase_solvid2str(pool, rq.elements[i + 1]);
1441 char *s = pool_tmpjoin(pool, altprefix, num, "update ");
1442 s = pool_tmpappend(pool, s, js, 0);
1443 strqueue_push(&sq, s);
1447 for (i = 0; i < q.count; i++)
1449 Id p = q.elements[i];
1451 num[0] = '0' + (i + 1) / 10;
1452 num[1] = '0' + (i + 1) % 10;
1454 s = pool_tmpjoin(pool, altprefix, num, "+ ");
1456 s = pool_tmpjoin(pool, altprefix, num, "- ");
1458 s = pool_tmpjoin(pool, altprefix, num, " ");
1459 s = pool_tmpappend(pool, s, testcase_solvid2str(pool, p < 0 ? -p : p), 0);
1460 strqueue_push(&sq, s);
1462 solv_free(altprefix);
1467 if ((resultflags & TESTCASE_RESULT_RULES) != 0)
1469 /* dump all rules */
1471 SolverRuleinfo rclass;
1476 for (rid = 1; (rclass = solver_ruleclass(solv, rid)) != SOLVER_RULE_UNKNOWN; rid++)
1478 char *prefix = solv_dupjoin("rule ", testcase_rclass2str(rclass), " ");
1479 prefix = solv_dupappend(prefix, testcase_ruleid(solv, rid), 0);
1480 solver_ruleliterals(solv, rid, &q);
1481 if (rclass == SOLVER_RULE_FEATURE && q.count == 1 && q.elements[0] == -SYSTEMSOLVABLE)
1483 for (i = 0; i < q.count; i++)
1485 Id p = q.elements[i];
1488 s = pool_tmpjoin(pool, prefix, " -", testcase_solvid2str(pool, -p));
1490 s = pool_tmpjoin(pool, prefix, " ", testcase_solvid2str(pool, p));
1491 strqueue_push(&sq, s);
1497 if ((resultflags & TESTCASE_RESULT_GENID) != 0)
1499 for (i = 0 ; i < solv->job.count; i += 2)
1502 if (solv->job.elements[i] != (SOLVER_NOOP | SOLVER_SOLVABLE_PROVIDES))
1504 id = solv->job.elements[i + 1];
1505 s = testcase_dep2str(pool, id);
1506 strqueue_push(&sq, pool_tmpjoin(pool, "genid dep ", s, 0));
1507 if ((id2 = testcase_str2dep(pool, s)) != id)
1509 s = pool_tmpjoin(pool, "genid roundtrip error: ", testcase_dep2str(pool, id2), 0);
1510 strqueue_push(&sq, s);
1512 dump_genid(pool, &sq, id, 1);
1515 if ((resultflags & TESTCASE_RESULT_REASON) != 0)
1519 FOR_POOL_SOLVABLES(p)
1522 int reason = solver_describe_decision(solv, p, &info);
1523 if (reason == SOLVER_REASON_UNRELATED)
1525 if (reason == SOLVER_REASON_WEAKDEP)
1527 solver_describe_weakdep_decision(solv, p, &whyq);
1530 for (i = 0; i < whyq.count; i += 3)
1532 reason = whyq.elements[i];
1533 p2 = whyq.elements[i + 1];
1534 id = whyq.elements[i + 2];
1535 s = pool_tmpjoin(pool, "reason ", testcase_solvid2str(pool, p), 0);
1536 s = pool_tmpappend(pool, s, " ", testcase_reason2str(reason));
1537 s = pool_tmpappend(pool, s, " ", testcase_dep2str(pool, id));
1539 s = pool_tmpappend(pool, s, " ", testcase_solvid2str(pool, p2));
1540 strqueue_push(&sq, s);
1545 s = pool_tmpjoin(pool, "reason ", testcase_solvid2str(pool, p), 0);
1546 s = pool_tmpappend(pool, s, " ", testcase_reason2str(reason));
1548 s = pool_tmpappend(pool, s, " ", testcase_ruleid(solv, info));
1549 strqueue_push(&sq, s);
1553 if ((resultflags & TESTCASE_RESULT_CLEANDEPS) != 0)
1558 solver_get_cleandeps(solv, &q);
1559 for (i = 0; i < q.count; i++)
1561 s = pool_tmpjoin(pool, "cleandeps ", testcase_solvid2str(pool, q.elements[i]), 0);
1562 strqueue_push(&sq, s);
1566 if ((resultflags & TESTCASE_RESULT_JOBS) != 0)
1568 for (i = 0; i < solv->job.count; i += 2)
1570 s = (char *)testcase_job2str(pool, solv->job.elements[i], solv->job.elements[i + 1]);
1571 s = pool_tmpjoin(pool, "job ", s, 0);
1572 strqueue_push(&sq, s);
1576 result = strqueue_join(&sq);
1583 testcase_write_mangled(Solver *solv, const char *dir, int resultflags, const char *testcasename, const char *resultname)
1585 Pool *pool = solv->pool;
1592 char *cmd, *out, *result;
1596 testcasename = "testcase.t";
1598 resultname = "solver.result";
1601 if (mkdir(dir) && errno != EEXIST)
1603 if (mkdir(dir, 0777) && errno != EEXIST)
1605 return pool_error(solv->pool, 0, "testcase_write: could not create directory '%s'", dir);
1607 FOR_REPOS(repoid, repo)
1609 const char *name = testcase_repoid2str(pool, repoid);
1611 if (repo->subpriority)
1612 sprintf(priobuf, "%d.%d", repo->priority, repo->subpriority);
1614 sprintf(priobuf, "%d", repo->priority);
1615 #if !defined(WITHOUT_COOKIEOPEN) && defined(ENABLE_ZLIB_COMPRESSION)
1616 out = pool_tmpjoin(pool, name, ".repo", ".gz");
1618 out = pool_tmpjoin(pool, name, ".repo", 0);
1620 for (i = 0; out[i]; i++)
1623 cmd = pool_tmpjoin(pool, "repo ", name, " ");
1624 cmd = pool_tmpappend(pool, cmd, priobuf, " ");
1625 cmd = pool_tmpappend(pool, cmd, "testtags ", out);
1626 strqueue_push(&sq, cmd);
1627 out = pool_tmpjoin(pool, dir, "/", out);
1628 if (!(fp = solv_xfopen(out, "w")))
1630 pool_error(solv->pool, 0, "testcase_write: could not open '%s' for writing", out);
1634 testcase_write_testtags(repo, fp);
1637 pool_error(solv->pool, 0, "testcase_write: write error");
1642 /* hmm, this is not optimal... we currently search for the lowest score */
1644 arch = pool->solvables[SYSTEMSOLVABLE].arch;
1645 for (i = 0; i < pool->lastarch; i++)
1647 if (pool->id2arch[i] == 1 && !lowscore)
1649 if (pool->id2arch[i] > 0x10000 && (!lowscore || pool->id2arch[i] < lowscore))
1652 lowscore = pool->id2arch[i];
1655 cmd = pool_tmpjoin(pool, "system ", pool->lastarch ? pool_id2str(pool, arch) : "-", 0);
1656 for (i = 0; disttype2str[i].str != 0; i++)
1657 if (pool->disttype == disttype2str[i].type)
1659 pool_tmpappend(pool, cmd, " ", disttype2str[i].str ? disttype2str[i].str : "unknown");
1660 if (pool->installed)
1661 cmd = pool_tmpappend(pool, cmd, " ", testcase_repoid2str(pool, pool->installed->repoid));
1662 strqueue_push(&sq, cmd);
1663 s = testcase_getpoolflags(solv->pool);
1666 cmd = pool_tmpjoin(pool, "poolflags ", s, 0);
1667 strqueue_push(&sq, cmd);
1670 if (pool->vendorclasses)
1673 for (i = 0; pool->vendorclasses[i]; i++)
1675 cmd = pool_tmpappend(pool, cmd ? cmd : "vendorclass", " ", pool->vendorclasses[i]);
1676 if (!pool->vendorclasses[i + 1])
1678 strqueue_push(&sq, cmd);
1685 /* dump disabled packages (must come before the namespace/job lines) */
1686 if (pool->considered)
1689 FOR_POOL_SOLVABLES(p)
1690 if (!MAPTST(pool->considered, p))
1692 cmd = pool_tmpjoin(pool, "disable pkg ", testcase_solvid2str(pool, p), 0);
1693 strqueue_push(&sq, cmd);
1697 s = testcase_getsolverflags(solv);
1700 cmd = pool_tmpjoin(pool, "solverflags ", s, 0);
1701 strqueue_push(&sq, cmd);
1704 /* now dump all the ns callback values we know */
1705 if (pool->nscallback)
1709 for (rid = 1; rid < pool->nrels; rid++)
1711 Reldep *rd = pool->rels + rid;
1712 if (rd->flags != REL_NAMESPACE || rd->name == NAMESPACE_OTHERPROVIDERS)
1714 /* evaluate all namespace ids, skip empty results */
1715 d = pool_whatprovides(pool, MAKERELDEP(rid));
1716 if (!d || !pool->whatprovidesdata[d])
1718 cmd = pool_tmpjoin(pool, "namespace ", pool_id2str(pool, rd->name), "(");
1719 cmd = pool_tmpappend(pool, cmd, pool_id2str(pool, rd->evr), ")");
1720 for (; pool->whatprovidesdata[d]; d++)
1721 cmd = pool_tmpappend(pool, cmd, " ", testcase_solvid2str(pool, pool->whatprovidesdata[d]));
1722 strqueue_push(&sq, cmd);
1726 for (i = 0; i < solv->job.count; i += 2)
1728 cmd = (char *)testcase_job2str(pool, solv->job.elements[i], solv->job.elements[i + 1]);
1729 cmd = pool_tmpjoin(pool, "job ", cmd, 0);
1730 strqueue_push(&sq, cmd);
1733 if ((resultflags & ~TESTCASE_RESULT_REUSE_SOLVER) != 0)
1736 for (i = 0; resultflags2str[i].str; i++)
1737 if ((resultflags & resultflags2str[i].flag) != 0)
1738 cmd = pool_tmpappend(pool, cmd, cmd ? "," : 0, resultflags2str[i].str);
1739 cmd = pool_tmpjoin(pool, "result ", cmd ? cmd : "?", 0);
1740 cmd = pool_tmpappend(pool, cmd, " ", resultname);
1741 strqueue_push(&sq, cmd);
1742 result = testcase_solverresult(solv, resultflags);
1743 if (!strcmp(resultname, "<inline>"))
1746 strqueue_init(&rsq);
1747 strqueue_split(&rsq, result);
1748 for (i = 0; i < rsq.nstr; i++)
1750 cmd = pool_tmpjoin(pool, "#>", rsq.str[i], 0);
1751 strqueue_push(&sq, cmd);
1753 strqueue_free(&rsq);
1757 out = pool_tmpjoin(pool, dir, "/", resultname);
1758 if (!(fp = fopen(out, "w")))
1760 pool_error(solv->pool, 0, "testcase_write: could not open '%s' for writing", out);
1765 if (result && *result && fwrite(result, strlen(result), 1, fp) != 1)
1767 pool_error(solv->pool, 0, "testcase_write: write error");
1775 pool_error(solv->pool, 0, "testcase_write: write error");
1784 result = strqueue_join(&sq);
1786 out = pool_tmpjoin(pool, dir, "/", testcasename);
1787 if (!(fp = fopen(out, "w")))
1789 pool_error(solv->pool, 0, "testcase_write: could not open '%s' for writing", out);
1793 if (*result && fwrite(result, strlen(result), 1, fp) != 1)
1795 pool_error(solv->pool, 0, "testcase_write: write error");
1802 pool_error(solv->pool, 0, "testcase_write: write error");
1811 testcase_write(Solver *solv, const char *dir, int resultflags, const char *testcasename, const char *resultname)
1813 Pool *pool = solv->pool;
1816 const char **orignames;
1818 /* mangle repo names so that there are no conflicts */
1819 orignames = solv_calloc(pool->nrepos, sizeof(char *));
1820 for (repoid = 1; repoid < pool->nrepos; repoid++)
1822 Repo *repo = pool_id2repo(pool, repoid);
1823 char *buf = solv_malloc((repo->name ? strlen(repo->name) : 0) + 40);
1825 orignames[repoid] = repo->name;
1826 if (!repo->name || !repo->name[0])
1827 sprintf(buf, "#%d", repoid);
1829 strcpy(buf, repo->name);
1830 for (i = 0; buf[i]; i++)
1831 if (buf[i] == ' ' || buf[i] == '\t' || buf[i] == '/')
1833 mp = buf + strlen(buf);
1836 for (i = 1; i < repoid; i++)
1837 if (!strcmp(buf, pool_id2repo(pool, i)->name))
1841 sprintf(mp, "_%d", mangle++);
1845 r = testcase_write_mangled(solv, dir, resultflags, testcasename, resultname);
1846 for (repoid = 1; repoid < pool->nrepos; repoid++)
1848 Repo *repo = pool_id2repo(pool, repoid);
1849 solv_free((void *)repo->name);
1850 repo->name = orignames[repoid];
1852 solv_free(orignames);
1857 read_inline_file(FILE *fp, char **bufp, char **bufpp, int *buflp)
1859 char *result = solv_malloc(1024);
1866 if (rp - result + 256 >= resultl)
1868 resultl = rp - result;
1869 result = solv_realloc(result, resultl + 1024);
1870 rp = result + resultl;
1873 if (!fgets(rp, resultl - (rp - result), fp))
1876 if (rl && (rp == result || rp[-1] == '\n'))
1878 if (rl > 1 && rp[0] == '#' && rp[1] == '>')
1880 memmove(rp, rp + 2, rl - 2);
1885 while (rl + 16 > *buflp)
1887 *bufp = solv_realloc(*bufp, *buflp + 512);
1890 memmove(*bufp, rp, rl);
1891 if ((*bufp)[rl - 1] == '\n')
1897 (*bufpp) = *bufp + rl;
1914 char *result = solv_malloc(1024);
1921 if (rp - result + 256 >= resultl)
1923 resultl = rp - result;
1924 result = solv_realloc(result, resultl + 1024);
1925 rp = result + resultl;
1928 rl = fread(rp, 1, resultl - (rp - result), fp);
1940 str2resultflags(Pool *pool, char *s) /* modifies the string! */
1942 int i, resultflags = 0;
1945 char *se = strchr(s, ',');
1948 for (i = 0; resultflags2str[i].str; i++)
1949 if (!strcmp(s, resultflags2str[i].str))
1951 resultflags |= resultflags2str[i].flag;
1954 if (!resultflags2str[i].str)
1955 pool_error(pool, 0, "result: unknown flag '%s'", s);
1962 testcase_read(Pool *pool, FILE *fp, const char *testcase, Queue *job, char **resultp, int *resultflagsp)
1967 char *testcasedir, *s;
1973 int poolflagsreset = 0;
1974 int missing_features = 0;
1983 if (!fp && !(fp = fopen(testcase, "r")))
1985 pool_error(pool, 0, "testcase_read: could not open '%s'", testcase);
1988 testcasedir = solv_strdup(testcase);
1989 s = strrchr(testcasedir, '/');
1991 buf = strrchr(testcasedir, '\\');
1992 if (!s || (buf && buf > s))
2000 buf = solv_malloc(bufl);
2003 queue_init(&autoinstq);
2006 if (bufp - buf + 16 > bufl)
2009 buf = solv_realloc(buf, bufl + 512);
2013 if (!fgets(bufp, bufl - (bufp - buf), fp))
2017 if (!l || buf[l - 1] != '\n')
2024 while (*s && (*s == ' ' || *s == '\t'))
2026 if (!*s || *s == '#')
2029 /* split it in pieces */
2032 while (*s == ' ' || *s == '\t')
2036 pieces = solv_extend(pieces, npieces, 1, sizeof(*pieces), 7);
2037 pieces[npieces++] = s;
2038 while (*s && *s != ' ' && *s != '\t')
2043 pieces = solv_extend(pieces, npieces, 1, sizeof(*pieces), 7);
2044 pieces[npieces] = 0;
2045 if (!strcmp(pieces[0], "repo") && npieces >= 4)
2047 Repo *repo = repo_create(pool, pieces[1]);
2053 if (!poolflagsreset)
2056 testcase_resetpoolflags(pool); /* hmm */
2058 if (sscanf(pieces[2], "%d.%d", &prio, &subprio) != 2)
2061 prio = atoi(pieces[2]);
2063 repo->priority = prio;
2064 repo->subpriority = subprio;
2065 if (strcmp(pieces[3], "empty") != 0)
2067 const char *repotype = pool_tmpjoin(pool, pieces[3], 0, 0); /* gets overwritten in <inline> case */
2068 if (!strcmp(pieces[4], "<inline>"))
2070 char *idata = read_inline_file(fp, &buf, &bufp, &bufl);
2072 rfp = solv_xfopen_buf(rdata, &idata, 0, "rf");
2076 rdata = pool_tmpjoin(pool, testcasedir, pieces[4], 0);
2077 rfp = solv_xfopen(rdata, "r");
2081 pool_error(pool, 0, "testcase_read: could not open '%s'", rdata);
2083 else if (!strcmp(repotype, "testtags"))
2085 testcase_add_testtags(repo, rfp, 0);
2088 else if (!strcmp(repotype, "solv"))
2090 repo_add_solv(repo, rfp, 0);
2093 #if ENABLE_TESTCASE_HELIXREPO
2094 else if (!strcmp(repotype, "helix"))
2096 repo_add_helix(repo, rfp, 0);
2103 pool_error(pool, 0, "testcase_read: unknown repo type for repo '%s'", repo->name);
2107 else if (!strcmp(pieces[0], "system") && npieces >= 3)
2111 /* must set the disttype before the arch */
2113 if (strcmp(pieces[2], "*") != 0)
2115 char *dp = pieces[2];
2118 char *dpe = strchr(dp, ',');
2121 for (i = 0; disttype2str[i].str != 0; i++)
2122 if (!strcmp(disttype2str[i].str, dp))
2126 if (disttype2str[i].str)
2128 #ifdef MULTI_SEMANTICS
2129 if (pool->disttype != disttype2str[i].type)
2130 pool_setdisttype(pool, disttype2str[i].type);
2132 if (pool->disttype == disttype2str[i].type)
2139 pool_error(pool, 0, "testcase_read: system: could not change disttype to '%s'", pieces[2]);
2140 missing_features = 1;
2143 if (strcmp(pieces[1], "unset") == 0 || strcmp(pieces[1], "-") == 0)
2144 pool_setarch(pool, 0);
2145 else if (pieces[1][0] == ':')
2146 pool_setarchpolicy(pool, pieces[1] + 1);
2148 pool_setarch(pool, pieces[1]);
2151 Repo *repo = testcase_str2repo(pool, pieces[3]);
2153 pool_error(pool, 0, "testcase_read: system: unknown repo '%s'", pieces[3]);
2155 pool_set_installed(pool, repo);
2158 else if (!strcmp(pieces[0], "job") && npieces > 1)
2164 pool_addfileprovides(pool);
2165 pool_createwhatprovides(pool);
2168 if (npieces >= 3 && !strcmp(pieces[2], "selection"))
2170 addselectionjob(pool, pieces + 1, npieces - 1, job, 0, 0);
2173 if (npieces >= 4 && !strcmp(pieces[2], "selection_matchdeps"))
2175 pieces[2] = pieces[1];
2176 addselectionjob(pool, pieces + 2, npieces - 2, job, SELECTIONJOB_MATCHDEPS, pool_str2id(pool, pieces[3], 1));
2179 if (npieces >= 4 && !strcmp(pieces[2], "selection_matchdepid"))
2181 pieces[2] = pieces[1];
2182 addselectionjob(pool, pieces + 2, npieces - 2, job, SELECTIONJOB_MATCHDEPID, pool_str2id(pool, pieces[3], 1));
2185 if (npieces >= 4 && !strcmp(pieces[2], "selection_matchsolvable"))
2187 pieces[2] = pieces[1];
2188 addselectionjob(pool, pieces + 2, npieces - 2, job, SELECTIONJOB_MATCHSOLVABLE, pool_str2id(pool, pieces[3], 1));
2192 for (sp = pieces[1]; sp < pieces[npieces - 1]; sp++)
2195 how = testcase_str2job(pool, pieces[1], &what);
2196 if (how >= 0 && job)
2197 queue_push2(job, how, what);
2199 else if (!strcmp(pieces[0], "vendorclass") && npieces > 1)
2201 pool_addvendorclass(pool, (const char **)(pieces + 1));
2203 else if (!strcmp(pieces[0], "namespace") && npieces > 1)
2205 int i = strlen(pieces[1]);
2206 s = strchr(pieces[1], '(');
2207 if (!s || pieces[1][i - 1] != ')')
2209 pool_error(pool, 0, "testcase_read: bad namespace '%s'", pieces[1]);
2217 pieces[1][i - 1] = 0;
2218 name = pool_str2id(pool, pieces[1], 1);
2219 evr = pool_str2id(pool, s + 1, 1);
2221 pieces[1][i - 1] = ')';
2222 id = pool_rel2id(pool, name, evr, REL_NAMESPACE, 1);
2223 for (i = 2; i < npieces; i++)
2224 queue_push(&q, testcase_str2solvid(pool, pieces[i]));
2225 /* now do the callback */
2228 pool_addfileprovides(pool);
2229 pool_createwhatprovides(pool);
2232 pool->whatprovides_rel[GETRELID(id)] = pool_queuetowhatprovides(pool, &q);
2236 else if (!strcmp(pieces[0], "poolflags"))
2239 if (!poolflagsreset)
2242 testcase_resetpoolflags(pool); /* hmm */
2244 for (i = 1; i < npieces; i++)
2245 testcase_setpoolflags(pool, pieces[i]);
2247 else if (!strcmp(pieces[0], "solverflags") && npieces > 1)
2252 solv = solver_create(pool);
2253 testcase_resetsolverflags(solv);
2255 for (i = 1; i < npieces; i++)
2256 testcase_setsolverflags(solv, pieces[i]);
2258 else if (!strcmp(pieces[0], "result") && npieces > 1)
2261 int resultflags = str2resultflags(pool, pieces[1]);
2265 rdata = pool_tmpjoin(pool, testcasedir, pieces[2], 0);
2266 if (!strcmp(pieces[2], "<inline>"))
2267 result = read_inline_file(fp, &buf, &bufp, &bufl);
2270 FILE *rfp = fopen(rdata, "r");
2272 pool_error(pool, 0, "testcase_read: could not open '%s'", rdata);
2275 result = read_file(rfp);
2285 *resultflagsp = resultflags;
2287 else if (!strcmp(pieces[0], "nextjob"))
2289 if (npieces == 2 && resultflagsp && !strcmp(pieces[1], "reusesolver"))
2290 *resultflagsp |= TESTCASE_RESULT_REUSE_SOLVER;
2293 else if (!strcmp(pieces[0], "disable") && npieces == 3)
2295 Id p, pp, jobsel, what = 0;
2297 pool_createwhatprovides(pool);
2299 if (!pool->considered)
2301 pool->considered = solv_calloc(1, sizeof(Map));
2302 map_init(pool->considered, pool->nsolvables);
2303 map_setall(pool->considered);
2305 jobsel = testcase_str2jobsel(pool, "disable", pieces + 1, npieces - 1, &what);
2308 if (jobsel == SOLVER_SOLVABLE_ALL)
2309 map_empty(pool->considered);
2310 else if (jobsel == SOLVER_SOLVABLE_REPO)
2312 Repo *repo = pool_id2repo(pool, what);
2314 FOR_REPO_SOLVABLES(repo, p, s)
2315 MAPCLR(pool->considered, p);
2317 FOR_JOB_SELECT(p, pp, jobsel, what)
2318 MAPCLR(pool->considered, p);
2320 else if (!strcmp(pieces[0], "feature"))
2323 for (i = 1; i < npieces; i++)
2325 for (j = 0; features[j]; j++)
2326 if (!strcmp(pieces[i], features[j]))
2330 pool_error(pool, 0, "testcase_read: missing feature '%s'", pieces[i]);
2334 if (missing_features)
2337 else if (!strcmp(pieces[0], "genid") && npieces > 1)
2344 for (sp = pieces[2]; sp < pieces[npieces - 1]; sp++)
2348 genid = solv_extend(genid, ngenid, 1, sizeof(*genid), 7);
2349 if (!strcmp(pieces[1], "op") && npieces > 2)
2352 for (op = oplist; op->flags; op++)
2353 if (!strncmp(pieces[2], op->opname, strlen(op->opname)))
2357 pool_error(pool, 0, "testcase_read: genid: unknown op '%s'", pieces[2]);
2362 pool_error(pool, 0, "testcase_read: genid: out of stack");
2366 id = pool_rel2id(pool, genid[ngenid] , genid[ngenid + 1], op->flags, 1);
2368 else if (!strcmp(pieces[1], "lit"))
2369 id = pool_str2id(pool, npieces > 2 ? pieces[2] : "", 1);
2370 else if (!strcmp(pieces[1], "null"))
2372 else if (!strcmp(pieces[1], "dep"))
2373 id = testcase_str2dep(pool, pieces[2]);
2376 pool_error(pool, 0, "testcase_read: genid: unknown command '%s'", pieces[1]);
2379 genid[ngenid++] = id;
2381 else if (!strcmp(pieces[0], "autoinst") && npieces > 2)
2383 if (strcmp(pieces[1], "name"))
2385 pool_error(pool, 0, "testcase_read: autoinst: illegal mode");
2388 queue_push(&autoinstq, pool_str2id(pool, pieces[2], 1));
2390 else if (!strcmp(pieces[0], "evrcmp") && npieces == 3)
2392 Id evr1 = pool_str2id(pool, pieces[1], 1);
2393 Id evr2 = pool_str2id(pool, pieces[2], 1);
2394 int r = pool_evrcmp(pool, evr1, evr2, EVRCMP_COMPARE);
2395 r = r < 0 ? REL_LT : r > 0 ? REL_GT : REL_EQ;
2396 queue_push2(job, SOLVER_NOOP | SOLVER_SOLVABLE_PROVIDES, pool_rel2id(pool, evr1, evr2, r, 1));
2400 pool_error(pool, 0, "testcase_read: cannot parse command '%s'", pieces[0]);
2403 while (job && ngenid > 0)
2404 queue_push2(job, SOLVER_NOOP | SOLVER_SOLVABLE_PROVIDES, genid[--ngenid]);
2405 if (autoinstq.count)
2406 pool_add_userinstalled_jobs(pool, &autoinstq, job, GET_USERINSTALLED_NAMES | GET_USERINSTALLED_INVERTED);
2407 queue_free(&autoinstq);
2408 genid = solv_free(genid);
2409 buf = solv_free(buf);
2410 pieces = solv_free(pieces);
2411 solv_free(testcasedir);
2414 pool_addfileprovides(pool);
2415 pool_createwhatprovides(pool);
2419 solv = solver_create(pool);
2420 testcase_resetsolverflags(solv);
2424 if (missing_features)
2429 *resultflagsp = 77; /* hack for testsolv */
2435 testcase_resultdiff(const char *result1, const char *result2)
2437 Strqueue sq1, sq2, osq;
2439 strqueue_init(&sq1);
2440 strqueue_init(&sq2);
2441 strqueue_init(&osq);
2442 strqueue_split(&sq1, result1);
2443 strqueue_split(&sq2, result2);
2444 strqueue_sort(&sq1);
2445 strqueue_sort(&sq2);
2446 strqueue_diff(&sq1, &sq2, &osq);
2447 r = osq.nstr ? strqueue_join(&osq) : 0;
2448 strqueue_free(&sq1);
2449 strqueue_free(&sq2);
2450 strqueue_free(&osq);