]>
Commit | Line | Data |
---|---|---|
1 | // -*- mode: cpp; mode: fold -*- | |
2 | // Description /*{{{*/ | |
3 | // $Id: algorithms.h,v 1.10 2001/05/22 04:17:41 jgg Exp $ | |
4 | /* ###################################################################### | |
5 | ||
6 | Algorithms - A set of misc algorithms | |
7 | ||
8 | This simulate class displays what the ordering code has done and | |
9 | analyses it with a fresh new dependency cache. In this way we can | |
10 | see all of the effects of an upgrade run. | |
11 | ||
12 | pkgDistUpgrade computes an upgrade that causes as many packages as | |
13 | possible to move to the newest verison. | |
14 | ||
15 | pkgApplyStatus sets the target state based on the content of the status | |
16 | field in the status file. It is important to get proper crash recovery. | |
17 | ||
18 | pkgFixBroken corrects a broken system so that it is in a sane state. | |
19 | ||
20 | pkgAllUpgrade attempts to upgade as many packages as possible but | |
21 | without installing new packages. | |
22 | ||
23 | The problem resolver class contains a number of complex algorithms | |
24 | to try to best-guess an upgrade state. It solves the problem of | |
25 | maximizing the number of install state packages while having no broken | |
26 | packages. | |
27 | ||
28 | ##################################################################### */ | |
29 | /*}}}*/ | |
30 | #ifndef PKGLIB_ALGORITHMS_H | |
31 | #define PKGLIB_ALGORITHMS_H | |
32 | ||
33 | ||
34 | #include <apt-pkg/packagemanager.h> | |
35 | #include <apt-pkg/depcache.h> | |
36 | ||
37 | #include <iostream> | |
38 | ||
39 | #ifndef APT_8_CLEANER_HEADERS | |
40 | #include <apt-pkg/acquire.h> | |
41 | using std::ostream; | |
42 | #endif | |
43 | ||
44 | class pkgAcquireStatus; | |
45 | ||
46 | class pkgSimulate : public pkgPackageManager /*{{{*/ | |
47 | { | |
48 | protected: | |
49 | ||
50 | class Policy : public pkgDepCache::Policy | |
51 | { | |
52 | pkgDepCache *Cache; | |
53 | public: | |
54 | ||
55 | virtual VerIterator GetCandidateVer(PkgIterator const &Pkg) | |
56 | { | |
57 | return (*Cache)[Pkg].CandidateVerIter(*Cache); | |
58 | } | |
59 | ||
60 | Policy(pkgDepCache *Cache) : Cache(Cache) {}; | |
61 | }; | |
62 | ||
63 | unsigned char *Flags; | |
64 | ||
65 | Policy iPolicy; | |
66 | pkgDepCache Sim; | |
67 | pkgDepCache::ActionGroup group; | |
68 | ||
69 | // The Actuall installation implementation | |
70 | virtual bool Install(PkgIterator Pkg,std::string File); | |
71 | virtual bool Configure(PkgIterator Pkg); | |
72 | virtual bool Remove(PkgIterator Pkg,bool Purge); | |
73 | ||
74 | private: | |
75 | void ShortBreaks(); | |
76 | void Describe(PkgIterator iPkg,std::ostream &out,bool Current,bool Candidate); | |
77 | ||
78 | public: | |
79 | ||
80 | pkgSimulate(pkgDepCache *Cache); | |
81 | }; | |
82 | /*}}}*/ | |
83 | class pkgProblemResolver /*{{{*/ | |
84 | { | |
85 | /** \brief dpointer placeholder (for later in case we need it) */ | |
86 | void *d; | |
87 | ||
88 | pkgDepCache &Cache; | |
89 | typedef pkgCache::PkgIterator PkgIterator; | |
90 | typedef pkgCache::VerIterator VerIterator; | |
91 | typedef pkgCache::DepIterator DepIterator; | |
92 | typedef pkgCache::PrvIterator PrvIterator; | |
93 | typedef pkgCache::Version Version; | |
94 | typedef pkgCache::Package Package; | |
95 | ||
96 | enum Flags {Protected = (1 << 0), PreInstalled = (1 << 1), | |
97 | Upgradable = (1 << 2), ReInstateTried = (1 << 3), | |
98 | ToRemove = (1 << 4)}; | |
99 | int *Scores; | |
100 | unsigned char *Flags; | |
101 | bool Debug; | |
102 | ||
103 | // Sort stuff | |
104 | static pkgProblemResolver *This; | |
105 | static int ScoreSort(const void *a,const void *b); | |
106 | ||
107 | struct PackageKill | |
108 | { | |
109 | PkgIterator Pkg; | |
110 | DepIterator Dep; | |
111 | }; | |
112 | ||
113 | void MakeScores(); | |
114 | bool DoUpgrade(pkgCache::PkgIterator Pkg); | |
115 | ||
116 | bool ResolveInternal(bool const BrokenFix = false); | |
117 | bool ResolveByKeepInternal(); | |
118 | ||
119 | protected: | |
120 | bool InstOrNewPolicyBroken(pkgCache::PkgIterator Pkg); | |
121 | ||
122 | public: | |
123 | ||
124 | inline void Protect(pkgCache::PkgIterator Pkg) {Flags[Pkg->ID] |= Protected; Cache.MarkProtected(Pkg);}; | |
125 | inline void Remove(pkgCache::PkgIterator Pkg) {Flags[Pkg->ID] |= ToRemove;}; | |
126 | inline void Clear(pkgCache::PkgIterator Pkg) {Flags[Pkg->ID] &= ~(Protected | ToRemove);}; | |
127 | ||
128 | // Try to intelligently resolve problems by installing and removing packages | |
129 | bool Resolve(bool BrokenFix = false); | |
130 | ||
131 | // Try to resolve problems only by using keep | |
132 | bool ResolveByKeep(); | |
133 | ||
134 | // Install all protected packages | |
135 | void InstallProtect(); | |
136 | ||
137 | pkgProblemResolver(pkgDepCache *Cache); | |
138 | ~pkgProblemResolver(); | |
139 | }; | |
140 | /*}}}*/ | |
141 | bool pkgDistUpgrade(pkgDepCache &Cache); | |
142 | bool pkgApplyStatus(pkgDepCache &Cache); | |
143 | bool pkgFixBroken(pkgDepCache &Cache); | |
144 | bool pkgAllUpgrade(pkgDepCache &Cache); | |
145 | bool pkgMinimizeUpgrade(pkgDepCache &Cache); | |
146 | ||
147 | void pkgPrioSortList(pkgCache &Cache,pkgCache::Version **List); | |
148 | ||
149 | bool ListUpdate(pkgAcquireStatus &progress, pkgSourceList &List, int PulseInterval=0); | |
150 | ||
151 | #endif |