]> git.saurik.com Git - apt.git/blob - apt-pkg/depcache.cc
proof-of-concept for fixing debian #731102
[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 return IsDeleteOkProtectInstallRequests(Pkg, rPurge, Depth, FromUser);
869 }
870 bool pkgDepCache::IsDeleteOkProtectInstallRequests(PkgIterator const &Pkg,
871 bool const rPurge, unsigned long const Depth, bool const FromUser)
872 {
873 if (FromUser == false && Pkg->CurrentVer == 0)
874 {
875 StateCache &P = PkgState[Pkg->ID];
876 if (P.InstallVer != 0 && P.Status == 2 && (P.Flags & Flag::Auto) != Flag::Auto)
877 {
878 if (DebugMarker == true)
879 std::clog << OutputInDepth(Depth) << "Manual install request prevents MarkDelete of " << Pkg << std::endl;
880 return false;
881 }
882 }
883 return true;
884 }
885 /*}}}*/
886 // DepCache::IsModeChangeOk - check if it is ok to change the mode /*{{{*/
887 // ---------------------------------------------------------------------
888 /* this is used by all Mark methods on the very first line to check sanity
889 and prevents mode changes for packages on hold for example.
890 If you want to check Mode specific stuff you can use the virtual public
891 Is<Mode>Ok methods instead */
892 char const* PrintMode(char const mode)
893 {
894 switch (mode)
895 {
896 case pkgDepCache::ModeInstall: return "Install";
897 case pkgDepCache::ModeKeep: return "Keep";
898 case pkgDepCache::ModeDelete: return "Delete";
899 case pkgDepCache::ModeGarbage: return "Garbage";
900 default: return "UNKNOWN";
901 }
902 }
903 bool pkgDepCache::IsModeChangeOk(ModeList const mode, PkgIterator const &Pkg,
904 unsigned long const Depth, bool const FromUser)
905 {
906 // we are not trying to hard…
907 if (unlikely(Depth > 100))
908 return false;
909
910 // general sanity
911 if (unlikely(Pkg.end() == true || Pkg->VersionList == 0))
912 return false;
913
914 // the user is always right
915 if (FromUser == true)
916 return true;
917
918 StateCache &P = PkgState[Pkg->ID];
919 // not changing the mode is obviously also fine as we might want to call
920 // e.g. MarkInstall multiple times with different arguments for the same package
921 if (P.Mode == mode)
922 return true;
923
924 // if previous state was set by user only user can reset it
925 if ((P.iFlags & Protected) == Protected)
926 {
927 if (unlikely(DebugMarker == true))
928 std::clog << OutputInDepth(Depth) << "Ignore Mark" << PrintMode(mode)
929 << " of " << Pkg << " as its mode (" << PrintMode(P.Mode)
930 << ") is protected" << std::endl;
931 return false;
932 }
933 // enforce dpkg holds
934 else if (mode != ModeKeep && Pkg->SelectedState == pkgCache::State::Hold &&
935 _config->FindB("APT::Ignore-Hold",false) == false)
936 {
937 if (unlikely(DebugMarker == true))
938 std::clog << OutputInDepth(Depth) << "Hold prevents Mark" << PrintMode(mode)
939 << " of " << Pkg << std::endl;
940 return false;
941 }
942
943 return true;
944 }
945 /*}}}*/
946 // DepCache::MarkInstall - Put the package in the install state /*{{{*/
947 // ---------------------------------------------------------------------
948 /* */
949 struct CompareProviders {
950 pkgCache::PkgIterator const Pkg;
951 CompareProviders(pkgCache::DepIterator const &Dep) : Pkg(Dep.TargetPkg()) {};
952 //bool operator() (APT::VersionList::iterator const &AV, APT::VersionList::iterator const &BV)
953 bool operator() (pkgCache::VerIterator const &AV, pkgCache::VerIterator const &BV)
954 {
955 pkgCache::PkgIterator const A = AV.ParentPkg();
956 pkgCache::PkgIterator const B = BV.ParentPkg();
957 // Prefer MA:same packages if other architectures for it are installed
958 if ((AV->MultiArch & pkgCache::Version::Same) == pkgCache::Version::Same ||
959 (BV->MultiArch & pkgCache::Version::Same) == pkgCache::Version::Same)
960 {
961 bool instA = false;
962 if ((AV->MultiArch & pkgCache::Version::Same) == pkgCache::Version::Same)
963 {
964 pkgCache::GrpIterator Grp = A.Group();
965 for (pkgCache::PkgIterator P = Grp.PackageList(); P.end() == false; P = Grp.NextPkg(P))
966 if (P->CurrentVer != 0)
967 {
968 instA = true;
969 break;
970 }
971 }
972 bool instB = false;
973 if ((BV->MultiArch & pkgCache::Version::Same) == pkgCache::Version::Same)
974 {
975 pkgCache::GrpIterator Grp = B.Group();
976 for (pkgCache::PkgIterator P = Grp.PackageList(); P.end() == false; P = Grp.NextPkg(P))
977 {
978 if (P->CurrentVer != 0)
979 {
980 instB = true;
981 break;
982 }
983 }
984 }
985 if (instA != instB)
986 return instA == false;
987 }
988 // Prefer packages in the same group as the target; e.g. foo:i386, foo:amd64
989 if (A->Group != B->Group)
990 {
991 if (A->Group == Pkg->Group && B->Group != Pkg->Group)
992 return false;
993 else if (B->Group == Pkg->Group && A->Group != Pkg->Group)
994 return true;
995 }
996 // we like essentials
997 if ((A->Flags & pkgCache::Flag::Essential) != (B->Flags & pkgCache::Flag::Essential))
998 {
999 if ((A->Flags & pkgCache::Flag::Essential) == pkgCache::Flag::Essential)
1000 return false;
1001 else if ((B->Flags & pkgCache::Flag::Essential) == pkgCache::Flag::Essential)
1002 return true;
1003 }
1004 if ((A->Flags & pkgCache::Flag::Important) != (B->Flags & pkgCache::Flag::Important))
1005 {
1006 if ((A->Flags & pkgCache::Flag::Important) == pkgCache::Flag::Important)
1007 return false;
1008 else if ((B->Flags & pkgCache::Flag::Important) == pkgCache::Flag::Important)
1009 return true;
1010 }
1011 // prefer native architecture
1012 if (strcmp(A.Arch(), B.Arch()) != 0)
1013 {
1014 if (strcmp(A.Arch(), A.Cache()->NativeArch()) == 0)
1015 return false;
1016 else if (strcmp(B.Arch(), B.Cache()->NativeArch()) == 0)
1017 return true;
1018 std::vector<std::string> archs = APT::Configuration::getArchitectures();
1019 for (std::vector<std::string>::const_iterator a = archs.begin(); a != archs.end(); ++a)
1020 if (*a == A.Arch())
1021 return false;
1022 else if (*a == B.Arch())
1023 return true;
1024 }
1025 // higher priority seems like a good idea
1026 if (AV->Priority != BV->Priority)
1027 return AV->Priority > BV->Priority;
1028 // unable to decide…
1029 return A->ID < B->ID;
1030 }
1031 };
1032 bool pkgDepCache::MarkInstall(PkgIterator const &Pkg,bool AutoInst,
1033 unsigned long Depth, bool FromUser,
1034 bool ForceImportantDeps)
1035 {
1036 if (IsModeChangeOk(ModeInstall, Pkg, Depth, FromUser) == false)
1037 return false;
1038
1039 StateCache &P = PkgState[Pkg->ID];
1040
1041 // See if there is even any possible instalation candidate
1042 if (P.CandidateVer == 0)
1043 return false;
1044
1045 /* Check that it is not already marked for install and that it can be
1046 installed */
1047 if ((P.InstPolicyBroken() == false && P.InstBroken() == false) &&
1048 (P.Mode == ModeInstall ||
1049 P.CandidateVer == (Version *)Pkg.CurrentVer()))
1050 {
1051 if (P.CandidateVer == (Version *)Pkg.CurrentVer() && P.InstallVer == 0)
1052 return MarkKeep(Pkg, false, FromUser, Depth+1);
1053 return true;
1054 }
1055
1056 // check if we are allowed to install the package (if we haven't already)
1057 if (P.Mode != ModeInstall || P.InstallVer != P.CandidateVer)
1058 if (IsInstallOk(Pkg,AutoInst,Depth,FromUser) == false)
1059 return false;
1060
1061 ActionGroup group(*this);
1062 P.iFlags &= ~AutoKept;
1063
1064 /* Target the candidate version and remove the autoflag. We reset the
1065 autoflag below if this was called recursively. Otherwise the user
1066 should have the ability to de-auto a package by changing its state */
1067 RemoveSizes(Pkg);
1068 RemoveStates(Pkg);
1069
1070 P.Mode = ModeInstall;
1071 P.InstallVer = P.CandidateVer;
1072
1073 if(FromUser)
1074 {
1075 // Set it to manual if it's a new install or already installed,
1076 // but only if its not marked by the autoremover (aptitude depend on this behavior)
1077 // or if we do automatic installation (aptitude never does it)
1078 if(P.Status == 2 || (Pkg->CurrentVer != 0 && (AutoInst == true || P.Marked == false)))
1079 P.Flags &= ~Flag::Auto;
1080 }
1081 else
1082 {
1083 // Set it to auto if this is a new install.
1084 if(P.Status == 2)
1085 P.Flags |= Flag::Auto;
1086 }
1087 if (P.CandidateVer == (Version *)Pkg.CurrentVer())
1088 P.Mode = ModeKeep;
1089
1090 AddStates(Pkg);
1091 Update(Pkg);
1092 AddSizes(Pkg);
1093
1094 if (AutoInst == false || _config->Find("APT::Solver", "internal") != "internal")
1095 return true;
1096
1097 if (DebugMarker == true)
1098 std::clog << OutputInDepth(Depth) << "MarkInstall " << Pkg << " FU=" << FromUser << std::endl;
1099
1100 DepIterator Dep = P.InstVerIter(*this).DependsList();
1101 for (; Dep.end() != true;)
1102 {
1103 // Grok or groups
1104 DepIterator Start = Dep;
1105 bool Result = true;
1106 unsigned Ors = 0;
1107 for (bool LastOR = true; Dep.end() == false && LastOR == true; ++Dep, ++Ors)
1108 {
1109 LastOR = (Dep->CompareOp & Dep::Or) == Dep::Or;
1110
1111 if ((DepState[Dep->ID] & DepInstall) == DepInstall)
1112 Result = false;
1113 }
1114
1115 // Dep is satisfied okay.
1116 if (Result == false)
1117 continue;
1118
1119 /* Check if this dep should be consider for install. If it is a user
1120 defined important dep and we are installed a new package then
1121 it will be installed. Otherwise we only check for important
1122 deps that have changed from the installed version
1123 */
1124 if (IsImportantDep(Start) == false)
1125 continue;
1126
1127 /* If we are in an or group locate the first or that can
1128 succeed. We have already cached this.. */
1129 for (; Ors > 1 && (DepState[Start->ID] & DepCVer) != DepCVer; --Ors)
1130 ++Start;
1131 if (Ors == 1 && (DepState[Start->ID] &DepCVer) != DepCVer && Start.IsNegative() == false)
1132 {
1133 if(DebugAutoInstall == true)
1134 std::clog << OutputInDepth(Depth) << Start << " can't be satisfied!" << std::endl;
1135 if (Start.IsCritical() == false)
1136 continue;
1137 // if the dependency was critical, we can't install it, so remove it again
1138 MarkDelete(Pkg,false,Depth + 1, false);
1139 return false;
1140 }
1141
1142 /* Check if any ImportantDep() (but not Critical) were added
1143 * since we installed the package. Also check for deps that
1144 * were satisfied in the past: for instance, if a version
1145 * restriction in a Recommends was tightened, upgrading the
1146 * package should follow that Recommends rather than causing the
1147 * dependency to be removed. (bug #470115)
1148 */
1149 if (Pkg->CurrentVer != 0 && ForceImportantDeps == false && Start.IsCritical() == false)
1150 {
1151 bool isNewImportantDep = true;
1152 bool isPreviouslySatisfiedImportantDep = false;
1153 for (DepIterator D = Pkg.CurrentVer().DependsList(); D.end() != true; ++D)
1154 {
1155 //FIXME: Should we handle or-group better here?
1156 // We do not check if the package we look for is part of the same or-group
1157 // we might find while searching, but could that really be a problem?
1158 if (D.IsCritical() == true || IsImportantDep(D) == false ||
1159 Start.TargetPkg() != D.TargetPkg())
1160 continue;
1161
1162 isNewImportantDep = false;
1163
1164 while ((D->CompareOp & Dep::Or) != 0)
1165 ++D;
1166
1167 isPreviouslySatisfiedImportantDep = (((*this)[D] & DepGNow) != 0);
1168 if (isPreviouslySatisfiedImportantDep == true)
1169 break;
1170 }
1171
1172 if(isNewImportantDep == true)
1173 {
1174 if (DebugAutoInstall == true)
1175 std::clog << OutputInDepth(Depth) << "new important dependency: "
1176 << Start.TargetPkg().FullName() << std::endl;
1177 }
1178 else if(isPreviouslySatisfiedImportantDep == true)
1179 {
1180 if (DebugAutoInstall == true)
1181 std::clog << OutputInDepth(Depth) << "previously satisfied important dependency on "
1182 << Start.TargetPkg().FullName() << std::endl;
1183 }
1184 else
1185 {
1186 if (DebugAutoInstall == true)
1187 std::clog << OutputInDepth(Depth) << "ignore old unsatisfied important dependency on "
1188 << Start.TargetPkg().FullName() << std::endl;
1189 continue;
1190 }
1191 }
1192
1193 /* This bit is for processing the possibilty of an install/upgrade
1194 fixing the problem for "positive" dependencies */
1195 if (Start.IsNegative() == false && (DepState[Start->ID] & DepCVer) == DepCVer)
1196 {
1197 APT::VersionList verlist;
1198 pkgCache::VerIterator Cand = PkgState[Start.TargetPkg()->ID].CandidateVerIter(*this);
1199 if (Cand.end() == false && Start.IsSatisfied(Cand) == true)
1200 verlist.insert(Cand);
1201 for (PrvIterator Prv = Start.TargetPkg().ProvidesList(); Prv.end() != true; ++Prv)
1202 {
1203 pkgCache::VerIterator V = Prv.OwnerVer();
1204 pkgCache::VerIterator Cand = PkgState[Prv.OwnerPkg()->ID].CandidateVerIter(*this);
1205 if (Cand.end() == true || V != Cand || Start.IsSatisfied(Prv) == false)
1206 continue;
1207 verlist.insert(Cand);
1208 }
1209 CompareProviders comp(Start);
1210
1211 do {
1212 APT::VersionList::iterator InstVer = std::max_element(verlist.begin(), verlist.end(), comp);
1213
1214 if (InstVer == verlist.end())
1215 break;
1216
1217 pkgCache::PkgIterator InstPkg = InstVer.ParentPkg();
1218 if(DebugAutoInstall == true)
1219 std::clog << OutputInDepth(Depth) << "Installing " << InstPkg.Name()
1220 << " as " << Start.DepType() << " of " << Pkg.Name()
1221 << std::endl;
1222 if (MarkInstall(InstPkg, true, Depth + 1, false, ForceImportantDeps) == false)
1223 {
1224 verlist.erase(InstVer);
1225 continue;
1226 }
1227 // now check if we should consider it a automatic dependency or not
1228 if(InstPkg->CurrentVer == 0 && Pkg->Section != 0 && ConfigValueInSubTree("APT::Never-MarkAuto-Sections", Pkg.Section()))
1229 {
1230 if(DebugAutoInstall == true)
1231 std::clog << OutputInDepth(Depth) << "Setting NOT as auto-installed (direct "
1232 << Start.DepType() << " of pkg in APT::Never-MarkAuto-Sections)" << std::endl;
1233 MarkAuto(InstPkg, false);
1234 }
1235 break;
1236 } while(true);
1237 continue;
1238 }
1239 /* Negative dependencies have no or-group
1240 If the dependency isn't versioned, we try if an upgrade might solve the problem.
1241 Otherwise we remove the offender if needed */
1242 else if (Start.IsNegative() == true && Start->Type != pkgCache::Dep::Obsoletes)
1243 {
1244 SPtrArray<Version *> List = Start.AllTargets();
1245 pkgCache::PkgIterator TrgPkg = Start.TargetPkg();
1246 for (Version **I = List; *I != 0; I++)
1247 {
1248 VerIterator Ver(*this,*I);
1249 PkgIterator Pkg = Ver.ParentPkg();
1250
1251 /* The List includes all packages providing this dependency,
1252 even providers which are not installed, so skip them. */
1253 if (PkgState[Pkg->ID].InstallVer == 0)
1254 continue;
1255
1256 if ((Start->Version != 0 || TrgPkg != Pkg) &&
1257 PkgState[Pkg->ID].CandidateVer != PkgState[Pkg->ID].InstallVer &&
1258 PkgState[Pkg->ID].CandidateVer != *I &&
1259 MarkInstall(Pkg,true,Depth + 1, false, ForceImportantDeps) == true)
1260 continue;
1261 else if (Start->Type == pkgCache::Dep::Conflicts ||
1262 Start->Type == pkgCache::Dep::DpkgBreaks)
1263 {
1264 if(DebugAutoInstall == true)
1265 std::clog << OutputInDepth(Depth)
1266 << " Removing: " << Pkg.Name()
1267 << std::endl;
1268 if (MarkDelete(Pkg,false,Depth + 1, false) == false)
1269 break;
1270 }
1271 }
1272 continue;
1273 }
1274 }
1275
1276 return Dep.end() == true;
1277 }
1278 /*}}}*/
1279 // DepCache::IsInstallOk - check if it is ok to install this package /*{{{*/
1280 // ---------------------------------------------------------------------
1281 /* The default implementation checks if the installation of an M-A:same
1282 package would lead us into a version-screw and if so forbids it.
1283 dpkg holds are enforced by the private IsModeChangeOk */
1284 bool pkgDepCache::IsInstallOk(PkgIterator const &Pkg,bool AutoInst,
1285 unsigned long Depth, bool FromUser)
1286 {
1287 return IsInstallOkMultiArchSameVersionSynced(Pkg,AutoInst, Depth, FromUser);
1288 }
1289 bool pkgDepCache::IsInstallOkMultiArchSameVersionSynced(PkgIterator const &Pkg,
1290 bool const AutoInst, unsigned long const Depth, bool const FromUser)
1291 {
1292 if (FromUser == true) // as always: user is always right
1293 return true;
1294
1295 // ignore packages with none-M-A:same candidates
1296 VerIterator const CandVer = PkgState[Pkg->ID].CandidateVerIter(*this);
1297 if (unlikely(CandVer.end() == true) || CandVer == Pkg.CurrentVer() ||
1298 (CandVer->MultiArch & pkgCache::Version::Same) != pkgCache::Version::Same)
1299 return true;
1300
1301 GrpIterator const Grp = Pkg.Group();
1302 for (PkgIterator P = Grp.PackageList(); P.end() == false; P = Grp.NextPkg(P))
1303 {
1304 // not installed or version synced: fine by definition
1305 // (simple string-compare as stuff like '1' == '0:1-0' can't happen here)
1306 if (P->CurrentVer == 0 || strcmp(Pkg.CandVersion(), P.CandVersion()) == 0)
1307 continue;
1308 // packages loosing M-A:same can be out-of-sync
1309 VerIterator CV = PkgState[P->ID].CandidateVerIter(*this);
1310 if (unlikely(CV.end() == true) ||
1311 (CV->MultiArch & pkgCache::Version::Same) != pkgCache::Version::Same)
1312 continue;
1313
1314 // not downloadable means the package is obsolete, so allow out-of-sync
1315 if (CV.Downloadable() == false)
1316 continue;
1317
1318 PkgState[Pkg->ID].iFlags |= AutoKept;
1319 if (unlikely(DebugMarker == true))
1320 std::clog << OutputInDepth(Depth) << "Ignore MarkInstall of " << Pkg
1321 << " as its M-A:same siblings are not version-synced" << std::endl;
1322 return false;
1323 }
1324
1325 return true;
1326 }
1327 /*}}}*/
1328 // DepCache::SetReInstall - Set the reinstallation flag /*{{{*/
1329 // ---------------------------------------------------------------------
1330 /* */
1331 void pkgDepCache::SetReInstall(PkgIterator const &Pkg,bool To)
1332 {
1333 if (unlikely(Pkg.end() == true))
1334 return;
1335
1336 APT::PackageList pkglist;
1337 if (Pkg->CurrentVer != 0 &&
1338 (Pkg.CurrentVer()-> MultiArch & pkgCache::Version::Same) == pkgCache::Version::Same)
1339 {
1340 pkgCache::GrpIterator Grp = Pkg.Group();
1341 for (pkgCache::PkgIterator P = Grp.PackageList(); P.end() == false; P = Grp.NextPkg(P))
1342 {
1343 if (P->CurrentVer != 0)
1344 pkglist.insert(P);
1345 }
1346 }
1347 else
1348 pkglist.insert(Pkg);
1349
1350 ActionGroup group(*this);
1351
1352 for (APT::PackageList::const_iterator Pkg = pkglist.begin(); Pkg != pkglist.end(); ++Pkg)
1353 {
1354 RemoveSizes(Pkg);
1355 RemoveStates(Pkg);
1356
1357 StateCache &P = PkgState[Pkg->ID];
1358 if (To == true)
1359 P.iFlags |= ReInstall;
1360 else
1361 P.iFlags &= ~ReInstall;
1362
1363 AddStates(Pkg);
1364 AddSizes(Pkg);
1365 }
1366 }
1367 /*}}}*/
1368 // DepCache::SetCandidateVersion - Change the candidate version /*{{{*/
1369 // ---------------------------------------------------------------------
1370 /* */
1371 void pkgDepCache::SetCandidateVersion(VerIterator TargetVer)
1372 {
1373 pkgCache::PkgIterator Pkg = TargetVer.ParentPkg();
1374 StateCache &P = PkgState[Pkg->ID];
1375
1376 if (P.CandidateVer == TargetVer)
1377 return;
1378
1379 ActionGroup group(*this);
1380
1381 RemoveSizes(Pkg);
1382 RemoveStates(Pkg);
1383
1384 if (P.CandidateVer == P.InstallVer && P.Install() == true)
1385 P.InstallVer = (Version *)TargetVer;
1386 P.CandidateVer = (Version *)TargetVer;
1387 P.Update(Pkg,*this);
1388
1389 AddStates(Pkg);
1390 Update(Pkg);
1391 AddSizes(Pkg);
1392
1393 }
1394 /*}}}*/
1395 // DepCache::SetCandidateRelease - Change the candidate version /*{{{*/
1396 // ---------------------------------------------------------------------
1397 /* changes the candidate of a package and walks over all its dependencies
1398 to check if it needs to change the candidate of the dependency, too,
1399 to reach a installable versionstate */
1400 bool pkgDepCache::SetCandidateRelease(pkgCache::VerIterator TargetVer,
1401 std::string const &TargetRel)
1402 {
1403 std::list<std::pair<pkgCache::VerIterator, pkgCache::VerIterator> > Changed;
1404 return SetCandidateRelease(TargetVer, TargetRel, Changed);
1405 }
1406 bool pkgDepCache::SetCandidateRelease(pkgCache::VerIterator TargetVer,
1407 std::string const &TargetRel,
1408 std::list<std::pair<pkgCache::VerIterator, pkgCache::VerIterator> > &Changed)
1409 {
1410 ActionGroup group(*this);
1411 SetCandidateVersion(TargetVer);
1412
1413 if (TargetRel == "installed" || TargetRel == "candidate") // both doesn't make sense in this context
1414 return true;
1415
1416 pkgVersionMatch Match(TargetRel, pkgVersionMatch::Release);
1417 // save the position of the last element we will not undo - if we have to
1418 std::list<std::pair<pkgCache::VerIterator, pkgCache::VerIterator> >::iterator newChanged = --(Changed.end());
1419
1420 for (pkgCache::DepIterator D = TargetVer.DependsList(); D.end() == false; ++D)
1421 {
1422 if (D->Type != pkgCache::Dep::PreDepends && D->Type != pkgCache::Dep::Depends &&
1423 ((D->Type != pkgCache::Dep::Recommends && D->Type != pkgCache::Dep::Suggests) ||
1424 IsImportantDep(D) == false))
1425 continue;
1426
1427 // walk over an or-group and check if we need to do anything
1428 // for simpilicity no or-group is handled as a or-group including one dependency
1429 pkgCache::DepIterator Start = D;
1430 bool itsFine = false;
1431 for (bool stillOr = true; stillOr == true; ++Start)
1432 {
1433 stillOr = (Start->CompareOp & Dep::Or) == Dep::Or;
1434 pkgCache::PkgIterator const P = Start.TargetPkg();
1435 // virtual packages can't be a solution
1436 if (P.end() == true || (P->ProvidesList == 0 && P->VersionList == 0))
1437 continue;
1438 pkgCache::VerIterator const Cand = PkgState[P->ID].CandidateVerIter(*this);
1439 // no versioned dependency - but is it installable?
1440 if (Start.TargetVer() == 0 || Start.TargetVer()[0] == '\0')
1441 {
1442 // Check if one of the providers is installable
1443 if (P->ProvidesList != 0)
1444 {
1445 pkgCache::PrvIterator Prv = P.ProvidesList();
1446 for (; Prv.end() == false; ++Prv)
1447 {
1448 pkgCache::VerIterator const C = PkgState[Prv.OwnerPkg()->ID].CandidateVerIter(*this);
1449 if (C.end() == true || C != Prv.OwnerVer() ||
1450 (VersionState(C.DependsList(), DepInstall, DepCandMin, DepCandPolicy) & DepCandMin) != DepCandMin)
1451 continue;
1452 break;
1453 }
1454 if (Prv.end() == true)
1455 continue;
1456 }
1457 // no providers, so check if we have an installable candidate version
1458 else if (Cand.end() == true ||
1459 (VersionState(Cand.DependsList(), DepInstall, DepCandMin, DepCandPolicy) & DepCandMin) != DepCandMin)
1460 continue;
1461 itsFine = true;
1462 break;
1463 }
1464 if (Cand.end() == true)
1465 continue;
1466 // check if the current candidate is enough for the versioned dependency - and installable?
1467 if (Start.IsSatisfied(Cand) == true &&
1468 (VersionState(Cand.DependsList(), DepInstall, DepCandMin, DepCandPolicy) & DepCandMin) == DepCandMin)
1469 {
1470 itsFine = true;
1471 break;
1472 }
1473 }
1474
1475 if (itsFine == true) {
1476 // something in the or-group was fine, skip all other members
1477 for (; (D->CompareOp & Dep::Or) == Dep::Or; ++D);
1478 continue;
1479 }
1480
1481 // walk again over the or-group and check each if a candidate switch would help
1482 itsFine = false;
1483 for (bool stillOr = true; stillOr == true; ++D)
1484 {
1485 stillOr = (D->CompareOp & Dep::Or) == Dep::Or;
1486 // changing candidate will not help if the dependency is not versioned
1487 if (D.TargetVer() == 0 || D.TargetVer()[0] == '\0')
1488 {
1489 if (stillOr == true)
1490 continue;
1491 break;
1492 }
1493
1494 pkgCache::VerIterator V;
1495 if (TargetRel == "newest")
1496 V = D.TargetPkg().VersionList();
1497 else
1498 V = Match.Find(D.TargetPkg());
1499
1500 // check if the version from this release could satisfy the dependency
1501 if (V.end() == true || D.IsSatisfied(V) == false)
1502 {
1503 if (stillOr == true)
1504 continue;
1505 break;
1506 }
1507
1508 pkgCache::VerIterator oldCand = PkgState[D.TargetPkg()->ID].CandidateVerIter(*this);
1509 if (V == oldCand)
1510 {
1511 // Do we already touched this Version? If so, their versioned dependencies are okay, no need to check again
1512 for (std::list<std::pair<pkgCache::VerIterator, pkgCache::VerIterator> >::const_iterator c = Changed.begin();
1513 c != Changed.end(); ++c)
1514 {
1515 if (c->first->ParentPkg != V->ParentPkg)
1516 continue;
1517 itsFine = true;
1518 break;
1519 }
1520 }
1521
1522 if (itsFine == false)
1523 {
1524 // change the candidate
1525 Changed.push_back(make_pair(V, TargetVer));
1526 if (SetCandidateRelease(V, TargetRel, Changed) == false)
1527 {
1528 if (stillOr == false)
1529 break;
1530 // undo the candidate changing
1531 SetCandidateVersion(oldCand);
1532 Changed.pop_back();
1533 continue;
1534 }
1535 itsFine = true;
1536 }
1537
1538 // something in the or-group was fine, skip all other members
1539 for (; (D->CompareOp & Dep::Or) == Dep::Or; ++D);
1540 break;
1541 }
1542
1543 if (itsFine == false && (D->Type == pkgCache::Dep::PreDepends || D->Type == pkgCache::Dep::Depends))
1544 {
1545 // undo all changes which aren't lead to a solution
1546 for (std::list<std::pair<pkgCache::VerIterator, pkgCache::VerIterator> >::const_iterator c = ++newChanged;
1547 c != Changed.end(); ++c)
1548 SetCandidateVersion(c->first);
1549 Changed.erase(newChanged, Changed.end());
1550 return false;
1551 }
1552 }
1553 return true;
1554 }
1555 /*}}}*/
1556 // DepCache::MarkAuto - set the Auto flag for a package /*{{{*/
1557 // ---------------------------------------------------------------------
1558 /* */
1559 void pkgDepCache::MarkAuto(const PkgIterator &Pkg, bool Auto)
1560 {
1561 StateCache &state = PkgState[Pkg->ID];
1562
1563 ActionGroup group(*this);
1564
1565 if(Auto)
1566 state.Flags |= Flag::Auto;
1567 else
1568 state.Flags &= ~Flag::Auto;
1569 }
1570 /*}}}*/
1571 // StateCache::Update - Compute the various static display things /*{{{*/
1572 // ---------------------------------------------------------------------
1573 /* This is called whenever the Candidate version changes. */
1574 void pkgDepCache::StateCache::Update(PkgIterator Pkg,pkgCache &Cache)
1575 {
1576 // Some info
1577 VerIterator Ver = CandidateVerIter(Cache);
1578
1579 // Use a null string or the version string
1580 if (Ver.end() == true)
1581 CandVersion = "";
1582 else
1583 CandVersion = Ver.VerStr();
1584
1585 // Find the current version
1586 CurVersion = "";
1587 if (Pkg->CurrentVer != 0)
1588 CurVersion = Pkg.CurrentVer().VerStr();
1589
1590 // Strip off the epochs for display
1591 CurVersion = StripEpoch(CurVersion);
1592 CandVersion = StripEpoch(CandVersion);
1593
1594 // Figure out if its up or down or equal
1595 Status = Ver.CompareVer(Pkg.CurrentVer());
1596 if (Pkg->CurrentVer == 0 || Pkg->VersionList == 0 || CandidateVer == 0)
1597 Status = 2;
1598 }
1599 /*}}}*/
1600 // StateCache::StripEpoch - Remove the epoch specifier from the version /*{{{*/
1601 // ---------------------------------------------------------------------
1602 /* */
1603 const char *pkgDepCache::StateCache::StripEpoch(const char *Ver)
1604 {
1605 if (Ver == 0)
1606 return 0;
1607
1608 // Strip any epoch
1609 for (const char *I = Ver; *I != 0; I++)
1610 if (*I == ':')
1611 return I + 1;
1612 return Ver;
1613 }
1614 /*}}}*/
1615 // Policy::GetCandidateVer - Returns the Candidate install version /*{{{*/
1616 // ---------------------------------------------------------------------
1617 /* The default just returns the highest available version that is not
1618 a source and automatic. */
1619 pkgCache::VerIterator pkgDepCache::Policy::GetCandidateVer(PkgIterator const &Pkg)
1620 {
1621 /* Not source/not automatic versions cannot be a candidate version
1622 unless they are already installed */
1623 VerIterator Last(*(pkgCache *)this,0);
1624
1625 for (VerIterator I = Pkg.VersionList(); I.end() == false; ++I)
1626 {
1627 if (Pkg.CurrentVer() == I)
1628 return I;
1629
1630 for (VerFileIterator J = I.FileList(); J.end() == false; ++J)
1631 {
1632 if ((J.File()->Flags & Flag::NotSource) != 0)
1633 continue;
1634
1635 /* Stash the highest version of a not-automatic source, we use it
1636 if there is nothing better */
1637 if ((J.File()->Flags & Flag::NotAutomatic) != 0 ||
1638 (J.File()->Flags & Flag::ButAutomaticUpgrades) != 0)
1639 {
1640 if (Last.end() == true)
1641 Last = I;
1642 continue;
1643 }
1644
1645 return I;
1646 }
1647 }
1648
1649 return Last;
1650 }
1651 /*}}}*/
1652 // Policy::IsImportantDep - True if the dependency is important /*{{{*/
1653 // ---------------------------------------------------------------------
1654 /* */
1655 bool pkgDepCache::Policy::IsImportantDep(DepIterator const &Dep)
1656 {
1657 if(Dep.IsCritical())
1658 return true;
1659 else if(Dep->Type == pkgCache::Dep::Recommends)
1660 {
1661 if (InstallRecommends)
1662 return true;
1663 // we suport a special mode to only install-recommends for certain
1664 // sections
1665 // FIXME: this is a meant as a temporarly solution until the
1666 // recommends are cleaned up
1667 const char *sec = Dep.ParentVer().Section();
1668 if (sec && ConfigValueInSubTree("APT::Install-Recommends-Sections", sec))
1669 return true;
1670 }
1671 else if(Dep->Type == pkgCache::Dep::Suggests)
1672 return InstallSuggests;
1673
1674 return false;
1675 }
1676 /*}}}*/
1677 // Policy::GetPriority - Get the priority of the package pin /*{{{*/
1678 signed short pkgDepCache::Policy::GetPriority(pkgCache::PkgIterator const &Pkg)
1679 { return 0; };
1680 signed short pkgDepCache::Policy::GetPriority(pkgCache::PkgFileIterator const &File)
1681 { return 0; };
1682 /*}}}*/
1683 pkgDepCache::InRootSetFunc *pkgDepCache::GetRootSetFunc() /*{{{*/
1684 {
1685 DefaultRootSetFunc *f = new DefaultRootSetFunc;
1686 if(f->wasConstructedSuccessfully())
1687 return f;
1688 else
1689 {
1690 delete f;
1691 return NULL;
1692 }
1693 }
1694 /*}}}*/
1695 bool pkgDepCache::MarkFollowsRecommends()
1696 {
1697 return _config->FindB("APT::AutoRemove::RecommendsImportant", true);
1698 }
1699
1700 bool pkgDepCache::MarkFollowsSuggests()
1701 {
1702 return _config->FindB("APT::AutoRemove::SuggestsImportant", true);
1703 }
1704
1705 // pkgDepCache::MarkRequired - the main mark algorithm /*{{{*/
1706 bool pkgDepCache::MarkRequired(InRootSetFunc &userFunc)
1707 {
1708 if (_config->Find("APT::Solver", "internal") != "internal")
1709 return true;
1710
1711 bool follow_recommends;
1712 bool follow_suggests;
1713 bool debug_autoremove = _config->FindB("Debug::pkgAutoRemove",false);
1714
1715 // init the states
1716 for(PkgIterator p = PkgBegin(); !p.end(); ++p)
1717 {
1718 PkgState[p->ID].Marked = false;
1719 PkgState[p->ID].Garbage = false;
1720
1721 // debug output
1722 if(debug_autoremove && PkgState[p->ID].Flags & Flag::Auto)
1723 std::clog << "AutoDep: " << p.FullName() << std::endl;
1724 }
1725
1726 // init vars
1727 follow_recommends = MarkFollowsRecommends();
1728 follow_suggests = MarkFollowsSuggests();
1729
1730 // do the mark part, this is the core bit of the algorithm
1731 for(PkgIterator p = PkgBegin(); !p.end(); ++p)
1732 {
1733 if(!(PkgState[p->ID].Flags & Flag::Auto) ||
1734 (p->Flags & Flag::Essential) ||
1735 (p->Flags & Flag::Important) ||
1736 userFunc.InRootSet(p) ||
1737 // be nice even then a required package violates the policy (#583517)
1738 // and do the full mark process also for required packages
1739 (p.CurrentVer().end() != true &&
1740 p.CurrentVer()->Priority == pkgCache::State::Required) ||
1741 // packages which can't be changed (like holds) can't be garbage
1742 (IsModeChangeOk(ModeGarbage, p, 0, false) == false))
1743 {
1744 // the package is installed (and set to keep)
1745 if(PkgState[p->ID].Keep() && !p.CurrentVer().end())
1746 MarkPackage(p, p.CurrentVer(),
1747 follow_recommends, follow_suggests);
1748 // the package is to be installed
1749 else if(PkgState[p->ID].Install())
1750 MarkPackage(p, PkgState[p->ID].InstVerIter(*this),
1751 follow_recommends, follow_suggests);
1752 }
1753 }
1754
1755 return true;
1756 }
1757 /*}}}*/
1758 // MarkPackage - mark a single package in Mark-and-Sweep /*{{{*/
1759 void pkgDepCache::MarkPackage(const pkgCache::PkgIterator &pkg,
1760 const pkgCache::VerIterator &ver,
1761 bool const &follow_recommends,
1762 bool const &follow_suggests)
1763 {
1764 pkgDepCache::StateCache &state = PkgState[pkg->ID];
1765
1766 // if we are marked already we are done
1767 if(state.Marked)
1768 return;
1769
1770 VerIterator const currver = pkg.CurrentVer();
1771 VerIterator const instver = state.InstVerIter(*this);
1772
1773 #if 0
1774 VerIterator const candver = state.CandidateVerIter(*this);
1775
1776 // If a package was garbage-collected but is now being marked, we
1777 // should re-select it
1778 // For cases when a pkg is set to upgrade and this trigger the
1779 // removal of a no-longer used dependency. if the pkg is set to
1780 // keep again later it will result in broken deps
1781 if(state.Delete() && state.RemoveReason = Unused)
1782 {
1783 if(ver==candver)
1784 mark_install(pkg, false, false, NULL);
1785 else if(ver==pkg.CurrentVer())
1786 MarkKeep(pkg, false, false);
1787
1788 instver=state.InstVerIter(*this);
1789 }
1790 #endif
1791
1792 // For packages that are not going to be removed, ignore versions
1793 // other than the InstVer. For packages that are going to be
1794 // removed, ignore versions other than the current version.
1795 if(!(ver == instver && !instver.end()) &&
1796 !(ver == currver && instver.end() && !ver.end()))
1797 return;
1798
1799 bool const debug_autoremove = _config->FindB("Debug::pkgAutoRemove", false);
1800
1801 if(debug_autoremove)
1802 {
1803 std::clog << "Marking: " << pkg.FullName();
1804 if(!ver.end())
1805 std::clog << " " << ver.VerStr();
1806 if(!currver.end())
1807 std::clog << ", Curr=" << currver.VerStr();
1808 if(!instver.end())
1809 std::clog << ", Inst=" << instver.VerStr();
1810 std::clog << std::endl;
1811 }
1812
1813 state.Marked=true;
1814
1815 if(ver.end() == true)
1816 return;
1817
1818 for(DepIterator d = ver.DependsList(); !d.end(); ++d)
1819 {
1820 if(d->Type == Dep::Depends ||
1821 d->Type == Dep::PreDepends ||
1822 (follow_recommends &&
1823 d->Type == Dep::Recommends) ||
1824 (follow_suggests &&
1825 d->Type == Dep::Suggests))
1826 {
1827 // Try all versions of this package.
1828 for(VerIterator V = d.TargetPkg().VersionList();
1829 !V.end(); ++V)
1830 {
1831 if(d.IsSatisfied(V))
1832 {
1833 if(debug_autoremove)
1834 {
1835 std::clog << "Following dep: " << d.ParentPkg().FullName()
1836 << " " << d.ParentVer().VerStr() << " "
1837 << d.DepType() << " " << d.TargetPkg().FullName();
1838 if((d->CompareOp & ~pkgCache::Dep::Or) != pkgCache::Dep::NoOp)
1839 {
1840 std::clog << " (" << d.CompType() << " "
1841 << d.TargetVer() << ")";
1842 }
1843 std::clog << std::endl;
1844 }
1845 MarkPackage(V.ParentPkg(), V,
1846 follow_recommends, follow_suggests);
1847 }
1848 }
1849 // Now try virtual packages
1850 for(PrvIterator prv=d.TargetPkg().ProvidesList();
1851 !prv.end(); ++prv)
1852 {
1853 if(d.IsSatisfied(prv))
1854 {
1855 if(debug_autoremove)
1856 {
1857 std::clog << "Following dep: " << d.ParentPkg().FullName() << " "
1858 << d.ParentVer().VerStr() << " "
1859 << d.DepType() << " " << d.TargetPkg().FullName() << " ";
1860 if((d->CompareOp & ~pkgCache::Dep::Or) != pkgCache::Dep::NoOp)
1861 {
1862 std::clog << " (" << d.CompType() << " "
1863 << d.TargetVer() << ")";
1864 }
1865 std::clog << ", provided by "
1866 << prv.OwnerPkg().FullName() << " "
1867 << prv.OwnerVer().VerStr()
1868 << std::endl;
1869 }
1870
1871 MarkPackage(prv.OwnerPkg(), prv.OwnerVer(),
1872 follow_recommends, follow_suggests);
1873 }
1874 }
1875 }
1876 }
1877 }
1878 /*}}}*/
1879 bool pkgDepCache::Sweep() /*{{{*/
1880 {
1881 bool debug_autoremove = _config->FindB("Debug::pkgAutoRemove",false);
1882
1883 // do the sweep
1884 for(PkgIterator p=PkgBegin(); !p.end(); ++p)
1885 {
1886 StateCache &state=PkgState[p->ID];
1887
1888 // skip required packages
1889 if (!p.CurrentVer().end() &&
1890 (p.CurrentVer()->Priority == pkgCache::State::Required))
1891 continue;
1892
1893 // if it is not marked and it is installed, it's garbage
1894 if(!state.Marked && (!p.CurrentVer().end() || state.Install()))
1895 {
1896 state.Garbage=true;
1897 if(debug_autoremove)
1898 std::clog << "Garbage: " << p.FullName() << std::endl;
1899 }
1900 }
1901
1902 return true;
1903 }
1904 /*}}}*/