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" },
83 static struct solverflags2str {
87 } solverflags2str[] = {
88 { SOLVER_FLAG_ALLOW_DOWNGRADE, "allowdowngrade", 0 },
89 { SOLVER_FLAG_ALLOW_NAMECHANGE, "allownamechange", 1 },
90 { SOLVER_FLAG_ALLOW_ARCHCHANGE, "allowarchchange", 0 },
91 { SOLVER_FLAG_ALLOW_VENDORCHANGE, "allowvendorchange", 0 },
92 { SOLVER_FLAG_ALLOW_UNINSTALL, "allowuninstall", 0 },
93 { SOLVER_FLAG_NO_UPDATEPROVIDE, "noupdateprovide", 0 },
94 { SOLVER_FLAG_SPLITPROVIDES, "splitprovides", 0 },
95 { SOLVER_FLAG_IGNORE_RECOMMENDED, "ignorerecommended", 0 },
96 { SOLVER_FLAG_ADD_ALREADY_RECOMMENDED, "addalreadyrecommended", 0 },
97 { SOLVER_FLAG_NO_INFARCHCHECK, "noinfarchcheck", 0 },
98 { SOLVER_FLAG_KEEP_EXPLICIT_OBSOLETES, "keepexplicitobsoletes", 0 },
99 { SOLVER_FLAG_BEST_OBEY_POLICY, "bestobeypolicy", 0 },
100 { SOLVER_FLAG_NO_AUTOTARGET, "noautotarget", 0 },
101 { SOLVER_FLAG_DUP_ALLOW_DOWNGRADE, "dupallowdowngrade", 1 },
102 { SOLVER_FLAG_DUP_ALLOW_ARCHCHANGE, "dupallowarchchange", 1 },
103 { SOLVER_FLAG_DUP_ALLOW_VENDORCHANGE, "dupallowvendorchange", 1 },
104 { SOLVER_FLAG_DUP_ALLOW_NAMECHANGE, "dupallownamechange", 1 },
105 { SOLVER_FLAG_KEEP_ORPHANS, "keeporphans", 0 },
106 { SOLVER_FLAG_BREAK_ORPHANS, "breakorphans", 0 },
107 { SOLVER_FLAG_FOCUS_INSTALLED, "focusinstalled", 0 },
111 static struct poolflags2str {
115 } poolflags2str[] = {
116 { POOL_FLAG_PROMOTEEPOCH, "promoteepoch", 0 },
117 { POOL_FLAG_FORBIDSELFCONFLICTS, "forbidselfconflicts", 0 },
118 { POOL_FLAG_OBSOLETEUSESPROVIDES, "obsoleteusesprovides", 0 },
119 { POOL_FLAG_IMPLICITOBSOLETEUSESPROVIDES, "implicitobsoleteusesprovides", 0 },
120 { POOL_FLAG_OBSOLETEUSESCOLORS, "obsoleteusescolors", 0 },
121 { POOL_FLAG_IMPLICITOBSOLETEUSESCOLORS, "implicitobsoleteusescolors", 0 },
122 { POOL_FLAG_NOINSTALLEDOBSOLETES, "noinstalledobsoletes", 0 },
123 { POOL_FLAG_HAVEDISTEPOCH, "havedistepoch", 0 },
124 { POOL_FLAG_NOOBSOLETESMULTIVERSION, "noobsoletesmultiversion", 0 },
125 { POOL_FLAG_ADDFILEPROVIDESFILTERED, "addfileprovidesfiltered", 0 },
129 static struct disttype2str {
133 { DISTTYPE_RPM, "rpm" },
134 { DISTTYPE_DEB, "deb" },
135 { DISTTYPE_ARCH, "arch" },
136 { DISTTYPE_HAIKU, "haiku" },
140 static struct selflags2str {
144 { SELECTION_NAME, "name" },
145 { SELECTION_PROVIDES, "provides" },
146 { SELECTION_FILELIST, "filelist" },
147 { SELECTION_CANON, "canon" },
148 { SELECTION_DOTARCH, "dotarch" },
149 { SELECTION_REL, "rel" },
150 { SELECTION_INSTALLED_ONLY, "installedonly" },
151 { SELECTION_GLOB, "glob" },
152 { SELECTION_FLAT, "flat" },
153 { SELECTION_NOCASE, "nocase" },
154 { SELECTION_SOURCE_ONLY, "sourceonly" },
155 { SELECTION_WITH_SOURCE, "withsource" },
160 typedef struct strqueue {
165 #define STRQUEUE_BLOCK 63
168 strqueue_init(Strqueue *q)
175 strqueue_free(Strqueue *q)
178 for (i = 0; i < q->nstr; i++)
179 solv_free(q->str[i]);
180 q->str = solv_free(q->str);
185 strqueue_push(Strqueue *q, const char *s)
187 q->str = solv_extend(q->str, q->nstr, 1, sizeof(*q->str), STRQUEUE_BLOCK);
188 q->str[q->nstr++] = solv_strdup(s);
192 strqueue_pushjoin(Strqueue *q, const char *s1, const char *s2, const char *s3)
194 q->str = solv_extend(q->str, q->nstr, 1, sizeof(*q->str), STRQUEUE_BLOCK);
195 q->str[q->nstr++] = solv_dupjoin(s1, s2, s3);
199 strqueue_sort_cmp(const void *ap, const void *bp, void *dp)
201 const char *a = *(const char **)ap;
202 const char *b = *(const char **)bp;
203 return strcmp(a ? a : "", b ? b : "");
207 strqueue_sort(Strqueue *q)
210 solv_sort(q->str, q->nstr, sizeof(*q->str), strqueue_sort_cmp, 0);
214 strqueue_sort_u(Strqueue *q)
218 for (i = j = 0; i < q->nstr; i++)
219 if (!j || strqueue_sort_cmp(q->str + i, q->str + j - 1, 0) != 0)
220 q->str[j++] = q->str[i];
225 strqueue_join(Strqueue *q)
229 for (i = 0; i < q->nstr; i++)
231 l += strlen(q->str[i]) + 1;
232 l++; /* trailing \0 */
235 for (i = 0; i < q->nstr; i++)
238 strcpy(rp, q->str[i]);
247 strqueue_split(Strqueue *q, const char *s)
252 while ((p = strchr(s, '\n')) != 0)
254 q->str = solv_extend(q->str, q->nstr, 1, sizeof(*q->str), STRQUEUE_BLOCK);
255 q->str[q->nstr] = solv_malloc(p - s + 1);
257 memcpy(q->str[q->nstr], s, p - s);
258 q->str[q->nstr][p - s] = 0;
267 strqueue_diff(Strqueue *sq1, Strqueue *sq2, Strqueue *osq)
270 while (i < sq1->nstr && j < sq2->nstr)
272 int r = strqueue_sort_cmp(sq1->str + i, sq2->str + j, 0);
276 strqueue_pushjoin(osq, "-", sq1->str[i++], 0);
278 strqueue_pushjoin(osq, "+", sq2->str[j++], 0);
280 while (i < sq1->nstr)
281 strqueue_pushjoin(osq, "-", sq1->str[i++], 0);
282 while (j < sq2->nstr)
283 strqueue_pushjoin(osq, "+", sq2->str[j++], 0);
287 pool_isknownarch(Pool *pool, Id id)
289 if (!id || id == ID_EMPTY)
291 if (id == ARCH_SRC || id == ARCH_NOSRC || id == ARCH_NOARCH)
293 if (!pool->id2arch || (id > pool->lastarch || !pool->id2arch[id]))
299 testcase_str2dep_simple(Pool *pool, const char **sp)
306 while (*s == ' ' || *s == '\t')
309 while (*s && *s != ' ' && *s != '\t' && *s != '<' && *s != '=' && *s != '>')
313 while (*s && *s != ')')
319 if ((a = strchr(n, '.')) != 0 && a + 1 < s && s[-1] != ')')
321 Id archid = pool_strn2id(pool, a + 1, s - (a + 1), 0);
322 if (pool_isknownarch(pool, archid))
324 id = pool_strn2id(pool, n, a - n, 1);
325 id = pool_rel2id(pool, id, archid, REL_ARCH, 1);
328 id = pool_strn2id(pool, n, s - n, 1);
330 else if (s - n > 4 && s[-4] == ':' && !strncmp(s - 4, ":any", 4))
332 id = pool_strn2id(pool, n, s - n - 4, 1);
333 id = pool_rel2id(pool, id, ARCH_ANY, REL_MULTIARCH, 1);
336 id = pool_strn2id(pool, n, s - n, 1);
342 while (*s == ' ' || *s == '\t')
345 if (*s == '!' && s[1] == '=') /* support != as synonym for <> */
347 flags = REL_LT | REL_GT;
366 while (*s == ' ' || *s == '\t')
369 while (*s && *s != ' ' && *s != '\t')
371 evr = pool_strn2id(pool, n, s - n, 1);
372 if (*s == ' ' && !strcmp(s, " compat >= "))
375 while (*s == ' ' || *s == '\t')
378 while (*s && *s != ' ' && *s != '\t')
380 evr = pool_rel2id(pool, evr, pool_strn2id(pool, n, s - n, 1), REL_COMPAT, 1);
383 return pool_rel2id(pool, id, evr, flags, 1);
387 testcase_str2dep_complex(Pool *pool, const char **sp)
391 #ifdef ENABLE_COMPLEX_DEPS
392 while (*s == ' ' || *s == '\t')
397 id = testcase_str2dep_complex(pool, &s);
400 while (*s == ' ' || *s == '\t')
405 id = testcase_str2dep_simple(pool, &s);
409 id = pool_rel2id(pool, id, testcase_str2dep_complex(pool, &s), REL_OR, 1);
414 id = pool_rel2id(pool, id, testcase_str2dep_complex(pool, &s), REL_AND, 1);
416 else if (*s == 'I' && s[1] == 'F' && (s[2] == ' ' || s[2] == '\t'))
419 id = pool_rel2id(pool, id, testcase_str2dep_complex(pool, &s), REL_COND, 1);
426 testcase_str2dep(Pool *pool, const char *s)
428 return testcase_str2dep_complex(pool, &s);
432 testcase_repoid2str(Pool *pool, Id repoid)
434 Repo *repo = pool_id2repo(pool, repoid);
437 char *r = pool_tmpjoin(pool, repo->name, 0, 0);
439 for (rp = r; *rp; rp++)
440 if (*rp == ' ' || *rp == '\t')
447 sprintf(buf, "#%d", repoid);
448 return pool_tmpjoin(pool, buf, 0, 0);
453 testcase_solvid2str(Pool *pool, Id p)
455 Solvable *s = pool->solvables + p;
456 const char *n, *e, *a;
459 if (p == SYSTEMSOLVABLE)
461 n = pool_id2str(pool, s->name);
462 e = pool_id2str(pool, s->evr);
463 a = pool_id2str(pool, s->arch);
464 str = pool_alloctmpspace(pool, strlen(n) + strlen(e) + strlen(a) + 3);
465 sprintf(str, "%s-%s.%s", n, e, a);
467 return pool_tmpappend(pool, str, "@", 0);
471 char *str2 = pool_tmpappend(pool, str, "@", s->repo->name);
473 if (str2[l] == ' ' || str2[l] == '\t')
477 sprintf(buf, "@#%d", s->repo->repoid);
478 return pool_tmpappend(pool, str, buf, 0);
482 testcase_str2repo(Pool *pool, const char *str)
486 if (str[0] == '#' && (str[1] >= '0' && str[1] <= '9'))
490 for (j = 1; str[j] >= '0' && str[j] <= '9'; j++)
491 repoid = repoid * 10 + (str[j] - '0');
492 if (!str[j] && repoid > 0 && repoid < pool->nrepos)
493 repo = pool_id2repo(pool, repoid);
497 FOR_REPOS(repoid, repo)
502 l = strlen(repo->name);
503 for (i = 0; i < l; i++)
505 int c = repo->name[i];
506 if (c == ' ' || c == '\t')
511 if (i == l && !str[l])
514 if (repoid >= pool->nrepos)
521 testcase_str2solvid(Pool *pool, const char *str)
523 int i, l = strlen(str);
530 if (*str == '@' && !strcmp(str, "@SYSTEM"))
531 return SYSTEMSOLVABLE;
533 for (i = l - 1; i >= 0; i--)
534 if (str[i] == '@' && (repo = testcase_str2repo(pool, str + i + 1)) != 0)
539 /* now find the arch (if present) */
541 for (i = repostart - 1; i > 0; i--)
544 arch = pool_strn2id(pool, str + i + 1, repostart - (i + 1), 0);
549 /* now find the name */
550 for (i = repostart - 1; i > 0; i--)
554 Id nid, evrid, p, pp;
555 nid = pool_strn2id(pool, str, i, 0);
558 evrid = pool_strn2id(pool, str + i + 1, repostart - (i + 1), 0);
561 FOR_PROVIDES(p, pp, nid)
563 Solvable *s = pool->solvables + p;
564 if (s->name != nid || s->evr != evrid)
566 if (repo && s->repo != repo)
568 if (arch && s->arch != arch)
578 testcase_job2str(Pool *pool, Id how, Id what)
585 Id select = how & SOLVER_SELECTMASK;
587 for (i = 0; job2str[i].str; i++)
588 if ((how & SOLVER_JOBMASK) == job2str[i].job)
590 jobstr = job2str[i].str ? job2str[i].str : "unknown";
591 if (select == SOLVER_SOLVABLE)
594 pkgstr = testcase_solvid2str(pool, what);
596 else if (select == SOLVER_SOLVABLE_NAME)
599 pkgstr = pool_dep2str(pool, what);
601 else if (select == SOLVER_SOLVABLE_PROVIDES)
603 selstr = " provides ";
604 pkgstr = pool_dep2str(pool, what);
606 else if (select == SOLVER_SOLVABLE_ONE_OF)
611 while ((p = pool->whatprovidesdata[what++]) != 0)
613 const char *s = testcase_solvid2str(pool, p);
616 pkgstr = pool_tmpappend(pool, pkgstr, " ", s);
617 pool_freetmpspace(pool, s);
625 else if (select == SOLVER_SOLVABLE_REPO)
627 Repo *repo = pool_id2repo(pool, what);
632 sprintf(buf, "#%d", repo->repoid);
633 pkgstr = pool_tmpjoin(pool, buf, 0, 0);
636 pkgstr = pool_tmpjoin(pool, repo->name, 0, 0);
638 else if (select == SOLVER_SOLVABLE_ALL)
645 selstr = " unknown ";
648 ret = pool_tmpjoin(pool, jobstr, selstr, pkgstr);
650 ret = pool_tmpappend(pool, ret, " ", 0);
651 for (i = 0; jobflags2str[i].str; i++)
652 if ((how & jobflags2str[i].flag) != 0)
653 ret = pool_tmpappend(pool, ret, ",", jobflags2str[i].str);
659 ret = pool_tmpappend(pool, ret, "]", 0);
665 str2selflags(Pool *pool, char *s) /* modifies the string! */
670 char *se = strchr(s, ',');
673 for (i = 0; selflags2str[i].str; i++)
674 if (!strcmp(s, selflags2str[i].str))
676 selflags |= selflags2str[i].flag;
679 if (!selflags2str[i].str)
680 pool_debug(pool, SOLV_ERROR, "str2job: unknown selection flag '%s'\n", s);
687 str2jobflags(Pool *pool, char *s) /* modifies the string */
692 char *se = strchr(s, ',');
695 for (i = 0; jobflags2str[i].str; i++)
696 if (!strcmp(s, jobflags2str[i].str))
698 jobflags |= jobflags2str[i].flag;
701 if (!jobflags2str[i].str)
702 pool_debug(pool, SOLV_ERROR, "str2job: unknown job flag '%s'\n", s);
709 testcase_str2job(Pool *pool, const char *str, Id *whatp)
719 /* so we can patch it */
720 s = pool_tmpjoin(pool, str, 0, 0);
721 /* split it in pieces */
724 while (*s == ' ' || *s == '\t')
728 pieces = solv_extend(pieces, npieces, 1, sizeof(*pieces), 7);
729 pieces[npieces++] = s;
730 while (*s && *s != ' ' && *s != '\t')
737 pool_debug(pool, SOLV_ERROR, "str2job: bad line '%s'\n", str);
742 for (i = 0; job2str[i].str; i++)
743 if (!strcmp(pieces[0], job2str[i].str))
747 pool_debug(pool, SOLV_ERROR, "str2job: unknown job '%s'\n", str);
751 job = job2str[i].job;
755 char *flags = pieces[npieces - 1];
756 if (*flags == '[' && flags[strlen(flags) - 1] == ']')
760 flags[strlen(flags) - 1] = 0;
761 job |= str2jobflags(pool, flags);
764 if (!strcmp(pieces[1], "pkg"))
768 pool_debug(pool, SOLV_ERROR, "str2job: bad pkg selector in '%s'\n", str);
772 job |= SOLVER_SOLVABLE;
773 what = testcase_str2solvid(pool, pieces[2]);
776 pool_debug(pool, SOLV_ERROR, "str2job: unknown package '%s'\n", pieces[2]);
781 else if (!strcmp(pieces[1], "name") || !strcmp(pieces[1], "provides"))
783 /* join em again for dep2str... */
785 for (sp = pieces[2]; sp < pieces[npieces - 1]; sp++)
789 if (pieces[1][0] == 'p' && strncmp(pieces[2], "namespace:", 10) == 0)
791 char *spe = strchr(pieces[2], '(');
792 int l = strlen(pieces[2]);
793 if (spe && pieces[2][l - 1] == ')')
795 /* special namespace provides */
796 if (strcmp(spe, "(<NULL>)") != 0)
798 pieces[2][l - 1] = 0;
799 what = testcase_str2dep(pool, spe + 1);
800 pieces[2][l - 1] = ')';
802 what = pool_rel2id(pool, pool_strn2id(pool, pieces[2], spe - pieces[2], 1), what, REL_NAMESPACE, 1);
806 what = testcase_str2dep(pool, pieces[2]);
807 if (pieces[1][0] == 'n')
808 job |= SOLVER_SOLVABLE_NAME;
810 job |= SOLVER_SOLVABLE_PROVIDES;
812 else if (!strcmp(pieces[1], "oneof"))
815 job |= SOLVER_SOLVABLE_ONE_OF;
817 if (npieces > 3 && strcmp(pieces[2], "nothing") != 0)
819 for (i = 2; i < npieces; i++)
821 Id p = testcase_str2solvid(pool, pieces[i]);
824 pool_debug(pool, SOLV_ERROR, "str2job: unknown package '%s'\n", pieces[i]);
832 what = pool_queuetowhatprovides(pool, &q);
835 else if (!strcmp(pieces[1], "repo"))
840 pool_debug(pool, SOLV_ERROR, "str2job: bad line '%s'\n", str);
844 repo = testcase_str2repo(pool, pieces[2]);
847 pool_debug(pool, SOLV_ERROR, "str2job: unknown repo '%s'\n", pieces[2]);
851 job |= SOLVER_SOLVABLE_REPO;
854 else if (!strcmp(pieces[1], "all"))
856 if (npieces != 3 && strcmp(pieces[2], "packages") != 0)
858 pool_debug(pool, SOLV_ERROR, "str2job: bad line '%s'\n", str);
862 job |= SOLVER_SOLVABLE_ALL;
867 pool_debug(pool, SOLV_ERROR, "str2job: unknown selection in '%s'\n", str);
877 addselectionjob(Pool *pool, char **pieces, int npieces, Queue *jobqueue)
884 for (i = 0; job2str[i].str; i++)
885 if (!strcmp(pieces[0], job2str[i].str))
889 pool_debug(pool, SOLV_ERROR, "selstr2job: unknown job '%s'\n", pieces[0]);
892 job = job2str[i].job;
895 char *flags = pieces[npieces - 1];
896 if (*flags == '[' && flags[strlen(flags) - 1] == ']')
900 flags[strlen(flags) - 1] = 0;
901 job |= str2jobflags(pool, flags);
906 pool_debug(pool, SOLV_ERROR, "selstr2job: no selection flags\n");
909 selflags = str2selflags(pool, pieces[3]);
911 r = selection_make(pool, &sel, pieces[2], selflags);
912 for (i = 0; i < sel.count; i += 2)
913 queue_push2(jobqueue, job | sel.elements[i], sel.elements[i + 1]);
919 writedeps(Repo *repo, FILE *fp, const char *tag, Id key, Solvable *s, Offset off)
921 Pool *pool = repo->pool;
928 dp = repo->idarraydata + off;
930 while ((id = *dp++) != 0)
932 if (key == SOLVABLE_REQUIRES && id == SOLVABLE_PREREQMARKER)
935 fprintf(fp, "-%s\n", tag);
940 if (key == SOLVABLE_PROVIDES && id == SOLVABLE_FILEMARKER)
945 idstr = pool_dep2str(pool, id);
948 Reldep *rd = GETRELDEP(pool, id);
949 if (key == SOLVABLE_CONFLICTS && rd->flags == REL_NAMESPACE && rd->name == NAMESPACE_OTHERPROVIDERS)
951 if (!strncmp(idstr, "namespace:", 10))
954 if (key == SOLVABLE_SUPPLEMENTS)
956 if (rd->flags == REL_NAMESPACE && rd->name == NAMESPACE_FILESYSTEM)
958 if (!strncmp(idstr, "namespace:", 10))
961 else if (rd->flags == REL_NAMESPACE && rd->name == NAMESPACE_MODALIAS)
963 if (!strncmp(idstr, "namespace:", 10))
966 else if (rd->flags == REL_AND)
968 /* either packageand chain or modalias */
970 if (ISRELDEP(rd->evr))
972 Reldep *mrd = GETRELDEP(pool, rd->evr);
973 if (mrd->flags == REL_NAMESPACE && mrd->name == NAMESPACE_MODALIAS)
975 idstr = pool_tmpjoin(pool, "modalias(", pool_dep2str(pool, rd->name), ":");
976 idstr = pool_tmpappend(pool, idstr, pool_dep2str(pool, mrd->evr), ")");
978 else if (mrd->flags >= 8)
983 /* must be and chain */
984 idstr = pool_dep2str(pool, rd->evr);
990 rd = GETRELDEP(pool, id);
991 if (rd->flags != REL_AND)
993 idstr = pool_tmpjoin(pool, pool_dep2str(pool, rd->evr), ":", idstr);
995 idstr = pool_tmpjoin(pool, pool_dep2str(pool, id), ":", idstr);
996 idstr = pool_tmpjoin(pool, "packageand(", idstr, ")");
999 else if (rd->flags >= 8)
1005 fprintf(fp, "+%s\n", tag);
1008 fprintf(fp, "%s\n", idstr);
1010 if (key == SOLVABLE_PROVIDES)
1012 /* add the filelist */
1014 dataiterator_init(&di, pool, repo, s - pool->solvables, SOLVABLE_FILELIST, 0, 0);
1015 while (dataiterator_step(&di))
1017 const char *s = repodata_dir2str(di.data, di.kv.id, di.kv.str);
1020 Id id = pool_str2id(pool, s, 0);
1023 for (dp = prvdp; *dp; dp++)
1027 continue; /* already included */
1032 fprintf(fp, "+%s", tag);
1035 fprintf(fp, "%s\n", s);
1039 fprintf(fp, "-%s\n", tag);
1043 testcase_write_testtags(Repo *repo, FILE *fp)
1045 Pool *pool = repo->pool;
1051 const char *release;
1055 fprintf(fp, "=Ver: 2.0\n");
1056 FOR_REPO_SOLVABLES(repo, p, s)
1058 name = pool_id2str(pool, s->name);
1059 evr = pool_id2str(pool, s->evr);
1060 arch = pool_id2str(pool, s->arch);
1061 release = strrchr(evr, '-');
1063 release = evr + strlen(evr);
1064 fprintf(fp, "=Pkg: %s %.*s %s %s\n", name, (int)(release - evr), evr, *release && release[1] ? release + 1 : "-", arch);
1065 tmp = solvable_lookup_str(s, SOLVABLE_SUMMARY);
1067 fprintf(fp, "=Sum: %s\n", tmp);
1068 writedeps(repo, fp, "Req:", SOLVABLE_REQUIRES, s, s->requires);
1069 writedeps(repo, fp, "Prv:", SOLVABLE_PROVIDES, s, s->provides);
1070 writedeps(repo, fp, "Obs:", SOLVABLE_OBSOLETES, s, s->obsoletes);
1071 writedeps(repo, fp, "Con:", SOLVABLE_CONFLICTS, s, s->conflicts);
1072 writedeps(repo, fp, "Rec:", SOLVABLE_RECOMMENDS, s, s->recommends);
1073 writedeps(repo, fp, "Sup:", SOLVABLE_SUPPLEMENTS, s, s->supplements);
1074 writedeps(repo, fp, "Sug:", SOLVABLE_SUGGESTS, s, s->suggests);
1075 writedeps(repo, fp, "Enh:", SOLVABLE_ENHANCES, s, s->enhances);
1077 fprintf(fp, "=Vnd: %s\n", pool_id2str(pool, s->vendor));
1078 ti = solvable_lookup_num(s, SOLVABLE_BUILDTIME, 0);
1080 fprintf(fp, "=Tim: %u\n", ti);
1085 static inline Offset
1086 adddep(Repo *repo, Offset olddeps, char *str, Id marker)
1088 Id id = *str == '/' ? pool_str2id(repo->pool, str, 1) : testcase_str2dep(repo->pool, str);
1089 return repo_addid_dep(repo, olddeps, id, marker);
1093 finish_solvable(Pool *pool, Repodata *data, Solvable *s, char *filelist, int nfilelist)
1099 for (l = 0; l < nfilelist; l += strlen(filelist + l) + 1)
1101 char *p = strrchr(filelist + l, '/');
1105 did = repodata_str2dir(data, filelist + l, 1);
1108 did = repodata_str2dir(data, "/", 1);
1109 repodata_add_dirstr(data, s - pool->solvables, SOLVABLE_FILELIST, did, p);
1112 if (s->name && s->arch != ARCH_SRC && s->arch != ARCH_NOSRC)
1113 s->provides = repo_addid_dep(s->repo, s->provides, pool_rel2id(pool, s->name, s->evr, REL_EQ, 1), 0);
1114 s->supplements = repo_fix_supplements(s->repo, s->provides, s->supplements, 0);
1115 s->conflicts = repo_fix_conflicts(s->repo, s->conflicts);
1118 /* stripped down version of susetags parser used for testcases */
1120 testcase_add_testtags(Repo *repo, FILE *fp, int flags)
1122 Pool *pool = repo->pool;
1135 data = repo_add_repodata(repo, flags);
1140 line = solv_malloc(aline);
1144 if (linep - line + 16 > aline)
1146 aline = linep - line;
1147 line = solv_realloc(line, aline + 512);
1148 linep = line + aline;
1151 if (!fgets(linep, aline - (linep - line), fp))
1153 linep += strlen(linep);
1154 if (linep == line || linep[-1] != '\n')
1157 linep = line + intag;
1160 if (line[intag] == '-' && !strncmp(line + 1, line + intag + 1, intag - 2))
1167 else if (line[0] == '+' && line[1] && line[1] != ':')
1169 char *tagend = strchr(line, ':');
1174 intag = tagend + 2 - line;
1175 linep = line + intag;
1178 if (*line != '=' || !line[1] || !line[2] || !line[3] || line[4] != ':')
1180 tag = line[1] << 16 | line[2] << 8 | line[3];
1183 case 'P' << 16 | 'k' << 8 | 'g':
1185 finish_solvable(pool, data, s, filelist, nfilelist);
1187 if (split(line + 5, sp, 5) != 4)
1189 s = pool_id2solvable(pool, repo_add_solvable(repo));
1190 s->name = pool_str2id(pool, sp[0], 1);
1191 /* join back version and release */
1192 if (sp[2] && !(sp[2][0] == '-' && !sp[2][1]))
1194 s->evr = makeevr(pool, sp[1]);
1195 s->arch = pool_str2id(pool, sp[3], 1);
1197 case 'S' << 16 | 'u' << 8 | 'm':
1198 repodata_set_str(data, s - pool->solvables, SOLVABLE_SUMMARY, line + 6);
1200 case 'V' << 16 | 'n' << 8 | 'd':
1201 s->vendor = pool_str2id(pool, line + 6, 1);
1203 case 'T' << 16 | 'i' << 8 | 'm':
1206 repodata_set_num(data, s - pool->solvables, SOLVABLE_BUILDTIME, t);
1208 case 'R' << 16 | 'e' << 8 | 'q':
1209 s->requires = adddep(repo, s->requires, line + 6, -SOLVABLE_PREREQMARKER);
1211 case 'P' << 16 | 'r' << 8 | 'q':
1212 s->requires = adddep(repo, s->requires, line + 6, SOLVABLE_PREREQMARKER);
1214 case 'P' << 16 | 'r' << 8 | 'v':
1217 int l = strlen(line + 6) + 1;
1218 if (nfilelist + l > afilelist)
1220 afilelist = nfilelist + l + 512;
1221 filelist = solv_realloc(filelist, afilelist);
1223 memcpy(filelist + nfilelist, line + 6, l);
1230 for (l = 0; l < nfilelist; l += strlen(filelist + l) + 1)
1231 s->provides = repo_addid_dep(repo, s->provides, pool_str2id(pool, filelist + l, 1), 0);
1234 s->provides = adddep(repo, s->provides, line + 6, 0);
1236 case 'O' << 16 | 'b' << 8 | 's':
1237 s->obsoletes = adddep(repo, s->obsoletes, line + 6, 0);
1239 case 'C' << 16 | 'o' << 8 | 'n':
1240 s->conflicts = adddep(repo, s->conflicts, line + 6, 0);
1242 case 'R' << 16 | 'e' << 8 | 'c':
1243 s->recommends = adddep(repo, s->recommends, line + 6, 0);
1245 case 'S' << 16 | 'u' << 8 | 'p':
1246 s->supplements = adddep(repo, s->supplements, line + 6, 0);
1248 case 'S' << 16 | 'u' << 8 | 'g':
1249 s->suggests = adddep(repo, s->suggests, line + 6, 0);
1251 case 'E' << 16 | 'n' << 8 | 'h':
1252 s->enhances = adddep(repo, s->enhances, line + 6, 0);
1259 finish_solvable(pool, data, s, filelist, nfilelist);
1261 solv_free(filelist);
1262 repodata_free_dircache(data);
1263 if (!(flags & REPO_NO_INTERNALIZE))
1264 repodata_internalize(data);
1269 testcase_getpoolflags(Pool *pool)
1271 const char *str = 0;
1273 for (i = 0; poolflags2str[i].str; i++)
1275 v = pool_get_flag(pool, poolflags2str[i].flag);
1276 if (v == poolflags2str[i].def)
1278 str = pool_tmpappend(pool, str, v ? " " : " !", poolflags2str[i].str);
1280 return str ? str + 1 : "";
1284 testcase_setpoolflags(Pool *pool, const char *str)
1286 const char *p = str, *s;
1290 while (*p == ' ' || *p == '\t' || *p == ',')
1301 while (*p && *p != ' ' && *p != '\t' && *p != ',')
1303 for (i = 0; poolflags2str[i].str; i++)
1304 if (!strncmp(poolflags2str[i].str, s, p - s) && poolflags2str[i].str[p - s] == 0)
1306 if (!poolflags2str[i].str)
1308 pool_debug(pool, SOLV_ERROR, "setpoolflags: unknown flag '%.*s'\n", (int)(p - s), s);
1311 pool_set_flag(pool, poolflags2str[i].flag, v);
1317 testcase_resetpoolflags(Pool *pool)
1320 for (i = 0; poolflags2str[i].str; i++)
1321 pool_set_flag(pool, poolflags2str[i].flag, poolflags2str[i].def);
1325 testcase_getsolverflags(Solver *solv)
1327 Pool *pool = solv->pool;
1328 const char *str = 0;
1330 for (i = 0; solverflags2str[i].str; i++)
1332 v = solver_get_flag(solv, solverflags2str[i].flag);
1333 if (v == solverflags2str[i].def)
1335 str = pool_tmpappend(pool, str, v ? " " : " !", solverflags2str[i].str);
1337 return str ? str + 1 : "";
1341 testcase_setsolverflags(Solver *solv, const char *str)
1343 const char *p = str, *s;
1347 while (*p == ' ' || *p == '\t' || *p == ',')
1358 while (*p && *p != ' ' && *p != '\t' && *p != ',')
1360 for (i = 0; solverflags2str[i].str; i++)
1361 if (!strncmp(solverflags2str[i].str, s, p - s) && solverflags2str[i].str[p - s] == 0)
1363 if (!solverflags2str[i].str)
1365 pool_debug(solv->pool, SOLV_ERROR, "setsolverflags: unknown flag '%.*s'\n", (int)(p - s), s);
1368 solver_set_flag(solv, solverflags2str[i].flag, v);
1374 testcase_resetsolverflags(Solver *solv)
1377 for (i = 0; solverflags2str[i].str; i++)
1378 solver_set_flag(solv, solverflags2str[i].flag, solverflags2str[i].def);
1382 testcase_ruleid(Solver *solv, Id rid)
1388 const unsigned char *md5;
1394 solver_ruleliterals(solv, rid, &q);
1395 for (i = 0; i < q.count; i++)
1397 Id p = q.elements[i];
1398 s = testcase_solvid2str(solv->pool, p > 0 ? p : -p);
1400 s = pool_tmpjoin(solv->pool, "!", s, 0);
1401 strqueue_push(&sq, s);
1404 strqueue_sort_u(&sq);
1405 chk = solv_chksum_create(REPOKEY_TYPE_MD5);
1406 for (i = 0; i < sq.nstr; i++)
1407 solv_chksum_add(chk, sq.str[i], strlen(sq.str[i]) + 1);
1408 md5 = solv_chksum_get(chk, &md5l);
1409 s = pool_bin2hex(solv->pool, md5, md5l);
1410 chk = solv_chksum_free(chk, 0);
1416 testcase_problemid(Solver *solv, Id problem)
1421 const unsigned char *md5;
1425 /* we build a hash of all rules that define the problem */
1428 solver_findallproblemrules(solv, problem, &q);
1429 for (i = 0; i < q.count; i++)
1430 strqueue_push(&sq, testcase_ruleid(solv, q.elements[i]));
1432 strqueue_sort_u(&sq);
1433 chk = solv_chksum_create(REPOKEY_TYPE_MD5);
1434 for (i = 0; i < sq.nstr; i++)
1435 solv_chksum_add(chk, sq.str[i], strlen(sq.str[i]) + 1);
1436 md5 = solv_chksum_get(chk, &md5l);
1437 s = pool_bin2hex(solv->pool, md5, 4);
1438 chk = solv_chksum_free(chk, 0);
1444 testcase_solutionid(Solver *solv, Id problem, Id solution)
1448 const unsigned char *md5;
1452 intid = solver_solutionelement_internalid(solv, problem, solution);
1453 /* internal stuff! handle with care! */
1457 s = testcase_job2str(solv->pool, solv->job.elements[-intid - 1], solv->job.elements[-intid]);
1462 s = testcase_ruleid(solv, intid);
1464 chk = solv_chksum_create(REPOKEY_TYPE_MD5);
1465 solv_chksum_add(chk, s, strlen(s) + 1);
1466 md5 = solv_chksum_get(chk, &md5l);
1467 s = pool_bin2hex(solv->pool, md5, 4);
1468 chk = solv_chksum_free(chk, 0);
1472 static struct class2str {
1476 { SOLVER_TRANSACTION_ERASE, "erase" },
1477 { SOLVER_TRANSACTION_INSTALL, "install" },
1478 { SOLVER_TRANSACTION_REINSTALLED, "reinstall" },
1479 { SOLVER_TRANSACTION_DOWNGRADED, "downgrade" },
1480 { SOLVER_TRANSACTION_CHANGED, "change" },
1481 { SOLVER_TRANSACTION_UPGRADED, "upgrade" },
1482 { SOLVER_TRANSACTION_OBSOLETED, "obsolete" },
1483 { SOLVER_TRANSACTION_MULTIINSTALL, "multiinstall" },
1484 { SOLVER_TRANSACTION_MULTIREINSTALL, "multireinstall" },
1489 testcase_solverresult(Solver *solv, int resultflags)
1491 Pool *pool = solv->pool;
1499 if ((resultflags & TESTCASE_RESULT_TRANSACTION) != 0)
1501 Transaction *trans = solver_create_transaction(solv);
1505 for (i = 0; class2str[i].str; i++)
1508 transaction_classify_pkgs(trans, SOLVER_TRANSACTION_KEEP_PSEUDO, class2str[i].class, 0, 0, &q);
1509 for (j = 0; j < q.count; j++)
1513 if (pool->installed && pool->solvables[p].repo == pool->installed)
1514 op = transaction_obs_pkg(trans, p);
1515 s = pool_tmpjoin(pool, class2str[i].str, " ", testcase_solvid2str(pool, p));
1517 s = pool_tmpjoin(pool, s, " ", testcase_solvid2str(pool, op));
1518 strqueue_push(&sq, s);
1522 transaction_free(trans);
1524 if ((resultflags & TESTCASE_RESULT_PROBLEMS) != 0)
1526 char *probprefix, *solprefix;
1527 int problem, solution, element;
1530 pcnt = solver_problem_count(solv);
1531 for (problem = 1; problem <= pcnt; problem++)
1533 Id rid, from, to, dep;
1534 SolverRuleinfo rinfo;
1535 rid = solver_findproblemrule(solv, problem);
1536 s = testcase_problemid(solv, problem);
1537 probprefix = solv_dupjoin("problem ", s, 0);
1538 rinfo = solver_ruleinfo(solv, rid, &from, &to, &dep);
1539 s = pool_tmpjoin(pool, probprefix, " info ", solver_problemruleinfo2str(solv, rinfo, from, to, dep));
1540 strqueue_push(&sq, s);
1541 scnt = solver_solution_count(solv, problem);
1542 for (solution = 1; solution <= scnt; solution++)
1544 s = testcase_solutionid(solv, problem, solution);
1545 solprefix = solv_dupjoin(probprefix, " solution ", s);
1547 while ((element = solver_next_solutionelement(solv, problem, solution, element, &p, &op)) != 0)
1549 if (p == SOLVER_SOLUTION_JOB)
1550 s = pool_tmpjoin(pool, solprefix, " deljob ", testcase_job2str(pool, solv->job.elements[op - 1], solv->job.elements[op]));
1551 else if (p > 0 && op == 0)
1552 s = pool_tmpjoin(pool, solprefix, " erase ", testcase_solvid2str(pool, p));
1553 else if (p > 0 && op > 0)
1555 s = pool_tmpjoin(pool, solprefix, " replace ", testcase_solvid2str(pool, p));
1556 s = pool_tmpappend(pool, s, " ", testcase_solvid2str(pool, op));
1558 else if (p < 0 && op > 0)
1559 s = pool_tmpjoin(pool, solprefix, " allow ", testcase_solvid2str(pool, op));
1561 s = pool_tmpjoin(pool, solprefix, " unknown", 0);
1562 strqueue_push(&sq, s);
1564 solv_free(solprefix);
1566 solv_free(probprefix);
1570 if ((resultflags & TESTCASE_RESULT_ORPHANED) != 0)
1575 solver_get_orphaned(solv, &q);
1576 for (i = 0; i < q.count; i++)
1578 s = pool_tmpjoin(pool, "orphaned ", testcase_solvid2str(pool, q.elements[i]), 0);
1579 strqueue_push(&sq, s);
1584 if ((resultflags & TESTCASE_RESULT_RECOMMENDED) != 0)
1590 solver_get_recommendations(solv, &qr, &qs, 0);
1591 for (i = 0; i < qr.count; i++)
1593 s = pool_tmpjoin(pool, "recommended ", testcase_solvid2str(pool, qr.elements[i]), 0);
1594 strqueue_push(&sq, s);
1596 for (i = 0; i < qs.count; i++)
1598 s = pool_tmpjoin(pool, "suggested ", testcase_solvid2str(pool, qs.elements[i]), 0);
1599 strqueue_push(&sq, s);
1605 if ((resultflags & TESTCASE_RESULT_UNNEEDED) != 0)
1611 solver_get_unneeded(solv, &q, 0);
1612 solver_get_unneeded(solv, &qf, 1);
1613 for (i = j = 0; i < q.count; i++)
1615 /* we rely on qf containing a subset of q in the same order */
1616 if (j < qf.count && q.elements[i] == qf.elements[j])
1618 s = pool_tmpjoin(pool, "unneeded_filtered ", testcase_solvid2str(pool, q.elements[i]), 0);
1622 s = pool_tmpjoin(pool, "unneeded ", testcase_solvid2str(pool, q.elements[i]), 0);
1623 strqueue_push(&sq, s);
1630 result = strqueue_join(&sq);
1637 testcase_write(Solver *solv, char *dir, int resultflags, const char *testcasename, const char *resultname)
1639 Pool *pool = solv->pool;
1650 testcasename = "testcase.t";
1652 resultname = "solver.result";
1654 if (mkdir(dir, 0777) && errno != EEXIST)
1656 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: could not create directory '%s'\n", dir);
1660 FOR_REPOS(repoid, repo)
1662 const char *name = testcase_repoid2str(pool, repoid);
1664 if (repo->subpriority)
1665 sprintf(priobuf, "%d.%d", repo->priority, repo->subpriority);
1667 sprintf(priobuf, "%d", repo->priority);
1668 out = pool_tmpjoin(pool, name, ".repo", ".gz");
1669 cmd = pool_tmpjoin(pool, "repo ", name, " ");
1670 cmd = pool_tmpappend(pool, cmd, priobuf, " ");
1671 cmd = pool_tmpappend(pool, cmd, "testtags ", out);
1672 strqueue_push(&sq, cmd);
1673 out = pool_tmpjoin(pool, dir, "/", out);
1674 if (!(fp = solv_xfopen(out, "w")))
1676 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: could not open '%s' for writing\n", out);
1680 testcase_write_testtags(repo, fp);
1683 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: write error\n");
1688 /* hmm, this is not optimal... we currently search for the lowest score */
1690 arch = pool->solvables[SYSTEMSOLVABLE].arch;
1691 for (i = 0; i < pool->lastarch; i++)
1693 if (pool->id2arch[i] == 1 && !lowscore)
1695 if (pool->id2arch[i] > 0x10000 && (!lowscore || pool->id2arch[i] < lowscore))
1698 lowscore = pool->id2arch[i];
1701 cmd = pool_tmpjoin(pool, "system ", pool->lastarch ? pool_id2str(pool, arch) : "unset", 0);
1702 for (i = 0; disttype2str[i].str != 0; i++)
1703 if (pool->disttype == disttype2str[i].type)
1705 pool_tmpappend(pool, cmd, " ", disttype2str[i].str ? disttype2str[i].str : "unknown");
1706 if (pool->installed)
1707 cmd = pool_tmpappend(pool, cmd, " ", testcase_repoid2str(pool, pool->installed->repoid));
1708 strqueue_push(&sq, cmd);
1709 s = testcase_getpoolflags(solv->pool);
1712 cmd = pool_tmpjoin(pool, "poolflags ", s, 0);
1713 strqueue_push(&sq, cmd);
1716 if (pool->vendorclasses)
1719 for (i = 0; pool->vendorclasses[i]; i++)
1721 cmd = pool_tmpappend(pool, cmd ? cmd : "vendorclass", " ", pool->vendorclasses[i]);
1722 if (!pool->vendorclasses[i + 1])
1724 strqueue_push(&sq, cmd);
1731 s = testcase_getsolverflags(solv);
1734 cmd = pool_tmpjoin(pool, "solverflags ", s, 0);
1735 strqueue_push(&sq, cmd);
1738 /* now dump all the ns callback values we know */
1739 if (pool->nscallback)
1743 for (rid = 1; rid < pool->nrels; rid++)
1745 Reldep *rd = pool->rels + rid;
1746 if (rd->flags != REL_NAMESPACE || rd->name == NAMESPACE_OTHERPROVIDERS)
1748 /* evaluate all namespace ids, skip empty results */
1749 d = pool_whatprovides(pool, MAKERELDEP(rid));
1750 if (!d || !pool->whatprovidesdata[d])
1752 cmd = pool_tmpjoin(pool, "namespace ", pool_id2str(pool, rd->name), "(");
1753 cmd = pool_tmpappend(pool, cmd, pool_id2str(pool, rd->evr), ")");
1754 for (; pool->whatprovidesdata[d]; d++)
1755 cmd = pool_tmpappend(pool, cmd, " ", testcase_solvid2str(pool, pool->whatprovidesdata[d]));
1756 strqueue_push(&sq, cmd);
1760 for (i = 0; i < solv->job.count; i += 2)
1762 cmd = (char *)testcase_job2str(pool, solv->job.elements[i], solv->job.elements[i + 1]);
1763 cmd = pool_tmpjoin(pool, "job ", cmd, 0);
1764 strqueue_push(&sq, cmd);
1771 for (i = 0; resultflags2str[i].str; i++)
1772 if ((resultflags & resultflags2str[i].flag) != 0)
1773 cmd = pool_tmpappend(pool, cmd, cmd ? "," : 0, resultflags2str[i].str);
1774 cmd = pool_tmpjoin(pool, "result ", cmd ? cmd : "?", 0);
1775 cmd = pool_tmpappend(pool, cmd, " ", resultname);
1776 strqueue_push(&sq, cmd);
1777 result = testcase_solverresult(solv, resultflags);
1778 if (!strcmp(resultname, "<inline>"))
1782 strqueue_init(&rsq);
1783 strqueue_split(&rsq, result);
1784 for (i = 0; i < rsq.nstr; i++)
1786 cmd = pool_tmpjoin(pool, "#>", rsq.str[i], 0);
1787 strqueue_push(&sq, cmd);
1789 strqueue_free(&rsq);
1793 out = pool_tmpjoin(pool, dir, "/", resultname);
1794 if (!(fp = fopen(out, "w")))
1796 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: could not open '%s' for writing\n", out);
1801 if (result && *result && fwrite(result, strlen(result), 1, fp) != 1)
1803 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: write error\n");
1811 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: write error\n");
1819 cmd = strqueue_join(&sq);
1820 out = pool_tmpjoin(pool, dir, "/", testcasename);
1821 if (!(fp = fopen(out, "w")))
1823 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: could not open '%s' for writing\n", out);
1827 if (*cmd && fwrite(cmd, strlen(cmd), 1, fp) != 1)
1829 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: write error\n");
1836 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: write error\n");
1846 read_inline_file(FILE *fp, char **bufp, char **bufpp, int *buflp)
1848 char *result = solv_malloc(1024);
1855 if (rp - result + 256 >= resultl)
1857 resultl = rp - result;
1858 result = solv_realloc(result, resultl + 1024);
1859 rp = result + resultl;
1862 if (!fgets(rp, resultl - (rp - result), fp))
1865 if (rl && (rp == result || rp[-1] == '\n'))
1867 if (rl > 1 && rp[0] == '#' && rp[1] == '>')
1869 memmove(rp, rp + 2, rl - 2);
1874 while (rl + 16 > *buflp)
1876 *bufp = solv_realloc(*bufp, *buflp + 512);
1879 memmove(*bufp, rp, rl);
1880 if ((*bufp)[rl - 1] == '\n')
1886 (*bufpp) = *bufp + rl;
1903 char *result = solv_malloc(1024);
1910 if (rp - result + 256 >= resultl)
1912 resultl = rp - result;
1913 result = solv_realloc(result, resultl + 1024);
1914 rp = result + resultl;
1917 rl = fread(rp, 1, resultl - (rp - result), fp);
1929 str2resultflags(Pool *pool, char *s) /* modifies the string! */
1931 int i, resultflags = 0;
1934 char *se = strchr(s, ',');
1937 for (i = 0; resultflags2str[i].str; i++)
1938 if (!strcmp(s, resultflags2str[i].str))
1940 resultflags |= resultflags2str[i].flag;
1943 if (!resultflags2str[i].str)
1944 pool_debug(pool, SOLV_ERROR, "result: unknown flag '%s'\n", s);
1951 testcase_read(Pool *pool, FILE *fp, char *testcase, Queue *job, char **resultp, int *resultflagsp)
1956 char *testcasedir, *s;
1962 int poolflagsreset = 0;
1964 if (!fp && !(fp = fopen(testcase, "r")))
1966 pool_debug(pool, SOLV_ERROR, "testcase_read: could not open '%s'\n", testcase);
1969 testcasedir = solv_strdup(testcase);
1970 if ((s = strrchr(testcasedir, '/')) != 0)
1975 buf = solv_malloc(bufl);
1980 if (bufp - buf + 16 > bufl)
1983 buf = solv_realloc(buf, bufl + 512);
1987 if (!fgets(bufp, bufl - (bufp - buf), fp))
1991 if (!l || buf[l - 1] != '\n')
1998 while (*s && (*s == ' ' || *s == '\t'))
2000 if (!*s || *s == '#')
2003 /* split it in pieces */
2006 while (*s == ' ' || *s == '\t')
2010 pieces = solv_extend(pieces, npieces, 1, sizeof(*pieces), 7);
2011 pieces[npieces++] = s;
2012 while (*s && *s != ' ' && *s != '\t')
2017 pieces = solv_extend(pieces, npieces, 1, sizeof(*pieces), 7);
2018 pieces[npieces] = 0;
2019 if (!strcmp(pieces[0], "repo") && npieces >= 4)
2021 Repo *repo = repo_create(pool, pieces[1]);
2027 if (!poolflagsreset)
2030 testcase_resetpoolflags(pool); /* hmm */
2032 if (sscanf(pieces[2], "%d.%d", &prio, &subprio) != 2)
2035 prio = atoi(pieces[2]);
2037 repo->priority = prio;
2038 repo->subpriority = subprio;
2039 if (strcmp(pieces[3], "empty") != 0)
2041 const char *repotype = pool_tmpjoin(pool, pieces[3], 0, 0); /* gets overwritten in <inline> case */
2042 if (!strcmp(pieces[4], "<inline>"))
2044 char *idata = read_inline_file(fp, &buf, &bufp, &bufl);
2046 rfp = solv_xfopen_buf(rdata, &idata, 0, "rf");
2050 rdata = pool_tmpjoin(pool, testcasedir, pieces[4], 0);
2051 rfp = solv_xfopen(rdata, "r");
2055 pool_debug(pool, SOLV_ERROR, "testcase_read: could not open '%s'\n", rdata);
2057 else if (!strcmp(repotype, "testtags"))
2059 testcase_add_testtags(repo, rfp, 0);
2062 else if (!strcmp(repotype, "solv"))
2064 repo_add_solv(repo, rfp, 0);
2068 else if (!strcmp(repotype, "helix"))
2070 extern int repo_add_helix(Repo *repo, FILE *fp, int flags);
2071 repo_add_helix(repo, rfp, 0);
2078 pool_debug(pool, SOLV_ERROR, "testcase_read: unknown repo type for repo '%s'\n", repo->name);
2082 else if (!strcmp(pieces[0], "system") && npieces >= 3)
2086 /* must set the disttype before the arch */
2087 for (i = 0; disttype2str[i].str != 0; i++)
2088 if (!strcmp(disttype2str[i].str, pieces[2]))
2090 if (!disttype2str[i].str)
2091 pool_debug(pool, SOLV_ERROR, "testcase_read: system: unknown disttype '%s'\n", pieces[2]);
2092 else if (pool->disttype != disttype2str[i].type)
2094 #ifdef MULTI_SEMANTICS
2095 pool_setdisttype(pool, disttype2str[i].type);
2097 pool_debug(pool, SOLV_ERROR, "testcase_read: system: cannot change disttype to '%s'\n", pieces[2]);
2100 if (strcmp(pieces[1], "unset") == 0)
2101 pool_setarch(pool, 0);
2102 else if (pieces[1][0] == ':')
2103 pool_setarchpolicy(pool, pieces[1] + 1);
2105 pool_setarch(pool, pieces[1]);
2108 Repo *repo = testcase_str2repo(pool, pieces[3]);
2110 pool_debug(pool, SOLV_ERROR, "testcase_read: system: unknown repo '%s'\n", pieces[3]);
2112 pool_set_installed(pool, repo);
2115 else if (!strcmp(pieces[0], "job") && npieces > 1)
2121 pool_addfileprovides(pool);
2122 pool_createwhatprovides(pool);
2125 if (npieces >= 3 && !strcmp(pieces[2], "selection"))
2127 addselectionjob(pool, pieces + 1, npieces - 1, job);
2131 for (sp = pieces[1]; sp < pieces[npieces - 1]; sp++)
2134 how = testcase_str2job(pool, pieces[1], &what);
2135 if (how >= 0 && job)
2136 queue_push2(job, how, what);
2138 else if (!strcmp(pieces[0], "vendorclass") && npieces > 1)
2140 pool_addvendorclass(pool, (const char **)(pieces + 1));
2142 else if (!strcmp(pieces[0], "namespace") && npieces > 1)
2144 int i = strlen(pieces[1]);
2145 s = strchr(pieces[1], '(');
2146 if (!s && pieces[1][i - 1] != ')')
2148 pool_debug(pool, SOLV_ERROR, "testcase_read: bad namespace '%s'\n", pieces[1]);
2156 pieces[1][i - 1] = 0;
2157 name = pool_str2id(pool, pieces[1], 1);
2158 evr = pool_str2id(pool, s + 1, 1);
2160 pieces[1][i - 1] = ')';
2161 id = pool_rel2id(pool, name, evr, REL_NAMESPACE, 1);
2162 for (i = 2; i < npieces; i++)
2163 queue_push(&q, testcase_str2solvid(pool, pieces[i]));
2164 /* now do the callback */
2167 pool_addfileprovides(pool);
2168 pool_createwhatprovides(pool);
2171 pool->whatprovides_rel[GETRELID(id)] = pool_queuetowhatprovides(pool, &q);
2175 else if (!strcmp(pieces[0], "poolflags"))
2178 if (!poolflagsreset)
2181 testcase_resetpoolflags(pool); /* hmm */
2183 for (i = 1; i < npieces; i++)
2184 testcase_setpoolflags(pool, pieces[i]);
2186 else if (!strcmp(pieces[0], "solverflags") && npieces > 1)
2191 solv = solver_create(pool);
2192 testcase_resetsolverflags(solv);
2194 for (i = 1; i < npieces; i++)
2195 testcase_setsolverflags(solv, pieces[i]);
2197 else if (!strcmp(pieces[0], "result") && npieces > 1)
2200 int resultflags = str2resultflags(pool, pieces[1]);
2204 rdata = pool_tmpjoin(pool, testcasedir, pieces[2], 0);
2205 if (!strcmp(pieces[2], "<inline>"))
2206 result = read_inline_file(fp, &buf, &bufp, &bufl);
2209 FILE *rfp = fopen(rdata, "r");
2211 pool_debug(pool, SOLV_ERROR, "testcase_read: could not open '%s'\n", rdata);
2214 result = read_file(rfp);
2224 *resultflagsp = resultflags;
2226 else if (!strcmp(pieces[0], "nextjob") && npieces == 1)
2232 pool_debug(pool, SOLV_ERROR, "testcase_read: cannot parse command '%s'\n", pieces[0]);
2235 buf = solv_free(buf);
2236 pieces = solv_free(pieces);
2237 solv_free(testcasedir);
2240 pool_addfileprovides(pool);
2241 pool_createwhatprovides(pool);
2245 solv = solver_create(pool);
2246 testcase_resetsolverflags(solv);
2254 testcase_resultdiff(char *result1, char *result2)
2256 Strqueue sq1, sq2, osq;
2258 strqueue_init(&sq1);
2259 strqueue_init(&sq2);
2260 strqueue_init(&osq);
2261 strqueue_split(&sq1, result1);
2262 strqueue_split(&sq2, result2);
2263 strqueue_sort(&sq1);
2264 strqueue_sort(&sq2);
2265 strqueue_diff(&sq1, &sq2, &osq);
2266 r = osq.nstr ? strqueue_join(&osq) : 0;
2267 strqueue_free(&sq1);
2268 strqueue_free(&sq2);
2269 strqueue_free(&osq);