13#include <solv/transaction.h>
14#include <solv/solver.h>
17#include <zypp/base/LogTools.h>
19#include <zypp-core/base/DefaultIntegral>
20#include <zypp/base/NonCopyable.h>
21#include <zypp/base/Hash.h>
23#include <zypp/sat/detail/PoolImpl.h>
55 typedef std::unordered_set<detail::IdType>
set_type;
56 typedef std::unordered_map<detail::IdType,detail::IdType>
map_type;
65 ,
_arch( solv_r.arch() )
72 typedef std::unordered_map<detail::IdType,PostMortem>
pmmap_type;
86 if ( ! pi.status().transacts() )
88 decisionq.
push( pi.isSystem() ? -pi.id() : pi.id() );
93 noobsq.
push( SOLVER_NOOBSOLETES | SOLVER_SOLVABLE );
94 noobsq.
push( solv.id() );
97 ::solver_calculate_noobsmap(
myPool().getPool(), noobsq, noobsmap );
98 _trans = ::transaction_create_decisionq(
myPool().getPool(), decisionq, noobsmap );
130 { ::transaction_free(
_trans ); }
146 ::transaction_order(
_trans, SOLVER_TRANSACTION_KEEP_ORDERDATA );
152 int ret = transaction_order_add_choices(
_trans, chosen, choices );
153 MIL << ret <<
": " << chosen <<
": " << choices << endl;
162 ::transaction_order(
_trans, 0 );
169 {
return(
_trans->steps.count == 0 ); }
172 {
return _trans->steps.count; }
191 { return ::transaction_installedresult(
_trans, result_r ); }
208 switch( ::transaction_type(
_trans, solv_r.
id(), SOLVER_TRANSACTION_RPM_ONLY ) )
226 pmmap_type::const_iterator it(
_pmMap.find( solv_r.
id() ) );
227 return( it ==
_pmMap.end() ? _none : it->second );
233 map_type::const_iterator res(
_linkMap.find( solv_r.
id() ) );
234 return( res ==
_linkMap.end() ? solv_r.
id() : res->second );
238 {
return( set_r.find( sid_r ) != set_r.end() ); }
252 if ( stage != newval_r )
269 if ( solv_r &&
_trans->steps.elements )
297 static shared_ptr<Impl> _nullimpl(
new Impl );
305 return str <<
"Transaction: " << obj.
size() <<
" (" << (obj.
valid()?
"valid":
"INVALID") <<
")";
315 : _pimpl(
Impl::nullimpl() )
319 : _pimpl( new
Impl( loadFromPool ) )
326 {
return _pimpl->valid(); }
329 {
return _pimpl->order(); }
332 {
return _pimpl->empty(); }
335 {
return _pimpl->size(); }
356 {
return _pimpl->installedResult( result_r ); }
359 {
return _pimpl->autoInstalled(); }
362 {
_pimpl->autoInstalled( queue_r ); }
389 {
return _pimpl->stepType( _solv ); }
392 {
return _pimpl->stepStage( _solv ); }
395 {
_pimpl->stepStage( _solv, val_r ); }
398 {
return _solv ? _solv.ident() :
_pimpl->pmdata(_solv )._ident; }
401 {
return _solv ? _solv.edition() :
_pimpl->pmdata(_solv )._edition; }
404 {
return _solv ? _solv.arch() :
_pimpl->pmdata(_solv )._arch; }
420 #define OUTS(E,S) case Transaction::E: return str << #S; break
434 #define OUTS(E,S) case Transaction::E: return str << #S; break
440 return str <<
"[??]";
451 Transaction_const_iterator::Transaction_const_iterator()
457 , _pimpl( iter_r._pimpl )
Integral type with defined initial value when default constructed.
Edition represents [epoch:]version[-release]
Access to the sat-pools string space.
Combining sat::Solvable and ResStatus.
sat::Solvable buddy() const
Return the buddy we share our status object with.
static ResPool instance()
Singleton ctor.
Simple serial number watcher.
bool isClean(unsigned serial_r) const
Return whether serial_r is still unchanged.
Libsolv (bit)Map wrapper.
Libsolv Id queue wrapper.
value_type pop_front()
Pop and return the 1st Id from the queue or 0 if empty.
void push(value_type val_r)
Push a value to the end off the Queue.
A Solvable object within the sat Pool.
IdType id() const
Expert backdoor.
bool isSystem() const
Return whether this Solvable belongs to the system repo.
bool isKind(const ResKind &kind_r) const
Test whether a Solvable is of a certain ResKind.
A single step within a Transaction.
StepType stepType() const
Type of action to perform in this step.
StepStage stepStage() const
Step action result.
Solvable satSolvable() const
Return the corresponding Solvable.
Libsolv transaction wrapper.
const_iterator end() const
Iterator behind the last TransactionStep.
RW_pointer< Impl > _pimpl
Pointer to implementation.
int installedResult(Queue &result_r) const
Return all packages that would be installed after the transaction is run.
StringQueue autoInstalled() const
Return the ident strings of all packages that would be auto-installed after the transaction is run.
const_iterator begin() const
Iterator to the first TransactionStep.
bool valid() const
Whether transaction actually contains data and also fits the current pools content.
Transaction()
Default ctor: empty transaction.
bool order()
Order transaction steps for commit.
friend std::ostream & operator<<(std::ostream &str, const Transaction &obj)
static constexpr LoadFromPoolType loadFromPool
detail::Transaction_const_iterator const_iterator
const_iterator find(const sat::Solvable &solv_r) const
Return iterator pointing to solv_r or end.
StepType
Type of (rpm) action to perform in a Step.
@ TRANSACTION_MULTIINSTALL
[M] Install(multiversion) item (
@ TRANSACTION_INSTALL
[+] Install(update) item
@ TRANSACTION_IGNORE
[ ] Nothing (includes implicit deletes due to obsoletes and non-package actions)
@ TRANSACTION_ERASE
[-] Delete item
detail::Transaction_iterator iterator
size_t size() const
Number of steps in transaction steps.
StepStage
Step action result.
@ STEP_TODO
[__] unprocessed
bool empty() const
Whether the transaction contains any steps.
Transaction const_iterator.
Transaction_const_iterator()
String related utilities and Regular expression matching.
boost::noncopyable NonCopyable
Ensure derived classes cannot be copied.
int IdType
Generic Id type.
std::ostream & operator<<(std::ostream &str, const FileConflicts &obj)
std::ostream & dumpOn(std::ostream &str, const LocaleSupport &obj)
bool operator==(const Map &lhs, const Map &rhs)
Easy-to use interface to the ZYPP dependency resolver.
Wrapper for const correct access via Smart pointer types.
PostMortem(const sat::Solvable &solv_r)
Transaction implementation.
void stepStage(Solvable solv_r, StepStage newval_r)
const_iterator find(const RW_pointer< Transaction::Impl > &self_r, const sat::Solvable &solv_r) const
void autoInstalled(const StringQueue &queue_r)
int installedResult(Queue &result_r) const
StringQueue _autoInstalled
iterator end(const RW_pointer< Transaction::Impl > &self_r)
SerialNumberWatcher _watcher
static shared_ptr< Impl > nullimpl()
Offer default Impl.
iterator find(const RW_pointer< Transaction::Impl > &self_r, const sat::Solvable &solv_r)
detail::IdType resolve(const Solvable &solv_r) const
std::unordered_map< detail::IdType, PostMortem > pmmap_type
friend std::ostream & operator<<(std::ostream &str, const Impl &obj)
DefaultIntegral< bool, false > _ordered
StepStage stepStage(Solvable solv_r) const
mutable::Transaction * _trans
bool isIn(const set_type &set_r, detail::IdType sid_r) const
detail::IdType * _find(const sat::Solvable &solv_r) const
std::unordered_map< detail::IdType, detail::IdType > map_type
std::unordered_set< detail::IdType > set_type
const_iterator end(const RW_pointer< Transaction::Impl > &self_r) const
StepType stepType(Solvable solv_r) const
const PostMortem & pmdata(Solvable solv_r) const
iterator begin(const RW_pointer< Transaction::Impl > &self_r)
const_iterator begin(const RW_pointer< Transaction::Impl > &self_r) const
StringQueue autoInstalled() const
std::ostream & operator<<(std::ostream &str, const Transaction::Impl &obj)
Stream output.
StepStage stepStage(detail::IdType sid_r) const
void stepStage(detail::IdType sid_r, StepStage newval_r)
Backlink to the associated PoolImpl.
static PoolImpl & myPool()
#define for_(IT, BEG, END)
Convenient for-loops using iterator.