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_SETEV, "setev" },
59 { SOLVER_SETEVR, "setevr" },
60 { SOLVER_SETARCH, "setarch" },
61 { SOLVER_SETVENDOR, "setvendor" },
62 { SOLVER_SETREPO, "setrepo" },
63 { SOLVER_NOAUTOSET, "noautoset" },
67 static struct resultflags2str {
70 } resultflags2str[] = {
71 { TESTCASE_RESULT_TRANSACTION, "transaction" },
72 { TESTCASE_RESULT_PROBLEMS, "problems" },
73 { TESTCASE_RESULT_ORPHANED, "orphaned" },
74 { TESTCASE_RESULT_RECOMMENDED, "recommended" },
75 { TESTCASE_RESULT_UNNEEDED, "unneeded" },
79 static struct solverflags2str {
83 } solverflags2str[] = {
84 { SOLVER_FLAG_ALLOW_DOWNGRADE, "allowdowngrade", 0 },
85 { SOLVER_FLAG_ALLOW_NAMECHANGE, "allownamechange", 1 },
86 { SOLVER_FLAG_ALLOW_ARCHCHANGE, "allowarchchange", 0 },
87 { SOLVER_FLAG_ALLOW_VENDORCHANGE, "allowvendorchange", 0 },
88 { SOLVER_FLAG_ALLOW_UNINSTALL, "allowuninstall", 0 },
89 { SOLVER_FLAG_NO_UPDATEPROVIDE, "noupdateprovide", 0 },
90 { SOLVER_FLAG_SPLITPROVIDES, "splitprovides", 0 },
91 { SOLVER_FLAG_IGNORE_RECOMMENDED, "ignorerecommended", 0 },
92 { SOLVER_FLAG_ADD_ALREADY_RECOMMENDED, "addalreadyrecommended", 0 },
93 { SOLVER_FLAG_NO_INFARCHCHECK, "noinfarchcheck", 0 },
94 { SOLVER_FLAG_KEEP_EXPLICIT_OBSOLETES, "keepexplicitobsoletes", 0 },
95 { SOLVER_FLAG_BEST_OBEY_POLICY, "bestobeypolicy", 0 },
96 { SOLVER_FLAG_NO_AUTOTARGET, "noautotarget", 0 },
100 static struct poolflags2str {
104 } poolflags2str[] = {
105 { POOL_FLAG_PROMOTEEPOCH, "promoteepoch", 0 },
106 { POOL_FLAG_FORBIDSELFCONFLICTS, "forbidselfconflicts", 0 },
107 { POOL_FLAG_OBSOLETEUSESPROVIDES, "obsoleteusesprovides", 0 },
108 { POOL_FLAG_IMPLICITOBSOLETEUSESPROVIDES, "implicitobsoleteusesprovides", 0 },
109 { POOL_FLAG_OBSOLETEUSESCOLORS, "obsoleteusescolors", 0 },
110 { POOL_FLAG_NOINSTALLEDOBSOLETES, "noinstalledobsoletes", 0 },
111 { POOL_FLAG_HAVEDISTEPOCH, "havedistepoch", 0 },
115 static struct disttype2str {
119 { DISTTYPE_RPM, "rpm" },
120 { DISTTYPE_DEB, "deb" },
121 { DISTTYPE_ARCH, "arch" },
125 typedef struct strqueue {
130 #define STRQUEUE_BLOCK 63
133 strqueue_init(Strqueue *q)
140 strqueue_free(Strqueue *q)
143 for (i = 0; i < q->nstr; i++)
144 solv_free(q->str[i]);
145 q->str = solv_free(q->str);
150 strqueue_push(Strqueue *q, const char *s)
152 q->str = solv_extend(q->str, q->nstr, 1, sizeof(*q->str), STRQUEUE_BLOCK);
153 q->str[q->nstr++] = solv_strdup(s);
157 strqueue_pushjoin(Strqueue *q, const char *s1, const char *s2, const char *s3)
159 q->str = solv_extend(q->str, q->nstr, 1, sizeof(*q->str), STRQUEUE_BLOCK);
160 q->str[q->nstr++] = solv_dupjoin(s1, s2, s3);
164 strqueue_sort_cmp(const void *ap, const void *bp, void *dp)
166 const char *a = *(const char **)ap;
167 const char *b = *(const char **)bp;
168 return strcmp(a ? a : "", b ? b : "");
172 strqueue_sort(Strqueue *q)
175 solv_sort(q->str, q->nstr, sizeof(*q->str), strqueue_sort_cmp, 0);
179 strqueue_sort_u(Strqueue *q)
183 for (i = j = 0; i < q->nstr; i++)
184 if (!j || strqueue_sort_cmp(q->str + i, q->str + j - 1, 0) != 0)
185 q->str[j++] = q->str[i];
190 strqueue_join(Strqueue *q)
194 for (i = 0; i < q->nstr; i++)
196 l += strlen(q->str[i]) + 1;
197 l++; /* trailing \0 */
200 for (i = 0; i < q->nstr; i++)
203 strcpy(rp, q->str[i]);
212 strqueue_split(Strqueue *q, const char *s)
217 while ((p = strchr(s, '\n')) != 0)
219 q->str = solv_extend(q->str, q->nstr, 1, sizeof(*q->str), STRQUEUE_BLOCK);
220 q->str[q->nstr] = solv_malloc(p - s + 1);
222 memcpy(q->str[q->nstr], s, p - s);
223 q->str[q->nstr][p - s] = 0;
232 strqueue_diff(Strqueue *sq1, Strqueue *sq2, Strqueue *osq)
235 while (i < sq1->nstr && j < sq2->nstr)
237 int r = strqueue_sort_cmp(sq1->str + i, sq2->str + j, 0);
241 strqueue_pushjoin(osq, "-", sq1->str[i++], 0);
243 strqueue_pushjoin(osq, "+", sq2->str[j++], 0);
245 while (i < sq1->nstr)
246 strqueue_pushjoin(osq, "-", sq1->str[i++], 0);
247 while (j < sq2->nstr)
248 strqueue_pushjoin(osq, "+", sq2->str[j++], 0);
252 pool_isknownarch(Pool *pool, Id id)
254 if (!id || id == ID_EMPTY)
256 if (id == ARCH_SRC || id == ARCH_NOSRC || id == ARCH_NOARCH)
258 if (!pool->id2arch || (id > pool->lastarch || !pool->id2arch[id]))
264 testcase_str2dep(Pool *pool, char *s)
270 if ((n = strchr(s, '|')) != 0)
272 id = testcase_str2dep(pool, n + 1);
274 id = pool_rel2id(pool, testcase_str2dep(pool, s), id, REL_OR, 1);
278 while (*s == ' ' || *s == '\t')
281 while (*s && *s != ' ' && *s != '\t' && *s != '<' && *s != '=' && *s != '>')
285 while (*s && *s != ')')
291 if ((a = strchr(n, '.')) != 0 && a + 1 < s && s[-1] != ')')
293 Id archid = pool_strn2id(pool, a + 1, s - (a + 1), 0);
294 if (pool_isknownarch(pool, archid))
296 id = pool_strn2id(pool, n, a - n, 1);
297 id = pool_rel2id(pool, id, archid, REL_ARCH, 1);
300 id = pool_strn2id(pool, n, s - n, 1);
303 id = pool_strn2id(pool, n, s - n, 1);
306 while (*s == ' ' || *s == '\t')
322 while (*s == ' ' || *s == '\t')
325 while (*s && *s != ' ' && *s != '\t')
327 return pool_rel2id(pool, id, pool_strn2id(pool, n, s - n, 1), flags, 1);
331 testcase_repoid2str(Pool *pool, Id repoid)
333 Repo *repo = pool_id2repo(pool, repoid);
336 char *r = pool_tmpjoin(pool, repo->name, 0, 0);
338 for (rp = r; *rp; rp++)
339 if (*rp == ' ' || *rp == '\t')
346 sprintf(buf, "#%d", repoid);
347 return pool_tmpjoin(pool, buf, 0, 0);
352 testcase_solvid2str(Pool *pool, Id p)
354 Solvable *s = pool->solvables + p;
355 const char *n, *e, *a;
358 if (p == SYSTEMSOLVABLE)
360 n = pool_id2str(pool, s->name);
361 e = pool_id2str(pool, s->evr);
362 a = pool_id2str(pool, s->arch);
363 str = pool_alloctmpspace(pool, strlen(n) + strlen(e) + strlen(a) + 3);
364 sprintf(str, "%s-%s.%s", n, e, a);
366 return pool_tmpappend(pool, str, "@", 0);
370 char *str2 = pool_tmpappend(pool, str, "@", s->repo->name);
372 if (str2[l] == ' ' || str2[l] == '\t')
376 sprintf(buf, "@#%d", s->repo->repoid);
377 return pool_tmpappend(pool, str, buf, 0);
381 testcase_str2repo(Pool *pool, const char *str)
385 if (str[0] == '#' && (str[1] >= '0' && str[1] <= '9'))
389 for (j = 1; str[j] >= '0' && str[j] <= '9'; j++)
390 repoid = repoid * 10 + (str[j] - '0');
391 if (!str[j] && repoid > 0 && repoid < pool->nrepos)
392 repo = pool_id2repo(pool, repoid);
396 FOR_REPOS(repoid, repo)
401 l = strlen(repo->name);
402 for (i = 0; i < l; i++)
404 int c = repo->name[i];
405 if (c == ' ' || c == '\t')
410 if (i == l && !str[l])
413 if (repoid >= pool->nrepos)
420 testcase_str2solvid(Pool *pool, const char *str)
422 int i, l = strlen(str);
429 if (*str == '@' && !strcmp(str, "@SYSTEM"))
430 return SYSTEMSOLVABLE;
432 for (i = l - 1; i >= 0; i--)
433 if (str[i] == '@' && (repo = testcase_str2repo(pool, str + i + 1)) != 0)
438 /* now find the arch (if present) */
440 for (i = repostart - 1; i > 0; i--)
443 arch = pool_strn2id(pool, str + i + 1, repostart - (i + 1), 0);
448 /* now find the name */
449 for (i = repostart - 1; i > 0; i--)
453 Id nid, evrid, p, pp;
454 nid = pool_strn2id(pool, str, i, 0);
457 evrid = pool_strn2id(pool, str + i + 1, repostart - (i + 1), 0);
460 FOR_PROVIDES(p, pp, nid)
462 Solvable *s = pool->solvables + p;
463 if (s->name != nid || s->evr != evrid)
465 if (repo && s->repo != repo)
467 if (arch && s->arch != arch)
477 testcase_job2str(Pool *pool, Id how, Id what)
484 Id select = how & SOLVER_SELECTMASK;
486 for (i = 0; job2str[i].str; i++)
487 if ((how & SOLVER_JOBMASK) == job2str[i].job)
489 jobstr = job2str[i].str ? job2str[i].str : "unknown";
490 if (select == SOLVER_SOLVABLE)
493 pkgstr = testcase_solvid2str(pool, what);
495 else if (select == SOLVER_SOLVABLE_NAME)
498 pkgstr = pool_dep2str(pool, what);
500 else if (select == SOLVER_SOLVABLE_PROVIDES)
502 selstr = " provides ";
503 pkgstr = pool_dep2str(pool, what);
505 else if (select == SOLVER_SOLVABLE_ONE_OF)
510 while ((p = pool->whatprovidesdata[what++]) != 0)
512 const char *s = testcase_solvid2str(pool, p);
515 pkgstr = pool_tmpappend(pool, pkgstr, " ", s);
516 pool_freetmpspace(pool, s);
524 else if (select == SOLVER_SOLVABLE_REPO)
526 Repo *repo = pool_id2repo(pool, what);
531 sprintf(buf, "#%d", repo->repoid);
532 pkgstr = pool_tmpjoin(pool, buf, 0, 0);
535 pkgstr = pool_tmpjoin(pool, repo->name, 0, 0);
537 else if (select == SOLVER_SOLVABLE_ALL)
544 selstr = " unknown ";
547 ret = pool_tmpjoin(pool, jobstr, selstr, pkgstr);
549 ret = pool_tmpappend(pool, ret, " ", 0);
550 for (i = 0; jobflags2str[i].str; i++)
551 if ((how & jobflags2str[i].flag) != 0)
552 ret = pool_tmpappend(pool, ret, ",", jobflags2str[i].str);
558 ret = pool_tmpappend(pool, ret, "]", 0);
564 testcase_str2job(Pool *pool, const char *str, Id *whatp)
574 /* so we can patch it */
575 s = pool_tmpjoin(pool, str, 0, 0);
576 /* split it in pieces */
579 while (*s == ' ' || *s == '\t')
583 pieces = solv_extend(pieces, npieces, 1, sizeof(*pieces), 7);
584 pieces[npieces++] = s;
585 while (*s && *s != ' ' && *s != '\t')
592 pool_debug(pool, SOLV_ERROR, "str2job: bad line '%s'\n", str);
597 for (i = 0; job2str[i].str; i++)
598 if (!strcmp(pieces[0], job2str[i].str))
602 pool_debug(pool, SOLV_ERROR, "str2job: unknown job '%s'\n", str);
606 job = job2str[i].job;
609 char *flags = pieces[npieces - 1];
611 if (*flags == '[' && flags[strlen(flags) - 1] == ']')
615 flags[strlen(flags) - 1] = ',';
618 for (nf = flags; *nf != ','; nf++)
621 for (i = 0; jobflags2str[i].str; i++)
622 if (!strcmp(flags, jobflags2str[i].str))
624 if (!jobflags2str[i].str)
626 pool_debug(pool, SOLV_ERROR, "str2job: unknown jobflags in '%s'\n", str);
630 job |= jobflags2str[i].flag;
635 if (!strcmp(pieces[1], "pkg"))
639 pool_debug(pool, SOLV_ERROR, "str2job: bad pkg selector in '%s'\n", str);
643 job |= SOLVER_SOLVABLE;
644 what = testcase_str2solvid(pool, pieces[2]);
647 pool_debug(pool, SOLV_ERROR, "str2job: unknown package '%s'\n", pieces[2]);
652 else if (!strcmp(pieces[1], "name") || !strcmp(pieces[1], "provides"))
654 /* join em again for dep2str... */
656 for (sp = pieces[2]; sp < pieces[npieces - 1]; sp++)
659 what = testcase_str2dep(pool, pieces[2]);
660 if (pieces[1][0] == 'n')
661 job |= SOLVER_SOLVABLE_NAME;
663 job |= SOLVER_SOLVABLE_PROVIDES;
665 else if (!strcmp(pieces[1], "oneof"))
668 job |= SOLVER_SOLVABLE_ONE_OF;
670 if (npieces > 3 && strcmp(pieces[2], "nothing") != 0)
672 for (i = 2; i < npieces; i++)
674 Id p = testcase_str2solvid(pool, pieces[i]);
677 pool_debug(pool, SOLV_ERROR, "str2job: unknown package '%s'\n", pieces[i]);
685 what = pool_queuetowhatprovides(pool, &q);
688 else if (!strcmp(pieces[1], "repo"))
693 pool_debug(pool, SOLV_ERROR, "str2job: bad line '%s'\n", str);
697 repo = testcase_str2repo(pool, pieces[2]);
700 pool_debug(pool, SOLV_ERROR, "str2job: unknown repo '%s'\n", pieces[2]);
704 job |= SOLVER_SOLVABLE_REPO;
707 else if (!strcmp(pieces[1], "all"))
709 if (npieces != 3 && strcmp(pieces[2], "packages") != 0)
711 pool_debug(pool, SOLV_ERROR, "str2job: bad line '%s'\n", str);
715 job |= SOLVER_SOLVABLE_ALL;
720 pool_debug(pool, SOLV_ERROR, "str2job: unknown selection in '%s'\n", str);
730 writedeps(Repo *repo, FILE *fp, const char *tag, Id key, Solvable *s, Offset off)
732 Pool *pool = repo->pool;
739 dp = repo->idarraydata + off;
741 while ((id = *dp++) != 0)
743 if (key == SOLVABLE_REQUIRES && id == SOLVABLE_PREREQMARKER)
746 fprintf(fp, "-%s\n", tag);
751 if (key == SOLVABLE_PROVIDES && id == SOLVABLE_FILEMARKER)
756 idstr = pool_dep2str(pool, id);
759 Reldep *rd = GETRELDEP(pool, id);
760 if (key == SOLVABLE_CONFLICTS && rd->flags == REL_NAMESPACE && rd->name == NAMESPACE_OTHERPROVIDERS)
762 if (!strncmp(idstr, "namespace:", 10))
765 if (key == SOLVABLE_SUPPLEMENTS)
767 if (rd->flags == REL_NAMESPACE && rd->name == NAMESPACE_FILESYSTEM)
769 if (!strncmp(idstr, "namespace:", 10))
772 else if (rd->flags == REL_NAMESPACE && rd->name == NAMESPACE_MODALIAS)
774 if (!strncmp(idstr, "namespace:", 10))
777 else if (rd->flags == REL_AND)
779 /* either packageand chain or modalias */
781 if (ISRELDEP(rd->evr))
783 Reldep *mrd = GETRELDEP(pool, rd->evr);
784 if (mrd->flags == REL_NAMESPACE && mrd->name == NAMESPACE_MODALIAS)
786 idstr = pool_tmpjoin(pool, "modalias(", pool_dep2str(pool, rd->name), ":");
787 idstr = pool_tmpappend(pool, idstr, pool_dep2str(pool, mrd->evr), ")");
789 else if (mrd->flags >= 8)
794 /* must be and chain */
795 idstr = pool_dep2str(pool, rd->evr);
801 rd = GETRELDEP(pool, id);
802 if (rd->flags != REL_AND)
804 idstr = pool_tmpjoin(pool, pool_dep2str(pool, rd->evr), ":", idstr);
806 idstr = pool_tmpjoin(pool, pool_dep2str(pool, id), ":", idstr);
807 idstr = pool_tmpjoin(pool, "packageand(", idstr, ")");
810 else if (rd->flags >= 8)
816 fprintf(fp, "+%s\n", tag);
819 fprintf(fp, "%s\n", idstr);
821 if (key == SOLVABLE_PROVIDES)
823 /* add the filelist */
825 dataiterator_init(&di, pool, repo, s - pool->solvables, SOLVABLE_FILELIST, 0, 0);
826 while (dataiterator_step(&di))
828 const char *s = repodata_dir2str(di.data, di.kv.id, di.kv.str);
831 Id id = pool_str2id(pool, s, 0);
834 for (dp = prvdp; *dp; dp++)
838 continue; /* already included */
843 fprintf(fp, "+%s", tag);
846 fprintf(fp, "%s\n", s);
850 fprintf(fp, "-%s\n", tag);
854 testcase_write_testtags(Repo *repo, FILE *fp)
856 Pool *pool = repo->pool;
866 fprintf(fp, "=Ver: 2.0\n");
867 FOR_REPO_SOLVABLES(repo, p, s)
869 name = pool_id2str(pool, s->name);
870 evr = pool_id2str(pool, s->evr);
871 arch = pool_id2str(pool, s->arch);
872 release = strrchr(evr, '-');
874 release = evr + strlen(evr);
875 fprintf(fp, "=Pkg: %s %.*s %s %s\n", name, (int)(release - evr), evr, *release && release[1] ? release + 1 : "-", arch);
876 tmp = solvable_lookup_str(s, SOLVABLE_SUMMARY);
878 fprintf(fp, "=Sum: %s\n", tmp);
879 writedeps(repo, fp, "Req:", SOLVABLE_REQUIRES, s, s->requires);
880 writedeps(repo, fp, "Prv:", SOLVABLE_PROVIDES, s, s->provides);
881 writedeps(repo, fp, "Obs:", SOLVABLE_OBSOLETES, s, s->obsoletes);
882 writedeps(repo, fp, "Con:", SOLVABLE_CONFLICTS, s, s->conflicts);
883 writedeps(repo, fp, "Rec:", SOLVABLE_RECOMMENDS, s, s->recommends);
884 writedeps(repo, fp, "Sup:", SOLVABLE_SUPPLEMENTS, s, s->supplements);
885 writedeps(repo, fp, "Sug:", SOLVABLE_SUGGESTS, s, s->suggests);
886 writedeps(repo, fp, "Enh:", SOLVABLE_ENHANCES, s, s->enhances);
888 fprintf(fp, "=Vnd: %s\n", pool_id2str(pool, s->vendor));
889 ti = solvable_lookup_num(s, SOLVABLE_BUILDTIME, 0);
891 fprintf(fp, "=Tim: %u\n", ti);
897 adddep(Repo *repo, Offset olddeps, char *str, Id marker)
899 Id id = *str == '/' ? pool_str2id(repo->pool, str, 1) : testcase_str2dep(repo->pool, str);
900 return repo_addid_dep(repo, olddeps, id, marker);
904 finish_solvable(Pool *pool, Repodata *data, Solvable *s, char *filelist, int nfilelist)
910 for (l = 0; l < nfilelist; l += strlen(filelist + l) + 1)
912 char *p = strrchr(filelist + l, '/');
916 did = repodata_str2dir(data, filelist + l, 1);
919 did = repodata_str2dir(data, "/", 1);
920 repodata_add_dirstr(data, s - pool->solvables, SOLVABLE_FILELIST, did, p);
923 if (s->name && s->arch != ARCH_SRC && s->arch != ARCH_NOSRC)
924 s->provides = repo_addid_dep(s->repo, s->provides, pool_rel2id(pool, s->name, s->evr, REL_EQ, 1), 0);
925 s->supplements = repo_fix_supplements(s->repo, s->provides, s->supplements, 0);
926 s->conflicts = repo_fix_conflicts(s->repo, s->conflicts);
929 /* stripped down version of susetags parser used for testcases */
931 testcase_add_testtags(Repo *repo, FILE *fp, int flags)
933 Pool *pool = repo->pool;
946 data = repo_add_repodata(repo, flags);
951 line = solv_malloc(aline);
955 if (linep - line + 16 > aline)
957 aline = linep - line;
958 line = solv_realloc(line, aline + 512);
959 linep = line + aline;
962 if (!fgets(linep, aline - (linep - line), fp))
964 linep += strlen(linep);
965 if (linep == line || linep[-1] != '\n')
968 linep = line + intag;
971 if (line[intag] == '-' && !strncmp(line + 1, line + intag + 1, intag - 2))
978 else if (line[0] == '+' && line[1] && line[1] != ':')
980 char *tagend = strchr(line, ':');
985 intag = tagend + 2 - line;
986 linep = line + intag;
989 if (*line != '=' || !line[1] || !line[2] || !line[3] || line[4] != ':')
991 tag = line[1] << 16 | line[2] << 8 | line[3];
994 case 'P' << 16 | 'k' << 8 | 'g':
996 finish_solvable(pool, data, s, filelist, nfilelist);
998 if (split(line + 5, sp, 5) != 4)
1000 s = pool_id2solvable(pool, repo_add_solvable(repo));
1001 s->name = pool_str2id(pool, sp[0], 1);
1002 /* join back version and release */
1003 if (sp[2] && !(sp[2][0] == '-' && !sp[2][1]))
1005 s->evr = makeevr(pool, sp[1]);
1006 s->arch = pool_str2id(pool, sp[3], 1);
1008 case 'S' << 16 | 'u' << 8 | 'm':
1009 repodata_set_str(data, s - pool->solvables, SOLVABLE_SUMMARY, line + 6);
1011 case 'V' << 16 | 'n' << 8 | 'd':
1012 s->vendor = pool_str2id(pool, line + 6, 1);
1014 case 'T' << 16 | 'i' << 8 | 'm':
1017 repodata_set_num(data, s - pool->solvables, SOLVABLE_BUILDTIME, t);
1019 case 'R' << 16 | 'e' << 8 | 'q':
1020 s->requires = adddep(repo, s->requires, line + 6, -SOLVABLE_PREREQMARKER);
1022 case 'P' << 16 | 'r' << 8 | 'q':
1023 s->requires = adddep(repo, s->requires, line + 6, SOLVABLE_PREREQMARKER);
1025 case 'P' << 16 | 'r' << 8 | 'v':
1028 int l = strlen(line + 6) + 1;
1029 if (nfilelist + l > afilelist)
1031 afilelist = nfilelist + l + 512;
1032 filelist = solv_realloc(filelist, afilelist);
1034 memcpy(filelist + nfilelist, line + 6, l);
1041 for (l = 0; l < nfilelist; l += strlen(filelist + l) + 1)
1042 s->provides = repo_addid_dep(repo, s->provides, pool_str2id(pool, filelist + l, 1), 0);
1045 s->provides = adddep(repo, s->provides, line + 6, 0);
1047 case 'O' << 16 | 'b' << 8 | 's':
1048 s->obsoletes = adddep(repo, s->obsoletes, line + 6, 0);
1050 case 'C' << 16 | 'o' << 8 | 'n':
1051 s->conflicts = adddep(repo, s->conflicts, line + 6, 0);
1053 case 'R' << 16 | 'e' << 8 | 'c':
1054 s->recommends = adddep(repo, s->recommends, line + 6, 0);
1056 case 'S' << 16 | 'u' << 8 | 'p':
1057 s->supplements = adddep(repo, s->supplements, line + 6, 0);
1059 case 'S' << 16 | 'u' << 8 | 'g':
1060 s->suggests = adddep(repo, s->suggests, line + 6, 0);
1062 case 'E' << 16 | 'n' << 8 | 'h':
1063 s->enhances = adddep(repo, s->enhances, line + 6, 0);
1070 finish_solvable(pool, data, s, filelist, nfilelist);
1072 solv_free(filelist);
1073 repodata_free_dircache(data);
1074 if (!(flags & REPO_NO_INTERNALIZE))
1075 repodata_internalize(data);
1080 testcase_getpoolflags(Pool *pool)
1082 const char *str = 0;
1084 for (i = 0; poolflags2str[i].str; i++)
1086 v = pool_get_flag(pool, poolflags2str[i].flag);
1087 if (v == poolflags2str[i].def)
1089 str = pool_tmpappend(pool, str, v ? " " : " !", poolflags2str[i].str);
1091 return str ? str + 1 : "";
1095 testcase_setpoolflags(Pool *pool, const char *str)
1097 const char *p = str, *s;
1101 while (*p == ' ' || *p == '\t' || *p == ',')
1112 while (*p && *p != ' ' && *p != '\t' && *p != ',')
1114 for (i = 0; poolflags2str[i].str; i++)
1115 if (!strncmp(poolflags2str[i].str, s, p - s) && poolflags2str[i].str[p - s] == 0)
1117 if (!poolflags2str[i].str)
1119 pool_debug(pool, SOLV_ERROR, "setpoolflags: unknown flag '%.*s'\n", (int)(p - s), s);
1122 pool_set_flag(pool, poolflags2str[i].flag, v);
1128 testcase_resetpoolflags(Pool *pool)
1131 for (i = 0; poolflags2str[i].str; i++)
1132 pool_set_flag(pool, poolflags2str[i].flag, poolflags2str[i].def);
1136 testcase_getsolverflags(Solver *solv)
1138 Pool *pool = solv->pool;
1139 const char *str = 0;
1141 for (i = 0; solverflags2str[i].str; i++)
1143 v = solver_get_flag(solv, solverflags2str[i].flag);
1144 if (v == solverflags2str[i].def)
1146 str = pool_tmpappend(pool, str, v ? " " : " !", solverflags2str[i].str);
1148 return str ? str + 1 : "";
1152 testcase_setsolverflags(Solver *solv, const char *str)
1154 const char *p = str, *s;
1158 while (*p == ' ' || *p == '\t' || *p == ',')
1169 while (*p && *p != ' ' && *p != '\t' && *p != ',')
1171 for (i = 0; solverflags2str[i].str; i++)
1172 if (!strncmp(solverflags2str[i].str, s, p - s) && solverflags2str[i].str[p - s] == 0)
1174 if (!solverflags2str[i].str)
1176 pool_debug(solv->pool, SOLV_ERROR, "setsolverflags: unknown flag '%.*s'\n", (int)(p - s), s);
1179 solver_set_flag(solv, solverflags2str[i].flag, v);
1185 testcase_resetsolverflags(Solver *solv)
1188 for (i = 0; solverflags2str[i].str; i++)
1189 solver_set_flag(solv, solverflags2str[i].flag, solverflags2str[i].def);
1193 testcase_ruleid(Solver *solv, Id rid)
1199 const unsigned char *md5;
1205 solver_ruleliterals(solv, rid, &q);
1206 for (i = 0; i < q.count; i++)
1208 Id p = q.elements[i];
1209 s = testcase_solvid2str(solv->pool, p > 0 ? p : -p);
1211 s = pool_tmpjoin(solv->pool, "!", s, 0);
1212 strqueue_push(&sq, s);
1215 strqueue_sort_u(&sq);
1216 chk = solv_chksum_create(REPOKEY_TYPE_MD5);
1217 for (i = 0; i < sq.nstr; i++)
1218 solv_chksum_add(chk, sq.str[i], strlen(sq.str[i]) + 1);
1219 md5 = solv_chksum_get(chk, &md5l);
1220 s = pool_bin2hex(solv->pool, md5, md5l);
1221 chk = solv_chksum_free(chk, 0);
1227 testcase_problemid(Solver *solv, Id problem)
1232 const unsigned char *md5;
1236 /* we build a hash of all rules that define the problem */
1239 solver_findallproblemrules(solv, problem, &q);
1240 for (i = 0; i < q.count; i++)
1241 strqueue_push(&sq, testcase_ruleid(solv, q.elements[i]));
1243 strqueue_sort_u(&sq);
1244 chk = solv_chksum_create(REPOKEY_TYPE_MD5);
1245 for (i = 0; i < sq.nstr; i++)
1246 solv_chksum_add(chk, sq.str[i], strlen(sq.str[i]) + 1);
1247 md5 = solv_chksum_get(chk, &md5l);
1248 s = pool_bin2hex(solv->pool, md5, 4);
1249 chk = solv_chksum_free(chk, 0);
1255 testcase_solutionid(Solver *solv, Id problem, Id solution)
1259 const unsigned char *md5;
1263 intid = solver_solutionelement_internalid(solv, problem, solution);
1264 /* internal stuff! handle with care! */
1268 s = testcase_job2str(solv->pool, solv->job.elements[-intid - 1], solv->job.elements[-intid]);
1273 s = testcase_ruleid(solv, intid);
1275 chk = solv_chksum_create(REPOKEY_TYPE_MD5);
1276 solv_chksum_add(chk, s, strlen(s) + 1);
1277 md5 = solv_chksum_get(chk, &md5l);
1278 s = pool_bin2hex(solv->pool, md5, 4);
1279 chk = solv_chksum_free(chk, 0);
1283 static struct class2str {
1287 { SOLVER_TRANSACTION_ERASE, "erase" },
1288 { SOLVER_TRANSACTION_INSTALL, "install" },
1289 { SOLVER_TRANSACTION_REINSTALLED, "reinstall" },
1290 { SOLVER_TRANSACTION_DOWNGRADED, "downgrade" },
1291 { SOLVER_TRANSACTION_CHANGED, "change" },
1292 { SOLVER_TRANSACTION_UPGRADED, "upgrade" },
1293 { SOLVER_TRANSACTION_OBSOLETED, "obsolete" },
1294 { SOLVER_TRANSACTION_MULTIINSTALL, "multiinstall" },
1295 { SOLVER_TRANSACTION_MULTIREINSTALL, "multireinstall" },
1300 testcase_solverresult(Solver *solv, int resultflags)
1302 Pool *pool = solv->pool;
1310 if ((resultflags & TESTCASE_RESULT_TRANSACTION) != 0)
1312 Transaction *trans = solver_create_transaction(solv);
1316 for (i = 0; class2str[i].str; i++)
1319 transaction_classify_pkgs(trans, SOLVER_TRANSACTION_KEEP_PSEUDO, class2str[i].class, 0, 0, &q);
1320 for (j = 0; j < q.count; j++)
1324 if (pool->installed && pool->solvables[p].repo == pool->installed)
1325 op = transaction_obs_pkg(trans, p);
1326 s = pool_tmpjoin(pool, class2str[i].str, " ", testcase_solvid2str(pool, p));
1328 s = pool_tmpjoin(pool, s, " ", testcase_solvid2str(pool, op));
1329 strqueue_push(&sq, s);
1333 transaction_free(trans);
1335 if ((resultflags & TESTCASE_RESULT_PROBLEMS) != 0)
1337 char *probprefix, *solprefix;
1338 int problem, solution, element;
1341 pcnt = solver_problem_count(solv);
1342 for (problem = 1; problem <= pcnt; problem++)
1344 Id rid, from, to, dep;
1345 SolverRuleinfo rinfo;
1346 rid = solver_findproblemrule(solv, problem);
1347 s = testcase_problemid(solv, problem);
1348 probprefix = solv_dupjoin("problem ", s, 0);
1349 rinfo = solver_ruleinfo(solv, rid, &from, &to, &dep);
1350 s = pool_tmpjoin(pool, probprefix, " info ", solver_problemruleinfo2str(solv, rinfo, from, to, dep));
1351 strqueue_push(&sq, s);
1352 scnt = solver_solution_count(solv, problem);
1353 for (solution = 1; solution <= scnt; solution++)
1355 s = testcase_solutionid(solv, problem, solution);
1356 solprefix = solv_dupjoin(probprefix, " solution ", s);
1358 while ((element = solver_next_solutionelement(solv, problem, solution, element, &p, &op)) != 0)
1360 if (p == SOLVER_SOLUTION_JOB)
1361 s = pool_tmpjoin(pool, solprefix, " deljob ", testcase_job2str(pool, solv->job.elements[op - 1], solv->job.elements[op]));
1362 else if (p > 0 && op == 0)
1363 s = pool_tmpjoin(pool, solprefix, " erase ", testcase_solvid2str(pool, p));
1364 else if (p > 0 && op > 0)
1366 s = pool_tmpjoin(pool, solprefix, " replace ", testcase_solvid2str(pool, p));
1367 s = pool_tmpappend(pool, s, " ", testcase_solvid2str(pool, op));
1369 else if (p < 0 && op > 0)
1370 s = pool_tmpjoin(pool, solprefix, " allow ", testcase_solvid2str(pool, op));
1372 s = pool_tmpjoin(pool, solprefix, " unknown", 0);
1373 strqueue_push(&sq, s);
1375 solv_free(solprefix);
1377 solv_free(probprefix);
1381 if ((resultflags & TESTCASE_RESULT_ORPHANED) != 0)
1386 solver_get_orphaned(solv, &q);
1387 for (i = 0; i < q.count; i++)
1389 s = pool_tmpjoin(pool, "orphaned ", testcase_solvid2str(pool, q.elements[i]), 0);
1390 strqueue_push(&sq, s);
1395 if ((resultflags & TESTCASE_RESULT_RECOMMENDED) != 0)
1401 solver_get_recommendations(solv, &qr, &qs, 0);
1402 for (i = 0; i < qr.count; i++)
1404 s = pool_tmpjoin(pool, "recommended ", testcase_solvid2str(pool, qr.elements[i]), 0);
1405 strqueue_push(&sq, s);
1407 for (i = 0; i < qs.count; i++)
1409 s = pool_tmpjoin(pool, "suggested ", testcase_solvid2str(pool, qs.elements[i]), 0);
1410 strqueue_push(&sq, s);
1416 if ((resultflags & TESTCASE_RESULT_UNNEEDED) != 0)
1421 solver_get_unneeded(solv, &q, 0);
1422 for (i = 0; i < q.count; i++)
1424 s = pool_tmpjoin(pool, "unneeded ", testcase_solvid2str(pool, q.elements[i]), 0);
1425 strqueue_push(&sq, s);
1431 result = strqueue_join(&sq);
1438 testcase_write(Solver *solv, char *dir, int resultflags, const char *testcasename, const char *resultname)
1440 Pool *pool = solv->pool;
1451 testcasename = "testcase.t";
1453 resultname = "solver.result";
1455 if (mkdir(dir, 0777) && errno != EEXIST)
1457 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: could not create directory '%s'\n", dir);
1461 FOR_REPOS(repoid, repo)
1463 const char *name = testcase_repoid2str(pool, repoid);
1465 if (repo->subpriority)
1466 sprintf(priobuf, "%d.%d", repo->priority, repo->subpriority);
1468 sprintf(priobuf, "%d", repo->priority);
1469 out = pool_tmpjoin(pool, name, ".repo", ".gz");
1470 cmd = pool_tmpjoin(pool, "repo ", name, " ");
1471 cmd = pool_tmpappend(pool, cmd, priobuf, " ");
1472 cmd = pool_tmpappend(pool, cmd, "testtags ", out);
1473 strqueue_push(&sq, cmd);
1474 out = pool_tmpjoin(pool, dir, "/", out);
1475 if (!(fp = solv_xfopen(out, "w")))
1477 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: could not open '%s' for writing\n", out);
1481 testcase_write_testtags(repo, fp);
1484 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: write error\n");
1489 /* hmm, this is not optimal... we currently search for the lowest score */
1491 arch = pool->solvables[SYSTEMSOLVABLE].arch;
1492 for (i = 0; i < pool->lastarch; i++)
1494 if (pool->id2arch[i] == 1 && !lowscore)
1496 if (pool->id2arch[i] > 0x10000 && (!lowscore || pool->id2arch[i] < lowscore))
1499 lowscore = pool->id2arch[i];
1502 cmd = pool_tmpjoin(pool, "system ", pool->lastarch ? pool_id2str(pool, arch) : "unset", 0);
1503 for (i = 0; disttype2str[i].str != 0; i++)
1504 if (pool->disttype == disttype2str[i].type)
1506 pool_tmpappend(pool, cmd, " ", disttype2str[i].str ? disttype2str[i].str : "unknown");
1507 if (pool->installed)
1508 cmd = pool_tmpappend(pool, cmd, " ", testcase_repoid2str(pool, pool->installed->repoid));
1509 strqueue_push(&sq, cmd);
1510 s = testcase_getpoolflags(solv->pool);
1513 cmd = pool_tmpjoin(pool, "poolflags ", s, 0);
1514 strqueue_push(&sq, cmd);
1517 if (pool->vendorclasses)
1520 for (i = 0; pool->vendorclasses[i]; i++)
1522 cmd = pool_tmpappend(pool, cmd ? cmd : "vendorclass", " ", pool->vendorclasses[i]);
1523 if (!pool->vendorclasses[i + 1])
1525 strqueue_push(&sq, cmd);
1532 s = testcase_getsolverflags(solv);
1535 cmd = pool_tmpjoin(pool, "solverflags ", s, 0);
1536 strqueue_push(&sq, cmd);
1539 /* now dump all the ns callback values we know */
1540 if (pool->nscallback)
1544 for (rid = 1; rid < pool->nrels; rid++)
1546 Reldep *rd = pool->rels + rid;
1547 if (rd->flags != REL_NAMESPACE || rd->name == NAMESPACE_OTHERPROVIDERS)
1549 /* evaluate all namespace ids, skip empty results */
1550 d = pool_whatprovides(pool, MAKERELDEP(rid));
1551 if (!d || !pool->whatprovidesdata[d])
1553 cmd = pool_tmpjoin(pool, "namespace ", pool_id2str(pool, rd->name), "(");
1554 cmd = pool_tmpappend(pool, cmd, pool_id2str(pool, rd->evr), ")");
1555 for (; pool->whatprovidesdata[d]; d++)
1556 cmd = pool_tmpappend(pool, cmd, " ", testcase_solvid2str(pool, pool->whatprovidesdata[d]));
1557 strqueue_push(&sq, cmd);
1561 for (i = 0; i < solv->job.count; i += 2)
1563 cmd = (char *)testcase_job2str(pool, solv->job.elements[i], solv->job.elements[i + 1]);
1564 cmd = pool_tmpjoin(pool, "job ", cmd, 0);
1565 strqueue_push(&sq, cmd);
1572 for (i = 0; resultflags2str[i].str; i++)
1573 if ((resultflags & resultflags2str[i].flag) != 0)
1574 cmd = pool_tmpappend(pool, cmd, cmd ? "," : 0, resultflags2str[i].str);
1575 cmd = pool_tmpjoin(pool, "result ", cmd ? cmd : "?", 0);
1576 cmd = pool_tmpappend(pool, cmd, " ", resultname);
1577 strqueue_push(&sq, cmd);
1578 result = testcase_solverresult(solv, resultflags);
1579 if (!strcmp(resultname, "<inline>"))
1583 strqueue_init(&rsq);
1584 strqueue_split(&rsq, result);
1585 for (i = 0; i < rsq.nstr; i++)
1587 cmd = pool_tmpjoin(pool, "#>", rsq.str[i], 0);
1588 strqueue_push(&sq, cmd);
1590 strqueue_free(&rsq);
1594 out = pool_tmpjoin(pool, dir, "/", resultname);
1595 if (!(fp = fopen(out, "w")))
1597 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: could not open '%s' for writing\n", out);
1602 if (result && *result && fwrite(result, strlen(result), 1, fp) != 1)
1604 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: write error\n");
1611 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: write error\n");
1619 cmd = strqueue_join(&sq);
1620 out = pool_tmpjoin(pool, dir, "/", testcasename);
1621 if (!(fp = fopen(out, "w")))
1623 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: could not open '%s' for writing\n", out);
1627 if (*cmd && fwrite(cmd, strlen(cmd), 1, fp) != 1)
1629 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: write error\n");
1635 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: write error\n");
1645 read_inline_file(FILE *fp, char **bufp, char **bufpp, int *buflp)
1647 char *result = solv_malloc(1024);
1654 if (rp - result + 256 >= resultl)
1656 resultl = rp - result;
1657 result = solv_realloc(result, resultl + 1024);
1658 rp = result + resultl;
1661 if (!fgets(rp, resultl - (rp - result), fp))
1664 if (rl && (rp == result || rp[-1] == '\n'))
1666 if (rl > 1 && rp[0] == '#' && rp[1] == '>')
1668 memmove(rp, rp + 2, rl - 2);
1673 while (rl + 16 > *buflp)
1675 *bufp = solv_realloc(*bufp, *buflp + 512);
1678 memmove(*bufp, rp, rl);
1679 if ((*bufp)[rl - 1] == '\n')
1685 (*bufpp) = *bufp + rl;
1702 char *result = solv_malloc(1024);
1709 if (rp - result + 256 >= resultl)
1711 resultl = rp - result;
1712 result = solv_realloc(result, resultl + 1024);
1713 rp = result + resultl;
1716 rl = fread(rp, 1, resultl - (rp - result), fp);
1728 testcase_read(Pool *pool, FILE *fp, char *testcase, Queue *job, char **resultp, int *resultflagsp)
1733 char *testcasedir, *s;
1739 int poolflagsreset = 0;
1741 if (!fp && !(fp = fopen(testcase, "r")))
1743 pool_debug(pool, SOLV_ERROR, "testcase_read: could not open '%s'\n", testcase);
1746 testcasedir = solv_strdup(testcase);
1747 if ((s = strrchr(testcasedir, '/')) != 0)
1752 buf = solv_malloc(bufl);
1757 if (bufp - buf + 16 > bufl)
1760 buf = solv_realloc(buf, bufl + 512);
1764 if (!fgets(bufp, bufl - (bufp - buf), fp))
1768 if (!l || buf[l - 1] != '\n')
1775 while (*s && (*s == ' ' || *s == '\t'))
1777 if (!*s || *s == '#')
1780 /* split it in pieces */
1783 while (*s == ' ' || *s == '\t')
1787 pieces = solv_extend(pieces, npieces, 1, sizeof(*pieces), 7);
1788 pieces[npieces++] = s;
1789 while (*s && *s != ' ' && *s != '\t')
1794 pieces = solv_extend(pieces, npieces, 1, sizeof(*pieces), 7);
1795 pieces[npieces] = 0;
1796 if (!strcmp(pieces[0], "repo") && npieces >= 4)
1798 Repo *repo = repo_create(pool, pieces[1]);
1804 if (!poolflagsreset)
1807 testcase_resetpoolflags(pool); /* hmm */
1809 if (sscanf(pieces[2], "%d.%d", &prio, &subprio) != 2)
1812 prio = atoi(pieces[2]);
1814 repo->priority = prio;
1815 repo->subpriority = subprio;
1816 if (strcmp(pieces[3], "empty") != 0)
1818 const char *repotype = pool_tmpjoin(pool, pieces[3], 0, 0); /* gets overwritten in <inline> case */
1819 if (!strcmp(pieces[4], "<inline>"))
1821 char *idata = read_inline_file(fp, &buf, &bufp, &bufl);
1823 rfp = solv_xfopen_buf(rdata, &idata, 0, "rf");
1827 rdata = pool_tmpjoin(pool, testcasedir, pieces[4], 0);
1828 rfp = solv_xfopen(rdata, "r");
1832 pool_debug(pool, SOLV_ERROR, "testcase_read: could not open '%s'\n", rdata);
1834 else if (!strcmp(repotype, "testtags"))
1836 testcase_add_testtags(repo, rfp, 0);
1839 else if (!strcmp(repotype, "solv"))
1841 repo_add_solv(repo, rfp, 0);
1847 pool_debug(pool, SOLV_ERROR, "testcase_read: unknown repo type for repo '%s'\n", repo->name);
1851 else if (!strcmp(pieces[0], "system") && npieces >= 3)
1855 /* must set the disttype before the arch */
1856 for (i = 0; disttype2str[i].str != 0; i++)
1857 if (!strcmp(disttype2str[i].str, pieces[2]))
1859 if (!disttype2str[i].str)
1860 pool_debug(pool, SOLV_ERROR, "testcase_read: system: unknown disttype '%s'\n", pieces[2]);
1861 else if (pool->disttype != disttype2str[i].type)
1863 #ifdef MULTI_SEMANTICS
1864 pool_setdisttype(pool, disttype2str[i].type);
1866 pool_debug(pool, SOLV_ERROR, "testcase_read: system: cannot change disttype to '%s'\n", pieces[2]);
1869 if (strcmp(pieces[1], "unset") != 0)
1870 pool_setarch(pool, pieces[1]);
1872 pool_setarch(pool, 0);
1875 Repo *repo = testcase_str2repo(pool, pieces[3]);
1877 pool_debug(pool, SOLV_ERROR, "testcase_read: system: unknown repo '%s'\n", pieces[3]);
1879 pool_set_installed(pool, repo);
1882 else if (!strcmp(pieces[0], "job") && npieces > 1)
1888 pool_addfileprovides(pool);
1889 pool_createwhatprovides(pool);
1893 for (sp = pieces[1]; sp < pieces[npieces - 1]; sp++)
1896 how = testcase_str2job(pool, pieces[1], &what);
1897 if (how >= 0 && job)
1898 queue_push2(job, how, what);
1900 else if (!strcmp(pieces[0], "vendorclass") && npieces > 1)
1902 pool_addvendorclass(pool, (const char **)(pieces + 1));
1904 else if (!strcmp(pieces[0], "namespace") && npieces > 1)
1906 int i = strlen(pieces[1]);
1907 s = strchr(pieces[1], '(');
1908 if (!s && pieces[1][i - 1] != ')')
1910 pool_debug(pool, SOLV_ERROR, "testcase_read: bad namespace '%s'\n", pieces[1]);
1918 pieces[1][i - 1] = 0;
1919 name = pool_str2id(pool, pieces[1], 1);
1920 evr = pool_str2id(pool, s + 1, 1);
1922 pieces[1][i - 1] = ')';
1923 id = pool_rel2id(pool, name, evr, REL_NAMESPACE, 1);
1924 for (i = 2; i < npieces; i++)
1925 queue_push(&q, testcase_str2solvid(pool, pieces[i]));
1926 /* now do the callback */
1929 pool_addfileprovides(pool);
1930 pool_createwhatprovides(pool);
1933 pool->whatprovides_rel[GETRELID(id)] = pool_queuetowhatprovides(pool, &q);
1937 else if (!strcmp(pieces[0], "poolflags"))
1940 if (!poolflagsreset)
1943 testcase_resetpoolflags(pool); /* hmm */
1945 for (i = 1; i < npieces; i++)
1946 testcase_setpoolflags(pool, pieces[i]);
1948 else if (!strcmp(pieces[0], "solverflags") && npieces > 1)
1953 solv = solver_create(pool);
1954 testcase_resetsolverflags(solv);
1956 for (i = 1; i < npieces; i++)
1957 testcase_setsolverflags(solv, pieces[i]);
1959 else if (!strcmp(pieces[0], "result") && npieces > 2)
1963 int resultflags = 0;
1964 char *s = pieces[1];
1968 char *se = strchr(s, ',');
1971 for (i = 0; resultflags2str[i].str; i++)
1972 if (!strcmp(s, resultflags2str[i].str))
1974 resultflags |= resultflags2str[i].flag;
1977 if (!resultflags2str[i].str)
1978 pool_debug(pool, SOLV_ERROR, "result: unknown flag '%s'\n", s);
1982 rdata = pool_tmpjoin(pool, testcasedir, pieces[2], 0);
1983 if (!strcmp(pieces[2], "<inline>"))
1984 result = read_inline_file(fp, &buf, &bufp, &bufl);
1987 FILE *rfp = fopen(rdata, "r");
1989 pool_debug(pool, SOLV_ERROR, "testcase_read: could not open '%s'\n", rdata);
1992 result = read_file(rfp);
2001 *resultflagsp = resultflags;
2003 else if (!strcmp(pieces[0], "nextjob") && npieces == 1)
2009 pool_debug(pool, SOLV_ERROR, "testcase_read: cannot parse command '%s'\n", pieces[0]);
2012 buf = solv_free(buf);
2013 pieces = solv_free(pieces);
2014 solv_free(testcasedir);
2017 pool_addfileprovides(pool);
2018 pool_createwhatprovides(pool);
2022 solv = solver_create(pool);
2023 testcase_resetsolverflags(solv);
2031 testcase_resultdiff(char *result1, char *result2)
2033 Strqueue sq1, sq2, osq;
2035 strqueue_init(&sq1);
2036 strqueue_init(&sq2);
2037 strqueue_init(&osq);
2038 strqueue_split(&sq1, result1);
2039 strqueue_split(&sq2, result2);
2040 strqueue_sort(&sq1);
2041 strqueue_sort(&sq2);
2042 strqueue_diff(&sq1, &sq2, &osq);
2043 r = osq.nstr ? strqueue_join(&osq) : 0;
2044 strqueue_free(&sq1);
2045 strqueue_free(&sq2);
2046 strqueue_free(&osq);