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 },
100 { SOLVER_FLAG_DUP_ALLOW_DOWNGRADE, "dupallowdowngrade", 1 },
101 { SOLVER_FLAG_DUP_ALLOW_ARCHCHANGE, "dupallowarchchange", 1 },
102 { SOLVER_FLAG_DUP_ALLOW_VENDORCHANGE, "dupallowvendorchange", 1 },
103 { SOLVER_FLAG_DUP_ALLOW_NAMECHANGE, "dupallownamechange", 1 },
107 static struct poolflags2str {
111 } poolflags2str[] = {
112 { POOL_FLAG_PROMOTEEPOCH, "promoteepoch", 0 },
113 { POOL_FLAG_FORBIDSELFCONFLICTS, "forbidselfconflicts", 0 },
114 { POOL_FLAG_OBSOLETEUSESPROVIDES, "obsoleteusesprovides", 0 },
115 { POOL_FLAG_IMPLICITOBSOLETEUSESPROVIDES, "implicitobsoleteusesprovides", 0 },
116 { POOL_FLAG_OBSOLETEUSESCOLORS, "obsoleteusescolors", 0 },
117 { POOL_FLAG_IMPLICITOBSOLETEUSESCOLORS, "implicitobsoleteusescolors", 0 },
118 { POOL_FLAG_NOINSTALLEDOBSOLETES, "noinstalledobsoletes", 0 },
119 { POOL_FLAG_HAVEDISTEPOCH, "havedistepoch", 0 },
120 { POOL_FLAG_NOOBSOLETESMULTIVERSION, "noobsoletesmultiversion", 0 },
121 { POOL_FLAG_ADDFILEPROVIDESFILTERED, "addfileprovidesfiltered", 0 },
125 static struct disttype2str {
129 { DISTTYPE_RPM, "rpm" },
130 { DISTTYPE_DEB, "deb" },
131 { DISTTYPE_ARCH, "arch" },
132 { DISTTYPE_HAIKU, "haiku" },
136 static struct selflags2str {
140 { SELECTION_NAME, "name" },
141 { SELECTION_PROVIDES, "provides" },
142 { SELECTION_FILELIST, "filelist" },
143 { SELECTION_CANON, "canon" },
144 { SELECTION_DOTARCH, "dotarch" },
145 { SELECTION_REL, "rel" },
146 { SELECTION_INSTALLED_ONLY, "installedonly" },
147 { SELECTION_GLOB, "glob" },
148 { SELECTION_FLAT, "flat" },
149 { SELECTION_NOCASE, "nocase" },
150 { SELECTION_SOURCE_ONLY, "sourceonly" },
151 { SELECTION_WITH_SOURCE, "withsource" },
156 typedef struct strqueue {
161 #define STRQUEUE_BLOCK 63
164 strqueue_init(Strqueue *q)
171 strqueue_free(Strqueue *q)
174 for (i = 0; i < q->nstr; i++)
175 solv_free(q->str[i]);
176 q->str = solv_free(q->str);
181 strqueue_push(Strqueue *q, const char *s)
183 q->str = solv_extend(q->str, q->nstr, 1, sizeof(*q->str), STRQUEUE_BLOCK);
184 q->str[q->nstr++] = solv_strdup(s);
188 strqueue_pushjoin(Strqueue *q, const char *s1, const char *s2, const char *s3)
190 q->str = solv_extend(q->str, q->nstr, 1, sizeof(*q->str), STRQUEUE_BLOCK);
191 q->str[q->nstr++] = solv_dupjoin(s1, s2, s3);
195 strqueue_sort_cmp(const void *ap, const void *bp, void *dp)
197 const char *a = *(const char **)ap;
198 const char *b = *(const char **)bp;
199 return strcmp(a ? a : "", b ? b : "");
203 strqueue_sort(Strqueue *q)
206 solv_sort(q->str, q->nstr, sizeof(*q->str), strqueue_sort_cmp, 0);
210 strqueue_sort_u(Strqueue *q)
214 for (i = j = 0; i < q->nstr; i++)
215 if (!j || strqueue_sort_cmp(q->str + i, q->str + j - 1, 0) != 0)
216 q->str[j++] = q->str[i];
221 strqueue_join(Strqueue *q)
225 for (i = 0; i < q->nstr; i++)
227 l += strlen(q->str[i]) + 1;
228 l++; /* trailing \0 */
231 for (i = 0; i < q->nstr; i++)
234 strcpy(rp, q->str[i]);
243 strqueue_split(Strqueue *q, const char *s)
248 while ((p = strchr(s, '\n')) != 0)
250 q->str = solv_extend(q->str, q->nstr, 1, sizeof(*q->str), STRQUEUE_BLOCK);
251 q->str[q->nstr] = solv_malloc(p - s + 1);
253 memcpy(q->str[q->nstr], s, p - s);
254 q->str[q->nstr][p - s] = 0;
263 strqueue_diff(Strqueue *sq1, Strqueue *sq2, Strqueue *osq)
266 while (i < sq1->nstr && j < sq2->nstr)
268 int r = strqueue_sort_cmp(sq1->str + i, sq2->str + j, 0);
272 strqueue_pushjoin(osq, "-", sq1->str[i++], 0);
274 strqueue_pushjoin(osq, "+", sq2->str[j++], 0);
276 while (i < sq1->nstr)
277 strqueue_pushjoin(osq, "-", sq1->str[i++], 0);
278 while (j < sq2->nstr)
279 strqueue_pushjoin(osq, "+", sq2->str[j++], 0);
283 pool_isknownarch(Pool *pool, Id id)
285 if (!id || id == ID_EMPTY)
287 if (id == ARCH_SRC || id == ARCH_NOSRC || id == ARCH_NOARCH)
289 if (!pool->id2arch || (id > pool->lastarch || !pool->id2arch[id]))
295 testcase_str2dep_simple(Pool *pool, const char **sp)
302 while (*s == ' ' || *s == '\t')
305 while (*s && *s != ' ' && *s != '\t' && *s != '<' && *s != '=' && *s != '>')
309 while (*s && *s != ')')
315 if ((a = strchr(n, '.')) != 0 && a + 1 < s && s[-1] != ')')
317 Id archid = pool_strn2id(pool, a + 1, s - (a + 1), 0);
318 if (pool_isknownarch(pool, archid))
320 id = pool_strn2id(pool, n, a - n, 1);
321 id = pool_rel2id(pool, id, archid, REL_ARCH, 1);
324 id = pool_strn2id(pool, n, s - n, 1);
326 else if (s - n > 4 && s[-4] == ':' && !strncmp(s - 4, ":any", 4))
328 id = pool_strn2id(pool, n, s - n - 4, 1);
329 id = pool_rel2id(pool, id, ARCH_ANY, REL_MULTIARCH, 1);
332 id = pool_strn2id(pool, n, s - n, 1);
338 while (*s == ' ' || *s == '\t')
341 if (*s == '!' && s[1] == '=') /* support != as synonym for <> */
343 flags = REL_LT | REL_GT;
362 while (*s == ' ' || *s == '\t')
365 while (*s && *s != ' ' && *s != '\t')
367 evr = pool_strn2id(pool, n, s - n, 1);
368 if (*s == ' ' && !strcmp(s, " compat >= "))
371 while (*s == ' ' || *s == '\t')
374 while (*s && *s != ' ' && *s != '\t')
376 evr = pool_rel2id(pool, evr, pool_strn2id(pool, n, s - n, 1), REL_COMPAT, 1);
379 return pool_rel2id(pool, id, evr, flags, 1);
383 testcase_str2dep_complex(Pool *pool, const char **sp)
387 #ifdef ENABLE_COMPLEX_DEPS
388 while (*s == ' ' || *s == '\t')
393 id = testcase_str2dep_complex(pool, &s);
396 while (*s == ' ' || *s == '\t')
401 id = testcase_str2dep_simple(pool, &s);
405 id = pool_rel2id(pool, id, testcase_str2dep_complex(pool, &s), REL_OR, 1);
410 id = pool_rel2id(pool, id, testcase_str2dep_complex(pool, &s), REL_AND, 1);
412 else if (*s == 'I' && s[1] == 'F' && (s[2] == ' ' || s[2] == '\t'))
415 id = pool_rel2id(pool, id, testcase_str2dep_complex(pool, &s), REL_COND, 1);
422 testcase_str2dep(Pool *pool, const char *s)
424 return testcase_str2dep_complex(pool, &s);
428 testcase_repoid2str(Pool *pool, Id repoid)
430 Repo *repo = pool_id2repo(pool, repoid);
433 char *r = pool_tmpjoin(pool, repo->name, 0, 0);
435 for (rp = r; *rp; rp++)
436 if (*rp == ' ' || *rp == '\t')
443 sprintf(buf, "#%d", repoid);
444 return pool_tmpjoin(pool, buf, 0, 0);
449 testcase_solvid2str(Pool *pool, Id p)
451 Solvable *s = pool->solvables + p;
452 const char *n, *e, *a;
455 if (p == SYSTEMSOLVABLE)
457 n = pool_id2str(pool, s->name);
458 e = pool_id2str(pool, s->evr);
459 a = pool_id2str(pool, s->arch);
460 str = pool_alloctmpspace(pool, strlen(n) + strlen(e) + strlen(a) + 3);
461 sprintf(str, "%s-%s.%s", n, e, a);
463 return pool_tmpappend(pool, str, "@", 0);
467 char *str2 = pool_tmpappend(pool, str, "@", s->repo->name);
469 if (str2[l] == ' ' || str2[l] == '\t')
473 sprintf(buf, "@#%d", s->repo->repoid);
474 return pool_tmpappend(pool, str, buf, 0);
478 testcase_str2repo(Pool *pool, const char *str)
482 if (str[0] == '#' && (str[1] >= '0' && str[1] <= '9'))
486 for (j = 1; str[j] >= '0' && str[j] <= '9'; j++)
487 repoid = repoid * 10 + (str[j] - '0');
488 if (!str[j] && repoid > 0 && repoid < pool->nrepos)
489 repo = pool_id2repo(pool, repoid);
493 FOR_REPOS(repoid, repo)
498 l = strlen(repo->name);
499 for (i = 0; i < l; i++)
501 int c = repo->name[i];
502 if (c == ' ' || c == '\t')
507 if (i == l && !str[l])
510 if (repoid >= pool->nrepos)
517 testcase_str2solvid(Pool *pool, const char *str)
519 int i, l = strlen(str);
526 if (*str == '@' && !strcmp(str, "@SYSTEM"))
527 return SYSTEMSOLVABLE;
529 for (i = l - 1; i >= 0; i--)
530 if (str[i] == '@' && (repo = testcase_str2repo(pool, str + i + 1)) != 0)
535 /* now find the arch (if present) */
537 for (i = repostart - 1; i > 0; i--)
540 arch = pool_strn2id(pool, str + i + 1, repostart - (i + 1), 0);
545 /* now find the name */
546 for (i = repostart - 1; i > 0; i--)
550 Id nid, evrid, p, pp;
551 nid = pool_strn2id(pool, str, i, 0);
554 evrid = pool_strn2id(pool, str + i + 1, repostart - (i + 1), 0);
557 FOR_PROVIDES(p, pp, nid)
559 Solvable *s = pool->solvables + p;
560 if (s->name != nid || s->evr != evrid)
562 if (repo && s->repo != repo)
564 if (arch && s->arch != arch)
574 testcase_job2str(Pool *pool, Id how, Id what)
581 Id select = how & SOLVER_SELECTMASK;
583 for (i = 0; job2str[i].str; i++)
584 if ((how & SOLVER_JOBMASK) == job2str[i].job)
586 jobstr = job2str[i].str ? job2str[i].str : "unknown";
587 if (select == SOLVER_SOLVABLE)
590 pkgstr = testcase_solvid2str(pool, what);
592 else if (select == SOLVER_SOLVABLE_NAME)
595 pkgstr = pool_dep2str(pool, what);
597 else if (select == SOLVER_SOLVABLE_PROVIDES)
599 selstr = " provides ";
600 pkgstr = pool_dep2str(pool, what);
602 else if (select == SOLVER_SOLVABLE_ONE_OF)
607 while ((p = pool->whatprovidesdata[what++]) != 0)
609 const char *s = testcase_solvid2str(pool, p);
612 pkgstr = pool_tmpappend(pool, pkgstr, " ", s);
613 pool_freetmpspace(pool, s);
621 else if (select == SOLVER_SOLVABLE_REPO)
623 Repo *repo = pool_id2repo(pool, what);
628 sprintf(buf, "#%d", repo->repoid);
629 pkgstr = pool_tmpjoin(pool, buf, 0, 0);
632 pkgstr = pool_tmpjoin(pool, repo->name, 0, 0);
634 else if (select == SOLVER_SOLVABLE_ALL)
641 selstr = " unknown ";
644 ret = pool_tmpjoin(pool, jobstr, selstr, pkgstr);
646 ret = pool_tmpappend(pool, ret, " ", 0);
647 for (i = 0; jobflags2str[i].str; i++)
648 if ((how & jobflags2str[i].flag) != 0)
649 ret = pool_tmpappend(pool, ret, ",", jobflags2str[i].str);
655 ret = pool_tmpappend(pool, ret, "]", 0);
661 str2selflags(Pool *pool, char *s) /* modifies the string! */
666 char *se = strchr(s, ',');
669 for (i = 0; selflags2str[i].str; i++)
670 if (!strcmp(s, selflags2str[i].str))
672 selflags |= selflags2str[i].flag;
675 if (!selflags2str[i].str)
676 pool_debug(pool, SOLV_ERROR, "str2job: unknown selection flag '%s'\n", s);
683 str2jobflags(Pool *pool, char *s) /* modifies the string */
688 char *se = strchr(s, ',');
691 for (i = 0; jobflags2str[i].str; i++)
692 if (!strcmp(s, jobflags2str[i].str))
694 jobflags |= jobflags2str[i].flag;
697 if (!jobflags2str[i].str)
698 pool_debug(pool, SOLV_ERROR, "str2job: unknown job flag '%s'\n", s);
705 testcase_str2job(Pool *pool, const char *str, Id *whatp)
715 /* so we can patch it */
716 s = pool_tmpjoin(pool, str, 0, 0);
717 /* split it in pieces */
720 while (*s == ' ' || *s == '\t')
724 pieces = solv_extend(pieces, npieces, 1, sizeof(*pieces), 7);
725 pieces[npieces++] = s;
726 while (*s && *s != ' ' && *s != '\t')
733 pool_debug(pool, SOLV_ERROR, "str2job: bad line '%s'\n", str);
738 for (i = 0; job2str[i].str; i++)
739 if (!strcmp(pieces[0], job2str[i].str))
743 pool_debug(pool, SOLV_ERROR, "str2job: unknown job '%s'\n", str);
747 job = job2str[i].job;
751 char *flags = pieces[npieces - 1];
752 if (*flags == '[' && flags[strlen(flags) - 1] == ']')
756 flags[strlen(flags) - 1] = 0;
757 job |= str2jobflags(pool, flags);
760 if (!strcmp(pieces[1], "pkg"))
764 pool_debug(pool, SOLV_ERROR, "str2job: bad pkg selector in '%s'\n", str);
768 job |= SOLVER_SOLVABLE;
769 what = testcase_str2solvid(pool, pieces[2]);
772 pool_debug(pool, SOLV_ERROR, "str2job: unknown package '%s'\n", pieces[2]);
777 else if (!strcmp(pieces[1], "name") || !strcmp(pieces[1], "provides"))
779 /* join em again for dep2str... */
781 for (sp = pieces[2]; sp < pieces[npieces - 1]; sp++)
785 if (pieces[1][0] == 'p' && strncmp(pieces[2], "namespace:", 10) == 0)
787 char *spe = strchr(pieces[2], '(');
788 int l = strlen(pieces[2]);
789 if (spe && pieces[2][l - 1] == ')')
791 /* special namespace provides */
792 if (strcmp(spe, "(<NULL>)") != 0)
794 pieces[2][l - 1] = 0;
795 what = testcase_str2dep(pool, spe + 1);
796 pieces[2][l - 1] = ')';
798 what = pool_rel2id(pool, pool_strn2id(pool, pieces[2], spe - pieces[2], 1), what, REL_NAMESPACE, 1);
802 what = testcase_str2dep(pool, pieces[2]);
803 if (pieces[1][0] == 'n')
804 job |= SOLVER_SOLVABLE_NAME;
806 job |= SOLVER_SOLVABLE_PROVIDES;
808 else if (!strcmp(pieces[1], "oneof"))
811 job |= SOLVER_SOLVABLE_ONE_OF;
813 if (npieces > 3 && strcmp(pieces[2], "nothing") != 0)
815 for (i = 2; i < npieces; i++)
817 Id p = testcase_str2solvid(pool, pieces[i]);
820 pool_debug(pool, SOLV_ERROR, "str2job: unknown package '%s'\n", pieces[i]);
828 what = pool_queuetowhatprovides(pool, &q);
831 else if (!strcmp(pieces[1], "repo"))
836 pool_debug(pool, SOLV_ERROR, "str2job: bad line '%s'\n", str);
840 repo = testcase_str2repo(pool, pieces[2]);
843 pool_debug(pool, SOLV_ERROR, "str2job: unknown repo '%s'\n", pieces[2]);
847 job |= SOLVER_SOLVABLE_REPO;
850 else if (!strcmp(pieces[1], "all"))
852 if (npieces != 3 && strcmp(pieces[2], "packages") != 0)
854 pool_debug(pool, SOLV_ERROR, "str2job: bad line '%s'\n", str);
858 job |= SOLVER_SOLVABLE_ALL;
863 pool_debug(pool, SOLV_ERROR, "str2job: unknown selection in '%s'\n", str);
873 addselectionjob(Pool *pool, char **pieces, int npieces, Queue *jobqueue)
880 for (i = 0; job2str[i].str; i++)
881 if (!strcmp(pieces[0], job2str[i].str))
885 pool_debug(pool, SOLV_ERROR, "selstr2job: unknown job '%s'\n", pieces[0]);
888 job = job2str[i].job;
891 char *flags = pieces[npieces - 1];
892 if (*flags == '[' && flags[strlen(flags) - 1] == ']')
896 flags[strlen(flags) - 1] = 0;
897 job |= str2jobflags(pool, flags);
902 pool_debug(pool, SOLV_ERROR, "selstr2job: no selection flags\n");
905 selflags = str2selflags(pool, pieces[3]);
907 r = selection_make(pool, &sel, pieces[2], selflags);
908 for (i = 0; i < sel.count; i += 2)
909 queue_push2(jobqueue, job | sel.elements[i], sel.elements[i + 1]);
915 writedeps(Repo *repo, FILE *fp, const char *tag, Id key, Solvable *s, Offset off)
917 Pool *pool = repo->pool;
924 dp = repo->idarraydata + off;
926 while ((id = *dp++) != 0)
928 if (key == SOLVABLE_REQUIRES && id == SOLVABLE_PREREQMARKER)
931 fprintf(fp, "-%s\n", tag);
936 if (key == SOLVABLE_PROVIDES && id == SOLVABLE_FILEMARKER)
941 idstr = pool_dep2str(pool, id);
944 Reldep *rd = GETRELDEP(pool, id);
945 if (key == SOLVABLE_CONFLICTS && rd->flags == REL_NAMESPACE && rd->name == NAMESPACE_OTHERPROVIDERS)
947 if (!strncmp(idstr, "namespace:", 10))
950 if (key == SOLVABLE_SUPPLEMENTS)
952 if (rd->flags == REL_NAMESPACE && rd->name == NAMESPACE_FILESYSTEM)
954 if (!strncmp(idstr, "namespace:", 10))
957 else if (rd->flags == REL_NAMESPACE && rd->name == NAMESPACE_MODALIAS)
959 if (!strncmp(idstr, "namespace:", 10))
962 else if (rd->flags == REL_AND)
964 /* either packageand chain or modalias */
966 if (ISRELDEP(rd->evr))
968 Reldep *mrd = GETRELDEP(pool, rd->evr);
969 if (mrd->flags == REL_NAMESPACE && mrd->name == NAMESPACE_MODALIAS)
971 idstr = pool_tmpjoin(pool, "modalias(", pool_dep2str(pool, rd->name), ":");
972 idstr = pool_tmpappend(pool, idstr, pool_dep2str(pool, mrd->evr), ")");
974 else if (mrd->flags >= 8)
979 /* must be and chain */
980 idstr = pool_dep2str(pool, rd->evr);
986 rd = GETRELDEP(pool, id);
987 if (rd->flags != REL_AND)
989 idstr = pool_tmpjoin(pool, pool_dep2str(pool, rd->evr), ":", idstr);
991 idstr = pool_tmpjoin(pool, pool_dep2str(pool, id), ":", idstr);
992 idstr = pool_tmpjoin(pool, "packageand(", idstr, ")");
995 else if (rd->flags >= 8)
1001 fprintf(fp, "+%s\n", tag);
1004 fprintf(fp, "%s\n", idstr);
1006 if (key == SOLVABLE_PROVIDES)
1008 /* add the filelist */
1010 dataiterator_init(&di, pool, repo, s - pool->solvables, SOLVABLE_FILELIST, 0, 0);
1011 while (dataiterator_step(&di))
1013 const char *s = repodata_dir2str(di.data, di.kv.id, di.kv.str);
1016 Id id = pool_str2id(pool, s, 0);
1019 for (dp = prvdp; *dp; dp++)
1023 continue; /* already included */
1028 fprintf(fp, "+%s", tag);
1031 fprintf(fp, "%s\n", s);
1035 fprintf(fp, "-%s\n", tag);
1039 testcase_write_testtags(Repo *repo, FILE *fp)
1041 Pool *pool = repo->pool;
1047 const char *release;
1051 fprintf(fp, "=Ver: 2.0\n");
1052 FOR_REPO_SOLVABLES(repo, p, s)
1054 name = pool_id2str(pool, s->name);
1055 evr = pool_id2str(pool, s->evr);
1056 arch = pool_id2str(pool, s->arch);
1057 release = strrchr(evr, '-');
1059 release = evr + strlen(evr);
1060 fprintf(fp, "=Pkg: %s %.*s %s %s\n", name, (int)(release - evr), evr, *release && release[1] ? release + 1 : "-", arch);
1061 tmp = solvable_lookup_str(s, SOLVABLE_SUMMARY);
1063 fprintf(fp, "=Sum: %s\n", tmp);
1064 writedeps(repo, fp, "Req:", SOLVABLE_REQUIRES, s, s->requires);
1065 writedeps(repo, fp, "Prv:", SOLVABLE_PROVIDES, s, s->provides);
1066 writedeps(repo, fp, "Obs:", SOLVABLE_OBSOLETES, s, s->obsoletes);
1067 writedeps(repo, fp, "Con:", SOLVABLE_CONFLICTS, s, s->conflicts);
1068 writedeps(repo, fp, "Rec:", SOLVABLE_RECOMMENDS, s, s->recommends);
1069 writedeps(repo, fp, "Sup:", SOLVABLE_SUPPLEMENTS, s, s->supplements);
1070 writedeps(repo, fp, "Sug:", SOLVABLE_SUGGESTS, s, s->suggests);
1071 writedeps(repo, fp, "Enh:", SOLVABLE_ENHANCES, s, s->enhances);
1073 fprintf(fp, "=Vnd: %s\n", pool_id2str(pool, s->vendor));
1074 ti = solvable_lookup_num(s, SOLVABLE_BUILDTIME, 0);
1076 fprintf(fp, "=Tim: %u\n", ti);
1081 static inline Offset
1082 adddep(Repo *repo, Offset olddeps, char *str, Id marker)
1084 Id id = *str == '/' ? pool_str2id(repo->pool, str, 1) : testcase_str2dep(repo->pool, str);
1085 return repo_addid_dep(repo, olddeps, id, marker);
1089 finish_solvable(Pool *pool, Repodata *data, Solvable *s, char *filelist, int nfilelist)
1095 for (l = 0; l < nfilelist; l += strlen(filelist + l) + 1)
1097 char *p = strrchr(filelist + l, '/');
1101 did = repodata_str2dir(data, filelist + l, 1);
1104 did = repodata_str2dir(data, "/", 1);
1105 repodata_add_dirstr(data, s - pool->solvables, SOLVABLE_FILELIST, did, p);
1108 if (s->name && s->arch != ARCH_SRC && s->arch != ARCH_NOSRC)
1109 s->provides = repo_addid_dep(s->repo, s->provides, pool_rel2id(pool, s->name, s->evr, REL_EQ, 1), 0);
1110 s->supplements = repo_fix_supplements(s->repo, s->provides, s->supplements, 0);
1111 s->conflicts = repo_fix_conflicts(s->repo, s->conflicts);
1114 /* stripped down version of susetags parser used for testcases */
1116 testcase_add_testtags(Repo *repo, FILE *fp, int flags)
1118 Pool *pool = repo->pool;
1131 data = repo_add_repodata(repo, flags);
1136 line = solv_malloc(aline);
1140 if (linep - line + 16 > aline)
1142 aline = linep - line;
1143 line = solv_realloc(line, aline + 512);
1144 linep = line + aline;
1147 if (!fgets(linep, aline - (linep - line), fp))
1149 linep += strlen(linep);
1150 if (linep == line || linep[-1] != '\n')
1153 linep = line + intag;
1156 if (line[intag] == '-' && !strncmp(line + 1, line + intag + 1, intag - 2))
1163 else if (line[0] == '+' && line[1] && line[1] != ':')
1165 char *tagend = strchr(line, ':');
1170 intag = tagend + 2 - line;
1171 linep = line + intag;
1174 if (*line != '=' || !line[1] || !line[2] || !line[3] || line[4] != ':')
1176 tag = line[1] << 16 | line[2] << 8 | line[3];
1179 case 'P' << 16 | 'k' << 8 | 'g':
1181 finish_solvable(pool, data, s, filelist, nfilelist);
1183 if (split(line + 5, sp, 5) != 4)
1185 s = pool_id2solvable(pool, repo_add_solvable(repo));
1186 s->name = pool_str2id(pool, sp[0], 1);
1187 /* join back version and release */
1188 if (sp[2] && !(sp[2][0] == '-' && !sp[2][1]))
1190 s->evr = makeevr(pool, sp[1]);
1191 s->arch = pool_str2id(pool, sp[3], 1);
1193 case 'S' << 16 | 'u' << 8 | 'm':
1194 repodata_set_str(data, s - pool->solvables, SOLVABLE_SUMMARY, line + 6);
1196 case 'V' << 16 | 'n' << 8 | 'd':
1197 s->vendor = pool_str2id(pool, line + 6, 1);
1199 case 'T' << 16 | 'i' << 8 | 'm':
1202 repodata_set_num(data, s - pool->solvables, SOLVABLE_BUILDTIME, t);
1204 case 'R' << 16 | 'e' << 8 | 'q':
1205 s->requires = adddep(repo, s->requires, line + 6, -SOLVABLE_PREREQMARKER);
1207 case 'P' << 16 | 'r' << 8 | 'q':
1208 s->requires = adddep(repo, s->requires, line + 6, SOLVABLE_PREREQMARKER);
1210 case 'P' << 16 | 'r' << 8 | 'v':
1213 int l = strlen(line + 6) + 1;
1214 if (nfilelist + l > afilelist)
1216 afilelist = nfilelist + l + 512;
1217 filelist = solv_realloc(filelist, afilelist);
1219 memcpy(filelist + nfilelist, line + 6, l);
1226 for (l = 0; l < nfilelist; l += strlen(filelist + l) + 1)
1227 s->provides = repo_addid_dep(repo, s->provides, pool_str2id(pool, filelist + l, 1), 0);
1230 s->provides = adddep(repo, s->provides, line + 6, 0);
1232 case 'O' << 16 | 'b' << 8 | 's':
1233 s->obsoletes = adddep(repo, s->obsoletes, line + 6, 0);
1235 case 'C' << 16 | 'o' << 8 | 'n':
1236 s->conflicts = adddep(repo, s->conflicts, line + 6, 0);
1238 case 'R' << 16 | 'e' << 8 | 'c':
1239 s->recommends = adddep(repo, s->recommends, line + 6, 0);
1241 case 'S' << 16 | 'u' << 8 | 'p':
1242 s->supplements = adddep(repo, s->supplements, line + 6, 0);
1244 case 'S' << 16 | 'u' << 8 | 'g':
1245 s->suggests = adddep(repo, s->suggests, line + 6, 0);
1247 case 'E' << 16 | 'n' << 8 | 'h':
1248 s->enhances = adddep(repo, s->enhances, line + 6, 0);
1255 finish_solvable(pool, data, s, filelist, nfilelist);
1257 solv_free(filelist);
1258 repodata_free_dircache(data);
1259 if (!(flags & REPO_NO_INTERNALIZE))
1260 repodata_internalize(data);
1265 testcase_getpoolflags(Pool *pool)
1267 const char *str = 0;
1269 for (i = 0; poolflags2str[i].str; i++)
1271 v = pool_get_flag(pool, poolflags2str[i].flag);
1272 if (v == poolflags2str[i].def)
1274 str = pool_tmpappend(pool, str, v ? " " : " !", poolflags2str[i].str);
1276 return str ? str + 1 : "";
1280 testcase_setpoolflags(Pool *pool, const char *str)
1282 const char *p = str, *s;
1286 while (*p == ' ' || *p == '\t' || *p == ',')
1297 while (*p && *p != ' ' && *p != '\t' && *p != ',')
1299 for (i = 0; poolflags2str[i].str; i++)
1300 if (!strncmp(poolflags2str[i].str, s, p - s) && poolflags2str[i].str[p - s] == 0)
1302 if (!poolflags2str[i].str)
1304 pool_debug(pool, SOLV_ERROR, "setpoolflags: unknown flag '%.*s'\n", (int)(p - s), s);
1307 pool_set_flag(pool, poolflags2str[i].flag, v);
1313 testcase_resetpoolflags(Pool *pool)
1316 for (i = 0; poolflags2str[i].str; i++)
1317 pool_set_flag(pool, poolflags2str[i].flag, poolflags2str[i].def);
1321 testcase_getsolverflags(Solver *solv)
1323 Pool *pool = solv->pool;
1324 const char *str = 0;
1326 for (i = 0; solverflags2str[i].str; i++)
1328 v = solver_get_flag(solv, solverflags2str[i].flag);
1329 if (v == solverflags2str[i].def)
1331 str = pool_tmpappend(pool, str, v ? " " : " !", solverflags2str[i].str);
1333 return str ? str + 1 : "";
1337 testcase_setsolverflags(Solver *solv, const char *str)
1339 const char *p = str, *s;
1343 while (*p == ' ' || *p == '\t' || *p == ',')
1354 while (*p && *p != ' ' && *p != '\t' && *p != ',')
1356 for (i = 0; solverflags2str[i].str; i++)
1357 if (!strncmp(solverflags2str[i].str, s, p - s) && solverflags2str[i].str[p - s] == 0)
1359 if (!solverflags2str[i].str)
1361 pool_debug(solv->pool, SOLV_ERROR, "setsolverflags: unknown flag '%.*s'\n", (int)(p - s), s);
1364 solver_set_flag(solv, solverflags2str[i].flag, v);
1370 testcase_resetsolverflags(Solver *solv)
1373 for (i = 0; solverflags2str[i].str; i++)
1374 solver_set_flag(solv, solverflags2str[i].flag, solverflags2str[i].def);
1378 testcase_ruleid(Solver *solv, Id rid)
1384 const unsigned char *md5;
1390 solver_ruleliterals(solv, rid, &q);
1391 for (i = 0; i < q.count; i++)
1393 Id p = q.elements[i];
1394 s = testcase_solvid2str(solv->pool, p > 0 ? p : -p);
1396 s = pool_tmpjoin(solv->pool, "!", s, 0);
1397 strqueue_push(&sq, s);
1400 strqueue_sort_u(&sq);
1401 chk = solv_chksum_create(REPOKEY_TYPE_MD5);
1402 for (i = 0; i < sq.nstr; i++)
1403 solv_chksum_add(chk, sq.str[i], strlen(sq.str[i]) + 1);
1404 md5 = solv_chksum_get(chk, &md5l);
1405 s = pool_bin2hex(solv->pool, md5, md5l);
1406 chk = solv_chksum_free(chk, 0);
1412 testcase_problemid(Solver *solv, Id problem)
1417 const unsigned char *md5;
1421 /* we build a hash of all rules that define the problem */
1424 solver_findallproblemrules(solv, problem, &q);
1425 for (i = 0; i < q.count; i++)
1426 strqueue_push(&sq, testcase_ruleid(solv, q.elements[i]));
1428 strqueue_sort_u(&sq);
1429 chk = solv_chksum_create(REPOKEY_TYPE_MD5);
1430 for (i = 0; i < sq.nstr; i++)
1431 solv_chksum_add(chk, sq.str[i], strlen(sq.str[i]) + 1);
1432 md5 = solv_chksum_get(chk, &md5l);
1433 s = pool_bin2hex(solv->pool, md5, 4);
1434 chk = solv_chksum_free(chk, 0);
1440 testcase_solutionid(Solver *solv, Id problem, Id solution)
1444 const unsigned char *md5;
1448 intid = solver_solutionelement_internalid(solv, problem, solution);
1449 /* internal stuff! handle with care! */
1453 s = testcase_job2str(solv->pool, solv->job.elements[-intid - 1], solv->job.elements[-intid]);
1458 s = testcase_ruleid(solv, intid);
1460 chk = solv_chksum_create(REPOKEY_TYPE_MD5);
1461 solv_chksum_add(chk, s, strlen(s) + 1);
1462 md5 = solv_chksum_get(chk, &md5l);
1463 s = pool_bin2hex(solv->pool, md5, 4);
1464 chk = solv_chksum_free(chk, 0);
1468 static struct class2str {
1472 { SOLVER_TRANSACTION_ERASE, "erase" },
1473 { SOLVER_TRANSACTION_INSTALL, "install" },
1474 { SOLVER_TRANSACTION_REINSTALLED, "reinstall" },
1475 { SOLVER_TRANSACTION_DOWNGRADED, "downgrade" },
1476 { SOLVER_TRANSACTION_CHANGED, "change" },
1477 { SOLVER_TRANSACTION_UPGRADED, "upgrade" },
1478 { SOLVER_TRANSACTION_OBSOLETED, "obsolete" },
1479 { SOLVER_TRANSACTION_MULTIINSTALL, "multiinstall" },
1480 { SOLVER_TRANSACTION_MULTIREINSTALL, "multireinstall" },
1485 testcase_solverresult(Solver *solv, int resultflags)
1487 Pool *pool = solv->pool;
1495 if ((resultflags & TESTCASE_RESULT_TRANSACTION) != 0)
1497 Transaction *trans = solver_create_transaction(solv);
1501 for (i = 0; class2str[i].str; i++)
1504 transaction_classify_pkgs(trans, SOLVER_TRANSACTION_KEEP_PSEUDO, class2str[i].class, 0, 0, &q);
1505 for (j = 0; j < q.count; j++)
1509 if (pool->installed && pool->solvables[p].repo == pool->installed)
1510 op = transaction_obs_pkg(trans, p);
1511 s = pool_tmpjoin(pool, class2str[i].str, " ", testcase_solvid2str(pool, p));
1513 s = pool_tmpjoin(pool, s, " ", testcase_solvid2str(pool, op));
1514 strqueue_push(&sq, s);
1518 transaction_free(trans);
1520 if ((resultflags & TESTCASE_RESULT_PROBLEMS) != 0)
1522 char *probprefix, *solprefix;
1523 int problem, solution, element;
1526 pcnt = solver_problem_count(solv);
1527 for (problem = 1; problem <= pcnt; problem++)
1529 Id rid, from, to, dep;
1530 SolverRuleinfo rinfo;
1531 rid = solver_findproblemrule(solv, problem);
1532 s = testcase_problemid(solv, problem);
1533 probprefix = solv_dupjoin("problem ", s, 0);
1534 rinfo = solver_ruleinfo(solv, rid, &from, &to, &dep);
1535 s = pool_tmpjoin(pool, probprefix, " info ", solver_problemruleinfo2str(solv, rinfo, from, to, dep));
1536 strqueue_push(&sq, s);
1537 scnt = solver_solution_count(solv, problem);
1538 for (solution = 1; solution <= scnt; solution++)
1540 s = testcase_solutionid(solv, problem, solution);
1541 solprefix = solv_dupjoin(probprefix, " solution ", s);
1543 while ((element = solver_next_solutionelement(solv, problem, solution, element, &p, &op)) != 0)
1545 if (p == SOLVER_SOLUTION_JOB)
1546 s = pool_tmpjoin(pool, solprefix, " deljob ", testcase_job2str(pool, solv->job.elements[op - 1], solv->job.elements[op]));
1547 else if (p > 0 && op == 0)
1548 s = pool_tmpjoin(pool, solprefix, " erase ", testcase_solvid2str(pool, p));
1549 else if (p > 0 && op > 0)
1551 s = pool_tmpjoin(pool, solprefix, " replace ", testcase_solvid2str(pool, p));
1552 s = pool_tmpappend(pool, s, " ", testcase_solvid2str(pool, op));
1554 else if (p < 0 && op > 0)
1555 s = pool_tmpjoin(pool, solprefix, " allow ", testcase_solvid2str(pool, op));
1557 s = pool_tmpjoin(pool, solprefix, " unknown", 0);
1558 strqueue_push(&sq, s);
1560 solv_free(solprefix);
1562 solv_free(probprefix);
1566 if ((resultflags & TESTCASE_RESULT_ORPHANED) != 0)
1571 solver_get_orphaned(solv, &q);
1572 for (i = 0; i < q.count; i++)
1574 s = pool_tmpjoin(pool, "orphaned ", testcase_solvid2str(pool, q.elements[i]), 0);
1575 strqueue_push(&sq, s);
1580 if ((resultflags & TESTCASE_RESULT_RECOMMENDED) != 0)
1586 solver_get_recommendations(solv, &qr, &qs, 0);
1587 for (i = 0; i < qr.count; i++)
1589 s = pool_tmpjoin(pool, "recommended ", testcase_solvid2str(pool, qr.elements[i]), 0);
1590 strqueue_push(&sq, s);
1592 for (i = 0; i < qs.count; i++)
1594 s = pool_tmpjoin(pool, "suggested ", testcase_solvid2str(pool, qs.elements[i]), 0);
1595 strqueue_push(&sq, s);
1601 if ((resultflags & TESTCASE_RESULT_UNNEEDED) != 0)
1607 solver_get_unneeded(solv, &q, 0);
1608 solver_get_unneeded(solv, &qf, 1);
1609 for (i = j = 0; i < q.count; i++)
1611 /* we rely on qf containing a subset of q in the same order */
1612 if (j < qf.count && q.elements[i] == qf.elements[j])
1614 s = pool_tmpjoin(pool, "unneeded_filtered ", testcase_solvid2str(pool, q.elements[i]), 0);
1618 s = pool_tmpjoin(pool, "unneeded ", testcase_solvid2str(pool, q.elements[i]), 0);
1619 strqueue_push(&sq, s);
1626 result = strqueue_join(&sq);
1633 testcase_write(Solver *solv, char *dir, int resultflags, const char *testcasename, const char *resultname)
1635 Pool *pool = solv->pool;
1646 testcasename = "testcase.t";
1648 resultname = "solver.result";
1650 if (mkdir(dir, 0777) && errno != EEXIST)
1652 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: could not create directory '%s'\n", dir);
1656 FOR_REPOS(repoid, repo)
1658 const char *name = testcase_repoid2str(pool, repoid);
1660 if (repo->subpriority)
1661 sprintf(priobuf, "%d.%d", repo->priority, repo->subpriority);
1663 sprintf(priobuf, "%d", repo->priority);
1664 out = pool_tmpjoin(pool, name, ".repo", ".gz");
1665 cmd = pool_tmpjoin(pool, "repo ", name, " ");
1666 cmd = pool_tmpappend(pool, cmd, priobuf, " ");
1667 cmd = pool_tmpappend(pool, cmd, "testtags ", out);
1668 strqueue_push(&sq, cmd);
1669 out = pool_tmpjoin(pool, dir, "/", out);
1670 if (!(fp = solv_xfopen(out, "w")))
1672 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: could not open '%s' for writing\n", out);
1676 testcase_write_testtags(repo, fp);
1679 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: write error\n");
1684 /* hmm, this is not optimal... we currently search for the lowest score */
1686 arch = pool->solvables[SYSTEMSOLVABLE].arch;
1687 for (i = 0; i < pool->lastarch; i++)
1689 if (pool->id2arch[i] == 1 && !lowscore)
1691 if (pool->id2arch[i] > 0x10000 && (!lowscore || pool->id2arch[i] < lowscore))
1694 lowscore = pool->id2arch[i];
1697 cmd = pool_tmpjoin(pool, "system ", pool->lastarch ? pool_id2str(pool, arch) : "unset", 0);
1698 for (i = 0; disttype2str[i].str != 0; i++)
1699 if (pool->disttype == disttype2str[i].type)
1701 pool_tmpappend(pool, cmd, " ", disttype2str[i].str ? disttype2str[i].str : "unknown");
1702 if (pool->installed)
1703 cmd = pool_tmpappend(pool, cmd, " ", testcase_repoid2str(pool, pool->installed->repoid));
1704 strqueue_push(&sq, cmd);
1705 s = testcase_getpoolflags(solv->pool);
1708 cmd = pool_tmpjoin(pool, "poolflags ", s, 0);
1709 strqueue_push(&sq, cmd);
1712 if (pool->vendorclasses)
1715 for (i = 0; pool->vendorclasses[i]; i++)
1717 cmd = pool_tmpappend(pool, cmd ? cmd : "vendorclass", " ", pool->vendorclasses[i]);
1718 if (!pool->vendorclasses[i + 1])
1720 strqueue_push(&sq, cmd);
1727 s = testcase_getsolverflags(solv);
1730 cmd = pool_tmpjoin(pool, "solverflags ", s, 0);
1731 strqueue_push(&sq, cmd);
1734 /* now dump all the ns callback values we know */
1735 if (pool->nscallback)
1739 for (rid = 1; rid < pool->nrels; rid++)
1741 Reldep *rd = pool->rels + rid;
1742 if (rd->flags != REL_NAMESPACE || rd->name == NAMESPACE_OTHERPROVIDERS)
1744 /* evaluate all namespace ids, skip empty results */
1745 d = pool_whatprovides(pool, MAKERELDEP(rid));
1746 if (!d || !pool->whatprovidesdata[d])
1748 cmd = pool_tmpjoin(pool, "namespace ", pool_id2str(pool, rd->name), "(");
1749 cmd = pool_tmpappend(pool, cmd, pool_id2str(pool, rd->evr), ")");
1750 for (; pool->whatprovidesdata[d]; d++)
1751 cmd = pool_tmpappend(pool, cmd, " ", testcase_solvid2str(pool, pool->whatprovidesdata[d]));
1752 strqueue_push(&sq, cmd);
1756 for (i = 0; i < solv->job.count; i += 2)
1758 cmd = (char *)testcase_job2str(pool, solv->job.elements[i], solv->job.elements[i + 1]);
1759 cmd = pool_tmpjoin(pool, "job ", cmd, 0);
1760 strqueue_push(&sq, cmd);
1767 for (i = 0; resultflags2str[i].str; i++)
1768 if ((resultflags & resultflags2str[i].flag) != 0)
1769 cmd = pool_tmpappend(pool, cmd, cmd ? "," : 0, resultflags2str[i].str);
1770 cmd = pool_tmpjoin(pool, "result ", cmd ? cmd : "?", 0);
1771 cmd = pool_tmpappend(pool, cmd, " ", resultname);
1772 strqueue_push(&sq, cmd);
1773 result = testcase_solverresult(solv, resultflags);
1774 if (!strcmp(resultname, "<inline>"))
1778 strqueue_init(&rsq);
1779 strqueue_split(&rsq, result);
1780 for (i = 0; i < rsq.nstr; i++)
1782 cmd = pool_tmpjoin(pool, "#>", rsq.str[i], 0);
1783 strqueue_push(&sq, cmd);
1785 strqueue_free(&rsq);
1789 out = pool_tmpjoin(pool, dir, "/", resultname);
1790 if (!(fp = fopen(out, "w")))
1792 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: could not open '%s' for writing\n", out);
1797 if (result && *result && fwrite(result, strlen(result), 1, fp) != 1)
1799 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: write error\n");
1807 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: write error\n");
1815 cmd = strqueue_join(&sq);
1816 out = pool_tmpjoin(pool, dir, "/", testcasename);
1817 if (!(fp = fopen(out, "w")))
1819 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: could not open '%s' for writing\n", out);
1823 if (*cmd && fwrite(cmd, strlen(cmd), 1, fp) != 1)
1825 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: write error\n");
1832 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: write error\n");
1842 read_inline_file(FILE *fp, char **bufp, char **bufpp, int *buflp)
1844 char *result = solv_malloc(1024);
1851 if (rp - result + 256 >= resultl)
1853 resultl = rp - result;
1854 result = solv_realloc(result, resultl + 1024);
1855 rp = result + resultl;
1858 if (!fgets(rp, resultl - (rp - result), fp))
1861 if (rl && (rp == result || rp[-1] == '\n'))
1863 if (rl > 1 && rp[0] == '#' && rp[1] == '>')
1865 memmove(rp, rp + 2, rl - 2);
1870 while (rl + 16 > *buflp)
1872 *bufp = solv_realloc(*bufp, *buflp + 512);
1875 memmove(*bufp, rp, rl);
1876 if ((*bufp)[rl - 1] == '\n')
1882 (*bufpp) = *bufp + rl;
1899 char *result = solv_malloc(1024);
1906 if (rp - result + 256 >= resultl)
1908 resultl = rp - result;
1909 result = solv_realloc(result, resultl + 1024);
1910 rp = result + resultl;
1913 rl = fread(rp, 1, resultl - (rp - result), fp);
1925 str2resultflags(Pool *pool, char *s) /* modifies the string! */
1927 int i, resultflags = 0;
1930 char *se = strchr(s, ',');
1933 for (i = 0; resultflags2str[i].str; i++)
1934 if (!strcmp(s, resultflags2str[i].str))
1936 resultflags |= resultflags2str[i].flag;
1939 if (!resultflags2str[i].str)
1940 pool_debug(pool, SOLV_ERROR, "result: unknown flag '%s'\n", s);
1947 testcase_read(Pool *pool, FILE *fp, char *testcase, Queue *job, char **resultp, int *resultflagsp)
1952 char *testcasedir, *s;
1958 int poolflagsreset = 0;
1960 if (!fp && !(fp = fopen(testcase, "r")))
1962 pool_debug(pool, SOLV_ERROR, "testcase_read: could not open '%s'\n", testcase);
1965 testcasedir = solv_strdup(testcase);
1966 if ((s = strrchr(testcasedir, '/')) != 0)
1971 buf = solv_malloc(bufl);
1976 if (bufp - buf + 16 > bufl)
1979 buf = solv_realloc(buf, bufl + 512);
1983 if (!fgets(bufp, bufl - (bufp - buf), fp))
1987 if (!l || buf[l - 1] != '\n')
1994 while (*s && (*s == ' ' || *s == '\t'))
1996 if (!*s || *s == '#')
1999 /* split it in pieces */
2002 while (*s == ' ' || *s == '\t')
2006 pieces = solv_extend(pieces, npieces, 1, sizeof(*pieces), 7);
2007 pieces[npieces++] = s;
2008 while (*s && *s != ' ' && *s != '\t')
2013 pieces = solv_extend(pieces, npieces, 1, sizeof(*pieces), 7);
2014 pieces[npieces] = 0;
2015 if (!strcmp(pieces[0], "repo") && npieces >= 4)
2017 Repo *repo = repo_create(pool, pieces[1]);
2023 if (!poolflagsreset)
2026 testcase_resetpoolflags(pool); /* hmm */
2028 if (sscanf(pieces[2], "%d.%d", &prio, &subprio) != 2)
2031 prio = atoi(pieces[2]);
2033 repo->priority = prio;
2034 repo->subpriority = subprio;
2035 if (strcmp(pieces[3], "empty") != 0)
2037 const char *repotype = pool_tmpjoin(pool, pieces[3], 0, 0); /* gets overwritten in <inline> case */
2038 if (!strcmp(pieces[4], "<inline>"))
2040 char *idata = read_inline_file(fp, &buf, &bufp, &bufl);
2042 rfp = solv_xfopen_buf(rdata, &idata, 0, "rf");
2046 rdata = pool_tmpjoin(pool, testcasedir, pieces[4], 0);
2047 rfp = solv_xfopen(rdata, "r");
2051 pool_debug(pool, SOLV_ERROR, "testcase_read: could not open '%s'\n", rdata);
2053 else if (!strcmp(repotype, "testtags"))
2055 testcase_add_testtags(repo, rfp, 0);
2058 else if (!strcmp(repotype, "solv"))
2060 repo_add_solv(repo, rfp, 0);
2064 else if (!strcmp(repotype, "helix"))
2066 extern int repo_add_helix(Repo *repo, FILE *fp, int flags);
2067 repo_add_helix(repo, rfp, 0);
2074 pool_debug(pool, SOLV_ERROR, "testcase_read: unknown repo type for repo '%s'\n", repo->name);
2078 else if (!strcmp(pieces[0], "system") && npieces >= 3)
2082 /* must set the disttype before the arch */
2083 for (i = 0; disttype2str[i].str != 0; i++)
2084 if (!strcmp(disttype2str[i].str, pieces[2]))
2086 if (!disttype2str[i].str)
2087 pool_debug(pool, SOLV_ERROR, "testcase_read: system: unknown disttype '%s'\n", pieces[2]);
2088 else if (pool->disttype != disttype2str[i].type)
2090 #ifdef MULTI_SEMANTICS
2091 pool_setdisttype(pool, disttype2str[i].type);
2093 pool_debug(pool, SOLV_ERROR, "testcase_read: system: cannot change disttype to '%s'\n", pieces[2]);
2096 if (strcmp(pieces[1], "unset") == 0)
2097 pool_setarch(pool, 0);
2098 else if (pieces[1][0] == ':')
2099 pool_setarchpolicy(pool, pieces[1] + 1);
2101 pool_setarch(pool, pieces[1]);
2104 Repo *repo = testcase_str2repo(pool, pieces[3]);
2106 pool_debug(pool, SOLV_ERROR, "testcase_read: system: unknown repo '%s'\n", pieces[3]);
2108 pool_set_installed(pool, repo);
2111 else if (!strcmp(pieces[0], "job") && npieces > 1)
2117 pool_addfileprovides(pool);
2118 pool_createwhatprovides(pool);
2121 if (npieces >= 3 && !strcmp(pieces[2], "selection"))
2123 addselectionjob(pool, pieces + 1, npieces - 1, job);
2127 for (sp = pieces[1]; sp < pieces[npieces - 1]; sp++)
2130 how = testcase_str2job(pool, pieces[1], &what);
2131 if (how >= 0 && job)
2132 queue_push2(job, how, what);
2134 else if (!strcmp(pieces[0], "vendorclass") && npieces > 1)
2136 pool_addvendorclass(pool, (const char **)(pieces + 1));
2138 else if (!strcmp(pieces[0], "namespace") && npieces > 1)
2140 int i = strlen(pieces[1]);
2141 s = strchr(pieces[1], '(');
2142 if (!s && pieces[1][i - 1] != ')')
2144 pool_debug(pool, SOLV_ERROR, "testcase_read: bad namespace '%s'\n", pieces[1]);
2152 pieces[1][i - 1] = 0;
2153 name = pool_str2id(pool, pieces[1], 1);
2154 evr = pool_str2id(pool, s + 1, 1);
2156 pieces[1][i - 1] = ')';
2157 id = pool_rel2id(pool, name, evr, REL_NAMESPACE, 1);
2158 for (i = 2; i < npieces; i++)
2159 queue_push(&q, testcase_str2solvid(pool, pieces[i]));
2160 /* now do the callback */
2163 pool_addfileprovides(pool);
2164 pool_createwhatprovides(pool);
2167 pool->whatprovides_rel[GETRELID(id)] = pool_queuetowhatprovides(pool, &q);
2171 else if (!strcmp(pieces[0], "poolflags"))
2174 if (!poolflagsreset)
2177 testcase_resetpoolflags(pool); /* hmm */
2179 for (i = 1; i < npieces; i++)
2180 testcase_setpoolflags(pool, pieces[i]);
2182 else if (!strcmp(pieces[0], "solverflags") && npieces > 1)
2187 solv = solver_create(pool);
2188 testcase_resetsolverflags(solv);
2190 for (i = 1; i < npieces; i++)
2191 testcase_setsolverflags(solv, pieces[i]);
2193 else if (!strcmp(pieces[0], "result") && npieces > 1)
2196 int resultflags = str2resultflags(pool, pieces[1]);
2200 rdata = pool_tmpjoin(pool, testcasedir, pieces[2], 0);
2201 if (!strcmp(pieces[2], "<inline>"))
2202 result = read_inline_file(fp, &buf, &bufp, &bufl);
2205 FILE *rfp = fopen(rdata, "r");
2207 pool_debug(pool, SOLV_ERROR, "testcase_read: could not open '%s'\n", rdata);
2210 result = read_file(rfp);
2220 *resultflagsp = resultflags;
2222 else if (!strcmp(pieces[0], "nextjob") && npieces == 1)
2228 pool_debug(pool, SOLV_ERROR, "testcase_read: cannot parse command '%s'\n", pieces[0]);
2231 buf = solv_free(buf);
2232 pieces = solv_free(pieces);
2233 solv_free(testcasedir);
2236 pool_addfileprovides(pool);
2237 pool_createwhatprovides(pool);
2241 solv = solver_create(pool);
2242 testcase_resetsolverflags(solv);
2250 testcase_resultdiff(char *result1, char *result2)
2252 Strqueue sq1, sq2, osq;
2254 strqueue_init(&sq1);
2255 strqueue_init(&sq2);
2256 strqueue_init(&osq);
2257 strqueue_split(&sq1, result1);
2258 strqueue_split(&sq2, result2);
2259 strqueue_sort(&sq1);
2260 strqueue_sort(&sq2);
2261 strqueue_diff(&sq1, &sq2, &osq);
2262 r = osq.nstr ? strqueue_join(&osq) : 0;
2263 strqueue_free(&sq1);
2264 strqueue_free(&sq2);
2265 strqueue_free(&osq);