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
|
# ex:ts=8 sw=4:
# $OpenBSD: Search.pm,v 1.12 2009/11/09 17:50:24 espie Exp $
#
# Copyright (c) 2007 Marc Espie <espie@openbsd.org>
#
# Permission to use, copy, modify, and distribute this software for any
# purpose with or without fee is hereby granted, provided that the above
# copyright notice and this permission notice appear in all copies.
#
# THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
# WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
# MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
# ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
# WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
# ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
# OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
package OpenBSD::Search;
sub match_locations
{
my ($self, $o) = @_;
require OpenBSD::PackageLocation;
my @l = map {$o->new_location($_)} $self->match($o);
return \@l;
}
# XXX this is not efficient
sub filter_locations
{
my ($self, $l) = @_;
my $r = [];
for my $loc (@$l) {
if ($self->filter($loc->{name})) {
push(@$r, $loc);
}
}
return $r;
}
package OpenBSD::Search::PkgSpec;
our @ISA=(qw(OpenBSD::Search));
sub match_ref
{
my ($self, $r) = @_;
return $self->{spec}->match_ref($r);
}
sub match
{
my ($self, $o) = @_;
return $self->match_ref($o->list);
}
sub match_locations
{
my ($self, $o) = @_;
return $self->{spec}->match_locations($o->locations_list);
}
sub filter_locations
{
my ($self, $l) = @_;
return $self->{$spec}->match_locations($l);
}
sub filter
{
my ($self, @list) = @_;
return $self->match_ref(\@list);
}
sub new
{
my ($class, $pattern) = @_;
require OpenBSD::PkgSpec;
bless { spec => $class->spec_class->new($pattern)}, $class;
}
sub add_pkgpath_hint
{
my ($self, $pkgpath) = @_;
$self->{pkgpath} = $pkgpath;
}
sub spec_class
{ "OpenBSD::PkgSpec" }
package OpenBSD::Search::Exact;
our @ISA=(qw(OpenBSD::Search::PkgSpec));
sub spec_class
{ "OpenBSD::PkgSpec::Exact" }
package OpenBSD::Search::Stem;
our @ISA=(qw(OpenBSD::Search));
sub new
{
my ($class, $stem) = @_;
my $flavors;
if ($stem =~ m/^(.*)\-\-(.*)/) {
# XXX
return OpenBSD::Search::Exact->new("$1-*-$2");
}
return bless {stem => $stem}, $class;
}
sub split
{
my ($class, $pkgname) = @_;
require OpenBSD::PackageName;
return $class->new(OpenBSD::PackageName::splitstem($pkgname));
}
sub match
{
my ($self, $o) = @_;
return $o->stemlist->find($self->{stem});
}
sub _keep
{
my ($self, $stem) = @_;
return $self->{stem} eq $stem;
}
sub filter
{
my ($self, @l) = @_;
my @result = ();
require OpenBSD::PackageName;
for my $pkg (@l) {
if ($self->_keep(OpenBSD::PackageName::splitstem($pkgname))) {
push(@result, $pkg);
}
}
return @result;
}
package OpenBSD::Search::PartialStem;
our @ISA=(qw(OpenBSD::Search::Stem));
sub match
{
my ($self, $o) = @_;
return $o->stemlist->find_partial($self->{stem});
}
sub _keep
{
my ($self, $stem) = @_;
my $partial = $self->{stem};
return $stem =~ /\Q$partial\E/;
}
package OpenBSD::Search::Filter;
our @ISA=(qw(OpenBSD::Search));
sub new
{
my ($class, $code) = @_;
return bless {code => $code}, $class;
}
sub filter
{
my ($self, @l) = @_;
return &{$self->{code}}(@l);
}
package OpenBSD::Search::FilterLocation;
our @ISA=(qw(OpenBSD::Search));
sub new
{
my ($class, $code) = @_;
return bless {code => $code}, $class;
}
sub filter_locations
{
my ($self, $l) = @_;
return &{$self->{code}}($l);
}
sub more_recent_than
{
my ($class, $name) = @_;
require OpenBSD::PackageName;
my $f = OpenBSD::PackageName->from_string($name);
return $class->new(
sub {
my $l = shift;
my $r = [];
for my $e (@$l) {
if ($f->{version}->compare($e->pkgname->{version}) < 0) {
push(@$r, $e);
}
}
return $r;
});
}
sub keep_most_recent
{
my $class = shift;
return $class->new(
sub {
my $l = shift;
# no need to filter
return $l if @$l <= 1;
require OpenBSD::PackageName;
my $h = {};
# we have to prove we have to keep it
while (my $e = pop @$l) {
my $stem = $e->pkgname->{stem};
my $keep = 1;
# so let's compare with every element in $h with the same stem
for my $f (@{$h->{$e->pkgname->{stem}}}) {
# if this is not the same flavors,
# we don't filter
if ($f->pkgname->flavor_string ne $e->pkgname->flavor_string) {
next;
}
# okay, now we need to prove there's a common pkgpath
if (!$e->update_info->match_pkgpath($f->update_info)) {
next;
}
if ($f->pkgname->{version}->compare($e->pkgname->{version}) < 0) {
$f = $e;
}
$keep = 0;
last;
}
if ($keep) {
push(@{$h->{$e->pkgname->{stem}}}, $e);
}
}
my $largest = [];
push @$largest, map {@$_} values %$h;
return $largest;
}
);
}
1;
|
