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_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_ORUPDATE, "orupdate" },
58 { SOLVER_FORCEBEST, "forcebest" },
59 { SOLVER_TARGETED, "targeted" },
60 { SOLVER_SETEV, "setev" },
61 { SOLVER_SETEVR, "setevr" },
62 { SOLVER_SETARCH, "setarch" },
63 { SOLVER_SETVENDOR, "setvendor" },
64 { SOLVER_SETREPO, "setrepo" },
65 { SOLVER_NOAUTOSET, "noautoset" },
69 static struct resultflags2str {
72 } resultflags2str[] = {
73 { TESTCASE_RESULT_TRANSACTION, "transaction" },
74 { TESTCASE_RESULT_PROBLEMS, "problems" },
75 { TESTCASE_RESULT_ORPHANED, "orphaned" },
76 { TESTCASE_RESULT_RECOMMENDED, "recommended" },
77 { TESTCASE_RESULT_UNNEEDED, "unneeded" },
81 static struct solverflags2str {
85 } solverflags2str[] = {
86 { SOLVER_FLAG_ALLOW_DOWNGRADE, "allowdowngrade", 0 },
87 { SOLVER_FLAG_ALLOW_NAMECHANGE, "allownamechange", 1 },
88 { SOLVER_FLAG_ALLOW_ARCHCHANGE, "allowarchchange", 0 },
89 { SOLVER_FLAG_ALLOW_VENDORCHANGE, "allowvendorchange", 0 },
90 { SOLVER_FLAG_ALLOW_UNINSTALL, "allowuninstall", 0 },
91 { SOLVER_FLAG_NO_UPDATEPROVIDE, "noupdateprovide", 0 },
92 { SOLVER_FLAG_SPLITPROVIDES, "splitprovides", 0 },
93 { SOLVER_FLAG_IGNORE_RECOMMENDED, "ignorerecommended", 0 },
94 { SOLVER_FLAG_ADD_ALREADY_RECOMMENDED, "addalreadyrecommended", 0 },
95 { SOLVER_FLAG_NO_INFARCHCHECK, "noinfarchcheck", 0 },
96 { SOLVER_FLAG_KEEP_EXPLICIT_OBSOLETES, "keepexplicitobsoletes", 0 },
97 { SOLVER_FLAG_BEST_OBEY_POLICY, "bestobeypolicy", 0 },
98 { SOLVER_FLAG_NO_AUTOTARGET, "noautotarget", 0 },
102 static struct poolflags2str {
106 } poolflags2str[] = {
107 { POOL_FLAG_PROMOTEEPOCH, "promoteepoch", 0 },
108 { POOL_FLAG_FORBIDSELFCONFLICTS, "forbidselfconflicts", 0 },
109 { POOL_FLAG_OBSOLETEUSESPROVIDES, "obsoleteusesprovides", 0 },
110 { POOL_FLAG_IMPLICITOBSOLETEUSESPROVIDES, "implicitobsoleteusesprovides", 0 },
111 { POOL_FLAG_OBSOLETEUSESCOLORS, "obsoleteusescolors", 0 },
112 { POOL_FLAG_NOINSTALLEDOBSOLETES, "noinstalledobsoletes", 0 },
113 { POOL_FLAG_HAVEDISTEPOCH, "havedistepoch", 0 },
117 static struct disttype2str {
121 { DISTTYPE_RPM, "rpm" },
122 { DISTTYPE_DEB, "deb" },
123 { DISTTYPE_ARCH, "arch" },
127 static struct selflags2str {
131 { SELECTION_NAME, "name" },
132 { SELECTION_PROVIDES, "provides" },
133 { SELECTION_FILELIST, "filelist" },
134 { SELECTION_CANON, "canon" },
135 { SELECTION_DOTARCH, "dotarch" },
136 { SELECTION_REL, "rel" },
137 { SELECTION_INSTALLED_ONLY, "installedonly" },
138 { SELECTION_GLOB, "glob" },
139 { SELECTION_FLAT, "flat" },
140 { SELECTION_NOCASE, "nocase" },
141 { SELECTION_SOURCE_ONLY, "sourceonly" },
142 { SELECTION_WITH_SOURCE, "withsource" },
147 typedef struct strqueue {
152 #define STRQUEUE_BLOCK 63
155 strqueue_init(Strqueue *q)
162 strqueue_free(Strqueue *q)
165 for (i = 0; i < q->nstr; i++)
166 solv_free(q->str[i]);
167 q->str = solv_free(q->str);
172 strqueue_push(Strqueue *q, const char *s)
174 q->str = solv_extend(q->str, q->nstr, 1, sizeof(*q->str), STRQUEUE_BLOCK);
175 q->str[q->nstr++] = solv_strdup(s);
179 strqueue_pushjoin(Strqueue *q, const char *s1, const char *s2, const char *s3)
181 q->str = solv_extend(q->str, q->nstr, 1, sizeof(*q->str), STRQUEUE_BLOCK);
182 q->str[q->nstr++] = solv_dupjoin(s1, s2, s3);
186 strqueue_sort_cmp(const void *ap, const void *bp, void *dp)
188 const char *a = *(const char **)ap;
189 const char *b = *(const char **)bp;
190 return strcmp(a ? a : "", b ? b : "");
194 strqueue_sort(Strqueue *q)
197 solv_sort(q->str, q->nstr, sizeof(*q->str), strqueue_sort_cmp, 0);
201 strqueue_sort_u(Strqueue *q)
205 for (i = j = 0; i < q->nstr; i++)
206 if (!j || strqueue_sort_cmp(q->str + i, q->str + j - 1, 0) != 0)
207 q->str[j++] = q->str[i];
212 strqueue_join(Strqueue *q)
216 for (i = 0; i < q->nstr; i++)
218 l += strlen(q->str[i]) + 1;
219 l++; /* trailing \0 */
222 for (i = 0; i < q->nstr; i++)
225 strcpy(rp, q->str[i]);
234 strqueue_split(Strqueue *q, const char *s)
239 while ((p = strchr(s, '\n')) != 0)
241 q->str = solv_extend(q->str, q->nstr, 1, sizeof(*q->str), STRQUEUE_BLOCK);
242 q->str[q->nstr] = solv_malloc(p - s + 1);
244 memcpy(q->str[q->nstr], s, p - s);
245 q->str[q->nstr][p - s] = 0;
254 strqueue_diff(Strqueue *sq1, Strqueue *sq2, Strqueue *osq)
257 while (i < sq1->nstr && j < sq2->nstr)
259 int r = strqueue_sort_cmp(sq1->str + i, sq2->str + j, 0);
263 strqueue_pushjoin(osq, "-", sq1->str[i++], 0);
265 strqueue_pushjoin(osq, "+", sq2->str[j++], 0);
267 while (i < sq1->nstr)
268 strqueue_pushjoin(osq, "-", sq1->str[i++], 0);
269 while (j < sq2->nstr)
270 strqueue_pushjoin(osq, "+", sq2->str[j++], 0);
274 pool_isknownarch(Pool *pool, Id id)
276 if (!id || id == ID_EMPTY)
278 if (id == ARCH_SRC || id == ARCH_NOSRC || id == ARCH_NOARCH)
280 if (!pool->id2arch || (id > pool->lastarch || !pool->id2arch[id]))
286 testcase_str2dep(Pool *pool, char *s)
292 if ((n = strchr(s, '|')) != 0)
294 id = testcase_str2dep(pool, n + 1);
296 id = pool_rel2id(pool, testcase_str2dep(pool, s), id, REL_OR, 1);
300 while (*s == ' ' || *s == '\t')
303 while (*s && *s != ' ' && *s != '\t' && *s != '<' && *s != '=' && *s != '>')
307 while (*s && *s != ')')
313 if ((a = strchr(n, '.')) != 0 && a + 1 < s && s[-1] != ')')
315 Id archid = pool_strn2id(pool, a + 1, s - (a + 1), 0);
316 if (pool_isknownarch(pool, archid))
318 id = pool_strn2id(pool, n, a - n, 1);
319 id = pool_rel2id(pool, id, archid, REL_ARCH, 1);
322 id = pool_strn2id(pool, n, s - n, 1);
325 id = pool_strn2id(pool, n, s - n, 1);
328 while (*s == ' ' || *s == '\t')
344 while (*s == ' ' || *s == '\t')
347 while (*s && *s != ' ' && *s != '\t')
349 return pool_rel2id(pool, id, pool_strn2id(pool, n, s - n, 1), flags, 1);
353 testcase_repoid2str(Pool *pool, Id repoid)
355 Repo *repo = pool_id2repo(pool, repoid);
358 char *r = pool_tmpjoin(pool, repo->name, 0, 0);
360 for (rp = r; *rp; rp++)
361 if (*rp == ' ' || *rp == '\t')
368 sprintf(buf, "#%d", repoid);
369 return pool_tmpjoin(pool, buf, 0, 0);
374 testcase_solvid2str(Pool *pool, Id p)
376 Solvable *s = pool->solvables + p;
377 const char *n, *e, *a;
380 if (p == SYSTEMSOLVABLE)
382 n = pool_id2str(pool, s->name);
383 e = pool_id2str(pool, s->evr);
384 a = pool_id2str(pool, s->arch);
385 str = pool_alloctmpspace(pool, strlen(n) + strlen(e) + strlen(a) + 3);
386 sprintf(str, "%s-%s.%s", n, e, a);
388 return pool_tmpappend(pool, str, "@", 0);
392 char *str2 = pool_tmpappend(pool, str, "@", s->repo->name);
394 if (str2[l] == ' ' || str2[l] == '\t')
398 sprintf(buf, "@#%d", s->repo->repoid);
399 return pool_tmpappend(pool, str, buf, 0);
403 testcase_str2repo(Pool *pool, const char *str)
407 if (str[0] == '#' && (str[1] >= '0' && str[1] <= '9'))
411 for (j = 1; str[j] >= '0' && str[j] <= '9'; j++)
412 repoid = repoid * 10 + (str[j] - '0');
413 if (!str[j] && repoid > 0 && repoid < pool->nrepos)
414 repo = pool_id2repo(pool, repoid);
418 FOR_REPOS(repoid, repo)
423 l = strlen(repo->name);
424 for (i = 0; i < l; i++)
426 int c = repo->name[i];
427 if (c == ' ' || c == '\t')
432 if (i == l && !str[l])
435 if (repoid >= pool->nrepos)
442 testcase_str2solvid(Pool *pool, const char *str)
444 int i, l = strlen(str);
451 if (*str == '@' && !strcmp(str, "@SYSTEM"))
452 return SYSTEMSOLVABLE;
454 for (i = l - 1; i >= 0; i--)
455 if (str[i] == '@' && (repo = testcase_str2repo(pool, str + i + 1)) != 0)
460 /* now find the arch (if present) */
462 for (i = repostart - 1; i > 0; i--)
465 arch = pool_strn2id(pool, str + i + 1, repostart - (i + 1), 0);
470 /* now find the name */
471 for (i = repostart - 1; i > 0; i--)
475 Id nid, evrid, p, pp;
476 nid = pool_strn2id(pool, str, i, 0);
479 evrid = pool_strn2id(pool, str + i + 1, repostart - (i + 1), 0);
482 FOR_PROVIDES(p, pp, nid)
484 Solvable *s = pool->solvables + p;
485 if (s->name != nid || s->evr != evrid)
487 if (repo && s->repo != repo)
489 if (arch && s->arch != arch)
499 testcase_job2str(Pool *pool, Id how, Id what)
506 Id select = how & SOLVER_SELECTMASK;
508 for (i = 0; job2str[i].str; i++)
509 if ((how & SOLVER_JOBMASK) == job2str[i].job)
511 jobstr = job2str[i].str ? job2str[i].str : "unknown";
512 if (select == SOLVER_SOLVABLE)
515 pkgstr = testcase_solvid2str(pool, what);
517 else if (select == SOLVER_SOLVABLE_NAME)
520 pkgstr = pool_dep2str(pool, what);
522 else if (select == SOLVER_SOLVABLE_PROVIDES)
524 selstr = " provides ";
525 pkgstr = pool_dep2str(pool, what);
527 else if (select == SOLVER_SOLVABLE_ONE_OF)
532 while ((p = pool->whatprovidesdata[what++]) != 0)
534 const char *s = testcase_solvid2str(pool, p);
537 pkgstr = pool_tmpappend(pool, pkgstr, " ", s);
538 pool_freetmpspace(pool, s);
546 else if (select == SOLVER_SOLVABLE_REPO)
548 Repo *repo = pool_id2repo(pool, what);
553 sprintf(buf, "#%d", repo->repoid);
554 pkgstr = pool_tmpjoin(pool, buf, 0, 0);
557 pkgstr = pool_tmpjoin(pool, repo->name, 0, 0);
559 else if (select == SOLVER_SOLVABLE_ALL)
566 selstr = " unknown ";
569 ret = pool_tmpjoin(pool, jobstr, selstr, pkgstr);
571 ret = pool_tmpappend(pool, ret, " ", 0);
572 for (i = 0; jobflags2str[i].str; i++)
573 if ((how & jobflags2str[i].flag) != 0)
574 ret = pool_tmpappend(pool, ret, ",", jobflags2str[i].str);
580 ret = pool_tmpappend(pool, ret, "]", 0);
586 str2selflags(Pool *pool, char *s) /* modifies the string! */
591 char *se = strchr(s, ',');
594 for (i = 0; selflags2str[i].str; i++)
595 if (!strcmp(s, selflags2str[i].str))
597 selflags |= selflags2str[i].flag;
600 if (!selflags2str[i].str)
601 pool_debug(pool, SOLV_ERROR, "str2job: unknown selection flag '%s'\n", s);
608 str2jobflags(Pool *pool, char *s) /* modifies the string */
613 char *se = strchr(s, ',');
616 for (i = 0; jobflags2str[i].str; i++)
617 if (!strcmp(s, jobflags2str[i].str))
619 jobflags |= jobflags2str[i].flag;
622 if (!jobflags2str[i].str)
623 pool_debug(pool, SOLV_ERROR, "str2job: unknown job flag '%s'\n", s);
630 testcase_str2job(Pool *pool, const char *str, Id *whatp)
640 /* so we can patch it */
641 s = pool_tmpjoin(pool, str, 0, 0);
642 /* split it in pieces */
645 while (*s == ' ' || *s == '\t')
649 pieces = solv_extend(pieces, npieces, 1, sizeof(*pieces), 7);
650 pieces[npieces++] = s;
651 while (*s && *s != ' ' && *s != '\t')
658 pool_debug(pool, SOLV_ERROR, "str2job: bad line '%s'\n", str);
663 for (i = 0; job2str[i].str; i++)
664 if (!strcmp(pieces[0], job2str[i].str))
668 pool_debug(pool, SOLV_ERROR, "str2job: unknown job '%s'\n", str);
672 job = job2str[i].job;
676 char *flags = pieces[npieces - 1];
677 if (*flags == '[' && flags[strlen(flags) - 1] == ']')
681 flags[strlen(flags) - 1] = 0;
682 job |= str2jobflags(pool, flags);
685 if (!strcmp(pieces[1], "pkg"))
689 pool_debug(pool, SOLV_ERROR, "str2job: bad pkg selector in '%s'\n", str);
693 job |= SOLVER_SOLVABLE;
694 what = testcase_str2solvid(pool, pieces[2]);
697 pool_debug(pool, SOLV_ERROR, "str2job: unknown package '%s'\n", pieces[2]);
702 else if (!strcmp(pieces[1], "name") || !strcmp(pieces[1], "provides"))
704 /* join em again for dep2str... */
706 for (sp = pieces[2]; sp < pieces[npieces - 1]; sp++)
710 if (pieces[1][0] == 'p' && strncmp(pieces[2], "namespace:", 10) == 0)
712 char *spe = strchr(pieces[2], '(');
713 int l = strlen(pieces[2]);
714 if (spe && pieces[2][l - 1] == ')')
716 /* special namespace provides */
717 if (strcmp(spe, "(<NULL>)") != 0)
719 pieces[2][l - 1] = 0;
720 what = testcase_str2dep(pool, spe + 1);
721 pieces[2][l - 1] = ')';
723 what = pool_rel2id(pool, pool_strn2id(pool, pieces[2], spe - pieces[2], 1), what, REL_NAMESPACE, 1);
727 what = testcase_str2dep(pool, pieces[2]);
728 if (pieces[1][0] == 'n')
729 job |= SOLVER_SOLVABLE_NAME;
731 job |= SOLVER_SOLVABLE_PROVIDES;
733 else if (!strcmp(pieces[1], "oneof"))
736 job |= SOLVER_SOLVABLE_ONE_OF;
738 if (npieces > 3 && strcmp(pieces[2], "nothing") != 0)
740 for (i = 2; i < npieces; i++)
742 Id p = testcase_str2solvid(pool, pieces[i]);
745 pool_debug(pool, SOLV_ERROR, "str2job: unknown package '%s'\n", pieces[i]);
753 what = pool_queuetowhatprovides(pool, &q);
756 else if (!strcmp(pieces[1], "repo"))
761 pool_debug(pool, SOLV_ERROR, "str2job: bad line '%s'\n", str);
765 repo = testcase_str2repo(pool, pieces[2]);
768 pool_debug(pool, SOLV_ERROR, "str2job: unknown repo '%s'\n", pieces[2]);
772 job |= SOLVER_SOLVABLE_REPO;
775 else if (!strcmp(pieces[1], "all"))
777 if (npieces != 3 && strcmp(pieces[2], "packages") != 0)
779 pool_debug(pool, SOLV_ERROR, "str2job: bad line '%s'\n", str);
783 job |= SOLVER_SOLVABLE_ALL;
788 pool_debug(pool, SOLV_ERROR, "str2job: unknown selection in '%s'\n", str);
798 addselectionjob(Pool *pool, char **pieces, int npieces, Queue *jobqueue)
805 for (i = 0; job2str[i].str; i++)
806 if (!strcmp(pieces[0], job2str[i].str))
810 pool_debug(pool, SOLV_ERROR, "selstr2job: unknown job '%s'\n", pieces[0]);
813 job = job2str[i].job;
816 char *flags = pieces[npieces - 1];
817 if (*flags == '[' && flags[strlen(flags) - 1] == ']')
821 flags[strlen(flags) - 1] = 0;
822 job |= str2jobflags(pool, flags);
827 pool_debug(pool, SOLV_ERROR, "selstr2job: no selection flags\n");
830 selflags = str2selflags(pool, pieces[3]);
832 r = selection_make(pool, &sel, pieces[2], selflags);
833 for (i = 0; i < sel.count; i += 2)
834 queue_push2(jobqueue, job | sel.elements[i], sel.elements[i + 1]);
840 writedeps(Repo *repo, FILE *fp, const char *tag, Id key, Solvable *s, Offset off)
842 Pool *pool = repo->pool;
849 dp = repo->idarraydata + off;
851 while ((id = *dp++) != 0)
853 if (key == SOLVABLE_REQUIRES && id == SOLVABLE_PREREQMARKER)
856 fprintf(fp, "-%s\n", tag);
861 if (key == SOLVABLE_PROVIDES && id == SOLVABLE_FILEMARKER)
866 idstr = pool_dep2str(pool, id);
869 Reldep *rd = GETRELDEP(pool, id);
870 if (key == SOLVABLE_CONFLICTS && rd->flags == REL_NAMESPACE && rd->name == NAMESPACE_OTHERPROVIDERS)
872 if (!strncmp(idstr, "namespace:", 10))
875 if (key == SOLVABLE_SUPPLEMENTS)
877 if (rd->flags == REL_NAMESPACE && rd->name == NAMESPACE_FILESYSTEM)
879 if (!strncmp(idstr, "namespace:", 10))
882 else if (rd->flags == REL_NAMESPACE && rd->name == NAMESPACE_MODALIAS)
884 if (!strncmp(idstr, "namespace:", 10))
887 else if (rd->flags == REL_AND)
889 /* either packageand chain or modalias */
891 if (ISRELDEP(rd->evr))
893 Reldep *mrd = GETRELDEP(pool, rd->evr);
894 if (mrd->flags == REL_NAMESPACE && mrd->name == NAMESPACE_MODALIAS)
896 idstr = pool_tmpjoin(pool, "modalias(", pool_dep2str(pool, rd->name), ":");
897 idstr = pool_tmpappend(pool, idstr, pool_dep2str(pool, mrd->evr), ")");
899 else if (mrd->flags >= 8)
904 /* must be and chain */
905 idstr = pool_dep2str(pool, rd->evr);
911 rd = GETRELDEP(pool, id);
912 if (rd->flags != REL_AND)
914 idstr = pool_tmpjoin(pool, pool_dep2str(pool, rd->evr), ":", idstr);
916 idstr = pool_tmpjoin(pool, pool_dep2str(pool, id), ":", idstr);
917 idstr = pool_tmpjoin(pool, "packageand(", idstr, ")");
920 else if (rd->flags >= 8)
926 fprintf(fp, "+%s\n", tag);
929 fprintf(fp, "%s\n", idstr);
931 if (key == SOLVABLE_PROVIDES)
933 /* add the filelist */
935 dataiterator_init(&di, pool, repo, s - pool->solvables, SOLVABLE_FILELIST, 0, 0);
936 while (dataiterator_step(&di))
938 const char *s = repodata_dir2str(di.data, di.kv.id, di.kv.str);
941 Id id = pool_str2id(pool, s, 0);
944 for (dp = prvdp; *dp; dp++)
948 continue; /* already included */
953 fprintf(fp, "+%s", tag);
956 fprintf(fp, "%s\n", s);
960 fprintf(fp, "-%s\n", tag);
964 testcase_write_testtags(Repo *repo, FILE *fp)
966 Pool *pool = repo->pool;
976 fprintf(fp, "=Ver: 2.0\n");
977 FOR_REPO_SOLVABLES(repo, p, s)
979 name = pool_id2str(pool, s->name);
980 evr = pool_id2str(pool, s->evr);
981 arch = pool_id2str(pool, s->arch);
982 release = strrchr(evr, '-');
984 release = evr + strlen(evr);
985 fprintf(fp, "=Pkg: %s %.*s %s %s\n", name, (int)(release - evr), evr, *release && release[1] ? release + 1 : "-", arch);
986 tmp = solvable_lookup_str(s, SOLVABLE_SUMMARY);
988 fprintf(fp, "=Sum: %s\n", tmp);
989 writedeps(repo, fp, "Req:", SOLVABLE_REQUIRES, s, s->requires);
990 writedeps(repo, fp, "Prv:", SOLVABLE_PROVIDES, s, s->provides);
991 writedeps(repo, fp, "Obs:", SOLVABLE_OBSOLETES, s, s->obsoletes);
992 writedeps(repo, fp, "Con:", SOLVABLE_CONFLICTS, s, s->conflicts);
993 writedeps(repo, fp, "Rec:", SOLVABLE_RECOMMENDS, s, s->recommends);
994 writedeps(repo, fp, "Sup:", SOLVABLE_SUPPLEMENTS, s, s->supplements);
995 writedeps(repo, fp, "Sug:", SOLVABLE_SUGGESTS, s, s->suggests);
996 writedeps(repo, fp, "Enh:", SOLVABLE_ENHANCES, s, s->enhances);
998 fprintf(fp, "=Vnd: %s\n", pool_id2str(pool, s->vendor));
999 ti = solvable_lookup_num(s, SOLVABLE_BUILDTIME, 0);
1001 fprintf(fp, "=Tim: %u\n", ti);
1006 static inline Offset
1007 adddep(Repo *repo, Offset olddeps, char *str, Id marker)
1009 Id id = *str == '/' ? pool_str2id(repo->pool, str, 1) : testcase_str2dep(repo->pool, str);
1010 return repo_addid_dep(repo, olddeps, id, marker);
1014 finish_solvable(Pool *pool, Repodata *data, Solvable *s, char *filelist, int nfilelist)
1020 for (l = 0; l < nfilelist; l += strlen(filelist + l) + 1)
1022 char *p = strrchr(filelist + l, '/');
1026 did = repodata_str2dir(data, filelist + l, 1);
1029 did = repodata_str2dir(data, "/", 1);
1030 repodata_add_dirstr(data, s - pool->solvables, SOLVABLE_FILELIST, did, p);
1033 if (s->name && s->arch != ARCH_SRC && s->arch != ARCH_NOSRC)
1034 s->provides = repo_addid_dep(s->repo, s->provides, pool_rel2id(pool, s->name, s->evr, REL_EQ, 1), 0);
1035 s->supplements = repo_fix_supplements(s->repo, s->provides, s->supplements, 0);
1036 s->conflicts = repo_fix_conflicts(s->repo, s->conflicts);
1039 /* stripped down version of susetags parser used for testcases */
1041 testcase_add_testtags(Repo *repo, FILE *fp, int flags)
1043 Pool *pool = repo->pool;
1056 data = repo_add_repodata(repo, flags);
1061 line = solv_malloc(aline);
1065 if (linep - line + 16 > aline)
1067 aline = linep - line;
1068 line = solv_realloc(line, aline + 512);
1069 linep = line + aline;
1072 if (!fgets(linep, aline - (linep - line), fp))
1074 linep += strlen(linep);
1075 if (linep == line || linep[-1] != '\n')
1078 linep = line + intag;
1081 if (line[intag] == '-' && !strncmp(line + 1, line + intag + 1, intag - 2))
1088 else if (line[0] == '+' && line[1] && line[1] != ':')
1090 char *tagend = strchr(line, ':');
1095 intag = tagend + 2 - line;
1096 linep = line + intag;
1099 if (*line != '=' || !line[1] || !line[2] || !line[3] || line[4] != ':')
1101 tag = line[1] << 16 | line[2] << 8 | line[3];
1104 case 'P' << 16 | 'k' << 8 | 'g':
1106 finish_solvable(pool, data, s, filelist, nfilelist);
1108 if (split(line + 5, sp, 5) != 4)
1110 s = pool_id2solvable(pool, repo_add_solvable(repo));
1111 s->name = pool_str2id(pool, sp[0], 1);
1112 /* join back version and release */
1113 if (sp[2] && !(sp[2][0] == '-' && !sp[2][1]))
1115 s->evr = makeevr(pool, sp[1]);
1116 s->arch = pool_str2id(pool, sp[3], 1);
1118 case 'S' << 16 | 'u' << 8 | 'm':
1119 repodata_set_str(data, s - pool->solvables, SOLVABLE_SUMMARY, line + 6);
1121 case 'V' << 16 | 'n' << 8 | 'd':
1122 s->vendor = pool_str2id(pool, line + 6, 1);
1124 case 'T' << 16 | 'i' << 8 | 'm':
1127 repodata_set_num(data, s - pool->solvables, SOLVABLE_BUILDTIME, t);
1129 case 'R' << 16 | 'e' << 8 | 'q':
1130 s->requires = adddep(repo, s->requires, line + 6, -SOLVABLE_PREREQMARKER);
1132 case 'P' << 16 | 'r' << 8 | 'q':
1133 s->requires = adddep(repo, s->requires, line + 6, SOLVABLE_PREREQMARKER);
1135 case 'P' << 16 | 'r' << 8 | 'v':
1138 int l = strlen(line + 6) + 1;
1139 if (nfilelist + l > afilelist)
1141 afilelist = nfilelist + l + 512;
1142 filelist = solv_realloc(filelist, afilelist);
1144 memcpy(filelist + nfilelist, line + 6, l);
1151 for (l = 0; l < nfilelist; l += strlen(filelist + l) + 1)
1152 s->provides = repo_addid_dep(repo, s->provides, pool_str2id(pool, filelist + l, 1), 0);
1155 s->provides = adddep(repo, s->provides, line + 6, 0);
1157 case 'O' << 16 | 'b' << 8 | 's':
1158 s->obsoletes = adddep(repo, s->obsoletes, line + 6, 0);
1160 case 'C' << 16 | 'o' << 8 | 'n':
1161 s->conflicts = adddep(repo, s->conflicts, line + 6, 0);
1163 case 'R' << 16 | 'e' << 8 | 'c':
1164 s->recommends = adddep(repo, s->recommends, line + 6, 0);
1166 case 'S' << 16 | 'u' << 8 | 'p':
1167 s->supplements = adddep(repo, s->supplements, line + 6, 0);
1169 case 'S' << 16 | 'u' << 8 | 'g':
1170 s->suggests = adddep(repo, s->suggests, line + 6, 0);
1172 case 'E' << 16 | 'n' << 8 | 'h':
1173 s->enhances = adddep(repo, s->enhances, line + 6, 0);
1180 finish_solvable(pool, data, s, filelist, nfilelist);
1182 solv_free(filelist);
1183 repodata_free_dircache(data);
1184 if (!(flags & REPO_NO_INTERNALIZE))
1185 repodata_internalize(data);
1190 testcase_getpoolflags(Pool *pool)
1192 const char *str = 0;
1194 for (i = 0; poolflags2str[i].str; i++)
1196 v = pool_get_flag(pool, poolflags2str[i].flag);
1197 if (v == poolflags2str[i].def)
1199 str = pool_tmpappend(pool, str, v ? " " : " !", poolflags2str[i].str);
1201 return str ? str + 1 : "";
1205 testcase_setpoolflags(Pool *pool, const char *str)
1207 const char *p = str, *s;
1211 while (*p == ' ' || *p == '\t' || *p == ',')
1222 while (*p && *p != ' ' && *p != '\t' && *p != ',')
1224 for (i = 0; poolflags2str[i].str; i++)
1225 if (!strncmp(poolflags2str[i].str, s, p - s) && poolflags2str[i].str[p - s] == 0)
1227 if (!poolflags2str[i].str)
1229 pool_debug(pool, SOLV_ERROR, "setpoolflags: unknown flag '%.*s'\n", (int)(p - s), s);
1232 pool_set_flag(pool, poolflags2str[i].flag, v);
1238 testcase_resetpoolflags(Pool *pool)
1241 for (i = 0; poolflags2str[i].str; i++)
1242 pool_set_flag(pool, poolflags2str[i].flag, poolflags2str[i].def);
1246 testcase_getsolverflags(Solver *solv)
1248 Pool *pool = solv->pool;
1249 const char *str = 0;
1251 for (i = 0; solverflags2str[i].str; i++)
1253 v = solver_get_flag(solv, solverflags2str[i].flag);
1254 if (v == solverflags2str[i].def)
1256 str = pool_tmpappend(pool, str, v ? " " : " !", solverflags2str[i].str);
1258 return str ? str + 1 : "";
1262 testcase_setsolverflags(Solver *solv, const char *str)
1264 const char *p = str, *s;
1268 while (*p == ' ' || *p == '\t' || *p == ',')
1279 while (*p && *p != ' ' && *p != '\t' && *p != ',')
1281 for (i = 0; solverflags2str[i].str; i++)
1282 if (!strncmp(solverflags2str[i].str, s, p - s) && solverflags2str[i].str[p - s] == 0)
1284 if (!solverflags2str[i].str)
1286 pool_debug(solv->pool, SOLV_ERROR, "setsolverflags: unknown flag '%.*s'\n", (int)(p - s), s);
1289 solver_set_flag(solv, solverflags2str[i].flag, v);
1295 testcase_resetsolverflags(Solver *solv)
1298 for (i = 0; solverflags2str[i].str; i++)
1299 solver_set_flag(solv, solverflags2str[i].flag, solverflags2str[i].def);
1303 testcase_ruleid(Solver *solv, Id rid)
1309 const unsigned char *md5;
1315 solver_ruleliterals(solv, rid, &q);
1316 for (i = 0; i < q.count; i++)
1318 Id p = q.elements[i];
1319 s = testcase_solvid2str(solv->pool, p > 0 ? p : -p);
1321 s = pool_tmpjoin(solv->pool, "!", s, 0);
1322 strqueue_push(&sq, s);
1325 strqueue_sort_u(&sq);
1326 chk = solv_chksum_create(REPOKEY_TYPE_MD5);
1327 for (i = 0; i < sq.nstr; i++)
1328 solv_chksum_add(chk, sq.str[i], strlen(sq.str[i]) + 1);
1329 md5 = solv_chksum_get(chk, &md5l);
1330 s = pool_bin2hex(solv->pool, md5, md5l);
1331 chk = solv_chksum_free(chk, 0);
1337 testcase_problemid(Solver *solv, Id problem)
1342 const unsigned char *md5;
1346 /* we build a hash of all rules that define the problem */
1349 solver_findallproblemrules(solv, problem, &q);
1350 for (i = 0; i < q.count; i++)
1351 strqueue_push(&sq, testcase_ruleid(solv, q.elements[i]));
1353 strqueue_sort_u(&sq);
1354 chk = solv_chksum_create(REPOKEY_TYPE_MD5);
1355 for (i = 0; i < sq.nstr; i++)
1356 solv_chksum_add(chk, sq.str[i], strlen(sq.str[i]) + 1);
1357 md5 = solv_chksum_get(chk, &md5l);
1358 s = pool_bin2hex(solv->pool, md5, 4);
1359 chk = solv_chksum_free(chk, 0);
1365 testcase_solutionid(Solver *solv, Id problem, Id solution)
1369 const unsigned char *md5;
1373 intid = solver_solutionelement_internalid(solv, problem, solution);
1374 /* internal stuff! handle with care! */
1378 s = testcase_job2str(solv->pool, solv->job.elements[-intid - 1], solv->job.elements[-intid]);
1383 s = testcase_ruleid(solv, intid);
1385 chk = solv_chksum_create(REPOKEY_TYPE_MD5);
1386 solv_chksum_add(chk, s, strlen(s) + 1);
1387 md5 = solv_chksum_get(chk, &md5l);
1388 s = pool_bin2hex(solv->pool, md5, 4);
1389 chk = solv_chksum_free(chk, 0);
1393 static struct class2str {
1397 { SOLVER_TRANSACTION_ERASE, "erase" },
1398 { SOLVER_TRANSACTION_INSTALL, "install" },
1399 { SOLVER_TRANSACTION_REINSTALLED, "reinstall" },
1400 { SOLVER_TRANSACTION_DOWNGRADED, "downgrade" },
1401 { SOLVER_TRANSACTION_CHANGED, "change" },
1402 { SOLVER_TRANSACTION_UPGRADED, "upgrade" },
1403 { SOLVER_TRANSACTION_OBSOLETED, "obsolete" },
1404 { SOLVER_TRANSACTION_MULTIINSTALL, "multiinstall" },
1405 { SOLVER_TRANSACTION_MULTIREINSTALL, "multireinstall" },
1410 testcase_solverresult(Solver *solv, int resultflags)
1412 Pool *pool = solv->pool;
1420 if ((resultflags & TESTCASE_RESULT_TRANSACTION) != 0)
1422 Transaction *trans = solver_create_transaction(solv);
1426 for (i = 0; class2str[i].str; i++)
1429 transaction_classify_pkgs(trans, SOLVER_TRANSACTION_KEEP_PSEUDO, class2str[i].class, 0, 0, &q);
1430 for (j = 0; j < q.count; j++)
1434 if (pool->installed && pool->solvables[p].repo == pool->installed)
1435 op = transaction_obs_pkg(trans, p);
1436 s = pool_tmpjoin(pool, class2str[i].str, " ", testcase_solvid2str(pool, p));
1438 s = pool_tmpjoin(pool, s, " ", testcase_solvid2str(pool, op));
1439 strqueue_push(&sq, s);
1443 transaction_free(trans);
1445 if ((resultflags & TESTCASE_RESULT_PROBLEMS) != 0)
1447 char *probprefix, *solprefix;
1448 int problem, solution, element;
1451 pcnt = solver_problem_count(solv);
1452 for (problem = 1; problem <= pcnt; problem++)
1454 Id rid, from, to, dep;
1455 SolverRuleinfo rinfo;
1456 rid = solver_findproblemrule(solv, problem);
1457 s = testcase_problemid(solv, problem);
1458 probprefix = solv_dupjoin("problem ", s, 0);
1459 rinfo = solver_ruleinfo(solv, rid, &from, &to, &dep);
1460 s = pool_tmpjoin(pool, probprefix, " info ", solver_problemruleinfo2str(solv, rinfo, from, to, dep));
1461 strqueue_push(&sq, s);
1462 scnt = solver_solution_count(solv, problem);
1463 for (solution = 1; solution <= scnt; solution++)
1465 s = testcase_solutionid(solv, problem, solution);
1466 solprefix = solv_dupjoin(probprefix, " solution ", s);
1468 while ((element = solver_next_solutionelement(solv, problem, solution, element, &p, &op)) != 0)
1470 if (p == SOLVER_SOLUTION_JOB)
1471 s = pool_tmpjoin(pool, solprefix, " deljob ", testcase_job2str(pool, solv->job.elements[op - 1], solv->job.elements[op]));
1472 else if (p > 0 && op == 0)
1473 s = pool_tmpjoin(pool, solprefix, " erase ", testcase_solvid2str(pool, p));
1474 else if (p > 0 && op > 0)
1476 s = pool_tmpjoin(pool, solprefix, " replace ", testcase_solvid2str(pool, p));
1477 s = pool_tmpappend(pool, s, " ", testcase_solvid2str(pool, op));
1479 else if (p < 0 && op > 0)
1480 s = pool_tmpjoin(pool, solprefix, " allow ", testcase_solvid2str(pool, op));
1482 s = pool_tmpjoin(pool, solprefix, " unknown", 0);
1483 strqueue_push(&sq, s);
1485 solv_free(solprefix);
1487 solv_free(probprefix);
1491 if ((resultflags & TESTCASE_RESULT_ORPHANED) != 0)
1496 solver_get_orphaned(solv, &q);
1497 for (i = 0; i < q.count; i++)
1499 s = pool_tmpjoin(pool, "orphaned ", testcase_solvid2str(pool, q.elements[i]), 0);
1500 strqueue_push(&sq, s);
1505 if ((resultflags & TESTCASE_RESULT_RECOMMENDED) != 0)
1511 solver_get_recommendations(solv, &qr, &qs, 0);
1512 for (i = 0; i < qr.count; i++)
1514 s = pool_tmpjoin(pool, "recommended ", testcase_solvid2str(pool, qr.elements[i]), 0);
1515 strqueue_push(&sq, s);
1517 for (i = 0; i < qs.count; i++)
1519 s = pool_tmpjoin(pool, "suggested ", testcase_solvid2str(pool, qs.elements[i]), 0);
1520 strqueue_push(&sq, s);
1526 if ((resultflags & TESTCASE_RESULT_UNNEEDED) != 0)
1531 solver_get_unneeded(solv, &q, 0);
1532 for (i = 0; i < q.count; i++)
1534 s = pool_tmpjoin(pool, "unneeded ", testcase_solvid2str(pool, q.elements[i]), 0);
1535 strqueue_push(&sq, s);
1541 result = strqueue_join(&sq);
1548 testcase_write(Solver *solv, char *dir, int resultflags, const char *testcasename, const char *resultname)
1550 Pool *pool = solv->pool;
1561 testcasename = "testcase.t";
1563 resultname = "solver.result";
1565 if (mkdir(dir, 0777) && errno != EEXIST)
1567 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: could not create directory '%s'\n", dir);
1571 FOR_REPOS(repoid, repo)
1573 const char *name = testcase_repoid2str(pool, repoid);
1575 if (repo->subpriority)
1576 sprintf(priobuf, "%d.%d", repo->priority, repo->subpriority);
1578 sprintf(priobuf, "%d", repo->priority);
1579 out = pool_tmpjoin(pool, name, ".repo", ".gz");
1580 cmd = pool_tmpjoin(pool, "repo ", name, " ");
1581 cmd = pool_tmpappend(pool, cmd, priobuf, " ");
1582 cmd = pool_tmpappend(pool, cmd, "testtags ", out);
1583 strqueue_push(&sq, cmd);
1584 out = pool_tmpjoin(pool, dir, "/", out);
1585 if (!(fp = solv_xfopen(out, "w")))
1587 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: could not open '%s' for writing\n", out);
1591 testcase_write_testtags(repo, fp);
1594 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: write error\n");
1599 /* hmm, this is not optimal... we currently search for the lowest score */
1601 arch = pool->solvables[SYSTEMSOLVABLE].arch;
1602 for (i = 0; i < pool->lastarch; i++)
1604 if (pool->id2arch[i] == 1 && !lowscore)
1606 if (pool->id2arch[i] > 0x10000 && (!lowscore || pool->id2arch[i] < lowscore))
1609 lowscore = pool->id2arch[i];
1612 cmd = pool_tmpjoin(pool, "system ", pool->lastarch ? pool_id2str(pool, arch) : "unset", 0);
1613 for (i = 0; disttype2str[i].str != 0; i++)
1614 if (pool->disttype == disttype2str[i].type)
1616 pool_tmpappend(pool, cmd, " ", disttype2str[i].str ? disttype2str[i].str : "unknown");
1617 if (pool->installed)
1618 cmd = pool_tmpappend(pool, cmd, " ", testcase_repoid2str(pool, pool->installed->repoid));
1619 strqueue_push(&sq, cmd);
1620 s = testcase_getpoolflags(solv->pool);
1623 cmd = pool_tmpjoin(pool, "poolflags ", s, 0);
1624 strqueue_push(&sq, cmd);
1627 if (pool->vendorclasses)
1630 for (i = 0; pool->vendorclasses[i]; i++)
1632 cmd = pool_tmpappend(pool, cmd ? cmd : "vendorclass", " ", pool->vendorclasses[i]);
1633 if (!pool->vendorclasses[i + 1])
1635 strqueue_push(&sq, cmd);
1642 s = testcase_getsolverflags(solv);
1645 cmd = pool_tmpjoin(pool, "solverflags ", s, 0);
1646 strqueue_push(&sq, cmd);
1649 /* now dump all the ns callback values we know */
1650 if (pool->nscallback)
1654 for (rid = 1; rid < pool->nrels; rid++)
1656 Reldep *rd = pool->rels + rid;
1657 if (rd->flags != REL_NAMESPACE || rd->name == NAMESPACE_OTHERPROVIDERS)
1659 /* evaluate all namespace ids, skip empty results */
1660 d = pool_whatprovides(pool, MAKERELDEP(rid));
1661 if (!d || !pool->whatprovidesdata[d])
1663 cmd = pool_tmpjoin(pool, "namespace ", pool_id2str(pool, rd->name), "(");
1664 cmd = pool_tmpappend(pool, cmd, pool_id2str(pool, rd->evr), ")");
1665 for (; pool->whatprovidesdata[d]; d++)
1666 cmd = pool_tmpappend(pool, cmd, " ", testcase_solvid2str(pool, pool->whatprovidesdata[d]));
1667 strqueue_push(&sq, cmd);
1671 for (i = 0; i < solv->job.count; i += 2)
1673 cmd = (char *)testcase_job2str(pool, solv->job.elements[i], solv->job.elements[i + 1]);
1674 cmd = pool_tmpjoin(pool, "job ", cmd, 0);
1675 strqueue_push(&sq, cmd);
1682 for (i = 0; resultflags2str[i].str; i++)
1683 if ((resultflags & resultflags2str[i].flag) != 0)
1684 cmd = pool_tmpappend(pool, cmd, cmd ? "," : 0, resultflags2str[i].str);
1685 cmd = pool_tmpjoin(pool, "result ", cmd ? cmd : "?", 0);
1686 cmd = pool_tmpappend(pool, cmd, " ", resultname);
1687 strqueue_push(&sq, cmd);
1688 result = testcase_solverresult(solv, resultflags);
1689 if (!strcmp(resultname, "<inline>"))
1693 strqueue_init(&rsq);
1694 strqueue_split(&rsq, result);
1695 for (i = 0; i < rsq.nstr; i++)
1697 cmd = pool_tmpjoin(pool, "#>", rsq.str[i], 0);
1698 strqueue_push(&sq, cmd);
1700 strqueue_free(&rsq);
1704 out = pool_tmpjoin(pool, dir, "/", resultname);
1705 if (!(fp = fopen(out, "w")))
1707 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: could not open '%s' for writing\n", out);
1712 if (result && *result && fwrite(result, strlen(result), 1, fp) != 1)
1714 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: write error\n");
1721 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: write error\n");
1729 cmd = strqueue_join(&sq);
1730 out = pool_tmpjoin(pool, dir, "/", testcasename);
1731 if (!(fp = fopen(out, "w")))
1733 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: could not open '%s' for writing\n", out);
1737 if (*cmd && fwrite(cmd, strlen(cmd), 1, fp) != 1)
1739 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: write error\n");
1745 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: write error\n");
1755 read_inline_file(FILE *fp, char **bufp, char **bufpp, int *buflp)
1757 char *result = solv_malloc(1024);
1764 if (rp - result + 256 >= resultl)
1766 resultl = rp - result;
1767 result = solv_realloc(result, resultl + 1024);
1768 rp = result + resultl;
1771 if (!fgets(rp, resultl - (rp - result), fp))
1774 if (rl && (rp == result || rp[-1] == '\n'))
1776 if (rl > 1 && rp[0] == '#' && rp[1] == '>')
1778 memmove(rp, rp + 2, rl - 2);
1783 while (rl + 16 > *buflp)
1785 *bufp = solv_realloc(*bufp, *buflp + 512);
1788 memmove(*bufp, rp, rl);
1789 if ((*bufp)[rl - 1] == '\n')
1795 (*bufpp) = *bufp + rl;
1812 char *result = solv_malloc(1024);
1819 if (rp - result + 256 >= resultl)
1821 resultl = rp - result;
1822 result = solv_realloc(result, resultl + 1024);
1823 rp = result + resultl;
1826 rl = fread(rp, 1, resultl - (rp - result), fp);
1838 str2resultflags(Pool *pool, char *s) /* modifies the string! */
1840 int i, resultflags = 0;
1843 char *se = strchr(s, ',');
1846 for (i = 0; resultflags2str[i].str; i++)
1847 if (!strcmp(s, resultflags2str[i].str))
1849 resultflags |= resultflags2str[i].flag;
1852 if (!resultflags2str[i].str)
1853 pool_debug(pool, SOLV_ERROR, "result: unknown flag '%s'\n", s);
1860 testcase_read(Pool *pool, FILE *fp, char *testcase, Queue *job, char **resultp, int *resultflagsp)
1865 char *testcasedir, *s;
1871 int poolflagsreset = 0;
1873 if (!fp && !(fp = fopen(testcase, "r")))
1875 pool_debug(pool, SOLV_ERROR, "testcase_read: could not open '%s'\n", testcase);
1878 testcasedir = solv_strdup(testcase);
1879 if ((s = strrchr(testcasedir, '/')) != 0)
1884 buf = solv_malloc(bufl);
1889 if (bufp - buf + 16 > bufl)
1892 buf = solv_realloc(buf, bufl + 512);
1896 if (!fgets(bufp, bufl - (bufp - buf), fp))
1900 if (!l || buf[l - 1] != '\n')
1907 while (*s && (*s == ' ' || *s == '\t'))
1909 if (!*s || *s == '#')
1912 /* split it in pieces */
1915 while (*s == ' ' || *s == '\t')
1919 pieces = solv_extend(pieces, npieces, 1, sizeof(*pieces), 7);
1920 pieces[npieces++] = s;
1921 while (*s && *s != ' ' && *s != '\t')
1926 pieces = solv_extend(pieces, npieces, 1, sizeof(*pieces), 7);
1927 pieces[npieces] = 0;
1928 if (!strcmp(pieces[0], "repo") && npieces >= 4)
1930 Repo *repo = repo_create(pool, pieces[1]);
1936 if (!poolflagsreset)
1939 testcase_resetpoolflags(pool); /* hmm */
1941 if (sscanf(pieces[2], "%d.%d", &prio, &subprio) != 2)
1944 prio = atoi(pieces[2]);
1946 repo->priority = prio;
1947 repo->subpriority = subprio;
1948 if (strcmp(pieces[3], "empty") != 0)
1950 const char *repotype = pool_tmpjoin(pool, pieces[3], 0, 0); /* gets overwritten in <inline> case */
1951 if (!strcmp(pieces[4], "<inline>"))
1953 char *idata = read_inline_file(fp, &buf, &bufp, &bufl);
1955 rfp = solv_xfopen_buf(rdata, &idata, 0, "rf");
1959 rdata = pool_tmpjoin(pool, testcasedir, pieces[4], 0);
1960 rfp = solv_xfopen(rdata, "r");
1964 pool_debug(pool, SOLV_ERROR, "testcase_read: could not open '%s'\n", rdata);
1966 else if (!strcmp(repotype, "testtags"))
1968 testcase_add_testtags(repo, rfp, 0);
1971 else if (!strcmp(repotype, "solv"))
1973 repo_add_solv(repo, rfp, 0);
1977 else if (!strcmp(repotype, "helix"))
1979 repo_add_helix(repo, rfp, 0);
1986 pool_debug(pool, SOLV_ERROR, "testcase_read: unknown repo type for repo '%s'\n", repo->name);
1990 else if (!strcmp(pieces[0], "system") && npieces >= 3)
1994 /* must set the disttype before the arch */
1995 for (i = 0; disttype2str[i].str != 0; i++)
1996 if (!strcmp(disttype2str[i].str, pieces[2]))
1998 if (!disttype2str[i].str)
1999 pool_debug(pool, SOLV_ERROR, "testcase_read: system: unknown disttype '%s'\n", pieces[2]);
2000 else if (pool->disttype != disttype2str[i].type)
2002 #ifdef MULTI_SEMANTICS
2003 pool_setdisttype(pool, disttype2str[i].type);
2005 pool_debug(pool, SOLV_ERROR, "testcase_read: system: cannot change disttype to '%s'\n", pieces[2]);
2008 if (strcmp(pieces[1], "unset") != 0)
2009 pool_setarch(pool, pieces[1]);
2011 pool_setarch(pool, 0);
2014 Repo *repo = testcase_str2repo(pool, pieces[3]);
2016 pool_debug(pool, SOLV_ERROR, "testcase_read: system: unknown repo '%s'\n", pieces[3]);
2018 pool_set_installed(pool, repo);
2021 else if (!strcmp(pieces[0], "job") && npieces > 1)
2027 pool_addfileprovides(pool);
2028 pool_createwhatprovides(pool);
2031 if (npieces >= 3 && !strcmp(pieces[2], "selection"))
2033 addselectionjob(pool, pieces + 1, npieces - 1, job);
2037 for (sp = pieces[1]; sp < pieces[npieces - 1]; sp++)
2040 how = testcase_str2job(pool, pieces[1], &what);
2041 if (how >= 0 && job)
2042 queue_push2(job, how, what);
2044 else if (!strcmp(pieces[0], "vendorclass") && npieces > 1)
2046 pool_addvendorclass(pool, (const char **)(pieces + 1));
2048 else if (!strcmp(pieces[0], "namespace") && npieces > 1)
2050 int i = strlen(pieces[1]);
2051 s = strchr(pieces[1], '(');
2052 if (!s && pieces[1][i - 1] != ')')
2054 pool_debug(pool, SOLV_ERROR, "testcase_read: bad namespace '%s'\n", pieces[1]);
2062 pieces[1][i - 1] = 0;
2063 name = pool_str2id(pool, pieces[1], 1);
2064 evr = pool_str2id(pool, s + 1, 1);
2066 pieces[1][i - 1] = ')';
2067 id = pool_rel2id(pool, name, evr, REL_NAMESPACE, 1);
2068 for (i = 2; i < npieces; i++)
2069 queue_push(&q, testcase_str2solvid(pool, pieces[i]));
2070 /* now do the callback */
2073 pool_addfileprovides(pool);
2074 pool_createwhatprovides(pool);
2077 pool->whatprovides_rel[GETRELID(id)] = pool_queuetowhatprovides(pool, &q);
2081 else if (!strcmp(pieces[0], "poolflags"))
2084 if (!poolflagsreset)
2087 testcase_resetpoolflags(pool); /* hmm */
2089 for (i = 1; i < npieces; i++)
2090 testcase_setpoolflags(pool, pieces[i]);
2092 else if (!strcmp(pieces[0], "solverflags") && npieces > 1)
2097 solv = solver_create(pool);
2098 testcase_resetsolverflags(solv);
2100 for (i = 1; i < npieces; i++)
2101 testcase_setsolverflags(solv, pieces[i]);
2103 else if (!strcmp(pieces[0], "result") && npieces > 2)
2106 int resultflags = str2resultflags(pool, pieces[1]);
2107 const char *rdata = pool_tmpjoin(pool, testcasedir, pieces[2], 0);
2108 if (!strcmp(pieces[2], "<inline>"))
2109 result = read_inline_file(fp, &buf, &bufp, &bufl);
2112 FILE *rfp = fopen(rdata, "r");
2114 pool_debug(pool, SOLV_ERROR, "testcase_read: could not open '%s'\n", rdata);
2117 result = read_file(rfp);
2126 *resultflagsp = resultflags;
2128 else if (!strcmp(pieces[0], "nextjob") && npieces == 1)
2134 pool_debug(pool, SOLV_ERROR, "testcase_read: cannot parse command '%s'\n", pieces[0]);
2137 buf = solv_free(buf);
2138 pieces = solv_free(pieces);
2139 solv_free(testcasedir);
2142 pool_addfileprovides(pool);
2143 pool_createwhatprovides(pool);
2147 solv = solver_create(pool);
2148 testcase_resetsolverflags(solv);
2156 testcase_resultdiff(char *result1, char *result2)
2158 Strqueue sq1, sq2, osq;
2160 strqueue_init(&sq1);
2161 strqueue_init(&sq2);
2162 strqueue_init(&osq);
2163 strqueue_split(&sq1, result1);
2164 strqueue_split(&sq2, result2);
2165 strqueue_sort(&sq1);
2166 strqueue_sort(&sq2);
2167 strqueue_diff(&sq1, &sq2, &osq);
2168 r = osq.nstr ? strqueue_join(&osq) : 0;
2169 strqueue_free(&sq1);
2170 strqueue_free(&sq2);
2171 strqueue_free(&osq);