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_susetags.h"
23 #include "solverdebug.h"
26 #include "solv_xfopen.h"
28 #ifndef ENABLE_SUSEREPO
29 # define DISABLE_JOIN2
30 # include "tools_util.h"
32 # include "repo_susetags.h"
35 static struct job2str {
39 { SOLVER_NOOP, "noop" },
40 { SOLVER_INSTALL, "install" },
41 { SOLVER_ERASE, "erase" },
42 { SOLVER_UPDATE, "update" },
43 { SOLVER_WEAKENDEPS, "weakendeps" },
44 { SOLVER_NOOBSOLETES, "noobsoletes" },
45 { SOLVER_LOCK, "lock" },
46 { SOLVER_DISTUPGRADE, "distupgrade" },
47 { SOLVER_VERIFY, "verify" },
48 { SOLVER_DROP_ORPHANED, "droporphaned" },
49 { SOLVER_USERINSTALLED, "userinstalled" },
53 static struct jobflags2str {
57 { SOLVER_WEAK, "weak" },
58 { SOLVER_ESSENTIAL, "essential" },
59 { SOLVER_CLEANDEPS, "cleandeps" },
60 { SOLVER_SETEV, "setev" },
61 { SOLVER_SETEVR, "setevr" },
62 { SOLVER_SETARCH, "setarch" },
63 { SOLVER_SETVENDOR, "setvendor" },
64 { SOLVER_SETREPO, "setrepo" },
65 { SOLVER_NOAUTOSET, "noautoset" },
69 static struct resultflags2str {
72 } resultflags2str[] = {
73 { TESTCASE_RESULT_TRANSACTION, "transaction" },
74 { TESTCASE_RESULT_PROBLEMS, "problems" },
75 { TESTCASE_RESULT_ORPHANED, "orphaned" },
76 { TESTCASE_RESULT_RECOMMENDED, "recommended" },
77 { TESTCASE_RESULT_UNNEEDED, "unneeded" },
81 static struct solverflags2str {
85 } solverflags2str[] = {
86 { SOLVER_FLAG_ALLOW_DOWNGRADE, "allowdowngrade", 0 },
87 { SOLVER_FLAG_ALLOW_ARCHCHANGE, "allowarchchange", 0 },
88 { SOLVER_FLAG_ALLOW_VENDORCHANGE, "allowvendorchange", 0 },
89 { SOLVER_FLAG_ALLOW_UNINSTALL, "allowuninstall", 0 },
90 { SOLVER_FLAG_NO_UPDATEPROVIDE, "noupdateprovide", 0 },
91 { SOLVER_FLAG_SPLITPROVIDES, "splitprovides", 0 },
92 { SOLVER_FLAG_IGNORE_RECOMMENDED, "ignorerecommended", 0 },
93 { SOLVER_FLAG_IGNORE_ALREADY_RECOMMENDED, "ignorealreadyrecommended", 0 },
94 { SOLVER_FLAG_NO_INFARCHCHECK, "noinfarchcheck", 0 },
98 static struct poolflags2str {
102 } poolflags2str[] = {
103 { POOL_FLAG_PROMOTEEPOCH, "promoteepoch", 0 },
104 { POOL_FLAG_FORBIDSELFCONFLICTS, "forbidselfconflicts", 0 },
105 { POOL_FLAG_OBSOLETEUSESPROVIDES, "obsoleteusesprovides", 0 },
106 { POOL_FLAG_IMPLICITOBSOLETEUSESPROVIDES, "implicitobsoleteusesprovides", 0 },
107 { POOL_FLAG_OBSOLETEUSESCOLORS, "obsoleteusescolors", 0 },
108 { POOL_FLAG_NOINSTALLEDOBSOLETES, "noinstalledobsoletes", 0 },
113 typedef struct strqueue {
118 #define STRQUEUE_BLOCK 63
121 strqueue_init(Strqueue *q)
128 strqueue_free(Strqueue *q)
131 for (i = 0; i < q->nstr; i++)
132 solv_free(q->str[i]);
133 q->str = solv_free(q->str);
138 strqueue_push(Strqueue *q, const char *s)
140 q->str = solv_extend(q->str, q->nstr, 1, sizeof(*q->str), STRQUEUE_BLOCK);
141 q->str[q->nstr++] = solv_strdup(s);
145 strqueue_pushjoin(Strqueue *q, const char *s1, const char *s2, const char *s3)
147 q->str = solv_extend(q->str, q->nstr, 1, sizeof(*q->str), STRQUEUE_BLOCK);
148 q->str[q->nstr++] = solv_dupjoin(s1, s2, s3);
152 strqueue_sort_cmp(const void *ap, const void *bp, void *dp)
154 const char *a = *(const char **)ap;
155 const char *b = *(const char **)bp;
156 return strcmp(a ? a : "", b ? b : "");
160 strqueue_sort(Strqueue *q)
163 solv_sort(q->str, q->nstr, sizeof(*q->str), strqueue_sort_cmp, 0);
167 strqueue_sort_u(Strqueue *q)
171 for (i = j = 0; i < q->nstr; i++)
172 if (!j || strqueue_sort_cmp(q->str + i, q->str + j - 1, 0) != 0)
173 q->str[j++] = q->str[i];
178 strqueue_join(Strqueue *q)
182 for (i = 0; i < q->nstr; i++)
184 l += strlen(q->str[i]) + 1;
185 l++; /* trailing \0 */
188 for (i = 0; i < q->nstr; i++)
191 strcpy(rp, q->str[i]);
200 strqueue_split(Strqueue *q, const char *s)
205 while ((p = strchr(s, '\n')) != 0)
207 q->str = solv_extend(q->str, q->nstr, 1, sizeof(*q->str), STRQUEUE_BLOCK);
208 q->str[q->nstr] = solv_malloc(p - s + 1);
210 memcpy(q->str[q->nstr], s, p - s);
211 q->str[q->nstr][p - s] = 0;
220 strqueue_diff(Strqueue *sq1, Strqueue *sq2, Strqueue *osq)
223 while (i < sq1->nstr && j < sq2->nstr)
225 int r = strqueue_sort_cmp(sq1->str + i, sq2->str + j, 0);
229 strqueue_pushjoin(osq, "-", sq1->str[i++], 0);
231 strqueue_pushjoin(osq, "+", sq2->str[j++], 0);
233 while (i < sq1->nstr)
234 strqueue_pushjoin(osq, "-", sq1->str[i++], 0);
235 while (j < sq2->nstr)
236 strqueue_pushjoin(osq, "+", sq2->str[j++], 0);
240 pool_isknownarch(Pool *pool, Id id)
242 if (!id || id == ID_EMPTY)
244 if (id == ARCH_SRC || id == ARCH_NOSRC || id == ARCH_NOARCH)
246 if (!pool->id2arch || (id > pool->lastarch || !pool->id2arch[id]))
252 testcase_str2dep(Pool *pool, char *s)
258 if ((n = strchr(s, '|')) != 0)
260 id = testcase_str2dep(pool, n + 1);
262 id = pool_rel2id(pool, testcase_str2dep(pool, s), id, REL_OR, 1);
266 while (*s == ' ' || *s == '\t')
269 while (*s && *s != ' ' && *s != '\t' && *s != '<' && *s != '=' && *s != '>')
273 while (*s && *s != ')')
279 if ((a = strchr(n, '.')) != 0 && a + 1 < s && s[-1] != ')')
281 Id archid = pool_strn2id(pool, a + 1, s - (a + 1), 0);
282 if (pool_isknownarch(pool, archid))
284 id = pool_strn2id(pool, n, a - n, 1);
285 id = pool_rel2id(pool, id, archid, REL_ARCH, 1);
288 id = pool_strn2id(pool, n, s - n, 1);
291 id = pool_strn2id(pool, n, s - n, 1);
294 while (*s == ' ' || *s == '\t')
310 while (*s == ' ' || *s == '\t')
313 while (*s && *s != ' ' && *s != '\t')
315 return pool_rel2id(pool, id, pool_strn2id(pool, n, s - n, 1), flags, 1);
319 testcase_repoid2str(Pool *pool, Id repoid)
321 Repo *repo = pool_id2repo(pool, repoid);
324 char *r = pool_tmpjoin(pool, repo->name, 0, 0);
326 for (rp = r; *rp; rp++)
327 if (*rp == ' ' || *rp == '\t')
334 sprintf(buf, "#%d", repoid);
335 return pool_tmpjoin(pool, buf, 0, 0);
340 testcase_solvid2str(Pool *pool, Id p)
342 Solvable *s = pool->solvables + p;
346 if (p == SYSTEMSOLVABLE)
348 str = pool_solvid2str(pool, p);
350 return pool_tmpappend(pool, str, "@", 0);
354 char *str2 = pool_tmpappend(pool, str, "@", s->repo->name);
356 if (str2[l] == ' ' || str2[l] == '\t')
360 sprintf(buf, "@#%d", s->repo->repoid);
361 return pool_tmpappend(pool, str, buf, 0);
365 testcase_str2repo(Pool *pool, const char *str)
369 if (str[0] == '#' && (str[1] >= '0' && str[1] <= '9'))
373 for (j = 1; str[j] >= '0' && str[j] <= '9'; j++)
374 repoid = repoid * 10 + (str[j] - '0');
375 if (!str[j] && repoid > 0 && repoid < pool->nrepos)
376 repo = pool_id2repo(pool, repoid);
380 FOR_REPOS(repoid, repo)
385 l = strlen(repo->name);
386 for (i = 0; i < l; i++)
388 int c = repo->name[i];
389 if (c == ' ' || c == '\t')
394 if (i == l && !str[l])
397 if (repoid >= pool->nrepos)
404 testcase_str2solvid(Pool *pool, const char *str)
406 int i, l = strlen(str);
413 if (*str == '@' && !strcmp(str, "@SYSTEM"))
414 return SYSTEMSOLVABLE;
416 for (i = l - 1; i >= 0; i--)
417 if (str[i] == '@' && (repo = testcase_str2repo(pool, str + i + 1)) != 0)
422 /* now find the arch (if present) */
424 for (i = repostart - 1; i > 0; i--)
427 arch = pool_strn2id(pool, str + i + 1, repostart - (i + 1), 0);
432 /* now find the name */
433 for (i = repostart - 1; i > 0; i--)
437 Id nid, evrid, p, pp;
438 nid = pool_strn2id(pool, str, i, 0);
441 evrid = pool_strn2id(pool, str + i + 1, repostart - (i + 1), 0);
444 FOR_PROVIDES(p, pp, nid)
446 Solvable *s = pool->solvables + p;
447 if (s->name != nid || s->evr != evrid)
449 if (repo && s->repo != repo)
451 if (arch && s->arch != arch)
461 testcase_job2str(Pool *pool, Id how, Id what)
468 Id select = how & SOLVER_SELECTMASK;
470 for (i = 0; job2str[i].str; i++)
471 if ((how & SOLVER_JOBMASK) == job2str[i].job)
473 jobstr = job2str[i].str ? job2str[i].str : "unknown";
474 if (select == SOLVER_SOLVABLE)
477 pkgstr = testcase_solvid2str(pool, what);
479 else if (select == SOLVER_SOLVABLE_NAME)
482 pkgstr = pool_dep2str(pool, what);
484 else if (select == SOLVER_SOLVABLE_PROVIDES)
486 selstr = " provides ";
487 pkgstr = pool_dep2str(pool, what);
489 else if (select == SOLVER_SOLVABLE_ONE_OF)
494 while ((p = pool->whatprovidesdata[what++]) != 0)
496 const char *s = testcase_solvid2str(pool, p);
499 pkgstr = pool_tmpappend(pool, pkgstr, " ", s);
500 pool_freetmpspace(pool, s);
508 else if (select == SOLVER_SOLVABLE_REPO)
510 Repo *repo = pool_id2repo(pool, what);
515 sprintf(buf, "#%d", repo->repoid);
516 pkgstr = pool_tmpjoin(pool, buf, 0, 0);
519 pkgstr = pool_tmpjoin(pool, repo->name, 0, 0);
521 else if (select == SOLVER_SOLVABLE_ALL)
528 selstr = " unknown ";
531 ret = pool_tmpjoin(pool, jobstr, selstr, pkgstr);
533 ret = pool_tmpappend(pool, ret, " ", 0);
534 for (i = 0; jobflags2str[i].str; i++)
535 if ((how & jobflags2str[i].flag) != 0)
536 ret = pool_tmpappend(pool, ret, ",", jobflags2str[i].str);
542 ret = pool_tmpappend(pool, ret, "]", 0);
548 testcase_str2job(Pool *pool, const char *str, Id *whatp)
558 /* so we can patch it */
559 s = pool_tmpjoin(pool, str, 0, 0);
560 /* split it in pieces */
563 while (*s == ' ' || *s == '\t')
567 pieces = solv_extend(pieces, npieces, 1, sizeof(*pieces), 7);
568 pieces[npieces++] = s;
569 while (*s && *s != ' ' && *s != '\t')
576 pool_debug(pool, SOLV_ERROR, "str2job: bad line '%s'\n", str);
580 for (i = 0; job2str[i].str; i++)
581 if (!strcmp(pieces[0], job2str[i].str))
585 pool_debug(pool, SOLV_ERROR, "str2job: unknown job '%s'\n", str);
588 job = job2str[i].job;
591 char *flags = pieces[npieces - 1];
593 if (*flags == '[' && flags[strlen(flags) - 1] == ']')
597 flags[strlen(flags) - 1] = ',';
600 for (nf = flags; *nf != ','; nf++)
603 for (i = 0; jobflags2str[i].str; i++)
604 if (!strcmp(flags, jobflags2str[i].str))
606 if (!jobflags2str[i].str)
608 pool_debug(pool, SOLV_ERROR, "str2job: unknown jobflags in '%s'\n", str);
611 job |= jobflags2str[i].flag;
616 if (!strcmp(pieces[1], "pkg"))
620 pool_debug(pool, SOLV_ERROR, "str2job: bad pkg selector in '%s'\n", str);
623 job |= SOLVER_SOLVABLE;
624 what = testcase_str2solvid(pool, pieces[2]);
627 pool_debug(pool, SOLV_ERROR, "str2job: unknown package '%s'\n", pieces[2]);
631 else if (!strcmp(pieces[1], "name") || !strcmp(pieces[1], "provides"))
633 /* join em again for dep2str... */
635 for (sp = pieces[2]; sp < pieces[npieces - 1]; sp++)
638 what = testcase_str2dep(pool, pieces[2]);
639 if (pieces[1][0] == 'n')
640 job |= SOLVER_SOLVABLE_NAME;
642 job |= SOLVER_SOLVABLE_PROVIDES;
644 else if (!strcmp(pieces[1], "oneof"))
647 job |= SOLVER_SOLVABLE_ONE_OF;
649 if (npieces > 3 && strcmp(pieces[2], "nothing") != 0)
651 for (i = 2; i < npieces; i++)
653 Id p = testcase_str2solvid(pool, pieces[i]);
656 pool_debug(pool, SOLV_ERROR, "str2job: unknown package '%s'\n", pieces[i]);
663 what = pool_queuetowhatprovides(pool, &q);
666 else if (!strcmp(pieces[1], "repo"))
671 pool_debug(pool, SOLV_ERROR, "str2job: bad line '%s'\n", str);
674 repo = testcase_str2repo(pool, pieces[2]);
677 pool_debug(pool, SOLV_ERROR, "str2job: unknown repo '%s'\n", pieces[2]);
680 job |= SOLVER_SOLVABLE_REPO;
683 else if (!strcmp(pieces[1], "all"))
685 if (npieces != 3 && strcmp(pieces[2], "packages") != 0)
687 pool_debug(pool, SOLV_ERROR, "str2job: bad line '%s'\n", str);
690 job |= SOLVER_SOLVABLE_ALL;
695 pool_debug(pool, SOLV_ERROR, "str2job: unknown selection in '%s'\n", str);
703 writedeps(Repo *repo, FILE *fp, const char *tag, Id key, Solvable *s, Offset off)
705 Pool *pool = repo->pool;
712 dp = repo->idarraydata + off;
714 while ((id = *dp++) != 0)
716 if (key == SOLVABLE_REQUIRES && id == SOLVABLE_PREREQMARKER)
719 fprintf(fp, "-%s\n", tag);
724 if (key == SOLVABLE_PROVIDES && id == SOLVABLE_FILEMARKER)
729 idstr = pool_dep2str(pool, id);
732 Reldep *rd = GETRELDEP(pool, id);
733 if (key == SOLVABLE_CONFLICTS && rd->flags == REL_NAMESPACE && rd->name == NAMESPACE_OTHERPROVIDERS)
735 if (!strncmp(idstr, "namespace:", 10))
738 if (key == SOLVABLE_SUPPLEMENTS)
740 if (rd->flags == REL_NAMESPACE && rd->name == NAMESPACE_FILESYSTEM)
742 if (!strncmp(idstr, "namespace:", 10))
745 else if (rd->flags == REL_NAMESPACE && rd->name == NAMESPACE_MODALIAS)
747 if (!strncmp(idstr, "namespace:", 10))
750 else if (rd->flags == REL_AND)
752 /* either packageand chain or modalias */
754 if (ISRELDEP(rd->evr))
756 Reldep *mrd = GETRELDEP(pool, rd->evr);
757 if (mrd->flags == REL_NAMESPACE && mrd->name == NAMESPACE_MODALIAS)
759 idstr = pool_tmpjoin(pool, "modalias(", pool_dep2str(pool, rd->name), ":");
760 idstr = pool_tmpappend(pool, idstr, pool_dep2str(pool, mrd->evr), ")");
762 else if (mrd->flags >= 8)
767 /* must be and chain */
768 idstr = pool_dep2str(pool, rd->evr);
774 rd = GETRELDEP(pool, id);
775 if (rd->flags != REL_AND)
777 idstr = pool_tmpjoin(pool, pool_dep2str(pool, rd->evr), ":", idstr);
779 idstr = pool_tmpjoin(pool, pool_dep2str(pool, id), ":", idstr);
780 idstr = pool_tmpjoin(pool, "packageand(", idstr, ")");
783 else if (rd->flags >= 8)
789 fprintf(fp, "+%s\n", tag);
792 fprintf(fp, "%s\n", idstr);
794 if (key == SOLVABLE_PROVIDES)
796 /* add the filelist */
798 dataiterator_init(&di, pool, repo, s - pool->solvables, SOLVABLE_FILELIST, 0, 0);
799 while (dataiterator_step(&di))
801 const char *s = repodata_dir2str(di.data, di.kv.id, di.kv.str);
804 Id id = pool_str2id(pool, s, 0);
807 for (dp = prvdp; *dp; dp++)
811 continue; /* already included */
816 fprintf(fp, "+%s", tag);
819 fprintf(fp, "%s\n", s);
823 fprintf(fp, "-%s\n", tag);
827 testcase_write_susetags(Repo *repo, FILE *fp)
829 Pool *pool = repo->pool;
839 fprintf(fp, "=Ver: 2.0\n");
840 FOR_REPO_SOLVABLES(repo, p, s)
842 name = pool_id2str(pool, s->name);
843 evr = pool_id2str(pool, s->evr);
844 arch = pool_id2str(pool, s->arch);
845 release = strrchr(evr, '-');
847 release = evr + strlen(evr);
848 fprintf(fp, "=Pkg: %s %.*s %s %s\n", name, release - evr, evr, *release && release[1] ? release + 1 : "-", arch);
849 tmp = solvable_lookup_str(s, SOLVABLE_SUMMARY);
851 fprintf(fp, "=Sum: %s\n", tmp);
852 writedeps(repo, fp, "Req:", SOLVABLE_REQUIRES, s, s->requires);
853 writedeps(repo, fp, "Prv:", SOLVABLE_PROVIDES, s, s->provides);
854 writedeps(repo, fp, "Obs:", SOLVABLE_OBSOLETES, s, s->obsoletes);
855 writedeps(repo, fp, "Con:", SOLVABLE_CONFLICTS, s, s->conflicts);
856 writedeps(repo, fp, "Rec:", SOLVABLE_RECOMMENDS, s, s->recommends);
857 writedeps(repo, fp, "Sup:", SOLVABLE_SUPPLEMENTS, s, s->supplements);
858 writedeps(repo, fp, "Sug:", SOLVABLE_SUGGESTS, s, s->suggests);
859 writedeps(repo, fp, "Enh:", SOLVABLE_ENHANCES, s, s->enhances);
861 fprintf(fp, "=Vnd: %s\n", pool_id2str(pool, s->vendor));
862 ti = solvable_lookup_num(s, SOLVABLE_BUILDTIME, 0);
864 fprintf(fp, "=Tim: %u\n", ti);
869 #ifndef ENABLE_SUSEREPO
872 adddep(Repo *repo, Offset olddeps, char *str, Id marker)
874 Id id = *str == '/' ? pool_str2id(repo->pool, str, 1) : testcase_str2dep(repo->pool, str);
875 return repo_addid_dep(repo, olddeps, id, marker);
879 finish_solvable(Pool *pool, Repodata *data, Solvable *s, char *filelist, int nfilelist)
885 for (l = 0; l < nfilelist; l += strlen(filelist + l) + 1)
887 char *p = strrchr(filelist + l, '/');
891 did = repodata_str2dir(data, filelist + l, 1);
894 did = repodata_str2dir(data, "/", 1);
895 repodata_add_dirstr(data, s - pool->solvables, SOLVABLE_FILELIST, did, p);
898 if (s->name && s->arch != ARCH_SRC && s->arch != ARCH_NOSRC)
899 s->provides = repo_addid_dep(s->repo, s->provides, pool_rel2id(pool, s->name, s->evr, REL_EQ, 1), 0);
900 s->supplements = repo_fix_supplements(s->repo, s->provides, s->supplements, 0);
901 s->conflicts = repo_fix_conflicts(s->repo, s->conflicts);
904 /* stripped down version of susetags parser used for testcases */
906 testcase_add_susetags(Repo *repo, FILE *fp, int flags)
908 Pool *pool = repo->pool;
921 data = repo_add_repodata(repo, flags);
926 line = solv_malloc(aline);
930 if (linep - line + 16 > aline)
932 aline = linep - line;
933 line = solv_realloc(line, aline + 512);
934 linep = line + aline;
937 if (!fgets(linep, aline - (linep - line), fp))
939 linep += strlen(linep);
940 if (linep == line || linep[-1] != '\n')
943 linep = line + intag;
946 if (line[intag] == '-' && !strncmp(line + 1, line + intag + 1, intag - 2))
953 else if (line[0] == '+' && line[1] && line[1] != ':')
955 char *tagend = strchr(line, ':');
960 intag = tagend + 2 - line;
961 linep = line + intag;
964 if (*line != '=' || !line[1] || !line[2] || !line[3] || line[4] != ':')
966 tag = line[1] << 16 | line[2] << 8 | line[3];
969 case 'P' << 16 | 'k' << 8 | 'g':
971 finish_solvable(pool, data, s, filelist, nfilelist);
973 if (split(line + 5, sp, 5) != 4)
975 s = pool_id2solvable(pool, repo_add_solvable(repo));
976 s->name = pool_str2id(pool, sp[0], 1);
977 /* join back version and release */
978 if (sp[2] && !(sp[2][0] == '-' && !sp[2][1]))
980 s->evr = makeevr(pool, sp[1]);
981 s->arch = pool_str2id(pool, sp[3], 1);
983 case 'S' << 16 | 'u' << 8 | 'm':
984 repodata_set_str(data, s - pool->solvables, SOLVABLE_SUMMARY, line + 6);
986 case 'V' << 16 | 'n' << 8 | 'd':
987 s->vendor = pool_str2id(pool, line + 6, 1);
989 case 'T' << 16 | 'i' << 8 | 'm':
992 repodata_set_num(data, s - pool->solvables, SOLVABLE_BUILDTIME, t);
994 case 'R' << 16 | 'e' << 8 | 'q':
995 s->requires = adddep(repo, s->requires, line + 6, -SOLVABLE_PREREQMARKER);
997 case 'P' << 16 | 'r' << 8 | 'q':
998 s->requires = adddep(repo, s->requires, line + 6, SOLVABLE_PREREQMARKER);
1000 case 'P' << 16 | 'r' << 8 | 'v':
1003 int l = strlen(line + 6) + 1;
1004 if (nfilelist + l > afilelist)
1006 afilelist = nfilelist + l + 512;
1007 filelist = solv_realloc(filelist, afilelist);
1009 memcpy(filelist + nfilelist, line + 6, l);
1016 for (l = 0; l < nfilelist; l += strlen(filelist + l) + 1)
1017 s->provides = repo_addid_dep(repo, s->provides, pool_str2id(pool, filelist + l, 1), 0);
1020 s->provides = adddep(repo, s->provides, line + 6, 0);
1022 case 'O' << 16 | 'b' << 8 | 's':
1023 s->obsoletes = adddep(repo, s->obsoletes, line + 6, 0);
1025 case 'C' << 16 | 'o' << 8 | 'n':
1026 s->conflicts = adddep(repo, s->conflicts, line + 6, 0);
1028 case 'R' << 16 | 'e' << 8 | 'c':
1029 s->recommends = adddep(repo, s->recommends, line + 6, 0);
1031 case 'S' << 16 | 'u' << 8 | 'p':
1032 s->supplements = adddep(repo, s->supplements, line + 6, 0);
1034 case 'S' << 16 | 'u' << 8 | 'g':
1035 s->suggests = adddep(repo, s->suggests, line + 6, 0);
1037 case 'E' << 16 | 'n' << 8 | 'h':
1038 s->enhances = adddep(repo, s->enhances, line + 6, 0);
1045 finish_solvable(pool, data, s, filelist, nfilelist);
1047 solv_free(filelist);
1048 repodata_free_dircache(data);
1049 if (!(flags & REPO_NO_INTERNALIZE))
1050 repodata_internalize(data);
1057 testcase_add_susetags(Repo *repo, FILE *fp, int flags)
1059 return repo_add_susetags(repo, fp, 0, 0, flags);
1065 testcase_getpoolflags(Pool *pool)
1067 const char *str = 0;
1069 for (i = 0; poolflags2str[i].str; i++)
1071 v = pool_get_flag(pool, poolflags2str[i].flag);
1072 if (v == poolflags2str[i].def)
1074 str = pool_tmpappend(pool, str, v ? " " : " !", poolflags2str[i].str);
1076 return str ? str + 1 : "";
1080 testcase_setpoolflags(Pool *pool, const char *str)
1082 const char *p = str, *s;
1086 while (*p == ' ' || *p == '\t' || *p == ',')
1097 while (*p && *p != ' ' && *p != '\t' && *p != ',')
1099 for (i = 0; poolflags2str[i].str; i++)
1100 if (!strncmp(poolflags2str[i].str, s, p - s) && poolflags2str[i].str[p - s] == 0)
1102 if (!poolflags2str[i].str)
1104 pool_debug(pool, SOLV_ERROR, "setpoolflags: unknown flag '%.*s'\n", p - s, s);
1107 pool_set_flag(pool, poolflags2str[i].flag, v);
1113 testcase_resetpoolflags(Pool *pool)
1116 for (i = 0; poolflags2str[i].str; i++)
1117 pool_set_flag(pool, poolflags2str[i].flag, poolflags2str[i].def);
1121 testcase_getsolverflags(Solver *solv)
1123 Pool *pool = solv->pool;
1124 const char *str = 0;
1126 for (i = 0; solverflags2str[i].str; i++)
1128 v = solver_get_flag(solv, solverflags2str[i].flag);
1129 if (v == solverflags2str[i].def)
1131 str = pool_tmpappend(pool, str, v ? " " : " !", solverflags2str[i].str);
1133 return str ? str + 1 : "";
1137 testcase_setsolverflags(Solver *solv, const char *str)
1139 const char *p = str, *s;
1143 while (*p == ' ' || *p == '\t' || *p == ',')
1154 while (*p && *p != ' ' && *p != '\t' && *p != ',')
1156 for (i = 0; solverflags2str[i].str; i++)
1157 if (!strncmp(solverflags2str[i].str, s, p - s) && solverflags2str[i].str[p - s] == 0)
1159 if (!solverflags2str[i].str)
1161 pool_debug(solv->pool, SOLV_ERROR, "setsolverflags: unknown flag '%.*s'\n", p - s, s);
1164 solver_set_flag(solv, solverflags2str[i].flag, v);
1170 testcase_resetsolverflags(Solver *solv)
1173 for (i = 0; solverflags2str[i].str; i++)
1174 solver_set_flag(solv, solverflags2str[i].flag, solverflags2str[i].def);
1178 testcase_ruleid(Solver *solv, Id rid)
1184 const unsigned char *md5;
1190 solver_ruleliterals(solv, rid, &q);
1191 for (i = 0; i < q.count; i++)
1193 Id p = q.elements[i];
1194 s = testcase_solvid2str(solv->pool, p > 0 ? p : -p);
1196 s = pool_tmpjoin(solv->pool, "!", s, 0);
1197 strqueue_push(&sq, s);
1200 strqueue_sort_u(&sq);
1201 chk = solv_chksum_create(REPOKEY_TYPE_MD5);
1202 for (i = 0; i < sq.nstr; i++)
1203 solv_chksum_add(chk, sq.str[i], strlen(sq.str[i]) + 1);
1204 md5 = solv_chksum_get(chk, &md5l);
1205 s = pool_bin2hex(solv->pool, md5, md5l);
1206 chk = solv_chksum_free(chk, 0);
1212 testcase_problemid(Solver *solv, Id problem)
1217 const unsigned char *md5;
1221 /* we build a hash of all rules that define the problem */
1224 solver_findallproblemrules(solv, problem, &q);
1225 for (i = 0; i < q.count; i++)
1226 strqueue_push(&sq, testcase_ruleid(solv, q.elements[i]));
1228 strqueue_sort_u(&sq);
1229 chk = solv_chksum_create(REPOKEY_TYPE_MD5);
1230 for (i = 0; i < sq.nstr; i++)
1231 solv_chksum_add(chk, sq.str[i], strlen(sq.str[i]) + 1);
1232 md5 = solv_chksum_get(chk, &md5l);
1233 s = pool_bin2hex(solv->pool, md5, 4);
1234 chk = solv_chksum_free(chk, 0);
1240 testcase_solutionid(Solver *solv, Id problem, Id solution)
1244 const unsigned char *md5;
1248 intid = solver_solutionelement_internalid(solv, problem, solution);
1249 /* internal stuff! handle with care! */
1253 s = testcase_job2str(solv->pool, solv->job.elements[-intid - 1], solv->job.elements[-intid]);
1258 s = testcase_ruleid(solv, intid);
1260 chk = solv_chksum_create(REPOKEY_TYPE_MD5);
1261 solv_chksum_add(chk, s, strlen(s) + 1);
1262 md5 = solv_chksum_get(chk, &md5l);
1263 s = pool_bin2hex(solv->pool, md5, 4);
1264 chk = solv_chksum_free(chk, 0);
1268 static struct class2str {
1272 { SOLVER_TRANSACTION_ERASE, "erase" },
1273 { SOLVER_TRANSACTION_INSTALL, "install" },
1274 { SOLVER_TRANSACTION_REINSTALLED, "reinstall" },
1275 { SOLVER_TRANSACTION_DOWNGRADED, "downgrade" },
1276 { SOLVER_TRANSACTION_CHANGED, "change" },
1277 { SOLVER_TRANSACTION_UPGRADED, "upgrade" },
1278 { SOLVER_TRANSACTION_OBSOLETED, "obsolete" },
1279 { SOLVER_TRANSACTION_MULTIINSTALL, "multiinstall" },
1280 { SOLVER_TRANSACTION_MULTIREINSTALL, "multireinstall" },
1285 testcase_solverresult(Solver *solv, int resultflags)
1287 Pool *pool = solv->pool;
1295 if ((resultflags & TESTCASE_RESULT_TRANSACTION) != 0)
1297 Transaction *trans = solver_create_transaction(solv);
1301 for (i = 0; class2str[i].str; i++)
1304 transaction_classify_pkgs(trans, SOLVER_TRANSACTION_KEEP_PSEUDO, class2str[i].class, 0, 0, &q);
1305 for (j = 0; j < q.count; j++)
1309 if (pool->installed && pool->solvables[p].repo == pool->installed)
1310 op = transaction_obs_pkg(trans, p);
1311 s = pool_tmpjoin(pool, class2str[i].str, " ", testcase_solvid2str(pool, p));
1313 s = pool_tmpjoin(pool, s, " ", testcase_solvid2str(pool, op));
1314 strqueue_push(&sq, s);
1318 transaction_free(trans);
1320 if ((resultflags & TESTCASE_RESULT_PROBLEMS) != 0)
1322 char *probprefix, *solprefix;
1323 int problem, solution, element;
1326 pcnt = solver_problem_count(solv);
1327 for (problem = 1; problem <= pcnt; problem++)
1329 Id rid, from, to, dep;
1330 SolverRuleinfo rinfo;
1331 rid = solver_findproblemrule(solv, problem);
1332 s = testcase_problemid(solv, problem);
1333 probprefix = solv_dupjoin("problem ", s, 0);
1334 rinfo = solver_ruleinfo(solv, rid, &from, &to, &dep);
1335 s = pool_tmpjoin(pool, probprefix, " info ", solver_problemruleinfo2str(solv, rinfo, from, to, dep));
1336 strqueue_push(&sq, s);
1337 scnt = solver_solution_count(solv, problem);
1338 for (solution = 1; solution <= scnt; solution++)
1340 s = testcase_solutionid(solv, problem, solution);
1341 solprefix = solv_dupjoin(probprefix, " solution ", s);
1343 while ((element = solver_next_solutionelement(solv, problem, solution, element, &p, &op)) != 0)
1345 if (p == SOLVER_SOLUTION_JOB)
1346 s = pool_tmpjoin(pool, solprefix, " deljob ", testcase_job2str(pool, solv->job.elements[op - 1], solv->job.elements[op]));
1347 else if (p > 0 && op == 0)
1348 s = pool_tmpjoin(pool, solprefix, " erase ", testcase_solvid2str(pool, p));
1349 else if (p > 0 && op > 0)
1351 s = pool_tmpjoin(pool, solprefix, " replace ", testcase_solvid2str(pool, p));
1352 s = pool_tmpappend(pool, s, " ", testcase_solvid2str(pool, op));
1354 else if (p < 0 && op > 0)
1355 s = pool_tmpjoin(pool, solprefix, " allow ", testcase_solvid2str(pool, op));
1357 s = pool_tmpjoin(pool, solprefix, " unknown", 0);
1358 strqueue_push(&sq, s);
1360 solv_free(solprefix);
1362 solv_free(probprefix);
1366 if ((resultflags & TESTCASE_RESULT_ORPHANED) != 0)
1371 solver_get_orphaned(solv, &q);
1372 for (i = 0; i < q.count; i++)
1374 s = pool_tmpjoin(pool, "orphaned ", testcase_solvid2str(pool, q.elements[i]), 0);
1375 strqueue_push(&sq, s);
1380 if ((resultflags & TESTCASE_RESULT_RECOMMENDED) != 0)
1386 solver_get_recommendations(solv, &qr, &qs, 0);
1387 for (i = 0; i < qr.count; i++)
1389 s = pool_tmpjoin(pool, "recommended ", testcase_solvid2str(pool, qr.elements[i]), 0);
1390 strqueue_push(&sq, s);
1392 for (i = 0; i < qs.count; i++)
1394 s = pool_tmpjoin(pool, "suggested ", testcase_solvid2str(pool, qs.elements[i]), 0);
1395 strqueue_push(&sq, s);
1402 result = strqueue_join(&sq);
1409 testcase_write(Solver *solv, char *dir, int resultflags, const char *testcasename, const char *resultname)
1411 Pool *pool = solv->pool;
1422 testcasename = "testcase.t";
1424 resultname = "solver.result";
1426 if (mkdir(dir, 0777) && errno != EEXIST)
1428 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: could not create directory '%s'\n", dir);
1432 FOR_REPOS(repoid, repo)
1434 const char *name = testcase_repoid2str(pool, repoid);
1436 if (repo->subpriority)
1437 sprintf(priobuf, "%d.%d", repo->priority, repo->subpriority);
1439 sprintf(priobuf, "%d", repo->priority);
1440 out = pool_tmpjoin(pool, name, ".repo", ".gz");
1441 cmd = pool_tmpjoin(pool, "repo ", name, " ");
1442 cmd = pool_tmpappend(pool, cmd, priobuf, " ");
1443 cmd = pool_tmpappend(pool, cmd, "susetags ", out);
1444 strqueue_push(&sq, cmd);
1445 out = pool_tmpjoin(pool, dir, "/", out);
1446 if (!(fp = solv_xfopen(out, "w")))
1448 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: could not open '%s' for writing\n", out);
1452 testcase_write_susetags(repo, fp);
1455 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: write error\n");
1460 /* hmm, this is not optimal... we currently search for the lowest score */
1463 for (i = 0; i < pool->lastarch; i++)
1465 if (pool->id2arch[i] == 1 && !lowscore)
1467 if (pool->id2arch[i] > 0x10000 && (!lowscore || pool->id2arch[i] < lowscore))
1470 lowscore = pool->id2arch[i];
1473 cmd = pool_tmpjoin(pool, "system ", pool_id2str(pool, arch), pool->disttype == DISTTYPE_DEB ? " deb" : " rpm");
1474 if (pool->installed)
1475 cmd = pool_tmpappend(pool, cmd, " ", testcase_repoid2str(pool, pool->installed->repoid));
1476 strqueue_push(&sq, cmd);
1477 s = testcase_getpoolflags(solv->pool);
1480 cmd = pool_tmpjoin(pool, "poolflags ", s, 0);
1481 strqueue_push(&sq, cmd);
1484 if (pool->vendorclasses)
1487 for (i = 0; pool->vendorclasses[i]; i++)
1489 cmd = pool_tmpappend(pool, cmd ? cmd : "vendorclass", " ", pool->vendorclasses[i]);
1490 if (!pool->vendorclasses[i + 1])
1492 strqueue_push(&sq, cmd);
1499 s = testcase_getsolverflags(solv);
1502 cmd = pool_tmpjoin(pool, "solverflags ", s, 0);
1503 strqueue_push(&sq, cmd);
1506 /* now dump all the ns callback values we know */
1507 if (pool->nscallback)
1511 for (rid = 1; rid < pool->nrels; rid++)
1513 Reldep *rd = pool->rels + rid;
1514 if (rd->flags != REL_NAMESPACE || rd->name == NAMESPACE_OTHERPROVIDERS)
1516 /* check if we evaluated it, also skip empty results */
1517 if (!(d = pool->whatprovides_rel[rid]) || !pool->whatprovidesdata[d])
1519 cmd = pool_tmpjoin(pool, "namespace ", pool_id2str(pool, rd->name), "(");
1520 cmd = pool_tmpappend(pool, cmd, pool_id2str(pool, rd->evr), ")");
1521 for (; pool->whatprovidesdata[d]; d++)
1522 cmd = pool_tmpappend(pool, cmd, " ", testcase_solvid2str(pool, pool->whatprovidesdata[d]));
1523 strqueue_push(&sq, cmd);
1527 for (i = 0; i < solv->job.count; i += 2)
1529 cmd = (char *)testcase_job2str(pool, solv->job.elements[i], solv->job.elements[i + 1]);
1530 cmd = pool_tmpjoin(pool, "job ", cmd, 0);
1531 strqueue_push(&sq, cmd);
1538 for (i = 0; resultflags2str[i].str; i++)
1539 if ((resultflags & resultflags2str[i].flag) != 0)
1540 cmd = pool_tmpappend(pool, cmd, cmd ? "," : 0, resultflags2str[i].str);
1541 cmd = pool_tmpjoin(pool, "result ", cmd ? cmd : "?", 0);
1542 cmd = pool_tmpappend(pool, cmd, " ", resultname);
1543 strqueue_push(&sq, cmd);
1544 result = testcase_solverresult(solv, resultflags);
1545 if (!strcmp(resultname, "<inline>"))
1549 strqueue_init(&rsq);
1550 strqueue_split(&rsq, result);
1551 for (i = 0; i < rsq.nstr; i++)
1553 cmd = pool_tmpjoin(pool, "#>", rsq.str[i], 0);
1554 strqueue_push(&sq, cmd);
1556 strqueue_free(&rsq);
1560 out = pool_tmpjoin(pool, dir, "/", resultname);
1561 if (!(fp = fopen(out, "w")))
1563 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: could not open '%s' for writing\n", out);
1568 if (result && *result && fwrite(result, strlen(result), 1, fp) != 1)
1570 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: write error\n");
1577 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: write error\n");
1585 cmd = strqueue_join(&sq);
1586 out = pool_tmpjoin(pool, dir, "/", testcasename);
1587 if (!(fp = fopen(out, "w")))
1589 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: could not open '%s' for writing\n", out);
1593 if (*cmd && fwrite(cmd, strlen(cmd), 1, fp) != 1)
1595 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: write error\n");
1601 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: write error\n");
1611 testcase_read(Pool *pool, FILE *fp, char *testcase, Queue *job, char **resultp, int *resultflagsp)
1616 char *testcasedir, *s;
1622 int poolflagsreset = 0;
1624 if (!fp && !(fp = fopen(testcase, "r")))
1626 pool_debug(pool, SOLV_ERROR, "testcase_read: could not open '%s'\n", testcase);
1629 testcasedir = solv_strdup(testcase);
1630 if ((s = strrchr(testcasedir, '/')) != 0)
1635 buf = solv_malloc(bufl);
1640 if (bufp - buf + 16 > bufl)
1643 buf = solv_realloc(buf, bufl + 512);
1647 if (!fgets(bufp, bufl - (bufp - buf), fp))
1651 if (!l || buf[l - 1] != '\n')
1658 while (*s && (*s == ' ' || *s == '\t'))
1660 if (!*s || *s == '#')
1663 /* split it in pieces */
1666 while (*s == ' ' || *s == '\t')
1670 pieces = solv_extend(pieces, npieces, 1, sizeof(*pieces), 7);
1671 pieces[npieces++] = s;
1672 while (*s && *s != ' ' && *s != '\t')
1677 pieces = solv_extend(pieces, npieces, 1, sizeof(*pieces), 7);
1678 pieces[npieces] = 0;
1679 if (!strcmp(pieces[0], "repo") && npieces >= 4)
1681 Repo *repo = repo_create(pool, pieces[1]);
1687 if (!poolflagsreset)
1690 testcase_resetpoolflags(pool); /* hmm */
1692 if (sscanf(pieces[2], "%d.%d", &prio, &subprio) != 2)
1695 prio = atoi(pieces[2]);
1697 repo->priority = prio;
1698 repo->subpriority = subprio;
1699 if (strcmp(pieces[3], "empty") != 0)
1701 rdata = pool_tmpjoin(pool, testcasedir, pieces[4], 0);
1702 if ((rfp = solv_xfopen(rdata, "r")) == 0)
1704 pool_debug(pool, SOLV_ERROR, "testcase_read: could not open '%s'\n", rdata);
1706 else if (!strcmp(pieces[3], "susetags"))
1708 testcase_add_susetags(repo, rfp, 0);
1714 pool_debug(pool, SOLV_ERROR, "testcase_read: unknown repo type for repo '%s'\n", repo->name);
1718 else if (!strcmp(pieces[0], "system") && npieces >= 3)
1721 pool_setarch(pool, pieces[1]);
1724 Repo *repo = testcase_str2repo(pool, pieces[3]);
1726 pool_debug(pool, SOLV_ERROR, "testcase_read: system: unknown repo '%s'\n", pieces[3]);
1728 pool_set_installed(pool, repo);
1731 else if (!strcmp(pieces[0], "job") && npieces > 1)
1737 pool_addfileprovides(pool);
1738 pool_createwhatprovides(pool);
1742 for (sp = pieces[1]; sp < pieces[npieces - 1]; sp++)
1745 how = testcase_str2job(pool, pieces[1], &what);
1746 if (how >= 0 && job)
1747 queue_push2(job, how, what);
1749 else if (!strcmp(pieces[0], "vendorclass") && npieces > 1)
1751 pool_addvendorclass(pool, (const char **)(pieces + 1));
1753 else if (!strcmp(pieces[0], "namespace") && npieces > 1)
1755 int i = strlen(pieces[1]);
1756 s = strchr(pieces[1], '(');
1757 if (!s && pieces[1][i - 1] != ')')
1759 pool_debug(pool, SOLV_ERROR, "testcase_read: bad namespace '%s'\n", pieces[1]);
1767 pieces[1][i - 1] = 0;
1768 name = pool_str2id(pool, pieces[1], 1);
1769 evr = pool_str2id(pool, s + 1, 1);
1771 pieces[1][i - 1] = ')';
1772 id = pool_rel2id(pool, name, evr, REL_NAMESPACE, 1);
1773 for (i = 2; i < npieces; i++)
1774 queue_push(&q, testcase_str2solvid(pool, pieces[i]));
1775 /* now do the callback */
1778 pool_addfileprovides(pool);
1779 pool_createwhatprovides(pool);
1782 pool->whatprovides_rel[GETRELID(id)] = pool_queuetowhatprovides(pool, &q);
1786 else if (!strcmp(pieces[0], "poolflags"))
1789 if (!poolflagsreset)
1792 testcase_resetpoolflags(pool); /* hmm */
1794 for (i = 1; i < npieces; i++)
1795 testcase_setpoolflags(pool, pieces[i]);
1797 else if (!strcmp(pieces[0], "solverflags") && npieces > 1)
1802 solv = solver_create(pool);
1803 testcase_resetsolverflags(solv);
1805 for (i = 1; i < npieces; i++)
1806 testcase_setsolverflags(solv, pieces[i]);
1808 else if (!strcmp(pieces[0], "result") && npieces > 1)
1812 int resultflags = 0;
1813 char *s = pieces[1];
1817 char *se = strchr(s, ',');
1820 for (i = 0; resultflags2str[i].str; i++)
1821 if (!strcmp(s, resultflags2str[i].str))
1823 resultflags |= resultflags2str[i].flag;
1826 if (!resultflags2str[i].str)
1827 pool_debug(pool, SOLV_ERROR, "result: unknown flag '%s'\n", s);
1831 rdata = pool_tmpjoin(pool, testcasedir, pieces[2], 0);
1832 if (!strcmp(pieces[2], "<inline>"))
1835 rfp = fopen(rdata, "r");
1838 pool_debug(pool, SOLV_ERROR, "testcase_read: could not open '%s'\n", rdata);
1842 /* slurp it in... */
1843 char *result = solv_malloc(1024);
1849 if (rp - result + 256 >= resultl)
1851 resultl = rp - result;
1852 result = solv_realloc(result, resultl + 1024);
1853 rp = result + resultl;
1858 if (!fgets(rp, resultl - (rp - result), fp))
1863 if (rl && (rp == result || rp[-1] == '\n'))
1865 if (rl > 1 && rp[0] == '#' && rp[1] == '>')
1867 memmove(rp, rp + 2, rl - 2);
1872 while (rl + 16 > bufl)
1874 buf = solv_realloc(buf, bufl + 512);
1877 memmove(buf, rp, rl);
1878 if (buf[rl - 1] == '\n')
1890 rl = fread(rp, 1, resultl - (rp - result), rfp);
1905 *resultflagsp = resultflags;
1908 else if (!strcmp(pieces[0], "nextjob") && npieces == 1)
1914 pool_debug(pool, SOLV_ERROR, "testcase_read: cannot parse command '%s'\n", pieces[0]);
1917 buf = solv_free(buf);
1918 pieces = solv_free(pieces);
1919 solv_free(testcasedir);
1922 pool_addfileprovides(pool);
1923 pool_createwhatprovides(pool);
1927 solv = solver_create(pool);
1928 testcase_resetsolverflags(solv);
1936 testcase_resultdiff(char *result1, char *result2)
1938 Strqueue sq1, sq2, osq;
1940 strqueue_init(&sq1);
1941 strqueue_init(&sq2);
1942 strqueue_init(&osq);
1943 strqueue_split(&sq1, result1);
1944 strqueue_split(&sq2, result2);
1945 strqueue_sort(&sq1);
1946 strqueue_sort(&sq2);
1947 strqueue_diff(&sq1, &sq2, &osq);
1948 r = osq.nstr ? strqueue_join(&osq) : 0;
1949 strqueue_free(&sq1);
1950 strqueue_free(&sq2);
1951 strqueue_free(&osq);