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"
29 static struct job2str {
33 { SOLVER_NOOP, "noop" },
34 { SOLVER_INSTALL, "install" },
35 { SOLVER_ERASE, "erase" },
36 { SOLVER_UPDATE, "update" },
37 { SOLVER_WEAKENDEPS, "weakendeps" },
38 { SOLVER_NOOBSOLETES, "noobsoletes" },
39 { SOLVER_LOCK, "lock" },
40 { SOLVER_DISTUPGRADE, "distupgrade" },
41 { SOLVER_VERIFY, "verify" },
42 { SOLVER_DROP_ORPHANED, "droporphaned" },
43 { SOLVER_USERINSTALLED, "userinstalled" },
47 static struct jobflags2str {
51 { SOLVER_WEAK, "weak" },
52 { SOLVER_ESSENTIAL, "essential" },
53 { SOLVER_CLEANDEPS, "cleandeps" },
54 { SOLVER_SETEV, "setev" },
55 { SOLVER_SETEVR, "setevr" },
56 { SOLVER_SETARCH, "setarch" },
57 { SOLVER_SETVENDOR, "setvendor" },
58 { SOLVER_SETREPO, "setrepo" },
59 { SOLVER_NOAUTOSET, "noautoset" },
63 static struct solverflags2str {
67 } solverflags2str[] = {
68 { SOLVER_FLAG_ALLOW_DOWNGRADE, "allowdowngrade", 0 },
69 { SOLVER_FLAG_ALLOW_ARCHCHANGE, "allowarchchange", 0 },
70 { SOLVER_FLAG_ALLOW_VENDORCHANGE, "allowvendorchange", 0 },
71 { SOLVER_FLAG_ALLOW_UNINSTALL, "allowuninstall", 0 },
72 { SOLVER_FLAG_NO_UPDATEPROVIDE, "noupdateprovide", 0 },
73 { SOLVER_FLAG_SPLITPROVIDES, "splitprovides", 0 },
74 { SOLVER_FLAG_IGNORE_RECOMMENDED, "ignorerecommended", 0 },
75 { SOLVER_FLAG_IGNORE_ALREADY_RECOMMENDED, "ignorealreadyrecommended", 0 },
76 { SOLVER_FLAG_NO_INFARCHCHECK, "noinfarchcheck", 0 },
81 typedef struct strqueue {
86 #define STRQUEUE_BLOCK 63
89 strqueue_init(Strqueue *q)
96 strqueue_free(Strqueue *q)
99 for (i = 0; i < q->nstr; i++)
100 solv_free(q->str[i]);
101 q->str = solv_free(q->str);
106 strqueue_push(Strqueue *q, const char *s)
108 q->str = solv_extend(q->str, q->nstr, 1, sizeof(*q->str), STRQUEUE_BLOCK);
109 q->str[q->nstr++] = solv_strdup(s);
113 strqueue_pushjoin(Strqueue *q, const char *s1, const char *s2, const char *s3)
115 q->str = solv_extend(q->str, q->nstr, 1, sizeof(*q->str), STRQUEUE_BLOCK);
116 q->str[q->nstr++] = solv_dupjoin(s1, s2, s3);
120 strqueue_sort_cmp(const void *ap, const void *bp, void *dp)
122 const char *a = *(const char **)ap;
123 const char *b = *(const char **)bp;
124 return strcmp(a ? a : "", b ? b : "");
128 strqueue_sort(Strqueue *q)
131 solv_sort(q->str, q->nstr, sizeof(*q->str), strqueue_sort_cmp, 0);
135 strqueue_sort_u(Strqueue *q)
139 for (i = j = 0; i < q->nstr; i++)
140 if (!j || strqueue_sort_cmp(q->str + i, q->str + j - 1, 0) != 0)
141 q->str[j++] = q->str[i];
146 strqueue_join(Strqueue *q)
150 for (i = 0; i < q->nstr; i++)
152 l += strlen(q->str[i]) + 1;
153 l++; /* trailing \0 */
156 for (i = 0; i < q->nstr; i++)
159 strcpy(rp, q->str[i]);
168 strqueue_split(Strqueue *q, const char *s)
171 while ((p = strchr(s, '\n')) != 0)
173 q->str = solv_extend(q->str, q->nstr, 1, sizeof(*q->str), STRQUEUE_BLOCK);
174 q->str[q->nstr] = solv_malloc(p - s + 1);
176 memcpy(q->str[q->nstr], s, p - s);
177 q->str[q->nstr][p - s] = 0;
186 strqueue_diff(Strqueue *sq1, Strqueue *sq2, Strqueue *osq)
189 while (i < sq1->nstr && j < sq2->nstr)
191 int r = strqueue_sort_cmp(sq1->str + i, sq2->str + j, 0);
195 strqueue_pushjoin(osq, "-", sq1->str[i++], 0);
197 strqueue_pushjoin(osq, "+", sq2->str[j++], 0);
199 while (i < sq1->nstr)
200 strqueue_pushjoin(osq, "-", sq1->str[i++], 0);
201 while (j < sq2->nstr)
202 strqueue_pushjoin(osq, "+", sq2->str[j++], 0);
206 pool_isknownarch(Pool *pool, Id id)
208 if (!id || id == ID_EMPTY)
210 if (id == ARCH_SRC || id == ARCH_NOSRC || id == ARCH_NOARCH)
212 if (pool->id2arch && (id > pool->lastarch || !pool->id2arch[id]))
218 testcase_str2dep(Pool *pool, char *s)
224 if ((n = strchr(s, '|')) != 0)
226 id = testcase_str2dep(pool, n + 1);
228 id = pool_rel2id(pool, testcase_str2dep(pool, s), id, REL_OR, 1);
232 while (*s == ' ' || *s == '\t')
235 while (*s && *s != ' ' && *s != '\t' && *s != '<' && *s != '=' && *s != '>')
237 if ((a = strchr(n, '.')) != 0 && a + 1 < s)
239 Id archid = pool_strn2id(pool, a + 1, s - (a + 1), 0);
240 if (pool_isknownarch(pool, archid))
242 id = pool_strn2id(pool, n, a - n, 1);
243 id = pool_rel2id(pool, id, archid, REL_ARCH, 1);
246 id = pool_strn2id(pool, n, s - n, 1);
249 id = pool_strn2id(pool, n, s - n, 1);
252 while (*s == ' ' || *s == '\t')
268 while (*s == ' ' || *s == '\t')
271 while (*s && *s != ' ' && *s != '\t')
273 return pool_rel2id(pool, id, pool_strn2id(pool, n, s - n, 1), flags, 1);
277 testcase_repoid2str(Pool *pool, Id repoid)
279 Repo *repo = pool_id2repo(pool, repoid);
282 char *r = pool_tmpjoin(pool, repo->name, 0, 0);
284 for (rp = r; *rp; rp++)
285 if (*rp == ' ' || *rp == '\t')
292 sprintf(buf, "@#%d", repoid);
293 return pool_tmpjoin(pool, buf, 0, 0);
298 testcase_solvid2str(Pool *pool, Id p)
300 Solvable *s = pool->solvables + p;
304 if (p == SYSTEMSOLVABLE)
306 str = pool_solvid2str(pool, p);
308 return pool_tmpappend(pool, str, "@", 0);
312 char *str2 = pool_tmpappend(pool, str, "@", s->repo->name);
314 if (str2[l] == ' ' || str2[l] == '\t')
318 sprintf(buf, "@#%d", s->repo->repoid);
319 return pool_tmpappend(pool, str, buf, 0);
323 testcase_str2repo(Pool *pool, const char *str)
327 if (str[0] == '#' && (str[1] >= '0' && str[1] <= '9'))
331 for (j = 1; str[j] >= '0' && str[j] <= '9'; j++)
332 repoid = repoid * 10 + (str[j] - '0');
333 if (!str[j] && repoid > 0 && repoid < pool->nrepos)
334 repo = pool_id2repo(pool, repoid);
338 FOR_REPOS(repoid, repo)
343 l = strlen(repo->name);
344 for (i = 0; i < l; i++)
346 int c = repo->name[i];
347 if (c == ' ' || c == '\t')
352 if (i == l && !str[l])
355 if (repoid >= pool->nrepos)
362 testcase_str2solvid(Pool *pool, const char *str)
364 int i, l = strlen(str);
371 if (*str == '@' && !strcmp(str, "@SYSTEM"))
372 return SYSTEMSOLVABLE;
374 for (i = l - 1; i >= 0; i--)
375 if (str[i] == '@' && (repo = testcase_str2repo(pool, str + i + 1)) != 0)
380 /* now find the arch (if present) */
382 for (i = repostart - 1; i > 0; i--)
385 arch = pool_strn2id(pool, str + i + 1, repostart - (i + 1), 0);
390 /* now find the name */
391 for (i = repostart - 1; i > 0; i--)
395 Id nid, evrid, p, pp;
396 nid = pool_strn2id(pool, str, i, 0);
399 evrid = pool_strn2id(pool, str + i + 1, repostart - (i + 1), 0);
402 FOR_PROVIDES(p, pp, nid)
404 Solvable *s = pool->solvables + p;
405 if (s->name != nid || s->evr != evrid)
407 if (repo && s->repo != repo)
409 if (arch && s->arch != arch)
419 testcase_job2str(Pool *pool, Id how, Id what)
426 Id select = how & SOLVER_SELECTMASK;
428 for (i = 0; job2str[i].str; i++)
429 if ((how & SOLVER_JOBMASK) == job2str[i].job)
431 jobstr = job2str[i].str ? job2str[i].str : "unknown";
432 if (select == SOLVER_SOLVABLE)
435 pkgstr = testcase_solvid2str(pool, what);
437 else if (select == SOLVER_SOLVABLE_NAME)
440 pkgstr = pool_dep2str(pool, what);
442 else if (select == SOLVER_SOLVABLE_PROVIDES)
444 selstr = " provides ";
445 pkgstr = pool_dep2str(pool, what);
447 else if (select == SOLVER_SOLVABLE_ONE_OF)
452 while ((p = pool->whatprovidesdata[what++]) != 0)
454 const char *s = testcase_solvid2str(pool, p);
457 pkgstr = pool_tmpappend(pool, pkgstr, " ", s);
458 pool_freetmpspace(pool, s);
466 else if (select == SOLVER_SOLVABLE_REPO)
468 Repo *repo = pool_id2repo(pool, what);
473 sprintf(buf, "#%d", repo->repoid);
474 pkgstr = pool_tmpjoin(pool, buf, 0, 0);
477 pkgstr = pool_tmpjoin(pool, repo->name, 0, 0);
479 else if (select == SOLVER_SOLVABLE_ALL)
486 selstr = " unknown ";
489 ret = pool_tmpjoin(pool, jobstr, selstr, pkgstr);
491 ret = pool_tmpappend(pool, ret, " ", 0);
492 for (i = 0; jobflags2str[i].str; i++)
493 if ((how & jobflags2str[i].flag) != 0)
494 ret = pool_tmpappend(pool, ret, ",", jobflags2str[i].str);
500 ret = pool_tmpappend(pool, ret, "]", 0);
506 testcase_str2job(Pool *pool, const char *str, Id *whatp)
516 /* so we can patch it */
517 s = pool_tmpjoin(pool, str, 0, 0);
518 /* split it in pieces */
521 while (*s == ' ' || *s == '\t')
525 pieces = solv_extend(pieces, npieces, 1, sizeof(*pieces), 7);
526 pieces[npieces++] = s;
527 while (*s && *s != ' ' && *s != '\t')
534 pool_debug(pool, SOLV_ERROR, "str2job: bad line '%s'\n", str);
538 for (i = 0; job2str[i].str; i++)
539 if (!strcmp(pieces[0], job2str[i].str))
543 pool_debug(pool, SOLV_ERROR, "str2job: unknown job '%s'\n", str);
546 job = job2str[i].job;
549 char *flags = pieces[npieces - 1];
551 if (*flags == '[' && flags[strlen(flags) - 1] == ']')
555 flags[strlen(flags) - 1] = ',';
558 for (nf = flags; *nf != ','; nf++)
561 for (i = 0; jobflags2str[i].str; i++)
562 if (!strcmp(flags, jobflags2str[i].str))
564 if (!jobflags2str[i].str)
566 pool_debug(pool, SOLV_ERROR, "str2job: unknown jobflags in '%s'\n", str);
569 job |= jobflags2str[i].flag;
574 if (!strcmp(pieces[1], "pkg"))
578 pool_debug(pool, SOLV_ERROR, "str2job: bad pkg selector in '%s'\n", str);
581 job |= SOLVER_SOLVABLE;
582 what = testcase_str2solvid(pool, pieces[2]);
585 pool_debug(pool, SOLV_ERROR, "str2job: unknown package '%s'\n", pieces[2]);
589 else if (!strcmp(pieces[1], "name") || !strcmp(pieces[1], "provides"))
591 /* join em again for dep2str... */
593 for (sp = pieces[2]; sp < pieces[npieces - 1]; sp++)
596 what = testcase_str2dep(pool, pieces[2]);
597 if (pieces[1][0] == 'n')
598 job |= SOLVER_SOLVABLE_NAME;
600 job |= SOLVER_SOLVABLE_PROVIDES;
602 else if (!strcmp(pieces[1], "oneof"))
605 job |= SOLVER_SOLVABLE_ONE_OF;
607 if (npieces > 3 && strcmp(pieces[2], "nothing") != 0)
609 for (i = 2; i < npieces; i++)
611 Id p = testcase_str2solvid(pool, pieces[i]);
614 pool_debug(pool, SOLV_ERROR, "str2job: unknown package '%s'\n", pieces[i]);
621 what = pool_queuetowhatprovides(pool, &q);
624 else if (!strcmp(pieces[1], "repo"))
629 pool_debug(pool, SOLV_ERROR, "str2job: bad line '%s'\n", str);
632 repo = testcase_str2repo(pool, pieces[2]);
635 pool_debug(pool, SOLV_ERROR, "str2job: unknown repo '%s'\n", pieces[2]);
638 job |= SOLVER_SOLVABLE_REPO;
641 else if (!strcmp(pieces[1], "all"))
643 if (npieces != 3 && strcmp(pieces[2], "packages") != 0)
645 pool_debug(pool, SOLV_ERROR, "str2job: bad line '%s'\n", str);
648 job |= SOLVER_SOLVABLE_ALL;
653 pool_debug(pool, SOLV_ERROR, "str2job: unknown selection in '%s'\n", str);
661 writedeps(Repo *repo, FILE *fp, const char *tag, Id key, Solvable *s, Offset off)
663 Pool *pool = repo->pool;
670 dp = repo->idarraydata + off;
672 while ((id = *dp++) != 0)
674 if (key == SOLVABLE_REQUIRES && id == SOLVABLE_PREREQMARKER)
677 fprintf(fp, "-%s\n", tag);
682 if (key == SOLVABLE_PROVIDES && id == SOLVABLE_FILEMARKER)
687 idstr = pool_dep2str(pool, id);
690 Reldep *rd = GETRELDEP(pool, id);
691 if (key == SOLVABLE_CONFLICTS && rd->flags == REL_NAMESPACE && rd->name == NAMESPACE_OTHERPROVIDERS)
693 if (!strncmp(idstr, "namespace:", 10))
696 if (key == SOLVABLE_SUPPLEMENTS)
698 if (rd->flags == REL_NAMESPACE && rd->name == NAMESPACE_FILESYSTEM)
700 if (!strncmp(idstr, "namespace:", 10))
703 else if (rd->flags == REL_NAMESPACE && rd->name == NAMESPACE_MODALIAS)
705 if (!strncmp(idstr, "namespace:", 10))
708 else if (rd->flags == REL_AND)
710 /* either packageand chain or modalias */
712 if (ISRELDEP(rd->evr))
714 Reldep *mrd = GETRELDEP(pool, rd->evr);
715 if (mrd->flags == REL_NAMESPACE && mrd->name == NAMESPACE_MODALIAS)
717 idstr = pool_tmpjoin(pool, "modalias(", pool_dep2str(pool, rd->name), ":");
718 idstr = pool_tmpappend(pool, idstr, pool_dep2str(pool, mrd->evr), ")");
720 else if (mrd->flags >= 8)
725 /* must be and chain */
726 idstr = pool_dep2str(pool, rd->evr);
732 rd = GETRELDEP(pool, id);
733 if (rd->flags != REL_AND)
735 idstr = pool_tmpjoin(pool, pool_dep2str(pool, rd->evr), ":", idstr);
737 idstr = pool_tmpjoin(pool, pool_dep2str(pool, id), ":", idstr);
738 idstr = pool_tmpjoin(pool, "packageand(", idstr, ")");
741 else if (rd->flags >= 8)
747 fprintf(fp, "+%s\n", tag);
750 fprintf(fp, "%s\n", idstr);
752 if (key == SOLVABLE_PROVIDES)
754 /* add the filelist */
756 dataiterator_init(&di, pool, repo, s - pool->solvables, SOLVABLE_FILELIST, 0, 0);
757 while (dataiterator_step(&di))
759 const char *s = repodata_dir2str(di.data, di.kv.id, di.kv.str);
762 Id id = pool_str2id(pool, s, 0);
765 for (dp = prvdp; *dp; dp++)
769 continue; /* already included */
774 fprintf(fp, "+%s", tag);
777 fprintf(fp, "%s\n", s);
781 fprintf(fp, "-%s\n", tag);
785 testcase_write_susetags(Repo *repo, FILE *fp)
787 Pool *pool = repo->pool;
797 unsigned int medianr;
802 fprintf(fp, "=Ver: 2.0\n");
803 FOR_REPO_SOLVABLES(repo, p, s)
805 name = pool_id2str(pool, s->name);
806 evr = pool_id2str(pool, s->evr);
807 arch = pool_id2str(pool, s->arch);
808 release = strrchr(evr, '-');
810 release = evr + strlen(evr);
811 fprintf(fp, "=Pkg: %s %.*s %s %s\n", name, release - evr, evr, *release && release[1] ? release + 1 : "0", arch);
812 tmp = solvable_lookup_str(s, SOLVABLE_SUMMARY);
814 fprintf(fp, "=Sum: %s\n", tmp);
816 chksum = solvable_lookup_checksum(s, SOLVABLE_CHECKSUM, &chksumtype);
818 fprintf(fp, "=Cks: %s %s\n", solv_chksum_type2str(chksumtype), chksum);
820 writedeps(repo, fp, "Req:", SOLVABLE_REQUIRES, s, s->requires);
821 writedeps(repo, fp, "Prv:", SOLVABLE_PROVIDES, s, s->provides);
822 writedeps(repo, fp, "Obs:", SOLVABLE_OBSOLETES, s, s->obsoletes);
823 writedeps(repo, fp, "Con:", SOLVABLE_CONFLICTS, s, s->conflicts);
824 writedeps(repo, fp, "Rec:", SOLVABLE_RECOMMENDS, s, s->recommends);
825 writedeps(repo, fp, "Sup:", SOLVABLE_SUPPLEMENTS, s, s->supplements);
826 writedeps(repo, fp, "Sug:", SOLVABLE_SUGGESTS, s, s->suggests);
827 writedeps(repo, fp, "Enh:", SOLVABLE_ENHANCES, s, s->enhances);
829 tmp = solvable_lookup_str(s, SOLVABLE_GROUP);
831 fprintf(fp, "=Grp: %s\n", tmp);
832 tmp = solvable_lookup_str(s, SOLVABLE_LICENSE);
834 fprintf(fp, "=Lic: %s\n", tmp);
837 fprintf(fp, "=Vnd: %s\n", pool_id2str(pool, s->vendor));
839 type = solvable_lookup_type(s, SOLVABLE_SOURCENAME);
842 if (type != REPOKEY_TYPE_VOID)
843 name = solvable_lookup_str(s, SOLVABLE_SOURCENAME);
844 type = solvable_lookup_type(s, SOLVABLE_SOURCEEVR);
847 if (type != REPOKEY_TYPE_VOID)
848 evr = solvable_lookup_str(s, SOLVABLE_SOURCEEVR);
849 release = strrchr(evr, '-');
851 release = evr + strlen(evr);
852 fprintf(fp, "=Src: %s %.*s %s %s\n", name, release - evr, evr, *release && release[1] ? release + 1 : "0", solvable_lookup_str(s, SOLVABLE_SOURCEARCH));
856 ti = solvable_lookup_num(s, SOLVABLE_BUILDTIME, 0);
858 fprintf(fp, "=Tim: %u\n", ti);
860 tmp = solvable_get_location(s, &medianr);
863 const char *base = strrchr(tmp, '/');
865 fprintf(fp, "=Loc: %d %s\n", medianr, tmp);
866 else if (strlen(arch) == base - tmp && !strncmp(tmp, arch, base - tmp))
867 fprintf(fp, "=Loc: %d %s\n", medianr, base + 1);
869 fprintf(fp, "=Loc: %d %s %.*s\n", medianr, base + 1, base - tmp, tmp);
877 testcase_getsolverflags(Solver *solv)
879 Pool *pool = solv->pool;
882 for (i = 0; solverflags2str[i].str; i++)
884 v = solver_get_flag(solv, solverflags2str[i].flag);
885 if (v == solverflags2str[i].def)
887 str = pool_tmpappend(pool, str, v ? " " : " !", solverflags2str[i].str);
889 return str ? str + 1 : "";
893 testcase_setsolverflags(Solver *solv, const char *str)
895 const char *p = str, *s;
899 while (*p == ' ' || *p == '\t' || *p == ',')
910 while (*p && *p != ' ' && *p != '\t' && *p != ',')
912 for (i = 0; solverflags2str[i].str; i++)
913 if (!strncmp(solverflags2str[i].str, s, p - s) && solverflags2str[i].str[p - s] == 0)
915 if (!solverflags2str[i].str)
917 pool_debug(solv->pool, SOLV_ERROR, "setsolverflags: unknown flag '%.*s'\n", p - s, s);
920 solver_set_flag(solv, solverflags2str[i].flag, v);
926 testcase_resetsolverflags(Solver *solv)
929 for (i = 0; solverflags2str[i].str; i++)
930 solver_set_flag(solv, solverflags2str[i].flag, solverflags2str[i].def);
934 testcase_ruleid(Solver *solv, Id rid)
940 const unsigned char *md5;
946 solver_ruleliterals(solv, rid, &q);
947 for (i = 0; i < q.count; i++)
949 Id p = q.elements[i];
950 s = testcase_solvid2str(solv->pool, p > 0 ? p : -p);
952 s = pool_tmpjoin(solv->pool, "!", s, 0);
953 strqueue_push(&sq, s);
956 strqueue_sort_u(&sq);
957 chk = solv_chksum_create(REPOKEY_TYPE_MD5);
958 for (i = 0; i < sq.nstr; i++)
959 solv_chksum_add(chk, sq.str[i], strlen(sq.str[i]) + 1);
960 md5 = solv_chksum_get(chk, &md5l);
961 s = pool_bin2hex(solv->pool, md5, md5l);
962 chk = solv_chksum_free(chk, 0);
968 testcase_problemid(Solver *solv, Id problem)
973 const unsigned char *md5;
977 /* we build a hash of all rules that define the problem */
980 solver_findallproblemrules(solv, problem, &q);
981 for (i = 0; i < q.count; i++)
982 strqueue_push(&sq, testcase_ruleid(solv, q.elements[i]));
984 strqueue_sort_u(&sq);
985 chk = solv_chksum_create(REPOKEY_TYPE_MD5);
986 for (i = 0; i < sq.nstr; i++)
987 solv_chksum_add(chk, sq.str[i], strlen(sq.str[i]) + 1);
988 md5 = solv_chksum_get(chk, &md5l);
989 s = pool_bin2hex(solv->pool, md5, 4);
990 chk = solv_chksum_free(chk, 0);
996 testcase_solutionid(Solver *solv, Id problem, Id solution)
1000 const unsigned char *md5;
1004 intid = solver_solutionelement_internalid(solv, problem, solution);
1005 /* internal stuff! handle with care! */
1009 s = testcase_job2str(solv->pool, solv->job.elements[-intid - 1], solv->job.elements[-intid]);
1014 s = testcase_ruleid(solv, intid);
1016 chk = solv_chksum_create(REPOKEY_TYPE_MD5);
1017 solv_chksum_add(chk, s, strlen(s) + 1);
1018 md5 = solv_chksum_get(chk, &md5l);
1019 s = pool_bin2hex(solv->pool, md5, 4);
1020 chk = solv_chksum_free(chk, 0);
1024 static struct class2str {
1028 { SOLVER_TRANSACTION_ERASE, "erase" },
1029 { SOLVER_TRANSACTION_INSTALL, "install" },
1030 { SOLVER_TRANSACTION_REINSTALLED, "reinstall" },
1031 { SOLVER_TRANSACTION_DOWNGRADED, "downgrade" },
1032 { SOLVER_TRANSACTION_CHANGED, "change" },
1033 { SOLVER_TRANSACTION_UPGRADED, "upgrade" },
1034 { SOLVER_TRANSACTION_OBSOLETED, "obsolete" },
1035 { SOLVER_TRANSACTION_MULTIINSTALL, "multiinstall" },
1036 { SOLVER_TRANSACTION_MULTIREINSTALL, "multireinstall" },
1041 testcase_solverresult(Solver *solv)
1043 Pool *pool = solv->pool;
1049 char *probprefix, *solprefix, *result;
1050 int problem, solution, element;
1055 trans = solver_create_transaction(solv);
1057 for (i = 0; class2str[i].str; i++)
1060 transaction_classify_pkgs(trans, 0, class2str[i].class, 0, 0, &q);
1061 for (j = 0; j < q.count; j++)
1065 if (pool->installed && pool->solvables[p].repo == pool->installed)
1066 op = transaction_obs_pkg(trans, p);
1067 s = pool_tmpjoin(pool, class2str[i].str, " ", testcase_solvid2str(pool, p));
1069 s = pool_tmpjoin(pool, s, " ", testcase_solvid2str(pool, op));
1070 strqueue_push(&sq, s);
1074 transaction_free(trans);
1075 pcnt = solver_problem_count(solv);
1076 for (problem = 1; problem <= pcnt; problem++)
1078 Id rid, from, to, dep;
1079 SolverRuleinfo rinfo;
1080 rid = solver_findproblemrule(solv, problem);
1081 s = testcase_problemid(solv, problem);
1082 probprefix = solv_dupjoin("problem ", s, 0);
1083 rinfo = solver_ruleinfo(solv, rid, &from, &to, &dep);
1084 s = pool_tmpjoin(pool, probprefix, " info ", solver_problemruleinfo2str(solv, rinfo, from, to, dep));
1085 strqueue_push(&sq, s);
1086 scnt = solver_solution_count(solv, problem);
1087 for (solution = 1; solution <= scnt; solution++)
1089 s = testcase_solutionid(solv, problem, solution);
1090 solprefix = solv_dupjoin(probprefix, " solution ", s);
1092 while ((element = solver_next_solutionelement(solv, problem, solution, element, &p, &op)) != 0)
1094 if (p == SOLVER_SOLUTION_JOB)
1095 s = pool_tmpjoin(pool, solprefix, " deljob ", testcase_job2str(pool, solv->job.elements[op - 1], solv->job.elements[op]));
1096 else if (p > 0 && op == 0)
1097 s = pool_tmpjoin(pool, solprefix, " erase ", testcase_solvid2str(pool, p));
1098 else if (p > 0 && op > 0)
1100 s = pool_tmpjoin(pool, solprefix, " replace ", testcase_solvid2str(pool, p));
1101 s = pool_tmpappend(pool, s, " ", testcase_solvid2str(pool, op));
1103 else if (p < 0 && op > 0)
1104 s = pool_tmpjoin(pool, solprefix, " allow ", testcase_solvid2str(pool, op));
1106 s = pool_tmpjoin(pool, solprefix, " unknown", 0);
1107 strqueue_push(&sq, s);
1109 solv_free(solprefix);
1111 solv_free(probprefix);
1115 result = strqueue_join(&sq);
1122 testcase_write(Solver *solv, char *dir, int withresult)
1124 Pool *pool = solv->pool;
1134 if (mkdir(dir, 0777) && errno != EEXIST)
1136 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: could not create directory '%s'\n", dir);
1140 FOR_REPOS(repoid, repo)
1142 const char *name = testcase_repoid2str(pool, repoid);
1144 if (repo->subpriority)
1145 sprintf(priobuf, "%d.%d", repo->priority, repo->subpriority);
1147 sprintf(priobuf, "%d", repo->priority);
1148 out = pool_tmpjoin(pool, name, ".repo", ".gz");
1149 cmd = pool_tmpjoin(pool, "repo ", name, " ");
1150 cmd = pool_tmpappend(pool, cmd, priobuf, " ");
1151 cmd = pool_tmpappend(pool, cmd, "susetags ", out);
1152 strqueue_push(&sq, cmd);
1153 out = pool_tmpjoin(pool, dir, "/", out);
1154 if (!(fp = solv_xfopen(out, "w")))
1156 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: could not open '%s' for writing\n", out);
1160 testcase_write_susetags(repo, fp);
1163 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: write error\n");
1168 /* hmm, this is not optimal... we currently search for the lowest score */
1171 for (i = 0; i < pool->lastarch; i++)
1173 if (pool->id2arch[i] == 1 && !lowscore)
1175 if (pool->id2arch[i] > 0x10000 && (!lowscore || pool->id2arch[i] < lowscore))
1178 lowscore = pool->id2arch[i];
1181 cmd = pool_tmpjoin(pool, "system ", pool_id2str(pool, arch), pool->disttype == DISTTYPE_DEB ? " deb" : " rpm");
1182 if (pool->installed)
1183 cmd = pool_tmpappend(pool, cmd, " ", testcase_repoid2str(pool, pool->installed->repoid));
1184 strqueue_push(&sq, cmd);
1186 if (pool->vendorclasses)
1189 for (i = 0; pool->vendorclasses[i]; i++)
1191 cmd = pool_tmpappend(pool, cmd ? cmd : "vendorclass", " ", pool->vendorclasses[i]);
1192 if (!pool->vendorclasses[i + 1])
1194 strqueue_push(&sq, cmd);
1201 s = testcase_getsolverflags(solv);
1204 cmd = pool_tmpjoin(pool, "solverflags ", s, 0);
1205 strqueue_push(&sq, cmd);
1208 /* now dump all the ns callback values we know */
1209 if (pool->nscallback)
1213 for (rid = 1; rid < pool->nrels; rid++)
1215 Reldep *rd = pool->rels + rid;
1216 if (rd->flags != REL_NAMESPACE || rd->name == NAMESPACE_OTHERPROVIDERS)
1218 /* check if we evaluated it, also skip empty results */
1219 if (!(d = pool->whatprovides_rel[rid]) || !pool->whatprovidesdata[d])
1221 cmd = pool_tmpjoin(pool, "namespace ", pool_id2str(pool, rd->name), "(");
1222 cmd = pool_tmpappend(pool, cmd, pool_id2str(pool, rd->evr), ")");
1223 for (; pool->whatprovidesdata[d]; d++)
1224 cmd = pool_tmpappend(pool, cmd, " ", testcase_solvid2str(pool, pool->whatprovidesdata[d]));
1225 strqueue_push(&sq, cmd);
1229 for (i = 0; i < solv->job.count; i += 2)
1231 cmd = (char *)testcase_job2str(pool, solv->job.elements[i], solv->job.elements[i + 1]);
1232 cmd = pool_tmpjoin(pool, "job ", cmd, 0);
1233 strqueue_push(&sq, cmd);
1239 out = pool_tmpjoin(pool, dir, "/", "solver.result");
1240 if (!(fp = fopen(out, "w")))
1242 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: could not open '%s' for writing\n", out);
1246 result = testcase_solverresult(solv);
1247 if (fwrite(result, strlen(result), 1, fp) != 1)
1249 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: write error\n");
1257 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: write error\n");
1261 cmd = pool_tmpjoin(pool, "result ", "solver.result", 0);
1262 strqueue_push(&sq, cmd);
1265 cmd = strqueue_join(&sq);
1266 out = pool_tmpjoin(pool, dir, "/", "testcase.t");
1267 if (!(fp = fopen(out, "w")))
1269 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: could not open '%s' for writing\n", out);
1273 if (fwrite(cmd, strlen(cmd), 1, fp) != 1)
1275 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: write error\n");
1281 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: write error\n");
1291 testcase_read(Pool *pool, FILE *fp, char *testcase, Queue *job, char **resultp)
1296 char *testcasedir, *s;
1303 if (!fp && !(fp = fopen(testcase, "r")))
1305 pool_debug(pool, SOLV_ERROR, "testcase_read: could not open '%s'\n", testcase);
1308 testcasedir = solv_strdup(testcase);
1309 if ((s = strchr(testcasedir, '/')) != 0)
1314 buf = solv_malloc(bufl);
1319 if (bufp - buf + 16 > bufl)
1322 buf = solv_realloc(buf, bufl + 512);
1326 if (!fgets(bufp, bufl - (bufp - buf), fp))
1330 if (!l || buf[l - 1] != '\n')
1337 while (*s && (*s == ' ' || *s == '\t'))
1339 if (!*s || *s == '#')
1342 /* split it in pieces */
1345 while (*s == ' ' || *s == '\t')
1349 pieces = solv_extend(pieces, npieces, 1, sizeof(*pieces), 7);
1350 pieces[npieces++] = s;
1351 while (*s && *s != ' ' && *s != '\t')
1356 pieces = solv_extend(pieces, npieces, 1, sizeof(*pieces), 7);
1357 pieces[npieces] = 0;
1358 if (!strcmp(pieces[0], "repo") && npieces >= 4)
1360 Repo *repo = repo_create(pool, pieces[1]);
1366 if (sscanf(pieces[2], "%d.%d", &prio, &subprio) != 2)
1369 prio = atoi(pieces[2]);
1371 repo->priority = prio;
1372 repo->subpriority = subprio;
1373 rdata = pool_tmpjoin(pool, testcasedir, pieces[4], 0);
1374 if ((rfp = solv_xfopen(rdata, "r")) == 0)
1376 pool_debug(pool, SOLV_ERROR, "testcase_read: could not open '%s'\n", rdata);
1378 else if (!strcmp(pieces[3], "susetags"))
1380 repo_add_susetags(repo, rfp, 0, 0, 0);
1386 pool_debug(pool, SOLV_ERROR, "testcase_read: unknown repo type for repo '%s'\n", repo->name);
1389 else if (!strcmp(pieces[0], "system") && npieces >= 3)
1392 pool_setarch(pool, pieces[1]);
1395 Repo *repo = testcase_str2repo(pool, pieces[3]);
1397 pool_debug(pool, SOLV_ERROR, "testcase_read: system: unknown repo '%s'\n", pieces[3]);
1399 pool_set_installed(pool, repo);
1402 else if (!strcmp(pieces[0], "job") && npieces > 1)
1408 pool_addfileprovides(pool);
1409 pool_createwhatprovides(pool);
1413 for (sp = pieces[1]; sp < pieces[npieces - 1]; sp++)
1416 how = testcase_str2job(pool, pieces[1], &what);
1417 if (how >= 0 && job)
1418 queue_push2(job, how, what);
1420 else if (!strcmp(pieces[0], "vendorclass") && npieces > 1)
1422 pool_addvendorclass(pool, (const char **)(pieces + 1));
1424 else if (!strcmp(pieces[0], "namespace") && npieces > 1)
1426 int i = strlen(pieces[1]);
1427 s = strchr(pieces[1], '(');
1428 if (!s && pieces[1][i - 1] != ')')
1430 pool_debug(pool, SOLV_ERROR, "testcase_read: bad namespace '%s'\n", pieces[1]);
1438 pieces[1][i - 1] = 0;
1439 name = pool_str2id(pool, pieces[1], 1);
1440 evr = pool_str2id(pool, s + 1, 1);
1442 pieces[1][i - 1] = ')';
1443 id = pool_rel2id(pool, name, evr, REL_NAMESPACE, 1);
1444 for (i = 2; i < npieces; i++)
1445 queue_push(&q, testcase_str2solvid(pool, pieces[i]));
1446 /* now do the callback */
1449 pool_addfileprovides(pool);
1450 pool_createwhatprovides(pool);
1453 pool->whatprovides_rel[GETRELID(id)] = pool_queuetowhatprovides(pool, &q);
1457 else if (!strcmp(pieces[0], "solverflags") && npieces > 1)
1462 solv = solver_create(pool);
1463 testcase_resetsolverflags(solv);
1465 for (i = 1; i < npieces; i++)
1466 testcase_setsolverflags(solv, pieces[i]);
1468 else if (!strcmp(pieces[0], "result") && npieces > 1)
1472 rdata = pool_tmpjoin(pool, testcasedir, pieces[1], 0);
1473 if (!strcmp(pieces[1], "<inline>"))
1476 rfp = fopen(rdata, "r");
1479 pool_debug(pool, SOLV_ERROR, "testcase_read: could not open '%s'\n", rdata);
1483 /* slurp it in... */
1484 char *result = solv_malloc(1024);
1490 if (rp - result + 256 >= resultl)
1492 resultl = rp - result;
1493 result = solv_realloc(result, resultl + 1024);
1494 rp = result + resultl;
1499 if (!fgets(rp, resultl - (rp - result), fp))
1504 if (rl && (rp == result || rp[-1] == '\n'))
1506 if (rl > 1 && rp[0] == '#' && rp[1] == '>')
1508 memmove(rp, rp + 2, rl - 2);
1513 while (rl + 16 > bufl)
1515 buf = solv_realloc(buf, bufl + 512);
1518 memmove(buf, rp, rl);
1519 if (buf[rl - 1] == '\n')
1531 rl = fread(rp, 1, resultl - (rp - result), rfp);
1549 pool_debug(pool, SOLV_ERROR, "testcase_read: cannot parse command '%s'\n", pieces[0]);
1552 buf = solv_free(buf);
1553 pieces = solv_free(pieces);
1554 solv_free(testcasedir);
1557 pool_addfileprovides(pool);
1558 pool_createwhatprovides(pool);
1562 solv = solver_create(pool);
1563 testcase_resetsolverflags(solv);
1571 testcase_resultdiff(char *result1, char *result2)
1573 Strqueue sq1, sq2, osq;
1575 strqueue_init(&sq1);
1576 strqueue_init(&sq2);
1577 strqueue_init(&osq);
1578 strqueue_split(&sq1, result1);
1579 strqueue_split(&sq2, result2);
1580 strqueue_sort(&sq1);
1581 strqueue_sort(&sq2);
1582 strqueue_diff(&sq1, &sq2, &osq);
1583 r = osq.nstr ? strqueue_join(&osq) : 0;
1584 strqueue_free(&sq1);
1585 strqueue_free(&sq2);
1586 strqueue_free(&osq);