dselect/pkgsublist.cc

   1 /*
   2  * dselect - Debian package maintenance user interface
   3  * pkgsublist.cc - status modification and recursive package list handling
   4  *
   5  * Copyright © 1995 Ian Jackson <ian@chiark.greenend.org.uk>
   6  *
   7  * This is free software; you can redistribute it and/or modify
   8  * it under the terms of the GNU General Public License as published by
   9  * the Free Software Foundation; either version 2 of the License, or
  10  * (at your option) any later version.
  11  *
  12  * This is distributed in the hope that it will be useful,
  13  * but WITHOUT ANY WARRANTY; without even the implied warranty of
  14  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  15  * GNU General Public License for more details.
  16  *
  17  * You should have received a copy of the GNU General Public License
  18  * along with this program.  If not, see <http://www.gnu.org/licenses/>.
  19  */
  20
  21 #include <config.h>
  22 #include <compat.h>
  23
  24 #include <assert.h>
  25 #include <string.h>
  26 #include <stdio.h>
  27
  28 #include <dpkg/i18n.h>
  29 #include <dpkg/dpkg.h>
  30 #include <dpkg/dpkg-db.h>
  31
  32 #include "dselect.h"
  33 #include "bindings.h"
  34
  35 void packagelist::add(pkginfo *pkg) {
  36   debug(dbg_general, "packagelist[%p]::add(pkginfo %s)",
  37         this, pkg_name(pkg, pnaw_always));
  38   if (!recursive ||  // never add things to top level
  39       !pkg->clientdata ||  // don't add pure virtual packages
  40       pkg->clientdata->uprec)  // don't add ones already in the recursive list
  41     return;
  42   debug(dbg_general, "packagelist[%p]::add(pkginfo %s) adding",
  43         this, pkg_name(pkg, pnaw_always));
  44   perpackagestate *state= &datatable[nitems];
  45   state->pkg= pkg;
  46   state->direct= state->original= pkg->clientdata->selected;
  47   state->suggested= state->selected= pkg->clientdata->selected;
  48   state->spriority= sp_inherit; state->dpriority= dp_none;
  49   state->uprec= pkg->clientdata;
  50   state->relations.init();
  51   pkg->clientdata= state;
  52   table[nitems]= state;
  53   nitems++;
  54 }
  55
  56 void packagelist::add(pkginfo *pkg, pkginfo::pkgwant nw) {
  57   debug(dbg_general, "packagelist[%p]::add(pkginfo %s, %s)",
  58         this, pkg_name(pkg, pnaw_always), wantstrings[nw]);
  59   add(pkg);  if (!pkg->clientdata) return;
  60   pkg->clientdata->direct= nw;
  61   selpriority np;
  62   np= would_like_to_install(nw,pkg) ? sp_selecting : sp_deselecting;
  63   if (pkg->clientdata->spriority > np) return;
  64   debug(dbg_general, "packagelist[%p]::add(pkginfo %s, %s) setting",
  65         this, pkg_name(pkg, pnaw_always), wantstrings[nw]);
  66   pkg->clientdata->suggested= pkg->clientdata->selected= nw;
  67   pkg->clientdata->spriority= np;
  68 }
  69
  70 void packagelist::add(pkginfo *pkg, const char *extrainfo, showpriority showimp) {
  71   debug(dbg_general, "packagelist[%p]::add(pkginfo %s, ..., showpriority %d)",
  72         this, pkg_name(pkg, pnaw_always), showimp);
  73   add(pkg);  if (!pkg->clientdata) return;
  74   if (pkg->clientdata->dpriority < showimp) pkg->clientdata->dpriority= showimp;
  75   pkg->clientdata->relations(extrainfo);
  76   pkg->clientdata->relations.terminate();
  77 }
  78
  79 bool
  80 packagelist::alreadydone(doneent **done, void *check)
  81 {
  82   doneent *search = *done;
  83
  84   while (search && search->dep != check)
  85     search = search->next;
  86   if (search)
  87     return true;
  88   debug(dbg_general, "packagelist[%p]::alreadydone(%p, %p) new",
  89         this, done, check);
  90   search= new doneent;
  91   search->next= *done;
  92   search->dep= check;
  93   *done= search;
  94   return false;
  95 }
  96
  97 void packagelist::addunavailable(deppossi *possi) {
  98   debug(dbg_general, "packagelist[%p]::addunavail(%p)", this, possi);
  99
 100   if (!recursive) return;
 101   if (alreadydone(&unavdone,possi)) return;
 102
 103   assert(possi->up->up->clientdata);
 104   assert(possi->up->up->clientdata->uprec);
 105
 106   varbuf& vb= possi->up->up->clientdata->relations;
 107   vb(possi->ed->name);
 108   vb(_(" does not appear to be available\n"));
 109 }
 110
 111 bool
 112 packagelist::add(dependency *depends, showpriority displayimportance)
 113 {
 114   debug(dbg_general, "packagelist[%p]::add(dependency[%p])", this, depends);
 115
 116   if (alreadydone(&depsdone, depends))
 117     return false;
 118
 119   const char *comma= "";
 120   varbuf info;
 121   info(depends->up->set->name);
 122   info(' ');
 123   info(gettext(relatestrings[depends->type]));
 124   info(' ');
 125   deppossi *possi;
 126   for (possi=depends->list;
 127        possi;
 128        possi=possi->next, comma=(possi && possi->next ? ", " : _(" or "))) {
 129     info(comma);
 130     info(possi->ed->name);
 131     if (possi->verrel != dpkg_relation_none) {
 132       switch (possi->verrel) {
 133       case dpkg_relation_le:
 134         info(" (<= ");
 135         break;
 136       case dpkg_relation_ge:
 137         info(" (>= ");
 138         break;
 139       case dpkg_relation_lt:
 140         info(" (<< ");
 141         break;
 142       case dpkg_relation_gt:
 143         info(" (>> ");
 144         break;
 145       case dpkg_relation_eq:
 146         info(" (= ");
 147         break;
 148       default:
 149         internerr("unknown dpkg_relation %d", possi->verrel);
 150       }
 151       info(versiondescribe(&possi->version, vdew_nonambig));
 152       info(")");
 153     }
 154   }
 155   info('\n');
 156   add(depends->up,info.string(),displayimportance);
 157   for (possi=depends->list; possi; possi=possi->next) {
 158     add(&possi->ed->pkg, info.string(), displayimportance);
 159     if (possi->verrel == dpkg_relation_none && depends->type != dep_provides) {
 160       // providers aren't relevant if a version was specified, or
 161       // if we're looking at a provider relationship already
 162       deppossi *provider;
 163       for (provider = possi->ed->depended.available;
 164            provider;
 165            provider = provider->rev_next) {
 166         if (provider->up->type != dep_provides) continue;
 167         add(provider->up->up,info.string(),displayimportance);
 168         add(provider->up,displayimportance);
 169       }
 170     }
 171   }
 172   return true;
 173 }
 174
 175 void repeatedlydisplay(packagelist *sub,
 176                        showpriority initial,
 177                        packagelist *unredisplay) {
 178   pkginfo **newl;
 179   keybindings *kb;
 180
 181   debug(dbg_general, "repeatedlydisplay(packagelist[%p])", sub);
 182   if (sub->resolvesuggest() != 0 && sub->deletelessimp_anyleft(initial)) {
 183     debug(dbg_general, "repeatedlydisplay(packagelist[%p]) once", sub);
 184     if (unredisplay) unredisplay->enddisplay();
 185     for (;;) {
 186       manual_install = 0; /* Remove flag now that resolvesuggest has seen it. */
 187       newl= sub->display();
 188       if (!newl) break;
 189       debug(dbg_general, "repeatedlydisplay(packagelist[%p]) newl", sub);
 190       kb= sub->bindings; delete sub;
 191       sub= new packagelist(kb,newl);
 192       if (sub->resolvesuggest() <= 1) break;
 193       if (!sub->deletelessimp_anyleft(dp_must)) break;
 194       debug(dbg_general, "repeatedlydisplay(packagelist[%p]) again", sub);
 195     }
 196     if (unredisplay) unredisplay->startdisplay();
 197   }
 198   debug(dbg_general, "repeatedlydisplay(packagelist[%p]) done", sub);
 199   delete sub;
 200 }
 201
 202 int packagelist::deletelessimp_anyleft(showpriority than) {
 203   debug(dbg_general, "packagelist[%p]::dli_al(%d): nitems=%d",
 204         this, than, nitems);
 205   int insat, runthr;
 206   for (runthr=0, insat=0;
 207        runthr < nitems;
 208        runthr++) {
 209     if (table[runthr]->dpriority < than) {
 210       table[runthr]->free(recursive);
 211     } else {
 212       if (insat != runthr) table[insat]= table[runthr];
 213       insat++;
 214     }
 215   }
 216   nitems= insat;
 217   debug(dbg_general, "packagelist[%p]::dli_al(%d) done; nitems=%d",
 218         this, than, nitems);
 219   return nitems;
 220 }