]>
Commit | Line | Data |
---|---|---|
1 | // -*- mode: cpp; mode: fold -*- | |
2 | // Description /*{{{*/ | |
3 | // $Id: algorithms.h,v 1.6 1998/10/20 02:39:18 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 | // Header section: pkglib | |
31 | #ifndef PKGLIB_ALGORITHMS_H | |
32 | #define PKGLIB_ALGORITHMS_H | |
33 | ||
34 | #ifdef __GNUG__ | |
35 | #pragma interface "apt-pkg/algorithms.h" | |
36 | #endif | |
37 | ||
38 | #include <apt-pkg/packagemanager.h> | |
39 | #include <apt-pkg/depcache.h> | |
40 | ||
41 | class pkgSimulate : public pkgPackageManager | |
42 | { | |
43 | protected: | |
44 | ||
45 | unsigned char *Flags; | |
46 | ||
47 | pkgDepCache Sim; | |
48 | ||
49 | // The Actuall installation implementation | |
50 | virtual bool Install(PkgIterator Pkg,string File); | |
51 | virtual bool Configure(PkgIterator Pkg); | |
52 | virtual bool Remove(PkgIterator Pkg); | |
53 | void ShortBreaks(); | |
54 | ||
55 | public: | |
56 | ||
57 | pkgSimulate(pkgDepCache &Cache); | |
58 | }; | |
59 | ||
60 | class pkgProblemResolver | |
61 | { | |
62 | pkgDepCache &Cache; | |
63 | typedef pkgCache::PkgIterator PkgIterator; | |
64 | typedef pkgCache::VerIterator VerIterator; | |
65 | typedef pkgCache::DepIterator DepIterator; | |
66 | typedef pkgCache::PrvIterator PrvIterator; | |
67 | typedef pkgCache::Version Version; | |
68 | typedef pkgCache::Package Package; | |
69 | ||
70 | enum Flags {Protected = (1 << 0), PreInstalled = (1 << 1), | |
71 | Upgradable = (1 << 2), ReInstateTried = (1 << 3), | |
72 | ToRemove = (1 << 4)}; | |
73 | signed short *Scores; | |
74 | unsigned char *Flags; | |
75 | bool Debug; | |
76 | ||
77 | // Sort stuff | |
78 | static pkgProblemResolver *This; | |
79 | static int ScoreSort(const void *a,const void *b); | |
80 | ||
81 | struct PackageKill | |
82 | { | |
83 | PkgIterator Pkg; | |
84 | DepIterator Dep; | |
85 | }; | |
86 | ||
87 | void MakeScores(); | |
88 | bool DoUpgrade(pkgCache::PkgIterator Pkg); | |
89 | ||
90 | public: | |
91 | ||
92 | inline void Protect(pkgCache::PkgIterator Pkg) {Flags[Pkg->ID] |= Protected;}; | |
93 | inline void Remove(pkgCache::PkgIterator Pkg) {Flags[Pkg->ID] |= ToRemove;}; | |
94 | ||
95 | // Try to intelligently resolve problems by installing and removing packages | |
96 | bool Resolve(bool BrokenFix = false); | |
97 | ||
98 | // Try to resolve problems only by using keep | |
99 | bool ResolveByKeep(); | |
100 | ||
101 | void InstallProtect(); | |
102 | ||
103 | pkgProblemResolver(pkgDepCache &Cache); | |
104 | }; | |
105 | ||
106 | bool pkgDistUpgrade(pkgDepCache &Cache); | |
107 | bool pkgApplyStatus(pkgDepCache &Cache); | |
108 | bool pkgFixBroken(pkgDepCache &Cache); | |
109 | bool pkgAllUpgrade(pkgDepCache &Cache); | |
110 | bool pkgMinimizeUpgrade(pkgDepCache &Cache); | |
111 | ||
112 | #endif |