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