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_NOTBYUSER, "notbyuser" },
62 { SOLVER_SETEV, "setev" },
63 { SOLVER_SETEVR, "setevr" },
64 { SOLVER_SETARCH, "setarch" },
65 { SOLVER_SETVENDOR, "setvendor" },
66 { SOLVER_SETREPO, "setrepo" },
67 { SOLVER_NOAUTOSET, "noautoset" },
71 static struct resultflags2str {
74 } resultflags2str[] = {
75 { TESTCASE_RESULT_TRANSACTION, "transaction" },
76 { TESTCASE_RESULT_PROBLEMS, "problems" },
77 { TESTCASE_RESULT_ORPHANED, "orphaned" },
78 { TESTCASE_RESULT_RECOMMENDED, "recommended" },
79 { TESTCASE_RESULT_UNNEEDED, "unneeded" },
83 static struct solverflags2str {
87 } solverflags2str[] = {
88 { SOLVER_FLAG_ALLOW_DOWNGRADE, "allowdowngrade", 0 },
89 { SOLVER_FLAG_ALLOW_NAMECHANGE, "allownamechange", 1 },
90 { SOLVER_FLAG_ALLOW_ARCHCHANGE, "allowarchchange", 0 },
91 { SOLVER_FLAG_ALLOW_VENDORCHANGE, "allowvendorchange", 0 },
92 { SOLVER_FLAG_ALLOW_UNINSTALL, "allowuninstall", 0 },
93 { SOLVER_FLAG_NO_UPDATEPROVIDE, "noupdateprovide", 0 },
94 { SOLVER_FLAG_SPLITPROVIDES, "splitprovides", 0 },
95 { SOLVER_FLAG_IGNORE_RECOMMENDED, "ignorerecommended", 0 },
96 { SOLVER_FLAG_ADD_ALREADY_RECOMMENDED, "addalreadyrecommended", 0 },
97 { SOLVER_FLAG_NO_INFARCHCHECK, "noinfarchcheck", 0 },
98 { SOLVER_FLAG_KEEP_EXPLICIT_OBSOLETES, "keepexplicitobsoletes", 0 },
99 { SOLVER_FLAG_BEST_OBEY_POLICY, "bestobeypolicy", 0 },
100 { SOLVER_FLAG_NO_AUTOTARGET, "noautotarget", 0 },
101 { SOLVER_FLAG_DUP_ALLOW_DOWNGRADE, "dupallowdowngrade", 1 },
102 { SOLVER_FLAG_DUP_ALLOW_ARCHCHANGE, "dupallowarchchange", 1 },
103 { SOLVER_FLAG_DUP_ALLOW_VENDORCHANGE, "dupallowvendorchange", 1 },
104 { SOLVER_FLAG_DUP_ALLOW_NAMECHANGE, "dupallownamechange", 1 },
108 static struct poolflags2str {
112 } poolflags2str[] = {
113 { POOL_FLAG_PROMOTEEPOCH, "promoteepoch", 0 },
114 { POOL_FLAG_FORBIDSELFCONFLICTS, "forbidselfconflicts", 0 },
115 { POOL_FLAG_OBSOLETEUSESPROVIDES, "obsoleteusesprovides", 0 },
116 { POOL_FLAG_IMPLICITOBSOLETEUSESPROVIDES, "implicitobsoleteusesprovides", 0 },
117 { POOL_FLAG_OBSOLETEUSESCOLORS, "obsoleteusescolors", 0 },
118 { POOL_FLAG_IMPLICITOBSOLETEUSESCOLORS, "implicitobsoleteusescolors", 0 },
119 { POOL_FLAG_NOINSTALLEDOBSOLETES, "noinstalledobsoletes", 0 },
120 { POOL_FLAG_HAVEDISTEPOCH, "havedistepoch", 0 },
121 { POOL_FLAG_NOOBSOLETESMULTIVERSION, "noobsoletesmultiversion", 0 },
122 { POOL_FLAG_ADDFILEPROVIDESFILTERED, "addfileprovidesfiltered", 0 },
126 static struct disttype2str {
130 { DISTTYPE_RPM, "rpm" },
131 { DISTTYPE_DEB, "deb" },
132 { DISTTYPE_ARCH, "arch" },
133 { DISTTYPE_HAIKU, "haiku" },
137 static struct selflags2str {
141 { SELECTION_NAME, "name" },
142 { SELECTION_PROVIDES, "provides" },
143 { SELECTION_FILELIST, "filelist" },
144 { SELECTION_CANON, "canon" },
145 { SELECTION_DOTARCH, "dotarch" },
146 { SELECTION_REL, "rel" },
147 { SELECTION_INSTALLED_ONLY, "installedonly" },
148 { SELECTION_GLOB, "glob" },
149 { SELECTION_FLAT, "flat" },
150 { SELECTION_NOCASE, "nocase" },
151 { SELECTION_SOURCE_ONLY, "sourceonly" },
152 { SELECTION_WITH_SOURCE, "withsource" },
157 typedef struct strqueue {
162 #define STRQUEUE_BLOCK 63
165 strqueue_init(Strqueue *q)
172 strqueue_free(Strqueue *q)
175 for (i = 0; i < q->nstr; i++)
176 solv_free(q->str[i]);
177 q->str = solv_free(q->str);
182 strqueue_push(Strqueue *q, const char *s)
184 q->str = solv_extend(q->str, q->nstr, 1, sizeof(*q->str), STRQUEUE_BLOCK);
185 q->str[q->nstr++] = solv_strdup(s);
189 strqueue_pushjoin(Strqueue *q, const char *s1, const char *s2, const char *s3)
191 q->str = solv_extend(q->str, q->nstr, 1, sizeof(*q->str), STRQUEUE_BLOCK);
192 q->str[q->nstr++] = solv_dupjoin(s1, s2, s3);
196 strqueue_sort_cmp(const void *ap, const void *bp, void *dp)
198 const char *a = *(const char **)ap;
199 const char *b = *(const char **)bp;
200 return strcmp(a ? a : "", b ? b : "");
204 strqueue_sort(Strqueue *q)
207 solv_sort(q->str, q->nstr, sizeof(*q->str), strqueue_sort_cmp, 0);
211 strqueue_sort_u(Strqueue *q)
215 for (i = j = 0; i < q->nstr; i++)
216 if (!j || strqueue_sort_cmp(q->str + i, q->str + j - 1, 0) != 0)
217 q->str[j++] = q->str[i];
222 strqueue_join(Strqueue *q)
226 for (i = 0; i < q->nstr; i++)
228 l += strlen(q->str[i]) + 1;
229 l++; /* trailing \0 */
232 for (i = 0; i < q->nstr; i++)
235 strcpy(rp, q->str[i]);
244 strqueue_split(Strqueue *q, const char *s)
249 while ((p = strchr(s, '\n')) != 0)
251 q->str = solv_extend(q->str, q->nstr, 1, sizeof(*q->str), STRQUEUE_BLOCK);
252 q->str[q->nstr] = solv_malloc(p - s + 1);
254 memcpy(q->str[q->nstr], s, p - s);
255 q->str[q->nstr][p - s] = 0;
264 strqueue_diff(Strqueue *sq1, Strqueue *sq2, Strqueue *osq)
267 while (i < sq1->nstr && j < sq2->nstr)
269 int r = strqueue_sort_cmp(sq1->str + i, sq2->str + j, 0);
273 strqueue_pushjoin(osq, "-", sq1->str[i++], 0);
275 strqueue_pushjoin(osq, "+", sq2->str[j++], 0);
277 while (i < sq1->nstr)
278 strqueue_pushjoin(osq, "-", sq1->str[i++], 0);
279 while (j < sq2->nstr)
280 strqueue_pushjoin(osq, "+", sq2->str[j++], 0);
284 pool_isknownarch(Pool *pool, Id id)
286 if (!id || id == ID_EMPTY)
288 if (id == ARCH_SRC || id == ARCH_NOSRC || id == ARCH_NOARCH)
290 if (!pool->id2arch || (id > pool->lastarch || !pool->id2arch[id]))
296 testcase_str2dep_simple(Pool *pool, const char **sp)
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);
327 else if (s - n > 4 && s[-4] == ':' && !strncmp(s - 4, ":any", 4))
329 id = pool_strn2id(pool, n, s - n - 4, 1);
330 id = pool_rel2id(pool, id, ARCH_ANY, REL_MULTIARCH, 1);
333 id = pool_strn2id(pool, n, s - n, 1);
339 while (*s == ' ' || *s == '\t')
342 if (*s == '!' && s[1] == '=') /* support != as synonym for <> */
344 flags = REL_LT | REL_GT;
363 while (*s == ' ' || *s == '\t')
366 while (*s && *s != ' ' && *s != '\t')
368 evr = pool_strn2id(pool, n, s - n, 1);
369 if (*s == ' ' && !strcmp(s, " compat >= "))
372 while (*s == ' ' || *s == '\t')
375 while (*s && *s != ' ' && *s != '\t')
377 evr = pool_rel2id(pool, evr, pool_strn2id(pool, n, s - n, 1), REL_COMPAT, 1);
380 return pool_rel2id(pool, id, evr, flags, 1);
384 testcase_str2dep_complex(Pool *pool, const char **sp)
388 #ifdef ENABLE_COMPLEX_DEPS
389 while (*s == ' ' || *s == '\t')
394 id = testcase_str2dep_complex(pool, &s);
397 while (*s == ' ' || *s == '\t')
402 id = testcase_str2dep_simple(pool, &s);
406 id = pool_rel2id(pool, id, testcase_str2dep_complex(pool, &s), REL_OR, 1);
411 id = pool_rel2id(pool, id, testcase_str2dep_complex(pool, &s), REL_AND, 1);
413 else if (*s == 'I' && s[1] == 'F' && (s[2] == ' ' || s[2] == '\t'))
416 id = pool_rel2id(pool, id, testcase_str2dep_complex(pool, &s), REL_COND, 1);
423 testcase_str2dep(Pool *pool, const char *s)
425 return testcase_str2dep_complex(pool, &s);
429 testcase_repoid2str(Pool *pool, Id repoid)
431 Repo *repo = pool_id2repo(pool, repoid);
434 char *r = pool_tmpjoin(pool, repo->name, 0, 0);
436 for (rp = r; *rp; rp++)
437 if (*rp == ' ' || *rp == '\t')
444 sprintf(buf, "#%d", repoid);
445 return pool_tmpjoin(pool, buf, 0, 0);
450 testcase_solvid2str(Pool *pool, Id p)
452 Solvable *s = pool->solvables + p;
453 const char *n, *e, *a;
456 if (p == SYSTEMSOLVABLE)
458 n = pool_id2str(pool, s->name);
459 e = pool_id2str(pool, s->evr);
460 a = pool_id2str(pool, s->arch);
461 str = pool_alloctmpspace(pool, strlen(n) + strlen(e) + strlen(a) + 3);
462 sprintf(str, "%s-%s.%s", n, e, a);
464 return pool_tmpappend(pool, str, "@", 0);
468 char *str2 = pool_tmpappend(pool, str, "@", s->repo->name);
470 if (str2[l] == ' ' || str2[l] == '\t')
474 sprintf(buf, "@#%d", s->repo->repoid);
475 return pool_tmpappend(pool, str, buf, 0);
479 testcase_str2repo(Pool *pool, const char *str)
483 if (str[0] == '#' && (str[1] >= '0' && str[1] <= '9'))
487 for (j = 1; str[j] >= '0' && str[j] <= '9'; j++)
488 repoid = repoid * 10 + (str[j] - '0');
489 if (!str[j] && repoid > 0 && repoid < pool->nrepos)
490 repo = pool_id2repo(pool, repoid);
494 FOR_REPOS(repoid, repo)
499 l = strlen(repo->name);
500 for (i = 0; i < l; i++)
502 int c = repo->name[i];
503 if (c == ' ' || c == '\t')
508 if (i == l && !str[l])
511 if (repoid >= pool->nrepos)
518 testcase_str2solvid(Pool *pool, const char *str)
520 int i, l = strlen(str);
527 if (*str == '@' && !strcmp(str, "@SYSTEM"))
528 return SYSTEMSOLVABLE;
530 for (i = l - 1; i >= 0; i--)
531 if (str[i] == '@' && (repo = testcase_str2repo(pool, str + i + 1)) != 0)
536 /* now find the arch (if present) */
538 for (i = repostart - 1; i > 0; i--)
541 arch = pool_strn2id(pool, str + i + 1, repostart - (i + 1), 0);
546 /* now find the name */
547 for (i = repostart - 1; i > 0; i--)
551 Id nid, evrid, p, pp;
552 nid = pool_strn2id(pool, str, i, 0);
555 evrid = pool_strn2id(pool, str + i + 1, repostart - (i + 1), 0);
558 FOR_PROVIDES(p, pp, nid)
560 Solvable *s = pool->solvables + p;
561 if (s->name != nid || s->evr != evrid)
563 if (repo && s->repo != repo)
565 if (arch && s->arch != arch)
575 testcase_job2str(Pool *pool, Id how, Id what)
582 Id select = how & SOLVER_SELECTMASK;
584 for (i = 0; job2str[i].str; i++)
585 if ((how & SOLVER_JOBMASK) == job2str[i].job)
587 jobstr = job2str[i].str ? job2str[i].str : "unknown";
588 if (select == SOLVER_SOLVABLE)
591 pkgstr = testcase_solvid2str(pool, what);
593 else if (select == SOLVER_SOLVABLE_NAME)
596 pkgstr = pool_dep2str(pool, what);
598 else if (select == SOLVER_SOLVABLE_PROVIDES)
600 selstr = " provides ";
601 pkgstr = pool_dep2str(pool, what);
603 else if (select == SOLVER_SOLVABLE_ONE_OF)
608 while ((p = pool->whatprovidesdata[what++]) != 0)
610 const char *s = testcase_solvid2str(pool, p);
613 pkgstr = pool_tmpappend(pool, pkgstr, " ", s);
614 pool_freetmpspace(pool, s);
622 else if (select == SOLVER_SOLVABLE_REPO)
624 Repo *repo = pool_id2repo(pool, what);
629 sprintf(buf, "#%d", repo->repoid);
630 pkgstr = pool_tmpjoin(pool, buf, 0, 0);
633 pkgstr = pool_tmpjoin(pool, repo->name, 0, 0);
635 else if (select == SOLVER_SOLVABLE_ALL)
642 selstr = " unknown ";
645 ret = pool_tmpjoin(pool, jobstr, selstr, pkgstr);
647 ret = pool_tmpappend(pool, ret, " ", 0);
648 for (i = 0; jobflags2str[i].str; i++)
649 if ((how & jobflags2str[i].flag) != 0)
650 ret = pool_tmpappend(pool, ret, ",", jobflags2str[i].str);
656 ret = pool_tmpappend(pool, ret, "]", 0);
662 str2selflags(Pool *pool, char *s) /* modifies the string! */
667 char *se = strchr(s, ',');
670 for (i = 0; selflags2str[i].str; i++)
671 if (!strcmp(s, selflags2str[i].str))
673 selflags |= selflags2str[i].flag;
676 if (!selflags2str[i].str)
677 pool_debug(pool, SOLV_ERROR, "str2job: unknown selection flag '%s'\n", s);
684 str2jobflags(Pool *pool, char *s) /* modifies the string */
689 char *se = strchr(s, ',');
692 for (i = 0; jobflags2str[i].str; i++)
693 if (!strcmp(s, jobflags2str[i].str))
695 jobflags |= jobflags2str[i].flag;
698 if (!jobflags2str[i].str)
699 pool_debug(pool, SOLV_ERROR, "str2job: unknown job flag '%s'\n", s);
706 testcase_str2job(Pool *pool, const char *str, Id *whatp)
716 /* so we can patch it */
717 s = pool_tmpjoin(pool, str, 0, 0);
718 /* split it in pieces */
721 while (*s == ' ' || *s == '\t')
725 pieces = solv_extend(pieces, npieces, 1, sizeof(*pieces), 7);
726 pieces[npieces++] = s;
727 while (*s && *s != ' ' && *s != '\t')
734 pool_debug(pool, SOLV_ERROR, "str2job: bad line '%s'\n", str);
739 for (i = 0; job2str[i].str; i++)
740 if (!strcmp(pieces[0], job2str[i].str))
744 pool_debug(pool, SOLV_ERROR, "str2job: unknown job '%s'\n", str);
748 job = job2str[i].job;
752 char *flags = pieces[npieces - 1];
753 if (*flags == '[' && flags[strlen(flags) - 1] == ']')
757 flags[strlen(flags) - 1] = 0;
758 job |= str2jobflags(pool, flags);
761 if (!strcmp(pieces[1], "pkg"))
765 pool_debug(pool, SOLV_ERROR, "str2job: bad pkg selector in '%s'\n", str);
769 job |= SOLVER_SOLVABLE;
770 what = testcase_str2solvid(pool, pieces[2]);
773 pool_debug(pool, SOLV_ERROR, "str2job: unknown package '%s'\n", pieces[2]);
778 else if (!strcmp(pieces[1], "name") || !strcmp(pieces[1], "provides"))
780 /* join em again for dep2str... */
782 for (sp = pieces[2]; sp < pieces[npieces - 1]; sp++)
786 if (pieces[1][0] == 'p' && strncmp(pieces[2], "namespace:", 10) == 0)
788 char *spe = strchr(pieces[2], '(');
789 int l = strlen(pieces[2]);
790 if (spe && pieces[2][l - 1] == ')')
792 /* special namespace provides */
793 if (strcmp(spe, "(<NULL>)") != 0)
795 pieces[2][l - 1] = 0;
796 what = testcase_str2dep(pool, spe + 1);
797 pieces[2][l - 1] = ')';
799 what = pool_rel2id(pool, pool_strn2id(pool, pieces[2], spe - pieces[2], 1), what, REL_NAMESPACE, 1);
803 what = testcase_str2dep(pool, pieces[2]);
804 if (pieces[1][0] == 'n')
805 job |= SOLVER_SOLVABLE_NAME;
807 job |= SOLVER_SOLVABLE_PROVIDES;
809 else if (!strcmp(pieces[1], "oneof"))
812 job |= SOLVER_SOLVABLE_ONE_OF;
814 if (npieces > 3 && strcmp(pieces[2], "nothing") != 0)
816 for (i = 2; i < npieces; i++)
818 Id p = testcase_str2solvid(pool, pieces[i]);
821 pool_debug(pool, SOLV_ERROR, "str2job: unknown package '%s'\n", pieces[i]);
829 what = pool_queuetowhatprovides(pool, &q);
832 else if (!strcmp(pieces[1], "repo"))
837 pool_debug(pool, SOLV_ERROR, "str2job: bad line '%s'\n", str);
841 repo = testcase_str2repo(pool, pieces[2]);
844 pool_debug(pool, SOLV_ERROR, "str2job: unknown repo '%s'\n", pieces[2]);
848 job |= SOLVER_SOLVABLE_REPO;
851 else if (!strcmp(pieces[1], "all"))
853 if (npieces != 3 && strcmp(pieces[2], "packages") != 0)
855 pool_debug(pool, SOLV_ERROR, "str2job: bad line '%s'\n", str);
859 job |= SOLVER_SOLVABLE_ALL;
864 pool_debug(pool, SOLV_ERROR, "str2job: unknown selection in '%s'\n", str);
874 addselectionjob(Pool *pool, char **pieces, int npieces, Queue *jobqueue)
881 for (i = 0; job2str[i].str; i++)
882 if (!strcmp(pieces[0], job2str[i].str))
886 pool_debug(pool, SOLV_ERROR, "selstr2job: unknown job '%s'\n", pieces[0]);
889 job = job2str[i].job;
892 char *flags = pieces[npieces - 1];
893 if (*flags == '[' && flags[strlen(flags) - 1] == ']')
897 flags[strlen(flags) - 1] = 0;
898 job |= str2jobflags(pool, flags);
903 pool_debug(pool, SOLV_ERROR, "selstr2job: no selection flags\n");
906 selflags = str2selflags(pool, pieces[3]);
908 r = selection_make(pool, &sel, pieces[2], selflags);
909 for (i = 0; i < sel.count; i += 2)
910 queue_push2(jobqueue, job | sel.elements[i], sel.elements[i + 1]);
916 writedeps(Repo *repo, FILE *fp, const char *tag, Id key, Solvable *s, Offset off)
918 Pool *pool = repo->pool;
925 dp = repo->idarraydata + off;
927 while ((id = *dp++) != 0)
929 if (key == SOLVABLE_REQUIRES && id == SOLVABLE_PREREQMARKER)
932 fprintf(fp, "-%s\n", tag);
937 if (key == SOLVABLE_PROVIDES && id == SOLVABLE_FILEMARKER)
942 idstr = pool_dep2str(pool, id);
945 Reldep *rd = GETRELDEP(pool, id);
946 if (key == SOLVABLE_CONFLICTS && rd->flags == REL_NAMESPACE && rd->name == NAMESPACE_OTHERPROVIDERS)
948 if (!strncmp(idstr, "namespace:", 10))
951 if (key == SOLVABLE_SUPPLEMENTS)
953 if (rd->flags == REL_NAMESPACE && rd->name == NAMESPACE_FILESYSTEM)
955 if (!strncmp(idstr, "namespace:", 10))
958 else if (rd->flags == REL_NAMESPACE && rd->name == NAMESPACE_MODALIAS)
960 if (!strncmp(idstr, "namespace:", 10))
963 else if (rd->flags == REL_AND)
965 /* either packageand chain or modalias */
967 if (ISRELDEP(rd->evr))
969 Reldep *mrd = GETRELDEP(pool, rd->evr);
970 if (mrd->flags == REL_NAMESPACE && mrd->name == NAMESPACE_MODALIAS)
972 idstr = pool_tmpjoin(pool, "modalias(", pool_dep2str(pool, rd->name), ":");
973 idstr = pool_tmpappend(pool, idstr, pool_dep2str(pool, mrd->evr), ")");
975 else if (mrd->flags >= 8)
980 /* must be and chain */
981 idstr = pool_dep2str(pool, rd->evr);
987 rd = GETRELDEP(pool, id);
988 if (rd->flags != REL_AND)
990 idstr = pool_tmpjoin(pool, pool_dep2str(pool, rd->evr), ":", idstr);
992 idstr = pool_tmpjoin(pool, pool_dep2str(pool, id), ":", idstr);
993 idstr = pool_tmpjoin(pool, "packageand(", idstr, ")");
996 else if (rd->flags >= 8)
1002 fprintf(fp, "+%s\n", tag);
1005 fprintf(fp, "%s\n", idstr);
1007 if (key == SOLVABLE_PROVIDES)
1009 /* add the filelist */
1011 dataiterator_init(&di, pool, repo, s - pool->solvables, SOLVABLE_FILELIST, 0, 0);
1012 while (dataiterator_step(&di))
1014 const char *s = repodata_dir2str(di.data, di.kv.id, di.kv.str);
1017 Id id = pool_str2id(pool, s, 0);
1020 for (dp = prvdp; *dp; dp++)
1024 continue; /* already included */
1029 fprintf(fp, "+%s", tag);
1032 fprintf(fp, "%s\n", s);
1036 fprintf(fp, "-%s\n", tag);
1040 testcase_write_testtags(Repo *repo, FILE *fp)
1042 Pool *pool = repo->pool;
1048 const char *release;
1052 fprintf(fp, "=Ver: 2.0\n");
1053 FOR_REPO_SOLVABLES(repo, p, s)
1055 name = pool_id2str(pool, s->name);
1056 evr = pool_id2str(pool, s->evr);
1057 arch = pool_id2str(pool, s->arch);
1058 release = strrchr(evr, '-');
1060 release = evr + strlen(evr);
1061 fprintf(fp, "=Pkg: %s %.*s %s %s\n", name, (int)(release - evr), evr, *release && release[1] ? release + 1 : "-", arch);
1062 tmp = solvable_lookup_str(s, SOLVABLE_SUMMARY);
1064 fprintf(fp, "=Sum: %s\n", tmp);
1065 writedeps(repo, fp, "Req:", SOLVABLE_REQUIRES, s, s->requires);
1066 writedeps(repo, fp, "Prv:", SOLVABLE_PROVIDES, s, s->provides);
1067 writedeps(repo, fp, "Obs:", SOLVABLE_OBSOLETES, s, s->obsoletes);
1068 writedeps(repo, fp, "Con:", SOLVABLE_CONFLICTS, s, s->conflicts);
1069 writedeps(repo, fp, "Rec:", SOLVABLE_RECOMMENDS, s, s->recommends);
1070 writedeps(repo, fp, "Sup:", SOLVABLE_SUPPLEMENTS, s, s->supplements);
1071 writedeps(repo, fp, "Sug:", SOLVABLE_SUGGESTS, s, s->suggests);
1072 writedeps(repo, fp, "Enh:", SOLVABLE_ENHANCES, s, s->enhances);
1074 fprintf(fp, "=Vnd: %s\n", pool_id2str(pool, s->vendor));
1075 ti = solvable_lookup_num(s, SOLVABLE_BUILDTIME, 0);
1077 fprintf(fp, "=Tim: %u\n", ti);
1082 static inline Offset
1083 adddep(Repo *repo, Offset olddeps, char *str, Id marker)
1085 Id id = *str == '/' ? pool_str2id(repo->pool, str, 1) : testcase_str2dep(repo->pool, str);
1086 return repo_addid_dep(repo, olddeps, id, marker);
1090 finish_solvable(Pool *pool, Repodata *data, Solvable *s, char *filelist, int nfilelist)
1096 for (l = 0; l < nfilelist; l += strlen(filelist + l) + 1)
1098 char *p = strrchr(filelist + l, '/');
1102 did = repodata_str2dir(data, filelist + l, 1);
1105 did = repodata_str2dir(data, "/", 1);
1106 repodata_add_dirstr(data, s - pool->solvables, SOLVABLE_FILELIST, did, p);
1109 if (s->name && s->arch != ARCH_SRC && s->arch != ARCH_NOSRC)
1110 s->provides = repo_addid_dep(s->repo, s->provides, pool_rel2id(pool, s->name, s->evr, REL_EQ, 1), 0);
1111 s->supplements = repo_fix_supplements(s->repo, s->provides, s->supplements, 0);
1112 s->conflicts = repo_fix_conflicts(s->repo, s->conflicts);
1115 /* stripped down version of susetags parser used for testcases */
1117 testcase_add_testtags(Repo *repo, FILE *fp, int flags)
1119 Pool *pool = repo->pool;
1132 data = repo_add_repodata(repo, flags);
1137 line = solv_malloc(aline);
1141 if (linep - line + 16 > aline)
1143 aline = linep - line;
1144 line = solv_realloc(line, aline + 512);
1145 linep = line + aline;
1148 if (!fgets(linep, aline - (linep - line), fp))
1150 linep += strlen(linep);
1151 if (linep == line || linep[-1] != '\n')
1154 linep = line + intag;
1157 if (line[intag] == '-' && !strncmp(line + 1, line + intag + 1, intag - 2))
1164 else if (line[0] == '+' && line[1] && line[1] != ':')
1166 char *tagend = strchr(line, ':');
1171 intag = tagend + 2 - line;
1172 linep = line + intag;
1175 if (*line != '=' || !line[1] || !line[2] || !line[3] || line[4] != ':')
1177 tag = line[1] << 16 | line[2] << 8 | line[3];
1180 case 'P' << 16 | 'k' << 8 | 'g':
1182 finish_solvable(pool, data, s, filelist, nfilelist);
1184 if (split(line + 5, sp, 5) != 4)
1186 s = pool_id2solvable(pool, repo_add_solvable(repo));
1187 s->name = pool_str2id(pool, sp[0], 1);
1188 /* join back version and release */
1189 if (sp[2] && !(sp[2][0] == '-' && !sp[2][1]))
1191 s->evr = makeevr(pool, sp[1]);
1192 s->arch = pool_str2id(pool, sp[3], 1);
1194 case 'S' << 16 | 'u' << 8 | 'm':
1195 repodata_set_str(data, s - pool->solvables, SOLVABLE_SUMMARY, line + 6);
1197 case 'V' << 16 | 'n' << 8 | 'd':
1198 s->vendor = pool_str2id(pool, line + 6, 1);
1200 case 'T' << 16 | 'i' << 8 | 'm':
1203 repodata_set_num(data, s - pool->solvables, SOLVABLE_BUILDTIME, t);
1205 case 'R' << 16 | 'e' << 8 | 'q':
1206 s->requires = adddep(repo, s->requires, line + 6, -SOLVABLE_PREREQMARKER);
1208 case 'P' << 16 | 'r' << 8 | 'q':
1209 s->requires = adddep(repo, s->requires, line + 6, SOLVABLE_PREREQMARKER);
1211 case 'P' << 16 | 'r' << 8 | 'v':
1214 int l = strlen(line + 6) + 1;
1215 if (nfilelist + l > afilelist)
1217 afilelist = nfilelist + l + 512;
1218 filelist = solv_realloc(filelist, afilelist);
1220 memcpy(filelist + nfilelist, line + 6, l);
1227 for (l = 0; l < nfilelist; l += strlen(filelist + l) + 1)
1228 s->provides = repo_addid_dep(repo, s->provides, pool_str2id(pool, filelist + l, 1), 0);
1231 s->provides = adddep(repo, s->provides, line + 6, 0);
1233 case 'O' << 16 | 'b' << 8 | 's':
1234 s->obsoletes = adddep(repo, s->obsoletes, line + 6, 0);
1236 case 'C' << 16 | 'o' << 8 | 'n':
1237 s->conflicts = adddep(repo, s->conflicts, line + 6, 0);
1239 case 'R' << 16 | 'e' << 8 | 'c':
1240 s->recommends = adddep(repo, s->recommends, line + 6, 0);
1242 case 'S' << 16 | 'u' << 8 | 'p':
1243 s->supplements = adddep(repo, s->supplements, line + 6, 0);
1245 case 'S' << 16 | 'u' << 8 | 'g':
1246 s->suggests = adddep(repo, s->suggests, line + 6, 0);
1248 case 'E' << 16 | 'n' << 8 | 'h':
1249 s->enhances = adddep(repo, s->enhances, line + 6, 0);
1256 finish_solvable(pool, data, s, filelist, nfilelist);
1258 solv_free(filelist);
1259 repodata_free_dircache(data);
1260 if (!(flags & REPO_NO_INTERNALIZE))
1261 repodata_internalize(data);
1266 testcase_getpoolflags(Pool *pool)
1268 const char *str = 0;
1270 for (i = 0; poolflags2str[i].str; i++)
1272 v = pool_get_flag(pool, poolflags2str[i].flag);
1273 if (v == poolflags2str[i].def)
1275 str = pool_tmpappend(pool, str, v ? " " : " !", poolflags2str[i].str);
1277 return str ? str + 1 : "";
1281 testcase_setpoolflags(Pool *pool, const char *str)
1283 const char *p = str, *s;
1287 while (*p == ' ' || *p == '\t' || *p == ',')
1298 while (*p && *p != ' ' && *p != '\t' && *p != ',')
1300 for (i = 0; poolflags2str[i].str; i++)
1301 if (!strncmp(poolflags2str[i].str, s, p - s) && poolflags2str[i].str[p - s] == 0)
1303 if (!poolflags2str[i].str)
1305 pool_debug(pool, SOLV_ERROR, "setpoolflags: unknown flag '%.*s'\n", (int)(p - s), s);
1308 pool_set_flag(pool, poolflags2str[i].flag, v);
1314 testcase_resetpoolflags(Pool *pool)
1317 for (i = 0; poolflags2str[i].str; i++)
1318 pool_set_flag(pool, poolflags2str[i].flag, poolflags2str[i].def);
1322 testcase_getsolverflags(Solver *solv)
1324 Pool *pool = solv->pool;
1325 const char *str = 0;
1327 for (i = 0; solverflags2str[i].str; i++)
1329 v = solver_get_flag(solv, solverflags2str[i].flag);
1330 if (v == solverflags2str[i].def)
1332 str = pool_tmpappend(pool, str, v ? " " : " !", solverflags2str[i].str);
1334 return str ? str + 1 : "";
1338 testcase_setsolverflags(Solver *solv, const char *str)
1340 const char *p = str, *s;
1344 while (*p == ' ' || *p == '\t' || *p == ',')
1355 while (*p && *p != ' ' && *p != '\t' && *p != ',')
1357 for (i = 0; solverflags2str[i].str; i++)
1358 if (!strncmp(solverflags2str[i].str, s, p - s) && solverflags2str[i].str[p - s] == 0)
1360 if (!solverflags2str[i].str)
1362 pool_debug(solv->pool, SOLV_ERROR, "setsolverflags: unknown flag '%.*s'\n", (int)(p - s), s);
1365 solver_set_flag(solv, solverflags2str[i].flag, v);
1371 testcase_resetsolverflags(Solver *solv)
1374 for (i = 0; solverflags2str[i].str; i++)
1375 solver_set_flag(solv, solverflags2str[i].flag, solverflags2str[i].def);
1379 testcase_ruleid(Solver *solv, Id rid)
1385 const unsigned char *md5;
1391 solver_ruleliterals(solv, rid, &q);
1392 for (i = 0; i < q.count; i++)
1394 Id p = q.elements[i];
1395 s = testcase_solvid2str(solv->pool, p > 0 ? p : -p);
1397 s = pool_tmpjoin(solv->pool, "!", s, 0);
1398 strqueue_push(&sq, s);
1401 strqueue_sort_u(&sq);
1402 chk = solv_chksum_create(REPOKEY_TYPE_MD5);
1403 for (i = 0; i < sq.nstr; i++)
1404 solv_chksum_add(chk, sq.str[i], strlen(sq.str[i]) + 1);
1405 md5 = solv_chksum_get(chk, &md5l);
1406 s = pool_bin2hex(solv->pool, md5, md5l);
1407 chk = solv_chksum_free(chk, 0);
1413 testcase_problemid(Solver *solv, Id problem)
1418 const unsigned char *md5;
1422 /* we build a hash of all rules that define the problem */
1425 solver_findallproblemrules(solv, problem, &q);
1426 for (i = 0; i < q.count; i++)
1427 strqueue_push(&sq, testcase_ruleid(solv, q.elements[i]));
1429 strqueue_sort_u(&sq);
1430 chk = solv_chksum_create(REPOKEY_TYPE_MD5);
1431 for (i = 0; i < sq.nstr; i++)
1432 solv_chksum_add(chk, sq.str[i], strlen(sq.str[i]) + 1);
1433 md5 = solv_chksum_get(chk, &md5l);
1434 s = pool_bin2hex(solv->pool, md5, 4);
1435 chk = solv_chksum_free(chk, 0);
1441 testcase_solutionid(Solver *solv, Id problem, Id solution)
1445 const unsigned char *md5;
1449 intid = solver_solutionelement_internalid(solv, problem, solution);
1450 /* internal stuff! handle with care! */
1454 s = testcase_job2str(solv->pool, solv->job.elements[-intid - 1], solv->job.elements[-intid]);
1459 s = testcase_ruleid(solv, intid);
1461 chk = solv_chksum_create(REPOKEY_TYPE_MD5);
1462 solv_chksum_add(chk, s, strlen(s) + 1);
1463 md5 = solv_chksum_get(chk, &md5l);
1464 s = pool_bin2hex(solv->pool, md5, 4);
1465 chk = solv_chksum_free(chk, 0);
1469 static struct class2str {
1473 { SOLVER_TRANSACTION_ERASE, "erase" },
1474 { SOLVER_TRANSACTION_INSTALL, "install" },
1475 { SOLVER_TRANSACTION_REINSTALLED, "reinstall" },
1476 { SOLVER_TRANSACTION_DOWNGRADED, "downgrade" },
1477 { SOLVER_TRANSACTION_CHANGED, "change" },
1478 { SOLVER_TRANSACTION_UPGRADED, "upgrade" },
1479 { SOLVER_TRANSACTION_OBSOLETED, "obsolete" },
1480 { SOLVER_TRANSACTION_MULTIINSTALL, "multiinstall" },
1481 { SOLVER_TRANSACTION_MULTIREINSTALL, "multireinstall" },
1486 testcase_solverresult(Solver *solv, int resultflags)
1488 Pool *pool = solv->pool;
1496 if ((resultflags & TESTCASE_RESULT_TRANSACTION) != 0)
1498 Transaction *trans = solver_create_transaction(solv);
1502 for (i = 0; class2str[i].str; i++)
1505 transaction_classify_pkgs(trans, SOLVER_TRANSACTION_KEEP_PSEUDO, class2str[i].class, 0, 0, &q);
1506 for (j = 0; j < q.count; j++)
1510 if (pool->installed && pool->solvables[p].repo == pool->installed)
1511 op = transaction_obs_pkg(trans, p);
1512 s = pool_tmpjoin(pool, class2str[i].str, " ", testcase_solvid2str(pool, p));
1514 s = pool_tmpjoin(pool, s, " ", testcase_solvid2str(pool, op));
1515 strqueue_push(&sq, s);
1519 transaction_free(trans);
1521 if ((resultflags & TESTCASE_RESULT_PROBLEMS) != 0)
1523 char *probprefix, *solprefix;
1524 int problem, solution, element;
1527 pcnt = solver_problem_count(solv);
1528 for (problem = 1; problem <= pcnt; problem++)
1530 Id rid, from, to, dep;
1531 SolverRuleinfo rinfo;
1532 rid = solver_findproblemrule(solv, problem);
1533 s = testcase_problemid(solv, problem);
1534 probprefix = solv_dupjoin("problem ", s, 0);
1535 rinfo = solver_ruleinfo(solv, rid, &from, &to, &dep);
1536 s = pool_tmpjoin(pool, probprefix, " info ", solver_problemruleinfo2str(solv, rinfo, from, to, dep));
1537 strqueue_push(&sq, s);
1538 scnt = solver_solution_count(solv, problem);
1539 for (solution = 1; solution <= scnt; solution++)
1541 s = testcase_solutionid(solv, problem, solution);
1542 solprefix = solv_dupjoin(probprefix, " solution ", s);
1544 while ((element = solver_next_solutionelement(solv, problem, solution, element, &p, &op)) != 0)
1546 if (p == SOLVER_SOLUTION_JOB)
1547 s = pool_tmpjoin(pool, solprefix, " deljob ", testcase_job2str(pool, solv->job.elements[op - 1], solv->job.elements[op]));
1548 else if (p > 0 && op == 0)
1549 s = pool_tmpjoin(pool, solprefix, " erase ", testcase_solvid2str(pool, p));
1550 else if (p > 0 && op > 0)
1552 s = pool_tmpjoin(pool, solprefix, " replace ", testcase_solvid2str(pool, p));
1553 s = pool_tmpappend(pool, s, " ", testcase_solvid2str(pool, op));
1555 else if (p < 0 && op > 0)
1556 s = pool_tmpjoin(pool, solprefix, " allow ", testcase_solvid2str(pool, op));
1558 s = pool_tmpjoin(pool, solprefix, " unknown", 0);
1559 strqueue_push(&sq, s);
1561 solv_free(solprefix);
1563 solv_free(probprefix);
1567 if ((resultflags & TESTCASE_RESULT_ORPHANED) != 0)
1572 solver_get_orphaned(solv, &q);
1573 for (i = 0; i < q.count; i++)
1575 s = pool_tmpjoin(pool, "orphaned ", testcase_solvid2str(pool, q.elements[i]), 0);
1576 strqueue_push(&sq, s);
1581 if ((resultflags & TESTCASE_RESULT_RECOMMENDED) != 0)
1587 solver_get_recommendations(solv, &qr, &qs, 0);
1588 for (i = 0; i < qr.count; i++)
1590 s = pool_tmpjoin(pool, "recommended ", testcase_solvid2str(pool, qr.elements[i]), 0);
1591 strqueue_push(&sq, s);
1593 for (i = 0; i < qs.count; i++)
1595 s = pool_tmpjoin(pool, "suggested ", testcase_solvid2str(pool, qs.elements[i]), 0);
1596 strqueue_push(&sq, s);
1602 if ((resultflags & TESTCASE_RESULT_UNNEEDED) != 0)
1608 solver_get_unneeded(solv, &q, 0);
1609 solver_get_unneeded(solv, &qf, 1);
1610 for (i = j = 0; i < q.count; i++)
1612 /* we rely on qf containing a subset of q in the same order */
1613 if (j < qf.count && q.elements[i] == qf.elements[j])
1615 s = pool_tmpjoin(pool, "unneeded_filtered ", testcase_solvid2str(pool, q.elements[i]), 0);
1619 s = pool_tmpjoin(pool, "unneeded ", testcase_solvid2str(pool, q.elements[i]), 0);
1620 strqueue_push(&sq, s);
1627 result = strqueue_join(&sq);
1634 testcase_write(Solver *solv, char *dir, int resultflags, const char *testcasename, const char *resultname)
1636 Pool *pool = solv->pool;
1647 testcasename = "testcase.t";
1649 resultname = "solver.result";
1651 if (mkdir(dir, 0777) && errno != EEXIST)
1653 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: could not create directory '%s'\n", dir);
1657 FOR_REPOS(repoid, repo)
1659 const char *name = testcase_repoid2str(pool, repoid);
1661 if (repo->subpriority)
1662 sprintf(priobuf, "%d.%d", repo->priority, repo->subpriority);
1664 sprintf(priobuf, "%d", repo->priority);
1665 out = pool_tmpjoin(pool, name, ".repo", ".gz");
1666 cmd = pool_tmpjoin(pool, "repo ", name, " ");
1667 cmd = pool_tmpappend(pool, cmd, priobuf, " ");
1668 cmd = pool_tmpappend(pool, cmd, "testtags ", out);
1669 strqueue_push(&sq, cmd);
1670 out = pool_tmpjoin(pool, dir, "/", out);
1671 if (!(fp = solv_xfopen(out, "w")))
1673 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: could not open '%s' for writing\n", out);
1677 testcase_write_testtags(repo, fp);
1680 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: write error\n");
1685 /* hmm, this is not optimal... we currently search for the lowest score */
1687 arch = pool->solvables[SYSTEMSOLVABLE].arch;
1688 for (i = 0; i < pool->lastarch; i++)
1690 if (pool->id2arch[i] == 1 && !lowscore)
1692 if (pool->id2arch[i] > 0x10000 && (!lowscore || pool->id2arch[i] < lowscore))
1695 lowscore = pool->id2arch[i];
1698 cmd = pool_tmpjoin(pool, "system ", pool->lastarch ? pool_id2str(pool, arch) : "unset", 0);
1699 for (i = 0; disttype2str[i].str != 0; i++)
1700 if (pool->disttype == disttype2str[i].type)
1702 pool_tmpappend(pool, cmd, " ", disttype2str[i].str ? disttype2str[i].str : "unknown");
1703 if (pool->installed)
1704 cmd = pool_tmpappend(pool, cmd, " ", testcase_repoid2str(pool, pool->installed->repoid));
1705 strqueue_push(&sq, cmd);
1706 s = testcase_getpoolflags(solv->pool);
1709 cmd = pool_tmpjoin(pool, "poolflags ", s, 0);
1710 strqueue_push(&sq, cmd);
1713 if (pool->vendorclasses)
1716 for (i = 0; pool->vendorclasses[i]; i++)
1718 cmd = pool_tmpappend(pool, cmd ? cmd : "vendorclass", " ", pool->vendorclasses[i]);
1719 if (!pool->vendorclasses[i + 1])
1721 strqueue_push(&sq, cmd);
1728 s = testcase_getsolverflags(solv);
1731 cmd = pool_tmpjoin(pool, "solverflags ", s, 0);
1732 strqueue_push(&sq, cmd);
1735 /* now dump all the ns callback values we know */
1736 if (pool->nscallback)
1740 for (rid = 1; rid < pool->nrels; rid++)
1742 Reldep *rd = pool->rels + rid;
1743 if (rd->flags != REL_NAMESPACE || rd->name == NAMESPACE_OTHERPROVIDERS)
1745 /* evaluate all namespace ids, skip empty results */
1746 d = pool_whatprovides(pool, MAKERELDEP(rid));
1747 if (!d || !pool->whatprovidesdata[d])
1749 cmd = pool_tmpjoin(pool, "namespace ", pool_id2str(pool, rd->name), "(");
1750 cmd = pool_tmpappend(pool, cmd, pool_id2str(pool, rd->evr), ")");
1751 for (; pool->whatprovidesdata[d]; d++)
1752 cmd = pool_tmpappend(pool, cmd, " ", testcase_solvid2str(pool, pool->whatprovidesdata[d]));
1753 strqueue_push(&sq, cmd);
1757 for (i = 0; i < solv->job.count; i += 2)
1759 cmd = (char *)testcase_job2str(pool, solv->job.elements[i], solv->job.elements[i + 1]);
1760 cmd = pool_tmpjoin(pool, "job ", cmd, 0);
1761 strqueue_push(&sq, cmd);
1768 for (i = 0; resultflags2str[i].str; i++)
1769 if ((resultflags & resultflags2str[i].flag) != 0)
1770 cmd = pool_tmpappend(pool, cmd, cmd ? "," : 0, resultflags2str[i].str);
1771 cmd = pool_tmpjoin(pool, "result ", cmd ? cmd : "?", 0);
1772 cmd = pool_tmpappend(pool, cmd, " ", resultname);
1773 strqueue_push(&sq, cmd);
1774 result = testcase_solverresult(solv, resultflags);
1775 if (!strcmp(resultname, "<inline>"))
1779 strqueue_init(&rsq);
1780 strqueue_split(&rsq, result);
1781 for (i = 0; i < rsq.nstr; i++)
1783 cmd = pool_tmpjoin(pool, "#>", rsq.str[i], 0);
1784 strqueue_push(&sq, cmd);
1786 strqueue_free(&rsq);
1790 out = pool_tmpjoin(pool, dir, "/", resultname);
1791 if (!(fp = fopen(out, "w")))
1793 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: could not open '%s' for writing\n", out);
1798 if (result && *result && fwrite(result, strlen(result), 1, fp) != 1)
1800 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: write error\n");
1808 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: write error\n");
1816 cmd = strqueue_join(&sq);
1817 out = pool_tmpjoin(pool, dir, "/", testcasename);
1818 if (!(fp = fopen(out, "w")))
1820 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: could not open '%s' for writing\n", out);
1824 if (*cmd && fwrite(cmd, strlen(cmd), 1, fp) != 1)
1826 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: write error\n");
1833 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: write error\n");
1843 read_inline_file(FILE *fp, char **bufp, char **bufpp, int *buflp)
1845 char *result = solv_malloc(1024);
1852 if (rp - result + 256 >= resultl)
1854 resultl = rp - result;
1855 result = solv_realloc(result, resultl + 1024);
1856 rp = result + resultl;
1859 if (!fgets(rp, resultl - (rp - result), fp))
1862 if (rl && (rp == result || rp[-1] == '\n'))
1864 if (rl > 1 && rp[0] == '#' && rp[1] == '>')
1866 memmove(rp, rp + 2, rl - 2);
1871 while (rl + 16 > *buflp)
1873 *bufp = solv_realloc(*bufp, *buflp + 512);
1876 memmove(*bufp, rp, rl);
1877 if ((*bufp)[rl - 1] == '\n')
1883 (*bufpp) = *bufp + rl;
1900 char *result = solv_malloc(1024);
1907 if (rp - result + 256 >= resultl)
1909 resultl = rp - result;
1910 result = solv_realloc(result, resultl + 1024);
1911 rp = result + resultl;
1914 rl = fread(rp, 1, resultl - (rp - result), fp);
1926 str2resultflags(Pool *pool, char *s) /* modifies the string! */
1928 int i, resultflags = 0;
1931 char *se = strchr(s, ',');
1934 for (i = 0; resultflags2str[i].str; i++)
1935 if (!strcmp(s, resultflags2str[i].str))
1937 resultflags |= resultflags2str[i].flag;
1940 if (!resultflags2str[i].str)
1941 pool_debug(pool, SOLV_ERROR, "result: unknown flag '%s'\n", s);
1948 testcase_read(Pool *pool, FILE *fp, char *testcase, Queue *job, char **resultp, int *resultflagsp)
1953 char *testcasedir, *s;
1959 int poolflagsreset = 0;
1961 if (!fp && !(fp = fopen(testcase, "r")))
1963 pool_debug(pool, SOLV_ERROR, "testcase_read: could not open '%s'\n", testcase);
1966 testcasedir = solv_strdup(testcase);
1967 if ((s = strrchr(testcasedir, '/')) != 0)
1972 buf = solv_malloc(bufl);
1977 if (bufp - buf + 16 > bufl)
1980 buf = solv_realloc(buf, bufl + 512);
1984 if (!fgets(bufp, bufl - (bufp - buf), fp))
1988 if (!l || buf[l - 1] != '\n')
1995 while (*s && (*s == ' ' || *s == '\t'))
1997 if (!*s || *s == '#')
2000 /* split it in pieces */
2003 while (*s == ' ' || *s == '\t')
2007 pieces = solv_extend(pieces, npieces, 1, sizeof(*pieces), 7);
2008 pieces[npieces++] = s;
2009 while (*s && *s != ' ' && *s != '\t')
2014 pieces = solv_extend(pieces, npieces, 1, sizeof(*pieces), 7);
2015 pieces[npieces] = 0;
2016 if (!strcmp(pieces[0], "repo") && npieces >= 4)
2018 Repo *repo = repo_create(pool, pieces[1]);
2024 if (!poolflagsreset)
2027 testcase_resetpoolflags(pool); /* hmm */
2029 if (sscanf(pieces[2], "%d.%d", &prio, &subprio) != 2)
2032 prio = atoi(pieces[2]);
2034 repo->priority = prio;
2035 repo->subpriority = subprio;
2036 if (strcmp(pieces[3], "empty") != 0)
2038 const char *repotype = pool_tmpjoin(pool, pieces[3], 0, 0); /* gets overwritten in <inline> case */
2039 if (!strcmp(pieces[4], "<inline>"))
2041 char *idata = read_inline_file(fp, &buf, &bufp, &bufl);
2043 rfp = solv_xfopen_buf(rdata, &idata, 0, "rf");
2047 rdata = pool_tmpjoin(pool, testcasedir, pieces[4], 0);
2048 rfp = solv_xfopen(rdata, "r");
2052 pool_debug(pool, SOLV_ERROR, "testcase_read: could not open '%s'\n", rdata);
2054 else if (!strcmp(repotype, "testtags"))
2056 testcase_add_testtags(repo, rfp, 0);
2059 else if (!strcmp(repotype, "solv"))
2061 repo_add_solv(repo, rfp, 0);
2065 else if (!strcmp(repotype, "helix"))
2067 extern int repo_add_helix(Repo *repo, FILE *fp, int flags);
2068 repo_add_helix(repo, rfp, 0);
2075 pool_debug(pool, SOLV_ERROR, "testcase_read: unknown repo type for repo '%s'\n", repo->name);
2079 else if (!strcmp(pieces[0], "system") && npieces >= 3)
2083 /* must set the disttype before the arch */
2084 for (i = 0; disttype2str[i].str != 0; i++)
2085 if (!strcmp(disttype2str[i].str, pieces[2]))
2087 if (!disttype2str[i].str)
2088 pool_debug(pool, SOLV_ERROR, "testcase_read: system: unknown disttype '%s'\n", pieces[2]);
2089 else if (pool->disttype != disttype2str[i].type)
2091 #ifdef MULTI_SEMANTICS
2092 pool_setdisttype(pool, disttype2str[i].type);
2094 pool_debug(pool, SOLV_ERROR, "testcase_read: system: cannot change disttype to '%s'\n", pieces[2]);
2097 if (strcmp(pieces[1], "unset") == 0)
2098 pool_setarch(pool, 0);
2099 else if (pieces[1][0] == ':')
2100 pool_setarchpolicy(pool, pieces[1] + 1);
2102 pool_setarch(pool, pieces[1]);
2105 Repo *repo = testcase_str2repo(pool, pieces[3]);
2107 pool_debug(pool, SOLV_ERROR, "testcase_read: system: unknown repo '%s'\n", pieces[3]);
2109 pool_set_installed(pool, repo);
2112 else if (!strcmp(pieces[0], "job") && npieces > 1)
2118 pool_addfileprovides(pool);
2119 pool_createwhatprovides(pool);
2122 if (npieces >= 3 && !strcmp(pieces[2], "selection"))
2124 addselectionjob(pool, pieces + 1, npieces - 1, job);
2128 for (sp = pieces[1]; sp < pieces[npieces - 1]; sp++)
2131 how = testcase_str2job(pool, pieces[1], &what);
2132 if (how >= 0 && job)
2133 queue_push2(job, how, what);
2135 else if (!strcmp(pieces[0], "vendorclass") && npieces > 1)
2137 pool_addvendorclass(pool, (const char **)(pieces + 1));
2139 else if (!strcmp(pieces[0], "namespace") && npieces > 1)
2141 int i = strlen(pieces[1]);
2142 s = strchr(pieces[1], '(');
2143 if (!s && pieces[1][i - 1] != ')')
2145 pool_debug(pool, SOLV_ERROR, "testcase_read: bad namespace '%s'\n", pieces[1]);
2153 pieces[1][i - 1] = 0;
2154 name = pool_str2id(pool, pieces[1], 1);
2155 evr = pool_str2id(pool, s + 1, 1);
2157 pieces[1][i - 1] = ')';
2158 id = pool_rel2id(pool, name, evr, REL_NAMESPACE, 1);
2159 for (i = 2; i < npieces; i++)
2160 queue_push(&q, testcase_str2solvid(pool, pieces[i]));
2161 /* now do the callback */
2164 pool_addfileprovides(pool);
2165 pool_createwhatprovides(pool);
2168 pool->whatprovides_rel[GETRELID(id)] = pool_queuetowhatprovides(pool, &q);
2172 else if (!strcmp(pieces[0], "poolflags"))
2175 if (!poolflagsreset)
2178 testcase_resetpoolflags(pool); /* hmm */
2180 for (i = 1; i < npieces; i++)
2181 testcase_setpoolflags(pool, pieces[i]);
2183 else if (!strcmp(pieces[0], "solverflags") && npieces > 1)
2188 solv = solver_create(pool);
2189 testcase_resetsolverflags(solv);
2191 for (i = 1; i < npieces; i++)
2192 testcase_setsolverflags(solv, pieces[i]);
2194 else if (!strcmp(pieces[0], "result") && npieces > 1)
2197 int resultflags = str2resultflags(pool, pieces[1]);
2201 rdata = pool_tmpjoin(pool, testcasedir, pieces[2], 0);
2202 if (!strcmp(pieces[2], "<inline>"))
2203 result = read_inline_file(fp, &buf, &bufp, &bufl);
2206 FILE *rfp = fopen(rdata, "r");
2208 pool_debug(pool, SOLV_ERROR, "testcase_read: could not open '%s'\n", rdata);
2211 result = read_file(rfp);
2221 *resultflagsp = resultflags;
2223 else if (!strcmp(pieces[0], "nextjob") && npieces == 1)
2229 pool_debug(pool, SOLV_ERROR, "testcase_read: cannot parse command '%s'\n", pieces[0]);
2232 buf = solv_free(buf);
2233 pieces = solv_free(pieces);
2234 solv_free(testcasedir);
2237 pool_addfileprovides(pool);
2238 pool_createwhatprovides(pool);
2242 solv = solver_create(pool);
2243 testcase_resetsolverflags(solv);
2251 testcase_resultdiff(char *result1, char *result2)
2253 Strqueue sq1, sq2, osq;
2255 strqueue_init(&sq1);
2256 strqueue_init(&sq2);
2257 strqueue_init(&osq);
2258 strqueue_split(&sq1, result1);
2259 strqueue_split(&sq2, result2);
2260 strqueue_sort(&sq1);
2261 strqueue_sort(&sq2);
2262 strqueue_diff(&sq1, &sq2, &osq);
2263 r = osq.nstr ? strqueue_join(&osq) : 0;
2264 strqueue_free(&sq1);
2265 strqueue_free(&sq2);
2266 strqueue_free(&osq);