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