2739 lines
93 KiB
C++
2739 lines
93 KiB
C++
// -*- mode: cpp; mode: fold -*-
|
|
// Description /*{{{*/
|
|
/* ######################################################################
|
|
|
|
Dependency Cache - Caches Dependency information.
|
|
|
|
##################################################################### */
|
|
/*}}}*/
|
|
// Include Files /*{{{*/
|
|
#include <config.h>
|
|
|
|
#include <apt-pkg/algorithms.h>
|
|
#include <apt-pkg/aptconfiguration.h>
|
|
#include <apt-pkg/cachefile.h>
|
|
#include <apt-pkg/cachefilter.h>
|
|
#include <apt-pkg/cacheset.h>
|
|
#include <apt-pkg/configuration.h>
|
|
#include <apt-pkg/depcache.h>
|
|
#include <apt-pkg/error.h>
|
|
#include <apt-pkg/fileutl.h>
|
|
#include <apt-pkg/macros.h>
|
|
#include <apt-pkg/pkgcache.h>
|
|
#include <apt-pkg/prettyprinters.h>
|
|
#include <apt-pkg/progress.h>
|
|
#include <apt-pkg/strutl.h>
|
|
#include <apt-pkg/tagfile-keys.h>
|
|
#include <apt-pkg/tagfile.h>
|
|
#include <apt-pkg/version.h>
|
|
#include <apt-pkg/versionmatch.h>
|
|
|
|
#include <algorithm>
|
|
#include <cstdio>
|
|
#include <cstring>
|
|
#include <iostream>
|
|
#include <iterator>
|
|
#include <list>
|
|
#include <memory>
|
|
#include <random>
|
|
#include <set>
|
|
#include <sstream>
|
|
#include <string>
|
|
#include <unordered_map>
|
|
#include <utility>
|
|
#include <vector>
|
|
#include <dirent.h>
|
|
|
|
#include <sys/stat.h>
|
|
|
|
#include <apti18n.h>
|
|
/*}}}*/
|
|
|
|
using std::string;
|
|
|
|
// helper for kernel autoremoval /*{{{*/
|
|
|
|
/** \brief Returns \b true for packages matching a regular
|
|
* expression in APT::NeverAutoRemove.
|
|
*/
|
|
class DefaultRootSetFunc2 : public pkgDepCache::DefaultRootSetFunc
|
|
{
|
|
std::unique_ptr<APT::CacheFilter::Matcher> Kernels;
|
|
|
|
public:
|
|
DefaultRootSetFunc2(pkgCache *cache) : Kernels(APT::KernelAutoRemoveHelper::GetProtectedKernelsFilter(cache)){};
|
|
~DefaultRootSetFunc2() override = default;
|
|
|
|
bool InRootSet(const pkgCache::PkgIterator &pkg) override { return pkg.end() == false && ((*Kernels)(pkg) || DefaultRootSetFunc::InRootSet(pkg)); };
|
|
};
|
|
|
|
/*}}}*/
|
|
pkgDepCache::ActionGroup::ActionGroup(pkgDepCache &cache) : /*{{{*/
|
|
d(NULL), cache(cache), released(false)
|
|
{
|
|
cache.IncreaseActionGroupLevel();
|
|
}
|
|
|
|
void pkgDepCache::ActionGroup::release()
|
|
{
|
|
if(released)
|
|
return;
|
|
released = true;
|
|
if (cache.DecreaseActionGroupLevel() == 0)
|
|
cache.MarkAndSweep();
|
|
}
|
|
|
|
pkgDepCache::ActionGroup::~ActionGroup()
|
|
{
|
|
release();
|
|
}
|
|
int pkgDepCache::IncreaseActionGroupLevel()
|
|
{
|
|
return ++group_level;
|
|
}
|
|
int pkgDepCache::DecreaseActionGroupLevel()
|
|
{
|
|
if(group_level == 0)
|
|
{
|
|
std::cerr << "W: Unbalanced action groups, expect badness\n";
|
|
return -1;
|
|
}
|
|
return --group_level;
|
|
}
|
|
/*}}}*/
|
|
// DepCache::pkgDepCache - Constructors /*{{{*/
|
|
// ---------------------------------------------------------------------
|
|
/* */
|
|
|
|
struct pkgDepCache::Private
|
|
{
|
|
std::unique_ptr<InRootSetFunc> inRootSetFunc;
|
|
std::unique_ptr<APT::CacheFilter::Matcher> IsAVersionedKernelPackage, IsProtectedKernelPackage;
|
|
std::string machineID;
|
|
unsigned long iUpgradeCount{0};
|
|
};
|
|
pkgDepCache::pkgDepCache(pkgCache *const pCache, Policy *const Plcy) : group_level(0), Cache(pCache), PkgState(0), DepState(0),
|
|
iUsrSize(0), iDownloadSize(0), iInstCount(0), iDelCount(0), iKeepCount(0),
|
|
iBrokenCount(0), iPolicyBrokenCount(0), iBadCount(0), d(new Private)
|
|
{
|
|
DebugMarker = _config->FindB("Debug::pkgDepCache::Marker", false);
|
|
DebugAutoInstall = _config->FindB("Debug::pkgDepCache::AutoInstall", false);
|
|
d->machineID = APT::Configuration::getMachineID();
|
|
delLocalPolicy = 0;
|
|
LocalPolicy = Plcy;
|
|
if (LocalPolicy == 0)
|
|
delLocalPolicy = LocalPolicy = new Policy;
|
|
}
|
|
/*}}}*/
|
|
// DepCache::~pkgDepCache - Destructor /*{{{*/
|
|
// ---------------------------------------------------------------------
|
|
/* */
|
|
pkgDepCache::~pkgDepCache()
|
|
{
|
|
delete [] PkgState;
|
|
delete [] DepState;
|
|
delete delLocalPolicy;
|
|
delete d;
|
|
}
|
|
/*}}}*/
|
|
bool pkgDepCache::CheckConsistency(char const *const msgtag) /*{{{*/
|
|
{
|
|
auto const OrigPkgState = PkgState;
|
|
auto const OrigDepState = DepState;
|
|
|
|
PkgState = new StateCache[Head().PackageCount];
|
|
DepState = new unsigned char[Head().DependsCount];
|
|
memset(PkgState,0,sizeof(*PkgState)*Head().PackageCount);
|
|
memset(DepState,0,sizeof(*DepState)*Head().DependsCount);
|
|
|
|
auto const origUsrSize = iUsrSize;
|
|
auto const origDownloadSize = iDownloadSize;
|
|
auto const origInstCount = iInstCount;
|
|
auto const origUpgradeCount = d->iUpgradeCount;
|
|
auto const origDelCount = iDelCount;
|
|
auto const origKeepCount = iKeepCount;
|
|
auto const origBrokenCount = iBrokenCount;
|
|
auto const origPolicyBrokenCount = iPolicyBrokenCount;
|
|
auto const origBadCount = iBadCount;
|
|
|
|
for (PkgIterator I = PkgBegin(); not I.end(); ++I)
|
|
{
|
|
auto &State = PkgState[I->ID];
|
|
auto const &OrigState = OrigPkgState[I->ID];
|
|
State.iFlags = OrigState.iFlags;
|
|
|
|
State.CandidateVer = OrigState.CandidateVer;
|
|
State.InstallVer = OrigState.InstallVer;
|
|
State.Mode = OrigState.Mode;
|
|
State.Update(I,*this);
|
|
State.Status = OrigState.Status;
|
|
}
|
|
PerformDependencyPass(nullptr);
|
|
|
|
_error->PushToStack();
|
|
#define APT_CONSISTENCY_CHECK(VAR,STR) \
|
|
if (orig##VAR != i##VAR) \
|
|
_error->Warning("Internal Inconsistency in pkgDepCache: " #VAR " " STR " vs " STR " (%s)", i##VAR, orig##VAR, msgtag)
|
|
APT_CONSISTENCY_CHECK(UsrSize, "%lld");
|
|
APT_CONSISTENCY_CHECK(DownloadSize, "%lld");
|
|
APT_CONSISTENCY_CHECK(InstCount, "%lu");
|
|
APT_CONSISTENCY_CHECK(DelCount, "%lu");
|
|
APT_CONSISTENCY_CHECK(KeepCount, "%lu");
|
|
APT_CONSISTENCY_CHECK(BrokenCount, "%lu");
|
|
APT_CONSISTENCY_CHECK(PolicyBrokenCount, "%lu");
|
|
APT_CONSISTENCY_CHECK(BadCount, "%lu");
|
|
#undef APT_CONSISTENCY_CHECK
|
|
|
|
for (PkgIterator P = PkgBegin(); not P.end(); ++P)
|
|
{
|
|
auto const &State = PkgState[P->ID];
|
|
auto const &OrigState = OrigPkgState[P->ID];
|
|
if (State.Status != OrigState.Status)
|
|
_error->Warning("Internal Inconsistency in pkgDepCache: Status of %s is %d vs %d (%s)", P.FullName().c_str(), State.Status, OrigState.Status, msgtag);
|
|
if (State.NowBroken() != OrigState.NowBroken())
|
|
_error->Warning("Internal Inconsistency in pkgDepCache: Now broken for %s is %d vs %d (%s)", P.FullName().c_str(), static_cast<int>(State.DepState), static_cast<int>(OrigState.DepState), msgtag);
|
|
if (State.NowPolicyBroken() != OrigState.NowPolicyBroken())
|
|
_error->Warning("Internal Inconsistency in pkgDepCache: Now policy broken for %s is %d vs %d (%s)", P.FullName().c_str(), static_cast<int>(State.DepState), static_cast<int>(OrigState.DepState), msgtag);
|
|
if (State.InstBroken() != OrigState.InstBroken())
|
|
_error->Warning("Internal Inconsistency in pkgDepCache: Install broken for %s is %d vs %d (%s)", P.FullName().c_str(), static_cast<int>(State.DepState), static_cast<int>(OrigState.DepState), msgtag);
|
|
if (State.InstPolicyBroken() != OrigState.InstPolicyBroken())
|
|
_error->Warning("Internal Inconsistency in pkgDepCache: Install broken for %s is %d vs %d (%s)", P.FullName().c_str(), static_cast<int>(State.DepState), static_cast<int>(OrigState.DepState), msgtag);
|
|
}
|
|
|
|
auto inconsistent = _error->PendingError();
|
|
_error->MergeWithStack();
|
|
|
|
delete[] PkgState;
|
|
delete[] DepState;
|
|
PkgState = OrigPkgState;
|
|
DepState = OrigDepState;
|
|
iUsrSize = origUsrSize;
|
|
iDownloadSize = origDownloadSize;
|
|
iInstCount = origInstCount;
|
|
d->iUpgradeCount = origUpgradeCount;
|
|
iDelCount = origDelCount;
|
|
iKeepCount = origKeepCount;
|
|
iBrokenCount = origBrokenCount;
|
|
iPolicyBrokenCount = origPolicyBrokenCount;
|
|
iBadCount = origBadCount;
|
|
|
|
return not inconsistent;
|
|
}
|
|
/*}}}*/
|
|
// DepCache::Init - Generate the initial extra structures. /*{{{*/
|
|
// ---------------------------------------------------------------------
|
|
/* This allocats the extension buffers and initializes them. */
|
|
bool pkgDepCache::Init(OpProgress * const Prog)
|
|
{
|
|
// Suppress mark updates during this operation (just in case) and
|
|
// run a mark operation when Init terminates.
|
|
ActionGroup actions(*this);
|
|
|
|
delete [] PkgState;
|
|
delete [] DepState;
|
|
PkgState = new StateCache[Head().PackageCount];
|
|
DepState = new unsigned char[Head().DependsCount];
|
|
memset(PkgState,0,sizeof(*PkgState)*Head().PackageCount);
|
|
memset(DepState,0,sizeof(*DepState)*Head().DependsCount);
|
|
|
|
if (Prog != 0)
|
|
{
|
|
Prog->OverallProgress(0,2*Head().PackageCount,Head().PackageCount,
|
|
_("Building dependency tree"));
|
|
Prog->SubProgress(Head().PackageCount,_("Candidate versions"));
|
|
}
|
|
|
|
/* Set the current state of everything. In this state all of the
|
|
packages are kept exactly as is. See AllUpgrade */
|
|
int Done = 0;
|
|
for (PkgIterator I = PkgBegin(); I.end() != true; ++I, ++Done)
|
|
{
|
|
if (Prog != 0 && Done%20 == 0)
|
|
Prog->Progress(Done);
|
|
|
|
// Find the proper cache slot
|
|
StateCache &State = PkgState[I->ID];
|
|
State.iFlags = 0;
|
|
|
|
// Figure out the install version
|
|
State.CandidateVer = LocalPolicy->GetCandidateVer(I);
|
|
State.InstallVer = I.CurrentVer();
|
|
State.Mode = ModeKeep;
|
|
|
|
State.Update(I,*this);
|
|
}
|
|
|
|
if (Prog != 0)
|
|
{
|
|
Prog->OverallProgress(Head().PackageCount,2*Head().PackageCount,
|
|
Head().PackageCount,
|
|
_("Building dependency tree"));
|
|
Prog->SubProgress(Head().PackageCount,_("Dependency generation"));
|
|
}
|
|
|
|
Update(Prog);
|
|
|
|
if(Prog != 0)
|
|
Prog->Done();
|
|
|
|
return true;
|
|
}
|
|
/*}}}*/
|
|
bool pkgDepCache::readStateFile(OpProgress * const Prog) /*{{{*/
|
|
{
|
|
FileFd state_file;
|
|
string const state = _config->FindFile("Dir::State::extended_states");
|
|
if(RealFileExists(state)) {
|
|
state_file.Open(state, FileFd::ReadOnly, FileFd::Extension);
|
|
off_t const file_size = state_file.Size();
|
|
if(Prog != NULL)
|
|
{
|
|
Prog->Done();
|
|
Prog->OverallProgress(0, file_size, 1,
|
|
_("Reading state information"));
|
|
}
|
|
|
|
pkgTagFile tagfile(&state_file);
|
|
pkgTagSection section;
|
|
off_t amt = 0;
|
|
bool const debug_autoremove = _config->FindB("Debug::pkgAutoRemove",false);
|
|
while(tagfile.Step(section)) {
|
|
auto const pkgname = section.Find(pkgTagSection::Key::Package);
|
|
auto pkgarch = section.Find(pkgTagSection::Key::Architecture);
|
|
if (pkgarch.empty() == true)
|
|
pkgarch = "any";
|
|
pkgCache::PkgIterator pkg = Cache->FindPkg(pkgname, pkgarch);
|
|
// Silently ignore unknown packages and packages with no actual version.
|
|
if(pkg.end() == true || pkg->VersionList == 0)
|
|
continue;
|
|
|
|
short const reason = section.FindI("Auto-Installed", 0);
|
|
if(reason > 0)
|
|
{
|
|
PkgState[pkg->ID].Flags |= Flag::Auto;
|
|
if (unlikely(debug_autoremove))
|
|
std::clog << "Auto-Installed : " << pkg.FullName() << std::endl;
|
|
if (pkgarch == "any")
|
|
{
|
|
pkgCache::GrpIterator G = pkg.Group();
|
|
for (pkg = G.NextPkg(pkg); pkg.end() != true; pkg = G.NextPkg(pkg))
|
|
if (pkg->VersionList != 0)
|
|
PkgState[pkg->ID].Flags |= Flag::Auto;
|
|
}
|
|
}
|
|
amt += section.size();
|
|
if(Prog != NULL)
|
|
Prog->OverallProgress(amt, file_size, 1,
|
|
_("Reading state information"));
|
|
}
|
|
if(Prog != NULL)
|
|
Prog->OverallProgress(file_size, file_size, 1,
|
|
_("Reading state information"));
|
|
}
|
|
|
|
return true;
|
|
}
|
|
/*}}}*/
|
|
bool pkgDepCache::writeStateFile(OpProgress * const /*prog*/, bool const InstalledOnly) /*{{{*/
|
|
{
|
|
bool const debug_autoremove = _config->FindB("Debug::pkgAutoRemove",false);
|
|
|
|
if(debug_autoremove)
|
|
std::clog << "pkgDepCache::writeStateFile()" << std::endl;
|
|
|
|
FileFd StateFile;
|
|
string const state = _config->FindFile("Dir::State::extended_states");
|
|
if (CreateAPTDirectoryIfNeeded(_config->FindDir("Dir::State"), flNotFile(state)) == false)
|
|
return false;
|
|
|
|
// if it does not exist, create a empty one
|
|
if(!RealFileExists(state))
|
|
{
|
|
StateFile.Open(state, FileFd::WriteAtomic, FileFd::Extension);
|
|
StateFile.Close();
|
|
}
|
|
|
|
// open it
|
|
if (!StateFile.Open(state, FileFd::ReadOnly, FileFd::Extension))
|
|
return _error->Error(_("Failed to open StateFile %s"),
|
|
state.c_str());
|
|
|
|
FileFd OutFile(state, FileFd::ReadWrite | FileFd::Atomic, FileFd::Extension);
|
|
if (OutFile.IsOpen() == false || OutFile.Failed() == true)
|
|
return _error->Error(_("Failed to write temporary StateFile %s"), state.c_str());
|
|
|
|
// first merge with the existing sections
|
|
pkgTagFile tagfile(&StateFile);
|
|
pkgTagSection section;
|
|
std::set<string> pkgs_seen;
|
|
while(tagfile.Step(section)) {
|
|
auto const pkgname = section.Find(pkgTagSection::Key::Package);
|
|
auto pkgarch = section.Find(pkgTagSection::Key::Architecture);
|
|
if (pkgarch.empty() == true)
|
|
pkgarch = "native";
|
|
// Silently ignore unknown packages and packages with no actual
|
|
// version.
|
|
pkgCache::PkgIterator pkg = Cache->FindPkg(pkgname, pkgarch);
|
|
if(pkg.end() || pkg.VersionList().end())
|
|
continue;
|
|
StateCache const &P = PkgState[pkg->ID];
|
|
bool newAuto = (P.Flags & Flag::Auto);
|
|
// reset to default (=manual) not installed or now-removed ones if requested
|
|
if (InstalledOnly && (
|
|
(pkg->CurrentVer == 0 && P.Mode != ModeInstall) ||
|
|
(pkg->CurrentVer != 0 && P.Mode == ModeDelete)))
|
|
newAuto = false;
|
|
if (newAuto == false)
|
|
{
|
|
// The section is obsolete if it contains no other tag
|
|
auto const count = section.Count();
|
|
if (count < 2 ||
|
|
(count == 2 && section.Exists("Auto-Installed")) ||
|
|
(count == 3 && section.Exists("Auto-Installed") && section.Exists("Architecture")))
|
|
{
|
|
if(debug_autoremove)
|
|
std::clog << "Drop obsolete section with " << count << " fields for " << APT::PrettyPkg(this, pkg) << std::endl;
|
|
continue;
|
|
}
|
|
}
|
|
|
|
if(debug_autoremove)
|
|
std::clog << "Update existing AutoInstall to " << newAuto << " for " << APT::PrettyPkg(this, pkg) << std::endl;
|
|
|
|
std::vector<pkgTagSection::Tag> rewrite;
|
|
rewrite.push_back(pkgTagSection::Tag::Rewrite("Architecture", pkg.Arch()));
|
|
rewrite.push_back(pkgTagSection::Tag::Rewrite("Auto-Installed", newAuto ? "1" : "0"));
|
|
section.Write(OutFile, NULL, rewrite);
|
|
if (OutFile.Write("\n", 1) == false)
|
|
return false;
|
|
pkgs_seen.insert(pkg.FullName());
|
|
}
|
|
|
|
// then write the ones we have not seen yet
|
|
for(pkgCache::PkgIterator pkg=Cache->PkgBegin(); !pkg.end(); ++pkg) {
|
|
StateCache const &P = PkgState[pkg->ID];
|
|
if(P.Flags & Flag::Auto) {
|
|
if (pkgs_seen.find(pkg.FullName()) != pkgs_seen.end()) {
|
|
if(debug_autoremove)
|
|
std::clog << "Skipping already written " << APT::PrettyPkg(this, pkg) << std::endl;
|
|
continue;
|
|
}
|
|
// skip not installed ones if requested
|
|
if (InstalledOnly && (
|
|
(pkg->CurrentVer == 0 && P.Mode != ModeInstall) ||
|
|
(pkg->CurrentVer != 0 && P.Mode == ModeDelete)))
|
|
continue;
|
|
if(debug_autoremove)
|
|
std::clog << "Writing new AutoInstall: " << APT::PrettyPkg(this, pkg) << std::endl;
|
|
std::string stanza = "Package: ";
|
|
stanza.append(pkg.Name())
|
|
.append("\nArchitecture: ").append(pkg.Arch())
|
|
.append("\nAuto-Installed: 1\n\n");
|
|
if (OutFile.Write(stanza.c_str(), stanza.length()) == false)
|
|
return false;
|
|
}
|
|
}
|
|
if (StateFile.Failed())
|
|
{
|
|
OutFile.OpFail();
|
|
return false;
|
|
}
|
|
if (OutFile.Close() == false)
|
|
return false;
|
|
chmod(state.c_str(), 0644);
|
|
return true;
|
|
}
|
|
/*}}}*/
|
|
// DepCache::CheckDep - Checks a single dependency /*{{{*/
|
|
// ---------------------------------------------------------------------
|
|
/* This first checks the dependency against the main target package and
|
|
then walks along the package provides list and checks if each provides
|
|
will be installed then checks the provides against the dep. Res will be
|
|
set to the package which was used to satisfy the dep. */
|
|
bool pkgDepCache::CheckDep(DepIterator const &Dep,int const Type,PkgIterator &Res)
|
|
{
|
|
Res = Dep.TargetPkg();
|
|
|
|
/* Check simple depends. A depends -should- never self match but
|
|
we allow it anyhow because dpkg does. Technically it is a packaging
|
|
bug. Conflicts may never self match */
|
|
if (Dep.IsIgnorable(Res) == false)
|
|
{
|
|
// Check the base package
|
|
if (Type == NowVersion)
|
|
{
|
|
if (Res->CurrentVer != 0 && Dep.IsSatisfied(Res.CurrentVer()) == true)
|
|
return true;
|
|
}
|
|
else if (Type == InstallVersion)
|
|
{
|
|
if (PkgState[Res->ID].InstallVer != 0 &&
|
|
Dep.IsSatisfied(PkgState[Res->ID].InstVerIter(*this)) == true)
|
|
return true;
|
|
}
|
|
else if (Type == CandidateVersion)
|
|
if (PkgState[Res->ID].CandidateVer != 0 &&
|
|
Dep.IsSatisfied(PkgState[Res->ID].CandidateVerIter(*this)) == true)
|
|
return true;
|
|
}
|
|
|
|
if (Dep->Type == Dep::Obsoletes)
|
|
return false;
|
|
|
|
// Check the providing packages
|
|
PrvIterator P = Dep.TargetPkg().ProvidesList();
|
|
for (; P.end() != true; ++P)
|
|
{
|
|
if (Dep.IsIgnorable(P) == true)
|
|
continue;
|
|
|
|
// Check if the provides is a hit
|
|
if (Type == NowVersion)
|
|
{
|
|
if (P.OwnerPkg().CurrentVer() != P.OwnerVer())
|
|
continue;
|
|
}
|
|
else if (Type == InstallVersion)
|
|
{
|
|
StateCache &State = PkgState[P.OwnerPkg()->ID];
|
|
if (State.InstallVer != (Version *)P.OwnerVer())
|
|
continue;
|
|
}
|
|
else if (Type == CandidateVersion)
|
|
{
|
|
StateCache &State = PkgState[P.OwnerPkg()->ID];
|
|
if (State.CandidateVer != (Version *)P.OwnerVer())
|
|
continue;
|
|
}
|
|
|
|
// Compare the versions.
|
|
if (Dep.IsSatisfied(P) == true)
|
|
{
|
|
Res = P.OwnerPkg();
|
|
return true;
|
|
}
|
|
}
|
|
|
|
return false;
|
|
}
|
|
/*}}}*/
|
|
// DepCache::AddSizes - Add the packages sizes to the counters /*{{{*/
|
|
// ---------------------------------------------------------------------
|
|
/* Call with Inverse = true to perform the inverse operation */
|
|
void pkgDepCache::AddSizes(const PkgIterator &Pkg, bool const Inverse)
|
|
{
|
|
StateCache &P = PkgState[Pkg->ID];
|
|
|
|
if (Pkg->VersionList == 0)
|
|
return;
|
|
|
|
if (Pkg.State() == pkgCache::PkgIterator::NeedsConfigure &&
|
|
P.Keep() == true)
|
|
return;
|
|
|
|
// Compute the size data
|
|
if (P.NewInstall() == true)
|
|
{
|
|
if (Inverse == false) {
|
|
iUsrSize += P.InstVerIter(*this)->InstalledSize;
|
|
iDownloadSize += P.InstVerIter(*this)->Size;
|
|
} else {
|
|
iUsrSize -= P.InstVerIter(*this)->InstalledSize;
|
|
iDownloadSize -= P.InstVerIter(*this)->Size;
|
|
}
|
|
return;
|
|
}
|
|
|
|
// Upgrading
|
|
if (Pkg->CurrentVer != 0 &&
|
|
(P.InstallVer != (Version *)Pkg.CurrentVer() ||
|
|
(P.iFlags & ReInstall) == ReInstall) && P.InstallVer != 0)
|
|
{
|
|
if (Inverse == false) {
|
|
iUsrSize -= Pkg.CurrentVer()->InstalledSize;
|
|
iUsrSize += P.InstVerIter(*this)->InstalledSize;
|
|
iDownloadSize += P.InstVerIter(*this)->Size;
|
|
} else {
|
|
iUsrSize -= P.InstVerIter(*this)->InstalledSize;
|
|
iUsrSize += Pkg.CurrentVer()->InstalledSize;
|
|
iDownloadSize -= P.InstVerIter(*this)->Size;
|
|
}
|
|
return;
|
|
}
|
|
|
|
// Reinstall
|
|
if (Pkg.State() == pkgCache::PkgIterator::NeedsUnpack &&
|
|
P.Delete() == false)
|
|
{
|
|
if (Inverse == false)
|
|
iDownloadSize += P.InstVerIter(*this)->Size;
|
|
else
|
|
iDownloadSize -= P.InstVerIter(*this)->Size;
|
|
return;
|
|
}
|
|
|
|
// Removing
|
|
if (Pkg->CurrentVer != 0 && P.InstallVer == 0)
|
|
{
|
|
if (Inverse == false)
|
|
iUsrSize -= Pkg.CurrentVer()->InstalledSize;
|
|
else
|
|
iUsrSize += Pkg.CurrentVer()->InstalledSize;
|
|
return;
|
|
}
|
|
}
|
|
/*}}}*/
|
|
// DepCache::AddStates - Add the package to the state counter /*{{{*/
|
|
// ---------------------------------------------------------------------
|
|
/* This routine is tricky to use, you must make sure that it is never
|
|
called twice for the same package. This means the Remove/Add section
|
|
should be as short as possible and not encompass any code that will
|
|
call Remove/Add itself. Remember, dependencies can be circular so
|
|
while processing a dep for Pkg it is possible that Add/Remove
|
|
will be called on Pkg */
|
|
void pkgDepCache::AddStates(const PkgIterator &Pkg, bool const Invert)
|
|
{
|
|
signed char const Add = (Invert == false) ? 1 : -1;
|
|
StateCache &State = PkgState[Pkg->ID];
|
|
|
|
// The Package is broken (either minimal dep or policy dep)
|
|
if ((State.DepState & DepInstMin) != DepInstMin)
|
|
iBrokenCount += Add;
|
|
if ((State.DepState & DepInstPolicy) != DepInstPolicy)
|
|
iPolicyBrokenCount += Add;
|
|
|
|
// Bad state
|
|
if (Pkg.State() != PkgIterator::NeedsNothing)
|
|
iBadCount += Add;
|
|
|
|
// Not installed
|
|
if (Pkg->CurrentVer == 0)
|
|
{
|
|
if (State.Mode == ModeDelete &&
|
|
(State.iFlags & Purge) == Purge && Pkg.Purge() == false)
|
|
iDelCount += Add;
|
|
|
|
if (State.Mode == ModeInstall)
|
|
iInstCount += Add;
|
|
return;
|
|
}
|
|
|
|
// Installed, no upgrade
|
|
if (State.Status == 0)
|
|
{
|
|
if (State.Mode == ModeDelete)
|
|
iDelCount += Add;
|
|
else
|
|
if ((State.iFlags & ReInstall) == ReInstall)
|
|
iInstCount += Add;
|
|
return;
|
|
}
|
|
|
|
// Alll 3 are possible
|
|
if (State.Mode == ModeDelete)
|
|
iDelCount += Add;
|
|
else if (State.Mode == ModeKeep)
|
|
iKeepCount += Add;
|
|
else if (State.Mode == ModeInstall)
|
|
{
|
|
iInstCount += Add;
|
|
if (Pkg->CurrentVer != 0 && State.Status > 0)
|
|
d->iUpgradeCount += Add;
|
|
}
|
|
}
|
|
/*}}}*/
|
|
// DepCache::BuildGroupOrs - Generate the Or group dep data /*{{{*/
|
|
// ---------------------------------------------------------------------
|
|
/* The or group results are stored in the last item of the or group. This
|
|
allows easy detection of the state of a whole or'd group. */
|
|
void pkgDepCache::BuildGroupOrs(VerIterator const &V)
|
|
{
|
|
unsigned char Group = 0;
|
|
for (DepIterator D = V.DependsList(); D.end() != true; ++D)
|
|
{
|
|
// Build the dependency state.
|
|
unsigned char &State = DepState[D->ID];
|
|
|
|
/* Invert for Conflicts. We have to do this twice to get the
|
|
right sense for a conflicts group */
|
|
if (D.IsNegative() == true)
|
|
State = ~State;
|
|
|
|
// Add to the group if we are within an or..
|
|
State &= 0x7;
|
|
Group |= State;
|
|
State |= Group << 3;
|
|
if ((D->CompareOp & Dep::Or) != Dep::Or)
|
|
Group = 0;
|
|
|
|
// Invert for Conflicts
|
|
if (D.IsNegative() == true)
|
|
State = ~State;
|
|
}
|
|
}
|
|
/*}}}*/
|
|
// DepCache::VersionState - Perform a pass over a dependency list /*{{{*/
|
|
// ---------------------------------------------------------------------
|
|
/* This is used to run over a dependency list and determine the dep
|
|
state of the list, filtering it through both a Min check and a Policy
|
|
check. The return result will have SetMin/SetPolicy low if a check
|
|
fails. It uses the DepState cache for it's computations. */
|
|
unsigned char pkgDepCache::VersionState(DepIterator D, unsigned char const Check,
|
|
unsigned char const SetMin,
|
|
unsigned char const SetPolicy) const
|
|
{
|
|
unsigned char Dep = 0xFF;
|
|
while (D.end() != true)
|
|
{
|
|
// the last or-dependency has the state of all previous or'ed
|
|
DepIterator Start, End;
|
|
D.GlobOr(Start, End);
|
|
// ignore if we are called with Dep{Install,…} or DepG{Install,…}
|
|
// the later would be more correct, but the first is what we get
|
|
unsigned char const State = DepState[End->ID] | (DepState[End->ID] >> 3);
|
|
|
|
// Minimum deps that must be satisfied to have a working package
|
|
if (Start.IsCritical() == true)
|
|
{
|
|
if ((State & Check) != Check)
|
|
return Dep &= ~(SetMin | SetPolicy);
|
|
}
|
|
// Policy deps that must be satisfied to install the package
|
|
else if (IsImportantDep(Start) == true &&
|
|
(State & Check) != Check)
|
|
Dep &= ~SetPolicy;
|
|
}
|
|
return Dep;
|
|
}
|
|
/*}}}*/
|
|
// DepCache::DependencyState - Compute the 3 results for a dep /*{{{*/
|
|
// ---------------------------------------------------------------------
|
|
/* This is the main dependency computation bit. It computes the 3 main
|
|
results for a dependency: Now, Install and Candidate. Callers must
|
|
invert the result if dealing with conflicts. */
|
|
unsigned char pkgDepCache::DependencyState(DepIterator const &D)
|
|
{
|
|
unsigned char State = 0;
|
|
|
|
if (CheckDep(D,NowVersion) == true)
|
|
State |= DepNow;
|
|
if (CheckDep(D,InstallVersion) == true)
|
|
State |= DepInstall;
|
|
if (CheckDep(D,CandidateVersion) == true)
|
|
State |= DepCVer;
|
|
|
|
return State;
|
|
}
|
|
/*}}}*/
|
|
// DepCache::UpdateVerState - Compute the Dep member of the state /*{{{*/
|
|
// ---------------------------------------------------------------------
|
|
/* This determines the combined dependency representation of a package
|
|
for its two states now and install. This is done by using the pre-generated
|
|
dependency information. */
|
|
void pkgDepCache::UpdateVerState(PkgIterator const &Pkg)
|
|
{
|
|
// Empty deps are always true
|
|
StateCache &State = PkgState[Pkg->ID];
|
|
State.DepState = 0xFF;
|
|
|
|
// Check the Current state
|
|
if (Pkg->CurrentVer != 0)
|
|
{
|
|
DepIterator D = Pkg.CurrentVer().DependsList();
|
|
State.DepState &= VersionState(D,DepNow,DepNowMin,DepNowPolicy);
|
|
}
|
|
|
|
/* Check the candidate state. We do not compare against the whole as
|
|
a candidate state but check the candidate version against the
|
|
install states */
|
|
if (State.CandidateVer != 0)
|
|
{
|
|
DepIterator D = State.CandidateVerIter(*this).DependsList();
|
|
State.DepState &= VersionState(D,DepInstall,DepCandMin,DepCandPolicy);
|
|
}
|
|
|
|
// Check target state which can only be current or installed
|
|
if (State.InstallVer != 0)
|
|
{
|
|
DepIterator D = State.InstVerIter(*this).DependsList();
|
|
State.DepState &= VersionState(D,DepInstall,DepInstMin,DepInstPolicy);
|
|
}
|
|
}
|
|
/*}}}*/
|
|
// DepCache::Update - Figure out all the state information /*{{{*/
|
|
// ---------------------------------------------------------------------
|
|
/* This will figure out the state of all the packages and all the
|
|
dependencies based on the current policy. */
|
|
void pkgDepCache::PerformDependencyPass(OpProgress * const Prog)
|
|
{
|
|
iUsrSize = 0;
|
|
iDownloadSize = 0;
|
|
iInstCount = 0;
|
|
d->iUpgradeCount = 0;
|
|
iDelCount = 0;
|
|
iKeepCount = 0;
|
|
iBrokenCount = 0;
|
|
iPolicyBrokenCount = 0;
|
|
iBadCount = 0;
|
|
|
|
int Done = 0;
|
|
for (PkgIterator I = PkgBegin(); I.end() != true; ++I, ++Done)
|
|
{
|
|
if (Prog != 0 && Done%20 == 0)
|
|
Prog->Progress(Done);
|
|
for (VerIterator V = I.VersionList(); V.end() != true; ++V)
|
|
{
|
|
unsigned char Group = 0;
|
|
|
|
for (DepIterator D = V.DependsList(); D.end() != true; ++D)
|
|
{
|
|
// Build the dependency state.
|
|
unsigned char &State = DepState[D->ID];
|
|
State = DependencyState(D);
|
|
|
|
// Add to the group if we are within an or..
|
|
Group |= State;
|
|
State |= Group << 3;
|
|
if ((D->CompareOp & Dep::Or) != Dep::Or)
|
|
Group = 0;
|
|
|
|
// Invert for Conflicts
|
|
if (D.IsNegative() == true)
|
|
State = ~State;
|
|
}
|
|
}
|
|
|
|
// Compute the package dependency state and size additions
|
|
AddSizes(I);
|
|
UpdateVerState(I);
|
|
AddStates(I);
|
|
}
|
|
if (Prog != 0)
|
|
Prog->Progress(Done);
|
|
}
|
|
void pkgDepCache::Update(OpProgress * const Prog)
|
|
{
|
|
PerformDependencyPass(Prog);
|
|
readStateFile(Prog);
|
|
}
|
|
/*}}}*/
|
|
// DepCache::Update - Update the deps list of a package /*{{{*/
|
|
// ---------------------------------------------------------------------
|
|
/* This is a helper for update that only does the dep portion of the scan.
|
|
It is mainly meant to scan reverse dependencies. */
|
|
void pkgDepCache::Update(DepIterator D)
|
|
{
|
|
// Update the reverse deps
|
|
for (;D.end() != true; ++D)
|
|
{
|
|
unsigned char &State = DepState[D->ID];
|
|
State = DependencyState(D);
|
|
|
|
// Invert for Conflicts
|
|
if (D.IsNegative() == true)
|
|
State = ~State;
|
|
|
|
RemoveStates(D.ParentPkg());
|
|
BuildGroupOrs(D.ParentVer());
|
|
UpdateVerState(D.ParentPkg());
|
|
AddStates(D.ParentPkg());
|
|
}
|
|
}
|
|
/*}}}*/
|
|
// DepCache::Update - Update the related deps of a package /*{{{*/
|
|
// ---------------------------------------------------------------------
|
|
/* This is called whenever the state of a package changes. It updates
|
|
all cached dependencies related to this package. */
|
|
void pkgDepCache::Update(PkgIterator const &Pkg)
|
|
{
|
|
// Recompute the dep of the package
|
|
RemoveStates(Pkg);
|
|
UpdateVerState(Pkg);
|
|
AddStates(Pkg);
|
|
|
|
// Update the reverse deps
|
|
Update(Pkg.RevDependsList());
|
|
|
|
// Update the provides map for the current ver
|
|
auto const CurVer = Pkg.CurrentVer();
|
|
if (not CurVer.end())
|
|
for (PrvIterator P = CurVer.ProvidesList(); not P.end(); ++P)
|
|
Update(P.ParentPkg().RevDependsList());
|
|
|
|
// Update the provides map for the candidate ver
|
|
auto const CandVer = PkgState[Pkg->ID].CandidateVerIter(*this);
|
|
if (not CandVer.end() && CandVer != CurVer)
|
|
for (PrvIterator P = CandVer.ProvidesList(); not P.end(); ++P)
|
|
Update(P.ParentPkg().RevDependsList());
|
|
}
|
|
/*}}}*/
|
|
// DepCache::IsModeChangeOk - check if it is ok to change the mode /*{{{*/
|
|
// ---------------------------------------------------------------------
|
|
/* this is used by all Mark methods on the very first line to check sanity
|
|
and prevents mode changes for packages on hold for example.
|
|
If you want to check Mode specific stuff you can use the virtual public
|
|
Is<Mode>Ok methods instead */
|
|
static char const* PrintMode(char const mode)
|
|
{
|
|
switch (mode)
|
|
{
|
|
case pkgDepCache::ModeInstall: return "Install";
|
|
case pkgDepCache::ModeKeep: return "Keep";
|
|
case pkgDepCache::ModeDelete: return "Delete";
|
|
case pkgDepCache::ModeGarbage: return "Garbage";
|
|
default: return "UNKNOWN";
|
|
}
|
|
}
|
|
static bool IsModeChangeOk(pkgDepCache &Cache, pkgDepCache::ModeList const mode, pkgCache::PkgIterator const &Pkg,
|
|
unsigned long const Depth, bool const FromUser, bool const DebugMarker)
|
|
{
|
|
// we are not trying too hard…
|
|
if (unlikely(Depth > 3000))
|
|
return false;
|
|
|
|
// general sanity
|
|
if (unlikely(Pkg.end() == true || Pkg->VersionList == 0))
|
|
return false;
|
|
|
|
// the user is always right
|
|
if (FromUser == true)
|
|
return true;
|
|
|
|
auto &P = Cache[Pkg];
|
|
// not changing the mode is obviously also fine as we might want to call
|
|
// e.g. MarkInstall multiple times with different arguments for the same package
|
|
if (P.Mode == mode)
|
|
return true;
|
|
|
|
// if previous state was set by user only user can reset it
|
|
if ((P.iFlags & pkgDepCache::Protected) == pkgDepCache::Protected)
|
|
{
|
|
if (unlikely(DebugMarker == true))
|
|
std::clog << OutputInDepth(Depth) << "Ignore Mark" << PrintMode(mode)
|
|
<< " of " << APT::PrettyPkg(&Cache, Pkg) << " as its mode (" << PrintMode(P.Mode)
|
|
<< ") is protected" << std::endl;
|
|
return false;
|
|
}
|
|
// enforce dpkg holds
|
|
else if (mode != pkgDepCache::ModeKeep && Pkg->SelectedState == pkgCache::State::Hold &&
|
|
_config->FindB("APT::Ignore-Hold",false) == false)
|
|
{
|
|
if (unlikely(DebugMarker == true))
|
|
std::clog << OutputInDepth(Depth) << "Hold prevents Mark" << PrintMode(mode)
|
|
<< " of " << APT::PrettyPkg(&Cache, Pkg) << std::endl;
|
|
return false;
|
|
}
|
|
// Do not allow removals of essential packages not explicitly triggered by the user
|
|
else if (mode == pkgDepCache::ModeDelete && (Pkg->Flags & pkgCache::Flag::Essential) == pkgCache::Flag::Essential &&
|
|
not _config->FindB("APT::Get::Allow-Solver-Remove-Essential", false))
|
|
{
|
|
if (unlikely(DebugMarker == true))
|
|
std::clog << OutputInDepth(Depth) << "Essential prevents Mark" << PrintMode(mode)
|
|
<< " of " << APT::PrettyPkg(&Cache, Pkg) << std::endl;
|
|
return false;
|
|
}
|
|
// Do not allow removals of essential packages not explicitly triggered by the user
|
|
else if (mode == pkgDepCache::ModeDelete && (Pkg->Flags & pkgCache::Flag::Important) == pkgCache::Flag::Important &&
|
|
not _config->FindB("APT::Get::Allow-Solver-Remove-Essential", false))
|
|
{
|
|
if (unlikely(DebugMarker == true))
|
|
std::clog << OutputInDepth(Depth) << "Protected prevents Mark" << PrintMode(mode)
|
|
<< " of " << APT::PrettyPkg(&Cache, Pkg) << std::endl;
|
|
return false;
|
|
}
|
|
|
|
return true;
|
|
}
|
|
/*}}}*/
|
|
// DepCache::MarkKeep - Put the package in the keep state /*{{{*/
|
|
// ---------------------------------------------------------------------
|
|
/* */
|
|
bool pkgDepCache::MarkKeep(PkgIterator const &Pkg, bool Soft, bool FromUser,
|
|
unsigned long Depth)
|
|
{
|
|
if (not IsModeChangeOk(*this, ModeKeep, Pkg, Depth, FromUser, DebugMarker))
|
|
return false;
|
|
|
|
/* Reject an attempt to keep a non-source broken installed package, those
|
|
must be upgraded */
|
|
if (Pkg.State() == PkgIterator::NeedsUnpack &&
|
|
Pkg.CurrentVer().Downloadable() == false)
|
|
return false;
|
|
|
|
/* We changed the soft state all the time so the UI is a bit nicer
|
|
to use */
|
|
StateCache &P = PkgState[Pkg->ID];
|
|
|
|
// Check that it is not already kept
|
|
if (P.Mode == ModeKeep)
|
|
return true;
|
|
|
|
if (Soft == true)
|
|
P.iFlags |= AutoKept;
|
|
else
|
|
P.iFlags &= ~AutoKept;
|
|
|
|
ActionGroup group(*this);
|
|
|
|
#if 0 // resetting the autoflag here means we lose the
|
|
// auto-mark information if a user selects a package for removal
|
|
// but changes his mind then and sets it for keep again
|
|
// - this makes sense as default when all Garbage dependencies
|
|
// are automatically marked for removal (as aptitude does).
|
|
// setting a package for keep then makes it no longer autoinstalled
|
|
// for all other use-case this action is rather surprising
|
|
if(FromUser && !P.Marked)
|
|
P.Flags &= ~Flag::Auto;
|
|
#endif
|
|
|
|
if (DebugMarker == true)
|
|
std::clog << OutputInDepth(Depth) << "MarkKeep " << APT::PrettyPkg(this, Pkg) << " FU=" << FromUser << std::endl;
|
|
|
|
RemoveSizes(Pkg);
|
|
RemoveStates(Pkg);
|
|
|
|
P.Mode = ModeKeep;
|
|
if (Pkg->CurrentVer == 0)
|
|
P.InstallVer = 0;
|
|
else
|
|
P.InstallVer = Pkg.CurrentVer();
|
|
|
|
AddStates(Pkg);
|
|
Update(Pkg);
|
|
AddSizes(Pkg);
|
|
|
|
return true;
|
|
}
|
|
/*}}}*/
|
|
// DepCache::MarkDelete - Put the package in the delete state /*{{{*/
|
|
// ---------------------------------------------------------------------
|
|
/* */
|
|
bool pkgDepCache::MarkDelete(PkgIterator const &Pkg, bool rPurge,
|
|
unsigned long Depth, bool FromUser)
|
|
{
|
|
if (not IsModeChangeOk(*this, ModeDelete, Pkg, Depth, FromUser, DebugMarker))
|
|
return false;
|
|
|
|
StateCache &P = PkgState[Pkg->ID];
|
|
|
|
// Check that it is not already marked for delete
|
|
if ((P.Mode == ModeDelete || P.InstallVer == 0) &&
|
|
(Pkg.Purge() == true || rPurge == false))
|
|
return true;
|
|
|
|
// check if we are allowed to remove the package
|
|
if (IsDeleteOk(Pkg,rPurge,Depth,FromUser) == false)
|
|
return false;
|
|
|
|
P.iFlags &= ~(AutoKept | Purge);
|
|
if (rPurge == true)
|
|
P.iFlags |= Purge;
|
|
|
|
ActionGroup group(*this);
|
|
|
|
if (FromUser == false)
|
|
{
|
|
VerIterator const PV = P.InstVerIter(*this);
|
|
if (PV.end() == false)
|
|
{
|
|
// removed metapackages mark their dependencies as manual to prevent in "desktop depends browser, texteditor"
|
|
// the removal of browser to suggest the removal of desktop and texteditor.
|
|
// We ignore the auto-bit here as we can't deal with metapackage cascardes otherwise.
|
|
// We do not check for or-groups here as we don't know which package takes care of
|
|
// providing the feature the user likes e.g.: browser1 | browser2 | browser3
|
|
// Temporary removals are effected by this as well, which is bad, but unlikely in practice
|
|
bool const PinNeverMarkAutoSection = (PV->Section != 0 && _config->SectionInSubTree("APT::Never-MarkAuto-Sections", PV.Section()));
|
|
if (PinNeverMarkAutoSection)
|
|
{
|
|
for (DepIterator D = PV.DependsList(); D.end() != true; ++D)
|
|
{
|
|
if (D.IsMultiArchImplicit() == true || D.IsNegative() == true || IsImportantDep(D) == false)
|
|
continue;
|
|
|
|
pkgCacheFile CacheFile(this);
|
|
APT::VersionList verlist = APT::VersionList::FromDependency(CacheFile, D, APT::CacheSetHelper::INSTALLED);
|
|
for (auto const &V : verlist)
|
|
{
|
|
PkgIterator const DP = V.ParentPkg();
|
|
if(DebugAutoInstall == true)
|
|
std::clog << OutputInDepth(Depth) << "Setting " << DP.FullName(false) << " NOT as auto-installed (direct "
|
|
<< D.DepType() << " of " << Pkg.FullName(false) << " which is in APT::Never-MarkAuto-Sections)" << std::endl;
|
|
|
|
MarkAuto(DP, false);
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
if (DebugMarker == true)
|
|
std::clog << OutputInDepth(Depth) << (rPurge ? "MarkPurge " : "MarkDelete ") << APT::PrettyPkg(this, Pkg) << " FU=" << FromUser << std::endl;
|
|
|
|
RemoveSizes(Pkg);
|
|
RemoveStates(Pkg);
|
|
|
|
if (Pkg->CurrentVer == 0 && (Pkg.Purge() == true || rPurge == false))
|
|
P.Mode = ModeKeep;
|
|
else
|
|
P.Mode = ModeDelete;
|
|
P.InstallVer = 0;
|
|
|
|
AddStates(Pkg);
|
|
Update(Pkg);
|
|
AddSizes(Pkg);
|
|
|
|
return true;
|
|
}
|
|
/*}}}*/
|
|
// DepCache::IsDeleteOk - check if it is ok to remove this package /*{{{*/
|
|
// ---------------------------------------------------------------------
|
|
/* The default implementation tries to prevent deletion of install requests.
|
|
dpkg holds are enforced by the private IsModeChangeOk */
|
|
bool pkgDepCache::IsDeleteOk(PkgIterator const &Pkg,bool rPurge,
|
|
unsigned long Depth, bool FromUser)
|
|
{
|
|
return IsDeleteOkProtectInstallRequests(Pkg, rPurge, Depth, FromUser);
|
|
}
|
|
bool pkgDepCache::IsDeleteOkProtectInstallRequests(PkgIterator const &Pkg,
|
|
bool const /*rPurge*/, unsigned long const Depth, bool const FromUser)
|
|
{
|
|
if (FromUser == false && Pkg->CurrentVer == 0)
|
|
{
|
|
StateCache &P = PkgState[Pkg->ID];
|
|
if (P.InstallVer != 0 && P.Status == 2 && (P.Flags & Flag::Auto) != Flag::Auto)
|
|
{
|
|
if (DebugMarker == true)
|
|
std::clog << OutputInDepth(Depth) << "Manual install request prevents MarkDelete of " << APT::PrettyPkg(this, Pkg) << std::endl;
|
|
return false;
|
|
}
|
|
}
|
|
return true;
|
|
}
|
|
/*}}}*/
|
|
struct CompareProviders /*{{{*/
|
|
{
|
|
pkgDepCache const &Cache;
|
|
pkgCache::PkgIterator const Pkg;
|
|
explicit CompareProviders(pkgDepCache const &pCache, pkgCache::DepIterator const &Dep) : Cache{pCache}, Pkg{Dep.TargetPkg()} {}
|
|
bool operator() (pkgCache::VerIterator const &AV, pkgCache::VerIterator const &BV)
|
|
{
|
|
pkgCache::PkgIterator const A = AV.ParentPkg();
|
|
pkgCache::PkgIterator const B = BV.ParentPkg();
|
|
// Deal with protected first as if they don't work we usually have a problem
|
|
if (Cache[A].Protect() != Cache[B].Protect())
|
|
return Cache[A].Protect();
|
|
// Prefer MA:same packages if other architectures for it are installed
|
|
if ((AV->MultiArch & pkgCache::Version::Same) == pkgCache::Version::Same ||
|
|
(BV->MultiArch & pkgCache::Version::Same) == pkgCache::Version::Same)
|
|
{
|
|
bool instA = false;
|
|
if ((AV->MultiArch & pkgCache::Version::Same) == pkgCache::Version::Same)
|
|
{
|
|
pkgCache::GrpIterator Grp = A.Group();
|
|
for (pkgCache::PkgIterator P = Grp.PackageList(); P.end() == false; P = Grp.NextPkg(P))
|
|
if (P->CurrentVer != 0)
|
|
{
|
|
instA = true;
|
|
break;
|
|
}
|
|
}
|
|
bool instB = false;
|
|
if ((BV->MultiArch & pkgCache::Version::Same) == pkgCache::Version::Same)
|
|
{
|
|
pkgCache::GrpIterator Grp = B.Group();
|
|
for (pkgCache::PkgIterator P = Grp.PackageList(); P.end() == false; P = Grp.NextPkg(P))
|
|
{
|
|
if (P->CurrentVer != 0)
|
|
{
|
|
instB = true;
|
|
break;
|
|
}
|
|
}
|
|
}
|
|
if (instA != instB)
|
|
return instA;
|
|
}
|
|
if ((A->CurrentVer == 0 || B->CurrentVer == 0) && A->CurrentVer != B->CurrentVer)
|
|
return A->CurrentVer != 0;
|
|
// Prefer packages in the same group as the target; e.g. foo:i386, foo:amd64
|
|
if (A->Group != B->Group)
|
|
{
|
|
if (A->Group == Pkg->Group && B->Group != Pkg->Group)
|
|
return true;
|
|
else if (B->Group == Pkg->Group && A->Group != Pkg->Group)
|
|
return false;
|
|
}
|
|
// we like essentials
|
|
if ((A->Flags & pkgCache::Flag::Essential) != (B->Flags & pkgCache::Flag::Essential))
|
|
{
|
|
if ((A->Flags & pkgCache::Flag::Essential) == pkgCache::Flag::Essential)
|
|
return true;
|
|
else if ((B->Flags & pkgCache::Flag::Essential) == pkgCache::Flag::Essential)
|
|
return false;
|
|
}
|
|
if ((A->Flags & pkgCache::Flag::Important) != (B->Flags & pkgCache::Flag::Important))
|
|
{
|
|
if ((A->Flags & pkgCache::Flag::Important) == pkgCache::Flag::Important)
|
|
return true;
|
|
else if ((B->Flags & pkgCache::Flag::Important) == pkgCache::Flag::Important)
|
|
return false;
|
|
}
|
|
// prefer native architecture
|
|
if (strcmp(A.Arch(), B.Arch()) != 0)
|
|
{
|
|
if (strcmp(A.Arch(), A.Cache()->NativeArch()) == 0)
|
|
return true;
|
|
else if (strcmp(B.Arch(), B.Cache()->NativeArch()) == 0)
|
|
return false;
|
|
std::vector<std::string> archs = APT::Configuration::getArchitectures();
|
|
for (std::vector<std::string>::const_iterator a = archs.begin(); a != archs.end(); ++a)
|
|
if (*a == A.Arch())
|
|
return true;
|
|
else if (*a == B.Arch())
|
|
return false;
|
|
}
|
|
// higher priority seems like a good idea
|
|
if (AV->Priority != BV->Priority)
|
|
return AV->Priority < BV->Priority;
|
|
// unable to decide…
|
|
return A->ID > B->ID;
|
|
}
|
|
};
|
|
/*}}}*/
|
|
bool pkgDepCache::MarkInstall_StateChange(pkgCache::PkgIterator const &Pkg, bool AutoInst, bool FromUser) /*{{{*/
|
|
{
|
|
bool AlwaysMarkAsAuto = _config->FindB("APT::Get::Mark-Auto", false) == true;
|
|
auto &P = (*this)[Pkg];
|
|
if (P.Protect() && P.InstallVer == P.CandidateVer)
|
|
return true;
|
|
|
|
P.iFlags &= ~pkgDepCache::AutoKept;
|
|
|
|
/* Target the candidate version and remove the autoflag. We reset the
|
|
autoflag below if this was called recursively. Otherwise the user
|
|
should have the ability to de-auto a package by changing its state */
|
|
RemoveSizes(Pkg);
|
|
RemoveStates(Pkg);
|
|
|
|
P.Mode = pkgDepCache::ModeInstall;
|
|
P.InstallVer = P.CandidateVer;
|
|
|
|
if(FromUser && !AlwaysMarkAsAuto)
|
|
{
|
|
// Set it to manual if it's a new install or already installed,
|
|
// but only if its not marked by the autoremover (aptitude depend on this behavior)
|
|
// or if we do automatic installation (aptitude never does it)
|
|
if(P.Status == 2 || (Pkg->CurrentVer != 0 && (AutoInst == true || P.Marked == false)))
|
|
P.Flags &= ~pkgCache::Flag::Auto;
|
|
}
|
|
else
|
|
{
|
|
// Set it to auto if this is a new install.
|
|
if(P.Status == 2)
|
|
P.Flags |= pkgCache::Flag::Auto;
|
|
}
|
|
if (P.CandidateVer == (pkgCache::Version *)Pkg.CurrentVer())
|
|
P.Mode = pkgDepCache::ModeKeep;
|
|
|
|
AddStates(Pkg);
|
|
Update(Pkg);
|
|
AddSizes(Pkg);
|
|
return true;
|
|
}
|
|
/*}}}*/
|
|
static bool MarkInstall_DiscardCandidate(pkgDepCache &Cache, pkgCache::PkgIterator const &Pkg) /*{{{*/
|
|
{
|
|
auto &State = Cache[Pkg];
|
|
State.CandidateVer = State.InstallVer;
|
|
auto const oldStatus = State.Status;
|
|
State.Update(Pkg, Cache);
|
|
State.Status = oldStatus;
|
|
return true;
|
|
}
|
|
/*}}}*/
|
|
bool pkgDepCache::MarkInstall_DiscardInstall(pkgCache::PkgIterator const &Pkg) /*{{{*/
|
|
{
|
|
StateCache &State = PkgState[Pkg->ID];
|
|
if (State.Mode == ModeKeep && State.InstallVer == State.CandidateVer && State.CandidateVer == Pkg.CurrentVer())
|
|
return true;
|
|
RemoveSizes(Pkg);
|
|
RemoveStates(Pkg);
|
|
if (Pkg->CurrentVer != 0)
|
|
State.InstallVer = Pkg.CurrentVer();
|
|
else
|
|
State.InstallVer = nullptr;
|
|
State.Mode = ModeKeep;
|
|
AddStates(Pkg);
|
|
Update(Pkg);
|
|
AddSizes(Pkg);
|
|
return MarkInstall_DiscardCandidate(*this, Pkg);
|
|
}
|
|
/*}}}*/
|
|
static bool MarkInstall_CollectDependencies(pkgDepCache const &Cache, pkgCache::VerIterator const &PV, std::vector<pkgCache::DepIterator> &toInstall, std::vector<pkgCache::DepIterator> &toRemove) /*{{{*/
|
|
{
|
|
auto const propagateProtected = Cache[PV.ParentPkg()].Protect();
|
|
for (auto Dep = PV.DependsList(); not Dep.end();)
|
|
{
|
|
auto const Start = Dep;
|
|
// check if an installed package satisfies the dependency (and get the extend of the or-group)
|
|
bool foundSolution = false;
|
|
for (bool LastOR = true; not Dep.end() && LastOR; ++Dep)
|
|
{
|
|
LastOR = (Dep->CompareOp & pkgCache::Dep::Or) == pkgCache::Dep::Or;
|
|
if ((Cache[Dep] & pkgDepCache::DepInstall) == pkgDepCache::DepInstall)
|
|
foundSolution = true;
|
|
}
|
|
if (foundSolution && not propagateProtected)
|
|
continue;
|
|
|
|
/* Check if this dep should be consider for install.
|
|
(Pre-)Depends, Conflicts and Breaks for sure.
|
|
Recommends & Suggests depending on configuration */
|
|
if (not Cache.IsImportantDep(Start))
|
|
continue;
|
|
|
|
if (Start.IsNegative())
|
|
{
|
|
if (Start->Type != pkgCache::Dep::Obsoletes)
|
|
toRemove.push_back(Start);
|
|
}
|
|
else
|
|
toInstall.push_back(Start);
|
|
}
|
|
return true;
|
|
}
|
|
/*}}}*/
|
|
static APT::VersionVector getAllPossibleSolutions(pkgDepCache &Cache, pkgCache::DepIterator Start, pkgCache::DepIterator const &End, APT::CacheSetHelper::VerSelector const selector, bool const sorted) /*{{{*/
|
|
{
|
|
pkgCacheFile CacheFile{&Cache};
|
|
APT::VersionVector toUpgrade, toNewInstall;
|
|
do
|
|
{
|
|
APT::VersionVector verlist = APT::VersionVector::FromDependency(CacheFile, Start, selector);
|
|
if (not sorted)
|
|
{
|
|
std::move(verlist.begin(), verlist.end(), std::back_inserter(toUpgrade));
|
|
continue;
|
|
}
|
|
std::sort(verlist.begin(), verlist.end(), CompareProviders{Cache, Start});
|
|
for (auto &&Ver : verlist)
|
|
{
|
|
auto P = Ver.ParentPkg();
|
|
if (P->CurrentVer != 0)
|
|
toUpgrade.emplace_back(std::move(Ver));
|
|
else
|
|
toNewInstall.emplace_back(std::move(Ver));
|
|
}
|
|
} while (Start++ != End);
|
|
if (toUpgrade.empty())
|
|
toUpgrade = std::move(toNewInstall);
|
|
else
|
|
std::move(toNewInstall.begin(), toNewInstall.end(), std::back_inserter(toUpgrade));
|
|
|
|
if (not sorted)
|
|
std::sort(toUpgrade.begin(), toUpgrade.end(), [](pkgCache::VerIterator const &A, pkgCache::VerIterator const &B) { return A->ID < B->ID; });
|
|
toUpgrade.erase(std::unique(toUpgrade.begin(), toUpgrade.end()), toUpgrade.end());
|
|
|
|
if (not End.IsNegative())
|
|
toUpgrade.erase(std::remove_if(toUpgrade.begin(), toUpgrade.end(), [&Cache](pkgCache::VerIterator const &V) {
|
|
auto const P = V.ParentPkg();
|
|
auto const &State = Cache[P];
|
|
return State.Protect() && (State.Delete() || (State.Keep() && P->CurrentVer == 0));
|
|
}),
|
|
toUpgrade.end());
|
|
|
|
return toUpgrade;
|
|
}
|
|
/*}}}*/
|
|
static bool MarkInstall_MarkDeleteForNotUpgradeable(pkgDepCache &Cache, bool const DebugAutoInstall, pkgCache::VerIterator const &PV, unsigned long const Depth, pkgCache::PkgIterator const &Pkg, bool const propagateProtected, APT::PackageVector &delayedRemove)/*{{{*/
|
|
{
|
|
auto &State = Cache[Pkg];
|
|
if (not propagateProtected)
|
|
{
|
|
if (State.Delete())
|
|
return true;
|
|
if(DebugAutoInstall)
|
|
std::clog << OutputInDepth(Depth) << " Delayed Removing: " << Pkg.FullName() << " as upgrade is not an option for " << PV.ParentPkg().FullName() << " (" << PV.VerStr() << ")\n";
|
|
if (not IsModeChangeOk(Cache, pkgDepCache::ModeDelete, Pkg, Depth, false, DebugAutoInstall) ||
|
|
not Cache.IsDeleteOk(Pkg, false, Depth, false))
|
|
return false;
|
|
delayedRemove.push_back(Pkg);
|
|
return true;
|
|
}
|
|
|
|
if (not State.Delete())
|
|
{
|
|
if(DebugAutoInstall)
|
|
std::clog << OutputInDepth(Depth) << " Removing: " << Pkg.FullName() << " as upgrade is not an option for " << PV.ParentPkg().FullName() << " (" << PV.VerStr() << ")\n";
|
|
if (not Cache.MarkDelete(Pkg, false, Depth + 1, false))
|
|
return false;
|
|
}
|
|
MarkInstall_DiscardCandidate(Cache, Pkg);
|
|
Cache.MarkProtected(Pkg);
|
|
return true;
|
|
}
|
|
/*}}}*/
|
|
static bool MarkInstall_RemoveConflictsIfNotUpgradeable(pkgDepCache &Cache, bool const DebugAutoInstall, pkgCache::VerIterator const &PV, unsigned long Depth, std::vector<pkgCache::DepIterator> &toRemove, APT::PackageVector &toUpgrade, APT::PackageVector &delayedRemove, bool const propagateProtected, bool const FromUser) /*{{{*/
|
|
{
|
|
/* Negative dependencies have no or-group
|
|
If the candidate is effected try to keep current and discard candidate
|
|
If the current is effected try upgrading to candidate or remove it */
|
|
bool failedToRemoveSomething = false;
|
|
APT::PackageVector badCandidate;
|
|
for (auto const &D : toRemove)
|
|
{
|
|
for (auto const &Ver : getAllPossibleSolutions(Cache, D, D, APT::CacheSetHelper::CANDIDATE, true))
|
|
{
|
|
auto const Pkg = Ver.ParentPkg();
|
|
auto &State = Cache[Pkg];
|
|
if (State.CandidateVer != Ver)
|
|
continue;
|
|
if (Pkg.CurrentVer() != Ver)
|
|
{
|
|
if (State.Install() && not Cache.MarkKeep(Pkg, false, false, Depth))
|
|
{
|
|
failedToRemoveSomething = true;
|
|
if (not propagateProtected && not FromUser)
|
|
break;
|
|
}
|
|
else if (propagateProtected)
|
|
{
|
|
MarkInstall_DiscardCandidate(Cache, Pkg);
|
|
if (Pkg->CurrentVer == 0)
|
|
Cache.MarkProtected(Pkg);
|
|
}
|
|
else
|
|
badCandidate.push_back(Pkg);
|
|
}
|
|
else if (not MarkInstall_MarkDeleteForNotUpgradeable(Cache, DebugAutoInstall, PV, Depth, Pkg, propagateProtected, delayedRemove))
|
|
{
|
|
failedToRemoveSomething = true;
|
|
if (not propagateProtected && not FromUser)
|
|
break;
|
|
}
|
|
}
|
|
if (failedToRemoveSomething && not propagateProtected && not FromUser)
|
|
break;
|
|
for (auto const &Ver : getAllPossibleSolutions(Cache, D, D, APT::CacheSetHelper::INSTALLED, true))
|
|
{
|
|
auto const Pkg = Ver.ParentPkg();
|
|
auto &State = Cache[Pkg];
|
|
if (State.CandidateVer != Ver && State.CandidateVer != nullptr &&
|
|
std::find(badCandidate.cbegin(), badCandidate.cend(), Pkg) == badCandidate.end())
|
|
toUpgrade.push_back(Pkg);
|
|
else if (State.CandidateVer == Pkg.CurrentVer())
|
|
; // already done in the first loop above
|
|
else if (not MarkInstall_MarkDeleteForNotUpgradeable(Cache, DebugAutoInstall, PV, Depth, Pkg, propagateProtected, delayedRemove))
|
|
{
|
|
failedToRemoveSomething = true;
|
|
if (not propagateProtected && not FromUser)
|
|
break;
|
|
}
|
|
}
|
|
if (failedToRemoveSomething && not propagateProtected && not FromUser)
|
|
break;
|
|
}
|
|
toRemove.clear();
|
|
return not failedToRemoveSomething;
|
|
}
|
|
/*}}}*/
|
|
static bool MarkInstall_CollectReverseDepends(pkgDepCache &Cache, bool const DebugAutoInstall, pkgCache::VerIterator const &PV, unsigned long Depth, APT::PackageVector &toUpgrade, APT::PackageVector const &delayedRemove) /*{{{*/
|
|
{
|
|
auto CurrentVer = PV.ParentPkg().CurrentVer();
|
|
if (CurrentVer.end())
|
|
return true;
|
|
for (pkgCache::DepIterator D = PV.ParentPkg().RevDependsList(); D.end() == false; ++D)
|
|
{
|
|
auto ParentPkg = D.ParentPkg();
|
|
// Skip non-installed versions and packages already marked for upgrade
|
|
if (ParentPkg.CurrentVer() != D.ParentVer() || Cache[ParentPkg].Install())
|
|
continue;
|
|
// Skip rev-depends we already tagged for removal
|
|
if (Cache[ParentPkg].Delete() || std::find(delayedRemove.begin(), delayedRemove.end(), ParentPkg) != delayedRemove.end())
|
|
continue;
|
|
// We only handle important positive dependencies, RemoveConflictsIfNotUpgradeable handles negative
|
|
if (not Cache.IsImportantDep(D) || D.IsNegative())
|
|
continue;
|
|
// The dependency was previously not satisfied (e.g. part of an or group) or will be satisfied, so it's OK
|
|
if (not D.IsSatisfied(CurrentVer) || D.IsSatisfied(PV))
|
|
continue;
|
|
if (std::find(toUpgrade.begin(), toUpgrade.end(), ParentPkg) != toUpgrade.end())
|
|
continue;
|
|
|
|
if (DebugAutoInstall)
|
|
std::clog << OutputInDepth(Depth) << " Upgrading: " << APT::PrettyPkg(&Cache, ParentPkg) << " due to " << APT::PrettyDep(&Cache, D) << "\n";
|
|
|
|
toUpgrade.push_back(ParentPkg);
|
|
}
|
|
return true;
|
|
}
|
|
/*}}}*/
|
|
static bool MarkInstall_UpgradeOrRemoveConflicts(pkgDepCache &Cache, bool const DebugAutoInstall, unsigned long Depth, bool const ForceImportantDeps, APT::PackageVector &toUpgrade, bool const propagateProtected, bool const FromUser) /*{{{*/
|
|
{
|
|
bool failedToRemoveSomething = false;
|
|
for (auto const &InstPkg : toUpgrade)
|
|
if (not Cache[InstPkg].Install() && not Cache.MarkInstall(InstPkg, true, Depth + 1, false, ForceImportantDeps))
|
|
{
|
|
if (DebugAutoInstall)
|
|
std::clog << OutputInDepth(Depth) << " Removing: " << InstPkg.FullName() << " as upgrade is not possible\n";
|
|
if (not Cache.MarkDelete(InstPkg, false, Depth + 1, false))
|
|
{
|
|
failedToRemoveSomething = true;
|
|
if (not propagateProtected && not FromUser)
|
|
break;
|
|
}
|
|
else if (propagateProtected)
|
|
Cache.MarkProtected(InstPkg);
|
|
}
|
|
toUpgrade.clear();
|
|
return not failedToRemoveSomething;
|
|
}
|
|
/*}}}*/
|
|
static bool MarkInstall_UpgradeOtherBinaries(pkgDepCache &Cache, bool const DebugAutoInstall, unsigned long Depth, bool const ForceImportantDeps, pkgCache::PkgIterator Pkg, pkgCache::VerIterator Ver) /*{{{*/
|
|
{
|
|
APT::PackageSet toUpgrade;
|
|
|
|
if (not _config->FindB("APT::Get::Upgrade-By-Source-Package", true))
|
|
return true;
|
|
|
|
auto SrcGrp = Cache.FindGrp(Ver.SourcePkgName());
|
|
for (auto OtherBinary = SrcGrp.VersionsInSource(); not OtherBinary.end(); OtherBinary = OtherBinary.NextInSource())
|
|
{
|
|
auto OtherPkg = OtherBinary.ParentPkg();
|
|
auto OtherState = Cache[OtherPkg];
|
|
if (OtherPkg == Pkg)
|
|
continue;
|
|
// Package is not installed or at right version, don't need to upgrade
|
|
if (OtherPkg->CurrentVer == 0 || OtherPkg.CurrentVer() == OtherBinary)
|
|
continue;
|
|
// Package is to be installed at right version, don't need to upgrade
|
|
if (OtherState.Install() && OtherState.InstallVer == OtherBinary)
|
|
continue;
|
|
// Package has a different source version than us, so it's not relevant
|
|
if (strcmp(OtherBinary.SourceVerStr(), Ver.SourceVerStr()) != 0 || OtherState.CandidateVer != OtherBinary)
|
|
continue;
|
|
if (DebugAutoInstall)
|
|
std::clog << OutputInDepth(Depth) << "Upgrading " << APT::PrettyPkg(&Cache, OtherPkg) << " due to " << Pkg.FullName() << '\n';
|
|
|
|
toUpgrade.insert(OtherPkg);
|
|
}
|
|
for (auto &OtherPkg : toUpgrade)
|
|
Cache.MarkInstall(OtherPkg, false, Depth + 1, false, ForceImportantDeps);
|
|
for (auto &OtherPkg : toUpgrade)
|
|
Cache.MarkInstall(OtherPkg, true, Depth + 1, false, ForceImportantDeps);
|
|
return true;
|
|
}
|
|
/*}}}*/
|
|
static bool MarkInstall_InstallDependencies(pkgDepCache &Cache, bool const DebugAutoInstall, bool const DebugMarker, pkgCache::PkgIterator const &Pkg, unsigned long Depth, bool const ForceImportantDeps, std::vector<pkgCache::DepIterator> &toInstall, APT::PackageVector *const toMoveAuto, bool const propagateProtected, bool const FromUser) /*{{{*/
|
|
{
|
|
auto const IsSatisfiedByInstalled = [&](auto &D) { return (Cache[pkgCache::DepIterator{Cache, &D}] & pkgDepCache::DepInstall) == pkgDepCache::DepInstall; };
|
|
bool failedToInstallSomething = false;
|
|
for (auto &&Dep : toInstall)
|
|
{
|
|
auto const Copy = Dep;
|
|
pkgCache::DepIterator Start, End;
|
|
Dep.GlobOr(Start, End);
|
|
bool foundSolution = std::any_of(Start, Dep, IsSatisfiedByInstalled);
|
|
if (foundSolution && not propagateProtected)
|
|
continue;
|
|
bool const IsCriticalDep = Start.IsCritical();
|
|
if (foundSolution)
|
|
{
|
|
// try propagating protected to this satisfied dependency
|
|
if (not IsCriticalDep)
|
|
continue;
|
|
auto const possibleSolutions = getAllPossibleSolutions(Cache, Start, End, APT::CacheSetHelper::CANDANDINST, false);
|
|
if (possibleSolutions.size() != 1)
|
|
continue;
|
|
auto const InstPkg = possibleSolutions.begin().ParentPkg();
|
|
if (Cache[InstPkg].Protect())
|
|
continue;
|
|
Cache.MarkProtected(InstPkg);
|
|
if (not Cache.MarkInstall(InstPkg, true, Depth + 1, false, ForceImportantDeps))
|
|
failedToInstallSomething = true;
|
|
continue;
|
|
}
|
|
|
|
/* Check if any ImportantDep() (but not Critical) were added
|
|
* since we installed the package. Also check for deps that
|
|
* were satisfied in the past: for instance, if a version
|
|
* restriction in a Recommends was tightened, upgrading the
|
|
* package should follow that Recommends rather than causing the
|
|
* dependency to be removed. (bug #470115)
|
|
*/
|
|
if (Pkg->CurrentVer != 0 && not ForceImportantDeps && not IsCriticalDep)
|
|
{
|
|
bool isNewImportantDep = true;
|
|
bool isPreviouslySatisfiedImportantDep = false;
|
|
for (pkgCache::DepIterator D = Pkg.CurrentVer().DependsList(); D.end() != true; ++D)
|
|
{
|
|
//FIXME: Should we handle or-group better here?
|
|
// We do not check if the package we look for is part of the same or-group
|
|
// we might find while searching, but could that really be a problem?
|
|
if (D.IsCritical() || not Cache.IsImportantDep(D) ||
|
|
Start.TargetPkg() != D.TargetPkg())
|
|
continue;
|
|
|
|
isNewImportantDep = false;
|
|
|
|
while ((D->CompareOp & pkgCache::Dep::Or) != 0)
|
|
++D;
|
|
|
|
isPreviouslySatisfiedImportantDep = ((Cache[D] & pkgDepCache::DepGNow) != 0);
|
|
if (isPreviouslySatisfiedImportantDep)
|
|
break;
|
|
}
|
|
|
|
if (isNewImportantDep)
|
|
{
|
|
if (DebugAutoInstall)
|
|
std::clog << OutputInDepth(Depth) << "new important dependency: "
|
|
<< Start.TargetPkg().FullName() << '\n';
|
|
}
|
|
else if (isPreviouslySatisfiedImportantDep)
|
|
{
|
|
if (DebugAutoInstall)
|
|
std::clog << OutputInDepth(Depth) << "previously satisfied important dependency on "
|
|
<< Start.TargetPkg().FullName() << '\n';
|
|
}
|
|
else
|
|
{
|
|
if (DebugAutoInstall)
|
|
std::clog << OutputInDepth(Depth) << "ignore old unsatisfied important dependency on "
|
|
<< Start.TargetPkg().FullName() << '\n';
|
|
continue;
|
|
}
|
|
}
|
|
|
|
auto const possibleSolutions = getAllPossibleSolutions(Cache, Start, End, APT::CacheSetHelper::CANDIDATE, true);
|
|
for (auto const &InstVer : possibleSolutions)
|
|
{
|
|
auto const InstPkg = InstVer.ParentPkg();
|
|
if (Cache[InstPkg].CandidateVer != InstVer)
|
|
continue;
|
|
if (DebugAutoInstall)
|
|
std::clog << OutputInDepth(Depth) << "Installing " << InstPkg.FullName()
|
|
<< " as " << End.DepType() << " of " << Pkg.FullName() << '\n';
|
|
if (propagateProtected && IsCriticalDep && possibleSolutions.size() == 1)
|
|
{
|
|
if (not Cache.MarkInstall(InstPkg, false, Depth + 1, false, ForceImportantDeps))
|
|
continue;
|
|
Cache.MarkProtected(InstPkg);
|
|
}
|
|
if (not Cache.MarkInstall(InstPkg, true, Depth + 1, false, ForceImportantDeps))
|
|
continue;
|
|
|
|
if (toMoveAuto != nullptr && InstPkg->CurrentVer == 0)
|
|
toMoveAuto->push_back(InstPkg);
|
|
|
|
foundSolution = true;
|
|
break;
|
|
}
|
|
if (DebugMarker && not foundSolution)
|
|
std::clog << OutputInDepth(Depth+1) << APT::PrettyDep(&Cache, Copy) << " can't be satisfied! (dep)\n";
|
|
if (not foundSolution && IsCriticalDep)
|
|
{
|
|
failedToInstallSomething = true;
|
|
if (not propagateProtected && not FromUser)
|
|
break;
|
|
}
|
|
}
|
|
toInstall.clear();
|
|
return not failedToInstallSomething;
|
|
}
|
|
/*}}}*/
|
|
// DepCache::MarkInstall - Put the package in the install state /*{{{*/
|
|
bool pkgDepCache::MarkInstall(PkgIterator const &Pkg, bool AutoInst,
|
|
unsigned long Depth, bool FromUser,
|
|
bool ForceImportantDeps)
|
|
{
|
|
StateCache &P = PkgState[Pkg->ID];
|
|
if (P.Protect() && P.Keep() && P.CandidateVer != nullptr && P.CandidateVer == Pkg.CurrentVer())
|
|
; // we are here to mark our dependencies as protected, no state is changed
|
|
else if (not IsModeChangeOk(*this, ModeInstall, Pkg, Depth, FromUser, DebugMarker))
|
|
return false;
|
|
|
|
|
|
// See if there is even any possible installation candidate
|
|
if (P.CandidateVer == 0)
|
|
return false;
|
|
|
|
// Check that it is not already marked for install and that it can be installed
|
|
if (not P.Protect() && not P.InstPolicyBroken() && not P.InstBroken())
|
|
{
|
|
if (P.CandidateVer == Pkg.CurrentVer())
|
|
{
|
|
if (P.InstallVer == 0)
|
|
return MarkKeep(Pkg, false, FromUser, Depth + 1);
|
|
return true;
|
|
}
|
|
else if (P.Mode == ModeInstall)
|
|
return true;
|
|
}
|
|
|
|
// check if we are allowed to install the package
|
|
if (not IsInstallOk(Pkg, AutoInst, Depth, FromUser))
|
|
return false;
|
|
|
|
ActionGroup group(*this);
|
|
if (FromUser && not MarkInstall_StateChange(Pkg, AutoInst, FromUser))
|
|
return false;
|
|
|
|
bool const AutoSolve = AutoInst && _config->Find("APT::Solver", "internal") == "internal";
|
|
bool const failEarly = not P.Protect() && not FromUser;
|
|
bool hasFailed = false;
|
|
|
|
std::vector<pkgCache::DepIterator> toInstall, toRemove;
|
|
APT::PackageVector toUpgrade, delayedRemove;
|
|
if (AutoSolve)
|
|
{
|
|
VerIterator const PV = P.CandidateVerIter(*this);
|
|
if (unlikely(PV.end()))
|
|
return false;
|
|
if (not MarkInstall_CollectDependencies(*this, PV, toInstall, toRemove))
|
|
return false;
|
|
|
|
if (not MarkInstall_RemoveConflictsIfNotUpgradeable(*this, DebugAutoInstall, PV, Depth, toRemove, toUpgrade, delayedRemove, P.Protect(), FromUser))
|
|
{
|
|
if (failEarly)
|
|
return false;
|
|
hasFailed = true;
|
|
}
|
|
if (not MarkInstall_CollectReverseDepends(*this, DebugAutoInstall, PV, Depth, toUpgrade, delayedRemove))
|
|
{
|
|
if (failEarly)
|
|
return false;
|
|
hasFailed = true;
|
|
}
|
|
}
|
|
|
|
if (not FromUser && not MarkInstall_StateChange(Pkg, AutoInst, FromUser))
|
|
return false;
|
|
|
|
if (not AutoSolve)
|
|
return not hasFailed;
|
|
|
|
if (DebugMarker)
|
|
std::clog << OutputInDepth(Depth) << "MarkInstall " << APT::PrettyPkg(this, Pkg) << " FU=" << FromUser << '\n';
|
|
|
|
class ScopedProtected
|
|
{
|
|
pkgDepCache::StateCache &P;
|
|
bool const already;
|
|
|
|
public:
|
|
ScopedProtected(pkgDepCache::StateCache &p) : P{p}, already{P.Protect()}
|
|
{
|
|
if (not already)
|
|
P.iFlags |= Protected;
|
|
}
|
|
~ScopedProtected()
|
|
{
|
|
if (not already)
|
|
P.iFlags &= (~Protected);
|
|
}
|
|
operator bool() noexcept { return already; }
|
|
} propagateProtected{PkgState[Pkg->ID]};
|
|
|
|
if (not MarkInstall_UpgradeOtherBinaries(*this, DebugAutoInstall, Depth, ForceImportantDeps, Pkg, P.CandidateVerIter(*this)))
|
|
return false;
|
|
if (not MarkInstall_UpgradeOrRemoveConflicts(*this, DebugAutoInstall, Depth, ForceImportantDeps, toUpgrade, propagateProtected, FromUser))
|
|
{
|
|
if (failEarly)
|
|
{
|
|
MarkInstall_DiscardInstall(Pkg);
|
|
return false;
|
|
}
|
|
hasFailed = true;
|
|
}
|
|
|
|
bool const MoveAutoBitToDependencies = [&]() {
|
|
VerIterator const PV = P.InstVerIter(*this);
|
|
if (unlikely(PV.end()))
|
|
return false;
|
|
if (PV->Section == 0 || (P.Flags & Flag::Auto) == Flag::Auto)
|
|
return false;
|
|
VerIterator const CurVer = Pkg.CurrentVer();
|
|
if (not CurVer.end() && CurVer->Section != 0 && strcmp(CurVer.Section(), PV.Section()) != 0)
|
|
{
|
|
bool const CurVerInMoveSection = _config->SectionInSubTree("APT::Move-Autobit-Sections", CurVer.Section());
|
|
bool const InstVerInMoveSection = _config->SectionInSubTree("APT::Move-Autobit-Sections", PV.Section());
|
|
return (not CurVerInMoveSection && InstVerInMoveSection);
|
|
}
|
|
return false;
|
|
}();
|
|
|
|
APT::PackageVector toMoveAuto;
|
|
if (not MarkInstall_InstallDependencies(*this, DebugAutoInstall, DebugMarker, Pkg, Depth, ForceImportantDeps, toInstall,
|
|
MoveAutoBitToDependencies ? &toMoveAuto : nullptr, propagateProtected, FromUser))
|
|
{
|
|
if (failEarly)
|
|
{
|
|
MarkInstall_DiscardInstall(Pkg);
|
|
return false;
|
|
}
|
|
hasFailed = true;
|
|
}
|
|
|
|
for (auto const &R : delayedRemove)
|
|
{
|
|
if (not MarkDelete(R, false, Depth, false))
|
|
{
|
|
if (failEarly)
|
|
{
|
|
MarkInstall_DiscardInstall(Pkg);
|
|
return false;
|
|
}
|
|
hasFailed = true;
|
|
}
|
|
}
|
|
|
|
if (MoveAutoBitToDependencies)
|
|
{
|
|
if (DebugAutoInstall)
|
|
std::clog << OutputInDepth(Depth) << "Setting " << Pkg.FullName(false) << " as auto-installed, moving manual to its dependencies" << std::endl;
|
|
MarkAuto(Pkg, true);
|
|
for (auto const &InstPkg : toMoveAuto)
|
|
{
|
|
if (DebugAutoInstall)
|
|
std::clog << OutputInDepth(Depth) << "Setting " << InstPkg.FullName(false) << " NOT as auto-installed (dependency"
|
|
<< " of " << Pkg.FullName(false) << " which is manual and in APT::Move-Autobit-Sections)\n";
|
|
MarkAuto(InstPkg, false);
|
|
}
|
|
}
|
|
return not hasFailed;
|
|
}
|
|
/*}}}*/
|
|
// DepCache::IsInstallOk - check if it is ok to install this package /*{{{*/
|
|
// ---------------------------------------------------------------------
|
|
/* The default implementation checks if the installation of an M-A:same
|
|
package would lead us into a version-screw and if so forbids it.
|
|
dpkg holds are enforced by the private IsModeChangeOk */
|
|
bool pkgDepCache::IsInstallOk(PkgIterator const &Pkg,bool AutoInst,
|
|
unsigned long Depth, bool FromUser)
|
|
{
|
|
return IsInstallOkMultiArchSameVersionSynced(Pkg,AutoInst, Depth, FromUser) &&
|
|
IsInstallOkDependenciesSatisfiableByCandidates(Pkg,AutoInst, Depth, FromUser);
|
|
}
|
|
bool pkgDepCache::IsInstallOkMultiArchSameVersionSynced(PkgIterator const &Pkg,
|
|
bool const /*AutoInst*/, unsigned long const Depth, bool const FromUser)
|
|
{
|
|
if (FromUser == true) // as always: user is always right
|
|
return true;
|
|
|
|
// if we have checked before and it was okay, it will still be okay
|
|
if (PkgState[Pkg->ID].Mode == ModeInstall &&
|
|
PkgState[Pkg->ID].InstallVer == PkgState[Pkg->ID].CandidateVer)
|
|
return true;
|
|
|
|
// ignore packages with none-M-A:same candidates
|
|
VerIterator const CandVer = PkgState[Pkg->ID].CandidateVerIter(*this);
|
|
if (unlikely(CandVer.end() == true) || CandVer == Pkg.CurrentVer() ||
|
|
(CandVer->MultiArch & pkgCache::Version::Same) != pkgCache::Version::Same)
|
|
return true;
|
|
|
|
GrpIterator const Grp = Pkg.Group();
|
|
for (PkgIterator P = Grp.PackageList(); P.end() == false; P = Grp.NextPkg(P))
|
|
{
|
|
// not installed or self-check: fine by definition
|
|
if (P->CurrentVer == 0 || P == Pkg)
|
|
continue;
|
|
|
|
// not having a candidate or being in sync
|
|
// (simple string-compare as stuff like '1' == '0:1-0' can't happen here)
|
|
VerIterator CV = PkgState[P->ID].CandidateVerIter(*this);
|
|
if (CV.end() == true || strcmp(CandVer.VerStr(), CV.VerStr()) == 0)
|
|
continue;
|
|
|
|
// packages losing M-A:same can be out-of-sync
|
|
if ((CV->MultiArch & pkgCache::Version::Same) != pkgCache::Version::Same)
|
|
continue;
|
|
|
|
// not downloadable means the package is obsolete, so allow out-of-sync
|
|
if (CV.Downloadable() == false)
|
|
continue;
|
|
|
|
PkgState[Pkg->ID].iFlags |= AutoKept;
|
|
if (unlikely(DebugMarker == true))
|
|
std::clog << OutputInDepth(Depth) << "Ignore MarkInstall of " << APT::PrettyPkg(this, Pkg)
|
|
<< " as it is not in sync with its M-A:same sibling " << APT::PrettyPkg(this, P)
|
|
<< " (" << CandVer.VerStr() << " != " << CV.VerStr() << ")" << std::endl;
|
|
return false;
|
|
}
|
|
|
|
return true;
|
|
}
|
|
bool pkgDepCache::IsInstallOkDependenciesSatisfiableByCandidates(PkgIterator const &Pkg,
|
|
bool const AutoInst, unsigned long const Depth, bool const /*FromUser*/)
|
|
{
|
|
if (AutoInst == false)
|
|
return true;
|
|
|
|
VerIterator const CandVer = PkgState[Pkg->ID].CandidateVerIter(*this);
|
|
if (unlikely(CandVer.end() == true) || CandVer == Pkg.CurrentVer())
|
|
return true;
|
|
|
|
for (DepIterator Dep = CandVer.DependsList(); Dep.end() != true;)
|
|
{
|
|
DepIterator Start = Dep;
|
|
bool foundSolution = false;
|
|
unsigned Ors = 0;
|
|
// Is it possible to satisfy this dependency?
|
|
for (bool LastOR = true; not Dep.end() && LastOR; ++Dep, ++Ors)
|
|
{
|
|
LastOR = (Dep->CompareOp & Dep::Or) == Dep::Or;
|
|
|
|
if ((DepState[Dep->ID] & (DepInstall | DepCVer)) != 0)
|
|
foundSolution = true;
|
|
}
|
|
|
|
if (foundSolution || not Start.IsCritical() || Start.IsNegative())
|
|
continue;
|
|
|
|
if (DebugAutoInstall == true)
|
|
std::clog << OutputInDepth(Depth) << APT::PrettyDep(this, Start) << " can't be satisfied!" << std::endl;
|
|
|
|
// the dependency is critical, but can't be installed, so discard the candidate
|
|
// as the problemresolver will trip over it otherwise trying to install it (#735967)
|
|
StateCache &State = PkgState[Pkg->ID];
|
|
if (not State.Protect())
|
|
{
|
|
if (Pkg->CurrentVer != 0)
|
|
SetCandidateVersion(Pkg.CurrentVer());
|
|
else
|
|
State.CandidateVer = nullptr;
|
|
if (not State.Delete())
|
|
{
|
|
State.Mode = ModeKeep;
|
|
State.Update(Pkg, *this);
|
|
}
|
|
}
|
|
return false;
|
|
}
|
|
|
|
return true;
|
|
}
|
|
/*}}}*/
|
|
// DepCache::SetReInstall - Set the reinstallation flag /*{{{*/
|
|
// ---------------------------------------------------------------------
|
|
/* */
|
|
void pkgDepCache::SetReInstall(PkgIterator const &Pkg,bool To)
|
|
{
|
|
if (unlikely(Pkg.end() == true))
|
|
return;
|
|
|
|
APT::PackageList pkglist;
|
|
if (Pkg->CurrentVer != 0 &&
|
|
(Pkg.CurrentVer()-> MultiArch & pkgCache::Version::Same) == pkgCache::Version::Same)
|
|
{
|
|
pkgCache::GrpIterator Grp = Pkg.Group();
|
|
for (pkgCache::PkgIterator P = Grp.PackageList(); P.end() == false; P = Grp.NextPkg(P))
|
|
{
|
|
if (P->CurrentVer != 0)
|
|
pkglist.insert(P);
|
|
}
|
|
}
|
|
else
|
|
pkglist.insert(Pkg);
|
|
|
|
ActionGroup group(*this);
|
|
|
|
for (APT::PackageList::const_iterator Pkg = pkglist.begin(); Pkg != pkglist.end(); ++Pkg)
|
|
{
|
|
RemoveSizes(Pkg);
|
|
RemoveStates(Pkg);
|
|
|
|
StateCache &P = PkgState[Pkg->ID];
|
|
if (To == true)
|
|
P.iFlags |= ReInstall;
|
|
else
|
|
P.iFlags &= ~ReInstall;
|
|
|
|
AddStates(Pkg);
|
|
AddSizes(Pkg);
|
|
}
|
|
}
|
|
/*}}}*/
|
|
pkgCache::VerIterator pkgDepCache::GetCandidateVersion(PkgIterator const &Pkg)/*{{{*/
|
|
{
|
|
return PkgState[Pkg->ID].CandidateVerIter(*this);
|
|
}
|
|
/*}}}*/
|
|
// DepCache::SetCandidateVersion - Change the candidate version /*{{{*/
|
|
// ---------------------------------------------------------------------
|
|
/* */
|
|
void pkgDepCache::SetCandidateVersion(VerIterator TargetVer)
|
|
{
|
|
pkgCache::PkgIterator Pkg = TargetVer.ParentPkg();
|
|
StateCache &P = PkgState[Pkg->ID];
|
|
|
|
if (P.CandidateVer == TargetVer)
|
|
return;
|
|
|
|
ActionGroup group(*this);
|
|
|
|
RemoveSizes(Pkg);
|
|
RemoveStates(Pkg);
|
|
|
|
if (P.CandidateVer == P.InstallVer && P.Install() == true)
|
|
P.InstallVer = (Version *)TargetVer;
|
|
P.CandidateVer = (Version *)TargetVer;
|
|
P.Update(Pkg,*this);
|
|
|
|
AddStates(Pkg);
|
|
Update(Pkg);
|
|
AddSizes(Pkg);
|
|
|
|
}
|
|
/*}}}*/
|
|
// DepCache::SetCandidateRelease - Change the candidate version /*{{{*/
|
|
// ---------------------------------------------------------------------
|
|
/* changes the candidate of a package and walks over all its dependencies
|
|
to check if it needs to change the candidate of the dependency, too,
|
|
to reach a installable versionstate */
|
|
bool pkgDepCache::SetCandidateRelease(pkgCache::VerIterator TargetVer,
|
|
std::string const &TargetRel)
|
|
{
|
|
std::list<std::pair<pkgCache::VerIterator, pkgCache::VerIterator> > Changed;
|
|
return SetCandidateRelease(TargetVer, TargetRel, Changed);
|
|
}
|
|
bool pkgDepCache::SetCandidateRelease(pkgCache::VerIterator TargetVer,
|
|
std::string const &TargetRel,
|
|
std::list<std::pair<pkgCache::VerIterator, pkgCache::VerIterator> > &Changed)
|
|
{
|
|
ActionGroup group(*this);
|
|
SetCandidateVersion(TargetVer);
|
|
|
|
if (TargetRel == "installed" || TargetRel == "candidate") // both doesn't make sense in this context
|
|
return true;
|
|
|
|
pkgVersionMatch Match(TargetRel, pkgVersionMatch::Release);
|
|
// save the position of the last element we will not undo - if we have to
|
|
std::list<std::pair<pkgCache::VerIterator, pkgCache::VerIterator> >::iterator newChanged = --(Changed.end());
|
|
|
|
for (pkgCache::DepIterator D = TargetVer.DependsList(); D.end() == false; ++D)
|
|
{
|
|
if (D->Type != pkgCache::Dep::PreDepends && D->Type != pkgCache::Dep::Depends &&
|
|
((D->Type != pkgCache::Dep::Recommends && D->Type != pkgCache::Dep::Suggests) ||
|
|
IsImportantDep(D) == false))
|
|
continue;
|
|
|
|
// walk over an or-group and check if we need to do anything
|
|
// for simpilicity no or-group is handled as a or-group including one dependency
|
|
pkgCache::DepIterator Start = D;
|
|
bool itsFine = false;
|
|
for (bool stillOr = true; stillOr == true; ++Start)
|
|
{
|
|
stillOr = (Start->CompareOp & Dep::Or) == Dep::Or;
|
|
pkgCache::PkgIterator const P = Start.TargetPkg();
|
|
// virtual packages can't be a solution
|
|
if (P.end() == true || (P->ProvidesList == 0 && P->VersionList == 0))
|
|
continue;
|
|
// if its already installed, check if this one is good enough
|
|
pkgCache::VerIterator const Now = P.CurrentVer();
|
|
if (Now.end() == false && Start.IsSatisfied(Now))
|
|
{
|
|
itsFine = true;
|
|
break;
|
|
}
|
|
pkgCache::VerIterator const Cand = PkgState[P->ID].CandidateVerIter(*this);
|
|
// no versioned dependency - but is it installable?
|
|
if (Start.TargetVer() == 0 || Start.TargetVer()[0] == '\0')
|
|
{
|
|
// Check if one of the providers is installable
|
|
if (P->ProvidesList != 0)
|
|
{
|
|
pkgCache::PrvIterator Prv = P.ProvidesList();
|
|
for (; Prv.end() == false; ++Prv)
|
|
{
|
|
pkgCache::VerIterator const C = PkgState[Prv.OwnerPkg()->ID].CandidateVerIter(*this);
|
|
if (C.end() == true || C != Prv.OwnerVer() ||
|
|
(VersionState(C.DependsList(), DepInstall, DepCandMin, DepCandPolicy) & DepCandMin) != DepCandMin)
|
|
continue;
|
|
break;
|
|
}
|
|
if (Prv.end() == true)
|
|
continue;
|
|
}
|
|
// no providers, so check if we have an installable candidate version
|
|
else if (Cand.end() == true ||
|
|
(VersionState(Cand.DependsList(), DepInstall, DepCandMin, DepCandPolicy) & DepCandMin) != DepCandMin)
|
|
continue;
|
|
itsFine = true;
|
|
break;
|
|
}
|
|
if (Cand.end() == true)
|
|
continue;
|
|
// check if the current candidate is enough for the versioned dependency - and installable?
|
|
if (Start.IsSatisfied(Cand) == true &&
|
|
(VersionState(Cand.DependsList(), DepInstall, DepCandMin, DepCandPolicy) & DepCandMin) == DepCandMin)
|
|
{
|
|
itsFine = true;
|
|
break;
|
|
}
|
|
}
|
|
|
|
if (itsFine == true) {
|
|
// something in the or-group was fine, skip all other members
|
|
for (; (D->CompareOp & Dep::Or) == Dep::Or; ++D);
|
|
continue;
|
|
}
|
|
|
|
// walk again over the or-group and check each if a candidate switch would help
|
|
itsFine = false;
|
|
for (bool stillOr = true; stillOr == true; ++D)
|
|
{
|
|
stillOr = (D->CompareOp & Dep::Or) == Dep::Or;
|
|
// changing candidate will not help if the dependency is not versioned
|
|
if (D.TargetVer() == 0 || D.TargetVer()[0] == '\0')
|
|
{
|
|
if (stillOr == true)
|
|
continue;
|
|
break;
|
|
}
|
|
|
|
pkgCache::VerIterator V;
|
|
if (TargetRel == "newest")
|
|
V = D.TargetPkg().VersionList();
|
|
else
|
|
V = Match.Find(D.TargetPkg());
|
|
|
|
// check if the version from this release could satisfy the dependency
|
|
if (V.end() == true || D.IsSatisfied(V) == false)
|
|
{
|
|
if (stillOr == true)
|
|
continue;
|
|
break;
|
|
}
|
|
|
|
pkgCache::VerIterator oldCand = PkgState[D.TargetPkg()->ID].CandidateVerIter(*this);
|
|
if (V == oldCand)
|
|
{
|
|
// Do we already touched this Version? If so, their versioned dependencies are okay, no need to check again
|
|
for (std::list<std::pair<pkgCache::VerIterator, pkgCache::VerIterator> >::const_iterator c = Changed.begin();
|
|
c != Changed.end(); ++c)
|
|
{
|
|
if (c->first->ParentPkg != V->ParentPkg)
|
|
continue;
|
|
itsFine = true;
|
|
break;
|
|
}
|
|
}
|
|
|
|
if (itsFine == false)
|
|
{
|
|
// change the candidate
|
|
Changed.emplace_back(V, TargetVer);
|
|
if (SetCandidateRelease(V, TargetRel, Changed) == false)
|
|
{
|
|
if (stillOr == false)
|
|
break;
|
|
// undo the candidate changing
|
|
SetCandidateVersion(oldCand);
|
|
Changed.pop_back();
|
|
continue;
|
|
}
|
|
itsFine = true;
|
|
}
|
|
|
|
// something in the or-group was fine, skip all other members
|
|
for (; (D->CompareOp & Dep::Or) == Dep::Or; ++D);
|
|
break;
|
|
}
|
|
|
|
if (itsFine == false && (D->Type == pkgCache::Dep::PreDepends || D->Type == pkgCache::Dep::Depends))
|
|
{
|
|
// undo all changes which aren't lead to a solution
|
|
for (std::list<std::pair<pkgCache::VerIterator, pkgCache::VerIterator> >::const_iterator c = ++newChanged;
|
|
c != Changed.end(); ++c)
|
|
SetCandidateVersion(c->first);
|
|
Changed.erase(newChanged, Changed.end());
|
|
return false;
|
|
}
|
|
}
|
|
return true;
|
|
}
|
|
/*}}}*/
|
|
// DepCache::MarkAuto - set the Auto flag for a package /*{{{*/
|
|
// ---------------------------------------------------------------------
|
|
/* */
|
|
void pkgDepCache::MarkAuto(const PkgIterator &Pkg, bool Auto)
|
|
{
|
|
StateCache &state = PkgState[Pkg->ID];
|
|
|
|
ActionGroup group(*this);
|
|
|
|
if(Auto)
|
|
state.Flags |= Flag::Auto;
|
|
else
|
|
state.Flags &= ~Flag::Auto;
|
|
}
|
|
/*}}}*/
|
|
// StateCache::Update - Compute the various static display things /*{{{*/
|
|
// ---------------------------------------------------------------------
|
|
/* This is called whenever the Candidate version changes. */
|
|
void pkgDepCache::StateCache::Update(PkgIterator Pkg,pkgCache &Cache)
|
|
{
|
|
// Some info
|
|
VerIterator Ver = CandidateVerIter(Cache);
|
|
|
|
// Use a null string or the version string
|
|
if (Ver.end() == true)
|
|
CandVersion = "";
|
|
else
|
|
CandVersion = Ver.VerStr();
|
|
|
|
// Find the current version
|
|
if (Pkg->CurrentVer != 0)
|
|
CurVersion = Pkg.CurrentVer().VerStr();
|
|
else
|
|
CurVersion = "";
|
|
|
|
// Figure out if its up or down or equal
|
|
if (Pkg->CurrentVer == 0 || Pkg->VersionList == 0 || CandidateVer == 0)
|
|
Status = 2;
|
|
else
|
|
Status = Ver.CompareVer(Pkg.CurrentVer());
|
|
}
|
|
/*}}}*/
|
|
// Policy::GetCandidateVer - Returns the Candidate install version /*{{{*/
|
|
// ---------------------------------------------------------------------
|
|
/* The default just returns the highest available version that is not
|
|
a source and automatic. */
|
|
pkgCache::VerIterator pkgDepCache::Policy::GetCandidateVer(PkgIterator const &Pkg)
|
|
{
|
|
/* Not source/not automatic versions cannot be a candidate version
|
|
unless they are already installed */
|
|
VerIterator Last;
|
|
|
|
for (VerIterator I = Pkg.VersionList(); I.end() == false; ++I)
|
|
{
|
|
if (Pkg.CurrentVer() == I)
|
|
return I;
|
|
|
|
for (VerFileIterator J = I.FileList(); J.end() == false; ++J)
|
|
{
|
|
if (J.File().Flagged(Flag::NotSource))
|
|
continue;
|
|
|
|
/* Stash the highest version of a not-automatic source, we use it
|
|
if there is nothing better */
|
|
if (J.File().Flagged(Flag::NotAutomatic) ||
|
|
J.File().Flagged(Flag::ButAutomaticUpgrades))
|
|
{
|
|
if (Last.end() == true)
|
|
Last = I;
|
|
continue;
|
|
}
|
|
|
|
return I;
|
|
}
|
|
}
|
|
|
|
return Last;
|
|
}
|
|
/*}}}*/
|
|
// Policy::IsImportantDep - True if the dependency is important /*{{{*/
|
|
// ---------------------------------------------------------------------
|
|
/* */
|
|
bool pkgDepCache::Policy::IsImportantDep(DepIterator const &Dep) const
|
|
{
|
|
if(Dep.IsCritical())
|
|
return true;
|
|
else if(Dep->Type == pkgCache::Dep::Recommends)
|
|
{
|
|
if (InstallRecommends)
|
|
return true;
|
|
// we support a special mode to only install-recommends for certain
|
|
// sections
|
|
// FIXME: this is a meant as a temporary solution until the
|
|
// recommends are cleaned up
|
|
const char *sec = Dep.ParentVer().Section();
|
|
if (sec && _config->SectionInSubTree("APT::Install-Recommends-Sections", sec))
|
|
return true;
|
|
}
|
|
else if(Dep->Type == pkgCache::Dep::Suggests)
|
|
return InstallSuggests;
|
|
|
|
return false;
|
|
}
|
|
/*}}}*/
|
|
// Policy::GetPriority - Get the priority of the package pin /*{{{*/
|
|
APT_PURE signed short pkgDepCache::Policy::GetPriority(pkgCache::PkgIterator const &/*Pkg*/)
|
|
{ return 0; }
|
|
APT_PURE signed short pkgDepCache::Policy::GetPriority(pkgCache::VerIterator const &/*Ver*/, bool /*ConsiderFiles*/)
|
|
{ return 0; }
|
|
APT_PURE signed short pkgDepCache::Policy::GetPriority(pkgCache::PkgFileIterator const &/*File*/)
|
|
{ return 0; }
|
|
/*}}}*/
|
|
pkgDepCache::InRootSetFunc *pkgDepCache::GetRootSetFunc() /*{{{*/
|
|
{
|
|
DefaultRootSetFunc *f = new DefaultRootSetFunc2(&GetCache());
|
|
if (f->wasConstructedSuccessfully())
|
|
return f;
|
|
else
|
|
{
|
|
delete f;
|
|
return NULL;
|
|
}
|
|
}
|
|
|
|
pkgDepCache::InRootSetFunc *pkgDepCache::GetCachedRootSetFunc()
|
|
{
|
|
if (d->inRootSetFunc == nullptr)
|
|
d->inRootSetFunc.reset(GetRootSetFunc());
|
|
return d->inRootSetFunc.get();
|
|
}
|
|
/*}}}*/
|
|
bool pkgDepCache::MarkFollowsRecommends() /*{{{*/
|
|
{
|
|
return _config->FindB("APT::AutoRemove::RecommendsImportant", true);
|
|
}
|
|
/*}}}*/
|
|
bool pkgDepCache::MarkFollowsSuggests() /*{{{*/
|
|
{
|
|
return _config->FindB("APT::AutoRemove::SuggestsImportant", true);
|
|
}
|
|
/*}}}*/
|
|
static bool IsPkgInBoringState(pkgCache::PkgIterator const &Pkg, pkgDepCache::StateCache const * const PkgState)/*{{{*/
|
|
{
|
|
if (Pkg->CurrentVer == 0)
|
|
{
|
|
if (PkgState[Pkg->ID].Keep())
|
|
return true;
|
|
}
|
|
else
|
|
{
|
|
if (PkgState[Pkg->ID].Delete())
|
|
return true;
|
|
}
|
|
return false;
|
|
}
|
|
/*}}}*/
|
|
// MarkPackage - mark a single package in Mark-and-Sweep /*{{{*/
|
|
static bool MarkPackage(pkgCache::PkgIterator const &Pkg,
|
|
pkgCache::VerIterator const &Ver,
|
|
bool const follow_recommends,
|
|
bool const follow_suggests,
|
|
bool const debug_autoremove,
|
|
std::string_view const reason,
|
|
size_t const Depth,
|
|
pkgCache &Cache,
|
|
pkgDepCache &DepCache,
|
|
pkgDepCache::StateCache *const PkgState,
|
|
std::vector<bool> &fullyExplored,
|
|
std::unique_ptr<APT::CacheFilter::Matcher> &IsAVersionedKernelPackage,
|
|
std::unique_ptr<APT::CacheFilter::Matcher> &IsProtectedKernelPackage)
|
|
{
|
|
if (Ver.end() || PkgState[Pkg->ID].Marked)
|
|
return true;
|
|
|
|
if (IsPkgInBoringState(Pkg, PkgState))
|
|
{
|
|
fullyExplored[Pkg->ID] = true;
|
|
return true;
|
|
}
|
|
|
|
// we are not trying too hard…
|
|
if (unlikely(Depth > 3000))
|
|
return false;
|
|
|
|
PkgState[Pkg->ID].Marked = true;
|
|
if(debug_autoremove)
|
|
std::clog << "Marking: " << Pkg.FullName() << " " << Ver.VerStr()
|
|
<< " (" << reason << ")" << std::endl;
|
|
|
|
auto const sort_by_source_version = [](pkgCache::VerIterator const &A, pkgCache::VerIterator const &B) {
|
|
auto const verret = A.Cache()->VS->CmpVersion(A.SourceVerStr(), B.SourceVerStr());
|
|
if (verret != 0)
|
|
return verret < 0;
|
|
return A->ID < B->ID;
|
|
};
|
|
|
|
for (auto D = Ver.DependsList(); not D.end(); ++D)
|
|
{
|
|
auto const T = D.TargetPkg();
|
|
if (T.end() || fullyExplored[T->ID])
|
|
continue;
|
|
|
|
if (D->Type != pkgCache::Dep::Depends &&
|
|
D->Type != pkgCache::Dep::PreDepends &&
|
|
(not follow_recommends || D->Type != pkgCache::Dep::Recommends) &&
|
|
(not follow_suggests || D->Type != pkgCache::Dep::Suggests))
|
|
continue;
|
|
|
|
bool unsatisfied_choice = false;
|
|
std::unordered_map<std::string, APT::VersionVector> providers_by_source;
|
|
// collect real part
|
|
if (not IsPkgInBoringState(T, PkgState))
|
|
{
|
|
auto const TV = (PkgState[T->ID].Install()) ? PkgState[T->ID].InstVerIter(DepCache) : T.CurrentVer();
|
|
if (likely(not TV.end()))
|
|
{
|
|
if (not D.IsSatisfied(TV))
|
|
unsatisfied_choice = true;
|
|
else
|
|
providers_by_source[TV.SourcePkgName()].push_back(TV);
|
|
}
|
|
}
|
|
if (providers_by_source.empty() && not unsatisfied_choice)
|
|
PkgState[T->ID].Marked = true;
|
|
// collect virtual part
|
|
for (auto Prv = T.ProvidesList(); not Prv.end(); ++Prv)
|
|
{
|
|
auto const PP = Prv.OwnerPkg();
|
|
if (IsPkgInBoringState(PP, PkgState))
|
|
continue;
|
|
|
|
// we want to ignore provides from uninteresting versions
|
|
auto const PV = (PkgState[PP->ID].Install()) ?
|
|
PkgState[PP->ID].InstVerIter(DepCache) : PP.CurrentVer();
|
|
if (unlikely(PV.end()) || PV != Prv.OwnerVer())
|
|
continue;
|
|
|
|
if (not D.IsSatisfied(Prv))
|
|
unsatisfied_choice = true;
|
|
else
|
|
providers_by_source[PV.SourcePkgName()].push_back(PV);
|
|
}
|
|
// only latest binary package of a source package is marked instead of all
|
|
for (auto &providers : providers_by_source)
|
|
{
|
|
auto const highestSrcVer = (*std::max_element(providers.second.begin(), providers.second.end(), sort_by_source_version)).SourceVerStr();
|
|
providers.second.erase(std::remove_if(providers.second.begin(), providers.second.end(), [&](auto const &V) { return strcmp(highestSrcVer, V.SourceVerStr()) != 0; }), providers.second.end());
|
|
// if the provider is a versioned kernel package mark them only for protected kernels
|
|
if (providers.second.size() == 1)
|
|
continue;
|
|
if (not IsAVersionedKernelPackage)
|
|
IsAVersionedKernelPackage = [&]() -> std::unique_ptr<APT::CacheFilter::Matcher> {
|
|
auto const patterns = _config->FindVector("APT::VersionedKernelPackages");
|
|
if (patterns.empty())
|
|
return std::make_unique<APT::CacheFilter::FalseMatcher>();
|
|
std::ostringstream regex;
|
|
regex << '^';
|
|
std::copy(patterns.begin(), patterns.end() - 1, std::ostream_iterator<std::string>(regex, "-.*$|^"));
|
|
regex << patterns.back() << "-.*$";
|
|
return std::make_unique<APT::CacheFilter::PackageNameMatchesRegEx>(regex.str());
|
|
}();
|
|
if (not std::all_of(providers.second.begin(), providers.second.end(), [&](auto const &Prv) { return (*IsAVersionedKernelPackage)(Prv.ParentPkg()); }))
|
|
continue;
|
|
// … if there is at least one for protected kernels installed
|
|
if (not IsProtectedKernelPackage)
|
|
IsProtectedKernelPackage = APT::KernelAutoRemoveHelper::GetProtectedKernelsFilter(&Cache);
|
|
if (not std::any_of(providers.second.begin(), providers.second.end(), [&](auto const &Prv) { return (*IsProtectedKernelPackage)(Prv.ParentPkg()); }))
|
|
continue;
|
|
providers.second.erase(std::remove_if(providers.second.begin(), providers.second.end(),
|
|
[&](auto const &Prv) { return not((*IsProtectedKernelPackage)(Prv.ParentPkg())); }),
|
|
providers.second.end());
|
|
}
|
|
|
|
if (not unsatisfied_choice)
|
|
fullyExplored[T->ID] = true;
|
|
|
|
// do not follow newly installed providers if we have already installed providers
|
|
if (providers_by_source.size() >= 2)
|
|
{
|
|
if (std::any_of(providers_by_source.begin(), providers_by_source.end(), [](auto const PV) {
|
|
return std::any_of(PV.second.begin(), PV.second.end(), [](auto const &Prv) {
|
|
auto const PP = Prv.ParentPkg();
|
|
return not PP.end() && PP->CurrentVer != 0;
|
|
});}))
|
|
{
|
|
for (auto &providers : providers_by_source)
|
|
providers.second.erase(std::remove_if(providers.second.begin(), providers.second.end(),
|
|
[](auto const &Prv) {
|
|
auto const PP = Prv.ParentPkg();
|
|
return not PP.end() && PP->CurrentVer == 0;
|
|
}), providers.second.end());
|
|
}
|
|
}
|
|
|
|
for (auto const &providers : providers_by_source)
|
|
{
|
|
for (auto const &PV : providers.second)
|
|
{
|
|
auto const PP = PV.ParentPkg();
|
|
if (debug_autoremove)
|
|
std::clog << "Following dep: " << APT::PrettyDep(&DepCache, D)
|
|
<< ", provided by " << PP.FullName() << " " << PV.VerStr()
|
|
<< " (" << providers_by_source.size() << "/" << providers.second.size() << ")\n";
|
|
if (not MarkPackage(PP, PV, follow_recommends, follow_suggests, debug_autoremove,
|
|
"Dependency", Depth + 1, Cache, DepCache, PkgState, fullyExplored,
|
|
IsAVersionedKernelPackage, IsProtectedKernelPackage))
|
|
return false;
|
|
}
|
|
}
|
|
}
|
|
return true;
|
|
}
|
|
/*}}}*/
|
|
// pkgDepCache::MarkRequired - the main mark algorithm /*{{{*/
|
|
bool pkgDepCache::MarkRequired(InRootSetFunc &userFunc)
|
|
{
|
|
if (_config->Find("APT::Solver", "internal") != "internal" && _config->Find("APT::Solver") != "3.0")
|
|
return true;
|
|
|
|
// init the states
|
|
auto const PackagesCount = Head().PackageCount;
|
|
for(auto i = decltype(PackagesCount){0}; i < PackagesCount; ++i)
|
|
{
|
|
PkgState[i].Marked = false;
|
|
PkgState[i].Garbage = false;
|
|
}
|
|
std::vector<bool> fullyExplored(PackagesCount, false);
|
|
|
|
bool const debug_autoremove = _config->FindB("Debug::pkgAutoRemove", false);
|
|
if (debug_autoremove)
|
|
for(PkgIterator p = PkgBegin(); !p.end(); ++p)
|
|
if(PkgState[p->ID].Flags & Flag::Auto)
|
|
std::clog << "AutoDep: " << p.FullName() << std::endl;
|
|
|
|
bool const follow_recommends = MarkFollowsRecommends();
|
|
bool const follow_suggests = MarkFollowsSuggests();
|
|
|
|
// do the mark part, this is the core bit of the algorithm
|
|
for (PkgIterator P = PkgBegin(); !P.end(); ++P)
|
|
{
|
|
if (PkgState[P->ID].Marked || IsPkgInBoringState(P, PkgState))
|
|
continue;
|
|
|
|
std::string_view reason;
|
|
if ((PkgState[P->ID].Flags & Flag::Auto) == 0)
|
|
reason = "Manual-Installed";
|
|
else if (P->Flags & Flag::Essential)
|
|
reason = "Essential";
|
|
else if (P->Flags & Flag::Important)
|
|
reason = "Important";
|
|
else if (P->CurrentVer != 0 && P.CurrentVer()->Priority == pkgCache::State::Required)
|
|
reason = "Required";
|
|
else if (userFunc.InRootSet(P))
|
|
reason = "Blacklisted [APT::NeverAutoRemove]";
|
|
else if (not IsModeChangeOk(*this, ModeGarbage, P, 0, false, DebugMarker))
|
|
reason = "Hold";
|
|
else
|
|
continue;
|
|
|
|
pkgCache::VerIterator const PV = (PkgState[P->ID].Install()) ? PkgState[P->ID].InstVerIter(*this) : P.CurrentVer();
|
|
if (not MarkPackage(P, PV, follow_recommends, follow_suggests, debug_autoremove,
|
|
reason, 0, *Cache, *this, PkgState, fullyExplored,
|
|
d->IsAVersionedKernelPackage, d->IsProtectedKernelPackage))
|
|
return false;
|
|
}
|
|
return true;
|
|
}
|
|
/*}}}*/
|
|
bool pkgDepCache::Sweep() /*{{{*/
|
|
{
|
|
bool debug_autoremove = _config->FindB("Debug::pkgAutoRemove",false);
|
|
|
|
// do the sweep
|
|
for(PkgIterator p=PkgBegin(); !p.end(); ++p)
|
|
{
|
|
StateCache &state=PkgState[p->ID];
|
|
|
|
// skip required packages
|
|
if (!p.CurrentVer().end() &&
|
|
(p.CurrentVer()->Priority == pkgCache::State::Required))
|
|
continue;
|
|
|
|
// if it is not marked and it is installed, it's garbage
|
|
if(!state.Marked && (!p.CurrentVer().end() || state.Install()))
|
|
{
|
|
state.Garbage=true;
|
|
if(debug_autoremove)
|
|
std::clog << "Garbage: " << p.FullName() << std::endl;
|
|
}
|
|
}
|
|
|
|
return true;
|
|
}
|
|
/*}}}*/
|
|
// DepCache::MarkAndSweep /*{{{*/
|
|
bool pkgDepCache::MarkAndSweep(InRootSetFunc &rootFunc)
|
|
{
|
|
return MarkRequired(rootFunc) && Sweep();
|
|
}
|
|
bool pkgDepCache::MarkAndSweep()
|
|
{
|
|
InRootSetFunc *f(GetCachedRootSetFunc());
|
|
if (f != NULL)
|
|
return MarkAndSweep(*f);
|
|
else
|
|
return false;
|
|
}
|
|
/*}}}*/
|
|
|
|
// DepCache::PhasingApplied /*{{{*/
|
|
// Check if this version is a phased update that should be ignored, not considering whether
|
|
// it is a security update.
|
|
static bool IsIgnoredPhasedUpdate(std::string machineID, pkgCache::VerIterator const &Ver)
|
|
{
|
|
if (_config->FindB("APT::Get::Phase-Policy", false))
|
|
return false;
|
|
|
|
// The order and fallbacks for the always/never checks come from update-manager and exist
|
|
// to preserve compatibility.
|
|
if (_config->FindB("APT::Get::Always-Include-Phased-Updates",
|
|
_config->FindB("Update-Manager::Always-Include-Phased-Updates", false)))
|
|
return false;
|
|
|
|
if (_config->FindB("APT::Get::Never-Include-Phased-Updates",
|
|
_config->FindB("Update-Manager::Never-Include-Phased-Updates", false)))
|
|
return true;
|
|
|
|
if (machineID.empty() // no machine-id
|
|
|| getenv("SOURCE_DATE_EPOCH") != nullptr // reproducible build - always include
|
|
|| APT::Configuration::isChroot())
|
|
return false;
|
|
|
|
std::string seedStr = std::string(Ver.SourcePkgName()) + "-" + Ver.SourceVerStr() + "-" + machineID;
|
|
std::seed_seq seed(seedStr.begin(), seedStr.end());
|
|
std::minstd_rand rand(seed);
|
|
std::uniform_int_distribution<unsigned int> dist(0, 100);
|
|
|
|
return dist(rand) > Ver.PhasedUpdatePercentage();
|
|
}
|
|
|
|
bool pkgDepCache::PhasingApplied(pkgCache::PkgIterator Pkg) const
|
|
{
|
|
if (Pkg->CurrentVer == 0)
|
|
return false;
|
|
if ((*this)[Pkg].CandidateVer == 0)
|
|
return false;
|
|
if ((*this)[Pkg].CandidateVerIter(*Cache).PhasedUpdatePercentage() == 100)
|
|
return false;
|
|
if ((*this)[Pkg].CandidateVerIter(*Cache).IsSecurityUpdate())
|
|
return false;
|
|
if (!IsIgnoredPhasedUpdate(d->machineID, (*this)[Pkg].CandidateVerIter(*Cache)))
|
|
return false;
|
|
|
|
return true;
|
|
}
|
|
/*}}}*/
|
|
|
|
// DepCache::BootSize /*{{{*/
|
|
unsigned long long pkgDepCache::BootSize(bool initrdOnly)
|
|
{
|
|
int BootCount = 0;
|
|
auto VirtualKernelPkg = FindPkg("$kernel", "any");
|
|
if (VirtualKernelPkg.end())
|
|
return 0;
|
|
|
|
for (pkgCache::PrvIterator Prv = VirtualKernelPkg.ProvidesList(); Prv.end() == false; ++Prv)
|
|
{
|
|
auto Pkg = Prv.OwnerPkg();
|
|
if ((*this)[Pkg].NewInstall())
|
|
BootCount++;
|
|
}
|
|
if (BootCount == 0)
|
|
return 0;
|
|
|
|
DIR *boot = opendir(_config->FindDir("Dir::Boot").c_str());
|
|
if (not boot)
|
|
return 0;
|
|
|
|
enum
|
|
{
|
|
VMLINUZ,
|
|
INITRD,
|
|
MAP,
|
|
MAX_ARTEFACT,
|
|
} type;
|
|
off_t sizes[MAX_ARTEFACT]{};
|
|
while (struct dirent *ent = readdir(boot))
|
|
{
|
|
if (APT::String::Startswith(ent->d_name, "initrd.img-"))
|
|
type = INITRD;
|
|
else if (APT::String::Startswith(ent->d_name, "System.map-"))
|
|
type = MAP;
|
|
else if (not initrdOnly && APT::String::Startswith(ent->d_name, "vmlinuz-"))
|
|
type = VMLINUZ;
|
|
else
|
|
continue;
|
|
|
|
if (struct stat st; fstatat(dirfd(boot), ent->d_name, &st, 0) == 0)
|
|
sizes[type] = std::max(sizes[type], st.st_size);
|
|
}
|
|
closedir(boot);
|
|
return std::accumulate(sizes, sizes + MAX_ARTEFACT, off_t{0}) * BootCount * 110 / 100;
|
|
}
|
|
/*}}}*/
|
|
// pkgDepCache::UpgradeCount /*{{{*/
|
|
unsigned long pkgDepCache::UpgradeCount()
|
|
{
|
|
return d->iUpgradeCount;
|
|
}
|
|
/*}}}*/
|
|
// pkgDepCache::Transaction /*{{{*/
|
|
struct pkgDepCache::Transaction::Private
|
|
{
|
|
template <typename T>
|
|
static T *copyArray(T *array, size_t count)
|
|
{
|
|
auto out = new T[count];
|
|
memcpy(&out[0], &array[0], sizeof(T) * count);
|
|
return out;
|
|
}
|
|
// State information
|
|
pkgDepCache &cache;
|
|
Behavior behavior;
|
|
std::unique_ptr<StateCache[]> PkgState{copyArray(cache.PkgState, cache.GetCache().Head().PackageCount)};
|
|
std::unique_ptr<unsigned char[]> DepState{copyArray(cache.DepState, cache.GetCache().Head().DependsCount)};
|
|
signed long long iUsrSize{cache.iUsrSize};
|
|
unsigned long long iDownloadSize{cache.iDownloadSize};
|
|
unsigned long iInstCount{cache.iInstCount};
|
|
unsigned long iUpgradeCount{cache.d->iUpgradeCount};
|
|
unsigned long iDelCount{cache.iDelCount};
|
|
unsigned long iKeepCount{cache.iKeepCount};
|
|
unsigned long iBrokenCount{cache.iBrokenCount};
|
|
unsigned long iPolicyBrokenCount{cache.iPolicyBrokenCount};
|
|
unsigned long iBadCount{cache.iBadCount};
|
|
|
|
void rollback()
|
|
{
|
|
memcpy(&cache.PkgState[0], &PkgState[0], sizeof(PkgState[0]) * cache.GetCache().Head().PackageCount);
|
|
memcpy(&cache.DepState[0], &DepState[0], sizeof(DepState[0]) * cache.GetCache().Head().DependsCount);
|
|
|
|
cache.iUsrSize = iUsrSize;
|
|
cache.iDownloadSize = iDownloadSize;
|
|
cache.iInstCount = iInstCount;
|
|
cache.d->iUpgradeCount = iUpgradeCount;
|
|
cache.iDelCount = iDelCount;
|
|
cache.iKeepCount = iKeepCount;
|
|
cache.iBrokenCount = iBrokenCount;
|
|
cache.iPolicyBrokenCount = iPolicyBrokenCount;
|
|
cache.iBadCount = iBadCount;
|
|
}
|
|
};
|
|
|
|
pkgDepCache::Transaction::Transaction(pkgDepCache &cache, Behavior behavior) : d(new Private{cache, behavior}) {}
|
|
|
|
void pkgDepCache::Transaction::temporaryRollback()
|
|
{
|
|
d->rollback();
|
|
}
|
|
|
|
void pkgDepCache::Transaction::commit()
|
|
{
|
|
d.reset();
|
|
}
|
|
|
|
void pkgDepCache::Transaction::rollback()
|
|
{
|
|
if (d == nullptr)
|
|
return;
|
|
|
|
temporaryRollback();
|
|
d.reset();
|
|
}
|
|
|
|
pkgDepCache::Transaction::~Transaction()
|
|
{
|
|
if (not d)
|
|
return;
|
|
if (d->behavior == Behavior::ROLLBACK || (d->behavior == Behavior::AUTO && d->cache.iBrokenCount > d->iBrokenCount))
|
|
rollback();
|
|
else
|
|
commit();
|
|
}
|
|
/*}}}*/
|