]> git.saurik.com Git - apt.git/blob - apt-pkg/algorithms.h
* fix version number and changelog
[apt.git] / apt-pkg / algorithms.h
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 using std::ostream;
40
41 class pkgSimulate : public pkgPackageManager
42 {
43 protected:
44
45 class Policy : public pkgDepCache::Policy
46 {
47 pkgDepCache *Cache;
48 public:
49
50 virtual VerIterator GetCandidateVer(PkgIterator Pkg)
51 {
52 return (*Cache)[Pkg].CandidateVerIter(*Cache);
53 }
54
55 Policy(pkgDepCache *Cache) : Cache(Cache) {};
56 };
57
58 unsigned char *Flags;
59
60 Policy iPolicy;
61 pkgDepCache Sim;
62
63 // The Actuall installation implementation
64 virtual bool Install(PkgIterator Pkg,string File);
65 virtual bool Configure(PkgIterator Pkg);
66 virtual bool Remove(PkgIterator Pkg,bool Purge);
67
68 private:
69 void ShortBreaks();
70 void Describe(PkgIterator iPkg,ostream &out,bool Current,bool Candidate);
71
72 public:
73
74 pkgSimulate(pkgDepCache *Cache);
75 };
76
77 class pkgProblemResolver
78 {
79 pkgDepCache &Cache;
80 typedef pkgCache::PkgIterator PkgIterator;
81 typedef pkgCache::VerIterator VerIterator;
82 typedef pkgCache::DepIterator DepIterator;
83 typedef pkgCache::PrvIterator PrvIterator;
84 typedef pkgCache::Version Version;
85 typedef pkgCache::Package Package;
86
87 enum Flags {Protected = (1 << 0), PreInstalled = (1 << 1),
88 Upgradable = (1 << 2), ReInstateTried = (1 << 3),
89 ToRemove = (1 << 4)};
90 signed short *Scores;
91 unsigned char *Flags;
92 bool Debug;
93
94 // Sort stuff
95 static pkgProblemResolver *This;
96 static int ScoreSort(const void *a,const void *b);
97
98 struct PackageKill
99 {
100 PkgIterator Pkg;
101 DepIterator Dep;
102 };
103
104 void MakeScores();
105 bool DoUpgrade(pkgCache::PkgIterator Pkg);
106
107 public:
108
109 inline void Protect(pkgCache::PkgIterator Pkg) {Flags[Pkg->ID] |= Protected;};
110 inline void Remove(pkgCache::PkgIterator Pkg) {Flags[Pkg->ID] |= ToRemove;};
111 inline void Clear(pkgCache::PkgIterator Pkg) {Flags[Pkg->ID] &= ~(Protected | ToRemove);};
112
113 // Try to intelligently resolve problems by installing and removing packages
114 bool Resolve(bool BrokenFix = false);
115
116 // Try to resolve problems only by using keep
117 bool ResolveByKeep();
118
119 // Install all protected packages
120 void InstallProtect();
121
122 pkgProblemResolver(pkgDepCache *Cache);
123 ~pkgProblemResolver();
124 };
125
126 bool pkgDistUpgrade(pkgDepCache &Cache);
127 bool pkgApplyStatus(pkgDepCache &Cache);
128 bool pkgFixBroken(pkgDepCache &Cache);
129 bool pkgAllUpgrade(pkgDepCache &Cache);
130 bool pkgMinimizeUpgrade(pkgDepCache &Cache);
131
132 void pkgPrioSortList(pkgCache &Cache,pkgCache::Version **List);
133
134 #endif