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_SETEV, "setev" },
62 { SOLVER_SETEVR, "setevr" },
63 { SOLVER_SETARCH, "setarch" },
64 { SOLVER_SETVENDOR, "setvendor" },
65 { SOLVER_SETREPO, "setrepo" },
66 { SOLVER_NOAUTOSET, "noautoset" },
70 static struct resultflags2str {
73 } resultflags2str[] = {
74 { TESTCASE_RESULT_TRANSACTION, "transaction" },
75 { TESTCASE_RESULT_PROBLEMS, "problems" },
76 { TESTCASE_RESULT_ORPHANED, "orphaned" },
77 { TESTCASE_RESULT_RECOMMENDED, "recommended" },
78 { TESTCASE_RESULT_UNNEEDED, "unneeded" },
82 static struct solverflags2str {
86 } solverflags2str[] = {
87 { SOLVER_FLAG_ALLOW_DOWNGRADE, "allowdowngrade", 0 },
88 { SOLVER_FLAG_ALLOW_NAMECHANGE, "allownamechange", 1 },
89 { SOLVER_FLAG_ALLOW_ARCHCHANGE, "allowarchchange", 0 },
90 { SOLVER_FLAG_ALLOW_VENDORCHANGE, "allowvendorchange", 0 },
91 { SOLVER_FLAG_ALLOW_UNINSTALL, "allowuninstall", 0 },
92 { SOLVER_FLAG_NO_UPDATEPROVIDE, "noupdateprovide", 0 },
93 { SOLVER_FLAG_SPLITPROVIDES, "splitprovides", 0 },
94 { SOLVER_FLAG_IGNORE_RECOMMENDED, "ignorerecommended", 0 },
95 { SOLVER_FLAG_ADD_ALREADY_RECOMMENDED, "addalreadyrecommended", 0 },
96 { SOLVER_FLAG_NO_INFARCHCHECK, "noinfarchcheck", 0 },
97 { SOLVER_FLAG_KEEP_EXPLICIT_OBSOLETES, "keepexplicitobsoletes", 0 },
98 { SOLVER_FLAG_BEST_OBEY_POLICY, "bestobeypolicy", 0 },
99 { SOLVER_FLAG_NO_AUTOTARGET, "noautotarget", 0 },
103 static struct poolflags2str {
107 } poolflags2str[] = {
108 { POOL_FLAG_PROMOTEEPOCH, "promoteepoch", 0 },
109 { POOL_FLAG_FORBIDSELFCONFLICTS, "forbidselfconflicts", 0 },
110 { POOL_FLAG_OBSOLETEUSESPROVIDES, "obsoleteusesprovides", 0 },
111 { POOL_FLAG_IMPLICITOBSOLETEUSESPROVIDES, "implicitobsoleteusesprovides", 0 },
112 { POOL_FLAG_OBSOLETEUSESCOLORS, "obsoleteusescolors", 0 },
113 { POOL_FLAG_IMPLICITOBSOLETEUSESCOLORS, "implicitobsoleteusescolors", 0 },
114 { POOL_FLAG_NOINSTALLEDOBSOLETES, "noinstalledobsoletes", 0 },
115 { POOL_FLAG_HAVEDISTEPOCH, "havedistepoch", 0 },
116 { POOL_FLAG_NOOBSOLETESMULTIVERSION, "noobsoletesmultiversion", 0 },
117 { POOL_FLAG_ADDFILEPROVIDESFILTERED, "addfileprovidesfiltered", 0 },
121 static struct disttype2str {
125 { DISTTYPE_RPM, "rpm" },
126 { DISTTYPE_DEB, "deb" },
127 { DISTTYPE_ARCH, "arch" },
128 { DISTTYPE_HAIKU, "haiku" },
132 static struct selflags2str {
136 { SELECTION_NAME, "name" },
137 { SELECTION_PROVIDES, "provides" },
138 { SELECTION_FILELIST, "filelist" },
139 { SELECTION_CANON, "canon" },
140 { SELECTION_DOTARCH, "dotarch" },
141 { SELECTION_REL, "rel" },
142 { SELECTION_INSTALLED_ONLY, "installedonly" },
143 { SELECTION_GLOB, "glob" },
144 { SELECTION_FLAT, "flat" },
145 { SELECTION_NOCASE, "nocase" },
146 { SELECTION_SOURCE_ONLY, "sourceonly" },
147 { SELECTION_WITH_SOURCE, "withsource" },
152 typedef struct strqueue {
157 #define STRQUEUE_BLOCK 63
160 strqueue_init(Strqueue *q)
167 strqueue_free(Strqueue *q)
170 for (i = 0; i < q->nstr; i++)
171 solv_free(q->str[i]);
172 q->str = solv_free(q->str);
177 strqueue_push(Strqueue *q, const char *s)
179 q->str = solv_extend(q->str, q->nstr, 1, sizeof(*q->str), STRQUEUE_BLOCK);
180 q->str[q->nstr++] = solv_strdup(s);
184 strqueue_pushjoin(Strqueue *q, const char *s1, const char *s2, const char *s3)
186 q->str = solv_extend(q->str, q->nstr, 1, sizeof(*q->str), STRQUEUE_BLOCK);
187 q->str[q->nstr++] = solv_dupjoin(s1, s2, s3);
191 strqueue_sort_cmp(const void *ap, const void *bp, void *dp)
193 const char *a = *(const char **)ap;
194 const char *b = *(const char **)bp;
195 return strcmp(a ? a : "", b ? b : "");
199 strqueue_sort(Strqueue *q)
202 solv_sort(q->str, q->nstr, sizeof(*q->str), strqueue_sort_cmp, 0);
206 strqueue_sort_u(Strqueue *q)
210 for (i = j = 0; i < q->nstr; i++)
211 if (!j || strqueue_sort_cmp(q->str + i, q->str + j - 1, 0) != 0)
212 q->str[j++] = q->str[i];
217 strqueue_join(Strqueue *q)
221 for (i = 0; i < q->nstr; i++)
223 l += strlen(q->str[i]) + 1;
224 l++; /* trailing \0 */
227 for (i = 0; i < q->nstr; i++)
230 strcpy(rp, q->str[i]);
239 strqueue_split(Strqueue *q, const char *s)
244 while ((p = strchr(s, '\n')) != 0)
246 q->str = solv_extend(q->str, q->nstr, 1, sizeof(*q->str), STRQUEUE_BLOCK);
247 q->str[q->nstr] = solv_malloc(p - s + 1);
249 memcpy(q->str[q->nstr], s, p - s);
250 q->str[q->nstr][p - s] = 0;
259 strqueue_diff(Strqueue *sq1, Strqueue *sq2, Strqueue *osq)
262 while (i < sq1->nstr && j < sq2->nstr)
264 int r = strqueue_sort_cmp(sq1->str + i, sq2->str + j, 0);
268 strqueue_pushjoin(osq, "-", sq1->str[i++], 0);
270 strqueue_pushjoin(osq, "+", sq2->str[j++], 0);
272 while (i < sq1->nstr)
273 strqueue_pushjoin(osq, "-", sq1->str[i++], 0);
274 while (j < sq2->nstr)
275 strqueue_pushjoin(osq, "+", sq2->str[j++], 0);
279 pool_isknownarch(Pool *pool, Id id)
281 if (!id || id == ID_EMPTY)
283 if (id == ARCH_SRC || id == ARCH_NOSRC || id == ARCH_NOARCH)
285 if (!pool->id2arch || (id > pool->lastarch || !pool->id2arch[id]))
291 testcase_str2dep(Pool *pool, char *s)
297 if ((n = strchr(s, '|')) != 0)
299 id = testcase_str2dep(pool, n + 1);
301 id = pool_rel2id(pool, testcase_str2dep(pool, s), id, REL_OR, 1);
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);
338 while (*s == ' ' || *s == '\t')
341 if (*s == '!' && s[1] == '=') /* support != as synonym for <> */
343 flags = REL_LT | REL_GT;
359 while (*s == ' ' || *s == '\t')
362 while (*s && *s != ' ' && *s != '\t')
364 evr = pool_strn2id(pool, n, s - n, 1);
365 if (*s == ' ' && !strcmp(s, " compat >= "))
368 while (*s == ' ' || *s == '\t')
371 while (*s && *s != ' ' && *s != '\t')
373 evr = pool_rel2id(pool, evr, pool_strn2id(pool, n, s - n, 1), REL_COMPAT, 1);
375 return pool_rel2id(pool, id, evr, flags, 1);
379 testcase_repoid2str(Pool *pool, Id repoid)
381 Repo *repo = pool_id2repo(pool, repoid);
384 char *r = pool_tmpjoin(pool, repo->name, 0, 0);
386 for (rp = r; *rp; rp++)
387 if (*rp == ' ' || *rp == '\t')
394 sprintf(buf, "#%d", repoid);
395 return pool_tmpjoin(pool, buf, 0, 0);
400 testcase_solvid2str(Pool *pool, Id p)
402 Solvable *s = pool->solvables + p;
403 const char *n, *e, *a;
406 if (p == SYSTEMSOLVABLE)
408 n = pool_id2str(pool, s->name);
409 e = pool_id2str(pool, s->evr);
410 a = pool_id2str(pool, s->arch);
411 str = pool_alloctmpspace(pool, strlen(n) + strlen(e) + strlen(a) + 3);
412 sprintf(str, "%s-%s.%s", n, e, a);
414 return pool_tmpappend(pool, str, "@", 0);
418 char *str2 = pool_tmpappend(pool, str, "@", s->repo->name);
420 if (str2[l] == ' ' || str2[l] == '\t')
424 sprintf(buf, "@#%d", s->repo->repoid);
425 return pool_tmpappend(pool, str, buf, 0);
429 testcase_str2repo(Pool *pool, const char *str)
433 if (str[0] == '#' && (str[1] >= '0' && str[1] <= '9'))
437 for (j = 1; str[j] >= '0' && str[j] <= '9'; j++)
438 repoid = repoid * 10 + (str[j] - '0');
439 if (!str[j] && repoid > 0 && repoid < pool->nrepos)
440 repo = pool_id2repo(pool, repoid);
444 FOR_REPOS(repoid, repo)
449 l = strlen(repo->name);
450 for (i = 0; i < l; i++)
452 int c = repo->name[i];
453 if (c == ' ' || c == '\t')
458 if (i == l && !str[l])
461 if (repoid >= pool->nrepos)
468 testcase_str2solvid(Pool *pool, const char *str)
470 int i, l = strlen(str);
477 if (*str == '@' && !strcmp(str, "@SYSTEM"))
478 return SYSTEMSOLVABLE;
480 for (i = l - 1; i >= 0; i--)
481 if (str[i] == '@' && (repo = testcase_str2repo(pool, str + i + 1)) != 0)
486 /* now find the arch (if present) */
488 for (i = repostart - 1; i > 0; i--)
491 arch = pool_strn2id(pool, str + i + 1, repostart - (i + 1), 0);
496 /* now find the name */
497 for (i = repostart - 1; i > 0; i--)
501 Id nid, evrid, p, pp;
502 nid = pool_strn2id(pool, str, i, 0);
505 evrid = pool_strn2id(pool, str + i + 1, repostart - (i + 1), 0);
508 FOR_PROVIDES(p, pp, nid)
510 Solvable *s = pool->solvables + p;
511 if (s->name != nid || s->evr != evrid)
513 if (repo && s->repo != repo)
515 if (arch && s->arch != arch)
525 testcase_job2str(Pool *pool, Id how, Id what)
532 Id select = how & SOLVER_SELECTMASK;
534 for (i = 0; job2str[i].str; i++)
535 if ((how & SOLVER_JOBMASK) == job2str[i].job)
537 jobstr = job2str[i].str ? job2str[i].str : "unknown";
538 if (select == SOLVER_SOLVABLE)
541 pkgstr = testcase_solvid2str(pool, what);
543 else if (select == SOLVER_SOLVABLE_NAME)
546 pkgstr = pool_dep2str(pool, what);
548 else if (select == SOLVER_SOLVABLE_PROVIDES)
550 selstr = " provides ";
551 pkgstr = pool_dep2str(pool, what);
553 else if (select == SOLVER_SOLVABLE_ONE_OF)
558 while ((p = pool->whatprovidesdata[what++]) != 0)
560 const char *s = testcase_solvid2str(pool, p);
563 pkgstr = pool_tmpappend(pool, pkgstr, " ", s);
564 pool_freetmpspace(pool, s);
572 else if (select == SOLVER_SOLVABLE_REPO)
574 Repo *repo = pool_id2repo(pool, what);
579 sprintf(buf, "#%d", repo->repoid);
580 pkgstr = pool_tmpjoin(pool, buf, 0, 0);
583 pkgstr = pool_tmpjoin(pool, repo->name, 0, 0);
585 else if (select == SOLVER_SOLVABLE_ALL)
592 selstr = " unknown ";
595 ret = pool_tmpjoin(pool, jobstr, selstr, pkgstr);
597 ret = pool_tmpappend(pool, ret, " ", 0);
598 for (i = 0; jobflags2str[i].str; i++)
599 if ((how & jobflags2str[i].flag) != 0)
600 ret = pool_tmpappend(pool, ret, ",", jobflags2str[i].str);
606 ret = pool_tmpappend(pool, ret, "]", 0);
612 str2selflags(Pool *pool, char *s) /* modifies the string! */
617 char *se = strchr(s, ',');
620 for (i = 0; selflags2str[i].str; i++)
621 if (!strcmp(s, selflags2str[i].str))
623 selflags |= selflags2str[i].flag;
626 if (!selflags2str[i].str)
627 pool_debug(pool, SOLV_ERROR, "str2job: unknown selection flag '%s'\n", s);
634 str2jobflags(Pool *pool, char *s) /* modifies the string */
639 char *se = strchr(s, ',');
642 for (i = 0; jobflags2str[i].str; i++)
643 if (!strcmp(s, jobflags2str[i].str))
645 jobflags |= jobflags2str[i].flag;
648 if (!jobflags2str[i].str)
649 pool_debug(pool, SOLV_ERROR, "str2job: unknown job flag '%s'\n", s);
656 testcase_str2job(Pool *pool, const char *str, Id *whatp)
666 /* so we can patch it */
667 s = pool_tmpjoin(pool, str, 0, 0);
668 /* split it in pieces */
671 while (*s == ' ' || *s == '\t')
675 pieces = solv_extend(pieces, npieces, 1, sizeof(*pieces), 7);
676 pieces[npieces++] = s;
677 while (*s && *s != ' ' && *s != '\t')
684 pool_debug(pool, SOLV_ERROR, "str2job: bad line '%s'\n", str);
689 for (i = 0; job2str[i].str; i++)
690 if (!strcmp(pieces[0], job2str[i].str))
694 pool_debug(pool, SOLV_ERROR, "str2job: unknown job '%s'\n", str);
698 job = job2str[i].job;
702 char *flags = pieces[npieces - 1];
703 if (*flags == '[' && flags[strlen(flags) - 1] == ']')
707 flags[strlen(flags) - 1] = 0;
708 job |= str2jobflags(pool, flags);
711 if (!strcmp(pieces[1], "pkg"))
715 pool_debug(pool, SOLV_ERROR, "str2job: bad pkg selector in '%s'\n", str);
719 job |= SOLVER_SOLVABLE;
720 what = testcase_str2solvid(pool, pieces[2]);
723 pool_debug(pool, SOLV_ERROR, "str2job: unknown package '%s'\n", pieces[2]);
728 else if (!strcmp(pieces[1], "name") || !strcmp(pieces[1], "provides"))
730 /* join em again for dep2str... */
732 for (sp = pieces[2]; sp < pieces[npieces - 1]; sp++)
736 if (pieces[1][0] == 'p' && strncmp(pieces[2], "namespace:", 10) == 0)
738 char *spe = strchr(pieces[2], '(');
739 int l = strlen(pieces[2]);
740 if (spe && pieces[2][l - 1] == ')')
742 /* special namespace provides */
743 if (strcmp(spe, "(<NULL>)") != 0)
745 pieces[2][l - 1] = 0;
746 what = testcase_str2dep(pool, spe + 1);
747 pieces[2][l - 1] = ')';
749 what = pool_rel2id(pool, pool_strn2id(pool, pieces[2], spe - pieces[2], 1), what, REL_NAMESPACE, 1);
753 what = testcase_str2dep(pool, pieces[2]);
754 if (pieces[1][0] == 'n')
755 job |= SOLVER_SOLVABLE_NAME;
757 job |= SOLVER_SOLVABLE_PROVIDES;
759 else if (!strcmp(pieces[1], "oneof"))
762 job |= SOLVER_SOLVABLE_ONE_OF;
764 if (npieces > 3 && strcmp(pieces[2], "nothing") != 0)
766 for (i = 2; i < npieces; i++)
768 Id p = testcase_str2solvid(pool, pieces[i]);
771 pool_debug(pool, SOLV_ERROR, "str2job: unknown package '%s'\n", pieces[i]);
779 what = pool_queuetowhatprovides(pool, &q);
782 else if (!strcmp(pieces[1], "repo"))
787 pool_debug(pool, SOLV_ERROR, "str2job: bad line '%s'\n", str);
791 repo = testcase_str2repo(pool, pieces[2]);
794 pool_debug(pool, SOLV_ERROR, "str2job: unknown repo '%s'\n", pieces[2]);
798 job |= SOLVER_SOLVABLE_REPO;
801 else if (!strcmp(pieces[1], "all"))
803 if (npieces != 3 && strcmp(pieces[2], "packages") != 0)
805 pool_debug(pool, SOLV_ERROR, "str2job: bad line '%s'\n", str);
809 job |= SOLVER_SOLVABLE_ALL;
814 pool_debug(pool, SOLV_ERROR, "str2job: unknown selection in '%s'\n", str);
824 addselectionjob(Pool *pool, char **pieces, int npieces, Queue *jobqueue)
831 for (i = 0; job2str[i].str; i++)
832 if (!strcmp(pieces[0], job2str[i].str))
836 pool_debug(pool, SOLV_ERROR, "selstr2job: unknown job '%s'\n", pieces[0]);
839 job = job2str[i].job;
842 char *flags = pieces[npieces - 1];
843 if (*flags == '[' && flags[strlen(flags) - 1] == ']')
847 flags[strlen(flags) - 1] = 0;
848 job |= str2jobflags(pool, flags);
853 pool_debug(pool, SOLV_ERROR, "selstr2job: no selection flags\n");
856 selflags = str2selflags(pool, pieces[3]);
858 r = selection_make(pool, &sel, pieces[2], selflags);
859 for (i = 0; i < sel.count; i += 2)
860 queue_push2(jobqueue, job | sel.elements[i], sel.elements[i + 1]);
866 writedeps(Repo *repo, FILE *fp, const char *tag, Id key, Solvable *s, Offset off)
868 Pool *pool = repo->pool;
875 dp = repo->idarraydata + off;
877 while ((id = *dp++) != 0)
879 if (key == SOLVABLE_REQUIRES && id == SOLVABLE_PREREQMARKER)
882 fprintf(fp, "-%s\n", tag);
887 if (key == SOLVABLE_PROVIDES && id == SOLVABLE_FILEMARKER)
892 idstr = pool_dep2str(pool, id);
895 Reldep *rd = GETRELDEP(pool, id);
896 if (key == SOLVABLE_CONFLICTS && rd->flags == REL_NAMESPACE && rd->name == NAMESPACE_OTHERPROVIDERS)
898 if (!strncmp(idstr, "namespace:", 10))
901 if (key == SOLVABLE_SUPPLEMENTS)
903 if (rd->flags == REL_NAMESPACE && rd->name == NAMESPACE_FILESYSTEM)
905 if (!strncmp(idstr, "namespace:", 10))
908 else if (rd->flags == REL_NAMESPACE && rd->name == NAMESPACE_MODALIAS)
910 if (!strncmp(idstr, "namespace:", 10))
913 else if (rd->flags == REL_AND)
915 /* either packageand chain or modalias */
917 if (ISRELDEP(rd->evr))
919 Reldep *mrd = GETRELDEP(pool, rd->evr);
920 if (mrd->flags == REL_NAMESPACE && mrd->name == NAMESPACE_MODALIAS)
922 idstr = pool_tmpjoin(pool, "modalias(", pool_dep2str(pool, rd->name), ":");
923 idstr = pool_tmpappend(pool, idstr, pool_dep2str(pool, mrd->evr), ")");
925 else if (mrd->flags >= 8)
930 /* must be and chain */
931 idstr = pool_dep2str(pool, rd->evr);
937 rd = GETRELDEP(pool, id);
938 if (rd->flags != REL_AND)
940 idstr = pool_tmpjoin(pool, pool_dep2str(pool, rd->evr), ":", idstr);
942 idstr = pool_tmpjoin(pool, pool_dep2str(pool, id), ":", idstr);
943 idstr = pool_tmpjoin(pool, "packageand(", idstr, ")");
946 else if (rd->flags >= 8)
952 fprintf(fp, "+%s\n", tag);
955 fprintf(fp, "%s\n", idstr);
957 if (key == SOLVABLE_PROVIDES)
959 /* add the filelist */
961 dataiterator_init(&di, pool, repo, s - pool->solvables, SOLVABLE_FILELIST, 0, 0);
962 while (dataiterator_step(&di))
964 const char *s = repodata_dir2str(di.data, di.kv.id, di.kv.str);
967 Id id = pool_str2id(pool, s, 0);
970 for (dp = prvdp; *dp; dp++)
974 continue; /* already included */
979 fprintf(fp, "+%s", tag);
982 fprintf(fp, "%s\n", s);
986 fprintf(fp, "-%s\n", tag);
990 testcase_write_testtags(Repo *repo, FILE *fp)
992 Pool *pool = repo->pool;
1002 fprintf(fp, "=Ver: 2.0\n");
1003 FOR_REPO_SOLVABLES(repo, p, s)
1005 name = pool_id2str(pool, s->name);
1006 evr = pool_id2str(pool, s->evr);
1007 arch = pool_id2str(pool, s->arch);
1008 release = strrchr(evr, '-');
1010 release = evr + strlen(evr);
1011 fprintf(fp, "=Pkg: %s %.*s %s %s\n", name, (int)(release - evr), evr, *release && release[1] ? release + 1 : "-", arch);
1012 tmp = solvable_lookup_str(s, SOLVABLE_SUMMARY);
1014 fprintf(fp, "=Sum: %s\n", tmp);
1015 writedeps(repo, fp, "Req:", SOLVABLE_REQUIRES, s, s->requires);
1016 writedeps(repo, fp, "Prv:", SOLVABLE_PROVIDES, s, s->provides);
1017 writedeps(repo, fp, "Obs:", SOLVABLE_OBSOLETES, s, s->obsoletes);
1018 writedeps(repo, fp, "Con:", SOLVABLE_CONFLICTS, s, s->conflicts);
1019 writedeps(repo, fp, "Rec:", SOLVABLE_RECOMMENDS, s, s->recommends);
1020 writedeps(repo, fp, "Sup:", SOLVABLE_SUPPLEMENTS, s, s->supplements);
1021 writedeps(repo, fp, "Sug:", SOLVABLE_SUGGESTS, s, s->suggests);
1022 writedeps(repo, fp, "Enh:", SOLVABLE_ENHANCES, s, s->enhances);
1024 fprintf(fp, "=Vnd: %s\n", pool_id2str(pool, s->vendor));
1025 ti = solvable_lookup_num(s, SOLVABLE_BUILDTIME, 0);
1027 fprintf(fp, "=Tim: %u\n", ti);
1032 static inline Offset
1033 adddep(Repo *repo, Offset olddeps, char *str, Id marker)
1035 Id id = *str == '/' ? pool_str2id(repo->pool, str, 1) : testcase_str2dep(repo->pool, str);
1036 return repo_addid_dep(repo, olddeps, id, marker);
1040 finish_solvable(Pool *pool, Repodata *data, Solvable *s, char *filelist, int nfilelist)
1046 for (l = 0; l < nfilelist; l += strlen(filelist + l) + 1)
1048 char *p = strrchr(filelist + l, '/');
1052 did = repodata_str2dir(data, filelist + l, 1);
1055 did = repodata_str2dir(data, "/", 1);
1056 repodata_add_dirstr(data, s - pool->solvables, SOLVABLE_FILELIST, did, p);
1059 if (s->name && s->arch != ARCH_SRC && s->arch != ARCH_NOSRC)
1060 s->provides = repo_addid_dep(s->repo, s->provides, pool_rel2id(pool, s->name, s->evr, REL_EQ, 1), 0);
1061 s->supplements = repo_fix_supplements(s->repo, s->provides, s->supplements, 0);
1062 s->conflicts = repo_fix_conflicts(s->repo, s->conflicts);
1065 /* stripped down version of susetags parser used for testcases */
1067 testcase_add_testtags(Repo *repo, FILE *fp, int flags)
1069 Pool *pool = repo->pool;
1082 data = repo_add_repodata(repo, flags);
1087 line = solv_malloc(aline);
1091 if (linep - line + 16 > aline)
1093 aline = linep - line;
1094 line = solv_realloc(line, aline + 512);
1095 linep = line + aline;
1098 if (!fgets(linep, aline - (linep - line), fp))
1100 linep += strlen(linep);
1101 if (linep == line || linep[-1] != '\n')
1104 linep = line + intag;
1107 if (line[intag] == '-' && !strncmp(line + 1, line + intag + 1, intag - 2))
1114 else if (line[0] == '+' && line[1] && line[1] != ':')
1116 char *tagend = strchr(line, ':');
1121 intag = tagend + 2 - line;
1122 linep = line + intag;
1125 if (*line != '=' || !line[1] || !line[2] || !line[3] || line[4] != ':')
1127 tag = line[1] << 16 | line[2] << 8 | line[3];
1130 case 'P' << 16 | 'k' << 8 | 'g':
1132 finish_solvable(pool, data, s, filelist, nfilelist);
1134 if (split(line + 5, sp, 5) != 4)
1136 s = pool_id2solvable(pool, repo_add_solvable(repo));
1137 s->name = pool_str2id(pool, sp[0], 1);
1138 /* join back version and release */
1139 if (sp[2] && !(sp[2][0] == '-' && !sp[2][1]))
1141 s->evr = makeevr(pool, sp[1]);
1142 s->arch = pool_str2id(pool, sp[3], 1);
1144 case 'S' << 16 | 'u' << 8 | 'm':
1145 repodata_set_str(data, s - pool->solvables, SOLVABLE_SUMMARY, line + 6);
1147 case 'V' << 16 | 'n' << 8 | 'd':
1148 s->vendor = pool_str2id(pool, line + 6, 1);
1150 case 'T' << 16 | 'i' << 8 | 'm':
1153 repodata_set_num(data, s - pool->solvables, SOLVABLE_BUILDTIME, t);
1155 case 'R' << 16 | 'e' << 8 | 'q':
1156 s->requires = adddep(repo, s->requires, line + 6, -SOLVABLE_PREREQMARKER);
1158 case 'P' << 16 | 'r' << 8 | 'q':
1159 s->requires = adddep(repo, s->requires, line + 6, SOLVABLE_PREREQMARKER);
1161 case 'P' << 16 | 'r' << 8 | 'v':
1164 int l = strlen(line + 6) + 1;
1165 if (nfilelist + l > afilelist)
1167 afilelist = nfilelist + l + 512;
1168 filelist = solv_realloc(filelist, afilelist);
1170 memcpy(filelist + nfilelist, line + 6, l);
1177 for (l = 0; l < nfilelist; l += strlen(filelist + l) + 1)
1178 s->provides = repo_addid_dep(repo, s->provides, pool_str2id(pool, filelist + l, 1), 0);
1181 s->provides = adddep(repo, s->provides, line + 6, 0);
1183 case 'O' << 16 | 'b' << 8 | 's':
1184 s->obsoletes = adddep(repo, s->obsoletes, line + 6, 0);
1186 case 'C' << 16 | 'o' << 8 | 'n':
1187 s->conflicts = adddep(repo, s->conflicts, line + 6, 0);
1189 case 'R' << 16 | 'e' << 8 | 'c':
1190 s->recommends = adddep(repo, s->recommends, line + 6, 0);
1192 case 'S' << 16 | 'u' << 8 | 'p':
1193 s->supplements = adddep(repo, s->supplements, line + 6, 0);
1195 case 'S' << 16 | 'u' << 8 | 'g':
1196 s->suggests = adddep(repo, s->suggests, line + 6, 0);
1198 case 'E' << 16 | 'n' << 8 | 'h':
1199 s->enhances = adddep(repo, s->enhances, line + 6, 0);
1206 finish_solvable(pool, data, s, filelist, nfilelist);
1208 solv_free(filelist);
1209 repodata_free_dircache(data);
1210 if (!(flags & REPO_NO_INTERNALIZE))
1211 repodata_internalize(data);
1216 testcase_getpoolflags(Pool *pool)
1218 const char *str = 0;
1220 for (i = 0; poolflags2str[i].str; i++)
1222 v = pool_get_flag(pool, poolflags2str[i].flag);
1223 if (v == poolflags2str[i].def)
1225 str = pool_tmpappend(pool, str, v ? " " : " !", poolflags2str[i].str);
1227 return str ? str + 1 : "";
1231 testcase_setpoolflags(Pool *pool, const char *str)
1233 const char *p = str, *s;
1237 while (*p == ' ' || *p == '\t' || *p == ',')
1248 while (*p && *p != ' ' && *p != '\t' && *p != ',')
1250 for (i = 0; poolflags2str[i].str; i++)
1251 if (!strncmp(poolflags2str[i].str, s, p - s) && poolflags2str[i].str[p - s] == 0)
1253 if (!poolflags2str[i].str)
1255 pool_debug(pool, SOLV_ERROR, "setpoolflags: unknown flag '%.*s'\n", (int)(p - s), s);
1258 pool_set_flag(pool, poolflags2str[i].flag, v);
1264 testcase_resetpoolflags(Pool *pool)
1267 for (i = 0; poolflags2str[i].str; i++)
1268 pool_set_flag(pool, poolflags2str[i].flag, poolflags2str[i].def);
1272 testcase_getsolverflags(Solver *solv)
1274 Pool *pool = solv->pool;
1275 const char *str = 0;
1277 for (i = 0; solverflags2str[i].str; i++)
1279 v = solver_get_flag(solv, solverflags2str[i].flag);
1280 if (v == solverflags2str[i].def)
1282 str = pool_tmpappend(pool, str, v ? " " : " !", solverflags2str[i].str);
1284 return str ? str + 1 : "";
1288 testcase_setsolverflags(Solver *solv, const char *str)
1290 const char *p = str, *s;
1294 while (*p == ' ' || *p == '\t' || *p == ',')
1305 while (*p && *p != ' ' && *p != '\t' && *p != ',')
1307 for (i = 0; solverflags2str[i].str; i++)
1308 if (!strncmp(solverflags2str[i].str, s, p - s) && solverflags2str[i].str[p - s] == 0)
1310 if (!solverflags2str[i].str)
1312 pool_debug(solv->pool, SOLV_ERROR, "setsolverflags: unknown flag '%.*s'\n", (int)(p - s), s);
1315 solver_set_flag(solv, solverflags2str[i].flag, v);
1321 testcase_resetsolverflags(Solver *solv)
1324 for (i = 0; solverflags2str[i].str; i++)
1325 solver_set_flag(solv, solverflags2str[i].flag, solverflags2str[i].def);
1329 testcase_ruleid(Solver *solv, Id rid)
1335 const unsigned char *md5;
1341 solver_ruleliterals(solv, rid, &q);
1342 for (i = 0; i < q.count; i++)
1344 Id p = q.elements[i];
1345 s = testcase_solvid2str(solv->pool, p > 0 ? p : -p);
1347 s = pool_tmpjoin(solv->pool, "!", s, 0);
1348 strqueue_push(&sq, s);
1351 strqueue_sort_u(&sq);
1352 chk = solv_chksum_create(REPOKEY_TYPE_MD5);
1353 for (i = 0; i < sq.nstr; i++)
1354 solv_chksum_add(chk, sq.str[i], strlen(sq.str[i]) + 1);
1355 md5 = solv_chksum_get(chk, &md5l);
1356 s = pool_bin2hex(solv->pool, md5, md5l);
1357 chk = solv_chksum_free(chk, 0);
1363 testcase_problemid(Solver *solv, Id problem)
1368 const unsigned char *md5;
1372 /* we build a hash of all rules that define the problem */
1375 solver_findallproblemrules(solv, problem, &q);
1376 for (i = 0; i < q.count; i++)
1377 strqueue_push(&sq, testcase_ruleid(solv, q.elements[i]));
1379 strqueue_sort_u(&sq);
1380 chk = solv_chksum_create(REPOKEY_TYPE_MD5);
1381 for (i = 0; i < sq.nstr; i++)
1382 solv_chksum_add(chk, sq.str[i], strlen(sq.str[i]) + 1);
1383 md5 = solv_chksum_get(chk, &md5l);
1384 s = pool_bin2hex(solv->pool, md5, 4);
1385 chk = solv_chksum_free(chk, 0);
1391 testcase_solutionid(Solver *solv, Id problem, Id solution)
1395 const unsigned char *md5;
1399 intid = solver_solutionelement_internalid(solv, problem, solution);
1400 /* internal stuff! handle with care! */
1404 s = testcase_job2str(solv->pool, solv->job.elements[-intid - 1], solv->job.elements[-intid]);
1409 s = testcase_ruleid(solv, intid);
1411 chk = solv_chksum_create(REPOKEY_TYPE_MD5);
1412 solv_chksum_add(chk, s, strlen(s) + 1);
1413 md5 = solv_chksum_get(chk, &md5l);
1414 s = pool_bin2hex(solv->pool, md5, 4);
1415 chk = solv_chksum_free(chk, 0);
1419 static struct class2str {
1423 { SOLVER_TRANSACTION_ERASE, "erase" },
1424 { SOLVER_TRANSACTION_INSTALL, "install" },
1425 { SOLVER_TRANSACTION_REINSTALLED, "reinstall" },
1426 { SOLVER_TRANSACTION_DOWNGRADED, "downgrade" },
1427 { SOLVER_TRANSACTION_CHANGED, "change" },
1428 { SOLVER_TRANSACTION_UPGRADED, "upgrade" },
1429 { SOLVER_TRANSACTION_OBSOLETED, "obsolete" },
1430 { SOLVER_TRANSACTION_MULTIINSTALL, "multiinstall" },
1431 { SOLVER_TRANSACTION_MULTIREINSTALL, "multireinstall" },
1436 testcase_solverresult(Solver *solv, int resultflags)
1438 Pool *pool = solv->pool;
1446 if ((resultflags & TESTCASE_RESULT_TRANSACTION) != 0)
1448 Transaction *trans = solver_create_transaction(solv);
1452 for (i = 0; class2str[i].str; i++)
1455 transaction_classify_pkgs(trans, SOLVER_TRANSACTION_KEEP_PSEUDO, class2str[i].class, 0, 0, &q);
1456 for (j = 0; j < q.count; j++)
1460 if (pool->installed && pool->solvables[p].repo == pool->installed)
1461 op = transaction_obs_pkg(trans, p);
1462 s = pool_tmpjoin(pool, class2str[i].str, " ", testcase_solvid2str(pool, p));
1464 s = pool_tmpjoin(pool, s, " ", testcase_solvid2str(pool, op));
1465 strqueue_push(&sq, s);
1469 transaction_free(trans);
1471 if ((resultflags & TESTCASE_RESULT_PROBLEMS) != 0)
1473 char *probprefix, *solprefix;
1474 int problem, solution, element;
1477 pcnt = solver_problem_count(solv);
1478 for (problem = 1; problem <= pcnt; problem++)
1480 Id rid, from, to, dep;
1481 SolverRuleinfo rinfo;
1482 rid = solver_findproblemrule(solv, problem);
1483 s = testcase_problemid(solv, problem);
1484 probprefix = solv_dupjoin("problem ", s, 0);
1485 rinfo = solver_ruleinfo(solv, rid, &from, &to, &dep);
1486 s = pool_tmpjoin(pool, probprefix, " info ", solver_problemruleinfo2str(solv, rinfo, from, to, dep));
1487 strqueue_push(&sq, s);
1488 scnt = solver_solution_count(solv, problem);
1489 for (solution = 1; solution <= scnt; solution++)
1491 s = testcase_solutionid(solv, problem, solution);
1492 solprefix = solv_dupjoin(probprefix, " solution ", s);
1494 while ((element = solver_next_solutionelement(solv, problem, solution, element, &p, &op)) != 0)
1496 if (p == SOLVER_SOLUTION_JOB)
1497 s = pool_tmpjoin(pool, solprefix, " deljob ", testcase_job2str(pool, solv->job.elements[op - 1], solv->job.elements[op]));
1498 else if (p > 0 && op == 0)
1499 s = pool_tmpjoin(pool, solprefix, " erase ", testcase_solvid2str(pool, p));
1500 else if (p > 0 && op > 0)
1502 s = pool_tmpjoin(pool, solprefix, " replace ", testcase_solvid2str(pool, p));
1503 s = pool_tmpappend(pool, s, " ", testcase_solvid2str(pool, op));
1505 else if (p < 0 && op > 0)
1506 s = pool_tmpjoin(pool, solprefix, " allow ", testcase_solvid2str(pool, op));
1508 s = pool_tmpjoin(pool, solprefix, " unknown", 0);
1509 strqueue_push(&sq, s);
1511 solv_free(solprefix);
1513 solv_free(probprefix);
1517 if ((resultflags & TESTCASE_RESULT_ORPHANED) != 0)
1522 solver_get_orphaned(solv, &q);
1523 for (i = 0; i < q.count; i++)
1525 s = pool_tmpjoin(pool, "orphaned ", testcase_solvid2str(pool, q.elements[i]), 0);
1526 strqueue_push(&sq, s);
1531 if ((resultflags & TESTCASE_RESULT_RECOMMENDED) != 0)
1537 solver_get_recommendations(solv, &qr, &qs, 0);
1538 for (i = 0; i < qr.count; i++)
1540 s = pool_tmpjoin(pool, "recommended ", testcase_solvid2str(pool, qr.elements[i]), 0);
1541 strqueue_push(&sq, s);
1543 for (i = 0; i < qs.count; i++)
1545 s = pool_tmpjoin(pool, "suggested ", testcase_solvid2str(pool, qs.elements[i]), 0);
1546 strqueue_push(&sq, s);
1552 if ((resultflags & TESTCASE_RESULT_UNNEEDED) != 0)
1557 solver_get_unneeded(solv, &q, 0);
1558 for (i = 0; i < q.count; i++)
1560 s = pool_tmpjoin(pool, "unneeded ", testcase_solvid2str(pool, q.elements[i]), 0);
1561 strqueue_push(&sq, s);
1567 result = strqueue_join(&sq);
1574 testcase_write(Solver *solv, char *dir, int resultflags, const char *testcasename, const char *resultname)
1576 Pool *pool = solv->pool;
1587 testcasename = "testcase.t";
1589 resultname = "solver.result";
1591 if (mkdir(dir, 0777) && errno != EEXIST)
1593 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: could not create directory '%s'\n", dir);
1597 FOR_REPOS(repoid, repo)
1599 const char *name = testcase_repoid2str(pool, repoid);
1601 if (repo->subpriority)
1602 sprintf(priobuf, "%d.%d", repo->priority, repo->subpriority);
1604 sprintf(priobuf, "%d", repo->priority);
1605 out = pool_tmpjoin(pool, name, ".repo", ".gz");
1606 cmd = pool_tmpjoin(pool, "repo ", name, " ");
1607 cmd = pool_tmpappend(pool, cmd, priobuf, " ");
1608 cmd = pool_tmpappend(pool, cmd, "testtags ", out);
1609 strqueue_push(&sq, cmd);
1610 out = pool_tmpjoin(pool, dir, "/", out);
1611 if (!(fp = solv_xfopen(out, "w")))
1613 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: could not open '%s' for writing\n", out);
1617 testcase_write_testtags(repo, fp);
1620 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: write error\n");
1625 /* hmm, this is not optimal... we currently search for the lowest score */
1627 arch = pool->solvables[SYSTEMSOLVABLE].arch;
1628 for (i = 0; i < pool->lastarch; i++)
1630 if (pool->id2arch[i] == 1 && !lowscore)
1632 if (pool->id2arch[i] > 0x10000 && (!lowscore || pool->id2arch[i] < lowscore))
1635 lowscore = pool->id2arch[i];
1638 cmd = pool_tmpjoin(pool, "system ", pool->lastarch ? pool_id2str(pool, arch) : "unset", 0);
1639 for (i = 0; disttype2str[i].str != 0; i++)
1640 if (pool->disttype == disttype2str[i].type)
1642 pool_tmpappend(pool, cmd, " ", disttype2str[i].str ? disttype2str[i].str : "unknown");
1643 if (pool->installed)
1644 cmd = pool_tmpappend(pool, cmd, " ", testcase_repoid2str(pool, pool->installed->repoid));
1645 strqueue_push(&sq, cmd);
1646 s = testcase_getpoolflags(solv->pool);
1649 cmd = pool_tmpjoin(pool, "poolflags ", s, 0);
1650 strqueue_push(&sq, cmd);
1653 if (pool->vendorclasses)
1656 for (i = 0; pool->vendorclasses[i]; i++)
1658 cmd = pool_tmpappend(pool, cmd ? cmd : "vendorclass", " ", pool->vendorclasses[i]);
1659 if (!pool->vendorclasses[i + 1])
1661 strqueue_push(&sq, cmd);
1668 s = testcase_getsolverflags(solv);
1671 cmd = pool_tmpjoin(pool, "solverflags ", s, 0);
1672 strqueue_push(&sq, cmd);
1675 /* now dump all the ns callback values we know */
1676 if (pool->nscallback)
1680 for (rid = 1; rid < pool->nrels; rid++)
1682 Reldep *rd = pool->rels + rid;
1683 if (rd->flags != REL_NAMESPACE || rd->name == NAMESPACE_OTHERPROVIDERS)
1685 /* evaluate all namespace ids, skip empty results */
1686 d = pool_whatprovides(pool, MAKERELDEP(rid));
1687 if (!d || !pool->whatprovidesdata[d])
1689 cmd = pool_tmpjoin(pool, "namespace ", pool_id2str(pool, rd->name), "(");
1690 cmd = pool_tmpappend(pool, cmd, pool_id2str(pool, rd->evr), ")");
1691 for (; pool->whatprovidesdata[d]; d++)
1692 cmd = pool_tmpappend(pool, cmd, " ", testcase_solvid2str(pool, pool->whatprovidesdata[d]));
1693 strqueue_push(&sq, cmd);
1697 for (i = 0; i < solv->job.count; i += 2)
1699 cmd = (char *)testcase_job2str(pool, solv->job.elements[i], solv->job.elements[i + 1]);
1700 cmd = pool_tmpjoin(pool, "job ", cmd, 0);
1701 strqueue_push(&sq, cmd);
1708 for (i = 0; resultflags2str[i].str; i++)
1709 if ((resultflags & resultflags2str[i].flag) != 0)
1710 cmd = pool_tmpappend(pool, cmd, cmd ? "," : 0, resultflags2str[i].str);
1711 cmd = pool_tmpjoin(pool, "result ", cmd ? cmd : "?", 0);
1712 cmd = pool_tmpappend(pool, cmd, " ", resultname);
1713 strqueue_push(&sq, cmd);
1714 result = testcase_solverresult(solv, resultflags);
1715 if (!strcmp(resultname, "<inline>"))
1719 strqueue_init(&rsq);
1720 strqueue_split(&rsq, result);
1721 for (i = 0; i < rsq.nstr; i++)
1723 cmd = pool_tmpjoin(pool, "#>", rsq.str[i], 0);
1724 strqueue_push(&sq, cmd);
1726 strqueue_free(&rsq);
1730 out = pool_tmpjoin(pool, dir, "/", resultname);
1731 if (!(fp = fopen(out, "w")))
1733 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: could not open '%s' for writing\n", out);
1738 if (result && *result && fwrite(result, strlen(result), 1, fp) != 1)
1740 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: write error\n");
1748 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: write error\n");
1756 cmd = strqueue_join(&sq);
1757 out = pool_tmpjoin(pool, dir, "/", testcasename);
1758 if (!(fp = fopen(out, "w")))
1760 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: could not open '%s' for writing\n", out);
1764 if (*cmd && fwrite(cmd, strlen(cmd), 1, fp) != 1)
1766 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: write error\n");
1773 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: write error\n");
1783 read_inline_file(FILE *fp, char **bufp, char **bufpp, int *buflp)
1785 char *result = solv_malloc(1024);
1792 if (rp - result + 256 >= resultl)
1794 resultl = rp - result;
1795 result = solv_realloc(result, resultl + 1024);
1796 rp = result + resultl;
1799 if (!fgets(rp, resultl - (rp - result), fp))
1802 if (rl && (rp == result || rp[-1] == '\n'))
1804 if (rl > 1 && rp[0] == '#' && rp[1] == '>')
1806 memmove(rp, rp + 2, rl - 2);
1811 while (rl + 16 > *buflp)
1813 *bufp = solv_realloc(*bufp, *buflp + 512);
1816 memmove(*bufp, rp, rl);
1817 if ((*bufp)[rl - 1] == '\n')
1823 (*bufpp) = *bufp + rl;
1840 char *result = solv_malloc(1024);
1847 if (rp - result + 256 >= resultl)
1849 resultl = rp - result;
1850 result = solv_realloc(result, resultl + 1024);
1851 rp = result + resultl;
1854 rl = fread(rp, 1, resultl - (rp - result), fp);
1866 str2resultflags(Pool *pool, char *s) /* modifies the string! */
1868 int i, resultflags = 0;
1871 char *se = strchr(s, ',');
1874 for (i = 0; resultflags2str[i].str; i++)
1875 if (!strcmp(s, resultflags2str[i].str))
1877 resultflags |= resultflags2str[i].flag;
1880 if (!resultflags2str[i].str)
1881 pool_debug(pool, SOLV_ERROR, "result: unknown flag '%s'\n", s);
1888 testcase_read(Pool *pool, FILE *fp, char *testcase, Queue *job, char **resultp, int *resultflagsp)
1893 char *testcasedir, *s;
1899 int poolflagsreset = 0;
1901 if (!fp && !(fp = fopen(testcase, "r")))
1903 pool_debug(pool, SOLV_ERROR, "testcase_read: could not open '%s'\n", testcase);
1906 testcasedir = solv_strdup(testcase);
1907 if ((s = strrchr(testcasedir, '/')) != 0)
1912 buf = solv_malloc(bufl);
1917 if (bufp - buf + 16 > bufl)
1920 buf = solv_realloc(buf, bufl + 512);
1924 if (!fgets(bufp, bufl - (bufp - buf), fp))
1928 if (!l || buf[l - 1] != '\n')
1935 while (*s && (*s == ' ' || *s == '\t'))
1937 if (!*s || *s == '#')
1940 /* split it in pieces */
1943 while (*s == ' ' || *s == '\t')
1947 pieces = solv_extend(pieces, npieces, 1, sizeof(*pieces), 7);
1948 pieces[npieces++] = s;
1949 while (*s && *s != ' ' && *s != '\t')
1954 pieces = solv_extend(pieces, npieces, 1, sizeof(*pieces), 7);
1955 pieces[npieces] = 0;
1956 if (!strcmp(pieces[0], "repo") && npieces >= 4)
1958 Repo *repo = repo_create(pool, pieces[1]);
1964 if (!poolflagsreset)
1967 testcase_resetpoolflags(pool); /* hmm */
1969 if (sscanf(pieces[2], "%d.%d", &prio, &subprio) != 2)
1972 prio = atoi(pieces[2]);
1974 repo->priority = prio;
1975 repo->subpriority = subprio;
1976 if (strcmp(pieces[3], "empty") != 0)
1978 const char *repotype = pool_tmpjoin(pool, pieces[3], 0, 0); /* gets overwritten in <inline> case */
1979 if (!strcmp(pieces[4], "<inline>"))
1981 char *idata = read_inline_file(fp, &buf, &bufp, &bufl);
1983 rfp = solv_xfopen_buf(rdata, &idata, 0, "rf");
1987 rdata = pool_tmpjoin(pool, testcasedir, pieces[4], 0);
1988 rfp = solv_xfopen(rdata, "r");
1992 pool_debug(pool, SOLV_ERROR, "testcase_read: could not open '%s'\n", rdata);
1994 else if (!strcmp(repotype, "testtags"))
1996 testcase_add_testtags(repo, rfp, 0);
1999 else if (!strcmp(repotype, "solv"))
2001 repo_add_solv(repo, rfp, 0);
2005 else if (!strcmp(repotype, "helix"))
2007 extern int repo_add_helix(Repo *repo, FILE *fp, int flags);
2008 repo_add_helix(repo, rfp, 0);
2015 pool_debug(pool, SOLV_ERROR, "testcase_read: unknown repo type for repo '%s'\n", repo->name);
2019 else if (!strcmp(pieces[0], "system") && npieces >= 3)
2023 /* must set the disttype before the arch */
2024 for (i = 0; disttype2str[i].str != 0; i++)
2025 if (!strcmp(disttype2str[i].str, pieces[2]))
2027 if (!disttype2str[i].str)
2028 pool_debug(pool, SOLV_ERROR, "testcase_read: system: unknown disttype '%s'\n", pieces[2]);
2029 else if (pool->disttype != disttype2str[i].type)
2031 #ifdef MULTI_SEMANTICS
2032 pool_setdisttype(pool, disttype2str[i].type);
2034 pool_debug(pool, SOLV_ERROR, "testcase_read: system: cannot change disttype to '%s'\n", pieces[2]);
2037 if (strcmp(pieces[1], "unset") == 0)
2038 pool_setarch(pool, 0);
2039 else if (pieces[1][0] == ':')
2040 pool_setarchpolicy(pool, pieces[1] + 1);
2042 pool_setarch(pool, pieces[1]);
2045 Repo *repo = testcase_str2repo(pool, pieces[3]);
2047 pool_debug(pool, SOLV_ERROR, "testcase_read: system: unknown repo '%s'\n", pieces[3]);
2049 pool_set_installed(pool, repo);
2052 else if (!strcmp(pieces[0], "job") && npieces > 1)
2058 pool_addfileprovides(pool);
2059 pool_createwhatprovides(pool);
2062 if (npieces >= 3 && !strcmp(pieces[2], "selection"))
2064 addselectionjob(pool, pieces + 1, npieces - 1, job);
2068 for (sp = pieces[1]; sp < pieces[npieces - 1]; sp++)
2071 how = testcase_str2job(pool, pieces[1], &what);
2072 if (how >= 0 && job)
2073 queue_push2(job, how, what);
2075 else if (!strcmp(pieces[0], "vendorclass") && npieces > 1)
2077 pool_addvendorclass(pool, (const char **)(pieces + 1));
2079 else if (!strcmp(pieces[0], "namespace") && npieces > 1)
2081 int i = strlen(pieces[1]);
2082 s = strchr(pieces[1], '(');
2083 if (!s && pieces[1][i - 1] != ')')
2085 pool_debug(pool, SOLV_ERROR, "testcase_read: bad namespace '%s'\n", pieces[1]);
2093 pieces[1][i - 1] = 0;
2094 name = pool_str2id(pool, pieces[1], 1);
2095 evr = pool_str2id(pool, s + 1, 1);
2097 pieces[1][i - 1] = ')';
2098 id = pool_rel2id(pool, name, evr, REL_NAMESPACE, 1);
2099 for (i = 2; i < npieces; i++)
2100 queue_push(&q, testcase_str2solvid(pool, pieces[i]));
2101 /* now do the callback */
2104 pool_addfileprovides(pool);
2105 pool_createwhatprovides(pool);
2108 pool->whatprovides_rel[GETRELID(id)] = pool_queuetowhatprovides(pool, &q);
2112 else if (!strcmp(pieces[0], "poolflags"))
2115 if (!poolflagsreset)
2118 testcase_resetpoolflags(pool); /* hmm */
2120 for (i = 1; i < npieces; i++)
2121 testcase_setpoolflags(pool, pieces[i]);
2123 else if (!strcmp(pieces[0], "solverflags") && npieces > 1)
2128 solv = solver_create(pool);
2129 testcase_resetsolverflags(solv);
2131 for (i = 1; i < npieces; i++)
2132 testcase_setsolverflags(solv, pieces[i]);
2134 else if (!strcmp(pieces[0], "result") && npieces > 2)
2137 int resultflags = str2resultflags(pool, pieces[1]);
2138 const char *rdata = pool_tmpjoin(pool, testcasedir, pieces[2], 0);
2139 if (!strcmp(pieces[2], "<inline>"))
2140 result = read_inline_file(fp, &buf, &bufp, &bufl);
2143 FILE *rfp = fopen(rdata, "r");
2145 pool_debug(pool, SOLV_ERROR, "testcase_read: could not open '%s'\n", rdata);
2148 result = read_file(rfp);
2157 *resultflagsp = resultflags;
2159 else if (!strcmp(pieces[0], "nextjob") && npieces == 1)
2165 pool_debug(pool, SOLV_ERROR, "testcase_read: cannot parse command '%s'\n", pieces[0]);
2168 buf = solv_free(buf);
2169 pieces = solv_free(pieces);
2170 solv_free(testcasedir);
2173 pool_addfileprovides(pool);
2174 pool_createwhatprovides(pool);
2178 solv = solver_create(pool);
2179 testcase_resetsolverflags(solv);
2187 testcase_resultdiff(char *result1, char *result2)
2189 Strqueue sq1, sq2, osq;
2191 strqueue_init(&sq1);
2192 strqueue_init(&sq2);
2193 strqueue_init(&osq);
2194 strqueue_split(&sq1, result1);
2195 strqueue_split(&sq2, result2);
2196 strqueue_sort(&sq1);
2197 strqueue_sort(&sq2);
2198 strqueue_diff(&sq1, &sq2, &osq);
2199 r = osq.nstr ? strqueue_join(&osq) : 0;
2200 strqueue_free(&sq1);
2201 strqueue_free(&sq2);
2202 strqueue_free(&osq);