2 * Copyright (c) 2009-2015, SUSE LLC.
4 * This program is licensed under the BSD license, read LICENSE.BSD
5 * for further information
8 /* solv, a little software installer demoing the sat solver library */
11 * - understands globs for package names / dependencies
12 * - understands .arch suffix
13 * - installation of commandline packages
14 * - repository data caching
15 * - on demand loading of secondary repository data
16 * - gpg and checksum verification
19 * - fastestmirror implementation
21 * things available in the library but missing from solv:
22 * - vendor policy loading
23 * - multi version handling
29 #include <sys/utsname.h>
34 #include "selection.h"
37 #include "solverdebug.h"
38 #include "transaction.h"
41 #include "repo_autopattern.h"
45 #include "repoinfo_cache.h"
46 #include "repoinfo_download.h"
48 #if defined(ENABLE_RPMDB)
49 #include "fileprovides.h"
50 #include "fileconflicts.h"
53 #if defined(SUSE) || defined(FEDORA) || defined(MAGEIA)
54 #include "patchjobs.h"
66 pool_setarch(pool, un.machine);
71 yesno(const char *str, int other)
80 if (!(ip = fgets(inbuf, sizeof(inbuf), stdin)))
85 while (*ip == ' ' || *ip == '\t')
92 if (*ip == 'y' || *ip == 'n' || *ip == other)
93 return *ip == 'n' ? 0 : *ip;
99 nscallback(Pool *pool, void *data, Id name, Id evr)
102 if (name == NAMESPACE_LANGUAGE)
104 if (!strcmp(pool_id2str(pool, evr), "ja"))
106 if (!strcmp(pool_id2str(pool, evr), "de"))
108 if (!strcmp(pool_id2str(pool, evr), "en"))
110 if (!strcmp(pool_id2str(pool, evr), "en_US"))
120 showdiskusagechanges(Transaction *trans)
125 /* XXX: use mountpoints here */
126 memset(duc, 0, sizeof(duc));
128 duc[1].path = "/usr/share/man";
129 duc[2].path = "/sbin";
130 duc[3].path = "/etc";
131 transaction_calc_duchanges(trans, duc, 4);
132 for (i = 0; i < 4; i++)
133 printf("duchanges %s: %d K %d inodes\n", duc[i].path, duc[i].kbytes, duc[i].files);
138 find_repo(const char *name, Pool *pool, struct repoinfo *repoinfos, int nrepoinfos)
143 for (rp = name; *rp; rp++)
144 if (*rp <= '0' || *rp >= '9')
148 /* repo specified by number */
149 int rnum = atoi(name);
150 for (i = 0; i < nrepoinfos; i++)
152 struct repoinfo *cinfo = repoinfos + i;
153 if (!cinfo->enabled || !cinfo->repo)
156 return cinfo->repo->repoid;
161 /* repo specified by alias */
165 if (!strcasecmp(name, repo->name))
174 #define MODE_INSTALL 1
176 #define MODE_UPDATE 3
177 #define MODE_DISTUPGRADE 4
178 #define MODE_VERIFY 5
181 #define MODE_REPOLIST 8
182 #define MODE_SEARCH 9
187 fprintf(stderr, "Usage: solv COMMAND <select>\n");
188 fprintf(stderr, "\n");
189 fprintf(stderr, " dist-upgrade: replace installed packages with\n");
190 fprintf(stderr, " versions from the repositories\n");
191 fprintf(stderr, " erase: erase installed packages\n");
192 fprintf(stderr, " info: display package information\n");
193 fprintf(stderr, " install: install packages\n");
194 fprintf(stderr, " list: list packages\n");
195 fprintf(stderr, " repos: list enabled repositories\n");
196 fprintf(stderr, " search: search name/summary/description\n");
197 fprintf(stderr, " update: update installed packages\n");
198 fprintf(stderr, " verify: check dependencies of installed packages\n");
199 #if defined(SUSE) || defined(FEDORA) || defined(MAGEIA)
200 fprintf(stderr, " patch: install newest maintenance updates\n");
202 fprintf(stderr, "\n");
207 main(int argc, char **argv)
210 Repo *commandlinerepo = 0;
211 Id *commandlinepkgs = 0;
213 struct repoinfo *repoinfos, installedrepoinfo;
215 int mainmode = 0, mode = 0;
224 int archfilter_src = 0;
229 int keyname_depstr = 0;
231 int answer, acnt = 0;
236 while (argc && !strcmp(argv[0], "-d"))
244 if (!strcmp(argv[0], "install") || !strcmp(argv[0], "in"))
246 mainmode = MODE_INSTALL;
247 mode = SOLVER_INSTALL;
249 #if defined(SUSE) || defined(FEDORA) || defined(MAGEIA)
250 else if (!strcmp(argv[0], "patch"))
252 mainmode = MODE_PATCH;
253 mode = SOLVER_INSTALL;
256 else if (!strcmp(argv[0], "erase") || !strcmp(argv[0], "rm"))
258 mainmode = MODE_ERASE;
261 else if (!strcmp(argv[0], "list") || !strcmp(argv[0], "ls"))
263 mainmode = MODE_LIST;
266 else if (!strcmp(argv[0], "info"))
268 mainmode = MODE_INFO;
271 else if (!strcmp(argv[0], "search") || !strcmp(argv[0], "se"))
273 mainmode = MODE_SEARCH;
276 else if (!strcmp(argv[0], "verify"))
278 mainmode = MODE_VERIFY;
279 mode = SOLVER_VERIFY;
281 else if (!strcmp(argv[0], "update") || !strcmp(argv[0], "up"))
283 mainmode = MODE_UPDATE;
284 mode = SOLVER_UPDATE;
286 else if (!strcmp(argv[0], "dist-upgrade") || !strcmp(argv[0], "dup"))
288 mainmode = MODE_DISTUPGRADE;
289 mode = SOLVER_DISTUPGRADE;
291 else if (!strcmp(argv[0], "repos") || !strcmp(argv[0], "repolist") || !strcmp(argv[0], "lr"))
293 mainmode = MODE_REPOLIST;
301 if (argc > 2 && !strcmp(argv[1], "--root"))
307 else if (argc > 1 && !strcmp(argv[1], "--clean"))
313 else if (argc > 1 && !strcmp(argv[1], "--best"))
319 else if (argc > 1 && !strcmp(argv[1], "--depstr"))
325 else if (argc > 2 && !strcmp(argv[1], "--keyname"))
331 else if (argc > 2 && !strcmp(argv[1], "--testcase"))
342 pool = pool_create();
343 pool_set_rootdir(pool, rootdir);
347 const char *langs[] = {"de_DE", "de", "en"};
348 pool_set_languages(pool, langs, sizeof(langs)/sizeof(*langs));
352 pool_setloadcallback(pool, load_stub, 0);
354 pool->nscallback = nscallback;
357 pool_setdebuglevel(pool, debuglevel);
359 pool_set_flag(pool, POOL_FLAG_ADDFILEPROVIDESFILTERED, 1);
360 repoinfos = read_repoinfos(pool, &nrepoinfos);
361 sort_repoinfos(repoinfos, nrepoinfos);
363 if (mainmode == MODE_REPOLIST)
366 for (i = 0; i < nrepoinfos; i++)
368 struct repoinfo *cinfo = repoinfos + i;
371 printf("%d: %-20s %s (prio %d)\n", j++, cinfo->alias, cinfo->name, cinfo->priority);
375 memset(&installedrepoinfo, 0, sizeof(installedrepoinfo));
376 if (!read_installed_repo(&installedrepoinfo, pool))
378 read_repos(pool, repoinfos, nrepoinfos);
381 queue_init(&repofilter);
382 queue_init(&kindfilter);
383 queue_init(&archfilter);
386 if (!strcmp(argv[1], "-i"))
388 queue_push2(&repofilter, SOLVER_SOLVABLE_REPO | SOLVER_SETREPO, pool->installed->repoid);
392 else if (argc > 2 && (!strcmp(argv[1], "-r") || !strcmp(argv[1], "--repo")))
394 Id repoid = find_repo(argv[2], pool, repoinfos, nrepoinfos);
397 fprintf(stderr, "%s: no such repo\n", argv[2]);
400 /* SETVENDOR is actually wrong but useful */
401 queue_push2(&repofilter, SOLVER_SOLVABLE_REPO | SOLVER_SETREPO | SOLVER_SETVENDOR, repoid);
405 else if (argc > 2 && !strcmp(argv[1], "--arch"))
407 if (!strcmp(argv[2], "src") || !strcmp(argv[2], "nosrc"))
409 queue_push2(&archfilter, SOLVER_SOLVABLE_PROVIDES, pool_rel2id(pool, 0, pool_str2id(pool, argv[2], 1), REL_ARCH, 1));
413 else if (argc > 2 && (!strcmp(argv[1], "-t") || !strcmp(argv[1], "--type")))
415 const char *kind = argv[2];
416 if (!strcmp(kind, "srcpackage"))
418 /* hey! should use --arch! */
419 queue_push2(&archfilter, SOLVER_SOLVABLE_PROVIDES, pool_rel2id(pool, 0, ARCH_SRC, REL_ARCH, 1));
425 if (!strcmp(kind, "package"))
427 if (!strcmp(kind, "all"))
428 queue_push2(&kindfilter, SOLVER_SOLVABLE_ALL, 0);
430 queue_push2(&kindfilter, SOLVER_SOLVABLE_PROVIDES, pool_rel2id(pool, 0, pool_str2id(pool, kind, 1), REL_KIND, 1));
438 if (mainmode == MODE_SEARCH)
444 pool_createwhatprovides(pool);
446 dataiterator_init(&di, pool, 0, 0, 0, argv[1], SEARCH_SUBSTRING|SEARCH_NOCASE);
447 dataiterator_set_keyname(&di, SOLVABLE_NAME);
448 dataiterator_set_search(&di, 0, 0);
449 while (dataiterator_step(&di))
450 queue_push2(&sel, SOLVER_SOLVABLE, di.solvid);
451 dataiterator_set_keyname(&di, SOLVABLE_SUMMARY);
452 dataiterator_set_search(&di, 0, 0);
453 while (dataiterator_step(&di))
454 queue_push2(&sel, SOLVER_SOLVABLE, di.solvid);
455 dataiterator_set_keyname(&di, SOLVABLE_DESCRIPTION);
456 dataiterator_set_search(&di, 0, 0);
457 while (dataiterator_step(&di))
458 queue_push2(&sel, SOLVER_SOLVABLE, di.solvid);
459 dataiterator_free(&di);
460 if (repofilter.count)
461 selection_filter(pool, &sel, &repofilter);
464 selection_solvables(pool, &sel, &q);
466 for (i = 0; i < q.count; i++)
468 Solvable *s = pool_id2solvable(pool, q.elements[i]);
469 printf(" - %s [%s]: %s\n", pool_solvable2str(pool, s), s->repo->name, solvable_lookup_str(s, SOLVABLE_SUMMARY));
475 /* process command line packages */
476 if (mainmode == MODE_LIST || mainmode == MODE_INFO || mainmode == MODE_INSTALL)
478 for (i = 1; i < argc; i++)
480 if (!is_cmdline_package((const char *)argv[i]))
482 if (access(argv[i], R_OK))
487 if (!commandlinepkgs)
488 commandlinepkgs = solv_calloc(argc, sizeof(Id));
489 if (!commandlinerepo)
490 commandlinerepo = repo_create(pool, "@commandline");
491 p = add_cmdline_package(commandlinerepo, (const char *)argv[i]);
494 fprintf(stderr, "could not add '%s'\n", argv[i]);
497 commandlinepkgs[i] = p;
501 repo_internalize(commandlinerepo);
503 repo_add_autopattern(commandlinerepo, 0);
508 #if defined(ENABLE_RPMDB)
509 if (pool->disttype == DISTTYPE_RPM)
510 addfileprovides(pool);
512 pool_createwhatprovides(pool);
515 keyname = solv_dupjoin("solvable:", keyname, 0);
517 for (i = 1; i < argc; i++)
522 if (commandlinepkgs && commandlinepkgs[i])
524 queue_push2(&job, SOLVER_SOLVABLE, commandlinepkgs[i]);
528 flags = SELECTION_NAME|SELECTION_PROVIDES|SELECTION_GLOB;
529 flags |= SELECTION_CANON|SELECTION_DOTARCH|SELECTION_REL;
530 if (kindfilter.count)
531 flags |= SELECTION_SKIP_KIND;
532 if (mode == MODE_LIST || archfilter_src)
533 flags |= SELECTION_WITH_SOURCE;
534 if (argv[i][0] == '/')
535 flags |= SELECTION_FILELIST | (mode == MODE_ERASE ? SELECTION_INSTALLED_ONLY : 0);
536 if (keyname && keyname_depstr)
537 flags |= SELECTION_MATCH_DEPSTR;
539 rflags = selection_make(pool, &job2, argv[i], flags);
541 rflags = selection_make_matchdeps(pool, &job2, argv[i], flags, pool_str2id(pool, keyname, 1), 0);
542 if (repofilter.count)
543 selection_filter(pool, &job2, &repofilter);
544 if (archfilter.count)
545 selection_filter(pool, &job2, &archfilter);
546 if (kindfilter.count)
547 selection_filter(pool, &job2, &kindfilter);
550 flags |= SELECTION_NOCASE;
552 rflags = selection_make(pool, &job2, argv[i], flags);
554 rflags = selection_make_matchdeps(pool, &job2, argv[i], flags, pool_str2id(pool, keyname, 1), 0);
555 if (repofilter.count)
556 selection_filter(pool, &job2, &repofilter);
557 if (archfilter.count)
558 selection_filter(pool, &job2, &archfilter);
559 if (kindfilter.count)
560 selection_filter(pool, &job2, &kindfilter);
562 printf("[ignoring case for '%s']\n", argv[i]);
566 fprintf(stderr, "nothing matches '%s'\n", argv[i]);
569 if (rflags & SELECTION_FILELIST)
570 printf("[using file list match for '%s']\n", argv[i]);
571 if (rflags & SELECTION_PROVIDES)
572 printf("[using capability match for '%s']\n", argv[i]);
573 queue_insertn(&job, job.count, job2.count, job2.elements);
576 keyname = solv_free(keyname);
578 if (!job.count && (mainmode == MODE_UPDATE || mainmode == MODE_DISTUPGRADE || mainmode == MODE_VERIFY || repofilter.count || archfilter.count || kindfilter.count))
580 queue_push2(&job, SOLVER_SOLVABLE_ALL, 0);
581 if (repofilter.count)
582 selection_filter(pool, &job, &repofilter);
583 if (archfilter.count)
584 selection_filter(pool, &job, &archfilter);
585 if (kindfilter.count)
586 selection_filter(pool, &job, &kindfilter);
588 queue_free(&repofilter);
589 queue_free(&archfilter);
590 queue_free(&kindfilter);
592 if (!job.count && mainmode != MODE_PATCH)
594 printf("no package matched\n");
598 if (mainmode == MODE_LIST || mainmode == MODE_INFO)
600 /* list mode, no solver needed */
603 for (i = 0; i < job.count; i += 2)
607 pool_job2solvables(pool, &q, job.elements[i], job.elements[i + 1]);
608 for (j = 0; j < q.count; j++)
610 Solvable *s = pool_id2solvable(pool, q.elements[j]);
611 if (mainmode == MODE_INFO)
614 printf("Name: %s\n", pool_solvable2str(pool, s));
615 printf("Repo: %s\n", s->repo->name);
616 printf("Summary: %s\n", solvable_lookup_str(s, SOLVABLE_SUMMARY));
617 str = solvable_lookup_str(s, SOLVABLE_URL);
619 printf("Url: %s\n", str);
620 str = solvable_lookup_str(s, SOLVABLE_LICENSE);
622 printf("License: %s\n", str);
623 printf("Description:\n%s\n", solvable_lookup_str(s, SOLVABLE_DESCRIPTION));
629 const char *sum = solvable_lookup_str_lang(s, SOLVABLE_SUMMARY, "de", 1);
631 const char *sum = solvable_lookup_str_poollang(s, SOLVABLE_SUMMARY);
633 printf(" - %s [%s]\n", pool_solvable2str(pool, s), s->repo->name);
635 printf(" %s\n", sum);
642 free_repoinfos(repoinfos, nrepoinfos);
643 solv_free(commandlinepkgs);
647 #if defined(SUSE) || defined(FEDORA) || defined(MAGEIA)
648 if (mainmode == MODE_PATCH)
649 add_patchjobs(pool, &job);
653 for (i = 0; i < job.count; i += 2)
655 job.elements[i] |= mode;
656 if (mode == SOLVER_UPDATE && pool_isemptyupdatejob(pool, job.elements[i], job.elements[i + 1]))
657 job.elements[i] ^= SOLVER_UPDATE ^ SOLVER_INSTALL;
659 job.elements[i] |= SOLVER_CLEANDEPS;
661 job.elements[i] |= SOLVER_FORCEBEST;
666 queue_push2(&job, SOLVER_MULTIVERSION|SOLVER_SOLVABLE_PROVIDES, pool_str2id(pool, "multiversion(kernel)", 1));
669 queue_push2(&job, SOLVER_INSTALL|SOLVER_SOLVABLE_PROVIDES, pool_rel2id(pool, NAMESPACE_LANGUAGE, 0, REL_NAMESPACE, 1));
670 queue_push2(&job, SOLVER_ERASE|SOLVER_CLEANDEPS|SOLVER_SOLVABLE_PROVIDES, pool_rel2id(pool, NAMESPACE_LANGUAGE, 0, REL_NAMESPACE, 1));
674 solv = solver_create(pool);
675 solver_set_flag(solv, SOLVER_FLAG_SPLITPROVIDES, 1);
677 solver_set_flag(solv, SOLVER_FLAG_IGNORE_RECOMMENDED, 1);
679 #if defined(FEDORA) || defined(MAGEIA)
680 solver_set_flag(solv, SOLVER_FLAG_ALLOW_VENDORCHANGE, 1);
682 if (mainmode == MODE_ERASE)
683 solver_set_flag(solv, SOLVER_FLAG_ALLOW_UNINSTALL, 1); /* don't nag */
684 solver_set_flag(solv, SOLVER_FLAG_BEST_OBEY_POLICY, 1);
688 Id problem, solution;
691 pcnt = solver_solve(solv, &job);
694 printf("Writing solver testcase:\n");
695 if (!testcase_write(solv, testcase, TESTCASE_RESULT_TRANSACTION | TESTCASE_RESULT_PROBLEMS, 0, 0))
696 printf("%s\n", pool_errstr(pool));
701 pcnt = solver_problem_count(solv);
702 printf("Found %d problems:\n", pcnt);
703 for (problem = 1; problem <= pcnt; problem++)
706 printf("Problem %d/%d:\n", problem, pcnt);
707 solver_printprobleminfo(solv, problem);
709 scnt = solver_solution_count(solv, problem);
710 for (solution = 1; solution <= scnt; solution++)
712 printf("Solution %d:\n", solution);
713 solver_printsolution(solv, problem, solution);
718 char inbuf[128], *ip;
719 printf("Please choose a solution: ");
722 if (!(ip = fgets(inbuf, sizeof(inbuf), stdin)))
727 while (*ip == ' ' || *ip == '\t')
729 if (*ip >= '0' && *ip <= '9')
732 if (take >= 1 && take <= scnt)
748 solver_take_solution(solv, problem, take, &job);
752 trans = solver_create_transaction(solv);
753 if (!trans->steps.count)
755 printf("Nothing to do.\n");
756 transaction_free(trans);
760 free_repoinfos(repoinfos, nrepoinfos);
761 solv_free(commandlinepkgs);
765 /* display transaction to the user and ask for confirmation */
767 printf("Transaction summary:\n\n");
768 transaction_print(trans);
770 showdiskusagechanges(trans);
772 printf("install size change: %d K\n", transaction_calc_installsizechange(trans));
775 acnt = solver_alternatives_count(solv);
779 printf("Have one alternative:\n");
781 printf("Have %d alternatives:\n", acnt);
782 for (i = 1; i <= acnt; i++)
785 int atype = solver_get_alternative(solv, i, &id, &from, 0, 0, 0);
786 printf(" - %s\n", solver_alternative2str(solv, atype, id, from));
789 answer = yesno("OK to continue (y/n/a)? ", 'a');
792 answer = yesno("OK to continue (y/n)? ", 0);
800 queue_init(&choicesq);
801 queue_init(&answerq);
802 for (i = 1; i <= acnt; i++)
804 int atype = solver_get_alternative(solv, i, &id, &from, &chosen, &choicesq, 0);
805 printf("\n%s\n", solver_alternative2str(solv, atype, id, from));
806 for (j = 0; j < choicesq.count; j++)
808 Id p = choicesq.elements[j];
811 queue_push(&answerq, p);
812 printf("%6d: %s\n", answerq.count, pool_solvid2str(pool, p));
815 queue_free(&choicesq);
819 char inbuf[128], *ip;
821 printf("OK to continue (y/n), or number to change alternative: ");
824 if (!(ip = fgets(inbuf, sizeof(inbuf), stdin)))
829 while (*ip == ' ' || *ip == '\t')
831 if (*ip == '-' && ip[1] >= '0' && ip[1] <= '9')
836 if (*ip >= '0' && *ip <= '9')
839 if (take > 0 && take <= answerq.count)
841 Id p = answerq.elements[take - 1];
842 queue_free(&answerq);
843 queue_push2(&job, (neg ? SOLVER_DISFAVOR : SOLVER_FAVOR) | SOLVER_SOLVABLE_NAME, pool->solvables[p].name);
850 if (*ip == 'n' || *ip == 'y')
852 answer = *ip == 'n' ? 0 : *ip;
856 queue_free(&answerq);
861 transaction_free(trans);
865 free_repoinfos(repoinfos, nrepoinfos);
866 solv_free(commandlinepkgs);
870 /* download all new packages */
872 newpkgs = transaction_installedresult(trans, &checkq);
876 int downloadsize = 0;
877 for (i = 0; i < newpkgs; i++)
881 p = checkq.elements[i];
882 s = pool_id2solvable(pool, p);
883 downloadsize += solvable_lookup_sizek(s, SOLVABLE_DOWNLOADSIZE, 0);
885 printf("Downloading %d packages, %d K\n", newpkgs, downloadsize);
886 newpkgsfps = solv_calloc(newpkgs, sizeof(*newpkgsfps));
887 for (i = 0; i < newpkgs; i++)
891 struct repoinfo *cinfo;
893 p = checkq.elements[i];
894 s = pool_id2solvable(pool, p);
895 if (s->repo == commandlinerepo)
897 loc = solvable_lookup_location(s, 0);
900 if (!(newpkgsfps[i] = fopen(loc, "r")))
908 cinfo = s->repo->appdata;
909 if (!cinfo || cinfo->type == TYPE_INSTALLED)
911 printf("%s: no repository information\n", s->repo->name);
914 loc = solvable_lookup_location(s, 0);
916 continue; /* pseudo package? */
917 #if defined(ENABLE_RPMDB)
918 if (pool->installed && pool->installed->nsolvables)
920 if ((newpkgsfps[i] = trydeltadownload(s, loc)) != 0)
924 continue; /* delta worked! */
928 if ((newpkgsfps[i] = downloadpackage(s, loc)) == 0)
930 printf("\n%s: %s not found in repository\n", s->repo->name, loc);
939 #if defined(ENABLE_RPMDB) && (defined(SUSE) || defined(FEDORA) || defined(MANDRIVA) || defined(MAGEIA))
940 /* check for file conflicts */
944 queue_init(&conflicts);
945 if (checkfileconflicts(pool, &checkq, newpkgs, newpkgsfps, &conflicts))
947 if (yesno("Re-run solver (y/n/q)? ", 0))
949 for (i = 0; i < newpkgs; i++)
951 fclose(newpkgsfps[i]);
952 newpkgsfps = solv_free(newpkgsfps);
955 pool_add_fileconflicts_deps(pool, &conflicts);
956 queue_free(&conflicts);
960 queue_free(&conflicts);
964 /* and finally commit the transaction */
965 printf("Committing transaction:\n\n");
966 transaction_order(trans, 0);
967 for (i = 0; i < trans->steps.count; i++)
973 p = trans->steps.elements[i];
974 type = transaction_type(trans, p, SOLVER_TRANSACTION_RPM_ONLY);
977 case SOLVER_TRANSACTION_ERASE:
978 printf("erase %s\n", pool_solvid2str(pool, p));
979 commit_transactionelement(pool, type, p, 0);
981 case SOLVER_TRANSACTION_INSTALL:
982 case SOLVER_TRANSACTION_MULTIINSTALL:
983 printf("install %s\n", pool_solvid2str(pool, p));
984 for (j = 0; j < newpkgs; j++)
985 if (checkq.elements[j] == p)
987 fp = j < newpkgs ? newpkgsfps[j] : 0;
990 commit_transactionelement(pool, type, p, fp);
999 for (i = 0; i < newpkgs; i++)
1001 fclose(newpkgsfps[i]);
1002 solv_free(newpkgsfps);
1003 queue_free(&checkq);
1004 transaction_free(trans);
1008 free_repoinfos(repoinfos, nrepoinfos);
1009 solv_free(commandlinepkgs);