pkgsublist.cc 7.0 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204
  1. /*
  2. * dselect - Debian package maintenance user interface
  3. * pkgsublist.cc - status modification and recursive package list handling
  4. *
  5. * Copyright (C) 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
  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. extern "C" {
  22. #include <config.h>
  23. }
  24. #include <stdio.h>
  25. #include <string.h>
  26. #include <assert.h>
  27. extern "C" {
  28. #include <dpkg.h>
  29. #include <dpkg-db.h>
  30. }
  31. #include "dselect.h"
  32. #include "bindings.h"
  33. void packagelist::add(pkginfo *pkg) {
  34. if (debug) fprintf(debug,"packagelist[%p]::add(pkginfo %s)\n",this,pkg->name);
  35. if (!recursive || // never add things to top level
  36. !pkg->clientdata || // don't add pure virtual packages
  37. pkg->clientdata->uprec) // don't add ones already in the recursive list
  38. return;
  39. if (debug) fprintf(debug,"packagelist[%p]::add(pkginfo %s) adding\n",this,pkg->name);
  40. perpackagestate *state= &datatable[nitems];
  41. state->pkg= pkg;
  42. state->direct= state->original= pkg->clientdata->selected;
  43. state->suggested= state->selected= pkg->clientdata->selected;
  44. state->spriority= sp_inherit; state->dpriority= dp_none;
  45. state->uprec= pkg->clientdata;
  46. state->relations.init();
  47. pkg->clientdata= state;
  48. table[nitems]= state;
  49. nitems++;
  50. }
  51. void packagelist::add(pkginfo *pkg, pkginfo::pkgwant nw) {
  52. if (debug) fprintf(debug,"packagelist[%p]::add(pkginfo %s, %s)\n",
  53. this,pkg->name,gettext(wantstrings[nw]));
  54. add(pkg); if (!pkg->clientdata) return;
  55. pkg->clientdata->direct= nw;
  56. selpriority np;
  57. np= would_like_to_install(nw,pkg) ? sp_selecting : sp_deselecting;
  58. if (pkg->clientdata->spriority > np) return;
  59. if (debug) fprintf(debug,"packagelist[%p]::add(pkginfo %s, %s) setting\n",
  60. this,pkg->name,gettext(wantstrings[nw]));
  61. pkg->clientdata->suggested= pkg->clientdata->selected= nw;
  62. pkg->clientdata->spriority= np;
  63. }
  64. void packagelist::add(pkginfo *pkg, const char *extrainfo, showpriority showimp) {
  65. if (debug)
  66. fprintf(debug,"packagelist[%p]::add(pkginfo %s, \"...\", showpriority %d)\n",
  67. this,pkg->name,showimp);
  68. add(pkg); if (!pkg->clientdata) return;
  69. if (pkg->clientdata->dpriority < showimp) pkg->clientdata->dpriority= showimp;
  70. pkg->clientdata->relations(extrainfo);
  71. pkg->clientdata->relations.terminate();
  72. }
  73. int packagelist::alreadydone(doneent **done, void *check) {
  74. doneent *search;
  75. for (search= *done; search && search->dep != check; search=search->next);
  76. if (search) return 1;
  77. if (debug) fprintf(debug,"packagelist[%p]::alreadydone(%p,%p) new\n",
  78. this,done,check);
  79. search= new doneent;
  80. search->next= *done;
  81. search->dep= check;
  82. *done= search;
  83. return 0;
  84. }
  85. void packagelist::addunavailable(deppossi *possi) {
  86. if (debug) fprintf(debug,"packagelist[%p]::addunavail(%p)\n",this,possi);
  87. if (!recursive) return;
  88. if (alreadydone(&unavdone,possi)) return;
  89. assert(possi->up->up->clientdata);
  90. assert(possi->up->up->clientdata->uprec);
  91. varbuf& vb= possi->up->up->clientdata->relations;
  92. vb(possi->ed->name);
  93. vb(_(" does not appear to be available\n"));
  94. }
  95. int packagelist::add(dependency *depends, showpriority displayimportance) {
  96. if (debug) fprintf(debug,"packagelist[%p]::add(dependency[%p])\n",this,depends);
  97. if (alreadydone(&depsdone,depends)) return 0;
  98. const char *comma= "";
  99. varbuf info;
  100. info(depends->up->name);
  101. info(' ');
  102. info(gettext(relatestrings[depends->type]));
  103. info(' ');
  104. deppossi *possi;
  105. for (possi=depends->list;
  106. possi;
  107. possi=possi->next, comma=(possi && possi->next ? ", " : _(" or "))) {
  108. info(comma);
  109. info(possi->ed->name);
  110. if (possi->verrel != dvr_none) {
  111. switch (possi->verrel) {
  112. case dvr_earlierequal: info(" (<= "); break;
  113. case dvr_laterequal: info(" (>= "); break;
  114. case dvr_earlierstrict: info(" (<< "); break;
  115. case dvr_laterstrict: info(" (>> "); break;
  116. case dvr_exact: info(" (= "); break;
  117. default: internerr("unknown verrel");
  118. }
  119. info(versiondescribe(&possi->version, vdew_nonambig));
  120. info(")");
  121. }
  122. }
  123. info('\n');
  124. add(depends->up,info.string(),displayimportance);
  125. for (possi=depends->list; possi; possi=possi->next) {
  126. add(possi->ed,info.string(),displayimportance);
  127. if (possi->verrel == dvr_none && depends->type != dep_provides) {
  128. // providers aren't relevant if a version was specified, or
  129. // if we're looking at a provider relationship already
  130. deppossi *provider;
  131. for (provider= possi->ed->available.valid ? possi->ed->available.depended : 0;
  132. provider;
  133. provider=provider->nextrev) {
  134. if (provider->up->type != dep_provides) continue;
  135. add(provider->up->up,info.string(),displayimportance);
  136. add(provider->up,displayimportance);
  137. }
  138. }
  139. }
  140. return 1;
  141. }
  142. void repeatedlydisplay(packagelist *sub,
  143. showpriority initial,
  144. packagelist *unredisplay) {
  145. pkginfo **newl;
  146. keybindings *kb;
  147. if (debug) fprintf(debug,"repeatedlydisplay(packagelist[%p])\n",sub);
  148. if (sub->resolvesuggest() != 0 && sub->deletelessimp_anyleft(initial)) {
  149. if (debug) fprintf(debug,"repeatedlydisplay(packagelist[%p]) once\n",sub);
  150. if (unredisplay) unredisplay->enddisplay();
  151. for (;;) {
  152. manual_install = 0; /* Remove flag now that resolvesuggest has seen it. */
  153. newl= sub->display();
  154. if (!newl) break;
  155. if (debug) fprintf(debug,"repeatedlydisplay(packagelist[%p]) newl\n",sub);
  156. kb= sub->bindings; delete sub;
  157. sub= new packagelist(kb,newl);
  158. if (sub->resolvesuggest() <= 1) break;
  159. if (!sub->deletelessimp_anyleft(dp_must)) break;
  160. if (debug) fprintf(debug,"repeatedlydisplay(packagelist[%p]) again\n",sub);
  161. }
  162. if (unredisplay) unredisplay->startdisplay();
  163. }
  164. delete sub;
  165. if (debug) fprintf(debug,"repeatedlydisplay(packagelist[%p]) done\n",sub);
  166. }
  167. int packagelist::deletelessimp_anyleft(showpriority than) {
  168. if (debug)
  169. fprintf(debug,"packagelist[%p]::dli_al(%d): nitems=%d\n",this,than,nitems);
  170. int insat, runthr;
  171. for (runthr=0, insat=0;
  172. runthr < nitems;
  173. runthr++) {
  174. if (table[runthr]->dpriority < than) {
  175. table[runthr]->free(recursive);
  176. } else {
  177. if (insat != runthr) table[insat]= table[runthr];
  178. insat++;
  179. }
  180. }
  181. nitems= insat;
  182. if (debug) fprintf(debug,"packagelist[%p]::dli_al(%d) done; nitems=%d\n",
  183. this,than,nitems);
  184. return nitems;
  185. }