package SVN::Web::Browse; use strict; use warnings; use base 'SVN::Web::action'; use SVN::Ra; use SVN::Client; use SVN::Web::X; our $VERSION = 0.53; =head1 NAME SVN::Web::Browse - SVN::Web action to browse a Subversion repository =head1 SYNOPSIS In F actions: ... browse: class: SVN::Web::Browse action_menu: show: - directory link_text: (browse directory) ... =head1 DESCRIPTION Returns a file/directory listing for the given repository path. =head1 OPTIONS =over 4 =item rev The repository revision to show. Defaults to the repository's youngest revision. =back =head1 TEMPLATE VARIABLES =over 4 =item at_head A boolean value, indicating whether or not the user is currently browsing the HEAD of the repository. =item context Always C. =item entries A list of hash refs, one for each file and directory entry in the browsed path. The list is ordered with directories first, then files, sorted alphabetically. Each hash ref has the following keys. =over 8 =item name The entry's name. =item path The entry's full path. =item rev The entry's most recent interesting revision. =item size The entry's size, in bytes. The empty string C<''> for directories. =item type The entry's C property. Not set for directories. =item author The userid that committed the most recent interesting revision for this entry. =item date The date of the entry's most recent interesting revision, formatted according to L. =item msg The log message for the entry's most recent interesting revision. =back =item rev The repository revision that is being browsed. Will be the same as the C parameter given to the action, unless that parameter was not set, in which case it will be the repository's youngest revision. =item youngest_rev The repository's youngest revision. =back =head1 EXCEPTIONS =over 4 =item (path %1 does not exist in revision %2) The given path is not present in the repository at the given revision. =item (path %1 is not a directory in revision %2) The given path exists in the repository at the given revision, but is not a directory. This action is only used to browse directories. =back =cut sub cache_key { my $self = shift; my $path = $self->{path}; my(undef, undef, $act_rev, $at_head) = $self->get_revs(); return "$act_rev:$at_head:$path"; } sub run { my $self = shift; my $ctx = $self->{repos}{client}; my $ra = $self->{repos}{ra}; my $path = $self->{path}; my $uri = $path eq '/' ? $self->{repos}{uri} : $self->{repos}{uri} . $path; my($exp_rev, $yng_rev, $act_rev, $at_head) = $self->get_revs(); my $rev = $act_rev; my $node_kind; $ctx->info($uri, $rev, $rev, sub { $node_kind = $_[1]->kind(); }, 0); if($node_kind == $SVN::Node::none) { SVN::Web::X->throw( error => '(path %1 does not exist in revision %2)', vars => [$path, $rev] ); } if($node_kind != $SVN::Node::dir) { SVN::Web::X->throw( error => '(path %1 is not a directory in revision %2)', vars => [$path, $rev], ); } my $dirents = $ctx->ls($uri, $rev, 0); my $entries = []; my($name, $dirent); my $current_time = time(); while(($name, $dirent) = each %{ $dirents }) { my $kind = $dirent->kind(); my $entry_path = $path eq '/' ? "$path$name" : "$path/$name"; my @log_result = $self->recent_interesting_rev($entry_path, $rev); push @{ $entries }, { name => $name, rev => $log_result[1], kind => $kind, isdir => ($kind == $SVN::Node::dir), size => ($kind == $SVN::Node::dir ? '' : $dirent->size()), author => $dirent->last_author(), has_props => $dirent->has_props(), time => $dirent->time() / 1_000_000, age => $current_time - ($dirent->time() / 1_000_000), msg => $log_result[4], }; } # TODO: custom sorting @$entries = sort { ($b->{isdir} <=> $a->{isdir}) || ($a->{name} cmp $b->{name}) } @$entries; my @props = (); foreach my $prop_name (qw(svn:externals)) { my $prop_value = ($ctx->revprop_get($prop_name, $uri, $rev))[0]; if(defined $prop_value) { $prop_value =~ s/\s*\n$//ms; push @props, { name => $prop_name, value => $prop_value }; } } return { template => 'browse', data => { context => 'directory', entries => $entries, rev => $act_rev, youngest_rev => $yng_rev, at_head => $at_head, props => \@props, } }; } 1; =head1 COPYRIGHT Copyright 2003-2004 by Chia-liang Kao C<< >>. Copyright 2005-2007 by Nik Clayton C<< >>. This program is free software; you can redistribute it and/or modify it under the same terms as Perl itself. See L =cut