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