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 "solv_xfopen.h"
29 #include "tools_util.h"
31 static struct job2str {
35 { SOLVER_NOOP, "noop" },
36 { SOLVER_INSTALL, "install" },
37 { SOLVER_ERASE, "erase" },
38 { SOLVER_UPDATE, "update" },
39 { SOLVER_WEAKENDEPS, "weakendeps" },
40 { SOLVER_NOOBSOLETES, "noobsoletes" },
41 { SOLVER_LOCK, "lock" },
42 { SOLVER_DISTUPGRADE, "distupgrade" },
43 { SOLVER_VERIFY, "verify" },
44 { SOLVER_DROP_ORPHANED, "droporphaned" },
45 { SOLVER_USERINSTALLED, "userinstalled" },
49 static struct jobflags2str {
53 { SOLVER_WEAK, "weak" },
54 { SOLVER_ESSENTIAL, "essential" },
55 { SOLVER_CLEANDEPS, "cleandeps" },
56 { SOLVER_ORUPDATE, "orupdate" },
57 { SOLVER_FORCEBEST, "forcebest" },
58 { SOLVER_TARGETED, "targeted" },
59 { SOLVER_SETEV, "setev" },
60 { SOLVER_SETEVR, "setevr" },
61 { SOLVER_SETARCH, "setarch" },
62 { SOLVER_SETVENDOR, "setvendor" },
63 { SOLVER_SETREPO, "setrepo" },
64 { SOLVER_NOAUTOSET, "noautoset" },
68 static struct resultflags2str {
71 } resultflags2str[] = {
72 { TESTCASE_RESULT_TRANSACTION, "transaction" },
73 { TESTCASE_RESULT_PROBLEMS, "problems" },
74 { TESTCASE_RESULT_ORPHANED, "orphaned" },
75 { TESTCASE_RESULT_RECOMMENDED, "recommended" },
76 { TESTCASE_RESULT_UNNEEDED, "unneeded" },
80 static struct solverflags2str {
84 } solverflags2str[] = {
85 { SOLVER_FLAG_ALLOW_DOWNGRADE, "allowdowngrade", 0 },
86 { SOLVER_FLAG_ALLOW_NAMECHANGE, "allownamechange", 1 },
87 { SOLVER_FLAG_ALLOW_ARCHCHANGE, "allowarchchange", 0 },
88 { SOLVER_FLAG_ALLOW_VENDORCHANGE, "allowvendorchange", 0 },
89 { SOLVER_FLAG_ALLOW_UNINSTALL, "allowuninstall", 0 },
90 { SOLVER_FLAG_NO_UPDATEPROVIDE, "noupdateprovide", 0 },
91 { SOLVER_FLAG_SPLITPROVIDES, "splitprovides", 0 },
92 { SOLVER_FLAG_IGNORE_RECOMMENDED, "ignorerecommended", 0 },
93 { SOLVER_FLAG_ADD_ALREADY_RECOMMENDED, "addalreadyrecommended", 0 },
94 { SOLVER_FLAG_NO_INFARCHCHECK, "noinfarchcheck", 0 },
95 { SOLVER_FLAG_KEEP_EXPLICIT_OBSOLETES, "keepexplicitobsoletes", 0 },
96 { SOLVER_FLAG_BEST_OBEY_POLICY, "bestobeypolicy", 0 },
97 { SOLVER_FLAG_NO_AUTOTARGET, "noautotarget", 0 },
101 static struct poolflags2str {
105 } poolflags2str[] = {
106 { POOL_FLAG_PROMOTEEPOCH, "promoteepoch", 0 },
107 { POOL_FLAG_FORBIDSELFCONFLICTS, "forbidselfconflicts", 0 },
108 { POOL_FLAG_OBSOLETEUSESPROVIDES, "obsoleteusesprovides", 0 },
109 { POOL_FLAG_IMPLICITOBSOLETEUSESPROVIDES, "implicitobsoleteusesprovides", 0 },
110 { POOL_FLAG_OBSOLETEUSESCOLORS, "obsoleteusescolors", 0 },
111 { POOL_FLAG_NOINSTALLEDOBSOLETES, "noinstalledobsoletes", 0 },
112 { POOL_FLAG_HAVEDISTEPOCH, "havedistepoch", 0 },
116 static struct disttype2str {
120 { DISTTYPE_RPM, "rpm" },
121 { DISTTYPE_DEB, "deb" },
122 { DISTTYPE_ARCH, "arch" },
126 typedef struct strqueue {
131 #define STRQUEUE_BLOCK 63
134 strqueue_init(Strqueue *q)
141 strqueue_free(Strqueue *q)
144 for (i = 0; i < q->nstr; i++)
145 solv_free(q->str[i]);
146 q->str = solv_free(q->str);
151 strqueue_push(Strqueue *q, const char *s)
153 q->str = solv_extend(q->str, q->nstr, 1, sizeof(*q->str), STRQUEUE_BLOCK);
154 q->str[q->nstr++] = solv_strdup(s);
158 strqueue_pushjoin(Strqueue *q, const char *s1, const char *s2, const char *s3)
160 q->str = solv_extend(q->str, q->nstr, 1, sizeof(*q->str), STRQUEUE_BLOCK);
161 q->str[q->nstr++] = solv_dupjoin(s1, s2, s3);
165 strqueue_sort_cmp(const void *ap, const void *bp, void *dp)
167 const char *a = *(const char **)ap;
168 const char *b = *(const char **)bp;
169 return strcmp(a ? a : "", b ? b : "");
173 strqueue_sort(Strqueue *q)
176 solv_sort(q->str, q->nstr, sizeof(*q->str), strqueue_sort_cmp, 0);
180 strqueue_sort_u(Strqueue *q)
184 for (i = j = 0; i < q->nstr; i++)
185 if (!j || strqueue_sort_cmp(q->str + i, q->str + j - 1, 0) != 0)
186 q->str[j++] = q->str[i];
191 strqueue_join(Strqueue *q)
195 for (i = 0; i < q->nstr; i++)
197 l += strlen(q->str[i]) + 1;
198 l++; /* trailing \0 */
201 for (i = 0; i < q->nstr; i++)
204 strcpy(rp, q->str[i]);
213 strqueue_split(Strqueue *q, const char *s)
218 while ((p = strchr(s, '\n')) != 0)
220 q->str = solv_extend(q->str, q->nstr, 1, sizeof(*q->str), STRQUEUE_BLOCK);
221 q->str[q->nstr] = solv_malloc(p - s + 1);
223 memcpy(q->str[q->nstr], s, p - s);
224 q->str[q->nstr][p - s] = 0;
233 strqueue_diff(Strqueue *sq1, Strqueue *sq2, Strqueue *osq)
236 while (i < sq1->nstr && j < sq2->nstr)
238 int r = strqueue_sort_cmp(sq1->str + i, sq2->str + j, 0);
242 strqueue_pushjoin(osq, "-", sq1->str[i++], 0);
244 strqueue_pushjoin(osq, "+", sq2->str[j++], 0);
246 while (i < sq1->nstr)
247 strqueue_pushjoin(osq, "-", sq1->str[i++], 0);
248 while (j < sq2->nstr)
249 strqueue_pushjoin(osq, "+", sq2->str[j++], 0);
253 pool_isknownarch(Pool *pool, Id id)
255 if (!id || id == ID_EMPTY)
257 if (id == ARCH_SRC || id == ARCH_NOSRC || id == ARCH_NOARCH)
259 if (!pool->id2arch || (id > pool->lastarch || !pool->id2arch[id]))
265 testcase_str2dep(Pool *pool, char *s)
271 if ((n = strchr(s, '|')) != 0)
273 id = testcase_str2dep(pool, n + 1);
275 id = pool_rel2id(pool, testcase_str2dep(pool, s), id, REL_OR, 1);
279 while (*s == ' ' || *s == '\t')
282 while (*s && *s != ' ' && *s != '\t' && *s != '<' && *s != '=' && *s != '>')
286 while (*s && *s != ')')
292 if ((a = strchr(n, '.')) != 0 && a + 1 < s && s[-1] != ')')
294 Id archid = pool_strn2id(pool, a + 1, s - (a + 1), 0);
295 if (pool_isknownarch(pool, archid))
297 id = pool_strn2id(pool, n, a - n, 1);
298 id = pool_rel2id(pool, id, archid, REL_ARCH, 1);
301 id = pool_strn2id(pool, n, s - n, 1);
304 id = pool_strn2id(pool, n, s - n, 1);
307 while (*s == ' ' || *s == '\t')
323 while (*s == ' ' || *s == '\t')
326 while (*s && *s != ' ' && *s != '\t')
328 return pool_rel2id(pool, id, pool_strn2id(pool, n, s - n, 1), flags, 1);
332 testcase_repoid2str(Pool *pool, Id repoid)
334 Repo *repo = pool_id2repo(pool, repoid);
337 char *r = pool_tmpjoin(pool, repo->name, 0, 0);
339 for (rp = r; *rp; rp++)
340 if (*rp == ' ' || *rp == '\t')
347 sprintf(buf, "#%d", repoid);
348 return pool_tmpjoin(pool, buf, 0, 0);
353 testcase_solvid2str(Pool *pool, Id p)
355 Solvable *s = pool->solvables + p;
356 const char *n, *e, *a;
359 if (p == SYSTEMSOLVABLE)
361 n = pool_id2str(pool, s->name);
362 e = pool_id2str(pool, s->evr);
363 a = pool_id2str(pool, s->arch);
364 str = pool_alloctmpspace(pool, strlen(n) + strlen(e) + strlen(a) + 3);
365 sprintf(str, "%s-%s.%s", n, e, a);
367 return pool_tmpappend(pool, str, "@", 0);
371 char *str2 = pool_tmpappend(pool, str, "@", s->repo->name);
373 if (str2[l] == ' ' || str2[l] == '\t')
377 sprintf(buf, "@#%d", s->repo->repoid);
378 return pool_tmpappend(pool, str, buf, 0);
382 testcase_str2repo(Pool *pool, const char *str)
386 if (str[0] == '#' && (str[1] >= '0' && str[1] <= '9'))
390 for (j = 1; str[j] >= '0' && str[j] <= '9'; j++)
391 repoid = repoid * 10 + (str[j] - '0');
392 if (!str[j] && repoid > 0 && repoid < pool->nrepos)
393 repo = pool_id2repo(pool, repoid);
397 FOR_REPOS(repoid, repo)
402 l = strlen(repo->name);
403 for (i = 0; i < l; i++)
405 int c = repo->name[i];
406 if (c == ' ' || c == '\t')
411 if (i == l && !str[l])
414 if (repoid >= pool->nrepos)
421 testcase_str2solvid(Pool *pool, const char *str)
423 int i, l = strlen(str);
430 if (*str == '@' && !strcmp(str, "@SYSTEM"))
431 return SYSTEMSOLVABLE;
433 for (i = l - 1; i >= 0; i--)
434 if (str[i] == '@' && (repo = testcase_str2repo(pool, str + i + 1)) != 0)
439 /* now find the arch (if present) */
441 for (i = repostart - 1; i > 0; i--)
444 arch = pool_strn2id(pool, str + i + 1, repostart - (i + 1), 0);
449 /* now find the name */
450 for (i = repostart - 1; i > 0; i--)
454 Id nid, evrid, p, pp;
455 nid = pool_strn2id(pool, str, i, 0);
458 evrid = pool_strn2id(pool, str + i + 1, repostart - (i + 1), 0);
461 FOR_PROVIDES(p, pp, nid)
463 Solvable *s = pool->solvables + p;
464 if (s->name != nid || s->evr != evrid)
466 if (repo && s->repo != repo)
468 if (arch && s->arch != arch)
478 testcase_job2str(Pool *pool, Id how, Id what)
485 Id select = how & SOLVER_SELECTMASK;
487 for (i = 0; job2str[i].str; i++)
488 if ((how & SOLVER_JOBMASK) == job2str[i].job)
490 jobstr = job2str[i].str ? job2str[i].str : "unknown";
491 if (select == SOLVER_SOLVABLE)
494 pkgstr = testcase_solvid2str(pool, what);
496 else if (select == SOLVER_SOLVABLE_NAME)
499 pkgstr = pool_dep2str(pool, what);
501 else if (select == SOLVER_SOLVABLE_PROVIDES)
503 selstr = " provides ";
504 pkgstr = pool_dep2str(pool, what);
506 else if (select == SOLVER_SOLVABLE_ONE_OF)
511 while ((p = pool->whatprovidesdata[what++]) != 0)
513 const char *s = testcase_solvid2str(pool, p);
516 pkgstr = pool_tmpappend(pool, pkgstr, " ", s);
517 pool_freetmpspace(pool, s);
525 else if (select == SOLVER_SOLVABLE_REPO)
527 Repo *repo = pool_id2repo(pool, what);
532 sprintf(buf, "#%d", repo->repoid);
533 pkgstr = pool_tmpjoin(pool, buf, 0, 0);
536 pkgstr = pool_tmpjoin(pool, repo->name, 0, 0);
538 else if (select == SOLVER_SOLVABLE_ALL)
545 selstr = " unknown ";
548 ret = pool_tmpjoin(pool, jobstr, selstr, pkgstr);
550 ret = pool_tmpappend(pool, ret, " ", 0);
551 for (i = 0; jobflags2str[i].str; i++)
552 if ((how & jobflags2str[i].flag) != 0)
553 ret = pool_tmpappend(pool, ret, ",", jobflags2str[i].str);
559 ret = pool_tmpappend(pool, ret, "]", 0);
565 testcase_str2job(Pool *pool, const char *str, Id *whatp)
575 /* so we can patch it */
576 s = pool_tmpjoin(pool, str, 0, 0);
577 /* split it in pieces */
580 while (*s == ' ' || *s == '\t')
584 pieces = solv_extend(pieces, npieces, 1, sizeof(*pieces), 7);
585 pieces[npieces++] = s;
586 while (*s && *s != ' ' && *s != '\t')
593 pool_debug(pool, SOLV_ERROR, "str2job: bad line '%s'\n", str);
598 for (i = 0; job2str[i].str; i++)
599 if (!strcmp(pieces[0], job2str[i].str))
603 pool_debug(pool, SOLV_ERROR, "str2job: unknown job '%s'\n", str);
607 job = job2str[i].job;
610 char *flags = pieces[npieces - 1];
612 if (*flags == '[' && flags[strlen(flags) - 1] == ']')
616 flags[strlen(flags) - 1] = ',';
619 for (nf = flags; *nf != ','; nf++)
622 for (i = 0; jobflags2str[i].str; i++)
623 if (!strcmp(flags, jobflags2str[i].str))
625 if (!jobflags2str[i].str)
627 pool_debug(pool, SOLV_ERROR, "str2job: unknown jobflags in '%s'\n", str);
631 job |= jobflags2str[i].flag;
636 if (!strcmp(pieces[1], "pkg"))
640 pool_debug(pool, SOLV_ERROR, "str2job: bad pkg selector in '%s'\n", str);
644 job |= SOLVER_SOLVABLE;
645 what = testcase_str2solvid(pool, pieces[2]);
648 pool_debug(pool, SOLV_ERROR, "str2job: unknown package '%s'\n", pieces[2]);
653 else if (!strcmp(pieces[1], "name") || !strcmp(pieces[1], "provides"))
655 /* join em again for dep2str... */
657 for (sp = pieces[2]; sp < pieces[npieces - 1]; sp++)
660 what = testcase_str2dep(pool, pieces[2]);
661 if (pieces[1][0] == 'n')
662 job |= SOLVER_SOLVABLE_NAME;
664 job |= SOLVER_SOLVABLE_PROVIDES;
666 else if (!strcmp(pieces[1], "oneof"))
669 job |= SOLVER_SOLVABLE_ONE_OF;
671 if (npieces > 3 && strcmp(pieces[2], "nothing") != 0)
673 for (i = 2; i < npieces; i++)
675 Id p = testcase_str2solvid(pool, pieces[i]);
678 pool_debug(pool, SOLV_ERROR, "str2job: unknown package '%s'\n", pieces[i]);
686 what = pool_queuetowhatprovides(pool, &q);
689 else if (!strcmp(pieces[1], "repo"))
694 pool_debug(pool, SOLV_ERROR, "str2job: bad line '%s'\n", str);
698 repo = testcase_str2repo(pool, pieces[2]);
701 pool_debug(pool, SOLV_ERROR, "str2job: unknown repo '%s'\n", pieces[2]);
705 job |= SOLVER_SOLVABLE_REPO;
708 else if (!strcmp(pieces[1], "all"))
710 if (npieces != 3 && strcmp(pieces[2], "packages") != 0)
712 pool_debug(pool, SOLV_ERROR, "str2job: bad line '%s'\n", str);
716 job |= SOLVER_SOLVABLE_ALL;
721 pool_debug(pool, SOLV_ERROR, "str2job: unknown selection in '%s'\n", str);
731 writedeps(Repo *repo, FILE *fp, const char *tag, Id key, Solvable *s, Offset off)
733 Pool *pool = repo->pool;
740 dp = repo->idarraydata + off;
742 while ((id = *dp++) != 0)
744 if (key == SOLVABLE_REQUIRES && id == SOLVABLE_PREREQMARKER)
747 fprintf(fp, "-%s\n", tag);
752 if (key == SOLVABLE_PROVIDES && id == SOLVABLE_FILEMARKER)
757 idstr = pool_dep2str(pool, id);
760 Reldep *rd = GETRELDEP(pool, id);
761 if (key == SOLVABLE_CONFLICTS && rd->flags == REL_NAMESPACE && rd->name == NAMESPACE_OTHERPROVIDERS)
763 if (!strncmp(idstr, "namespace:", 10))
766 if (key == SOLVABLE_SUPPLEMENTS)
768 if (rd->flags == REL_NAMESPACE && rd->name == NAMESPACE_FILESYSTEM)
770 if (!strncmp(idstr, "namespace:", 10))
773 else if (rd->flags == REL_NAMESPACE && rd->name == NAMESPACE_MODALIAS)
775 if (!strncmp(idstr, "namespace:", 10))
778 else if (rd->flags == REL_AND)
780 /* either packageand chain or modalias */
782 if (ISRELDEP(rd->evr))
784 Reldep *mrd = GETRELDEP(pool, rd->evr);
785 if (mrd->flags == REL_NAMESPACE && mrd->name == NAMESPACE_MODALIAS)
787 idstr = pool_tmpjoin(pool, "modalias(", pool_dep2str(pool, rd->name), ":");
788 idstr = pool_tmpappend(pool, idstr, pool_dep2str(pool, mrd->evr), ")");
790 else if (mrd->flags >= 8)
795 /* must be and chain */
796 idstr = pool_dep2str(pool, rd->evr);
802 rd = GETRELDEP(pool, id);
803 if (rd->flags != REL_AND)
805 idstr = pool_tmpjoin(pool, pool_dep2str(pool, rd->evr), ":", idstr);
807 idstr = pool_tmpjoin(pool, pool_dep2str(pool, id), ":", idstr);
808 idstr = pool_tmpjoin(pool, "packageand(", idstr, ")");
811 else if (rd->flags >= 8)
817 fprintf(fp, "+%s\n", tag);
820 fprintf(fp, "%s\n", idstr);
822 if (key == SOLVABLE_PROVIDES)
824 /* add the filelist */
826 dataiterator_init(&di, pool, repo, s - pool->solvables, SOLVABLE_FILELIST, 0, 0);
827 while (dataiterator_step(&di))
829 const char *s = repodata_dir2str(di.data, di.kv.id, di.kv.str);
832 Id id = pool_str2id(pool, s, 0);
835 for (dp = prvdp; *dp; dp++)
839 continue; /* already included */
844 fprintf(fp, "+%s", tag);
847 fprintf(fp, "%s\n", s);
851 fprintf(fp, "-%s\n", tag);
855 testcase_write_testtags(Repo *repo, FILE *fp)
857 Pool *pool = repo->pool;
867 fprintf(fp, "=Ver: 2.0\n");
868 FOR_REPO_SOLVABLES(repo, p, s)
870 name = pool_id2str(pool, s->name);
871 evr = pool_id2str(pool, s->evr);
872 arch = pool_id2str(pool, s->arch);
873 release = strrchr(evr, '-');
875 release = evr + strlen(evr);
876 fprintf(fp, "=Pkg: %s %.*s %s %s\n", name, (int)(release - evr), evr, *release && release[1] ? release + 1 : "-", arch);
877 tmp = solvable_lookup_str(s, SOLVABLE_SUMMARY);
879 fprintf(fp, "=Sum: %s\n", tmp);
880 writedeps(repo, fp, "Req:", SOLVABLE_REQUIRES, s, s->requires);
881 writedeps(repo, fp, "Prv:", SOLVABLE_PROVIDES, s, s->provides);
882 writedeps(repo, fp, "Obs:", SOLVABLE_OBSOLETES, s, s->obsoletes);
883 writedeps(repo, fp, "Con:", SOLVABLE_CONFLICTS, s, s->conflicts);
884 writedeps(repo, fp, "Rec:", SOLVABLE_RECOMMENDS, s, s->recommends);
885 writedeps(repo, fp, "Sup:", SOLVABLE_SUPPLEMENTS, s, s->supplements);
886 writedeps(repo, fp, "Sug:", SOLVABLE_SUGGESTS, s, s->suggests);
887 writedeps(repo, fp, "Enh:", SOLVABLE_ENHANCES, s, s->enhances);
889 fprintf(fp, "=Vnd: %s\n", pool_id2str(pool, s->vendor));
890 ti = solvable_lookup_num(s, SOLVABLE_BUILDTIME, 0);
892 fprintf(fp, "=Tim: %u\n", ti);
898 adddep(Repo *repo, Offset olddeps, char *str, Id marker)
900 Id id = *str == '/' ? pool_str2id(repo->pool, str, 1) : testcase_str2dep(repo->pool, str);
901 return repo_addid_dep(repo, olddeps, id, marker);
905 finish_solvable(Pool *pool, Repodata *data, Solvable *s, char *filelist, int nfilelist)
911 for (l = 0; l < nfilelist; l += strlen(filelist + l) + 1)
913 char *p = strrchr(filelist + l, '/');
917 did = repodata_str2dir(data, filelist + l, 1);
920 did = repodata_str2dir(data, "/", 1);
921 repodata_add_dirstr(data, s - pool->solvables, SOLVABLE_FILELIST, did, p);
924 if (s->name && s->arch != ARCH_SRC && s->arch != ARCH_NOSRC)
925 s->provides = repo_addid_dep(s->repo, s->provides, pool_rel2id(pool, s->name, s->evr, REL_EQ, 1), 0);
926 s->supplements = repo_fix_supplements(s->repo, s->provides, s->supplements, 0);
927 s->conflicts = repo_fix_conflicts(s->repo, s->conflicts);
930 /* stripped down version of susetags parser used for testcases */
932 testcase_add_testtags(Repo *repo, FILE *fp, int flags)
934 Pool *pool = repo->pool;
947 data = repo_add_repodata(repo, flags);
952 line = solv_malloc(aline);
956 if (linep - line + 16 > aline)
958 aline = linep - line;
959 line = solv_realloc(line, aline + 512);
960 linep = line + aline;
963 if (!fgets(linep, aline - (linep - line), fp))
965 linep += strlen(linep);
966 if (linep == line || linep[-1] != '\n')
969 linep = line + intag;
972 if (line[intag] == '-' && !strncmp(line + 1, line + intag + 1, intag - 2))
979 else if (line[0] == '+' && line[1] && line[1] != ':')
981 char *tagend = strchr(line, ':');
986 intag = tagend + 2 - line;
987 linep = line + intag;
990 if (*line != '=' || !line[1] || !line[2] || !line[3] || line[4] != ':')
992 tag = line[1] << 16 | line[2] << 8 | line[3];
995 case 'P' << 16 | 'k' << 8 | 'g':
997 finish_solvable(pool, data, s, filelist, nfilelist);
999 if (split(line + 5, sp, 5) != 4)
1001 s = pool_id2solvable(pool, repo_add_solvable(repo));
1002 s->name = pool_str2id(pool, sp[0], 1);
1003 /* join back version and release */
1004 if (sp[2] && !(sp[2][0] == '-' && !sp[2][1]))
1006 s->evr = makeevr(pool, sp[1]);
1007 s->arch = pool_str2id(pool, sp[3], 1);
1009 case 'S' << 16 | 'u' << 8 | 'm':
1010 repodata_set_str(data, s - pool->solvables, SOLVABLE_SUMMARY, line + 6);
1012 case 'V' << 16 | 'n' << 8 | 'd':
1013 s->vendor = pool_str2id(pool, line + 6, 1);
1015 case 'T' << 16 | 'i' << 8 | 'm':
1018 repodata_set_num(data, s - pool->solvables, SOLVABLE_BUILDTIME, t);
1020 case 'R' << 16 | 'e' << 8 | 'q':
1021 s->requires = adddep(repo, s->requires, line + 6, -SOLVABLE_PREREQMARKER);
1023 case 'P' << 16 | 'r' << 8 | 'q':
1024 s->requires = adddep(repo, s->requires, line + 6, SOLVABLE_PREREQMARKER);
1026 case 'P' << 16 | 'r' << 8 | 'v':
1029 int l = strlen(line + 6) + 1;
1030 if (nfilelist + l > afilelist)
1032 afilelist = nfilelist + l + 512;
1033 filelist = solv_realloc(filelist, afilelist);
1035 memcpy(filelist + nfilelist, line + 6, l);
1042 for (l = 0; l < nfilelist; l += strlen(filelist + l) + 1)
1043 s->provides = repo_addid_dep(repo, s->provides, pool_str2id(pool, filelist + l, 1), 0);
1046 s->provides = adddep(repo, s->provides, line + 6, 0);
1048 case 'O' << 16 | 'b' << 8 | 's':
1049 s->obsoletes = adddep(repo, s->obsoletes, line + 6, 0);
1051 case 'C' << 16 | 'o' << 8 | 'n':
1052 s->conflicts = adddep(repo, s->conflicts, line + 6, 0);
1054 case 'R' << 16 | 'e' << 8 | 'c':
1055 s->recommends = adddep(repo, s->recommends, line + 6, 0);
1057 case 'S' << 16 | 'u' << 8 | 'p':
1058 s->supplements = adddep(repo, s->supplements, line + 6, 0);
1060 case 'S' << 16 | 'u' << 8 | 'g':
1061 s->suggests = adddep(repo, s->suggests, line + 6, 0);
1063 case 'E' << 16 | 'n' << 8 | 'h':
1064 s->enhances = adddep(repo, s->enhances, line + 6, 0);
1071 finish_solvable(pool, data, s, filelist, nfilelist);
1073 solv_free(filelist);
1074 repodata_free_dircache(data);
1075 if (!(flags & REPO_NO_INTERNALIZE))
1076 repodata_internalize(data);
1081 testcase_getpoolflags(Pool *pool)
1083 const char *str = 0;
1085 for (i = 0; poolflags2str[i].str; i++)
1087 v = pool_get_flag(pool, poolflags2str[i].flag);
1088 if (v == poolflags2str[i].def)
1090 str = pool_tmpappend(pool, str, v ? " " : " !", poolflags2str[i].str);
1092 return str ? str + 1 : "";
1096 testcase_setpoolflags(Pool *pool, const char *str)
1098 const char *p = str, *s;
1102 while (*p == ' ' || *p == '\t' || *p == ',')
1113 while (*p && *p != ' ' && *p != '\t' && *p != ',')
1115 for (i = 0; poolflags2str[i].str; i++)
1116 if (!strncmp(poolflags2str[i].str, s, p - s) && poolflags2str[i].str[p - s] == 0)
1118 if (!poolflags2str[i].str)
1120 pool_debug(pool, SOLV_ERROR, "setpoolflags: unknown flag '%.*s'\n", (int)(p - s), s);
1123 pool_set_flag(pool, poolflags2str[i].flag, v);
1129 testcase_resetpoolflags(Pool *pool)
1132 for (i = 0; poolflags2str[i].str; i++)
1133 pool_set_flag(pool, poolflags2str[i].flag, poolflags2str[i].def);
1137 testcase_getsolverflags(Solver *solv)
1139 Pool *pool = solv->pool;
1140 const char *str = 0;
1142 for (i = 0; solverflags2str[i].str; i++)
1144 v = solver_get_flag(solv, solverflags2str[i].flag);
1145 if (v == solverflags2str[i].def)
1147 str = pool_tmpappend(pool, str, v ? " " : " !", solverflags2str[i].str);
1149 return str ? str + 1 : "";
1153 testcase_setsolverflags(Solver *solv, const char *str)
1155 const char *p = str, *s;
1159 while (*p == ' ' || *p == '\t' || *p == ',')
1170 while (*p && *p != ' ' && *p != '\t' && *p != ',')
1172 for (i = 0; solverflags2str[i].str; i++)
1173 if (!strncmp(solverflags2str[i].str, s, p - s) && solverflags2str[i].str[p - s] == 0)
1175 if (!solverflags2str[i].str)
1177 pool_debug(solv->pool, SOLV_ERROR, "setsolverflags: unknown flag '%.*s'\n", (int)(p - s), s);
1180 solver_set_flag(solv, solverflags2str[i].flag, v);
1186 testcase_resetsolverflags(Solver *solv)
1189 for (i = 0; solverflags2str[i].str; i++)
1190 solver_set_flag(solv, solverflags2str[i].flag, solverflags2str[i].def);
1194 testcase_ruleid(Solver *solv, Id rid)
1200 const unsigned char *md5;
1206 solver_ruleliterals(solv, rid, &q);
1207 for (i = 0; i < q.count; i++)
1209 Id p = q.elements[i];
1210 s = testcase_solvid2str(solv->pool, p > 0 ? p : -p);
1212 s = pool_tmpjoin(solv->pool, "!", s, 0);
1213 strqueue_push(&sq, s);
1216 strqueue_sort_u(&sq);
1217 chk = solv_chksum_create(REPOKEY_TYPE_MD5);
1218 for (i = 0; i < sq.nstr; i++)
1219 solv_chksum_add(chk, sq.str[i], strlen(sq.str[i]) + 1);
1220 md5 = solv_chksum_get(chk, &md5l);
1221 s = pool_bin2hex(solv->pool, md5, md5l);
1222 chk = solv_chksum_free(chk, 0);
1228 testcase_problemid(Solver *solv, Id problem)
1233 const unsigned char *md5;
1237 /* we build a hash of all rules that define the problem */
1240 solver_findallproblemrules(solv, problem, &q);
1241 for (i = 0; i < q.count; i++)
1242 strqueue_push(&sq, testcase_ruleid(solv, q.elements[i]));
1244 strqueue_sort_u(&sq);
1245 chk = solv_chksum_create(REPOKEY_TYPE_MD5);
1246 for (i = 0; i < sq.nstr; i++)
1247 solv_chksum_add(chk, sq.str[i], strlen(sq.str[i]) + 1);
1248 md5 = solv_chksum_get(chk, &md5l);
1249 s = pool_bin2hex(solv->pool, md5, 4);
1250 chk = solv_chksum_free(chk, 0);
1256 testcase_solutionid(Solver *solv, Id problem, Id solution)
1260 const unsigned char *md5;
1264 intid = solver_solutionelement_internalid(solv, problem, solution);
1265 /* internal stuff! handle with care! */
1269 s = testcase_job2str(solv->pool, solv->job.elements[-intid - 1], solv->job.elements[-intid]);
1274 s = testcase_ruleid(solv, intid);
1276 chk = solv_chksum_create(REPOKEY_TYPE_MD5);
1277 solv_chksum_add(chk, s, strlen(s) + 1);
1278 md5 = solv_chksum_get(chk, &md5l);
1279 s = pool_bin2hex(solv->pool, md5, 4);
1280 chk = solv_chksum_free(chk, 0);
1284 static struct class2str {
1288 { SOLVER_TRANSACTION_ERASE, "erase" },
1289 { SOLVER_TRANSACTION_INSTALL, "install" },
1290 { SOLVER_TRANSACTION_REINSTALLED, "reinstall" },
1291 { SOLVER_TRANSACTION_DOWNGRADED, "downgrade" },
1292 { SOLVER_TRANSACTION_CHANGED, "change" },
1293 { SOLVER_TRANSACTION_UPGRADED, "upgrade" },
1294 { SOLVER_TRANSACTION_OBSOLETED, "obsolete" },
1295 { SOLVER_TRANSACTION_MULTIINSTALL, "multiinstall" },
1296 { SOLVER_TRANSACTION_MULTIREINSTALL, "multireinstall" },
1301 testcase_solverresult(Solver *solv, int resultflags)
1303 Pool *pool = solv->pool;
1311 if ((resultflags & TESTCASE_RESULT_TRANSACTION) != 0)
1313 Transaction *trans = solver_create_transaction(solv);
1317 for (i = 0; class2str[i].str; i++)
1320 transaction_classify_pkgs(trans, SOLVER_TRANSACTION_KEEP_PSEUDO, class2str[i].class, 0, 0, &q);
1321 for (j = 0; j < q.count; j++)
1325 if (pool->installed && pool->solvables[p].repo == pool->installed)
1326 op = transaction_obs_pkg(trans, p);
1327 s = pool_tmpjoin(pool, class2str[i].str, " ", testcase_solvid2str(pool, p));
1329 s = pool_tmpjoin(pool, s, " ", testcase_solvid2str(pool, op));
1330 strqueue_push(&sq, s);
1334 transaction_free(trans);
1336 if ((resultflags & TESTCASE_RESULT_PROBLEMS) != 0)
1338 char *probprefix, *solprefix;
1339 int problem, solution, element;
1342 pcnt = solver_problem_count(solv);
1343 for (problem = 1; problem <= pcnt; problem++)
1345 Id rid, from, to, dep;
1346 SolverRuleinfo rinfo;
1347 rid = solver_findproblemrule(solv, problem);
1348 s = testcase_problemid(solv, problem);
1349 probprefix = solv_dupjoin("problem ", s, 0);
1350 rinfo = solver_ruleinfo(solv, rid, &from, &to, &dep);
1351 s = pool_tmpjoin(pool, probprefix, " info ", solver_problemruleinfo2str(solv, rinfo, from, to, dep));
1352 strqueue_push(&sq, s);
1353 scnt = solver_solution_count(solv, problem);
1354 for (solution = 1; solution <= scnt; solution++)
1356 s = testcase_solutionid(solv, problem, solution);
1357 solprefix = solv_dupjoin(probprefix, " solution ", s);
1359 while ((element = solver_next_solutionelement(solv, problem, solution, element, &p, &op)) != 0)
1361 if (p == SOLVER_SOLUTION_JOB)
1362 s = pool_tmpjoin(pool, solprefix, " deljob ", testcase_job2str(pool, solv->job.elements[op - 1], solv->job.elements[op]));
1363 else if (p > 0 && op == 0)
1364 s = pool_tmpjoin(pool, solprefix, " erase ", testcase_solvid2str(pool, p));
1365 else if (p > 0 && op > 0)
1367 s = pool_tmpjoin(pool, solprefix, " replace ", testcase_solvid2str(pool, p));
1368 s = pool_tmpappend(pool, s, " ", testcase_solvid2str(pool, op));
1370 else if (p < 0 && op > 0)
1371 s = pool_tmpjoin(pool, solprefix, " allow ", testcase_solvid2str(pool, op));
1373 s = pool_tmpjoin(pool, solprefix, " unknown", 0);
1374 strqueue_push(&sq, s);
1376 solv_free(solprefix);
1378 solv_free(probprefix);
1382 if ((resultflags & TESTCASE_RESULT_ORPHANED) != 0)
1387 solver_get_orphaned(solv, &q);
1388 for (i = 0; i < q.count; i++)
1390 s = pool_tmpjoin(pool, "orphaned ", testcase_solvid2str(pool, q.elements[i]), 0);
1391 strqueue_push(&sq, s);
1396 if ((resultflags & TESTCASE_RESULT_RECOMMENDED) != 0)
1402 solver_get_recommendations(solv, &qr, &qs, 0);
1403 for (i = 0; i < qr.count; i++)
1405 s = pool_tmpjoin(pool, "recommended ", testcase_solvid2str(pool, qr.elements[i]), 0);
1406 strqueue_push(&sq, s);
1408 for (i = 0; i < qs.count; i++)
1410 s = pool_tmpjoin(pool, "suggested ", testcase_solvid2str(pool, qs.elements[i]), 0);
1411 strqueue_push(&sq, s);
1417 if ((resultflags & TESTCASE_RESULT_UNNEEDED) != 0)
1422 solver_get_unneeded(solv, &q, 0);
1423 for (i = 0; i < q.count; i++)
1425 s = pool_tmpjoin(pool, "unneeded ", testcase_solvid2str(pool, q.elements[i]), 0);
1426 strqueue_push(&sq, s);
1432 result = strqueue_join(&sq);
1439 testcase_write(Solver *solv, char *dir, int resultflags, const char *testcasename, const char *resultname)
1441 Pool *pool = solv->pool;
1452 testcasename = "testcase.t";
1454 resultname = "solver.result";
1456 if (mkdir(dir, 0777) && errno != EEXIST)
1458 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: could not create directory '%s'\n", dir);
1462 FOR_REPOS(repoid, repo)
1464 const char *name = testcase_repoid2str(pool, repoid);
1466 if (repo->subpriority)
1467 sprintf(priobuf, "%d.%d", repo->priority, repo->subpriority);
1469 sprintf(priobuf, "%d", repo->priority);
1470 out = pool_tmpjoin(pool, name, ".repo", ".gz");
1471 cmd = pool_tmpjoin(pool, "repo ", name, " ");
1472 cmd = pool_tmpappend(pool, cmd, priobuf, " ");
1473 cmd = pool_tmpappend(pool, cmd, "testtags ", out);
1474 strqueue_push(&sq, cmd);
1475 out = pool_tmpjoin(pool, dir, "/", out);
1476 if (!(fp = solv_xfopen(out, "w")))
1478 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: could not open '%s' for writing\n", out);
1482 testcase_write_testtags(repo, fp);
1485 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: write error\n");
1490 /* hmm, this is not optimal... we currently search for the lowest score */
1492 arch = pool->solvables[SYSTEMSOLVABLE].arch;
1493 for (i = 0; i < pool->lastarch; i++)
1495 if (pool->id2arch[i] == 1 && !lowscore)
1497 if (pool->id2arch[i] > 0x10000 && (!lowscore || pool->id2arch[i] < lowscore))
1500 lowscore = pool->id2arch[i];
1503 cmd = pool_tmpjoin(pool, "system ", pool->lastarch ? pool_id2str(pool, arch) : "unset", 0);
1504 for (i = 0; disttype2str[i].str != 0; i++)
1505 if (pool->disttype == disttype2str[i].type)
1507 pool_tmpappend(pool, cmd, " ", disttype2str[i].str ? disttype2str[i].str : "unknown");
1508 if (pool->installed)
1509 cmd = pool_tmpappend(pool, cmd, " ", testcase_repoid2str(pool, pool->installed->repoid));
1510 strqueue_push(&sq, cmd);
1511 s = testcase_getpoolflags(solv->pool);
1514 cmd = pool_tmpjoin(pool, "poolflags ", s, 0);
1515 strqueue_push(&sq, cmd);
1518 if (pool->vendorclasses)
1521 for (i = 0; pool->vendorclasses[i]; i++)
1523 cmd = pool_tmpappend(pool, cmd ? cmd : "vendorclass", " ", pool->vendorclasses[i]);
1524 if (!pool->vendorclasses[i + 1])
1526 strqueue_push(&sq, cmd);
1533 s = testcase_getsolverflags(solv);
1536 cmd = pool_tmpjoin(pool, "solverflags ", s, 0);
1537 strqueue_push(&sq, cmd);
1540 /* now dump all the ns callback values we know */
1541 if (pool->nscallback)
1545 for (rid = 1; rid < pool->nrels; rid++)
1547 Reldep *rd = pool->rels + rid;
1548 if (rd->flags != REL_NAMESPACE || rd->name == NAMESPACE_OTHERPROVIDERS)
1550 /* evaluate all namespace ids, skip empty results */
1551 d = pool_whatprovides(pool, MAKERELDEP(rid));
1552 if (!d || !pool->whatprovidesdata[d])
1554 cmd = pool_tmpjoin(pool, "namespace ", pool_id2str(pool, rd->name), "(");
1555 cmd = pool_tmpappend(pool, cmd, pool_id2str(pool, rd->evr), ")");
1556 for (; pool->whatprovidesdata[d]; d++)
1557 cmd = pool_tmpappend(pool, cmd, " ", testcase_solvid2str(pool, pool->whatprovidesdata[d]));
1558 strqueue_push(&sq, cmd);
1562 for (i = 0; i < solv->job.count; i += 2)
1564 cmd = (char *)testcase_job2str(pool, solv->job.elements[i], solv->job.elements[i + 1]);
1565 cmd = pool_tmpjoin(pool, "job ", cmd, 0);
1566 strqueue_push(&sq, cmd);
1573 for (i = 0; resultflags2str[i].str; i++)
1574 if ((resultflags & resultflags2str[i].flag) != 0)
1575 cmd = pool_tmpappend(pool, cmd, cmd ? "," : 0, resultflags2str[i].str);
1576 cmd = pool_tmpjoin(pool, "result ", cmd ? cmd : "?", 0);
1577 cmd = pool_tmpappend(pool, cmd, " ", resultname);
1578 strqueue_push(&sq, cmd);
1579 result = testcase_solverresult(solv, resultflags);
1580 if (!strcmp(resultname, "<inline>"))
1584 strqueue_init(&rsq);
1585 strqueue_split(&rsq, result);
1586 for (i = 0; i < rsq.nstr; i++)
1588 cmd = pool_tmpjoin(pool, "#>", rsq.str[i], 0);
1589 strqueue_push(&sq, cmd);
1591 strqueue_free(&rsq);
1595 out = pool_tmpjoin(pool, dir, "/", resultname);
1596 if (!(fp = fopen(out, "w")))
1598 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: could not open '%s' for writing\n", out);
1603 if (result && *result && fwrite(result, strlen(result), 1, fp) != 1)
1605 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: write error\n");
1612 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: write error\n");
1620 cmd = strqueue_join(&sq);
1621 out = pool_tmpjoin(pool, dir, "/", testcasename);
1622 if (!(fp = fopen(out, "w")))
1624 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: could not open '%s' for writing\n", out);
1628 if (*cmd && fwrite(cmd, strlen(cmd), 1, fp) != 1)
1630 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: write error\n");
1636 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: write error\n");
1646 read_inline_file(FILE *fp, char **bufp, char **bufpp, int *buflp)
1648 char *result = solv_malloc(1024);
1655 if (rp - result + 256 >= resultl)
1657 resultl = rp - result;
1658 result = solv_realloc(result, resultl + 1024);
1659 rp = result + resultl;
1662 if (!fgets(rp, resultl - (rp - result), fp))
1665 if (rl && (rp == result || rp[-1] == '\n'))
1667 if (rl > 1 && rp[0] == '#' && rp[1] == '>')
1669 memmove(rp, rp + 2, rl - 2);
1674 while (rl + 16 > *buflp)
1676 *bufp = solv_realloc(*bufp, *buflp + 512);
1679 memmove(*bufp, rp, rl);
1680 if ((*bufp)[rl - 1] == '\n')
1686 (*bufpp) = *bufp + rl;
1703 char *result = solv_malloc(1024);
1710 if (rp - result + 256 >= resultl)
1712 resultl = rp - result;
1713 result = solv_realloc(result, resultl + 1024);
1714 rp = result + resultl;
1717 rl = fread(rp, 1, resultl - (rp - result), fp);
1729 testcase_read(Pool *pool, FILE *fp, char *testcase, Queue *job, char **resultp, int *resultflagsp)
1734 char *testcasedir, *s;
1740 int poolflagsreset = 0;
1742 if (!fp && !(fp = fopen(testcase, "r")))
1744 pool_debug(pool, SOLV_ERROR, "testcase_read: could not open '%s'\n", testcase);
1747 testcasedir = solv_strdup(testcase);
1748 if ((s = strrchr(testcasedir, '/')) != 0)
1753 buf = solv_malloc(bufl);
1758 if (bufp - buf + 16 > bufl)
1761 buf = solv_realloc(buf, bufl + 512);
1765 if (!fgets(bufp, bufl - (bufp - buf), fp))
1769 if (!l || buf[l - 1] != '\n')
1776 while (*s && (*s == ' ' || *s == '\t'))
1778 if (!*s || *s == '#')
1781 /* split it in pieces */
1784 while (*s == ' ' || *s == '\t')
1788 pieces = solv_extend(pieces, npieces, 1, sizeof(*pieces), 7);
1789 pieces[npieces++] = s;
1790 while (*s && *s != ' ' && *s != '\t')
1795 pieces = solv_extend(pieces, npieces, 1, sizeof(*pieces), 7);
1796 pieces[npieces] = 0;
1797 if (!strcmp(pieces[0], "repo") && npieces >= 4)
1799 Repo *repo = repo_create(pool, pieces[1]);
1805 if (!poolflagsreset)
1808 testcase_resetpoolflags(pool); /* hmm */
1810 if (sscanf(pieces[2], "%d.%d", &prio, &subprio) != 2)
1813 prio = atoi(pieces[2]);
1815 repo->priority = prio;
1816 repo->subpriority = subprio;
1817 if (strcmp(pieces[3], "empty") != 0)
1819 const char *repotype = pool_tmpjoin(pool, pieces[3], 0, 0); /* gets overwritten in <inline> case */
1820 if (!strcmp(pieces[4], "<inline>"))
1822 char *idata = read_inline_file(fp, &buf, &bufp, &bufl);
1824 rfp = solv_xfopen_buf(rdata, &idata, 0, "rf");
1828 rdata = pool_tmpjoin(pool, testcasedir, pieces[4], 0);
1829 rfp = solv_xfopen(rdata, "r");
1833 pool_debug(pool, SOLV_ERROR, "testcase_read: could not open '%s'\n", rdata);
1835 else if (!strcmp(repotype, "testtags"))
1837 testcase_add_testtags(repo, rfp, 0);
1840 else if (!strcmp(repotype, "solv"))
1842 repo_add_solv(repo, rfp, 0);
1848 pool_debug(pool, SOLV_ERROR, "testcase_read: unknown repo type for repo '%s'\n", repo->name);
1852 else if (!strcmp(pieces[0], "system") && npieces >= 3)
1856 /* must set the disttype before the arch */
1857 for (i = 0; disttype2str[i].str != 0; i++)
1858 if (!strcmp(disttype2str[i].str, pieces[2]))
1860 if (!disttype2str[i].str)
1861 pool_debug(pool, SOLV_ERROR, "testcase_read: system: unknown disttype '%s'\n", pieces[2]);
1862 else if (pool->disttype != disttype2str[i].type)
1864 #ifdef MULTI_SEMANTICS
1865 pool_setdisttype(pool, disttype2str[i].type);
1867 pool_debug(pool, SOLV_ERROR, "testcase_read: system: cannot change disttype to '%s'\n", pieces[2]);
1870 if (strcmp(pieces[1], "unset") != 0)
1871 pool_setarch(pool, pieces[1]);
1873 pool_setarch(pool, 0);
1876 Repo *repo = testcase_str2repo(pool, pieces[3]);
1878 pool_debug(pool, SOLV_ERROR, "testcase_read: system: unknown repo '%s'\n", pieces[3]);
1880 pool_set_installed(pool, repo);
1883 else if (!strcmp(pieces[0], "job") && npieces > 1)
1889 pool_addfileprovides(pool);
1890 pool_createwhatprovides(pool);
1894 for (sp = pieces[1]; sp < pieces[npieces - 1]; sp++)
1897 how = testcase_str2job(pool, pieces[1], &what);
1898 if (how >= 0 && job)
1899 queue_push2(job, how, what);
1901 else if (!strcmp(pieces[0], "vendorclass") && npieces > 1)
1903 pool_addvendorclass(pool, (const char **)(pieces + 1));
1905 else if (!strcmp(pieces[0], "namespace") && npieces > 1)
1907 int i = strlen(pieces[1]);
1908 s = strchr(pieces[1], '(');
1909 if (!s && pieces[1][i - 1] != ')')
1911 pool_debug(pool, SOLV_ERROR, "testcase_read: bad namespace '%s'\n", pieces[1]);
1919 pieces[1][i - 1] = 0;
1920 name = pool_str2id(pool, pieces[1], 1);
1921 evr = pool_str2id(pool, s + 1, 1);
1923 pieces[1][i - 1] = ')';
1924 id = pool_rel2id(pool, name, evr, REL_NAMESPACE, 1);
1925 for (i = 2; i < npieces; i++)
1926 queue_push(&q, testcase_str2solvid(pool, pieces[i]));
1927 /* now do the callback */
1930 pool_addfileprovides(pool);
1931 pool_createwhatprovides(pool);
1934 pool->whatprovides_rel[GETRELID(id)] = pool_queuetowhatprovides(pool, &q);
1938 else if (!strcmp(pieces[0], "poolflags"))
1941 if (!poolflagsreset)
1944 testcase_resetpoolflags(pool); /* hmm */
1946 for (i = 1; i < npieces; i++)
1947 testcase_setpoolflags(pool, pieces[i]);
1949 else if (!strcmp(pieces[0], "solverflags") && npieces > 1)
1954 solv = solver_create(pool);
1955 testcase_resetsolverflags(solv);
1957 for (i = 1; i < npieces; i++)
1958 testcase_setsolverflags(solv, pieces[i]);
1960 else if (!strcmp(pieces[0], "result") && npieces > 2)
1964 int resultflags = 0;
1965 char *s = pieces[1];
1969 char *se = strchr(s, ',');
1972 for (i = 0; resultflags2str[i].str; i++)
1973 if (!strcmp(s, resultflags2str[i].str))
1975 resultflags |= resultflags2str[i].flag;
1978 if (!resultflags2str[i].str)
1979 pool_debug(pool, SOLV_ERROR, "result: unknown flag '%s'\n", s);
1983 rdata = pool_tmpjoin(pool, testcasedir, pieces[2], 0);
1984 if (!strcmp(pieces[2], "<inline>"))
1985 result = read_inline_file(fp, &buf, &bufp, &bufl);
1988 FILE *rfp = fopen(rdata, "r");
1990 pool_debug(pool, SOLV_ERROR, "testcase_read: could not open '%s'\n", rdata);
1993 result = read_file(rfp);
2002 *resultflagsp = resultflags;
2004 else if (!strcmp(pieces[0], "nextjob") && npieces == 1)
2010 pool_debug(pool, SOLV_ERROR, "testcase_read: cannot parse command '%s'\n", pieces[0]);
2013 buf = solv_free(buf);
2014 pieces = solv_free(pieces);
2015 solv_free(testcasedir);
2018 pool_addfileprovides(pool);
2019 pool_createwhatprovides(pool);
2023 solv = solver_create(pool);
2024 testcase_resetsolverflags(solv);
2032 testcase_resultdiff(char *result1, char *result2)
2034 Strqueue sq1, sq2, osq;
2036 strqueue_init(&sq1);
2037 strqueue_init(&sq2);
2038 strqueue_init(&osq);
2039 strqueue_split(&sq1, result1);
2040 strqueue_split(&sq2, result2);
2041 strqueue_sort(&sq1);
2042 strqueue_sort(&sq2);
2043 strqueue_diff(&sq1, &sq2, &osq);
2044 r = osq.nstr ? strqueue_join(&osq) : 0;
2045 strqueue_free(&sq1);
2046 strqueue_free(&sq2);
2047 strqueue_free(&osq);