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