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 },
96 static struct poolflags2str {
100 } poolflags2str[] = {
101 { POOL_FLAG_PROMOTEEPOCH, "promoteepoch", 0 },
102 { POOL_FLAG_FORBIDSELFCONFLICTS, "forbidselfconflicts", 0 },
103 { POOL_FLAG_OBSOLETEUSESPROVIDES, "obsoleteusesprovides", 0 },
104 { POOL_FLAG_IMPLICITOBSOLETEUSESPROVIDES, "implicitobsoleteusesprovides", 0 },
105 { POOL_FLAG_OBSOLETEUSESCOLORS, "obsoleteusescolors", 0 },
106 { POOL_FLAG_NOINSTALLEDOBSOLETES, "noinstalledobsoletes", 0 },
107 { POOL_FLAG_HAVEDISTEPOCH, "havedistepoch", 0 },
112 typedef struct strqueue {
117 #define STRQUEUE_BLOCK 63
120 strqueue_init(Strqueue *q)
127 strqueue_free(Strqueue *q)
130 for (i = 0; i < q->nstr; i++)
131 solv_free(q->str[i]);
132 q->str = solv_free(q->str);
137 strqueue_push(Strqueue *q, const char *s)
139 q->str = solv_extend(q->str, q->nstr, 1, sizeof(*q->str), STRQUEUE_BLOCK);
140 q->str[q->nstr++] = solv_strdup(s);
144 strqueue_pushjoin(Strqueue *q, const char *s1, const char *s2, const char *s3)
146 q->str = solv_extend(q->str, q->nstr, 1, sizeof(*q->str), STRQUEUE_BLOCK);
147 q->str[q->nstr++] = solv_dupjoin(s1, s2, s3);
151 strqueue_sort_cmp(const void *ap, const void *bp, void *dp)
153 const char *a = *(const char **)ap;
154 const char *b = *(const char **)bp;
155 return strcmp(a ? a : "", b ? b : "");
159 strqueue_sort(Strqueue *q)
162 solv_sort(q->str, q->nstr, sizeof(*q->str), strqueue_sort_cmp, 0);
166 strqueue_sort_u(Strqueue *q)
170 for (i = j = 0; i < q->nstr; i++)
171 if (!j || strqueue_sort_cmp(q->str + i, q->str + j - 1, 0) != 0)
172 q->str[j++] = q->str[i];
177 strqueue_join(Strqueue *q)
181 for (i = 0; i < q->nstr; i++)
183 l += strlen(q->str[i]) + 1;
184 l++; /* trailing \0 */
187 for (i = 0; i < q->nstr; i++)
190 strcpy(rp, q->str[i]);
199 strqueue_split(Strqueue *q, const char *s)
204 while ((p = strchr(s, '\n')) != 0)
206 q->str = solv_extend(q->str, q->nstr, 1, sizeof(*q->str), STRQUEUE_BLOCK);
207 q->str[q->nstr] = solv_malloc(p - s + 1);
209 memcpy(q->str[q->nstr], s, p - s);
210 q->str[q->nstr][p - s] = 0;
219 strqueue_diff(Strqueue *sq1, Strqueue *sq2, Strqueue *osq)
222 while (i < sq1->nstr && j < sq2->nstr)
224 int r = strqueue_sort_cmp(sq1->str + i, sq2->str + j, 0);
228 strqueue_pushjoin(osq, "-", sq1->str[i++], 0);
230 strqueue_pushjoin(osq, "+", sq2->str[j++], 0);
232 while (i < sq1->nstr)
233 strqueue_pushjoin(osq, "-", sq1->str[i++], 0);
234 while (j < sq2->nstr)
235 strqueue_pushjoin(osq, "+", sq2->str[j++], 0);
239 pool_isknownarch(Pool *pool, Id id)
241 if (!id || id == ID_EMPTY)
243 if (id == ARCH_SRC || id == ARCH_NOSRC || id == ARCH_NOARCH)
245 if (!pool->id2arch || (id > pool->lastarch || !pool->id2arch[id]))
251 testcase_str2dep(Pool *pool, char *s)
257 if ((n = strchr(s, '|')) != 0)
259 id = testcase_str2dep(pool, n + 1);
261 id = pool_rel2id(pool, testcase_str2dep(pool, s), id, REL_OR, 1);
265 while (*s == ' ' || *s == '\t')
268 while (*s && *s != ' ' && *s != '\t' && *s != '<' && *s != '=' && *s != '>')
272 while (*s && *s != ')')
278 if ((a = strchr(n, '.')) != 0 && a + 1 < s && s[-1] != ')')
280 Id archid = pool_strn2id(pool, a + 1, s - (a + 1), 0);
281 if (pool_isknownarch(pool, archid))
283 id = pool_strn2id(pool, n, a - n, 1);
284 id = pool_rel2id(pool, id, archid, REL_ARCH, 1);
287 id = pool_strn2id(pool, n, s - n, 1);
290 id = pool_strn2id(pool, n, s - n, 1);
293 while (*s == ' ' || *s == '\t')
309 while (*s == ' ' || *s == '\t')
312 while (*s && *s != ' ' && *s != '\t')
314 return pool_rel2id(pool, id, pool_strn2id(pool, n, s - n, 1), flags, 1);
318 testcase_repoid2str(Pool *pool, Id repoid)
320 Repo *repo = pool_id2repo(pool, repoid);
323 char *r = pool_tmpjoin(pool, repo->name, 0, 0);
325 for (rp = r; *rp; rp++)
326 if (*rp == ' ' || *rp == '\t')
333 sprintf(buf, "#%d", repoid);
334 return pool_tmpjoin(pool, buf, 0, 0);
339 testcase_solvid2str(Pool *pool, Id p)
341 Solvable *s = pool->solvables + p;
342 const char *n, *e, *a;
345 if (p == SYSTEMSOLVABLE)
347 n = pool_id2str(pool, s->name);
348 e = pool_id2str(pool, s->evr);
349 a = pool_id2str(pool, s->arch);
350 str = pool_alloctmpspace(pool, strlen(n) + strlen(e) + strlen(a) + 3);
351 sprintf(str, "%s-%s.%s", n, e, a);
353 return pool_tmpappend(pool, str, "@", 0);
357 char *str2 = pool_tmpappend(pool, str, "@", s->repo->name);
359 if (str2[l] == ' ' || str2[l] == '\t')
363 sprintf(buf, "@#%d", s->repo->repoid);
364 return pool_tmpappend(pool, str, buf, 0);
368 testcase_str2repo(Pool *pool, const char *str)
372 if (str[0] == '#' && (str[1] >= '0' && str[1] <= '9'))
376 for (j = 1; str[j] >= '0' && str[j] <= '9'; j++)
377 repoid = repoid * 10 + (str[j] - '0');
378 if (!str[j] && repoid > 0 && repoid < pool->nrepos)
379 repo = pool_id2repo(pool, repoid);
383 FOR_REPOS(repoid, repo)
388 l = strlen(repo->name);
389 for (i = 0; i < l; i++)
391 int c = repo->name[i];
392 if (c == ' ' || c == '\t')
397 if (i == l && !str[l])
400 if (repoid >= pool->nrepos)
407 testcase_str2solvid(Pool *pool, const char *str)
409 int i, l = strlen(str);
416 if (*str == '@' && !strcmp(str, "@SYSTEM"))
417 return SYSTEMSOLVABLE;
419 for (i = l - 1; i >= 0; i--)
420 if (str[i] == '@' && (repo = testcase_str2repo(pool, str + i + 1)) != 0)
425 /* now find the arch (if present) */
427 for (i = repostart - 1; i > 0; i--)
430 arch = pool_strn2id(pool, str + i + 1, repostart - (i + 1), 0);
435 /* now find the name */
436 for (i = repostart - 1; i > 0; i--)
440 Id nid, evrid, p, pp;
441 nid = pool_strn2id(pool, str, i, 0);
444 evrid = pool_strn2id(pool, str + i + 1, repostart - (i + 1), 0);
447 FOR_PROVIDES(p, pp, nid)
449 Solvable *s = pool->solvables + p;
450 if (s->name != nid || s->evr != evrid)
452 if (repo && s->repo != repo)
454 if (arch && s->arch != arch)
464 testcase_job2str(Pool *pool, Id how, Id what)
471 Id select = how & SOLVER_SELECTMASK;
473 for (i = 0; job2str[i].str; i++)
474 if ((how & SOLVER_JOBMASK) == job2str[i].job)
476 jobstr = job2str[i].str ? job2str[i].str : "unknown";
477 if (select == SOLVER_SOLVABLE)
480 pkgstr = testcase_solvid2str(pool, what);
482 else if (select == SOLVER_SOLVABLE_NAME)
485 pkgstr = pool_dep2str(pool, what);
487 else if (select == SOLVER_SOLVABLE_PROVIDES)
489 selstr = " provides ";
490 pkgstr = pool_dep2str(pool, what);
492 else if (select == SOLVER_SOLVABLE_ONE_OF)
497 while ((p = pool->whatprovidesdata[what++]) != 0)
499 const char *s = testcase_solvid2str(pool, p);
502 pkgstr = pool_tmpappend(pool, pkgstr, " ", s);
503 pool_freetmpspace(pool, s);
511 else if (select == SOLVER_SOLVABLE_REPO)
513 Repo *repo = pool_id2repo(pool, what);
518 sprintf(buf, "#%d", repo->repoid);
519 pkgstr = pool_tmpjoin(pool, buf, 0, 0);
522 pkgstr = pool_tmpjoin(pool, repo->name, 0, 0);
524 else if (select == SOLVER_SOLVABLE_ALL)
531 selstr = " unknown ";
534 ret = pool_tmpjoin(pool, jobstr, selstr, pkgstr);
536 ret = pool_tmpappend(pool, ret, " ", 0);
537 for (i = 0; jobflags2str[i].str; i++)
538 if ((how & jobflags2str[i].flag) != 0)
539 ret = pool_tmpappend(pool, ret, ",", jobflags2str[i].str);
545 ret = pool_tmpappend(pool, ret, "]", 0);
551 testcase_str2job(Pool *pool, const char *str, Id *whatp)
561 /* so we can patch it */
562 s = pool_tmpjoin(pool, str, 0, 0);
563 /* split it in pieces */
566 while (*s == ' ' || *s == '\t')
570 pieces = solv_extend(pieces, npieces, 1, sizeof(*pieces), 7);
571 pieces[npieces++] = s;
572 while (*s && *s != ' ' && *s != '\t')
579 pool_debug(pool, SOLV_ERROR, "str2job: bad line '%s'\n", str);
583 for (i = 0; job2str[i].str; i++)
584 if (!strcmp(pieces[0], job2str[i].str))
588 pool_debug(pool, SOLV_ERROR, "str2job: unknown job '%s'\n", str);
591 job = job2str[i].job;
594 char *flags = pieces[npieces - 1];
596 if (*flags == '[' && flags[strlen(flags) - 1] == ']')
600 flags[strlen(flags) - 1] = ',';
603 for (nf = flags; *nf != ','; nf++)
606 for (i = 0; jobflags2str[i].str; i++)
607 if (!strcmp(flags, jobflags2str[i].str))
609 if (!jobflags2str[i].str)
611 pool_debug(pool, SOLV_ERROR, "str2job: unknown jobflags in '%s'\n", str);
614 job |= jobflags2str[i].flag;
619 if (!strcmp(pieces[1], "pkg"))
623 pool_debug(pool, SOLV_ERROR, "str2job: bad pkg selector in '%s'\n", str);
626 job |= SOLVER_SOLVABLE;
627 what = testcase_str2solvid(pool, pieces[2]);
630 pool_debug(pool, SOLV_ERROR, "str2job: unknown package '%s'\n", pieces[2]);
634 else if (!strcmp(pieces[1], "name") || !strcmp(pieces[1], "provides"))
636 /* join em again for dep2str... */
638 for (sp = pieces[2]; sp < pieces[npieces - 1]; sp++)
641 what = testcase_str2dep(pool, pieces[2]);
642 if (pieces[1][0] == 'n')
643 job |= SOLVER_SOLVABLE_NAME;
645 job |= SOLVER_SOLVABLE_PROVIDES;
647 else if (!strcmp(pieces[1], "oneof"))
650 job |= SOLVER_SOLVABLE_ONE_OF;
652 if (npieces > 3 && strcmp(pieces[2], "nothing") != 0)
654 for (i = 2; i < npieces; i++)
656 Id p = testcase_str2solvid(pool, pieces[i]);
659 pool_debug(pool, SOLV_ERROR, "str2job: unknown package '%s'\n", pieces[i]);
666 what = pool_queuetowhatprovides(pool, &q);
669 else if (!strcmp(pieces[1], "repo"))
674 pool_debug(pool, SOLV_ERROR, "str2job: bad line '%s'\n", str);
677 repo = testcase_str2repo(pool, pieces[2]);
680 pool_debug(pool, SOLV_ERROR, "str2job: unknown repo '%s'\n", pieces[2]);
683 job |= SOLVER_SOLVABLE_REPO;
686 else if (!strcmp(pieces[1], "all"))
688 if (npieces != 3 && strcmp(pieces[2], "packages") != 0)
690 pool_debug(pool, SOLV_ERROR, "str2job: bad line '%s'\n", str);
693 job |= SOLVER_SOLVABLE_ALL;
698 pool_debug(pool, SOLV_ERROR, "str2job: unknown selection in '%s'\n", str);
706 writedeps(Repo *repo, FILE *fp, const char *tag, Id key, Solvable *s, Offset off)
708 Pool *pool = repo->pool;
715 dp = repo->idarraydata + off;
717 while ((id = *dp++) != 0)
719 if (key == SOLVABLE_REQUIRES && id == SOLVABLE_PREREQMARKER)
722 fprintf(fp, "-%s\n", tag);
727 if (key == SOLVABLE_PROVIDES && id == SOLVABLE_FILEMARKER)
732 idstr = pool_dep2str(pool, id);
735 Reldep *rd = GETRELDEP(pool, id);
736 if (key == SOLVABLE_CONFLICTS && rd->flags == REL_NAMESPACE && rd->name == NAMESPACE_OTHERPROVIDERS)
738 if (!strncmp(idstr, "namespace:", 10))
741 if (key == SOLVABLE_SUPPLEMENTS)
743 if (rd->flags == REL_NAMESPACE && rd->name == NAMESPACE_FILESYSTEM)
745 if (!strncmp(idstr, "namespace:", 10))
748 else if (rd->flags == REL_NAMESPACE && rd->name == NAMESPACE_MODALIAS)
750 if (!strncmp(idstr, "namespace:", 10))
753 else if (rd->flags == REL_AND)
755 /* either packageand chain or modalias */
757 if (ISRELDEP(rd->evr))
759 Reldep *mrd = GETRELDEP(pool, rd->evr);
760 if (mrd->flags == REL_NAMESPACE && mrd->name == NAMESPACE_MODALIAS)
762 idstr = pool_tmpjoin(pool, "modalias(", pool_dep2str(pool, rd->name), ":");
763 idstr = pool_tmpappend(pool, idstr, pool_dep2str(pool, mrd->evr), ")");
765 else if (mrd->flags >= 8)
770 /* must be and chain */
771 idstr = pool_dep2str(pool, rd->evr);
777 rd = GETRELDEP(pool, id);
778 if (rd->flags != REL_AND)
780 idstr = pool_tmpjoin(pool, pool_dep2str(pool, rd->evr), ":", idstr);
782 idstr = pool_tmpjoin(pool, pool_dep2str(pool, id), ":", idstr);
783 idstr = pool_tmpjoin(pool, "packageand(", idstr, ")");
786 else if (rd->flags >= 8)
792 fprintf(fp, "+%s\n", tag);
795 fprintf(fp, "%s\n", idstr);
797 if (key == SOLVABLE_PROVIDES)
799 /* add the filelist */
801 dataiterator_init(&di, pool, repo, s - pool->solvables, SOLVABLE_FILELIST, 0, 0);
802 while (dataiterator_step(&di))
804 const char *s = repodata_dir2str(di.data, di.kv.id, di.kv.str);
807 Id id = pool_str2id(pool, s, 0);
810 for (dp = prvdp; *dp; dp++)
814 continue; /* already included */
819 fprintf(fp, "+%s", tag);
822 fprintf(fp, "%s\n", s);
826 fprintf(fp, "-%s\n", tag);
830 testcase_write_susetags(Repo *repo, FILE *fp)
832 Pool *pool = repo->pool;
842 fprintf(fp, "=Ver: 2.0\n");
843 FOR_REPO_SOLVABLES(repo, p, s)
845 name = pool_id2str(pool, s->name);
846 evr = pool_id2str(pool, s->evr);
847 arch = pool_id2str(pool, s->arch);
848 release = strrchr(evr, '-');
850 release = evr + strlen(evr);
851 fprintf(fp, "=Pkg: %s %.*s %s %s\n", name, (int)(release - evr), evr, *release && release[1] ? release + 1 : "-", arch);
852 tmp = solvable_lookup_str(s, SOLVABLE_SUMMARY);
854 fprintf(fp, "=Sum: %s\n", tmp);
855 writedeps(repo, fp, "Req:", SOLVABLE_REQUIRES, s, s->requires);
856 writedeps(repo, fp, "Prv:", SOLVABLE_PROVIDES, s, s->provides);
857 writedeps(repo, fp, "Obs:", SOLVABLE_OBSOLETES, s, s->obsoletes);
858 writedeps(repo, fp, "Con:", SOLVABLE_CONFLICTS, s, s->conflicts);
859 writedeps(repo, fp, "Rec:", SOLVABLE_RECOMMENDS, s, s->recommends);
860 writedeps(repo, fp, "Sup:", SOLVABLE_SUPPLEMENTS, s, s->supplements);
861 writedeps(repo, fp, "Sug:", SOLVABLE_SUGGESTS, s, s->suggests);
862 writedeps(repo, fp, "Enh:", SOLVABLE_ENHANCES, s, s->enhances);
864 fprintf(fp, "=Vnd: %s\n", pool_id2str(pool, s->vendor));
865 ti = solvable_lookup_num(s, SOLVABLE_BUILDTIME, 0);
867 fprintf(fp, "=Tim: %u\n", ti);
873 adddep(Repo *repo, Offset olddeps, char *str, Id marker)
875 Id id = *str == '/' ? pool_str2id(repo->pool, str, 1) : testcase_str2dep(repo->pool, str);
876 return repo_addid_dep(repo, olddeps, id, marker);
880 finish_solvable(Pool *pool, Repodata *data, Solvable *s, char *filelist, int nfilelist)
886 for (l = 0; l < nfilelist; l += strlen(filelist + l) + 1)
888 char *p = strrchr(filelist + l, '/');
892 did = repodata_str2dir(data, filelist + l, 1);
895 did = repodata_str2dir(data, "/", 1);
896 repodata_add_dirstr(data, s - pool->solvables, SOLVABLE_FILELIST, did, p);
899 if (s->name && s->arch != ARCH_SRC && s->arch != ARCH_NOSRC)
900 s->provides = repo_addid_dep(s->repo, s->provides, pool_rel2id(pool, s->name, s->evr, REL_EQ, 1), 0);
901 s->supplements = repo_fix_supplements(s->repo, s->provides, s->supplements, 0);
902 s->conflicts = repo_fix_conflicts(s->repo, s->conflicts);
905 /* stripped down version of susetags parser used for testcases */
907 testcase_add_susetags(Repo *repo, FILE *fp, int flags)
909 Pool *pool = repo->pool;
922 data = repo_add_repodata(repo, flags);
927 line = solv_malloc(aline);
931 if (linep - line + 16 > aline)
933 aline = linep - line;
934 line = solv_realloc(line, aline + 512);
935 linep = line + aline;
938 if (!fgets(linep, aline - (linep - line), fp))
940 linep += strlen(linep);
941 if (linep == line || linep[-1] != '\n')
944 linep = line + intag;
947 if (line[intag] == '-' && !strncmp(line + 1, line + intag + 1, intag - 2))
954 else if (line[0] == '+' && line[1] && line[1] != ':')
956 char *tagend = strchr(line, ':');
961 intag = tagend + 2 - line;
962 linep = line + intag;
965 if (*line != '=' || !line[1] || !line[2] || !line[3] || line[4] != ':')
967 tag = line[1] << 16 | line[2] << 8 | line[3];
970 case 'P' << 16 | 'k' << 8 | 'g':
972 finish_solvable(pool, data, s, filelist, nfilelist);
974 if (split(line + 5, sp, 5) != 4)
976 s = pool_id2solvable(pool, repo_add_solvable(repo));
977 s->name = pool_str2id(pool, sp[0], 1);
978 /* join back version and release */
979 if (sp[2] && !(sp[2][0] == '-' && !sp[2][1]))
981 s->evr = makeevr(pool, sp[1]);
982 s->arch = pool_str2id(pool, sp[3], 1);
984 case 'S' << 16 | 'u' << 8 | 'm':
985 repodata_set_str(data, s - pool->solvables, SOLVABLE_SUMMARY, line + 6);
987 case 'V' << 16 | 'n' << 8 | 'd':
988 s->vendor = pool_str2id(pool, line + 6, 1);
990 case 'T' << 16 | 'i' << 8 | 'm':
993 repodata_set_num(data, s - pool->solvables, SOLVABLE_BUILDTIME, t);
995 case 'R' << 16 | 'e' << 8 | 'q':
996 s->requires = adddep(repo, s->requires, line + 6, -SOLVABLE_PREREQMARKER);
998 case 'P' << 16 | 'r' << 8 | 'q':
999 s->requires = adddep(repo, s->requires, line + 6, SOLVABLE_PREREQMARKER);
1001 case 'P' << 16 | 'r' << 8 | 'v':
1004 int l = strlen(line + 6) + 1;
1005 if (nfilelist + l > afilelist)
1007 afilelist = nfilelist + l + 512;
1008 filelist = solv_realloc(filelist, afilelist);
1010 memcpy(filelist + nfilelist, line + 6, l);
1017 for (l = 0; l < nfilelist; l += strlen(filelist + l) + 1)
1018 s->provides = repo_addid_dep(repo, s->provides, pool_str2id(pool, filelist + l, 1), 0);
1021 s->provides = adddep(repo, s->provides, line + 6, 0);
1023 case 'O' << 16 | 'b' << 8 | 's':
1024 s->obsoletes = adddep(repo, s->obsoletes, line + 6, 0);
1026 case 'C' << 16 | 'o' << 8 | 'n':
1027 s->conflicts = adddep(repo, s->conflicts, line + 6, 0);
1029 case 'R' << 16 | 'e' << 8 | 'c':
1030 s->recommends = adddep(repo, s->recommends, line + 6, 0);
1032 case 'S' << 16 | 'u' << 8 | 'p':
1033 s->supplements = adddep(repo, s->supplements, line + 6, 0);
1035 case 'S' << 16 | 'u' << 8 | 'g':
1036 s->suggests = adddep(repo, s->suggests, line + 6, 0);
1038 case 'E' << 16 | 'n' << 8 | 'h':
1039 s->enhances = adddep(repo, s->enhances, line + 6, 0);
1046 finish_solvable(pool, data, s, filelist, nfilelist);
1048 solv_free(filelist);
1049 repodata_free_dircache(data);
1050 if (!(flags & REPO_NO_INTERNALIZE))
1051 repodata_internalize(data);
1056 testcase_getpoolflags(Pool *pool)
1058 const char *str = 0;
1060 for (i = 0; poolflags2str[i].str; i++)
1062 v = pool_get_flag(pool, poolflags2str[i].flag);
1063 if (v == poolflags2str[i].def)
1065 str = pool_tmpappend(pool, str, v ? " " : " !", poolflags2str[i].str);
1067 return str ? str + 1 : "";
1071 testcase_setpoolflags(Pool *pool, const char *str)
1073 const char *p = str, *s;
1077 while (*p == ' ' || *p == '\t' || *p == ',')
1088 while (*p && *p != ' ' && *p != '\t' && *p != ',')
1090 for (i = 0; poolflags2str[i].str; i++)
1091 if (!strncmp(poolflags2str[i].str, s, p - s) && poolflags2str[i].str[p - s] == 0)
1093 if (!poolflags2str[i].str)
1095 pool_debug(pool, SOLV_ERROR, "setpoolflags: unknown flag '%.*s'\n", (int)(p - s), s);
1098 pool_set_flag(pool, poolflags2str[i].flag, v);
1104 testcase_resetpoolflags(Pool *pool)
1107 for (i = 0; poolflags2str[i].str; i++)
1108 pool_set_flag(pool, poolflags2str[i].flag, poolflags2str[i].def);
1112 testcase_getsolverflags(Solver *solv)
1114 Pool *pool = solv->pool;
1115 const char *str = 0;
1117 for (i = 0; solverflags2str[i].str; i++)
1119 v = solver_get_flag(solv, solverflags2str[i].flag);
1120 if (v == solverflags2str[i].def)
1122 str = pool_tmpappend(pool, str, v ? " " : " !", solverflags2str[i].str);
1124 return str ? str + 1 : "";
1128 testcase_setsolverflags(Solver *solv, const char *str)
1130 const char *p = str, *s;
1134 while (*p == ' ' || *p == '\t' || *p == ',')
1145 while (*p && *p != ' ' && *p != '\t' && *p != ',')
1147 for (i = 0; solverflags2str[i].str; i++)
1148 if (!strncmp(solverflags2str[i].str, s, p - s) && solverflags2str[i].str[p - s] == 0)
1150 if (!solverflags2str[i].str)
1152 pool_debug(solv->pool, SOLV_ERROR, "setsolverflags: unknown flag '%.*s'\n", (int)(p - s), s);
1155 solver_set_flag(solv, solverflags2str[i].flag, v);
1161 testcase_resetsolverflags(Solver *solv)
1164 for (i = 0; solverflags2str[i].str; i++)
1165 solver_set_flag(solv, solverflags2str[i].flag, solverflags2str[i].def);
1169 testcase_ruleid(Solver *solv, Id rid)
1175 const unsigned char *md5;
1181 solver_ruleliterals(solv, rid, &q);
1182 for (i = 0; i < q.count; i++)
1184 Id p = q.elements[i];
1185 s = testcase_solvid2str(solv->pool, p > 0 ? p : -p);
1187 s = pool_tmpjoin(solv->pool, "!", s, 0);
1188 strqueue_push(&sq, s);
1191 strqueue_sort_u(&sq);
1192 chk = solv_chksum_create(REPOKEY_TYPE_MD5);
1193 for (i = 0; i < sq.nstr; i++)
1194 solv_chksum_add(chk, sq.str[i], strlen(sq.str[i]) + 1);
1195 md5 = solv_chksum_get(chk, &md5l);
1196 s = pool_bin2hex(solv->pool, md5, md5l);
1197 chk = solv_chksum_free(chk, 0);
1203 testcase_problemid(Solver *solv, Id problem)
1208 const unsigned char *md5;
1212 /* we build a hash of all rules that define the problem */
1215 solver_findallproblemrules(solv, problem, &q);
1216 for (i = 0; i < q.count; i++)
1217 strqueue_push(&sq, testcase_ruleid(solv, q.elements[i]));
1219 strqueue_sort_u(&sq);
1220 chk = solv_chksum_create(REPOKEY_TYPE_MD5);
1221 for (i = 0; i < sq.nstr; i++)
1222 solv_chksum_add(chk, sq.str[i], strlen(sq.str[i]) + 1);
1223 md5 = solv_chksum_get(chk, &md5l);
1224 s = pool_bin2hex(solv->pool, md5, 4);
1225 chk = solv_chksum_free(chk, 0);
1231 testcase_solutionid(Solver *solv, Id problem, Id solution)
1235 const unsigned char *md5;
1239 intid = solver_solutionelement_internalid(solv, problem, solution);
1240 /* internal stuff! handle with care! */
1244 s = testcase_job2str(solv->pool, solv->job.elements[-intid - 1], solv->job.elements[-intid]);
1249 s = testcase_ruleid(solv, intid);
1251 chk = solv_chksum_create(REPOKEY_TYPE_MD5);
1252 solv_chksum_add(chk, s, strlen(s) + 1);
1253 md5 = solv_chksum_get(chk, &md5l);
1254 s = pool_bin2hex(solv->pool, md5, 4);
1255 chk = solv_chksum_free(chk, 0);
1259 static struct class2str {
1263 { SOLVER_TRANSACTION_ERASE, "erase" },
1264 { SOLVER_TRANSACTION_INSTALL, "install" },
1265 { SOLVER_TRANSACTION_REINSTALLED, "reinstall" },
1266 { SOLVER_TRANSACTION_DOWNGRADED, "downgrade" },
1267 { SOLVER_TRANSACTION_CHANGED, "change" },
1268 { SOLVER_TRANSACTION_UPGRADED, "upgrade" },
1269 { SOLVER_TRANSACTION_OBSOLETED, "obsolete" },
1270 { SOLVER_TRANSACTION_MULTIINSTALL, "multiinstall" },
1271 { SOLVER_TRANSACTION_MULTIREINSTALL, "multireinstall" },
1276 testcase_solverresult(Solver *solv, int resultflags)
1278 Pool *pool = solv->pool;
1286 if ((resultflags & TESTCASE_RESULT_TRANSACTION) != 0)
1288 Transaction *trans = solver_create_transaction(solv);
1292 for (i = 0; class2str[i].str; i++)
1295 transaction_classify_pkgs(trans, SOLVER_TRANSACTION_KEEP_PSEUDO, class2str[i].class, 0, 0, &q);
1296 for (j = 0; j < q.count; j++)
1300 if (pool->installed && pool->solvables[p].repo == pool->installed)
1301 op = transaction_obs_pkg(trans, p);
1302 s = pool_tmpjoin(pool, class2str[i].str, " ", testcase_solvid2str(pool, p));
1304 s = pool_tmpjoin(pool, s, " ", testcase_solvid2str(pool, op));
1305 strqueue_push(&sq, s);
1309 transaction_free(trans);
1311 if ((resultflags & TESTCASE_RESULT_PROBLEMS) != 0)
1313 char *probprefix, *solprefix;
1314 int problem, solution, element;
1317 pcnt = solver_problem_count(solv);
1318 for (problem = 1; problem <= pcnt; problem++)
1320 Id rid, from, to, dep;
1321 SolverRuleinfo rinfo;
1322 rid = solver_findproblemrule(solv, problem);
1323 s = testcase_problemid(solv, problem);
1324 probprefix = solv_dupjoin("problem ", s, 0);
1325 rinfo = solver_ruleinfo(solv, rid, &from, &to, &dep);
1326 s = pool_tmpjoin(pool, probprefix, " info ", solver_problemruleinfo2str(solv, rinfo, from, to, dep));
1327 strqueue_push(&sq, s);
1328 scnt = solver_solution_count(solv, problem);
1329 for (solution = 1; solution <= scnt; solution++)
1331 s = testcase_solutionid(solv, problem, solution);
1332 solprefix = solv_dupjoin(probprefix, " solution ", s);
1334 while ((element = solver_next_solutionelement(solv, problem, solution, element, &p, &op)) != 0)
1336 if (p == SOLVER_SOLUTION_JOB)
1337 s = pool_tmpjoin(pool, solprefix, " deljob ", testcase_job2str(pool, solv->job.elements[op - 1], solv->job.elements[op]));
1338 else if (p > 0 && op == 0)
1339 s = pool_tmpjoin(pool, solprefix, " erase ", testcase_solvid2str(pool, p));
1340 else if (p > 0 && op > 0)
1342 s = pool_tmpjoin(pool, solprefix, " replace ", testcase_solvid2str(pool, p));
1343 s = pool_tmpappend(pool, s, " ", testcase_solvid2str(pool, op));
1345 else if (p < 0 && op > 0)
1346 s = pool_tmpjoin(pool, solprefix, " allow ", testcase_solvid2str(pool, op));
1348 s = pool_tmpjoin(pool, solprefix, " unknown", 0);
1349 strqueue_push(&sq, s);
1351 solv_free(solprefix);
1353 solv_free(probprefix);
1357 if ((resultflags & TESTCASE_RESULT_ORPHANED) != 0)
1362 solver_get_orphaned(solv, &q);
1363 for (i = 0; i < q.count; i++)
1365 s = pool_tmpjoin(pool, "orphaned ", testcase_solvid2str(pool, q.elements[i]), 0);
1366 strqueue_push(&sq, s);
1371 if ((resultflags & TESTCASE_RESULT_RECOMMENDED) != 0)
1377 solver_get_recommendations(solv, &qr, &qs, 0);
1378 for (i = 0; i < qr.count; i++)
1380 s = pool_tmpjoin(pool, "recommended ", testcase_solvid2str(pool, qr.elements[i]), 0);
1381 strqueue_push(&sq, s);
1383 for (i = 0; i < qs.count; i++)
1385 s = pool_tmpjoin(pool, "suggested ", testcase_solvid2str(pool, qs.elements[i]), 0);
1386 strqueue_push(&sq, s);
1392 if ((resultflags & TESTCASE_RESULT_UNNEEDED) != 0)
1397 solver_get_unneeded(solv, &q, 0);
1398 for (i = 0; i < q.count; i++)
1400 s = pool_tmpjoin(pool, "unneeded ", testcase_solvid2str(pool, q.elements[i]), 0);
1401 strqueue_push(&sq, s);
1407 result = strqueue_join(&sq);
1414 testcase_write(Solver *solv, char *dir, int resultflags, const char *testcasename, const char *resultname)
1416 Pool *pool = solv->pool;
1427 testcasename = "testcase.t";
1429 resultname = "solver.result";
1431 if (mkdir(dir, 0777) && errno != EEXIST)
1433 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: could not create directory '%s'\n", dir);
1437 FOR_REPOS(repoid, repo)
1439 const char *name = testcase_repoid2str(pool, repoid);
1441 if (repo->subpriority)
1442 sprintf(priobuf, "%d.%d", repo->priority, repo->subpriority);
1444 sprintf(priobuf, "%d", repo->priority);
1445 out = pool_tmpjoin(pool, name, ".repo", ".gz");
1446 cmd = pool_tmpjoin(pool, "repo ", name, " ");
1447 cmd = pool_tmpappend(pool, cmd, priobuf, " ");
1448 cmd = pool_tmpappend(pool, cmd, "susetags ", out);
1449 strqueue_push(&sq, cmd);
1450 out = pool_tmpjoin(pool, dir, "/", out);
1451 if (!(fp = solv_xfopen(out, "w")))
1453 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: could not open '%s' for writing\n", out);
1457 testcase_write_susetags(repo, fp);
1460 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: write error\n");
1465 /* hmm, this is not optimal... we currently search for the lowest score */
1468 for (i = 0; i < pool->lastarch; i++)
1470 if (pool->id2arch[i] == 1 && !lowscore)
1472 if (pool->id2arch[i] > 0x10000 && (!lowscore || pool->id2arch[i] < lowscore))
1475 lowscore = pool->id2arch[i];
1478 cmd = pool_tmpjoin(pool, "system ", pool_id2str(pool, arch), pool->disttype == DISTTYPE_DEB ? " deb" : " rpm");
1479 if (pool->installed)
1480 cmd = pool_tmpappend(pool, cmd, " ", testcase_repoid2str(pool, pool->installed->repoid));
1481 strqueue_push(&sq, cmd);
1482 s = testcase_getpoolflags(solv->pool);
1485 cmd = pool_tmpjoin(pool, "poolflags ", s, 0);
1486 strqueue_push(&sq, cmd);
1489 if (pool->vendorclasses)
1492 for (i = 0; pool->vendorclasses[i]; i++)
1494 cmd = pool_tmpappend(pool, cmd ? cmd : "vendorclass", " ", pool->vendorclasses[i]);
1495 if (!pool->vendorclasses[i + 1])
1497 strqueue_push(&sq, cmd);
1504 s = testcase_getsolverflags(solv);
1507 cmd = pool_tmpjoin(pool, "solverflags ", s, 0);
1508 strqueue_push(&sq, cmd);
1511 /* now dump all the ns callback values we know */
1512 if (pool->nscallback)
1516 for (rid = 1; rid < pool->nrels; rid++)
1518 Reldep *rd = pool->rels + rid;
1519 if (rd->flags != REL_NAMESPACE || rd->name == NAMESPACE_OTHERPROVIDERS)
1521 /* check if we evaluated it, also skip empty results */
1522 if (!(d = pool->whatprovides_rel[rid]) || !pool->whatprovidesdata[d])
1524 cmd = pool_tmpjoin(pool, "namespace ", pool_id2str(pool, rd->name), "(");
1525 cmd = pool_tmpappend(pool, cmd, pool_id2str(pool, rd->evr), ")");
1526 for (; pool->whatprovidesdata[d]; d++)
1527 cmd = pool_tmpappend(pool, cmd, " ", testcase_solvid2str(pool, pool->whatprovidesdata[d]));
1528 strqueue_push(&sq, cmd);
1532 for (i = 0; i < solv->job.count; i += 2)
1534 cmd = (char *)testcase_job2str(pool, solv->job.elements[i], solv->job.elements[i + 1]);
1535 cmd = pool_tmpjoin(pool, "job ", cmd, 0);
1536 strqueue_push(&sq, cmd);
1543 for (i = 0; resultflags2str[i].str; i++)
1544 if ((resultflags & resultflags2str[i].flag) != 0)
1545 cmd = pool_tmpappend(pool, cmd, cmd ? "," : 0, resultflags2str[i].str);
1546 cmd = pool_tmpjoin(pool, "result ", cmd ? cmd : "?", 0);
1547 cmd = pool_tmpappend(pool, cmd, " ", resultname);
1548 strqueue_push(&sq, cmd);
1549 result = testcase_solverresult(solv, resultflags);
1550 if (!strcmp(resultname, "<inline>"))
1554 strqueue_init(&rsq);
1555 strqueue_split(&rsq, result);
1556 for (i = 0; i < rsq.nstr; i++)
1558 cmd = pool_tmpjoin(pool, "#>", rsq.str[i], 0);
1559 strqueue_push(&sq, cmd);
1561 strqueue_free(&rsq);
1565 out = pool_tmpjoin(pool, dir, "/", resultname);
1566 if (!(fp = fopen(out, "w")))
1568 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: could not open '%s' for writing\n", out);
1573 if (result && *result && fwrite(result, strlen(result), 1, fp) != 1)
1575 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: write error\n");
1582 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: write error\n");
1590 cmd = strqueue_join(&sq);
1591 out = pool_tmpjoin(pool, dir, "/", testcasename);
1592 if (!(fp = fopen(out, "w")))
1594 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: could not open '%s' for writing\n", out);
1598 if (*cmd && fwrite(cmd, strlen(cmd), 1, fp) != 1)
1600 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: write error\n");
1606 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: write error\n");
1616 testcase_read(Pool *pool, FILE *fp, char *testcase, Queue *job, char **resultp, int *resultflagsp)
1621 char *testcasedir, *s;
1627 int poolflagsreset = 0;
1629 if (!fp && !(fp = fopen(testcase, "r")))
1631 pool_debug(pool, SOLV_ERROR, "testcase_read: could not open '%s'\n", testcase);
1634 testcasedir = solv_strdup(testcase);
1635 if ((s = strrchr(testcasedir, '/')) != 0)
1640 buf = solv_malloc(bufl);
1645 if (bufp - buf + 16 > bufl)
1648 buf = solv_realloc(buf, bufl + 512);
1652 if (!fgets(bufp, bufl - (bufp - buf), fp))
1656 if (!l || buf[l - 1] != '\n')
1663 while (*s && (*s == ' ' || *s == '\t'))
1665 if (!*s || *s == '#')
1668 /* split it in pieces */
1671 while (*s == ' ' || *s == '\t')
1675 pieces = solv_extend(pieces, npieces, 1, sizeof(*pieces), 7);
1676 pieces[npieces++] = s;
1677 while (*s && *s != ' ' && *s != '\t')
1682 pieces = solv_extend(pieces, npieces, 1, sizeof(*pieces), 7);
1683 pieces[npieces] = 0;
1684 if (!strcmp(pieces[0], "repo") && npieces >= 4)
1686 Repo *repo = repo_create(pool, pieces[1]);
1692 if (!poolflagsreset)
1695 testcase_resetpoolflags(pool); /* hmm */
1697 if (sscanf(pieces[2], "%d.%d", &prio, &subprio) != 2)
1700 prio = atoi(pieces[2]);
1702 repo->priority = prio;
1703 repo->subpriority = subprio;
1704 if (strcmp(pieces[3], "empty") != 0)
1706 rdata = pool_tmpjoin(pool, testcasedir, pieces[4], 0);
1707 if ((rfp = solv_xfopen(rdata, "r")) == 0)
1709 pool_debug(pool, SOLV_ERROR, "testcase_read: could not open '%s'\n", rdata);
1711 else if (!strcmp(pieces[3], "susetags"))
1713 testcase_add_susetags(repo, rfp, 0);
1716 else if (!strcmp(pieces[3], "solv"))
1718 repo_add_solv(repo, rfp, 0);
1724 pool_debug(pool, SOLV_ERROR, "testcase_read: unknown repo type for repo '%s'\n", repo->name);
1728 else if (!strcmp(pieces[0], "system") && npieces >= 3)
1731 pool_setarch(pool, pieces[1]);
1734 Repo *repo = testcase_str2repo(pool, pieces[3]);
1736 pool_debug(pool, SOLV_ERROR, "testcase_read: system: unknown repo '%s'\n", pieces[3]);
1738 pool_set_installed(pool, repo);
1741 else if (!strcmp(pieces[0], "job") && npieces > 1)
1747 pool_addfileprovides(pool);
1748 pool_createwhatprovides(pool);
1752 for (sp = pieces[1]; sp < pieces[npieces - 1]; sp++)
1755 how = testcase_str2job(pool, pieces[1], &what);
1756 if (how >= 0 && job)
1757 queue_push2(job, how, what);
1759 else if (!strcmp(pieces[0], "vendorclass") && npieces > 1)
1761 pool_addvendorclass(pool, (const char **)(pieces + 1));
1763 else if (!strcmp(pieces[0], "namespace") && npieces > 1)
1765 int i = strlen(pieces[1]);
1766 s = strchr(pieces[1], '(');
1767 if (!s && pieces[1][i - 1] != ')')
1769 pool_debug(pool, SOLV_ERROR, "testcase_read: bad namespace '%s'\n", pieces[1]);
1777 pieces[1][i - 1] = 0;
1778 name = pool_str2id(pool, pieces[1], 1);
1779 evr = pool_str2id(pool, s + 1, 1);
1781 pieces[1][i - 1] = ')';
1782 id = pool_rel2id(pool, name, evr, REL_NAMESPACE, 1);
1783 for (i = 2; i < npieces; i++)
1784 queue_push(&q, testcase_str2solvid(pool, pieces[i]));
1785 /* now do the callback */
1788 pool_addfileprovides(pool);
1789 pool_createwhatprovides(pool);
1792 pool->whatprovides_rel[GETRELID(id)] = pool_queuetowhatprovides(pool, &q);
1796 else if (!strcmp(pieces[0], "poolflags"))
1799 if (!poolflagsreset)
1802 testcase_resetpoolflags(pool); /* hmm */
1804 for (i = 1; i < npieces; i++)
1805 testcase_setpoolflags(pool, pieces[i]);
1807 else if (!strcmp(pieces[0], "solverflags") && npieces > 1)
1812 solv = solver_create(pool);
1813 testcase_resetsolverflags(solv);
1815 for (i = 1; i < npieces; i++)
1816 testcase_setsolverflags(solv, pieces[i]);
1818 else if (!strcmp(pieces[0], "result") && npieces > 2)
1822 int resultflags = 0;
1823 char *s = pieces[1];
1827 char *se = strchr(s, ',');
1830 for (i = 0; resultflags2str[i].str; i++)
1831 if (!strcmp(s, resultflags2str[i].str))
1833 resultflags |= resultflags2str[i].flag;
1836 if (!resultflags2str[i].str)
1837 pool_debug(pool, SOLV_ERROR, "result: unknown flag '%s'\n", s);
1841 rdata = pool_tmpjoin(pool, testcasedir, pieces[2], 0);
1842 if (!strcmp(pieces[2], "<inline>"))
1845 rfp = fopen(rdata, "r");
1848 pool_debug(pool, SOLV_ERROR, "testcase_read: could not open '%s'\n", rdata);
1852 /* slurp it in... */
1853 char *result = solv_malloc(1024);
1859 if (rp - result + 256 >= resultl)
1861 resultl = rp - result;
1862 result = solv_realloc(result, resultl + 1024);
1863 rp = result + resultl;
1868 if (!fgets(rp, resultl - (rp - result), fp))
1873 if (rl && (rp == result || rp[-1] == '\n'))
1875 if (rl > 1 && rp[0] == '#' && rp[1] == '>')
1877 memmove(rp, rp + 2, rl - 2);
1882 while (rl + 16 > bufl)
1884 buf = solv_realloc(buf, bufl + 512);
1887 memmove(buf, rp, rl);
1888 if (buf[rl - 1] == '\n')
1900 rl = fread(rp, 1, resultl - (rp - result), rfp);
1915 *resultflagsp = resultflags;
1918 else if (!strcmp(pieces[0], "nextjob") && npieces == 1)
1924 pool_debug(pool, SOLV_ERROR, "testcase_read: cannot parse command '%s'\n", pieces[0]);
1927 buf = solv_free(buf);
1928 pieces = solv_free(pieces);
1929 solv_free(testcasedir);
1932 pool_addfileprovides(pool);
1933 pool_createwhatprovides(pool);
1937 solv = solver_create(pool);
1938 testcase_resetsolverflags(solv);
1946 testcase_resultdiff(char *result1, char *result2)
1948 Strqueue sq1, sq2, osq;
1950 strqueue_init(&sq1);
1951 strqueue_init(&sq2);
1952 strqueue_init(&osq);
1953 strqueue_split(&sq1, result1);
1954 strqueue_split(&sq2, result2);
1955 strqueue_sort(&sq1);
1956 strqueue_sort(&sq2);
1957 strqueue_diff(&sq1, &sq2, &osq);
1958 r = osq.nstr ? strqueue_join(&osq) : 0;
1959 strqueue_free(&sq1);
1960 strqueue_free(&sq2);
1961 strqueue_free(&osq);