You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
 
 
 
 
 

1338 lines
38 KiB

// -*- mode: cpp; mode: fold -*-
// Description /*{{{*/
// $Id: depcache.cc,v 1.25 2001/05/27 05:36:04 jgg Exp $
/* ######################################################################
Dependency Cache - Caches Dependency information.
##################################################################### */
/*}}}*/
// Include Files /*{{{*/
#ifdef __GNUG__
#pragma implementation "apt-pkg/depcache.h"
#endif
#include <apt-pkg/depcache.h>
#include <apt-pkg/version.h>
#include <apt-pkg/error.h>
#include <apt-pkg/sptr.h>
#include <apt-pkg/algorithms.h>
#include <apt-pkg/fileutl.h>
#include <apt-pkg/configuration.h>
#include <apt-pkg/pkgsystem.h>
#include <apt-pkg/tagfile.h>
#include <iostream>
#include <sstream>
#include <set>
#include <apti18n.h>
pkgDepCache::ActionGroup::ActionGroup(pkgDepCache &cache) :
cache(cache), released(false)
{
++cache.group_level;
}
void pkgDepCache::ActionGroup::release()
{
if(!released)
{
if(cache.group_level == 0)
std::cerr << "W: Unbalanced action groups, expect badness" << std::endl;
else
{
--cache.group_level;
if(cache.group_level == 0)
cache.MarkAndSweep();
}
released = false;
}
}
pkgDepCache::ActionGroup::~ActionGroup()
{
release();
}
// DepCache::pkgDepCache - Constructors /*{{{*/
// ---------------------------------------------------------------------
/* */
pkgDepCache::pkgDepCache(pkgCache *pCache,Policy *Plcy) :
group_level(0), Cache(pCache), PkgState(0), DepState(0)
{
delLocalPolicy = 0;
LocalPolicy = Plcy;
if (LocalPolicy == 0)
delLocalPolicy = LocalPolicy = new Policy;
}
/*}}}*/
// DepCache::~pkgDepCache - Destructor /*{{{*/
// ---------------------------------------------------------------------
/* */
pkgDepCache::~pkgDepCache()
{
delete [] PkgState;
delete [] DepState;
delete delLocalPolicy;
}
/*}}}*/
// DepCache::Init - Generate the initial extra structures. /*{{{*/
// ---------------------------------------------------------------------
/* This allocats the extension buffers and initializes them. */
bool pkgDepCache::Init(OpProgress *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)
Prog->Progress(Done);
// Find the proper cache slot
StateCache &State = PkgState[I->ID];
State.iFlags = 0;
// Figure out the install version
State.CandidateVer = 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 *Prog)
{
FileFd state_file;
string state = _config->FindDir("Dir::State") + "extended_states";
if(FileExists(state)) {
state_file.Open(state, FileFd::ReadOnly);
int file_size = state_file.Size();
if(Prog != NULL)
Prog->OverallProgress(0, file_size, 1,
_("Reading state information"));
pkgTagFile tagfile(&state_file);
pkgTagSection section;
int amt=0;
while(tagfile.Step(section)) {
string pkgname = section.FindS("Package");
pkgCache::PkgIterator pkg=Cache->FindPkg(pkgname);
// Silently ignore unknown packages and packages with no actual
// version.
if(!pkg.end() && !pkg.VersionList().end()) {
short reason = section.FindI("Auto-Installed", 0);
if(reason > 0)
PkgState[pkg->ID].Flags |= Flag::Auto;
if(_config->FindB("Debug::pkgAutoRemove",false))
std::cout << "Auto-Installed : " << pkgname << std::endl;
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 *prog)
{
if(_config->FindB("Debug::pkgAutoRemove",false))
std::clog << "pkgDepCache::writeStateFile()" << std::endl;
FileFd StateFile;
string state = _config->FindDir("Dir::State") + "extended_states";
// if it does not exist, create a empty one
if(!FileExists(state))
{
StateFile.Open(state, FileFd::WriteEmpty);
StateFile.Close();
}
// open it
if(!StateFile.Open(state, FileFd::ReadOnly))
return _error->Error(_("Failed to open StateFile %s"),
state.c_str());
FILE *OutFile;
string outfile = state + ".tmp";
if((OutFile = fopen(outfile.c_str(),"w")) == NULL)
return _error->Error(_("Failed to write temporary StateFile %s"),
outfile.c_str());
// first merge with the existing sections
pkgTagFile tagfile(&StateFile);
pkgTagSection section;
std::set<string> pkgs_seen;
const char *nullreorderlist[] = {0};
while(tagfile.Step(section)) {
string pkgname = section.FindS("Package");
// Silently ignore unknown packages and packages with no actual
// version.
pkgCache::PkgIterator pkg=Cache->FindPkg(pkgname);
if(pkg.end() || pkg.VersionList().end())
continue;
bool oldAuto = section.FindI("Auto-Installed");
bool newAuto = (PkgState[pkg->ID].Flags & Flag::Auto);
if(_config->FindB("Debug::pkgAutoRemove",false))
std::clog << "Update exisiting AutoInstall info: "
<< pkg.Name() << std::endl;
TFRewriteData rewrite[2];
rewrite[0].Tag = "Auto-Installed";
rewrite[0].Rewrite = newAuto ? "1" : "0";
rewrite[0].NewTag = 0;
rewrite[1].Tag = 0;
TFRewrite(OutFile, section, nullreorderlist, rewrite);
fprintf(OutFile,"\n");
pkgs_seen.insert(pkgname);
}
// then write the ones we have not seen yet
std::ostringstream ostr;
for(pkgCache::PkgIterator pkg=Cache->PkgBegin(); !pkg.end(); pkg++) {
if(PkgState[pkg->ID].Flags & Flag::Auto) {
if (pkgs_seen.find(pkg.Name()) != pkgs_seen.end()) {
if(_config->FindB("Debug::pkgAutoRemove",false))
std::clog << "Skipping already written " << pkg.Name() << std::endl;
continue;
}
if(_config->FindB("Debug::pkgAutoRemove",false))
std::clog << "Writing new AutoInstall: "
<< pkg.Name() << std::endl;
ostr.str(string(""));
ostr << "Package: " << pkg.Name()
<< "\nAuto-Installed: 1\n\n";
fprintf(OutFile,ostr.str().c_str());
fprintf(OutFile,"\n");
}
}
fclose(OutFile);
// move the outfile over the real file
rename(outfile.c_str(), state.c_str());
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 Dep,int 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.TargetPkg() != Dep.ParentPkg() ||
(Dep->Type != Dep::Conflicts && Dep->Type != Dep::Obsoletes))
{
PkgIterator Pkg = Dep.TargetPkg();
// Check the base package
if (Type == NowVersion && Pkg->CurrentVer != 0)
if (VS().CheckDep(Pkg.CurrentVer().VerStr(),Dep->CompareOp,
Dep.TargetVer()) == true)
return true;
if (Type == InstallVersion && PkgState[Pkg->ID].InstallVer != 0)
if (VS().CheckDep(PkgState[Pkg->ID].InstVerIter(*this).VerStr(),
Dep->CompareOp,Dep.TargetVer()) == true)
return true;
if (Type == CandidateVersion && PkgState[Pkg->ID].CandidateVer != 0)
if (VS().CheckDep(PkgState[Pkg->ID].CandidateVerIter(*this).VerStr(),
Dep->CompareOp,Dep.TargetVer()) == true)
return true;
}
if (Dep->Type == Dep::Obsoletes)
return false;
// Check the providing packages
PrvIterator P = Dep.TargetPkg().ProvidesList();
PkgIterator Pkg = Dep.ParentPkg();
for (; P.end() != true; P++)
{
/* Provides may never be applied against the same package if it is
a conflicts. See the comment above. */
if (P.OwnerPkg() == Pkg && Dep->Type == Dep::Conflicts)
continue;
// Check if the provides is a hit
if (Type == NowVersion)
{
if (P.OwnerPkg().CurrentVer() != P.OwnerVer())
continue;
}
if (Type == InstallVersion)
{
StateCache &State = PkgState[P.OwnerPkg()->ID];
if (State.InstallVer != (Version *)P.OwnerVer())
continue;
}
if (Type == CandidateVersion)
{
StateCache &State = PkgState[P.OwnerPkg()->ID];
if (State.CandidateVer != (Version *)P.OwnerVer())
continue;
}
// Compare the versions.
if (VS().CheckDep(P.ProvideVersion(),Dep->CompareOp,Dep.TargetVer()) == true)
{
Res = P.OwnerPkg();
return true;
}
}
return false;
}
/*}}}*/
// DepCache::AddSizes - Add the packages sizes to the counters /*{{{*/
// ---------------------------------------------------------------------
/* Call with Mult = -1 to preform the inverse opration */
void pkgDepCache::AddSizes(const PkgIterator &Pkg,signed long Mult)
{
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)
{
iUsrSize += (signed)(Mult*P.InstVerIter(*this)->InstalledSize);
iDownloadSize += (signed)(Mult*P.InstVerIter(*this)->Size);
return;
}
// Upgrading
if (Pkg->CurrentVer != 0 &&
(P.InstallVer != (Version *)Pkg.CurrentVer() ||
(P.iFlags & ReInstall) == ReInstall) && P.InstallVer != 0)
{
iUsrSize += (signed)(Mult*((signed)P.InstVerIter(*this)->InstalledSize -
(signed)Pkg.CurrentVer()->InstalledSize));
iDownloadSize += (signed)(Mult*P.InstVerIter(*this)->Size);
return;
}
// Reinstall
if (Pkg.State() == pkgCache::PkgIterator::NeedsUnpack &&
P.Delete() == false)
{
iDownloadSize += (signed)(Mult*P.InstVerIter(*this)->Size);
return;
}
// Removing
if (Pkg->CurrentVer != 0 && P.InstallVer == 0)
{
iUsrSize -= (signed)(Mult*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
calld 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,int Add)
{
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;
if (State.Mode == ModeKeep)
iKeepCount += Add;
if (State.Mode == ModeInstall)
iInstCount += 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->Type == Dep::Conflicts || D->Type == Dep::Obsoletes)
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->Type == Dep::Conflicts || D->Type == Dep::Obsoletes)
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 Check,
unsigned char SetMin,
unsigned char SetPolicy)
{
unsigned char Dep = 0xFF;
while (D.end() != true)
{
// Compute a single dependency element (glob or)
DepIterator Start = D;
unsigned char State = 0;
for (bool LastOR = true; D.end() == false && LastOR == true; D++)
{
State |= DepState[D->ID];
LastOR = (D->CompareOp & Dep::Or) == Dep::Or;
}
// Minimum deps that must be satisfied to have a working package
if (Start.IsCritical() == true)
if ((State & Check) != Check)
Dep &= ~SetMin;
// Policy deps that must be satisfied to install the package
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 dependencys, Now, Install and Candidate. Callers must
invert the result if dealing with conflicts. */
unsigned char pkgDepCache::DependencyState(DepIterator &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 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::Update(OpProgress *Prog)
{
iUsrSize = 0;
iDownloadSize = 0;
iDelCount = 0;
iInstCount = 0;
iKeepCount = 0;
iBrokenCount = 0;
iBadCount = 0;
// Perform the depends pass
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->Type == Dep::Conflicts || D->Type == Dep::Obsoletes)
State = ~State;
}
}
// Compute the pacakge dependency state and size additions
AddSizes(I);
UpdateVerState(I);
AddStates(I);
}
if (Prog != 0)
Prog->Progress(Done);
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->Type == Dep::Conflicts || D->Type == Dep::Obsoletes)
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
if (Pkg->CurrentVer != 0)
for (PrvIterator P = Pkg.CurrentVer().ProvidesList();
P.end() != true; P++)
Update(P.ParentPkg().RevDependsList());
// Update the provides map for the candidate ver
if (PkgState[Pkg->ID].CandidateVer != 0)
for (PrvIterator P = PkgState[Pkg->ID].CandidateVerIter(*this).ProvidesList();
P.end() != true; P++)
Update(P.ParentPkg().RevDependsList());
}
/*}}}*/
// DepCache::MarkKeep - Put the package in the keep state /*{{{*/
// ---------------------------------------------------------------------
/* */
void pkgDepCache::MarkKeep(PkgIterator const &Pkg, bool Soft, bool FromUser)
{
// Simplifies other routines.
if (Pkg.end() == true)
return;
/* 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;
/** \todo Can this be moved later in the method? */
ActionGroup group(*this);
/* We changed the soft state all the time so the UI is a bit nicer
to use */
StateCache &P = PkgState[Pkg->ID];
if (Soft == true)
P.iFlags |= AutoKept;
else
P.iFlags &= ~AutoKept;
// Check that it is not already kept
if (P.Mode == ModeKeep)
return;
// We dont even try to keep virtual packages..
if (Pkg->VersionList == 0)
return;
if(FromUser && !P.Marked)
P.Flags &= ~Flag::Auto;
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);
}
/*}}}*/
// DepCache::MarkDelete - Put the package in the delete state /*{{{*/
// ---------------------------------------------------------------------
/* */
void pkgDepCache::MarkDelete(PkgIterator const &Pkg, bool rPurge)
{
// Simplifies other routines.
if (Pkg.end() == true)
return;
ActionGroup group(*this);
// Check that it is not already marked for delete
StateCache &P = PkgState[Pkg->ID];
P.iFlags &= ~(AutoKept | Purge);
if (rPurge == true)
P.iFlags |= Purge;
if ((P.Mode == ModeDelete || P.InstallVer == 0) &&
(Pkg.Purge() == true || rPurge == false))
return;
// We dont even try to delete virtual packages..
if (Pkg->VersionList == 0)
return;
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);
}
/*}}}*/
// DepCache::MarkInstall - Put the package in the install state /*{{{*/
// ---------------------------------------------------------------------
/* */
void pkgDepCache::MarkInstall(PkgIterator const &Pkg,bool AutoInst,
unsigned long Depth, bool FromUser,
bool ForceImportantDeps)
{
if (Depth > 100)
return;
// Simplifies other routines.
if (Pkg.end() == true)
return;
ActionGroup group(*this);
/* Check that it is not already marked for install and that it can be
installed */
StateCache &P = PkgState[Pkg->ID];
P.iFlags &= ~AutoKept;
if ((P.InstPolicyBroken() == false && P.InstBroken() == false) &&
(P.Mode == ModeInstall ||
P.CandidateVer == (Version *)Pkg.CurrentVer()))
{
if (P.CandidateVer == (Version *)Pkg.CurrentVer() && P.InstallVer == 0)
MarkKeep(Pkg, false, FromUser);
return;
}
// See if there is even any possible instalation candidate
if (P.CandidateVer == 0)
return;
// We dont even try to install virtual packages..
if (Pkg->VersionList == 0)
return;
/* 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 = ModeInstall;
P.InstallVer = P.CandidateVer;
if(FromUser)
{
// Set it to manual if it's a new install or cancelling the
// removal of a garbage package.
if(P.Status == 2 || (!Pkg.CurrentVer().end() && !P.Marked))
P.Flags &= ~Flag::Auto;
}
else
{
// Set it to auto if this is a new install.
if(P.Status == 2)
P.Flags |= Flag::Auto;
}
if (P.CandidateVer == (Version *)Pkg.CurrentVer())
P.Mode = ModeKeep;
AddStates(Pkg);
Update(Pkg);
AddSizes(Pkg);
if (AutoInst == false)
return;
DepIterator Dep = P.InstVerIter(*this).DependsList();
for (; Dep.end() != true;)
{
// Grok or groups
DepIterator Start = Dep;
bool Result = true;
unsigned Ors = 0;
for (bool LastOR = true; Dep.end() == false && LastOR == true; Dep++,Ors++)
{
LastOR = (Dep->CompareOp & Dep::Or) == Dep::Or;
if ((DepState[Dep->ID] & DepInstall) == DepInstall)
Result = false;
}
// Dep is satisfied okay.
if (Result == false)
continue;
/* Check if this dep should be consider for install. If it is a user
defined important dep and we are installed a new package then
it will be installed. Otherwise we only check for important
deps that have changed from the installed version
*/
if (IsImportantDep(Start) == false)
continue;
/* check if any ImportantDep() (but not Critial) where added
* since we installed the package
*/
bool isNewImportantDep = false;
if(!ForceImportantDeps && !Start.IsCritical())
{
bool found=false;
VerIterator instVer = Pkg.CurrentVer();
if(!instVer.end())
{
for (DepIterator D = instVer.DependsList(); D.end() != true; D++)
{
//FIXME: deal better with or-groups(?)
DepIterator LocalStart = D;
if(IsImportantDep(D) && Start.TargetPkg() == D.TargetPkg())
found=true;
}
// this is a new dep if it was not found to be already
// a important dep of the installed pacakge
isNewImportantDep = !found;
}
}
if(isNewImportantDep)
if(_config->FindB("Debug::pkgDepCache::AutoInstall",false) == true)
std::clog << "new important dependency: "
<< Start.TargetPkg().Name() << std::endl;
// skip important deps if the package is already installed
if (Pkg->CurrentVer != 0 && Start.IsCritical() == false
&& !isNewImportantDep && !ForceImportantDeps)
continue;
/* If we are in an or group locate the first or that can
succeed. We have already cached this.. */
for (; Ors > 1 && (DepState[Start->ID] & DepCVer) != DepCVer; Ors--)
Start++;
/* This bit is for processing the possibilty of an install/upgrade
fixing the problem */
SPtrArray<Version *> List = Start.AllTargets();
if ((DepState[Start->ID] & DepCVer) == DepCVer)
{
// Right, find the best version to install..
Version **Cur = List;
PkgIterator P = Start.TargetPkg();
PkgIterator InstPkg(*Cache,0);
// See if there are direct matches (at the start of the list)
for (; *Cur != 0 && (*Cur)->ParentPkg == P.Index(); Cur++)
{
PkgIterator Pkg(*Cache,Cache->PkgP + (*Cur)->ParentPkg);
if (PkgState[Pkg->ID].CandidateVer != *Cur)
continue;
InstPkg = Pkg;
break;
}
// Select the highest priority providing package
if (InstPkg.end() == true)
{
pkgPrioSortList(*Cache,Cur);
for (; *Cur != 0; Cur++)
{
PkgIterator Pkg(*Cache,Cache->PkgP + (*Cur)->ParentPkg);
if (PkgState[Pkg->ID].CandidateVer != *Cur)
continue;
InstPkg = Pkg;
break;
}
}
if (InstPkg.end() == false)
{
if(_config->FindB("Debug::pkgDepCache::AutoInstall",false) == true)
std::clog << "Installing " << InstPkg.Name()
<< " as dep of " << Pkg.Name()
<< std::endl;
MarkInstall(InstPkg, true, Depth + 1, false, ForceImportantDeps);
// Set the autoflag, after MarkInstall because MarkInstall
// unsets it
if (P->CurrentVer == 0)
PkgState[InstPkg->ID].Flags |= Flag::Auto;
}
continue;
}
/* For conflicts we just de-install the package and mark as auto,
Conflicts may not have or groups */
if (Start->Type == Dep::Conflicts || Start->Type == Dep::Obsoletes)
{
for (Version **I = List; *I != 0; I++)
{
VerIterator Ver(*this,*I);
PkgIterator Pkg = Ver.ParentPkg();
MarkDelete(Pkg);
}
continue;
}
}
}
/*}}}*/
// DepCache::SetReInstall - Set the reinstallation flag /*{{{*/
// ---------------------------------------------------------------------
/* */
void pkgDepCache::SetReInstall(PkgIterator const &Pkg,bool To)
{
ActionGroup group(*this);
RemoveSizes(Pkg);
RemoveStates(Pkg);
StateCache &P = PkgState[Pkg->ID];
if (To == true)
P.iFlags |= ReInstall;
else
P.iFlags &= ~ReInstall;
AddStates(Pkg);
AddSizes(Pkg);
}
/*}}}*/
// DepCache::SetCandidateVersion - Change the candidate version /*{{{*/
// ---------------------------------------------------------------------
/* */
void pkgDepCache::SetCandidateVersion(VerIterator TargetVer)
{
ActionGroup group(*this);
pkgCache::PkgIterator Pkg = TargetVer.ParentPkg();
StateCache &P = PkgState[Pkg->ID];
RemoveSizes(Pkg);
RemoveStates(Pkg);
if (P.CandidateVer == P.InstallVer)
P.InstallVer = (Version *)TargetVer;
P.CandidateVer = (Version *)TargetVer;
P.Update(Pkg,*this);
AddStates(Pkg);
Update(Pkg);
AddSizes(Pkg);
}
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
CurVersion = "";
if (Pkg->CurrentVer != 0)
CurVersion = Pkg.CurrentVer().VerStr();
// Strip off the epochs for display
CurVersion = StripEpoch(CurVersion);
CandVersion = StripEpoch(CandVersion);
// Figure out if its up or down or equal
Status = Ver.CompareVer(Pkg.CurrentVer());
if (Pkg->CurrentVer == 0 || Pkg->VersionList == 0 || CandidateVer == 0)
Status = 2;
}
/*}}}*/
// StateCache::StripEpoch - Remove the epoch specifier from the version /*{{{*/
// ---------------------------------------------------------------------
/* */
const char *pkgDepCache::StateCache::StripEpoch(const char *Ver)
{
if (Ver == 0)
return 0;
// Strip any epoch
for (const char *I = Ver; *I != 0; I++)
if (*I == ':')
return I + 1;
return Ver;
}
/*}}}*/
// 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 Pkg)
{
/* Not source/not automatic versions cannot be a candidate version
unless they are already installed */
VerIterator Last(*(pkgCache *)this,0);
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()->Flags & Flag::NotSource) != 0)
continue;
/* Stash the highest version of a not-automatic source, we use it
if there is nothing better */
if ((J.File()->Flags & Flag::NotAutomatic) != 0)
{
if (Last.end() == true)
Last = I;
continue;
}
return I;
}
}
return Last;
}
/*}}}*/
// Policy::IsImportantDep - True if the dependency is important /*{{{*/
// ---------------------------------------------------------------------
/* */
bool pkgDepCache::Policy::IsImportantDep(DepIterator Dep)
{
if(Dep.IsCritical())
return true;
else if(Dep->Type == pkgCache::Dep::Recommends)
{
if ( _config->FindB("APT::Install-Recommends", false))
return true;
// we suport a special mode to only install-recommends for certain
// sections
// FIXME: this is a meant as a temporarly solution until the
// recommends are cleaned up
string s = _config->Find("APT::Install-Recommends-Section","");
if(s.size() > 0)
{
const char *sec = Dep.TargetPkg().Section();
if (sec && strcmp(sec, s.c_str()) == 0)
return true;
}
}
else if(Dep->Type == pkgCache::Dep::Suggests)
return _config->FindB("APT::Install-Suggests", false);
return false;
}
/*}}}*/
pkgDepCache::DefaultRootSetFunc::DefaultRootSetFunc()
: constructedSuccessfully(false)
{
Configuration::Item const *Opts;
Opts = _config->Tree("APT::NeverAutoRemove");
if (Opts != 0 && Opts->Child != 0)
{
Opts = Opts->Child;
for (; Opts != 0; Opts = Opts->Next)
{
if (Opts->Value.empty() == true)
continue;
regex_t *p = new regex_t;
if(regcomp(p,Opts->Value.c_str(),
REG_EXTENDED | REG_ICASE | REG_NOSUB) != 0)
{
regfree(p);
delete p;
_error->Error("Regex compilation error for APT::NeverAutoRemove");
return;
}
rootSetRegexp.push_back(p);
}
}
constructedSuccessfully = true;
}
pkgDepCache::DefaultRootSetFunc::~DefaultRootSetFunc()
{
for(unsigned int i = 0; i < rootSetRegexp.size(); i++)
{
regfree(rootSetRegexp[i]);
delete rootSetRegexp[i];
}
}
bool pkgDepCache::DefaultRootSetFunc::InRootSet(const pkgCache::PkgIterator &pkg)
{
for(unsigned int i = 0; i < rootSetRegexp.size(); i++)
if (regexec(rootSetRegexp[i], pkg.Name(), 0, 0, 0) == 0)
return true;
return false;
}
pkgDepCache::InRootSetFunc *pkgDepCache::GetRootSetFunc()
{
DefaultRootSetFunc *f = new DefaultRootSetFunc;
if(f->wasConstructedSuccessfully())
return f;
else
{
delete f;
return NULL;
}
}
bool pkgDepCache::MarkFollowsRecommends()
{
return _config->FindB("APT::AutoRemove::RecommendsImportant", true);
}
bool pkgDepCache::MarkFollowsSuggests()
{
return _config->FindB("APT::AutoRemove::SuggestsImportant", false);
}
// the main mark algorithm
bool pkgDepCache::MarkRequired(InRootSetFunc &userFunc)
{
bool follow_recommends;
bool follow_suggests;
// init the states
for(PkgIterator p = PkgBegin(); !p.end(); ++p)
{
PkgState[p->ID].Marked = false;
PkgState[p->ID].Garbage = false;
// debug output
if(_config->FindB("Debug::pkgAutoRemove",false)
&& PkgState[p->ID].Flags & Flag::Auto)
std::clog << "AutoDep: " << p.Name() << std::endl;
}
// init vars
follow_recommends = MarkFollowsRecommends();
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].Flags & Flag::Auto) ||
(p->Flags & Flag::Essential) ||
userFunc.InRootSet(p))
{
// the package is installed (and set to keep)
if(PkgState[p->ID].Keep() && !p.CurrentVer().end())
MarkPackage(p, p.CurrentVer(),
follow_recommends, follow_suggests);
// the package is to be installed
else if(PkgState[p->ID].Install())
MarkPackage(p, PkgState[p->ID].InstVerIter(*this),
follow_recommends, follow_suggests);
}
}
return true;
}
// mark a single package in Mark-and-Sweep
void pkgDepCache::MarkPackage(const pkgCache::PkgIterator &pkg,
const pkgCache::VerIterator &ver,
bool follow_recommends,
bool follow_suggests)
{
pkgDepCache::StateCache &state = PkgState[pkg->ID];
VerIterator candver = state.CandidateVerIter(*this);
VerIterator instver = state.InstVerIter(*this);
#if 0
// If a package was garbage-collected but is now being marked, we
// should re-select it
// For cases when a pkg is set to upgrade and this trigger the
// removal of a no-longer used dependency. if the pkg is set to
// keep again later it will result in broken deps
if(state.Delete() && state.RemoveReason = Unused)
{
if(ver==candver)
mark_install(pkg, false, false, NULL);
else if(ver==pkg.CurrentVer())
MarkKeep(pkg, false, false);
instver=state.InstVerIter(*this);
}
#endif
// Ignore versions other than the InstVer, and ignore packages
// that are already going to be removed or just left uninstalled.
if(!(ver == instver && !instver.end()))
return;
// if we are marked already we are done
if(state.Marked)
return;
//std::cout << "Setting Marked for: " << pkg.Name() << std::endl;
state.Marked=true;
if(!ver.end())
{
for(DepIterator d = ver.DependsList(); !d.end(); ++d)
{
if(d->Type == Dep::Depends ||
d->Type == Dep::PreDepends ||
(follow_recommends &&
d->Type == Dep::Recommends) ||
(follow_suggests &&
d->Type == Dep::Suggests))
{
// Try all versions of this package.
for(VerIterator V = d.TargetPkg().VersionList();
!V.end(); ++V)
{
if(_system->VS->CheckDep(V.VerStr(), d->CompareOp, d.TargetVer()))
{
MarkPackage(V.ParentPkg(), V,
follow_recommends, follow_suggests);
}
}
// Now try virtual packages
for(PrvIterator prv=d.TargetPkg().ProvidesList();
!prv.end(); ++prv)
{
if(_system->VS->CheckDep(prv.ProvideVersion(), d->CompareOp,
d.TargetVer()))
{
MarkPackage(prv.OwnerPkg(), prv.OwnerVer(),
follow_recommends, follow_suggests);
}
}
}
}
}
}
bool pkgDepCache::Sweep()
{
// do the sweep
for(PkgIterator p=PkgBegin(); !p.end(); ++p)
{
StateCache &state=PkgState[p->ID];
// if it is not marked and it is installed, it's garbage
if(!state.Marked && (!p.CurrentVer().end() || state.Install()) &&
!state.Delete())
{
state.Garbage=true;
if(_config->FindB("Debug::pkgAutoRemove",false))
std::cout << "Garbage: " << p.Name() << std::endl;
}
}
return true;
}