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_susetags.h"
22 #include "repo_solv.h"
24 #include "solverdebug.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_NOOBSOLETES, "noobsoletes" },
42 { SOLVER_LOCK, "lock" },
43 { SOLVER_DISTUPGRADE, "distupgrade" },
44 { SOLVER_VERIFY, "verify" },
45 { SOLVER_DROP_ORPHANED, "droporphaned" },
46 { SOLVER_USERINSTALLED, "userinstalled" },
50 static struct jobflags2str {
54 { SOLVER_WEAK, "weak" },
55 { SOLVER_ESSENTIAL, "essential" },
56 { SOLVER_CLEANDEPS, "cleandeps" },
57 { SOLVER_SETEV, "setev" },
58 { SOLVER_SETEVR, "setevr" },
59 { SOLVER_SETARCH, "setarch" },
60 { SOLVER_SETVENDOR, "setvendor" },
61 { SOLVER_SETREPO, "setrepo" },
62 { SOLVER_NOAUTOSET, "noautoset" },
66 static struct resultflags2str {
69 } resultflags2str[] = {
70 { TESTCASE_RESULT_TRANSACTION, "transaction" },
71 { TESTCASE_RESULT_PROBLEMS, "problems" },
72 { TESTCASE_RESULT_ORPHANED, "orphaned" },
73 { TESTCASE_RESULT_RECOMMENDED, "recommended" },
74 { TESTCASE_RESULT_UNNEEDED, "unneeded" },
78 static struct solverflags2str {
82 } solverflags2str[] = {
83 { SOLVER_FLAG_ALLOW_DOWNGRADE, "allowdowngrade", 0 },
84 { SOLVER_FLAG_ALLOW_NAMECHANGE, "allownamechange", 1 },
85 { SOLVER_FLAG_ALLOW_ARCHCHANGE, "allowarchchange", 0 },
86 { SOLVER_FLAG_ALLOW_VENDORCHANGE, "allowvendorchange", 0 },
87 { SOLVER_FLAG_ALLOW_UNINSTALL, "allowuninstall", 0 },
88 { SOLVER_FLAG_NO_UPDATEPROVIDE, "noupdateprovide", 0 },
89 { SOLVER_FLAG_SPLITPROVIDES, "splitprovides", 0 },
90 { SOLVER_FLAG_IGNORE_RECOMMENDED, "ignorerecommended", 0 },
91 { SOLVER_FLAG_ADD_ALREADY_RECOMMENDED, "addalreadyrecommended", 0 },
92 { SOLVER_FLAG_NO_INFARCHCHECK, "noinfarchcheck", 0 },
93 { SOLVER_FLAG_KEEP_EXPLICIT_OBSOLETES, "keepexplicitobsoletes", 0 },
97 static struct poolflags2str {
101 } poolflags2str[] = {
102 { POOL_FLAG_PROMOTEEPOCH, "promoteepoch", 0 },
103 { POOL_FLAG_FORBIDSELFCONFLICTS, "forbidselfconflicts", 0 },
104 { POOL_FLAG_OBSOLETEUSESPROVIDES, "obsoleteusesprovides", 0 },
105 { POOL_FLAG_IMPLICITOBSOLETEUSESPROVIDES, "implicitobsoleteusesprovides", 0 },
106 { POOL_FLAG_OBSOLETEUSESCOLORS, "obsoleteusescolors", 0 },
107 { POOL_FLAG_NOINSTALLEDOBSOLETES, "noinstalledobsoletes", 0 },
108 { POOL_FLAG_HAVEDISTEPOCH, "havedistepoch", 0 },
113 typedef struct strqueue {
118 #define STRQUEUE_BLOCK 63
121 strqueue_init(Strqueue *q)
128 strqueue_free(Strqueue *q)
131 for (i = 0; i < q->nstr; i++)
132 solv_free(q->str[i]);
133 q->str = solv_free(q->str);
138 strqueue_push(Strqueue *q, const char *s)
140 q->str = solv_extend(q->str, q->nstr, 1, sizeof(*q->str), STRQUEUE_BLOCK);
141 q->str[q->nstr++] = solv_strdup(s);
145 strqueue_pushjoin(Strqueue *q, const char *s1, const char *s2, const char *s3)
147 q->str = solv_extend(q->str, q->nstr, 1, sizeof(*q->str), STRQUEUE_BLOCK);
148 q->str[q->nstr++] = solv_dupjoin(s1, s2, s3);
152 strqueue_sort_cmp(const void *ap, const void *bp, void *dp)
154 const char *a = *(const char **)ap;
155 const char *b = *(const char **)bp;
156 return strcmp(a ? a : "", b ? b : "");
160 strqueue_sort(Strqueue *q)
163 solv_sort(q->str, q->nstr, sizeof(*q->str), strqueue_sort_cmp, 0);
167 strqueue_sort_u(Strqueue *q)
171 for (i = j = 0; i < q->nstr; i++)
172 if (!j || strqueue_sort_cmp(q->str + i, q->str + j - 1, 0) != 0)
173 q->str[j++] = q->str[i];
178 strqueue_join(Strqueue *q)
182 for (i = 0; i < q->nstr; i++)
184 l += strlen(q->str[i]) + 1;
185 l++; /* trailing \0 */
188 for (i = 0; i < q->nstr; i++)
191 strcpy(rp, q->str[i]);
200 strqueue_split(Strqueue *q, const char *s)
205 while ((p = strchr(s, '\n')) != 0)
207 q->str = solv_extend(q->str, q->nstr, 1, sizeof(*q->str), STRQUEUE_BLOCK);
208 q->str[q->nstr] = solv_malloc(p - s + 1);
210 memcpy(q->str[q->nstr], s, p - s);
211 q->str[q->nstr][p - s] = 0;
220 strqueue_diff(Strqueue *sq1, Strqueue *sq2, Strqueue *osq)
223 while (i < sq1->nstr && j < sq2->nstr)
225 int r = strqueue_sort_cmp(sq1->str + i, sq2->str + j, 0);
229 strqueue_pushjoin(osq, "-", sq1->str[i++], 0);
231 strqueue_pushjoin(osq, "+", sq2->str[j++], 0);
233 while (i < sq1->nstr)
234 strqueue_pushjoin(osq, "-", sq1->str[i++], 0);
235 while (j < sq2->nstr)
236 strqueue_pushjoin(osq, "+", sq2->str[j++], 0);
240 pool_isknownarch(Pool *pool, Id id)
242 if (!id || id == ID_EMPTY)
244 if (id == ARCH_SRC || id == ARCH_NOSRC || id == ARCH_NOARCH)
246 if (!pool->id2arch || (id > pool->lastarch || !pool->id2arch[id]))
252 testcase_str2dep(Pool *pool, char *s)
258 if ((n = strchr(s, '|')) != 0)
260 id = testcase_str2dep(pool, n + 1);
262 id = pool_rel2id(pool, testcase_str2dep(pool, s), id, REL_OR, 1);
266 while (*s == ' ' || *s == '\t')
269 while (*s && *s != ' ' && *s != '\t' && *s != '<' && *s != '=' && *s != '>')
273 while (*s && *s != ')')
279 if ((a = strchr(n, '.')) != 0 && a + 1 < s && s[-1] != ')')
281 Id archid = pool_strn2id(pool, a + 1, s - (a + 1), 0);
282 if (pool_isknownarch(pool, archid))
284 id = pool_strn2id(pool, n, a - n, 1);
285 id = pool_rel2id(pool, id, archid, REL_ARCH, 1);
288 id = pool_strn2id(pool, n, s - n, 1);
291 id = pool_strn2id(pool, n, s - n, 1);
294 while (*s == ' ' || *s == '\t')
310 while (*s == ' ' || *s == '\t')
313 while (*s && *s != ' ' && *s != '\t')
315 return pool_rel2id(pool, id, pool_strn2id(pool, n, s - n, 1), flags, 1);
319 testcase_repoid2str(Pool *pool, Id repoid)
321 Repo *repo = pool_id2repo(pool, repoid);
324 char *r = pool_tmpjoin(pool, repo->name, 0, 0);
326 for (rp = r; *rp; rp++)
327 if (*rp == ' ' || *rp == '\t')
334 sprintf(buf, "#%d", repoid);
335 return pool_tmpjoin(pool, buf, 0, 0);
340 testcase_solvid2str(Pool *pool, Id p)
342 Solvable *s = pool->solvables + p;
343 const char *n, *e, *a;
346 if (p == SYSTEMSOLVABLE)
348 n = pool_id2str(pool, s->name);
349 e = pool_id2str(pool, s->evr);
350 a = pool_id2str(pool, s->arch);
351 str = pool_alloctmpspace(pool, strlen(n) + strlen(e) + strlen(a) + 3);
352 sprintf(str, "%s-%s.%s", n, e, a);
354 return pool_tmpappend(pool, str, "@", 0);
358 char *str2 = pool_tmpappend(pool, str, "@", s->repo->name);
360 if (str2[l] == ' ' || str2[l] == '\t')
364 sprintf(buf, "@#%d", s->repo->repoid);
365 return pool_tmpappend(pool, str, buf, 0);
369 testcase_str2repo(Pool *pool, const char *str)
373 if (str[0] == '#' && (str[1] >= '0' && str[1] <= '9'))
377 for (j = 1; str[j] >= '0' && str[j] <= '9'; j++)
378 repoid = repoid * 10 + (str[j] - '0');
379 if (!str[j] && repoid > 0 && repoid < pool->nrepos)
380 repo = pool_id2repo(pool, repoid);
384 FOR_REPOS(repoid, repo)
389 l = strlen(repo->name);
390 for (i = 0; i < l; i++)
392 int c = repo->name[i];
393 if (c == ' ' || c == '\t')
398 if (i == l && !str[l])
401 if (repoid >= pool->nrepos)
408 testcase_str2solvid(Pool *pool, const char *str)
410 int i, l = strlen(str);
417 if (*str == '@' && !strcmp(str, "@SYSTEM"))
418 return SYSTEMSOLVABLE;
420 for (i = l - 1; i >= 0; i--)
421 if (str[i] == '@' && (repo = testcase_str2repo(pool, str + i + 1)) != 0)
426 /* now find the arch (if present) */
428 for (i = repostart - 1; i > 0; i--)
431 arch = pool_strn2id(pool, str + i + 1, repostart - (i + 1), 0);
436 /* now find the name */
437 for (i = repostart - 1; i > 0; i--)
441 Id nid, evrid, p, pp;
442 nid = pool_strn2id(pool, str, i, 0);
445 evrid = pool_strn2id(pool, str + i + 1, repostart - (i + 1), 0);
448 FOR_PROVIDES(p, pp, nid)
450 Solvable *s = pool->solvables + p;
451 if (s->name != nid || s->evr != evrid)
453 if (repo && s->repo != repo)
455 if (arch && s->arch != arch)
465 testcase_job2str(Pool *pool, Id how, Id what)
472 Id select = how & SOLVER_SELECTMASK;
474 for (i = 0; job2str[i].str; i++)
475 if ((how & SOLVER_JOBMASK) == job2str[i].job)
477 jobstr = job2str[i].str ? job2str[i].str : "unknown";
478 if (select == SOLVER_SOLVABLE)
481 pkgstr = testcase_solvid2str(pool, what);
483 else if (select == SOLVER_SOLVABLE_NAME)
486 pkgstr = pool_dep2str(pool, what);
488 else if (select == SOLVER_SOLVABLE_PROVIDES)
490 selstr = " provides ";
491 pkgstr = pool_dep2str(pool, what);
493 else if (select == SOLVER_SOLVABLE_ONE_OF)
498 while ((p = pool->whatprovidesdata[what++]) != 0)
500 const char *s = testcase_solvid2str(pool, p);
503 pkgstr = pool_tmpappend(pool, pkgstr, " ", s);
504 pool_freetmpspace(pool, s);
512 else if (select == SOLVER_SOLVABLE_REPO)
514 Repo *repo = pool_id2repo(pool, what);
519 sprintf(buf, "#%d", repo->repoid);
520 pkgstr = pool_tmpjoin(pool, buf, 0, 0);
523 pkgstr = pool_tmpjoin(pool, repo->name, 0, 0);
525 else if (select == SOLVER_SOLVABLE_ALL)
532 selstr = " unknown ";
535 ret = pool_tmpjoin(pool, jobstr, selstr, pkgstr);
537 ret = pool_tmpappend(pool, ret, " ", 0);
538 for (i = 0; jobflags2str[i].str; i++)
539 if ((how & jobflags2str[i].flag) != 0)
540 ret = pool_tmpappend(pool, ret, ",", jobflags2str[i].str);
546 ret = pool_tmpappend(pool, ret, "]", 0);
552 testcase_str2job(Pool *pool, const char *str, Id *whatp)
562 /* so we can patch it */
563 s = pool_tmpjoin(pool, str, 0, 0);
564 /* split it in pieces */
567 while (*s == ' ' || *s == '\t')
571 pieces = solv_extend(pieces, npieces, 1, sizeof(*pieces), 7);
572 pieces[npieces++] = s;
573 while (*s && *s != ' ' && *s != '\t')
580 pool_debug(pool, SOLV_ERROR, "str2job: bad line '%s'\n", str);
585 for (i = 0; job2str[i].str; i++)
586 if (!strcmp(pieces[0], job2str[i].str))
590 pool_debug(pool, SOLV_ERROR, "str2job: unknown job '%s'\n", str);
594 job = job2str[i].job;
597 char *flags = pieces[npieces - 1];
599 if (*flags == '[' && flags[strlen(flags) - 1] == ']')
603 flags[strlen(flags) - 1] = ',';
606 for (nf = flags; *nf != ','; nf++)
609 for (i = 0; jobflags2str[i].str; i++)
610 if (!strcmp(flags, jobflags2str[i].str))
612 if (!jobflags2str[i].str)
614 pool_debug(pool, SOLV_ERROR, "str2job: unknown jobflags in '%s'\n", str);
618 job |= jobflags2str[i].flag;
623 if (!strcmp(pieces[1], "pkg"))
627 pool_debug(pool, SOLV_ERROR, "str2job: bad pkg selector in '%s'\n", str);
631 job |= SOLVER_SOLVABLE;
632 what = testcase_str2solvid(pool, pieces[2]);
635 pool_debug(pool, SOLV_ERROR, "str2job: unknown package '%s'\n", pieces[2]);
640 else if (!strcmp(pieces[1], "name") || !strcmp(pieces[1], "provides"))
642 /* join em again for dep2str... */
644 for (sp = pieces[2]; sp < pieces[npieces - 1]; sp++)
647 what = testcase_str2dep(pool, pieces[2]);
648 if (pieces[1][0] == 'n')
649 job |= SOLVER_SOLVABLE_NAME;
651 job |= SOLVER_SOLVABLE_PROVIDES;
653 else if (!strcmp(pieces[1], "oneof"))
656 job |= SOLVER_SOLVABLE_ONE_OF;
658 if (npieces > 3 && strcmp(pieces[2], "nothing") != 0)
660 for (i = 2; i < npieces; i++)
662 Id p = testcase_str2solvid(pool, pieces[i]);
665 pool_debug(pool, SOLV_ERROR, "str2job: unknown package '%s'\n", pieces[i]);
673 what = pool_queuetowhatprovides(pool, &q);
676 else if (!strcmp(pieces[1], "repo"))
681 pool_debug(pool, SOLV_ERROR, "str2job: bad line '%s'\n", str);
685 repo = testcase_str2repo(pool, pieces[2]);
688 pool_debug(pool, SOLV_ERROR, "str2job: unknown repo '%s'\n", pieces[2]);
692 job |= SOLVER_SOLVABLE_REPO;
695 else if (!strcmp(pieces[1], "all"))
697 if (npieces != 3 && strcmp(pieces[2], "packages") != 0)
699 pool_debug(pool, SOLV_ERROR, "str2job: bad line '%s'\n", str);
703 job |= SOLVER_SOLVABLE_ALL;
708 pool_debug(pool, SOLV_ERROR, "str2job: unknown selection in '%s'\n", str);
718 writedeps(Repo *repo, FILE *fp, const char *tag, Id key, Solvable *s, Offset off)
720 Pool *pool = repo->pool;
727 dp = repo->idarraydata + off;
729 while ((id = *dp++) != 0)
731 if (key == SOLVABLE_REQUIRES && id == SOLVABLE_PREREQMARKER)
734 fprintf(fp, "-%s\n", tag);
739 if (key == SOLVABLE_PROVIDES && id == SOLVABLE_FILEMARKER)
744 idstr = pool_dep2str(pool, id);
747 Reldep *rd = GETRELDEP(pool, id);
748 if (key == SOLVABLE_CONFLICTS && rd->flags == REL_NAMESPACE && rd->name == NAMESPACE_OTHERPROVIDERS)
750 if (!strncmp(idstr, "namespace:", 10))
753 if (key == SOLVABLE_SUPPLEMENTS)
755 if (rd->flags == REL_NAMESPACE && rd->name == NAMESPACE_FILESYSTEM)
757 if (!strncmp(idstr, "namespace:", 10))
760 else if (rd->flags == REL_NAMESPACE && rd->name == NAMESPACE_MODALIAS)
762 if (!strncmp(idstr, "namespace:", 10))
765 else if (rd->flags == REL_AND)
767 /* either packageand chain or modalias */
769 if (ISRELDEP(rd->evr))
771 Reldep *mrd = GETRELDEP(pool, rd->evr);
772 if (mrd->flags == REL_NAMESPACE && mrd->name == NAMESPACE_MODALIAS)
774 idstr = pool_tmpjoin(pool, "modalias(", pool_dep2str(pool, rd->name), ":");
775 idstr = pool_tmpappend(pool, idstr, pool_dep2str(pool, mrd->evr), ")");
777 else if (mrd->flags >= 8)
782 /* must be and chain */
783 idstr = pool_dep2str(pool, rd->evr);
789 rd = GETRELDEP(pool, id);
790 if (rd->flags != REL_AND)
792 idstr = pool_tmpjoin(pool, pool_dep2str(pool, rd->evr), ":", idstr);
794 idstr = pool_tmpjoin(pool, pool_dep2str(pool, id), ":", idstr);
795 idstr = pool_tmpjoin(pool, "packageand(", idstr, ")");
798 else if (rd->flags >= 8)
804 fprintf(fp, "+%s\n", tag);
807 fprintf(fp, "%s\n", idstr);
809 if (key == SOLVABLE_PROVIDES)
811 /* add the filelist */
813 dataiterator_init(&di, pool, repo, s - pool->solvables, SOLVABLE_FILELIST, 0, 0);
814 while (dataiterator_step(&di))
816 const char *s = repodata_dir2str(di.data, di.kv.id, di.kv.str);
819 Id id = pool_str2id(pool, s, 0);
822 for (dp = prvdp; *dp; dp++)
826 continue; /* already included */
831 fprintf(fp, "+%s", tag);
834 fprintf(fp, "%s\n", s);
838 fprintf(fp, "-%s\n", tag);
842 testcase_write_susetags(Repo *repo, FILE *fp)
844 Pool *pool = repo->pool;
854 fprintf(fp, "=Ver: 2.0\n");
855 FOR_REPO_SOLVABLES(repo, p, s)
857 name = pool_id2str(pool, s->name);
858 evr = pool_id2str(pool, s->evr);
859 arch = pool_id2str(pool, s->arch);
860 release = strrchr(evr, '-');
862 release = evr + strlen(evr);
863 fprintf(fp, "=Pkg: %s %.*s %s %s\n", name, (int)(release - evr), evr, *release && release[1] ? release + 1 : "-", arch);
864 tmp = solvable_lookup_str(s, SOLVABLE_SUMMARY);
866 fprintf(fp, "=Sum: %s\n", tmp);
867 writedeps(repo, fp, "Req:", SOLVABLE_REQUIRES, s, s->requires);
868 writedeps(repo, fp, "Prv:", SOLVABLE_PROVIDES, s, s->provides);
869 writedeps(repo, fp, "Obs:", SOLVABLE_OBSOLETES, s, s->obsoletes);
870 writedeps(repo, fp, "Con:", SOLVABLE_CONFLICTS, s, s->conflicts);
871 writedeps(repo, fp, "Rec:", SOLVABLE_RECOMMENDS, s, s->recommends);
872 writedeps(repo, fp, "Sup:", SOLVABLE_SUPPLEMENTS, s, s->supplements);
873 writedeps(repo, fp, "Sug:", SOLVABLE_SUGGESTS, s, s->suggests);
874 writedeps(repo, fp, "Enh:", SOLVABLE_ENHANCES, s, s->enhances);
876 fprintf(fp, "=Vnd: %s\n", pool_id2str(pool, s->vendor));
877 ti = solvable_lookup_num(s, SOLVABLE_BUILDTIME, 0);
879 fprintf(fp, "=Tim: %u\n", ti);
885 adddep(Repo *repo, Offset olddeps, char *str, Id marker)
887 Id id = *str == '/' ? pool_str2id(repo->pool, str, 1) : testcase_str2dep(repo->pool, str);
888 return repo_addid_dep(repo, olddeps, id, marker);
892 finish_solvable(Pool *pool, Repodata *data, Solvable *s, char *filelist, int nfilelist)
898 for (l = 0; l < nfilelist; l += strlen(filelist + l) + 1)
900 char *p = strrchr(filelist + l, '/');
904 did = repodata_str2dir(data, filelist + l, 1);
907 did = repodata_str2dir(data, "/", 1);
908 repodata_add_dirstr(data, s - pool->solvables, SOLVABLE_FILELIST, did, p);
911 if (s->name && s->arch != ARCH_SRC && s->arch != ARCH_NOSRC)
912 s->provides = repo_addid_dep(s->repo, s->provides, pool_rel2id(pool, s->name, s->evr, REL_EQ, 1), 0);
913 s->supplements = repo_fix_supplements(s->repo, s->provides, s->supplements, 0);
914 s->conflicts = repo_fix_conflicts(s->repo, s->conflicts);
917 /* stripped down version of susetags parser used for testcases */
919 testcase_add_susetags(Repo *repo, FILE *fp, int flags)
921 Pool *pool = repo->pool;
934 data = repo_add_repodata(repo, flags);
939 line = solv_malloc(aline);
943 if (linep - line + 16 > aline)
945 aline = linep - line;
946 line = solv_realloc(line, aline + 512);
947 linep = line + aline;
950 if (!fgets(linep, aline - (linep - line), fp))
952 linep += strlen(linep);
953 if (linep == line || linep[-1] != '\n')
956 linep = line + intag;
959 if (line[intag] == '-' && !strncmp(line + 1, line + intag + 1, intag - 2))
966 else if (line[0] == '+' && line[1] && line[1] != ':')
968 char *tagend = strchr(line, ':');
973 intag = tagend + 2 - line;
974 linep = line + intag;
977 if (*line != '=' || !line[1] || !line[2] || !line[3] || line[4] != ':')
979 tag = line[1] << 16 | line[2] << 8 | line[3];
982 case 'P' << 16 | 'k' << 8 | 'g':
984 finish_solvable(pool, data, s, filelist, nfilelist);
986 if (split(line + 5, sp, 5) != 4)
988 s = pool_id2solvable(pool, repo_add_solvable(repo));
989 s->name = pool_str2id(pool, sp[0], 1);
990 /* join back version and release */
991 if (sp[2] && !(sp[2][0] == '-' && !sp[2][1]))
993 s->evr = makeevr(pool, sp[1]);
994 s->arch = pool_str2id(pool, sp[3], 1);
996 case 'S' << 16 | 'u' << 8 | 'm':
997 repodata_set_str(data, s - pool->solvables, SOLVABLE_SUMMARY, line + 6);
999 case 'V' << 16 | 'n' << 8 | 'd':
1000 s->vendor = pool_str2id(pool, line + 6, 1);
1002 case 'T' << 16 | 'i' << 8 | 'm':
1005 repodata_set_num(data, s - pool->solvables, SOLVABLE_BUILDTIME, t);
1007 case 'R' << 16 | 'e' << 8 | 'q':
1008 s->requires = adddep(repo, s->requires, line + 6, -SOLVABLE_PREREQMARKER);
1010 case 'P' << 16 | 'r' << 8 | 'q':
1011 s->requires = adddep(repo, s->requires, line + 6, SOLVABLE_PREREQMARKER);
1013 case 'P' << 16 | 'r' << 8 | 'v':
1016 int l = strlen(line + 6) + 1;
1017 if (nfilelist + l > afilelist)
1019 afilelist = nfilelist + l + 512;
1020 filelist = solv_realloc(filelist, afilelist);
1022 memcpy(filelist + nfilelist, line + 6, l);
1029 for (l = 0; l < nfilelist; l += strlen(filelist + l) + 1)
1030 s->provides = repo_addid_dep(repo, s->provides, pool_str2id(pool, filelist + l, 1), 0);
1033 s->provides = adddep(repo, s->provides, line + 6, 0);
1035 case 'O' << 16 | 'b' << 8 | 's':
1036 s->obsoletes = adddep(repo, s->obsoletes, line + 6, 0);
1038 case 'C' << 16 | 'o' << 8 | 'n':
1039 s->conflicts = adddep(repo, s->conflicts, line + 6, 0);
1041 case 'R' << 16 | 'e' << 8 | 'c':
1042 s->recommends = adddep(repo, s->recommends, line + 6, 0);
1044 case 'S' << 16 | 'u' << 8 | 'p':
1045 s->supplements = adddep(repo, s->supplements, line + 6, 0);
1047 case 'S' << 16 | 'u' << 8 | 'g':
1048 s->suggests = adddep(repo, s->suggests, line + 6, 0);
1050 case 'E' << 16 | 'n' << 8 | 'h':
1051 s->enhances = adddep(repo, s->enhances, line + 6, 0);
1058 finish_solvable(pool, data, s, filelist, nfilelist);
1060 solv_free(filelist);
1061 repodata_free_dircache(data);
1062 if (!(flags & REPO_NO_INTERNALIZE))
1063 repodata_internalize(data);
1068 testcase_getpoolflags(Pool *pool)
1070 const char *str = 0;
1072 for (i = 0; poolflags2str[i].str; i++)
1074 v = pool_get_flag(pool, poolflags2str[i].flag);
1075 if (v == poolflags2str[i].def)
1077 str = pool_tmpappend(pool, str, v ? " " : " !", poolflags2str[i].str);
1079 return str ? str + 1 : "";
1083 testcase_setpoolflags(Pool *pool, const char *str)
1085 const char *p = str, *s;
1089 while (*p == ' ' || *p == '\t' || *p == ',')
1100 while (*p && *p != ' ' && *p != '\t' && *p != ',')
1102 for (i = 0; poolflags2str[i].str; i++)
1103 if (!strncmp(poolflags2str[i].str, s, p - s) && poolflags2str[i].str[p - s] == 0)
1105 if (!poolflags2str[i].str)
1107 pool_debug(pool, SOLV_ERROR, "setpoolflags: unknown flag '%.*s'\n", (int)(p - s), s);
1110 pool_set_flag(pool, poolflags2str[i].flag, v);
1116 testcase_resetpoolflags(Pool *pool)
1119 for (i = 0; poolflags2str[i].str; i++)
1120 pool_set_flag(pool, poolflags2str[i].flag, poolflags2str[i].def);
1124 testcase_getsolverflags(Solver *solv)
1126 Pool *pool = solv->pool;
1127 const char *str = 0;
1129 for (i = 0; solverflags2str[i].str; i++)
1131 v = solver_get_flag(solv, solverflags2str[i].flag);
1132 if (v == solverflags2str[i].def)
1134 str = pool_tmpappend(pool, str, v ? " " : " !", solverflags2str[i].str);
1136 return str ? str + 1 : "";
1140 testcase_setsolverflags(Solver *solv, const char *str)
1142 const char *p = str, *s;
1146 while (*p == ' ' || *p == '\t' || *p == ',')
1157 while (*p && *p != ' ' && *p != '\t' && *p != ',')
1159 for (i = 0; solverflags2str[i].str; i++)
1160 if (!strncmp(solverflags2str[i].str, s, p - s) && solverflags2str[i].str[p - s] == 0)
1162 if (!solverflags2str[i].str)
1164 pool_debug(solv->pool, SOLV_ERROR, "setsolverflags: unknown flag '%.*s'\n", (int)(p - s), s);
1167 solver_set_flag(solv, solverflags2str[i].flag, v);
1173 testcase_resetsolverflags(Solver *solv)
1176 for (i = 0; solverflags2str[i].str; i++)
1177 solver_set_flag(solv, solverflags2str[i].flag, solverflags2str[i].def);
1181 testcase_ruleid(Solver *solv, Id rid)
1187 const unsigned char *md5;
1193 solver_ruleliterals(solv, rid, &q);
1194 for (i = 0; i < q.count; i++)
1196 Id p = q.elements[i];
1197 s = testcase_solvid2str(solv->pool, p > 0 ? p : -p);
1199 s = pool_tmpjoin(solv->pool, "!", s, 0);
1200 strqueue_push(&sq, s);
1203 strqueue_sort_u(&sq);
1204 chk = solv_chksum_create(REPOKEY_TYPE_MD5);
1205 for (i = 0; i < sq.nstr; i++)
1206 solv_chksum_add(chk, sq.str[i], strlen(sq.str[i]) + 1);
1207 md5 = solv_chksum_get(chk, &md5l);
1208 s = pool_bin2hex(solv->pool, md5, md5l);
1209 chk = solv_chksum_free(chk, 0);
1215 testcase_problemid(Solver *solv, Id problem)
1220 const unsigned char *md5;
1224 /* we build a hash of all rules that define the problem */
1227 solver_findallproblemrules(solv, problem, &q);
1228 for (i = 0; i < q.count; i++)
1229 strqueue_push(&sq, testcase_ruleid(solv, q.elements[i]));
1231 strqueue_sort_u(&sq);
1232 chk = solv_chksum_create(REPOKEY_TYPE_MD5);
1233 for (i = 0; i < sq.nstr; i++)
1234 solv_chksum_add(chk, sq.str[i], strlen(sq.str[i]) + 1);
1235 md5 = solv_chksum_get(chk, &md5l);
1236 s = pool_bin2hex(solv->pool, md5, 4);
1237 chk = solv_chksum_free(chk, 0);
1243 testcase_solutionid(Solver *solv, Id problem, Id solution)
1247 const unsigned char *md5;
1251 intid = solver_solutionelement_internalid(solv, problem, solution);
1252 /* internal stuff! handle with care! */
1256 s = testcase_job2str(solv->pool, solv->job.elements[-intid - 1], solv->job.elements[-intid]);
1261 s = testcase_ruleid(solv, intid);
1263 chk = solv_chksum_create(REPOKEY_TYPE_MD5);
1264 solv_chksum_add(chk, s, strlen(s) + 1);
1265 md5 = solv_chksum_get(chk, &md5l);
1266 s = pool_bin2hex(solv->pool, md5, 4);
1267 chk = solv_chksum_free(chk, 0);
1271 static struct class2str {
1275 { SOLVER_TRANSACTION_ERASE, "erase" },
1276 { SOLVER_TRANSACTION_INSTALL, "install" },
1277 { SOLVER_TRANSACTION_REINSTALLED, "reinstall" },
1278 { SOLVER_TRANSACTION_DOWNGRADED, "downgrade" },
1279 { SOLVER_TRANSACTION_CHANGED, "change" },
1280 { SOLVER_TRANSACTION_UPGRADED, "upgrade" },
1281 { SOLVER_TRANSACTION_OBSOLETED, "obsolete" },
1282 { SOLVER_TRANSACTION_MULTIINSTALL, "multiinstall" },
1283 { SOLVER_TRANSACTION_MULTIREINSTALL, "multireinstall" },
1288 testcase_solverresult(Solver *solv, int resultflags)
1290 Pool *pool = solv->pool;
1298 if ((resultflags & TESTCASE_RESULT_TRANSACTION) != 0)
1300 Transaction *trans = solver_create_transaction(solv);
1304 for (i = 0; class2str[i].str; i++)
1307 transaction_classify_pkgs(trans, SOLVER_TRANSACTION_KEEP_PSEUDO, class2str[i].class, 0, 0, &q);
1308 for (j = 0; j < q.count; j++)
1312 if (pool->installed && pool->solvables[p].repo == pool->installed)
1313 op = transaction_obs_pkg(trans, p);
1314 s = pool_tmpjoin(pool, class2str[i].str, " ", testcase_solvid2str(pool, p));
1316 s = pool_tmpjoin(pool, s, " ", testcase_solvid2str(pool, op));
1317 strqueue_push(&sq, s);
1321 transaction_free(trans);
1323 if ((resultflags & TESTCASE_RESULT_PROBLEMS) != 0)
1325 char *probprefix, *solprefix;
1326 int problem, solution, element;
1329 pcnt = solver_problem_count(solv);
1330 for (problem = 1; problem <= pcnt; problem++)
1332 Id rid, from, to, dep;
1333 SolverRuleinfo rinfo;
1334 rid = solver_findproblemrule(solv, problem);
1335 s = testcase_problemid(solv, problem);
1336 probprefix = solv_dupjoin("problem ", s, 0);
1337 rinfo = solver_ruleinfo(solv, rid, &from, &to, &dep);
1338 s = pool_tmpjoin(pool, probprefix, " info ", solver_problemruleinfo2str(solv, rinfo, from, to, dep));
1339 strqueue_push(&sq, s);
1340 scnt = solver_solution_count(solv, problem);
1341 for (solution = 1; solution <= scnt; solution++)
1343 s = testcase_solutionid(solv, problem, solution);
1344 solprefix = solv_dupjoin(probprefix, " solution ", s);
1346 while ((element = solver_next_solutionelement(solv, problem, solution, element, &p, &op)) != 0)
1348 if (p == SOLVER_SOLUTION_JOB)
1349 s = pool_tmpjoin(pool, solprefix, " deljob ", testcase_job2str(pool, solv->job.elements[op - 1], solv->job.elements[op]));
1350 else if (p > 0 && op == 0)
1351 s = pool_tmpjoin(pool, solprefix, " erase ", testcase_solvid2str(pool, p));
1352 else if (p > 0 && op > 0)
1354 s = pool_tmpjoin(pool, solprefix, " replace ", testcase_solvid2str(pool, p));
1355 s = pool_tmpappend(pool, s, " ", testcase_solvid2str(pool, op));
1357 else if (p < 0 && op > 0)
1358 s = pool_tmpjoin(pool, solprefix, " allow ", testcase_solvid2str(pool, op));
1360 s = pool_tmpjoin(pool, solprefix, " unknown", 0);
1361 strqueue_push(&sq, s);
1363 solv_free(solprefix);
1365 solv_free(probprefix);
1369 if ((resultflags & TESTCASE_RESULT_ORPHANED) != 0)
1374 solver_get_orphaned(solv, &q);
1375 for (i = 0; i < q.count; i++)
1377 s = pool_tmpjoin(pool, "orphaned ", testcase_solvid2str(pool, q.elements[i]), 0);
1378 strqueue_push(&sq, s);
1383 if ((resultflags & TESTCASE_RESULT_RECOMMENDED) != 0)
1389 solver_get_recommendations(solv, &qr, &qs, 0);
1390 for (i = 0; i < qr.count; i++)
1392 s = pool_tmpjoin(pool, "recommended ", testcase_solvid2str(pool, qr.elements[i]), 0);
1393 strqueue_push(&sq, s);
1395 for (i = 0; i < qs.count; i++)
1397 s = pool_tmpjoin(pool, "suggested ", testcase_solvid2str(pool, qs.elements[i]), 0);
1398 strqueue_push(&sq, s);
1404 if ((resultflags & TESTCASE_RESULT_UNNEEDED) != 0)
1409 solver_get_unneeded(solv, &q, 0);
1410 for (i = 0; i < q.count; i++)
1412 s = pool_tmpjoin(pool, "unneeded ", testcase_solvid2str(pool, q.elements[i]), 0);
1413 strqueue_push(&sq, s);
1419 result = strqueue_join(&sq);
1426 testcase_write(Solver *solv, char *dir, int resultflags, const char *testcasename, const char *resultname)
1428 Pool *pool = solv->pool;
1439 testcasename = "testcase.t";
1441 resultname = "solver.result";
1443 if (mkdir(dir, 0777) && errno != EEXIST)
1445 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: could not create directory '%s'\n", dir);
1449 FOR_REPOS(repoid, repo)
1451 const char *name = testcase_repoid2str(pool, repoid);
1453 if (repo->subpriority)
1454 sprintf(priobuf, "%d.%d", repo->priority, repo->subpriority);
1456 sprintf(priobuf, "%d", repo->priority);
1457 out = pool_tmpjoin(pool, name, ".repo", ".gz");
1458 cmd = pool_tmpjoin(pool, "repo ", name, " ");
1459 cmd = pool_tmpappend(pool, cmd, priobuf, " ");
1460 cmd = pool_tmpappend(pool, cmd, "susetags ", out);
1461 strqueue_push(&sq, cmd);
1462 out = pool_tmpjoin(pool, dir, "/", out);
1463 if (!(fp = solv_xfopen(out, "w")))
1465 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: could not open '%s' for writing\n", out);
1469 testcase_write_susetags(repo, fp);
1472 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: write error\n");
1477 /* hmm, this is not optimal... we currently search for the lowest score */
1480 for (i = 0; i < pool->lastarch; i++)
1482 if (pool->id2arch[i] == 1 && !lowscore)
1484 if (pool->id2arch[i] > 0x10000 && (!lowscore || pool->id2arch[i] < lowscore))
1487 lowscore = pool->id2arch[i];
1490 cmd = pool_tmpjoin(pool, "system ", pool_id2str(pool, arch), pool->disttype == DISTTYPE_DEB ? " deb" : " rpm");
1491 if (pool->installed)
1492 cmd = pool_tmpappend(pool, cmd, " ", testcase_repoid2str(pool, pool->installed->repoid));
1493 strqueue_push(&sq, cmd);
1494 s = testcase_getpoolflags(solv->pool);
1497 cmd = pool_tmpjoin(pool, "poolflags ", s, 0);
1498 strqueue_push(&sq, cmd);
1501 if (pool->vendorclasses)
1504 for (i = 0; pool->vendorclasses[i]; i++)
1506 cmd = pool_tmpappend(pool, cmd ? cmd : "vendorclass", " ", pool->vendorclasses[i]);
1507 if (!pool->vendorclasses[i + 1])
1509 strqueue_push(&sq, cmd);
1516 s = testcase_getsolverflags(solv);
1519 cmd = pool_tmpjoin(pool, "solverflags ", s, 0);
1520 strqueue_push(&sq, cmd);
1523 /* now dump all the ns callback values we know */
1524 if (pool->nscallback)
1528 for (rid = 1; rid < pool->nrels; rid++)
1530 Reldep *rd = pool->rels + rid;
1531 if (rd->flags != REL_NAMESPACE || rd->name == NAMESPACE_OTHERPROVIDERS)
1533 /* check if we evaluated it, also skip empty results */
1534 if (!(d = pool->whatprovides_rel[rid]) || !pool->whatprovidesdata[d])
1536 cmd = pool_tmpjoin(pool, "namespace ", pool_id2str(pool, rd->name), "(");
1537 cmd = pool_tmpappend(pool, cmd, pool_id2str(pool, rd->evr), ")");
1538 for (; pool->whatprovidesdata[d]; d++)
1539 cmd = pool_tmpappend(pool, cmd, " ", testcase_solvid2str(pool, pool->whatprovidesdata[d]));
1540 strqueue_push(&sq, cmd);
1544 for (i = 0; i < solv->job.count; i += 2)
1546 cmd = (char *)testcase_job2str(pool, solv->job.elements[i], solv->job.elements[i + 1]);
1547 cmd = pool_tmpjoin(pool, "job ", cmd, 0);
1548 strqueue_push(&sq, cmd);
1555 for (i = 0; resultflags2str[i].str; i++)
1556 if ((resultflags & resultflags2str[i].flag) != 0)
1557 cmd = pool_tmpappend(pool, cmd, cmd ? "," : 0, resultflags2str[i].str);
1558 cmd = pool_tmpjoin(pool, "result ", cmd ? cmd : "?", 0);
1559 cmd = pool_tmpappend(pool, cmd, " ", resultname);
1560 strqueue_push(&sq, cmd);
1561 result = testcase_solverresult(solv, resultflags);
1562 if (!strcmp(resultname, "<inline>"))
1566 strqueue_init(&rsq);
1567 strqueue_split(&rsq, result);
1568 for (i = 0; i < rsq.nstr; i++)
1570 cmd = pool_tmpjoin(pool, "#>", rsq.str[i], 0);
1571 strqueue_push(&sq, cmd);
1573 strqueue_free(&rsq);
1577 out = pool_tmpjoin(pool, dir, "/", resultname);
1578 if (!(fp = fopen(out, "w")))
1580 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: could not open '%s' for writing\n", out);
1585 if (result && *result && fwrite(result, strlen(result), 1, fp) != 1)
1587 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: write error\n");
1594 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: write error\n");
1602 cmd = strqueue_join(&sq);
1603 out = pool_tmpjoin(pool, dir, "/", testcasename);
1604 if (!(fp = fopen(out, "w")))
1606 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: could not open '%s' for writing\n", out);
1610 if (*cmd && fwrite(cmd, strlen(cmd), 1, fp) != 1)
1612 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: write error\n");
1618 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: write error\n");
1628 read_inline_file(FILE *fp, char **bufp, char **bufpp, int *buflp)
1630 char *result = solv_malloc(1024);
1637 if (rp - result + 256 >= resultl)
1639 resultl = rp - result;
1640 result = solv_realloc(result, resultl + 1024);
1641 rp = result + resultl;
1644 if (!fgets(rp, resultl - (rp - result), fp))
1647 if (rl && (rp == result || rp[-1] == '\n'))
1649 if (rl > 1 && rp[0] == '#' && rp[1] == '>')
1651 memmove(rp, rp + 2, rl - 2);
1656 while (rl + 16 > *buflp)
1658 *bufp = solv_realloc(*bufp, *buflp + 512);
1661 memmove(*bufp, rp, rl);
1662 if ((*bufp)[rl - 1] == '\n')
1668 (*bufpp) = *bufp + rl;
1685 char *result = solv_malloc(1024);
1692 if (rp - result + 256 >= resultl)
1694 resultl = rp - result;
1695 result = solv_realloc(result, resultl + 1024);
1696 rp = result + resultl;
1699 rl = fread(rp, 1, resultl - (rp - result), fp);
1711 testcase_read(Pool *pool, FILE *fp, char *testcase, Queue *job, char **resultp, int *resultflagsp)
1716 char *testcasedir, *s;
1722 int poolflagsreset = 0;
1724 if (!fp && !(fp = fopen(testcase, "r")))
1726 pool_debug(pool, SOLV_ERROR, "testcase_read: could not open '%s'\n", testcase);
1729 testcasedir = solv_strdup(testcase);
1730 if ((s = strrchr(testcasedir, '/')) != 0)
1735 buf = solv_malloc(bufl);
1740 if (bufp - buf + 16 > bufl)
1743 buf = solv_realloc(buf, bufl + 512);
1747 if (!fgets(bufp, bufl - (bufp - buf), fp))
1751 if (!l || buf[l - 1] != '\n')
1758 while (*s && (*s == ' ' || *s == '\t'))
1760 if (!*s || *s == '#')
1763 /* split it in pieces */
1766 while (*s == ' ' || *s == '\t')
1770 pieces = solv_extend(pieces, npieces, 1, sizeof(*pieces), 7);
1771 pieces[npieces++] = s;
1772 while (*s && *s != ' ' && *s != '\t')
1777 pieces = solv_extend(pieces, npieces, 1, sizeof(*pieces), 7);
1778 pieces[npieces] = 0;
1779 if (!strcmp(pieces[0], "repo") && npieces >= 4)
1781 Repo *repo = repo_create(pool, pieces[1]);
1787 if (!poolflagsreset)
1790 testcase_resetpoolflags(pool); /* hmm */
1792 if (sscanf(pieces[2], "%d.%d", &prio, &subprio) != 2)
1795 prio = atoi(pieces[2]);
1797 repo->priority = prio;
1798 repo->subpriority = subprio;
1799 if (strcmp(pieces[3], "empty") != 0)
1801 const char *repotype = pool_tmpjoin(pool, pieces[3], 0, 0); /* gets overwritten in <inline> case */
1802 if (!strcmp(pieces[4], "<inline>"))
1804 char *idata = read_inline_file(fp, &buf, &bufp, &bufl);
1806 rfp = solv_xfopen_buf(rdata, &idata, 0, "rf");
1810 rdata = pool_tmpjoin(pool, testcasedir, pieces[4], 0);
1811 rfp = solv_xfopen(rdata, "r");
1815 pool_debug(pool, SOLV_ERROR, "testcase_read: could not open '%s'\n", rdata);
1817 else if (!strcmp(repotype, "susetags"))
1819 testcase_add_susetags(repo, rfp, 0);
1822 else if (!strcmp(repotype, "solv"))
1824 repo_add_solv(repo, rfp, 0);
1830 pool_debug(pool, SOLV_ERROR, "testcase_read: unknown repo type for repo '%s'\n", repo->name);
1834 else if (!strcmp(pieces[0], "system") && npieces >= 3)
1837 pool_setarch(pool, pieces[1]);
1840 Repo *repo = testcase_str2repo(pool, pieces[3]);
1842 pool_debug(pool, SOLV_ERROR, "testcase_read: system: unknown repo '%s'\n", pieces[3]);
1844 pool_set_installed(pool, repo);
1847 else if (!strcmp(pieces[0], "job") && npieces > 1)
1853 pool_addfileprovides(pool);
1854 pool_createwhatprovides(pool);
1858 for (sp = pieces[1]; sp < pieces[npieces - 1]; sp++)
1861 how = testcase_str2job(pool, pieces[1], &what);
1862 if (how >= 0 && job)
1863 queue_push2(job, how, what);
1865 else if (!strcmp(pieces[0], "vendorclass") && npieces > 1)
1867 pool_addvendorclass(pool, (const char **)(pieces + 1));
1869 else if (!strcmp(pieces[0], "namespace") && npieces > 1)
1871 int i = strlen(pieces[1]);
1872 s = strchr(pieces[1], '(');
1873 if (!s && pieces[1][i - 1] != ')')
1875 pool_debug(pool, SOLV_ERROR, "testcase_read: bad namespace '%s'\n", pieces[1]);
1883 pieces[1][i - 1] = 0;
1884 name = pool_str2id(pool, pieces[1], 1);
1885 evr = pool_str2id(pool, s + 1, 1);
1887 pieces[1][i - 1] = ')';
1888 id = pool_rel2id(pool, name, evr, REL_NAMESPACE, 1);
1889 for (i = 2; i < npieces; i++)
1890 queue_push(&q, testcase_str2solvid(pool, pieces[i]));
1891 /* now do the callback */
1894 pool_addfileprovides(pool);
1895 pool_createwhatprovides(pool);
1898 pool->whatprovides_rel[GETRELID(id)] = pool_queuetowhatprovides(pool, &q);
1902 else if (!strcmp(pieces[0], "poolflags"))
1905 if (!poolflagsreset)
1908 testcase_resetpoolflags(pool); /* hmm */
1910 for (i = 1; i < npieces; i++)
1911 testcase_setpoolflags(pool, pieces[i]);
1913 else if (!strcmp(pieces[0], "solverflags") && npieces > 1)
1918 solv = solver_create(pool);
1919 testcase_resetsolverflags(solv);
1921 for (i = 1; i < npieces; i++)
1922 testcase_setsolverflags(solv, pieces[i]);
1924 else if (!strcmp(pieces[0], "result") && npieces > 2)
1928 int resultflags = 0;
1929 char *s = pieces[1];
1933 char *se = strchr(s, ',');
1936 for (i = 0; resultflags2str[i].str; i++)
1937 if (!strcmp(s, resultflags2str[i].str))
1939 resultflags |= resultflags2str[i].flag;
1942 if (!resultflags2str[i].str)
1943 pool_debug(pool, SOLV_ERROR, "result: unknown flag '%s'\n", s);
1947 rdata = pool_tmpjoin(pool, testcasedir, pieces[2], 0);
1948 if (!strcmp(pieces[2], "<inline>"))
1949 result = read_inline_file(fp, &buf, &bufp, &bufl);
1952 FILE *rfp = fopen(rdata, "r");
1954 pool_debug(pool, SOLV_ERROR, "testcase_read: could not open '%s'\n", rdata);
1957 result = read_file(rfp);
1966 *resultflagsp = resultflags;
1968 else if (!strcmp(pieces[0], "nextjob") && npieces == 1)
1974 pool_debug(pool, SOLV_ERROR, "testcase_read: cannot parse command '%s'\n", pieces[0]);
1977 buf = solv_free(buf);
1978 pieces = solv_free(pieces);
1979 solv_free(testcasedir);
1982 pool_addfileprovides(pool);
1983 pool_createwhatprovides(pool);
1987 solv = solver_create(pool);
1988 testcase_resetsolverflags(solv);
1996 testcase_resultdiff(char *result1, char *result2)
1998 Strqueue sq1, sq2, osq;
2000 strqueue_init(&sq1);
2001 strqueue_init(&sq2);
2002 strqueue_init(&osq);
2003 strqueue_split(&sq1, result1);
2004 strqueue_split(&sq2, result2);
2005 strqueue_sort(&sq1);
2006 strqueue_sort(&sq2);
2007 strqueue_diff(&sq1, &sq2, &osq);
2008 r = osq.nstr ? strqueue_join(&osq) : 0;
2009 strqueue_free(&sq1);
2010 strqueue_free(&sq2);
2011 strqueue_free(&osq);