1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
|
// Include files /*{{{*/
#include <config.h>
#include <apt-pkg/algorithms.h>
#include <apt-pkg/cacheset.h>
#include <apt-pkg/configuration.h>
#include <apt-pkg/depcache.h>
#include <apt-pkg/error.h>
#include <apt-pkg/pkgcache.h>
#include <apt-pkg/upgrade.h>
#include <apt-private/private-cachefile.h>
#include <apt-private/private-output.h>
#include <cstdlib>
#include <ostream>
#include <string.h>
#include <apti18n.h>
/*}}}*/
using namespace std;
static bool SortPackagesByName(pkgCache * const Owner,
map_pointer<pkgCache::Group> const A, map_pointer<pkgCache::Group> const B)
{
if (A == 0)
return false;
if (B == 0 || A == B)
return true;
pkgCache::Group const * const GA = Owner->GrpP + A;
pkgCache::Group const * const GB = Owner->GrpP + B;
return strcmp(Owner->StrP + GA->Name, Owner->StrP + GB->Name) <= 0;
}
SortedPackageUniverse::SortedPackageUniverse(CacheFile &Cache) :
PackageUniverse{Cache}, List(Cache.UniverseList)
{
}
void SortedPackageUniverse::LazyInit() const
{
if (List.empty() == false)
return;
pkgCache * const Owner = data();
// In Multi-Arch systems Grps are easier to sort than Pkgs
std::vector<map_pointer<pkgCache::Group>> GrpList;
List.reserve(Owner->Head().GroupCount);
for (pkgCache::GrpIterator I{Owner->GrpBegin()}; I.end() != true; ++I)
GrpList.emplace_back(I - Owner->GrpP);
std::stable_sort(GrpList.begin(), GrpList.end(), std::bind( &SortPackagesByName, Owner, std::placeholders::_1, std::placeholders::_2 ));
List.reserve(Owner->Head().PackageCount);
for (auto G : GrpList)
{
pkgCache::GrpIterator const Grp(*Owner, Owner->GrpP + G);
for (pkgCache::PkgIterator P = Grp.PackageList(); P.end() != true; P = Grp.NextPkg(P))
List.emplace_back(P - Owner->PkgP);
}
}
// CacheFile::CheckDeps - Open the cache file /*{{{*/
// ---------------------------------------------------------------------
/* This routine generates the caches and then opens the dependency cache
and verifies that the system is OK. */
bool CacheFile::CheckDeps(bool AllowBroken)
{
bool FixBroken = _config->FindB("APT::Get::Fix-Broken",false);
if (_error->PendingError() == true)
return false;
// Check that the system is OK
if (DCache->DelCount() != 0 || DCache->InstCount() != 0)
return _error->Error("Internal error, non-zero counts");
// Apply corrections for half-installed packages
if (pkgApplyStatus(*DCache) == false)
return false;
if (_config->FindB("APT::Get::Fix-Policy-Broken",false) == true)
{
FixBroken = true;
if ((DCache->PolicyBrokenCount() > 0))
{
// upgrade all policy-broken packages with ForceImportantDeps=True
for (pkgCache::PkgIterator I = Cache->PkgBegin(); !I.end(); ++I)
if ((*DCache)[I].NowPolicyBroken() == true)
DCache->MarkInstall(I,true,0, false, true);
}
}
// Nothing is broken
if (DCache->BrokenCount() == 0 || AllowBroken == true)
return true;
// Attempt to fix broken things
if (FixBroken == true)
{
c1out << _("Correcting dependencies...") << flush;
if (pkgFixBroken(*DCache) == false || DCache->BrokenCount() != 0)
{
c1out << _(" failed.") << endl;
ShowBroken(c1out,*this,true);
return _error->Error(_("Unable to correct dependencies"));
}
if (pkgMinimizeUpgrade(*DCache) == false)
return _error->Error(_("Unable to minimize the upgrade set"));
c1out << _(" Done") << endl;
}
else
{
c1out << _("You might want to run 'apt --fix-broken install' to correct these.") << endl;
ShowBroken(c1out,*this,true);
return _error->Error(_("Unmet dependencies. Try 'apt --fix-broken install' with no packages (or specify a solution)."));
}
return true;
}
/*}}}*/
|