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
|
package URPM;
use strict;
#- find candidates packages from a require string (or id),
#- take care of direct choices using | sepatator.
sub find_candidate_packages {
my ($urpm, $dep) = @_;
my %packages;
foreach (split '\|', $dep) {
if (/^\d+$/) {
my $pkg = $urpm->{depslist}[$_];
$pkg->arch eq 'src' || $pkg->is_arch_compat or next;
push @{$packages{$pkg->name}}, $pkg;
} elsif (my ($property, $name) = /^(([^\s\[]*).*)/) {
foreach (keys %{$urpm->{provides}{$name} || {}}) {
my $pkg = $urpm->{depslist}[$_];
$pkg->is_arch_compat or next;
#- check if at least one provide of the package overlap the property.
my $satisfied = 0;
foreach ($pkg->provides) {
ranges_overlap($_, $property) and ++$satisfied, last;
}
$satisfied and push @{$packages{$pkg->name}}, $pkg;
}
}
}
\%packages;
}
#- return unresolved requires of a package (a new one or a existing one).
sub unsatisfied_requires {
my ($urpm, $db, $state, $pkg, %options) = @_;
my %properties;
#- all requires should be satisfied according to selected package, or installed packages.
foreach ($pkg->requires) {
if (my ($n, $s) = /^([^\s\[]*)(?:\[\*\])?\[?([^\s\]]*\s*[^\s\]]*)/) {
#- allow filtering on a given name (to speed up some search).
! defined $options{name} || $n eq $options{name} or next;
#- avoid recomputing the same all the time.
exists $properties{$_} || $state->{installed}{$_} and next;
#- keep track if satisfied.
my $satisfied = 0;
#- check on selected package if a provide is satisfying the resolution (need to do the ops).
foreach my $sense (keys %{$state->{provided}{$n} || {}}) {
ranges_overlap($sense, $s) and ++$satisfied, last;
}
#- check on installed system a package which is not obsoleted is satisfying the require.
unless ($satisfied) {
if ($n =~ /^\//) {
$db->traverse_tag('path', [ $n ], sub {
my ($p) = @_;
exists $state->{obsoleted}{$p->fullname} and return;
$state->{ask_remove}{join '-', ($p->fullname)[0..2]} and return;
++$satisfied;
});
} else {
$db->traverse_tag('whatprovides', [ $n ], sub {
my ($p) = @_;
exists $state->{obsoleted}{$p->fullname} and return;
$state->{ask_remove}{join '-', ($p->fullname)[0..2]} and return;
foreach ($p->provides) {
$options{keep_state} or $state->{installed}{$_}{$p->fullname} = undef;
if (my ($pn, $ps) = /^([^\s\[]*)(?:\[\*\])?\[?([^\s\]]*\s*[^\s\]]*)/) {
$pn eq $n or next;
ranges_overlap($ps, $s) and ++$satisfied;
}
}
});
}
}
#- if nothing can be done, the require should be resolved.
$satisfied or $properties{$_} = undef;
}
}
keys %properties;
}
#- close ask_remove (as urpme previously) for package to be removable without error.
sub resolve_closure_ask_remove {
my ($urpm, $db, $state, $pkg, $why) = @_;
my $name = join '-', ($pkg->fullname)[0..2]; #- specila name (without arch) to allow selection.
#- check if the package has already been asked to removed,
#- this means only add the new reason and return.
unless ($state->{ask_remove}{$name}) {
push @{$state->{ask_remove}{$name}}, $why;
my @removes = ($pkg);
while ($pkg = shift @removes) {
#- clean state according to provided properties.
foreach ($pkg->provides) {
delete $state->{installed}{$_}{$pkg->fullname};
%{$state->{installed}{$_} || {}} or delete $state->{installed}{$_};
}
#- close what requires this property.
foreach ($pkg->provides) {
if (my ($n) = /^([^\s\[]*)/) {
$db->traverse_tag('whatrequires', [ $n ], sub {
my ($p) = @_;
$state->{ask_remove}{join '-', ($p->fullname)[0..2]} and return;
if (my @l = $urpm->unsatisfied_requires($db, $state, $p, name => $n, keep_state => 1)) {
push @{$state->{ask_remove}{join '-', ($p->fullname)[0..2]}},
{ unsatisfied => \@l, closure => $name };
$p->pack_header; #- need to pack else package is no more visible...
push @removes, $p;
}
});
}
}
}
}
}
#- resolve requested, keep resolution state to speed process.
#- a requested package is marked to be installed, once done, a upgrade flag or
#- installed flag is set according to needs of package.
#- other required package will have required flag set along with upgrade flag or
#- installed flag.
#- base flag should always been installed or upgraded.
#- the following options are recognized :
#- check : check requires of installed packages.
sub resolve_requested {
#- internal method to simplify code.
sub update_state_provides {
my ($state, $pkg) = @_;
foreach ($pkg->provides) {
if (my ($n, $s) = /^([^\s\[]*)(?:\[\*\])?\[?([^\s\]]*\s*[^\s\]]*)/) {
$state->{provided}{$n}{$s}{$pkg->id} = undef;
}
}
};
my ($urpm, $db, $state, $requested, %options) = @_;
my (@properties, @obsoleted, %requested, $dep);
#- keep in mind the requested id (if given) in order to prefer these packages
#- on choices instead of anything other one.
@properties = keys %$requested;
foreach my $dep (@properties) {
@requested{split '\|', $dep} = ();
}
#- for each dep property evaluated, examine which package will be obsoleted on $db,
#- then examine provides that will be removed (which need to be satisfied by another
#- package present or by a new package to upgrade), then requires not satisfied and
#- finally conflicts that will force a new upgrade or a remove.
while (defined ($dep = shift @properties)) {
my (@chosen, %diff_provides, $pkg, $allow);
#- take the best package for each choices of same name.
my $packages = $urpm->find_candidate_packages($dep);
foreach (values %$packages) {
my ($best_requested, $best);
foreach (@$_) {
exists $state->{selected}{$_->id} and $best_requested = $_, last;
if ($best_requested || exists $requested{$_->id}) {
if ($best_requested && $best_requested != $_) {
$_->compare_pkg($best_requested) > 0 and $best_requested = $_;
} else {
$best_requested = $_;
}
} elsif ($best && $best != $_) {
$_->compare_pkg($best) > 0 and $best = $_;
} else {
$best = $_;
}
}
$_ = $best_requested || $best;
}
if (keys(%$packages) > 1) {
my (@chosen_requested_upgrade, @chosen_requested, @chosen_upgrade);
#- package should be prefered if one of their provides is referenced
#- in requested hash or package itself is requested (or required).
#- if there is no preference choose the first one (higher probability
#- of being chosen) by default and ask user.
foreach my $p (values %$packages) {
$p or next; #- this could happen if no package are suitable for this arch.
exists $state->{obsoleted}{$p->fullname} and next; #- avoid taking what is removed (incomplete).
exists $state->{selected}{$p->id} and $pkg = $p, last; #- already selected package is taken.
unless ($p->flag_upgrade || $p->flag_installed) {
#- assume for this small algorithm package to be upgradable.
$p->set_flag_upgrade;
$db->traverse_tag('name', [ $p->name ], sub {
my ($pp) = @_;
$p->set_flag_installed;
$p->flag_upgrade and $p->set_flag_upgrade($p->compare_pkg($pp) > 0);
});
}
if ($p->flag_installed) {
if (exists $requested{$p->id}) {
push @chosen_requested_upgrade, $p;
} else {
push @chosen_upgrade, $p;
}
} else {
if (exists $requested{$p->id}) {
push @chosen_requested, $p;
} else {
push @chosen, $p;
}
}
}
if (@chosen_requested_upgrade > 0 || @chosen_requested > 0) {
@chosen = @chosen_requested_upgrade > 0 ? @chosen_requested_upgrade : @chosen_requested;
} else {
@chosen_upgrade > 0 and @chosen = @chosen_upgrade;
}
} else {
@chosen = values %$packages;
}
@chosen = sort { $a->id <=> $b->id } @chosen; #- sort package in order to have best ones first.
if (!$pkg && $options{callback_choices} && @chosen > 1) {
$pkg = $options{callback_choices}->($urpm, $db, $state, \@chosen);
$pkg or next; #- callback may decide to not continue (or state is already updated).
}
$pkg ||= $chosen[0];
!$pkg || $pkg->flag_selected || exists $state->{selected}{$pkg->id} and next;
if ($pkg->arch eq 'src') {
$pkg->set_flag_upgrade;
} else {
unless ($pkg->flag_upgrade || $pkg->flag_installed) {
#- assume for this small algorithm package to be upgradable.
$pkg->set_flag_upgrade;
$db->traverse_tag('name', [ $pkg->name ], sub {
my ($p) = @_;
$pkg->set_flag_installed; #- there is at least one package installed (whatever its version).
$pkg->flag_upgrade and $pkg->set_flag_upgrade($pkg->compare_pkg($p) > 0);
});
}
if ($pkg->flag_installed && !$pkg->flag_upgrade) {
#- the same or a more recent package is installed,
#- but this package may be required explicitely, in such
#- case we can ask to remove all the previous one and
#- choose this one to install.
$db->traverse_tag('name', [ $pkg->name ], sub {
my ($p) = @_;
if ($pkg->compare_pkg($p) < 0) {
$allow or update_state_provides($state, $pkg);
$allow = 1;
$options{keep_state} or
$urpm->resolve_closure_ask_remove($db, $state, $p,
{ old_requested => 1, id => $pkg->id });
}
});
#- if nothing has been removed, just ignore it.
$allow or next;
}
}
#- keep in mind the package has be selected, remove the entry in requested input hasj,
#- this means required dependencies have undef value in selected hash.
#- requested flag is set only for requested package where value is not false.
$state->{selected}{$pkg->id} = delete $requested->{$dep};
$options{no_flag_update} or
$state->{selected}{$pkg->id} ? $pkg->set_flag_requested : $pkg->set_flag_required;
#- check if package is not already installed before trying to use it, compute
#- obsoleted package too. this is valable only for non source package.
if ($pkg->arch ne 'src') {
#- keep in mind the provides of this package, so that future requires can be satisfied
#- with this package potentially.
$allow or update_state_provides($state, $pkg);
foreach ($pkg->name." < ".$pkg->epoch.":".$pkg->version."-".$pkg->release, $pkg->obsoletes) {
if (my ($n, $o, $v) = /^([^\s\[]*)(?:\[\*\])?\s*\[?([^\s\]]*)\s*([^\s\]]*)/) {
$db->traverse_tag('name', [ $n ], sub {
my ($p) = @_;
!$o || eval($p->compare($v) . $o . 0) or return;
if ($options{keep_state}) {
push @obsoleted, exists $state->{obsoleted}{$p->fullname} ?
[ $p->fullname, $pkg->id ] : $p->fullname;
}
$state->{obsoleted}{$p->fullname}{$pkg->id} = undef;
foreach ($p->provides) {
#- clean installed property.
if (my ($ip) = $state->{installed}{$_}) {
delete $ip->{$p->fullname};
%$ip or delete $state->{installed}{$_};
}
#- check differential provides between obsoleted package and newer one.
if (my ($pn, $ps) = /^([^\s\[]*)(?:\[\*\])?\[?([^\s\]]*\s*[^\s\]]*)/) {
($state->{provided}{$pn} || {})->{$ps} or $diff_provides{$pn} = undef;
}
}
});
}
}
foreach my $n (keys %diff_provides) {
$db->traverse_tag('whatrequires', [ $n ], sub {
my ($p) = @_;
if (my @l = $urpm->unsatisfied_requires($db, $state, $p)) {
#- try if upgrading the package will be satisfying all the requires
#- else it will be necessary to ask hte user for removing it.
my $packages = $urpm->find_candidate_packages($p->name);
my $best = join '|', map { $_->id }
grep { $urpm->unsatisfied_requires($db, $state, $_, name => $n) == 0 }
@{$packages->{$p->name}};
if ($best) {
push @properties, $best;
} else {
#- no package have been found, we need to remove the package examined.
$options{keep_state} or
$urpm->resolve_closure_ask_remove($db, $state, $p,
{ unsatisfied => \@l, id => $pkg->id });
}
}
});
}
}
#- all requires should be satisfied according to selected package, or installed packages.
push @properties, $urpm->unsatisfied_requires($db, $state, $pkg);
#- keep in mind what is requiring each item (for unselect to work).
foreach ($pkg->requires_nosense) {
$state->{whatrequires}{$_}{$pkg->id} = undef;
}
#- examine conflicts, an existing package conflicting with this selection should
#- be upgraded to a new version which will be safe, else it should be removed.
foreach ($pkg->conflicts) {
if (my ($file) = /^(\/[^\s\[]*)/) {
$db->traverse_tag('path', [ $file ], sub {
my ($p) = @_;
#- all these packages should be removed.
$options{keep_state} or
$urpm->resolve_closure_ask_remove($db, $state, $p,
{ conflicts => $file, id => $pkg->id });
});
} elsif (my ($property, $name) = /^(([^\s\[]*).*)/) {
$db->traverse_tag('whatprovides', [ $name ], sub {
my ($p) = @_;
if (grep { ranges_overlap($_, $property) } $p->provides) {
#- the existing package will conflicts with selection, check if a newer
#- version will be ok, else ask to remove the old.
my $packages = $urpm->find_candidate_packages($p->name);
my $best = join '|', map { $_->id }
grep { ! grep { ranges_overlap($_, $property) } $_->provides }
@{$packages->{$p->name}};
if ($best) {
push @properties, $best;
} else {
#- no package have been found, we need to remove the package examined.
$options{keep_state} or
$urpm->resolve_closure_ask_remove($db, $state, $p,
{ conflicts => $property, id => $pkg->id });
}
}
});
}
}
#- we need to check a selected package is not selected.
#- if true, it should be unselected.
unless ($options{keep_state}) {
foreach (keys %{$urpm->{provides}{$pkg->name} || {}}) {
my $p = $urpm->{depslist}[$_];
$p != $pkg && $p->name eq $pkg->name && ($p->flag_selected || exists $state->{selected}{$p->id}) or next;
$state->{ask_unselect}{$pkg->id}{$p->id} = undef;
}
}
#- examine if an existing package does not conflicts with this one.
$db->traverse_tag('whatconflicts', [ $pkg->name ], sub {
my ($p) = @_;
foreach my $property ($p->conflicts) {
if (grep { ranges_overlap($_, $property) } $pkg->provides) {
#- all these packages should be removed.
$options{keep_state} or
$urpm->resolve_closure_ask_remove($db, $state, $p,
{ conflicts => $property, id => $pkg->id });
}
}
});
}
if ($options{keep_state}) {
#- clear state provided according to selection done.
foreach (keys %{$state->{selected} || {}}) {
my $pkg = $urpm->{depslist}[$_];
foreach ($pkg->provides) {
if (my ($n, $s) = /^([^\s\[]*)(?:\[\*\])?\[?([^\s\]]*\s*[^\s\]]*)/) {
delete $state->{provided}{$n}{$s}{$pkg->id};
%{$state->{provided}{$n}{$s}} or delete $state->{provided}{$n}{$s};
}
}
}
#- clear state obsoleted according to saved obsoleted.
foreach (@obsoleted) {
if (ref $_) {
exists $state->{obsoleted}{$_->[0]} and delete $state->{obsoleted}{$_->[0]}{$_->[1]};
} else {
delete $state->{obsoleted}{$_};
}
}
} else {
#- obsoleted packages are no longer marked as being asked to be removed.
delete @{$state->{ask_remove}}{map { /(.*)\.[^\.]*$/ && $1 } keys %{$state->{obsoleted}}};
}
#- return requested if not empty.
%$requested && $requested;
}
#- do the opposite of the above, unselect a package and extend
#- to any package not requested that is no more needed by
#- any other package.
sub resolve_unrequested {
my ($urpm, $db, $state, $unrequested, %options) = @_;
my (@unrequested, %unrequested, $id);
#- keep in mind unrequested package in order to allow unselection
#- of requested package.
@unrequested = keys %$unrequested;
@unrequested{@unrequested} = ();
#- iterate over package needing unrequested one.
while (defined($id = shift @unrequested)) {
my (%diff_provides, @clean_closure_ask_remove, $name);
my $pkg = $urpm->{depslist}[$id];
$pkg->flag_selected || exists $state->{unselected}{$pkg->id} or next;
#- the package being examined has to be unselected.
$options{no_flag_update} or
$pkg->set_flag_requested(0), $pkg->set_flag_required(0);
$state->{unselected}{$pkg->id} = undef;
#- state should be cleaned by any reference to it.
foreach ($pkg->provides) {
$diff_provides{$_} = undef;
if (my ($n, $s) = /^([^\s\[]*)(?:\[\*\])?\[?([^\s\]]*\s*[^\s\]]*)/) {
delete $state->{provided}{$n}{$s}{$pkg->id};
%{$state->{provided}{$n}{$s}} or delete $state->{provided}{$n}{$s};
}
}
foreach ($pkg->name, $pkg->obsoletes_nosense) {
$db->traverse_tag('name', [ $_ ], sub {
my ($p) = @_;
if ($state->{obsoleted}{$p->fullname} && exists $state->{obsoleted}{$p->fullname}{$pkg->id}) {
#- found an obsoleted package, clean state.
delete $state->{obsoleted}{$p->fullname}{$pkg->id};
#- if this package has been obsoleted only by this one being unselected
#- compute diff_provides to found potentially requiring packages.
unless (%{$state->{obsoleted}{$p->fullname}}) {
delete $state->{obsoleted}{$p->fullname};
delete @diff_provides{$p->provides};
}
}
});
}
foreach (keys %{$state->{ask_remove}}) {
my @l = grep { defined $_->{id} && $_->{id} != $pkg->id } @{$state->{ask_remove}{$_}};
if (@l < @{$state->{ask_remove}{$_}}) {
if (@l > 0) {
$state->{ask_remove}{$_} = \@l;
} else {
delete $state->{ask_remove}{$_};
push @clean_closure_ask_remove, $_;
}
}
}
while ($name = shift @clean_closure_ask_remove) {
foreach (keys %{$state->{ask_remove}}) {
my @l = grep { defined $_->{closure} && $_->{closure} ne $name } @{$state->{ask_remove}{$_}};
if (@l < @{$state->{ask_remove}{$_}}) {
if (@l > 0) {
$state->{ask_remove}{$_} = \@l;
} else {
delete $state->{ask_remove}{$_};
push @clean_closure_ask_remove, $_;
}
}
}
}
delete $state->{ask_unselect}{$pkg->id};
#- determine package that requires properties no more available, so that they need to be
#- unselected too.
foreach (keys %diff_provides) {
if (my ($n) = /^([^\s\[]*)/) {
$db->traverse_tag('whatrequires', [ $n ], sub {
my ($p) = @_;
if ($urpm->unsatisfied_requires($db, $state, $p, name => $n)) {
#- the package has broken dependencies, but it is already installed.
#- we can remove it (well this is problably not normal).
#TODO
$urpm->resolve_closure_ask_remove($db, $state, $p,
{ unrequested => 1, id => $pkg->id });
}
});
#- check a whatrequires on selected packages directly.
foreach (keys %{$state->{whatrequires}{$n} || {}}) {
my $p = $urpm->{depslist}[$_];
$p->flag_selected || exists $state->{unselected}{$p->id} or next;
if ($urpm->unsatisfied_requires($db, $state, $p, name => $n)) {
#- this package has broken dependencies, but it is installed.
#- just add it to unrequested.
exists $unrequested{$p->id} or push @unrequested, $p->id;
$unrequested{$p->id} = undef;
}
}
}
}
#- determine among requires of this package if there is a package not requested but
#- no more required.
#TODO
}
#- return unrequested if not empty.
%$unrequested && $unrequested;
}
#- compute installed flags for all package in depslist.
sub compute_installed_flags {
my ($urpm, $db) = @_;
my %sizes;
#- first pass to initialize flags installed and upgrade for all package.
foreach (@{$urpm->{depslist}}) {
$_->flag_upgrade || $_->flag_installed or $_->set_flag_upgrade;
}
#- second pass to set installed flag and clean upgrade flag according to installed packages.
$db->traverse(sub {
my ($p) = @_;
#- keep mind of sizes of each packages.
$sizes{join '-', ($p->fullname)[0..2]} = $p->size;
#- compute flags.
foreach (keys %{$urpm->{provides}{$p->name} || {}}) {
my $pkg = $urpm->{depslist}[$_];
$pkg->name eq $p->name or next;
#- compute only installed and upgrade flags.
$pkg->set_flag_installed; #- there is at least one package installed (whatever its version).
$pkg->flag_upgrade and $pkg->set_flag_upgrade($pkg->compare_pkg($p) > 0);
}
});
\%sizes;
}
#- select packages to upgrade, according to package already registered.
#- by default, only takes best package and its obsoleted and compute
#- all installed or upgrade flag.
sub request_packages_to_upgrade {
my ($urpm, $db, $state, $requested, %options) = @_;
my (%names, %skip, %obsoletes, @obsoleters);
#- build direct access to best package according to name.
foreach (@{$urpm->{depslist}}) {
if ($_->is_arch_compat) {
my $p = $names{$_->name};
if ($p) {
if ($_->compare_pkg($p) > 0) {
$names{$_->name} = $_;
}
} else {
$names{$_->name} = $_;
}
}
}
#- check consistency with obsoletes of eligible package.
#- it is important not to select a package wich obsolete
#- an old one.
foreach my $pkg (values %names) {
foreach ($pkg->obsoletes) {
if (my ($n, $o, $v) = /^([^\s\[]*)(?:\[\*\])?\[?([^\s\]]*)\s*([^\s\]]*)/) {
if ($names{$n} && (!$o || eval($names{$n}->compare($v) . $o . 0))) {
#- an existing best package is obsoleted by another one.
$skip{$n} = undef;
}
push @{$obsoletes{$n}}, $pkg;
}
}
}
#- ignore skipped packages.
delete @names{keys %skip};
#- now we can examine all existing packages to find packages to upgrade.
$db->traverse(sub {
my ($p) = @_;
#- first try with package using the same name.
#- this will avoid selecting all packages obsoleting an old one.
if (my $pkg = $names{$p->name}) {
$pkg->flag_upgrade || $pkg->flag_installed or $pkg->set_flag_upgrade;
$pkg->set_flag_installed;
if ($pkg->compare_pkg($p) <= 0) {
#- this means the package is already installed (or there
#- is a old version in depslist).
$pkg->set_flag_upgrade(0);
#- ignore it now.
delete $names{$p->name};
}
}
#- check provides of existing package to see if a obsolete
#- may allow selecting it.
foreach my $property ($p->provides) {
#- only real provides should be taken into account, this means internal obsoletes
#- should be avoided.
unless (grep { ranges_overlap($property, $_) } $p->obsoletes) {
if (my ($n) = $property =~ /^([^\s\[]*)/) {
foreach my $pkg (@{$obsoletes{$n} || []}) {
next if $pkg->name eq $p->name || $p->name ne $n || !$names{$pkg->name};
foreach ($pkg->obsoletes) {
if (ranges_overlap($property, $_)) {
#- the package being examined can be obsoleted.
#- do not set installed and provides flags.
push @obsoleters, $pkg;
return;
}
}
}
}
}
}
});
#- examine all obsoleters packages, compute installer and upgrade flag if needed.
foreach my $pkg (@obsoleters) {
next if !$names{$pkg->name};
unless ($pkg->flag_upgrade || $pkg->flag_installed) {
#- assume for this small algorithm package to be upgradable.
$pkg->set_flag_upgrade;
$db->traverse_tag('name', [ $pkg->name ], sub {
my ($p) = @_;
$pkg->set_flag_installed; #- there is at least one package installed (whatever its version).
$pkg->flag_upgrade and $pkg->set_flag_upgrade($pkg->compare_pkg($p) > 0);
});
}
$pkg->flag_installed && !$pkg->flag_upgrade and delete $names{$pkg->name};
}
#- examine all packages which may be conflicting, it a package conflicts, it should not be requested.
my @names = map { $_->name." == ".$_->epoch.":".$_->version."-".$_->release } values %names;
my @pkgs = values %names;
foreach my $pkg (@pkgs) {
foreach my $conflict ($pkg->conflicts) {
delete @names{map { /(\S*)/ && $1 } grep { ranges_overlap($conflict, $_) } @names};
}
}
#- examine all packages potentially selectable.
foreach my $pkg (values %names) {
$pkg->flag_upgrade and $requested->{$pkg->id} = $options{requested};
}
$requested;
}
1;
|