/
Pattern.cc
295 lines (257 loc) · 9.41 KB
/
Pattern.cc
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
/*---------------------------------------------------------------------\
| ____ _ __ __ ___ |
| |__ / \ / / . \ . \ |
| / / \ V /| _/ _/ |
| / /__ | | | | | | |
| /_____||_| |_| |_| |
| |
\---------------------------------------------------------------------*/
/** \file zypp/Pattern.cc
*
*/
#include <iostream>
#include "zypp/base/LogTools.h"
#include "zypp/ResPool.h"
#include "zypp/Pattern.h"
#include "zypp/Filter.h"
using std::endl;
///////////////////////////////////////////////////////////////////
namespace zypp
{
///////////////////////////////////////////////////////////////////
namespace
{
inline Capability autoCapability( const Capabilities & provides_r )
{
static const Capability autopattern( "autopattern()" );
for ( const auto & cap : provides_r )
if ( cap.matches( autopattern ) == CapMatch::yes )
return cap;
return Capability();
}
///////////////////////////////////////////////////////////////////
//
// CLASS NAME : PatternExpander
//
/** Recursively expand a Pattern.
*
* This means recursively expanding Patterns included by this or
* extending this. The result is a \c set of <tt>Pattern::constPtr</tt>
* accessible via iterator.
*/
class PatternExpander
{
public:
typedef std::map<Pattern::constPtr, DefaultIntegral<bool, false> > PatternMap;
typedef PatternMap::size_type size_type;
typedef PatternMap::key_type value_type;
typedef MapKVIteratorTraits<PatternMap>::Key_const_iterator const_iterator;
public:
PatternExpander()
{}
/** Recursively expand Pattern. */
size_type doExpand( Pattern::constPtr pat_r )
{
// INT << "+++ " << pat_r << " ++++++++++++++++++++++++++++++++++" << endl;
_patternMap.clear();
if ( pat_r )
{
_patternMap[pat_r];
Pattern::constPtr unprocessed( pat_r );
// MIL << _patternMap << endl;
do {
expandIncludes( unprocessed );
expandExtending( unprocessed );
_patternMap[unprocessed] = true;
// MIL << _patternMap << endl;
} while( (unprocessed = nextUnprocessed()) );
}
// SEC << "--- " << _patternMap.size() << " ----------------------------------" << endl;
return _patternMap.size();
}
const_iterator begin() const
{ return make_map_key_begin( _patternMap ); }
const_iterator end() const
{ return make_map_key_end( _patternMap ); }
private:
/** Get the next unprocessed Pattern in \c _patternMap. */
Pattern::constPtr nextUnprocessed() const
{
for_( it, _patternMap.begin(), _patternMap.end() )
{
if ( ! it->second )
return it->first;
}
return NULL;
}
private:
/** Store all included patterns in \c _patternMap. */
void expandIncludes( const Pattern::constPtr & pat_r )
{
Pattern::NameList c( pat_r->includes() );
for_( it, c.begin(), c.end() )
{
expandInclude( Capability( it->c_str()/*, *ResKind::pattern*/ ) );
}
}
/** Store Patterns matching an \c Includes capability in \c _patternMap. */
void expandInclude( const Capability & include_r )
{
sat::WhatProvides w( include_r );
for_( it, w.begin(), w.end() )
{
_patternMap[asKind<Pattern>(PoolItem(*it))];
}
}
private:
/** Store all patterns extending \c pat_r in \c _patternMap. */
void expandExtending( const Pattern::constPtr & pat_r )
{
ResPool pool( ResPool::instance() );
for_( it, pool.byKindBegin<Pattern>(), pool.byKindEnd<Pattern>() )
{
expandIfExtends( pat_r, *it );
}
}
/** Store \c extending_r if it extends \c pat_r. */
void expandIfExtends( const Pattern::constPtr & pat_r, const PoolItem & extending_r )
{
Pattern::constPtr extending( asKind<Pattern>(extending_r) );
Pattern::NameList c( extending->extends() );
for_( it, c.begin(), c.end() )
{
if ( providedBy( pat_r, Capability( it->c_str()/*, *ResKind::pattern*/ ) ) )
{
// an extends matches the Pattern
_patternMap[extending];
break;
}
}
}
/** Return true if Capability \c extends_r is provided by Pattern. */
bool providedBy( const Pattern::constPtr & pat_r, const Capability & extends_r )
{
if ( !pat_r )
return false;
sat::Solvable pat( pat_r->satSolvable() );
sat::WhatProvides w( extends_r );
for_( it, w.begin(), w.end() )
{
if ( pat == *it )
return true;
}
return false;
}
private:
PatternMap _patternMap;
};
} // namespace
///////////////////////////////////////////////////////////////////
///////////////////////////////////////////////////////////////////
// Pattern
///////////////////////////////////////////////////////////////////
IMPL_PTR_TYPE(Pattern);
Pattern::Pattern( const sat::Solvable & solvable_r )
: ResObject( solvable_r )
{}
Pattern::~Pattern()
{}
bool Pattern::isDefault() const
{ return lookupBoolAttribute( sat::SolvAttr::isdefault ); }
bool Pattern::userVisible() const
{ return lookupBoolAttribute( sat::SolvAttr::isvisible ); }
std::string Pattern::category( const Locale & lang_r ) const
{ return lookupStrAttribute( sat::SolvAttr::category, lang_r ); }
Pathname Pattern::icon() const
{ return lookupStrAttribute( sat::SolvAttr::icon ); }
Pathname Pattern::script() const
{ return lookupStrAttribute( sat::SolvAttr::script ); }
std::string Pattern::order() const
{ return lookupStrAttribute( sat::SolvAttr::order ); }
bool Pattern::isAutoPattern() const
{ return bool(autoCapability( provides() )); }
sat::Solvable Pattern::autoPackage() const
{
Capability autocap( autoCapability( provides() ) );
if ( autocap )
{
Capability pkgCap( arch(), autocap.detail().ed().asString(), Rel::EQ, edition() );
for ( const auto & solv: sat::WhatProvides( pkgCap ) )
if ( solv.repository() == repository() )
return solv;
}
return sat::Solvable();
}
Pattern::NameList Pattern::includes() const
{ return NameList( sat::SolvAttr::includes, satSolvable() ); }
Pattern::NameList Pattern::extends() const
{ return NameList( sat::SolvAttr::extends, satSolvable() ); }
///////////////////////////////////////////////////////////////////
namespace
{
inline void addCaps( CapabilitySet & caps_r, sat::Solvable solv_r, Dep dep_r )
{
Capabilities c( solv_r[dep_r] );
if ( ! c.empty() )
{
caps_r.insert( c.begin(),c.end() );
}
}
} //namespace
///////////////////////////////////////////////////////////////////
Pattern::Contents Pattern::core() const
{
// Content dependencies are either associated with
// the autoPackage or the (oldstype) pattern itself.
// load requires
CapabilitySet caps;
addCaps( caps, *this, Dep::REQUIRES );
sat::Solvable depKeeper( autoPackage() );
if ( depKeeper )
addCaps( caps, depKeeper, Dep::REQUIRES );
// get items providing the requirements
sat::WhatProvides prv( caps );
// return packages only.
return Pattern::Contents( make_filter_begin( filter::byKind<Package>(), prv ),
make_filter_end( filter::byKind<Package>(), prv ) );
}
Pattern::Contents Pattern::depends( bool includeSuggests_r ) const
{
// Content dependencies are either associated with
// the autoPackage or the (oldstype) pattern itself.
// load requires, recommends[, suggests]
CapabilitySet caps;
addCaps( caps, *this, Dep::REQUIRES );
addCaps( caps, *this, Dep::RECOMMENDS );
if ( includeSuggests_r )
addCaps( caps, *this, Dep::SUGGESTS );
sat::Solvable depKeeper( autoPackage() );
if ( depKeeper )
{
addCaps( caps, depKeeper, Dep::REQUIRES );
addCaps( caps, depKeeper, Dep::RECOMMENDS );
if ( includeSuggests_r )
addCaps( caps, depKeeper, Dep::SUGGESTS );
}
// get items providing the above
sat::WhatProvides prv( caps );
// return packages only.
return Pattern::Contents( make_filter_begin( filter::byKind<Package>(), prv ),
make_filter_end( filter::byKind<Package>(), prv ) );
}
Pattern::Contents Pattern::contents( bool includeSuggests_r ) const
{
PatternExpander expander;
if ( ! expander.doExpand( this ) )
return Contents(); // empty pattern set
Contents result;
for_( it, expander.begin(), expander.end() )
{
Contents c( (*it)->depends( includeSuggests_r ) );
result.get().insert( c.begin(), c.end() );
}
return result;
}
/////////////////////////////////////////////////////////////////
} // namespace zypp
///////////////////////////////////////////////////////////////////