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
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
|
// test_apt_universe.cc -*-c++-*-
//
// Copyright (C) 2005 Daniel Burrows
//
// This program is free software; you can redistribute it and/or
// modify it under the terms of the GNU General Public License as
// published by the Free Software Foundation; either version 2 of
// the License, or (at your option) any later version.
//
// This program is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
// General Public License for more details.
//
// You should have received a copy of the GNU General Public License
// along with this program; see the file COPYING. If not, write to
// the Free Software Foundation, Inc., 59 Temple Place - Suite 330,
// Boston, MA 02111-1307, USA.
//
// A test of the aptitude universe wrapper.
#include <generic/aptitude_resolver_universe.h>
#include <generic/config_signal.h>
#include <generic/immset.h>
#include <generic/problemresolver/solution.h>
#include <generic/undo.h>
#include <cppunit/extensions/HelperMacros.h>
#include <apt-pkg/error.h>
#include <sstream>
typedef generic_solution<aptitude_universe> aptitude_solution;
class AptUniverseTest : public CppUnit::TestFixture
{
CPPUNIT_TEST_SUITE(AptUniverseTest);
CPPUNIT_TEST(testSolves);
CPPUNIT_TEST(testBrokenList);
CPPUNIT_TEST(testInteresting);
CPPUNIT_TEST(testReverseConnectivity);
CPPUNIT_TEST_SUITE_END();
public:
void setUp()
{
apt_preinit();
_error->Discard();
// These state locations are set up for the case of running the
// program from the 'tests' directory.
aptcfg->Set("Dir::Etc", "./data");
aptcfg->Set("Dir::State::Lists", "./data/lists");
aptcfg->Set("Dir::State::status", "./data/dpkg/status");
aptcfg->Set("Dir::Aptitude::state", "./data");
OpProgress p;
apt_init(&p, false);
_error->DumpErrors();
}
void tearDown()
{
// TODO: close the global cache file.
}
/** Test that solved_by() is a precise representation of the
* dependency solver graph, and incidentally (just to be anal) test
* that solvers appear exactly once in the global versions list and
* that each solver appears there.
*
* NB: so that this test terminates before the end of the
* millenium, I placed a limit on the number of dependencies to
* check thoroughly. That number of dependencies are checked in
* the fullest way possible; the remainder are subjected to a more
* cursory check that should nevertheless detect the most likely
* source of problems.
*/
void testSolves()
{
CPPUNIT_ASSERT(apt_cache_file != NULL);
aptitude_universe u(*apt_cache_file);
int dep_count = 500;
for(aptitude_universe::dep_iterator di = u.deps_begin();
!di.end(); ++di, dep_count = dep_count > 0 ? dep_count-1 : dep_count)
{
aptitude_universe::dep d = *di;
std::set<aptitude_universe::version> solvers;
for(aptitude_universe::dep::solver_iterator si
= d.solvers_begin(); !si.end(); ++si)
{
if(!d.solved_by(*si))
{
std::ostringstream out;
out << (*si).get_package().get_name() << " "
<< (*si).get_name()
<< " should solve "
<< d << " but doesn't.";
CPPUNIT_FAIL(out.str());
}
solvers.insert(*si);
}
if(dep_count > 0)
{
for(aptitude_universe::package_iterator pi
= u.packages_begin(); !pi.end(); ++pi)
for(aptitude_universe::package::version_iterator vi
= (*pi).versions_begin(); !vi.end(); ++vi)
{
if((*pi) == d.get_source().get_package())
{
if(*vi == d.get_source())
{
if(d.solved_by(*vi))
{
std::ostringstream out;
out << "Dependency source "
<< (*vi).get_package().get_name() << " "
<< (*vi).get_name()
<< " unexpectedly solves " << d;
CPPUNIT_FAIL(out.str());
}
}
else if(!d.solved_by(*vi))
{
std::ostringstream out;
out << "Dependency source removal "
<< (*vi).get_package().get_name() << " "
<< (*vi).get_name()
<< " unexpectedly doesn't solve " << d;
CPPUNIT_FAIL(out.str());
}
}
else if(solvers.find(*vi) == solvers.end())
{
if(d.solved_by(*vi))
{
std::ostringstream out;
out << (*vi).get_package().get_name() << " "
<< (*vi).get_name()
<< " unexpectedly solves "
<< d;
CPPUNIT_FAIL(out.str());
}
}
else
solvers.erase(*vi);
}
if(!solvers.empty())
{
std::ostringstream out;
for(std::set<aptitude_universe::version>::const_iterator
si = solvers.begin(); si != solvers.end(); ++si)
out << "Solver " << (*si).get_package().get_name()
<< " " << (*si).get_name() << " of dependency "
<< d << " does not appear in the global list of versions!";
CPPUNIT_FAIL(out.str());
}
}
else
for(std::set<aptitude_universe::version>::const_iterator si
= solvers.begin(); si != solvers.end(); ++si)
for(aptitude_universe::package::version_iterator vi
= (*si).get_package().versions_begin();
!vi.end(); ++vi)
{
if(solvers.find(*vi) == solvers.end() &&
(*vi == (*di).get_source() || (*vi).get_package() != (*di).get_source().get_package()) &&
(*di).solved_by(*vi))
{
std::ostringstream out;
out << (*vi).get_package().get_name() << " "
<< (*vi).get_name() << " should not solve "
<< d << " but does.";
CPPUNIT_FAIL(out.str());
}
}
}
}
// Ensure that brokenness corresponds to in-the-broken-listness.
void testBrokenList()
{
undo_group *undo = new undo_group;
(*apt_cache_file)->mark_all_upgradable(true, undo);
aptitude_universe u(*apt_cache_file);
imm::set<aptitude_resolver_dep> broken;
for(aptitude_universe::broken_dep_iterator bi = u.broken_begin();
!bi.end(); ++bi)
broken.insert(*bi);
aptitude_solution s = aptitude_solution::root_node(broken,
u,
solution_weights(0, 0, 0, 0, 0));
for(aptitude_universe::dep_iterator di = u.deps_begin();
!di.end(); ++di)
{
aptitude_resolver_dep d = *di;
if(broken.contains(d))
CPPUNIT_ASSERT(d.broken_under(s));
else
CPPUNIT_ASSERT(!d.broken_under(s));
}
undo->undo();
delete undo;
}
// Ensure that all dependencies in the world really are interesting.
void testInteresting()
{
aptitude_universe u(*apt_cache_file);
for(aptitude_universe::dep_iterator di = u.deps_begin();
!di.end(); ++di)
{
if(!is_interesting_dep((*di).get_dep(), *apt_cache_file))
{
std::ostringstream out;
out << *di << " is uninteresting but is in the global dep list.";
CPPUNIT_FAIL(out.str());
}
}
for(aptitude_universe::package_iterator pi
= u.packages_begin(); !pi.end(); ++pi)
for(aptitude_universe::package::version_iterator vi
= (*pi).versions_begin(); !vi.end(); ++vi)
{
for(aptitude_universe::version::dep_iterator di
= (*vi).deps_begin(); !di.end(); ++di)
if(!is_interesting_dep((*di).get_dep(), *apt_cache_file))
{
std::ostringstream out;
out << *di << " is uninteresting but is in the dep list for " << (*pi).get_name() << " " << (*vi).get_name();
CPPUNIT_FAIL(out.str());
}
for(aptitude_universe::version::revdep_iterator rdi
= (*vi).revdeps_begin(); !rdi.end(); ++rdi)
if(!is_interesting_dep((*rdi).get_dep(), *apt_cache_file))
{
std::ostringstream out;
out << *rdi << " is uninteresting but is in the reverse dep list for " << (*pi).get_name() << " " << (*vi).get_name();
CPPUNIT_FAIL(out.str());
}
}
}
void dump_revdeps(std::ostream &out, const aptitude_universe::version v)
{
out << "Reverse dependencies of "
<< v.get_package().get_name() << " "
<< v.get_name() << " are:" << std::endl;
for(aptitude_universe::version::revdep_iterator rdi
= v.revdeps_begin(); !rdi.end(); ++rdi)
{
out << *rdi
<< "(" << (pkgCache::Dependency *) (*rdi).get_dep()
<< ":" << (pkgCache::Provides *) (*rdi).get_prv() << ")"
<< std::endl;
}
if(v.get_ver().end())
return;
out << "Low-level reverse dependencies of "
<< v.get_package().get_name() << " "
<< v.get_name() << " are:" << std::endl;
for(pkgCache::DepIterator d = v.get_pkg().RevDependsList();
!d.end(); ++d)
{
out << d.ParentPkg().Name() << " " << d.ParentVer().VerStr()
<< " " << d.DepType() << " " << d.TargetPkg().Name();
if(d.TargetVer() != NULL)
out << "(" << d.CompType() << " " << d.TargetVer() << ")";
if(is_interesting_dep(d, *apt_cache_file))
out << "[INTERESTING]";
out << std::endl;
}
}
void testReverseConnectivity()
{
CPPUNIT_ASSERT(apt_cache_file != NULL);
aptitude_universe u(*apt_cache_file);
// For each dep, look at each of its solvers. For every /other/
// version of the solver that is not itself a solver, the
// dependency should appear in one of their revdep lists.
for(aptitude_universe::dep_iterator di = u.deps_begin();
!di.end(); ++di)
for(aptitude_universe::dep::solver_iterator si
= (*di).solvers_begin(); !si.end(); ++si)
{
if(!is_interesting_dep((*di).get_dep(), *apt_cache_file))
{
std::ostringstream out;
out << "Encountered uninteresting dep:"
<< *di;
CPPUNIT_FAIL(out.str());
}
if(!(*di).solved_by(*si))
{
std::ostringstream out;
out << (*si).get_package().get_name() << " "
<< (*si).get_name() << " should solve "
<< *di << " but doesn't.";
CPPUNIT_FAIL(out.str());
}
bool found = false;
for(aptitude_universe::version::revdep_iterator rdi
= (*si).revdeps_begin(); !found && !rdi.end(); ++rdi)
if(*rdi == *di)
found = true;
if(found)
continue;
// If the above fails, then each of the other versions of
// the package should either solve this dep or have this dep
// as a revdep.
for(aptitude_universe::package::version_iterator vi
= (*si).get_package().versions_begin(); !vi.end(); ++vi)
{
// NB: relies on the properties of solved_by tested above.
if(*vi != *si && !(*di).solved_by(*vi))
{
bool vi_found = false;
for(aptitude_universe::version::revdep_iterator rdi
= (*vi).revdeps_begin();
!vi_found && !rdi.end(); ++rdi)
if(*rdi == *di)
vi_found = true;
if(!vi_found)
{
std::ostringstream out;
out << "The dependency " << *di
<< "(" << (pkgCache::Dependency *) (*di).get_dep()
<< ":" << (pkgCache::Provides *) (*di).get_prv()
<< ") does not occur in the revdep list of either "
<< (*si).get_package().get_name() << " "
<< (*si).get_name() << " or "
<< (*vi).get_package().get_name() << " "
<< (*vi).get_name() << std::endl;
dump_revdeps(out, *si);
dump_revdeps(out, *vi);
CPPUNIT_FAIL(out.str());
}
}
}
}
}
};
CPPUNIT_TEST_SUITE_REGISTRATION(AptUniverseTest);
|