21 #include <boost/static_assert.hpp> 23 #define ZYPP_USE_RESOLVER_INTERNALS 38 #define MAXSOLVERRUNS 5 43 #undef ZYPP_BASE_LOGGER_LOGGROUP 44 #define ZYPP_BASE_LOGGER_LOGGROUP "zypp::solver" 63 os <<
"<resolver>" << endl;
64 #define OUTS(t) os << " " << #t << ":\t" << t << endl; 68 OUTS( _onlyRequires );
69 OUTS( _solveSrcPackages );
70 OUTS( _cleandepsOnRemove );
71 OUTS( _ignoreAlreadyRecommended );
73 return os <<
"<resolver/>";
82 , _poolchanged(_pool.serial() )
83 , _upgradeMode (
false)
87 , _solveSrcPackages (
false )
89 , _ignoreAlreadyRecommended (
true )
92 _satResolver =
new SATResolver(_pool, satPool.get());
107 #define ZOLV_FLAG_TRIBOOL( ZSETTER, ZGETTER, ZVARNAME, ZVARDEFAULT ) \ 108 void Resolver::ZSETTER( TriBool state_r ) \ 109 { _satResolver->ZVARNAME = indeterminate(state_r) ? ZVARDEFAULT : bool(state_r); } \ 110 bool Resolver::ZGETTER() const \ 111 { return _satResolver->ZVARNAME; } \ 118 ZOLV_FLAG_TRIBOOL( setAllowArchChange, allowArchChange, _allowarchchange, false )
126 #undef ZOLV_FLAG_TRIBOOL 149 _extra_requires.clear();
150 _extra_conflicts.clear();
153 _isInstalledBy.clear();
155 _satifiedByInstalled.clear();
156 _installedSatisfied.clear();
163 return resolvePool();
169 return _satResolver->doUpdate();
173 {
return _satResolver->problematicUpdateItems(); }
175 void Resolver::addExtraRequire(
const Capability & capability )
176 { _extra_requires.insert (capability); }
178 void Resolver::removeExtraRequire(
const Capability & capability )
179 { _extra_requires.erase (capability); }
181 void Resolver::addExtraConflict(
const Capability & capability )
182 { _extra_conflicts.insert (capability); }
184 void Resolver::removeExtraConflict(
const Capability & capability )
185 { _extra_conflicts.erase (capability); }
187 void Resolver::removeQueueItem( SolverQueueItem_Ptr item )
190 for (SolverQueueItemList::const_iterator iter = _added_queue_items.begin();
191 iter != _added_queue_items.end(); iter++) {
193 _added_queue_items.remove(*iter);
199 _removed_queue_items.push_back (item);
200 _removed_queue_items.unique ();
204 void Resolver::addQueueItem( SolverQueueItem_Ptr item )
207 for (SolverQueueItemList::const_iterator iter = _removed_queue_items.begin();
208 iter != _removed_queue_items.end(); iter++) {
210 _removed_queue_items.remove(*iter);
216 _added_queue_items.push_back (item);
217 _added_queue_items.unique ();
221 void Resolver::addWeak(
const PoolItem & item )
222 { _addWeak.push_back( item ); }
260 DBG <<
"Resolver::verifySystem()" << endl;
266 functor::functorRef<bool,PoolItem>(resetting) );
268 return resolvePool();
277 MIL <<
"*** undo ***" << endl;
280 functor::functorRef<bool,PoolItem>(info) );
285 _removed_queue_items.clear();
286 _added_queue_items.clear();
291 void Resolver::solverInit()
294 static bool poolDumped =
false;
295 MIL <<
"-------------- Calling SAT Solver -------------------" << endl;
296 if ( getenv(
"ZYPP_FULLLOG") ) {
297 Testcase testcase(
"/var/log/YaST2/autoTestcase");
299 testcase.createTestcase (*
this,
true,
false);
302 testcase.createTestcase (*
this,
false,
false);
306 _satResolver->setFixsystem ( isVerifyingMode() );
307 _satResolver->setIgnorealreadyrecommended ( ignoreAlreadyRecommended() );
308 _satResolver->setOnlyRequires ( onlyRequires() );
309 _satResolver->setUpdatesystem (_updateMode);
310 _satResolver->setSolveSrcPackages ( solveSrcPackages() );
311 _satResolver->setCleandepsOnRemove ( cleandepsOnRemove() );
313 _satResolver->setDistupgrade (_upgradeMode);
316 _satResolver->setDistupgrade_removeunsupported (
false);
320 _isInstalledBy.clear();
322 _satifiedByInstalled.clear();
323 _installedSatisfied.clear();
329 return _satResolver->resolvePool(_extra_requires, _extra_conflicts, _addWeak, _upgradeRepos );
337 for (SolverQueueItemList::const_iterator iter = _removed_queue_items.begin();
338 iter != _removed_queue_items.end(); iter++) {
339 for (SolverQueueItemList::const_iterator iterQueue = queue.begin(); iterQueue != queue.end(); iterQueue++) {
340 if ( (*iterQueue)->cmp(*iter) == 0) {
341 MIL <<
"remove from queue" << *iter;
342 queue.remove(*iterQueue);
348 for (SolverQueueItemList::const_iterator iter = _added_queue_items.begin();
349 iter != _added_queue_items.end(); iter++) {
351 for (SolverQueueItemList::const_iterator iterQueue = queue.begin(); iterQueue != queue.end(); iterQueue++) {
352 if ( (*iterQueue)->cmp(*iter) == 0) {
358 MIL <<
"add to queue" << *iter;
359 queue.push_back(*iter);
365 _removed_queue_items.clear();
366 _added_queue_items.clear();
368 return _satResolver->resolveQueue(queue, _addWeak);
375 ret.autoInstalled( _satResolver->autoInstalled() );
385 MIL <<
"Resolver::problems()" << endl;
386 return _satResolver->problems();
391 for ( ProblemSolution_Ptr solution : solutions )
393 if ( ! applySolution( *solution ) )
398 bool Resolver::applySolution(
const ProblemSolution & solution )
401 DBG <<
"apply solution " << solution << endl;
402 for ( SolutionAction_Ptr action : solution.actions() )
404 if ( ! action->execute( *
this ) )
406 WAR <<
"apply solution action failed: " << action << endl;
416 void Resolver::collectResolverInfo()
419 && _isInstalledBy.empty()
420 && _installs.empty()) {
423 PoolItemList itemsToInstall = _satResolver->resultItemsToInstall();
425 for (PoolItemList::const_iterator instIter = itemsToInstall.begin();
426 instIter != itemsToInstall.end(); instIter++) {
428 for (Capabilities::const_iterator capIt = (*instIter)->dep (
Dep::REQUIRES).begin(); capIt != (*instIter)->dep (
Dep::REQUIRES).end(); ++capIt)
430 sat::WhatProvides possibleProviders(*capIt);
431 for_( iter, possibleProviders.begin(), possibleProviders.end() ) {
436 bool alreadySetForInstallation =
false;
437 ItemCapKindMap::const_iterator pos = _isInstalledBy.find(provider);
438 while (pos != _isInstalledBy.end()
439 && pos->first == provider
441 alreadySetForInstallation =
true;
442 ItemCapKind capKind = pos->second;
443 if (capKind.item() == *instIter) found =
true;
448 && provider.status().isToBeInstalled()) {
449 if (provider.status().isBySolver()) {
450 ItemCapKind capKindisInstalledBy( *instIter, *capIt,
Dep::REQUIRES, !alreadySetForInstallation );
451 _isInstalledBy.insert (make_pair( provider, capKindisInstalledBy));
454 ItemCapKind capKindisInstalledBy( *instIter, *capIt,
Dep::REQUIRES,
false );
455 _isInstalledBy.insert (make_pair( provider, capKindisInstalledBy));
457 ItemCapKind capKindisInstalledBy( provider, *capIt,
Dep::REQUIRES, !alreadySetForInstallation );
458 _installs.insert (make_pair( *instIter, capKindisInstalledBy));
461 if (provider.status().staysInstalled()) {
462 ItemCapKind capKindisInstalledBy( provider, *capIt,
Dep::REQUIRES,
false );
463 _satifiedByInstalled.insert (make_pair( *instIter, capKindisInstalledBy));
465 ItemCapKind installedSatisfied( *instIter, *capIt,
Dep::REQUIRES,
false );
466 _installedSatisfied.insert (make_pair( provider, installedSatisfied));
471 if (!(_satResolver->onlyRequires())) {
475 sat::WhatProvides possibleProviders(*capIt);
476 for_( iter, possibleProviders.begin(), possibleProviders.end() ) {
481 bool alreadySetForInstallation =
false;
482 ItemCapKindMap::const_iterator pos = _isInstalledBy.find(provider);
483 while (pos != _isInstalledBy.end()
484 && pos->first == provider
486 alreadySetForInstallation =
true;
487 ItemCapKind capKind = pos->second;
488 if (capKind.item() == *instIter) found =
true;
493 && provider.status().isToBeInstalled()) {
494 if (provider.status().isBySolver()) {
495 ItemCapKind capKindisInstalledBy( *instIter, *capIt,
Dep::RECOMMENDS, !alreadySetForInstallation );
496 _isInstalledBy.insert (make_pair( provider, capKindisInstalledBy));
499 ItemCapKind capKindisInstalledBy( *instIter, *capIt,
Dep::RECOMMENDS,
false );
500 _isInstalledBy.insert (make_pair( provider, capKindisInstalledBy));
502 ItemCapKind capKindisInstalledBy( provider, *capIt,
Dep::RECOMMENDS, !alreadySetForInstallation );
503 _installs.insert (make_pair( *instIter, capKindisInstalledBy));
506 if (provider.status().staysInstalled()) {
507 ItemCapKind capKindisInstalledBy( provider, *capIt,
Dep::RECOMMENDS,
false );
508 _satifiedByInstalled.insert (make_pair( *instIter, capKindisInstalledBy));
510 ItemCapKind installedSatisfied( *instIter, *capIt,
Dep::RECOMMENDS,
false );
511 _installedSatisfied.insert (make_pair( provider, installedSatisfied));
519 sat::WhatProvides possibleProviders(*capIt);
520 for_( iter, possibleProviders.begin(), possibleProviders.end() ) {
524 bool alreadySetForInstallation =
false;
525 ItemCapKindMap::const_iterator pos = _isInstalledBy.find(*instIter);
526 while (pos != _isInstalledBy.end()
527 && pos->first == *instIter
529 alreadySetForInstallation =
true;
530 ItemCapKind capKind = pos->second;
531 if (capKind.item() == provider) found =
true;
536 && instIter->status().isToBeInstalled()) {
537 if (instIter->status().isBySolver()) {
538 ItemCapKind capKindisInstalledBy( provider, *capIt,
Dep::SUPPLEMENTS, !alreadySetForInstallation );
539 _isInstalledBy.insert (make_pair( *instIter, capKindisInstalledBy));
542 ItemCapKind capKindisInstalledBy( provider, *capIt,
Dep::SUPPLEMENTS,
false );
543 _isInstalledBy.insert (make_pair( *instIter, capKindisInstalledBy));
545 ItemCapKind capKindisInstalledBy( *instIter, *capIt,
Dep::SUPPLEMENTS, !alreadySetForInstallation );
546 _installs.insert (make_pair( provider, capKindisInstalledBy));
549 if (instIter->status().staysInstalled()) {
550 ItemCapKind capKindisInstalledBy( *instIter, *capIt,
Dep::SUPPLEMENTS, !alreadySetForInstallation );
551 _satifiedByInstalled.insert (make_pair( provider, capKindisInstalledBy));
553 ItemCapKind installedSatisfied( provider, *capIt,
Dep::SUPPLEMENTS,
false );
554 _installedSatisfied.insert (make_pair( *instIter, installedSatisfied));
567 collectResolverInfo();
569 for (ItemCapKindMap::const_iterator iter = _isInstalledBy.find(item); iter != _isInstalledBy.end();) {
570 ItemCapKind info = iter->second;
571 PoolItem iterItem = iter->first;
572 if (iterItem == item) {
577 iter = _isInstalledBy.end();
586 collectResolverInfo();
588 for (ItemCapKindMap::const_iterator iter = _installs.find(item); iter != _installs.end();) {
589 ItemCapKind info = iter->second;
590 PoolItem iterItem = iter->first;
591 if (iterItem == item) {
596 iter = _installs.end();
605 collectResolverInfo();
607 for (ItemCapKindMap::const_iterator iter = _satifiedByInstalled.find(item); iter != _satifiedByInstalled.end();) {
608 ItemCapKind info = iter->second;
609 PoolItem iterItem = iter->first;
610 if (iterItem == item) {
615 iter = _satifiedByInstalled.end();
624 collectResolverInfo();
626 for (ItemCapKindMap::const_iterator iter = _installedSatisfied.find(item); iter != _installedSatisfied.end();) {
627 ItemCapKind info = iter->second;
628 PoolItem iterItem = iter->first;
629 if (iterItem == item) {
634 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
static ZConfig & instance()
Singleton ctor.
virtual std::ostream & dumpOn(std::ostream &str) const
Overload to realize std::ostream & operator<<.
PoolItem find(const sat::Solvable &slv_r) const
Return the corresponding PoolItem.
ResolverFocus
The resolvers general attitude.
void setCleandepsOnRemove(bool yesno_r)
Cleanup when deleting packages.
ResStatus & status() const
Returns the current status.
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 ).
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.
std::list< PoolItem > problematicUpdateItems() const
Unmaintained packages which does not fit to the updated system (broken dependencies) will be deleted...
ResolverFocus focus() const
ResStatus::TransactByValue resStatus
std::unary_function< PoolItem, bool > PoolItemFilterFunctor
Interim helper class to collect global options and settings.
static const Dep REQUIRES
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
ResolverFocus solver_focus() const
The resolvers general attitude when resolving jobs.
bool solver_cleandepsOnRemove() const
Whether removing a package should also remove no longer needed requirements.
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.
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.
Easy-to use interface to the ZYPP dependency resolver.
Resolver(const ResPool &pool)
Ctor.
static ResPool instance()
Singleton ctor.