This file is indexed.

/usr/share/vile/perl/search.pm is in vile-common 9.8q-1build1.

This file is owned by root:root, with mode 0o644.

The actual contents of the file can be viewed below.

  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
package search;

use strict;
use vars qw(@ISA %REGISTRY);

require Vile::Exporter;
@ISA      = 'Vile::Exporter';
%REGISTRY = (
    'perl-fsearch' => [ motion => \&fsearch, "perl forward search", 'M-/' ],
    'perl-rsearch' => [ motion => \&rsearch, "perl reverse search", 'M-?' ],
    'perl-search-next' => [ motion => \&searchnext, "perl search next", 'M-n' ],
    'perl-search-prev' => [ motion => \&searchprev, "perl search prev", 'M-N' ],
);

*CHUNKSIZE = \100;
our $CHUNKSIZE;
our $direction = '';

#open TTY, ">/dev/tty";			# for debugging

#
# Get the pattern to search for, either from the user or from the
# previously stashed value in vile's search variable.
#

sub getpat {
    my ( $how, $ldirection ) = @_;
    my $pat;

    if ( defined($how) and $how eq 'noprompt' ) {
        $pat = Vile::get('search');
    }
    else {
        $direction = $ldirection;
        $pat       = Vile::mlreply_no_opts(
            $direction eq 'forward'
            ? 'Perl search: '
            : 'Reverse perl search: ',
            scalar Vile::get('search')
        );
    }
    Vile::set( search => $pat ) if defined($pat);
    return $pat;
}

#
# Back references (e.g, \1, \2, etc.) need to be adjusted to work
# properly since our search expression contains parenthesized
# expressions too.
#

sub fixbackreferences {
    my $pat     = shift;
    my $adj     = shift;
    my $lpcount = 0;       # number of unescaped left parens

    $lpcount++ while $pat =~ /(^|[^\\])\(/g;

    if ( $lpcount > 0 ) {
        $pat =~ s/\\(\[1-9][0-9]*|.)/
	         "\\" . (($1 + 0 && $1 <= $lpcount) ? $1+$adj : $1)/gex;
    }

    return $pat;
}

#
# Search forward.  This is not as straightforward as it could be since
# we attempt to fetch the lines in chunks for efficient searching.
#

sub fsearch {
    my $pat = getpat( shift, 'forward' );

    return 0 unless defined($pat);

    my $wrap       = 0;
    my $cb         = $Vile::current_buffer;
    my @start_dot  = $cb->current_position;
    my $lastline   = ( $cb->setregion( 1, '$' ) )[2];
    my $chunkstart = $start_dot[0];
    my $pos        = $start_dot[1] + 1;

    if ( $pos >= ( $cb->setregion( $chunkstart, 0, $chunkstart, '$$' ) )[3] ) {
        $pos = 0;
        $chunkstart++;
        $chunkstart = 1 if ( $chunkstart > $lastline );
    }

    my $chunkend = $chunkstart + $CHUNKSIZE;
    my $chunk;
    my @dot;

    $pat = fixbackreferences( $pat, 1 );

    while (1) {
        $cb->set_region( $chunkstart, $chunkend - 1 );
        $chunk = $cb->fetch;
        pos($chunk) = $pos;
        $pos = 0;
        if ( $chunk =~ /($pat)/mg ) {
            my $lc       = 0;
            my $matchlen = length($1);
            $chunk = substr( $chunk, 0, pos($chunk) );
            $lc++ while $chunk =~ /\n/g;
            $chunk =~ s/.*\n//g;
            $cb->current_position( $chunkstart + $lc,
                length($chunk) - $matchlen );
            if ($wrap) {
                @dot = $cb->current_position;
                if ( $start_dot[0] == $dot[0] and $start_dot[1] == $dot[1] ) {
                    print "Only one occurrence of pattern";
                }
                else {
                    print "[Search wrapped past end of buffer]";
                }
            }
            return 1;
        }
    }
    continue {
        $chunkstart = $chunkend;
        if ($wrap) {
            last if $chunkstart > $start_dot[0];
        }
        elsif ( $chunkstart > $lastline ) {
            $wrap       = 1;
            $chunkstart = 1;
        }
        $chunkend = $chunkstart + $CHUNKSIZE;
    }

    print "Not found";
    return 0;
}

#
# Search backward
#

sub rsearch {
    my $pat = getpat( shift, 'backward' );
    return 0 unless defined($pat);

    my $wrap      = 0;
    my $cb        = $Vile::current_buffer;
    my @start_dot = $cb->current_position;
    my $lastline  = ( $cb->setregion( 1, '$' ) )[2];
    my $chunkend  = $start_dot[0] + 1;
    my $pmpat;

    if ( $start_dot[1] == 0 ) {
        if ( $chunkend <= 2 ) {
            $chunkend = $lastline + 1;
        }
        else {
            $chunkend--;
        }
        $pmpat = '.*';
    }
    else {
        $pmpat = ".{0,@{[$start_dot[1]-1]}}";
    }

    my $chunkstart = $chunkend - 1;
    my $chunk;
    my $pos;
    my @dot;

    $chunkstart = 1 unless $chunkstart > 0;
    $cb->set_region( $chunkstart, 0, $chunkend - 1, '$' );

    $pat = fixbackreferences( $pat, 2 );

    # $ matches at both the newline and the position after the newline.
    # Eliminate one of these cases.
    $pat =~ s/(^|[^\\])\$$/$1(?=\n\$)/;

    while (1) {
        $chunk = $cb->fetch;
        pos($chunk) = $pos;
        $pos = 0;
        if ( my ( $prematch, $match ) = $chunk =~ /\A($pmpat)($pat)/mg ) {
            my $lc = 0;
            $lc++ while ( $prematch =~ /\n/g );
            $prematch =~ s/.*\n//g;
            $cb->current_position( $chunkstart + $lc, length($prematch) );
            if ($wrap) {
                @dot = $cb->current_position;
                if ( $start_dot[0] == $dot[0] and $start_dot[1] == $dot[1] ) {
                    print "Only one occurrence of pattern";
                }
                else {
                    print "[Search wrapped past end of buffer]";
                }
            }
            return 1;
        }
    }
    continue {
        $chunkend = $chunkstart;
        if ($wrap) {
            last if $chunkend <= $start_dot[0];
        }
        elsif ( $chunkend <= 1 ) {
            $wrap     = 1;
            $chunkend = $lastline + 1;
        }
        $chunkstart = $chunkend - $CHUNKSIZE;
        $chunkstart = 1 unless $chunkstart > 0;
        $cb->set_region( $chunkstart, $chunkend - 1 );
        $pmpat = "[\000-\377]*";
    }

    print "Not found";
    return 0;
}

#
# Find next occurrence of pattern in the current direction
#

sub searchnext {
    $direction eq 'forward' ? fsearch('noprompt') : rsearch('noprompt');
}

#
# Find previous occurrence of pattern in current direction
#

sub searchprev {
    $direction eq 'forward' ? rsearch('noprompt') : fsearch('noprompt');
}

1;

__DATA__

=head1 NAME

search - drop-in replacement for Vile's search facilities

=head1 SYNOPSIS

In .vilerc:

    perl "use search"

In [x]vile:

    :perl-fsearch
    :perl-rsearch
    :perl-search-next
    :perl-search-prev

and then provide responses to the ensuing prompts.

=head1 DESCRIPTION

The B<search> package contains perl subroutines which are intended as a
drop in replacement for vile's search facilities.  Not all features
(such as visual matches) are implemented yet.

These bindings are proper motions, however, so things like 'dn'
or 'd/foo' will work as expected.

=head1 AUTHOR

Brendan O'Dea

=cut