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