1 /*---------------------------------------------------------------------\
3 | |__ / \ / / . \ . \ |
8 \---------------------------------------------------------------------*/
9 /** \file zypp/Pattern.cc
13 #include "zypp/base/LogTools.h"
15 #include "zypp/ResPool.h"
16 #include "zypp/Pattern.h"
17 #include "zypp/Filter.h"
21 ///////////////////////////////////////////////////////////////////
24 ///////////////////////////////////////////////////////////////////
27 inline Capability autoCapability( const Capabilities & provides_r )
29 static const Capability autopattern( "autopattern()" );
30 for ( const auto & cap : provides_r )
31 if ( cap.matches( autopattern ) == CapMatch::yes )
36 ///////////////////////////////////////////////////////////////////
38 // CLASS NAME : PatternExpander
40 /** Recursively expand a Pattern.
42 * This means recursively expanding Patterns included by this or
43 * extending this. The result is a \c set of <tt>Pattern::constPtr</tt>
44 * accessible via iterator.
49 typedef std::map<Pattern::constPtr, DefaultIntegral<bool, false> > PatternMap;
50 typedef PatternMap::size_type size_type;
51 typedef PatternMap::key_type value_type;
52 typedef MapKVIteratorTraits<PatternMap>::Key_const_iterator const_iterator;
58 /** Recursively expand Pattern. */
59 size_type doExpand( Pattern::constPtr pat_r )
61 // INT << "+++ " << pat_r << " ++++++++++++++++++++++++++++++++++" << endl;
66 Pattern::constPtr unprocessed( pat_r );
67 // MIL << _patternMap << endl;
69 expandIncludes( unprocessed );
70 expandExtending( unprocessed );
71 _patternMap[unprocessed] = true;
72 // MIL << _patternMap << endl;
73 } while( (unprocessed = nextUnprocessed()) );
75 // SEC << "--- " << _patternMap.size() << " ----------------------------------" << endl;
76 return _patternMap.size();
79 const_iterator begin() const
80 { return make_map_key_begin( _patternMap ); }
82 const_iterator end() const
83 { return make_map_key_end( _patternMap ); }
86 /** Get the next unprocessed Pattern in \c _patternMap. */
87 Pattern::constPtr nextUnprocessed() const
89 for_( it, _patternMap.begin(), _patternMap.end() )
98 /** Store all included patterns in \c _patternMap. */
99 void expandIncludes( const Pattern::constPtr & pat_r )
101 Pattern::NameList c( pat_r->includes() );
102 for_( it, c.begin(), c.end() )
104 expandInclude( Capability( it->c_str()/*, *ResKind::pattern*/ ) );
108 /** Store Patterns matching an \c Includes capability in \c _patternMap. */
109 void expandInclude( const Capability & include_r )
111 sat::WhatProvides w( include_r );
112 for_( it, w.begin(), w.end() )
114 _patternMap[asKind<Pattern>(PoolItem(*it))];
119 /** Store all patterns extending \c pat_r in \c _patternMap. */
120 void expandExtending( const Pattern::constPtr & pat_r )
122 ResPool pool( ResPool::instance() );
123 for_( it, pool.byKindBegin<Pattern>(), pool.byKindEnd<Pattern>() )
125 expandIfExtends( pat_r, *it );
129 /** Store \c extending_r if it extends \c pat_r. */
130 void expandIfExtends( const Pattern::constPtr & pat_r, const PoolItem & extending_r )
132 Pattern::constPtr extending( asKind<Pattern>(extending_r) );
133 Pattern::NameList c( extending->extends() );
134 for_( it, c.begin(), c.end() )
136 if ( providedBy( pat_r, Capability( it->c_str()/*, *ResKind::pattern*/ ) ) )
138 // an extends matches the Pattern
139 _patternMap[extending];
145 /** Return true if Capability \c extends_r is provided by Pattern. */
146 bool providedBy( const Pattern::constPtr & pat_r, const Capability & extends_r )
151 sat::Solvable pat( pat_r->satSolvable() );
152 sat::WhatProvides w( extends_r );
153 for_( it, w.begin(), w.end() )
162 PatternMap _patternMap;
165 ///////////////////////////////////////////////////////////////////
167 ///////////////////////////////////////////////////////////////////
169 ///////////////////////////////////////////////////////////////////
171 IMPL_PTR_TYPE(Pattern);
173 Pattern::Pattern( const sat::Solvable & solvable_r )
174 : ResObject( solvable_r )
180 bool Pattern::isDefault() const
181 { return lookupBoolAttribute( sat::SolvAttr::isdefault ); }
183 bool Pattern::userVisible() const
184 { return lookupBoolAttribute( sat::SolvAttr::isvisible ); }
186 std::string Pattern::category( const Locale & lang_r ) const
187 { return lookupStrAttribute( sat::SolvAttr::category, lang_r ); }
189 Pathname Pattern::icon() const
190 { return lookupStrAttribute( sat::SolvAttr::icon ); }
192 Pathname Pattern::script() const
193 { return lookupStrAttribute( sat::SolvAttr::script ); }
195 std::string Pattern::order() const
196 { return lookupStrAttribute( sat::SolvAttr::order ); }
198 bool Pattern::isAutoPattern() const
199 { return bool(autoCapability( provides() )); }
201 sat::Solvable Pattern::autoPackage() const
203 Capability autocap( autoCapability( provides() ) );
206 Capability pkgCap( arch(), autocap.detail().ed().asString(), Rel::EQ, edition() );
207 for ( const auto & solv: sat::WhatProvides( pkgCap ) )
208 if ( solv.repository() == repository() )
211 return sat::Solvable();
214 Pattern::NameList Pattern::includes() const
215 { return NameList( sat::SolvAttr::includes, satSolvable() ); }
217 Pattern::NameList Pattern::extends() const
218 { return NameList( sat::SolvAttr::extends, satSolvable() ); }
220 ///////////////////////////////////////////////////////////////////
223 inline void addCaps( CapabilitySet & caps_r, sat::Solvable solv_r, Dep dep_r )
225 Capabilities c( solv_r[dep_r] );
228 caps_r.insert( c.begin(),c.end() );
232 ///////////////////////////////////////////////////////////////////
234 Pattern::Contents Pattern::core() const
236 // Content dependencies are either associated with
237 // the autoPackage or the (oldstype) pattern itself.
240 addCaps( caps, *this, Dep::REQUIRES );
242 sat::Solvable depKeeper( autoPackage() );
244 addCaps( caps, depKeeper, Dep::REQUIRES );
245 // get items providing the requirements
246 sat::WhatProvides prv( caps );
247 // return packages only.
248 return Pattern::Contents( make_filter_begin( filter::byKind<Package>(), prv ),
249 make_filter_end( filter::byKind<Package>(), prv ) );
252 Pattern::Contents Pattern::depends( bool includeSuggests_r ) const
254 // Content dependencies are either associated with
255 // the autoPackage or the (oldstype) pattern itself.
256 // load requires, recommends[, suggests]
258 addCaps( caps, *this, Dep::REQUIRES );
259 addCaps( caps, *this, Dep::RECOMMENDS );
260 if ( includeSuggests_r )
261 addCaps( caps, *this, Dep::SUGGESTS );
263 sat::Solvable depKeeper( autoPackage() );
266 addCaps( caps, depKeeper, Dep::REQUIRES );
267 addCaps( caps, depKeeper, Dep::RECOMMENDS );
268 if ( includeSuggests_r )
269 addCaps( caps, depKeeper, Dep::SUGGESTS );
271 // get items providing the above
272 sat::WhatProvides prv( caps );
273 // return packages only.
274 return Pattern::Contents( make_filter_begin( filter::byKind<Package>(), prv ),
275 make_filter_end( filter::byKind<Package>(), prv ) );
278 Pattern::Contents Pattern::contents( bool includeSuggests_r ) const
280 PatternExpander expander;
281 if ( ! expander.doExpand( this ) )
282 return Contents(); // empty pattern set
285 for_( it, expander.begin(), expander.end() )
287 Contents c( (*it)->depends( includeSuggests_r ) );
288 result.get().insert( c.begin(), c.end() );
293 /////////////////////////////////////////////////////////////////
295 ///////////////////////////////////////////////////////////////////