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_SETEV, "setev" },
57 { SOLVER_SETEVR, "setevr" },
58 { SOLVER_SETARCH, "setarch" },
59 { SOLVER_SETVENDOR, "setvendor" },
60 { SOLVER_SETREPO, "setrepo" },
61 { SOLVER_NOAUTOSET, "noautoset" },
65 static struct resultflags2str {
68 } resultflags2str[] = {
69 { TESTCASE_RESULT_TRANSACTION, "transaction" },
70 { TESTCASE_RESULT_PROBLEMS, "problems" },
71 { TESTCASE_RESULT_ORPHANED, "orphaned" },
72 { TESTCASE_RESULT_RECOMMENDED, "recommended" },
73 { TESTCASE_RESULT_UNNEEDED, "unneeded" },
77 static struct solverflags2str {
81 } solverflags2str[] = {
82 { SOLVER_FLAG_ALLOW_DOWNGRADE, "allowdowngrade", 0 },
83 { SOLVER_FLAG_ALLOW_NAMECHANGE, "allownamechange", 1 },
84 { SOLVER_FLAG_ALLOW_ARCHCHANGE, "allowarchchange", 0 },
85 { SOLVER_FLAG_ALLOW_VENDORCHANGE, "allowvendorchange", 0 },
86 { SOLVER_FLAG_ALLOW_UNINSTALL, "allowuninstall", 0 },
87 { SOLVER_FLAG_NO_UPDATEPROVIDE, "noupdateprovide", 0 },
88 { SOLVER_FLAG_SPLITPROVIDES, "splitprovides", 0 },
89 { SOLVER_FLAG_IGNORE_RECOMMENDED, "ignorerecommended", 0 },
90 { SOLVER_FLAG_ADD_ALREADY_RECOMMENDED, "addalreadyrecommended", 0 },
91 { SOLVER_FLAG_NO_INFARCHCHECK, "noinfarchcheck", 0 },
92 { SOLVER_FLAG_KEEP_EXPLICIT_OBSOLETES, "keepexplicitobsoletes", 0 },
96 static struct poolflags2str {
100 } poolflags2str[] = {
101 { POOL_FLAG_PROMOTEEPOCH, "promoteepoch", 0 },
102 { POOL_FLAG_FORBIDSELFCONFLICTS, "forbidselfconflicts", 0 },
103 { POOL_FLAG_OBSOLETEUSESPROVIDES, "obsoleteusesprovides", 0 },
104 { POOL_FLAG_IMPLICITOBSOLETEUSESPROVIDES, "implicitobsoleteusesprovides", 0 },
105 { POOL_FLAG_OBSOLETEUSESCOLORS, "obsoleteusescolors", 0 },
106 { POOL_FLAG_NOINSTALLEDOBSOLETES, "noinstalledobsoletes", 0 },
107 { POOL_FLAG_HAVEDISTEPOCH, "havedistepoch", 0 },
111 static struct disttype2str {
115 { DISTTYPE_RPM, "rpm" },
116 { DISTTYPE_DEB, "deb" },
117 { DISTTYPE_ARCH, "arch" },
121 typedef struct strqueue {
126 #define STRQUEUE_BLOCK 63
129 strqueue_init(Strqueue *q)
136 strqueue_free(Strqueue *q)
139 for (i = 0; i < q->nstr; i++)
140 solv_free(q->str[i]);
141 q->str = solv_free(q->str);
146 strqueue_push(Strqueue *q, const char *s)
148 q->str = solv_extend(q->str, q->nstr, 1, sizeof(*q->str), STRQUEUE_BLOCK);
149 q->str[q->nstr++] = solv_strdup(s);
153 strqueue_pushjoin(Strqueue *q, const char *s1, const char *s2, const char *s3)
155 q->str = solv_extend(q->str, q->nstr, 1, sizeof(*q->str), STRQUEUE_BLOCK);
156 q->str[q->nstr++] = solv_dupjoin(s1, s2, s3);
160 strqueue_sort_cmp(const void *ap, const void *bp, void *dp)
162 const char *a = *(const char **)ap;
163 const char *b = *(const char **)bp;
164 return strcmp(a ? a : "", b ? b : "");
168 strqueue_sort(Strqueue *q)
171 solv_sort(q->str, q->nstr, sizeof(*q->str), strqueue_sort_cmp, 0);
175 strqueue_sort_u(Strqueue *q)
179 for (i = j = 0; i < q->nstr; i++)
180 if (!j || strqueue_sort_cmp(q->str + i, q->str + j - 1, 0) != 0)
181 q->str[j++] = q->str[i];
186 strqueue_join(Strqueue *q)
190 for (i = 0; i < q->nstr; i++)
192 l += strlen(q->str[i]) + 1;
193 l++; /* trailing \0 */
196 for (i = 0; i < q->nstr; i++)
199 strcpy(rp, q->str[i]);
208 strqueue_split(Strqueue *q, const char *s)
213 while ((p = strchr(s, '\n')) != 0)
215 q->str = solv_extend(q->str, q->nstr, 1, sizeof(*q->str), STRQUEUE_BLOCK);
216 q->str[q->nstr] = solv_malloc(p - s + 1);
218 memcpy(q->str[q->nstr], s, p - s);
219 q->str[q->nstr][p - s] = 0;
228 strqueue_diff(Strqueue *sq1, Strqueue *sq2, Strqueue *osq)
231 while (i < sq1->nstr && j < sq2->nstr)
233 int r = strqueue_sort_cmp(sq1->str + i, sq2->str + j, 0);
237 strqueue_pushjoin(osq, "-", sq1->str[i++], 0);
239 strqueue_pushjoin(osq, "+", sq2->str[j++], 0);
241 while (i < sq1->nstr)
242 strqueue_pushjoin(osq, "-", sq1->str[i++], 0);
243 while (j < sq2->nstr)
244 strqueue_pushjoin(osq, "+", sq2->str[j++], 0);
248 pool_isknownarch(Pool *pool, Id id)
250 if (!id || id == ID_EMPTY)
252 if (id == ARCH_SRC || id == ARCH_NOSRC || id == ARCH_NOARCH)
254 if (!pool->id2arch || (id > pool->lastarch || !pool->id2arch[id]))
260 testcase_str2dep(Pool *pool, char *s)
266 if ((n = strchr(s, '|')) != 0)
268 id = testcase_str2dep(pool, n + 1);
270 id = pool_rel2id(pool, testcase_str2dep(pool, s), id, REL_OR, 1);
274 while (*s == ' ' || *s == '\t')
277 while (*s && *s != ' ' && *s != '\t' && *s != '<' && *s != '=' && *s != '>')
281 while (*s && *s != ')')
287 if ((a = strchr(n, '.')) != 0 && a + 1 < s && s[-1] != ')')
289 Id archid = pool_strn2id(pool, a + 1, s - (a + 1), 0);
290 if (pool_isknownarch(pool, archid))
292 id = pool_strn2id(pool, n, a - n, 1);
293 id = pool_rel2id(pool, id, archid, REL_ARCH, 1);
296 id = pool_strn2id(pool, n, s - n, 1);
299 id = pool_strn2id(pool, n, s - n, 1);
302 while (*s == ' ' || *s == '\t')
318 while (*s == ' ' || *s == '\t')
321 while (*s && *s != ' ' && *s != '\t')
323 return pool_rel2id(pool, id, pool_strn2id(pool, n, s - n, 1), flags, 1);
327 testcase_repoid2str(Pool *pool, Id repoid)
329 Repo *repo = pool_id2repo(pool, repoid);
332 char *r = pool_tmpjoin(pool, repo->name, 0, 0);
334 for (rp = r; *rp; rp++)
335 if (*rp == ' ' || *rp == '\t')
342 sprintf(buf, "#%d", repoid);
343 return pool_tmpjoin(pool, buf, 0, 0);
348 testcase_solvid2str(Pool *pool, Id p)
350 Solvable *s = pool->solvables + p;
351 const char *n, *e, *a;
354 if (p == SYSTEMSOLVABLE)
356 n = pool_id2str(pool, s->name);
357 e = pool_id2str(pool, s->evr);
358 a = pool_id2str(pool, s->arch);
359 str = pool_alloctmpspace(pool, strlen(n) + strlen(e) + strlen(a) + 3);
360 sprintf(str, "%s-%s.%s", n, e, a);
362 return pool_tmpappend(pool, str, "@", 0);
366 char *str2 = pool_tmpappend(pool, str, "@", s->repo->name);
368 if (str2[l] == ' ' || str2[l] == '\t')
372 sprintf(buf, "@#%d", s->repo->repoid);
373 return pool_tmpappend(pool, str, buf, 0);
377 testcase_str2repo(Pool *pool, const char *str)
381 if (str[0] == '#' && (str[1] >= '0' && str[1] <= '9'))
385 for (j = 1; str[j] >= '0' && str[j] <= '9'; j++)
386 repoid = repoid * 10 + (str[j] - '0');
387 if (!str[j] && repoid > 0 && repoid < pool->nrepos)
388 repo = pool_id2repo(pool, repoid);
392 FOR_REPOS(repoid, repo)
397 l = strlen(repo->name);
398 for (i = 0; i < l; i++)
400 int c = repo->name[i];
401 if (c == ' ' || c == '\t')
406 if (i == l && !str[l])
409 if (repoid >= pool->nrepos)
416 testcase_str2solvid(Pool *pool, const char *str)
418 int i, l = strlen(str);
425 if (*str == '@' && !strcmp(str, "@SYSTEM"))
426 return SYSTEMSOLVABLE;
428 for (i = l - 1; i >= 0; i--)
429 if (str[i] == '@' && (repo = testcase_str2repo(pool, str + i + 1)) != 0)
434 /* now find the arch (if present) */
436 for (i = repostart - 1; i > 0; i--)
439 arch = pool_strn2id(pool, str + i + 1, repostart - (i + 1), 0);
444 /* now find the name */
445 for (i = repostart - 1; i > 0; i--)
449 Id nid, evrid, p, pp;
450 nid = pool_strn2id(pool, str, i, 0);
453 evrid = pool_strn2id(pool, str + i + 1, repostart - (i + 1), 0);
456 FOR_PROVIDES(p, pp, nid)
458 Solvable *s = pool->solvables + p;
459 if (s->name != nid || s->evr != evrid)
461 if (repo && s->repo != repo)
463 if (arch && s->arch != arch)
473 testcase_job2str(Pool *pool, Id how, Id what)
480 Id select = how & SOLVER_SELECTMASK;
482 for (i = 0; job2str[i].str; i++)
483 if ((how & SOLVER_JOBMASK) == job2str[i].job)
485 jobstr = job2str[i].str ? job2str[i].str : "unknown";
486 if (select == SOLVER_SOLVABLE)
489 pkgstr = testcase_solvid2str(pool, what);
491 else if (select == SOLVER_SOLVABLE_NAME)
494 pkgstr = pool_dep2str(pool, what);
496 else if (select == SOLVER_SOLVABLE_PROVIDES)
498 selstr = " provides ";
499 pkgstr = pool_dep2str(pool, what);
501 else if (select == SOLVER_SOLVABLE_ONE_OF)
506 while ((p = pool->whatprovidesdata[what++]) != 0)
508 const char *s = testcase_solvid2str(pool, p);
511 pkgstr = pool_tmpappend(pool, pkgstr, " ", s);
512 pool_freetmpspace(pool, s);
520 else if (select == SOLVER_SOLVABLE_REPO)
522 Repo *repo = pool_id2repo(pool, what);
527 sprintf(buf, "#%d", repo->repoid);
528 pkgstr = pool_tmpjoin(pool, buf, 0, 0);
531 pkgstr = pool_tmpjoin(pool, repo->name, 0, 0);
533 else if (select == SOLVER_SOLVABLE_ALL)
540 selstr = " unknown ";
543 ret = pool_tmpjoin(pool, jobstr, selstr, pkgstr);
545 ret = pool_tmpappend(pool, ret, " ", 0);
546 for (i = 0; jobflags2str[i].str; i++)
547 if ((how & jobflags2str[i].flag) != 0)
548 ret = pool_tmpappend(pool, ret, ",", jobflags2str[i].str);
554 ret = pool_tmpappend(pool, ret, "]", 0);
560 testcase_str2job(Pool *pool, const char *str, Id *whatp)
570 /* so we can patch it */
571 s = pool_tmpjoin(pool, str, 0, 0);
572 /* split it in pieces */
575 while (*s == ' ' || *s == '\t')
579 pieces = solv_extend(pieces, npieces, 1, sizeof(*pieces), 7);
580 pieces[npieces++] = s;
581 while (*s && *s != ' ' && *s != '\t')
588 pool_debug(pool, SOLV_ERROR, "str2job: bad line '%s'\n", str);
593 for (i = 0; job2str[i].str; i++)
594 if (!strcmp(pieces[0], job2str[i].str))
598 pool_debug(pool, SOLV_ERROR, "str2job: unknown job '%s'\n", str);
602 job = job2str[i].job;
605 char *flags = pieces[npieces - 1];
607 if (*flags == '[' && flags[strlen(flags) - 1] == ']')
611 flags[strlen(flags) - 1] = ',';
614 for (nf = flags; *nf != ','; nf++)
617 for (i = 0; jobflags2str[i].str; i++)
618 if (!strcmp(flags, jobflags2str[i].str))
620 if (!jobflags2str[i].str)
622 pool_debug(pool, SOLV_ERROR, "str2job: unknown jobflags in '%s'\n", str);
626 job |= jobflags2str[i].flag;
631 if (!strcmp(pieces[1], "pkg"))
635 pool_debug(pool, SOLV_ERROR, "str2job: bad pkg selector in '%s'\n", str);
639 job |= SOLVER_SOLVABLE;
640 what = testcase_str2solvid(pool, pieces[2]);
643 pool_debug(pool, SOLV_ERROR, "str2job: unknown package '%s'\n", pieces[2]);
648 else if (!strcmp(pieces[1], "name") || !strcmp(pieces[1], "provides"))
650 /* join em again for dep2str... */
652 for (sp = pieces[2]; sp < pieces[npieces - 1]; sp++)
655 what = testcase_str2dep(pool, pieces[2]);
656 if (pieces[1][0] == 'n')
657 job |= SOLVER_SOLVABLE_NAME;
659 job |= SOLVER_SOLVABLE_PROVIDES;
661 else if (!strcmp(pieces[1], "oneof"))
664 job |= SOLVER_SOLVABLE_ONE_OF;
666 if (npieces > 3 && strcmp(pieces[2], "nothing") != 0)
668 for (i = 2; i < npieces; i++)
670 Id p = testcase_str2solvid(pool, pieces[i]);
673 pool_debug(pool, SOLV_ERROR, "str2job: unknown package '%s'\n", pieces[i]);
681 what = pool_queuetowhatprovides(pool, &q);
684 else if (!strcmp(pieces[1], "repo"))
689 pool_debug(pool, SOLV_ERROR, "str2job: bad line '%s'\n", str);
693 repo = testcase_str2repo(pool, pieces[2]);
696 pool_debug(pool, SOLV_ERROR, "str2job: unknown repo '%s'\n", pieces[2]);
700 job |= SOLVER_SOLVABLE_REPO;
703 else if (!strcmp(pieces[1], "all"))
705 if (npieces != 3 && strcmp(pieces[2], "packages") != 0)
707 pool_debug(pool, SOLV_ERROR, "str2job: bad line '%s'\n", str);
711 job |= SOLVER_SOLVABLE_ALL;
716 pool_debug(pool, SOLV_ERROR, "str2job: unknown selection in '%s'\n", str);
726 writedeps(Repo *repo, FILE *fp, const char *tag, Id key, Solvable *s, Offset off)
728 Pool *pool = repo->pool;
735 dp = repo->idarraydata + off;
737 while ((id = *dp++) != 0)
739 if (key == SOLVABLE_REQUIRES && id == SOLVABLE_PREREQMARKER)
742 fprintf(fp, "-%s\n", tag);
747 if (key == SOLVABLE_PROVIDES && id == SOLVABLE_FILEMARKER)
752 idstr = pool_dep2str(pool, id);
755 Reldep *rd = GETRELDEP(pool, id);
756 if (key == SOLVABLE_CONFLICTS && rd->flags == REL_NAMESPACE && rd->name == NAMESPACE_OTHERPROVIDERS)
758 if (!strncmp(idstr, "namespace:", 10))
761 if (key == SOLVABLE_SUPPLEMENTS)
763 if (rd->flags == REL_NAMESPACE && rd->name == NAMESPACE_FILESYSTEM)
765 if (!strncmp(idstr, "namespace:", 10))
768 else if (rd->flags == REL_NAMESPACE && rd->name == NAMESPACE_MODALIAS)
770 if (!strncmp(idstr, "namespace:", 10))
773 else if (rd->flags == REL_AND)
775 /* either packageand chain or modalias */
777 if (ISRELDEP(rd->evr))
779 Reldep *mrd = GETRELDEP(pool, rd->evr);
780 if (mrd->flags == REL_NAMESPACE && mrd->name == NAMESPACE_MODALIAS)
782 idstr = pool_tmpjoin(pool, "modalias(", pool_dep2str(pool, rd->name), ":");
783 idstr = pool_tmpappend(pool, idstr, pool_dep2str(pool, mrd->evr), ")");
785 else if (mrd->flags >= 8)
790 /* must be and chain */
791 idstr = pool_dep2str(pool, rd->evr);
797 rd = GETRELDEP(pool, id);
798 if (rd->flags != REL_AND)
800 idstr = pool_tmpjoin(pool, pool_dep2str(pool, rd->evr), ":", idstr);
802 idstr = pool_tmpjoin(pool, pool_dep2str(pool, id), ":", idstr);
803 idstr = pool_tmpjoin(pool, "packageand(", idstr, ")");
806 else if (rd->flags >= 8)
812 fprintf(fp, "+%s\n", tag);
815 fprintf(fp, "%s\n", idstr);
817 if (key == SOLVABLE_PROVIDES)
819 /* add the filelist */
821 dataiterator_init(&di, pool, repo, s - pool->solvables, SOLVABLE_FILELIST, 0, 0);
822 while (dataiterator_step(&di))
824 const char *s = repodata_dir2str(di.data, di.kv.id, di.kv.str);
827 Id id = pool_str2id(pool, s, 0);
830 for (dp = prvdp; *dp; dp++)
834 continue; /* already included */
839 fprintf(fp, "+%s", tag);
842 fprintf(fp, "%s\n", s);
846 fprintf(fp, "-%s\n", tag);
850 testcase_write_testtags(Repo *repo, FILE *fp)
852 Pool *pool = repo->pool;
862 fprintf(fp, "=Ver: 2.0\n");
863 FOR_REPO_SOLVABLES(repo, p, s)
865 name = pool_id2str(pool, s->name);
866 evr = pool_id2str(pool, s->evr);
867 arch = pool_id2str(pool, s->arch);
868 release = strrchr(evr, '-');
870 release = evr + strlen(evr);
871 fprintf(fp, "=Pkg: %s %.*s %s %s\n", name, (int)(release - evr), evr, *release && release[1] ? release + 1 : "-", arch);
872 tmp = solvable_lookup_str(s, SOLVABLE_SUMMARY);
874 fprintf(fp, "=Sum: %s\n", tmp);
875 writedeps(repo, fp, "Req:", SOLVABLE_REQUIRES, s, s->requires);
876 writedeps(repo, fp, "Prv:", SOLVABLE_PROVIDES, s, s->provides);
877 writedeps(repo, fp, "Obs:", SOLVABLE_OBSOLETES, s, s->obsoletes);
878 writedeps(repo, fp, "Con:", SOLVABLE_CONFLICTS, s, s->conflicts);
879 writedeps(repo, fp, "Rec:", SOLVABLE_RECOMMENDS, s, s->recommends);
880 writedeps(repo, fp, "Sup:", SOLVABLE_SUPPLEMENTS, s, s->supplements);
881 writedeps(repo, fp, "Sug:", SOLVABLE_SUGGESTS, s, s->suggests);
882 writedeps(repo, fp, "Enh:", SOLVABLE_ENHANCES, s, s->enhances);
884 fprintf(fp, "=Vnd: %s\n", pool_id2str(pool, s->vendor));
885 ti = solvable_lookup_num(s, SOLVABLE_BUILDTIME, 0);
887 fprintf(fp, "=Tim: %u\n", ti);
893 adddep(Repo *repo, Offset olddeps, char *str, Id marker)
895 Id id = *str == '/' ? pool_str2id(repo->pool, str, 1) : testcase_str2dep(repo->pool, str);
896 return repo_addid_dep(repo, olddeps, id, marker);
900 finish_solvable(Pool *pool, Repodata *data, Solvable *s, char *filelist, int nfilelist)
906 for (l = 0; l < nfilelist; l += strlen(filelist + l) + 1)
908 char *p = strrchr(filelist + l, '/');
912 did = repodata_str2dir(data, filelist + l, 1);
915 did = repodata_str2dir(data, "/", 1);
916 repodata_add_dirstr(data, s - pool->solvables, SOLVABLE_FILELIST, did, p);
919 if (s->name && s->arch != ARCH_SRC && s->arch != ARCH_NOSRC)
920 s->provides = repo_addid_dep(s->repo, s->provides, pool_rel2id(pool, s->name, s->evr, REL_EQ, 1), 0);
921 s->supplements = repo_fix_supplements(s->repo, s->provides, s->supplements, 0);
922 s->conflicts = repo_fix_conflicts(s->repo, s->conflicts);
925 /* stripped down version of susetags parser used for testcases */
927 testcase_add_testtags(Repo *repo, FILE *fp, int flags)
929 Pool *pool = repo->pool;
942 data = repo_add_repodata(repo, flags);
947 line = solv_malloc(aline);
951 if (linep - line + 16 > aline)
953 aline = linep - line;
954 line = solv_realloc(line, aline + 512);
955 linep = line + aline;
958 if (!fgets(linep, aline - (linep - line), fp))
960 linep += strlen(linep);
961 if (linep == line || linep[-1] != '\n')
964 linep = line + intag;
967 if (line[intag] == '-' && !strncmp(line + 1, line + intag + 1, intag - 2))
974 else if (line[0] == '+' && line[1] && line[1] != ':')
976 char *tagend = strchr(line, ':');
981 intag = tagend + 2 - line;
982 linep = line + intag;
985 if (*line != '=' || !line[1] || !line[2] || !line[3] || line[4] != ':')
987 tag = line[1] << 16 | line[2] << 8 | line[3];
990 case 'P' << 16 | 'k' << 8 | 'g':
992 finish_solvable(pool, data, s, filelist, nfilelist);
994 if (split(line + 5, sp, 5) != 4)
996 s = pool_id2solvable(pool, repo_add_solvable(repo));
997 s->name = pool_str2id(pool, sp[0], 1);
998 /* join back version and release */
999 if (sp[2] && !(sp[2][0] == '-' && !sp[2][1]))
1001 s->evr = makeevr(pool, sp[1]);
1002 s->arch = pool_str2id(pool, sp[3], 1);
1004 case 'S' << 16 | 'u' << 8 | 'm':
1005 repodata_set_str(data, s - pool->solvables, SOLVABLE_SUMMARY, line + 6);
1007 case 'V' << 16 | 'n' << 8 | 'd':
1008 s->vendor = pool_str2id(pool, line + 6, 1);
1010 case 'T' << 16 | 'i' << 8 | 'm':
1013 repodata_set_num(data, s - pool->solvables, SOLVABLE_BUILDTIME, t);
1015 case 'R' << 16 | 'e' << 8 | 'q':
1016 s->requires = adddep(repo, s->requires, line + 6, -SOLVABLE_PREREQMARKER);
1018 case 'P' << 16 | 'r' << 8 | 'q':
1019 s->requires = adddep(repo, s->requires, line + 6, SOLVABLE_PREREQMARKER);
1021 case 'P' << 16 | 'r' << 8 | 'v':
1024 int l = strlen(line + 6) + 1;
1025 if (nfilelist + l > afilelist)
1027 afilelist = nfilelist + l + 512;
1028 filelist = solv_realloc(filelist, afilelist);
1030 memcpy(filelist + nfilelist, line + 6, l);
1037 for (l = 0; l < nfilelist; l += strlen(filelist + l) + 1)
1038 s->provides = repo_addid_dep(repo, s->provides, pool_str2id(pool, filelist + l, 1), 0);
1041 s->provides = adddep(repo, s->provides, line + 6, 0);
1043 case 'O' << 16 | 'b' << 8 | 's':
1044 s->obsoletes = adddep(repo, s->obsoletes, line + 6, 0);
1046 case 'C' << 16 | 'o' << 8 | 'n':
1047 s->conflicts = adddep(repo, s->conflicts, line + 6, 0);
1049 case 'R' << 16 | 'e' << 8 | 'c':
1050 s->recommends = adddep(repo, s->recommends, line + 6, 0);
1052 case 'S' << 16 | 'u' << 8 | 'p':
1053 s->supplements = adddep(repo, s->supplements, line + 6, 0);
1055 case 'S' << 16 | 'u' << 8 | 'g':
1056 s->suggests = adddep(repo, s->suggests, line + 6, 0);
1058 case 'E' << 16 | 'n' << 8 | 'h':
1059 s->enhances = adddep(repo, s->enhances, line + 6, 0);
1066 finish_solvable(pool, data, s, filelist, nfilelist);
1068 solv_free(filelist);
1069 repodata_free_dircache(data);
1070 if (!(flags & REPO_NO_INTERNALIZE))
1071 repodata_internalize(data);
1076 testcase_getpoolflags(Pool *pool)
1078 const char *str = 0;
1080 for (i = 0; poolflags2str[i].str; i++)
1082 v = pool_get_flag(pool, poolflags2str[i].flag);
1083 if (v == poolflags2str[i].def)
1085 str = pool_tmpappend(pool, str, v ? " " : " !", poolflags2str[i].str);
1087 return str ? str + 1 : "";
1091 testcase_setpoolflags(Pool *pool, const char *str)
1093 const char *p = str, *s;
1097 while (*p == ' ' || *p == '\t' || *p == ',')
1108 while (*p && *p != ' ' && *p != '\t' && *p != ',')
1110 for (i = 0; poolflags2str[i].str; i++)
1111 if (!strncmp(poolflags2str[i].str, s, p - s) && poolflags2str[i].str[p - s] == 0)
1113 if (!poolflags2str[i].str)
1115 pool_debug(pool, SOLV_ERROR, "setpoolflags: unknown flag '%.*s'\n", (int)(p - s), s);
1118 pool_set_flag(pool, poolflags2str[i].flag, v);
1124 testcase_resetpoolflags(Pool *pool)
1127 for (i = 0; poolflags2str[i].str; i++)
1128 pool_set_flag(pool, poolflags2str[i].flag, poolflags2str[i].def);
1132 testcase_getsolverflags(Solver *solv)
1134 Pool *pool = solv->pool;
1135 const char *str = 0;
1137 for (i = 0; solverflags2str[i].str; i++)
1139 v = solver_get_flag(solv, solverflags2str[i].flag);
1140 if (v == solverflags2str[i].def)
1142 str = pool_tmpappend(pool, str, v ? " " : " !", solverflags2str[i].str);
1144 return str ? str + 1 : "";
1148 testcase_setsolverflags(Solver *solv, const char *str)
1150 const char *p = str, *s;
1154 while (*p == ' ' || *p == '\t' || *p == ',')
1165 while (*p && *p != ' ' && *p != '\t' && *p != ',')
1167 for (i = 0; solverflags2str[i].str; i++)
1168 if (!strncmp(solverflags2str[i].str, s, p - s) && solverflags2str[i].str[p - s] == 0)
1170 if (!solverflags2str[i].str)
1172 pool_debug(solv->pool, SOLV_ERROR, "setsolverflags: unknown flag '%.*s'\n", (int)(p - s), s);
1175 solver_set_flag(solv, solverflags2str[i].flag, v);
1181 testcase_resetsolverflags(Solver *solv)
1184 for (i = 0; solverflags2str[i].str; i++)
1185 solver_set_flag(solv, solverflags2str[i].flag, solverflags2str[i].def);
1189 testcase_ruleid(Solver *solv, Id rid)
1195 const unsigned char *md5;
1201 solver_ruleliterals(solv, rid, &q);
1202 for (i = 0; i < q.count; i++)
1204 Id p = q.elements[i];
1205 s = testcase_solvid2str(solv->pool, p > 0 ? p : -p);
1207 s = pool_tmpjoin(solv->pool, "!", s, 0);
1208 strqueue_push(&sq, s);
1211 strqueue_sort_u(&sq);
1212 chk = solv_chksum_create(REPOKEY_TYPE_MD5);
1213 for (i = 0; i < sq.nstr; i++)
1214 solv_chksum_add(chk, sq.str[i], strlen(sq.str[i]) + 1);
1215 md5 = solv_chksum_get(chk, &md5l);
1216 s = pool_bin2hex(solv->pool, md5, md5l);
1217 chk = solv_chksum_free(chk, 0);
1223 testcase_problemid(Solver *solv, Id problem)
1228 const unsigned char *md5;
1232 /* we build a hash of all rules that define the problem */
1235 solver_findallproblemrules(solv, problem, &q);
1236 for (i = 0; i < q.count; i++)
1237 strqueue_push(&sq, testcase_ruleid(solv, q.elements[i]));
1239 strqueue_sort_u(&sq);
1240 chk = solv_chksum_create(REPOKEY_TYPE_MD5);
1241 for (i = 0; i < sq.nstr; i++)
1242 solv_chksum_add(chk, sq.str[i], strlen(sq.str[i]) + 1);
1243 md5 = solv_chksum_get(chk, &md5l);
1244 s = pool_bin2hex(solv->pool, md5, 4);
1245 chk = solv_chksum_free(chk, 0);
1251 testcase_solutionid(Solver *solv, Id problem, Id solution)
1255 const unsigned char *md5;
1259 intid = solver_solutionelement_internalid(solv, problem, solution);
1260 /* internal stuff! handle with care! */
1264 s = testcase_job2str(solv->pool, solv->job.elements[-intid - 1], solv->job.elements[-intid]);
1269 s = testcase_ruleid(solv, intid);
1271 chk = solv_chksum_create(REPOKEY_TYPE_MD5);
1272 solv_chksum_add(chk, s, strlen(s) + 1);
1273 md5 = solv_chksum_get(chk, &md5l);
1274 s = pool_bin2hex(solv->pool, md5, 4);
1275 chk = solv_chksum_free(chk, 0);
1279 static struct class2str {
1283 { SOLVER_TRANSACTION_ERASE, "erase" },
1284 { SOLVER_TRANSACTION_INSTALL, "install" },
1285 { SOLVER_TRANSACTION_REINSTALLED, "reinstall" },
1286 { SOLVER_TRANSACTION_DOWNGRADED, "downgrade" },
1287 { SOLVER_TRANSACTION_CHANGED, "change" },
1288 { SOLVER_TRANSACTION_UPGRADED, "upgrade" },
1289 { SOLVER_TRANSACTION_OBSOLETED, "obsolete" },
1290 { SOLVER_TRANSACTION_MULTIINSTALL, "multiinstall" },
1291 { SOLVER_TRANSACTION_MULTIREINSTALL, "multireinstall" },
1296 testcase_solverresult(Solver *solv, int resultflags)
1298 Pool *pool = solv->pool;
1306 if ((resultflags & TESTCASE_RESULT_TRANSACTION) != 0)
1308 Transaction *trans = solver_create_transaction(solv);
1312 for (i = 0; class2str[i].str; i++)
1315 transaction_classify_pkgs(trans, SOLVER_TRANSACTION_KEEP_PSEUDO, class2str[i].class, 0, 0, &q);
1316 for (j = 0; j < q.count; j++)
1320 if (pool->installed && pool->solvables[p].repo == pool->installed)
1321 op = transaction_obs_pkg(trans, p);
1322 s = pool_tmpjoin(pool, class2str[i].str, " ", testcase_solvid2str(pool, p));
1324 s = pool_tmpjoin(pool, s, " ", testcase_solvid2str(pool, op));
1325 strqueue_push(&sq, s);
1329 transaction_free(trans);
1331 if ((resultflags & TESTCASE_RESULT_PROBLEMS) != 0)
1333 char *probprefix, *solprefix;
1334 int problem, solution, element;
1337 pcnt = solver_problem_count(solv);
1338 for (problem = 1; problem <= pcnt; problem++)
1340 Id rid, from, to, dep;
1341 SolverRuleinfo rinfo;
1342 rid = solver_findproblemrule(solv, problem);
1343 s = testcase_problemid(solv, problem);
1344 probprefix = solv_dupjoin("problem ", s, 0);
1345 rinfo = solver_ruleinfo(solv, rid, &from, &to, &dep);
1346 s = pool_tmpjoin(pool, probprefix, " info ", solver_problemruleinfo2str(solv, rinfo, from, to, dep));
1347 strqueue_push(&sq, s);
1348 scnt = solver_solution_count(solv, problem);
1349 for (solution = 1; solution <= scnt; solution++)
1351 s = testcase_solutionid(solv, problem, solution);
1352 solprefix = solv_dupjoin(probprefix, " solution ", s);
1354 while ((element = solver_next_solutionelement(solv, problem, solution, element, &p, &op)) != 0)
1356 if (p == SOLVER_SOLUTION_JOB)
1357 s = pool_tmpjoin(pool, solprefix, " deljob ", testcase_job2str(pool, solv->job.elements[op - 1], solv->job.elements[op]));
1358 else if (p > 0 && op == 0)
1359 s = pool_tmpjoin(pool, solprefix, " erase ", testcase_solvid2str(pool, p));
1360 else if (p > 0 && op > 0)
1362 s = pool_tmpjoin(pool, solprefix, " replace ", testcase_solvid2str(pool, p));
1363 s = pool_tmpappend(pool, s, " ", testcase_solvid2str(pool, op));
1365 else if (p < 0 && op > 0)
1366 s = pool_tmpjoin(pool, solprefix, " allow ", testcase_solvid2str(pool, op));
1368 s = pool_tmpjoin(pool, solprefix, " unknown", 0);
1369 strqueue_push(&sq, s);
1371 solv_free(solprefix);
1373 solv_free(probprefix);
1377 if ((resultflags & TESTCASE_RESULT_ORPHANED) != 0)
1382 solver_get_orphaned(solv, &q);
1383 for (i = 0; i < q.count; i++)
1385 s = pool_tmpjoin(pool, "orphaned ", testcase_solvid2str(pool, q.elements[i]), 0);
1386 strqueue_push(&sq, s);
1391 if ((resultflags & TESTCASE_RESULT_RECOMMENDED) != 0)
1397 solver_get_recommendations(solv, &qr, &qs, 0);
1398 for (i = 0; i < qr.count; i++)
1400 s = pool_tmpjoin(pool, "recommended ", testcase_solvid2str(pool, qr.elements[i]), 0);
1401 strqueue_push(&sq, s);
1403 for (i = 0; i < qs.count; i++)
1405 s = pool_tmpjoin(pool, "suggested ", testcase_solvid2str(pool, qs.elements[i]), 0);
1406 strqueue_push(&sq, s);
1412 if ((resultflags & TESTCASE_RESULT_UNNEEDED) != 0)
1417 solver_get_unneeded(solv, &q, 0);
1418 for (i = 0; i < q.count; i++)
1420 s = pool_tmpjoin(pool, "unneeded ", testcase_solvid2str(pool, q.elements[i]), 0);
1421 strqueue_push(&sq, s);
1427 result = strqueue_join(&sq);
1434 testcase_write(Solver *solv, char *dir, int resultflags, const char *testcasename, const char *resultname)
1436 Pool *pool = solv->pool;
1447 testcasename = "testcase.t";
1449 resultname = "solver.result";
1451 if (mkdir(dir, 0777) && errno != EEXIST)
1453 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: could not create directory '%s'\n", dir);
1457 FOR_REPOS(repoid, repo)
1459 const char *name = testcase_repoid2str(pool, repoid);
1461 if (repo->subpriority)
1462 sprintf(priobuf, "%d.%d", repo->priority, repo->subpriority);
1464 sprintf(priobuf, "%d", repo->priority);
1465 out = pool_tmpjoin(pool, name, ".repo", ".gz");
1466 cmd = pool_tmpjoin(pool, "repo ", name, " ");
1467 cmd = pool_tmpappend(pool, cmd, priobuf, " ");
1468 cmd = pool_tmpappend(pool, cmd, "testtags ", out);
1469 strqueue_push(&sq, cmd);
1470 out = pool_tmpjoin(pool, dir, "/", out);
1471 if (!(fp = solv_xfopen(out, "w")))
1473 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: could not open '%s' for writing\n", out);
1477 testcase_write_testtags(repo, fp);
1480 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: write error\n");
1485 /* hmm, this is not optimal... we currently search for the lowest score */
1487 arch = pool->solvables[SYSTEMSOLVABLE].arch;
1488 for (i = 0; i < pool->lastarch; i++)
1490 if (pool->id2arch[i] == 1 && !lowscore)
1492 if (pool->id2arch[i] > 0x10000 && (!lowscore || pool->id2arch[i] < lowscore))
1495 lowscore = pool->id2arch[i];
1498 cmd = pool_tmpjoin(pool, "system ", pool->lastarch ? pool_id2str(pool, arch) : "unset", 0);
1499 for (i = 0; disttype2str[i].str != 0; i++)
1500 if (pool->disttype == disttype2str[i].type)
1502 pool_tmpappend(pool, cmd, " ", disttype2str[i].str ? disttype2str[i].str : "unknown");
1503 if (pool->installed)
1504 cmd = pool_tmpappend(pool, cmd, " ", testcase_repoid2str(pool, pool->installed->repoid));
1505 strqueue_push(&sq, cmd);
1506 s = testcase_getpoolflags(solv->pool);
1509 cmd = pool_tmpjoin(pool, "poolflags ", s, 0);
1510 strqueue_push(&sq, cmd);
1513 if (pool->vendorclasses)
1516 for (i = 0; pool->vendorclasses[i]; i++)
1518 cmd = pool_tmpappend(pool, cmd ? cmd : "vendorclass", " ", pool->vendorclasses[i]);
1519 if (!pool->vendorclasses[i + 1])
1521 strqueue_push(&sq, cmd);
1528 s = testcase_getsolverflags(solv);
1531 cmd = pool_tmpjoin(pool, "solverflags ", s, 0);
1532 strqueue_push(&sq, cmd);
1535 /* now dump all the ns callback values we know */
1536 if (pool->nscallback)
1540 for (rid = 1; rid < pool->nrels; rid++)
1542 Reldep *rd = pool->rels + rid;
1543 if (rd->flags != REL_NAMESPACE || rd->name == NAMESPACE_OTHERPROVIDERS)
1545 /* evaluate all namespace ids, skip empty results */
1546 d = pool_whatprovides(pool, MAKERELDEP(rid));
1547 if (!d || !pool->whatprovidesdata[d])
1549 cmd = pool_tmpjoin(pool, "namespace ", pool_id2str(pool, rd->name), "(");
1550 cmd = pool_tmpappend(pool, cmd, pool_id2str(pool, rd->evr), ")");
1551 for (; pool->whatprovidesdata[d]; d++)
1552 cmd = pool_tmpappend(pool, cmd, " ", testcase_solvid2str(pool, pool->whatprovidesdata[d]));
1553 strqueue_push(&sq, cmd);
1557 for (i = 0; i < solv->job.count; i += 2)
1559 cmd = (char *)testcase_job2str(pool, solv->job.elements[i], solv->job.elements[i + 1]);
1560 cmd = pool_tmpjoin(pool, "job ", cmd, 0);
1561 strqueue_push(&sq, cmd);
1568 for (i = 0; resultflags2str[i].str; i++)
1569 if ((resultflags & resultflags2str[i].flag) != 0)
1570 cmd = pool_tmpappend(pool, cmd, cmd ? "," : 0, resultflags2str[i].str);
1571 cmd = pool_tmpjoin(pool, "result ", cmd ? cmd : "?", 0);
1572 cmd = pool_tmpappend(pool, cmd, " ", resultname);
1573 strqueue_push(&sq, cmd);
1574 result = testcase_solverresult(solv, resultflags);
1575 if (!strcmp(resultname, "<inline>"))
1579 strqueue_init(&rsq);
1580 strqueue_split(&rsq, result);
1581 for (i = 0; i < rsq.nstr; i++)
1583 cmd = pool_tmpjoin(pool, "#>", rsq.str[i], 0);
1584 strqueue_push(&sq, cmd);
1586 strqueue_free(&rsq);
1590 out = pool_tmpjoin(pool, dir, "/", resultname);
1591 if (!(fp = fopen(out, "w")))
1593 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: could not open '%s' for writing\n", out);
1598 if (result && *result && fwrite(result, strlen(result), 1, fp) != 1)
1600 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: write error\n");
1607 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: write error\n");
1615 cmd = strqueue_join(&sq);
1616 out = pool_tmpjoin(pool, dir, "/", testcasename);
1617 if (!(fp = fopen(out, "w")))
1619 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: could not open '%s' for writing\n", out);
1623 if (*cmd && fwrite(cmd, strlen(cmd), 1, fp) != 1)
1625 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: write error\n");
1631 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: write error\n");
1641 read_inline_file(FILE *fp, char **bufp, char **bufpp, int *buflp)
1643 char *result = solv_malloc(1024);
1650 if (rp - result + 256 >= resultl)
1652 resultl = rp - result;
1653 result = solv_realloc(result, resultl + 1024);
1654 rp = result + resultl;
1657 if (!fgets(rp, resultl - (rp - result), fp))
1660 if (rl && (rp == result || rp[-1] == '\n'))
1662 if (rl > 1 && rp[0] == '#' && rp[1] == '>')
1664 memmove(rp, rp + 2, rl - 2);
1669 while (rl + 16 > *buflp)
1671 *bufp = solv_realloc(*bufp, *buflp + 512);
1674 memmove(*bufp, rp, rl);
1675 if ((*bufp)[rl - 1] == '\n')
1681 (*bufpp) = *bufp + rl;
1698 char *result = solv_malloc(1024);
1705 if (rp - result + 256 >= resultl)
1707 resultl = rp - result;
1708 result = solv_realloc(result, resultl + 1024);
1709 rp = result + resultl;
1712 rl = fread(rp, 1, resultl - (rp - result), fp);
1724 testcase_read(Pool *pool, FILE *fp, char *testcase, Queue *job, char **resultp, int *resultflagsp)
1729 char *testcasedir, *s;
1735 int poolflagsreset = 0;
1737 if (!fp && !(fp = fopen(testcase, "r")))
1739 pool_debug(pool, SOLV_ERROR, "testcase_read: could not open '%s'\n", testcase);
1742 testcasedir = solv_strdup(testcase);
1743 if ((s = strrchr(testcasedir, '/')) != 0)
1748 buf = solv_malloc(bufl);
1753 if (bufp - buf + 16 > bufl)
1756 buf = solv_realloc(buf, bufl + 512);
1760 if (!fgets(bufp, bufl - (bufp - buf), fp))
1764 if (!l || buf[l - 1] != '\n')
1771 while (*s && (*s == ' ' || *s == '\t'))
1773 if (!*s || *s == '#')
1776 /* split it in pieces */
1779 while (*s == ' ' || *s == '\t')
1783 pieces = solv_extend(pieces, npieces, 1, sizeof(*pieces), 7);
1784 pieces[npieces++] = s;
1785 while (*s && *s != ' ' && *s != '\t')
1790 pieces = solv_extend(pieces, npieces, 1, sizeof(*pieces), 7);
1791 pieces[npieces] = 0;
1792 if (!strcmp(pieces[0], "repo") && npieces >= 4)
1794 Repo *repo = repo_create(pool, pieces[1]);
1800 if (!poolflagsreset)
1803 testcase_resetpoolflags(pool); /* hmm */
1805 if (sscanf(pieces[2], "%d.%d", &prio, &subprio) != 2)
1808 prio = atoi(pieces[2]);
1810 repo->priority = prio;
1811 repo->subpriority = subprio;
1812 if (strcmp(pieces[3], "empty") != 0)
1814 const char *repotype = pool_tmpjoin(pool, pieces[3], 0, 0); /* gets overwritten in <inline> case */
1815 if (!strcmp(pieces[4], "<inline>"))
1817 char *idata = read_inline_file(fp, &buf, &bufp, &bufl);
1819 rfp = solv_xfopen_buf(rdata, &idata, 0, "rf");
1823 rdata = pool_tmpjoin(pool, testcasedir, pieces[4], 0);
1824 rfp = solv_xfopen(rdata, "r");
1828 pool_debug(pool, SOLV_ERROR, "testcase_read: could not open '%s'\n", rdata);
1830 else if (!strcmp(repotype, "testtags"))
1832 testcase_add_testtags(repo, rfp, 0);
1835 else if (!strcmp(repotype, "solv"))
1837 repo_add_solv(repo, rfp, 0);
1843 pool_debug(pool, SOLV_ERROR, "testcase_read: unknown repo type for repo '%s'\n", repo->name);
1847 else if (!strcmp(pieces[0], "system") && npieces >= 3)
1851 if (strcmp(pieces[1], "unset") != 0)
1852 pool_setarch(pool, pieces[1]);
1854 pool_setarch(pool, 0);
1855 for (i = 0; disttype2str[i].str != 0; i++)
1856 if (!strcmp(disttype2str[i].str, pieces[2]))
1858 if (!disttype2str[i].str)
1859 pool_debug(pool, SOLV_ERROR, "testcase_read: system: unknown disttype '%s'\n", pieces[2]);
1860 else if (pool->disttype != disttype2str[i].type)
1862 #ifdef MULTI_SEMANTICS
1863 pool_setdisttype(pool, disttype2str[i].type);
1865 pool_debug(pool, SOLV_ERROR, "testcase_read: system: cannot change disttype to '%s'\n", pieces[2]);
1870 Repo *repo = testcase_str2repo(pool, pieces[3]);
1872 pool_debug(pool, SOLV_ERROR, "testcase_read: system: unknown repo '%s'\n", pieces[3]);
1874 pool_set_installed(pool, repo);
1877 else if (!strcmp(pieces[0], "job") && npieces > 1)
1883 pool_addfileprovides(pool);
1884 pool_createwhatprovides(pool);
1888 for (sp = pieces[1]; sp < pieces[npieces - 1]; sp++)
1891 how = testcase_str2job(pool, pieces[1], &what);
1892 if (how >= 0 && job)
1893 queue_push2(job, how, what);
1895 else if (!strcmp(pieces[0], "vendorclass") && npieces > 1)
1897 pool_addvendorclass(pool, (const char **)(pieces + 1));
1899 else if (!strcmp(pieces[0], "namespace") && npieces > 1)
1901 int i = strlen(pieces[1]);
1902 s = strchr(pieces[1], '(');
1903 if (!s && pieces[1][i - 1] != ')')
1905 pool_debug(pool, SOLV_ERROR, "testcase_read: bad namespace '%s'\n", pieces[1]);
1913 pieces[1][i - 1] = 0;
1914 name = pool_str2id(pool, pieces[1], 1);
1915 evr = pool_str2id(pool, s + 1, 1);
1917 pieces[1][i - 1] = ')';
1918 id = pool_rel2id(pool, name, evr, REL_NAMESPACE, 1);
1919 for (i = 2; i < npieces; i++)
1920 queue_push(&q, testcase_str2solvid(pool, pieces[i]));
1921 /* now do the callback */
1924 pool_addfileprovides(pool);
1925 pool_createwhatprovides(pool);
1928 pool->whatprovides_rel[GETRELID(id)] = pool_queuetowhatprovides(pool, &q);
1932 else if (!strcmp(pieces[0], "poolflags"))
1935 if (!poolflagsreset)
1938 testcase_resetpoolflags(pool); /* hmm */
1940 for (i = 1; i < npieces; i++)
1941 testcase_setpoolflags(pool, pieces[i]);
1943 else if (!strcmp(pieces[0], "solverflags") && npieces > 1)
1948 solv = solver_create(pool);
1949 testcase_resetsolverflags(solv);
1951 for (i = 1; i < npieces; i++)
1952 testcase_setsolverflags(solv, pieces[i]);
1954 else if (!strcmp(pieces[0], "result") && npieces > 2)
1958 int resultflags = 0;
1959 char *s = pieces[1];
1963 char *se = strchr(s, ',');
1966 for (i = 0; resultflags2str[i].str; i++)
1967 if (!strcmp(s, resultflags2str[i].str))
1969 resultflags |= resultflags2str[i].flag;
1972 if (!resultflags2str[i].str)
1973 pool_debug(pool, SOLV_ERROR, "result: unknown flag '%s'\n", s);
1977 rdata = pool_tmpjoin(pool, testcasedir, pieces[2], 0);
1978 if (!strcmp(pieces[2], "<inline>"))
1979 result = read_inline_file(fp, &buf, &bufp, &bufl);
1982 FILE *rfp = fopen(rdata, "r");
1984 pool_debug(pool, SOLV_ERROR, "testcase_read: could not open '%s'\n", rdata);
1987 result = read_file(rfp);
1996 *resultflagsp = resultflags;
1998 else if (!strcmp(pieces[0], "nextjob") && npieces == 1)
2004 pool_debug(pool, SOLV_ERROR, "testcase_read: cannot parse command '%s'\n", pieces[0]);
2007 buf = solv_free(buf);
2008 pieces = solv_free(pieces);
2009 solv_free(testcasedir);
2012 pool_addfileprovides(pool);
2013 pool_createwhatprovides(pool);
2017 solv = solver_create(pool);
2018 testcase_resetsolverflags(solv);
2026 testcase_resultdiff(char *result1, char *result2)
2028 Strqueue sq1, sq2, osq;
2030 strqueue_init(&sq1);
2031 strqueue_init(&sq2);
2032 strqueue_init(&osq);
2033 strqueue_split(&sq1, result1);
2034 strqueue_split(&sq2, result2);
2035 strqueue_sort(&sq1);
2036 strqueue_sort(&sq2);
2037 strqueue_diff(&sq1, &sq2, &osq);
2038 r = osq.nstr ? strqueue_join(&osq) : 0;
2039 strqueue_free(&sq1);
2040 strqueue_free(&sq2);
2041 strqueue_free(&osq);