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;
353 while (*s == ' ' || *s == '\t')
356 while (*s && *s != ' ' && *s != '\t')
358 evr = pool_strn2id(pool, n, s - n, 1);
359 if (*s == ' ' && !strcmp(s, " compat >= "))
362 while (*s == ' ' || *s == '\t')
365 while (*s && *s != ' ' && *s != '\t')
367 evr = pool_rel2id(pool, evr, pool_strn2id(pool, n, s - n, 1), REL_COMPAT, 1);
369 return pool_rel2id(pool, id, evr, flags, 1);
373 testcase_repoid2str(Pool *pool, Id repoid)
375 Repo *repo = pool_id2repo(pool, repoid);
378 char *r = pool_tmpjoin(pool, repo->name, 0, 0);
380 for (rp = r; *rp; rp++)
381 if (*rp == ' ' || *rp == '\t')
388 sprintf(buf, "#%d", repoid);
389 return pool_tmpjoin(pool, buf, 0, 0);
394 testcase_solvid2str(Pool *pool, Id p)
396 Solvable *s = pool->solvables + p;
397 const char *n, *e, *a;
400 if (p == SYSTEMSOLVABLE)
402 n = pool_id2str(pool, s->name);
403 e = pool_id2str(pool, s->evr);
404 a = pool_id2str(pool, s->arch);
405 str = pool_alloctmpspace(pool, strlen(n) + strlen(e) + strlen(a) + 3);
406 sprintf(str, "%s-%s.%s", n, e, a);
408 return pool_tmpappend(pool, str, "@", 0);
412 char *str2 = pool_tmpappend(pool, str, "@", s->repo->name);
414 if (str2[l] == ' ' || str2[l] == '\t')
418 sprintf(buf, "@#%d", s->repo->repoid);
419 return pool_tmpappend(pool, str, buf, 0);
423 testcase_str2repo(Pool *pool, const char *str)
427 if (str[0] == '#' && (str[1] >= '0' && str[1] <= '9'))
431 for (j = 1; str[j] >= '0' && str[j] <= '9'; j++)
432 repoid = repoid * 10 + (str[j] - '0');
433 if (!str[j] && repoid > 0 && repoid < pool->nrepos)
434 repo = pool_id2repo(pool, repoid);
438 FOR_REPOS(repoid, repo)
443 l = strlen(repo->name);
444 for (i = 0; i < l; i++)
446 int c = repo->name[i];
447 if (c == ' ' || c == '\t')
452 if (i == l && !str[l])
455 if (repoid >= pool->nrepos)
462 testcase_str2solvid(Pool *pool, const char *str)
464 int i, l = strlen(str);
471 if (*str == '@' && !strcmp(str, "@SYSTEM"))
472 return SYSTEMSOLVABLE;
474 for (i = l - 1; i >= 0; i--)
475 if (str[i] == '@' && (repo = testcase_str2repo(pool, str + i + 1)) != 0)
480 /* now find the arch (if present) */
482 for (i = repostart - 1; i > 0; i--)
485 arch = pool_strn2id(pool, str + i + 1, repostart - (i + 1), 0);
490 /* now find the name */
491 for (i = repostart - 1; i > 0; i--)
495 Id nid, evrid, p, pp;
496 nid = pool_strn2id(pool, str, i, 0);
499 evrid = pool_strn2id(pool, str + i + 1, repostart - (i + 1), 0);
502 FOR_PROVIDES(p, pp, nid)
504 Solvable *s = pool->solvables + p;
505 if (s->name != nid || s->evr != evrid)
507 if (repo && s->repo != repo)
509 if (arch && s->arch != arch)
519 testcase_job2str(Pool *pool, Id how, Id what)
526 Id select = how & SOLVER_SELECTMASK;
528 for (i = 0; job2str[i].str; i++)
529 if ((how & SOLVER_JOBMASK) == job2str[i].job)
531 jobstr = job2str[i].str ? job2str[i].str : "unknown";
532 if (select == SOLVER_SOLVABLE)
535 pkgstr = testcase_solvid2str(pool, what);
537 else if (select == SOLVER_SOLVABLE_NAME)
540 pkgstr = pool_dep2str(pool, what);
542 else if (select == SOLVER_SOLVABLE_PROVIDES)
544 selstr = " provides ";
545 pkgstr = pool_dep2str(pool, what);
547 else if (select == SOLVER_SOLVABLE_ONE_OF)
552 while ((p = pool->whatprovidesdata[what++]) != 0)
554 const char *s = testcase_solvid2str(pool, p);
557 pkgstr = pool_tmpappend(pool, pkgstr, " ", s);
558 pool_freetmpspace(pool, s);
566 else if (select == SOLVER_SOLVABLE_REPO)
568 Repo *repo = pool_id2repo(pool, what);
573 sprintf(buf, "#%d", repo->repoid);
574 pkgstr = pool_tmpjoin(pool, buf, 0, 0);
577 pkgstr = pool_tmpjoin(pool, repo->name, 0, 0);
579 else if (select == SOLVER_SOLVABLE_ALL)
586 selstr = " unknown ";
589 ret = pool_tmpjoin(pool, jobstr, selstr, pkgstr);
591 ret = pool_tmpappend(pool, ret, " ", 0);
592 for (i = 0; jobflags2str[i].str; i++)
593 if ((how & jobflags2str[i].flag) != 0)
594 ret = pool_tmpappend(pool, ret, ",", jobflags2str[i].str);
600 ret = pool_tmpappend(pool, ret, "]", 0);
606 str2selflags(Pool *pool, char *s) /* modifies the string! */
611 char *se = strchr(s, ',');
614 for (i = 0; selflags2str[i].str; i++)
615 if (!strcmp(s, selflags2str[i].str))
617 selflags |= selflags2str[i].flag;
620 if (!selflags2str[i].str)
621 pool_debug(pool, SOLV_ERROR, "str2job: unknown selection flag '%s'\n", s);
628 str2jobflags(Pool *pool, char *s) /* modifies the string */
633 char *se = strchr(s, ',');
636 for (i = 0; jobflags2str[i].str; i++)
637 if (!strcmp(s, jobflags2str[i].str))
639 jobflags |= jobflags2str[i].flag;
642 if (!jobflags2str[i].str)
643 pool_debug(pool, SOLV_ERROR, "str2job: unknown job flag '%s'\n", s);
650 testcase_str2job(Pool *pool, const char *str, Id *whatp)
660 /* so we can patch it */
661 s = pool_tmpjoin(pool, str, 0, 0);
662 /* split it in pieces */
665 while (*s == ' ' || *s == '\t')
669 pieces = solv_extend(pieces, npieces, 1, sizeof(*pieces), 7);
670 pieces[npieces++] = s;
671 while (*s && *s != ' ' && *s != '\t')
678 pool_debug(pool, SOLV_ERROR, "str2job: bad line '%s'\n", str);
683 for (i = 0; job2str[i].str; i++)
684 if (!strcmp(pieces[0], job2str[i].str))
688 pool_debug(pool, SOLV_ERROR, "str2job: unknown job '%s'\n", str);
692 job = job2str[i].job;
696 char *flags = pieces[npieces - 1];
697 if (*flags == '[' && flags[strlen(flags) - 1] == ']')
701 flags[strlen(flags) - 1] = 0;
702 job |= str2jobflags(pool, flags);
705 if (!strcmp(pieces[1], "pkg"))
709 pool_debug(pool, SOLV_ERROR, "str2job: bad pkg selector in '%s'\n", str);
713 job |= SOLVER_SOLVABLE;
714 what = testcase_str2solvid(pool, pieces[2]);
717 pool_debug(pool, SOLV_ERROR, "str2job: unknown package '%s'\n", pieces[2]);
722 else if (!strcmp(pieces[1], "name") || !strcmp(pieces[1], "provides"))
724 /* join em again for dep2str... */
726 for (sp = pieces[2]; sp < pieces[npieces - 1]; sp++)
730 if (pieces[1][0] == 'p' && strncmp(pieces[2], "namespace:", 10) == 0)
732 char *spe = strchr(pieces[2], '(');
733 int l = strlen(pieces[2]);
734 if (spe && pieces[2][l - 1] == ')')
736 /* special namespace provides */
737 if (strcmp(spe, "(<NULL>)") != 0)
739 pieces[2][l - 1] = 0;
740 what = testcase_str2dep(pool, spe + 1);
741 pieces[2][l - 1] = ')';
743 what = pool_rel2id(pool, pool_strn2id(pool, pieces[2], spe - pieces[2], 1), what, REL_NAMESPACE, 1);
747 what = testcase_str2dep(pool, pieces[2]);
748 if (pieces[1][0] == 'n')
749 job |= SOLVER_SOLVABLE_NAME;
751 job |= SOLVER_SOLVABLE_PROVIDES;
753 else if (!strcmp(pieces[1], "oneof"))
756 job |= SOLVER_SOLVABLE_ONE_OF;
758 if (npieces > 3 && strcmp(pieces[2], "nothing") != 0)
760 for (i = 2; i < npieces; i++)
762 Id p = testcase_str2solvid(pool, pieces[i]);
765 pool_debug(pool, SOLV_ERROR, "str2job: unknown package '%s'\n", pieces[i]);
773 what = pool_queuetowhatprovides(pool, &q);
776 else if (!strcmp(pieces[1], "repo"))
781 pool_debug(pool, SOLV_ERROR, "str2job: bad line '%s'\n", str);
785 repo = testcase_str2repo(pool, pieces[2]);
788 pool_debug(pool, SOLV_ERROR, "str2job: unknown repo '%s'\n", pieces[2]);
792 job |= SOLVER_SOLVABLE_REPO;
795 else if (!strcmp(pieces[1], "all"))
797 if (npieces != 3 && strcmp(pieces[2], "packages") != 0)
799 pool_debug(pool, SOLV_ERROR, "str2job: bad line '%s'\n", str);
803 job |= SOLVER_SOLVABLE_ALL;
808 pool_debug(pool, SOLV_ERROR, "str2job: unknown selection in '%s'\n", str);
818 addselectionjob(Pool *pool, char **pieces, int npieces, Queue *jobqueue)
825 for (i = 0; job2str[i].str; i++)
826 if (!strcmp(pieces[0], job2str[i].str))
830 pool_debug(pool, SOLV_ERROR, "selstr2job: unknown job '%s'\n", pieces[0]);
833 job = job2str[i].job;
836 char *flags = pieces[npieces - 1];
837 if (*flags == '[' && flags[strlen(flags) - 1] == ']')
841 flags[strlen(flags) - 1] = 0;
842 job |= str2jobflags(pool, flags);
847 pool_debug(pool, SOLV_ERROR, "selstr2job: no selection flags\n");
850 selflags = str2selflags(pool, pieces[3]);
852 r = selection_make(pool, &sel, pieces[2], selflags);
853 for (i = 0; i < sel.count; i += 2)
854 queue_push2(jobqueue, job | sel.elements[i], sel.elements[i + 1]);
860 writedeps(Repo *repo, FILE *fp, const char *tag, Id key, Solvable *s, Offset off)
862 Pool *pool = repo->pool;
869 dp = repo->idarraydata + off;
871 while ((id = *dp++) != 0)
873 if (key == SOLVABLE_REQUIRES && id == SOLVABLE_PREREQMARKER)
876 fprintf(fp, "-%s\n", tag);
881 if (key == SOLVABLE_PROVIDES && id == SOLVABLE_FILEMARKER)
886 idstr = pool_dep2str(pool, id);
889 Reldep *rd = GETRELDEP(pool, id);
890 if (key == SOLVABLE_CONFLICTS && rd->flags == REL_NAMESPACE && rd->name == NAMESPACE_OTHERPROVIDERS)
892 if (!strncmp(idstr, "namespace:", 10))
895 if (key == SOLVABLE_SUPPLEMENTS)
897 if (rd->flags == REL_NAMESPACE && rd->name == NAMESPACE_FILESYSTEM)
899 if (!strncmp(idstr, "namespace:", 10))
902 else if (rd->flags == REL_NAMESPACE && rd->name == NAMESPACE_MODALIAS)
904 if (!strncmp(idstr, "namespace:", 10))
907 else if (rd->flags == REL_AND)
909 /* either packageand chain or modalias */
911 if (ISRELDEP(rd->evr))
913 Reldep *mrd = GETRELDEP(pool, rd->evr);
914 if (mrd->flags == REL_NAMESPACE && mrd->name == NAMESPACE_MODALIAS)
916 idstr = pool_tmpjoin(pool, "modalias(", pool_dep2str(pool, rd->name), ":");
917 idstr = pool_tmpappend(pool, idstr, pool_dep2str(pool, mrd->evr), ")");
919 else if (mrd->flags >= 8)
924 /* must be and chain */
925 idstr = pool_dep2str(pool, rd->evr);
931 rd = GETRELDEP(pool, id);
932 if (rd->flags != REL_AND)
934 idstr = pool_tmpjoin(pool, pool_dep2str(pool, rd->evr), ":", idstr);
936 idstr = pool_tmpjoin(pool, pool_dep2str(pool, id), ":", idstr);
937 idstr = pool_tmpjoin(pool, "packageand(", idstr, ")");
940 else if (rd->flags >= 8)
946 fprintf(fp, "+%s\n", tag);
949 fprintf(fp, "%s\n", idstr);
951 if (key == SOLVABLE_PROVIDES)
953 /* add the filelist */
955 dataiterator_init(&di, pool, repo, s - pool->solvables, SOLVABLE_FILELIST, 0, 0);
956 while (dataiterator_step(&di))
958 const char *s = repodata_dir2str(di.data, di.kv.id, di.kv.str);
961 Id id = pool_str2id(pool, s, 0);
964 for (dp = prvdp; *dp; dp++)
968 continue; /* already included */
973 fprintf(fp, "+%s", tag);
976 fprintf(fp, "%s\n", s);
980 fprintf(fp, "-%s\n", tag);
984 testcase_write_testtags(Repo *repo, FILE *fp)
986 Pool *pool = repo->pool;
996 fprintf(fp, "=Ver: 2.0\n");
997 FOR_REPO_SOLVABLES(repo, p, s)
999 name = pool_id2str(pool, s->name);
1000 evr = pool_id2str(pool, s->evr);
1001 arch = pool_id2str(pool, s->arch);
1002 release = strrchr(evr, '-');
1004 release = evr + strlen(evr);
1005 fprintf(fp, "=Pkg: %s %.*s %s %s\n", name, (int)(release - evr), evr, *release && release[1] ? release + 1 : "-", arch);
1006 tmp = solvable_lookup_str(s, SOLVABLE_SUMMARY);
1008 fprintf(fp, "=Sum: %s\n", tmp);
1009 writedeps(repo, fp, "Req:", SOLVABLE_REQUIRES, s, s->requires);
1010 writedeps(repo, fp, "Prv:", SOLVABLE_PROVIDES, s, s->provides);
1011 writedeps(repo, fp, "Obs:", SOLVABLE_OBSOLETES, s, s->obsoletes);
1012 writedeps(repo, fp, "Con:", SOLVABLE_CONFLICTS, s, s->conflicts);
1013 writedeps(repo, fp, "Rec:", SOLVABLE_RECOMMENDS, s, s->recommends);
1014 writedeps(repo, fp, "Sup:", SOLVABLE_SUPPLEMENTS, s, s->supplements);
1015 writedeps(repo, fp, "Sug:", SOLVABLE_SUGGESTS, s, s->suggests);
1016 writedeps(repo, fp, "Enh:", SOLVABLE_ENHANCES, s, s->enhances);
1018 fprintf(fp, "=Vnd: %s\n", pool_id2str(pool, s->vendor));
1019 ti = solvable_lookup_num(s, SOLVABLE_BUILDTIME, 0);
1021 fprintf(fp, "=Tim: %u\n", ti);
1026 static inline Offset
1027 adddep(Repo *repo, Offset olddeps, char *str, Id marker)
1029 Id id = *str == '/' ? pool_str2id(repo->pool, str, 1) : testcase_str2dep(repo->pool, str);
1030 return repo_addid_dep(repo, olddeps, id, marker);
1034 finish_solvable(Pool *pool, Repodata *data, Solvable *s, char *filelist, int nfilelist)
1040 for (l = 0; l < nfilelist; l += strlen(filelist + l) + 1)
1042 char *p = strrchr(filelist + l, '/');
1046 did = repodata_str2dir(data, filelist + l, 1);
1049 did = repodata_str2dir(data, "/", 1);
1050 repodata_add_dirstr(data, s - pool->solvables, SOLVABLE_FILELIST, did, p);
1053 if (s->name && s->arch != ARCH_SRC && s->arch != ARCH_NOSRC)
1054 s->provides = repo_addid_dep(s->repo, s->provides, pool_rel2id(pool, s->name, s->evr, REL_EQ, 1), 0);
1055 s->supplements = repo_fix_supplements(s->repo, s->provides, s->supplements, 0);
1056 s->conflicts = repo_fix_conflicts(s->repo, s->conflicts);
1059 /* stripped down version of susetags parser used for testcases */
1061 testcase_add_testtags(Repo *repo, FILE *fp, int flags)
1063 Pool *pool = repo->pool;
1076 data = repo_add_repodata(repo, flags);
1081 line = solv_malloc(aline);
1085 if (linep - line + 16 > aline)
1087 aline = linep - line;
1088 line = solv_realloc(line, aline + 512);
1089 linep = line + aline;
1092 if (!fgets(linep, aline - (linep - line), fp))
1094 linep += strlen(linep);
1095 if (linep == line || linep[-1] != '\n')
1098 linep = line + intag;
1101 if (line[intag] == '-' && !strncmp(line + 1, line + intag + 1, intag - 2))
1108 else if (line[0] == '+' && line[1] && line[1] != ':')
1110 char *tagend = strchr(line, ':');
1115 intag = tagend + 2 - line;
1116 linep = line + intag;
1119 if (*line != '=' || !line[1] || !line[2] || !line[3] || line[4] != ':')
1121 tag = line[1] << 16 | line[2] << 8 | line[3];
1124 case 'P' << 16 | 'k' << 8 | 'g':
1126 finish_solvable(pool, data, s, filelist, nfilelist);
1128 if (split(line + 5, sp, 5) != 4)
1130 s = pool_id2solvable(pool, repo_add_solvable(repo));
1131 s->name = pool_str2id(pool, sp[0], 1);
1132 /* join back version and release */
1133 if (sp[2] && !(sp[2][0] == '-' && !sp[2][1]))
1135 s->evr = makeevr(pool, sp[1]);
1136 s->arch = pool_str2id(pool, sp[3], 1);
1138 case 'S' << 16 | 'u' << 8 | 'm':
1139 repodata_set_str(data, s - pool->solvables, SOLVABLE_SUMMARY, line + 6);
1141 case 'V' << 16 | 'n' << 8 | 'd':
1142 s->vendor = pool_str2id(pool, line + 6, 1);
1144 case 'T' << 16 | 'i' << 8 | 'm':
1147 repodata_set_num(data, s - pool->solvables, SOLVABLE_BUILDTIME, t);
1149 case 'R' << 16 | 'e' << 8 | 'q':
1150 s->requires = adddep(repo, s->requires, line + 6, -SOLVABLE_PREREQMARKER);
1152 case 'P' << 16 | 'r' << 8 | 'q':
1153 s->requires = adddep(repo, s->requires, line + 6, SOLVABLE_PREREQMARKER);
1155 case 'P' << 16 | 'r' << 8 | 'v':
1158 int l = strlen(line + 6) + 1;
1159 if (nfilelist + l > afilelist)
1161 afilelist = nfilelist + l + 512;
1162 filelist = solv_realloc(filelist, afilelist);
1164 memcpy(filelist + nfilelist, line + 6, l);
1171 for (l = 0; l < nfilelist; l += strlen(filelist + l) + 1)
1172 s->provides = repo_addid_dep(repo, s->provides, pool_str2id(pool, filelist + l, 1), 0);
1175 s->provides = adddep(repo, s->provides, line + 6, 0);
1177 case 'O' << 16 | 'b' << 8 | 's':
1178 s->obsoletes = adddep(repo, s->obsoletes, line + 6, 0);
1180 case 'C' << 16 | 'o' << 8 | 'n':
1181 s->conflicts = adddep(repo, s->conflicts, line + 6, 0);
1183 case 'R' << 16 | 'e' << 8 | 'c':
1184 s->recommends = adddep(repo, s->recommends, line + 6, 0);
1186 case 'S' << 16 | 'u' << 8 | 'p':
1187 s->supplements = adddep(repo, s->supplements, line + 6, 0);
1189 case 'S' << 16 | 'u' << 8 | 'g':
1190 s->suggests = adddep(repo, s->suggests, line + 6, 0);
1192 case 'E' << 16 | 'n' << 8 | 'h':
1193 s->enhances = adddep(repo, s->enhances, line + 6, 0);
1200 finish_solvable(pool, data, s, filelist, nfilelist);
1202 solv_free(filelist);
1203 repodata_free_dircache(data);
1204 if (!(flags & REPO_NO_INTERNALIZE))
1205 repodata_internalize(data);
1210 testcase_getpoolflags(Pool *pool)
1212 const char *str = 0;
1214 for (i = 0; poolflags2str[i].str; i++)
1216 v = pool_get_flag(pool, poolflags2str[i].flag);
1217 if (v == poolflags2str[i].def)
1219 str = pool_tmpappend(pool, str, v ? " " : " !", poolflags2str[i].str);
1221 return str ? str + 1 : "";
1225 testcase_setpoolflags(Pool *pool, const char *str)
1227 const char *p = str, *s;
1231 while (*p == ' ' || *p == '\t' || *p == ',')
1242 while (*p && *p != ' ' && *p != '\t' && *p != ',')
1244 for (i = 0; poolflags2str[i].str; i++)
1245 if (!strncmp(poolflags2str[i].str, s, p - s) && poolflags2str[i].str[p - s] == 0)
1247 if (!poolflags2str[i].str)
1249 pool_debug(pool, SOLV_ERROR, "setpoolflags: unknown flag '%.*s'\n", (int)(p - s), s);
1252 pool_set_flag(pool, poolflags2str[i].flag, v);
1258 testcase_resetpoolflags(Pool *pool)
1261 for (i = 0; poolflags2str[i].str; i++)
1262 pool_set_flag(pool, poolflags2str[i].flag, poolflags2str[i].def);
1266 testcase_getsolverflags(Solver *solv)
1268 Pool *pool = solv->pool;
1269 const char *str = 0;
1271 for (i = 0; solverflags2str[i].str; i++)
1273 v = solver_get_flag(solv, solverflags2str[i].flag);
1274 if (v == solverflags2str[i].def)
1276 str = pool_tmpappend(pool, str, v ? " " : " !", solverflags2str[i].str);
1278 return str ? str + 1 : "";
1282 testcase_setsolverflags(Solver *solv, const char *str)
1284 const char *p = str, *s;
1288 while (*p == ' ' || *p == '\t' || *p == ',')
1299 while (*p && *p != ' ' && *p != '\t' && *p != ',')
1301 for (i = 0; solverflags2str[i].str; i++)
1302 if (!strncmp(solverflags2str[i].str, s, p - s) && solverflags2str[i].str[p - s] == 0)
1304 if (!solverflags2str[i].str)
1306 pool_debug(solv->pool, SOLV_ERROR, "setsolverflags: unknown flag '%.*s'\n", (int)(p - s), s);
1309 solver_set_flag(solv, solverflags2str[i].flag, v);
1315 testcase_resetsolverflags(Solver *solv)
1318 for (i = 0; solverflags2str[i].str; i++)
1319 solver_set_flag(solv, solverflags2str[i].flag, solverflags2str[i].def);
1323 testcase_ruleid(Solver *solv, Id rid)
1329 const unsigned char *md5;
1335 solver_ruleliterals(solv, rid, &q);
1336 for (i = 0; i < q.count; i++)
1338 Id p = q.elements[i];
1339 s = testcase_solvid2str(solv->pool, p > 0 ? p : -p);
1341 s = pool_tmpjoin(solv->pool, "!", s, 0);
1342 strqueue_push(&sq, s);
1345 strqueue_sort_u(&sq);
1346 chk = solv_chksum_create(REPOKEY_TYPE_MD5);
1347 for (i = 0; i < sq.nstr; i++)
1348 solv_chksum_add(chk, sq.str[i], strlen(sq.str[i]) + 1);
1349 md5 = solv_chksum_get(chk, &md5l);
1350 s = pool_bin2hex(solv->pool, md5, md5l);
1351 chk = solv_chksum_free(chk, 0);
1357 testcase_problemid(Solver *solv, Id problem)
1362 const unsigned char *md5;
1366 /* we build a hash of all rules that define the problem */
1369 solver_findallproblemrules(solv, problem, &q);
1370 for (i = 0; i < q.count; i++)
1371 strqueue_push(&sq, testcase_ruleid(solv, q.elements[i]));
1373 strqueue_sort_u(&sq);
1374 chk = solv_chksum_create(REPOKEY_TYPE_MD5);
1375 for (i = 0; i < sq.nstr; i++)
1376 solv_chksum_add(chk, sq.str[i], strlen(sq.str[i]) + 1);
1377 md5 = solv_chksum_get(chk, &md5l);
1378 s = pool_bin2hex(solv->pool, md5, 4);
1379 chk = solv_chksum_free(chk, 0);
1385 testcase_solutionid(Solver *solv, Id problem, Id solution)
1389 const unsigned char *md5;
1393 intid = solver_solutionelement_internalid(solv, problem, solution);
1394 /* internal stuff! handle with care! */
1398 s = testcase_job2str(solv->pool, solv->job.elements[-intid - 1], solv->job.elements[-intid]);
1403 s = testcase_ruleid(solv, intid);
1405 chk = solv_chksum_create(REPOKEY_TYPE_MD5);
1406 solv_chksum_add(chk, s, strlen(s) + 1);
1407 md5 = solv_chksum_get(chk, &md5l);
1408 s = pool_bin2hex(solv->pool, md5, 4);
1409 chk = solv_chksum_free(chk, 0);
1413 static struct class2str {
1417 { SOLVER_TRANSACTION_ERASE, "erase" },
1418 { SOLVER_TRANSACTION_INSTALL, "install" },
1419 { SOLVER_TRANSACTION_REINSTALLED, "reinstall" },
1420 { SOLVER_TRANSACTION_DOWNGRADED, "downgrade" },
1421 { SOLVER_TRANSACTION_CHANGED, "change" },
1422 { SOLVER_TRANSACTION_UPGRADED, "upgrade" },
1423 { SOLVER_TRANSACTION_OBSOLETED, "obsolete" },
1424 { SOLVER_TRANSACTION_MULTIINSTALL, "multiinstall" },
1425 { SOLVER_TRANSACTION_MULTIREINSTALL, "multireinstall" },
1430 testcase_solverresult(Solver *solv, int resultflags)
1432 Pool *pool = solv->pool;
1440 if ((resultflags & TESTCASE_RESULT_TRANSACTION) != 0)
1442 Transaction *trans = solver_create_transaction(solv);
1446 for (i = 0; class2str[i].str; i++)
1449 transaction_classify_pkgs(trans, SOLVER_TRANSACTION_KEEP_PSEUDO, class2str[i].class, 0, 0, &q);
1450 for (j = 0; j < q.count; j++)
1454 if (pool->installed && pool->solvables[p].repo == pool->installed)
1455 op = transaction_obs_pkg(trans, p);
1456 s = pool_tmpjoin(pool, class2str[i].str, " ", testcase_solvid2str(pool, p));
1458 s = pool_tmpjoin(pool, s, " ", testcase_solvid2str(pool, op));
1459 strqueue_push(&sq, s);
1463 transaction_free(trans);
1465 if ((resultflags & TESTCASE_RESULT_PROBLEMS) != 0)
1467 char *probprefix, *solprefix;
1468 int problem, solution, element;
1471 pcnt = solver_problem_count(solv);
1472 for (problem = 1; problem <= pcnt; problem++)
1474 Id rid, from, to, dep;
1475 SolverRuleinfo rinfo;
1476 rid = solver_findproblemrule(solv, problem);
1477 s = testcase_problemid(solv, problem);
1478 probprefix = solv_dupjoin("problem ", s, 0);
1479 rinfo = solver_ruleinfo(solv, rid, &from, &to, &dep);
1480 s = pool_tmpjoin(pool, probprefix, " info ", solver_problemruleinfo2str(solv, rinfo, from, to, dep));
1481 strqueue_push(&sq, s);
1482 scnt = solver_solution_count(solv, problem);
1483 for (solution = 1; solution <= scnt; solution++)
1485 s = testcase_solutionid(solv, problem, solution);
1486 solprefix = solv_dupjoin(probprefix, " solution ", s);
1488 while ((element = solver_next_solutionelement(solv, problem, solution, element, &p, &op)) != 0)
1490 if (p == SOLVER_SOLUTION_JOB)
1491 s = pool_tmpjoin(pool, solprefix, " deljob ", testcase_job2str(pool, solv->job.elements[op - 1], solv->job.elements[op]));
1492 else if (p > 0 && op == 0)
1493 s = pool_tmpjoin(pool, solprefix, " erase ", testcase_solvid2str(pool, p));
1494 else if (p > 0 && op > 0)
1496 s = pool_tmpjoin(pool, solprefix, " replace ", testcase_solvid2str(pool, p));
1497 s = pool_tmpappend(pool, s, " ", testcase_solvid2str(pool, op));
1499 else if (p < 0 && op > 0)
1500 s = pool_tmpjoin(pool, solprefix, " allow ", testcase_solvid2str(pool, op));
1502 s = pool_tmpjoin(pool, solprefix, " unknown", 0);
1503 strqueue_push(&sq, s);
1505 solv_free(solprefix);
1507 solv_free(probprefix);
1511 if ((resultflags & TESTCASE_RESULT_ORPHANED) != 0)
1516 solver_get_orphaned(solv, &q);
1517 for (i = 0; i < q.count; i++)
1519 s = pool_tmpjoin(pool, "orphaned ", testcase_solvid2str(pool, q.elements[i]), 0);
1520 strqueue_push(&sq, s);
1525 if ((resultflags & TESTCASE_RESULT_RECOMMENDED) != 0)
1531 solver_get_recommendations(solv, &qr, &qs, 0);
1532 for (i = 0; i < qr.count; i++)
1534 s = pool_tmpjoin(pool, "recommended ", testcase_solvid2str(pool, qr.elements[i]), 0);
1535 strqueue_push(&sq, s);
1537 for (i = 0; i < qs.count; i++)
1539 s = pool_tmpjoin(pool, "suggested ", testcase_solvid2str(pool, qs.elements[i]), 0);
1540 strqueue_push(&sq, s);
1546 if ((resultflags & TESTCASE_RESULT_UNNEEDED) != 0)
1551 solver_get_unneeded(solv, &q, 0);
1552 for (i = 0; i < q.count; i++)
1554 s = pool_tmpjoin(pool, "unneeded ", testcase_solvid2str(pool, q.elements[i]), 0);
1555 strqueue_push(&sq, s);
1561 result = strqueue_join(&sq);
1568 testcase_write(Solver *solv, char *dir, int resultflags, const char *testcasename, const char *resultname)
1570 Pool *pool = solv->pool;
1581 testcasename = "testcase.t";
1583 resultname = "solver.result";
1585 if (mkdir(dir, 0777) && errno != EEXIST)
1587 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: could not create directory '%s'\n", dir);
1591 FOR_REPOS(repoid, repo)
1593 const char *name = testcase_repoid2str(pool, repoid);
1595 if (repo->subpriority)
1596 sprintf(priobuf, "%d.%d", repo->priority, repo->subpriority);
1598 sprintf(priobuf, "%d", repo->priority);
1599 out = pool_tmpjoin(pool, name, ".repo", ".gz");
1600 cmd = pool_tmpjoin(pool, "repo ", name, " ");
1601 cmd = pool_tmpappend(pool, cmd, priobuf, " ");
1602 cmd = pool_tmpappend(pool, cmd, "testtags ", out);
1603 strqueue_push(&sq, cmd);
1604 out = pool_tmpjoin(pool, dir, "/", out);
1605 if (!(fp = solv_xfopen(out, "w")))
1607 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: could not open '%s' for writing\n", out);
1611 testcase_write_testtags(repo, fp);
1614 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: write error\n");
1619 /* hmm, this is not optimal... we currently search for the lowest score */
1621 arch = pool->solvables[SYSTEMSOLVABLE].arch;
1622 for (i = 0; i < pool->lastarch; i++)
1624 if (pool->id2arch[i] == 1 && !lowscore)
1626 if (pool->id2arch[i] > 0x10000 && (!lowscore || pool->id2arch[i] < lowscore))
1629 lowscore = pool->id2arch[i];
1632 cmd = pool_tmpjoin(pool, "system ", pool->lastarch ? pool_id2str(pool, arch) : "unset", 0);
1633 for (i = 0; disttype2str[i].str != 0; i++)
1634 if (pool->disttype == disttype2str[i].type)
1636 pool_tmpappend(pool, cmd, " ", disttype2str[i].str ? disttype2str[i].str : "unknown");
1637 if (pool->installed)
1638 cmd = pool_tmpappend(pool, cmd, " ", testcase_repoid2str(pool, pool->installed->repoid));
1639 strqueue_push(&sq, cmd);
1640 s = testcase_getpoolflags(solv->pool);
1643 cmd = pool_tmpjoin(pool, "poolflags ", s, 0);
1644 strqueue_push(&sq, cmd);
1647 if (pool->vendorclasses)
1650 for (i = 0; pool->vendorclasses[i]; i++)
1652 cmd = pool_tmpappend(pool, cmd ? cmd : "vendorclass", " ", pool->vendorclasses[i]);
1653 if (!pool->vendorclasses[i + 1])
1655 strqueue_push(&sq, cmd);
1662 s = testcase_getsolverflags(solv);
1665 cmd = pool_tmpjoin(pool, "solverflags ", s, 0);
1666 strqueue_push(&sq, cmd);
1669 /* now dump all the ns callback values we know */
1670 if (pool->nscallback)
1674 for (rid = 1; rid < pool->nrels; rid++)
1676 Reldep *rd = pool->rels + rid;
1677 if (rd->flags != REL_NAMESPACE || rd->name == NAMESPACE_OTHERPROVIDERS)
1679 /* evaluate all namespace ids, skip empty results */
1680 d = pool_whatprovides(pool, MAKERELDEP(rid));
1681 if (!d || !pool->whatprovidesdata[d])
1683 cmd = pool_tmpjoin(pool, "namespace ", pool_id2str(pool, rd->name), "(");
1684 cmd = pool_tmpappend(pool, cmd, pool_id2str(pool, rd->evr), ")");
1685 for (; pool->whatprovidesdata[d]; d++)
1686 cmd = pool_tmpappend(pool, cmd, " ", testcase_solvid2str(pool, pool->whatprovidesdata[d]));
1687 strqueue_push(&sq, cmd);
1691 for (i = 0; i < solv->job.count; i += 2)
1693 cmd = (char *)testcase_job2str(pool, solv->job.elements[i], solv->job.elements[i + 1]);
1694 cmd = pool_tmpjoin(pool, "job ", cmd, 0);
1695 strqueue_push(&sq, cmd);
1702 for (i = 0; resultflags2str[i].str; i++)
1703 if ((resultflags & resultflags2str[i].flag) != 0)
1704 cmd = pool_tmpappend(pool, cmd, cmd ? "," : 0, resultflags2str[i].str);
1705 cmd = pool_tmpjoin(pool, "result ", cmd ? cmd : "?", 0);
1706 cmd = pool_tmpappend(pool, cmd, " ", resultname);
1707 strqueue_push(&sq, cmd);
1708 result = testcase_solverresult(solv, resultflags);
1709 if (!strcmp(resultname, "<inline>"))
1713 strqueue_init(&rsq);
1714 strqueue_split(&rsq, result);
1715 for (i = 0; i < rsq.nstr; i++)
1717 cmd = pool_tmpjoin(pool, "#>", rsq.str[i], 0);
1718 strqueue_push(&sq, cmd);
1720 strqueue_free(&rsq);
1724 out = pool_tmpjoin(pool, dir, "/", resultname);
1725 if (!(fp = fopen(out, "w")))
1727 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: could not open '%s' for writing\n", out);
1732 if (result && *result && fwrite(result, strlen(result), 1, fp) != 1)
1734 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: write error\n");
1741 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: write error\n");
1749 cmd = strqueue_join(&sq);
1750 out = pool_tmpjoin(pool, dir, "/", testcasename);
1751 if (!(fp = fopen(out, "w")))
1753 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: could not open '%s' for writing\n", out);
1757 if (*cmd && fwrite(cmd, strlen(cmd), 1, fp) != 1)
1759 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: write error\n");
1765 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: write error\n");
1775 read_inline_file(FILE *fp, char **bufp, char **bufpp, int *buflp)
1777 char *result = solv_malloc(1024);
1784 if (rp - result + 256 >= resultl)
1786 resultl = rp - result;
1787 result = solv_realloc(result, resultl + 1024);
1788 rp = result + resultl;
1791 if (!fgets(rp, resultl - (rp - result), fp))
1794 if (rl && (rp == result || rp[-1] == '\n'))
1796 if (rl > 1 && rp[0] == '#' && rp[1] == '>')
1798 memmove(rp, rp + 2, rl - 2);
1803 while (rl + 16 > *buflp)
1805 *bufp = solv_realloc(*bufp, *buflp + 512);
1808 memmove(*bufp, rp, rl);
1809 if ((*bufp)[rl - 1] == '\n')
1815 (*bufpp) = *bufp + rl;
1832 char *result = solv_malloc(1024);
1839 if (rp - result + 256 >= resultl)
1841 resultl = rp - result;
1842 result = solv_realloc(result, resultl + 1024);
1843 rp = result + resultl;
1846 rl = fread(rp, 1, resultl - (rp - result), fp);
1858 str2resultflags(Pool *pool, char *s) /* modifies the string! */
1860 int i, resultflags = 0;
1863 char *se = strchr(s, ',');
1866 for (i = 0; resultflags2str[i].str; i++)
1867 if (!strcmp(s, resultflags2str[i].str))
1869 resultflags |= resultflags2str[i].flag;
1872 if (!resultflags2str[i].str)
1873 pool_debug(pool, SOLV_ERROR, "result: unknown flag '%s'\n", s);
1880 testcase_read(Pool *pool, FILE *fp, char *testcase, Queue *job, char **resultp, int *resultflagsp)
1885 char *testcasedir, *s;
1891 int poolflagsreset = 0;
1893 if (!fp && !(fp = fopen(testcase, "r")))
1895 pool_debug(pool, SOLV_ERROR, "testcase_read: could not open '%s'\n", testcase);
1898 testcasedir = solv_strdup(testcase);
1899 if ((s = strrchr(testcasedir, '/')) != 0)
1904 buf = solv_malloc(bufl);
1909 if (bufp - buf + 16 > bufl)
1912 buf = solv_realloc(buf, bufl + 512);
1916 if (!fgets(bufp, bufl - (bufp - buf), fp))
1920 if (!l || buf[l - 1] != '\n')
1927 while (*s && (*s == ' ' || *s == '\t'))
1929 if (!*s || *s == '#')
1932 /* split it in pieces */
1935 while (*s == ' ' || *s == '\t')
1939 pieces = solv_extend(pieces, npieces, 1, sizeof(*pieces), 7);
1940 pieces[npieces++] = s;
1941 while (*s && *s != ' ' && *s != '\t')
1946 pieces = solv_extend(pieces, npieces, 1, sizeof(*pieces), 7);
1947 pieces[npieces] = 0;
1948 if (!strcmp(pieces[0], "repo") && npieces >= 4)
1950 Repo *repo = repo_create(pool, pieces[1]);
1956 if (!poolflagsreset)
1959 testcase_resetpoolflags(pool); /* hmm */
1961 if (sscanf(pieces[2], "%d.%d", &prio, &subprio) != 2)
1964 prio = atoi(pieces[2]);
1966 repo->priority = prio;
1967 repo->subpriority = subprio;
1968 if (strcmp(pieces[3], "empty") != 0)
1970 const char *repotype = pool_tmpjoin(pool, pieces[3], 0, 0); /* gets overwritten in <inline> case */
1971 if (!strcmp(pieces[4], "<inline>"))
1973 char *idata = read_inline_file(fp, &buf, &bufp, &bufl);
1975 rfp = solv_xfopen_buf(rdata, &idata, 0, "rf");
1979 rdata = pool_tmpjoin(pool, testcasedir, pieces[4], 0);
1980 rfp = solv_xfopen(rdata, "r");
1984 pool_debug(pool, SOLV_ERROR, "testcase_read: could not open '%s'\n", rdata);
1986 else if (!strcmp(repotype, "testtags"))
1988 testcase_add_testtags(repo, rfp, 0);
1991 else if (!strcmp(repotype, "solv"))
1993 repo_add_solv(repo, rfp, 0);
1997 else if (!strcmp(repotype, "helix"))
1999 extern int repo_add_helix(Repo *repo, FILE *fp, int flags);
2000 repo_add_helix(repo, rfp, 0);
2007 pool_debug(pool, SOLV_ERROR, "testcase_read: unknown repo type for repo '%s'\n", repo->name);
2011 else if (!strcmp(pieces[0], "system") && npieces >= 3)
2015 /* must set the disttype before the arch */
2016 for (i = 0; disttype2str[i].str != 0; i++)
2017 if (!strcmp(disttype2str[i].str, pieces[2]))
2019 if (!disttype2str[i].str)
2020 pool_debug(pool, SOLV_ERROR, "testcase_read: system: unknown disttype '%s'\n", pieces[2]);
2021 else if (pool->disttype != disttype2str[i].type)
2023 #ifdef MULTI_SEMANTICS
2024 pool_setdisttype(pool, disttype2str[i].type);
2026 pool_debug(pool, SOLV_ERROR, "testcase_read: system: cannot change disttype to '%s'\n", pieces[2]);
2029 if (strcmp(pieces[1], "unset") == 0)
2030 pool_setarch(pool, 0);
2031 else if (pieces[1][0] == ':')
2032 pool_setarchpolicy(pool, pieces[1] + 1);
2034 pool_setarch(pool, pieces[1]);
2037 Repo *repo = testcase_str2repo(pool, pieces[3]);
2039 pool_debug(pool, SOLV_ERROR, "testcase_read: system: unknown repo '%s'\n", pieces[3]);
2041 pool_set_installed(pool, repo);
2044 else if (!strcmp(pieces[0], "job") && npieces > 1)
2050 pool_addfileprovides(pool);
2051 pool_createwhatprovides(pool);
2054 if (npieces >= 3 && !strcmp(pieces[2], "selection"))
2056 addselectionjob(pool, pieces + 1, npieces - 1, job);
2060 for (sp = pieces[1]; sp < pieces[npieces - 1]; sp++)
2063 how = testcase_str2job(pool, pieces[1], &what);
2064 if (how >= 0 && job)
2065 queue_push2(job, how, what);
2067 else if (!strcmp(pieces[0], "vendorclass") && npieces > 1)
2069 pool_addvendorclass(pool, (const char **)(pieces + 1));
2071 else if (!strcmp(pieces[0], "namespace") && npieces > 1)
2073 int i = strlen(pieces[1]);
2074 s = strchr(pieces[1], '(');
2075 if (!s && pieces[1][i - 1] != ')')
2077 pool_debug(pool, SOLV_ERROR, "testcase_read: bad namespace '%s'\n", pieces[1]);
2085 pieces[1][i - 1] = 0;
2086 name = pool_str2id(pool, pieces[1], 1);
2087 evr = pool_str2id(pool, s + 1, 1);
2089 pieces[1][i - 1] = ')';
2090 id = pool_rel2id(pool, name, evr, REL_NAMESPACE, 1);
2091 for (i = 2; i < npieces; i++)
2092 queue_push(&q, testcase_str2solvid(pool, pieces[i]));
2093 /* now do the callback */
2096 pool_addfileprovides(pool);
2097 pool_createwhatprovides(pool);
2100 pool->whatprovides_rel[GETRELID(id)] = pool_queuetowhatprovides(pool, &q);
2104 else if (!strcmp(pieces[0], "poolflags"))
2107 if (!poolflagsreset)
2110 testcase_resetpoolflags(pool); /* hmm */
2112 for (i = 1; i < npieces; i++)
2113 testcase_setpoolflags(pool, pieces[i]);
2115 else if (!strcmp(pieces[0], "solverflags") && npieces > 1)
2120 solv = solver_create(pool);
2121 testcase_resetsolverflags(solv);
2123 for (i = 1; i < npieces; i++)
2124 testcase_setsolverflags(solv, pieces[i]);
2126 else if (!strcmp(pieces[0], "result") && npieces > 2)
2129 int resultflags = str2resultflags(pool, pieces[1]);
2130 const char *rdata = pool_tmpjoin(pool, testcasedir, pieces[2], 0);
2131 if (!strcmp(pieces[2], "<inline>"))
2132 result = read_inline_file(fp, &buf, &bufp, &bufl);
2135 FILE *rfp = fopen(rdata, "r");
2137 pool_debug(pool, SOLV_ERROR, "testcase_read: could not open '%s'\n", rdata);
2140 result = read_file(rfp);
2149 *resultflagsp = resultflags;
2151 else if (!strcmp(pieces[0], "nextjob") && npieces == 1)
2157 pool_debug(pool, SOLV_ERROR, "testcase_read: cannot parse command '%s'\n", pieces[0]);
2160 buf = solv_free(buf);
2161 pieces = solv_free(pieces);
2162 solv_free(testcasedir);
2165 pool_addfileprovides(pool);
2166 pool_createwhatprovides(pool);
2170 solv = solver_create(pool);
2171 testcase_resetsolverflags(solv);
2179 testcase_resultdiff(char *result1, char *result2)
2181 Strqueue sq1, sq2, osq;
2183 strqueue_init(&sq1);
2184 strqueue_init(&sq2);
2185 strqueue_init(&osq);
2186 strqueue_split(&sq1, result1);
2187 strqueue_split(&sq2, result2);
2188 strqueue_sort(&sq1);
2189 strqueue_sort(&sq2);
2190 strqueue_diff(&sq1, &sq2, &osq);
2191 r = osq.nstr ? strqueue_join(&osq) : 0;
2192 strqueue_free(&sq1);
2193 strqueue_free(&sq2);
2194 strqueue_free(&osq);