2 * Copyright (c) 2012, Novell Inc.
4 * This program is licensed under the BSD license, read LICENSE.BSD
5 * for further information
19 #include "poolvendor.h"
21 #include "repo_solv.h"
23 #include "solverdebug.h"
26 #include "selection.h"
27 #include "solv_xfopen.h"
30 #include "tools_util.h"
32 static struct job2str {
36 { SOLVER_NOOP, "noop" },
37 { SOLVER_INSTALL, "install" },
38 { SOLVER_ERASE, "erase" },
39 { SOLVER_UPDATE, "update" },
40 { SOLVER_WEAKENDEPS, "weakendeps" },
41 { SOLVER_MULTIVERSION, "multiversion" },
42 { SOLVER_MULTIVERSION, "noobsoletes" }, /* old name */
43 { SOLVER_LOCK, "lock" },
44 { SOLVER_DISTUPGRADE, "distupgrade" },
45 { SOLVER_VERIFY, "verify" },
46 { SOLVER_DROP_ORPHANED, "droporphaned" },
47 { SOLVER_USERINSTALLED, "userinstalled" },
51 static struct jobflags2str {
55 { SOLVER_WEAK, "weak" },
56 { SOLVER_ESSENTIAL, "essential" },
57 { SOLVER_CLEANDEPS, "cleandeps" },
58 { SOLVER_ORUPDATE, "orupdate" },
59 { SOLVER_FORCEBEST, "forcebest" },
60 { SOLVER_TARGETED, "targeted" },
61 { SOLVER_SETEV, "setev" },
62 { SOLVER_SETEVR, "setevr" },
63 { SOLVER_SETARCH, "setarch" },
64 { SOLVER_SETVENDOR, "setvendor" },
65 { SOLVER_SETREPO, "setrepo" },
66 { SOLVER_NOAUTOSET, "noautoset" },
70 static struct resultflags2str {
73 } resultflags2str[] = {
74 { TESTCASE_RESULT_TRANSACTION, "transaction" },
75 { TESTCASE_RESULT_PROBLEMS, "problems" },
76 { TESTCASE_RESULT_ORPHANED, "orphaned" },
77 { TESTCASE_RESULT_RECOMMENDED, "recommended" },
78 { TESTCASE_RESULT_UNNEEDED, "unneeded" },
82 static struct solverflags2str {
86 } solverflags2str[] = {
87 { SOLVER_FLAG_ALLOW_DOWNGRADE, "allowdowngrade", 0 },
88 { SOLVER_FLAG_ALLOW_NAMECHANGE, "allownamechange", 1 },
89 { SOLVER_FLAG_ALLOW_ARCHCHANGE, "allowarchchange", 0 },
90 { SOLVER_FLAG_ALLOW_VENDORCHANGE, "allowvendorchange", 0 },
91 { SOLVER_FLAG_ALLOW_UNINSTALL, "allowuninstall", 0 },
92 { SOLVER_FLAG_NO_UPDATEPROVIDE, "noupdateprovide", 0 },
93 { SOLVER_FLAG_SPLITPROVIDES, "splitprovides", 0 },
94 { SOLVER_FLAG_IGNORE_RECOMMENDED, "ignorerecommended", 0 },
95 { SOLVER_FLAG_ADD_ALREADY_RECOMMENDED, "addalreadyrecommended", 0 },
96 { SOLVER_FLAG_NO_INFARCHCHECK, "noinfarchcheck", 0 },
97 { SOLVER_FLAG_KEEP_EXPLICIT_OBSOLETES, "keepexplicitobsoletes", 0 },
98 { SOLVER_FLAG_BEST_OBEY_POLICY, "bestobeypolicy", 0 },
99 { SOLVER_FLAG_NO_AUTOTARGET, "noautotarget", 0 },
103 static struct poolflags2str {
107 } poolflags2str[] = {
108 { POOL_FLAG_PROMOTEEPOCH, "promoteepoch", 0 },
109 { POOL_FLAG_FORBIDSELFCONFLICTS, "forbidselfconflicts", 0 },
110 { POOL_FLAG_OBSOLETEUSESPROVIDES, "obsoleteusesprovides", 0 },
111 { POOL_FLAG_IMPLICITOBSOLETEUSESPROVIDES, "implicitobsoleteusesprovides", 0 },
112 { POOL_FLAG_OBSOLETEUSESCOLORS, "obsoleteusescolors", 0 },
113 { POOL_FLAG_NOINSTALLEDOBSOLETES, "noinstalledobsoletes", 0 },
114 { POOL_FLAG_HAVEDISTEPOCH, "havedistepoch", 0 },
118 static struct disttype2str {
122 { DISTTYPE_RPM, "rpm" },
123 { DISTTYPE_DEB, "deb" },
124 { DISTTYPE_ARCH, "arch" },
128 static struct selflags2str {
132 { SELECTION_NAME, "name" },
133 { SELECTION_PROVIDES, "provides" },
134 { SELECTION_FILELIST, "filelist" },
135 { SELECTION_CANON, "canon" },
136 { SELECTION_DOTARCH, "dotarch" },
137 { SELECTION_REL, "rel" },
138 { SELECTION_INSTALLED_ONLY, "installedonly" },
139 { SELECTION_GLOB, "glob" },
140 { SELECTION_FLAT, "flat" },
141 { SELECTION_NOCASE, "nocase" },
142 { SELECTION_SOURCE_ONLY, "sourceonly" },
143 { SELECTION_WITH_SOURCE, "withsource" },
148 typedef struct strqueue {
153 #define STRQUEUE_BLOCK 63
156 strqueue_init(Strqueue *q)
163 strqueue_free(Strqueue *q)
166 for (i = 0; i < q->nstr; i++)
167 solv_free(q->str[i]);
168 q->str = solv_free(q->str);
173 strqueue_push(Strqueue *q, const char *s)
175 q->str = solv_extend(q->str, q->nstr, 1, sizeof(*q->str), STRQUEUE_BLOCK);
176 q->str[q->nstr++] = solv_strdup(s);
180 strqueue_pushjoin(Strqueue *q, const char *s1, const char *s2, const char *s3)
182 q->str = solv_extend(q->str, q->nstr, 1, sizeof(*q->str), STRQUEUE_BLOCK);
183 q->str[q->nstr++] = solv_dupjoin(s1, s2, s3);
187 strqueue_sort_cmp(const void *ap, const void *bp, void *dp)
189 const char *a = *(const char **)ap;
190 const char *b = *(const char **)bp;
191 return strcmp(a ? a : "", b ? b : "");
195 strqueue_sort(Strqueue *q)
198 solv_sort(q->str, q->nstr, sizeof(*q->str), strqueue_sort_cmp, 0);
202 strqueue_sort_u(Strqueue *q)
206 for (i = j = 0; i < q->nstr; i++)
207 if (!j || strqueue_sort_cmp(q->str + i, q->str + j - 1, 0) != 0)
208 q->str[j++] = q->str[i];
213 strqueue_join(Strqueue *q)
217 for (i = 0; i < q->nstr; i++)
219 l += strlen(q->str[i]) + 1;
220 l++; /* trailing \0 */
223 for (i = 0; i < q->nstr; i++)
226 strcpy(rp, q->str[i]);
235 strqueue_split(Strqueue *q, const char *s)
240 while ((p = strchr(s, '\n')) != 0)
242 q->str = solv_extend(q->str, q->nstr, 1, sizeof(*q->str), STRQUEUE_BLOCK);
243 q->str[q->nstr] = solv_malloc(p - s + 1);
245 memcpy(q->str[q->nstr], s, p - s);
246 q->str[q->nstr][p - s] = 0;
255 strqueue_diff(Strqueue *sq1, Strqueue *sq2, Strqueue *osq)
258 while (i < sq1->nstr && j < sq2->nstr)
260 int r = strqueue_sort_cmp(sq1->str + i, sq2->str + j, 0);
264 strqueue_pushjoin(osq, "-", sq1->str[i++], 0);
266 strqueue_pushjoin(osq, "+", sq2->str[j++], 0);
268 while (i < sq1->nstr)
269 strqueue_pushjoin(osq, "-", sq1->str[i++], 0);
270 while (j < sq2->nstr)
271 strqueue_pushjoin(osq, "+", sq2->str[j++], 0);
275 pool_isknownarch(Pool *pool, Id id)
277 if (!id || id == ID_EMPTY)
279 if (id == ARCH_SRC || id == ARCH_NOSRC || id == ARCH_NOARCH)
281 if (!pool->id2arch || (id > pool->lastarch || !pool->id2arch[id]))
287 testcase_str2dep(Pool *pool, char *s)
293 if ((n = strchr(s, '|')) != 0)
295 id = testcase_str2dep(pool, n + 1);
297 id = pool_rel2id(pool, testcase_str2dep(pool, s), id, REL_OR, 1);
301 while (*s == ' ' || *s == '\t')
304 while (*s && *s != ' ' && *s != '\t' && *s != '<' && *s != '=' && *s != '>')
308 while (*s && *s != ')')
314 if ((a = strchr(n, '.')) != 0 && a + 1 < s && s[-1] != ')')
316 Id archid = pool_strn2id(pool, a + 1, s - (a + 1), 0);
317 if (pool_isknownarch(pool, archid))
319 id = pool_strn2id(pool, n, a - n, 1);
320 id = pool_rel2id(pool, id, archid, REL_ARCH, 1);
323 id = pool_strn2id(pool, n, s - n, 1);
326 id = pool_strn2id(pool, n, s - n, 1);
329 while (*s == ' ' || *s == '\t')
345 while (*s == ' ' || *s == '\t')
348 while (*s && *s != ' ' && *s != '\t')
350 return pool_rel2id(pool, id, pool_strn2id(pool, n, s - n, 1), flags, 1);
354 testcase_repoid2str(Pool *pool, Id repoid)
356 Repo *repo = pool_id2repo(pool, repoid);
359 char *r = pool_tmpjoin(pool, repo->name, 0, 0);
361 for (rp = r; *rp; rp++)
362 if (*rp == ' ' || *rp == '\t')
369 sprintf(buf, "#%d", repoid);
370 return pool_tmpjoin(pool, buf, 0, 0);
375 testcase_solvid2str(Pool *pool, Id p)
377 Solvable *s = pool->solvables + p;
378 const char *n, *e, *a;
381 if (p == SYSTEMSOLVABLE)
383 n = pool_id2str(pool, s->name);
384 e = pool_id2str(pool, s->evr);
385 a = pool_id2str(pool, s->arch);
386 str = pool_alloctmpspace(pool, strlen(n) + strlen(e) + strlen(a) + 3);
387 sprintf(str, "%s-%s.%s", n, e, a);
389 return pool_tmpappend(pool, str, "@", 0);
393 char *str2 = pool_tmpappend(pool, str, "@", s->repo->name);
395 if (str2[l] == ' ' || str2[l] == '\t')
399 sprintf(buf, "@#%d", s->repo->repoid);
400 return pool_tmpappend(pool, str, buf, 0);
404 testcase_str2repo(Pool *pool, const char *str)
408 if (str[0] == '#' && (str[1] >= '0' && str[1] <= '9'))
412 for (j = 1; str[j] >= '0' && str[j] <= '9'; j++)
413 repoid = repoid * 10 + (str[j] - '0');
414 if (!str[j] && repoid > 0 && repoid < pool->nrepos)
415 repo = pool_id2repo(pool, repoid);
419 FOR_REPOS(repoid, repo)
424 l = strlen(repo->name);
425 for (i = 0; i < l; i++)
427 int c = repo->name[i];
428 if (c == ' ' || c == '\t')
433 if (i == l && !str[l])
436 if (repoid >= pool->nrepos)
443 testcase_str2solvid(Pool *pool, const char *str)
445 int i, l = strlen(str);
452 if (*str == '@' && !strcmp(str, "@SYSTEM"))
453 return SYSTEMSOLVABLE;
455 for (i = l - 1; i >= 0; i--)
456 if (str[i] == '@' && (repo = testcase_str2repo(pool, str + i + 1)) != 0)
461 /* now find the arch (if present) */
463 for (i = repostart - 1; i > 0; i--)
466 arch = pool_strn2id(pool, str + i + 1, repostart - (i + 1), 0);
471 /* now find the name */
472 for (i = repostart - 1; i > 0; i--)
476 Id nid, evrid, p, pp;
477 nid = pool_strn2id(pool, str, i, 0);
480 evrid = pool_strn2id(pool, str + i + 1, repostart - (i + 1), 0);
483 FOR_PROVIDES(p, pp, nid)
485 Solvable *s = pool->solvables + p;
486 if (s->name != nid || s->evr != evrid)
488 if (repo && s->repo != repo)
490 if (arch && s->arch != arch)
500 testcase_job2str(Pool *pool, Id how, Id what)
507 Id select = how & SOLVER_SELECTMASK;
509 for (i = 0; job2str[i].str; i++)
510 if ((how & SOLVER_JOBMASK) == job2str[i].job)
512 jobstr = job2str[i].str ? job2str[i].str : "unknown";
513 if (select == SOLVER_SOLVABLE)
516 pkgstr = testcase_solvid2str(pool, what);
518 else if (select == SOLVER_SOLVABLE_NAME)
521 pkgstr = pool_dep2str(pool, what);
523 else if (select == SOLVER_SOLVABLE_PROVIDES)
525 selstr = " provides ";
526 pkgstr = pool_dep2str(pool, what);
528 else if (select == SOLVER_SOLVABLE_ONE_OF)
533 while ((p = pool->whatprovidesdata[what++]) != 0)
535 const char *s = testcase_solvid2str(pool, p);
538 pkgstr = pool_tmpappend(pool, pkgstr, " ", s);
539 pool_freetmpspace(pool, s);
547 else if (select == SOLVER_SOLVABLE_REPO)
549 Repo *repo = pool_id2repo(pool, what);
554 sprintf(buf, "#%d", repo->repoid);
555 pkgstr = pool_tmpjoin(pool, buf, 0, 0);
558 pkgstr = pool_tmpjoin(pool, repo->name, 0, 0);
560 else if (select == SOLVER_SOLVABLE_ALL)
567 selstr = " unknown ";
570 ret = pool_tmpjoin(pool, jobstr, selstr, pkgstr);
572 ret = pool_tmpappend(pool, ret, " ", 0);
573 for (i = 0; jobflags2str[i].str; i++)
574 if ((how & jobflags2str[i].flag) != 0)
575 ret = pool_tmpappend(pool, ret, ",", jobflags2str[i].str);
581 ret = pool_tmpappend(pool, ret, "]", 0);
587 str2selflags(Pool *pool, char *s) /* modifies the string! */
592 char *se = strchr(s, ',');
595 for (i = 0; selflags2str[i].str; i++)
596 if (!strcmp(s, selflags2str[i].str))
598 selflags |= selflags2str[i].flag;
601 if (!selflags2str[i].str)
602 pool_debug(pool, SOLV_ERROR, "str2job: unknown selection flag '%s'\n", s);
609 str2jobflags(Pool *pool, char *s) /* modifies the string */
614 char *se = strchr(s, ',');
617 for (i = 0; jobflags2str[i].str; i++)
618 if (!strcmp(s, jobflags2str[i].str))
620 jobflags |= jobflags2str[i].flag;
623 if (!jobflags2str[i].str)
624 pool_debug(pool, SOLV_ERROR, "str2job: unknown job flag '%s'\n", s);
631 testcase_str2job(Pool *pool, const char *str, Id *whatp)
641 /* so we can patch it */
642 s = pool_tmpjoin(pool, str, 0, 0);
643 /* split it in pieces */
646 while (*s == ' ' || *s == '\t')
650 pieces = solv_extend(pieces, npieces, 1, sizeof(*pieces), 7);
651 pieces[npieces++] = s;
652 while (*s && *s != ' ' && *s != '\t')
659 pool_debug(pool, SOLV_ERROR, "str2job: bad line '%s'\n", str);
664 for (i = 0; job2str[i].str; i++)
665 if (!strcmp(pieces[0], job2str[i].str))
669 pool_debug(pool, SOLV_ERROR, "str2job: unknown job '%s'\n", str);
673 job = job2str[i].job;
677 char *flags = pieces[npieces - 1];
678 if (*flags == '[' && flags[strlen(flags) - 1] == ']')
682 flags[strlen(flags) - 1] = 0;
683 job |= str2jobflags(pool, flags);
686 if (!strcmp(pieces[1], "pkg"))
690 pool_debug(pool, SOLV_ERROR, "str2job: bad pkg selector in '%s'\n", str);
694 job |= SOLVER_SOLVABLE;
695 what = testcase_str2solvid(pool, pieces[2]);
698 pool_debug(pool, SOLV_ERROR, "str2job: unknown package '%s'\n", pieces[2]);
703 else if (!strcmp(pieces[1], "name") || !strcmp(pieces[1], "provides"))
705 /* join em again for dep2str... */
707 for (sp = pieces[2]; sp < pieces[npieces - 1]; sp++)
711 if (pieces[1][0] == 'p' && strncmp(pieces[2], "namespace:", 10) == 0)
713 char *spe = strchr(pieces[2], '(');
714 int l = strlen(pieces[2]);
715 if (spe && pieces[2][l - 1] == ')')
717 /* special namespace provides */
718 if (strcmp(spe, "(<NULL>)") != 0)
720 pieces[2][l - 1] = 0;
721 what = testcase_str2dep(pool, spe + 1);
722 pieces[2][l - 1] = ')';
724 what = pool_rel2id(pool, pool_strn2id(pool, pieces[2], spe - pieces[2], 1), what, REL_NAMESPACE, 1);
728 what = testcase_str2dep(pool, pieces[2]);
729 if (pieces[1][0] == 'n')
730 job |= SOLVER_SOLVABLE_NAME;
732 job |= SOLVER_SOLVABLE_PROVIDES;
734 else if (!strcmp(pieces[1], "oneof"))
737 job |= SOLVER_SOLVABLE_ONE_OF;
739 if (npieces > 3 && strcmp(pieces[2], "nothing") != 0)
741 for (i = 2; i < npieces; i++)
743 Id p = testcase_str2solvid(pool, pieces[i]);
746 pool_debug(pool, SOLV_ERROR, "str2job: unknown package '%s'\n", pieces[i]);
754 what = pool_queuetowhatprovides(pool, &q);
757 else if (!strcmp(pieces[1], "repo"))
762 pool_debug(pool, SOLV_ERROR, "str2job: bad line '%s'\n", str);
766 repo = testcase_str2repo(pool, pieces[2]);
769 pool_debug(pool, SOLV_ERROR, "str2job: unknown repo '%s'\n", pieces[2]);
773 job |= SOLVER_SOLVABLE_REPO;
776 else if (!strcmp(pieces[1], "all"))
778 if (npieces != 3 && strcmp(pieces[2], "packages") != 0)
780 pool_debug(pool, SOLV_ERROR, "str2job: bad line '%s'\n", str);
784 job |= SOLVER_SOLVABLE_ALL;
789 pool_debug(pool, SOLV_ERROR, "str2job: unknown selection in '%s'\n", str);
799 addselectionjob(Pool *pool, char **pieces, int npieces, Queue *jobqueue)
806 for (i = 0; job2str[i].str; i++)
807 if (!strcmp(pieces[0], job2str[i].str))
811 pool_debug(pool, SOLV_ERROR, "selstr2job: unknown job '%s'\n", pieces[0]);
814 job = job2str[i].job;
817 char *flags = pieces[npieces - 1];
818 if (*flags == '[' && flags[strlen(flags) - 1] == ']')
822 flags[strlen(flags) - 1] = 0;
823 job |= str2jobflags(pool, flags);
828 pool_debug(pool, SOLV_ERROR, "selstr2job: no selection flags\n");
831 selflags = str2selflags(pool, pieces[3]);
833 r = selection_make(pool, &sel, pieces[2], selflags);
834 for (i = 0; i < sel.count; i += 2)
835 queue_push2(jobqueue, job | sel.elements[i], sel.elements[i + 1]);
841 writedeps(Repo *repo, FILE *fp, const char *tag, Id key, Solvable *s, Offset off)
843 Pool *pool = repo->pool;
850 dp = repo->idarraydata + off;
852 while ((id = *dp++) != 0)
854 if (key == SOLVABLE_REQUIRES && id == SOLVABLE_PREREQMARKER)
857 fprintf(fp, "-%s\n", tag);
862 if (key == SOLVABLE_PROVIDES && id == SOLVABLE_FILEMARKER)
867 idstr = pool_dep2str(pool, id);
870 Reldep *rd = GETRELDEP(pool, id);
871 if (key == SOLVABLE_CONFLICTS && rd->flags == REL_NAMESPACE && rd->name == NAMESPACE_OTHERPROVIDERS)
873 if (!strncmp(idstr, "namespace:", 10))
876 if (key == SOLVABLE_SUPPLEMENTS)
878 if (rd->flags == REL_NAMESPACE && rd->name == NAMESPACE_FILESYSTEM)
880 if (!strncmp(idstr, "namespace:", 10))
883 else if (rd->flags == REL_NAMESPACE && rd->name == NAMESPACE_MODALIAS)
885 if (!strncmp(idstr, "namespace:", 10))
888 else if (rd->flags == REL_AND)
890 /* either packageand chain or modalias */
892 if (ISRELDEP(rd->evr))
894 Reldep *mrd = GETRELDEP(pool, rd->evr);
895 if (mrd->flags == REL_NAMESPACE && mrd->name == NAMESPACE_MODALIAS)
897 idstr = pool_tmpjoin(pool, "modalias(", pool_dep2str(pool, rd->name), ":");
898 idstr = pool_tmpappend(pool, idstr, pool_dep2str(pool, mrd->evr), ")");
900 else if (mrd->flags >= 8)
905 /* must be and chain */
906 idstr = pool_dep2str(pool, rd->evr);
912 rd = GETRELDEP(pool, id);
913 if (rd->flags != REL_AND)
915 idstr = pool_tmpjoin(pool, pool_dep2str(pool, rd->evr), ":", idstr);
917 idstr = pool_tmpjoin(pool, pool_dep2str(pool, id), ":", idstr);
918 idstr = pool_tmpjoin(pool, "packageand(", idstr, ")");
921 else if (rd->flags >= 8)
927 fprintf(fp, "+%s\n", tag);
930 fprintf(fp, "%s\n", idstr);
932 if (key == SOLVABLE_PROVIDES)
934 /* add the filelist */
936 dataiterator_init(&di, pool, repo, s - pool->solvables, SOLVABLE_FILELIST, 0, 0);
937 while (dataiterator_step(&di))
939 const char *s = repodata_dir2str(di.data, di.kv.id, di.kv.str);
942 Id id = pool_str2id(pool, s, 0);
945 for (dp = prvdp; *dp; dp++)
949 continue; /* already included */
954 fprintf(fp, "+%s", tag);
957 fprintf(fp, "%s\n", s);
961 fprintf(fp, "-%s\n", tag);
965 testcase_write_testtags(Repo *repo, FILE *fp)
967 Pool *pool = repo->pool;
977 fprintf(fp, "=Ver: 2.0\n");
978 FOR_REPO_SOLVABLES(repo, p, s)
980 name = pool_id2str(pool, s->name);
981 evr = pool_id2str(pool, s->evr);
982 arch = pool_id2str(pool, s->arch);
983 release = strrchr(evr, '-');
984 /* haikus releases start numeric */
985 if (release && pool->disttype == DISTTYPE_HAIKU && (release[1] < '0' || release[1] > '9'))
986 release = evr + strlen(evr);
988 release = evr + strlen(evr);
989 fprintf(fp, "=Pkg: %s %.*s %s %s\n", name, (int)(release - evr), evr, *release && release[1] ? release + 1 : "-", arch);
990 tmp = solvable_lookup_str(s, SOLVABLE_SUMMARY);
992 fprintf(fp, "=Sum: %s\n", tmp);
993 writedeps(repo, fp, "Req:", SOLVABLE_REQUIRES, s, s->requires);
994 writedeps(repo, fp, "Prv:", SOLVABLE_PROVIDES, s, s->provides);
995 writedeps(repo, fp, "Obs:", SOLVABLE_OBSOLETES, s, s->obsoletes);
996 writedeps(repo, fp, "Con:", SOLVABLE_CONFLICTS, s, s->conflicts);
997 writedeps(repo, fp, "Rec:", SOLVABLE_RECOMMENDS, s, s->recommends);
998 writedeps(repo, fp, "Sup:", SOLVABLE_SUPPLEMENTS, s, s->supplements);
999 writedeps(repo, fp, "Sug:", SOLVABLE_SUGGESTS, s, s->suggests);
1000 writedeps(repo, fp, "Enh:", SOLVABLE_ENHANCES, s, s->enhances);
1002 fprintf(fp, "=Vnd: %s\n", pool_id2str(pool, s->vendor));
1003 ti = solvable_lookup_num(s, SOLVABLE_BUILDTIME, 0);
1005 fprintf(fp, "=Tim: %u\n", ti);
1010 static inline Offset
1011 adddep(Repo *repo, Offset olddeps, char *str, Id marker)
1013 Id id = *str == '/' ? pool_str2id(repo->pool, str, 1) : testcase_str2dep(repo->pool, str);
1014 return repo_addid_dep(repo, olddeps, id, marker);
1018 finish_solvable(Pool *pool, Repodata *data, Solvable *s, char *filelist, int nfilelist)
1024 for (l = 0; l < nfilelist; l += strlen(filelist + l) + 1)
1026 char *p = strrchr(filelist + l, '/');
1030 did = repodata_str2dir(data, filelist + l, 1);
1033 did = repodata_str2dir(data, "/", 1);
1034 repodata_add_dirstr(data, s - pool->solvables, SOLVABLE_FILELIST, did, p);
1037 if (s->name && s->arch != ARCH_SRC && s->arch != ARCH_NOSRC)
1038 s->provides = repo_addid_dep(s->repo, s->provides, pool_rel2id(pool, s->name, s->evr, REL_EQ, 1), 0);
1039 s->supplements = repo_fix_supplements(s->repo, s->provides, s->supplements, 0);
1040 s->conflicts = repo_fix_conflicts(s->repo, s->conflicts);
1043 /* stripped down version of susetags parser used for testcases */
1045 testcase_add_testtags(Repo *repo, FILE *fp, int flags)
1047 Pool *pool = repo->pool;
1060 data = repo_add_repodata(repo, flags);
1065 line = solv_malloc(aline);
1069 if (linep - line + 16 > aline)
1071 aline = linep - line;
1072 line = solv_realloc(line, aline + 512);
1073 linep = line + aline;
1076 if (!fgets(linep, aline - (linep - line), fp))
1078 linep += strlen(linep);
1079 if (linep == line || linep[-1] != '\n')
1082 linep = line + intag;
1085 if (line[intag] == '-' && !strncmp(line + 1, line + intag + 1, intag - 2))
1092 else if (line[0] == '+' && line[1] && line[1] != ':')
1094 char *tagend = strchr(line, ':');
1099 intag = tagend + 2 - line;
1100 linep = line + intag;
1103 if (*line != '=' || !line[1] || !line[2] || !line[3] || line[4] != ':')
1105 tag = line[1] << 16 | line[2] << 8 | line[3];
1108 case 'P' << 16 | 'k' << 8 | 'g':
1110 finish_solvable(pool, data, s, filelist, nfilelist);
1112 if (split(line + 5, sp, 5) != 4)
1114 s = pool_id2solvable(pool, repo_add_solvable(repo));
1115 s->name = pool_str2id(pool, sp[0], 1);
1116 /* join back version and release */
1117 if (sp[2] && !(sp[2][0] == '-' && !sp[2][1]))
1119 s->evr = makeevr(pool, sp[1]);
1120 s->arch = pool_str2id(pool, sp[3], 1);
1122 case 'S' << 16 | 'u' << 8 | 'm':
1123 repodata_set_str(data, s - pool->solvables, SOLVABLE_SUMMARY, line + 6);
1125 case 'V' << 16 | 'n' << 8 | 'd':
1126 s->vendor = pool_str2id(pool, line + 6, 1);
1128 case 'T' << 16 | 'i' << 8 | 'm':
1131 repodata_set_num(data, s - pool->solvables, SOLVABLE_BUILDTIME, t);
1133 case 'R' << 16 | 'e' << 8 | 'q':
1134 s->requires = adddep(repo, s->requires, line + 6, -SOLVABLE_PREREQMARKER);
1136 case 'P' << 16 | 'r' << 8 | 'q':
1137 s->requires = adddep(repo, s->requires, line + 6, SOLVABLE_PREREQMARKER);
1139 case 'P' << 16 | 'r' << 8 | 'v':
1142 int l = strlen(line + 6) + 1;
1143 if (nfilelist + l > afilelist)
1145 afilelist = nfilelist + l + 512;
1146 filelist = solv_realloc(filelist, afilelist);
1148 memcpy(filelist + nfilelist, line + 6, l);
1155 for (l = 0; l < nfilelist; l += strlen(filelist + l) + 1)
1156 s->provides = repo_addid_dep(repo, s->provides, pool_str2id(pool, filelist + l, 1), 0);
1159 s->provides = adddep(repo, s->provides, line + 6, 0);
1161 case 'O' << 16 | 'b' << 8 | 's':
1162 s->obsoletes = adddep(repo, s->obsoletes, line + 6, 0);
1164 case 'C' << 16 | 'o' << 8 | 'n':
1165 s->conflicts = adddep(repo, s->conflicts, line + 6, 0);
1167 case 'R' << 16 | 'e' << 8 | 'c':
1168 s->recommends = adddep(repo, s->recommends, line + 6, 0);
1170 case 'S' << 16 | 'u' << 8 | 'p':
1171 s->supplements = adddep(repo, s->supplements, line + 6, 0);
1173 case 'S' << 16 | 'u' << 8 | 'g':
1174 s->suggests = adddep(repo, s->suggests, line + 6, 0);
1176 case 'E' << 16 | 'n' << 8 | 'h':
1177 s->enhances = adddep(repo, s->enhances, line + 6, 0);
1184 finish_solvable(pool, data, s, filelist, nfilelist);
1186 solv_free(filelist);
1187 repodata_free_dircache(data);
1188 if (!(flags & REPO_NO_INTERNALIZE))
1189 repodata_internalize(data);
1194 testcase_getpoolflags(Pool *pool)
1196 const char *str = 0;
1198 for (i = 0; poolflags2str[i].str; i++)
1200 v = pool_get_flag(pool, poolflags2str[i].flag);
1201 if (v == poolflags2str[i].def)
1203 str = pool_tmpappend(pool, str, v ? " " : " !", poolflags2str[i].str);
1205 return str ? str + 1 : "";
1209 testcase_setpoolflags(Pool *pool, const char *str)
1211 const char *p = str, *s;
1215 while (*p == ' ' || *p == '\t' || *p == ',')
1226 while (*p && *p != ' ' && *p != '\t' && *p != ',')
1228 for (i = 0; poolflags2str[i].str; i++)
1229 if (!strncmp(poolflags2str[i].str, s, p - s) && poolflags2str[i].str[p - s] == 0)
1231 if (!poolflags2str[i].str)
1233 pool_debug(pool, SOLV_ERROR, "setpoolflags: unknown flag '%.*s'\n", (int)(p - s), s);
1236 pool_set_flag(pool, poolflags2str[i].flag, v);
1242 testcase_resetpoolflags(Pool *pool)
1245 for (i = 0; poolflags2str[i].str; i++)
1246 pool_set_flag(pool, poolflags2str[i].flag, poolflags2str[i].def);
1250 testcase_getsolverflags(Solver *solv)
1252 Pool *pool = solv->pool;
1253 const char *str = 0;
1255 for (i = 0; solverflags2str[i].str; i++)
1257 v = solver_get_flag(solv, solverflags2str[i].flag);
1258 if (v == solverflags2str[i].def)
1260 str = pool_tmpappend(pool, str, v ? " " : " !", solverflags2str[i].str);
1262 return str ? str + 1 : "";
1266 testcase_setsolverflags(Solver *solv, const char *str)
1268 const char *p = str, *s;
1272 while (*p == ' ' || *p == '\t' || *p == ',')
1283 while (*p && *p != ' ' && *p != '\t' && *p != ',')
1285 for (i = 0; solverflags2str[i].str; i++)
1286 if (!strncmp(solverflags2str[i].str, s, p - s) && solverflags2str[i].str[p - s] == 0)
1288 if (!solverflags2str[i].str)
1290 pool_debug(solv->pool, SOLV_ERROR, "setsolverflags: unknown flag '%.*s'\n", (int)(p - s), s);
1293 solver_set_flag(solv, solverflags2str[i].flag, v);
1299 testcase_resetsolverflags(Solver *solv)
1302 for (i = 0; solverflags2str[i].str; i++)
1303 solver_set_flag(solv, solverflags2str[i].flag, solverflags2str[i].def);
1307 testcase_ruleid(Solver *solv, Id rid)
1313 const unsigned char *md5;
1319 solver_ruleliterals(solv, rid, &q);
1320 for (i = 0; i < q.count; i++)
1322 Id p = q.elements[i];
1323 s = testcase_solvid2str(solv->pool, p > 0 ? p : -p);
1325 s = pool_tmpjoin(solv->pool, "!", s, 0);
1326 strqueue_push(&sq, s);
1329 strqueue_sort_u(&sq);
1330 chk = solv_chksum_create(REPOKEY_TYPE_MD5);
1331 for (i = 0; i < sq.nstr; i++)
1332 solv_chksum_add(chk, sq.str[i], strlen(sq.str[i]) + 1);
1333 md5 = solv_chksum_get(chk, &md5l);
1334 s = pool_bin2hex(solv->pool, md5, md5l);
1335 chk = solv_chksum_free(chk, 0);
1341 testcase_problemid(Solver *solv, Id problem)
1346 const unsigned char *md5;
1350 /* we build a hash of all rules that define the problem */
1353 solver_findallproblemrules(solv, problem, &q);
1354 for (i = 0; i < q.count; i++)
1355 strqueue_push(&sq, testcase_ruleid(solv, q.elements[i]));
1357 strqueue_sort_u(&sq);
1358 chk = solv_chksum_create(REPOKEY_TYPE_MD5);
1359 for (i = 0; i < sq.nstr; i++)
1360 solv_chksum_add(chk, sq.str[i], strlen(sq.str[i]) + 1);
1361 md5 = solv_chksum_get(chk, &md5l);
1362 s = pool_bin2hex(solv->pool, md5, 4);
1363 chk = solv_chksum_free(chk, 0);
1369 testcase_solutionid(Solver *solv, Id problem, Id solution)
1373 const unsigned char *md5;
1377 intid = solver_solutionelement_internalid(solv, problem, solution);
1378 /* internal stuff! handle with care! */
1382 s = testcase_job2str(solv->pool, solv->job.elements[-intid - 1], solv->job.elements[-intid]);
1387 s = testcase_ruleid(solv, intid);
1389 chk = solv_chksum_create(REPOKEY_TYPE_MD5);
1390 solv_chksum_add(chk, s, strlen(s) + 1);
1391 md5 = solv_chksum_get(chk, &md5l);
1392 s = pool_bin2hex(solv->pool, md5, 4);
1393 chk = solv_chksum_free(chk, 0);
1397 static struct class2str {
1401 { SOLVER_TRANSACTION_ERASE, "erase" },
1402 { SOLVER_TRANSACTION_INSTALL, "install" },
1403 { SOLVER_TRANSACTION_REINSTALLED, "reinstall" },
1404 { SOLVER_TRANSACTION_DOWNGRADED, "downgrade" },
1405 { SOLVER_TRANSACTION_CHANGED, "change" },
1406 { SOLVER_TRANSACTION_UPGRADED, "upgrade" },
1407 { SOLVER_TRANSACTION_OBSOLETED, "obsolete" },
1408 { SOLVER_TRANSACTION_MULTIINSTALL, "multiinstall" },
1409 { SOLVER_TRANSACTION_MULTIREINSTALL, "multireinstall" },
1414 testcase_solverresult(Solver *solv, int resultflags)
1416 Pool *pool = solv->pool;
1424 if ((resultflags & TESTCASE_RESULT_TRANSACTION) != 0)
1426 Transaction *trans = solver_create_transaction(solv);
1430 for (i = 0; class2str[i].str; i++)
1433 transaction_classify_pkgs(trans, SOLVER_TRANSACTION_KEEP_PSEUDO, class2str[i].class, 0, 0, &q);
1434 for (j = 0; j < q.count; j++)
1438 if (pool->installed && pool->solvables[p].repo == pool->installed)
1439 op = transaction_obs_pkg(trans, p);
1440 s = pool_tmpjoin(pool, class2str[i].str, " ", testcase_solvid2str(pool, p));
1442 s = pool_tmpjoin(pool, s, " ", testcase_solvid2str(pool, op));
1443 strqueue_push(&sq, s);
1447 transaction_free(trans);
1449 if ((resultflags & TESTCASE_RESULT_PROBLEMS) != 0)
1451 char *probprefix, *solprefix;
1452 int problem, solution, element;
1455 pcnt = solver_problem_count(solv);
1456 for (problem = 1; problem <= pcnt; problem++)
1458 Id rid, from, to, dep;
1459 SolverRuleinfo rinfo;
1460 rid = solver_findproblemrule(solv, problem);
1461 s = testcase_problemid(solv, problem);
1462 probprefix = solv_dupjoin("problem ", s, 0);
1463 rinfo = solver_ruleinfo(solv, rid, &from, &to, &dep);
1464 s = pool_tmpjoin(pool, probprefix, " info ", solver_problemruleinfo2str(solv, rinfo, from, to, dep));
1465 strqueue_push(&sq, s);
1466 scnt = solver_solution_count(solv, problem);
1467 for (solution = 1; solution <= scnt; solution++)
1469 s = testcase_solutionid(solv, problem, solution);
1470 solprefix = solv_dupjoin(probprefix, " solution ", s);
1472 while ((element = solver_next_solutionelement(solv, problem, solution, element, &p, &op)) != 0)
1474 if (p == SOLVER_SOLUTION_JOB)
1475 s = pool_tmpjoin(pool, solprefix, " deljob ", testcase_job2str(pool, solv->job.elements[op - 1], solv->job.elements[op]));
1476 else if (p > 0 && op == 0)
1477 s = pool_tmpjoin(pool, solprefix, " erase ", testcase_solvid2str(pool, p));
1478 else if (p > 0 && op > 0)
1480 s = pool_tmpjoin(pool, solprefix, " replace ", testcase_solvid2str(pool, p));
1481 s = pool_tmpappend(pool, s, " ", testcase_solvid2str(pool, op));
1483 else if (p < 0 && op > 0)
1484 s = pool_tmpjoin(pool, solprefix, " allow ", testcase_solvid2str(pool, op));
1486 s = pool_tmpjoin(pool, solprefix, " unknown", 0);
1487 strqueue_push(&sq, s);
1489 solv_free(solprefix);
1491 solv_free(probprefix);
1495 if ((resultflags & TESTCASE_RESULT_ORPHANED) != 0)
1500 solver_get_orphaned(solv, &q);
1501 for (i = 0; i < q.count; i++)
1503 s = pool_tmpjoin(pool, "orphaned ", testcase_solvid2str(pool, q.elements[i]), 0);
1504 strqueue_push(&sq, s);
1509 if ((resultflags & TESTCASE_RESULT_RECOMMENDED) != 0)
1515 solver_get_recommendations(solv, &qr, &qs, 0);
1516 for (i = 0; i < qr.count; i++)
1518 s = pool_tmpjoin(pool, "recommended ", testcase_solvid2str(pool, qr.elements[i]), 0);
1519 strqueue_push(&sq, s);
1521 for (i = 0; i < qs.count; i++)
1523 s = pool_tmpjoin(pool, "suggested ", testcase_solvid2str(pool, qs.elements[i]), 0);
1524 strqueue_push(&sq, s);
1530 if ((resultflags & TESTCASE_RESULT_UNNEEDED) != 0)
1535 solver_get_unneeded(solv, &q, 0);
1536 for (i = 0; i < q.count; i++)
1538 s = pool_tmpjoin(pool, "unneeded ", testcase_solvid2str(pool, q.elements[i]), 0);
1539 strqueue_push(&sq, s);
1545 result = strqueue_join(&sq);
1552 testcase_write(Solver *solv, char *dir, int resultflags, const char *testcasename, const char *resultname)
1554 Pool *pool = solv->pool;
1565 testcasename = "testcase.t";
1567 resultname = "solver.result";
1569 if (mkdir(dir, 0777) && errno != EEXIST)
1571 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: could not create directory '%s'\n", dir);
1575 FOR_REPOS(repoid, repo)
1577 const char *name = testcase_repoid2str(pool, repoid);
1579 if (repo->subpriority)
1580 sprintf(priobuf, "%d.%d", repo->priority, repo->subpriority);
1582 sprintf(priobuf, "%d", repo->priority);
1583 out = pool_tmpjoin(pool, name, ".repo", ".gz");
1584 cmd = pool_tmpjoin(pool, "repo ", name, " ");
1585 cmd = pool_tmpappend(pool, cmd, priobuf, " ");
1586 cmd = pool_tmpappend(pool, cmd, "testtags ", out);
1587 strqueue_push(&sq, cmd);
1588 out = pool_tmpjoin(pool, dir, "/", out);
1589 if (!(fp = solv_xfopen(out, "w")))
1591 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: could not open '%s' for writing\n", out);
1595 testcase_write_testtags(repo, fp);
1598 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: write error\n");
1603 /* hmm, this is not optimal... we currently search for the lowest score */
1605 arch = pool->solvables[SYSTEMSOLVABLE].arch;
1606 for (i = 0; i < pool->lastarch; i++)
1608 if (pool->id2arch[i] == 1 && !lowscore)
1610 if (pool->id2arch[i] > 0x10000 && (!lowscore || pool->id2arch[i] < lowscore))
1613 lowscore = pool->id2arch[i];
1616 cmd = pool_tmpjoin(pool, "system ", pool->lastarch ? pool_id2str(pool, arch) : "unset", 0);
1617 for (i = 0; disttype2str[i].str != 0; i++)
1618 if (pool->disttype == disttype2str[i].type)
1620 pool_tmpappend(pool, cmd, " ", disttype2str[i].str ? disttype2str[i].str : "unknown");
1621 if (pool->installed)
1622 cmd = pool_tmpappend(pool, cmd, " ", testcase_repoid2str(pool, pool->installed->repoid));
1623 strqueue_push(&sq, cmd);
1624 s = testcase_getpoolflags(solv->pool);
1627 cmd = pool_tmpjoin(pool, "poolflags ", s, 0);
1628 strqueue_push(&sq, cmd);
1631 if (pool->vendorclasses)
1634 for (i = 0; pool->vendorclasses[i]; i++)
1636 cmd = pool_tmpappend(pool, cmd ? cmd : "vendorclass", " ", pool->vendorclasses[i]);
1637 if (!pool->vendorclasses[i + 1])
1639 strqueue_push(&sq, cmd);
1646 s = testcase_getsolverflags(solv);
1649 cmd = pool_tmpjoin(pool, "solverflags ", s, 0);
1650 strqueue_push(&sq, cmd);
1653 /* now dump all the ns callback values we know */
1654 if (pool->nscallback)
1658 for (rid = 1; rid < pool->nrels; rid++)
1660 Reldep *rd = pool->rels + rid;
1661 if (rd->flags != REL_NAMESPACE || rd->name == NAMESPACE_OTHERPROVIDERS)
1663 /* evaluate all namespace ids, skip empty results */
1664 d = pool_whatprovides(pool, MAKERELDEP(rid));
1665 if (!d || !pool->whatprovidesdata[d])
1667 cmd = pool_tmpjoin(pool, "namespace ", pool_id2str(pool, rd->name), "(");
1668 cmd = pool_tmpappend(pool, cmd, pool_id2str(pool, rd->evr), ")");
1669 for (; pool->whatprovidesdata[d]; d++)
1670 cmd = pool_tmpappend(pool, cmd, " ", testcase_solvid2str(pool, pool->whatprovidesdata[d]));
1671 strqueue_push(&sq, cmd);
1675 for (i = 0; i < solv->job.count; i += 2)
1677 cmd = (char *)testcase_job2str(pool, solv->job.elements[i], solv->job.elements[i + 1]);
1678 cmd = pool_tmpjoin(pool, "job ", cmd, 0);
1679 strqueue_push(&sq, cmd);
1686 for (i = 0; resultflags2str[i].str; i++)
1687 if ((resultflags & resultflags2str[i].flag) != 0)
1688 cmd = pool_tmpappend(pool, cmd, cmd ? "," : 0, resultflags2str[i].str);
1689 cmd = pool_tmpjoin(pool, "result ", cmd ? cmd : "?", 0);
1690 cmd = pool_tmpappend(pool, cmd, " ", resultname);
1691 strqueue_push(&sq, cmd);
1692 result = testcase_solverresult(solv, resultflags);
1693 if (!strcmp(resultname, "<inline>"))
1697 strqueue_init(&rsq);
1698 strqueue_split(&rsq, result);
1699 for (i = 0; i < rsq.nstr; i++)
1701 cmd = pool_tmpjoin(pool, "#>", rsq.str[i], 0);
1702 strqueue_push(&sq, cmd);
1704 strqueue_free(&rsq);
1708 out = pool_tmpjoin(pool, dir, "/", resultname);
1709 if (!(fp = fopen(out, "w")))
1711 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: could not open '%s' for writing\n", out);
1716 if (result && *result && fwrite(result, strlen(result), 1, fp) != 1)
1718 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: write error\n");
1725 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: write error\n");
1733 cmd = strqueue_join(&sq);
1734 out = pool_tmpjoin(pool, dir, "/", testcasename);
1735 if (!(fp = fopen(out, "w")))
1737 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: could not open '%s' for writing\n", out);
1741 if (*cmd && fwrite(cmd, strlen(cmd), 1, fp) != 1)
1743 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: write error\n");
1749 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: write error\n");
1759 read_inline_file(FILE *fp, char **bufp, char **bufpp, int *buflp)
1761 char *result = solv_malloc(1024);
1768 if (rp - result + 256 >= resultl)
1770 resultl = rp - result;
1771 result = solv_realloc(result, resultl + 1024);
1772 rp = result + resultl;
1775 if (!fgets(rp, resultl - (rp - result), fp))
1778 if (rl && (rp == result || rp[-1] == '\n'))
1780 if (rl > 1 && rp[0] == '#' && rp[1] == '>')
1782 memmove(rp, rp + 2, rl - 2);
1787 while (rl + 16 > *buflp)
1789 *bufp = solv_realloc(*bufp, *buflp + 512);
1792 memmove(*bufp, rp, rl);
1793 if ((*bufp)[rl - 1] == '\n')
1799 (*bufpp) = *bufp + rl;
1816 char *result = solv_malloc(1024);
1823 if (rp - result + 256 >= resultl)
1825 resultl = rp - result;
1826 result = solv_realloc(result, resultl + 1024);
1827 rp = result + resultl;
1830 rl = fread(rp, 1, resultl - (rp - result), fp);
1842 str2resultflags(Pool *pool, char *s) /* modifies the string! */
1844 int i, resultflags = 0;
1847 char *se = strchr(s, ',');
1850 for (i = 0; resultflags2str[i].str; i++)
1851 if (!strcmp(s, resultflags2str[i].str))
1853 resultflags |= resultflags2str[i].flag;
1856 if (!resultflags2str[i].str)
1857 pool_debug(pool, SOLV_ERROR, "result: unknown flag '%s'\n", s);
1864 testcase_read(Pool *pool, FILE *fp, char *testcase, Queue *job, char **resultp, int *resultflagsp)
1869 char *testcasedir, *s;
1875 int poolflagsreset = 0;
1877 if (!fp && !(fp = fopen(testcase, "r")))
1879 pool_debug(pool, SOLV_ERROR, "testcase_read: could not open '%s'\n", testcase);
1882 testcasedir = solv_strdup(testcase);
1883 if ((s = strrchr(testcasedir, '/')) != 0)
1888 buf = solv_malloc(bufl);
1893 if (bufp - buf + 16 > bufl)
1896 buf = solv_realloc(buf, bufl + 512);
1900 if (!fgets(bufp, bufl - (bufp - buf), fp))
1904 if (!l || buf[l - 1] != '\n')
1911 while (*s && (*s == ' ' || *s == '\t'))
1913 if (!*s || *s == '#')
1916 /* split it in pieces */
1919 while (*s == ' ' || *s == '\t')
1923 pieces = solv_extend(pieces, npieces, 1, sizeof(*pieces), 7);
1924 pieces[npieces++] = s;
1925 while (*s && *s != ' ' && *s != '\t')
1930 pieces = solv_extend(pieces, npieces, 1, sizeof(*pieces), 7);
1931 pieces[npieces] = 0;
1932 if (!strcmp(pieces[0], "repo") && npieces >= 4)
1934 Repo *repo = repo_create(pool, pieces[1]);
1940 if (!poolflagsreset)
1943 testcase_resetpoolflags(pool); /* hmm */
1945 if (sscanf(pieces[2], "%d.%d", &prio, &subprio) != 2)
1948 prio = atoi(pieces[2]);
1950 repo->priority = prio;
1951 repo->subpriority = subprio;
1952 if (strcmp(pieces[3], "empty") != 0)
1954 const char *repotype = pool_tmpjoin(pool, pieces[3], 0, 0); /* gets overwritten in <inline> case */
1955 if (!strcmp(pieces[4], "<inline>"))
1957 char *idata = read_inline_file(fp, &buf, &bufp, &bufl);
1959 rfp = solv_xfopen_buf(rdata, &idata, 0, "rf");
1963 rdata = pool_tmpjoin(pool, testcasedir, pieces[4], 0);
1964 rfp = solv_xfopen(rdata, "r");
1968 pool_debug(pool, SOLV_ERROR, "testcase_read: could not open '%s'\n", rdata);
1970 else if (!strcmp(repotype, "testtags"))
1972 testcase_add_testtags(repo, rfp, 0);
1975 else if (!strcmp(repotype, "solv"))
1977 repo_add_solv(repo, rfp, 0);
1981 else if (!strcmp(repotype, "helix"))
1983 repo_add_helix(repo, rfp, 0);
1990 pool_debug(pool, SOLV_ERROR, "testcase_read: unknown repo type for repo '%s'\n", repo->name);
1994 else if (!strcmp(pieces[0], "system") && npieces >= 3)
1998 /* must set the disttype before the arch */
1999 for (i = 0; disttype2str[i].str != 0; i++)
2000 if (!strcmp(disttype2str[i].str, pieces[2]))
2002 if (!disttype2str[i].str)
2003 pool_debug(pool, SOLV_ERROR, "testcase_read: system: unknown disttype '%s'\n", pieces[2]);
2004 else if (pool->disttype != disttype2str[i].type)
2006 #ifdef MULTI_SEMANTICS
2007 pool_setdisttype(pool, disttype2str[i].type);
2009 pool_debug(pool, SOLV_ERROR, "testcase_read: system: cannot change disttype to '%s'\n", pieces[2]);
2012 if (strcmp(pieces[1], "unset") != 0)
2013 pool_setarch(pool, pieces[1]);
2015 pool_setarch(pool, 0);
2018 Repo *repo = testcase_str2repo(pool, pieces[3]);
2020 pool_debug(pool, SOLV_ERROR, "testcase_read: system: unknown repo '%s'\n", pieces[3]);
2022 pool_set_installed(pool, repo);
2025 else if (!strcmp(pieces[0], "job") && npieces > 1)
2031 pool_addfileprovides(pool);
2032 pool_createwhatprovides(pool);
2035 if (npieces >= 3 && !strcmp(pieces[2], "selection"))
2037 addselectionjob(pool, pieces + 1, npieces - 1, job);
2041 for (sp = pieces[1]; sp < pieces[npieces - 1]; sp++)
2044 how = testcase_str2job(pool, pieces[1], &what);
2045 if (how >= 0 && job)
2046 queue_push2(job, how, what);
2048 else if (!strcmp(pieces[0], "vendorclass") && npieces > 1)
2050 pool_addvendorclass(pool, (const char **)(pieces + 1));
2052 else if (!strcmp(pieces[0], "namespace") && npieces > 1)
2054 int i = strlen(pieces[1]);
2055 s = strchr(pieces[1], '(');
2056 if (!s && pieces[1][i - 1] != ')')
2058 pool_debug(pool, SOLV_ERROR, "testcase_read: bad namespace '%s'\n", pieces[1]);
2066 pieces[1][i - 1] = 0;
2067 name = pool_str2id(pool, pieces[1], 1);
2068 evr = pool_str2id(pool, s + 1, 1);
2070 pieces[1][i - 1] = ')';
2071 id = pool_rel2id(pool, name, evr, REL_NAMESPACE, 1);
2072 for (i = 2; i < npieces; i++)
2073 queue_push(&q, testcase_str2solvid(pool, pieces[i]));
2074 /* now do the callback */
2077 pool_addfileprovides(pool);
2078 pool_createwhatprovides(pool);
2081 pool->whatprovides_rel[GETRELID(id)] = pool_queuetowhatprovides(pool, &q);
2085 else if (!strcmp(pieces[0], "poolflags"))
2088 if (!poolflagsreset)
2091 testcase_resetpoolflags(pool); /* hmm */
2093 for (i = 1; i < npieces; i++)
2094 testcase_setpoolflags(pool, pieces[i]);
2096 else if (!strcmp(pieces[0], "solverflags") && npieces > 1)
2101 solv = solver_create(pool);
2102 testcase_resetsolverflags(solv);
2104 for (i = 1; i < npieces; i++)
2105 testcase_setsolverflags(solv, pieces[i]);
2107 else if (!strcmp(pieces[0], "result") && npieces > 2)
2110 int resultflags = str2resultflags(pool, pieces[1]);
2111 const char *rdata = pool_tmpjoin(pool, testcasedir, pieces[2], 0);
2112 if (!strcmp(pieces[2], "<inline>"))
2113 result = read_inline_file(fp, &buf, &bufp, &bufl);
2116 FILE *rfp = fopen(rdata, "r");
2118 pool_debug(pool, SOLV_ERROR, "testcase_read: could not open '%s'\n", rdata);
2121 result = read_file(rfp);
2130 *resultflagsp = resultflags;
2132 else if (!strcmp(pieces[0], "nextjob") && npieces == 1)
2138 pool_debug(pool, SOLV_ERROR, "testcase_read: cannot parse command '%s'\n", pieces[0]);
2141 buf = solv_free(buf);
2142 pieces = solv_free(pieces);
2143 solv_free(testcasedir);
2146 pool_addfileprovides(pool);
2147 pool_createwhatprovides(pool);
2151 solv = solver_create(pool);
2152 testcase_resetsolverflags(solv);
2160 testcase_resultdiff(char *result1, char *result2)
2162 Strqueue sq1, sq2, osq;
2164 strqueue_init(&sq1);
2165 strqueue_init(&sq2);
2166 strqueue_init(&osq);
2167 strqueue_split(&sq1, result1);
2168 strqueue_split(&sq2, result2);
2169 strqueue_sort(&sq1);
2170 strqueue_sort(&sq2);
2171 strqueue_diff(&sq1, &sq2, &osq);
2172 r = osq.nstr ? strqueue_join(&osq) : 0;
2173 strqueue_free(&sq1);
2174 strqueue_free(&sq2);
2175 strqueue_free(&osq);