tools/findfileconflicts.c

   1 /* vim: sw=2 et
   2  */
   3
   4 #include <stdio.h>
   5 #include <stdlib.h>
   6
   7 #include "pool.h"
   8 #include "repo.h"
   9 #include "solver.h"
  10 #include "solverdebug.h"
  11 #include "hash.h"
  12 #include "repo_rpmdb.h"
  13 #include "pool_fileconflicts.h"
  14
  15 static void *
  16 iterate_handle(Pool *pool, Id p, void *cbdata)
  17 {
  18   Solvable *s = pool->solvables + p;
  19   Id rpmdbid;
  20
  21   if (!s->repo->rpmdbid)
  22     return 0;
  23   rpmdbid = s->repo->rpmdbid[p - s->repo->start];
  24   if (!rpmdbid)
  25     return 0;
  26   return rpm_byrpmdbid(cbdata, rpmdbid);
  27 }
  28
  29 int main(int argc, char **argv)
  30 {
  31   Pool *pool;
  32   Repo *installed;
  33   Solvable *s;
  34   Id p;
  35   int i;
  36   Queue todo, conflicts;
  37   void *state = 0;
  38   char *rootdir = 0;
  39
  40   if (argc == 3 && !strcmp(argv[1], "--root"))
  41     rootdir = argv[2];
  42   pool = pool_create();
  43   if (rootdir)
  44     pool_set_rootdir(pool, rootdir);
  45   pool_setdebuglevel(pool, 1);
  46   installed = repo_create(pool, "@System");
  47   pool_set_installed(pool, installed);
  48   if (repo_add_rpmdb(installed, 0, REPO_USE_ROOTDIR))
  49     {
  50       fprintf(stderr, "findfileconflicts: %s\n", pool_errstr(pool));
  51       exit(1);
  52     }
  53   queue_init(&todo);
  54   queue_init(&conflicts);
  55   FOR_REPO_SOLVABLES(installed, p, s)
  56     queue_push(&todo, p);
  57   state = rpm_state_create(pool_get_rootdir(pool));
  58   pool_findfileconflicts(pool, &todo, 0, &conflicts, FINDFILECONFLICTS_USE_SOLVABLEFILELIST | FINDFILECONFLICTS_CHECK_DIRALIASING | FINDFILECONFLICTS_USE_ROOTDIR, &iterate_handle, state);
  59   rpm_state_free(state);
  60   queue_free(&todo);
  61   for (i = 0; i < conflicts.count; i += 6)
  62     {
  63       if (conflicts.elements[i] != conflicts.elements[i + 3])
  64         printf("%s - %s: %s[%s] %s[%s]\n", pool_id2str(pool, conflicts.elements[i]), pool_id2str(pool, conflicts.elements[i + 3]), pool_solvid2str(pool, conflicts.elements[i + 1]), pool_id2str(pool, conflicts.elements[i + 2]), pool_solvid2str(pool, conflicts.elements[i + 4]), pool_id2str(pool, conflicts.elements[i + 5]));
  65       else
  66         printf("%s: %s[%s] %s[%s]\n", pool_id2str(pool, conflicts.elements[i]), pool_solvid2str(pool, conflicts.elements[i + 1]), pool_id2str(pool, conflicts.elements[i + 2]), pool_solvid2str(pool, conflicts.elements[i + 4]), pool_id2str(pool, conflicts.elements[i + 5]));
  67     }
  68   if (conflicts.count)
  69     {
  70       Queue job;
  71       int problemcnt;
  72
  73       queue_init(&job);
  74       pool_add_fileconflicts_deps(pool, &conflicts);
  75       pool_addfileprovides(pool);
  76       pool_createwhatprovides(pool);
  77       pool_setdebuglevel(pool, 0);
  78       Solver *solv = solver_create(pool);
  79       queue_push2(&job, SOLVER_VERIFY|SOLVER_SOLVABLE_ALL, 0);
  80 #if 0
  81       solver_set_flag(solv, SOLVER_FLAG_ALLOW_UNINSTALL, 1);
  82 #endif
  83       problemcnt = solver_solve(solv, &job);
  84       if (problemcnt)
  85         solver_printallsolutions(solv);
  86       else
  87         {
  88           Transaction *trans = solver_create_transaction(solv);
  89           transaction_print(trans);
  90           transaction_free(trans);
  91         }
  92       queue_free(&job);
  93       solver_free(solv);
  94     }
  95   queue_free(&conflicts);
  96   exit(0);
  97 }