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
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
|
// apt.cc
//
// Copyright 1999-2007 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.
//
// Handles basic apt bookkeeping.
#include "apt.h"
#include <aptitude.h>
#include "config_signal.h"
#include "pkg_hier.h"
#include "resolver_manager.h"
#include "rev_dep_iterator.h"
#include "tags.h"
#include "tasks.h"
#include <cwidget/generic/util/eassert.h>
#include <cwidget/generic/util/transcode.h>
#include <generic/util/util.h>
#include <generic/util/undo.h>
#include <apt-pkg/configuration.h>
#include <apt-pkg/depcache.h>
#include <apt-pkg/error.h>
#include <apt-pkg/init.h>
#include <apt-pkg/pkgcachegen.h>
#include <apt-pkg/sourcelist.h>
#include <apt-pkg/version.h>
#include <fstream>
#include <signal.h>
#include <unistd.h>
#include <sys/stat.h>
#include <errno.h>
using namespace std;
enum interesting_state {uncached = 0, uninteresting, interesting};
static interesting_state *cached_deps_interesting = NULL;
// Memoization of surrounding_or. To save space, the low bit of each
// pointer in the following table is set to 1 when a result is cached:
static pkgCache::Dependency **cached_surrounding_or = NULL;
aptitudeCacheFile *apt_cache_file=NULL;
signalling_config *aptcfg=NULL;
pkgRecords *apt_package_records=NULL;
pkgSourceList *apt_source_list=NULL;
undo_list *apt_undos=NULL;
pkg_hier *user_pkg_hier=NULL;
resolver_manager *resman = NULL;
string *pendingerr=NULL;
bool erroriswarning=false;
static Configuration *theme_config;
static Configuration *user_config;
sigc::signal0<void> cache_closed, cache_reloaded, cache_reload_failed;
sigc::signal0<void> hier_reloaded;
sigc::signal0<void> consume_errors;
static void reset_interesting_dep_memoization()
{
delete[] cached_deps_interesting;
cached_deps_interesting = NULL;
}
static void reset_surrounding_or_memoization()
{
delete[] cached_surrounding_or;
cached_surrounding_or = NULL;
}
static void reload_user_pkg_hier()
{
delete user_pkg_hier;
user_pkg_hier=new pkg_hier;
user_pkg_hier->input_file(PKGDATADIR "/function_groups");
string cfgloc(get_homedir());
if(!cfgloc.empty())
{
string user_hier=cfgloc+string("/.aptitude/function_pkgs");
if(access(user_hier.c_str(), R_OK)==0)
user_pkg_hier->input_file(user_hier);
else
user_pkg_hier->input_file(PKGDATADIR "/function_pkgs");
}
}
void apt_preinit()
{
signal(SIGPIPE, SIG_IGN);
theme_config=new Configuration;
user_config=new Configuration;
ReadConfigFile(*theme_config, PKGDATADIR "/aptitude-defaults");
pkgInitConfig(*_config);
pkgInitSystem(*_config, _system);
// Allow a user-specific customization file.
const char *HOME = getenv("HOME");
string cfgloc;
if(HOME != NULL && *HOME != '\0' &&
access((string(HOME) + "/.aptitude").c_str(), R_OK | X_OK) == 0)
cfgloc = string(HOME) + "/.aptitude/config";
else
{
cfgloc = get_homedir();
if(!cfgloc.empty())
cfgloc += "/.aptitude/config";
}
if(!cfgloc.empty() && access(cfgloc.c_str(), R_OK) == 0)
{
ReadConfigFile(*user_config, cfgloc);
ReadConfigFile(*_config, cfgloc);
}
aptcfg=new signalling_config(user_config, _config, theme_config);
aptcfg->connect(PACKAGE "::Recommends-Important",
sigc::ptr_fun(&reset_interesting_dep_memoization));
cache_closed.connect(sigc::ptr_fun(&reset_interesting_dep_memoization));
cache_closed.connect(sigc::ptr_fun(&reset_surrounding_or_memoization));
apt_dumpcfg("Aptitude");
apt_undos=new undo_list;
}
void apt_dumpcfg(const char *root)
{
string cfgloc;
const char *HOME = getenv("HOME");
if(HOME != NULL && *HOME != '\0')
{
string tmp(HOME);
tmp += "/.aptitude";
if(access(tmp.c_str(), W_OK) == 0)
cfgloc = tmp + "/config";
else if(access(tmp.c_str(), R_OK | X_OK) == 0)
{
// The squashed-root case.
_error->Error(_("%s is readable but not writable; unable to write configuration file."),
tmp.c_str());
return;
}
}
if(cfgloc.empty())
{
cfgloc = get_homedir();
if(cfgloc.empty())
return;
cfgloc += "/.aptitude";
if(mkdir(cfgloc.c_str(), 0700)<0 && errno != EEXIST)
{
_error->Errno("mkdir", "%s", cfgloc.c_str());
return;
}
cfgloc += "/config";
}
ofstream f((cfgloc+".new").c_str());
if(!f)
{
_error->Errno("apt_init", _("Unable to open %s for writing"), cfgloc.c_str());
return;
}
aptcfg->Dump(f);
f.close();
if(rename((cfgloc+".new").c_str(), cfgloc.c_str())!=0)
{
_error->Errno("apt_init", _("Unable to replace %s with new configuration file"), cfgloc.c_str());
return;
}
}
// Revert back to the default set of options. Is it a hack? mHmm...
void apt_revertoptions()
{
Configuration *old_user_config=user_config;
Configuration *old_config=_config;
_config=new Configuration;
user_config=new Configuration;
// ick?
pkgInitConfig(*_config);
pkgInitSystem(*_config, _system);
aptcfg->setcfg(user_config, _config, theme_config);
delete old_user_config;
delete old_config;
}
void apt_init(OpProgress *progress_bar, bool do_initselections,
const char *status_fname)
{
if(!apt_cache_file)
apt_reload_cache(progress_bar, do_initselections, status_fname);
}
void apt_close_cache()
{
cache_closed();
// DANGER WILL ROBINSON!
//
// This must be done *** BEFORE BEFORE BEFORE *** we delete the
// current cache file, since until the resolver manager is deleted,
// there might actually be an active resolver thread trying to use
// the cache!
if(resman)
{
delete resman;
resman = NULL;
}
reset_tasks();
if(apt_package_records)
{
delete apt_package_records;
apt_package_records=NULL;
}
if(apt_cache_file)
{
delete apt_cache_file;
apt_cache_file=NULL;
}
if(apt_source_list)
{
delete apt_source_list;
apt_source_list=NULL;
}
}
void apt_load_cache(OpProgress *progress_bar, bool do_initselections,
const char * status_fname)
{
if(apt_cache_file != NULL)
return;
aptitudeCacheFile *new_file=new aptitudeCacheFile;
apt_source_list=new pkgSourceList;
apt_source_list->ReadMainList();
bool simulate = aptcfg->FindB(PACKAGE "::Simulate", false);
// Clear the error stack so that we don't get confused by old errors.
consume_errors();
bool open_failed=!new_file->Open(*progress_bar, do_initselections,
(getuid() == 0) && !simulate,
status_fname)
|| _error->PendingError();
if(open_failed && getuid() == 0)
{
// Don't discard errors, make sure they get displayed instead.
consume_errors();
open_failed=!new_file->Open(*progress_bar, do_initselections,
false, status_fname);
if(!open_failed)
_error->Warning(_("Could not lock the cache file. Opening in read-only mode; any changes you make to the states of packages will NOT be preserved!"));
}
if(open_failed)
{
delete new_file;
cache_reload_failed();
return;
}
apt_cache_file=new_file;
// *If we were loading the global list of states*, dump immediate
// changes back to it. This reduces the chance that the user will
// ^C and lose important changes (like the new dselect states of
// packages). Note, though, that we don't fail if this fails.
if(!status_fname && apt_cache_file->is_locked())
(*apt_cache_file)->save_selection_list(*progress_bar);
apt_package_records=new pkgRecords(*apt_cache_file);
// Um, good time to clear our undo info.
apt_undos->clear_items();
load_tasks(*progress_bar);
load_tags(*progress_bar);
if(user_pkg_hier)
{
reload_user_pkg_hier();
hier_reloaded();
}
resman = new resolver_manager(*new_file);
cache_reloaded();
}
void apt_reload_cache(OpProgress *progress_bar, bool do_initselections,
const char * status_fname)
{
apt_close_cache();
apt_load_cache(progress_bar, do_initselections, status_fname);
}
pkg_hier *get_user_pkg_hier()
{
if(!user_pkg_hier)
reload_user_pkg_hier();
return user_pkg_hier;
}
pkg_action_state find_pkg_state(pkgCache::PkgIterator pkg,
aptitudeDepCache &cache)
{
aptitudeDepCache::StateCache &state = cache[pkg];
aptitudeDepCache::aptitude_state &extstate = cache.get_ext_state(pkg);
if(state.InstBroken())
return pkg_broken;
else if(state.Delete())
{
if(extstate.remove_reason==aptitudeDepCache::manual)
return pkg_remove;
else if(extstate.remove_reason==aptitudeDepCache::unused)
return pkg_unused_remove;
else
return pkg_auto_remove;
}
else if(state.Install())
{
if(!pkg.CurrentVer().end())
{
if(state.iFlags&pkgDepCache::ReInstall)
return pkg_reinstall;
else if(state.Downgrade())
return pkg_downgrade;
else if(state.Upgrade())
return pkg_upgrade;
else
// FOO! Should I abort here?
return pkg_install;
}
else if(state.Flags & pkgCache::Flag::Auto)
return pkg_auto_install;
else
return pkg_install;
}
else if(state.Status==1 &&
state.Keep())
{
if(!(state.Flags & pkgDepCache::AutoKept))
return pkg_hold;
else
return pkg_auto_hold;
}
else if(state.iFlags&pkgDepCache::ReInstall)
return pkg_reinstall;
// States where --configure fixes things.
else if(pkg->CurrentState == pkgCache::State::UnPacked ||
pkg->CurrentState == pkgCache::State::HalfConfigured
#ifdef APT_HAS_TRIGGERS
|| pkg->CurrentState == pkgCache::State::TriggersAwaited
|| pkg->CurrentState == pkgCache::State::TriggersPending
#endif
)
return pkg_unconfigured;
return pkg_unchanged;
}
bool pkg_obsolete(pkgCache::PkgIterator pkg)
{
if(pkg.CurrentVer().end())
return false;
else
{
pkgCache::VerIterator ver=pkg.VersionList();
ver++;
if(!ver.end())
return false;
else // Ok, there's only one version. Good.
{
pkgCache::VerFileIterator files=pkg.VersionList().FileList();
if(!files.end())
{
files++;
if(!files.end())
return false; // Nope, more than one file
}
}
}
return true;
}
// This does not assume that the dependency is the first elements of
// its OR group.
static void surrounding_or_internal(const pkgCache::DepIterator &dep,
pkgCache::DepIterator &start,
pkgCache::DepIterator &end)
{
bool found=false;
start=const_cast<pkgCache::DepIterator &>(dep).ParentVer().DependsList();
end=start;
while(!end.end() && !found)
{
start=end;
while(end->CompareOp&pkgCache::Dep::Or)
{
if(end==dep)
found=true;
++end;
}
if(end==dep)
found=true;
++end;
}
// If not, something is wrong with apt's cache.
eassert(found);
}
void surrounding_or(pkgCache::DepIterator dep,
pkgCache::DepIterator &start,
pkgCache::DepIterator &end,
pkgCache *cache)
{
if(cache == NULL)
cache = *apt_cache_file;
if(cached_surrounding_or == NULL)
{
cached_surrounding_or = new pkgCache::Dependency *[cache->Head().DependsCount];
for(unsigned long i = 0; i<cache->Head().DependsCount; ++i)
cached_surrounding_or[i] = 0;
}
pkgCache::Dependency *s = cached_surrounding_or[dep->ID];
// Use the old trick of stuffing values into the low bits of a
// pointer.
if(((unsigned long) s & 0x1) != 0)
{
pkgCache::Dependency *unmunged
= (pkgCache::Dependency *) (((unsigned long) s) & ~0x1UL);
start = pkgCache::DepIterator(*cache, unmunged);
end = start;
while(end->CompareOp & pkgCache::Dep::Or)
++end;
++end;
}
else
{
surrounding_or_internal(dep, start, end);
cached_surrounding_or[dep->ID] = (pkgCache::Dependency *) ((unsigned long) ((pkgCache::Dependency *) start) | 0x1UL);
}
}
bool package_suggested(const pkgCache::PkgIterator &pkg)
{
pkgDepCache::StateCache &state=(*apt_cache_file)[pkg];
pkgCache::VerIterator candver=state.CandidateVerIter(*apt_cache_file);
for(rev_dep_iterator d(pkg); !d.end(); ++d)
if((*d)->Type==pkgCache::Dep::Suggests)
{
bool satisfied=false;
pkgCache::DepIterator start,end;
surrounding_or(*d, start, end);
while(start!=end)
{
if(((*apt_cache_file)[start])&pkgDepCache::DepGInstall)
{
satisfied=true;
break;
}
++start;
}
if(!satisfied)
{
// Check whether the package doing the depending is going
// to be installed.
pkgCache::PkgIterator depender=(*d).ParentPkg();
pkgDepCache::StateCache &depstate=(*apt_cache_file)[depender];
pkgCache::VerIterator depinstver=depstate.InstVerIter(*apt_cache_file);
if(depender.CurrentVer().end() &&
depstate.Install() &&
!depinstver.end() &&
!candver.end() &&
_system->VS->CheckDep(candver.VerStr(),
(*d)->CompareOp, (*d).TargetVer()))
{
if((*d).ParentVer()==depinstver)
return true;
}
}
}
return false;
}
bool package_recommended(const pkgCache::PkgIterator &pkg)
{
pkgDepCache::StateCache &state=(*apt_cache_file)[pkg];
pkgCache::VerIterator candver=state.CandidateVerIter(*apt_cache_file);
for(rev_dep_iterator d(pkg); !d.end(); ++d)
if((*d)->Type==pkgCache::Dep::Recommends)
{
bool satisfied=false;
pkgCache::DepIterator start,end;
surrounding_or(*d, start, end);
while(start!=end)
{
if(((*apt_cache_file)[start])&pkgDepCache::DepGInstall)
{
satisfied=true;
break;
}
++start;
}
if(!satisfied)
{
// Check whether the package doing the depending is going
// to be installed or upgraded.
pkgCache::PkgIterator depender=(*d).ParentPkg();
pkgDepCache::StateCache &depstate=(*apt_cache_file)[depender];
pkgCache::VerIterator depinstver=depstate.InstVerIter(*apt_cache_file);
if(depstate.Install() &&
!candver.end() &&
_system->VS->CheckDep(candver.VerStr(),
(*d)->CompareOp, (*d).TargetVer()))
{
if((*d).ParentVer()==depinstver)
return true;
}
}
}
return false;
}
bool package_trusted(const pkgCache::VerIterator &ver)
{
for(pkgCache::VerFileIterator i = ver.FileList(); !i.end(); ++i)
{
pkgIndexFile *index;
if(!apt_source_list->FindIndex(i.File(), index))
// Corresponds to the currently installed package, which is
// always "trusted".
return true;
else if(index->IsTrusted())
return true;
}
return false;
}
/** \return \b true if d1 subsumes d2; that is, if one of the
* following holds:
*
* (a) d1 and d2 target the same package and are unversioned.
*
* (b) d1 and d2 are unversioned and some version of d2's target
* provides the target package of d1.
*
* (c) d1 and d2 target the same package, d1 is unversioned, and d2
* is versioned.
*
* (c) d1 and d2 target the same package and are versioned
* (with op1 ver1 and op2 ver2 being the operations and versions)
* and:
*
* - op1 is >=, op2 is >>, >=, or =, and ver1 <= ver2; or
* - op1 is <=, op2 is <<, <=, or =, and ver1 >= ver2; or
* - op1 is >>, op2 is >>, and ver1 <= ver2; or
* - op1 is >>, op2 is =, and ver1 < ver2; or
* - op1 is <<, op2 is <<, and ver1 >= ver2; or
* - op1 is <<, op2 is =, and ver1 > ver2; or
* - op1 is =, op2 is =, and ver1 = ver2; or
* - op1 is !=, op2 is !=, and ver1 = ver2.
*/
static bool subsumes(const pkgCache::DepIterator &d1,
const pkgCache::DepIterator &d2)
{
pkgCache::PkgIterator target1 = const_cast<pkgCache::DepIterator &>(d1).TargetPkg();
pkgCache::PkgIterator target2 = const_cast<pkgCache::DepIterator &>(d2).TargetPkg();
if(!d1.TargetVer())
{
if(target1 == target2)
return true;
if(d2.TargetVer())
return false;
for(pkgCache::PrvIterator p = target1.ProvidesList();
!p.end(); ++p)
if(p.OwnerPkg() == target2)
return true;
return false;
}
else
{
if(target1 != target2)
return false;
if(!d2.TargetVer())
return false;
pkgCache::Dep::DepCompareOp t1 = (pkgCache::Dep::DepCompareOp) (d1->CompareOp &~ pkgCache::Dep::Or);
pkgCache::Dep::DepCompareOp t2 = (pkgCache::Dep::DepCompareOp) (d2->CompareOp &~ pkgCache::Dep::Or);
int cmpresult = _system->VS->DoCmpVersion(d1.TargetVer(), d1.TargetVer()+strlen(d1.TargetVer()),
d2.TargetVer(), d2.TargetVer()+strlen(d2.TargetVer()));
switch(t1)
{
case pkgCache::Dep::LessEq:
return
(t2 == pkgCache::Dep::Less ||
t2 == pkgCache::Dep::LessEq ||
t2 == pkgCache::Dep::Equals) &&
cmpresult >= 0;
case pkgCache::Dep::GreaterEq:
return
(t2 == pkgCache::Dep::Greater ||
t2 == pkgCache::Dep::GreaterEq ||
t2 == pkgCache::Dep::Equals) &&
cmpresult <= 0;
case pkgCache::Dep::Less:
return
(t2 == pkgCache::Dep::Less && cmpresult >= 0) ||
(t2 == pkgCache::Dep::Equals && cmpresult > 0);
case pkgCache::Dep::Greater:
return
(t2 == pkgCache::Dep::Greater && cmpresult <= 0) ||
(t2 == pkgCache::Dep::Equals && cmpresult < 0);
case pkgCache::Dep::Equals:
return
(t2 == pkgCache::Dep::Equals && cmpresult == 0);
case pkgCache::Dep::NotEquals:
return
(t2 == pkgCache::Dep::NotEquals && cmpresult == 0);
// These shouldn't happen:
case pkgCache::Dep::NoOp:
default:
abort();
}
}
}
/** \return \b true if the OR group of d1 subsumes the OR group of d2:
* that is, if every member of the OR group containing d2 has a
* subsuming element in the OR group containing d1.
*/
static bool or_group_subsumes(const pkgCache::DepIterator &d1,
const pkgCache::DepIterator &d2,
pkgCache *cache)
{
pkgCache::DepIterator start1, end1, start2, end2;
surrounding_or(d1, start1, end1, cache);
surrounding_or(d2, start2, end2, cache);
for(pkgCache::DepIterator i = start1; i != end1; ++i)
{
bool found = false;
for(pkgCache::DepIterator j = start2; j != end2; ++j)
if(subsumes(i, j))
{
found = true;
break;
}
if(!found)
return false;
}
return true;
}
// Interesting deps are:
//
// - All critical deps
// - All recommendations that are currently satisfied
// - All recommendations that are unrelated under subsumption to
// each recommendation of the current package version.
static bool internal_is_interesting_dep(const pkgCache::DepIterator &d,
pkgDepCache *cache)
{
pkgCache::PkgIterator parpkg = const_cast<pkgCache::DepIterator &>(d).ParentPkg();
pkgCache::VerIterator currver = parpkg.CurrentVer();
pkgCache::VerIterator parver = const_cast<pkgCache::DepIterator &>(d).ParentVer();
if(!parver.Downloadable() &&
(parver != currver || parpkg->CurrentState == pkgCache::State::ConfigFiles))
return false;
else if(const_cast<pkgCache::DepIterator &>(d).IsCritical())
return true;
else if(d->Type != pkgCache::Dep::Recommends ||
!aptcfg->FindB(PACKAGE "::Recommends-Important", true))
return false;
else
{
// Soft deps attached to the current version are interesting iff
// they are currently satisfied.
if(currver == parver)
{
pkgCache::DepIterator dtmp = d;
while(!dtmp.end() && dtmp->CompareOp & pkgCache::Dep::Or)
++dtmp;
if((*cache)[dtmp] & pkgDepCache::DepGNow)
return true;
return false;
}
else if(currver.end())
return true;
else
// Check whether the current version of this package has a dep
// that either subsumes _or is subsumed by_ this
// recommendation. (for mathematical "correctness" we'd only
// check the first direction, but the goal is to not annoy the
// user unnecessarily; losing a few new recommendations is OK)
//
// NB: full correctness without annoyance means actually
// TRIMMING DOWN the target set of a recommendation by
// subtracting elements that are in the current version's
// recommendation list. Needless to say, I'm ignoring this
// for now.
{
pkgCache::DepIterator d2 = currver.DependsList();
while(!d2.end())
{
if(d2->Type == pkgCache::Dep::Recommends &&
(or_group_subsumes(d2, d, &cache->GetCache()) ||
or_group_subsumes(d, d2, &cache->GetCache())))
{
pkgCache::DepIterator dtmp = d;
while(!dtmp.end() && dtmp->CompareOp & pkgCache::Dep::Or)
++dtmp;
if((*cache)[dtmp] & pkgDepCache::DepGNow)
return true;
return false;
}
while(!d2.end() && ((d2->CompareOp & pkgCache::Dep::Or) != 0))
++d2;
if(!d2.end())
++d2;
}
return true;
}
}
}
bool is_interesting_dep(const pkgCache::DepIterator &d,
pkgDepCache *cache)
{
if(cached_deps_interesting == NULL)
{
cached_deps_interesting = new interesting_state[cache->Head().DependsCount];
for(unsigned long i = 0; i<cache->Head().DependsCount; ++i)
cached_deps_interesting[i] = uncached;
}
switch(cached_deps_interesting[d->ID])
{
case uncached:
{
pkgCache::DepIterator start, end;
surrounding_or(d, start, end, &cache->GetCache());
bool rval = internal_is_interesting_dep(start, cache);
cached_deps_interesting[d->ID] = rval ? interesting : uninteresting;
return rval;
}
case interesting:
return true;
case uninteresting:
return false;
default:
abort();
}
}
std::wstring get_short_description(const pkgCache::VerIterator &ver,
pkgRecords *records)
{
if(ver.end() || ver.FileList().end() || records == NULL)
return std::wstring();
#ifndef HAVE_DDTP
pkgCache::VerFileIterator vf = ver.FileList();
if(vf.end())
return std::wstring();
else
return transcode(records->Lookup(vf).ShortDesc());
#else
pkgCache::DescIterator d = ver.TranslatedDescription();
if(d.end())
return std::wstring();
pkgCache::DescFileIterator df = d.FileList();
if(df.end())
return std::wstring();
else
// apt "helpfully" transcodes the description for us, instead of
// providing direct access to it. So I need to assume that the
// description is encoded in the current locale.
return cwidget::util::transcode(records->Lookup(df).ShortDesc());
#endif
}
std::wstring get_long_description(const pkgCache::VerIterator &ver,
pkgRecords *records)
{
if(ver.end() || ver.FileList().end() || records == NULL)
return std::wstring();
#ifndef HAVE_DDTP
pkgCache::VerFileIterator vf = ver.FileList();
if(vf.end())
return std::wstring();
else
return transcode(records->Lookup(vf).LongDesc());
#else
pkgCache::DescIterator d = ver.TranslatedDescription();
if(d.end())
return std::wstring();
pkgCache::DescFileIterator df = d.FileList();
if(df.end())
return std::wstring();
else
return cwidget::util::transcode(records->Lookup(df).LongDesc());
#endif
}
|