dselect/pkgsublist.cc

   1 /*
   2  * dselect - Debian GNU/Linux package maintenance user interface
   3  * pkgsublist.cc - status modification and recursive package list handling
   4  *
   5  * Copyright (C) 1995 Ian Jackson <iwj10@cus.cam.ac.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
   9  * published by the Free Software Foundation; either version 2,
  10  * or (at your option) any later version.
  11  *
  12  * This is distributed in the hope that it will be useful, but
  13  * 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
  18  * License along with this; if not, write to the Free Software
  19  * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
  20  */
  21
  22 #include <stdio.h>
  23 #include <string.h>
  24 #include <ncurses.h>
  25 #include <assert.h>
  26 #include <signal.h>
  27
  28 extern "C" {
  29 #include "config.h"
  30 #include "dpkg.h"
  31 #include "dpkg-db.h"
  32 }
  33 #include "dselect.h"
  34 #include "bindings.h"
  35
  36 void packagelist::add(pkginfo *pkg) {
  37   if (debug) fprintf(debug,"packagelist[%p]::add(pkginfo %s)\n",this,pkg->name);
  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   if (debug) fprintf(debug,"packagelist[%p]::add(pkginfo %s) adding\n",this,pkg->name);
  43   perpackagestate *state= &datatable[nitems];
  44   state->pkg= pkg;
  45   state->direct= state->original= pkg->clientdata->selected;
  46   state->suggested= state->selected= pkg->clientdata->selected;
  47   state->spriority= sp_inherit; state->dpriority= dp_none;
  48   state->uprec= pkg->clientdata;
  49   state->relations.init();
  50   pkg->clientdata= state;
  51   table[nitems]= state;
  52   nitems++;
  53 }
  54
  55 void packagelist::add(pkginfo *pkg, pkginfo::pkgwant nw) {
  56   if (debug) fprintf(debug,"packagelist[%p]::add(pkginfo %s, %s)\n",
  57                      this,pkg->name,wantstrings[nw]);
  58   add(pkg);  if (!pkg->clientdata) return;
  59   pkg->clientdata->direct= nw;
  60   selpriority np;
  61   np= would_like_to_install(nw,pkg) ? sp_selecting : sp_deselecting;
  62   if (pkg->clientdata->spriority > np) return;
  63   if (debug) fprintf(debug,"packagelist[%p]::add(pkginfo %s, %s) setting\n",
  64                      this,pkg->name,wantstrings[nw]);
  65   pkg->clientdata->suggested= pkg->clientdata->selected= nw;
  66   pkg->clientdata->spriority= np;
  67
  68 }
  69
  70 void packagelist::add(pkginfo *pkg, const char *extrainfo, showpriority showimp) {
  71   if (debug)
  72     fprintf(debug,"packagelist[%p]::add(pkginfo %s, \"...\", showpriority %d)\n",
  73             this,pkg->name,showimp);
  74   add(pkg);  if (!pkg->clientdata) return;
  75   if (pkg->clientdata->dpriority < showimp) pkg->clientdata->dpriority= showimp;
  76   pkg->clientdata->relations(extrainfo);
  77   pkg->clientdata->relations.terminate();
  78 }
  79
  80 int packagelist::alreadydone(doneent **done, void *check) {
  81   doneent *search;
  82
  83   for (search= *done; search && search->dep != check; search=search->next);
  84   if (search) return 1;
  85   if (debug) fprintf(debug,"packagelist[%p]::alreadydone(%p,%p) new\n",
  86                      this,done,check);
  87   search= new doneent;
  88   search->next= *done;
  89   search->dep= check;
  90   *done= search;
  91   return 0;
  92 }
  93
  94 void packagelist::addunavailable(deppossi *possi) {
  95   if (debug) fprintf(debug,"packagelist[%p]::addunavail(%p)\n",this,possi);
  96
  97   if (!recursive) return;
  98   if (alreadydone(&unavdone,possi)) return;
  99
 100   assert(possi->up->up->clientdata);
 101   assert(possi->up->up->clientdata->uprec);
 102
 103   varbuf& vb= possi->up->up->clientdata->relations;
 104   vb(possi->ed->name);
 105   vb(" does not appear to be available\n");
 106 }
 107
 108 int packagelist::add(dependency *depends, showpriority displayimportance) {
 109   if (debug) fprintf(debug,"packagelist[%p]::add(dependency[%p])\n",this,depends);
 110
 111   if (alreadydone(&depsdone,depends)) return 0;
 112
 113   const char *comma= "";
 114   varbuf info;
 115   info(depends->up->name);
 116   info(' ');
 117   info(relatestrings[depends->type]);
 118   info(' ');
 119   deppossi *possi;
 120   for (possi=depends->list;
 121        possi;
 122        possi=possi->next, comma=(possi && possi->next ? ", " : " or ")) {
 123     info(comma);
 124     info(possi->ed->name);
 125     if (possi->verrel != deppossi::dvr_none) {
 126       switch (possi->verrel) {
 127       case deppossi::dvr_earlierequal:  info(" (<= "); break;
 128       case deppossi::dvr_laterequal:    info(" (>= "); break;
 129       case deppossi::dvr_earlierstrict: info(" (<< "); break;
 130       case deppossi::dvr_laterstrict:   info(" (>> "); break;
 131       case deppossi::dvr_exact:         info(" (= "); break;
 132       default: internerr("unknown verrel");
 133       }
 134       info(versiondescribe(&possi->version,vdew_never));
 135       info(")");
 136     }
 137   }
 138   info('\n');
 139   add(depends->up,info.string(),displayimportance);
 140   for (possi=depends->list; possi; possi=possi->next) {
 141     add(possi->ed,info.string(),displayimportance);
 142     if (possi->verrel == deppossi::dvr_none && depends->type != dep_provides) {
 143       // providers aren't relevant if a version was specified, or
 144       // if we're looking at a provider relationship already
 145       deppossi *provider;
 146       for (provider= possi->ed->available.valid ? possi->ed->available.depended : 0;
 147            provider;
 148            provider=provider->nextrev) {
 149         if (provider->up->type != dep_provides) continue;
 150         add(provider->up->up,info.string(),displayimportance);
 151         add(provider->up,displayimportance);
 152       }
 153     }
 154   }
 155   return 1;
 156 }
 157
 158 void repeatedlydisplay(packagelist *sub,
 159                        showpriority initial,
 160                        packagelist *unredisplay) {
 161   pkginfo **newl;
 162   keybindings *kb;
 163
 164   if (debug) fprintf(debug,"repeatedlydisplay(packagelist[%p])\n",sub);
 165   if (sub->resolvesuggest() != 0 && sub->deletelessimp_anyleft(initial)) {
 166     if (debug) fprintf(debug,"repeatedlydisplay(packagelist[%p]) once\n",sub);
 167     if (unredisplay) unredisplay->enddisplay();
 168     for (;;) {
 169       newl= sub->display();
 170       if (!newl) break;
 171       if (debug) fprintf(debug,"repeatedlydisplay(packagelist[%p]) newl\n",sub);
 172       kb= sub->bindings; delete sub;
 173       sub= new packagelist(kb,newl);
 174       if (sub->resolvesuggest() <= 1) break;
 175       if (!sub->deletelessimp_anyleft(dp_must)) break;
 176       if (debug) fprintf(debug,"repeatedlydisplay(packagelist[%p]) again\n",sub);
 177     }
 178     if (unredisplay) unredisplay->startdisplay();
 179   }
 180   delete sub;
 181   if (debug) fprintf(debug,"repeatedlydisplay(packagelist[%p]) done\n",sub);
 182 }
 183
 184 int packagelist::deletelessimp_anyleft(showpriority than) {
 185   if (debug)
 186     fprintf(debug,"packagelist[%p]::dli_al(%d): nitems=%d\n",this,than,nitems);
 187   int insat, runthr;
 188   for (runthr=0, insat=0;
 189        runthr < nitems;
 190        runthr++) {
 191     if (table[runthr]->dpriority < than) {
 192       table[runthr]->free(recursive);
 193     } else {
 194       if (insat != runthr) table[insat]= table[runthr];
 195       insat++;
 196     }
 197   }
 198   nitems= insat;
 199   if (debug) fprintf(debug,"packagelist[%p]::dli_al(%d) done; nitems=%d\n",
 200                      this,than,nitems);
 201   return nitems;
 202 }