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 },
115 { POOL_FLAG_NOOBSOLETESMULTIVERSION, "noobsoletesmultiversion", 0 },
116 { POOL_FLAG_ADDFILEPROVIDESFILTERED, "addfileprovidesfiltered", 0 },
120 static struct disttype2str {
124 { DISTTYPE_RPM, "rpm" },
125 { DISTTYPE_DEB, "deb" },
126 { DISTTYPE_ARCH, "arch" },
130 static struct selflags2str {
134 { SELECTION_NAME, "name" },
135 { SELECTION_PROVIDES, "provides" },
136 { SELECTION_FILELIST, "filelist" },
137 { SELECTION_CANON, "canon" },
138 { SELECTION_DOTARCH, "dotarch" },
139 { SELECTION_REL, "rel" },
140 { SELECTION_INSTALLED_ONLY, "installedonly" },
141 { SELECTION_GLOB, "glob" },
142 { SELECTION_FLAT, "flat" },
143 { SELECTION_NOCASE, "nocase" },
144 { SELECTION_SOURCE_ONLY, "sourceonly" },
145 { SELECTION_WITH_SOURCE, "withsource" },
150 typedef struct strqueue {
155 #define STRQUEUE_BLOCK 63
158 strqueue_init(Strqueue *q)
165 strqueue_free(Strqueue *q)
168 for (i = 0; i < q->nstr; i++)
169 solv_free(q->str[i]);
170 q->str = solv_free(q->str);
175 strqueue_push(Strqueue *q, const char *s)
177 q->str = solv_extend(q->str, q->nstr, 1, sizeof(*q->str), STRQUEUE_BLOCK);
178 q->str[q->nstr++] = solv_strdup(s);
182 strqueue_pushjoin(Strqueue *q, const char *s1, const char *s2, const char *s3)
184 q->str = solv_extend(q->str, q->nstr, 1, sizeof(*q->str), STRQUEUE_BLOCK);
185 q->str[q->nstr++] = solv_dupjoin(s1, s2, s3);
189 strqueue_sort_cmp(const void *ap, const void *bp, void *dp)
191 const char *a = *(const char **)ap;
192 const char *b = *(const char **)bp;
193 return strcmp(a ? a : "", b ? b : "");
197 strqueue_sort(Strqueue *q)
200 solv_sort(q->str, q->nstr, sizeof(*q->str), strqueue_sort_cmp, 0);
204 strqueue_sort_u(Strqueue *q)
208 for (i = j = 0; i < q->nstr; i++)
209 if (!j || strqueue_sort_cmp(q->str + i, q->str + j - 1, 0) != 0)
210 q->str[j++] = q->str[i];
215 strqueue_join(Strqueue *q)
219 for (i = 0; i < q->nstr; i++)
221 l += strlen(q->str[i]) + 1;
222 l++; /* trailing \0 */
225 for (i = 0; i < q->nstr; i++)
228 strcpy(rp, q->str[i]);
237 strqueue_split(Strqueue *q, const char *s)
242 while ((p = strchr(s, '\n')) != 0)
244 q->str = solv_extend(q->str, q->nstr, 1, sizeof(*q->str), STRQUEUE_BLOCK);
245 q->str[q->nstr] = solv_malloc(p - s + 1);
247 memcpy(q->str[q->nstr], s, p - s);
248 q->str[q->nstr][p - s] = 0;
257 strqueue_diff(Strqueue *sq1, Strqueue *sq2, Strqueue *osq)
260 while (i < sq1->nstr && j < sq2->nstr)
262 int r = strqueue_sort_cmp(sq1->str + i, sq2->str + j, 0);
266 strqueue_pushjoin(osq, "-", sq1->str[i++], 0);
268 strqueue_pushjoin(osq, "+", sq2->str[j++], 0);
270 while (i < sq1->nstr)
271 strqueue_pushjoin(osq, "-", sq1->str[i++], 0);
272 while (j < sq2->nstr)
273 strqueue_pushjoin(osq, "+", sq2->str[j++], 0);
277 pool_isknownarch(Pool *pool, Id id)
279 if (!id || id == ID_EMPTY)
281 if (id == ARCH_SRC || id == ARCH_NOSRC || id == ARCH_NOARCH)
283 if (!pool->id2arch || (id > pool->lastarch || !pool->id2arch[id]))
289 testcase_str2dep(Pool *pool, char *s)
295 if ((n = strchr(s, '|')) != 0)
297 id = testcase_str2dep(pool, n + 1);
299 id = pool_rel2id(pool, testcase_str2dep(pool, s), id, REL_OR, 1);
303 while (*s == ' ' || *s == '\t')
306 while (*s && *s != ' ' && *s != '\t' && *s != '<' && *s != '=' && *s != '>')
310 while (*s && *s != ')')
316 if ((a = strchr(n, '.')) != 0 && a + 1 < s && s[-1] != ')')
318 Id archid = pool_strn2id(pool, a + 1, s - (a + 1), 0);
319 if (pool_isknownarch(pool, archid))
321 id = pool_strn2id(pool, n, a - n, 1);
322 id = pool_rel2id(pool, id, archid, REL_ARCH, 1);
325 id = pool_strn2id(pool, n, s - n, 1);
328 id = pool_strn2id(pool, n, s - n, 1);
331 while (*s == ' ' || *s == '\t')
347 while (*s == ' ' || *s == '\t')
350 while (*s && *s != ' ' && *s != '\t')
352 return pool_rel2id(pool, id, pool_strn2id(pool, n, s - n, 1), flags, 1);
356 testcase_repoid2str(Pool *pool, Id repoid)
358 Repo *repo = pool_id2repo(pool, repoid);
361 char *r = pool_tmpjoin(pool, repo->name, 0, 0);
363 for (rp = r; *rp; rp++)
364 if (*rp == ' ' || *rp == '\t')
371 sprintf(buf, "#%d", repoid);
372 return pool_tmpjoin(pool, buf, 0, 0);
377 testcase_solvid2str(Pool *pool, Id p)
379 Solvable *s = pool->solvables + p;
380 const char *n, *e, *a;
383 if (p == SYSTEMSOLVABLE)
385 n = pool_id2str(pool, s->name);
386 e = pool_id2str(pool, s->evr);
387 a = pool_id2str(pool, s->arch);
388 str = pool_alloctmpspace(pool, strlen(n) + strlen(e) + strlen(a) + 3);
389 sprintf(str, "%s-%s.%s", n, e, a);
391 return pool_tmpappend(pool, str, "@", 0);
395 char *str2 = pool_tmpappend(pool, str, "@", s->repo->name);
397 if (str2[l] == ' ' || str2[l] == '\t')
401 sprintf(buf, "@#%d", s->repo->repoid);
402 return pool_tmpappend(pool, str, buf, 0);
406 testcase_str2repo(Pool *pool, const char *str)
410 if (str[0] == '#' && (str[1] >= '0' && str[1] <= '9'))
414 for (j = 1; str[j] >= '0' && str[j] <= '9'; j++)
415 repoid = repoid * 10 + (str[j] - '0');
416 if (!str[j] && repoid > 0 && repoid < pool->nrepos)
417 repo = pool_id2repo(pool, repoid);
421 FOR_REPOS(repoid, repo)
426 l = strlen(repo->name);
427 for (i = 0; i < l; i++)
429 int c = repo->name[i];
430 if (c == ' ' || c == '\t')
435 if (i == l && !str[l])
438 if (repoid >= pool->nrepos)
445 testcase_str2solvid(Pool *pool, const char *str)
447 int i, l = strlen(str);
454 if (*str == '@' && !strcmp(str, "@SYSTEM"))
455 return SYSTEMSOLVABLE;
457 for (i = l - 1; i >= 0; i--)
458 if (str[i] == '@' && (repo = testcase_str2repo(pool, str + i + 1)) != 0)
463 /* now find the arch (if present) */
465 for (i = repostart - 1; i > 0; i--)
468 arch = pool_strn2id(pool, str + i + 1, repostart - (i + 1), 0);
473 /* now find the name */
474 for (i = repostart - 1; i > 0; i--)
478 Id nid, evrid, p, pp;
479 nid = pool_strn2id(pool, str, i, 0);
482 evrid = pool_strn2id(pool, str + i + 1, repostart - (i + 1), 0);
485 FOR_PROVIDES(p, pp, nid)
487 Solvable *s = pool->solvables + p;
488 if (s->name != nid || s->evr != evrid)
490 if (repo && s->repo != repo)
492 if (arch && s->arch != arch)
502 testcase_job2str(Pool *pool, Id how, Id what)
509 Id select = how & SOLVER_SELECTMASK;
511 for (i = 0; job2str[i].str; i++)
512 if ((how & SOLVER_JOBMASK) == job2str[i].job)
514 jobstr = job2str[i].str ? job2str[i].str : "unknown";
515 if (select == SOLVER_SOLVABLE)
518 pkgstr = testcase_solvid2str(pool, what);
520 else if (select == SOLVER_SOLVABLE_NAME)
523 pkgstr = pool_dep2str(pool, what);
525 else if (select == SOLVER_SOLVABLE_PROVIDES)
527 selstr = " provides ";
528 pkgstr = pool_dep2str(pool, what);
530 else if (select == SOLVER_SOLVABLE_ONE_OF)
535 while ((p = pool->whatprovidesdata[what++]) != 0)
537 const char *s = testcase_solvid2str(pool, p);
540 pkgstr = pool_tmpappend(pool, pkgstr, " ", s);
541 pool_freetmpspace(pool, s);
549 else if (select == SOLVER_SOLVABLE_REPO)
551 Repo *repo = pool_id2repo(pool, what);
556 sprintf(buf, "#%d", repo->repoid);
557 pkgstr = pool_tmpjoin(pool, buf, 0, 0);
560 pkgstr = pool_tmpjoin(pool, repo->name, 0, 0);
562 else if (select == SOLVER_SOLVABLE_ALL)
569 selstr = " unknown ";
572 ret = pool_tmpjoin(pool, jobstr, selstr, pkgstr);
574 ret = pool_tmpappend(pool, ret, " ", 0);
575 for (i = 0; jobflags2str[i].str; i++)
576 if ((how & jobflags2str[i].flag) != 0)
577 ret = pool_tmpappend(pool, ret, ",", jobflags2str[i].str);
583 ret = pool_tmpappend(pool, ret, "]", 0);
589 str2selflags(Pool *pool, char *s) /* modifies the string! */
594 char *se = strchr(s, ',');
597 for (i = 0; selflags2str[i].str; i++)
598 if (!strcmp(s, selflags2str[i].str))
600 selflags |= selflags2str[i].flag;
603 if (!selflags2str[i].str)
604 pool_debug(pool, SOLV_ERROR, "str2job: unknown selection flag '%s'\n", s);
611 str2jobflags(Pool *pool, char *s) /* modifies the string */
616 char *se = strchr(s, ',');
619 for (i = 0; jobflags2str[i].str; i++)
620 if (!strcmp(s, jobflags2str[i].str))
622 jobflags |= jobflags2str[i].flag;
625 if (!jobflags2str[i].str)
626 pool_debug(pool, SOLV_ERROR, "str2job: unknown job flag '%s'\n", s);
633 testcase_str2job(Pool *pool, const char *str, Id *whatp)
643 /* so we can patch it */
644 s = pool_tmpjoin(pool, str, 0, 0);
645 /* split it in pieces */
648 while (*s == ' ' || *s == '\t')
652 pieces = solv_extend(pieces, npieces, 1, sizeof(*pieces), 7);
653 pieces[npieces++] = s;
654 while (*s && *s != ' ' && *s != '\t')
661 pool_debug(pool, SOLV_ERROR, "str2job: bad line '%s'\n", str);
666 for (i = 0; job2str[i].str; i++)
667 if (!strcmp(pieces[0], job2str[i].str))
671 pool_debug(pool, SOLV_ERROR, "str2job: unknown job '%s'\n", str);
675 job = job2str[i].job;
679 char *flags = pieces[npieces - 1];
680 if (*flags == '[' && flags[strlen(flags) - 1] == ']')
684 flags[strlen(flags) - 1] = 0;
685 job |= str2jobflags(pool, flags);
688 if (!strcmp(pieces[1], "pkg"))
692 pool_debug(pool, SOLV_ERROR, "str2job: bad pkg selector in '%s'\n", str);
696 job |= SOLVER_SOLVABLE;
697 what = testcase_str2solvid(pool, pieces[2]);
700 pool_debug(pool, SOLV_ERROR, "str2job: unknown package '%s'\n", pieces[2]);
705 else if (!strcmp(pieces[1], "name") || !strcmp(pieces[1], "provides"))
707 /* join em again for dep2str... */
709 for (sp = pieces[2]; sp < pieces[npieces - 1]; sp++)
713 if (pieces[1][0] == 'p' && strncmp(pieces[2], "namespace:", 10) == 0)
715 char *spe = strchr(pieces[2], '(');
716 int l = strlen(pieces[2]);
717 if (spe && pieces[2][l - 1] == ')')
719 /* special namespace provides */
720 if (strcmp(spe, "(<NULL>)") != 0)
722 pieces[2][l - 1] = 0;
723 what = testcase_str2dep(pool, spe + 1);
724 pieces[2][l - 1] = ')';
726 what = pool_rel2id(pool, pool_strn2id(pool, pieces[2], spe - pieces[2], 1), what, REL_NAMESPACE, 1);
730 what = testcase_str2dep(pool, pieces[2]);
731 if (pieces[1][0] == 'n')
732 job |= SOLVER_SOLVABLE_NAME;
734 job |= SOLVER_SOLVABLE_PROVIDES;
736 else if (!strcmp(pieces[1], "oneof"))
739 job |= SOLVER_SOLVABLE_ONE_OF;
741 if (npieces > 3 && strcmp(pieces[2], "nothing") != 0)
743 for (i = 2; i < npieces; i++)
745 Id p = testcase_str2solvid(pool, pieces[i]);
748 pool_debug(pool, SOLV_ERROR, "str2job: unknown package '%s'\n", pieces[i]);
756 what = pool_queuetowhatprovides(pool, &q);
759 else if (!strcmp(pieces[1], "repo"))
764 pool_debug(pool, SOLV_ERROR, "str2job: bad line '%s'\n", str);
768 repo = testcase_str2repo(pool, pieces[2]);
771 pool_debug(pool, SOLV_ERROR, "str2job: unknown repo '%s'\n", pieces[2]);
775 job |= SOLVER_SOLVABLE_REPO;
778 else if (!strcmp(pieces[1], "all"))
780 if (npieces != 3 && strcmp(pieces[2], "packages") != 0)
782 pool_debug(pool, SOLV_ERROR, "str2job: bad line '%s'\n", str);
786 job |= SOLVER_SOLVABLE_ALL;
791 pool_debug(pool, SOLV_ERROR, "str2job: unknown selection in '%s'\n", str);
801 addselectionjob(Pool *pool, char **pieces, int npieces, Queue *jobqueue)
808 for (i = 0; job2str[i].str; i++)
809 if (!strcmp(pieces[0], job2str[i].str))
813 pool_debug(pool, SOLV_ERROR, "selstr2job: unknown job '%s'\n", pieces[0]);
816 job = job2str[i].job;
819 char *flags = pieces[npieces - 1];
820 if (*flags == '[' && flags[strlen(flags) - 1] == ']')
824 flags[strlen(flags) - 1] = 0;
825 job |= str2jobflags(pool, flags);
830 pool_debug(pool, SOLV_ERROR, "selstr2job: no selection flags\n");
833 selflags = str2selflags(pool, pieces[3]);
835 r = selection_make(pool, &sel, pieces[2], selflags);
836 for (i = 0; i < sel.count; i += 2)
837 queue_push2(jobqueue, job | sel.elements[i], sel.elements[i + 1]);
843 writedeps(Repo *repo, FILE *fp, const char *tag, Id key, Solvable *s, Offset off)
845 Pool *pool = repo->pool;
852 dp = repo->idarraydata + off;
854 while ((id = *dp++) != 0)
856 if (key == SOLVABLE_REQUIRES && id == SOLVABLE_PREREQMARKER)
859 fprintf(fp, "-%s\n", tag);
864 if (key == SOLVABLE_PROVIDES && id == SOLVABLE_FILEMARKER)
869 idstr = pool_dep2str(pool, id);
872 Reldep *rd = GETRELDEP(pool, id);
873 if (key == SOLVABLE_CONFLICTS && rd->flags == REL_NAMESPACE && rd->name == NAMESPACE_OTHERPROVIDERS)
875 if (!strncmp(idstr, "namespace:", 10))
878 if (key == SOLVABLE_SUPPLEMENTS)
880 if (rd->flags == REL_NAMESPACE && rd->name == NAMESPACE_FILESYSTEM)
882 if (!strncmp(idstr, "namespace:", 10))
885 else if (rd->flags == REL_NAMESPACE && rd->name == NAMESPACE_MODALIAS)
887 if (!strncmp(idstr, "namespace:", 10))
890 else if (rd->flags == REL_AND)
892 /* either packageand chain or modalias */
894 if (ISRELDEP(rd->evr))
896 Reldep *mrd = GETRELDEP(pool, rd->evr);
897 if (mrd->flags == REL_NAMESPACE && mrd->name == NAMESPACE_MODALIAS)
899 idstr = pool_tmpjoin(pool, "modalias(", pool_dep2str(pool, rd->name), ":");
900 idstr = pool_tmpappend(pool, idstr, pool_dep2str(pool, mrd->evr), ")");
902 else if (mrd->flags >= 8)
907 /* must be and chain */
908 idstr = pool_dep2str(pool, rd->evr);
914 rd = GETRELDEP(pool, id);
915 if (rd->flags != REL_AND)
917 idstr = pool_tmpjoin(pool, pool_dep2str(pool, rd->evr), ":", idstr);
919 idstr = pool_tmpjoin(pool, pool_dep2str(pool, id), ":", idstr);
920 idstr = pool_tmpjoin(pool, "packageand(", idstr, ")");
923 else if (rd->flags >= 8)
929 fprintf(fp, "+%s\n", tag);
932 fprintf(fp, "%s\n", idstr);
934 if (key == SOLVABLE_PROVIDES)
936 /* add the filelist */
938 dataiterator_init(&di, pool, repo, s - pool->solvables, SOLVABLE_FILELIST, 0, 0);
939 while (dataiterator_step(&di))
941 const char *s = repodata_dir2str(di.data, di.kv.id, di.kv.str);
944 Id id = pool_str2id(pool, s, 0);
947 for (dp = prvdp; *dp; dp++)
951 continue; /* already included */
956 fprintf(fp, "+%s", tag);
959 fprintf(fp, "%s\n", s);
963 fprintf(fp, "-%s\n", tag);
967 testcase_write_testtags(Repo *repo, FILE *fp)
969 Pool *pool = repo->pool;
979 fprintf(fp, "=Ver: 2.0\n");
980 FOR_REPO_SOLVABLES(repo, p, s)
982 name = pool_id2str(pool, s->name);
983 evr = pool_id2str(pool, s->evr);
984 arch = pool_id2str(pool, s->arch);
985 release = strrchr(evr, '-');
987 release = evr + strlen(evr);
988 fprintf(fp, "=Pkg: %s %.*s %s %s\n", name, (int)(release - evr), evr, *release && release[1] ? release + 1 : "-", arch);
989 tmp = solvable_lookup_str(s, SOLVABLE_SUMMARY);
991 fprintf(fp, "=Sum: %s\n", tmp);
992 writedeps(repo, fp, "Req:", SOLVABLE_REQUIRES, s, s->requires);
993 writedeps(repo, fp, "Prv:", SOLVABLE_PROVIDES, s, s->provides);
994 writedeps(repo, fp, "Obs:", SOLVABLE_OBSOLETES, s, s->obsoletes);
995 writedeps(repo, fp, "Con:", SOLVABLE_CONFLICTS, s, s->conflicts);
996 writedeps(repo, fp, "Rec:", SOLVABLE_RECOMMENDS, s, s->recommends);
997 writedeps(repo, fp, "Sup:", SOLVABLE_SUPPLEMENTS, s, s->supplements);
998 writedeps(repo, fp, "Sug:", SOLVABLE_SUGGESTS, s, s->suggests);
999 writedeps(repo, fp, "Enh:", SOLVABLE_ENHANCES, s, s->enhances);
1001 fprintf(fp, "=Vnd: %s\n", pool_id2str(pool, s->vendor));
1002 ti = solvable_lookup_num(s, SOLVABLE_BUILDTIME, 0);
1004 fprintf(fp, "=Tim: %u\n", ti);
1009 static inline Offset
1010 adddep(Repo *repo, Offset olddeps, char *str, Id marker)
1012 Id id = *str == '/' ? pool_str2id(repo->pool, str, 1) : testcase_str2dep(repo->pool, str);
1013 return repo_addid_dep(repo, olddeps, id, marker);
1017 finish_solvable(Pool *pool, Repodata *data, Solvable *s, char *filelist, int nfilelist)
1023 for (l = 0; l < nfilelist; l += strlen(filelist + l) + 1)
1025 char *p = strrchr(filelist + l, '/');
1029 did = repodata_str2dir(data, filelist + l, 1);
1032 did = repodata_str2dir(data, "/", 1);
1033 repodata_add_dirstr(data, s - pool->solvables, SOLVABLE_FILELIST, did, p);
1036 if (s->name && s->arch != ARCH_SRC && s->arch != ARCH_NOSRC)
1037 s->provides = repo_addid_dep(s->repo, s->provides, pool_rel2id(pool, s->name, s->evr, REL_EQ, 1), 0);
1038 s->supplements = repo_fix_supplements(s->repo, s->provides, s->supplements, 0);
1039 s->conflicts = repo_fix_conflicts(s->repo, s->conflicts);
1042 /* stripped down version of susetags parser used for testcases */
1044 testcase_add_testtags(Repo *repo, FILE *fp, int flags)
1046 Pool *pool = repo->pool;
1059 data = repo_add_repodata(repo, flags);
1064 line = solv_malloc(aline);
1068 if (linep - line + 16 > aline)
1070 aline = linep - line;
1071 line = solv_realloc(line, aline + 512);
1072 linep = line + aline;
1075 if (!fgets(linep, aline - (linep - line), fp))
1077 linep += strlen(linep);
1078 if (linep == line || linep[-1] != '\n')
1081 linep = line + intag;
1084 if (line[intag] == '-' && !strncmp(line + 1, line + intag + 1, intag - 2))
1091 else if (line[0] == '+' && line[1] && line[1] != ':')
1093 char *tagend = strchr(line, ':');
1098 intag = tagend + 2 - line;
1099 linep = line + intag;
1102 if (*line != '=' || !line[1] || !line[2] || !line[3] || line[4] != ':')
1104 tag = line[1] << 16 | line[2] << 8 | line[3];
1107 case 'P' << 16 | 'k' << 8 | 'g':
1109 finish_solvable(pool, data, s, filelist, nfilelist);
1111 if (split(line + 5, sp, 5) != 4)
1113 s = pool_id2solvable(pool, repo_add_solvable(repo));
1114 s->name = pool_str2id(pool, sp[0], 1);
1115 /* join back version and release */
1116 if (sp[2] && !(sp[2][0] == '-' && !sp[2][1]))
1118 s->evr = makeevr(pool, sp[1]);
1119 s->arch = pool_str2id(pool, sp[3], 1);
1121 case 'S' << 16 | 'u' << 8 | 'm':
1122 repodata_set_str(data, s - pool->solvables, SOLVABLE_SUMMARY, line + 6);
1124 case 'V' << 16 | 'n' << 8 | 'd':
1125 s->vendor = pool_str2id(pool, line + 6, 1);
1127 case 'T' << 16 | 'i' << 8 | 'm':
1130 repodata_set_num(data, s - pool->solvables, SOLVABLE_BUILDTIME, t);
1132 case 'R' << 16 | 'e' << 8 | 'q':
1133 s->requires = adddep(repo, s->requires, line + 6, -SOLVABLE_PREREQMARKER);
1135 case 'P' << 16 | 'r' << 8 | 'q':
1136 s->requires = adddep(repo, s->requires, line + 6, SOLVABLE_PREREQMARKER);
1138 case 'P' << 16 | 'r' << 8 | 'v':
1141 int l = strlen(line + 6) + 1;
1142 if (nfilelist + l > afilelist)
1144 afilelist = nfilelist + l + 512;
1145 filelist = solv_realloc(filelist, afilelist);
1147 memcpy(filelist + nfilelist, line + 6, l);
1154 for (l = 0; l < nfilelist; l += strlen(filelist + l) + 1)
1155 s->provides = repo_addid_dep(repo, s->provides, pool_str2id(pool, filelist + l, 1), 0);
1158 s->provides = adddep(repo, s->provides, line + 6, 0);
1160 case 'O' << 16 | 'b' << 8 | 's':
1161 s->obsoletes = adddep(repo, s->obsoletes, line + 6, 0);
1163 case 'C' << 16 | 'o' << 8 | 'n':
1164 s->conflicts = adddep(repo, s->conflicts, line + 6, 0);
1166 case 'R' << 16 | 'e' << 8 | 'c':
1167 s->recommends = adddep(repo, s->recommends, line + 6, 0);
1169 case 'S' << 16 | 'u' << 8 | 'p':
1170 s->supplements = adddep(repo, s->supplements, line + 6, 0);
1172 case 'S' << 16 | 'u' << 8 | 'g':
1173 s->suggests = adddep(repo, s->suggests, line + 6, 0);
1175 case 'E' << 16 | 'n' << 8 | 'h':
1176 s->enhances = adddep(repo, s->enhances, line + 6, 0);
1183 finish_solvable(pool, data, s, filelist, nfilelist);
1185 solv_free(filelist);
1186 repodata_free_dircache(data);
1187 if (!(flags & REPO_NO_INTERNALIZE))
1188 repodata_internalize(data);
1193 testcase_getpoolflags(Pool *pool)
1195 const char *str = 0;
1197 for (i = 0; poolflags2str[i].str; i++)
1199 v = pool_get_flag(pool, poolflags2str[i].flag);
1200 if (v == poolflags2str[i].def)
1202 str = pool_tmpappend(pool, str, v ? " " : " !", poolflags2str[i].str);
1204 return str ? str + 1 : "";
1208 testcase_setpoolflags(Pool *pool, const char *str)
1210 const char *p = str, *s;
1214 while (*p == ' ' || *p == '\t' || *p == ',')
1225 while (*p && *p != ' ' && *p != '\t' && *p != ',')
1227 for (i = 0; poolflags2str[i].str; i++)
1228 if (!strncmp(poolflags2str[i].str, s, p - s) && poolflags2str[i].str[p - s] == 0)
1230 if (!poolflags2str[i].str)
1232 pool_debug(pool, SOLV_ERROR, "setpoolflags: unknown flag '%.*s'\n", (int)(p - s), s);
1235 pool_set_flag(pool, poolflags2str[i].flag, v);
1241 testcase_resetpoolflags(Pool *pool)
1244 for (i = 0; poolflags2str[i].str; i++)
1245 pool_set_flag(pool, poolflags2str[i].flag, poolflags2str[i].def);
1249 testcase_getsolverflags(Solver *solv)
1251 Pool *pool = solv->pool;
1252 const char *str = 0;
1254 for (i = 0; solverflags2str[i].str; i++)
1256 v = solver_get_flag(solv, solverflags2str[i].flag);
1257 if (v == solverflags2str[i].def)
1259 str = pool_tmpappend(pool, str, v ? " " : " !", solverflags2str[i].str);
1261 return str ? str + 1 : "";
1265 testcase_setsolverflags(Solver *solv, const char *str)
1267 const char *p = str, *s;
1271 while (*p == ' ' || *p == '\t' || *p == ',')
1282 while (*p && *p != ' ' && *p != '\t' && *p != ',')
1284 for (i = 0; solverflags2str[i].str; i++)
1285 if (!strncmp(solverflags2str[i].str, s, p - s) && solverflags2str[i].str[p - s] == 0)
1287 if (!solverflags2str[i].str)
1289 pool_debug(solv->pool, SOLV_ERROR, "setsolverflags: unknown flag '%.*s'\n", (int)(p - s), s);
1292 solver_set_flag(solv, solverflags2str[i].flag, v);
1298 testcase_resetsolverflags(Solver *solv)
1301 for (i = 0; solverflags2str[i].str; i++)
1302 solver_set_flag(solv, solverflags2str[i].flag, solverflags2str[i].def);
1306 testcase_ruleid(Solver *solv, Id rid)
1312 const unsigned char *md5;
1318 solver_ruleliterals(solv, rid, &q);
1319 for (i = 0; i < q.count; i++)
1321 Id p = q.elements[i];
1322 s = testcase_solvid2str(solv->pool, p > 0 ? p : -p);
1324 s = pool_tmpjoin(solv->pool, "!", s, 0);
1325 strqueue_push(&sq, s);
1328 strqueue_sort_u(&sq);
1329 chk = solv_chksum_create(REPOKEY_TYPE_MD5);
1330 for (i = 0; i < sq.nstr; i++)
1331 solv_chksum_add(chk, sq.str[i], strlen(sq.str[i]) + 1);
1332 md5 = solv_chksum_get(chk, &md5l);
1333 s = pool_bin2hex(solv->pool, md5, md5l);
1334 chk = solv_chksum_free(chk, 0);
1340 testcase_problemid(Solver *solv, Id problem)
1345 const unsigned char *md5;
1349 /* we build a hash of all rules that define the problem */
1352 solver_findallproblemrules(solv, problem, &q);
1353 for (i = 0; i < q.count; i++)
1354 strqueue_push(&sq, testcase_ruleid(solv, q.elements[i]));
1356 strqueue_sort_u(&sq);
1357 chk = solv_chksum_create(REPOKEY_TYPE_MD5);
1358 for (i = 0; i < sq.nstr; i++)
1359 solv_chksum_add(chk, sq.str[i], strlen(sq.str[i]) + 1);
1360 md5 = solv_chksum_get(chk, &md5l);
1361 s = pool_bin2hex(solv->pool, md5, 4);
1362 chk = solv_chksum_free(chk, 0);
1368 testcase_solutionid(Solver *solv, Id problem, Id solution)
1372 const unsigned char *md5;
1376 intid = solver_solutionelement_internalid(solv, problem, solution);
1377 /* internal stuff! handle with care! */
1381 s = testcase_job2str(solv->pool, solv->job.elements[-intid - 1], solv->job.elements[-intid]);
1386 s = testcase_ruleid(solv, intid);
1388 chk = solv_chksum_create(REPOKEY_TYPE_MD5);
1389 solv_chksum_add(chk, s, strlen(s) + 1);
1390 md5 = solv_chksum_get(chk, &md5l);
1391 s = pool_bin2hex(solv->pool, md5, 4);
1392 chk = solv_chksum_free(chk, 0);
1396 static struct class2str {
1400 { SOLVER_TRANSACTION_ERASE, "erase" },
1401 { SOLVER_TRANSACTION_INSTALL, "install" },
1402 { SOLVER_TRANSACTION_REINSTALLED, "reinstall" },
1403 { SOLVER_TRANSACTION_DOWNGRADED, "downgrade" },
1404 { SOLVER_TRANSACTION_CHANGED, "change" },
1405 { SOLVER_TRANSACTION_UPGRADED, "upgrade" },
1406 { SOLVER_TRANSACTION_OBSOLETED, "obsolete" },
1407 { SOLVER_TRANSACTION_MULTIINSTALL, "multiinstall" },
1408 { SOLVER_TRANSACTION_MULTIREINSTALL, "multireinstall" },
1413 testcase_solverresult(Solver *solv, int resultflags)
1415 Pool *pool = solv->pool;
1423 if ((resultflags & TESTCASE_RESULT_TRANSACTION) != 0)
1425 Transaction *trans = solver_create_transaction(solv);
1429 for (i = 0; class2str[i].str; i++)
1432 transaction_classify_pkgs(trans, SOLVER_TRANSACTION_KEEP_PSEUDO, class2str[i].class, 0, 0, &q);
1433 for (j = 0; j < q.count; j++)
1437 if (pool->installed && pool->solvables[p].repo == pool->installed)
1438 op = transaction_obs_pkg(trans, p);
1439 s = pool_tmpjoin(pool, class2str[i].str, " ", testcase_solvid2str(pool, p));
1441 s = pool_tmpjoin(pool, s, " ", testcase_solvid2str(pool, op));
1442 strqueue_push(&sq, s);
1446 transaction_free(trans);
1448 if ((resultflags & TESTCASE_RESULT_PROBLEMS) != 0)
1450 char *probprefix, *solprefix;
1451 int problem, solution, element;
1454 pcnt = solver_problem_count(solv);
1455 for (problem = 1; problem <= pcnt; problem++)
1457 Id rid, from, to, dep;
1458 SolverRuleinfo rinfo;
1459 rid = solver_findproblemrule(solv, problem);
1460 s = testcase_problemid(solv, problem);
1461 probprefix = solv_dupjoin("problem ", s, 0);
1462 rinfo = solver_ruleinfo(solv, rid, &from, &to, &dep);
1463 s = pool_tmpjoin(pool, probprefix, " info ", solver_problemruleinfo2str(solv, rinfo, from, to, dep));
1464 strqueue_push(&sq, s);
1465 scnt = solver_solution_count(solv, problem);
1466 for (solution = 1; solution <= scnt; solution++)
1468 s = testcase_solutionid(solv, problem, solution);
1469 solprefix = solv_dupjoin(probprefix, " solution ", s);
1471 while ((element = solver_next_solutionelement(solv, problem, solution, element, &p, &op)) != 0)
1473 if (p == SOLVER_SOLUTION_JOB)
1474 s = pool_tmpjoin(pool, solprefix, " deljob ", testcase_job2str(pool, solv->job.elements[op - 1], solv->job.elements[op]));
1475 else if (p > 0 && op == 0)
1476 s = pool_tmpjoin(pool, solprefix, " erase ", testcase_solvid2str(pool, p));
1477 else if (p > 0 && op > 0)
1479 s = pool_tmpjoin(pool, solprefix, " replace ", testcase_solvid2str(pool, p));
1480 s = pool_tmpappend(pool, s, " ", testcase_solvid2str(pool, op));
1482 else if (p < 0 && op > 0)
1483 s = pool_tmpjoin(pool, solprefix, " allow ", testcase_solvid2str(pool, op));
1485 s = pool_tmpjoin(pool, solprefix, " unknown", 0);
1486 strqueue_push(&sq, s);
1488 solv_free(solprefix);
1490 solv_free(probprefix);
1494 if ((resultflags & TESTCASE_RESULT_ORPHANED) != 0)
1499 solver_get_orphaned(solv, &q);
1500 for (i = 0; i < q.count; i++)
1502 s = pool_tmpjoin(pool, "orphaned ", testcase_solvid2str(pool, q.elements[i]), 0);
1503 strqueue_push(&sq, s);
1508 if ((resultflags & TESTCASE_RESULT_RECOMMENDED) != 0)
1514 solver_get_recommendations(solv, &qr, &qs, 0);
1515 for (i = 0; i < qr.count; i++)
1517 s = pool_tmpjoin(pool, "recommended ", testcase_solvid2str(pool, qr.elements[i]), 0);
1518 strqueue_push(&sq, s);
1520 for (i = 0; i < qs.count; i++)
1522 s = pool_tmpjoin(pool, "suggested ", testcase_solvid2str(pool, qs.elements[i]), 0);
1523 strqueue_push(&sq, s);
1529 if ((resultflags & TESTCASE_RESULT_UNNEEDED) != 0)
1534 solver_get_unneeded(solv, &q, 0);
1535 for (i = 0; i < q.count; i++)
1537 s = pool_tmpjoin(pool, "unneeded ", testcase_solvid2str(pool, q.elements[i]), 0);
1538 strqueue_push(&sq, s);
1544 result = strqueue_join(&sq);
1551 testcase_write(Solver *solv, char *dir, int resultflags, const char *testcasename, const char *resultname)
1553 Pool *pool = solv->pool;
1564 testcasename = "testcase.t";
1566 resultname = "solver.result";
1568 if (mkdir(dir, 0777) && errno != EEXIST)
1570 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: could not create directory '%s'\n", dir);
1574 FOR_REPOS(repoid, repo)
1576 const char *name = testcase_repoid2str(pool, repoid);
1578 if (repo->subpriority)
1579 sprintf(priobuf, "%d.%d", repo->priority, repo->subpriority);
1581 sprintf(priobuf, "%d", repo->priority);
1582 out = pool_tmpjoin(pool, name, ".repo", ".gz");
1583 cmd = pool_tmpjoin(pool, "repo ", name, " ");
1584 cmd = pool_tmpappend(pool, cmd, priobuf, " ");
1585 cmd = pool_tmpappend(pool, cmd, "testtags ", out);
1586 strqueue_push(&sq, cmd);
1587 out = pool_tmpjoin(pool, dir, "/", out);
1588 if (!(fp = solv_xfopen(out, "w")))
1590 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: could not open '%s' for writing\n", out);
1594 testcase_write_testtags(repo, fp);
1597 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: write error\n");
1602 /* hmm, this is not optimal... we currently search for the lowest score */
1604 arch = pool->solvables[SYSTEMSOLVABLE].arch;
1605 for (i = 0; i < pool->lastarch; i++)
1607 if (pool->id2arch[i] == 1 && !lowscore)
1609 if (pool->id2arch[i] > 0x10000 && (!lowscore || pool->id2arch[i] < lowscore))
1612 lowscore = pool->id2arch[i];
1615 cmd = pool_tmpjoin(pool, "system ", pool->lastarch ? pool_id2str(pool, arch) : "unset", 0);
1616 for (i = 0; disttype2str[i].str != 0; i++)
1617 if (pool->disttype == disttype2str[i].type)
1619 pool_tmpappend(pool, cmd, " ", disttype2str[i].str ? disttype2str[i].str : "unknown");
1620 if (pool->installed)
1621 cmd = pool_tmpappend(pool, cmd, " ", testcase_repoid2str(pool, pool->installed->repoid));
1622 strqueue_push(&sq, cmd);
1623 s = testcase_getpoolflags(solv->pool);
1626 cmd = pool_tmpjoin(pool, "poolflags ", s, 0);
1627 strqueue_push(&sq, cmd);
1630 if (pool->vendorclasses)
1633 for (i = 0; pool->vendorclasses[i]; i++)
1635 cmd = pool_tmpappend(pool, cmd ? cmd : "vendorclass", " ", pool->vendorclasses[i]);
1636 if (!pool->vendorclasses[i + 1])
1638 strqueue_push(&sq, cmd);
1645 s = testcase_getsolverflags(solv);
1648 cmd = pool_tmpjoin(pool, "solverflags ", s, 0);
1649 strqueue_push(&sq, cmd);
1652 /* now dump all the ns callback values we know */
1653 if (pool->nscallback)
1657 for (rid = 1; rid < pool->nrels; rid++)
1659 Reldep *rd = pool->rels + rid;
1660 if (rd->flags != REL_NAMESPACE || rd->name == NAMESPACE_OTHERPROVIDERS)
1662 /* evaluate all namespace ids, skip empty results */
1663 d = pool_whatprovides(pool, MAKERELDEP(rid));
1664 if (!d || !pool->whatprovidesdata[d])
1666 cmd = pool_tmpjoin(pool, "namespace ", pool_id2str(pool, rd->name), "(");
1667 cmd = pool_tmpappend(pool, cmd, pool_id2str(pool, rd->evr), ")");
1668 for (; pool->whatprovidesdata[d]; d++)
1669 cmd = pool_tmpappend(pool, cmd, " ", testcase_solvid2str(pool, pool->whatprovidesdata[d]));
1670 strqueue_push(&sq, cmd);
1674 for (i = 0; i < solv->job.count; i += 2)
1676 cmd = (char *)testcase_job2str(pool, solv->job.elements[i], solv->job.elements[i + 1]);
1677 cmd = pool_tmpjoin(pool, "job ", cmd, 0);
1678 strqueue_push(&sq, cmd);
1685 for (i = 0; resultflags2str[i].str; i++)
1686 if ((resultflags & resultflags2str[i].flag) != 0)
1687 cmd = pool_tmpappend(pool, cmd, cmd ? "," : 0, resultflags2str[i].str);
1688 cmd = pool_tmpjoin(pool, "result ", cmd ? cmd : "?", 0);
1689 cmd = pool_tmpappend(pool, cmd, " ", resultname);
1690 strqueue_push(&sq, cmd);
1691 result = testcase_solverresult(solv, resultflags);
1692 if (!strcmp(resultname, "<inline>"))
1696 strqueue_init(&rsq);
1697 strqueue_split(&rsq, result);
1698 for (i = 0; i < rsq.nstr; i++)
1700 cmd = pool_tmpjoin(pool, "#>", rsq.str[i], 0);
1701 strqueue_push(&sq, cmd);
1703 strqueue_free(&rsq);
1707 out = pool_tmpjoin(pool, dir, "/", resultname);
1708 if (!(fp = fopen(out, "w")))
1710 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: could not open '%s' for writing\n", out);
1715 if (result && *result && fwrite(result, strlen(result), 1, fp) != 1)
1717 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: write error\n");
1724 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: write error\n");
1732 cmd = strqueue_join(&sq);
1733 out = pool_tmpjoin(pool, dir, "/", testcasename);
1734 if (!(fp = fopen(out, "w")))
1736 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: could not open '%s' for writing\n", out);
1740 if (*cmd && fwrite(cmd, strlen(cmd), 1, fp) != 1)
1742 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: write error\n");
1748 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: write error\n");
1758 read_inline_file(FILE *fp, char **bufp, char **bufpp, int *buflp)
1760 char *result = solv_malloc(1024);
1767 if (rp - result + 256 >= resultl)
1769 resultl = rp - result;
1770 result = solv_realloc(result, resultl + 1024);
1771 rp = result + resultl;
1774 if (!fgets(rp, resultl - (rp - result), fp))
1777 if (rl && (rp == result || rp[-1] == '\n'))
1779 if (rl > 1 && rp[0] == '#' && rp[1] == '>')
1781 memmove(rp, rp + 2, rl - 2);
1786 while (rl + 16 > *buflp)
1788 *bufp = solv_realloc(*bufp, *buflp + 512);
1791 memmove(*bufp, rp, rl);
1792 if ((*bufp)[rl - 1] == '\n')
1798 (*bufpp) = *bufp + rl;
1815 char *result = solv_malloc(1024);
1822 if (rp - result + 256 >= resultl)
1824 resultl = rp - result;
1825 result = solv_realloc(result, resultl + 1024);
1826 rp = result + resultl;
1829 rl = fread(rp, 1, resultl - (rp - result), fp);
1841 str2resultflags(Pool *pool, char *s) /* modifies the string! */
1843 int i, resultflags = 0;
1846 char *se = strchr(s, ',');
1849 for (i = 0; resultflags2str[i].str; i++)
1850 if (!strcmp(s, resultflags2str[i].str))
1852 resultflags |= resultflags2str[i].flag;
1855 if (!resultflags2str[i].str)
1856 pool_debug(pool, SOLV_ERROR, "result: unknown flag '%s'\n", s);
1863 testcase_read(Pool *pool, FILE *fp, char *testcase, Queue *job, char **resultp, int *resultflagsp)
1868 char *testcasedir, *s;
1874 int poolflagsreset = 0;
1876 if (!fp && !(fp = fopen(testcase, "r")))
1878 pool_debug(pool, SOLV_ERROR, "testcase_read: could not open '%s'\n", testcase);
1881 testcasedir = solv_strdup(testcase);
1882 if ((s = strrchr(testcasedir, '/')) != 0)
1887 buf = solv_malloc(bufl);
1892 if (bufp - buf + 16 > bufl)
1895 buf = solv_realloc(buf, bufl + 512);
1899 if (!fgets(bufp, bufl - (bufp - buf), fp))
1903 if (!l || buf[l - 1] != '\n')
1910 while (*s && (*s == ' ' || *s == '\t'))
1912 if (!*s || *s == '#')
1915 /* split it in pieces */
1918 while (*s == ' ' || *s == '\t')
1922 pieces = solv_extend(pieces, npieces, 1, sizeof(*pieces), 7);
1923 pieces[npieces++] = s;
1924 while (*s && *s != ' ' && *s != '\t')
1929 pieces = solv_extend(pieces, npieces, 1, sizeof(*pieces), 7);
1930 pieces[npieces] = 0;
1931 if (!strcmp(pieces[0], "repo") && npieces >= 4)
1933 Repo *repo = repo_create(pool, pieces[1]);
1939 if (!poolflagsreset)
1942 testcase_resetpoolflags(pool); /* hmm */
1944 if (sscanf(pieces[2], "%d.%d", &prio, &subprio) != 2)
1947 prio = atoi(pieces[2]);
1949 repo->priority = prio;
1950 repo->subpriority = subprio;
1951 if (strcmp(pieces[3], "empty") != 0)
1953 const char *repotype = pool_tmpjoin(pool, pieces[3], 0, 0); /* gets overwritten in <inline> case */
1954 if (!strcmp(pieces[4], "<inline>"))
1956 char *idata = read_inline_file(fp, &buf, &bufp, &bufl);
1958 rfp = solv_xfopen_buf(rdata, &idata, 0, "rf");
1962 rdata = pool_tmpjoin(pool, testcasedir, pieces[4], 0);
1963 rfp = solv_xfopen(rdata, "r");
1967 pool_debug(pool, SOLV_ERROR, "testcase_read: could not open '%s'\n", rdata);
1969 else if (!strcmp(repotype, "testtags"))
1971 testcase_add_testtags(repo, rfp, 0);
1974 else if (!strcmp(repotype, "solv"))
1976 repo_add_solv(repo, rfp, 0);
1980 else if (!strcmp(repotype, "helix"))
1982 repo_add_helix(repo, rfp, 0);
1989 pool_debug(pool, SOLV_ERROR, "testcase_read: unknown repo type for repo '%s'\n", repo->name);
1993 else if (!strcmp(pieces[0], "system") && npieces >= 3)
1997 /* must set the disttype before the arch */
1998 for (i = 0; disttype2str[i].str != 0; i++)
1999 if (!strcmp(disttype2str[i].str, pieces[2]))
2001 if (!disttype2str[i].str)
2002 pool_debug(pool, SOLV_ERROR, "testcase_read: system: unknown disttype '%s'\n", pieces[2]);
2003 else if (pool->disttype != disttype2str[i].type)
2005 #ifdef MULTI_SEMANTICS
2006 pool_setdisttype(pool, disttype2str[i].type);
2008 pool_debug(pool, SOLV_ERROR, "testcase_read: system: cannot change disttype to '%s'\n", pieces[2]);
2011 if (strcmp(pieces[1], "unset") != 0)
2012 pool_setarch(pool, pieces[1]);
2014 pool_setarch(pool, 0);
2017 Repo *repo = testcase_str2repo(pool, pieces[3]);
2019 pool_debug(pool, SOLV_ERROR, "testcase_read: system: unknown repo '%s'\n", pieces[3]);
2021 pool_set_installed(pool, repo);
2024 else if (!strcmp(pieces[0], "job") && npieces > 1)
2030 pool_addfileprovides(pool);
2031 pool_createwhatprovides(pool);
2034 if (npieces >= 3 && !strcmp(pieces[2], "selection"))
2036 addselectionjob(pool, pieces + 1, npieces - 1, job);
2040 for (sp = pieces[1]; sp < pieces[npieces - 1]; sp++)
2043 how = testcase_str2job(pool, pieces[1], &what);
2044 if (how >= 0 && job)
2045 queue_push2(job, how, what);
2047 else if (!strcmp(pieces[0], "vendorclass") && npieces > 1)
2049 pool_addvendorclass(pool, (const char **)(pieces + 1));
2051 else if (!strcmp(pieces[0], "namespace") && npieces > 1)
2053 int i = strlen(pieces[1]);
2054 s = strchr(pieces[1], '(');
2055 if (!s && pieces[1][i - 1] != ')')
2057 pool_debug(pool, SOLV_ERROR, "testcase_read: bad namespace '%s'\n", pieces[1]);
2065 pieces[1][i - 1] = 0;
2066 name = pool_str2id(pool, pieces[1], 1);
2067 evr = pool_str2id(pool, s + 1, 1);
2069 pieces[1][i - 1] = ')';
2070 id = pool_rel2id(pool, name, evr, REL_NAMESPACE, 1);
2071 for (i = 2; i < npieces; i++)
2072 queue_push(&q, testcase_str2solvid(pool, pieces[i]));
2073 /* now do the callback */
2076 pool_addfileprovides(pool);
2077 pool_createwhatprovides(pool);
2080 pool->whatprovides_rel[GETRELID(id)] = pool_queuetowhatprovides(pool, &q);
2084 else if (!strcmp(pieces[0], "poolflags"))
2087 if (!poolflagsreset)
2090 testcase_resetpoolflags(pool); /* hmm */
2092 for (i = 1; i < npieces; i++)
2093 testcase_setpoolflags(pool, pieces[i]);
2095 else if (!strcmp(pieces[0], "solverflags") && npieces > 1)
2100 solv = solver_create(pool);
2101 testcase_resetsolverflags(solv);
2103 for (i = 1; i < npieces; i++)
2104 testcase_setsolverflags(solv, pieces[i]);
2106 else if (!strcmp(pieces[0], "result") && npieces > 2)
2109 int resultflags = str2resultflags(pool, pieces[1]);
2110 const char *rdata = pool_tmpjoin(pool, testcasedir, pieces[2], 0);
2111 if (!strcmp(pieces[2], "<inline>"))
2112 result = read_inline_file(fp, &buf, &bufp, &bufl);
2115 FILE *rfp = fopen(rdata, "r");
2117 pool_debug(pool, SOLV_ERROR, "testcase_read: could not open '%s'\n", rdata);
2120 result = read_file(rfp);
2129 *resultflagsp = resultflags;
2131 else if (!strcmp(pieces[0], "nextjob") && npieces == 1)
2137 pool_debug(pool, SOLV_ERROR, "testcase_read: cannot parse command '%s'\n", pieces[0]);
2140 buf = solv_free(buf);
2141 pieces = solv_free(pieces);
2142 solv_free(testcasedir);
2145 pool_addfileprovides(pool);
2146 pool_createwhatprovides(pool);
2150 solv = solver_create(pool);
2151 testcase_resetsolverflags(solv);
2159 testcase_resultdiff(char *result1, char *result2)
2161 Strqueue sq1, sq2, osq;
2163 strqueue_init(&sq1);
2164 strqueue_init(&sq2);
2165 strqueue_init(&osq);
2166 strqueue_split(&sq1, result1);
2167 strqueue_split(&sq2, result2);
2168 strqueue_sort(&sq1);
2169 strqueue_sort(&sq2);
2170 strqueue_diff(&sq1, &sq2, &osq);
2171 r = osq.nstr ? strqueue_join(&osq) : 0;
2172 strqueue_free(&sq1);
2173 strqueue_free(&sq2);
2174 strqueue_free(&osq);