1 /*---------------------------------------------------------------------\
3 | |__ / \ / / . \ . \ |
8 \---------------------------------------------------------------------*/
9 /** \file zypp/Resolver.h
12 #ifndef ZYPP_RESOLVER_H
13 #define ZYPP_RESOLVER_H
18 #include "zypp/base/ReferenceCounted.h"
19 #include "zypp/base/PtrTypes.h"
21 #include "zypp/ResPool.h"
22 #include "zypp/UpgradeStatistics.h"
23 #include "zypp/solver/detail/Resolver.h"
24 #include "zypp/solver/detail/ResolverContext.h"
25 #include "zypp/ProblemTypes.h"
27 ///////////////////////////////////////////////////////////////////
29 { /////////////////////////////////////////////////////////////////
33 ///////////////////////////////////////////////////////////////////
35 // CLASS NAME : Resolver
37 /** Resolver interface.
39 class Resolver : public base::ReferenceCounted, private base::NonCopyable
44 Resolver( const ResPool & pool );
49 * Resolve package dependencies:
51 * Verify consistency of system
57 * Resolve package dependencies:
59 * Verify consistency of system
60 * considerNewHardware = install packages which depends on
64 bool verifySystem (bool considerNewHardware);
67 * Establish state of 'higher level' Resolvables in Pool
69 * Must be called when dealing with non-package resolvables,
70 * like Patches, Patterns, and Products
72 * Must be called with a 'plain' pool, e.g. no additonal
75 * return true if it was successful
76 * return false if not (this will only happen if other
77 * transactions are in the pool which will lead to
80 bool establishPool (void);
83 * go through all package 'freshen' dependencies and
84 * schedule matches for installation.
86 * To be called at begin of installation and upgrade.
87 * Probably also useful after adding a new package
90 * return true if it was successful
91 * return false if not (this will only happen if other
92 * transactions are in the pool which will lead to
95 bool freshenPool (void);
98 * Resolve package dependencies:
100 * Try to execute all pending transactions (there may be more than
102 * The solver pays attention to the BEST packages only in order to
103 * come to a solution.
104 * If there has not been found a valid results all other branches
105 * (e.G. packages with older version numbers, worse architecture)
108 * Returns "true" on success (i.e., if there were no problems that
109 * need user interaction) and "false" if there were problems. In
110 * the latter case, use problems() and later applySolutions()
113 bool resolvePool (void);
116 * Resolve package dependencies:
118 * Try to execute all pending transactions (there may be more than
120 * If tryAllPossibilities is false, restrict searches for matching
121 * requirements to best architecture, highest version.
122 * If tryAllPossibilities is true, evaluate all possible matches
125 * Returns "true" on success (i.e., if there were no problems that
126 * need user interaction) and "false" if there were problems. In
127 * the latter case, use problems() and later applySolutions()
130 bool resolvePool (bool tryAllPossibilities);
134 * Undo solver changes done in resolvePool()
135 * Throwing away all ignored dependencies.
140 * Get the most recent resolver context
142 * It will be NULL if resolvePool() or establishPool() was never called.
143 * Depending on the return code of the last resolvePool() call,
144 * it _either_ points to a valid or an invalid solution.
146 solver::detail::ResolverContext_Ptr context (void) const;
149 * Do an distribution upgrade
151 * This will run a full upgrade on the pool, taking all upgrade
152 * dependencies (provide/obsolete for package renames, split-
153 * provides, etc.) into account and actually removing installed
154 * packages if no upgrade exists.
156 * To be run with great caution. It basically brings your
157 * system 'back to start'.
158 * Quite helpful to get back to a 'sane state'. Quite disastrous
159 * since you'll loose all non-distribution packages
161 void doUpgrade( UpgradeStatistics & opt_stats_r );
164 * Return the list of problematic update items
165 * i.e. locked ones (due to foreign vendor)
167 std::list<PoolItem_Ref> problematicUpdateItems( void ) const;
170 * Return the dependency problems found by the last call to
171 * resolveDependencies(). If there were no problems, the returned
172 * list will be empty.
174 ResolverProblemList problems();
177 * Return more solver information if an error has happened.
180 std::list<std::string> problemDescription( void ) const;
183 * Apply problem solutions. No more than one solution per problem
186 void applySolutions( const ProblemSolutionList & solutions );
188 Arch architecture() const;
189 void setArchitecture( const Arch & arch);
192 * Remove resolvables which are conflicts with others or
193 * have unfulfilled requirements.
194 * This behaviour is favourited by ZMD.
196 void setForceResolve (const bool force);
197 const bool forceResolve();
200 * Prefer the result with the newest version if there are more solver
203 void setPreferHighestVersion (const bool highestVersion);
204 const bool preferHighestVersion();
207 * transact a single ResObject
209 * Installs (install == true) or removes (install == false) all required
210 * and recommended packages(!) of \c robj
211 * (More or less a 'single step' resolver call)
213 * returns false if requirements are not all fulfillable
216 bool transactResObject( ResObject::constPtr robj, bool install = true);
219 * transact all objects of this kind
221 * Look through the pool and runs transactResObject, first for removes
223 * (More or less a 'single step' resolver call)
225 * returns false if any transactResObject() call returned false.
228 bool transactResKind( Resolvable::Kind kind );
231 * reset any transact states
233 * Look through the pool and clear transact state.
234 * It will only reset states which have an equal or
238 void transactReset( ResStatus::TransactByValue causer );
241 * Setting solver timeout
243 * Stop solving after a given timeframe (seconds)
244 * seconds = 0 : No timeout
247 void setTimeout( int seconds );
250 * Getting solver timeout in seconds
256 * Restricting solver passes
258 * Stop solving after a given amount of passes
259 * count = 0 : No restriction
262 void setMaxSolverPasses (int count);
265 * Count of max solver passes
268 int maxSolverPasses ();
271 * Generates a solver Testcase of the current state
273 * return true if it was successful
275 bool createSolverTestcase (const std::string & dumpPath = "/var/log/YaST2/solverTestcase");
280 solver::detail::Resolver_Ptr _pimpl;
282 ///////////////////////////////////////////////////////////////////
284 /////////////////////////////////////////////////////////////////
286 ///////////////////////////////////////////////////////////////////
287 #endif // ZYPP_RESOLVER_H