fix priority sorting by prefering higher in MarkInstall
[ntk/apt.git] / apt-pkg / depcache.cc
1 // -*- mode: cpp; mode: fold -*-
2 // Description /*{{{*/
3 // $Id: depcache.cc,v 1.25 2001/05/27 05:36:04 jgg Exp $
4 /* ######################################################################
5
6 Dependency Cache - Caches Dependency information.
7
8 ##################################################################### */
9 /*}}}*/
10 // Include Files /*{{{*/
11 #include<config.h>
12
13 #include <apt-pkg/depcache.h>
14 #include <apt-pkg/version.h>
15 #include <apt-pkg/versionmatch.h>
16 #include <apt-pkg/error.h>
17 #include <apt-pkg/sptr.h>
18 #include <apt-pkg/algorithms.h>
19 #include <apt-pkg/fileutl.h>
20 #include <apt-pkg/strutl.h>
21 #include <apt-pkg/configuration.h>
22 #include <apt-pkg/aptconfiguration.h>
23 #include <apt-pkg/pkgsystem.h>
24 #include <apt-pkg/tagfile.h>
25 #include <apt-pkg/progress.h>
26 #include <apt-pkg/cacheset.h>
27
28 #include <algorithm>
29 #include <iostream>
30 #include <sstream>
31 #include <set>
32
33 #include <sys/stat.h>
34
35 #include <apti18n.h>
36 /*}}}*/
37
38 using std::string;
39
40 // helper for Install-Recommends-Sections and Never-MarkAuto-Sections /*{{{*/
41 static bool
42 ConfigValueInSubTree(const char* SubTree, const char *needle)
43 {
44 Configuration::Item const *Opts;
45 Opts = _config->Tree(SubTree);
46 if (Opts != 0 && Opts->Child != 0)
47 {
48 Opts = Opts->Child;
49 for (; Opts != 0; Opts = Opts->Next)
50 {
51 if (Opts->Value.empty() == true)
52 continue;
53 if (strcmp(needle, Opts->Value.c_str()) == 0)
54 return true;
55 }
56 }
57 return false;
58 }
59 /*}}}*/
60 pkgDepCache::ActionGroup::ActionGroup(pkgDepCache &cache) : /*{{{*/
61 cache(cache), released(false)
62 {
63 ++cache.group_level;
64 }
65
66 void pkgDepCache::ActionGroup::release()
67 {
68 if(!released)
69 {
70 if(cache.group_level == 0)
71 std::cerr << "W: Unbalanced action groups, expect badness" << std::endl;
72 else
73 {
74 --cache.group_level;
75
76 if(cache.group_level == 0)
77 cache.MarkAndSweep();
78 }
79
80 released = true;
81 }
82 }
83
84 pkgDepCache::ActionGroup::~ActionGroup()
85 {
86 release();
87 }
88 /*}}}*/
89 // DepCache::pkgDepCache - Constructors /*{{{*/
90 // ---------------------------------------------------------------------
91 /* */
92 pkgDepCache::pkgDepCache(pkgCache *pCache,Policy *Plcy) :
93 group_level(0), Cache(pCache), PkgState(0), DepState(0)
94 {
95 DebugMarker = _config->FindB("Debug::pkgDepCache::Marker", false);
96 DebugAutoInstall = _config->FindB("Debug::pkgDepCache::AutoInstall", false);
97 delLocalPolicy = 0;
98 LocalPolicy = Plcy;
99 if (LocalPolicy == 0)
100 delLocalPolicy = LocalPolicy = new Policy;
101 }
102 /*}}}*/
103 // DepCache::~pkgDepCache - Destructor /*{{{*/
104 // ---------------------------------------------------------------------
105 /* */
106 pkgDepCache::~pkgDepCache()
107 {
108 delete [] PkgState;
109 delete [] DepState;
110 delete delLocalPolicy;
111 }
112 /*}}}*/
113 // DepCache::Init - Generate the initial extra structures. /*{{{*/
114 // ---------------------------------------------------------------------
115 /* This allocats the extension buffers and initializes them. */
116 bool pkgDepCache::Init(OpProgress *Prog)
117 {
118 // Suppress mark updates during this operation (just in case) and
119 // run a mark operation when Init terminates.
120 ActionGroup actions(*this);
121
122 delete [] PkgState;
123 delete [] DepState;
124 PkgState = new StateCache[Head().PackageCount];
125 DepState = new unsigned char[Head().DependsCount];
126 memset(PkgState,0,sizeof(*PkgState)*Head().PackageCount);
127 memset(DepState,0,sizeof(*DepState)*Head().DependsCount);
128
129 if (Prog != 0)
130 {
131 Prog->OverallProgress(0,2*Head().PackageCount,Head().PackageCount,
132 _("Building dependency tree"));
133 Prog->SubProgress(Head().PackageCount,_("Candidate versions"));
134 }
135
136 /* Set the current state of everything. In this state all of the
137 packages are kept exactly as is. See AllUpgrade */
138 int Done = 0;
139 for (PkgIterator I = PkgBegin(); I.end() != true; ++I, ++Done)
140 {
141 if (Prog != 0 && Done%20 == 0)
142 Prog->Progress(Done);
143
144 // Find the proper cache slot
145 StateCache &State = PkgState[I->ID];
146 State.iFlags = 0;
147
148 // Figure out the install version
149 State.CandidateVer = GetCandidateVer(I);
150 State.InstallVer = I.CurrentVer();
151 State.Mode = ModeKeep;
152
153 State.Update(I,*this);
154 }
155
156 if (Prog != 0)
157 {
158
159 Prog->OverallProgress(Head().PackageCount,2*Head().PackageCount,
160 Head().PackageCount,
161 _("Building dependency tree"));
162 Prog->SubProgress(Head().PackageCount,_("Dependency generation"));
163 }
164
165 Update(Prog);
166
167 if(Prog != 0)
168 Prog->Done();
169
170 return true;
171 }
172 /*}}}*/
173 bool pkgDepCache::readStateFile(OpProgress *Prog) /*{{{*/
174 {
175 FileFd state_file;
176 string const state = _config->FindFile("Dir::State::extended_states");
177 if(RealFileExists(state)) {
178 state_file.Open(state, FileFd::ReadOnly);
179 off_t const file_size = state_file.Size();
180 if(Prog != NULL)
181 Prog->OverallProgress(0, file_size, 1,
182 _("Reading state information"));
183
184 pkgTagFile tagfile(&state_file);
185 pkgTagSection section;
186 off_t amt = 0;
187 bool const debug_autoremove = _config->FindB("Debug::pkgAutoRemove",false);
188 while(tagfile.Step(section)) {
189 string const pkgname = section.FindS("Package");
190 string pkgarch = section.FindS("Architecture");
191 if (pkgarch.empty() == true)
192 pkgarch = "any";
193 pkgCache::PkgIterator pkg = Cache->FindPkg(pkgname, pkgarch);
194 // Silently ignore unknown packages and packages with no actual version.
195 if(pkg.end() == true || pkg->VersionList == 0)
196 continue;
197
198 short const reason = section.FindI("Auto-Installed", 0);
199 if(reason > 0)
200 {
201 PkgState[pkg->ID].Flags |= Flag::Auto;
202 if (unlikely(debug_autoremove))
203 std::clog << "Auto-Installed : " << pkg.FullName() << std::endl;
204 if (pkgarch == "any")
205 {
206 pkgCache::GrpIterator G = pkg.Group();
207 for (pkg = G.NextPkg(pkg); pkg.end() != true; pkg = G.NextPkg(pkg))
208 if (pkg->VersionList != 0)
209 PkgState[pkg->ID].Flags |= Flag::Auto;
210 }
211 }
212 amt += section.size();
213 if(Prog != NULL)
214 Prog->OverallProgress(amt, file_size, 1,
215 _("Reading state information"));
216 }
217 if(Prog != NULL)
218 Prog->OverallProgress(file_size, file_size, 1,
219 _("Reading state information"));
220 }
221
222 return true;
223 }
224 /*}}}*/
225 bool pkgDepCache::writeStateFile(OpProgress *prog, bool InstalledOnly) /*{{{*/
226 {
227 bool const debug_autoremove = _config->FindB("Debug::pkgAutoRemove",false);
228
229 if(debug_autoremove)
230 std::clog << "pkgDepCache::writeStateFile()" << std::endl;
231
232 FileFd StateFile;
233 string const state = _config->FindFile("Dir::State::extended_states");
234
235 // if it does not exist, create a empty one
236 if(!RealFileExists(state))
237 {
238 StateFile.Open(state, FileFd::WriteAtomic);
239 StateFile.Close();
240 }
241
242 // open it
243 if(!StateFile.Open(state, FileFd::ReadOnly))
244 return _error->Error(_("Failed to open StateFile %s"),
245 state.c_str());
246
247 FILE *OutFile;
248 string const outfile = state + ".tmp";
249 if((OutFile = fopen(outfile.c_str(),"w")) == NULL)
250 return _error->Error(_("Failed to write temporary StateFile %s"),
251 outfile.c_str());
252
253 // first merge with the existing sections
254 pkgTagFile tagfile(&StateFile);
255 pkgTagSection section;
256 std::set<string> pkgs_seen;
257 const char *nullreorderlist[] = {0};
258 while(tagfile.Step(section)) {
259 string const pkgname = section.FindS("Package");
260 string pkgarch = section.FindS("Architecture");
261 if (pkgarch.empty() == true)
262 pkgarch = "native";
263 // Silently ignore unknown packages and packages with no actual
264 // version.
265 pkgCache::PkgIterator pkg = Cache->FindPkg(pkgname, pkgarch);
266 if(pkg.end() || pkg.VersionList().end())
267 continue;
268 StateCache const &P = PkgState[pkg->ID];
269 bool newAuto = (P.Flags & Flag::Auto);
270 // skip not installed or now-removed ones if requested
271 if (InstalledOnly && (
272 (pkg->CurrentVer == 0 && P.Mode != ModeInstall) ||
273 (pkg->CurrentVer != 0 && P.Mode == ModeDelete)))
274 {
275 // The section is obsolete if it contains no other tag
276 unsigned int const count = section.Count();
277 if (count < 2 ||
278 (count == 2 && section.Exists("Auto-Installed")) ||
279 (count == 3 && section.Exists("Auto-Installed") && section.Exists("Architecture")))
280 continue;
281 else
282 newAuto = false;
283 }
284 if(_config->FindB("Debug::pkgAutoRemove",false))
285 std::clog << "Update existing AutoInstall info: "
286 << pkg.FullName() << std::endl;
287 TFRewriteData rewrite[3];
288 rewrite[0].Tag = "Architecture";
289 rewrite[0].Rewrite = pkg.Arch();
290 rewrite[0].NewTag = 0;
291 rewrite[1].Tag = "Auto-Installed";
292 rewrite[1].Rewrite = newAuto ? "1" : "0";
293 rewrite[1].NewTag = 0;
294 rewrite[2].Tag = 0;
295 TFRewrite(OutFile, section, nullreorderlist, rewrite);
296 fprintf(OutFile,"\n");
297 pkgs_seen.insert(pkg.FullName());
298 }
299
300 // then write the ones we have not seen yet
301 std::ostringstream ostr;
302 for(pkgCache::PkgIterator pkg=Cache->PkgBegin(); !pkg.end(); ++pkg) {
303 StateCache const &P = PkgState[pkg->ID];
304 if(P.Flags & Flag::Auto) {
305 if (pkgs_seen.find(pkg.FullName()) != pkgs_seen.end()) {
306 if(debug_autoremove)
307 std::clog << "Skipping already written " << pkg.FullName() << std::endl;
308 continue;
309 }
310 // skip not installed ones if requested
311 if (InstalledOnly && (
312 (pkg->CurrentVer == 0 && P.Mode != ModeInstall) ||
313 (pkg->CurrentVer != 0 && P.Mode == ModeDelete)))
314 continue;
315 const char* const pkgarch = pkg.Arch();
316 if (strcmp(pkgarch, "all") == 0)
317 continue;
318 if(debug_autoremove)
319 std::clog << "Writing new AutoInstall: " << pkg.FullName() << std::endl;
320 ostr.str(string(""));
321 ostr << "Package: " << pkg.Name()
322 << "\nArchitecture: " << pkgarch
323 << "\nAuto-Installed: 1\n\n";
324 fprintf(OutFile,"%s",ostr.str().c_str());
325 }
326 }
327 fclose(OutFile);
328
329 // move the outfile over the real file and set permissions
330 rename(outfile.c_str(), state.c_str());
331 chmod(state.c_str(), 0644);
332
333 return true;
334 }
335 /*}}}*/
336 // DepCache::CheckDep - Checks a single dependency /*{{{*/
337 // ---------------------------------------------------------------------
338 /* This first checks the dependency against the main target package and
339 then walks along the package provides list and checks if each provides
340 will be installed then checks the provides against the dep. Res will be
341 set to the package which was used to satisfy the dep. */
342 bool pkgDepCache::CheckDep(DepIterator Dep,int Type,PkgIterator &Res)
343 {
344 Res = Dep.TargetPkg();
345
346 /* Check simple depends. A depends -should- never self match but
347 we allow it anyhow because dpkg does. Technically it is a packaging
348 bug. Conflicts may never self match */
349 if (Dep.IsIgnorable(Res) == false)
350 {
351 PkgIterator Pkg = Dep.TargetPkg();
352 // Check the base package
353 if (Type == NowVersion && Pkg->CurrentVer != 0)
354 if (Dep.IsSatisfied(Pkg.CurrentVer()) == true)
355 return true;
356
357 if (Type == InstallVersion && PkgState[Pkg->ID].InstallVer != 0)
358 if (Dep.IsSatisfied(PkgState[Pkg->ID].InstVerIter(*this)) == true)
359 return true;
360
361 if (Type == CandidateVersion && PkgState[Pkg->ID].CandidateVer != 0)
362 if (Dep.IsSatisfied(PkgState[Pkg->ID].CandidateVerIter(*this)) == true)
363 return true;
364 }
365
366 if (Dep->Type == Dep::Obsoletes)
367 return false;
368
369 // Check the providing packages
370 PrvIterator P = Dep.TargetPkg().ProvidesList();
371 for (; P.end() != true; ++P)
372 {
373 if (Dep.IsIgnorable(P) == true)
374 continue;
375
376 // Check if the provides is a hit
377 if (Type == NowVersion)
378 {
379 if (P.OwnerPkg().CurrentVer() != P.OwnerVer())
380 continue;
381 }
382
383 if (Type == InstallVersion)
384 {
385 StateCache &State = PkgState[P.OwnerPkg()->ID];
386 if (State.InstallVer != (Version *)P.OwnerVer())
387 continue;
388 }
389
390 if (Type == CandidateVersion)
391 {
392 StateCache &State = PkgState[P.OwnerPkg()->ID];
393 if (State.CandidateVer != (Version *)P.OwnerVer())
394 continue;
395 }
396
397 // Compare the versions.
398 if (Dep.IsSatisfied(P) == true)
399 {
400 Res = P.OwnerPkg();
401 return true;
402 }
403 }
404
405 return false;
406 }
407 /*}}}*/
408 // DepCache::AddSizes - Add the packages sizes to the counters /*{{{*/
409 // ---------------------------------------------------------------------
410 /* Call with Inverse = true to preform the inverse opration */
411 void pkgDepCache::AddSizes(const PkgIterator &Pkg, bool const Inverse)
412 {
413 StateCache &P = PkgState[Pkg->ID];
414
415 if (Pkg->VersionList == 0)
416 return;
417
418 if (Pkg.State() == pkgCache::PkgIterator::NeedsConfigure &&
419 P.Keep() == true)
420 return;
421
422 // Compute the size data
423 if (P.NewInstall() == true)
424 {
425 if (Inverse == false) {
426 iUsrSize += P.InstVerIter(*this)->InstalledSize;
427 iDownloadSize += P.InstVerIter(*this)->Size;
428 } else {
429 iUsrSize -= P.InstVerIter(*this)->InstalledSize;
430 iDownloadSize -= P.InstVerIter(*this)->Size;
431 }
432 return;
433 }
434
435 // Upgrading
436 if (Pkg->CurrentVer != 0 &&
437 (P.InstallVer != (Version *)Pkg.CurrentVer() ||
438 (P.iFlags & ReInstall) == ReInstall) && P.InstallVer != 0)
439 {
440 if (Inverse == false) {
441 iUsrSize -= Pkg.CurrentVer()->InstalledSize;
442 iUsrSize += P.InstVerIter(*this)->InstalledSize;
443 iDownloadSize += P.InstVerIter(*this)->Size;
444 } else {
445 iUsrSize -= P.InstVerIter(*this)->InstalledSize;
446 iUsrSize += Pkg.CurrentVer()->InstalledSize;
447 iDownloadSize -= P.InstVerIter(*this)->Size;
448 }
449 return;
450 }
451
452 // Reinstall
453 if (Pkg.State() == pkgCache::PkgIterator::NeedsUnpack &&
454 P.Delete() == false)
455 {
456 if (Inverse == false)
457 iDownloadSize += P.InstVerIter(*this)->Size;
458 else
459 iDownloadSize -= P.InstVerIter(*this)->Size;
460 return;
461 }
462
463 // Removing
464 if (Pkg->CurrentVer != 0 && P.InstallVer == 0)
465 {
466 if (Inverse == false)
467 iUsrSize -= Pkg.CurrentVer()->InstalledSize;
468 else
469 iUsrSize += Pkg.CurrentVer()->InstalledSize;
470 return;
471 }
472 }
473 /*}}}*/
474 // DepCache::AddStates - Add the package to the state counter /*{{{*/
475 // ---------------------------------------------------------------------
476 /* This routine is tricky to use, you must make sure that it is never
477 called twice for the same package. This means the Remove/Add section
478 should be as short as possible and not encompass any code that will
479 calld Remove/Add itself. Remember, dependencies can be circular so
480 while processing a dep for Pkg it is possible that Add/Remove
481 will be called on Pkg */
482 void pkgDepCache::AddStates(const PkgIterator &Pkg, bool const Invert)
483 {
484 signed char const Add = (Invert == false) ? 1 : -1;
485 StateCache &State = PkgState[Pkg->ID];
486
487 // The Package is broken (either minimal dep or policy dep)
488 if ((State.DepState & DepInstMin) != DepInstMin)
489 iBrokenCount += Add;
490 if ((State.DepState & DepInstPolicy) != DepInstPolicy)
491 iPolicyBrokenCount += Add;
492
493 // Bad state
494 if (Pkg.State() != PkgIterator::NeedsNothing)
495 iBadCount += Add;
496
497 // Not installed
498 if (Pkg->CurrentVer == 0)
499 {
500 if (State.Mode == ModeDelete &&
501 (State.iFlags & Purge) == Purge && Pkg.Purge() == false)
502 iDelCount += Add;
503
504 if (State.Mode == ModeInstall)
505 iInstCount += Add;
506 return;
507 }
508
509 // Installed, no upgrade
510 if (State.Status == 0)
511 {
512 if (State.Mode == ModeDelete)
513 iDelCount += Add;
514 else
515 if ((State.iFlags & ReInstall) == ReInstall)
516 iInstCount += Add;
517
518 return;
519 }
520
521 // Alll 3 are possible
522 if (State.Mode == ModeDelete)
523 iDelCount += Add;
524 if (State.Mode == ModeKeep)
525 iKeepCount += Add;
526 if (State.Mode == ModeInstall)
527 iInstCount += Add;
528 }
529 /*}}}*/
530 // DepCache::BuildGroupOrs - Generate the Or group dep data /*{{{*/
531 // ---------------------------------------------------------------------
532 /* The or group results are stored in the last item of the or group. This
533 allows easy detection of the state of a whole or'd group. */
534 void pkgDepCache::BuildGroupOrs(VerIterator const &V)
535 {
536 unsigned char Group = 0;
537
538 for (DepIterator D = V.DependsList(); D.end() != true; ++D)
539 {
540 // Build the dependency state.
541 unsigned char &State = DepState[D->ID];
542
543 /* Invert for Conflicts. We have to do this twice to get the
544 right sense for a conflicts group */
545 if (D.IsNegative() == true)
546 State = ~State;
547
548 // Add to the group if we are within an or..
549 State &= 0x7;
550 Group |= State;
551 State |= Group << 3;
552 if ((D->CompareOp & Dep::Or) != Dep::Or)
553 Group = 0;
554
555 // Invert for Conflicts
556 if (D.IsNegative() == true)
557 State = ~State;
558 }
559 }
560 /*}}}*/
561 // DepCache::VersionState - Perform a pass over a dependency list /*{{{*/
562 // ---------------------------------------------------------------------
563 /* This is used to run over a dependency list and determine the dep
564 state of the list, filtering it through both a Min check and a Policy
565 check. The return result will have SetMin/SetPolicy low if a check
566 fails. It uses the DepState cache for it's computations. */
567 unsigned char pkgDepCache::VersionState(DepIterator D,unsigned char Check,
568 unsigned char SetMin,
569 unsigned char SetPolicy)
570 {
571 unsigned char Dep = 0xFF;
572
573 while (D.end() != true)
574 {
575 // Compute a single dependency element (glob or)
576 DepIterator Start = D;
577 unsigned char State = 0;
578 for (bool LastOR = true; D.end() == false && LastOR == true; ++D)
579 {
580 State |= DepState[D->ID];
581 LastOR = (D->CompareOp & Dep::Or) == Dep::Or;
582 }
583
584 // Minimum deps that must be satisfied to have a working package
585 if (Start.IsCritical() == true)
586 if ((State & Check) != Check)
587 Dep &= ~SetMin;
588
589 // Policy deps that must be satisfied to install the package
590 if (IsImportantDep(Start) == true &&
591 (State & Check) != Check)
592 Dep &= ~SetPolicy;
593 }
594
595 return Dep;
596 }
597 /*}}}*/
598 // DepCache::DependencyState - Compute the 3 results for a dep /*{{{*/
599 // ---------------------------------------------------------------------
600 /* This is the main dependency computation bit. It computes the 3 main
601 results for a dependencys, Now, Install and Candidate. Callers must
602 invert the result if dealing with conflicts. */
603 unsigned char pkgDepCache::DependencyState(DepIterator &D)
604 {
605 unsigned char State = 0;
606
607 if (CheckDep(D,NowVersion) == true)
608 State |= DepNow;
609 if (CheckDep(D,InstallVersion) == true)
610 State |= DepInstall;
611 if (CheckDep(D,CandidateVersion) == true)
612 State |= DepCVer;
613
614 return State;
615 }
616 /*}}}*/
617 // DepCache::UpdateVerState - Compute the Dep member of the state /*{{{*/
618 // ---------------------------------------------------------------------
619 /* This determines the combined dependency representation of a package
620 for its two states now and install. This is done by using the pre-generated
621 dependency information. */
622 void pkgDepCache::UpdateVerState(PkgIterator Pkg)
623 {
624 // Empty deps are always true
625 StateCache &State = PkgState[Pkg->ID];
626 State.DepState = 0xFF;
627
628 // Check the Current state
629 if (Pkg->CurrentVer != 0)
630 {
631 DepIterator D = Pkg.CurrentVer().DependsList();
632 State.DepState &= VersionState(D,DepNow,DepNowMin,DepNowPolicy);
633 }
634
635 /* Check the candidate state. We do not compare against the whole as
636 a candidate state but check the candidate version against the
637 install states */
638 if (State.CandidateVer != 0)
639 {
640 DepIterator D = State.CandidateVerIter(*this).DependsList();
641 State.DepState &= VersionState(D,DepInstall,DepCandMin,DepCandPolicy);
642 }
643
644 // Check target state which can only be current or installed
645 if (State.InstallVer != 0)
646 {
647 DepIterator D = State.InstVerIter(*this).DependsList();
648 State.DepState &= VersionState(D,DepInstall,DepInstMin,DepInstPolicy);
649 }
650 }
651 /*}}}*/
652 // DepCache::Update - Figure out all the state information /*{{{*/
653 // ---------------------------------------------------------------------
654 /* This will figure out the state of all the packages and all the
655 dependencies based on the current policy. */
656 void pkgDepCache::Update(OpProgress *Prog)
657 {
658 iUsrSize = 0;
659 iDownloadSize = 0;
660 iDelCount = 0;
661 iInstCount = 0;
662 iKeepCount = 0;
663 iBrokenCount = 0;
664 iBadCount = 0;
665
666 // Perform the depends pass
667 int Done = 0;
668 for (PkgIterator I = PkgBegin(); I.end() != true; ++I, ++Done)
669 {
670 if (Prog != 0 && Done%20 == 0)
671 Prog->Progress(Done);
672 for (VerIterator V = I.VersionList(); V.end() != true; ++V)
673 {
674 unsigned char Group = 0;
675
676 for (DepIterator D = V.DependsList(); D.end() != true; ++D)
677 {
678 // Build the dependency state.
679 unsigned char &State = DepState[D->ID];
680 State = DependencyState(D);
681
682 // Add to the group if we are within an or..
683 Group |= State;
684 State |= Group << 3;
685 if ((D->CompareOp & Dep::Or) != Dep::Or)
686 Group = 0;
687
688 // Invert for Conflicts
689 if (D.IsNegative() == true)
690 State = ~State;
691 }
692 }
693
694 // Compute the package dependency state and size additions
695 AddSizes(I);
696 UpdateVerState(I);
697 AddStates(I);
698 }
699
700 if (Prog != 0)
701 Prog->Progress(Done);
702
703 readStateFile(Prog);
704 }
705 /*}}}*/
706 // DepCache::Update - Update the deps list of a package /*{{{*/
707 // ---------------------------------------------------------------------
708 /* This is a helper for update that only does the dep portion of the scan.
709 It is mainly meant to scan reverse dependencies. */
710 void pkgDepCache::Update(DepIterator D)
711 {
712 // Update the reverse deps
713 for (;D.end() != true; ++D)
714 {
715 unsigned char &State = DepState[D->ID];
716 State = DependencyState(D);
717
718 // Invert for Conflicts
719 if (D.IsNegative() == true)
720 State = ~State;
721
722 RemoveStates(D.ParentPkg());
723 BuildGroupOrs(D.ParentVer());
724 UpdateVerState(D.ParentPkg());
725 AddStates(D.ParentPkg());
726 }
727 }
728 /*}}}*/
729 // DepCache::Update - Update the related deps of a package /*{{{*/
730 // ---------------------------------------------------------------------
731 /* This is called whenever the state of a package changes. It updates
732 all cached dependencies related to this package. */
733 void pkgDepCache::Update(PkgIterator const &Pkg)
734 {
735 // Recompute the dep of the package
736 RemoveStates(Pkg);
737 UpdateVerState(Pkg);
738 AddStates(Pkg);
739
740 // Update the reverse deps
741 Update(Pkg.RevDependsList());
742
743 // Update the provides map for the current ver
744 if (Pkg->CurrentVer != 0)
745 for (PrvIterator P = Pkg.CurrentVer().ProvidesList();
746 P.end() != true; ++P)
747 Update(P.ParentPkg().RevDependsList());
748
749 // Update the provides map for the candidate ver
750 if (PkgState[Pkg->ID].CandidateVer != 0)
751 for (PrvIterator P = PkgState[Pkg->ID].CandidateVerIter(*this).ProvidesList();
752 P.end() != true; ++P)
753 Update(P.ParentPkg().RevDependsList());
754 }
755 /*}}}*/
756 // DepCache::MarkKeep - Put the package in the keep state /*{{{*/
757 // ---------------------------------------------------------------------
758 /* */
759 bool pkgDepCache::MarkKeep(PkgIterator const &Pkg, bool Soft, bool FromUser,
760 unsigned long Depth)
761 {
762 if (IsModeChangeOk(ModeKeep, Pkg, Depth, FromUser) == false)
763 return false;
764
765 /* Reject an attempt to keep a non-source broken installed package, those
766 must be upgraded */
767 if (Pkg.State() == PkgIterator::NeedsUnpack &&
768 Pkg.CurrentVer().Downloadable() == false)
769 return false;
770
771 /* We changed the soft state all the time so the UI is a bit nicer
772 to use */
773 StateCache &P = PkgState[Pkg->ID];
774
775 // Check that it is not already kept
776 if (P.Mode == ModeKeep)
777 return true;
778
779 if (Soft == true)
780 P.iFlags |= AutoKept;
781 else
782 P.iFlags &= ~AutoKept;
783
784 ActionGroup group(*this);
785
786 #if 0 // reseting the autoflag here means we lose the
787 // auto-mark information if a user selects a package for removal
788 // but changes his mind then and sets it for keep again
789 // - this makes sense as default when all Garbage dependencies
790 // are automatically marked for removal (as aptitude does).
791 // setting a package for keep then makes it no longer autoinstalled
792 // for all other use-case this action is rather suprising
793 if(FromUser && !P.Marked)
794 P.Flags &= ~Flag::Auto;
795 #endif
796
797 if (DebugMarker == true)
798 std::clog << OutputInDepth(Depth) << "MarkKeep " << Pkg << " FU=" << FromUser << std::endl;
799
800 RemoveSizes(Pkg);
801 RemoveStates(Pkg);
802
803 P.Mode = ModeKeep;
804 if (Pkg->CurrentVer == 0)
805 P.InstallVer = 0;
806 else
807 P.InstallVer = Pkg.CurrentVer();
808
809 AddStates(Pkg);
810 Update(Pkg);
811 AddSizes(Pkg);
812
813 return true;
814 }
815 /*}}}*/
816 // DepCache::MarkDelete - Put the package in the delete state /*{{{*/
817 // ---------------------------------------------------------------------
818 /* */
819 bool pkgDepCache::MarkDelete(PkgIterator const &Pkg, bool rPurge,
820 unsigned long Depth, bool FromUser)
821 {
822 if (IsModeChangeOk(ModeDelete, Pkg, Depth, FromUser) == false)
823 return false;
824
825 StateCache &P = PkgState[Pkg->ID];
826
827 // Check that it is not already marked for delete
828 if ((P.Mode == ModeDelete || P.InstallVer == 0) &&
829 (Pkg.Purge() == true || rPurge == false))
830 return true;
831
832 // check if we are allowed to remove the package
833 if (IsDeleteOk(Pkg,rPurge,Depth,FromUser) == false)
834 return false;
835
836 P.iFlags &= ~(AutoKept | Purge);
837 if (rPurge == true)
838 P.iFlags |= Purge;
839
840 ActionGroup group(*this);
841
842 if (DebugMarker == true)
843 std::clog << OutputInDepth(Depth) << (rPurge ? "MarkPurge " : "MarkDelete ") << Pkg << " FU=" << FromUser << std::endl;
844
845 RemoveSizes(Pkg);
846 RemoveStates(Pkg);
847
848 if (Pkg->CurrentVer == 0 && (Pkg.Purge() == true || rPurge == false))
849 P.Mode = ModeKeep;
850 else
851 P.Mode = ModeDelete;
852 P.InstallVer = 0;
853
854 AddStates(Pkg);
855 Update(Pkg);
856 AddSizes(Pkg);
857
858 return true;
859 }
860 /*}}}*/
861 // DepCache::IsDeleteOk - check if it is ok to remove this package /*{{{*/
862 // ---------------------------------------------------------------------
863 /* The default implementation tries to prevent deletion of install requests.
864 dpkg holds are enforced by the private IsModeChangeOk */
865 bool pkgDepCache::IsDeleteOk(PkgIterator const &Pkg,bool rPurge,
866 unsigned long Depth, bool FromUser)
867 {
868 if (FromUser == false && Pkg->CurrentVer == 0)
869 {
870 StateCache &P = PkgState[Pkg->ID];
871 if (P.InstallVer != 0 && P.Status == 2 && (P.Flags & Flag::Auto) != Flag::Auto)
872 {
873 if (DebugMarker == true)
874 std::clog << OutputInDepth(Depth) << "Manual install request prevents MarkDelete of " << Pkg << std::endl;
875 return false;
876 }
877 }
878 return true;
879 }
880 /*}}}*/
881 // DepCache::IsModeChangeOk - check if it is ok to change the mode /*{{{*/
882 // ---------------------------------------------------------------------
883 /* this is used by all Mark methods on the very first line to check sanity
884 and prevents mode changes for packages on hold for example.
885 If you want to check Mode specific stuff you can use the virtual public
886 Is<Mode>Ok methods instead */
887 char const* PrintMode(char const mode)
888 {
889 switch (mode)
890 {
891 case pkgDepCache::ModeInstall: return "Install";
892 case pkgDepCache::ModeKeep: return "Keep";
893 case pkgDepCache::ModeDelete: return "Delete";
894 default: return "UNKNOWN";
895 }
896 }
897 bool pkgDepCache::IsModeChangeOk(ModeList const mode, PkgIterator const &Pkg,
898 unsigned long const Depth, bool const FromUser)
899 {
900 // we are not trying to hard…
901 if (unlikely(Depth > 100))
902 return false;
903
904 // general sanity
905 if (unlikely(Pkg.end() == true || Pkg->VersionList == 0))
906 return false;
907
908 // the user is always right
909 if (FromUser == true)
910 return true;
911
912 StateCache &P = PkgState[Pkg->ID];
913 // not changing the mode is obviously also fine as we might want to call
914 // e.g. MarkInstall multiple times with different arguments for the same package
915 if (P.Mode == mode)
916 return true;
917
918 // if previous state was set by user only user can reset it
919 if ((P.iFlags & Protected) == Protected)
920 {
921 if (unlikely(DebugMarker == true))
922 std::clog << OutputInDepth(Depth) << "Ignore Mark" << PrintMode(mode)
923 << " of " << Pkg << " as its mode (" << PrintMode(P.Mode)
924 << ") is protected" << std::endl;
925 return false;
926 }
927 // enforce dpkg holds
928 else if (mode != ModeKeep && Pkg->SelectedState == pkgCache::State::Hold &&
929 _config->FindB("APT::Ignore-Hold",false) == false)
930 {
931 if (unlikely(DebugMarker == true))
932 std::clog << OutputInDepth(Depth) << "Hold prevents Mark" << PrintMode(mode)
933 << " of " << Pkg << std::endl;
934 return false;
935 }
936
937 return true;
938 }
939 /*}}}*/
940 // DepCache::MarkInstall - Put the package in the install state /*{{{*/
941 // ---------------------------------------------------------------------
942 /* */
943 struct CompareProviders {
944 pkgCache::PkgIterator const Pkg;
945 CompareProviders(pkgCache::DepIterator const &Dep) : Pkg(Dep.TargetPkg()) {};
946 //bool operator() (APT::VersionList::iterator const &AV, APT::VersionList::iterator const &BV)
947 bool operator() (pkgCache::VerIterator const &AV, pkgCache::VerIterator const &BV)
948 {
949 pkgCache::PkgIterator const A = AV.ParentPkg();
950 pkgCache::PkgIterator const B = BV.ParentPkg();
951 // Prefer MA:same packages if other architectures for it are installed
952 if ((AV->MultiArch & pkgCache::Version::Same) == pkgCache::Version::Same ||
953 (BV->MultiArch & pkgCache::Version::Same) == pkgCache::Version::Same)
954 {
955 bool instA = false;
956 if ((AV->MultiArch & pkgCache::Version::Same) == pkgCache::Version::Same)
957 {
958 pkgCache::GrpIterator Grp = A.Group();
959 for (pkgCache::PkgIterator P = Grp.PackageList(); P.end() == false; P = Grp.NextPkg(P))
960 if (P->CurrentVer != 0)
961 {
962 instA = true;
963 break;
964 }
965 }
966 bool instB = false;
967 if ((BV->MultiArch & pkgCache::Version::Same) == pkgCache::Version::Same)
968 {
969 pkgCache::GrpIterator Grp = B.Group();
970 for (pkgCache::PkgIterator P = Grp.PackageList(); P.end() == false; P = Grp.NextPkg(P))
971 {
972 if (P->CurrentVer != 0)
973 {
974 instB = true;
975 break;
976 }
977 }
978 }
979 if (instA != instB)
980 return instA == false;
981 }
982 // Prefer packages in the same group as the target; e.g. foo:i386, foo:amd64
983 if (A->Group != B->Group)
984 {
985 if (A->Group == Pkg->Group && B->Group != Pkg->Group)
986 return false;
987 else if (B->Group == Pkg->Group && A->Group != Pkg->Group)
988 return true;
989 }
990 // we like essentials
991 if ((A->Flags & pkgCache::Flag::Essential) != (B->Flags & pkgCache::Flag::Essential))
992 {
993 if ((A->Flags & pkgCache::Flag::Essential) == pkgCache::Flag::Essential)
994 return false;
995 else if ((B->Flags & pkgCache::Flag::Essential) == pkgCache::Flag::Essential)
996 return true;
997 }
998 if ((A->Flags & pkgCache::Flag::Important) != (B->Flags & pkgCache::Flag::Important))
999 {
1000 if ((A->Flags & pkgCache::Flag::Important) == pkgCache::Flag::Important)
1001 return false;
1002 else if ((B->Flags & pkgCache::Flag::Important) == pkgCache::Flag::Important)
1003 return true;
1004 }
1005 // higher priority seems like a good idea
1006 if (AV->Priority != BV->Priority)
1007 return AV->Priority > BV->Priority;
1008 // prefer native architecture
1009 if (strcmp(A.Arch(), B.Arch()) != 0)
1010 {
1011 if (strcmp(A.Arch(), A.Cache()->NativeArch()) == 0)
1012 return false;
1013 else if (strcmp(B.Arch(), B.Cache()->NativeArch()) == 0)
1014 return true;
1015 std::vector<std::string> archs = APT::Configuration::getArchitectures();
1016 for (std::vector<std::string>::const_iterator a = archs.begin(); a != archs.end(); ++a)
1017 if (*a == A.Arch())
1018 return false;
1019 else if (*a == B.Arch())
1020 return true;
1021 }
1022 // unable to decide…
1023 return A->ID < B->ID;
1024 }
1025 };
1026 bool pkgDepCache::MarkInstall(PkgIterator const &Pkg,bool AutoInst,
1027 unsigned long Depth, bool FromUser,
1028 bool ForceImportantDeps)
1029 {
1030 if (IsModeChangeOk(ModeInstall, Pkg, Depth, FromUser) == false)
1031 return false;
1032
1033 StateCache &P = PkgState[Pkg->ID];
1034
1035 // See if there is even any possible instalation candidate
1036 if (P.CandidateVer == 0)
1037 return false;
1038
1039 /* Check that it is not already marked for install and that it can be
1040 installed */
1041 if ((P.InstPolicyBroken() == false && P.InstBroken() == false) &&
1042 (P.Mode == ModeInstall ||
1043 P.CandidateVer == (Version *)Pkg.CurrentVer()))
1044 {
1045 if (P.CandidateVer == (Version *)Pkg.CurrentVer() && P.InstallVer == 0)
1046 return MarkKeep(Pkg, false, FromUser, Depth+1);
1047 return true;
1048 }
1049
1050 // check if we are allowed to install the package
1051 if (IsInstallOk(Pkg,AutoInst,Depth,FromUser) == false)
1052 return false;
1053
1054 ActionGroup group(*this);
1055 P.iFlags &= ~AutoKept;
1056
1057 /* Target the candidate version and remove the autoflag. We reset the
1058 autoflag below if this was called recursively. Otherwise the user
1059 should have the ability to de-auto a package by changing its state */
1060 RemoveSizes(Pkg);
1061 RemoveStates(Pkg);
1062
1063 P.Mode = ModeInstall;
1064 P.InstallVer = P.CandidateVer;
1065
1066 if(FromUser)
1067 {
1068 // Set it to manual if it's a new install or already installed,
1069 // but only if its not marked by the autoremover (aptitude depend on this behavior)
1070 // or if we do automatic installation (aptitude never does it)
1071 if(P.Status == 2 || (Pkg->CurrentVer != 0 && (AutoInst == true || P.Marked == false)))
1072 P.Flags &= ~Flag::Auto;
1073 }
1074 else
1075 {
1076 // Set it to auto if this is a new install.
1077 if(P.Status == 2)
1078 P.Flags |= Flag::Auto;
1079 }
1080 if (P.CandidateVer == (Version *)Pkg.CurrentVer())
1081 P.Mode = ModeKeep;
1082
1083 AddStates(Pkg);
1084 Update(Pkg);
1085 AddSizes(Pkg);
1086
1087 if (AutoInst == false || _config->Find("APT::Solver", "internal") != "internal")
1088 return true;
1089
1090 if (DebugMarker == true)
1091 std::clog << OutputInDepth(Depth) << "MarkInstall " << Pkg << " FU=" << FromUser << std::endl;
1092
1093 DepIterator Dep = P.InstVerIter(*this).DependsList();
1094 for (; Dep.end() != true;)
1095 {
1096 // Grok or groups
1097 DepIterator Start = Dep;
1098 bool Result = true;
1099 unsigned Ors = 0;
1100 for (bool LastOR = true; Dep.end() == false && LastOR == true; ++Dep, ++Ors)
1101 {
1102 LastOR = (Dep->CompareOp & Dep::Or) == Dep::Or;
1103
1104 if ((DepState[Dep->ID] & DepInstall) == DepInstall)
1105 Result = false;
1106 }
1107
1108 // Dep is satisfied okay.
1109 if (Result == false)
1110 continue;
1111
1112 /* Check if this dep should be consider for install. If it is a user
1113 defined important dep and we are installed a new package then
1114 it will be installed. Otherwise we only check for important
1115 deps that have changed from the installed version
1116 */
1117 if (IsImportantDep(Start) == false)
1118 continue;
1119
1120 /* If we are in an or group locate the first or that can
1121 succeed. We have already cached this.. */
1122 for (; Ors > 1 && (DepState[Start->ID] & DepCVer) != DepCVer; --Ors)
1123 ++Start;
1124 if (Ors == 1 && (DepState[Start->ID] &DepCVer) != DepCVer && Start.IsNegative() == false)
1125 {
1126 if(DebugAutoInstall == true)
1127 std::clog << OutputInDepth(Depth) << Start << " can't be satisfied!" << std::endl;
1128 if (Start.IsCritical() == false)
1129 continue;
1130 // if the dependency was critical, we can't install it, so remove it again
1131 MarkDelete(Pkg,false,Depth + 1, false);
1132 return false;
1133 }
1134
1135 /* Check if any ImportantDep() (but not Critical) were added
1136 * since we installed the package. Also check for deps that
1137 * were satisfied in the past: for instance, if a version
1138 * restriction in a Recommends was tightened, upgrading the
1139 * package should follow that Recommends rather than causing the
1140 * dependency to be removed. (bug #470115)
1141 */
1142 if (Pkg->CurrentVer != 0 && ForceImportantDeps == false && Start.IsCritical() == false)
1143 {
1144 bool isNewImportantDep = true;
1145 bool isPreviouslySatisfiedImportantDep = false;
1146 for (DepIterator D = Pkg.CurrentVer().DependsList(); D.end() != true; ++D)
1147 {
1148 //FIXME: Should we handle or-group better here?
1149 // We do not check if the package we look for is part of the same or-group
1150 // we might find while searching, but could that really be a problem?
1151 if (D.IsCritical() == true || IsImportantDep(D) == false ||
1152 Start.TargetPkg() != D.TargetPkg())
1153 continue;
1154
1155 isNewImportantDep = false;
1156
1157 while ((D->CompareOp & Dep::Or) != 0)
1158 ++D;
1159
1160 isPreviouslySatisfiedImportantDep = (((*this)[D] & DepGNow) != 0);
1161 if (isPreviouslySatisfiedImportantDep == true)
1162 break;
1163 }
1164
1165 if(isNewImportantDep == true)
1166 {
1167 if (DebugAutoInstall == true)
1168 std::clog << OutputInDepth(Depth) << "new important dependency: "
1169 << Start.TargetPkg().FullName() << std::endl;
1170 }
1171 else if(isPreviouslySatisfiedImportantDep == true)
1172 {
1173 if (DebugAutoInstall == true)
1174 std::clog << OutputInDepth(Depth) << "previously satisfied important dependency on "
1175 << Start.TargetPkg().FullName() << std::endl;
1176 }
1177 else
1178 {
1179 if (DebugAutoInstall == true)
1180 std::clog << OutputInDepth(Depth) << "ignore old unsatisfied important dependency on "
1181 << Start.TargetPkg().FullName() << std::endl;
1182 continue;
1183 }
1184 }
1185
1186 /* This bit is for processing the possibilty of an install/upgrade
1187 fixing the problem for "positive" dependencies */
1188 if (Start.IsNegative() == false && (DepState[Start->ID] & DepCVer) == DepCVer)
1189 {
1190 APT::VersionList verlist;
1191 pkgCache::VerIterator Cand = PkgState[Start.TargetPkg()->ID].CandidateVerIter(*this);
1192 if (Cand.end() == false && Start.IsSatisfied(Cand) == true)
1193 verlist.insert(Cand);
1194 for (PrvIterator Prv = Start.TargetPkg().ProvidesList(); Prv.end() != true; ++Prv)
1195 {
1196 pkgCache::VerIterator V = Prv.OwnerVer();
1197 pkgCache::VerIterator Cand = PkgState[Prv.OwnerPkg()->ID].CandidateVerIter(*this);
1198 if (Cand.end() == true || V != Cand || Start.IsSatisfied(Prv) == false)
1199 continue;
1200 verlist.insert(Cand);
1201 }
1202 CompareProviders comp(Start);
1203 APT::VersionList::iterator InstVer = std::max_element(verlist.begin(), verlist.end(), comp);
1204
1205 if (InstVer != verlist.end())
1206 {
1207 pkgCache::PkgIterator InstPkg = InstVer.ParentPkg();
1208 if(DebugAutoInstall == true)
1209 std::clog << OutputInDepth(Depth) << "Installing " << InstPkg.Name()
1210 << " as " << Start.DepType() << " of " << Pkg.Name()
1211 << std::endl;
1212 MarkInstall(InstPkg, true, Depth + 1, false, ForceImportantDeps);
1213 // now check if we should consider it a automatic dependency or not
1214 if(InstPkg->CurrentVer == 0 && Pkg->Section != 0 && ConfigValueInSubTree("APT::Never-MarkAuto-Sections", Pkg.Section()))
1215 {
1216 if(DebugAutoInstall == true)
1217 std::clog << OutputInDepth(Depth) << "Setting NOT as auto-installed (direct "
1218 << Start.DepType() << " of pkg in APT::Never-MarkAuto-Sections)" << std::endl;
1219 MarkAuto(InstPkg, false);
1220 }
1221 }
1222 continue;
1223 }
1224 /* Negative dependencies have no or-group
1225 If the dependency isn't versioned, we try if an upgrade might solve the problem.
1226 Otherwise we remove the offender if needed */
1227 else if (Start.IsNegative() == true && Start->Type != pkgCache::Dep::Obsoletes)
1228 {
1229 SPtrArray<Version *> List = Start.AllTargets();
1230 pkgCache::PkgIterator TrgPkg = Start.TargetPkg();
1231 for (Version **I = List; *I != 0; I++)
1232 {
1233 VerIterator Ver(*this,*I);
1234 PkgIterator Pkg = Ver.ParentPkg();
1235
1236 /* The List includes all packages providing this dependency,
1237 even providers which are not installed, so skip them. */
1238 if (PkgState[Pkg->ID].InstallVer == 0)
1239 continue;
1240
1241 if ((Start->Version != 0 || TrgPkg != Pkg) &&
1242 PkgState[Pkg->ID].CandidateVer != PkgState[Pkg->ID].InstallVer &&
1243 PkgState[Pkg->ID].CandidateVer != *I &&
1244 MarkInstall(Pkg,true,Depth + 1, false, ForceImportantDeps) == true)
1245 continue;
1246 else if ((Start->Type == pkgCache::Dep::Conflicts || Start->Type == pkgCache::Dep::DpkgBreaks) &&
1247 MarkDelete(Pkg,false,Depth + 1, false) == false)
1248 break;
1249 }
1250 continue;
1251 }
1252 }
1253
1254 return Dep.end() == true;
1255 }
1256 /*}}}*/
1257 // DepCache::IsInstallOk - check if it is ok to install this package /*{{{*/
1258 // ---------------------------------------------------------------------
1259 /* The default implementation does nothing.
1260 dpkg holds are enforced by the private IsModeChangeOk */
1261 bool pkgDepCache::IsInstallOk(PkgIterator const &Pkg,bool AutoInst,
1262 unsigned long Depth, bool FromUser)
1263 {
1264 return true;
1265 }
1266 /*}}}*/
1267 // DepCache::SetReInstall - Set the reinstallation flag /*{{{*/
1268 // ---------------------------------------------------------------------
1269 /* */
1270 void pkgDepCache::SetReInstall(PkgIterator const &Pkg,bool To)
1271 {
1272 if (unlikely(Pkg.end() == true))
1273 return;
1274
1275 APT::PackageList pkglist;
1276 if (Pkg->CurrentVer != 0 &&
1277 (Pkg.CurrentVer()-> MultiArch & pkgCache::Version::Same) == pkgCache::Version::Same)
1278 {
1279 pkgCache::GrpIterator Grp = Pkg.Group();
1280 for (pkgCache::PkgIterator P = Grp.PackageList(); P.end() == false; P = Grp.NextPkg(P))
1281 {
1282 if (P->CurrentVer != 0)
1283 pkglist.insert(P);
1284 }
1285 }
1286 else
1287 pkglist.insert(Pkg);
1288
1289 ActionGroup group(*this);
1290
1291 for (APT::PackageList::const_iterator Pkg = pkglist.begin(); Pkg != pkglist.end(); ++Pkg)
1292 {
1293 RemoveSizes(Pkg);
1294 RemoveStates(Pkg);
1295
1296 StateCache &P = PkgState[Pkg->ID];
1297 if (To == true)
1298 P.iFlags |= ReInstall;
1299 else
1300 P.iFlags &= ~ReInstall;
1301
1302 AddStates(Pkg);
1303 AddSizes(Pkg);
1304 }
1305 }
1306 /*}}}*/
1307 // DepCache::SetCandidateVersion - Change the candidate version /*{{{*/
1308 // ---------------------------------------------------------------------
1309 /* */
1310 void pkgDepCache::SetCandidateVersion(VerIterator TargetVer)
1311 {
1312 pkgCache::PkgIterator Pkg = TargetVer.ParentPkg();
1313 StateCache &P = PkgState[Pkg->ID];
1314
1315 if (P.CandidateVer == TargetVer)
1316 return;
1317
1318 ActionGroup group(*this);
1319
1320 RemoveSizes(Pkg);
1321 RemoveStates(Pkg);
1322
1323 if (P.CandidateVer == P.InstallVer && P.Install() == true)
1324 P.InstallVer = (Version *)TargetVer;
1325 P.CandidateVer = (Version *)TargetVer;
1326 P.Update(Pkg,*this);
1327
1328 AddStates(Pkg);
1329 Update(Pkg);
1330 AddSizes(Pkg);
1331
1332 }
1333 /*}}}*/
1334 // DepCache::SetCandidateRelease - Change the candidate version /*{{{*/
1335 // ---------------------------------------------------------------------
1336 /* changes the candidate of a package and walks over all its dependencies
1337 to check if it needs to change the candidate of the dependency, too,
1338 to reach a installable versionstate */
1339 bool pkgDepCache::SetCandidateRelease(pkgCache::VerIterator TargetVer,
1340 std::string const &TargetRel)
1341 {
1342 std::list<std::pair<pkgCache::VerIterator, pkgCache::VerIterator> > Changed;
1343 return SetCandidateRelease(TargetVer, TargetRel, Changed);
1344 }
1345 bool pkgDepCache::SetCandidateRelease(pkgCache::VerIterator TargetVer,
1346 std::string const &TargetRel,
1347 std::list<std::pair<pkgCache::VerIterator, pkgCache::VerIterator> > &Changed)
1348 {
1349 ActionGroup group(*this);
1350 SetCandidateVersion(TargetVer);
1351
1352 if (TargetRel == "installed" || TargetRel == "candidate") // both doesn't make sense in this context
1353 return true;
1354
1355 pkgVersionMatch Match(TargetRel, pkgVersionMatch::Release);
1356 // save the position of the last element we will not undo - if we have to
1357 std::list<std::pair<pkgCache::VerIterator, pkgCache::VerIterator> >::iterator newChanged = --(Changed.end());
1358
1359 for (pkgCache::DepIterator D = TargetVer.DependsList(); D.end() == false; ++D)
1360 {
1361 if (D->Type != pkgCache::Dep::PreDepends && D->Type != pkgCache::Dep::Depends &&
1362 ((D->Type != pkgCache::Dep::Recommends && D->Type != pkgCache::Dep::Suggests) ||
1363 IsImportantDep(D) == false))
1364 continue;
1365
1366 // walk over an or-group and check if we need to do anything
1367 // for simpilicity no or-group is handled as a or-group including one dependency
1368 pkgCache::DepIterator Start = D;
1369 bool itsFine = false;
1370 for (bool stillOr = true; stillOr == true; ++Start)
1371 {
1372 stillOr = (Start->CompareOp & Dep::Or) == Dep::Or;
1373 pkgCache::PkgIterator const P = Start.TargetPkg();
1374 // virtual packages can't be a solution
1375 if (P.end() == true || (P->ProvidesList == 0 && P->VersionList == 0))
1376 continue;
1377 pkgCache::VerIterator const Cand = PkgState[P->ID].CandidateVerIter(*this);
1378 // no versioned dependency - but is it installable?
1379 if (Start.TargetVer() == 0 || Start.TargetVer()[0] == '\0')
1380 {
1381 // Check if one of the providers is installable
1382 if (P->ProvidesList != 0)
1383 {
1384 pkgCache::PrvIterator Prv = P.ProvidesList();
1385 for (; Prv.end() == false; ++Prv)
1386 {
1387 pkgCache::VerIterator const C = PkgState[Prv.OwnerPkg()->ID].CandidateVerIter(*this);
1388 if (C.end() == true || C != Prv.OwnerVer() ||
1389 (VersionState(C.DependsList(), DepInstall, DepCandMin, DepCandPolicy) & DepCandMin) != DepCandMin)
1390 continue;
1391 break;
1392 }
1393 if (Prv.end() == true)
1394 continue;
1395 }
1396 // no providers, so check if we have an installable candidate version
1397 else if (Cand.end() == true ||
1398 (VersionState(Cand.DependsList(), DepInstall, DepCandMin, DepCandPolicy) & DepCandMin) != DepCandMin)
1399 continue;
1400 itsFine = true;
1401 break;
1402 }
1403 if (Cand.end() == true)
1404 continue;
1405 // check if the current candidate is enough for the versioned dependency - and installable?
1406 if (Start.IsSatisfied(Cand) == true &&
1407 (VersionState(Cand.DependsList(), DepInstall, DepCandMin, DepCandPolicy) & DepCandMin) == DepCandMin)
1408 {
1409 itsFine = true;
1410 break;
1411 }
1412 }
1413
1414 if (itsFine == true) {
1415 // something in the or-group was fine, skip all other members
1416 for (; (D->CompareOp & Dep::Or) == Dep::Or; ++D);
1417 continue;
1418 }
1419
1420 // walk again over the or-group and check each if a candidate switch would help
1421 itsFine = false;
1422 for (bool stillOr = true; stillOr == true; ++D)
1423 {
1424 stillOr = (D->CompareOp & Dep::Or) == Dep::Or;
1425 // changing candidate will not help if the dependency is not versioned
1426 if (D.TargetVer() == 0 || D.TargetVer()[0] == '\0')
1427 {
1428 if (stillOr == true)
1429 continue;
1430 break;
1431 }
1432
1433 pkgCache::VerIterator V;
1434 if (TargetRel == "newest")
1435 V = D.TargetPkg().VersionList();
1436 else
1437 V = Match.Find(D.TargetPkg());
1438
1439 // check if the version from this release could satisfy the dependency
1440 if (V.end() == true || D.IsSatisfied(V) == false)
1441 {
1442 if (stillOr == true)
1443 continue;
1444 break;
1445 }
1446
1447 pkgCache::VerIterator oldCand = PkgState[D.TargetPkg()->ID].CandidateVerIter(*this);
1448 if (V == oldCand)
1449 {
1450 // Do we already touched this Version? If so, their versioned dependencies are okay, no need to check again
1451 for (std::list<std::pair<pkgCache::VerIterator, pkgCache::VerIterator> >::const_iterator c = Changed.begin();
1452 c != Changed.end(); ++c)
1453 {
1454 if (c->first->ParentPkg != V->ParentPkg)
1455 continue;
1456 itsFine = true;
1457 break;
1458 }
1459 }
1460
1461 if (itsFine == false)
1462 {
1463 // change the candidate
1464 Changed.push_back(make_pair(oldCand, TargetVer));
1465 if (SetCandidateRelease(V, TargetRel, Changed) == false)
1466 {
1467 if (stillOr == false)
1468 break;
1469 // undo the candidate changing
1470 SetCandidateVersion(oldCand);
1471 Changed.pop_back();
1472 continue;
1473 }
1474 itsFine = true;
1475 }
1476
1477 // something in the or-group was fine, skip all other members
1478 for (; (D->CompareOp & Dep::Or) == Dep::Or; ++D);
1479 break;
1480 }
1481
1482 if (itsFine == false && (D->Type == pkgCache::Dep::PreDepends || D->Type == pkgCache::Dep::Depends))
1483 {
1484 // undo all changes which aren't lead to a solution
1485 for (std::list<std::pair<pkgCache::VerIterator, pkgCache::VerIterator> >::const_iterator c = ++newChanged;
1486 c != Changed.end(); ++c)
1487 SetCandidateVersion(c->first);
1488 Changed.erase(newChanged, Changed.end());
1489 return false;
1490 }
1491 }
1492 return true;
1493 }
1494 /*}}}*/
1495 // DepCache::MarkAuto - set the Auto flag for a package /*{{{*/
1496 // ---------------------------------------------------------------------
1497 /* */
1498 void pkgDepCache::MarkAuto(const PkgIterator &Pkg, bool Auto)
1499 {
1500 StateCache &state = PkgState[Pkg->ID];
1501
1502 ActionGroup group(*this);
1503
1504 if(Auto)
1505 state.Flags |= Flag::Auto;
1506 else
1507 state.Flags &= ~Flag::Auto;
1508 }
1509 /*}}}*/
1510 // StateCache::Update - Compute the various static display things /*{{{*/
1511 // ---------------------------------------------------------------------
1512 /* This is called whenever the Candidate version changes. */
1513 void pkgDepCache::StateCache::Update(PkgIterator Pkg,pkgCache &Cache)
1514 {
1515 // Some info
1516 VerIterator Ver = CandidateVerIter(Cache);
1517
1518 // Use a null string or the version string
1519 if (Ver.end() == true)
1520 CandVersion = "";
1521 else
1522 CandVersion = Ver.VerStr();
1523
1524 // Find the current version
1525 CurVersion = "";
1526 if (Pkg->CurrentVer != 0)
1527 CurVersion = Pkg.CurrentVer().VerStr();
1528
1529 // Strip off the epochs for display
1530 CurVersion = StripEpoch(CurVersion);
1531 CandVersion = StripEpoch(CandVersion);
1532
1533 // Figure out if its up or down or equal
1534 Status = Ver.CompareVer(Pkg.CurrentVer());
1535 if (Pkg->CurrentVer == 0 || Pkg->VersionList == 0 || CandidateVer == 0)
1536 Status = 2;
1537 }
1538 /*}}}*/
1539 // StateCache::StripEpoch - Remove the epoch specifier from the version /*{{{*/
1540 // ---------------------------------------------------------------------
1541 /* */
1542 const char *pkgDepCache::StateCache::StripEpoch(const char *Ver)
1543 {
1544 if (Ver == 0)
1545 return 0;
1546
1547 // Strip any epoch
1548 for (const char *I = Ver; *I != 0; I++)
1549 if (*I == ':')
1550 return I + 1;
1551 return Ver;
1552 }
1553 /*}}}*/
1554 // Policy::GetCandidateVer - Returns the Candidate install version /*{{{*/
1555 // ---------------------------------------------------------------------
1556 /* The default just returns the highest available version that is not
1557 a source and automatic. */
1558 pkgCache::VerIterator pkgDepCache::Policy::GetCandidateVer(PkgIterator const &Pkg)
1559 {
1560 /* Not source/not automatic versions cannot be a candidate version
1561 unless they are already installed */
1562 VerIterator Last(*(pkgCache *)this,0);
1563
1564 for (VerIterator I = Pkg.VersionList(); I.end() == false; ++I)
1565 {
1566 if (Pkg.CurrentVer() == I)
1567 return I;
1568
1569 for (VerFileIterator J = I.FileList(); J.end() == false; ++J)
1570 {
1571 if ((J.File()->Flags & Flag::NotSource) != 0)
1572 continue;
1573
1574 /* Stash the highest version of a not-automatic source, we use it
1575 if there is nothing better */
1576 if ((J.File()->Flags & Flag::NotAutomatic) != 0 ||
1577 (J.File()->Flags & Flag::ButAutomaticUpgrades) != 0)
1578 {
1579 if (Last.end() == true)
1580 Last = I;
1581 continue;
1582 }
1583
1584 return I;
1585 }
1586 }
1587
1588 return Last;
1589 }
1590 /*}}}*/
1591 // Policy::IsImportantDep - True if the dependency is important /*{{{*/
1592 // ---------------------------------------------------------------------
1593 /* */
1594 bool pkgDepCache::Policy::IsImportantDep(DepIterator const &Dep)
1595 {
1596 if(Dep.IsCritical())
1597 return true;
1598 else if(Dep->Type == pkgCache::Dep::Recommends)
1599 {
1600 if (InstallRecommends)
1601 return true;
1602 // we suport a special mode to only install-recommends for certain
1603 // sections
1604 // FIXME: this is a meant as a temporarly solution until the
1605 // recommends are cleaned up
1606 const char *sec = Dep.ParentVer().Section();
1607 if (sec && ConfigValueInSubTree("APT::Install-Recommends-Sections", sec))
1608 return true;
1609 }
1610 else if(Dep->Type == pkgCache::Dep::Suggests)
1611 return InstallSuggests;
1612
1613 return false;
1614 }
1615 /*}}}*/
1616 // Policy::GetPriority - Get the priority of the package pin /*{{{*/
1617 signed short pkgDepCache::Policy::GetPriority(pkgCache::PkgIterator const &Pkg)
1618 { return 0; };
1619 signed short pkgDepCache::Policy::GetPriority(pkgCache::PkgFileIterator const &File)
1620 { return 0; };
1621 /*}}}*/
1622 pkgDepCache::InRootSetFunc *pkgDepCache::GetRootSetFunc() /*{{{*/
1623 {
1624 DefaultRootSetFunc *f = new DefaultRootSetFunc;
1625 if(f->wasConstructedSuccessfully())
1626 return f;
1627 else
1628 {
1629 delete f;
1630 return NULL;
1631 }
1632 }
1633 /*}}}*/
1634 bool pkgDepCache::MarkFollowsRecommends()
1635 {
1636 return _config->FindB("APT::AutoRemove::RecommendsImportant", true);
1637 }
1638
1639 bool pkgDepCache::MarkFollowsSuggests()
1640 {
1641 return _config->FindB("APT::AutoRemove::SuggestsImportant", true);
1642 }
1643
1644 // pkgDepCache::MarkRequired - the main mark algorithm /*{{{*/
1645 bool pkgDepCache::MarkRequired(InRootSetFunc &userFunc)
1646 {
1647 if (_config->Find("APT::Solver", "internal") != "internal")
1648 return true;
1649
1650 bool follow_recommends;
1651 bool follow_suggests;
1652 bool debug_autoremove = _config->FindB("Debug::pkgAutoRemove",false);
1653
1654 // init the states
1655 for(PkgIterator p = PkgBegin(); !p.end(); ++p)
1656 {
1657 PkgState[p->ID].Marked = false;
1658 PkgState[p->ID].Garbage = false;
1659
1660 // debug output
1661 if(debug_autoremove && PkgState[p->ID].Flags & Flag::Auto)
1662 std::clog << "AutoDep: " << p.FullName() << std::endl;
1663 }
1664
1665 // init vars
1666 follow_recommends = MarkFollowsRecommends();
1667 follow_suggests = MarkFollowsSuggests();
1668
1669
1670
1671 // do the mark part, this is the core bit of the algorithm
1672 for(PkgIterator p = PkgBegin(); !p.end(); ++p)
1673 {
1674 if(!(PkgState[p->ID].Flags & Flag::Auto) ||
1675 (p->Flags & Flag::Essential) ||
1676 (p->Flags & Flag::Important) ||
1677 userFunc.InRootSet(p) ||
1678 // be nice even then a required package violates the policy (#583517)
1679 // and do the full mark process also for required packages
1680 (p.CurrentVer().end() != true &&
1681 p.CurrentVer()->Priority == pkgCache::State::Required))
1682 {
1683 // the package is installed (and set to keep)
1684 if(PkgState[p->ID].Keep() && !p.CurrentVer().end())
1685 MarkPackage(p, p.CurrentVer(),
1686 follow_recommends, follow_suggests);
1687 // the package is to be installed
1688 else if(PkgState[p->ID].Install())
1689 MarkPackage(p, PkgState[p->ID].InstVerIter(*this),
1690 follow_recommends, follow_suggests);
1691 }
1692 }
1693
1694 return true;
1695 }
1696 /*}}}*/
1697 // MarkPackage - mark a single package in Mark-and-Sweep /*{{{*/
1698 void pkgDepCache::MarkPackage(const pkgCache::PkgIterator &pkg,
1699 const pkgCache::VerIterator &ver,
1700 bool const &follow_recommends,
1701 bool const &follow_suggests)
1702 {
1703 pkgDepCache::StateCache &state = PkgState[pkg->ID];
1704
1705 // if we are marked already we are done
1706 if(state.Marked)
1707 return;
1708
1709 VerIterator const currver = pkg.CurrentVer();
1710 VerIterator const instver = state.InstVerIter(*this);
1711
1712 #if 0
1713 VerIterator const candver = state.CandidateVerIter(*this);
1714
1715 // If a package was garbage-collected but is now being marked, we
1716 // should re-select it
1717 // For cases when a pkg is set to upgrade and this trigger the
1718 // removal of a no-longer used dependency. if the pkg is set to
1719 // keep again later it will result in broken deps
1720 if(state.Delete() && state.RemoveReason = Unused)
1721 {
1722 if(ver==candver)
1723 mark_install(pkg, false, false, NULL);
1724 else if(ver==pkg.CurrentVer())
1725 MarkKeep(pkg, false, false);
1726
1727 instver=state.InstVerIter(*this);
1728 }
1729 #endif
1730
1731 // For packages that are not going to be removed, ignore versions
1732 // other than the InstVer. For packages that are going to be
1733 // removed, ignore versions other than the current version.
1734 if(!(ver == instver && !instver.end()) &&
1735 !(ver == currver && instver.end() && !ver.end()))
1736 return;
1737
1738 bool const debug_autoremove = _config->FindB("Debug::pkgAutoRemove", false);
1739
1740 if(debug_autoremove)
1741 {
1742 std::clog << "Marking: " << pkg.FullName();
1743 if(!ver.end())
1744 std::clog << " " << ver.VerStr();
1745 if(!currver.end())
1746 std::clog << ", Curr=" << currver.VerStr();
1747 if(!instver.end())
1748 std::clog << ", Inst=" << instver.VerStr();
1749 std::clog << std::endl;
1750 }
1751
1752 state.Marked=true;
1753
1754 if(ver.end() == true)
1755 return;
1756
1757 for(DepIterator d = ver.DependsList(); !d.end(); ++d)
1758 {
1759 if(d->Type == Dep::Depends ||
1760 d->Type == Dep::PreDepends ||
1761 (follow_recommends &&
1762 d->Type == Dep::Recommends) ||
1763 (follow_suggests &&
1764 d->Type == Dep::Suggests))
1765 {
1766 // Try all versions of this package.
1767 for(VerIterator V = d.TargetPkg().VersionList();
1768 !V.end(); ++V)
1769 {
1770 if(d.IsSatisfied(V))
1771 {
1772 if(debug_autoremove)
1773 {
1774 std::clog << "Following dep: " << d.ParentPkg().FullName()
1775 << " " << d.ParentVer().VerStr() << " "
1776 << d.DepType() << " " << d.TargetPkg().FullName();
1777 if((d->CompareOp & ~pkgCache::Dep::Or) != pkgCache::Dep::NoOp)
1778 {
1779 std::clog << " (" << d.CompType() << " "
1780 << d.TargetVer() << ")";
1781 }
1782 std::clog << std::endl;
1783 }
1784 MarkPackage(V.ParentPkg(), V,
1785 follow_recommends, follow_suggests);
1786 }
1787 }
1788 // Now try virtual packages
1789 for(PrvIterator prv=d.TargetPkg().ProvidesList();
1790 !prv.end(); ++prv)
1791 {
1792 if(d.IsSatisfied(prv))
1793 {
1794 if(debug_autoremove)
1795 {
1796 std::clog << "Following dep: " << d.ParentPkg().FullName() << " "
1797 << d.ParentVer().VerStr() << " "
1798 << d.DepType() << " " << d.TargetPkg().FullName() << " ";
1799 if((d->CompareOp & ~pkgCache::Dep::Or) != pkgCache::Dep::NoOp)
1800 {
1801 std::clog << " (" << d.CompType() << " "
1802 << d.TargetVer() << ")";
1803 }
1804 std::clog << ", provided by "
1805 << prv.OwnerPkg().FullName() << " "
1806 << prv.OwnerVer().VerStr()
1807 << std::endl;
1808 }
1809
1810 MarkPackage(prv.OwnerPkg(), prv.OwnerVer(),
1811 follow_recommends, follow_suggests);
1812 }
1813 }
1814 }
1815 }
1816 }
1817 /*}}}*/
1818 bool pkgDepCache::Sweep() /*{{{*/
1819 {
1820 bool debug_autoremove = _config->FindB("Debug::pkgAutoRemove",false);
1821
1822 // do the sweep
1823 for(PkgIterator p=PkgBegin(); !p.end(); ++p)
1824 {
1825 StateCache &state=PkgState[p->ID];
1826
1827 // skip required packages
1828 if (!p.CurrentVer().end() &&
1829 (p.CurrentVer()->Priority == pkgCache::State::Required))
1830 continue;
1831
1832 // if it is not marked and it is installed, it's garbage
1833 if(!state.Marked && (!p.CurrentVer().end() || state.Install()))
1834 {
1835 state.Garbage=true;
1836 if(debug_autoremove)
1837 std::clog << "Garbage: " << p.FullName() << std::endl;
1838 }
1839 }
1840
1841 return true;
1842 }
1843 /*}}}*/