]>
git.saurik.com Git - apt.git/blob - apt-pkg/algorithms.h
1 // -*- mode: cpp; mode: fold -*-
3 // $Id: algorithms.h,v 1.10 2001/05/22 04:17:41 jgg Exp $
4 /* ######################################################################
6 Algorithms - A set of misc algorithms
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.
12 pkgDistUpgrade computes an upgrade that causes as many packages as
13 possible to move to the newest verison.
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.
18 pkgFixBroken corrects a broken system so that it is in a sane state.
20 pkgAllUpgrade attempts to upgade as many packages as possible but
21 without installing new packages.
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
28 ##################################################################### */
30 #ifndef PKGLIB_ALGORITHMS_H
31 #define PKGLIB_ALGORITHMS_H
34 #pragma interface "apt-pkg/algorithms.h"
37 #include <apt-pkg/packagemanager.h>
38 #include <apt-pkg/depcache.h>
44 class pkgSimulate
: public pkgPackageManager
48 class Policy
: public pkgDepCache::Policy
53 virtual VerIterator
GetCandidateVer(PkgIterator Pkg
)
55 return (*Cache
)[Pkg
].CandidateVerIter(*Cache
);
58 Policy(pkgDepCache
*Cache
) : Cache(Cache
) {};
66 // The Actuall installation implementation
67 virtual bool Install(PkgIterator Pkg
,string File
);
68 virtual bool Configure(PkgIterator Pkg
);
69 virtual bool Remove(PkgIterator Pkg
,bool Purge
);
73 void Describe(PkgIterator iPkg
,ostream
&out
,bool Current
,bool Candidate
);
77 pkgSimulate(pkgDepCache
*Cache
);
80 class pkgProblemResolver
83 typedef pkgCache::PkgIterator PkgIterator
;
84 typedef pkgCache::VerIterator VerIterator
;
85 typedef pkgCache::DepIterator DepIterator
;
86 typedef pkgCache::PrvIterator PrvIterator
;
87 typedef pkgCache::Version Version
;
88 typedef pkgCache::Package Package
;
90 enum Flags
{Protected
= (1 << 0), PreInstalled
= (1 << 1),
91 Upgradable
= (1 << 2), ReInstateTried
= (1 << 3),
98 static pkgProblemResolver
*This
;
99 static int ScoreSort(const void *a
,const void *b
);
108 bool DoUpgrade(pkgCache::PkgIterator Pkg
);
112 inline void Protect(pkgCache::PkgIterator Pkg
) {Flags
[Pkg
->ID
] |= Protected
;};
113 inline void Remove(pkgCache::PkgIterator Pkg
) {Flags
[Pkg
->ID
] |= ToRemove
;};
114 inline void Clear(pkgCache::PkgIterator Pkg
) {Flags
[Pkg
->ID
] &= ~(Protected
| ToRemove
);};
116 // Try to intelligently resolve problems by installing and removing packages
117 bool Resolve(bool BrokenFix
= false);
119 // Try to resolve problems only by using keep
120 bool ResolveByKeep();
122 void InstallProtect();
124 pkgProblemResolver(pkgDepCache
*Cache
);
125 ~pkgProblemResolver();
128 bool pkgDistUpgrade(pkgDepCache
&Cache
);
129 bool pkgApplyStatus(pkgDepCache
&Cache
);
130 bool pkgFixBroken(pkgDepCache
&Cache
);
131 bool pkgAllUpgrade(pkgDepCache
&Cache
);
132 bool pkgMinimizeUpgrade(pkgDepCache
&Cache
);
134 void pkgPrioSortList(pkgCache
&Cache
,pkgCache::Version
**List
);
137 // callback function that can be used by the client to bring in
138 // certain own packages into the root set
139 typedef bool (*InRootSetFunc
)(pkgCache::PkgIterator
);
141 // Mark all reachable packages with pkgDepCache::StateCache.Marked
142 // the root-set are all essential packages+everything that was installed
145 // If InRootSetFunc is set, it will be called for each PkgIterator. This
146 // is usefull for clients that have there own idea about the root-set
148 // Everything that is not reach can be removed
149 bool pkgMarkUsed(pkgDepCache
&Cache
, InRootSetFunc f
=NULL
);