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 },
110 static struct poolflags2str {
114 } poolflags2str[] = {
115 { POOL_FLAG_PROMOTEEPOCH, "promoteepoch", 0 },
116 { POOL_FLAG_FORBIDSELFCONFLICTS, "forbidselfconflicts", 0 },
117 { POOL_FLAG_OBSOLETEUSESPROVIDES, "obsoleteusesprovides", 0 },
118 { POOL_FLAG_IMPLICITOBSOLETEUSESPROVIDES, "implicitobsoleteusesprovides", 0 },
119 { POOL_FLAG_OBSOLETEUSESCOLORS, "obsoleteusescolors", 0 },
120 { POOL_FLAG_IMPLICITOBSOLETEUSESCOLORS, "implicitobsoleteusescolors", 0 },
121 { POOL_FLAG_NOINSTALLEDOBSOLETES, "noinstalledobsoletes", 0 },
122 { POOL_FLAG_HAVEDISTEPOCH, "havedistepoch", 0 },
123 { POOL_FLAG_NOOBSOLETESMULTIVERSION, "noobsoletesmultiversion", 0 },
124 { POOL_FLAG_ADDFILEPROVIDESFILTERED, "addfileprovidesfiltered", 0 },
128 static struct disttype2str {
132 { DISTTYPE_RPM, "rpm" },
133 { DISTTYPE_DEB, "deb" },
134 { DISTTYPE_ARCH, "arch" },
135 { DISTTYPE_HAIKU, "haiku" },
139 static struct selflags2str {
143 { SELECTION_NAME, "name" },
144 { SELECTION_PROVIDES, "provides" },
145 { SELECTION_FILELIST, "filelist" },
146 { SELECTION_CANON, "canon" },
147 { SELECTION_DOTARCH, "dotarch" },
148 { SELECTION_REL, "rel" },
149 { SELECTION_INSTALLED_ONLY, "installedonly" },
150 { SELECTION_GLOB, "glob" },
151 { SELECTION_FLAT, "flat" },
152 { SELECTION_NOCASE, "nocase" },
153 { SELECTION_SOURCE_ONLY, "sourceonly" },
154 { SELECTION_WITH_SOURCE, "withsource" },
159 typedef struct strqueue {
164 #define STRQUEUE_BLOCK 63
167 strqueue_init(Strqueue *q)
174 strqueue_free(Strqueue *q)
177 for (i = 0; i < q->nstr; i++)
178 solv_free(q->str[i]);
179 q->str = solv_free(q->str);
184 strqueue_push(Strqueue *q, const char *s)
186 q->str = solv_extend(q->str, q->nstr, 1, sizeof(*q->str), STRQUEUE_BLOCK);
187 q->str[q->nstr++] = solv_strdup(s);
191 strqueue_pushjoin(Strqueue *q, const char *s1, const char *s2, const char *s3)
193 q->str = solv_extend(q->str, q->nstr, 1, sizeof(*q->str), STRQUEUE_BLOCK);
194 q->str[q->nstr++] = solv_dupjoin(s1, s2, s3);
198 strqueue_sort_cmp(const void *ap, const void *bp, void *dp)
200 const char *a = *(const char **)ap;
201 const char *b = *(const char **)bp;
202 return strcmp(a ? a : "", b ? b : "");
206 strqueue_sort(Strqueue *q)
209 solv_sort(q->str, q->nstr, sizeof(*q->str), strqueue_sort_cmp, 0);
213 strqueue_sort_u(Strqueue *q)
217 for (i = j = 0; i < q->nstr; i++)
218 if (!j || strqueue_sort_cmp(q->str + i, q->str + j - 1, 0) != 0)
219 q->str[j++] = q->str[i];
224 strqueue_join(Strqueue *q)
228 for (i = 0; i < q->nstr; i++)
230 l += strlen(q->str[i]) + 1;
231 l++; /* trailing \0 */
234 for (i = 0; i < q->nstr; i++)
237 strcpy(rp, q->str[i]);
246 strqueue_split(Strqueue *q, const char *s)
251 while ((p = strchr(s, '\n')) != 0)
253 q->str = solv_extend(q->str, q->nstr, 1, sizeof(*q->str), STRQUEUE_BLOCK);
254 q->str[q->nstr] = solv_malloc(p - s + 1);
256 memcpy(q->str[q->nstr], s, p - s);
257 q->str[q->nstr][p - s] = 0;
266 strqueue_diff(Strqueue *sq1, Strqueue *sq2, Strqueue *osq)
269 while (i < sq1->nstr && j < sq2->nstr)
271 int r = strqueue_sort_cmp(sq1->str + i, sq2->str + j, 0);
275 strqueue_pushjoin(osq, "-", sq1->str[i++], 0);
277 strqueue_pushjoin(osq, "+", sq2->str[j++], 0);
279 while (i < sq1->nstr)
280 strqueue_pushjoin(osq, "-", sq1->str[i++], 0);
281 while (j < sq2->nstr)
282 strqueue_pushjoin(osq, "+", sq2->str[j++], 0);
286 pool_isknownarch(Pool *pool, Id id)
288 if (!id || id == ID_EMPTY)
290 if (id == ARCH_SRC || id == ARCH_NOSRC || id == ARCH_NOARCH)
292 if (!pool->id2arch || (id > pool->lastarch || !pool->id2arch[id]))
298 testcase_str2dep_simple(Pool *pool, const char **sp)
305 while (*s == ' ' || *s == '\t')
308 while (*s && *s != ' ' && *s != '\t' && *s != '<' && *s != '=' && *s != '>')
312 while (*s && *s != ')')
318 if ((a = strchr(n, '.')) != 0 && a + 1 < s && s[-1] != ')')
320 Id archid = pool_strn2id(pool, a + 1, s - (a + 1), 0);
321 if (pool_isknownarch(pool, archid))
323 id = pool_strn2id(pool, n, a - n, 1);
324 id = pool_rel2id(pool, id, archid, REL_ARCH, 1);
327 id = pool_strn2id(pool, n, s - n, 1);
329 else if (s - n > 4 && s[-4] == ':' && !strncmp(s - 4, ":any", 4))
331 id = pool_strn2id(pool, n, s - n - 4, 1);
332 id = pool_rel2id(pool, id, ARCH_ANY, REL_MULTIARCH, 1);
335 id = pool_strn2id(pool, n, s - n, 1);
341 while (*s == ' ' || *s == '\t')
344 if (*s == '!' && s[1] == '=') /* support != as synonym for <> */
346 flags = REL_LT | REL_GT;
365 while (*s == ' ' || *s == '\t')
368 while (*s && *s != ' ' && *s != '\t')
370 evr = pool_strn2id(pool, n, s - n, 1);
371 if (*s == ' ' && !strcmp(s, " compat >= "))
374 while (*s == ' ' || *s == '\t')
377 while (*s && *s != ' ' && *s != '\t')
379 evr = pool_rel2id(pool, evr, pool_strn2id(pool, n, s - n, 1), REL_COMPAT, 1);
382 return pool_rel2id(pool, id, evr, flags, 1);
386 testcase_str2dep_complex(Pool *pool, const char **sp)
390 #ifdef ENABLE_COMPLEX_DEPS
391 while (*s == ' ' || *s == '\t')
396 id = testcase_str2dep_complex(pool, &s);
399 while (*s == ' ' || *s == '\t')
404 id = testcase_str2dep_simple(pool, &s);
408 id = pool_rel2id(pool, id, testcase_str2dep_complex(pool, &s), REL_OR, 1);
413 id = pool_rel2id(pool, id, testcase_str2dep_complex(pool, &s), REL_AND, 1);
415 else if (*s == 'I' && s[1] == 'F' && (s[2] == ' ' || s[2] == '\t'))
418 id = pool_rel2id(pool, id, testcase_str2dep_complex(pool, &s), REL_COND, 1);
425 testcase_str2dep(Pool *pool, const char *s)
427 return testcase_str2dep_complex(pool, &s);
431 testcase_repoid2str(Pool *pool, Id repoid)
433 Repo *repo = pool_id2repo(pool, repoid);
436 char *r = pool_tmpjoin(pool, repo->name, 0, 0);
438 for (rp = r; *rp; rp++)
439 if (*rp == ' ' || *rp == '\t')
446 sprintf(buf, "#%d", repoid);
447 return pool_tmpjoin(pool, buf, 0, 0);
452 testcase_solvid2str(Pool *pool, Id p)
454 Solvable *s = pool->solvables + p;
455 const char *n, *e, *a;
458 if (p == SYSTEMSOLVABLE)
460 n = pool_id2str(pool, s->name);
461 e = pool_id2str(pool, s->evr);
462 a = pool_id2str(pool, s->arch);
463 str = pool_alloctmpspace(pool, strlen(n) + strlen(e) + strlen(a) + 3);
464 sprintf(str, "%s-%s.%s", n, e, a);
466 return pool_tmpappend(pool, str, "@", 0);
470 char *str2 = pool_tmpappend(pool, str, "@", s->repo->name);
472 if (str2[l] == ' ' || str2[l] == '\t')
476 sprintf(buf, "@#%d", s->repo->repoid);
477 return pool_tmpappend(pool, str, buf, 0);
481 testcase_str2repo(Pool *pool, const char *str)
485 if (str[0] == '#' && (str[1] >= '0' && str[1] <= '9'))
489 for (j = 1; str[j] >= '0' && str[j] <= '9'; j++)
490 repoid = repoid * 10 + (str[j] - '0');
491 if (!str[j] && repoid > 0 && repoid < pool->nrepos)
492 repo = pool_id2repo(pool, repoid);
496 FOR_REPOS(repoid, repo)
501 l = strlen(repo->name);
502 for (i = 0; i < l; i++)
504 int c = repo->name[i];
505 if (c == ' ' || c == '\t')
510 if (i == l && !str[l])
513 if (repoid >= pool->nrepos)
520 testcase_str2solvid(Pool *pool, const char *str)
522 int i, l = strlen(str);
529 if (*str == '@' && !strcmp(str, "@SYSTEM"))
530 return SYSTEMSOLVABLE;
532 for (i = l - 1; i >= 0; i--)
533 if (str[i] == '@' && (repo = testcase_str2repo(pool, str + i + 1)) != 0)
538 /* now find the arch (if present) */
540 for (i = repostart - 1; i > 0; i--)
543 arch = pool_strn2id(pool, str + i + 1, repostart - (i + 1), 0);
548 /* now find the name */
549 for (i = repostart - 1; i > 0; i--)
553 Id nid, evrid, p, pp;
554 nid = pool_strn2id(pool, str, i, 0);
557 evrid = pool_strn2id(pool, str + i + 1, repostart - (i + 1), 0);
560 FOR_PROVIDES(p, pp, nid)
562 Solvable *s = pool->solvables + p;
563 if (s->name != nid || s->evr != evrid)
565 if (repo && s->repo != repo)
567 if (arch && s->arch != arch)
577 testcase_job2str(Pool *pool, Id how, Id what)
584 Id select = how & SOLVER_SELECTMASK;
586 for (i = 0; job2str[i].str; i++)
587 if ((how & SOLVER_JOBMASK) == job2str[i].job)
589 jobstr = job2str[i].str ? job2str[i].str : "unknown";
590 if (select == SOLVER_SOLVABLE)
593 pkgstr = testcase_solvid2str(pool, what);
595 else if (select == SOLVER_SOLVABLE_NAME)
598 pkgstr = pool_dep2str(pool, what);
600 else if (select == SOLVER_SOLVABLE_PROVIDES)
602 selstr = " provides ";
603 pkgstr = pool_dep2str(pool, what);
605 else if (select == SOLVER_SOLVABLE_ONE_OF)
610 while ((p = pool->whatprovidesdata[what++]) != 0)
612 const char *s = testcase_solvid2str(pool, p);
615 pkgstr = pool_tmpappend(pool, pkgstr, " ", s);
616 pool_freetmpspace(pool, s);
624 else if (select == SOLVER_SOLVABLE_REPO)
626 Repo *repo = pool_id2repo(pool, what);
631 sprintf(buf, "#%d", repo->repoid);
632 pkgstr = pool_tmpjoin(pool, buf, 0, 0);
635 pkgstr = pool_tmpjoin(pool, repo->name, 0, 0);
637 else if (select == SOLVER_SOLVABLE_ALL)
644 selstr = " unknown ";
647 ret = pool_tmpjoin(pool, jobstr, selstr, pkgstr);
649 ret = pool_tmpappend(pool, ret, " ", 0);
650 for (i = 0; jobflags2str[i].str; i++)
651 if ((how & jobflags2str[i].flag) != 0)
652 ret = pool_tmpappend(pool, ret, ",", jobflags2str[i].str);
658 ret = pool_tmpappend(pool, ret, "]", 0);
664 str2selflags(Pool *pool, char *s) /* modifies the string! */
669 char *se = strchr(s, ',');
672 for (i = 0; selflags2str[i].str; i++)
673 if (!strcmp(s, selflags2str[i].str))
675 selflags |= selflags2str[i].flag;
678 if (!selflags2str[i].str)
679 pool_debug(pool, SOLV_ERROR, "str2job: unknown selection flag '%s'\n", s);
686 str2jobflags(Pool *pool, char *s) /* modifies the string */
691 char *se = strchr(s, ',');
694 for (i = 0; jobflags2str[i].str; i++)
695 if (!strcmp(s, jobflags2str[i].str))
697 jobflags |= jobflags2str[i].flag;
700 if (!jobflags2str[i].str)
701 pool_debug(pool, SOLV_ERROR, "str2job: unknown job flag '%s'\n", s);
708 testcase_str2job(Pool *pool, const char *str, Id *whatp)
718 /* so we can patch it */
719 s = pool_tmpjoin(pool, str, 0, 0);
720 /* split it in pieces */
723 while (*s == ' ' || *s == '\t')
727 pieces = solv_extend(pieces, npieces, 1, sizeof(*pieces), 7);
728 pieces[npieces++] = s;
729 while (*s && *s != ' ' && *s != '\t')
736 pool_debug(pool, SOLV_ERROR, "str2job: bad line '%s'\n", str);
741 for (i = 0; job2str[i].str; i++)
742 if (!strcmp(pieces[0], job2str[i].str))
746 pool_debug(pool, SOLV_ERROR, "str2job: unknown job '%s'\n", str);
750 job = job2str[i].job;
754 char *flags = pieces[npieces - 1];
755 if (*flags == '[' && flags[strlen(flags) - 1] == ']')
759 flags[strlen(flags) - 1] = 0;
760 job |= str2jobflags(pool, flags);
763 if (!strcmp(pieces[1], "pkg"))
767 pool_debug(pool, SOLV_ERROR, "str2job: bad pkg selector in '%s'\n", str);
771 job |= SOLVER_SOLVABLE;
772 what = testcase_str2solvid(pool, pieces[2]);
775 pool_debug(pool, SOLV_ERROR, "str2job: unknown package '%s'\n", pieces[2]);
780 else if (!strcmp(pieces[1], "name") || !strcmp(pieces[1], "provides"))
782 /* join em again for dep2str... */
784 for (sp = pieces[2]; sp < pieces[npieces - 1]; sp++)
788 if (pieces[1][0] == 'p' && strncmp(pieces[2], "namespace:", 10) == 0)
790 char *spe = strchr(pieces[2], '(');
791 int l = strlen(pieces[2]);
792 if (spe && pieces[2][l - 1] == ')')
794 /* special namespace provides */
795 if (strcmp(spe, "(<NULL>)") != 0)
797 pieces[2][l - 1] = 0;
798 what = testcase_str2dep(pool, spe + 1);
799 pieces[2][l - 1] = ')';
801 what = pool_rel2id(pool, pool_strn2id(pool, pieces[2], spe - pieces[2], 1), what, REL_NAMESPACE, 1);
805 what = testcase_str2dep(pool, pieces[2]);
806 if (pieces[1][0] == 'n')
807 job |= SOLVER_SOLVABLE_NAME;
809 job |= SOLVER_SOLVABLE_PROVIDES;
811 else if (!strcmp(pieces[1], "oneof"))
814 job |= SOLVER_SOLVABLE_ONE_OF;
816 if (npieces > 3 && strcmp(pieces[2], "nothing") != 0)
818 for (i = 2; i < npieces; i++)
820 Id p = testcase_str2solvid(pool, pieces[i]);
823 pool_debug(pool, SOLV_ERROR, "str2job: unknown package '%s'\n", pieces[i]);
831 what = pool_queuetowhatprovides(pool, &q);
834 else if (!strcmp(pieces[1], "repo"))
839 pool_debug(pool, SOLV_ERROR, "str2job: bad line '%s'\n", str);
843 repo = testcase_str2repo(pool, pieces[2]);
846 pool_debug(pool, SOLV_ERROR, "str2job: unknown repo '%s'\n", pieces[2]);
850 job |= SOLVER_SOLVABLE_REPO;
853 else if (!strcmp(pieces[1], "all"))
855 if (npieces != 3 && strcmp(pieces[2], "packages") != 0)
857 pool_debug(pool, SOLV_ERROR, "str2job: bad line '%s'\n", str);
861 job |= SOLVER_SOLVABLE_ALL;
866 pool_debug(pool, SOLV_ERROR, "str2job: unknown selection in '%s'\n", str);
876 addselectionjob(Pool *pool, char **pieces, int npieces, Queue *jobqueue)
883 for (i = 0; job2str[i].str; i++)
884 if (!strcmp(pieces[0], job2str[i].str))
888 pool_debug(pool, SOLV_ERROR, "selstr2job: unknown job '%s'\n", pieces[0]);
891 job = job2str[i].job;
894 char *flags = pieces[npieces - 1];
895 if (*flags == '[' && flags[strlen(flags) - 1] == ']')
899 flags[strlen(flags) - 1] = 0;
900 job |= str2jobflags(pool, flags);
905 pool_debug(pool, SOLV_ERROR, "selstr2job: no selection flags\n");
908 selflags = str2selflags(pool, pieces[3]);
910 r = selection_make(pool, &sel, pieces[2], selflags);
911 for (i = 0; i < sel.count; i += 2)
912 queue_push2(jobqueue, job | sel.elements[i], sel.elements[i + 1]);
918 writedeps(Repo *repo, FILE *fp, const char *tag, Id key, Solvable *s, Offset off)
920 Pool *pool = repo->pool;
927 dp = repo->idarraydata + off;
929 while ((id = *dp++) != 0)
931 if (key == SOLVABLE_REQUIRES && id == SOLVABLE_PREREQMARKER)
934 fprintf(fp, "-%s\n", tag);
939 if (key == SOLVABLE_PROVIDES && id == SOLVABLE_FILEMARKER)
944 idstr = pool_dep2str(pool, id);
947 Reldep *rd = GETRELDEP(pool, id);
948 if (key == SOLVABLE_CONFLICTS && rd->flags == REL_NAMESPACE && rd->name == NAMESPACE_OTHERPROVIDERS)
950 if (!strncmp(idstr, "namespace:", 10))
953 if (key == SOLVABLE_SUPPLEMENTS)
955 if (rd->flags == REL_NAMESPACE && rd->name == NAMESPACE_FILESYSTEM)
957 if (!strncmp(idstr, "namespace:", 10))
960 else if (rd->flags == REL_NAMESPACE && rd->name == NAMESPACE_MODALIAS)
962 if (!strncmp(idstr, "namespace:", 10))
965 else if (rd->flags == REL_AND)
967 /* either packageand chain or modalias */
969 if (ISRELDEP(rd->evr))
971 Reldep *mrd = GETRELDEP(pool, rd->evr);
972 if (mrd->flags == REL_NAMESPACE && mrd->name == NAMESPACE_MODALIAS)
974 idstr = pool_tmpjoin(pool, "modalias(", pool_dep2str(pool, rd->name), ":");
975 idstr = pool_tmpappend(pool, idstr, pool_dep2str(pool, mrd->evr), ")");
977 else if (mrd->flags >= 8)
982 /* must be and chain */
983 idstr = pool_dep2str(pool, rd->evr);
989 rd = GETRELDEP(pool, id);
990 if (rd->flags != REL_AND)
992 idstr = pool_tmpjoin(pool, pool_dep2str(pool, rd->evr), ":", idstr);
994 idstr = pool_tmpjoin(pool, pool_dep2str(pool, id), ":", idstr);
995 idstr = pool_tmpjoin(pool, "packageand(", idstr, ")");
998 else if (rd->flags >= 8)
1004 fprintf(fp, "+%s\n", tag);
1007 fprintf(fp, "%s\n", idstr);
1009 if (key == SOLVABLE_PROVIDES)
1011 /* add the filelist */
1013 dataiterator_init(&di, pool, repo, s - pool->solvables, SOLVABLE_FILELIST, 0, 0);
1014 while (dataiterator_step(&di))
1016 const char *s = repodata_dir2str(di.data, di.kv.id, di.kv.str);
1019 Id id = pool_str2id(pool, s, 0);
1022 for (dp = prvdp; *dp; dp++)
1026 continue; /* already included */
1031 fprintf(fp, "+%s", tag);
1034 fprintf(fp, "%s\n", s);
1038 fprintf(fp, "-%s\n", tag);
1042 testcase_write_testtags(Repo *repo, FILE *fp)
1044 Pool *pool = repo->pool;
1050 const char *release;
1054 fprintf(fp, "=Ver: 2.0\n");
1055 FOR_REPO_SOLVABLES(repo, p, s)
1057 name = pool_id2str(pool, s->name);
1058 evr = pool_id2str(pool, s->evr);
1059 arch = pool_id2str(pool, s->arch);
1060 release = strrchr(evr, '-');
1062 release = evr + strlen(evr);
1063 fprintf(fp, "=Pkg: %s %.*s %s %s\n", name, (int)(release - evr), evr, *release && release[1] ? release + 1 : "-", arch);
1064 tmp = solvable_lookup_str(s, SOLVABLE_SUMMARY);
1066 fprintf(fp, "=Sum: %s\n", tmp);
1067 writedeps(repo, fp, "Req:", SOLVABLE_REQUIRES, s, s->requires);
1068 writedeps(repo, fp, "Prv:", SOLVABLE_PROVIDES, s, s->provides);
1069 writedeps(repo, fp, "Obs:", SOLVABLE_OBSOLETES, s, s->obsoletes);
1070 writedeps(repo, fp, "Con:", SOLVABLE_CONFLICTS, s, s->conflicts);
1071 writedeps(repo, fp, "Rec:", SOLVABLE_RECOMMENDS, s, s->recommends);
1072 writedeps(repo, fp, "Sup:", SOLVABLE_SUPPLEMENTS, s, s->supplements);
1073 writedeps(repo, fp, "Sug:", SOLVABLE_SUGGESTS, s, s->suggests);
1074 writedeps(repo, fp, "Enh:", SOLVABLE_ENHANCES, s, s->enhances);
1076 fprintf(fp, "=Vnd: %s\n", pool_id2str(pool, s->vendor));
1077 ti = solvable_lookup_num(s, SOLVABLE_BUILDTIME, 0);
1079 fprintf(fp, "=Tim: %u\n", ti);
1084 static inline Offset
1085 adddep(Repo *repo, Offset olddeps, char *str, Id marker)
1087 Id id = *str == '/' ? pool_str2id(repo->pool, str, 1) : testcase_str2dep(repo->pool, str);
1088 return repo_addid_dep(repo, olddeps, id, marker);
1092 finish_solvable(Pool *pool, Repodata *data, Solvable *s, char *filelist, int nfilelist)
1098 for (l = 0; l < nfilelist; l += strlen(filelist + l) + 1)
1100 char *p = strrchr(filelist + l, '/');
1104 did = repodata_str2dir(data, filelist + l, 1);
1107 did = repodata_str2dir(data, "/", 1);
1108 repodata_add_dirstr(data, s - pool->solvables, SOLVABLE_FILELIST, did, p);
1111 if (s->name && s->arch != ARCH_SRC && s->arch != ARCH_NOSRC)
1112 s->provides = repo_addid_dep(s->repo, s->provides, pool_rel2id(pool, s->name, s->evr, REL_EQ, 1), 0);
1113 s->supplements = repo_fix_supplements(s->repo, s->provides, s->supplements, 0);
1114 s->conflicts = repo_fix_conflicts(s->repo, s->conflicts);
1117 /* stripped down version of susetags parser used for testcases */
1119 testcase_add_testtags(Repo *repo, FILE *fp, int flags)
1121 Pool *pool = repo->pool;
1134 data = repo_add_repodata(repo, flags);
1139 line = solv_malloc(aline);
1143 if (linep - line + 16 > aline)
1145 aline = linep - line;
1146 line = solv_realloc(line, aline + 512);
1147 linep = line + aline;
1150 if (!fgets(linep, aline - (linep - line), fp))
1152 linep += strlen(linep);
1153 if (linep == line || linep[-1] != '\n')
1156 linep = line + intag;
1159 if (line[intag] == '-' && !strncmp(line + 1, line + intag + 1, intag - 2))
1166 else if (line[0] == '+' && line[1] && line[1] != ':')
1168 char *tagend = strchr(line, ':');
1173 intag = tagend + 2 - line;
1174 linep = line + intag;
1177 if (*line != '=' || !line[1] || !line[2] || !line[3] || line[4] != ':')
1179 tag = line[1] << 16 | line[2] << 8 | line[3];
1182 case 'P' << 16 | 'k' << 8 | 'g':
1184 finish_solvable(pool, data, s, filelist, nfilelist);
1186 if (split(line + 5, sp, 5) != 4)
1188 s = pool_id2solvable(pool, repo_add_solvable(repo));
1189 s->name = pool_str2id(pool, sp[0], 1);
1190 /* join back version and release */
1191 if (sp[2] && !(sp[2][0] == '-' && !sp[2][1]))
1193 s->evr = makeevr(pool, sp[1]);
1194 s->arch = pool_str2id(pool, sp[3], 1);
1196 case 'S' << 16 | 'u' << 8 | 'm':
1197 repodata_set_str(data, s - pool->solvables, SOLVABLE_SUMMARY, line + 6);
1199 case 'V' << 16 | 'n' << 8 | 'd':
1200 s->vendor = pool_str2id(pool, line + 6, 1);
1202 case 'T' << 16 | 'i' << 8 | 'm':
1205 repodata_set_num(data, s - pool->solvables, SOLVABLE_BUILDTIME, t);
1207 case 'R' << 16 | 'e' << 8 | 'q':
1208 s->requires = adddep(repo, s->requires, line + 6, -SOLVABLE_PREREQMARKER);
1210 case 'P' << 16 | 'r' << 8 | 'q':
1211 s->requires = adddep(repo, s->requires, line + 6, SOLVABLE_PREREQMARKER);
1213 case 'P' << 16 | 'r' << 8 | 'v':
1216 int l = strlen(line + 6) + 1;
1217 if (nfilelist + l > afilelist)
1219 afilelist = nfilelist + l + 512;
1220 filelist = solv_realloc(filelist, afilelist);
1222 memcpy(filelist + nfilelist, line + 6, l);
1229 for (l = 0; l < nfilelist; l += strlen(filelist + l) + 1)
1230 s->provides = repo_addid_dep(repo, s->provides, pool_str2id(pool, filelist + l, 1), 0);
1233 s->provides = adddep(repo, s->provides, line + 6, 0);
1235 case 'O' << 16 | 'b' << 8 | 's':
1236 s->obsoletes = adddep(repo, s->obsoletes, line + 6, 0);
1238 case 'C' << 16 | 'o' << 8 | 'n':
1239 s->conflicts = adddep(repo, s->conflicts, line + 6, 0);
1241 case 'R' << 16 | 'e' << 8 | 'c':
1242 s->recommends = adddep(repo, s->recommends, line + 6, 0);
1244 case 'S' << 16 | 'u' << 8 | 'p':
1245 s->supplements = adddep(repo, s->supplements, line + 6, 0);
1247 case 'S' << 16 | 'u' << 8 | 'g':
1248 s->suggests = adddep(repo, s->suggests, line + 6, 0);
1250 case 'E' << 16 | 'n' << 8 | 'h':
1251 s->enhances = adddep(repo, s->enhances, line + 6, 0);
1258 finish_solvable(pool, data, s, filelist, nfilelist);
1260 solv_free(filelist);
1261 repodata_free_dircache(data);
1262 if (!(flags & REPO_NO_INTERNALIZE))
1263 repodata_internalize(data);
1268 testcase_getpoolflags(Pool *pool)
1270 const char *str = 0;
1272 for (i = 0; poolflags2str[i].str; i++)
1274 v = pool_get_flag(pool, poolflags2str[i].flag);
1275 if (v == poolflags2str[i].def)
1277 str = pool_tmpappend(pool, str, v ? " " : " !", poolflags2str[i].str);
1279 return str ? str + 1 : "";
1283 testcase_setpoolflags(Pool *pool, const char *str)
1285 const char *p = str, *s;
1289 while (*p == ' ' || *p == '\t' || *p == ',')
1300 while (*p && *p != ' ' && *p != '\t' && *p != ',')
1302 for (i = 0; poolflags2str[i].str; i++)
1303 if (!strncmp(poolflags2str[i].str, s, p - s) && poolflags2str[i].str[p - s] == 0)
1305 if (!poolflags2str[i].str)
1307 pool_debug(pool, SOLV_ERROR, "setpoolflags: unknown flag '%.*s'\n", (int)(p - s), s);
1310 pool_set_flag(pool, poolflags2str[i].flag, v);
1316 testcase_resetpoolflags(Pool *pool)
1319 for (i = 0; poolflags2str[i].str; i++)
1320 pool_set_flag(pool, poolflags2str[i].flag, poolflags2str[i].def);
1324 testcase_getsolverflags(Solver *solv)
1326 Pool *pool = solv->pool;
1327 const char *str = 0;
1329 for (i = 0; solverflags2str[i].str; i++)
1331 v = solver_get_flag(solv, solverflags2str[i].flag);
1332 if (v == solverflags2str[i].def)
1334 str = pool_tmpappend(pool, str, v ? " " : " !", solverflags2str[i].str);
1336 return str ? str + 1 : "";
1340 testcase_setsolverflags(Solver *solv, const char *str)
1342 const char *p = str, *s;
1346 while (*p == ' ' || *p == '\t' || *p == ',')
1357 while (*p && *p != ' ' && *p != '\t' && *p != ',')
1359 for (i = 0; solverflags2str[i].str; i++)
1360 if (!strncmp(solverflags2str[i].str, s, p - s) && solverflags2str[i].str[p - s] == 0)
1362 if (!solverflags2str[i].str)
1364 pool_debug(solv->pool, SOLV_ERROR, "setsolverflags: unknown flag '%.*s'\n", (int)(p - s), s);
1367 solver_set_flag(solv, solverflags2str[i].flag, v);
1373 testcase_resetsolverflags(Solver *solv)
1376 for (i = 0; solverflags2str[i].str; i++)
1377 solver_set_flag(solv, solverflags2str[i].flag, solverflags2str[i].def);
1381 testcase_ruleid(Solver *solv, Id rid)
1387 const unsigned char *md5;
1393 solver_ruleliterals(solv, rid, &q);
1394 for (i = 0; i < q.count; i++)
1396 Id p = q.elements[i];
1397 s = testcase_solvid2str(solv->pool, p > 0 ? p : -p);
1399 s = pool_tmpjoin(solv->pool, "!", s, 0);
1400 strqueue_push(&sq, s);
1403 strqueue_sort_u(&sq);
1404 chk = solv_chksum_create(REPOKEY_TYPE_MD5);
1405 for (i = 0; i < sq.nstr; i++)
1406 solv_chksum_add(chk, sq.str[i], strlen(sq.str[i]) + 1);
1407 md5 = solv_chksum_get(chk, &md5l);
1408 s = pool_bin2hex(solv->pool, md5, md5l);
1409 chk = solv_chksum_free(chk, 0);
1415 testcase_problemid(Solver *solv, Id problem)
1420 const unsigned char *md5;
1424 /* we build a hash of all rules that define the problem */
1427 solver_findallproblemrules(solv, problem, &q);
1428 for (i = 0; i < q.count; i++)
1429 strqueue_push(&sq, testcase_ruleid(solv, q.elements[i]));
1431 strqueue_sort_u(&sq);
1432 chk = solv_chksum_create(REPOKEY_TYPE_MD5);
1433 for (i = 0; i < sq.nstr; i++)
1434 solv_chksum_add(chk, sq.str[i], strlen(sq.str[i]) + 1);
1435 md5 = solv_chksum_get(chk, &md5l);
1436 s = pool_bin2hex(solv->pool, md5, 4);
1437 chk = solv_chksum_free(chk, 0);
1443 testcase_solutionid(Solver *solv, Id problem, Id solution)
1447 const unsigned char *md5;
1451 intid = solver_solutionelement_internalid(solv, problem, solution);
1452 /* internal stuff! handle with care! */
1456 s = testcase_job2str(solv->pool, solv->job.elements[-intid - 1], solv->job.elements[-intid]);
1461 s = testcase_ruleid(solv, intid);
1463 chk = solv_chksum_create(REPOKEY_TYPE_MD5);
1464 solv_chksum_add(chk, s, strlen(s) + 1);
1465 md5 = solv_chksum_get(chk, &md5l);
1466 s = pool_bin2hex(solv->pool, md5, 4);
1467 chk = solv_chksum_free(chk, 0);
1471 static struct class2str {
1475 { SOLVER_TRANSACTION_ERASE, "erase" },
1476 { SOLVER_TRANSACTION_INSTALL, "install" },
1477 { SOLVER_TRANSACTION_REINSTALLED, "reinstall" },
1478 { SOLVER_TRANSACTION_DOWNGRADED, "downgrade" },
1479 { SOLVER_TRANSACTION_CHANGED, "change" },
1480 { SOLVER_TRANSACTION_UPGRADED, "upgrade" },
1481 { SOLVER_TRANSACTION_OBSOLETED, "obsolete" },
1482 { SOLVER_TRANSACTION_MULTIINSTALL, "multiinstall" },
1483 { SOLVER_TRANSACTION_MULTIREINSTALL, "multireinstall" },
1488 testcase_solverresult(Solver *solv, int resultflags)
1490 Pool *pool = solv->pool;
1498 if ((resultflags & TESTCASE_RESULT_TRANSACTION) != 0)
1500 Transaction *trans = solver_create_transaction(solv);
1504 for (i = 0; class2str[i].str; i++)
1507 transaction_classify_pkgs(trans, SOLVER_TRANSACTION_KEEP_PSEUDO, class2str[i].class, 0, 0, &q);
1508 for (j = 0; j < q.count; j++)
1512 if (pool->installed && pool->solvables[p].repo == pool->installed)
1513 op = transaction_obs_pkg(trans, p);
1514 s = pool_tmpjoin(pool, class2str[i].str, " ", testcase_solvid2str(pool, p));
1516 s = pool_tmpjoin(pool, s, " ", testcase_solvid2str(pool, op));
1517 strqueue_push(&sq, s);
1521 transaction_free(trans);
1523 if ((resultflags & TESTCASE_RESULT_PROBLEMS) != 0)
1525 char *probprefix, *solprefix;
1526 int problem, solution, element;
1529 pcnt = solver_problem_count(solv);
1530 for (problem = 1; problem <= pcnt; problem++)
1532 Id rid, from, to, dep;
1533 SolverRuleinfo rinfo;
1534 rid = solver_findproblemrule(solv, problem);
1535 s = testcase_problemid(solv, problem);
1536 probprefix = solv_dupjoin("problem ", s, 0);
1537 rinfo = solver_ruleinfo(solv, rid, &from, &to, &dep);
1538 s = pool_tmpjoin(pool, probprefix, " info ", solver_problemruleinfo2str(solv, rinfo, from, to, dep));
1539 strqueue_push(&sq, s);
1540 scnt = solver_solution_count(solv, problem);
1541 for (solution = 1; solution <= scnt; solution++)
1543 s = testcase_solutionid(solv, problem, solution);
1544 solprefix = solv_dupjoin(probprefix, " solution ", s);
1546 while ((element = solver_next_solutionelement(solv, problem, solution, element, &p, &op)) != 0)
1548 if (p == SOLVER_SOLUTION_JOB)
1549 s = pool_tmpjoin(pool, solprefix, " deljob ", testcase_job2str(pool, solv->job.elements[op - 1], solv->job.elements[op]));
1550 else if (p > 0 && op == 0)
1551 s = pool_tmpjoin(pool, solprefix, " erase ", testcase_solvid2str(pool, p));
1552 else if (p > 0 && op > 0)
1554 s = pool_tmpjoin(pool, solprefix, " replace ", testcase_solvid2str(pool, p));
1555 s = pool_tmpappend(pool, s, " ", testcase_solvid2str(pool, op));
1557 else if (p < 0 && op > 0)
1558 s = pool_tmpjoin(pool, solprefix, " allow ", testcase_solvid2str(pool, op));
1560 s = pool_tmpjoin(pool, solprefix, " unknown", 0);
1561 strqueue_push(&sq, s);
1563 solv_free(solprefix);
1565 solv_free(probprefix);
1569 if ((resultflags & TESTCASE_RESULT_ORPHANED) != 0)
1574 solver_get_orphaned(solv, &q);
1575 for (i = 0; i < q.count; i++)
1577 s = pool_tmpjoin(pool, "orphaned ", testcase_solvid2str(pool, q.elements[i]), 0);
1578 strqueue_push(&sq, s);
1583 if ((resultflags & TESTCASE_RESULT_RECOMMENDED) != 0)
1589 solver_get_recommendations(solv, &qr, &qs, 0);
1590 for (i = 0; i < qr.count; i++)
1592 s = pool_tmpjoin(pool, "recommended ", testcase_solvid2str(pool, qr.elements[i]), 0);
1593 strqueue_push(&sq, s);
1595 for (i = 0; i < qs.count; i++)
1597 s = pool_tmpjoin(pool, "suggested ", testcase_solvid2str(pool, qs.elements[i]), 0);
1598 strqueue_push(&sq, s);
1604 if ((resultflags & TESTCASE_RESULT_UNNEEDED) != 0)
1610 solver_get_unneeded(solv, &q, 0);
1611 solver_get_unneeded(solv, &qf, 1);
1612 for (i = j = 0; i < q.count; i++)
1614 /* we rely on qf containing a subset of q in the same order */
1615 if (j < qf.count && q.elements[i] == qf.elements[j])
1617 s = pool_tmpjoin(pool, "unneeded_filtered ", testcase_solvid2str(pool, q.elements[i]), 0);
1621 s = pool_tmpjoin(pool, "unneeded ", testcase_solvid2str(pool, q.elements[i]), 0);
1622 strqueue_push(&sq, s);
1629 result = strqueue_join(&sq);
1636 testcase_write(Solver *solv, char *dir, int resultflags, const char *testcasename, const char *resultname)
1638 Pool *pool = solv->pool;
1649 testcasename = "testcase.t";
1651 resultname = "solver.result";
1653 if (mkdir(dir, 0777) && errno != EEXIST)
1655 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: could not create directory '%s'\n", dir);
1659 FOR_REPOS(repoid, repo)
1661 const char *name = testcase_repoid2str(pool, repoid);
1663 if (repo->subpriority)
1664 sprintf(priobuf, "%d.%d", repo->priority, repo->subpriority);
1666 sprintf(priobuf, "%d", repo->priority);
1667 out = pool_tmpjoin(pool, name, ".repo", ".gz");
1668 cmd = pool_tmpjoin(pool, "repo ", name, " ");
1669 cmd = pool_tmpappend(pool, cmd, priobuf, " ");
1670 cmd = pool_tmpappend(pool, cmd, "testtags ", out);
1671 strqueue_push(&sq, cmd);
1672 out = pool_tmpjoin(pool, dir, "/", out);
1673 if (!(fp = solv_xfopen(out, "w")))
1675 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: could not open '%s' for writing\n", out);
1679 testcase_write_testtags(repo, fp);
1682 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: write error\n");
1687 /* hmm, this is not optimal... we currently search for the lowest score */
1689 arch = pool->solvables[SYSTEMSOLVABLE].arch;
1690 for (i = 0; i < pool->lastarch; i++)
1692 if (pool->id2arch[i] == 1 && !lowscore)
1694 if (pool->id2arch[i] > 0x10000 && (!lowscore || pool->id2arch[i] < lowscore))
1697 lowscore = pool->id2arch[i];
1700 cmd = pool_tmpjoin(pool, "system ", pool->lastarch ? pool_id2str(pool, arch) : "unset", 0);
1701 for (i = 0; disttype2str[i].str != 0; i++)
1702 if (pool->disttype == disttype2str[i].type)
1704 pool_tmpappend(pool, cmd, " ", disttype2str[i].str ? disttype2str[i].str : "unknown");
1705 if (pool->installed)
1706 cmd = pool_tmpappend(pool, cmd, " ", testcase_repoid2str(pool, pool->installed->repoid));
1707 strqueue_push(&sq, cmd);
1708 s = testcase_getpoolflags(solv->pool);
1711 cmd = pool_tmpjoin(pool, "poolflags ", s, 0);
1712 strqueue_push(&sq, cmd);
1715 if (pool->vendorclasses)
1718 for (i = 0; pool->vendorclasses[i]; i++)
1720 cmd = pool_tmpappend(pool, cmd ? cmd : "vendorclass", " ", pool->vendorclasses[i]);
1721 if (!pool->vendorclasses[i + 1])
1723 strqueue_push(&sq, cmd);
1730 s = testcase_getsolverflags(solv);
1733 cmd = pool_tmpjoin(pool, "solverflags ", s, 0);
1734 strqueue_push(&sq, cmd);
1737 /* now dump all the ns callback values we know */
1738 if (pool->nscallback)
1742 for (rid = 1; rid < pool->nrels; rid++)
1744 Reldep *rd = pool->rels + rid;
1745 if (rd->flags != REL_NAMESPACE || rd->name == NAMESPACE_OTHERPROVIDERS)
1747 /* evaluate all namespace ids, skip empty results */
1748 d = pool_whatprovides(pool, MAKERELDEP(rid));
1749 if (!d || !pool->whatprovidesdata[d])
1751 cmd = pool_tmpjoin(pool, "namespace ", pool_id2str(pool, rd->name), "(");
1752 cmd = pool_tmpappend(pool, cmd, pool_id2str(pool, rd->evr), ")");
1753 for (; pool->whatprovidesdata[d]; d++)
1754 cmd = pool_tmpappend(pool, cmd, " ", testcase_solvid2str(pool, pool->whatprovidesdata[d]));
1755 strqueue_push(&sq, cmd);
1759 for (i = 0; i < solv->job.count; i += 2)
1761 cmd = (char *)testcase_job2str(pool, solv->job.elements[i], solv->job.elements[i + 1]);
1762 cmd = pool_tmpjoin(pool, "job ", cmd, 0);
1763 strqueue_push(&sq, cmd);
1770 for (i = 0; resultflags2str[i].str; i++)
1771 if ((resultflags & resultflags2str[i].flag) != 0)
1772 cmd = pool_tmpappend(pool, cmd, cmd ? "," : 0, resultflags2str[i].str);
1773 cmd = pool_tmpjoin(pool, "result ", cmd ? cmd : "?", 0);
1774 cmd = pool_tmpappend(pool, cmd, " ", resultname);
1775 strqueue_push(&sq, cmd);
1776 result = testcase_solverresult(solv, resultflags);
1777 if (!strcmp(resultname, "<inline>"))
1781 strqueue_init(&rsq);
1782 strqueue_split(&rsq, result);
1783 for (i = 0; i < rsq.nstr; i++)
1785 cmd = pool_tmpjoin(pool, "#>", rsq.str[i], 0);
1786 strqueue_push(&sq, cmd);
1788 strqueue_free(&rsq);
1792 out = pool_tmpjoin(pool, dir, "/", resultname);
1793 if (!(fp = fopen(out, "w")))
1795 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: could not open '%s' for writing\n", out);
1800 if (result && *result && fwrite(result, strlen(result), 1, fp) != 1)
1802 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: write error\n");
1810 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: write error\n");
1818 cmd = strqueue_join(&sq);
1819 out = pool_tmpjoin(pool, dir, "/", testcasename);
1820 if (!(fp = fopen(out, "w")))
1822 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: could not open '%s' for writing\n", out);
1826 if (*cmd && fwrite(cmd, strlen(cmd), 1, fp) != 1)
1828 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: write error\n");
1835 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: write error\n");
1845 read_inline_file(FILE *fp, char **bufp, char **bufpp, int *buflp)
1847 char *result = solv_malloc(1024);
1854 if (rp - result + 256 >= resultl)
1856 resultl = rp - result;
1857 result = solv_realloc(result, resultl + 1024);
1858 rp = result + resultl;
1861 if (!fgets(rp, resultl - (rp - result), fp))
1864 if (rl && (rp == result || rp[-1] == '\n'))
1866 if (rl > 1 && rp[0] == '#' && rp[1] == '>')
1868 memmove(rp, rp + 2, rl - 2);
1873 while (rl + 16 > *buflp)
1875 *bufp = solv_realloc(*bufp, *buflp + 512);
1878 memmove(*bufp, rp, rl);
1879 if ((*bufp)[rl - 1] == '\n')
1885 (*bufpp) = *bufp + rl;
1902 char *result = solv_malloc(1024);
1909 if (rp - result + 256 >= resultl)
1911 resultl = rp - result;
1912 result = solv_realloc(result, resultl + 1024);
1913 rp = result + resultl;
1916 rl = fread(rp, 1, resultl - (rp - result), fp);
1928 str2resultflags(Pool *pool, char *s) /* modifies the string! */
1930 int i, resultflags = 0;
1933 char *se = strchr(s, ',');
1936 for (i = 0; resultflags2str[i].str; i++)
1937 if (!strcmp(s, resultflags2str[i].str))
1939 resultflags |= resultflags2str[i].flag;
1942 if (!resultflags2str[i].str)
1943 pool_debug(pool, SOLV_ERROR, "result: unknown flag '%s'\n", s);
1950 testcase_read(Pool *pool, FILE *fp, char *testcase, Queue *job, char **resultp, int *resultflagsp)
1955 char *testcasedir, *s;
1961 int poolflagsreset = 0;
1963 if (!fp && !(fp = fopen(testcase, "r")))
1965 pool_debug(pool, SOLV_ERROR, "testcase_read: could not open '%s'\n", testcase);
1968 testcasedir = solv_strdup(testcase);
1969 if ((s = strrchr(testcasedir, '/')) != 0)
1974 buf = solv_malloc(bufl);
1979 if (bufp - buf + 16 > bufl)
1982 buf = solv_realloc(buf, bufl + 512);
1986 if (!fgets(bufp, bufl - (bufp - buf), fp))
1990 if (!l || buf[l - 1] != '\n')
1997 while (*s && (*s == ' ' || *s == '\t'))
1999 if (!*s || *s == '#')
2002 /* split it in pieces */
2005 while (*s == ' ' || *s == '\t')
2009 pieces = solv_extend(pieces, npieces, 1, sizeof(*pieces), 7);
2010 pieces[npieces++] = s;
2011 while (*s && *s != ' ' && *s != '\t')
2016 pieces = solv_extend(pieces, npieces, 1, sizeof(*pieces), 7);
2017 pieces[npieces] = 0;
2018 if (!strcmp(pieces[0], "repo") && npieces >= 4)
2020 Repo *repo = repo_create(pool, pieces[1]);
2026 if (!poolflagsreset)
2029 testcase_resetpoolflags(pool); /* hmm */
2031 if (sscanf(pieces[2], "%d.%d", &prio, &subprio) != 2)
2034 prio = atoi(pieces[2]);
2036 repo->priority = prio;
2037 repo->subpriority = subprio;
2038 if (strcmp(pieces[3], "empty") != 0)
2040 const char *repotype = pool_tmpjoin(pool, pieces[3], 0, 0); /* gets overwritten in <inline> case */
2041 if (!strcmp(pieces[4], "<inline>"))
2043 char *idata = read_inline_file(fp, &buf, &bufp, &bufl);
2045 rfp = solv_xfopen_buf(rdata, &idata, 0, "rf");
2049 rdata = pool_tmpjoin(pool, testcasedir, pieces[4], 0);
2050 rfp = solv_xfopen(rdata, "r");
2054 pool_debug(pool, SOLV_ERROR, "testcase_read: could not open '%s'\n", rdata);
2056 else if (!strcmp(repotype, "testtags"))
2058 testcase_add_testtags(repo, rfp, 0);
2061 else if (!strcmp(repotype, "solv"))
2063 repo_add_solv(repo, rfp, 0);
2067 else if (!strcmp(repotype, "helix"))
2069 extern int repo_add_helix(Repo *repo, FILE *fp, int flags);
2070 repo_add_helix(repo, rfp, 0);
2077 pool_debug(pool, SOLV_ERROR, "testcase_read: unknown repo type for repo '%s'\n", repo->name);
2081 else if (!strcmp(pieces[0], "system") && npieces >= 3)
2085 /* must set the disttype before the arch */
2086 for (i = 0; disttype2str[i].str != 0; i++)
2087 if (!strcmp(disttype2str[i].str, pieces[2]))
2089 if (!disttype2str[i].str)
2090 pool_debug(pool, SOLV_ERROR, "testcase_read: system: unknown disttype '%s'\n", pieces[2]);
2091 else if (pool->disttype != disttype2str[i].type)
2093 #ifdef MULTI_SEMANTICS
2094 pool_setdisttype(pool, disttype2str[i].type);
2096 pool_debug(pool, SOLV_ERROR, "testcase_read: system: cannot change disttype to '%s'\n", pieces[2]);
2099 if (strcmp(pieces[1], "unset") == 0)
2100 pool_setarch(pool, 0);
2101 else if (pieces[1][0] == ':')
2102 pool_setarchpolicy(pool, pieces[1] + 1);
2104 pool_setarch(pool, pieces[1]);
2107 Repo *repo = testcase_str2repo(pool, pieces[3]);
2109 pool_debug(pool, SOLV_ERROR, "testcase_read: system: unknown repo '%s'\n", pieces[3]);
2111 pool_set_installed(pool, repo);
2114 else if (!strcmp(pieces[0], "job") && npieces > 1)
2120 pool_addfileprovides(pool);
2121 pool_createwhatprovides(pool);
2124 if (npieces >= 3 && !strcmp(pieces[2], "selection"))
2126 addselectionjob(pool, pieces + 1, npieces - 1, job);
2130 for (sp = pieces[1]; sp < pieces[npieces - 1]; sp++)
2133 how = testcase_str2job(pool, pieces[1], &what);
2134 if (how >= 0 && job)
2135 queue_push2(job, how, what);
2137 else if (!strcmp(pieces[0], "vendorclass") && npieces > 1)
2139 pool_addvendorclass(pool, (const char **)(pieces + 1));
2141 else if (!strcmp(pieces[0], "namespace") && npieces > 1)
2143 int i = strlen(pieces[1]);
2144 s = strchr(pieces[1], '(');
2145 if (!s && pieces[1][i - 1] != ')')
2147 pool_debug(pool, SOLV_ERROR, "testcase_read: bad namespace '%s'\n", pieces[1]);
2155 pieces[1][i - 1] = 0;
2156 name = pool_str2id(pool, pieces[1], 1);
2157 evr = pool_str2id(pool, s + 1, 1);
2159 pieces[1][i - 1] = ')';
2160 id = pool_rel2id(pool, name, evr, REL_NAMESPACE, 1);
2161 for (i = 2; i < npieces; i++)
2162 queue_push(&q, testcase_str2solvid(pool, pieces[i]));
2163 /* now do the callback */
2166 pool_addfileprovides(pool);
2167 pool_createwhatprovides(pool);
2170 pool->whatprovides_rel[GETRELID(id)] = pool_queuetowhatprovides(pool, &q);
2174 else if (!strcmp(pieces[0], "poolflags"))
2177 if (!poolflagsreset)
2180 testcase_resetpoolflags(pool); /* hmm */
2182 for (i = 1; i < npieces; i++)
2183 testcase_setpoolflags(pool, pieces[i]);
2185 else if (!strcmp(pieces[0], "solverflags") && npieces > 1)
2190 solv = solver_create(pool);
2191 testcase_resetsolverflags(solv);
2193 for (i = 1; i < npieces; i++)
2194 testcase_setsolverflags(solv, pieces[i]);
2196 else if (!strcmp(pieces[0], "result") && npieces > 1)
2199 int resultflags = str2resultflags(pool, pieces[1]);
2203 rdata = pool_tmpjoin(pool, testcasedir, pieces[2], 0);
2204 if (!strcmp(pieces[2], "<inline>"))
2205 result = read_inline_file(fp, &buf, &bufp, &bufl);
2208 FILE *rfp = fopen(rdata, "r");
2210 pool_debug(pool, SOLV_ERROR, "testcase_read: could not open '%s'\n", rdata);
2213 result = read_file(rfp);
2223 *resultflagsp = resultflags;
2225 else if (!strcmp(pieces[0], "nextjob") && npieces == 1)
2231 pool_debug(pool, SOLV_ERROR, "testcase_read: cannot parse command '%s'\n", pieces[0]);
2234 buf = solv_free(buf);
2235 pieces = solv_free(pieces);
2236 solv_free(testcasedir);
2239 pool_addfileprovides(pool);
2240 pool_createwhatprovides(pool);
2244 solv = solver_create(pool);
2245 testcase_resetsolverflags(solv);
2253 testcase_resultdiff(char *result1, char *result2)
2255 Strqueue sq1, sq2, osq;
2257 strqueue_init(&sq1);
2258 strqueue_init(&sq2);
2259 strqueue_init(&osq);
2260 strqueue_split(&sq1, result1);
2261 strqueue_split(&sq2, result2);
2262 strqueue_sort(&sq1);
2263 strqueue_sort(&sq2);
2264 strqueue_diff(&sq1, &sq2, &osq);
2265 r = osq.nstr ? strqueue_join(&osq) : 0;
2266 strqueue_free(&sq1);
2267 strqueue_free(&sq2);
2268 strqueue_free(&osq);