]>
Commit | Line | Data |
---|---|---|
6c139d6e AL |
1 | // -*- mode: cpp; mode: fold -*- |
2 | // Description /*{{{*/ | |
b4fc9b6f | 3 | // $Id: algorithms.h,v 1.10 2001/05/22 04:17:41 jgg Exp $ |
6c139d6e AL |
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. | |
6fc33863 AL |
17 | |
18 | pkgFixBroken corrects a broken system so that it is in a sane state. | |
0a8e3465 AL |
19 | |
20 | pkgAllUpgrade attempts to upgade as many packages as possible but | |
21 | without installing new packages. | |
6c139d6e | 22 | |
0a8e3465 AL |
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 | ||
6c139d6e AL |
28 | ##################################################################### */ |
29 | /*}}}*/ | |
6c139d6e AL |
30 | #ifndef PKGLIB_ALGORITHMS_H |
31 | #define PKGLIB_ALGORITHMS_H | |
32 | ||
6c139d6e | 33 | |
094a497d AL |
34 | #include <apt-pkg/packagemanager.h> |
35 | #include <apt-pkg/depcache.h> | |
6c139d6e | 36 | |
b4fc9b6f AL |
37 | #include <iostream> |
38 | ||
a4f6bdc8 | 39 | #ifndef APT_8_CLEANER_HEADERS |
b9dadc24 | 40 | #include <apt-pkg/acquire.h> |
a4f6bdc8 DK |
41 | using std::ostream; |
42 | #endif | |
43 | ||
472ff00e DK |
44 | class pkgAcquireStatus; |
45 | ||
92fcbfc1 | 46 | class pkgSimulate : public pkgPackageManager /*{{{*/ |
6c139d6e AL |
47 | { |
48 | protected: | |
49 | ||
b2e465d6 AL |
50 | class Policy : public pkgDepCache::Policy |
51 | { | |
52 | pkgDepCache *Cache; | |
53 | public: | |
54 | ||
e841200b | 55 | virtual VerIterator GetCandidateVer(PkgIterator const &Pkg) |
b2e465d6 AL |
56 | { |
57 | return (*Cache)[Pkg].CandidateVerIter(*Cache); | |
58 | } | |
59 | ||
60 | Policy(pkgDepCache *Cache) : Cache(Cache) {}; | |
61 | }; | |
62 | ||
6c139d6e AL |
63 | unsigned char *Flags; |
64 | ||
b2e465d6 | 65 | Policy iPolicy; |
6c139d6e | 66 | pkgDepCache Sim; |
496d5c70 | 67 | pkgDepCache::ActionGroup group; |
6c139d6e AL |
68 | |
69 | // The Actuall installation implementation | |
8f3ba4e8 | 70 | virtual bool Install(PkgIterator Pkg,std::string File); |
6c139d6e | 71 | virtual bool Configure(PkgIterator Pkg); |
fc4b5c9f | 72 | virtual bool Remove(PkgIterator Pkg,bool Purge); |
b3d44315 MV |
73 | |
74 | private: | |
6c139d6e | 75 | void ShortBreaks(); |
8f3ba4e8 | 76 | void Describe(PkgIterator iPkg,std::ostream &out,bool Current,bool Candidate); |
6c139d6e AL |
77 | |
78 | public: | |
79 | ||
b2e465d6 | 80 | pkgSimulate(pkgDepCache *Cache); |
6c139d6e | 81 | }; |
92fcbfc1 DK |
82 | /*}}}*/ |
83 | class pkgProblemResolver /*{{{*/ | |
6c139d6e | 84 | { |
be9b62f7 MV |
85 | /** \brief dpointer placeholder (for later in case we need it) */ |
86 | void *d; | |
87 | ||
6c139d6e AL |
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), | |
3b5421b4 AL |
97 | Upgradable = (1 << 2), ReInstateTried = (1 << 3), |
98 | ToRemove = (1 << 4)}; | |
d0f2c87c | 99 | int *Scores; |
6c139d6e AL |
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); | |
6d38011b DK |
115 | |
116 | bool ResolveInternal(bool const BrokenFix = false); | |
741b7da9 | 117 | bool ResolveByKeepInternal(); |
6c139d6e | 118 | |
953b348c MV |
119 | protected: |
120 | bool InstOrNewPolicyBroken(pkgCache::PkgIterator Pkg); | |
121 | ||
6c139d6e AL |
122 | public: |
123 | ||
cc26da01 | 124 | inline void Protect(pkgCache::PkgIterator Pkg) {Flags[Pkg->ID] |= Protected; Cache.MarkProtected(Pkg);}; |
3b5421b4 | 125 | inline void Remove(pkgCache::PkgIterator Pkg) {Flags[Pkg->ID] |= ToRemove;}; |
61d6a8de AL |
126 | inline void Clear(pkgCache::PkgIterator Pkg) {Flags[Pkg->ID] &= ~(Protected | ToRemove);}; |
127 | ||
0a8e3465 | 128 | // Try to intelligently resolve problems by installing and removing packages |
6c139d6e | 129 | bool Resolve(bool BrokenFix = false); |
3b5421b4 | 130 | |
0a8e3465 AL |
131 | // Try to resolve problems only by using keep |
132 | bool ResolveByKeep(); | |
c320a1e6 MV |
133 | |
134 | // Install all protected packages | |
3b5421b4 AL |
135 | void InstallProtect(); |
136 | ||
b2e465d6 AL |
137 | pkgProblemResolver(pkgDepCache *Cache); |
138 | ~pkgProblemResolver(); | |
6c139d6e | 139 | }; |
92fcbfc1 | 140 | /*}}}*/ |
6c139d6e AL |
141 | bool pkgDistUpgrade(pkgDepCache &Cache); |
142 | bool pkgApplyStatus(pkgDepCache &Cache); | |
143 | bool pkgFixBroken(pkgDepCache &Cache); | |
0a8e3465 | 144 | bool pkgAllUpgrade(pkgDepCache &Cache); |
7e798dd7 | 145 | bool pkgMinimizeUpgrade(pkgDepCache &Cache); |
6c139d6e | 146 | |
b2e465d6 | 147 | void pkgPrioSortList(pkgCache &Cache,pkgCache::Version **List); |
760d4968 MV |
148 | |
149 | bool ListUpdate(pkgAcquireStatus &progress, pkgSourceList &List, int PulseInterval=0); | |
b2e465d6 | 150 | |
6c139d6e | 151 | #endif |