|
|
@@ -152,7 +152,7 @@ bool pkgOrderList::DoRun()
|
|
|
iterator OldEnd = End;
|
|
|
End = NList;
|
|
|
for (iterator I = List; I != OldEnd; ++I)
|
|
|
- if (VisitNode(PkgIterator(Cache,*I)) == false)
|
|
|
+ if (VisitNode(PkgIterator(Cache,*I), "DoRun") == false)
|
|
|
{
|
|
|
End = OldEnd;
|
|
|
return false;
|
|
|
@@ -519,7 +519,7 @@ bool pkgOrderList::VisitProvides(DepIterator D,bool Critical)
|
|
|
if (Critical == false && IsMissing(D.ParentPkg()) == true)
|
|
|
continue;
|
|
|
|
|
|
- if (VisitNode(Pkg) == false)
|
|
|
+ if (VisitNode(Pkg, "Provides") == false)
|
|
|
return false;
|
|
|
}
|
|
|
return true;
|
|
|
@@ -530,7 +530,7 @@ bool pkgOrderList::VisitProvides(DepIterator D,bool Critical)
|
|
|
/* This is the core ordering routine. It calls the set dependency
|
|
|
consideration functions which then potentialy call this again. Finite
|
|
|
depth is achived through the colouring mechinism. */
|
|
|
-bool pkgOrderList::VisitNode(PkgIterator Pkg)
|
|
|
+bool pkgOrderList::VisitNode(PkgIterator Pkg, char const* from)
|
|
|
{
|
|
|
// Looping or irrelevent.
|
|
|
// This should probably trancend not installed packages
|
|
|
@@ -541,7 +541,7 @@ bool pkgOrderList::VisitNode(PkgIterator Pkg)
|
|
|
if (Debug == true)
|
|
|
{
|
|
|
for (int j = 0; j != Depth; j++) clog << ' ';
|
|
|
- clog << "Visit " << Pkg.FullName() << endl;
|
|
|
+ clog << "Visit " << Pkg.FullName() << " from " << from << endl;
|
|
|
}
|
|
|
|
|
|
Depth++;
|
|
|
@@ -636,7 +636,7 @@ bool pkgOrderList::DepUnPackCrit(DepIterator D)
|
|
|
if (CheckDep(D) == true)
|
|
|
continue;
|
|
|
|
|
|
- if (VisitNode(D.ParentPkg()) == false)
|
|
|
+ if (VisitNode(D.ParentPkg(), "UnPackCrit") == false)
|
|
|
return false;
|
|
|
}
|
|
|
else
|
|
|
@@ -811,7 +811,7 @@ bool pkgOrderList::DepUnPackDep(DepIterator D)
|
|
|
if (IsMissing(D.ParentPkg()) == true)
|
|
|
continue;
|
|
|
|
|
|
- if (VisitNode(D.ParentPkg()) == false)
|
|
|
+ if (VisitNode(D.ParentPkg(), "UnPackDep-Parent") == false)
|
|
|
return false;
|
|
|
}
|
|
|
else
|
|
|
@@ -825,7 +825,7 @@ bool pkgOrderList::DepUnPackDep(DepIterator D)
|
|
|
if (CheckDep(D) == true)
|
|
|
continue;
|
|
|
|
|
|
- if (VisitNode(D.TargetPkg()) == false)
|
|
|
+ if (VisitNode(D.TargetPkg(), "UnPackDep-Target") == false)
|
|
|
return false;
|
|
|
}
|
|
|
}
|
|
|
@@ -924,7 +924,7 @@ bool pkgOrderList::DepRemove(DepIterator D)
|
|
|
if (IsFlag(P, InList) == true &&
|
|
|
IsFlag(P, AddPending) == false &&
|
|
|
Cache[P].InstallVer != 0 &&
|
|
|
- VisitNode(P) == true)
|
|
|
+ VisitNode(P, "Remove-P") == true)
|
|
|
{
|
|
|
Flag(P, Immediate);
|
|
|
tryFixDeps = false;
|
|
|
@@ -960,7 +960,7 @@ bool pkgOrderList::DepRemove(DepIterator D)
|
|
|
if (IsFlag(F.TargetPkg(), InList) == true &&
|
|
|
IsFlag(F.TargetPkg(), AddPending) == false &&
|
|
|
Cache[F.TargetPkg()].InstallVer != 0 &&
|
|
|
- VisitNode(F.TargetPkg()) == true)
|
|
|
+ VisitNode(F.TargetPkg(), "Remove-Target") == true)
|
|
|
{
|
|
|
Flag(F.TargetPkg(), Immediate);
|
|
|
tryFixDeps = false;
|
|
|
@@ -974,7 +974,7 @@ bool pkgOrderList::DepRemove(DepIterator D)
|
|
|
if (IsFlag(Prv.OwnerPkg(), InList) == true &&
|
|
|
IsFlag(Prv.OwnerPkg(), AddPending) == false &&
|
|
|
Cache[Prv.OwnerPkg()].InstallVer != 0 &&
|
|
|
- VisitNode(Prv.OwnerPkg()) == true)
|
|
|
+ VisitNode(Prv.OwnerPkg(), "Remove-Owner") == true)
|
|
|
{
|
|
|
Flag(Prv.OwnerPkg(), Immediate);
|
|
|
tryFixDeps = false;
|
|
|
@@ -994,7 +994,7 @@ bool pkgOrderList::DepRemove(DepIterator D)
|
|
|
if (IsMissing(D.ParentPkg()) == true)
|
|
|
continue;
|
|
|
|
|
|
- if (VisitNode(D.ParentPkg()) == false)
|
|
|
+ if (VisitNode(D.ParentPkg(), "Remove-Parent") == false)
|
|
|
return false;
|
|
|
}
|
|
|
|