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_ARCHCHANGE, "allowarchchange", 0 },
85 { SOLVER_FLAG_ALLOW_VENDORCHANGE, "allowvendorchange", 0 },
86 { SOLVER_FLAG_ALLOW_UNINSTALL, "allowuninstall", 0 },
87 { SOLVER_FLAG_NO_UPDATEPROVIDE, "noupdateprovide", 0 },
88 { SOLVER_FLAG_SPLITPROVIDES, "splitprovides", 0 },
89 { SOLVER_FLAG_IGNORE_RECOMMENDED, "ignorerecommended", 0 },
90 { SOLVER_FLAG_ADD_ALREADY_RECOMMENDED, "addalreadyrecommended", 0 },
91 { SOLVER_FLAG_NO_INFARCHCHECK, "noinfarchcheck", 0 },
95 static struct poolflags2str {
100 { POOL_FLAG_PROMOTEEPOCH, "promoteepoch", 0 },
101 { POOL_FLAG_FORBIDSELFCONFLICTS, "forbidselfconflicts", 0 },
102 { POOL_FLAG_OBSOLETEUSESPROVIDES, "obsoleteusesprovides", 0 },
103 { POOL_FLAG_IMPLICITOBSOLETEUSESPROVIDES, "implicitobsoleteusesprovides", 0 },
104 { POOL_FLAG_OBSOLETEUSESCOLORS, "obsoleteusescolors", 0 },
105 { POOL_FLAG_NOINSTALLEDOBSOLETES, "noinstalledobsoletes", 0 },
106 { POOL_FLAG_HAVEDISTEPOCH, "havedistepoch", 0 },
111 typedef struct strqueue {
116 #define STRQUEUE_BLOCK 63
119 strqueue_init(Strqueue *q)
126 strqueue_free(Strqueue *q)
129 for (i = 0; i < q->nstr; i++)
130 solv_free(q->str[i]);
131 q->str = solv_free(q->str);
136 strqueue_push(Strqueue *q, const char *s)
138 q->str = solv_extend(q->str, q->nstr, 1, sizeof(*q->str), STRQUEUE_BLOCK);
139 q->str[q->nstr++] = solv_strdup(s);
143 strqueue_pushjoin(Strqueue *q, const char *s1, const char *s2, const char *s3)
145 q->str = solv_extend(q->str, q->nstr, 1, sizeof(*q->str), STRQUEUE_BLOCK);
146 q->str[q->nstr++] = solv_dupjoin(s1, s2, s3);
150 strqueue_sort_cmp(const void *ap, const void *bp, void *dp)
152 const char *a = *(const char **)ap;
153 const char *b = *(const char **)bp;
154 return strcmp(a ? a : "", b ? b : "");
158 strqueue_sort(Strqueue *q)
161 solv_sort(q->str, q->nstr, sizeof(*q->str), strqueue_sort_cmp, 0);
165 strqueue_sort_u(Strqueue *q)
169 for (i = j = 0; i < q->nstr; i++)
170 if (!j || strqueue_sort_cmp(q->str + i, q->str + j - 1, 0) != 0)
171 q->str[j++] = q->str[i];
176 strqueue_join(Strqueue *q)
180 for (i = 0; i < q->nstr; i++)
182 l += strlen(q->str[i]) + 1;
183 l++; /* trailing \0 */
186 for (i = 0; i < q->nstr; i++)
189 strcpy(rp, q->str[i]);
198 strqueue_split(Strqueue *q, const char *s)
203 while ((p = strchr(s, '\n')) != 0)
205 q->str = solv_extend(q->str, q->nstr, 1, sizeof(*q->str), STRQUEUE_BLOCK);
206 q->str[q->nstr] = solv_malloc(p - s + 1);
208 memcpy(q->str[q->nstr], s, p - s);
209 q->str[q->nstr][p - s] = 0;
218 strqueue_diff(Strqueue *sq1, Strqueue *sq2, Strqueue *osq)
221 while (i < sq1->nstr && j < sq2->nstr)
223 int r = strqueue_sort_cmp(sq1->str + i, sq2->str + j, 0);
227 strqueue_pushjoin(osq, "-", sq1->str[i++], 0);
229 strqueue_pushjoin(osq, "+", sq2->str[j++], 0);
231 while (i < sq1->nstr)
232 strqueue_pushjoin(osq, "-", sq1->str[i++], 0);
233 while (j < sq2->nstr)
234 strqueue_pushjoin(osq, "+", sq2->str[j++], 0);
238 pool_isknownarch(Pool *pool, Id id)
240 if (!id || id == ID_EMPTY)
242 if (id == ARCH_SRC || id == ARCH_NOSRC || id == ARCH_NOARCH)
244 if (!pool->id2arch || (id > pool->lastarch || !pool->id2arch[id]))
250 testcase_str2dep(Pool *pool, char *s)
256 if ((n = strchr(s, '|')) != 0)
258 id = testcase_str2dep(pool, n + 1);
260 id = pool_rel2id(pool, testcase_str2dep(pool, s), id, REL_OR, 1);
264 while (*s == ' ' || *s == '\t')
267 while (*s && *s != ' ' && *s != '\t' && *s != '<' && *s != '=' && *s != '>')
271 while (*s && *s != ')')
277 if ((a = strchr(n, '.')) != 0 && a + 1 < s && s[-1] != ')')
279 Id archid = pool_strn2id(pool, a + 1, s - (a + 1), 0);
280 if (pool_isknownarch(pool, archid))
282 id = pool_strn2id(pool, n, a - n, 1);
283 id = pool_rel2id(pool, id, archid, REL_ARCH, 1);
286 id = pool_strn2id(pool, n, s - n, 1);
289 id = pool_strn2id(pool, n, s - n, 1);
292 while (*s == ' ' || *s == '\t')
308 while (*s == ' ' || *s == '\t')
311 while (*s && *s != ' ' && *s != '\t')
313 return pool_rel2id(pool, id, pool_strn2id(pool, n, s - n, 1), flags, 1);
317 testcase_repoid2str(Pool *pool, Id repoid)
319 Repo *repo = pool_id2repo(pool, repoid);
322 char *r = pool_tmpjoin(pool, repo->name, 0, 0);
324 for (rp = r; *rp; rp++)
325 if (*rp == ' ' || *rp == '\t')
332 sprintf(buf, "#%d", repoid);
333 return pool_tmpjoin(pool, buf, 0, 0);
338 testcase_solvid2str(Pool *pool, Id p)
340 Solvable *s = pool->solvables + p;
341 const char *n, *e, *a;
344 if (p == SYSTEMSOLVABLE)
346 n = pool_id2str(pool, s->name);
347 e = pool_id2str(pool, s->evr);
348 a = pool_id2str(pool, s->arch);
349 str = pool_alloctmpspace(pool, strlen(n) + strlen(e) + strlen(a) + 3);
350 sprintf(str, "%s-%s.%s", n, e, a);
352 return pool_tmpappend(pool, str, "@", 0);
356 char *str2 = pool_tmpappend(pool, str, "@", s->repo->name);
358 if (str2[l] == ' ' || str2[l] == '\t')
362 sprintf(buf, "@#%d", s->repo->repoid);
363 return pool_tmpappend(pool, str, buf, 0);
367 testcase_str2repo(Pool *pool, const char *str)
371 if (str[0] == '#' && (str[1] >= '0' && str[1] <= '9'))
375 for (j = 1; str[j] >= '0' && str[j] <= '9'; j++)
376 repoid = repoid * 10 + (str[j] - '0');
377 if (!str[j] && repoid > 0 && repoid < pool->nrepos)
378 repo = pool_id2repo(pool, repoid);
382 FOR_REPOS(repoid, repo)
387 l = strlen(repo->name);
388 for (i = 0; i < l; i++)
390 int c = repo->name[i];
391 if (c == ' ' || c == '\t')
396 if (i == l && !str[l])
399 if (repoid >= pool->nrepos)
406 testcase_str2solvid(Pool *pool, const char *str)
408 int i, l = strlen(str);
415 if (*str == '@' && !strcmp(str, "@SYSTEM"))
416 return SYSTEMSOLVABLE;
418 for (i = l - 1; i >= 0; i--)
419 if (str[i] == '@' && (repo = testcase_str2repo(pool, str + i + 1)) != 0)
424 /* now find the arch (if present) */
426 for (i = repostart - 1; i > 0; i--)
429 arch = pool_strn2id(pool, str + i + 1, repostart - (i + 1), 0);
434 /* now find the name */
435 for (i = repostart - 1; i > 0; i--)
439 Id nid, evrid, p, pp;
440 nid = pool_strn2id(pool, str, i, 0);
443 evrid = pool_strn2id(pool, str + i + 1, repostart - (i + 1), 0);
446 FOR_PROVIDES(p, pp, nid)
448 Solvable *s = pool->solvables + p;
449 if (s->name != nid || s->evr != evrid)
451 if (repo && s->repo != repo)
453 if (arch && s->arch != arch)
463 testcase_job2str(Pool *pool, Id how, Id what)
470 Id select = how & SOLVER_SELECTMASK;
472 for (i = 0; job2str[i].str; i++)
473 if ((how & SOLVER_JOBMASK) == job2str[i].job)
475 jobstr = job2str[i].str ? job2str[i].str : "unknown";
476 if (select == SOLVER_SOLVABLE)
479 pkgstr = testcase_solvid2str(pool, what);
481 else if (select == SOLVER_SOLVABLE_NAME)
484 pkgstr = pool_dep2str(pool, what);
486 else if (select == SOLVER_SOLVABLE_PROVIDES)
488 selstr = " provides ";
489 pkgstr = pool_dep2str(pool, what);
491 else if (select == SOLVER_SOLVABLE_ONE_OF)
496 while ((p = pool->whatprovidesdata[what++]) != 0)
498 const char *s = testcase_solvid2str(pool, p);
501 pkgstr = pool_tmpappend(pool, pkgstr, " ", s);
502 pool_freetmpspace(pool, s);
510 else if (select == SOLVER_SOLVABLE_REPO)
512 Repo *repo = pool_id2repo(pool, what);
517 sprintf(buf, "#%d", repo->repoid);
518 pkgstr = pool_tmpjoin(pool, buf, 0, 0);
521 pkgstr = pool_tmpjoin(pool, repo->name, 0, 0);
523 else if (select == SOLVER_SOLVABLE_ALL)
530 selstr = " unknown ";
533 ret = pool_tmpjoin(pool, jobstr, selstr, pkgstr);
535 ret = pool_tmpappend(pool, ret, " ", 0);
536 for (i = 0; jobflags2str[i].str; i++)
537 if ((how & jobflags2str[i].flag) != 0)
538 ret = pool_tmpappend(pool, ret, ",", jobflags2str[i].str);
544 ret = pool_tmpappend(pool, ret, "]", 0);
550 testcase_str2job(Pool *pool, const char *str, Id *whatp)
560 /* so we can patch it */
561 s = pool_tmpjoin(pool, str, 0, 0);
562 /* split it in pieces */
565 while (*s == ' ' || *s == '\t')
569 pieces = solv_extend(pieces, npieces, 1, sizeof(*pieces), 7);
570 pieces[npieces++] = s;
571 while (*s && *s != ' ' && *s != '\t')
578 pool_debug(pool, SOLV_ERROR, "str2job: bad line '%s'\n", str);
582 for (i = 0; job2str[i].str; i++)
583 if (!strcmp(pieces[0], job2str[i].str))
587 pool_debug(pool, SOLV_ERROR, "str2job: unknown job '%s'\n", str);
590 job = job2str[i].job;
593 char *flags = pieces[npieces - 1];
595 if (*flags == '[' && flags[strlen(flags) - 1] == ']')
599 flags[strlen(flags) - 1] = ',';
602 for (nf = flags; *nf != ','; nf++)
605 for (i = 0; jobflags2str[i].str; i++)
606 if (!strcmp(flags, jobflags2str[i].str))
608 if (!jobflags2str[i].str)
610 pool_debug(pool, SOLV_ERROR, "str2job: unknown jobflags in '%s'\n", str);
613 job |= jobflags2str[i].flag;
618 if (!strcmp(pieces[1], "pkg"))
622 pool_debug(pool, SOLV_ERROR, "str2job: bad pkg selector in '%s'\n", str);
625 job |= SOLVER_SOLVABLE;
626 what = testcase_str2solvid(pool, pieces[2]);
629 pool_debug(pool, SOLV_ERROR, "str2job: unknown package '%s'\n", pieces[2]);
633 else if (!strcmp(pieces[1], "name") || !strcmp(pieces[1], "provides"))
635 /* join em again for dep2str... */
637 for (sp = pieces[2]; sp < pieces[npieces - 1]; sp++)
640 what = testcase_str2dep(pool, pieces[2]);
641 if (pieces[1][0] == 'n')
642 job |= SOLVER_SOLVABLE_NAME;
644 job |= SOLVER_SOLVABLE_PROVIDES;
646 else if (!strcmp(pieces[1], "oneof"))
649 job |= SOLVER_SOLVABLE_ONE_OF;
651 if (npieces > 3 && strcmp(pieces[2], "nothing") != 0)
653 for (i = 2; i < npieces; i++)
655 Id p = testcase_str2solvid(pool, pieces[i]);
658 pool_debug(pool, SOLV_ERROR, "str2job: unknown package '%s'\n", pieces[i]);
665 what = pool_queuetowhatprovides(pool, &q);
668 else if (!strcmp(pieces[1], "repo"))
673 pool_debug(pool, SOLV_ERROR, "str2job: bad line '%s'\n", str);
676 repo = testcase_str2repo(pool, pieces[2]);
679 pool_debug(pool, SOLV_ERROR, "str2job: unknown repo '%s'\n", pieces[2]);
682 job |= SOLVER_SOLVABLE_REPO;
685 else if (!strcmp(pieces[1], "all"))
687 if (npieces != 3 && strcmp(pieces[2], "packages") != 0)
689 pool_debug(pool, SOLV_ERROR, "str2job: bad line '%s'\n", str);
692 job |= SOLVER_SOLVABLE_ALL;
697 pool_debug(pool, SOLV_ERROR, "str2job: unknown selection in '%s'\n", str);
705 writedeps(Repo *repo, FILE *fp, const char *tag, Id key, Solvable *s, Offset off)
707 Pool *pool = repo->pool;
714 dp = repo->idarraydata + off;
716 while ((id = *dp++) != 0)
718 if (key == SOLVABLE_REQUIRES && id == SOLVABLE_PREREQMARKER)
721 fprintf(fp, "-%s\n", tag);
726 if (key == SOLVABLE_PROVIDES && id == SOLVABLE_FILEMARKER)
731 idstr = pool_dep2str(pool, id);
734 Reldep *rd = GETRELDEP(pool, id);
735 if (key == SOLVABLE_CONFLICTS && rd->flags == REL_NAMESPACE && rd->name == NAMESPACE_OTHERPROVIDERS)
737 if (!strncmp(idstr, "namespace:", 10))
740 if (key == SOLVABLE_SUPPLEMENTS)
742 if (rd->flags == REL_NAMESPACE && rd->name == NAMESPACE_FILESYSTEM)
744 if (!strncmp(idstr, "namespace:", 10))
747 else if (rd->flags == REL_NAMESPACE && rd->name == NAMESPACE_MODALIAS)
749 if (!strncmp(idstr, "namespace:", 10))
752 else if (rd->flags == REL_AND)
754 /* either packageand chain or modalias */
756 if (ISRELDEP(rd->evr))
758 Reldep *mrd = GETRELDEP(pool, rd->evr);
759 if (mrd->flags == REL_NAMESPACE && mrd->name == NAMESPACE_MODALIAS)
761 idstr = pool_tmpjoin(pool, "modalias(", pool_dep2str(pool, rd->name), ":");
762 idstr = pool_tmpappend(pool, idstr, pool_dep2str(pool, mrd->evr), ")");
764 else if (mrd->flags >= 8)
769 /* must be and chain */
770 idstr = pool_dep2str(pool, rd->evr);
776 rd = GETRELDEP(pool, id);
777 if (rd->flags != REL_AND)
779 idstr = pool_tmpjoin(pool, pool_dep2str(pool, rd->evr), ":", idstr);
781 idstr = pool_tmpjoin(pool, pool_dep2str(pool, id), ":", idstr);
782 idstr = pool_tmpjoin(pool, "packageand(", idstr, ")");
785 else if (rd->flags >= 8)
791 fprintf(fp, "+%s\n", tag);
794 fprintf(fp, "%s\n", idstr);
796 if (key == SOLVABLE_PROVIDES)
798 /* add the filelist */
800 dataiterator_init(&di, pool, repo, s - pool->solvables, SOLVABLE_FILELIST, 0, 0);
801 while (dataiterator_step(&di))
803 const char *s = repodata_dir2str(di.data, di.kv.id, di.kv.str);
806 Id id = pool_str2id(pool, s, 0);
809 for (dp = prvdp; *dp; dp++)
813 continue; /* already included */
818 fprintf(fp, "+%s", tag);
821 fprintf(fp, "%s\n", s);
825 fprintf(fp, "-%s\n", tag);
829 testcase_write_susetags(Repo *repo, FILE *fp)
831 Pool *pool = repo->pool;
841 fprintf(fp, "=Ver: 2.0\n");
842 FOR_REPO_SOLVABLES(repo, p, s)
844 name = pool_id2str(pool, s->name);
845 evr = pool_id2str(pool, s->evr);
846 arch = pool_id2str(pool, s->arch);
847 release = strrchr(evr, '-');
849 release = evr + strlen(evr);
850 fprintf(fp, "=Pkg: %s %.*s %s %s\n", name, (int)(release - evr), evr, *release && release[1] ? release + 1 : "-", arch);
851 tmp = solvable_lookup_str(s, SOLVABLE_SUMMARY);
853 fprintf(fp, "=Sum: %s\n", tmp);
854 writedeps(repo, fp, "Req:", SOLVABLE_REQUIRES, s, s->requires);
855 writedeps(repo, fp, "Prv:", SOLVABLE_PROVIDES, s, s->provides);
856 writedeps(repo, fp, "Obs:", SOLVABLE_OBSOLETES, s, s->obsoletes);
857 writedeps(repo, fp, "Con:", SOLVABLE_CONFLICTS, s, s->conflicts);
858 writedeps(repo, fp, "Rec:", SOLVABLE_RECOMMENDS, s, s->recommends);
859 writedeps(repo, fp, "Sup:", SOLVABLE_SUPPLEMENTS, s, s->supplements);
860 writedeps(repo, fp, "Sug:", SOLVABLE_SUGGESTS, s, s->suggests);
861 writedeps(repo, fp, "Enh:", SOLVABLE_ENHANCES, s, s->enhances);
863 fprintf(fp, "=Vnd: %s\n", pool_id2str(pool, s->vendor));
864 ti = solvable_lookup_num(s, SOLVABLE_BUILDTIME, 0);
866 fprintf(fp, "=Tim: %u\n", ti);
872 adddep(Repo *repo, Offset olddeps, char *str, Id marker)
874 Id id = *str == '/' ? pool_str2id(repo->pool, str, 1) : testcase_str2dep(repo->pool, str);
875 return repo_addid_dep(repo, olddeps, id, marker);
879 finish_solvable(Pool *pool, Repodata *data, Solvable *s, char *filelist, int nfilelist)
885 for (l = 0; l < nfilelist; l += strlen(filelist + l) + 1)
887 char *p = strrchr(filelist + l, '/');
891 did = repodata_str2dir(data, filelist + l, 1);
894 did = repodata_str2dir(data, "/", 1);
895 repodata_add_dirstr(data, s - pool->solvables, SOLVABLE_FILELIST, did, p);
898 if (s->name && s->arch != ARCH_SRC && s->arch != ARCH_NOSRC)
899 s->provides = repo_addid_dep(s->repo, s->provides, pool_rel2id(pool, s->name, s->evr, REL_EQ, 1), 0);
900 s->supplements = repo_fix_supplements(s->repo, s->provides, s->supplements, 0);
901 s->conflicts = repo_fix_conflicts(s->repo, s->conflicts);
904 /* stripped down version of susetags parser used for testcases */
906 testcase_add_susetags(Repo *repo, FILE *fp, int flags)
908 Pool *pool = repo->pool;
921 data = repo_add_repodata(repo, flags);
926 line = solv_malloc(aline);
930 if (linep - line + 16 > aline)
932 aline = linep - line;
933 line = solv_realloc(line, aline + 512);
934 linep = line + aline;
937 if (!fgets(linep, aline - (linep - line), fp))
939 linep += strlen(linep);
940 if (linep == line || linep[-1] != '\n')
943 linep = line + intag;
946 if (line[intag] == '-' && !strncmp(line + 1, line + intag + 1, intag - 2))
953 else if (line[0] == '+' && line[1] && line[1] != ':')
955 char *tagend = strchr(line, ':');
960 intag = tagend + 2 - line;
961 linep = line + intag;
964 if (*line != '=' || !line[1] || !line[2] || !line[3] || line[4] != ':')
966 tag = line[1] << 16 | line[2] << 8 | line[3];
969 case 'P' << 16 | 'k' << 8 | 'g':
971 finish_solvable(pool, data, s, filelist, nfilelist);
973 if (split(line + 5, sp, 5) != 4)
975 s = pool_id2solvable(pool, repo_add_solvable(repo));
976 s->name = pool_str2id(pool, sp[0], 1);
977 /* join back version and release */
978 if (sp[2] && !(sp[2][0] == '-' && !sp[2][1]))
980 s->evr = makeevr(pool, sp[1]);
981 s->arch = pool_str2id(pool, sp[3], 1);
983 case 'S' << 16 | 'u' << 8 | 'm':
984 repodata_set_str(data, s - pool->solvables, SOLVABLE_SUMMARY, line + 6);
986 case 'V' << 16 | 'n' << 8 | 'd':
987 s->vendor = pool_str2id(pool, line + 6, 1);
989 case 'T' << 16 | 'i' << 8 | 'm':
992 repodata_set_num(data, s - pool->solvables, SOLVABLE_BUILDTIME, t);
994 case 'R' << 16 | 'e' << 8 | 'q':
995 s->requires = adddep(repo, s->requires, line + 6, -SOLVABLE_PREREQMARKER);
997 case 'P' << 16 | 'r' << 8 | 'q':
998 s->requires = adddep(repo, s->requires, line + 6, SOLVABLE_PREREQMARKER);
1000 case 'P' << 16 | 'r' << 8 | 'v':
1003 int l = strlen(line + 6) + 1;
1004 if (nfilelist + l > afilelist)
1006 afilelist = nfilelist + l + 512;
1007 filelist = solv_realloc(filelist, afilelist);
1009 memcpy(filelist + nfilelist, line + 6, l);
1016 for (l = 0; l < nfilelist; l += strlen(filelist + l) + 1)
1017 s->provides = repo_addid_dep(repo, s->provides, pool_str2id(pool, filelist + l, 1), 0);
1020 s->provides = adddep(repo, s->provides, line + 6, 0);
1022 case 'O' << 16 | 'b' << 8 | 's':
1023 s->obsoletes = adddep(repo, s->obsoletes, line + 6, 0);
1025 case 'C' << 16 | 'o' << 8 | 'n':
1026 s->conflicts = adddep(repo, s->conflicts, line + 6, 0);
1028 case 'R' << 16 | 'e' << 8 | 'c':
1029 s->recommends = adddep(repo, s->recommends, line + 6, 0);
1031 case 'S' << 16 | 'u' << 8 | 'p':
1032 s->supplements = adddep(repo, s->supplements, line + 6, 0);
1034 case 'S' << 16 | 'u' << 8 | 'g':
1035 s->suggests = adddep(repo, s->suggests, line + 6, 0);
1037 case 'E' << 16 | 'n' << 8 | 'h':
1038 s->enhances = adddep(repo, s->enhances, line + 6, 0);
1045 finish_solvable(pool, data, s, filelist, nfilelist);
1047 solv_free(filelist);
1048 repodata_free_dircache(data);
1049 if (!(flags & REPO_NO_INTERNALIZE))
1050 repodata_internalize(data);
1055 testcase_getpoolflags(Pool *pool)
1057 const char *str = 0;
1059 for (i = 0; poolflags2str[i].str; i++)
1061 v = pool_get_flag(pool, poolflags2str[i].flag);
1062 if (v == poolflags2str[i].def)
1064 str = pool_tmpappend(pool, str, v ? " " : " !", poolflags2str[i].str);
1066 return str ? str + 1 : "";
1070 testcase_setpoolflags(Pool *pool, const char *str)
1072 const char *p = str, *s;
1076 while (*p == ' ' || *p == '\t' || *p == ',')
1087 while (*p && *p != ' ' && *p != '\t' && *p != ',')
1089 for (i = 0; poolflags2str[i].str; i++)
1090 if (!strncmp(poolflags2str[i].str, s, p - s) && poolflags2str[i].str[p - s] == 0)
1092 if (!poolflags2str[i].str)
1094 pool_debug(pool, SOLV_ERROR, "setpoolflags: unknown flag '%.*s'\n", (int)(p - s), s);
1097 pool_set_flag(pool, poolflags2str[i].flag, v);
1103 testcase_resetpoolflags(Pool *pool)
1106 for (i = 0; poolflags2str[i].str; i++)
1107 pool_set_flag(pool, poolflags2str[i].flag, poolflags2str[i].def);
1111 testcase_getsolverflags(Solver *solv)
1113 Pool *pool = solv->pool;
1114 const char *str = 0;
1116 for (i = 0; solverflags2str[i].str; i++)
1118 v = solver_get_flag(solv, solverflags2str[i].flag);
1119 if (v == solverflags2str[i].def)
1121 str = pool_tmpappend(pool, str, v ? " " : " !", solverflags2str[i].str);
1123 return str ? str + 1 : "";
1127 testcase_setsolverflags(Solver *solv, const char *str)
1129 const char *p = str, *s;
1133 while (*p == ' ' || *p == '\t' || *p == ',')
1144 while (*p && *p != ' ' && *p != '\t' && *p != ',')
1146 for (i = 0; solverflags2str[i].str; i++)
1147 if (!strncmp(solverflags2str[i].str, s, p - s) && solverflags2str[i].str[p - s] == 0)
1149 if (!solverflags2str[i].str)
1151 pool_debug(solv->pool, SOLV_ERROR, "setsolverflags: unknown flag '%.*s'\n", (int)(p - s), s);
1154 solver_set_flag(solv, solverflags2str[i].flag, v);
1160 testcase_resetsolverflags(Solver *solv)
1163 for (i = 0; solverflags2str[i].str; i++)
1164 solver_set_flag(solv, solverflags2str[i].flag, solverflags2str[i].def);
1168 testcase_ruleid(Solver *solv, Id rid)
1174 const unsigned char *md5;
1180 solver_ruleliterals(solv, rid, &q);
1181 for (i = 0; i < q.count; i++)
1183 Id p = q.elements[i];
1184 s = testcase_solvid2str(solv->pool, p > 0 ? p : -p);
1186 s = pool_tmpjoin(solv->pool, "!", s, 0);
1187 strqueue_push(&sq, s);
1190 strqueue_sort_u(&sq);
1191 chk = solv_chksum_create(REPOKEY_TYPE_MD5);
1192 for (i = 0; i < sq.nstr; i++)
1193 solv_chksum_add(chk, sq.str[i], strlen(sq.str[i]) + 1);
1194 md5 = solv_chksum_get(chk, &md5l);
1195 s = pool_bin2hex(solv->pool, md5, md5l);
1196 chk = solv_chksum_free(chk, 0);
1202 testcase_problemid(Solver *solv, Id problem)
1207 const unsigned char *md5;
1211 /* we build a hash of all rules that define the problem */
1214 solver_findallproblemrules(solv, problem, &q);
1215 for (i = 0; i < q.count; i++)
1216 strqueue_push(&sq, testcase_ruleid(solv, q.elements[i]));
1218 strqueue_sort_u(&sq);
1219 chk = solv_chksum_create(REPOKEY_TYPE_MD5);
1220 for (i = 0; i < sq.nstr; i++)
1221 solv_chksum_add(chk, sq.str[i], strlen(sq.str[i]) + 1);
1222 md5 = solv_chksum_get(chk, &md5l);
1223 s = pool_bin2hex(solv->pool, md5, 4);
1224 chk = solv_chksum_free(chk, 0);
1230 testcase_solutionid(Solver *solv, Id problem, Id solution)
1234 const unsigned char *md5;
1238 intid = solver_solutionelement_internalid(solv, problem, solution);
1239 /* internal stuff! handle with care! */
1243 s = testcase_job2str(solv->pool, solv->job.elements[-intid - 1], solv->job.elements[-intid]);
1248 s = testcase_ruleid(solv, intid);
1250 chk = solv_chksum_create(REPOKEY_TYPE_MD5);
1251 solv_chksum_add(chk, s, strlen(s) + 1);
1252 md5 = solv_chksum_get(chk, &md5l);
1253 s = pool_bin2hex(solv->pool, md5, 4);
1254 chk = solv_chksum_free(chk, 0);
1258 static struct class2str {
1262 { SOLVER_TRANSACTION_ERASE, "erase" },
1263 { SOLVER_TRANSACTION_INSTALL, "install" },
1264 { SOLVER_TRANSACTION_REINSTALLED, "reinstall" },
1265 { SOLVER_TRANSACTION_DOWNGRADED, "downgrade" },
1266 { SOLVER_TRANSACTION_CHANGED, "change" },
1267 { SOLVER_TRANSACTION_UPGRADED, "upgrade" },
1268 { SOLVER_TRANSACTION_OBSOLETED, "obsolete" },
1269 { SOLVER_TRANSACTION_MULTIINSTALL, "multiinstall" },
1270 { SOLVER_TRANSACTION_MULTIREINSTALL, "multireinstall" },
1275 testcase_solverresult(Solver *solv, int resultflags)
1277 Pool *pool = solv->pool;
1285 if ((resultflags & TESTCASE_RESULT_TRANSACTION) != 0)
1287 Transaction *trans = solver_create_transaction(solv);
1291 for (i = 0; class2str[i].str; i++)
1294 transaction_classify_pkgs(trans, SOLVER_TRANSACTION_KEEP_PSEUDO, class2str[i].class, 0, 0, &q);
1295 for (j = 0; j < q.count; j++)
1299 if (pool->installed && pool->solvables[p].repo == pool->installed)
1300 op = transaction_obs_pkg(trans, p);
1301 s = pool_tmpjoin(pool, class2str[i].str, " ", testcase_solvid2str(pool, p));
1303 s = pool_tmpjoin(pool, s, " ", testcase_solvid2str(pool, op));
1304 strqueue_push(&sq, s);
1308 transaction_free(trans);
1310 if ((resultflags & TESTCASE_RESULT_PROBLEMS) != 0)
1312 char *probprefix, *solprefix;
1313 int problem, solution, element;
1316 pcnt = solver_problem_count(solv);
1317 for (problem = 1; problem <= pcnt; problem++)
1319 Id rid, from, to, dep;
1320 SolverRuleinfo rinfo;
1321 rid = solver_findproblemrule(solv, problem);
1322 s = testcase_problemid(solv, problem);
1323 probprefix = solv_dupjoin("problem ", s, 0);
1324 rinfo = solver_ruleinfo(solv, rid, &from, &to, &dep);
1325 s = pool_tmpjoin(pool, probprefix, " info ", solver_problemruleinfo2str(solv, rinfo, from, to, dep));
1326 strqueue_push(&sq, s);
1327 scnt = solver_solution_count(solv, problem);
1328 for (solution = 1; solution <= scnt; solution++)
1330 s = testcase_solutionid(solv, problem, solution);
1331 solprefix = solv_dupjoin(probprefix, " solution ", s);
1333 while ((element = solver_next_solutionelement(solv, problem, solution, element, &p, &op)) != 0)
1335 if (p == SOLVER_SOLUTION_JOB)
1336 s = pool_tmpjoin(pool, solprefix, " deljob ", testcase_job2str(pool, solv->job.elements[op - 1], solv->job.elements[op]));
1337 else if (p > 0 && op == 0)
1338 s = pool_tmpjoin(pool, solprefix, " erase ", testcase_solvid2str(pool, p));
1339 else if (p > 0 && op > 0)
1341 s = pool_tmpjoin(pool, solprefix, " replace ", testcase_solvid2str(pool, p));
1342 s = pool_tmpappend(pool, s, " ", testcase_solvid2str(pool, op));
1344 else if (p < 0 && op > 0)
1345 s = pool_tmpjoin(pool, solprefix, " allow ", testcase_solvid2str(pool, op));
1347 s = pool_tmpjoin(pool, solprefix, " unknown", 0);
1348 strqueue_push(&sq, s);
1350 solv_free(solprefix);
1352 solv_free(probprefix);
1356 if ((resultflags & TESTCASE_RESULT_ORPHANED) != 0)
1361 solver_get_orphaned(solv, &q);
1362 for (i = 0; i < q.count; i++)
1364 s = pool_tmpjoin(pool, "orphaned ", testcase_solvid2str(pool, q.elements[i]), 0);
1365 strqueue_push(&sq, s);
1370 if ((resultflags & TESTCASE_RESULT_RECOMMENDED) != 0)
1376 solver_get_recommendations(solv, &qr, &qs, 0);
1377 for (i = 0; i < qr.count; i++)
1379 s = pool_tmpjoin(pool, "recommended ", testcase_solvid2str(pool, qr.elements[i]), 0);
1380 strqueue_push(&sq, s);
1382 for (i = 0; i < qs.count; i++)
1384 s = pool_tmpjoin(pool, "suggested ", testcase_solvid2str(pool, qs.elements[i]), 0);
1385 strqueue_push(&sq, s);
1391 if ((resultflags & TESTCASE_RESULT_UNNEEDED) != 0)
1396 solver_get_unneeded(solv, &q, 0);
1397 for (i = 0; i < q.count; i++)
1399 s = pool_tmpjoin(pool, "unneeded ", testcase_solvid2str(pool, q.elements[i]), 0);
1400 strqueue_push(&sq, s);
1406 result = strqueue_join(&sq);
1413 testcase_write(Solver *solv, char *dir, int resultflags, const char *testcasename, const char *resultname)
1415 Pool *pool = solv->pool;
1426 testcasename = "testcase.t";
1428 resultname = "solver.result";
1430 if (mkdir(dir, 0777) && errno != EEXIST)
1432 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: could not create directory '%s'\n", dir);
1436 FOR_REPOS(repoid, repo)
1438 const char *name = testcase_repoid2str(pool, repoid);
1440 if (repo->subpriority)
1441 sprintf(priobuf, "%d.%d", repo->priority, repo->subpriority);
1443 sprintf(priobuf, "%d", repo->priority);
1444 out = pool_tmpjoin(pool, name, ".repo", ".gz");
1445 cmd = pool_tmpjoin(pool, "repo ", name, " ");
1446 cmd = pool_tmpappend(pool, cmd, priobuf, " ");
1447 cmd = pool_tmpappend(pool, cmd, "susetags ", out);
1448 strqueue_push(&sq, cmd);
1449 out = pool_tmpjoin(pool, dir, "/", out);
1450 if (!(fp = solv_xfopen(out, "w")))
1452 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: could not open '%s' for writing\n", out);
1456 testcase_write_susetags(repo, fp);
1459 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: write error\n");
1464 /* hmm, this is not optimal... we currently search for the lowest score */
1467 for (i = 0; i < pool->lastarch; i++)
1469 if (pool->id2arch[i] == 1 && !lowscore)
1471 if (pool->id2arch[i] > 0x10000 && (!lowscore || pool->id2arch[i] < lowscore))
1474 lowscore = pool->id2arch[i];
1477 cmd = pool_tmpjoin(pool, "system ", pool_id2str(pool, arch), pool->disttype == DISTTYPE_DEB ? " deb" : " rpm");
1478 if (pool->installed)
1479 cmd = pool_tmpappend(pool, cmd, " ", testcase_repoid2str(pool, pool->installed->repoid));
1480 strqueue_push(&sq, cmd);
1481 s = testcase_getpoolflags(solv->pool);
1484 cmd = pool_tmpjoin(pool, "poolflags ", s, 0);
1485 strqueue_push(&sq, cmd);
1488 if (pool->vendorclasses)
1491 for (i = 0; pool->vendorclasses[i]; i++)
1493 cmd = pool_tmpappend(pool, cmd ? cmd : "vendorclass", " ", pool->vendorclasses[i]);
1494 if (!pool->vendorclasses[i + 1])
1496 strqueue_push(&sq, cmd);
1503 s = testcase_getsolverflags(solv);
1506 cmd = pool_tmpjoin(pool, "solverflags ", s, 0);
1507 strqueue_push(&sq, cmd);
1510 /* now dump all the ns callback values we know */
1511 if (pool->nscallback)
1515 for (rid = 1; rid < pool->nrels; rid++)
1517 Reldep *rd = pool->rels + rid;
1518 if (rd->flags != REL_NAMESPACE || rd->name == NAMESPACE_OTHERPROVIDERS)
1520 /* check if we evaluated it, also skip empty results */
1521 if (!(d = pool->whatprovides_rel[rid]) || !pool->whatprovidesdata[d])
1523 cmd = pool_tmpjoin(pool, "namespace ", pool_id2str(pool, rd->name), "(");
1524 cmd = pool_tmpappend(pool, cmd, pool_id2str(pool, rd->evr), ")");
1525 for (; pool->whatprovidesdata[d]; d++)
1526 cmd = pool_tmpappend(pool, cmd, " ", testcase_solvid2str(pool, pool->whatprovidesdata[d]));
1527 strqueue_push(&sq, cmd);
1531 for (i = 0; i < solv->job.count; i += 2)
1533 cmd = (char *)testcase_job2str(pool, solv->job.elements[i], solv->job.elements[i + 1]);
1534 cmd = pool_tmpjoin(pool, "job ", cmd, 0);
1535 strqueue_push(&sq, cmd);
1542 for (i = 0; resultflags2str[i].str; i++)
1543 if ((resultflags & resultflags2str[i].flag) != 0)
1544 cmd = pool_tmpappend(pool, cmd, cmd ? "," : 0, resultflags2str[i].str);
1545 cmd = pool_tmpjoin(pool, "result ", cmd ? cmd : "?", 0);
1546 cmd = pool_tmpappend(pool, cmd, " ", resultname);
1547 strqueue_push(&sq, cmd);
1548 result = testcase_solverresult(solv, resultflags);
1549 if (!strcmp(resultname, "<inline>"))
1553 strqueue_init(&rsq);
1554 strqueue_split(&rsq, result);
1555 for (i = 0; i < rsq.nstr; i++)
1557 cmd = pool_tmpjoin(pool, "#>", rsq.str[i], 0);
1558 strqueue_push(&sq, cmd);
1560 strqueue_free(&rsq);
1564 out = pool_tmpjoin(pool, dir, "/", resultname);
1565 if (!(fp = fopen(out, "w")))
1567 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: could not open '%s' for writing\n", out);
1572 if (result && *result && fwrite(result, strlen(result), 1, fp) != 1)
1574 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: write error\n");
1581 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: write error\n");
1589 cmd = strqueue_join(&sq);
1590 out = pool_tmpjoin(pool, dir, "/", testcasename);
1591 if (!(fp = fopen(out, "w")))
1593 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: could not open '%s' for writing\n", out);
1597 if (*cmd && fwrite(cmd, strlen(cmd), 1, fp) != 1)
1599 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: write error\n");
1605 pool_debug(solv->pool, SOLV_ERROR, "testcase_write: write error\n");
1615 testcase_read(Pool *pool, FILE *fp, char *testcase, Queue *job, char **resultp, int *resultflagsp)
1620 char *testcasedir, *s;
1626 int poolflagsreset = 0;
1628 if (!fp && !(fp = fopen(testcase, "r")))
1630 pool_debug(pool, SOLV_ERROR, "testcase_read: could not open '%s'\n", testcase);
1633 testcasedir = solv_strdup(testcase);
1634 if ((s = strrchr(testcasedir, '/')) != 0)
1639 buf = solv_malloc(bufl);
1644 if (bufp - buf + 16 > bufl)
1647 buf = solv_realloc(buf, bufl + 512);
1651 if (!fgets(bufp, bufl - (bufp - buf), fp))
1655 if (!l || buf[l - 1] != '\n')
1662 while (*s && (*s == ' ' || *s == '\t'))
1664 if (!*s || *s == '#')
1667 /* split it in pieces */
1670 while (*s == ' ' || *s == '\t')
1674 pieces = solv_extend(pieces, npieces, 1, sizeof(*pieces), 7);
1675 pieces[npieces++] = s;
1676 while (*s && *s != ' ' && *s != '\t')
1681 pieces = solv_extend(pieces, npieces, 1, sizeof(*pieces), 7);
1682 pieces[npieces] = 0;
1683 if (!strcmp(pieces[0], "repo") && npieces >= 4)
1685 Repo *repo = repo_create(pool, pieces[1]);
1691 if (!poolflagsreset)
1694 testcase_resetpoolflags(pool); /* hmm */
1696 if (sscanf(pieces[2], "%d.%d", &prio, &subprio) != 2)
1699 prio = atoi(pieces[2]);
1701 repo->priority = prio;
1702 repo->subpriority = subprio;
1703 if (strcmp(pieces[3], "empty") != 0)
1705 rdata = pool_tmpjoin(pool, testcasedir, pieces[4], 0);
1706 if ((rfp = solv_xfopen(rdata, "r")) == 0)
1708 pool_debug(pool, SOLV_ERROR, "testcase_read: could not open '%s'\n", rdata);
1710 else if (!strcmp(pieces[3], "susetags"))
1712 testcase_add_susetags(repo, rfp, 0);
1715 else if (!strcmp(pieces[3], "solv"))
1717 repo_add_solv(repo, rfp, 0);
1723 pool_debug(pool, SOLV_ERROR, "testcase_read: unknown repo type for repo '%s'\n", repo->name);
1727 else if (!strcmp(pieces[0], "system") && npieces >= 3)
1730 pool_setarch(pool, pieces[1]);
1733 Repo *repo = testcase_str2repo(pool, pieces[3]);
1735 pool_debug(pool, SOLV_ERROR, "testcase_read: system: unknown repo '%s'\n", pieces[3]);
1737 pool_set_installed(pool, repo);
1740 else if (!strcmp(pieces[0], "job") && npieces > 1)
1746 pool_addfileprovides(pool);
1747 pool_createwhatprovides(pool);
1751 for (sp = pieces[1]; sp < pieces[npieces - 1]; sp++)
1754 how = testcase_str2job(pool, pieces[1], &what);
1755 if (how >= 0 && job)
1756 queue_push2(job, how, what);
1758 else if (!strcmp(pieces[0], "vendorclass") && npieces > 1)
1760 pool_addvendorclass(pool, (const char **)(pieces + 1));
1762 else if (!strcmp(pieces[0], "namespace") && npieces > 1)
1764 int i = strlen(pieces[1]);
1765 s = strchr(pieces[1], '(');
1766 if (!s && pieces[1][i - 1] != ')')
1768 pool_debug(pool, SOLV_ERROR, "testcase_read: bad namespace '%s'\n", pieces[1]);
1776 pieces[1][i - 1] = 0;
1777 name = pool_str2id(pool, pieces[1], 1);
1778 evr = pool_str2id(pool, s + 1, 1);
1780 pieces[1][i - 1] = ')';
1781 id = pool_rel2id(pool, name, evr, REL_NAMESPACE, 1);
1782 for (i = 2; i < npieces; i++)
1783 queue_push(&q, testcase_str2solvid(pool, pieces[i]));
1784 /* now do the callback */
1787 pool_addfileprovides(pool);
1788 pool_createwhatprovides(pool);
1791 pool->whatprovides_rel[GETRELID(id)] = pool_queuetowhatprovides(pool, &q);
1795 else if (!strcmp(pieces[0], "poolflags"))
1798 if (!poolflagsreset)
1801 testcase_resetpoolflags(pool); /* hmm */
1803 for (i = 1; i < npieces; i++)
1804 testcase_setpoolflags(pool, pieces[i]);
1806 else if (!strcmp(pieces[0], "solverflags") && npieces > 1)
1811 solv = solver_create(pool);
1812 testcase_resetsolverflags(solv);
1814 for (i = 1; i < npieces; i++)
1815 testcase_setsolverflags(solv, pieces[i]);
1817 else if (!strcmp(pieces[0], "result") && npieces > 2)
1821 int resultflags = 0;
1822 char *s = pieces[1];
1826 char *se = strchr(s, ',');
1829 for (i = 0; resultflags2str[i].str; i++)
1830 if (!strcmp(s, resultflags2str[i].str))
1832 resultflags |= resultflags2str[i].flag;
1835 if (!resultflags2str[i].str)
1836 pool_debug(pool, SOLV_ERROR, "result: unknown flag '%s'\n", s);
1840 rdata = pool_tmpjoin(pool, testcasedir, pieces[2], 0);
1841 if (!strcmp(pieces[2], "<inline>"))
1844 rfp = fopen(rdata, "r");
1847 pool_debug(pool, SOLV_ERROR, "testcase_read: could not open '%s'\n", rdata);
1851 /* slurp it in... */
1852 char *result = solv_malloc(1024);
1858 if (rp - result + 256 >= resultl)
1860 resultl = rp - result;
1861 result = solv_realloc(result, resultl + 1024);
1862 rp = result + resultl;
1867 if (!fgets(rp, resultl - (rp - result), fp))
1872 if (rl && (rp == result || rp[-1] == '\n'))
1874 if (rl > 1 && rp[0] == '#' && rp[1] == '>')
1876 memmove(rp, rp + 2, rl - 2);
1881 while (rl + 16 > bufl)
1883 buf = solv_realloc(buf, bufl + 512);
1886 memmove(buf, rp, rl);
1887 if (buf[rl - 1] == '\n')
1899 rl = fread(rp, 1, resultl - (rp - result), rfp);
1914 *resultflagsp = resultflags;
1917 else if (!strcmp(pieces[0], "nextjob") && npieces == 1)
1923 pool_debug(pool, SOLV_ERROR, "testcase_read: cannot parse command '%s'\n", pieces[0]);
1926 buf = solv_free(buf);
1927 pieces = solv_free(pieces);
1928 solv_free(testcasedir);
1931 pool_addfileprovides(pool);
1932 pool_createwhatprovides(pool);
1936 solv = solver_create(pool);
1937 testcase_resetsolverflags(solv);
1945 testcase_resultdiff(char *result1, char *result2)
1947 Strqueue sq1, sq2, osq;
1949 strqueue_init(&sq1);
1950 strqueue_init(&sq2);
1951 strqueue_init(&osq);
1952 strqueue_split(&sq1, result1);
1953 strqueue_split(&sq2, result2);
1954 strqueue_sort(&sq1);
1955 strqueue_sort(&sq2);
1956 strqueue_diff(&sq1, &sq2, &osq);
1957 r = osq.nstr ? strqueue_join(&osq) : 0;
1958 strqueue_free(&sq1);
1959 strqueue_free(&sq2);
1960 strqueue_free(&osq);