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
|
package urpm::select;
# $Id$
use urpm::msg;
use urpm::util;
use urpm::sys;
use URPM;
my $default_priority_list = 'rpm,perl-URPM,perl-MDV-Distribconf,urpmi,meta-task,glibc';
my @priority_list = split(',', $default_priority_list);
sub add_packages_to_priority_upgrade_list {
@priority_list = uniq(@priority_list, @_);
}
sub set_priority_upgrade_option {
my ($urpm, $previous) = @_;
exists $urpm->{options}{'priority-upgrade'} and return;
# comma-separated list of packages that should be installed first,
# and that trigger an urpmi restart
my $list = join(',', @priority_list);
if ($previous) {
if ($previous eq $list) {
$list = '';
$urpm->{log}(N("urpmi was restarted, and the list of priority packages did not change"));
} else {
$urpm->{log}(N("urpmi was restarted, and the list of priority packages did change: %s vs %s", $previous, $list));
}
}
$urpm->{options}{'priority-upgrade'} = $list;
}
sub _findindeps {
my ($urpm, $found, $qv, $v, $caseinsensitive, $src) = @_;
foreach (keys %{$urpm->{provides}}) {
#- search through provides to find if a provide matches this one;
#- but manage choices correctly (as a provides may be virtual or
#- defined several times).
/$qv/ || !$caseinsensitive && /$qv/i or next;
my @list = grep { defined $_ } map {
my $pkg = $_;
$pkg && ($src ? $pkg->arch eq 'src' : $pkg->arch ne 'src')
? $pkg->id : undef;
} $urpm->packages_providing($_);
@list > 0 and push @{$found->{$v}}, join '|', @list;
}
}
sub pkg_in_searchmedia {
my ($urpm, $pkg) = @_;
foreach my $medium (grep { $_->{searchmedia} } @{$urpm->{media}}) {
$medium->{start} <= $pkg->id
&& $medium->{end} >= $pkg->id and return 1;
}
0;
}
sub searchmedia_idlist {
my ($urpm) = @_;
$urpm->{searchmedia} && [
map { $_->{start} .. $_->{end} }
grep { $_->{searchmedia} } @{$urpm->{media}}
];
}
sub build_listid_ {
my ($urpm) = @_;
$urpm->build_listid(undef, undef, searchmedia_idlist($urpm));
}
#- search packages registered by their names by storing their ids into the $packages hash.
#- Recognized options:
#- all
#- caseinsensitive
#- fuzzy
#- src
#- use_provides
#-
#- side-effects: $packages, flag_skip
sub search_packages {
my ($urpm, $packages, $names, %options) = @_;
my ($name2ids, $result) = _search_packages($urpm, $names, %options) or return;
foreach my $v (@$names) {
my @ids = split /\|/, $name2ids->{$v};
#- in case we have a substring match, we want individual selection (for urpmq --fuzzy)
$packages->{$_} = 1 foreach $result eq 'substring' || $options{all} ? @ids : $name2ids->{$v};
foreach (@ids) {
my $pkg = $urpm->{depslist}[$_] or next;
$urpm->{debug} and $urpm->{debug}("search_packages: found " . $pkg->fullname . " matching $v");
$pkg->set_flag_skip(0); #- reset skip flag as manually selected.
}
}
$result;
}
#- side-effects: none
sub _search_packages {
my ($urpm, $names, %options) = @_;
my (%exact, %exact_a, %exact_ra, %found, %foundi);
foreach my $v (@$names) {
my $qv = quotemeta $v;
$qv = '(?i)' . $qv if $options{caseinsensitive};
unless ($options{fuzzy}) {
#- try to search through provides.
if (my @l = map {
$_
&& ($options{src} ? $_->arch eq 'src' : $_->is_arch_compat)
&& ($options{use_provides} || $_->name eq $v)
&& defined($_->id)
&& (!$urpm->{searchmedia} || pkg_in_searchmedia($urpm, $_))
? $_ : @{[]};
} $urpm->packages_providing($v))
{
#- find the lowest value of is_arch_compat
my ($noarch, $arch) = partition { $_->arch eq 'noarch' } @l;
my %compats;
push @{$compats{$_->is_arch_compat}}, $_ foreach @$arch;
delete $compats{0}; #- means not compatible
#- if there are pkgs matching arch, prefer them
if (%compats && !$options{all}) {
my $best_arch = min(keys %compats);
%compats = ($best_arch => $compats{$best_arch});
}
if (%compats) {
@l = (@$noarch, map { @$_ } values %compats);
}
#- we assume that if there is at least one package providing
#- the resource exactly, this should be the best one; but we
#- first check if one of the packages has the same name as searched.
if (my @l2 = grep { $_->name eq $v } @l) {
@l = @l2;
}
$exact{$v} = join('|', map { $_->id } @l);
next;
}
}
if ($options{use_provides} && $options{fuzzy}) {
_findindeps($urpm, \%found, $qv, $v, $options{caseinsensitive}, $options{src});
}
foreach my $id (build_listid_($urpm)) {
my $pkg = $urpm->{depslist}[$id];
($options{src} ? $pkg->arch eq 'src' : $pkg->is_arch_compat) or next;
my $pack_name = $pkg->name;
my $pack_ra = $pack_name . '-' . $pkg->version;
my $pack_a = "$pack_ra-" . $pkg->release;
my $pack = "$pack_a." . $pkg->arch;
unless ($options{fuzzy}) {
if ($pack eq $v) {
$exact{$v} = $id;
next;
} elsif ($pack_a eq $v) {
push @{$exact_a{$v}}, $id;
next;
} elsif ($pack_ra eq $v || $options{src} && $pack_name eq $v) {
push @{$exact_ra{$v}}, $id;
next;
}
}
$pack =~ /$qv/ and push @{$found{$v}}, $id;
$pack =~ /$qv/i and push @{$foundi{$v}}, $id unless $options{caseinsensitive};
}
}
my $result = 1;
my %name2ids;
foreach my $v (@$names) {
if (defined $exact{$v}) {
$name2ids{$v} = $exact{$v};
} else {
#- at this level, we need to search the best package given for a given name,
#- always prefer already found package.
my %l;
foreach (@{$exact_a{$v} || $exact_ra{$v} || $found{$v} || $foundi{$v} || []}) {
my $pkg = $urpm->{depslist}[$_];
push @{$l{$pkg->name}}, $pkg;
}
if (values(%l) == 0 || values(%l) > 1 && !$options{all}) {
$urpm->{error}(N("No package named %s", $v));
values(%l) != 0 and $urpm->{error}(
N("The following packages contain %s: %s",
$v, "\n" . join("\n", sort { $a cmp $b } keys %l))
);
$result = 0;
} else {
if (!@{$exact_a{$v} || $exact_ra{$v} || []}) {
#- we found a non-exact match
$result = 'substring';
}
$name2ids{$v} = join('|', map {
my $best;
foreach (@$_) {
if ($best && $best != $_) {
$_->compare_pkg($best) > 0 and $best = $_;
} else {
$best = $_;
}
}
map { $_->id } grep { $_->fullname eq $best->fullname } @$_;
} values %l);
}
}
}
#- return 0 if error, 'substring' if fuzzy match, 1 if ok
\%name2ids, $result;
}
#- Resolves dependencies between requested packages (and auto selection if any).
#- handles parallel option if any.
#- The return value is true if program should be restarted (in order to take
#- care of important packages being upgraded (priority upgrades)
#- %options :
#- rpmdb
#- auto_select
#- install_src
#- priority_upgrade
#- %options passed to ->resolve_requested:
#- callback_choices
#- keep
#- nodeps
#- no_suggests
sub resolve_dependencies {
#- $state->{selected} will contain the selection of packages to be
#- installed or upgraded
my ($urpm, $state, $requested, %options) = @_;
my $need_restart;
if ($urpm->{parallel_handler}) {
require urpm::parallel; #- help perl_checker;
urpm::parallel::resolve_dependencies($urpm, $state, $requested, %options);
} else {
my $db;
if ($options{rpmdb}) {
$db = new URPM;
$db->parse_synthesis($options{rpmdb});
} else {
$db = urpm::db_open_or_die_($urpm);
}
my $sig_handler = sub { undef $db; exit 3 };
local $SIG{INT} = $sig_handler;
local $SIG{QUIT} = $sig_handler;
#- auto select package for upgrading the distribution.
if ($options{auto_select}) {
$urpm->request_packages_to_upgrade($db, $state, $requested, requested => undef,
$urpm->{searchmedia} ? (idlist => searchmedia_idlist($urpm)) : (),
);
}
if ($options{priority_upgrade} && !$options{rpmdb}) {
#- first check if a priority_upgrade package is requested
#- (it should catch all occurences in --auto-select mode)
#- (nb: a package "foo" may appear twice, and only one will be set flag_upgrade)
$need_restart = resolve_priority_upgrades_after_auto_select($urpm, $db, $state, $requested, %options);
}
if (!$need_restart) {
$urpm->resolve_requested($db, $state, $requested, %options);
#- now check if a priority_upgrade package has been required
#- by a requested package
if (my @l = grep { $state->{selected}{$_->id} } _priority_upgrade_pkgs($urpm, $options{priority_upgrade})) {
$need_restart = _resolve_priority_upgrades($urpm, $db, $state, $state->{selected}, \@l, %options);
}
}
}
$need_restart;
}
sub select_replacepkgs {
my ($urpm, $state, $requested) = @_;
my $db = urpm::db_open_or_die_($urpm);
foreach my $id (keys %$requested) {
my @pkgs = $urpm->find_candidate_packages_($id);
if (my ($pkg) = grep { URPM::is_package_installed($db, $_) } @pkgs) {
$urpm->{debug_URPM}("selecting replacepkg " . $pkg->fullname) if $urpm->{debug_URPM};
$pkg->set_flag_requested;
$state->{selected}{$pkg->id} = undef;
} else {
$urpm->{fatal}(1, N("found package(s) %s in urpmi db, but none are installed", join(', ', map { scalar($_->fullname) } @pkgs)));
}
}
}
sub _priority_upgrade_pkgs {
my ($urpm, $priority_upgrade_string) = @_;
map {
$urpm->packages_by_name($_);
} split(/,/, $priority_upgrade_string);
}
sub resolve_priority_upgrades_after_auto_select {
my ($urpm, $db, $state, $selected, %options) = @_;
my $need_restart;
if (my @l = grep { $_->flag_upgrade } _priority_upgrade_pkgs($urpm, $options{priority_upgrade})) {
$need_restart = _resolve_priority_upgrades($urpm, $db, $state, $selected, \@l, %options);
}
$need_restart;
}
sub _resolve_priority_upgrades {
my ($urpm, $db, $state, $selected, $priority_pkgs, %options) = @_;
my ($need_restart, %priority_state);
my %priority_requested = map { $_->id => undef } @$priority_pkgs;
$urpm->resolve_requested($db, \%priority_state, \%priority_requested, %options);
if (grep { ! exists $priority_state{selected}{$_} } keys %priority_requested) {
#- some packages which were selected previously have not been selected, strange!
} elsif (grep { ! exists $priority_state{selected}{$_} } keys %$selected) {
#- there are other packages to install after this priority transaction.
%$state = %priority_state;
$need_restart = 1;
}
$need_restart;
}
sub cooked_prefer {
my ($urpm, $cmdline_prefer) = @_;
$urpm->{prefer_regexps} ||= [
map {
m!^/(.*)/$! ? "($1)" : '^' . quotemeta($_) . '$';
} map { @$_ }
urpm::sys::get_packages_list($urpm->{prefer_list}, $cmdline_prefer),
urpm::sys::get_packages_list($urpm->{prefer_vendor_list})
];
@{$urpm->{prefer_regexps}};
}
sub get_preferred {
my ($urpm, $choices, $cmdline_prefer) = @_;
my @prefer;
my @l = @$choices;
foreach my $re (cooked_prefer($urpm, $cmdline_prefer)) {
my ($prefer, $other) = partition { $_->name =~ $re } @l;
push @prefer, @$prefer;
@l = @$other;
if (@$prefer) {
my $prefer_s = join(',', map { $_->name } @$prefer);
my $other_s = join(',', map { $_->name } @l);
$urpm->{log}("preferring $prefer_s over $other_s");
}
}
#- only keep the best prefered
#- then put the other prefered packages first
my $best = shift @prefer;
$best ? [$best] : [], [@prefer, @l];
}
#- find packages to remove.
#- options:
#- callback_base
#- callback_fuzzy
#- callback_notfound
#- force
#- matches
#- test
sub find_packages_to_remove {
my ($urpm, $state, $l, %options) = @_;
if ($urpm->{parallel_handler}) {
#- invoke parallel finder.
$urpm->{parallel_handler}->parallel_find_remove($urpm, $state, $l, %options, find_packages_to_remove => 1);
} else {
my $db = urpm::db_open_or_die_($urpm);
my (@m, @notfound);
if (!$options{matches}) {
foreach (@$l) {
my ($n, $found);
#- check if name-version-release.architecture was given.
if (($n) = /^(.*)-[^\-]*-[^\-]*\.[^\.\-]*$/) {
$db->traverse_tag('name', [ $n ], sub {
my ($p) = @_;
$p->fullname eq $_ or return;
$urpm->resolve_rejected($db, $state, $p, removed => 1);
push @m, scalar $p->fullname;
$found = 1;
});
$found and next;
}
#- check if name-version-release was given.
if (($n) = /^(.*)-[^\-]*-[^\-]*$/) {
$db->traverse_tag('name', [ $n ], sub {
my ($p) = @_;
my ($name, $version, $release) = $p->fullname;
"$name-$version-$release" eq $_ or return;
$urpm->resolve_rejected($db, $state, $p, removed => 1);
push @m, scalar $p->fullname;
$found = 1;
});
$found and next;
}
#- check if name-version was given.
if (($n) = /^(.*)-[^\-]*$/) {
$db->traverse_tag('name', [ $n ], sub {
my ($p) = @_;
my ($name, $version) = $p->fullname;
"$name-$version" eq $_ or return;
$urpm->resolve_rejected($db, $state, $p, removed => 1);
push @m, scalar $p->fullname;
$found = 1;
});
$found and next;
}
#- check if only name was given.
$db->traverse_tag('name', [ $_ ], sub {
my ($p) = @_;
$p->name eq $_ or return;
$urpm->resolve_rejected($db, $state, $p, removed => 1);
push @m, scalar $p->fullname;
$found = 1;
});
$found and next;
push @notfound, $_;
}
if (!$options{force} && @notfound && @$l > 1) {
$options{callback_notfound} && $options{callback_notfound}->($urpm, @notfound)
or return ();
}
}
if ($options{matches} || @notfound) {
my $match = join "|", map { quotemeta } @$l;
my $qmatch = qr/$match/;
#- reset what has been already found.
%$state = ();
@m = ();
$urpm->{log}(qq(going through installed packages looking for "$match"...));
#- search for packages that match, and perform closure again.
$db->traverse(sub {
my ($p) = @_;
my $f = scalar $p->fullname;
$f =~ $qmatch or return;
$urpm->resolve_rejected($db, $state, $p, removed => 1);
push @m, $f;
});
$urpm->{log}("...done, packages found [" . join(' ', @m) . "]");
if (!$options{force} && @notfound) {
if (@m) {
$options{callback_fuzzy} && $options{callback_fuzzy}->($urpm, @$l > 1 ? $match : $l->[0], @m)
or return ();
} else {
$options{callback_notfound} && $options{callback_notfound}->($urpm, @notfound)
or return ();
}
}
}
#- check if something needs to be removed.
find_removed_from_basesystem($urpm, $db, $state, $options{callback_base})
or return ();
}
removed_packages($urpm, $state);
}
sub find_removed_from_basesystem {
my ($urpm, $db, $state, $callback_base) = @_;
$callback_base or return 1;
if (my @l = _prohibit_packages_that_would_be_removed($urpm, $db, $state)) {
$callback_base->($urpm, @l);
} else {
1;
}
}
sub _prohibit_packages_that_would_be_removed {
my ($urpm, $db, $state) = @_;
my @to_remove = removed_packages($urpm, $state) or return 1;
my @dont_remove = ('basesystem', 'basesystem-minimal',
split /,\s*/, $urpm->{global_config}{'prohibit-remove'});
my (@base_fn, %base);
$db->traverse_tag('whatprovides', \@dont_remove, sub {
my ($p) = @_;
$base{$p->name} = 1;
push @base_fn, scalar $p->fullname;
});
grep {
! grep { $base{$_} } rejected_unsatisfied($state, $_);
} intersection(\@to_remove, \@base_fn);
}
#- misc functions to help finding ask_unselect and ask_remove elements with their reasons translated.
sub unselected_packages {
my (undef, $state) = @_;
grep { $state->{rejected}{$_}{backtrack} } keys %{$state->{rejected} || {}};
}
#- misc functions to help finding ask_unselect and ask_remove elements with their reasons translated.
sub already_installed {
my ($state) = @_;
grep { $state->{rejected}{$_}{installed} } keys %{$state->{rejected} || {}};
}
sub translate_already_installed {
my ($state) = @_;
my @l = already_installed($state) or return;
@l == 1 ?
N("Package %s is already installed", join(', ', @l)) :
N("Packages %s are already installed", join(', ', @l));
}
sub translate_why_unselected {
my ($urpm, $state, @fullnames) = @_;
join("\n", map { translate_why_unselected_one($urpm, $state, $_) } sort @fullnames);
}
sub translate_why_unselected_one {
my ($urpm, $state, $fullname) = @_;
my $obj = $state->{rejected}{$fullname};
my $rb = $obj->{backtrack};
my @froms = keys %{$rb->{closure} || {}};
my @unsatisfied = @{$rb->{unsatisfied} || []};
my @conflicts = keys(%$rb) ? () : keys %{$obj->{closure}};
my $s = join ", ", (
(map { N("due to missing %s", $_) } @froms),
(map { N("due to already installed %s", $_) } @conflicts),
(map { N("due to unsatisfied %s", $_) } uniq(map {
#- XXX in theory we shouldn't need this, dependencies (and not ids) should
#- already be present in @unsatisfied. But with biarch packages this is
#- not always the case.
/\D/ ? $_ : scalar($urpm->{depslist}[$_]->fullname);
} @unsatisfied)),
$rb->{promote} && !$rb->{keep} ? N("trying to promote %s", join(", ", @{$rb->{promote}})) : (),
$rb->{keep} ? N("in order to keep %s", join(", ", @{$rb->{keep}})) : (),
$rb->{installed} ? "already installed" : (),
);
$fullname . ($s ? " ($s)" : '');
}
sub removed_packages {
my (undef, $state) = @_;
grep {
$state->{rejected}{$_}{removed} && !$state->{rejected}{$_}{obsoleted};
} keys %{$state->{rejected} || {}};
}
sub rejected_closure {
my ($state, $fullname) = @_;
$state->{rejected} && $state->{rejected}{$fullname} && $state->{rejected}{$fullname}{closure};
}
sub rejected_unsatisfied {
my ($state, $fullname) = @_;
my $closure = rejected_closure($state, $fullname) or return;
map { $_ ? @$_ : () } map { $_->{unsatisfied} } values %$closure;
}
sub translate_why_removed {
my ($urpm, $state, @fullnames) = @_;
join("\n", map { translate_why_removed_one($urpm, $state, $_) } sort @fullnames);
}
sub translate_why_removed_one {
my ($urpm, $state, $fullname) = @_;
my $closure = rejected_closure($state, $fullname) or return $fullname;
my ($from) = keys %$closure;
my ($whyk) = keys %{$closure->{$from}};
my $whyv = $closure->{$from}{$whyk};
my $frompkg = $urpm->search($from, strict_fullname => 1);
my $s = do {
if ($whyk =~ /old_requested/) {
N("in order to install %s", $frompkg ? scalar $frompkg->fullname : $from);
} elsif ($whyk =~ /unsatisfied/) {
join(",\n ", map {
if (/([^\[\s]*)(?:\[\*\])?(?:\[|\s+)([^\]]*)\]?$/ && $2 ne '*') {
N("due to unsatisfied %s", "$1 $2");
} else {
N("due to missing %s", $_);
}
} @$whyv);
} elsif ($whyk =~ /conflicts/) {
N("due to conflicts with %s", $whyv);
} else {
$whyk;
}
};
#- now insert the reason if available.
$fullname . ($s ? "\n ($s)" : '');
}
sub installed_packages_packed {
my ($urpm) = @_;
my $db = urpm::db_open_or_die_($urpm) or die "Can't open RPM db\n";
my @l;
$db->traverse(sub {
my ($pkg) = @_;
$pkg->pack_header;
push @l, $pkg;
});
\@l;
}
sub installed_leaves {
my ($urpm, $o_discard) = @_;
my $packages = installed_packages_packed($urpm);
my (%l, %provides);
foreach my $pkg (@$packages) {
next if $o_discard && $o_discard->($pkg);
$l{$pkg->name} = $pkg;
push @{$provides{$_}}, $pkg foreach $pkg->provides_nosense;
}
foreach my $pkg (@$packages) {
foreach my $prop ($pkg->requires) {
my $n = URPM::property2name($prop);
foreach my $p (@{$provides{$n} || []}) {
$p != $pkg && $p->provides_overlap($prop) and
delete $l{$p->name};
}
}
}
\%l;
}
1;
|