21 #include <boost/static_assert.hpp>
23 #define ZYPP_USE_RESOLVER_INTERNALS
38 #define MAXSOLVERRUNS 5
60 os <<
"<resolver>" << endl;
61 #define OUTS(t) os << " " << #t << ":\t" << t << endl;
65 OUTS( _onlyRequires );
66 OUTS( _solveSrcPackages );
67 OUTS( _cleandepsOnRemove );
68 OUTS( _ignoreAlreadyRecommended );
70 return os <<
"<resolver/>";
79 , _poolchanged(_pool.serial() )
80 , _upgradeMode (
false)
84 , _solveSrcPackages (
false )
86 , _ignoreAlreadyRecommended (
true )
90 _satResolver =
new SATResolver(_pool, satPool.get());
105 #define ZOLV_FLAG_TRIBOOL( ZSETTER, ZGETTER, ZVARNAME, ZVARDEFAULT ) \
106 void Resolver::ZSETTER( TriBool state_r ) \
107 { _satResolver->ZVARNAME = indeterminate(state_r) ? ZVARDEFAULT : bool(state_r); } \
108 bool Resolver::ZGETTER() const \
109 { return _satResolver->ZVARNAME; } \
116 ZOLV_FLAG_TRIBOOL( setAllowArchChange, allowArchChange, _allowarchchange, false )
124 #undef ZOLV_FLAG_TRIBOOL
147 _extra_requires.clear();
148 _extra_conflicts.clear();
151 _isInstalledBy.clear();
153 _satifiedByInstalled.clear();
154 _installedSatisfied.clear();
161 return resolvePool();
167 return _satResolver->doUpdate();
171 {
return _satResolver->problematicUpdateItems(); }
173 void Resolver::addExtraRequire(
const Capability & capability )
174 { _extra_requires.insert (capability); }
176 void Resolver::removeExtraRequire(
const Capability & capability )
177 { _extra_requires.erase (capability); }
179 void Resolver::addExtraConflict(
const Capability & capability )
180 { _extra_conflicts.insert (capability); }
182 void Resolver::removeExtraConflict(
const Capability & capability )
183 { _extra_conflicts.erase (capability); }
185 void Resolver::removeQueueItem( SolverQueueItem_Ptr item )
188 for (SolverQueueItemList::const_iterator iter = _added_queue_items.begin();
189 iter != _added_queue_items.end(); iter++) {
191 _added_queue_items.remove(*iter);
197 _removed_queue_items.push_back (item);
198 _removed_queue_items.unique ();
202 void Resolver::addQueueItem( SolverQueueItem_Ptr item )
205 for (SolverQueueItemList::const_iterator iter = _removed_queue_items.begin();
206 iter != _removed_queue_items.end(); iter++) {
208 _removed_queue_items.remove(*iter);
214 _added_queue_items.push_back (item);
215 _added_queue_items.unique ();
219 void Resolver::addWeak(
const PoolItem & item )
220 { _addWeak.push_back( item ); }
258 DBG <<
"Resolver::verifySystem()" << endl;
264 functor::functorRef<bool,PoolItem>(resetting) );
266 return resolvePool();
275 MIL <<
"*** undo ***" << endl;
278 functor::functorRef<bool,PoolItem>(info) );
283 _removed_queue_items.clear();
284 _added_queue_items.clear();
289 void Resolver::solverInit()
292 static bool poolDumped =
false;
293 MIL <<
"-------------- Calling SAT Solver -------------------" << endl;
294 if ( getenv(
"ZYPP_FULLLOG") ) {
295 Testcase testcase(
"/var/log/YaST2/autoTestcase");
297 testcase.createTestcase (*
this,
true,
false);
300 testcase.createTestcase (*
this,
false,
false);
304 _satResolver->setFixsystem ( isVerifyingMode() );
305 _satResolver->setIgnorealreadyrecommended ( ignoreAlreadyRecommended() );
306 _satResolver->setOnlyRequires ( onlyRequires() );
307 _satResolver->setUpdatesystem (_updateMode);
308 _satResolver->setSolveSrcPackages ( solveSrcPackages() );
309 _satResolver->setCleandepsOnRemove ( cleandepsOnRemove() );
311 _satResolver->setDistupgrade (_upgradeMode);
314 _satResolver->setDistupgrade_removeunsupported (
false);
318 _isInstalledBy.clear();
320 _satifiedByInstalled.clear();
321 _installedSatisfied.clear();
327 return _satResolver->resolvePool(_extra_requires, _extra_conflicts, _addWeak, _upgradeRepos );
335 for (SolverQueueItemList::const_iterator iter = _removed_queue_items.begin();
336 iter != _removed_queue_items.end(); iter++) {
337 for (SolverQueueItemList::const_iterator iterQueue = queue.begin(); iterQueue != queue.end(); iterQueue++) {
338 if ( (*iterQueue)->cmp(*iter) == 0) {
339 MIL <<
"remove from queue" << *iter;
340 queue.remove(*iterQueue);
346 for (SolverQueueItemList::const_iterator iter = _added_queue_items.begin();
347 iter != _added_queue_items.end(); iter++) {
349 for (SolverQueueItemList::const_iterator iterQueue = queue.begin(); iterQueue != queue.end(); iterQueue++) {
350 if ( (*iterQueue)->cmp(*iter) == 0) {
356 MIL <<
"add to queue" << *iter;
357 queue.push_back(*iter);
363 _removed_queue_items.clear();
364 _added_queue_items.clear();
366 return _satResolver->resolveQueue(queue, _addWeak);
373 ret.autoInstalled( _satResolver->autoInstalled() );
383 MIL <<
"Resolver::problems()" << endl;
384 return _satResolver->problems();
389 for ( ProblemSolution_Ptr solution : solutions )
391 if ( ! applySolution( *solution ) )
396 bool Resolver::applySolution(
const ProblemSolution & solution )
399 DBG <<
"apply solution " << solution << endl;
400 for ( SolutionAction_Ptr action : solution.actions() )
402 if ( ! action->execute( *
this ) )
404 WAR <<
"apply solution action failed: " << action << endl;
414 void Resolver::collectResolverInfo()
417 && _isInstalledBy.empty()
418 && _installs.empty()) {
421 PoolItemList itemsToInstall = _satResolver->resultItemsToInstall();
423 for (PoolItemList::const_iterator instIter = itemsToInstall.begin();
424 instIter != itemsToInstall.end(); instIter++) {
426 for (Capabilities::const_iterator capIt = (*instIter)->dep (
Dep::REQUIRES).begin(); capIt != (*instIter)->dep (
Dep::REQUIRES).end(); ++capIt)
428 sat::WhatProvides possibleProviders(*capIt);
429 for_( iter, possibleProviders.begin(), possibleProviders.end() ) {
434 bool alreadySetForInstallation =
false;
435 ItemCapKindMap::const_iterator pos = _isInstalledBy.find(provider);
436 while (pos != _isInstalledBy.end()
437 && pos->first == provider
439 alreadySetForInstallation =
true;
440 ItemCapKind capKind = pos->second;
441 if (capKind.item() == *instIter) found =
true;
446 && provider.status().isToBeInstalled()) {
447 if (provider.status().isBySolver()) {
448 ItemCapKind capKindisInstalledBy( *instIter, *capIt,
Dep::REQUIRES, !alreadySetForInstallation );
449 _isInstalledBy.insert (make_pair( provider, capKindisInstalledBy));
452 ItemCapKind capKindisInstalledBy( *instIter, *capIt,
Dep::REQUIRES,
false );
453 _isInstalledBy.insert (make_pair( provider, capKindisInstalledBy));
455 ItemCapKind capKindisInstalledBy( provider, *capIt,
Dep::REQUIRES, !alreadySetForInstallation );
456 _installs.insert (make_pair( *instIter, capKindisInstalledBy));
459 if (provider.status().staysInstalled()) {
460 ItemCapKind capKindisInstalledBy( provider, *capIt,
Dep::REQUIRES,
false );
461 _satifiedByInstalled.insert (make_pair( *instIter, capKindisInstalledBy));
463 ItemCapKind installedSatisfied( *instIter, *capIt,
Dep::REQUIRES,
false );
464 _installedSatisfied.insert (make_pair( provider, installedSatisfied));
469 if (!(_satResolver->onlyRequires())) {
473 sat::WhatProvides possibleProviders(*capIt);
474 for_( iter, possibleProviders.begin(), possibleProviders.end() ) {
479 bool alreadySetForInstallation =
false;
480 ItemCapKindMap::const_iterator pos = _isInstalledBy.find(provider);
481 while (pos != _isInstalledBy.end()
482 && pos->first == provider
484 alreadySetForInstallation =
true;
485 ItemCapKind capKind = pos->second;
486 if (capKind.item() == *instIter) found =
true;
491 && provider.status().isToBeInstalled()) {
492 if (provider.status().isBySolver()) {
493 ItemCapKind capKindisInstalledBy( *instIter, *capIt,
Dep::RECOMMENDS, !alreadySetForInstallation );
494 _isInstalledBy.insert (make_pair( provider, capKindisInstalledBy));
497 ItemCapKind capKindisInstalledBy( *instIter, *capIt,
Dep::RECOMMENDS,
false );
498 _isInstalledBy.insert (make_pair( provider, capKindisInstalledBy));
500 ItemCapKind capKindisInstalledBy( provider, *capIt,
Dep::RECOMMENDS, !alreadySetForInstallation );
501 _installs.insert (make_pair( *instIter, capKindisInstalledBy));
504 if (provider.status().staysInstalled()) {
505 ItemCapKind capKindisInstalledBy( provider, *capIt,
Dep::RECOMMENDS,
false );
506 _satifiedByInstalled.insert (make_pair( *instIter, capKindisInstalledBy));
508 ItemCapKind installedSatisfied( *instIter, *capIt,
Dep::RECOMMENDS,
false );
509 _installedSatisfied.insert (make_pair( provider, installedSatisfied));
517 sat::WhatProvides possibleProviders(*capIt);
518 for_( iter, possibleProviders.begin(), possibleProviders.end() ) {
522 bool alreadySetForInstallation =
false;
523 ItemCapKindMap::const_iterator pos = _isInstalledBy.find(*instIter);
524 while (pos != _isInstalledBy.end()
525 && pos->first == *instIter
527 alreadySetForInstallation =
true;
528 ItemCapKind capKind = pos->second;
529 if (capKind.item() == provider) found =
true;
534 && instIter->status().isToBeInstalled()) {
535 if (instIter->status().isBySolver()) {
536 ItemCapKind capKindisInstalledBy( provider, *capIt,
Dep::SUPPLEMENTS, !alreadySetForInstallation );
537 _isInstalledBy.insert (make_pair( *instIter, capKindisInstalledBy));
540 ItemCapKind capKindisInstalledBy( provider, *capIt,
Dep::SUPPLEMENTS,
false );
541 _isInstalledBy.insert (make_pair( *instIter, capKindisInstalledBy));
543 ItemCapKind capKindisInstalledBy( *instIter, *capIt,
Dep::SUPPLEMENTS, !alreadySetForInstallation );
544 _installs.insert (make_pair( provider, capKindisInstalledBy));
547 if (instIter->status().staysInstalled()) {
548 ItemCapKind capKindisInstalledBy( *instIter, *capIt,
Dep::SUPPLEMENTS, !alreadySetForInstallation );
549 _satifiedByInstalled.insert (make_pair( provider, capKindisInstalledBy));
551 ItemCapKind installedSatisfied( provider, *capIt,
Dep::SUPPLEMENTS,
false );
552 _installedSatisfied.insert (make_pair( *instIter, installedSatisfied));
565 collectResolverInfo();
567 for (ItemCapKindMap::const_iterator iter = _isInstalledBy.find(item); iter != _isInstalledBy.end();) {
568 ItemCapKind info = iter->second;
569 PoolItem iterItem = iter->first;
570 if (iterItem == item) {
575 iter = _isInstalledBy.end();
584 collectResolverInfo();
586 for (ItemCapKindMap::const_iterator iter = _installs.find(item); iter != _installs.end();) {
587 ItemCapKind info = iter->second;
588 PoolItem iterItem = iter->first;
589 if (iterItem == item) {
594 iter = _installs.end();
603 collectResolverInfo();
605 for (ItemCapKindMap::const_iterator iter = _satifiedByInstalled.find(item); iter != _satifiedByInstalled.end();) {
606 ItemCapKind info = iter->second;
607 PoolItem iterItem = iter->first;
608 if (iterItem == item) {
613 iter = _satifiedByInstalled.end();
622 collectResolverInfo();
624 for (ItemCapKindMap::const_iterator iter = _installedSatisfied.find(item); iter != _installedSatisfied.end();) {
625 ItemCapKind info = iter->second;
626 PoolItem iterItem = iter->first;
627 if (iterItem == item) {
632 iter = _installedSatisfied.end();
void doUpdate()
Update to newest package.
solver::detail::ItemCapKindList installs(const PoolItem &item)
Gives information about WHICH additional items will be installed due the installation of an item...
std::list< ProblemSolution_Ptr > ProblemSolutionList
bool resolvePool()
Resolve package dependencies:
sat::Transaction getTransaction()
Return the Transaction computed by the last solver run.
bool operator()(PoolItem item)
static const Dep RECOMMENDS
static const Dep SUPPLEMENTS
std::list< PoolItem > problematicUpdateItems() const
Unmaintained packages which does not fit to the updated system (broken dependencies) will be deleted...
static ZConfig & instance()
Singleton ctor.
ResolverFocus
The resolvers general attitude.
void setCleandepsOnRemove(bool yesno_r)
Cleanup when deleting packages.
UndoTransact(const ResStatus::TransactByValue &status)
void setOnlyRequires(bool yesno_r)
Setting whether required packages are installed ONLY So recommended packages, language packages and p...
#define for_(IT, BEG, END)
Convenient for-loops using iterator.
bool doUpgrade()
Do an distribution upgrade (DUP)
Request the standard behavior (as defined in zypp.conf or 'Job')
bool resetTransact(TransactByValue causer_r)
Not the same as setTransact( false ).
bool solver_cleandepsOnRemove() const
Whether removing a package should also remove no longer needed requirements.
std::list< SolverQueueItem_Ptr > SolverQueueItemList
solver::detail::ItemCapKindList isInstalledBy(const PoolItem &item)
Gives information about WHO has pused an installation of an given item.
bool resolveQueue(solver::detail::SolverQueueItemList &queue)
Resolve package dependencies:
ResolverProblemList problems()
Return the dependency problems found by the last call to resolveDependencies().
boost::logic::tribool TriBool
3-state boolean logic (true, false and indeterminate).
solver::detail::ItemCapKindList installedSatisfied(const PoolItem &item)
Gives information about WHICH items require an already installed item.
solver::detail::ItemCapKindList satifiedByInstalled(const PoolItem &item)
Gives information about WHICH installed items are requested by the installation of an item...
std::list< ResolverProblem_Ptr > ResolverProblemList
static Pool instance()
Singleton ctor.
ResStatus::TransactByValue resStatus
std::unary_function< PoolItem, bool > PoolItemFilterFunctor
ResolverFocus solver_focus() const
The resolvers general attitude when resolving jobs.
Interim helper class to collect global options and settings.
virtual std::ostream & dumpOn(std::ostream &str) const
Overload to realize std::ostream & operator<<.
static const Dep REQUIRES
ResStatus & status() const
Returns the current status.
bool operator()(PoolItem item)
Select PoolItem by transact.
bool setTransact(bool toTansact_r, TransactByValue causer_r)
Toggle between TRANSACT and KEEP_STATE.
void applySolutions(const ProblemSolutionList &solutions)
Apply problem solutions.
bool solver_onlyRequires() const
Solver regards required packages,patterns,...
static constexpr LoadFromPoolType loadFromPool
std::list< ItemCapKind > ItemCapKindList
ZOLV_FLAG_TRIBOOL(setAllowNameChange, allowNameChange, _allownamechange, true) ZOLV_FLAG_TRIBOOL(setAllowVendorChange
ResStatus::TransactByValue resStatus
bool verifySystem()
Resolve package dependencies:
DoTransact(const ResStatus::TransactByValue &status)
Combining sat::Solvable and ResStatus.
void setFocus(ResolverFocus focus_r)
Define the resolvers general attitude when resolving jobs.
PoolItem find(const sat::Solvable &slv_r) const
Return the corresponding PoolItem.
ResolverFocus focus() const
int invokeOnEach(TIterator begin_r, TIterator end_r, TFilter filter_r, TFunction fnc_r)
Iterate through [begin_r,end_r) and invoke fnc_r on each item that passes filter_r.
Resolver(const ResPool &pool)
Ctor.
static ResPool instance()
Singleton ctor.