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_NOINSTALLEDOBSOLETES, "noinstalledobsoletes", 0 },
114 { POOL_FLAG_HAVEDISTEPOCH, "havedistepoch", 0 },
115 { POOL_FLAG_NOOBSOLETESMULTIVERSION, "noobsoletesmultiversion", 0 },
119 static struct disttype2str {
123 { DISTTYPE_RPM, "rpm" },
124 { DISTTYPE_DEB, "deb" },
125 { DISTTYPE_ARCH, "arch" },
129 static struct selflags2str {
133 { SELECTION_NAME, "name" },
134 { SELECTION_PROVIDES, "provides" },
135 { SELECTION_FILELIST, "filelist" },
136 { SELECTION_CANON, "canon" },
137 { SELECTION_DOTARCH, "dotarch" },
138 { SELECTION_REL, "rel" },
139 { SELECTION_INSTALLED_ONLY, "installedonly" },
140 { SELECTION_GLOB, "glob" },
141 { SELECTION_FLAT, "flat" },
142 { SELECTION_NOCASE, "nocase" },
143 { SELECTION_SOURCE_ONLY, "sourceonly" },
144 { SELECTION_WITH_SOURCE, "withsource" },
149 typedef struct strqueue {
154 #define STRQUEUE_BLOCK 63
157 strqueue_init(Strqueue *q)
164 strqueue_free(Strqueue *q)
167 for (i = 0; i < q->nstr; i++)
168 solv_free(q->str[i]);
169 q->str = solv_free(q->str);
174 strqueue_push(Strqueue *q, const char *s)
176 q->str = solv_extend(q->str, q->nstr, 1, sizeof(*q->str), STRQUEUE_BLOCK);
177 q->str[q->nstr++] = solv_strdup(s);
181 strqueue_pushjoin(Strqueue *q, const char *s1, const char *s2, const char *s3)
183 q->str = solv_extend(q->str, q->nstr, 1, sizeof(*q->str), STRQUEUE_BLOCK);
184 q->str[q->nstr++] = solv_dupjoin(s1, s2, s3);
188 strqueue_sort_cmp(const void *ap, const void *bp, void *dp)
190 const char *a = *(const char **)ap;
191 const char *b = *(const char **)bp;
192 return strcmp(a ? a : "", b ? b : "");
196 strqueue_sort(Strqueue *q)
199 solv_sort(q->str, q->nstr, sizeof(*q->str), strqueue_sort_cmp, 0);
203 strqueue_sort_u(Strqueue *q)
207 for (i = j = 0; i < q->nstr; i++)
208 if (!j || strqueue_sort_cmp(q->str + i, q->str + j - 1, 0) != 0)
209 q->str[j++] = q->str[i];
214 strqueue_join(Strqueue *q)
218 for (i = 0; i < q->nstr; i++)
220 l += strlen(q->str[i]) + 1;
221 l++; /* trailing \0 */
224 for (i = 0; i < q->nstr; i++)
227 strcpy(rp, q->str[i]);
236 strqueue_split(Strqueue *q, const char *s)
241 while ((p = strchr(s, '\n')) != 0)
243 q->str = solv_extend(q->str, q->nstr, 1, sizeof(*q->str), STRQUEUE_BLOCK);
244 q->str[q->nstr] = solv_malloc(p - s + 1);
246 memcpy(q->str[q->nstr], s, p - s);
247 q->str[q->nstr][p - s] = 0;
256 strqueue_diff(Strqueue *sq1, Strqueue *sq2, Strqueue *osq)
259 while (i < sq1->nstr && j < sq2->nstr)
261 int r = strqueue_sort_cmp(sq1->str + i, sq2->str + j, 0);
265 strqueue_pushjoin(osq, "-", sq1->str[i++], 0);
267 strqueue_pushjoin(osq, "+", sq2->str[j++], 0);
269 while (i < sq1->nstr)
270 strqueue_pushjoin(osq, "-", sq1->str[i++], 0);
271 while (j < sq2->nstr)
272 strqueue_pushjoin(osq, "+", sq2->str[j++], 0);
276 pool_isknownarch(Pool *pool, Id id)
278 if (!id || id == ID_EMPTY)
280 if (id == ARCH_SRC || id == ARCH_NOSRC || id == ARCH_NOARCH)
282 if (!pool->id2arch || (id > pool->lastarch || !pool->id2arch[id]))
288 testcase_str2dep(Pool *pool, char *s)
294 if ((n = strchr(s, '|')) != 0)
296 id = testcase_str2dep(pool, n + 1);
298 id = pool_rel2id(pool, testcase_str2dep(pool, s), id, REL_OR, 1);
302 while (*s == ' ' || *s == '\t')
305 while (*s && *s != ' ' && *s != '\t' && *s != '<' && *s != '=' && *s != '>')
309 while (*s && *s != ')')
315 if ((a = strchr(n, '.')) != 0 && a + 1 < s && s[-1] != ')')
317 Id archid = pool_strn2id(pool, a + 1, s - (a + 1), 0);
318 if (pool_isknownarch(pool, archid))
320 id = pool_strn2id(pool, n, a - n, 1);
321 id = pool_rel2id(pool, id, archid, REL_ARCH, 1);
324 id = pool_strn2id(pool, n, s - n, 1);
327 id = pool_strn2id(pool, n, s - n, 1);
330 while (*s == ' ' || *s == '\t')
346 while (*s == ' ' || *s == '\t')
349 while (*s && *s != ' ' && *s != '\t')
351 return pool_rel2id(pool, id, pool_strn2id(pool, n, s - n, 1), flags, 1);
355 testcase_repoid2str(Pool *pool, Id repoid)
357 Repo *repo = pool_id2repo(pool, repoid);
360 char *r = pool_tmpjoin(pool, repo->name, 0, 0);
362 for (rp = r; *rp; rp++)
363 if (*rp == ' ' || *rp == '\t')
370 sprintf(buf, "#%d", repoid);
371 return pool_tmpjoin(pool, buf, 0, 0);
376 testcase_solvid2str(Pool *pool, Id p)
378 Solvable *s = pool->solvables + p;
379 const char *n, *e, *a;
382 if (p == SYSTEMSOLVABLE)
384 n = pool_id2str(pool, s->name);
385 e = pool_id2str(pool, s->evr);
386 a = pool_id2str(pool, s->arch);
387 str = pool_alloctmpspace(pool, strlen(n) + strlen(e) + strlen(a) + 3);
388 sprintf(str, "%s-%s.%s", n, e, a);
390 return pool_tmpappend(pool, str, "@", 0);
394 char *str2 = pool_tmpappend(pool, str, "@", s->repo->name);
396 if (str2[l] == ' ' || str2[l] == '\t')
400 sprintf(buf, "@#%d", s->repo->repoid);
401 return pool_tmpappend(pool, str, buf, 0);
405 testcase_str2repo(Pool *pool, const char *str)
409 if (str[0] == '#' && (str[1] >= '0' && str[1] <= '9'))
413 for (j = 1; str[j] >= '0' && str[j] <= '9'; j++)
414 repoid = repoid * 10 + (str[j] - '0');
415 if (!str[j] && repoid > 0 && repoid < pool->nrepos)
416 repo = pool_id2repo(pool, repoid);
420 FOR_REPOS(repoid, repo)
425 l = strlen(repo->name);
426 for (i = 0; i < l; i++)
428 int c = repo->name[i];
429 if (c == ' ' || c == '\t')
434 if (i == l && !str[l])
437 if (repoid >= pool->nrepos)
444 testcase_str2solvid(Pool *pool, const char *str)
446 int i, l = strlen(str);
453 if (*str == '@' && !strcmp(str, "@SYSTEM"))
454 return SYSTEMSOLVABLE;
456 for (i = l - 1; i >= 0; i--)
457 if (str[i] == '@' && (repo = testcase_str2repo(pool, str + i + 1)) != 0)
462 /* now find the arch (if present) */
464 for (i = repostart - 1; i > 0; i--)
467 arch = pool_strn2id(pool, str + i + 1, repostart - (i + 1), 0);
472 /* now find the name */
473 for (i = repostart - 1; i > 0; i--)
477 Id nid, evrid, p, pp;
478 nid = pool_strn2id(pool, str, i, 0);
481 evrid = pool_strn2id(pool, str + i + 1, repostart - (i + 1), 0);
484 FOR_PROVIDES(p, pp, nid)
486 Solvable *s = pool->solvables + p;
487 if (s->name != nid || s->evr != evrid)
489 if (repo && s->repo != repo)
491 if (arch && s->arch != arch)
501 testcase_job2str(Pool *pool, Id how, Id what)
508 Id select = how & SOLVER_SELECTMASK;
510 for (i = 0; job2str[i].str; i++)
511 if ((how & SOLVER_JOBMASK) == job2str[i].job)
513 jobstr = job2str[i].str ? job2str[i].str : "unknown";
514 if (select == SOLVER_SOLVABLE)
517 pkgstr = testcase_solvid2str(pool, what);
519 else if (select == SOLVER_SOLVABLE_NAME)
522 pkgstr = pool_dep2str(pool, what);
524 else if (select == SOLVER_SOLVABLE_PROVIDES)
526 selstr = " provides ";
527 pkgstr = pool_dep2str(pool, what);
529 else if (select == SOLVER_SOLVABLE_ONE_OF)
534 while ((p = pool->whatprovidesdata[what++]) != 0)
536 const char *s = testcase_solvid2str(pool, p);
539 pkgstr = pool_tmpappend(pool, pkgstr, " ", s);
540 pool_freetmpspace(pool, s);
548 else if (select == SOLVER_SOLVABLE_REPO)
550 Repo *repo = pool_id2repo(pool, what);
555 sprintf(buf, "#%d", repo->repoid);
556 pkgstr = pool_tmpjoin(pool, buf, 0, 0);
559 pkgstr = pool_tmpjoin(pool, repo->name, 0, 0);
561 else if (select == SOLVER_SOLVABLE_ALL)
568 selstr = " unknown ";
571 ret = pool_tmpjoin(pool, jobstr, selstr, pkgstr);
573 ret = pool_tmpappend(pool, ret, " ", 0);
574 for (i = 0; jobflags2str[i].str; i++)
575 if ((how & jobflags2str[i].flag) != 0)
576 ret = pool_tmpappend(pool, ret, ",", jobflags2str[i].str);
582 ret = pool_tmpappend(pool, ret, "]", 0);
588 str2selflags(Pool *pool, char *s) /* modifies the string! */
593 char *se = strchr(s, ',');
596 for (i = 0; selflags2str[i].str; i++)
597 if (!strcmp(s, selflags2str[i].str))
599 selflags |= selflags2str[i].flag;
602 if (!selflags2str[i].str)
603 pool_debug(pool, SOLV_ERROR, "str2job: unknown selection flag '%s'\n", s);
610 str2jobflags(Pool *pool, char *s) /* modifies the string */
615 char *se = strchr(s, ',');
618 for (i = 0; jobflags2str[i].str; i++)
619 if (!strcmp(s, jobflags2str[i].str))
621 jobflags |= jobflags2str[i].flag;
624 if (!jobflags2str[i].str)
625 pool_debug(pool, SOLV_ERROR, "str2job: unknown job flag '%s'\n", s);
632 testcase_str2job(Pool *pool, const char *str, Id *whatp)
642 /* so we can patch it */
643 s = pool_tmpjoin(pool, str, 0, 0);
644 /* split it in pieces */
647 while (*s == ' ' || *s == '\t')
651 pieces = solv_extend(pieces, npieces, 1, sizeof(*pieces), 7);
652 pieces[npieces++] = s;
653 while (*s && *s != ' ' && *s != '\t')
660 pool_debug(pool, SOLV_ERROR, "str2job: bad line '%s'\n", str);
665 for (i = 0; job2str[i].str; i++)
666 if (!strcmp(pieces[0], job2str[i].str))
670 pool_debug(pool, SOLV_ERROR, "str2job: unknown job '%s'\n", str);
674 job = job2str[i].job;
678 char *flags = pieces[npieces - 1];
679 if (*flags == '[' && flags[strlen(flags) - 1] == ']')
683 flags[strlen(flags) - 1] = 0;
684 job |= str2jobflags(pool, flags);
687 if (!strcmp(pieces[1], "pkg"))
691 pool_debug(pool, SOLV_ERROR, "str2job: bad pkg selector in '%s'\n", str);
695 job |= SOLVER_SOLVABLE;
696 what = testcase_str2solvid(pool, pieces[2]);
699 pool_debug(pool, SOLV_ERROR, "str2job: unknown package '%s'\n", pieces[2]);
704 else if (!strcmp(pieces[1], "name") || !strcmp(pieces[1], "provides"))
706 /* join em again for dep2str... */
708 for (sp = pieces[2]; sp < pieces[npieces - 1]; sp++)
712 if (pieces[1][0] == 'p' && strncmp(pieces[2], "namespace:", 10) == 0)
714 char *spe = strchr(pieces[2], '(');
715 int l = strlen(pieces[2]);
716 if (spe && pieces[2][l - 1] == ')')
718 /* special namespace provides */
719 if (strcmp(spe, "(<NULL>)") != 0)
721 pieces[2][l - 1] = 0;
722 what = testcase_str2dep(pool, spe + 1);
723 pieces[2][l - 1] = ')';
725 what = pool_rel2id(pool, pool_strn2id(pool, pieces[2], spe - pieces[2], 1), what, REL_NAMESPACE, 1);
729 what = testcase_str2dep(pool, pieces[2]);
730 if (pieces[1][0] == 'n')
731 job |= SOLVER_SOLVABLE_NAME;
733 job |= SOLVER_SOLVABLE_PROVIDES;
735 else if (!strcmp(pieces[1], "oneof"))
738 job |= SOLVER_SOLVABLE_ONE_OF;
740 if (npieces > 3 && strcmp(pieces[2], "nothing") != 0)
742 for (i = 2; i < npieces; i++)
744 Id p = testcase_str2solvid(pool, pieces[i]);
747 pool_debug(pool, SOLV_ERROR, "str2job: unknown package '%s'\n", pieces[i]);
755 what = pool_queuetowhatprovides(pool, &q);
758 else if (!strcmp(pieces[1], "repo"))
763 pool_debug(pool, SOLV_ERROR, "str2job: bad line '%s'\n", str);
767 repo = testcase_str2repo(pool, pieces[2]);
770 pool_debug(pool, SOLV_ERROR, "str2job: unknown repo '%s'\n", pieces[2]);
774 job |= SOLVER_SOLVABLE_REPO;
777 else if (!strcmp(pieces[1], "all"))
779 if (npieces != 3 && strcmp(pieces[2], "packages") != 0)
781 pool_debug(pool, SOLV_ERROR, "str2job: bad line '%s'\n", str);
785 job |= SOLVER_SOLVABLE_ALL;
790 pool_debug(pool, SOLV_ERROR, "str2job: unknown selection in '%s'\n", str);
800 addselectionjob(Pool *pool, char **pieces, int npieces, Queue *jobqueue)
807 for (i = 0; job2str[i].str; i++)
808 if (!strcmp(pieces[0], job2str[i].str))
812 pool_debug(pool, SOLV_ERROR, "selstr2job: unknown job '%s'\n", pieces[0]);
815 job = job2str[i].job;
818 char *flags = pieces[npieces - 1];
819 if (*flags == '[' && flags[strlen(flags) - 1] == ']')
823 flags[strlen(flags) - 1] = 0;
824 job |= str2jobflags(pool, flags);
829 pool_debug(pool, SOLV_ERROR, "selstr2job: no selection flags\n");
832 selflags = str2selflags(pool, pieces[3]);
834 r = selection_make(pool, &sel, pieces[2], selflags);
835 for (i = 0; i < sel.count; i += 2)
836 queue_push2(jobqueue, job | sel.elements[i], sel.elements[i + 1]);
842 writedeps(Repo *repo, FILE *fp, const char *tag, Id key, Solvable *s, Offset off)
844 Pool *pool = repo->pool;
851 dp = repo->idarraydata + off;
853 while ((id = *dp++) != 0)
855 if (key == SOLVABLE_REQUIRES && id == SOLVABLE_PREREQMARKER)
858 fprintf(fp, "-%s\n", tag);
863 if (key == SOLVABLE_PROVIDES && id == SOLVABLE_FILEMARKER)
868 idstr = pool_dep2str(pool, id);
871 Reldep *rd = GETRELDEP(pool, id);
872 if (key == SOLVABLE_CONFLICTS && rd->flags == REL_NAMESPACE && rd->name == NAMESPACE_OTHERPROVIDERS)
874 if (!strncmp(idstr, "namespace:", 10))
877 if (key == SOLVABLE_SUPPLEMENTS)
879 if (rd->flags == REL_NAMESPACE && rd->name == NAMESPACE_FILESYSTEM)
881 if (!strncmp(idstr, "namespace:", 10))
884 else if (rd->flags == REL_NAMESPACE && rd->name == NAMESPACE_MODALIAS)
886 if (!strncmp(idstr, "namespace:", 10))
889 else if (rd->flags == REL_AND)
891 /* either packageand chain or modalias */
893 if (ISRELDEP(rd->evr))
895 Reldep *mrd = GETRELDEP(pool, rd->evr);
896 if (mrd->flags == REL_NAMESPACE && mrd->name == NAMESPACE_MODALIAS)
898 idstr = pool_tmpjoin(pool, "modalias(", pool_dep2str(pool, rd->name), ":");
899 idstr = pool_tmpappend(pool, idstr, pool_dep2str(pool, mrd->evr), ")");
901 else if (mrd->flags >= 8)
906 /* must be and chain */
907 idstr = pool_dep2str(pool, rd->evr);
913 rd = GETRELDEP(pool, id);
914 if (rd->flags != REL_AND)
916 idstr = pool_tmpjoin(pool, pool_dep2str(pool, rd->evr), ":", idstr);
918 idstr = pool_tmpjoin(pool, pool_dep2str(pool, id), ":", idstr);
919 idstr = pool_tmpjoin(pool, "packageand(", idstr, ")");
922 else if (rd->flags >= 8)
928 fprintf(fp, "+%s\n", tag);
931 fprintf(fp, "%s\n", idstr);
933 if (key == SOLVABLE_PROVIDES)
935 /* add the filelist */
937 dataiterator_init(&di, pool, repo, s - pool->solvables, SOLVABLE_FILELIST, 0, 0);
938 while (dataiterator_step(&di))
940 const char *s = repodata_dir2str(di.data, di.kv.id, di.kv.str);
943 Id id = pool_str2id(pool, s, 0);
946 for (dp = prvdp; *dp; dp++)
950 continue; /* already included */
955 fprintf(fp, "+%s", tag);
958 fprintf(fp, "%s\n", s);
962 fprintf(fp, "-%s\n", tag);
966 testcase_write_testtags(Repo *repo, FILE *fp)
968 Pool *pool = repo->pool;
978 fprintf(fp, "=Ver: 2.0\n");
979 FOR_REPO_SOLVABLES(repo, p, s)
981 name = pool_id2str(pool, s->name);
982 evr = pool_id2str(pool, s->evr);
983 arch = pool_id2str(pool, s->arch);
984 release = strrchr(evr, '-');
986 release = evr + strlen(evr);
987 fprintf(fp, "=Pkg: %s %.*s %s %s\n", name, (int)(release - evr), evr, *release && release[1] ? release + 1 : "-", arch);
988 tmp = solvable_lookup_str(s, SOLVABLE_SUMMARY);
990 fprintf(fp, "=Sum: %s\n", tmp);
991 writedeps(repo, fp, "Req:", SOLVABLE_REQUIRES, s, s->requires);
992 writedeps(repo, fp, "Prv:", SOLVABLE_PROVIDES, s, s->provides);
993 writedeps(repo, fp, "Obs:", SOLVABLE_OBSOLETES, s, s->obsoletes);
994 writedeps(repo, fp, "Con:", SOLVABLE_CONFLICTS, s, s->conflicts);
995 writedeps(repo, fp, "Rec:", SOLVABLE_RECOMMENDS, s, s->recommends);
996 writedeps(repo, fp, "Sup:", SOLVABLE_SUPPLEMENTS, s, s->supplements);
997 writedeps(repo, fp, "Sug:", SOLVABLE_SUGGESTS, s, s->suggests);
998 writedeps(repo, fp, "Enh:", SOLVABLE_ENHANCES, s, s->enhances);
1000 fprintf(fp, "=Vnd: %s\n", pool_id2str(pool, s->vendor));
1001 ti = solvable_lookup_num(s, SOLVABLE_BUILDTIME, 0);
1003 fprintf(fp, "=Tim: %u\n", ti);
1008 static inline Offset
1009 adddep(Repo *repo, Offset olddeps, char *str, Id marker)
1011 Id id = *str == '/' ? pool_str2id(repo->pool, str, 1) : testcase_str2dep(repo->pool, str);
1012 return repo_addid_dep(repo, olddeps, id, marker);
1016 finish_solvable(Pool *pool, Repodata *data, Solvable *s, char *filelist, int nfilelist)
1022 for (l = 0; l < nfilelist; l += strlen(filelist + l) + 1)
1024 char *p = strrchr(filelist + l, '/');
1028 did = repodata_str2dir(data, filelist + l, 1);
1031 did = repodata_str2dir(data, "/", 1);
1032 repodata_add_dirstr(data, s - pool->solvables, SOLVABLE_FILELIST, did, p);
1035 if (s->name && s->arch != ARCH_SRC && s->arch != ARCH_NOSRC)
1036 s->provides = repo_addid_dep(s->repo, s->provides, pool_rel2id(pool, s->name, s->evr, REL_EQ, 1), 0);
1037 s->supplements = repo_fix_supplements(s->repo, s->provides, s->supplements, 0);
1038 s->conflicts = repo_fix_conflicts(s->repo, s->conflicts);
1041 /* stripped down version of susetags parser used for testcases */
1043 testcase_add_testtags(Repo *repo, FILE *fp, int flags)
1045 Pool *pool = repo->pool;
1058 data = repo_add_repodata(repo, flags);
1063 line = solv_malloc(aline);
1067 if (linep - line + 16 > aline)
1069 aline = linep - line;
1070 line = solv_realloc(line, aline + 512);
1071 linep = line + aline;
1074 if (!fgets(linep, aline - (linep - line), fp))
1076 linep += strlen(linep);
1077 if (linep == line || linep[-1] != '\n')
1080 linep = line + intag;
1083 if (line[intag] == '-' && !strncmp(line + 1, line + intag + 1, intag - 2))
1090 else if (line[0] == '+' && line[1] && line[1] != ':')
1092 char *tagend = strchr(line, ':');
1097 intag = tagend + 2 - line;
1098 linep = line + intag;
1101 if (*line != '=' || !line[1] || !line[2] || !line[3] || line[4] != ':')
1103 tag = line[1] << 16 | line[2] << 8 | line[3];
1106 case 'P' << 16 | 'k' << 8 | 'g':
1108 finish_solvable(pool, data, s, filelist, nfilelist);
1110 if (split(line + 5, sp, 5) != 4)
1112 s = pool_id2solvable(pool, repo_add_solvable(repo));
1113 s->name = pool_str2id(pool, sp[0], 1);
1114 /* join back version and release */
1115 if (sp[2] && !(sp[2][0] == '-' && !sp[2][1]))
1117 s->evr = makeevr(pool, sp[1]);
1118 s->arch = pool_str2id(pool, sp[3], 1);
1120 case 'S' << 16 | 'u' << 8 | 'm':
1121 repodata_set_str(data, s - pool->solvables, SOLVABLE_SUMMARY, line + 6);
1123 case 'V' << 16 | 'n' << 8 | 'd':
1124 s->vendor = pool_str2id(pool, line + 6, 1);
1126 case 'T' << 16 | 'i' << 8 | 'm':
1129 repodata_set_num(data, s - pool->solvables, SOLVABLE_BUILDTIME, t);
1131 case 'R' << 16 | 'e' << 8 | 'q':
1132 s->requires = adddep(repo, s->requires, line + 6, -SOLVABLE_PREREQMARKER);
1134 case 'P' << 16 | 'r' << 8 | 'q':
1135 s->requires = adddep(repo, s->requires, line + 6, SOLVABLE_PREREQMARKER);
1137 case 'P' << 16 | 'r' << 8 | 'v':
1140 int l = strlen(line + 6) + 1;
1141 if (nfilelist + l > afilelist)
1143 afilelist = nfilelist + l + 512;
1144 filelist = solv_realloc(filelist, afilelist);
1146 memcpy(filelist + nfilelist, line + 6, l);
1153 for (l = 0; l < nfilelist; l += strlen(filelist + l) + 1)
1154 s->provides = repo_addid_dep(repo, s->provides, pool_str2id(pool, filelist + l, 1), 0);
1157 s->provides = adddep(repo, s->provides, line + 6, 0);
1159 case 'O' << 16 | 'b' << 8 | 's':
1160 s->obsoletes = adddep(repo, s->obsoletes, line + 6, 0);
1162 case 'C' << 16 | 'o' << 8 | 'n':
1163 s->conflicts = adddep(repo, s->conflicts, line + 6, 0);
1165 case 'R' << 16 | 'e' << 8 | 'c':
1166 s->recommends = adddep(repo, s->recommends, line + 6, 0);
1168 case 'S' << 16 | 'u' << 8 | 'p':
1169 s->supplements = adddep(repo, s->supplements, line + 6, 0);
1171 case 'S' << 16 | 'u' << 8 | 'g':
1172 s->suggests = adddep(repo, s->suggests, line + 6, 0);
1174 case 'E' << 16 | 'n' << 8 | 'h':
1175 s->enhances = adddep(repo, s->enhances, line + 6, 0);
1182 finish_solvable(pool, data, s, filelist, nfilelist);
1184 solv_free(filelist);
1185 repodata_free_dircache(data);
1186 if (!(flags & REPO_NO_INTERNALIZE))
1187 repodata_internalize(data);
1192 testcase_getpoolflags(Pool *pool)
1194 const char *str = 0;
1196 for (i = 0; poolflags2str[i].str; i++)
1198 v = pool_get_flag(pool, poolflags2str[i].flag);
1199 if (v == poolflags2str[i].def)
1201 str = pool_tmpappend(pool, str, v ? " " : " !", poolflags2str[i].str);
1203 return str ? str + 1 : "";
1207 testcase_setpoolflags(Pool *pool, const char *str)
1209 const char *p = str, *s;
1213 while (*p == ' ' || *p == '\t' || *p == ',')
1224 while (*p && *p != ' ' && *p != '\t' && *p != ',')
1226 for (i = 0; poolflags2str[i].str; i++)
1227 if (!strncmp(poolflags2str[i].str, s, p - s) && poolflags2str[i].str[p - s] == 0)
1229 if (!poolflags2str[i].str)
1231 pool_debug(pool, SOLV_ERROR, "setpoolflags: unknown flag '%.*s'\n", (int)(p - s), s);
1234 pool_set_flag(pool, poolflags2str[i].flag, v);
1240 testcase_resetpoolflags(Pool *pool)
1243 for (i = 0; poolflags2str[i].str; i++)
1244 pool_set_flag(pool, poolflags2str[i].flag, poolflags2str[i].def);
1248 testcase_getsolverflags(Solver *solv)
1250 Pool *pool = solv->pool;
1251 const char *str = 0;
1253 for (i = 0; solverflags2str[i].str; i++)
1255 v = solver_get_flag(solv, solverflags2str[i].flag);
1256 if (v == solverflags2str[i].def)
1258 str = pool_tmpappend(pool, str, v ? " " : " !", solverflags2str[i].str);
1260 return str ? str + 1 : "";
1264 testcase_setsolverflags(Solver *solv, const char *str)
1266 const char *p = str, *s;
1270 while (*p == ' ' || *p == '\t' || *p == ',')
1281 while (*p && *p != ' ' && *p != '\t' && *p != ',')
1283 for (i = 0; solverflags2str[i].str; i++)
1284 if (!strncmp(solverflags2str[i].str, s, p - s) && solverflags2str[i].str[p - s] == 0)
1286 if (!solverflags2str[i].str)
1288 pool_debug(solv->pool, SOLV_ERROR, "setsolverflags: unknown flag '%.*s'\n", (int)(p - s), s);
1291 solver_set_flag(solv, solverflags2str[i].flag, v);
1297 testcase_resetsolverflags(Solver *solv)
1300 for (i = 0; solverflags2str[i].str; i++)
1301 solver_set_flag(solv, solverflags2str[i].flag, solverflags2str[i].def);
1305 testcase_ruleid(Solver *solv, Id rid)
1311 const unsigned char *md5;
1317 solver_ruleliterals(solv, rid, &q);
1318 for (i = 0; i < q.count; i++)
1320 Id p = q.elements[i];
1321 s = testcase_solvid2str(solv->pool, p > 0 ? p : -p);
1323 s = pool_tmpjoin(solv->pool, "!", s, 0);
1324 strqueue_push(&sq, s);
1327 strqueue_sort_u(&sq);
1328 chk = solv_chksum_create(REPOKEY_TYPE_MD5);
1329 for (i = 0; i < sq.nstr; i++)
1330 solv_chksum_add(chk, sq.str[i], strlen(sq.str[i]) + 1);
1331 md5 = solv_chksum_get(chk, &md5l);
1332 s = pool_bin2hex(solv->pool, md5, md5l);
1333 chk = solv_chksum_free(chk, 0);
1339 testcase_problemid(Solver *solv, Id problem)
1344 const unsigned char *md5;
1348 /* we build a hash of all rules that define the problem */
1351 solver_findallproblemrules(solv, problem, &q);
1352 for (i = 0; i < q.count; i++)
1353 strqueue_push(&sq, testcase_ruleid(solv, q.elements[i]));
1355 strqueue_sort_u(&sq);
1356 chk = solv_chksum_create(REPOKEY_TYPE_MD5);
1357 for (i = 0; i < sq.nstr; i++)
1358 solv_chksum_add(chk, sq.str[i], strlen(sq.str[i]) + 1);
1359 md5 = solv_chksum_get(chk, &md5l);
1360 s = pool_bin2hex(solv->pool, md5, 4);
1361 chk = solv_chksum_free(chk, 0);
1367 testcase_solutionid(Solver *solv, Id problem, Id solution)
1371 const unsigned char *md5;
1375 intid = solver_solutionelement_internalid(solv, problem, solution);
1376 /* internal stuff! handle with care! */
1380 s = testcase_job2str(solv->pool, solv->job.elements[-intid - 1], solv->job.elements[-intid]);
1385 s = testcase_ruleid(solv, intid);
1387 chk = solv_chksum_create(REPOKEY_TYPE_MD5);
1388 solv_chksum_add(chk, s, strlen(s) + 1);
1389 md5 = solv_chksum_get(chk, &md5l);
1390 s = pool_bin2hex(solv->pool, md5, 4);
1391 chk = solv_chksum_free(chk, 0);
1395 static struct class2str {
1399 { SOLVER_TRANSACTION_ERASE, "erase" },
1400 { SOLVER_TRANSACTION_INSTALL, "install" },
1401 { SOLVER_TRANSACTION_REINSTALLED, "reinstall" },
1402 { SOLVER_TRANSACTION_DOWNGRADED, "downgrade" },
1403 { SOLVER_TRANSACTION_CHANGED, "change" },
1404 { SOLVER_TRANSACTION_UPGRADED, "upgrade" },
1405 { SOLVER_TRANSACTION_OBSOLETED, "obsolete" },
1406 { SOLVER_TRANSACTION_MULTIINSTALL, "multiinstall" },
1407 { SOLVER_TRANSACTION_MULTIREINSTALL, "multireinstall" },
1412 testcase_solverresult(Solver *solv, int resultflags)
1414 Pool *pool = solv->pool;
1422 if ((resultflags & TESTCASE_RESULT_TRANSACTION) != 0)
1424 Transaction *trans = solver_create_transaction(solv);
1428 for (i = 0; class2str[i].str; i++)
1431 transaction_classify_pkgs(trans, SOLVER_TRANSACTION_KEEP_PSEUDO, class2str[i].class, 0, 0, &q);
1432 for (j = 0; j < q.count; j++)
1436 if (pool->installed && pool->solvables[p].repo == pool->installed)
1437 op = transaction_obs_pkg(trans, p);
1438 s = pool_tmpjoin(pool, class2str[i].str, " ", testcase_solvid2str(pool, p));
1440 s = pool_tmpjoin(pool, s, " ", testcase_solvid2str(pool, op));
1441 strqueue_push(&sq, s);
1445 transaction_free(trans);
1447 if ((resultflags & TESTCASE_RESULT_PROBLEMS) != 0)
1449 char *probprefix, *solprefix;
1450 int problem, solution, element;
1453 pcnt = solver_problem_count(solv);
1454 for (problem = 1; problem <= pcnt; problem++)
1456 Id rid, from, to, dep;
1457 SolverRuleinfo rinfo;
1458 rid = solver_findproblemrule(solv, problem);
1459 s = testcase_problemid(solv, problem);
1460 probprefix = solv_dupjoin("problem ", s, 0);
1461 rinfo = solver_ruleinfo(solv, rid, &from, &to, &dep);
1462 s = pool_tmpjoin(pool, probprefix, " info ", solver_problemruleinfo2str(solv, rinfo, from, to, dep));
1463 strqueue_push(&sq, s);
1464 scnt = solver_solution_count(solv, problem);
1465 for (solution = 1; solution <= scnt; solution++)
1467 s = testcase_solutionid(solv, problem, solution);
1468 solprefix = solv_dupjoin(probprefix, " solution ", s);
1470 while ((element = solver_next_solutionelement(solv, problem, solution, element, &p, &op)) != 0)
1472 if (p == SOLVER_SOLUTION_JOB)
1473 s = pool_tmpjoin(pool, solprefix, " deljob ", testcase_job2str(pool, solv->job.elements[op - 1], solv->job.elements[op]));
1474 else if (p > 0 && op == 0)
1475 s = pool_tmpjoin(pool, solprefix, " erase ", testcase_solvid2str(pool, p));
1476 else if (p > 0 && op > 0)
1478 s = pool_tmpjoin(pool, solprefix, " replace ", testcase_solvid2str(pool, p));
1479 s = pool_tmpappend(pool, s, " ", testcase_solvid2str(pool, op));
1481 else if (p < 0 && op > 0)
1482 s = pool_tmpjoin(pool, solprefix, " allow ", testcase_solvid2str(pool, op));
1484 s = pool_tmpjoin(pool, solprefix, " unknown", 0);
1485 strqueue_push(&sq, s);
1487 solv_free(solprefix);
1489 solv_free(probprefix);
1493 if ((resultflags & TESTCASE_RESULT_ORPHANED) != 0)
1498 solver_get_orphaned(solv, &q);
1499 for (i = 0; i < q.count; i++)
1501 s = pool_tmpjoin(pool, "orphaned ", testcase_solvid2str(pool, q.elements[i]), 0);
1502 strqueue_push(&sq, s);
1507 if ((resultflags & TESTCASE_RESULT_RECOMMENDED) != 0)
1513 solver_get_recommendations(solv, &qr, &qs, 0);
1514 for (i = 0; i < qr.count; i++)
1516 s = pool_tmpjoin(pool, "recommended ", testcase_solvid2str(pool, qr.elements[i]), 0);
1517 strqueue_push(&sq, s);
1519 for (i = 0; i < qs.count; i++)
1521 s = pool_tmpjoin(pool, "suggested ", testcase_solvid2str(pool, qs.elements[i]), 0);
1522 strqueue_push(&sq, s);
1528 if ((resultflags & TESTCASE_RESULT_UNNEEDED) != 0)
1533 solver_get_unneeded(solv, &q, 0);
1534 for (i = 0; i < q.count; i++)
1536 s = pool_tmpjoin(pool, "unneeded ", testcase_solvid2str(pool, q.elements[i]), 0);
1537 strqueue_push(&sq, s);
1543 result = strqueue_join(&sq);
1550 testcase_write(Solver *solv, char *dir, int resultflags, const char *testcasename, const char *resultname)
1552 Pool *pool = solv->pool;
1563 testcasename = "testcase.t";
1565 resultname = "solver.result";
1567 if (mkdir(dir, 0777) && errno != EEXIST)
1569 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: could not create directory '%s'\n", dir);
1573 FOR_REPOS(repoid, repo)
1575 const char *name = testcase_repoid2str(pool, repoid);
1577 if (repo->subpriority)
1578 sprintf(priobuf, "%d.%d", repo->priority, repo->subpriority);
1580 sprintf(priobuf, "%d", repo->priority);
1581 out = pool_tmpjoin(pool, name, ".repo", ".gz");
1582 cmd = pool_tmpjoin(pool, "repo ", name, " ");
1583 cmd = pool_tmpappend(pool, cmd, priobuf, " ");
1584 cmd = pool_tmpappend(pool, cmd, "testtags ", out);
1585 strqueue_push(&sq, cmd);
1586 out = pool_tmpjoin(pool, dir, "/", out);
1587 if (!(fp = solv_xfopen(out, "w")))
1589 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: could not open '%s' for writing\n", out);
1593 testcase_write_testtags(repo, fp);
1596 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: write error\n");
1601 /* hmm, this is not optimal... we currently search for the lowest score */
1603 arch = pool->solvables[SYSTEMSOLVABLE].arch;
1604 for (i = 0; i < pool->lastarch; i++)
1606 if (pool->id2arch[i] == 1 && !lowscore)
1608 if (pool->id2arch[i] > 0x10000 && (!lowscore || pool->id2arch[i] < lowscore))
1611 lowscore = pool->id2arch[i];
1614 cmd = pool_tmpjoin(pool, "system ", pool->lastarch ? pool_id2str(pool, arch) : "unset", 0);
1615 for (i = 0; disttype2str[i].str != 0; i++)
1616 if (pool->disttype == disttype2str[i].type)
1618 pool_tmpappend(pool, cmd, " ", disttype2str[i].str ? disttype2str[i].str : "unknown");
1619 if (pool->installed)
1620 cmd = pool_tmpappend(pool, cmd, " ", testcase_repoid2str(pool, pool->installed->repoid));
1621 strqueue_push(&sq, cmd);
1622 s = testcase_getpoolflags(solv->pool);
1625 cmd = pool_tmpjoin(pool, "poolflags ", s, 0);
1626 strqueue_push(&sq, cmd);
1629 if (pool->vendorclasses)
1632 for (i = 0; pool->vendorclasses[i]; i++)
1634 cmd = pool_tmpappend(pool, cmd ? cmd : "vendorclass", " ", pool->vendorclasses[i]);
1635 if (!pool->vendorclasses[i + 1])
1637 strqueue_push(&sq, cmd);
1644 s = testcase_getsolverflags(solv);
1647 cmd = pool_tmpjoin(pool, "solverflags ", s, 0);
1648 strqueue_push(&sq, cmd);
1651 /* now dump all the ns callback values we know */
1652 if (pool->nscallback)
1656 for (rid = 1; rid < pool->nrels; rid++)
1658 Reldep *rd = pool->rels + rid;
1659 if (rd->flags != REL_NAMESPACE || rd->name == NAMESPACE_OTHERPROVIDERS)
1661 /* evaluate all namespace ids, skip empty results */
1662 d = pool_whatprovides(pool, MAKERELDEP(rid));
1663 if (!d || !pool->whatprovidesdata[d])
1665 cmd = pool_tmpjoin(pool, "namespace ", pool_id2str(pool, rd->name), "(");
1666 cmd = pool_tmpappend(pool, cmd, pool_id2str(pool, rd->evr), ")");
1667 for (; pool->whatprovidesdata[d]; d++)
1668 cmd = pool_tmpappend(pool, cmd, " ", testcase_solvid2str(pool, pool->whatprovidesdata[d]));
1669 strqueue_push(&sq, cmd);
1673 for (i = 0; i < solv->job.count; i += 2)
1675 cmd = (char *)testcase_job2str(pool, solv->job.elements[i], solv->job.elements[i + 1]);
1676 cmd = pool_tmpjoin(pool, "job ", cmd, 0);
1677 strqueue_push(&sq, cmd);
1684 for (i = 0; resultflags2str[i].str; i++)
1685 if ((resultflags & resultflags2str[i].flag) != 0)
1686 cmd = pool_tmpappend(pool, cmd, cmd ? "," : 0, resultflags2str[i].str);
1687 cmd = pool_tmpjoin(pool, "result ", cmd ? cmd : "?", 0);
1688 cmd = pool_tmpappend(pool, cmd, " ", resultname);
1689 strqueue_push(&sq, cmd);
1690 result = testcase_solverresult(solv, resultflags);
1691 if (!strcmp(resultname, "<inline>"))
1695 strqueue_init(&rsq);
1696 strqueue_split(&rsq, result);
1697 for (i = 0; i < rsq.nstr; i++)
1699 cmd = pool_tmpjoin(pool, "#>", rsq.str[i], 0);
1700 strqueue_push(&sq, cmd);
1702 strqueue_free(&rsq);
1706 out = pool_tmpjoin(pool, dir, "/", resultname);
1707 if (!(fp = fopen(out, "w")))
1709 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: could not open '%s' for writing\n", out);
1714 if (result && *result && fwrite(result, strlen(result), 1, fp) != 1)
1716 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: write error\n");
1723 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: write error\n");
1731 cmd = strqueue_join(&sq);
1732 out = pool_tmpjoin(pool, dir, "/", testcasename);
1733 if (!(fp = fopen(out, "w")))
1735 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: could not open '%s' for writing\n", out);
1739 if (*cmd && fwrite(cmd, strlen(cmd), 1, fp) != 1)
1741 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: write error\n");
1747 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: write error\n");
1757 read_inline_file(FILE *fp, char **bufp, char **bufpp, int *buflp)
1759 char *result = solv_malloc(1024);
1766 if (rp - result + 256 >= resultl)
1768 resultl = rp - result;
1769 result = solv_realloc(result, resultl + 1024);
1770 rp = result + resultl;
1773 if (!fgets(rp, resultl - (rp - result), fp))
1776 if (rl && (rp == result || rp[-1] == '\n'))
1778 if (rl > 1 && rp[0] == '#' && rp[1] == '>')
1780 memmove(rp, rp + 2, rl - 2);
1785 while (rl + 16 > *buflp)
1787 *bufp = solv_realloc(*bufp, *buflp + 512);
1790 memmove(*bufp, rp, rl);
1791 if ((*bufp)[rl - 1] == '\n')
1797 (*bufpp) = *bufp + rl;
1814 char *result = solv_malloc(1024);
1821 if (rp - result + 256 >= resultl)
1823 resultl = rp - result;
1824 result = solv_realloc(result, resultl + 1024);
1825 rp = result + resultl;
1828 rl = fread(rp, 1, resultl - (rp - result), fp);
1840 str2resultflags(Pool *pool, char *s) /* modifies the string! */
1842 int i, resultflags = 0;
1845 char *se = strchr(s, ',');
1848 for (i = 0; resultflags2str[i].str; i++)
1849 if (!strcmp(s, resultflags2str[i].str))
1851 resultflags |= resultflags2str[i].flag;
1854 if (!resultflags2str[i].str)
1855 pool_debug(pool, SOLV_ERROR, "result: unknown flag '%s'\n", s);
1862 testcase_read(Pool *pool, FILE *fp, char *testcase, Queue *job, char **resultp, int *resultflagsp)
1867 char *testcasedir, *s;
1873 int poolflagsreset = 0;
1875 if (!fp && !(fp = fopen(testcase, "r")))
1877 pool_debug(pool, SOLV_ERROR, "testcase_read: could not open '%s'\n", testcase);
1880 testcasedir = solv_strdup(testcase);
1881 if ((s = strrchr(testcasedir, '/')) != 0)
1886 buf = solv_malloc(bufl);
1891 if (bufp - buf + 16 > bufl)
1894 buf = solv_realloc(buf, bufl + 512);
1898 if (!fgets(bufp, bufl - (bufp - buf), fp))
1902 if (!l || buf[l - 1] != '\n')
1909 while (*s && (*s == ' ' || *s == '\t'))
1911 if (!*s || *s == '#')
1914 /* split it in pieces */
1917 while (*s == ' ' || *s == '\t')
1921 pieces = solv_extend(pieces, npieces, 1, sizeof(*pieces), 7);
1922 pieces[npieces++] = s;
1923 while (*s && *s != ' ' && *s != '\t')
1928 pieces = solv_extend(pieces, npieces, 1, sizeof(*pieces), 7);
1929 pieces[npieces] = 0;
1930 if (!strcmp(pieces[0], "repo") && npieces >= 4)
1932 Repo *repo = repo_create(pool, pieces[1]);
1938 if (!poolflagsreset)
1941 testcase_resetpoolflags(pool); /* hmm */
1943 if (sscanf(pieces[2], "%d.%d", &prio, &subprio) != 2)
1946 prio = atoi(pieces[2]);
1948 repo->priority = prio;
1949 repo->subpriority = subprio;
1950 if (strcmp(pieces[3], "empty") != 0)
1952 const char *repotype = pool_tmpjoin(pool, pieces[3], 0, 0); /* gets overwritten in <inline> case */
1953 if (!strcmp(pieces[4], "<inline>"))
1955 char *idata = read_inline_file(fp, &buf, &bufp, &bufl);
1957 rfp = solv_xfopen_buf(rdata, &idata, 0, "rf");
1961 rdata = pool_tmpjoin(pool, testcasedir, pieces[4], 0);
1962 rfp = solv_xfopen(rdata, "r");
1966 pool_debug(pool, SOLV_ERROR, "testcase_read: could not open '%s'\n", rdata);
1968 else if (!strcmp(repotype, "testtags"))
1970 testcase_add_testtags(repo, rfp, 0);
1973 else if (!strcmp(repotype, "solv"))
1975 repo_add_solv(repo, rfp, 0);
1979 else if (!strcmp(repotype, "helix"))
1981 repo_add_helix(repo, rfp, 0);
1988 pool_debug(pool, SOLV_ERROR, "testcase_read: unknown repo type for repo '%s'\n", repo->name);
1992 else if (!strcmp(pieces[0], "system") && npieces >= 3)
1996 /* must set the disttype before the arch */
1997 for (i = 0; disttype2str[i].str != 0; i++)
1998 if (!strcmp(disttype2str[i].str, pieces[2]))
2000 if (!disttype2str[i].str)
2001 pool_debug(pool, SOLV_ERROR, "testcase_read: system: unknown disttype '%s'\n", pieces[2]);
2002 else if (pool->disttype != disttype2str[i].type)
2004 #ifdef MULTI_SEMANTICS
2005 pool_setdisttype(pool, disttype2str[i].type);
2007 pool_debug(pool, SOLV_ERROR, "testcase_read: system: cannot change disttype to '%s'\n", pieces[2]);
2010 if (strcmp(pieces[1], "unset") != 0)
2011 pool_setarch(pool, pieces[1]);
2013 pool_setarch(pool, 0);
2016 Repo *repo = testcase_str2repo(pool, pieces[3]);
2018 pool_debug(pool, SOLV_ERROR, "testcase_read: system: unknown repo '%s'\n", pieces[3]);
2020 pool_set_installed(pool, repo);
2023 else if (!strcmp(pieces[0], "job") && npieces > 1)
2029 pool_addfileprovides(pool);
2030 pool_createwhatprovides(pool);
2033 if (npieces >= 3 && !strcmp(pieces[2], "selection"))
2035 addselectionjob(pool, pieces + 1, npieces - 1, job);
2039 for (sp = pieces[1]; sp < pieces[npieces - 1]; sp++)
2042 how = testcase_str2job(pool, pieces[1], &what);
2043 if (how >= 0 && job)
2044 queue_push2(job, how, what);
2046 else if (!strcmp(pieces[0], "vendorclass") && npieces > 1)
2048 pool_addvendorclass(pool, (const char **)(pieces + 1));
2050 else if (!strcmp(pieces[0], "namespace") && npieces > 1)
2052 int i = strlen(pieces[1]);
2053 s = strchr(pieces[1], '(');
2054 if (!s && pieces[1][i - 1] != ')')
2056 pool_debug(pool, SOLV_ERROR, "testcase_read: bad namespace '%s'\n", pieces[1]);
2064 pieces[1][i - 1] = 0;
2065 name = pool_str2id(pool, pieces[1], 1);
2066 evr = pool_str2id(pool, s + 1, 1);
2068 pieces[1][i - 1] = ')';
2069 id = pool_rel2id(pool, name, evr, REL_NAMESPACE, 1);
2070 for (i = 2; i < npieces; i++)
2071 queue_push(&q, testcase_str2solvid(pool, pieces[i]));
2072 /* now do the callback */
2075 pool_addfileprovides(pool);
2076 pool_createwhatprovides(pool);
2079 pool->whatprovides_rel[GETRELID(id)] = pool_queuetowhatprovides(pool, &q);
2083 else if (!strcmp(pieces[0], "poolflags"))
2086 if (!poolflagsreset)
2089 testcase_resetpoolflags(pool); /* hmm */
2091 for (i = 1; i < npieces; i++)
2092 testcase_setpoolflags(pool, pieces[i]);
2094 else if (!strcmp(pieces[0], "solverflags") && npieces > 1)
2099 solv = solver_create(pool);
2100 testcase_resetsolverflags(solv);
2102 for (i = 1; i < npieces; i++)
2103 testcase_setsolverflags(solv, pieces[i]);
2105 else if (!strcmp(pieces[0], "result") && npieces > 2)
2108 int resultflags = str2resultflags(pool, pieces[1]);
2109 const char *rdata = pool_tmpjoin(pool, testcasedir, pieces[2], 0);
2110 if (!strcmp(pieces[2], "<inline>"))
2111 result = read_inline_file(fp, &buf, &bufp, &bufl);
2114 FILE *rfp = fopen(rdata, "r");
2116 pool_debug(pool, SOLV_ERROR, "testcase_read: could not open '%s'\n", rdata);
2119 result = read_file(rfp);
2128 *resultflagsp = resultflags;
2130 else if (!strcmp(pieces[0], "nextjob") && npieces == 1)
2136 pool_debug(pool, SOLV_ERROR, "testcase_read: cannot parse command '%s'\n", pieces[0]);
2139 buf = solv_free(buf);
2140 pieces = solv_free(pieces);
2141 solv_free(testcasedir);
2144 pool_addfileprovides(pool);
2145 pool_createwhatprovides(pool);
2149 solv = solver_create(pool);
2150 testcase_resetsolverflags(solv);
2158 testcase_resultdiff(char *result1, char *result2)
2160 Strqueue sq1, sq2, osq;
2162 strqueue_init(&sq1);
2163 strqueue_init(&sq2);
2164 strqueue_init(&osq);
2165 strqueue_split(&sq1, result1);
2166 strqueue_split(&sq2, result2);
2167 strqueue_sort(&sq1);
2168 strqueue_sort(&sq2);
2169 strqueue_diff(&sq1, &sq2, &osq);
2170 r = osq.nstr ? strqueue_join(&osq) : 0;
2171 strqueue_free(&sq1);
2172 strqueue_free(&sq2);
2173 strqueue_free(&osq);