2 * Copyright (c) 2012, Novell Inc.
4 * This program is licensed under the BSD license, read LICENSE.BSD
5 * for further information
19 #include "poolvendor.h"
21 #include "repo_solv.h"
23 #include "solverdebug.h"
26 #include "selection.h"
27 #include "solv_xfopen.h"
30 #include "tools_util.h"
32 static struct job2str {
36 { SOLVER_NOOP, "noop" },
37 { SOLVER_INSTALL, "install" },
38 { SOLVER_ERASE, "erase" },
39 { SOLVER_UPDATE, "update" },
40 { SOLVER_WEAKENDEPS, "weakendeps" },
41 { SOLVER_MULTIVERSION, "multiversion" },
42 { SOLVER_MULTIVERSION, "noobsoletes" }, /* old name */
43 { SOLVER_LOCK, "lock" },
44 { SOLVER_DISTUPGRADE, "distupgrade" },
45 { SOLVER_VERIFY, "verify" },
46 { SOLVER_DROP_ORPHANED, "droporphaned" },
47 { SOLVER_USERINSTALLED, "userinstalled" },
51 static struct jobflags2str {
55 { SOLVER_WEAK, "weak" },
56 { SOLVER_ESSENTIAL, "essential" },
57 { SOLVER_CLEANDEPS, "cleandeps" },
58 { SOLVER_ORUPDATE, "orupdate" },
59 { SOLVER_FORCEBEST, "forcebest" },
60 { SOLVER_TARGETED, "targeted" },
61 { SOLVER_NOTBYUSER, "notbyuser" },
62 { SOLVER_SETEV, "setev" },
63 { SOLVER_SETEVR, "setevr" },
64 { SOLVER_SETARCH, "setarch" },
65 { SOLVER_SETVENDOR, "setvendor" },
66 { SOLVER_SETREPO, "setrepo" },
67 { SOLVER_NOAUTOSET, "noautoset" },
71 static struct resultflags2str {
74 } resultflags2str[] = {
75 { TESTCASE_RESULT_TRANSACTION, "transaction" },
76 { TESTCASE_RESULT_PROBLEMS, "problems" },
77 { TESTCASE_RESULT_ORPHANED, "orphaned" },
78 { TESTCASE_RESULT_RECOMMENDED, "recommended" },
79 { TESTCASE_RESULT_UNNEEDED, "unneeded" },
80 { TESTCASE_RESULT_ALTERNATIVES, "alternatives" },
84 static struct solverflags2str {
88 } solverflags2str[] = {
89 { SOLVER_FLAG_ALLOW_DOWNGRADE, "allowdowngrade", 0 },
90 { SOLVER_FLAG_ALLOW_NAMECHANGE, "allownamechange", 1 },
91 { SOLVER_FLAG_ALLOW_ARCHCHANGE, "allowarchchange", 0 },
92 { SOLVER_FLAG_ALLOW_VENDORCHANGE, "allowvendorchange", 0 },
93 { SOLVER_FLAG_ALLOW_UNINSTALL, "allowuninstall", 0 },
94 { SOLVER_FLAG_NO_UPDATEPROVIDE, "noupdateprovide", 0 },
95 { SOLVER_FLAG_SPLITPROVIDES, "splitprovides", 0 },
96 { SOLVER_FLAG_IGNORE_RECOMMENDED, "ignorerecommended", 0 },
97 { SOLVER_FLAG_ADD_ALREADY_RECOMMENDED, "addalreadyrecommended", 0 },
98 { SOLVER_FLAG_NO_INFARCHCHECK, "noinfarchcheck", 0 },
99 { SOLVER_FLAG_KEEP_EXPLICIT_OBSOLETES, "keepexplicitobsoletes", 0 },
100 { SOLVER_FLAG_BEST_OBEY_POLICY, "bestobeypolicy", 0 },
101 { SOLVER_FLAG_NO_AUTOTARGET, "noautotarget", 0 },
102 { SOLVER_FLAG_DUP_ALLOW_DOWNGRADE, "dupallowdowngrade", 1 },
103 { SOLVER_FLAG_DUP_ALLOW_ARCHCHANGE, "dupallowarchchange", 1 },
104 { SOLVER_FLAG_DUP_ALLOW_VENDORCHANGE, "dupallowvendorchange", 1 },
105 { SOLVER_FLAG_DUP_ALLOW_NAMECHANGE, "dupallownamechange", 1 },
106 { SOLVER_FLAG_KEEP_ORPHANS, "keeporphans", 0 },
107 { SOLVER_FLAG_BREAK_ORPHANS, "breakorphans", 0 },
108 { SOLVER_FLAG_FOCUS_INSTALLED, "focusinstalled", 0 },
109 { SOLVER_FLAG_YUM_OBSOLETES, "yumobsoletes", 0 },
113 static struct poolflags2str {
117 } poolflags2str[] = {
118 { POOL_FLAG_PROMOTEEPOCH, "promoteepoch", 0 },
119 { POOL_FLAG_FORBIDSELFCONFLICTS, "forbidselfconflicts", 0 },
120 { POOL_FLAG_OBSOLETEUSESPROVIDES, "obsoleteusesprovides", 0 },
121 { POOL_FLAG_IMPLICITOBSOLETEUSESPROVIDES, "implicitobsoleteusesprovides", 0 },
122 { POOL_FLAG_OBSOLETEUSESCOLORS, "obsoleteusescolors", 0 },
123 { POOL_FLAG_IMPLICITOBSOLETEUSESCOLORS, "implicitobsoleteusescolors", 0 },
124 { POOL_FLAG_NOINSTALLEDOBSOLETES, "noinstalledobsoletes", 0 },
125 { POOL_FLAG_HAVEDISTEPOCH, "havedistepoch", 0 },
126 { POOL_FLAG_NOOBSOLETESMULTIVERSION, "noobsoletesmultiversion", 0 },
127 { POOL_FLAG_ADDFILEPROVIDESFILTERED, "addfileprovidesfiltered", 0 },
131 static struct disttype2str {
135 { DISTTYPE_RPM, "rpm" },
136 { DISTTYPE_DEB, "deb" },
137 { DISTTYPE_ARCH, "arch" },
138 { DISTTYPE_HAIKU, "haiku" },
142 static struct selflags2str {
146 { SELECTION_NAME, "name" },
147 { SELECTION_PROVIDES, "provides" },
148 { SELECTION_FILELIST, "filelist" },
149 { SELECTION_CANON, "canon" },
150 { SELECTION_DOTARCH, "dotarch" },
151 { SELECTION_REL, "rel" },
152 { SELECTION_INSTALLED_ONLY, "installedonly" },
153 { SELECTION_GLOB, "glob" },
154 { SELECTION_FLAT, "flat" },
155 { SELECTION_NOCASE, "nocase" },
156 { SELECTION_SOURCE_ONLY, "sourceonly" },
157 { SELECTION_WITH_SOURCE, "withsource" },
162 typedef struct strqueue {
167 #define STRQUEUE_BLOCK 63
170 strqueue_init(Strqueue *q)
177 strqueue_free(Strqueue *q)
180 for (i = 0; i < q->nstr; i++)
181 solv_free(q->str[i]);
182 q->str = solv_free(q->str);
187 strqueue_push(Strqueue *q, const char *s)
189 q->str = solv_extend(q->str, q->nstr, 1, sizeof(*q->str), STRQUEUE_BLOCK);
190 q->str[q->nstr++] = solv_strdup(s);
194 strqueue_pushjoin(Strqueue *q, const char *s1, const char *s2, const char *s3)
196 q->str = solv_extend(q->str, q->nstr, 1, sizeof(*q->str), STRQUEUE_BLOCK);
197 q->str[q->nstr++] = solv_dupjoin(s1, s2, s3);
201 strqueue_sort_cmp(const void *ap, const void *bp, void *dp)
203 const char *a = *(const char **)ap;
204 const char *b = *(const char **)bp;
205 return strcmp(a ? a : "", b ? b : "");
209 strqueue_sort(Strqueue *q)
212 solv_sort(q->str, q->nstr, sizeof(*q->str), strqueue_sort_cmp, 0);
216 strqueue_sort_u(Strqueue *q)
220 for (i = j = 0; i < q->nstr; i++)
221 if (!j || strqueue_sort_cmp(q->str + i, q->str + j - 1, 0) != 0)
222 q->str[j++] = q->str[i];
227 strqueue_join(Strqueue *q)
231 for (i = 0; i < q->nstr; i++)
233 l += strlen(q->str[i]) + 1;
234 l++; /* trailing \0 */
237 for (i = 0; i < q->nstr; i++)
240 strcpy(rp, q->str[i]);
249 strqueue_split(Strqueue *q, const char *s)
254 while ((p = strchr(s, '\n')) != 0)
256 q->str = solv_extend(q->str, q->nstr, 1, sizeof(*q->str), STRQUEUE_BLOCK);
257 q->str[q->nstr] = solv_malloc(p - s + 1);
259 memcpy(q->str[q->nstr], s, p - s);
260 q->str[q->nstr][p - s] = 0;
269 strqueue_diff(Strqueue *sq1, Strqueue *sq2, Strqueue *osq)
272 while (i < sq1->nstr && j < sq2->nstr)
274 int r = strqueue_sort_cmp(sq1->str + i, sq2->str + j, 0);
278 strqueue_pushjoin(osq, "-", sq1->str[i++], 0);
280 strqueue_pushjoin(osq, "+", sq2->str[j++], 0);
282 while (i < sq1->nstr)
283 strqueue_pushjoin(osq, "-", sq1->str[i++], 0);
284 while (j < sq2->nstr)
285 strqueue_pushjoin(osq, "+", sq2->str[j++], 0);
290 testcase_id2str(Pool *pool, Id id, int isname)
292 const char *s = pool_id2str(pool, id);
295 int bad = 0, paren = 0, parenbad = 0;
301 if (strchr("[(<=>!", *s))
303 if (!strncmp(s, "namespace:", 10))
305 for (ss = s + bad; *ss; ss++)
307 if (*ss == ' ' || *ss == '\\' || *(unsigned char *)ss < 32 || *ss == '(' || *ss == ')')
310 paren = paren == 0 ? 1 : -1;
313 paren = paren == 1 ? 0 : -1;
318 if (isname && ss - s > 4 && !strcmp(ss - 4, ":any"))
320 if (!paren && !(bad - parenbad))
323 /* we need escaping! */
324 s2 = s2p = pool_alloctmpspace(pool, strlen(s) + bad * 2 + 1);
326 if (!strncmp(s, "namespace:", 10))
328 strcpy(s2p, "namespace\\3a");
335 if ((ss == s && strchr("[(<=>!", *s)) || *ss == ' ' || *ss == '\\' || *(unsigned char *)ss < 32 || *ss == '(' || *ss == ')')
338 solv_bin2hex((unsigned char *)ss, 1, s2p);
343 if (isname && s2p - s2 > 4 && !strcmp(s2p - 4, ":any"))
344 strcpy(s2p - 4, "\\3aany");
353 { REL_GT | REL_LT | REL_EQ, "<=>" },
354 { REL_LT | REL_EQ, "<=" },
355 { REL_GT | REL_EQ, ">=" },
357 { REL_GT | REL_LT, "<>" },
361 { REL_NAMESPACE , "<NAMESPACE>" },
363 { REL_MULTIARCH, "<MULTIARCH>" },
364 { REL_FILECONFLICT, "<FILECONFLICT>" },
365 { REL_COND, "<IF>" },
366 { REL_COMPAT, "compat >=" },
367 { REL_KIND, "<KIND>" },
373 testcase_dep2str_complex(Pool *pool, Id id, int addparens)
382 return testcase_id2str(pool, id, 1);
383 rd = GETRELDEP(pool, id);
385 /* check for special shortcuts */
386 if (rd->flags == REL_NAMESPACE && !ISRELDEP(rd->name) && !strncmp(pool_id2str(pool, rd->name), "namespace:", 10))
388 const char *ns = pool_id2str(pool, rd->name);
389 int nslen = strlen(ns);
390 /* special namespace formatting */
391 const char *evrs = testcase_dep2str_complex(pool, rd->evr, 0);
392 s = pool_tmpappend(pool, evrs, ns, "()");
393 memmove(s + nslen + 1, s, strlen(s) - nslen - 2);
394 memcpy(s, ns, nslen);
398 if (rd->flags == REL_MULTIARCH && !ISRELDEP(rd->name) && rd->evr == ARCH_ANY)
400 /* special :any suffix */
401 const char *ns = testcase_id2str(pool, rd->name, 1);
402 return pool_tmpappend(pool, ns, ":any", 0);
406 if (ISRELDEP(rd->name))
408 Reldep *rd2 = GETRELDEP(pool, rd->name);
410 if (rd->flags > 7 && rd->flags != REL_COMPAT && rd2->flags && rd2->flags <= 7)
413 s = (char *)testcase_dep2str_complex(pool, rd->name, needparens);
417 s = pool_tmpappend(pool, s, "(", 0);
418 memmove(s + 1, s, strlen(s + 1));
421 for (op = oplist; op->flags; op++)
422 if (rd->flags == op->flags)
426 s = pool_tmpappend(pool, s, " ", op->opname);
427 s = pool_tmpappend(pool, s, " ", 0);
432 sprintf(buf, " <%u> ", rd->flags);
433 s = pool_tmpappend(pool, s, buf, 0);
437 if (ISRELDEP(rd->evr))
439 Reldep *rd2 = GETRELDEP(pool, rd->evr);
441 if (rd->flags > 7 && rd2->flags && rd2->flags <= 7)
443 if (rd->flags == REL_AND && rd2->flags == REL_AND)
444 needparens = 0; /* chain */
445 if (rd->flags == REL_OR && rd2->flags == REL_OR)
446 needparens = 0; /* chain */
447 if (rd->flags > 0 && rd->flags < 8 && rd2->flags == REL_COMPAT)
448 needparens = 0; /* chain */
450 if (!ISRELDEP(rd->evr))
451 s2 = testcase_id2str(pool, rd->evr, 0);
453 s2 = testcase_dep2str_complex(pool, rd->evr, needparens);
455 s = pool_tmpappend(pool, s, s2, ")");
457 s = pool_tmpappend(pool, s, s2, 0);
458 pool_freetmpspace(pool, s2);
463 testcase_dep2str(Pool *pool, Id id)
465 return testcase_dep2str_complex(pool, id, 0);
469 /* Convert a simple string. Also handle the :any suffix */
471 testcase_str2dep_simple(Pool *pool, const char **sp, int isname)
478 for (s = *sp; *s; s++)
482 if (*s == ' ' || *(unsigned char *)s < 32)
486 if (*s == ')' && paren-- <= 0)
489 if (isname && s - *sp > 4 && !strncmp(s - 4, ":any", 4))
496 if (s - *sp == 6 && !strncmp(*sp, "<NULL>", 6))
499 id = pool_strn2id(pool, *sp, s - *sp, 1);
501 else if (s - *sp == 3 && !strncmp(*sp, "\\00", 3))
505 char buf[128], *bp, *bp2;
507 bp = s - *sp >= 128 ? solv_malloc(s - *sp + 1) : buf;
508 for (bp2 = bp, sp2 = *sp; sp2 < s;)
512 solv_hex2bin(&sp2, (unsigned char *)bp2 - 1, 1);
515 id = pool_str2id(pool, bp, 1);
521 id = pool_rel2id(pool, id, ARCH_ANY, REL_MULTIARCH, 1);
530 testcase_str2dep_complex(Pool *pool, const char **sp, int relop)
533 Id flags, id, id2, namespaceid = 0;
536 while (*s == ' ' || *s == '\t')
538 if (!strncmp(s, "namespace:", 10))
540 /* special namespace hack */
542 for (s2 = s + 10; *s2 && *s2 != '('; s2++)
546 namespaceid = pool_strn2id(pool, s, s2 - s, 1);
553 id = testcase_str2dep_complex(pool, &s, 0);
562 id = testcase_str2dep_simple(pool, &s, relop ? 0 : 1);
564 id = pool_rel2id(pool, namespaceid, id, REL_NAMESPACE, 1);
568 while (*s == ' ' || *s == '\t')
570 if (!*s || *s == ')' || (relop && strncmp(s, "compat >= ", 10) != 0))
576 /* we have an op! Find the end */
578 if (s[0] == '<' && (s[1] >= '0' && s[1] <= '9'))
581 for (s2 = s + 1; *s2 >= '0' && *s2 <= '9'; s2++)
585 flags = strtoul(s + 1, 0, 10);
591 for (op = oplist; op->flags; op++)
592 if (!strncmp(s, op->opname, strlen(op->opname)))
600 s += strlen(op->opname);
602 id2 = testcase_str2dep_complex(pool, &s, flags > 0 && flags < 8);
608 id = pool_rel2id(pool, id, id2, flags, 1);
613 testcase_str2dep(Pool *pool, const char *s)
615 Id id = testcase_str2dep_complex(pool, &s, 0);
616 return s && !*s ? id : 0;
619 /**********************************************************/
622 testcase_repoid2str(Pool *pool, Id repoid)
624 Repo *repo = pool_id2repo(pool, repoid);
627 char *r = pool_tmpjoin(pool, repo->name, 0, 0);
629 for (rp = r; *rp; rp++)
630 if (*rp == ' ' || *rp == '\t')
637 sprintf(buf, "#%d", repoid);
638 return pool_tmpjoin(pool, buf, 0, 0);
643 testcase_solvid2str(Pool *pool, Id p)
645 Solvable *s = pool->solvables + p;
646 const char *n, *e, *a;
649 if (p == SYSTEMSOLVABLE)
651 n = pool_id2str(pool, s->name);
652 e = pool_id2str(pool, s->evr);
653 a = pool_id2str(pool, s->arch);
654 str = pool_alloctmpspace(pool, strlen(n) + strlen(e) + strlen(a) + 3);
655 sprintf(str, "%s-%s.%s", n, e, a);
657 return pool_tmpappend(pool, str, "@", 0);
661 char *str2 = pool_tmpappend(pool, str, "@", s->repo->name);
663 if (str2[l] == ' ' || str2[l] == '\t')
667 sprintf(buf, "@#%d", s->repo->repoid);
668 return pool_tmpappend(pool, str, buf, 0);
672 testcase_str2repo(Pool *pool, const char *str)
676 if (str[0] == '#' && (str[1] >= '0' && str[1] <= '9'))
680 for (j = 1; str[j] >= '0' && str[j] <= '9'; j++)
681 repoid = repoid * 10 + (str[j] - '0');
682 if (!str[j] && repoid > 0 && repoid < pool->nrepos)
683 repo = pool_id2repo(pool, repoid);
687 FOR_REPOS(repoid, repo)
692 l = strlen(repo->name);
693 for (i = 0; i < l; i++)
695 int c = repo->name[i];
696 if (c == ' ' || c == '\t')
701 if (i == l && !str[l])
704 if (repoid >= pool->nrepos)
711 testcase_str2solvid(Pool *pool, const char *str)
713 int i, l = strlen(str);
720 if (*str == '@' && !strcmp(str, "@SYSTEM"))
721 return SYSTEMSOLVABLE;
723 for (i = l - 1; i >= 0; i--)
724 if (str[i] == '@' && (repo = testcase_str2repo(pool, str + i + 1)) != 0)
729 /* now find the arch (if present) */
731 for (i = repostart - 1; i > 0; i--)
734 arch = pool_strn2id(pool, str + i + 1, repostart - (i + 1), 0);
739 /* now find the name */
740 for (i = repostart - 1; i > 0; i--)
744 Id nid, evrid, p, pp;
745 nid = pool_strn2id(pool, str, i, 0);
748 evrid = pool_strn2id(pool, str + i + 1, repostart - (i + 1), 0);
751 FOR_PROVIDES(p, pp, nid)
753 Solvable *s = pool->solvables + p;
754 if (s->name != nid || s->evr != evrid)
756 if (repo && s->repo != repo)
758 if (arch && s->arch != arch)
768 testcase_job2str(Pool *pool, Id how, Id what)
775 Id select = how & SOLVER_SELECTMASK;
777 for (i = 0; job2str[i].str; i++)
778 if ((how & SOLVER_JOBMASK) == job2str[i].job)
780 jobstr = job2str[i].str ? job2str[i].str : "unknown";
781 if (select == SOLVER_SOLVABLE)
784 pkgstr = testcase_solvid2str(pool, what);
786 else if (select == SOLVER_SOLVABLE_NAME)
789 pkgstr = testcase_dep2str(pool, what);
791 else if (select == SOLVER_SOLVABLE_PROVIDES)
793 selstr = " provides ";
794 pkgstr = testcase_dep2str(pool, what);
796 else if (select == SOLVER_SOLVABLE_ONE_OF)
801 while ((p = pool->whatprovidesdata[what++]) != 0)
803 const char *s = testcase_solvid2str(pool, p);
806 pkgstr = pool_tmpappend(pool, pkgstr, " ", s);
807 pool_freetmpspace(pool, s);
815 else if (select == SOLVER_SOLVABLE_REPO)
817 Repo *repo = pool_id2repo(pool, what);
822 sprintf(buf, "#%d", repo->repoid);
823 pkgstr = pool_tmpjoin(pool, buf, 0, 0);
826 pkgstr = pool_tmpjoin(pool, repo->name, 0, 0);
828 else if (select == SOLVER_SOLVABLE_ALL)
835 selstr = " unknown ";
838 ret = pool_tmpjoin(pool, jobstr, selstr, pkgstr);
840 ret = pool_tmpappend(pool, ret, " ", 0);
841 for (i = 0; jobflags2str[i].str; i++)
842 if ((how & jobflags2str[i].flag) != 0)
843 ret = pool_tmpappend(pool, ret, ",", jobflags2str[i].str);
849 ret = pool_tmpappend(pool, ret, "]", 0);
855 str2selflags(Pool *pool, char *s) /* modifies the string! */
860 char *se = strchr(s, ',');
863 for (i = 0; selflags2str[i].str; i++)
864 if (!strcmp(s, selflags2str[i].str))
866 selflags |= selflags2str[i].flag;
869 if (!selflags2str[i].str)
870 pool_debug(pool, SOLV_ERROR, "str2job: unknown selection flag '%s'\n", s);
877 str2jobflags(Pool *pool, char *s) /* modifies the string */
882 char *se = strchr(s, ',');
885 for (i = 0; jobflags2str[i].str; i++)
886 if (!strcmp(s, jobflags2str[i].str))
888 jobflags |= jobflags2str[i].flag;
891 if (!jobflags2str[i].str)
892 pool_debug(pool, SOLV_ERROR, "str2job: unknown job flag '%s'\n", s);
899 testcase_str2job(Pool *pool, const char *str, Id *whatp)
909 /* so we can patch it */
910 s = pool_tmpjoin(pool, str, 0, 0);
911 /* split it in pieces */
914 while (*s == ' ' || *s == '\t')
918 pieces = solv_extend(pieces, npieces, 1, sizeof(*pieces), 7);
919 pieces[npieces++] = s;
920 while (*s && *s != ' ' && *s != '\t')
927 pool_debug(pool, SOLV_ERROR, "str2job: bad line '%s'\n", str);
932 for (i = 0; job2str[i].str; i++)
933 if (!strcmp(pieces[0], job2str[i].str))
937 pool_debug(pool, SOLV_ERROR, "str2job: unknown job '%s'\n", str);
941 job = job2str[i].job;
945 char *flags = pieces[npieces - 1];
946 if (*flags == '[' && flags[strlen(flags) - 1] == ']')
950 flags[strlen(flags) - 1] = 0;
951 job |= str2jobflags(pool, flags);
954 if (!strcmp(pieces[1], "pkg"))
958 pool_debug(pool, SOLV_ERROR, "str2job: bad pkg selector in '%s'\n", str);
962 job |= SOLVER_SOLVABLE;
963 what = testcase_str2solvid(pool, pieces[2]);
966 pool_debug(pool, SOLV_ERROR, "str2job: unknown package '%s'\n", pieces[2]);
971 else if (!strcmp(pieces[1], "name") || !strcmp(pieces[1], "provides"))
973 /* join em again for dep2str... */
975 for (sp = pieces[2]; sp < pieces[npieces - 1]; sp++)
979 if (pieces[1][0] == 'p' && strncmp(pieces[2], "namespace:", 10) == 0)
981 char *spe = strchr(pieces[2], '(');
982 int l = strlen(pieces[2]);
983 if (spe && pieces[2][l - 1] == ')')
985 /* special namespace provides */
986 if (strcmp(spe, "(<NULL>)") != 0)
988 pieces[2][l - 1] = 0;
989 what = testcase_str2dep(pool, spe + 1);
990 pieces[2][l - 1] = ')';
992 what = pool_rel2id(pool, pool_strn2id(pool, pieces[2], spe - pieces[2], 1), what, REL_NAMESPACE, 1);
996 what = testcase_str2dep(pool, pieces[2]);
997 if (pieces[1][0] == 'n')
998 job |= SOLVER_SOLVABLE_NAME;
1000 job |= SOLVER_SOLVABLE_PROVIDES;
1002 else if (!strcmp(pieces[1], "oneof"))
1005 job |= SOLVER_SOLVABLE_ONE_OF;
1007 if (npieces > 3 && strcmp(pieces[2], "nothing") != 0)
1009 for (i = 2; i < npieces; i++)
1011 Id p = testcase_str2solvid(pool, pieces[i]);
1014 pool_debug(pool, SOLV_ERROR, "str2job: unknown package '%s'\n", pieces[i]);
1022 what = pool_queuetowhatprovides(pool, &q);
1025 else if (!strcmp(pieces[1], "repo"))
1030 pool_debug(pool, SOLV_ERROR, "str2job: bad line '%s'\n", str);
1034 repo = testcase_str2repo(pool, pieces[2]);
1037 pool_debug(pool, SOLV_ERROR, "str2job: unknown repo '%s'\n", pieces[2]);
1041 job |= SOLVER_SOLVABLE_REPO;
1042 what = repo->repoid;
1044 else if (!strcmp(pieces[1], "all"))
1046 if (npieces != 3 && strcmp(pieces[2], "packages") != 0)
1048 pool_debug(pool, SOLV_ERROR, "str2job: bad line '%s'\n", str);
1052 job |= SOLVER_SOLVABLE_ALL;
1057 pool_debug(pool, SOLV_ERROR, "str2job: unknown selection in '%s'\n", str);
1067 addselectionjob(Pool *pool, char **pieces, int npieces, Queue *jobqueue)
1074 for (i = 0; job2str[i].str; i++)
1075 if (!strcmp(pieces[0], job2str[i].str))
1077 if (!job2str[i].str)
1079 pool_debug(pool, SOLV_ERROR, "selstr2job: unknown job '%s'\n", pieces[0]);
1082 job = job2str[i].job;
1085 char *flags = pieces[npieces - 1];
1086 if (*flags == '[' && flags[strlen(flags) - 1] == ']')
1090 flags[strlen(flags) - 1] = 0;
1091 job |= str2jobflags(pool, flags);
1096 pool_debug(pool, SOLV_ERROR, "selstr2job: no selection flags\n");
1099 selflags = str2selflags(pool, pieces[3]);
1101 r = selection_make(pool, &sel, pieces[2], selflags);
1102 for (i = 0; i < sel.count; i += 2)
1103 queue_push2(jobqueue, job | sel.elements[i], sel.elements[i + 1]);
1109 writedeps(Repo *repo, FILE *fp, const char *tag, Id key, Solvable *s, Offset off)
1111 Pool *pool = repo->pool;
1118 dp = repo->idarraydata + off;
1119 while ((id = *dp++) != 0)
1121 if (key == SOLVABLE_REQUIRES && id == SOLVABLE_PREREQMARKER)
1124 fprintf(fp, "-%s\n", tag);
1129 if (key == SOLVABLE_PROVIDES && id == SOLVABLE_FILEMARKER)
1131 idstr = testcase_dep2str(pool, id);
1134 fprintf(fp, "+%s\n", tag);
1137 fprintf(fp, "%s\n", idstr);
1140 fprintf(fp, "-%s\n", tag);
1144 writefilelist(Repo *repo, FILE *fp, const char *tag, Solvable *s)
1146 Pool *pool = repo->pool;
1150 dataiterator_init(&di, pool, repo, s - pool->solvables, SOLVABLE_FILELIST, 0, 0);
1151 while (dataiterator_step(&di))
1153 const char *s = repodata_dir2str(di.data, di.kv.id, di.kv.str);
1156 fprintf(fp, "+%s\n", tag);
1159 fprintf(fp, "%s\n", s);
1162 fprintf(fp, "-%s\n", tag);
1163 dataiterator_free(&di);
1167 testcase_write_testtags(Repo *repo, FILE *fp)
1169 Pool *pool = repo->pool;
1175 const char *release;
1179 fprintf(fp, "=Ver: 3.0\n");
1180 FOR_REPO_SOLVABLES(repo, p, s)
1182 name = pool_id2str(pool, s->name);
1183 evr = pool_id2str(pool, s->evr);
1184 arch = pool_id2str(pool, s->arch);
1185 release = strrchr(evr, '-');
1187 release = evr + strlen(evr);
1188 fprintf(fp, "=Pkg: %s %.*s %s %s\n", name, (int)(release - evr), evr, *release && release[1] ? release + 1 : "-", arch);
1189 tmp = solvable_lookup_str(s, SOLVABLE_SUMMARY);
1191 fprintf(fp, "=Sum: %s\n", tmp);
1192 writedeps(repo, fp, "Req:", SOLVABLE_REQUIRES, s, s->requires);
1193 writedeps(repo, fp, "Prv:", SOLVABLE_PROVIDES, s, s->provides);
1194 writedeps(repo, fp, "Obs:", SOLVABLE_OBSOLETES, s, s->obsoletes);
1195 writedeps(repo, fp, "Con:", SOLVABLE_CONFLICTS, s, s->conflicts);
1196 writedeps(repo, fp, "Rec:", SOLVABLE_RECOMMENDS, s, s->recommends);
1197 writedeps(repo, fp, "Sup:", SOLVABLE_SUPPLEMENTS, s, s->supplements);
1198 writedeps(repo, fp, "Sug:", SOLVABLE_SUGGESTS, s, s->suggests);
1199 writedeps(repo, fp, "Enh:", SOLVABLE_ENHANCES, s, s->enhances);
1201 fprintf(fp, "=Vnd: %s\n", pool_id2str(pool, s->vendor));
1202 ti = solvable_lookup_num(s, SOLVABLE_BUILDTIME, 0);
1204 fprintf(fp, "=Tim: %u\n", ti);
1205 writefilelist(repo, fp, "Fls:", s);
1210 static inline Offset
1211 adddep(Repo *repo, Offset olddeps, char *str, Id marker)
1213 Id id = *str == '/' ? pool_str2id(repo->pool, str, 1) : testcase_str2dep(repo->pool, str);
1214 return repo_addid_dep(repo, olddeps, id, marker);
1218 finish_v2_solvable(Pool *pool, Repodata *data, Solvable *s, char *filelist, int nfilelist)
1224 for (l = 0; l < nfilelist; l += strlen(filelist + l) + 1)
1226 char *p = strrchr(filelist + l, '/');
1230 did = repodata_str2dir(data, filelist + l, 1);
1233 did = repodata_str2dir(data, "/", 1);
1234 repodata_add_dirstr(data, s - pool->solvables, SOLVABLE_FILELIST, did, p);
1237 s->supplements = repo_fix_supplements(s->repo, s->provides, s->supplements, 0);
1238 s->conflicts = repo_fix_conflicts(s->repo, s->conflicts);
1241 /* stripped down version of susetags parser used for testcases */
1243 testcase_add_testtags(Repo *repo, FILE *fp, int flags)
1245 Pool *pool = repo->pool;
1257 int tagsversion = 0;
1258 int addselfprovides = 1; /* for compat reasons */
1260 data = repo_add_repodata(repo, flags);
1265 line = solv_malloc(aline);
1269 if (linep - line + 16 > aline)
1271 aline = linep - line;
1272 line = solv_realloc(line, aline + 512);
1273 linep = line + aline;
1276 if (!fgets(linep, aline - (linep - line), fp))
1278 linep += strlen(linep);
1279 if (linep == line || linep[-1] != '\n')
1282 linep = line + intag;
1285 if (line[intag] == '-' && !strncmp(line + 1, line + intag + 1, intag - 2))
1292 else if (line[0] == '+' && line[1] && line[1] != ':')
1294 char *tagend = strchr(line, ':');
1299 intag = tagend + 2 - line;
1300 linep = line + intag;
1303 if (*line != '=' || !line[1] || !line[2] || !line[3] || line[4] != ':')
1305 tag = line[1] << 16 | line[2] << 8 | line[3];
1308 case 'V' << 16 | 'e' << 8 | 'r':
1309 tagsversion = atoi(line + 6);
1310 addselfprovides = tagsversion < 3 || strstr(line + 6, "addselfprovides") != 0;
1312 case 'P' << 16 | 'k' << 8 | 'g':
1315 if (tagsversion == 2)
1316 finish_v2_solvable(pool, data, s, filelist, nfilelist);
1317 if (addselfprovides && s->name && s->arch != ARCH_SRC && s->arch != ARCH_NOSRC)
1318 s->provides = repo_addid_dep(s->repo, s->provides, pool_rel2id(pool, s->name, s->evr, REL_EQ, 1), 0);
1321 if (split(line + 5, sp, 5) != 4)
1323 s = pool_id2solvable(pool, repo_add_solvable(repo));
1324 s->name = pool_str2id(pool, sp[0], 1);
1325 /* join back version and release */
1326 if (sp[2] && !(sp[2][0] == '-' && !sp[2][1]))
1328 s->evr = makeevr(pool, sp[1]);
1329 s->arch = pool_str2id(pool, sp[3], 1);
1331 case 'S' << 16 | 'u' << 8 | 'm':
1332 repodata_set_str(data, s - pool->solvables, SOLVABLE_SUMMARY, line + 6);
1334 case 'V' << 16 | 'n' << 8 | 'd':
1335 s->vendor = pool_str2id(pool, line + 6, 1);
1337 case 'T' << 16 | 'i' << 8 | 'm':
1340 repodata_set_num(data, s - pool->solvables, SOLVABLE_BUILDTIME, t);
1342 case 'R' << 16 | 'e' << 8 | 'q':
1343 s->requires = adddep(repo, s->requires, line + 6, -SOLVABLE_PREREQMARKER);
1345 case 'P' << 16 | 'r' << 8 | 'q':
1346 s->requires = adddep(repo, s->requires, line + 6, SOLVABLE_PREREQMARKER);
1348 case 'P' << 16 | 'r' << 8 | 'v':
1349 /* version 2 had the file list at the end of the provides */
1350 if (tagsversion == 2)
1354 int l = strlen(line + 6) + 1;
1355 if (nfilelist + l > afilelist)
1357 afilelist = nfilelist + l + 512;
1358 filelist = solv_realloc(filelist, afilelist);
1360 memcpy(filelist + nfilelist, line + 6, l);
1367 for (l = 0; l < nfilelist; l += strlen(filelist + l) + 1)
1368 s->provides = repo_addid_dep(repo, s->provides, pool_str2id(pool, filelist + l, 1), 0);
1372 s->provides = adddep(repo, s->provides, line + 6, 0);
1374 case 'F' << 16 | 'l' << 8 | 's':
1376 char *p = strrchr(line + 6, '/');
1381 did = repodata_str2dir(data, line + 6, 1);
1383 did = repodata_str2dir(data, "/", 1);
1384 repodata_add_dirstr(data, s - pool->solvables, SOLVABLE_FILELIST, did, p);
1387 case 'O' << 16 | 'b' << 8 | 's':
1388 s->obsoletes = adddep(repo, s->obsoletes, line + 6, 0);
1390 case 'C' << 16 | 'o' << 8 | 'n':
1391 s->conflicts = adddep(repo, s->conflicts, line + 6, 0);
1393 case 'R' << 16 | 'e' << 8 | 'c':
1394 s->recommends = adddep(repo, s->recommends, line + 6, 0);
1396 case 'S' << 16 | 'u' << 8 | 'p':
1397 s->supplements = adddep(repo, s->supplements, line + 6, 0);
1399 case 'S' << 16 | 'u' << 8 | 'g':
1400 s->suggests = adddep(repo, s->suggests, line + 6, 0);
1402 case 'E' << 16 | 'n' << 8 | 'h':
1403 s->enhances = adddep(repo, s->enhances, line + 6, 0);
1411 if (tagsversion == 2)
1412 finish_v2_solvable(pool, data, s, filelist, nfilelist);
1413 if (addselfprovides && s->name && s->arch != ARCH_SRC && s->arch != ARCH_NOSRC)
1414 s->provides = repo_addid_dep(s->repo, s->provides, pool_rel2id(pool, s->name, s->evr, REL_EQ, 1), 0);
1417 solv_free(filelist);
1418 repodata_free_dircache(data);
1419 if (!(flags & REPO_NO_INTERNALIZE))
1420 repodata_internalize(data);
1425 testcase_getpoolflags(Pool *pool)
1427 const char *str = 0;
1429 for (i = 0; poolflags2str[i].str; i++)
1431 v = pool_get_flag(pool, poolflags2str[i].flag);
1432 if (v == poolflags2str[i].def)
1434 str = pool_tmpappend(pool, str, v ? " " : " !", poolflags2str[i].str);
1436 return str ? str + 1 : "";
1440 testcase_setpoolflags(Pool *pool, const char *str)
1442 const char *p = str, *s;
1446 while (*p == ' ' || *p == '\t' || *p == ',')
1457 while (*p && *p != ' ' && *p != '\t' && *p != ',')
1459 for (i = 0; poolflags2str[i].str; i++)
1460 if (!strncmp(poolflags2str[i].str, s, p - s) && poolflags2str[i].str[p - s] == 0)
1462 if (!poolflags2str[i].str)
1464 pool_debug(pool, SOLV_ERROR, "setpoolflags: unknown flag '%.*s'\n", (int)(p - s), s);
1467 pool_set_flag(pool, poolflags2str[i].flag, v);
1473 testcase_resetpoolflags(Pool *pool)
1476 for (i = 0; poolflags2str[i].str; i++)
1477 pool_set_flag(pool, poolflags2str[i].flag, poolflags2str[i].def);
1481 testcase_getsolverflags(Solver *solv)
1483 Pool *pool = solv->pool;
1484 const char *str = 0;
1486 for (i = 0; solverflags2str[i].str; i++)
1488 v = solver_get_flag(solv, solverflags2str[i].flag);
1489 if (v == solverflags2str[i].def)
1491 str = pool_tmpappend(pool, str, v ? " " : " !", solverflags2str[i].str);
1493 return str ? str + 1 : "";
1497 testcase_setsolverflags(Solver *solv, const char *str)
1499 const char *p = str, *s;
1503 while (*p == ' ' || *p == '\t' || *p == ',')
1514 while (*p && *p != ' ' && *p != '\t' && *p != ',')
1516 for (i = 0; solverflags2str[i].str; i++)
1517 if (!strncmp(solverflags2str[i].str, s, p - s) && solverflags2str[i].str[p - s] == 0)
1519 if (!solverflags2str[i].str)
1521 pool_debug(solv->pool, SOLV_ERROR, "setsolverflags: unknown flag '%.*s'\n", (int)(p - s), s);
1524 solver_set_flag(solv, solverflags2str[i].flag, v);
1530 testcase_resetsolverflags(Solver *solv)
1533 for (i = 0; solverflags2str[i].str; i++)
1534 solver_set_flag(solv, solverflags2str[i].flag, solverflags2str[i].def);
1538 testcase_ruleid(Solver *solv, Id rid)
1544 const unsigned char *md5;
1550 solver_ruleliterals(solv, rid, &q);
1551 for (i = 0; i < q.count; i++)
1553 Id p = q.elements[i];
1554 s = testcase_solvid2str(solv->pool, p > 0 ? p : -p);
1556 s = pool_tmpjoin(solv->pool, "!", s, 0);
1557 strqueue_push(&sq, s);
1560 strqueue_sort_u(&sq);
1561 chk = solv_chksum_create(REPOKEY_TYPE_MD5);
1562 for (i = 0; i < sq.nstr; i++)
1563 solv_chksum_add(chk, sq.str[i], strlen(sq.str[i]) + 1);
1564 md5 = solv_chksum_get(chk, &md5l);
1565 s = pool_bin2hex(solv->pool, md5, md5l);
1566 chk = solv_chksum_free(chk, 0);
1572 testcase_problemid(Solver *solv, Id problem)
1577 const unsigned char *md5;
1581 /* we build a hash of all rules that define the problem */
1584 solver_findallproblemrules(solv, problem, &q);
1585 for (i = 0; i < q.count; i++)
1586 strqueue_push(&sq, testcase_ruleid(solv, q.elements[i]));
1588 strqueue_sort_u(&sq);
1589 chk = solv_chksum_create(REPOKEY_TYPE_MD5);
1590 for (i = 0; i < sq.nstr; i++)
1591 solv_chksum_add(chk, sq.str[i], strlen(sq.str[i]) + 1);
1592 md5 = solv_chksum_get(chk, &md5l);
1593 s = pool_bin2hex(solv->pool, md5, 4);
1594 chk = solv_chksum_free(chk, 0);
1600 testcase_solutionid(Solver *solv, Id problem, Id solution)
1604 const unsigned char *md5;
1608 intid = solver_solutionelement_internalid(solv, problem, solution);
1609 /* internal stuff! handle with care! */
1613 s = testcase_job2str(solv->pool, solv->job.elements[-intid - 1], solv->job.elements[-intid]);
1618 s = testcase_ruleid(solv, intid);
1620 chk = solv_chksum_create(REPOKEY_TYPE_MD5);
1621 solv_chksum_add(chk, s, strlen(s) + 1);
1622 md5 = solv_chksum_get(chk, &md5l);
1623 s = pool_bin2hex(solv->pool, md5, 4);
1624 chk = solv_chksum_free(chk, 0);
1629 testcase_alternativeid(Solver *solv, int type, Id id, Id from)
1632 Pool *pool = solv->pool;
1634 const unsigned char *md5;
1636 chk = solv_chksum_create(REPOKEY_TYPE_MD5);
1637 if (type == SOLVER_ALTERNATIVE_TYPE_RECOMMENDS)
1639 s = testcase_solvid2str(pool, from);
1640 solv_chksum_add(chk, s, strlen(s) + 1);
1641 s = testcase_dep2str(pool, id);
1642 solv_chksum_add(chk, s, strlen(s) + 1);
1644 else if (type == SOLVER_ALTERNATIVE_TYPE_RULE)
1646 s = testcase_ruleid(solv, id);
1647 solv_chksum_add(chk, s, strlen(s) + 1);
1649 md5 = solv_chksum_get(chk, &md5l);
1650 s = pool_bin2hex(pool, md5, 4);
1651 chk = solv_chksum_free(chk, 0);
1655 static struct class2str {
1659 { SOLVER_TRANSACTION_ERASE, "erase" },
1660 { SOLVER_TRANSACTION_INSTALL, "install" },
1661 { SOLVER_TRANSACTION_REINSTALLED, "reinstall" },
1662 { SOLVER_TRANSACTION_DOWNGRADED, "downgrade" },
1663 { SOLVER_TRANSACTION_CHANGED, "change" },
1664 { SOLVER_TRANSACTION_UPGRADED, "upgrade" },
1665 { SOLVER_TRANSACTION_OBSOLETED, "obsolete" },
1666 { SOLVER_TRANSACTION_MULTIINSTALL, "multiinstall" },
1667 { SOLVER_TRANSACTION_MULTIREINSTALL, "multireinstall" },
1672 testcase_solverresult(Solver *solv, int resultflags)
1674 Pool *pool = solv->pool;
1682 if ((resultflags & TESTCASE_RESULT_TRANSACTION) != 0)
1684 Transaction *trans = solver_create_transaction(solv);
1688 for (i = 0; class2str[i].str; i++)
1691 transaction_classify_pkgs(trans, SOLVER_TRANSACTION_KEEP_PSEUDO, class2str[i].class, 0, 0, &q);
1692 for (j = 0; j < q.count; j++)
1696 if (pool->installed && pool->solvables[p].repo == pool->installed)
1697 op = transaction_obs_pkg(trans, p);
1698 s = pool_tmpjoin(pool, class2str[i].str, " ", testcase_solvid2str(pool, p));
1700 s = pool_tmpjoin(pool, s, " ", testcase_solvid2str(pool, op));
1701 strqueue_push(&sq, s);
1705 transaction_free(trans);
1707 if ((resultflags & TESTCASE_RESULT_PROBLEMS) != 0)
1709 char *probprefix, *solprefix;
1710 int problem, solution, element;
1713 pcnt = solver_problem_count(solv);
1714 for (problem = 1; problem <= pcnt; problem++)
1716 Id rid, from, to, dep;
1717 SolverRuleinfo rinfo;
1718 rid = solver_findproblemrule(solv, problem);
1719 s = testcase_problemid(solv, problem);
1720 probprefix = solv_dupjoin("problem ", s, 0);
1721 rinfo = solver_ruleinfo(solv, rid, &from, &to, &dep);
1722 s = pool_tmpjoin(pool, probprefix, " info ", solver_problemruleinfo2str(solv, rinfo, from, to, dep));
1723 strqueue_push(&sq, s);
1724 scnt = solver_solution_count(solv, problem);
1725 for (solution = 1; solution <= scnt; solution++)
1727 s = testcase_solutionid(solv, problem, solution);
1728 solprefix = solv_dupjoin(probprefix, " solution ", s);
1730 while ((element = solver_next_solutionelement(solv, problem, solution, element, &p, &op)) != 0)
1732 if (p == SOLVER_SOLUTION_JOB)
1733 s = pool_tmpjoin(pool, solprefix, " deljob ", testcase_job2str(pool, solv->job.elements[op - 1], solv->job.elements[op]));
1734 else if (p > 0 && op == 0)
1735 s = pool_tmpjoin(pool, solprefix, " erase ", testcase_solvid2str(pool, p));
1736 else if (p > 0 && op > 0)
1738 s = pool_tmpjoin(pool, solprefix, " replace ", testcase_solvid2str(pool, p));
1739 s = pool_tmpappend(pool, s, " ", testcase_solvid2str(pool, op));
1741 else if (p < 0 && op > 0)
1742 s = pool_tmpjoin(pool, solprefix, " allow ", testcase_solvid2str(pool, op));
1744 s = pool_tmpjoin(pool, solprefix, " unknown", 0);
1745 strqueue_push(&sq, s);
1747 solv_free(solprefix);
1749 solv_free(probprefix);
1753 if ((resultflags & TESTCASE_RESULT_ORPHANED) != 0)
1758 solver_get_orphaned(solv, &q);
1759 for (i = 0; i < q.count; i++)
1761 s = pool_tmpjoin(pool, "orphaned ", testcase_solvid2str(pool, q.elements[i]), 0);
1762 strqueue_push(&sq, s);
1767 if ((resultflags & TESTCASE_RESULT_RECOMMENDED) != 0)
1773 solver_get_recommendations(solv, &qr, &qs, 0);
1774 for (i = 0; i < qr.count; i++)
1776 s = pool_tmpjoin(pool, "recommended ", testcase_solvid2str(pool, qr.elements[i]), 0);
1777 strqueue_push(&sq, s);
1779 for (i = 0; i < qs.count; i++)
1781 s = pool_tmpjoin(pool, "suggested ", testcase_solvid2str(pool, qs.elements[i]), 0);
1782 strqueue_push(&sq, s);
1788 if ((resultflags & TESTCASE_RESULT_UNNEEDED) != 0)
1794 solver_get_unneeded(solv, &q, 0);
1795 solver_get_unneeded(solv, &qf, 1);
1796 for (i = j = 0; i < q.count; i++)
1798 /* we rely on qf containing a subset of q in the same order */
1799 if (j < qf.count && q.elements[i] == qf.elements[j])
1801 s = pool_tmpjoin(pool, "unneeded_filtered ", testcase_solvid2str(pool, q.elements[i]), 0);
1805 s = pool_tmpjoin(pool, "unneeded ", testcase_solvid2str(pool, q.elements[i]), 0);
1806 strqueue_push(&sq, s);
1811 if ((resultflags & TESTCASE_RESULT_ALTERNATIVES) != 0)
1819 cnt = solver_alternatives_count(solv);
1820 for (alternative = 1; alternative <= cnt; alternative++)
1822 Id id, from, chosen;
1824 int type = solver_get_alternative(solv, alternative, &id, &from, &chosen, &q, 0);
1825 altprefix = solv_dupjoin("alternative ", testcase_alternativeid(solv, type, id, from), " ");
1827 if (type == SOLVER_ALTERNATIVE_TYPE_RECOMMENDS)
1829 char *s = pool_tmpjoin(pool, altprefix, num, testcase_solvid2str(pool, from));
1830 s = pool_tmpappend(pool, s, " recommends ", testcase_dep2str(pool, id));
1831 strqueue_push(&sq, s);
1833 else if (type == SOLVER_ALTERNATIVE_TYPE_RULE)
1835 /* map choice rules back to pkg rules */
1836 if (solver_ruleclass(solv, id) == SOLVER_RULE_CHOICE)
1837 id = solver_rule2pkgrule(solv, id);
1838 solver_allruleinfos(solv, id, &rq);
1839 for (i = 0; i < rq.count; i += 4)
1841 int rtype = rq.elements[i];
1842 if ((rtype & SOLVER_RULE_TYPEMASK) == SOLVER_RULE_JOB)
1844 const char *js = testcase_job2str(pool, rq.elements[i + 2], rq.elements[i + 3]);
1845 char *s = pool_tmpjoin(pool, altprefix, num, " job ");
1846 s = pool_tmpappend(pool, s, js, 0);
1847 strqueue_push(&sq, s);
1849 else if (rtype == SOLVER_RULE_PKG_REQUIRES)
1851 char *s = pool_tmpjoin(pool, altprefix, num, testcase_solvid2str(pool, rq.elements[i + 1]));
1852 s = pool_tmpappend(pool, s, " requires ", testcase_dep2str(pool, rq.elements[i + 3]));
1853 strqueue_push(&sq, s);
1857 for (i = 0; i < q.count; i++)
1859 Id p = q.elements[i];
1861 num[0] = '0' + (i + 1) / 10;
1862 num[1] = '0' + (i + 1) % 10;
1864 s = pool_tmpjoin(pool, altprefix, num, "+ ");
1866 s = pool_tmpjoin(pool, altprefix, num, "- ");
1868 s = pool_tmpjoin(pool, altprefix, num, " ");
1869 s = pool_tmpappend(pool, s, testcase_solvid2str(pool, p < 0 ? -p : p), 0);
1870 strqueue_push(&sq, s);
1872 solv_free(altprefix);
1879 result = strqueue_join(&sq);
1886 testcase_write(Solver *solv, char *dir, int resultflags, const char *testcasename, const char *resultname)
1888 Pool *pool = solv->pool;
1899 testcasename = "testcase.t";
1901 resultname = "solver.result";
1903 if (mkdir(dir, 0777) && errno != EEXIST)
1905 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: could not create directory '%s'\n", dir);
1909 FOR_REPOS(repoid, repo)
1911 const char *name = testcase_repoid2str(pool, repoid);
1913 if (repo->subpriority)
1914 sprintf(priobuf, "%d.%d", repo->priority, repo->subpriority);
1916 sprintf(priobuf, "%d", repo->priority);
1917 out = pool_tmpjoin(pool, name, ".repo", ".gz");
1918 cmd = pool_tmpjoin(pool, "repo ", name, " ");
1919 cmd = pool_tmpappend(pool, cmd, priobuf, " ");
1920 cmd = pool_tmpappend(pool, cmd, "testtags ", out);
1921 strqueue_push(&sq, cmd);
1922 out = pool_tmpjoin(pool, dir, "/", out);
1923 if (!(fp = solv_xfopen(out, "w")))
1925 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: could not open '%s' for writing\n", out);
1929 testcase_write_testtags(repo, fp);
1932 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: write error\n");
1937 /* hmm, this is not optimal... we currently search for the lowest score */
1939 arch = pool->solvables[SYSTEMSOLVABLE].arch;
1940 for (i = 0; i < pool->lastarch; i++)
1942 if (pool->id2arch[i] == 1 && !lowscore)
1944 if (pool->id2arch[i] > 0x10000 && (!lowscore || pool->id2arch[i] < lowscore))
1947 lowscore = pool->id2arch[i];
1950 cmd = pool_tmpjoin(pool, "system ", pool->lastarch ? pool_id2str(pool, arch) : "unset", 0);
1951 for (i = 0; disttype2str[i].str != 0; i++)
1952 if (pool->disttype == disttype2str[i].type)
1954 pool_tmpappend(pool, cmd, " ", disttype2str[i].str ? disttype2str[i].str : "unknown");
1955 if (pool->installed)
1956 cmd = pool_tmpappend(pool, cmd, " ", testcase_repoid2str(pool, pool->installed->repoid));
1957 strqueue_push(&sq, cmd);
1958 s = testcase_getpoolflags(solv->pool);
1961 cmd = pool_tmpjoin(pool, "poolflags ", s, 0);
1962 strqueue_push(&sq, cmd);
1965 if (pool->vendorclasses)
1968 for (i = 0; pool->vendorclasses[i]; i++)
1970 cmd = pool_tmpappend(pool, cmd ? cmd : "vendorclass", " ", pool->vendorclasses[i]);
1971 if (!pool->vendorclasses[i + 1])
1973 strqueue_push(&sq, cmd);
1980 /* dump disabled packages (must come before the namespace/job lines) */
1981 if (pool->considered)
1984 FOR_POOL_SOLVABLES(p)
1985 if (!MAPTST(pool->considered, p))
1987 cmd = pool_tmpjoin(pool, "disable pkg ", testcase_solvid2str(pool, p), 0);
1988 strqueue_push(&sq, cmd);
1992 s = testcase_getsolverflags(solv);
1995 cmd = pool_tmpjoin(pool, "solverflags ", s, 0);
1996 strqueue_push(&sq, cmd);
1999 /* now dump all the ns callback values we know */
2000 if (pool->nscallback)
2004 for (rid = 1; rid < pool->nrels; rid++)
2006 Reldep *rd = pool->rels + rid;
2007 if (rd->flags != REL_NAMESPACE || rd->name == NAMESPACE_OTHERPROVIDERS)
2009 /* evaluate all namespace ids, skip empty results */
2010 d = pool_whatprovides(pool, MAKERELDEP(rid));
2011 if (!d || !pool->whatprovidesdata[d])
2013 cmd = pool_tmpjoin(pool, "namespace ", pool_id2str(pool, rd->name), "(");
2014 cmd = pool_tmpappend(pool, cmd, pool_id2str(pool, rd->evr), ")");
2015 for (; pool->whatprovidesdata[d]; d++)
2016 cmd = pool_tmpappend(pool, cmd, " ", testcase_solvid2str(pool, pool->whatprovidesdata[d]));
2017 strqueue_push(&sq, cmd);
2021 for (i = 0; i < solv->job.count; i += 2)
2023 cmd = (char *)testcase_job2str(pool, solv->job.elements[i], solv->job.elements[i + 1]);
2024 cmd = pool_tmpjoin(pool, "job ", cmd, 0);
2025 strqueue_push(&sq, cmd);
2032 for (i = 0; resultflags2str[i].str; i++)
2033 if ((resultflags & resultflags2str[i].flag) != 0)
2034 cmd = pool_tmpappend(pool, cmd, cmd ? "," : 0, resultflags2str[i].str);
2035 cmd = pool_tmpjoin(pool, "result ", cmd ? cmd : "?", 0);
2036 cmd = pool_tmpappend(pool, cmd, " ", resultname);
2037 strqueue_push(&sq, cmd);
2038 result = testcase_solverresult(solv, resultflags);
2039 if (!strcmp(resultname, "<inline>"))
2043 strqueue_init(&rsq);
2044 strqueue_split(&rsq, result);
2045 for (i = 0; i < rsq.nstr; i++)
2047 cmd = pool_tmpjoin(pool, "#>", rsq.str[i], 0);
2048 strqueue_push(&sq, cmd);
2050 strqueue_free(&rsq);
2054 out = pool_tmpjoin(pool, dir, "/", resultname);
2055 if (!(fp = fopen(out, "w")))
2057 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: could not open '%s' for writing\n", out);
2062 if (result && *result && fwrite(result, strlen(result), 1, fp) != 1)
2064 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: write error\n");
2072 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: write error\n");
2080 cmd = strqueue_join(&sq);
2081 out = pool_tmpjoin(pool, dir, "/", testcasename);
2082 if (!(fp = fopen(out, "w")))
2084 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: could not open '%s' for writing\n", out);
2088 if (*cmd && fwrite(cmd, strlen(cmd), 1, fp) != 1)
2090 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: write error\n");
2097 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: write error\n");
2107 read_inline_file(FILE *fp, char **bufp, char **bufpp, int *buflp)
2109 char *result = solv_malloc(1024);
2116 if (rp - result + 256 >= resultl)
2118 resultl = rp - result;
2119 result = solv_realloc(result, resultl + 1024);
2120 rp = result + resultl;
2123 if (!fgets(rp, resultl - (rp - result), fp))
2126 if (rl && (rp == result || rp[-1] == '\n'))
2128 if (rl > 1 && rp[0] == '#' && rp[1] == '>')
2130 memmove(rp, rp + 2, rl - 2);
2135 while (rl + 16 > *buflp)
2137 *bufp = solv_realloc(*bufp, *buflp + 512);
2140 memmove(*bufp, rp, rl);
2141 if ((*bufp)[rl - 1] == '\n')
2147 (*bufpp) = *bufp + rl;
2164 char *result = solv_malloc(1024);
2171 if (rp - result + 256 >= resultl)
2173 resultl = rp - result;
2174 result = solv_realloc(result, resultl + 1024);
2175 rp = result + resultl;
2178 rl = fread(rp, 1, resultl - (rp - result), fp);
2190 str2resultflags(Pool *pool, char *s) /* modifies the string! */
2192 int i, resultflags = 0;
2195 char *se = strchr(s, ',');
2198 for (i = 0; resultflags2str[i].str; i++)
2199 if (!strcmp(s, resultflags2str[i].str))
2201 resultflags |= resultflags2str[i].flag;
2204 if (!resultflags2str[i].str)
2205 pool_debug(pool, SOLV_ERROR, "result: unknown flag '%s'\n", s);
2212 testcase_read(Pool *pool, FILE *fp, char *testcase, Queue *job, char **resultp, int *resultflagsp)
2217 char *testcasedir, *s;
2223 int poolflagsreset = 0;
2225 if (!fp && !(fp = fopen(testcase, "r")))
2227 pool_debug(pool, SOLV_ERROR, "testcase_read: could not open '%s'\n", testcase);
2230 testcasedir = solv_strdup(testcase);
2231 if ((s = strrchr(testcasedir, '/')) != 0)
2236 buf = solv_malloc(bufl);
2241 if (bufp - buf + 16 > bufl)
2244 buf = solv_realloc(buf, bufl + 512);
2248 if (!fgets(bufp, bufl - (bufp - buf), fp))
2252 if (!l || buf[l - 1] != '\n')
2259 while (*s && (*s == ' ' || *s == '\t'))
2261 if (!*s || *s == '#')
2264 /* split it in pieces */
2267 while (*s == ' ' || *s == '\t')
2271 pieces = solv_extend(pieces, npieces, 1, sizeof(*pieces), 7);
2272 pieces[npieces++] = s;
2273 while (*s && *s != ' ' && *s != '\t')
2278 pieces = solv_extend(pieces, npieces, 1, sizeof(*pieces), 7);
2279 pieces[npieces] = 0;
2280 if (!strcmp(pieces[0], "repo") && npieces >= 4)
2282 Repo *repo = repo_create(pool, pieces[1]);
2288 if (!poolflagsreset)
2291 testcase_resetpoolflags(pool); /* hmm */
2293 if (sscanf(pieces[2], "%d.%d", &prio, &subprio) != 2)
2296 prio = atoi(pieces[2]);
2298 repo->priority = prio;
2299 repo->subpriority = subprio;
2300 if (strcmp(pieces[3], "empty") != 0)
2302 const char *repotype = pool_tmpjoin(pool, pieces[3], 0, 0); /* gets overwritten in <inline> case */
2303 if (!strcmp(pieces[4], "<inline>"))
2305 char *idata = read_inline_file(fp, &buf, &bufp, &bufl);
2307 rfp = solv_xfopen_buf(rdata, &idata, 0, "rf");
2311 rdata = pool_tmpjoin(pool, testcasedir, pieces[4], 0);
2312 rfp = solv_xfopen(rdata, "r");
2316 pool_debug(pool, SOLV_ERROR, "testcase_read: could not open '%s'\n", rdata);
2318 else if (!strcmp(repotype, "testtags"))
2320 testcase_add_testtags(repo, rfp, 0);
2323 else if (!strcmp(repotype, "solv"))
2325 repo_add_solv(repo, rfp, 0);
2329 else if (!strcmp(repotype, "helix"))
2331 extern int repo_add_helix(Repo *repo, FILE *fp, int flags);
2332 repo_add_helix(repo, rfp, 0);
2339 pool_debug(pool, SOLV_ERROR, "testcase_read: unknown repo type for repo '%s'\n", repo->name);
2343 else if (!strcmp(pieces[0], "system") && npieces >= 3)
2347 /* must set the disttype before the arch */
2348 for (i = 0; disttype2str[i].str != 0; i++)
2349 if (!strcmp(disttype2str[i].str, pieces[2]))
2351 if (!disttype2str[i].str)
2352 pool_debug(pool, SOLV_ERROR, "testcase_read: system: unknown disttype '%s'\n", pieces[2]);
2353 else if (pool->disttype != disttype2str[i].type)
2355 #ifdef MULTI_SEMANTICS
2356 pool_setdisttype(pool, disttype2str[i].type);
2358 pool_debug(pool, SOLV_ERROR, "testcase_read: system: cannot change disttype to '%s'\n", pieces[2]);
2361 if (strcmp(pieces[1], "unset") == 0)
2362 pool_setarch(pool, 0);
2363 else if (pieces[1][0] == ':')
2364 pool_setarchpolicy(pool, pieces[1] + 1);
2366 pool_setarch(pool, pieces[1]);
2369 Repo *repo = testcase_str2repo(pool, pieces[3]);
2371 pool_debug(pool, SOLV_ERROR, "testcase_read: system: unknown repo '%s'\n", pieces[3]);
2373 pool_set_installed(pool, repo);
2376 else if (!strcmp(pieces[0], "job") && npieces > 1)
2382 pool_addfileprovides(pool);
2383 pool_createwhatprovides(pool);
2386 if (npieces >= 3 && !strcmp(pieces[2], "selection"))
2388 addselectionjob(pool, pieces + 1, npieces - 1, job);
2392 for (sp = pieces[1]; sp < pieces[npieces - 1]; sp++)
2395 how = testcase_str2job(pool, pieces[1], &what);
2396 if (how >= 0 && job)
2397 queue_push2(job, how, what);
2399 else if (!strcmp(pieces[0], "vendorclass") && npieces > 1)
2401 pool_addvendorclass(pool, (const char **)(pieces + 1));
2403 else if (!strcmp(pieces[0], "namespace") && npieces > 1)
2405 int i = strlen(pieces[1]);
2406 s = strchr(pieces[1], '(');
2407 if (!s && pieces[1][i - 1] != ')')
2409 pool_debug(pool, SOLV_ERROR, "testcase_read: bad namespace '%s'\n", pieces[1]);
2417 pieces[1][i - 1] = 0;
2418 name = pool_str2id(pool, pieces[1], 1);
2419 evr = pool_str2id(pool, s + 1, 1);
2421 pieces[1][i - 1] = ')';
2422 id = pool_rel2id(pool, name, evr, REL_NAMESPACE, 1);
2423 for (i = 2; i < npieces; i++)
2424 queue_push(&q, testcase_str2solvid(pool, pieces[i]));
2425 /* now do the callback */
2428 pool_addfileprovides(pool);
2429 pool_createwhatprovides(pool);
2432 pool->whatprovides_rel[GETRELID(id)] = pool_queuetowhatprovides(pool, &q);
2436 else if (!strcmp(pieces[0], "poolflags"))
2439 if (!poolflagsreset)
2442 testcase_resetpoolflags(pool); /* hmm */
2444 for (i = 1; i < npieces; i++)
2445 testcase_setpoolflags(pool, pieces[i]);
2447 else if (!strcmp(pieces[0], "solverflags") && npieces > 1)
2452 solv = solver_create(pool);
2453 testcase_resetsolverflags(solv);
2455 for (i = 1; i < npieces; i++)
2456 testcase_setsolverflags(solv, pieces[i]);
2458 else if (!strcmp(pieces[0], "result") && npieces > 1)
2461 int resultflags = str2resultflags(pool, pieces[1]);
2465 rdata = pool_tmpjoin(pool, testcasedir, pieces[2], 0);
2466 if (!strcmp(pieces[2], "<inline>"))
2467 result = read_inline_file(fp, &buf, &bufp, &bufl);
2470 FILE *rfp = fopen(rdata, "r");
2472 pool_debug(pool, SOLV_ERROR, "testcase_read: could not open '%s'\n", rdata);
2475 result = read_file(rfp);
2485 *resultflagsp = resultflags;
2487 else if (!strcmp(pieces[0], "nextjob") && npieces == 1)
2491 else if (!strcmp(pieces[0], "disable") && npieces == 3)
2494 if (strcmp(pieces[1], "pkg"))
2496 pool_debug(pool, SOLV_ERROR, "testcase_read: bad disable type '%s'\n", pieces[1]);
2500 pool_createwhatprovides(pool);
2502 if (!pool->considered)
2504 pool->considered = solv_calloc(1, sizeof(Map));
2505 map_init(pool->considered, pool->nsolvables);
2506 map_setall(pool->considered);
2508 p = testcase_str2solvid(pool, pieces[2]);
2510 MAPCLR(pool->considered, p);
2512 pool_debug(pool, SOLV_ERROR, "disable: unknown package '%s'\n", pieces[2]);
2516 pool_debug(pool, SOLV_ERROR, "testcase_read: cannot parse command '%s'\n", pieces[0]);
2519 buf = solv_free(buf);
2520 pieces = solv_free(pieces);
2521 solv_free(testcasedir);
2524 pool_addfileprovides(pool);
2525 pool_createwhatprovides(pool);
2529 solv = solver_create(pool);
2530 testcase_resetsolverflags(solv);
2538 testcase_resultdiff(char *result1, char *result2)
2540 Strqueue sq1, sq2, osq;
2542 strqueue_init(&sq1);
2543 strqueue_init(&sq2);
2544 strqueue_init(&osq);
2545 strqueue_split(&sq1, result1);
2546 strqueue_split(&sq2, result2);
2547 strqueue_sort(&sq1);
2548 strqueue_sort(&sq2);
2549 strqueue_diff(&sq1, &sq2, &osq);
2550 r = osq.nstr ? strqueue_join(&osq) : 0;
2551 strqueue_free(&sq1);
2552 strqueue_free(&sq2);
2553 strqueue_free(&osq);