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"
22 #include "repo_solv.h"
24 #include "solverdebug.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_NOOBSOLETES, "noobsoletes" },
42 { SOLVER_LOCK, "lock" },
43 { SOLVER_DISTUPGRADE, "distupgrade" },
44 { SOLVER_VERIFY, "verify" },
45 { SOLVER_DROP_ORPHANED, "droporphaned" },
46 { SOLVER_USERINSTALLED, "userinstalled" },
50 static struct jobflags2str {
54 { SOLVER_WEAK, "weak" },
55 { SOLVER_ESSENTIAL, "essential" },
56 { SOLVER_CLEANDEPS, "cleandeps" },
57 { SOLVER_SETEV, "setev" },
58 { SOLVER_SETEVR, "setevr" },
59 { SOLVER_SETARCH, "setarch" },
60 { SOLVER_SETVENDOR, "setvendor" },
61 { SOLVER_SETREPO, "setrepo" },
62 { SOLVER_NOAUTOSET, "noautoset" },
66 static struct resultflags2str {
69 } resultflags2str[] = {
70 { TESTCASE_RESULT_TRANSACTION, "transaction" },
71 { TESTCASE_RESULT_PROBLEMS, "problems" },
72 { TESTCASE_RESULT_ORPHANED, "orphaned" },
73 { TESTCASE_RESULT_RECOMMENDED, "recommended" },
74 { TESTCASE_RESULT_UNNEEDED, "unneeded" },
78 static struct solverflags2str {
82 } solverflags2str[] = {
83 { SOLVER_FLAG_ALLOW_DOWNGRADE, "allowdowngrade", 0 },
84 { SOLVER_FLAG_ALLOW_NAMECHANGE, "allownamechange", 1 },
85 { SOLVER_FLAG_ALLOW_ARCHCHANGE, "allowarchchange", 0 },
86 { SOLVER_FLAG_ALLOW_VENDORCHANGE, "allowvendorchange", 0 },
87 { SOLVER_FLAG_ALLOW_UNINSTALL, "allowuninstall", 0 },
88 { SOLVER_FLAG_NO_UPDATEPROVIDE, "noupdateprovide", 0 },
89 { SOLVER_FLAG_SPLITPROVIDES, "splitprovides", 0 },
90 { SOLVER_FLAG_IGNORE_RECOMMENDED, "ignorerecommended", 0 },
91 { SOLVER_FLAG_ADD_ALREADY_RECOMMENDED, "addalreadyrecommended", 0 },
92 { SOLVER_FLAG_NO_INFARCHCHECK, "noinfarchcheck", 0 },
93 { SOLVER_FLAG_KEEP_EXPLICIT_OBSOLETES, "keepexplicitobsoletes", 0 },
97 static struct poolflags2str {
101 } poolflags2str[] = {
102 { POOL_FLAG_PROMOTEEPOCH, "promoteepoch", 0 },
103 { POOL_FLAG_FORBIDSELFCONFLICTS, "forbidselfconflicts", 0 },
104 { POOL_FLAG_OBSOLETEUSESPROVIDES, "obsoleteusesprovides", 0 },
105 { POOL_FLAG_IMPLICITOBSOLETEUSESPROVIDES, "implicitobsoleteusesprovides", 0 },
106 { POOL_FLAG_OBSOLETEUSESCOLORS, "obsoleteusescolors", 0 },
107 { POOL_FLAG_NOINSTALLEDOBSOLETES, "noinstalledobsoletes", 0 },
108 { POOL_FLAG_HAVEDISTEPOCH, "havedistepoch", 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;
343 const char *n, *e, *a;
346 if (p == SYSTEMSOLVABLE)
348 n = pool_id2str(pool, s->name);
349 e = pool_id2str(pool, s->evr);
350 a = pool_id2str(pool, s->arch);
351 str = pool_alloctmpspace(pool, strlen(n) + strlen(e) + strlen(a) + 3);
352 sprintf(str, "%s-%s.%s", n, e, a);
354 return pool_tmpappend(pool, str, "@", 0);
358 char *str2 = pool_tmpappend(pool, str, "@", s->repo->name);
360 if (str2[l] == ' ' || str2[l] == '\t')
364 sprintf(buf, "@#%d", s->repo->repoid);
365 return pool_tmpappend(pool, str, buf, 0);
369 testcase_str2repo(Pool *pool, const char *str)
373 if (str[0] == '#' && (str[1] >= '0' && str[1] <= '9'))
377 for (j = 1; str[j] >= '0' && str[j] <= '9'; j++)
378 repoid = repoid * 10 + (str[j] - '0');
379 if (!str[j] && repoid > 0 && repoid < pool->nrepos)
380 repo = pool_id2repo(pool, repoid);
384 FOR_REPOS(repoid, repo)
389 l = strlen(repo->name);
390 for (i = 0; i < l; i++)
392 int c = repo->name[i];
393 if (c == ' ' || c == '\t')
398 if (i == l && !str[l])
401 if (repoid >= pool->nrepos)
408 testcase_str2solvid(Pool *pool, const char *str)
410 int i, l = strlen(str);
417 if (*str == '@' && !strcmp(str, "@SYSTEM"))
418 return SYSTEMSOLVABLE;
420 for (i = l - 1; i >= 0; i--)
421 if (str[i] == '@' && (repo = testcase_str2repo(pool, str + i + 1)) != 0)
426 /* now find the arch (if present) */
428 for (i = repostart - 1; i > 0; i--)
431 arch = pool_strn2id(pool, str + i + 1, repostart - (i + 1), 0);
436 /* now find the name */
437 for (i = repostart - 1; i > 0; i--)
441 Id nid, evrid, p, pp;
442 nid = pool_strn2id(pool, str, i, 0);
445 evrid = pool_strn2id(pool, str + i + 1, repostart - (i + 1), 0);
448 FOR_PROVIDES(p, pp, nid)
450 Solvable *s = pool->solvables + p;
451 if (s->name != nid || s->evr != evrid)
453 if (repo && s->repo != repo)
455 if (arch && s->arch != arch)
465 testcase_job2str(Pool *pool, Id how, Id what)
472 Id select = how & SOLVER_SELECTMASK;
474 for (i = 0; job2str[i].str; i++)
475 if ((how & SOLVER_JOBMASK) == job2str[i].job)
477 jobstr = job2str[i].str ? job2str[i].str : "unknown";
478 if (select == SOLVER_SOLVABLE)
481 pkgstr = testcase_solvid2str(pool, what);
483 else if (select == SOLVER_SOLVABLE_NAME)
486 pkgstr = pool_dep2str(pool, what);
488 else if (select == SOLVER_SOLVABLE_PROVIDES)
490 selstr = " provides ";
491 pkgstr = pool_dep2str(pool, what);
493 else if (select == SOLVER_SOLVABLE_ONE_OF)
498 while ((p = pool->whatprovidesdata[what++]) != 0)
500 const char *s = testcase_solvid2str(pool, p);
503 pkgstr = pool_tmpappend(pool, pkgstr, " ", s);
504 pool_freetmpspace(pool, s);
512 else if (select == SOLVER_SOLVABLE_REPO)
514 Repo *repo = pool_id2repo(pool, what);
519 sprintf(buf, "#%d", repo->repoid);
520 pkgstr = pool_tmpjoin(pool, buf, 0, 0);
523 pkgstr = pool_tmpjoin(pool, repo->name, 0, 0);
525 else if (select == SOLVER_SOLVABLE_ALL)
532 selstr = " unknown ";
535 ret = pool_tmpjoin(pool, jobstr, selstr, pkgstr);
537 ret = pool_tmpappend(pool, ret, " ", 0);
538 for (i = 0; jobflags2str[i].str; i++)
539 if ((how & jobflags2str[i].flag) != 0)
540 ret = pool_tmpappend(pool, ret, ",", jobflags2str[i].str);
546 ret = pool_tmpappend(pool, ret, "]", 0);
552 testcase_str2job(Pool *pool, const char *str, Id *whatp)
562 /* so we can patch it */
563 s = pool_tmpjoin(pool, str, 0, 0);
564 /* split it in pieces */
567 while (*s == ' ' || *s == '\t')
571 pieces = solv_extend(pieces, npieces, 1, sizeof(*pieces), 7);
572 pieces[npieces++] = s;
573 while (*s && *s != ' ' && *s != '\t')
580 pool_debug(pool, SOLV_ERROR, "str2job: bad line '%s'\n", str);
584 for (i = 0; job2str[i].str; i++)
585 if (!strcmp(pieces[0], job2str[i].str))
589 pool_debug(pool, SOLV_ERROR, "str2job: unknown job '%s'\n", str);
592 job = job2str[i].job;
595 char *flags = pieces[npieces - 1];
597 if (*flags == '[' && flags[strlen(flags) - 1] == ']')
601 flags[strlen(flags) - 1] = ',';
604 for (nf = flags; *nf != ','; nf++)
607 for (i = 0; jobflags2str[i].str; i++)
608 if (!strcmp(flags, jobflags2str[i].str))
610 if (!jobflags2str[i].str)
612 pool_debug(pool, SOLV_ERROR, "str2job: unknown jobflags in '%s'\n", str);
615 job |= jobflags2str[i].flag;
620 if (!strcmp(pieces[1], "pkg"))
624 pool_debug(pool, SOLV_ERROR, "str2job: bad pkg selector in '%s'\n", str);
627 job |= SOLVER_SOLVABLE;
628 what = testcase_str2solvid(pool, pieces[2]);
631 pool_debug(pool, SOLV_ERROR, "str2job: unknown package '%s'\n", pieces[2]);
635 else if (!strcmp(pieces[1], "name") || !strcmp(pieces[1], "provides"))
637 /* join em again for dep2str... */
639 for (sp = pieces[2]; sp < pieces[npieces - 1]; sp++)
642 what = testcase_str2dep(pool, pieces[2]);
643 if (pieces[1][0] == 'n')
644 job |= SOLVER_SOLVABLE_NAME;
646 job |= SOLVER_SOLVABLE_PROVIDES;
648 else if (!strcmp(pieces[1], "oneof"))
651 job |= SOLVER_SOLVABLE_ONE_OF;
653 if (npieces > 3 && strcmp(pieces[2], "nothing") != 0)
655 for (i = 2; i < npieces; i++)
657 Id p = testcase_str2solvid(pool, pieces[i]);
660 pool_debug(pool, SOLV_ERROR, "str2job: unknown package '%s'\n", pieces[i]);
667 what = pool_queuetowhatprovides(pool, &q);
670 else if (!strcmp(pieces[1], "repo"))
675 pool_debug(pool, SOLV_ERROR, "str2job: bad line '%s'\n", str);
678 repo = testcase_str2repo(pool, pieces[2]);
681 pool_debug(pool, SOLV_ERROR, "str2job: unknown repo '%s'\n", pieces[2]);
684 job |= SOLVER_SOLVABLE_REPO;
687 else if (!strcmp(pieces[1], "all"))
689 if (npieces != 3 && strcmp(pieces[2], "packages") != 0)
691 pool_debug(pool, SOLV_ERROR, "str2job: bad line '%s'\n", str);
694 job |= SOLVER_SOLVABLE_ALL;
699 pool_debug(pool, SOLV_ERROR, "str2job: unknown selection in '%s'\n", str);
707 writedeps(Repo *repo, FILE *fp, const char *tag, Id key, Solvable *s, Offset off)
709 Pool *pool = repo->pool;
716 dp = repo->idarraydata + off;
718 while ((id = *dp++) != 0)
720 if (key == SOLVABLE_REQUIRES && id == SOLVABLE_PREREQMARKER)
723 fprintf(fp, "-%s\n", tag);
728 if (key == SOLVABLE_PROVIDES && id == SOLVABLE_FILEMARKER)
733 idstr = pool_dep2str(pool, id);
736 Reldep *rd = GETRELDEP(pool, id);
737 if (key == SOLVABLE_CONFLICTS && rd->flags == REL_NAMESPACE && rd->name == NAMESPACE_OTHERPROVIDERS)
739 if (!strncmp(idstr, "namespace:", 10))
742 if (key == SOLVABLE_SUPPLEMENTS)
744 if (rd->flags == REL_NAMESPACE && rd->name == NAMESPACE_FILESYSTEM)
746 if (!strncmp(idstr, "namespace:", 10))
749 else if (rd->flags == REL_NAMESPACE && rd->name == NAMESPACE_MODALIAS)
751 if (!strncmp(idstr, "namespace:", 10))
754 else if (rd->flags == REL_AND)
756 /* either packageand chain or modalias */
758 if (ISRELDEP(rd->evr))
760 Reldep *mrd = GETRELDEP(pool, rd->evr);
761 if (mrd->flags == REL_NAMESPACE && mrd->name == NAMESPACE_MODALIAS)
763 idstr = pool_tmpjoin(pool, "modalias(", pool_dep2str(pool, rd->name), ":");
764 idstr = pool_tmpappend(pool, idstr, pool_dep2str(pool, mrd->evr), ")");
766 else if (mrd->flags >= 8)
771 /* must be and chain */
772 idstr = pool_dep2str(pool, rd->evr);
778 rd = GETRELDEP(pool, id);
779 if (rd->flags != REL_AND)
781 idstr = pool_tmpjoin(pool, pool_dep2str(pool, rd->evr), ":", idstr);
783 idstr = pool_tmpjoin(pool, pool_dep2str(pool, id), ":", idstr);
784 idstr = pool_tmpjoin(pool, "packageand(", idstr, ")");
787 else if (rd->flags >= 8)
793 fprintf(fp, "+%s\n", tag);
796 fprintf(fp, "%s\n", idstr);
798 if (key == SOLVABLE_PROVIDES)
800 /* add the filelist */
802 dataiterator_init(&di, pool, repo, s - pool->solvables, SOLVABLE_FILELIST, 0, 0);
803 while (dataiterator_step(&di))
805 const char *s = repodata_dir2str(di.data, di.kv.id, di.kv.str);
808 Id id = pool_str2id(pool, s, 0);
811 for (dp = prvdp; *dp; dp++)
815 continue; /* already included */
820 fprintf(fp, "+%s", tag);
823 fprintf(fp, "%s\n", s);
827 fprintf(fp, "-%s\n", tag);
831 testcase_write_susetags(Repo *repo, FILE *fp)
833 Pool *pool = repo->pool;
843 fprintf(fp, "=Ver: 2.0\n");
844 FOR_REPO_SOLVABLES(repo, p, s)
846 name = pool_id2str(pool, s->name);
847 evr = pool_id2str(pool, s->evr);
848 arch = pool_id2str(pool, s->arch);
849 release = strrchr(evr, '-');
851 release = evr + strlen(evr);
852 fprintf(fp, "=Pkg: %s %.*s %s %s\n", name, (int)(release - evr), evr, *release && release[1] ? release + 1 : "-", arch);
853 tmp = solvable_lookup_str(s, SOLVABLE_SUMMARY);
855 fprintf(fp, "=Sum: %s\n", tmp);
856 writedeps(repo, fp, "Req:", SOLVABLE_REQUIRES, s, s->requires);
857 writedeps(repo, fp, "Prv:", SOLVABLE_PROVIDES, s, s->provides);
858 writedeps(repo, fp, "Obs:", SOLVABLE_OBSOLETES, s, s->obsoletes);
859 writedeps(repo, fp, "Con:", SOLVABLE_CONFLICTS, s, s->conflicts);
860 writedeps(repo, fp, "Rec:", SOLVABLE_RECOMMENDS, s, s->recommends);
861 writedeps(repo, fp, "Sup:", SOLVABLE_SUPPLEMENTS, s, s->supplements);
862 writedeps(repo, fp, "Sug:", SOLVABLE_SUGGESTS, s, s->suggests);
863 writedeps(repo, fp, "Enh:", SOLVABLE_ENHANCES, s, s->enhances);
865 fprintf(fp, "=Vnd: %s\n", pool_id2str(pool, s->vendor));
866 ti = solvable_lookup_num(s, SOLVABLE_BUILDTIME, 0);
868 fprintf(fp, "=Tim: %u\n", ti);
874 adddep(Repo *repo, Offset olddeps, char *str, Id marker)
876 Id id = *str == '/' ? pool_str2id(repo->pool, str, 1) : testcase_str2dep(repo->pool, str);
877 return repo_addid_dep(repo, olddeps, id, marker);
881 finish_solvable(Pool *pool, Repodata *data, Solvable *s, char *filelist, int nfilelist)
887 for (l = 0; l < nfilelist; l += strlen(filelist + l) + 1)
889 char *p = strrchr(filelist + l, '/');
893 did = repodata_str2dir(data, filelist + l, 1);
896 did = repodata_str2dir(data, "/", 1);
897 repodata_add_dirstr(data, s - pool->solvables, SOLVABLE_FILELIST, did, p);
900 if (s->name && s->arch != ARCH_SRC && s->arch != ARCH_NOSRC)
901 s->provides = repo_addid_dep(s->repo, s->provides, pool_rel2id(pool, s->name, s->evr, REL_EQ, 1), 0);
902 s->supplements = repo_fix_supplements(s->repo, s->provides, s->supplements, 0);
903 s->conflicts = repo_fix_conflicts(s->repo, s->conflicts);
906 /* stripped down version of susetags parser used for testcases */
908 testcase_add_susetags(Repo *repo, FILE *fp, int flags)
910 Pool *pool = repo->pool;
923 data = repo_add_repodata(repo, flags);
928 line = solv_malloc(aline);
932 if (linep - line + 16 > aline)
934 aline = linep - line;
935 line = solv_realloc(line, aline + 512);
936 linep = line + aline;
939 if (!fgets(linep, aline - (linep - line), fp))
941 linep += strlen(linep);
942 if (linep == line || linep[-1] != '\n')
945 linep = line + intag;
948 if (line[intag] == '-' && !strncmp(line + 1, line + intag + 1, intag - 2))
955 else if (line[0] == '+' && line[1] && line[1] != ':')
957 char *tagend = strchr(line, ':');
962 intag = tagend + 2 - line;
963 linep = line + intag;
966 if (*line != '=' || !line[1] || !line[2] || !line[3] || line[4] != ':')
968 tag = line[1] << 16 | line[2] << 8 | line[3];
971 case 'P' << 16 | 'k' << 8 | 'g':
973 finish_solvable(pool, data, s, filelist, nfilelist);
975 if (split(line + 5, sp, 5) != 4)
977 s = pool_id2solvable(pool, repo_add_solvable(repo));
978 s->name = pool_str2id(pool, sp[0], 1);
979 /* join back version and release */
980 if (sp[2] && !(sp[2][0] == '-' && !sp[2][1]))
982 s->evr = makeevr(pool, sp[1]);
983 s->arch = pool_str2id(pool, sp[3], 1);
985 case 'S' << 16 | 'u' << 8 | 'm':
986 repodata_set_str(data, s - pool->solvables, SOLVABLE_SUMMARY, line + 6);
988 case 'V' << 16 | 'n' << 8 | 'd':
989 s->vendor = pool_str2id(pool, line + 6, 1);
991 case 'T' << 16 | 'i' << 8 | 'm':
994 repodata_set_num(data, s - pool->solvables, SOLVABLE_BUILDTIME, t);
996 case 'R' << 16 | 'e' << 8 | 'q':
997 s->requires = adddep(repo, s->requires, line + 6, -SOLVABLE_PREREQMARKER);
999 case 'P' << 16 | 'r' << 8 | 'q':
1000 s->requires = adddep(repo, s->requires, line + 6, SOLVABLE_PREREQMARKER);
1002 case 'P' << 16 | 'r' << 8 | 'v':
1005 int l = strlen(line + 6) + 1;
1006 if (nfilelist + l > afilelist)
1008 afilelist = nfilelist + l + 512;
1009 filelist = solv_realloc(filelist, afilelist);
1011 memcpy(filelist + nfilelist, line + 6, l);
1018 for (l = 0; l < nfilelist; l += strlen(filelist + l) + 1)
1019 s->provides = repo_addid_dep(repo, s->provides, pool_str2id(pool, filelist + l, 1), 0);
1022 s->provides = adddep(repo, s->provides, line + 6, 0);
1024 case 'O' << 16 | 'b' << 8 | 's':
1025 s->obsoletes = adddep(repo, s->obsoletes, line + 6, 0);
1027 case 'C' << 16 | 'o' << 8 | 'n':
1028 s->conflicts = adddep(repo, s->conflicts, line + 6, 0);
1030 case 'R' << 16 | 'e' << 8 | 'c':
1031 s->recommends = adddep(repo, s->recommends, line + 6, 0);
1033 case 'S' << 16 | 'u' << 8 | 'p':
1034 s->supplements = adddep(repo, s->supplements, line + 6, 0);
1036 case 'S' << 16 | 'u' << 8 | 'g':
1037 s->suggests = adddep(repo, s->suggests, line + 6, 0);
1039 case 'E' << 16 | 'n' << 8 | 'h':
1040 s->enhances = adddep(repo, s->enhances, line + 6, 0);
1047 finish_solvable(pool, data, s, filelist, nfilelist);
1049 solv_free(filelist);
1050 repodata_free_dircache(data);
1051 if (!(flags & REPO_NO_INTERNALIZE))
1052 repodata_internalize(data);
1057 testcase_getpoolflags(Pool *pool)
1059 const char *str = 0;
1061 for (i = 0; poolflags2str[i].str; i++)
1063 v = pool_get_flag(pool, poolflags2str[i].flag);
1064 if (v == poolflags2str[i].def)
1066 str = pool_tmpappend(pool, str, v ? " " : " !", poolflags2str[i].str);
1068 return str ? str + 1 : "";
1072 testcase_setpoolflags(Pool *pool, const char *str)
1074 const char *p = str, *s;
1078 while (*p == ' ' || *p == '\t' || *p == ',')
1089 while (*p && *p != ' ' && *p != '\t' && *p != ',')
1091 for (i = 0; poolflags2str[i].str; i++)
1092 if (!strncmp(poolflags2str[i].str, s, p - s) && poolflags2str[i].str[p - s] == 0)
1094 if (!poolflags2str[i].str)
1096 pool_debug(pool, SOLV_ERROR, "setpoolflags: unknown flag '%.*s'\n", (int)(p - s), s);
1099 pool_set_flag(pool, poolflags2str[i].flag, v);
1105 testcase_resetpoolflags(Pool *pool)
1108 for (i = 0; poolflags2str[i].str; i++)
1109 pool_set_flag(pool, poolflags2str[i].flag, poolflags2str[i].def);
1113 testcase_getsolverflags(Solver *solv)
1115 Pool *pool = solv->pool;
1116 const char *str = 0;
1118 for (i = 0; solverflags2str[i].str; i++)
1120 v = solver_get_flag(solv, solverflags2str[i].flag);
1121 if (v == solverflags2str[i].def)
1123 str = pool_tmpappend(pool, str, v ? " " : " !", solverflags2str[i].str);
1125 return str ? str + 1 : "";
1129 testcase_setsolverflags(Solver *solv, const char *str)
1131 const char *p = str, *s;
1135 while (*p == ' ' || *p == '\t' || *p == ',')
1146 while (*p && *p != ' ' && *p != '\t' && *p != ',')
1148 for (i = 0; solverflags2str[i].str; i++)
1149 if (!strncmp(solverflags2str[i].str, s, p - s) && solverflags2str[i].str[p - s] == 0)
1151 if (!solverflags2str[i].str)
1153 pool_debug(solv->pool, SOLV_ERROR, "setsolverflags: unknown flag '%.*s'\n", (int)(p - s), s);
1156 solver_set_flag(solv, solverflags2str[i].flag, v);
1162 testcase_resetsolverflags(Solver *solv)
1165 for (i = 0; solverflags2str[i].str; i++)
1166 solver_set_flag(solv, solverflags2str[i].flag, solverflags2str[i].def);
1170 testcase_ruleid(Solver *solv, Id rid)
1176 const unsigned char *md5;
1182 solver_ruleliterals(solv, rid, &q);
1183 for (i = 0; i < q.count; i++)
1185 Id p = q.elements[i];
1186 s = testcase_solvid2str(solv->pool, p > 0 ? p : -p);
1188 s = pool_tmpjoin(solv->pool, "!", s, 0);
1189 strqueue_push(&sq, s);
1192 strqueue_sort_u(&sq);
1193 chk = solv_chksum_create(REPOKEY_TYPE_MD5);
1194 for (i = 0; i < sq.nstr; i++)
1195 solv_chksum_add(chk, sq.str[i], strlen(sq.str[i]) + 1);
1196 md5 = solv_chksum_get(chk, &md5l);
1197 s = pool_bin2hex(solv->pool, md5, md5l);
1198 chk = solv_chksum_free(chk, 0);
1204 testcase_problemid(Solver *solv, Id problem)
1209 const unsigned char *md5;
1213 /* we build a hash of all rules that define the problem */
1216 solver_findallproblemrules(solv, problem, &q);
1217 for (i = 0; i < q.count; i++)
1218 strqueue_push(&sq, testcase_ruleid(solv, q.elements[i]));
1220 strqueue_sort_u(&sq);
1221 chk = solv_chksum_create(REPOKEY_TYPE_MD5);
1222 for (i = 0; i < sq.nstr; i++)
1223 solv_chksum_add(chk, sq.str[i], strlen(sq.str[i]) + 1);
1224 md5 = solv_chksum_get(chk, &md5l);
1225 s = pool_bin2hex(solv->pool, md5, 4);
1226 chk = solv_chksum_free(chk, 0);
1232 testcase_solutionid(Solver *solv, Id problem, Id solution)
1236 const unsigned char *md5;
1240 intid = solver_solutionelement_internalid(solv, problem, solution);
1241 /* internal stuff! handle with care! */
1245 s = testcase_job2str(solv->pool, solv->job.elements[-intid - 1], solv->job.elements[-intid]);
1250 s = testcase_ruleid(solv, intid);
1252 chk = solv_chksum_create(REPOKEY_TYPE_MD5);
1253 solv_chksum_add(chk, s, strlen(s) + 1);
1254 md5 = solv_chksum_get(chk, &md5l);
1255 s = pool_bin2hex(solv->pool, md5, 4);
1256 chk = solv_chksum_free(chk, 0);
1260 static struct class2str {
1264 { SOLVER_TRANSACTION_ERASE, "erase" },
1265 { SOLVER_TRANSACTION_INSTALL, "install" },
1266 { SOLVER_TRANSACTION_REINSTALLED, "reinstall" },
1267 { SOLVER_TRANSACTION_DOWNGRADED, "downgrade" },
1268 { SOLVER_TRANSACTION_CHANGED, "change" },
1269 { SOLVER_TRANSACTION_UPGRADED, "upgrade" },
1270 { SOLVER_TRANSACTION_OBSOLETED, "obsolete" },
1271 { SOLVER_TRANSACTION_MULTIINSTALL, "multiinstall" },
1272 { SOLVER_TRANSACTION_MULTIREINSTALL, "multireinstall" },
1277 testcase_solverresult(Solver *solv, int resultflags)
1279 Pool *pool = solv->pool;
1287 if ((resultflags & TESTCASE_RESULT_TRANSACTION) != 0)
1289 Transaction *trans = solver_create_transaction(solv);
1293 for (i = 0; class2str[i].str; i++)
1296 transaction_classify_pkgs(trans, SOLVER_TRANSACTION_KEEP_PSEUDO, class2str[i].class, 0, 0, &q);
1297 for (j = 0; j < q.count; j++)
1301 if (pool->installed && pool->solvables[p].repo == pool->installed)
1302 op = transaction_obs_pkg(trans, p);
1303 s = pool_tmpjoin(pool, class2str[i].str, " ", testcase_solvid2str(pool, p));
1305 s = pool_tmpjoin(pool, s, " ", testcase_solvid2str(pool, op));
1306 strqueue_push(&sq, s);
1310 transaction_free(trans);
1312 if ((resultflags & TESTCASE_RESULT_PROBLEMS) != 0)
1314 char *probprefix, *solprefix;
1315 int problem, solution, element;
1318 pcnt = solver_problem_count(solv);
1319 for (problem = 1; problem <= pcnt; problem++)
1321 Id rid, from, to, dep;
1322 SolverRuleinfo rinfo;
1323 rid = solver_findproblemrule(solv, problem);
1324 s = testcase_problemid(solv, problem);
1325 probprefix = solv_dupjoin("problem ", s, 0);
1326 rinfo = solver_ruleinfo(solv, rid, &from, &to, &dep);
1327 s = pool_tmpjoin(pool, probprefix, " info ", solver_problemruleinfo2str(solv, rinfo, from, to, dep));
1328 strqueue_push(&sq, s);
1329 scnt = solver_solution_count(solv, problem);
1330 for (solution = 1; solution <= scnt; solution++)
1332 s = testcase_solutionid(solv, problem, solution);
1333 solprefix = solv_dupjoin(probprefix, " solution ", s);
1335 while ((element = solver_next_solutionelement(solv, problem, solution, element, &p, &op)) != 0)
1337 if (p == SOLVER_SOLUTION_JOB)
1338 s = pool_tmpjoin(pool, solprefix, " deljob ", testcase_job2str(pool, solv->job.elements[op - 1], solv->job.elements[op]));
1339 else if (p > 0 && op == 0)
1340 s = pool_tmpjoin(pool, solprefix, " erase ", testcase_solvid2str(pool, p));
1341 else if (p > 0 && op > 0)
1343 s = pool_tmpjoin(pool, solprefix, " replace ", testcase_solvid2str(pool, p));
1344 s = pool_tmpappend(pool, s, " ", testcase_solvid2str(pool, op));
1346 else if (p < 0 && op > 0)
1347 s = pool_tmpjoin(pool, solprefix, " allow ", testcase_solvid2str(pool, op));
1349 s = pool_tmpjoin(pool, solprefix, " unknown", 0);
1350 strqueue_push(&sq, s);
1352 solv_free(solprefix);
1354 solv_free(probprefix);
1358 if ((resultflags & TESTCASE_RESULT_ORPHANED) != 0)
1363 solver_get_orphaned(solv, &q);
1364 for (i = 0; i < q.count; i++)
1366 s = pool_tmpjoin(pool, "orphaned ", testcase_solvid2str(pool, q.elements[i]), 0);
1367 strqueue_push(&sq, s);
1372 if ((resultflags & TESTCASE_RESULT_RECOMMENDED) != 0)
1378 solver_get_recommendations(solv, &qr, &qs, 0);
1379 for (i = 0; i < qr.count; i++)
1381 s = pool_tmpjoin(pool, "recommended ", testcase_solvid2str(pool, qr.elements[i]), 0);
1382 strqueue_push(&sq, s);
1384 for (i = 0; i < qs.count; i++)
1386 s = pool_tmpjoin(pool, "suggested ", testcase_solvid2str(pool, qs.elements[i]), 0);
1387 strqueue_push(&sq, s);
1393 if ((resultflags & TESTCASE_RESULT_UNNEEDED) != 0)
1398 solver_get_unneeded(solv, &q, 0);
1399 for (i = 0; i < q.count; i++)
1401 s = pool_tmpjoin(pool, "unneeded ", testcase_solvid2str(pool, q.elements[i]), 0);
1402 strqueue_push(&sq, s);
1408 result = strqueue_join(&sq);
1415 testcase_write(Solver *solv, char *dir, int resultflags, const char *testcasename, const char *resultname)
1417 Pool *pool = solv->pool;
1428 testcasename = "testcase.t";
1430 resultname = "solver.result";
1432 if (mkdir(dir, 0777) && errno != EEXIST)
1434 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: could not create directory '%s'\n", dir);
1438 FOR_REPOS(repoid, repo)
1440 const char *name = testcase_repoid2str(pool, repoid);
1442 if (repo->subpriority)
1443 sprintf(priobuf, "%d.%d", repo->priority, repo->subpriority);
1445 sprintf(priobuf, "%d", repo->priority);
1446 out = pool_tmpjoin(pool, name, ".repo", ".gz");
1447 cmd = pool_tmpjoin(pool, "repo ", name, " ");
1448 cmd = pool_tmpappend(pool, cmd, priobuf, " ");
1449 cmd = pool_tmpappend(pool, cmd, "susetags ", out);
1450 strqueue_push(&sq, cmd);
1451 out = pool_tmpjoin(pool, dir, "/", out);
1452 if (!(fp = solv_xfopen(out, "w")))
1454 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: could not open '%s' for writing\n", out);
1458 testcase_write_susetags(repo, fp);
1461 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: write error\n");
1466 /* hmm, this is not optimal... we currently search for the lowest score */
1469 for (i = 0; i < pool->lastarch; i++)
1471 if (pool->id2arch[i] == 1 && !lowscore)
1473 if (pool->id2arch[i] > 0x10000 && (!lowscore || pool->id2arch[i] < lowscore))
1476 lowscore = pool->id2arch[i];
1479 cmd = pool_tmpjoin(pool, "system ", pool_id2str(pool, arch), pool->disttype == DISTTYPE_DEB ? " deb" : " rpm");
1480 if (pool->installed)
1481 cmd = pool_tmpappend(pool, cmd, " ", testcase_repoid2str(pool, pool->installed->repoid));
1482 strqueue_push(&sq, cmd);
1483 s = testcase_getpoolflags(solv->pool);
1486 cmd = pool_tmpjoin(pool, "poolflags ", s, 0);
1487 strqueue_push(&sq, cmd);
1490 if (pool->vendorclasses)
1493 for (i = 0; pool->vendorclasses[i]; i++)
1495 cmd = pool_tmpappend(pool, cmd ? cmd : "vendorclass", " ", pool->vendorclasses[i]);
1496 if (!pool->vendorclasses[i + 1])
1498 strqueue_push(&sq, cmd);
1505 s = testcase_getsolverflags(solv);
1508 cmd = pool_tmpjoin(pool, "solverflags ", s, 0);
1509 strqueue_push(&sq, cmd);
1512 /* now dump all the ns callback values we know */
1513 if (pool->nscallback)
1517 for (rid = 1; rid < pool->nrels; rid++)
1519 Reldep *rd = pool->rels + rid;
1520 if (rd->flags != REL_NAMESPACE || rd->name == NAMESPACE_OTHERPROVIDERS)
1522 /* check if we evaluated it, also skip empty results */
1523 if (!(d = pool->whatprovides_rel[rid]) || !pool->whatprovidesdata[d])
1525 cmd = pool_tmpjoin(pool, "namespace ", pool_id2str(pool, rd->name), "(");
1526 cmd = pool_tmpappend(pool, cmd, pool_id2str(pool, rd->evr), ")");
1527 for (; pool->whatprovidesdata[d]; d++)
1528 cmd = pool_tmpappend(pool, cmd, " ", testcase_solvid2str(pool, pool->whatprovidesdata[d]));
1529 strqueue_push(&sq, cmd);
1533 for (i = 0; i < solv->job.count; i += 2)
1535 cmd = (char *)testcase_job2str(pool, solv->job.elements[i], solv->job.elements[i + 1]);
1536 cmd = pool_tmpjoin(pool, "job ", cmd, 0);
1537 strqueue_push(&sq, cmd);
1544 for (i = 0; resultflags2str[i].str; i++)
1545 if ((resultflags & resultflags2str[i].flag) != 0)
1546 cmd = pool_tmpappend(pool, cmd, cmd ? "," : 0, resultflags2str[i].str);
1547 cmd = pool_tmpjoin(pool, "result ", cmd ? cmd : "?", 0);
1548 cmd = pool_tmpappend(pool, cmd, " ", resultname);
1549 strqueue_push(&sq, cmd);
1550 result = testcase_solverresult(solv, resultflags);
1551 if (!strcmp(resultname, "<inline>"))
1555 strqueue_init(&rsq);
1556 strqueue_split(&rsq, result);
1557 for (i = 0; i < rsq.nstr; i++)
1559 cmd = pool_tmpjoin(pool, "#>", rsq.str[i], 0);
1560 strqueue_push(&sq, cmd);
1562 strqueue_free(&rsq);
1566 out = pool_tmpjoin(pool, dir, "/", resultname);
1567 if (!(fp = fopen(out, "w")))
1569 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: could not open '%s' for writing\n", out);
1574 if (result && *result && fwrite(result, strlen(result), 1, fp) != 1)
1576 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: write error\n");
1583 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: write error\n");
1591 cmd = strqueue_join(&sq);
1592 out = pool_tmpjoin(pool, dir, "/", testcasename);
1593 if (!(fp = fopen(out, "w")))
1595 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: could not open '%s' for writing\n", out);
1599 if (*cmd && fwrite(cmd, strlen(cmd), 1, fp) != 1)
1601 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: write error\n");
1607 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: write error\n");
1617 testcase_read(Pool *pool, FILE *fp, char *testcase, Queue *job, char **resultp, int *resultflagsp)
1622 char *testcasedir, *s;
1628 int poolflagsreset = 0;
1630 if (!fp && !(fp = fopen(testcase, "r")))
1632 pool_debug(pool, SOLV_ERROR, "testcase_read: could not open '%s'\n", testcase);
1635 testcasedir = solv_strdup(testcase);
1636 if ((s = strrchr(testcasedir, '/')) != 0)
1641 buf = solv_malloc(bufl);
1646 if (bufp - buf + 16 > bufl)
1649 buf = solv_realloc(buf, bufl + 512);
1653 if (!fgets(bufp, bufl - (bufp - buf), fp))
1657 if (!l || buf[l - 1] != '\n')
1664 while (*s && (*s == ' ' || *s == '\t'))
1666 if (!*s || *s == '#')
1669 /* split it in pieces */
1672 while (*s == ' ' || *s == '\t')
1676 pieces = solv_extend(pieces, npieces, 1, sizeof(*pieces), 7);
1677 pieces[npieces++] = s;
1678 while (*s && *s != ' ' && *s != '\t')
1683 pieces = solv_extend(pieces, npieces, 1, sizeof(*pieces), 7);
1684 pieces[npieces] = 0;
1685 if (!strcmp(pieces[0], "repo") && npieces >= 4)
1687 Repo *repo = repo_create(pool, pieces[1]);
1693 if (!poolflagsreset)
1696 testcase_resetpoolflags(pool); /* hmm */
1698 if (sscanf(pieces[2], "%d.%d", &prio, &subprio) != 2)
1701 prio = atoi(pieces[2]);
1703 repo->priority = prio;
1704 repo->subpriority = subprio;
1705 if (strcmp(pieces[3], "empty") != 0)
1707 rdata = pool_tmpjoin(pool, testcasedir, pieces[4], 0);
1708 if ((rfp = solv_xfopen(rdata, "r")) == 0)
1710 pool_debug(pool, SOLV_ERROR, "testcase_read: could not open '%s'\n", rdata);
1712 else if (!strcmp(pieces[3], "susetags"))
1714 testcase_add_susetags(repo, rfp, 0);
1717 else if (!strcmp(pieces[3], "solv"))
1719 repo_add_solv(repo, rfp, 0);
1725 pool_debug(pool, SOLV_ERROR, "testcase_read: unknown repo type for repo '%s'\n", repo->name);
1729 else if (!strcmp(pieces[0], "system") && npieces >= 3)
1732 pool_setarch(pool, pieces[1]);
1735 Repo *repo = testcase_str2repo(pool, pieces[3]);
1737 pool_debug(pool, SOLV_ERROR, "testcase_read: system: unknown repo '%s'\n", pieces[3]);
1739 pool_set_installed(pool, repo);
1742 else if (!strcmp(pieces[0], "job") && npieces > 1)
1748 pool_addfileprovides(pool);
1749 pool_createwhatprovides(pool);
1753 for (sp = pieces[1]; sp < pieces[npieces - 1]; sp++)
1756 how = testcase_str2job(pool, pieces[1], &what);
1757 if (how >= 0 && job)
1758 queue_push2(job, how, what);
1760 else if (!strcmp(pieces[0], "vendorclass") && npieces > 1)
1762 pool_addvendorclass(pool, (const char **)(pieces + 1));
1764 else if (!strcmp(pieces[0], "namespace") && npieces > 1)
1766 int i = strlen(pieces[1]);
1767 s = strchr(pieces[1], '(');
1768 if (!s && pieces[1][i - 1] != ')')
1770 pool_debug(pool, SOLV_ERROR, "testcase_read: bad namespace '%s'\n", pieces[1]);
1778 pieces[1][i - 1] = 0;
1779 name = pool_str2id(pool, pieces[1], 1);
1780 evr = pool_str2id(pool, s + 1, 1);
1782 pieces[1][i - 1] = ')';
1783 id = pool_rel2id(pool, name, evr, REL_NAMESPACE, 1);
1784 for (i = 2; i < npieces; i++)
1785 queue_push(&q, testcase_str2solvid(pool, pieces[i]));
1786 /* now do the callback */
1789 pool_addfileprovides(pool);
1790 pool_createwhatprovides(pool);
1793 pool->whatprovides_rel[GETRELID(id)] = pool_queuetowhatprovides(pool, &q);
1797 else if (!strcmp(pieces[0], "poolflags"))
1800 if (!poolflagsreset)
1803 testcase_resetpoolflags(pool); /* hmm */
1805 for (i = 1; i < npieces; i++)
1806 testcase_setpoolflags(pool, pieces[i]);
1808 else if (!strcmp(pieces[0], "solverflags") && npieces > 1)
1813 solv = solver_create(pool);
1814 testcase_resetsolverflags(solv);
1816 for (i = 1; i < npieces; i++)
1817 testcase_setsolverflags(solv, pieces[i]);
1819 else if (!strcmp(pieces[0], "result") && npieces > 2)
1823 int resultflags = 0;
1824 char *s = pieces[1];
1828 char *se = strchr(s, ',');
1831 for (i = 0; resultflags2str[i].str; i++)
1832 if (!strcmp(s, resultflags2str[i].str))
1834 resultflags |= resultflags2str[i].flag;
1837 if (!resultflags2str[i].str)
1838 pool_debug(pool, SOLV_ERROR, "result: unknown flag '%s'\n", s);
1842 rdata = pool_tmpjoin(pool, testcasedir, pieces[2], 0);
1843 if (!strcmp(pieces[2], "<inline>"))
1846 rfp = fopen(rdata, "r");
1849 pool_debug(pool, SOLV_ERROR, "testcase_read: could not open '%s'\n", rdata);
1853 /* slurp it in... */
1854 char *result = solv_malloc(1024);
1860 if (rp - result + 256 >= resultl)
1862 resultl = rp - result;
1863 result = solv_realloc(result, resultl + 1024);
1864 rp = result + resultl;
1869 if (!fgets(rp, resultl - (rp - result), fp))
1874 if (rl && (rp == result || rp[-1] == '\n'))
1876 if (rl > 1 && rp[0] == '#' && rp[1] == '>')
1878 memmove(rp, rp + 2, rl - 2);
1883 while (rl + 16 > bufl)
1885 buf = solv_realloc(buf, bufl + 512);
1888 memmove(buf, rp, rl);
1889 if (buf[rl - 1] == '\n')
1901 rl = fread(rp, 1, resultl - (rp - result), rfp);
1916 *resultflagsp = resultflags;
1919 else if (!strcmp(pieces[0], "nextjob") && npieces == 1)
1925 pool_debug(pool, SOLV_ERROR, "testcase_read: cannot parse command '%s'\n", pieces[0]);
1928 buf = solv_free(buf);
1929 pieces = solv_free(pieces);
1930 solv_free(testcasedir);
1933 pool_addfileprovides(pool);
1934 pool_createwhatprovides(pool);
1938 solv = solver_create(pool);
1939 testcase_resetsolverflags(solv);
1947 testcase_resultdiff(char *result1, char *result2)
1949 Strqueue sq1, sq2, osq;
1951 strqueue_init(&sq1);
1952 strqueue_init(&sq2);
1953 strqueue_init(&osq);
1954 strqueue_split(&sq1, result1);
1955 strqueue_split(&sq2, result2);
1956 strqueue_sort(&sq1);
1957 strqueue_sort(&sq2);
1958 strqueue_diff(&sq1, &sq2, &osq);
1959 r = osq.nstr ? strqueue_join(&osq) : 0;
1960 strqueue_free(&sq1);
1961 strqueue_free(&sq2);
1962 strqueue_free(&osq);