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_IMPLICITOBSOLETEUSESCOLORS, "implicitobsoleteusescolors", 0 },
114 { POOL_FLAG_NOINSTALLEDOBSOLETES, "noinstalledobsoletes", 0 },
115 { POOL_FLAG_HAVEDISTEPOCH, "havedistepoch", 0 },
116 { POOL_FLAG_NOOBSOLETESMULTIVERSION, "noobsoletesmultiversion", 0 },
117 { POOL_FLAG_ADDFILEPROVIDESFILTERED, "addfileprovidesfiltered", 0 },
121 static struct disttype2str {
125 { DISTTYPE_RPM, "rpm" },
126 { DISTTYPE_DEB, "deb" },
127 { DISTTYPE_ARCH, "arch" },
131 static struct selflags2str {
135 { SELECTION_NAME, "name" },
136 { SELECTION_PROVIDES, "provides" },
137 { SELECTION_FILELIST, "filelist" },
138 { SELECTION_CANON, "canon" },
139 { SELECTION_DOTARCH, "dotarch" },
140 { SELECTION_REL, "rel" },
141 { SELECTION_INSTALLED_ONLY, "installedonly" },
142 { SELECTION_GLOB, "glob" },
143 { SELECTION_FLAT, "flat" },
144 { SELECTION_NOCASE, "nocase" },
145 { SELECTION_SOURCE_ONLY, "sourceonly" },
146 { SELECTION_WITH_SOURCE, "withsource" },
151 typedef struct strqueue {
156 #define STRQUEUE_BLOCK 63
159 strqueue_init(Strqueue *q)
166 strqueue_free(Strqueue *q)
169 for (i = 0; i < q->nstr; i++)
170 solv_free(q->str[i]);
171 q->str = solv_free(q->str);
176 strqueue_push(Strqueue *q, const char *s)
178 q->str = solv_extend(q->str, q->nstr, 1, sizeof(*q->str), STRQUEUE_BLOCK);
179 q->str[q->nstr++] = solv_strdup(s);
183 strqueue_pushjoin(Strqueue *q, const char *s1, const char *s2, const char *s3)
185 q->str = solv_extend(q->str, q->nstr, 1, sizeof(*q->str), STRQUEUE_BLOCK);
186 q->str[q->nstr++] = solv_dupjoin(s1, s2, s3);
190 strqueue_sort_cmp(const void *ap, const void *bp, void *dp)
192 const char *a = *(const char **)ap;
193 const char *b = *(const char **)bp;
194 return strcmp(a ? a : "", b ? b : "");
198 strqueue_sort(Strqueue *q)
201 solv_sort(q->str, q->nstr, sizeof(*q->str), strqueue_sort_cmp, 0);
205 strqueue_sort_u(Strqueue *q)
209 for (i = j = 0; i < q->nstr; i++)
210 if (!j || strqueue_sort_cmp(q->str + i, q->str + j - 1, 0) != 0)
211 q->str[j++] = q->str[i];
216 strqueue_join(Strqueue *q)
220 for (i = 0; i < q->nstr; i++)
222 l += strlen(q->str[i]) + 1;
223 l++; /* trailing \0 */
226 for (i = 0; i < q->nstr; i++)
229 strcpy(rp, q->str[i]);
238 strqueue_split(Strqueue *q, const char *s)
243 while ((p = strchr(s, '\n')) != 0)
245 q->str = solv_extend(q->str, q->nstr, 1, sizeof(*q->str), STRQUEUE_BLOCK);
246 q->str[q->nstr] = solv_malloc(p - s + 1);
248 memcpy(q->str[q->nstr], s, p - s);
249 q->str[q->nstr][p - s] = 0;
258 strqueue_diff(Strqueue *sq1, Strqueue *sq2, Strqueue *osq)
261 while (i < sq1->nstr && j < sq2->nstr)
263 int r = strqueue_sort_cmp(sq1->str + i, sq2->str + j, 0);
267 strqueue_pushjoin(osq, "-", sq1->str[i++], 0);
269 strqueue_pushjoin(osq, "+", sq2->str[j++], 0);
271 while (i < sq1->nstr)
272 strqueue_pushjoin(osq, "-", sq1->str[i++], 0);
273 while (j < sq2->nstr)
274 strqueue_pushjoin(osq, "+", sq2->str[j++], 0);
278 pool_isknownarch(Pool *pool, Id id)
280 if (!id || id == ID_EMPTY)
282 if (id == ARCH_SRC || id == ARCH_NOSRC || id == ARCH_NOARCH)
284 if (!pool->id2arch || (id > pool->lastarch || !pool->id2arch[id]))
290 testcase_str2dep(Pool *pool, char *s)
296 if ((n = strchr(s, '|')) != 0)
298 id = testcase_str2dep(pool, n + 1);
300 id = pool_rel2id(pool, testcase_str2dep(pool, s), id, REL_OR, 1);
304 while (*s == ' ' || *s == '\t')
307 while (*s && *s != ' ' && *s != '\t' && *s != '<' && *s != '=' && *s != '>')
311 while (*s && *s != ')')
317 if ((a = strchr(n, '.')) != 0 && a + 1 < s && s[-1] != ')')
319 Id archid = pool_strn2id(pool, a + 1, s - (a + 1), 0);
320 if (pool_isknownarch(pool, archid))
322 id = pool_strn2id(pool, n, a - n, 1);
323 id = pool_rel2id(pool, id, archid, REL_ARCH, 1);
326 id = pool_strn2id(pool, n, s - n, 1);
329 id = pool_strn2id(pool, n, s - n, 1);
332 while (*s == ' ' || *s == '\t')
335 if (*s == '!' && s[1] == '=') /* support != as synonym for <> */
337 flags = REL_LT | REL_GT;
351 if (!flags && *s == 'c' && !strcmp(s, "compat >="))
358 while (*s == ' ' || *s == '\t')
361 while (*s && *s != ' ' && *s != '\t')
363 return pool_rel2id(pool, id, pool_strn2id(pool, n, s - n, 1), flags, 1);
367 testcase_repoid2str(Pool *pool, Id repoid)
369 Repo *repo = pool_id2repo(pool, repoid);
372 char *r = pool_tmpjoin(pool, repo->name, 0, 0);
374 for (rp = r; *rp; rp++)
375 if (*rp == ' ' || *rp == '\t')
382 sprintf(buf, "#%d", repoid);
383 return pool_tmpjoin(pool, buf, 0, 0);
388 testcase_solvid2str(Pool *pool, Id p)
390 Solvable *s = pool->solvables + p;
391 const char *n, *e, *a;
394 if (p == SYSTEMSOLVABLE)
396 n = pool_id2str(pool, s->name);
397 e = pool_id2str(pool, s->evr);
398 a = pool_id2str(pool, s->arch);
399 str = pool_alloctmpspace(pool, strlen(n) + strlen(e) + strlen(a) + 3);
400 sprintf(str, "%s-%s.%s", n, e, a);
402 return pool_tmpappend(pool, str, "@", 0);
406 char *str2 = pool_tmpappend(pool, str, "@", s->repo->name);
408 if (str2[l] == ' ' || str2[l] == '\t')
412 sprintf(buf, "@#%d", s->repo->repoid);
413 return pool_tmpappend(pool, str, buf, 0);
417 testcase_str2repo(Pool *pool, const char *str)
421 if (str[0] == '#' && (str[1] >= '0' && str[1] <= '9'))
425 for (j = 1; str[j] >= '0' && str[j] <= '9'; j++)
426 repoid = repoid * 10 + (str[j] - '0');
427 if (!str[j] && repoid > 0 && repoid < pool->nrepos)
428 repo = pool_id2repo(pool, repoid);
432 FOR_REPOS(repoid, repo)
437 l = strlen(repo->name);
438 for (i = 0; i < l; i++)
440 int c = repo->name[i];
441 if (c == ' ' || c == '\t')
446 if (i == l && !str[l])
449 if (repoid >= pool->nrepos)
456 testcase_str2solvid(Pool *pool, const char *str)
458 int i, l = strlen(str);
465 if (*str == '@' && !strcmp(str, "@SYSTEM"))
466 return SYSTEMSOLVABLE;
468 for (i = l - 1; i >= 0; i--)
469 if (str[i] == '@' && (repo = testcase_str2repo(pool, str + i + 1)) != 0)
474 /* now find the arch (if present) */
476 for (i = repostart - 1; i > 0; i--)
479 arch = pool_strn2id(pool, str + i + 1, repostart - (i + 1), 0);
484 /* now find the name */
485 for (i = repostart - 1; i > 0; i--)
489 Id nid, evrid, p, pp;
490 nid = pool_strn2id(pool, str, i, 0);
493 evrid = pool_strn2id(pool, str + i + 1, repostart - (i + 1), 0);
496 FOR_PROVIDES(p, pp, nid)
498 Solvable *s = pool->solvables + p;
499 if (s->name != nid || s->evr != evrid)
501 if (repo && s->repo != repo)
503 if (arch && s->arch != arch)
513 testcase_job2str(Pool *pool, Id how, Id what)
520 Id select = how & SOLVER_SELECTMASK;
522 for (i = 0; job2str[i].str; i++)
523 if ((how & SOLVER_JOBMASK) == job2str[i].job)
525 jobstr = job2str[i].str ? job2str[i].str : "unknown";
526 if (select == SOLVER_SOLVABLE)
529 pkgstr = testcase_solvid2str(pool, what);
531 else if (select == SOLVER_SOLVABLE_NAME)
534 pkgstr = pool_dep2str(pool, what);
536 else if (select == SOLVER_SOLVABLE_PROVIDES)
538 selstr = " provides ";
539 pkgstr = pool_dep2str(pool, what);
541 else if (select == SOLVER_SOLVABLE_ONE_OF)
546 while ((p = pool->whatprovidesdata[what++]) != 0)
548 const char *s = testcase_solvid2str(pool, p);
551 pkgstr = pool_tmpappend(pool, pkgstr, " ", s);
552 pool_freetmpspace(pool, s);
560 else if (select == SOLVER_SOLVABLE_REPO)
562 Repo *repo = pool_id2repo(pool, what);
567 sprintf(buf, "#%d", repo->repoid);
568 pkgstr = pool_tmpjoin(pool, buf, 0, 0);
571 pkgstr = pool_tmpjoin(pool, repo->name, 0, 0);
573 else if (select == SOLVER_SOLVABLE_ALL)
580 selstr = " unknown ";
583 ret = pool_tmpjoin(pool, jobstr, selstr, pkgstr);
585 ret = pool_tmpappend(pool, ret, " ", 0);
586 for (i = 0; jobflags2str[i].str; i++)
587 if ((how & jobflags2str[i].flag) != 0)
588 ret = pool_tmpappend(pool, ret, ",", jobflags2str[i].str);
594 ret = pool_tmpappend(pool, ret, "]", 0);
600 str2selflags(Pool *pool, char *s) /* modifies the string! */
605 char *se = strchr(s, ',');
608 for (i = 0; selflags2str[i].str; i++)
609 if (!strcmp(s, selflags2str[i].str))
611 selflags |= selflags2str[i].flag;
614 if (!selflags2str[i].str)
615 pool_debug(pool, SOLV_ERROR, "str2job: unknown selection flag '%s'\n", s);
622 str2jobflags(Pool *pool, char *s) /* modifies the string */
627 char *se = strchr(s, ',');
630 for (i = 0; jobflags2str[i].str; i++)
631 if (!strcmp(s, jobflags2str[i].str))
633 jobflags |= jobflags2str[i].flag;
636 if (!jobflags2str[i].str)
637 pool_debug(pool, SOLV_ERROR, "str2job: unknown job flag '%s'\n", s);
644 testcase_str2job(Pool *pool, const char *str, Id *whatp)
654 /* so we can patch it */
655 s = pool_tmpjoin(pool, str, 0, 0);
656 /* split it in pieces */
659 while (*s == ' ' || *s == '\t')
663 pieces = solv_extend(pieces, npieces, 1, sizeof(*pieces), 7);
664 pieces[npieces++] = s;
665 while (*s && *s != ' ' && *s != '\t')
672 pool_debug(pool, SOLV_ERROR, "str2job: bad line '%s'\n", str);
677 for (i = 0; job2str[i].str; i++)
678 if (!strcmp(pieces[0], job2str[i].str))
682 pool_debug(pool, SOLV_ERROR, "str2job: unknown job '%s'\n", str);
686 job = job2str[i].job;
690 char *flags = pieces[npieces - 1];
691 if (*flags == '[' && flags[strlen(flags) - 1] == ']')
695 flags[strlen(flags) - 1] = 0;
696 job |= str2jobflags(pool, flags);
699 if (!strcmp(pieces[1], "pkg"))
703 pool_debug(pool, SOLV_ERROR, "str2job: bad pkg selector in '%s'\n", str);
707 job |= SOLVER_SOLVABLE;
708 what = testcase_str2solvid(pool, pieces[2]);
711 pool_debug(pool, SOLV_ERROR, "str2job: unknown package '%s'\n", pieces[2]);
716 else if (!strcmp(pieces[1], "name") || !strcmp(pieces[1], "provides"))
718 /* join em again for dep2str... */
720 for (sp = pieces[2]; sp < pieces[npieces - 1]; sp++)
724 if (pieces[1][0] == 'p' && strncmp(pieces[2], "namespace:", 10) == 0)
726 char *spe = strchr(pieces[2], '(');
727 int l = strlen(pieces[2]);
728 if (spe && pieces[2][l - 1] == ')')
730 /* special namespace provides */
731 if (strcmp(spe, "(<NULL>)") != 0)
733 pieces[2][l - 1] = 0;
734 what = testcase_str2dep(pool, spe + 1);
735 pieces[2][l - 1] = ')';
737 what = pool_rel2id(pool, pool_strn2id(pool, pieces[2], spe - pieces[2], 1), what, REL_NAMESPACE, 1);
741 what = testcase_str2dep(pool, pieces[2]);
742 if (pieces[1][0] == 'n')
743 job |= SOLVER_SOLVABLE_NAME;
745 job |= SOLVER_SOLVABLE_PROVIDES;
747 else if (!strcmp(pieces[1], "oneof"))
750 job |= SOLVER_SOLVABLE_ONE_OF;
752 if (npieces > 3 && strcmp(pieces[2], "nothing") != 0)
754 for (i = 2; i < npieces; i++)
756 Id p = testcase_str2solvid(pool, pieces[i]);
759 pool_debug(pool, SOLV_ERROR, "str2job: unknown package '%s'\n", pieces[i]);
767 what = pool_queuetowhatprovides(pool, &q);
770 else if (!strcmp(pieces[1], "repo"))
775 pool_debug(pool, SOLV_ERROR, "str2job: bad line '%s'\n", str);
779 repo = testcase_str2repo(pool, pieces[2]);
782 pool_debug(pool, SOLV_ERROR, "str2job: unknown repo '%s'\n", pieces[2]);
786 job |= SOLVER_SOLVABLE_REPO;
789 else if (!strcmp(pieces[1], "all"))
791 if (npieces != 3 && strcmp(pieces[2], "packages") != 0)
793 pool_debug(pool, SOLV_ERROR, "str2job: bad line '%s'\n", str);
797 job |= SOLVER_SOLVABLE_ALL;
802 pool_debug(pool, SOLV_ERROR, "str2job: unknown selection in '%s'\n", str);
812 addselectionjob(Pool *pool, char **pieces, int npieces, Queue *jobqueue)
819 for (i = 0; job2str[i].str; i++)
820 if (!strcmp(pieces[0], job2str[i].str))
824 pool_debug(pool, SOLV_ERROR, "selstr2job: unknown job '%s'\n", pieces[0]);
827 job = job2str[i].job;
830 char *flags = pieces[npieces - 1];
831 if (*flags == '[' && flags[strlen(flags) - 1] == ']')
835 flags[strlen(flags) - 1] = 0;
836 job |= str2jobflags(pool, flags);
841 pool_debug(pool, SOLV_ERROR, "selstr2job: no selection flags\n");
844 selflags = str2selflags(pool, pieces[3]);
846 r = selection_make(pool, &sel, pieces[2], selflags);
847 for (i = 0; i < sel.count; i += 2)
848 queue_push2(jobqueue, job | sel.elements[i], sel.elements[i + 1]);
854 writedeps(Repo *repo, FILE *fp, const char *tag, Id key, Solvable *s, Offset off)
856 Pool *pool = repo->pool;
863 dp = repo->idarraydata + off;
865 while ((id = *dp++) != 0)
867 if (key == SOLVABLE_REQUIRES && id == SOLVABLE_PREREQMARKER)
870 fprintf(fp, "-%s\n", tag);
875 if (key == SOLVABLE_PROVIDES && id == SOLVABLE_FILEMARKER)
880 idstr = pool_dep2str(pool, id);
883 Reldep *rd = GETRELDEP(pool, id);
884 if (key == SOLVABLE_CONFLICTS && rd->flags == REL_NAMESPACE && rd->name == NAMESPACE_OTHERPROVIDERS)
886 if (!strncmp(idstr, "namespace:", 10))
889 if (key == SOLVABLE_SUPPLEMENTS)
891 if (rd->flags == REL_NAMESPACE && rd->name == NAMESPACE_FILESYSTEM)
893 if (!strncmp(idstr, "namespace:", 10))
896 else if (rd->flags == REL_NAMESPACE && rd->name == NAMESPACE_MODALIAS)
898 if (!strncmp(idstr, "namespace:", 10))
901 else if (rd->flags == REL_AND)
903 /* either packageand chain or modalias */
905 if (ISRELDEP(rd->evr))
907 Reldep *mrd = GETRELDEP(pool, rd->evr);
908 if (mrd->flags == REL_NAMESPACE && mrd->name == NAMESPACE_MODALIAS)
910 idstr = pool_tmpjoin(pool, "modalias(", pool_dep2str(pool, rd->name), ":");
911 idstr = pool_tmpappend(pool, idstr, pool_dep2str(pool, mrd->evr), ")");
913 else if (mrd->flags >= 8)
918 /* must be and chain */
919 idstr = pool_dep2str(pool, rd->evr);
925 rd = GETRELDEP(pool, id);
926 if (rd->flags != REL_AND)
928 idstr = pool_tmpjoin(pool, pool_dep2str(pool, rd->evr), ":", idstr);
930 idstr = pool_tmpjoin(pool, pool_dep2str(pool, id), ":", idstr);
931 idstr = pool_tmpjoin(pool, "packageand(", idstr, ")");
934 else if (rd->flags >= 8)
940 fprintf(fp, "+%s\n", tag);
943 fprintf(fp, "%s\n", idstr);
945 if (key == SOLVABLE_PROVIDES)
947 /* add the filelist */
949 dataiterator_init(&di, pool, repo, s - pool->solvables, SOLVABLE_FILELIST, 0, 0);
950 while (dataiterator_step(&di))
952 const char *s = repodata_dir2str(di.data, di.kv.id, di.kv.str);
955 Id id = pool_str2id(pool, s, 0);
958 for (dp = prvdp; *dp; dp++)
962 continue; /* already included */
967 fprintf(fp, "+%s", tag);
970 fprintf(fp, "%s\n", s);
974 fprintf(fp, "-%s\n", tag);
978 testcase_write_testtags(Repo *repo, FILE *fp)
980 Pool *pool = repo->pool;
990 fprintf(fp, "=Ver: 2.0\n");
991 FOR_REPO_SOLVABLES(repo, p, s)
993 name = pool_id2str(pool, s->name);
994 evr = pool_id2str(pool, s->evr);
995 arch = pool_id2str(pool, s->arch);
996 release = strrchr(evr, '-');
998 release = evr + strlen(evr);
999 fprintf(fp, "=Pkg: %s %.*s %s %s\n", name, (int)(release - evr), evr, *release && release[1] ? release + 1 : "-", arch);
1000 tmp = solvable_lookup_str(s, SOLVABLE_SUMMARY);
1002 fprintf(fp, "=Sum: %s\n", tmp);
1003 writedeps(repo, fp, "Req:", SOLVABLE_REQUIRES, s, s->requires);
1004 writedeps(repo, fp, "Prv:", SOLVABLE_PROVIDES, s, s->provides);
1005 writedeps(repo, fp, "Obs:", SOLVABLE_OBSOLETES, s, s->obsoletes);
1006 writedeps(repo, fp, "Con:", SOLVABLE_CONFLICTS, s, s->conflicts);
1007 writedeps(repo, fp, "Rec:", SOLVABLE_RECOMMENDS, s, s->recommends);
1008 writedeps(repo, fp, "Sup:", SOLVABLE_SUPPLEMENTS, s, s->supplements);
1009 writedeps(repo, fp, "Sug:", SOLVABLE_SUGGESTS, s, s->suggests);
1010 writedeps(repo, fp, "Enh:", SOLVABLE_ENHANCES, s, s->enhances);
1012 fprintf(fp, "=Vnd: %s\n", pool_id2str(pool, s->vendor));
1013 ti = solvable_lookup_num(s, SOLVABLE_BUILDTIME, 0);
1015 fprintf(fp, "=Tim: %u\n", ti);
1020 static inline Offset
1021 adddep(Repo *repo, Offset olddeps, char *str, Id marker)
1023 Id id = *str == '/' ? pool_str2id(repo->pool, str, 1) : testcase_str2dep(repo->pool, str);
1024 return repo_addid_dep(repo, olddeps, id, marker);
1028 finish_solvable(Pool *pool, Repodata *data, Solvable *s, char *filelist, int nfilelist)
1034 for (l = 0; l < nfilelist; l += strlen(filelist + l) + 1)
1036 char *p = strrchr(filelist + l, '/');
1040 did = repodata_str2dir(data, filelist + l, 1);
1043 did = repodata_str2dir(data, "/", 1);
1044 repodata_add_dirstr(data, s - pool->solvables, SOLVABLE_FILELIST, did, p);
1047 if (s->name && s->arch != ARCH_SRC && s->arch != ARCH_NOSRC)
1048 s->provides = repo_addid_dep(s->repo, s->provides, pool_rel2id(pool, s->name, s->evr, REL_EQ, 1), 0);
1049 s->supplements = repo_fix_supplements(s->repo, s->provides, s->supplements, 0);
1050 s->conflicts = repo_fix_conflicts(s->repo, s->conflicts);
1053 /* stripped down version of susetags parser used for testcases */
1055 testcase_add_testtags(Repo *repo, FILE *fp, int flags)
1057 Pool *pool = repo->pool;
1070 data = repo_add_repodata(repo, flags);
1075 line = solv_malloc(aline);
1079 if (linep - line + 16 > aline)
1081 aline = linep - line;
1082 line = solv_realloc(line, aline + 512);
1083 linep = line + aline;
1086 if (!fgets(linep, aline - (linep - line), fp))
1088 linep += strlen(linep);
1089 if (linep == line || linep[-1] != '\n')
1092 linep = line + intag;
1095 if (line[intag] == '-' && !strncmp(line + 1, line + intag + 1, intag - 2))
1102 else if (line[0] == '+' && line[1] && line[1] != ':')
1104 char *tagend = strchr(line, ':');
1109 intag = tagend + 2 - line;
1110 linep = line + intag;
1113 if (*line != '=' || !line[1] || !line[2] || !line[3] || line[4] != ':')
1115 tag = line[1] << 16 | line[2] << 8 | line[3];
1118 case 'P' << 16 | 'k' << 8 | 'g':
1120 finish_solvable(pool, data, s, filelist, nfilelist);
1122 if (split(line + 5, sp, 5) != 4)
1124 s = pool_id2solvable(pool, repo_add_solvable(repo));
1125 s->name = pool_str2id(pool, sp[0], 1);
1126 /* join back version and release */
1127 if (sp[2] && !(sp[2][0] == '-' && !sp[2][1]))
1129 s->evr = makeevr(pool, sp[1]);
1130 s->arch = pool_str2id(pool, sp[3], 1);
1132 case 'S' << 16 | 'u' << 8 | 'm':
1133 repodata_set_str(data, s - pool->solvables, SOLVABLE_SUMMARY, line + 6);
1135 case 'V' << 16 | 'n' << 8 | 'd':
1136 s->vendor = pool_str2id(pool, line + 6, 1);
1138 case 'T' << 16 | 'i' << 8 | 'm':
1141 repodata_set_num(data, s - pool->solvables, SOLVABLE_BUILDTIME, t);
1143 case 'R' << 16 | 'e' << 8 | 'q':
1144 s->requires = adddep(repo, s->requires, line + 6, -SOLVABLE_PREREQMARKER);
1146 case 'P' << 16 | 'r' << 8 | 'q':
1147 s->requires = adddep(repo, s->requires, line + 6, SOLVABLE_PREREQMARKER);
1149 case 'P' << 16 | 'r' << 8 | 'v':
1152 int l = strlen(line + 6) + 1;
1153 if (nfilelist + l > afilelist)
1155 afilelist = nfilelist + l + 512;
1156 filelist = solv_realloc(filelist, afilelist);
1158 memcpy(filelist + nfilelist, line + 6, l);
1165 for (l = 0; l < nfilelist; l += strlen(filelist + l) + 1)
1166 s->provides = repo_addid_dep(repo, s->provides, pool_str2id(pool, filelist + l, 1), 0);
1169 s->provides = adddep(repo, s->provides, line + 6, 0);
1171 case 'O' << 16 | 'b' << 8 | 's':
1172 s->obsoletes = adddep(repo, s->obsoletes, line + 6, 0);
1174 case 'C' << 16 | 'o' << 8 | 'n':
1175 s->conflicts = adddep(repo, s->conflicts, line + 6, 0);
1177 case 'R' << 16 | 'e' << 8 | 'c':
1178 s->recommends = adddep(repo, s->recommends, line + 6, 0);
1180 case 'S' << 16 | 'u' << 8 | 'p':
1181 s->supplements = adddep(repo, s->supplements, line + 6, 0);
1183 case 'S' << 16 | 'u' << 8 | 'g':
1184 s->suggests = adddep(repo, s->suggests, line + 6, 0);
1186 case 'E' << 16 | 'n' << 8 | 'h':
1187 s->enhances = adddep(repo, s->enhances, line + 6, 0);
1194 finish_solvable(pool, data, s, filelist, nfilelist);
1196 solv_free(filelist);
1197 repodata_free_dircache(data);
1198 if (!(flags & REPO_NO_INTERNALIZE))
1199 repodata_internalize(data);
1204 testcase_getpoolflags(Pool *pool)
1206 const char *str = 0;
1208 for (i = 0; poolflags2str[i].str; i++)
1210 v = pool_get_flag(pool, poolflags2str[i].flag);
1211 if (v == poolflags2str[i].def)
1213 str = pool_tmpappend(pool, str, v ? " " : " !", poolflags2str[i].str);
1215 return str ? str + 1 : "";
1219 testcase_setpoolflags(Pool *pool, const char *str)
1221 const char *p = str, *s;
1225 while (*p == ' ' || *p == '\t' || *p == ',')
1236 while (*p && *p != ' ' && *p != '\t' && *p != ',')
1238 for (i = 0; poolflags2str[i].str; i++)
1239 if (!strncmp(poolflags2str[i].str, s, p - s) && poolflags2str[i].str[p - s] == 0)
1241 if (!poolflags2str[i].str)
1243 pool_debug(pool, SOLV_ERROR, "setpoolflags: unknown flag '%.*s'\n", (int)(p - s), s);
1246 pool_set_flag(pool, poolflags2str[i].flag, v);
1252 testcase_resetpoolflags(Pool *pool)
1255 for (i = 0; poolflags2str[i].str; i++)
1256 pool_set_flag(pool, poolflags2str[i].flag, poolflags2str[i].def);
1260 testcase_getsolverflags(Solver *solv)
1262 Pool *pool = solv->pool;
1263 const char *str = 0;
1265 for (i = 0; solverflags2str[i].str; i++)
1267 v = solver_get_flag(solv, solverflags2str[i].flag);
1268 if (v == solverflags2str[i].def)
1270 str = pool_tmpappend(pool, str, v ? " " : " !", solverflags2str[i].str);
1272 return str ? str + 1 : "";
1276 testcase_setsolverflags(Solver *solv, const char *str)
1278 const char *p = str, *s;
1282 while (*p == ' ' || *p == '\t' || *p == ',')
1293 while (*p && *p != ' ' && *p != '\t' && *p != ',')
1295 for (i = 0; solverflags2str[i].str; i++)
1296 if (!strncmp(solverflags2str[i].str, s, p - s) && solverflags2str[i].str[p - s] == 0)
1298 if (!solverflags2str[i].str)
1300 pool_debug(solv->pool, SOLV_ERROR, "setsolverflags: unknown flag '%.*s'\n", (int)(p - s), s);
1303 solver_set_flag(solv, solverflags2str[i].flag, v);
1309 testcase_resetsolverflags(Solver *solv)
1312 for (i = 0; solverflags2str[i].str; i++)
1313 solver_set_flag(solv, solverflags2str[i].flag, solverflags2str[i].def);
1317 testcase_ruleid(Solver *solv, Id rid)
1323 const unsigned char *md5;
1329 solver_ruleliterals(solv, rid, &q);
1330 for (i = 0; i < q.count; i++)
1332 Id p = q.elements[i];
1333 s = testcase_solvid2str(solv->pool, p > 0 ? p : -p);
1335 s = pool_tmpjoin(solv->pool, "!", s, 0);
1336 strqueue_push(&sq, s);
1339 strqueue_sort_u(&sq);
1340 chk = solv_chksum_create(REPOKEY_TYPE_MD5);
1341 for (i = 0; i < sq.nstr; i++)
1342 solv_chksum_add(chk, sq.str[i], strlen(sq.str[i]) + 1);
1343 md5 = solv_chksum_get(chk, &md5l);
1344 s = pool_bin2hex(solv->pool, md5, md5l);
1345 chk = solv_chksum_free(chk, 0);
1351 testcase_problemid(Solver *solv, Id problem)
1356 const unsigned char *md5;
1360 /* we build a hash of all rules that define the problem */
1363 solver_findallproblemrules(solv, problem, &q);
1364 for (i = 0; i < q.count; i++)
1365 strqueue_push(&sq, testcase_ruleid(solv, q.elements[i]));
1367 strqueue_sort_u(&sq);
1368 chk = solv_chksum_create(REPOKEY_TYPE_MD5);
1369 for (i = 0; i < sq.nstr; i++)
1370 solv_chksum_add(chk, sq.str[i], strlen(sq.str[i]) + 1);
1371 md5 = solv_chksum_get(chk, &md5l);
1372 s = pool_bin2hex(solv->pool, md5, 4);
1373 chk = solv_chksum_free(chk, 0);
1379 testcase_solutionid(Solver *solv, Id problem, Id solution)
1383 const unsigned char *md5;
1387 intid = solver_solutionelement_internalid(solv, problem, solution);
1388 /* internal stuff! handle with care! */
1392 s = testcase_job2str(solv->pool, solv->job.elements[-intid - 1], solv->job.elements[-intid]);
1397 s = testcase_ruleid(solv, intid);
1399 chk = solv_chksum_create(REPOKEY_TYPE_MD5);
1400 solv_chksum_add(chk, s, strlen(s) + 1);
1401 md5 = solv_chksum_get(chk, &md5l);
1402 s = pool_bin2hex(solv->pool, md5, 4);
1403 chk = solv_chksum_free(chk, 0);
1407 static struct class2str {
1411 { SOLVER_TRANSACTION_ERASE, "erase" },
1412 { SOLVER_TRANSACTION_INSTALL, "install" },
1413 { SOLVER_TRANSACTION_REINSTALLED, "reinstall" },
1414 { SOLVER_TRANSACTION_DOWNGRADED, "downgrade" },
1415 { SOLVER_TRANSACTION_CHANGED, "change" },
1416 { SOLVER_TRANSACTION_UPGRADED, "upgrade" },
1417 { SOLVER_TRANSACTION_OBSOLETED, "obsolete" },
1418 { SOLVER_TRANSACTION_MULTIINSTALL, "multiinstall" },
1419 { SOLVER_TRANSACTION_MULTIREINSTALL, "multireinstall" },
1424 testcase_solverresult(Solver *solv, int resultflags)
1426 Pool *pool = solv->pool;
1434 if ((resultflags & TESTCASE_RESULT_TRANSACTION) != 0)
1436 Transaction *trans = solver_create_transaction(solv);
1440 for (i = 0; class2str[i].str; i++)
1443 transaction_classify_pkgs(trans, SOLVER_TRANSACTION_KEEP_PSEUDO, class2str[i].class, 0, 0, &q);
1444 for (j = 0; j < q.count; j++)
1448 if (pool->installed && pool->solvables[p].repo == pool->installed)
1449 op = transaction_obs_pkg(trans, p);
1450 s = pool_tmpjoin(pool, class2str[i].str, " ", testcase_solvid2str(pool, p));
1452 s = pool_tmpjoin(pool, s, " ", testcase_solvid2str(pool, op));
1453 strqueue_push(&sq, s);
1457 transaction_free(trans);
1459 if ((resultflags & TESTCASE_RESULT_PROBLEMS) != 0)
1461 char *probprefix, *solprefix;
1462 int problem, solution, element;
1465 pcnt = solver_problem_count(solv);
1466 for (problem = 1; problem <= pcnt; problem++)
1468 Id rid, from, to, dep;
1469 SolverRuleinfo rinfo;
1470 rid = solver_findproblemrule(solv, problem);
1471 s = testcase_problemid(solv, problem);
1472 probprefix = solv_dupjoin("problem ", s, 0);
1473 rinfo = solver_ruleinfo(solv, rid, &from, &to, &dep);
1474 s = pool_tmpjoin(pool, probprefix, " info ", solver_problemruleinfo2str(solv, rinfo, from, to, dep));
1475 strqueue_push(&sq, s);
1476 scnt = solver_solution_count(solv, problem);
1477 for (solution = 1; solution <= scnt; solution++)
1479 s = testcase_solutionid(solv, problem, solution);
1480 solprefix = solv_dupjoin(probprefix, " solution ", s);
1482 while ((element = solver_next_solutionelement(solv, problem, solution, element, &p, &op)) != 0)
1484 if (p == SOLVER_SOLUTION_JOB)
1485 s = pool_tmpjoin(pool, solprefix, " deljob ", testcase_job2str(pool, solv->job.elements[op - 1], solv->job.elements[op]));
1486 else if (p > 0 && op == 0)
1487 s = pool_tmpjoin(pool, solprefix, " erase ", testcase_solvid2str(pool, p));
1488 else if (p > 0 && op > 0)
1490 s = pool_tmpjoin(pool, solprefix, " replace ", testcase_solvid2str(pool, p));
1491 s = pool_tmpappend(pool, s, " ", testcase_solvid2str(pool, op));
1493 else if (p < 0 && op > 0)
1494 s = pool_tmpjoin(pool, solprefix, " allow ", testcase_solvid2str(pool, op));
1496 s = pool_tmpjoin(pool, solprefix, " unknown", 0);
1497 strqueue_push(&sq, s);
1499 solv_free(solprefix);
1501 solv_free(probprefix);
1505 if ((resultflags & TESTCASE_RESULT_ORPHANED) != 0)
1510 solver_get_orphaned(solv, &q);
1511 for (i = 0; i < q.count; i++)
1513 s = pool_tmpjoin(pool, "orphaned ", testcase_solvid2str(pool, q.elements[i]), 0);
1514 strqueue_push(&sq, s);
1519 if ((resultflags & TESTCASE_RESULT_RECOMMENDED) != 0)
1525 solver_get_recommendations(solv, &qr, &qs, 0);
1526 for (i = 0; i < qr.count; i++)
1528 s = pool_tmpjoin(pool, "recommended ", testcase_solvid2str(pool, qr.elements[i]), 0);
1529 strqueue_push(&sq, s);
1531 for (i = 0; i < qs.count; i++)
1533 s = pool_tmpjoin(pool, "suggested ", testcase_solvid2str(pool, qs.elements[i]), 0);
1534 strqueue_push(&sq, s);
1540 if ((resultflags & TESTCASE_RESULT_UNNEEDED) != 0)
1545 solver_get_unneeded(solv, &q, 0);
1546 for (i = 0; i < q.count; i++)
1548 s = pool_tmpjoin(pool, "unneeded ", testcase_solvid2str(pool, q.elements[i]), 0);
1549 strqueue_push(&sq, s);
1555 result = strqueue_join(&sq);
1562 testcase_write(Solver *solv, char *dir, int resultflags, const char *testcasename, const char *resultname)
1564 Pool *pool = solv->pool;
1575 testcasename = "testcase.t";
1577 resultname = "solver.result";
1579 if (mkdir(dir, 0777) && errno != EEXIST)
1581 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: could not create directory '%s'\n", dir);
1585 FOR_REPOS(repoid, repo)
1587 const char *name = testcase_repoid2str(pool, repoid);
1589 if (repo->subpriority)
1590 sprintf(priobuf, "%d.%d", repo->priority, repo->subpriority);
1592 sprintf(priobuf, "%d", repo->priority);
1593 out = pool_tmpjoin(pool, name, ".repo", ".gz");
1594 cmd = pool_tmpjoin(pool, "repo ", name, " ");
1595 cmd = pool_tmpappend(pool, cmd, priobuf, " ");
1596 cmd = pool_tmpappend(pool, cmd, "testtags ", out);
1597 strqueue_push(&sq, cmd);
1598 out = pool_tmpjoin(pool, dir, "/", out);
1599 if (!(fp = solv_xfopen(out, "w")))
1601 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: could not open '%s' for writing\n", out);
1605 testcase_write_testtags(repo, fp);
1608 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: write error\n");
1613 /* hmm, this is not optimal... we currently search for the lowest score */
1615 arch = pool->solvables[SYSTEMSOLVABLE].arch;
1616 for (i = 0; i < pool->lastarch; i++)
1618 if (pool->id2arch[i] == 1 && !lowscore)
1620 if (pool->id2arch[i] > 0x10000 && (!lowscore || pool->id2arch[i] < lowscore))
1623 lowscore = pool->id2arch[i];
1626 cmd = pool_tmpjoin(pool, "system ", pool->lastarch ? pool_id2str(pool, arch) : "unset", 0);
1627 for (i = 0; disttype2str[i].str != 0; i++)
1628 if (pool->disttype == disttype2str[i].type)
1630 pool_tmpappend(pool, cmd, " ", disttype2str[i].str ? disttype2str[i].str : "unknown");
1631 if (pool->installed)
1632 cmd = pool_tmpappend(pool, cmd, " ", testcase_repoid2str(pool, pool->installed->repoid));
1633 strqueue_push(&sq, cmd);
1634 s = testcase_getpoolflags(solv->pool);
1637 cmd = pool_tmpjoin(pool, "poolflags ", s, 0);
1638 strqueue_push(&sq, cmd);
1641 if (pool->vendorclasses)
1644 for (i = 0; pool->vendorclasses[i]; i++)
1646 cmd = pool_tmpappend(pool, cmd ? cmd : "vendorclass", " ", pool->vendorclasses[i]);
1647 if (!pool->vendorclasses[i + 1])
1649 strqueue_push(&sq, cmd);
1656 s = testcase_getsolverflags(solv);
1659 cmd = pool_tmpjoin(pool, "solverflags ", s, 0);
1660 strqueue_push(&sq, cmd);
1663 /* now dump all the ns callback values we know */
1664 if (pool->nscallback)
1668 for (rid = 1; rid < pool->nrels; rid++)
1670 Reldep *rd = pool->rels + rid;
1671 if (rd->flags != REL_NAMESPACE || rd->name == NAMESPACE_OTHERPROVIDERS)
1673 /* evaluate all namespace ids, skip empty results */
1674 d = pool_whatprovides(pool, MAKERELDEP(rid));
1675 if (!d || !pool->whatprovidesdata[d])
1677 cmd = pool_tmpjoin(pool, "namespace ", pool_id2str(pool, rd->name), "(");
1678 cmd = pool_tmpappend(pool, cmd, pool_id2str(pool, rd->evr), ")");
1679 for (; pool->whatprovidesdata[d]; d++)
1680 cmd = pool_tmpappend(pool, cmd, " ", testcase_solvid2str(pool, pool->whatprovidesdata[d]));
1681 strqueue_push(&sq, cmd);
1685 for (i = 0; i < solv->job.count; i += 2)
1687 cmd = (char *)testcase_job2str(pool, solv->job.elements[i], solv->job.elements[i + 1]);
1688 cmd = pool_tmpjoin(pool, "job ", cmd, 0);
1689 strqueue_push(&sq, cmd);
1696 for (i = 0; resultflags2str[i].str; i++)
1697 if ((resultflags & resultflags2str[i].flag) != 0)
1698 cmd = pool_tmpappend(pool, cmd, cmd ? "," : 0, resultflags2str[i].str);
1699 cmd = pool_tmpjoin(pool, "result ", cmd ? cmd : "?", 0);
1700 cmd = pool_tmpappend(pool, cmd, " ", resultname);
1701 strqueue_push(&sq, cmd);
1702 result = testcase_solverresult(solv, resultflags);
1703 if (!strcmp(resultname, "<inline>"))
1707 strqueue_init(&rsq);
1708 strqueue_split(&rsq, result);
1709 for (i = 0; i < rsq.nstr; i++)
1711 cmd = pool_tmpjoin(pool, "#>", rsq.str[i], 0);
1712 strqueue_push(&sq, cmd);
1714 strqueue_free(&rsq);
1718 out = pool_tmpjoin(pool, dir, "/", resultname);
1719 if (!(fp = fopen(out, "w")))
1721 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: could not open '%s' for writing\n", out);
1726 if (result && *result && fwrite(result, strlen(result), 1, fp) != 1)
1728 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: write error\n");
1735 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: write error\n");
1743 cmd = strqueue_join(&sq);
1744 out = pool_tmpjoin(pool, dir, "/", testcasename);
1745 if (!(fp = fopen(out, "w")))
1747 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: could not open '%s' for writing\n", out);
1751 if (*cmd && fwrite(cmd, strlen(cmd), 1, fp) != 1)
1753 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: write error\n");
1759 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: write error\n");
1769 read_inline_file(FILE *fp, char **bufp, char **bufpp, int *buflp)
1771 char *result = solv_malloc(1024);
1778 if (rp - result + 256 >= resultl)
1780 resultl = rp - result;
1781 result = solv_realloc(result, resultl + 1024);
1782 rp = result + resultl;
1785 if (!fgets(rp, resultl - (rp - result), fp))
1788 if (rl && (rp == result || rp[-1] == '\n'))
1790 if (rl > 1 && rp[0] == '#' && rp[1] == '>')
1792 memmove(rp, rp + 2, rl - 2);
1797 while (rl + 16 > *buflp)
1799 *bufp = solv_realloc(*bufp, *buflp + 512);
1802 memmove(*bufp, rp, rl);
1803 if ((*bufp)[rl - 1] == '\n')
1809 (*bufpp) = *bufp + rl;
1826 char *result = solv_malloc(1024);
1833 if (rp - result + 256 >= resultl)
1835 resultl = rp - result;
1836 result = solv_realloc(result, resultl + 1024);
1837 rp = result + resultl;
1840 rl = fread(rp, 1, resultl - (rp - result), fp);
1852 str2resultflags(Pool *pool, char *s) /* modifies the string! */
1854 int i, resultflags = 0;
1857 char *se = strchr(s, ',');
1860 for (i = 0; resultflags2str[i].str; i++)
1861 if (!strcmp(s, resultflags2str[i].str))
1863 resultflags |= resultflags2str[i].flag;
1866 if (!resultflags2str[i].str)
1867 pool_debug(pool, SOLV_ERROR, "result: unknown flag '%s'\n", s);
1874 testcase_read(Pool *pool, FILE *fp, char *testcase, Queue *job, char **resultp, int *resultflagsp)
1879 char *testcasedir, *s;
1885 int poolflagsreset = 0;
1887 if (!fp && !(fp = fopen(testcase, "r")))
1889 pool_debug(pool, SOLV_ERROR, "testcase_read: could not open '%s'\n", testcase);
1892 testcasedir = solv_strdup(testcase);
1893 if ((s = strrchr(testcasedir, '/')) != 0)
1898 buf = solv_malloc(bufl);
1903 if (bufp - buf + 16 > bufl)
1906 buf = solv_realloc(buf, bufl + 512);
1910 if (!fgets(bufp, bufl - (bufp - buf), fp))
1914 if (!l || buf[l - 1] != '\n')
1921 while (*s && (*s == ' ' || *s == '\t'))
1923 if (!*s || *s == '#')
1926 /* split it in pieces */
1929 while (*s == ' ' || *s == '\t')
1933 pieces = solv_extend(pieces, npieces, 1, sizeof(*pieces), 7);
1934 pieces[npieces++] = s;
1935 while (*s && *s != ' ' && *s != '\t')
1940 pieces = solv_extend(pieces, npieces, 1, sizeof(*pieces), 7);
1941 pieces[npieces] = 0;
1942 if (!strcmp(pieces[0], "repo") && npieces >= 4)
1944 Repo *repo = repo_create(pool, pieces[1]);
1950 if (!poolflagsreset)
1953 testcase_resetpoolflags(pool); /* hmm */
1955 if (sscanf(pieces[2], "%d.%d", &prio, &subprio) != 2)
1958 prio = atoi(pieces[2]);
1960 repo->priority = prio;
1961 repo->subpriority = subprio;
1962 if (strcmp(pieces[3], "empty") != 0)
1964 const char *repotype = pool_tmpjoin(pool, pieces[3], 0, 0); /* gets overwritten in <inline> case */
1965 if (!strcmp(pieces[4], "<inline>"))
1967 char *idata = read_inline_file(fp, &buf, &bufp, &bufl);
1969 rfp = solv_xfopen_buf(rdata, &idata, 0, "rf");
1973 rdata = pool_tmpjoin(pool, testcasedir, pieces[4], 0);
1974 rfp = solv_xfopen(rdata, "r");
1978 pool_debug(pool, SOLV_ERROR, "testcase_read: could not open '%s'\n", rdata);
1980 else if (!strcmp(repotype, "testtags"))
1982 testcase_add_testtags(repo, rfp, 0);
1985 else if (!strcmp(repotype, "solv"))
1987 repo_add_solv(repo, rfp, 0);
1991 else if (!strcmp(repotype, "helix"))
1993 repo_add_helix(repo, rfp, 0);
2000 pool_debug(pool, SOLV_ERROR, "testcase_read: unknown repo type for repo '%s'\n", repo->name);
2004 else if (!strcmp(pieces[0], "system") && npieces >= 3)
2008 /* must set the disttype before the arch */
2009 for (i = 0; disttype2str[i].str != 0; i++)
2010 if (!strcmp(disttype2str[i].str, pieces[2]))
2012 if (!disttype2str[i].str)
2013 pool_debug(pool, SOLV_ERROR, "testcase_read: system: unknown disttype '%s'\n", pieces[2]);
2014 else if (pool->disttype != disttype2str[i].type)
2016 #ifdef MULTI_SEMANTICS
2017 pool_setdisttype(pool, disttype2str[i].type);
2019 pool_debug(pool, SOLV_ERROR, "testcase_read: system: cannot change disttype to '%s'\n", pieces[2]);
2022 if (strcmp(pieces[1], "unset") == 0)
2023 pool_setarch(pool, 0);
2024 else if (pieces[1][0] == ':')
2025 pool_setarchpolicy(pool, pieces[1] + 1);
2027 pool_setarch(pool, pieces[1]);
2030 Repo *repo = testcase_str2repo(pool, pieces[3]);
2032 pool_debug(pool, SOLV_ERROR, "testcase_read: system: unknown repo '%s'\n", pieces[3]);
2034 pool_set_installed(pool, repo);
2037 else if (!strcmp(pieces[0], "job") && npieces > 1)
2043 pool_addfileprovides(pool);
2044 pool_createwhatprovides(pool);
2047 if (npieces >= 3 && !strcmp(pieces[2], "selection"))
2049 addselectionjob(pool, pieces + 1, npieces - 1, job);
2053 for (sp = pieces[1]; sp < pieces[npieces - 1]; sp++)
2056 how = testcase_str2job(pool, pieces[1], &what);
2057 if (how >= 0 && job)
2058 queue_push2(job, how, what);
2060 else if (!strcmp(pieces[0], "vendorclass") && npieces > 1)
2062 pool_addvendorclass(pool, (const char **)(pieces + 1));
2064 else if (!strcmp(pieces[0], "namespace") && npieces > 1)
2066 int i = strlen(pieces[1]);
2067 s = strchr(pieces[1], '(');
2068 if (!s && pieces[1][i - 1] != ')')
2070 pool_debug(pool, SOLV_ERROR, "testcase_read: bad namespace '%s'\n", pieces[1]);
2078 pieces[1][i - 1] = 0;
2079 name = pool_str2id(pool, pieces[1], 1);
2080 evr = pool_str2id(pool, s + 1, 1);
2082 pieces[1][i - 1] = ')';
2083 id = pool_rel2id(pool, name, evr, REL_NAMESPACE, 1);
2084 for (i = 2; i < npieces; i++)
2085 queue_push(&q, testcase_str2solvid(pool, pieces[i]));
2086 /* now do the callback */
2089 pool_addfileprovides(pool);
2090 pool_createwhatprovides(pool);
2093 pool->whatprovides_rel[GETRELID(id)] = pool_queuetowhatprovides(pool, &q);
2097 else if (!strcmp(pieces[0], "poolflags"))
2100 if (!poolflagsreset)
2103 testcase_resetpoolflags(pool); /* hmm */
2105 for (i = 1; i < npieces; i++)
2106 testcase_setpoolflags(pool, pieces[i]);
2108 else if (!strcmp(pieces[0], "solverflags") && npieces > 1)
2113 solv = solver_create(pool);
2114 testcase_resetsolverflags(solv);
2116 for (i = 1; i < npieces; i++)
2117 testcase_setsolverflags(solv, pieces[i]);
2119 else if (!strcmp(pieces[0], "result") && npieces > 2)
2122 int resultflags = str2resultflags(pool, pieces[1]);
2123 const char *rdata = pool_tmpjoin(pool, testcasedir, pieces[2], 0);
2124 if (!strcmp(pieces[2], "<inline>"))
2125 result = read_inline_file(fp, &buf, &bufp, &bufl);
2128 FILE *rfp = fopen(rdata, "r");
2130 pool_debug(pool, SOLV_ERROR, "testcase_read: could not open '%s'\n", rdata);
2133 result = read_file(rfp);
2142 *resultflagsp = resultflags;
2144 else if (!strcmp(pieces[0], "nextjob") && npieces == 1)
2150 pool_debug(pool, SOLV_ERROR, "testcase_read: cannot parse command '%s'\n", pieces[0]);
2153 buf = solv_free(buf);
2154 pieces = solv_free(pieces);
2155 solv_free(testcasedir);
2158 pool_addfileprovides(pool);
2159 pool_createwhatprovides(pool);
2163 solv = solver_create(pool);
2164 testcase_resetsolverflags(solv);
2172 testcase_resultdiff(char *result1, char *result2)
2174 Strqueue sq1, sq2, osq;
2176 strqueue_init(&sq1);
2177 strqueue_init(&sq2);
2178 strqueue_init(&osq);
2179 strqueue_split(&sq1, result1);
2180 strqueue_split(&sq2, result2);
2181 strqueue_sort(&sq1);
2182 strqueue_sort(&sq2);
2183 strqueue_diff(&sq1, &sq2, &osq);
2184 r = osq.nstr ? strqueue_join(&osq) : 0;
2185 strqueue_free(&sq1);
2186 strqueue_free(&sq2);
2187 strqueue_free(&osq);