/usr/share/perl5/Cache/Memory/Entry.pm is in libcache-perl 2.10-1.
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 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 | =head1 NAME
Cache::Memory::Entry - An entry in the memory based implementation of Cache
=head1 SYNOPSIS
See 'Cache::Entry' for a synopsis.
=head1 DESCRIPTION
This module implements a version of Cache::Entry for the Cache::Memory variant
of Cache. It should not be created or used directly, please see
'Cache::Memory' or 'Cache::Entry' instead.
=cut
package Cache::Memory::Entry;
require 5.006;
use strict;
use warnings;
use Cache::Memory;
use Storable;
use Carp;
use base qw(Cache::Entry);
use fields qw(store_entry);
our $VERSION = '2.10';
sub new {
my Cache::Memory::Entry $self = shift;
my ($cache, $key, $entry) = @_;
$self = fields::new($self) unless ref $self;
$self->SUPER::new($cache, $key);
$self->{store_entry} = $entry;
# increment the reference count for the entry
$entry->{rc}++;
return $self;
}
sub DESTROY {
my Cache::Memory::Entry $self = shift;
# drop the reference count and signal the cache if required
unless (--$self->{store_entry}->{rc}) {
$self->{cache}->entry_dropped_final_rc($self->{key});
}
}
sub exists {
my Cache::Memory::Entry $self = shift;
# ensure pending expiries are removed
$self->{cache}->purge();
return defined $self->{store_entry}->{data};
}
sub _set {
my Cache::Memory::Entry $self = shift;
my ($data, $expiry) = @_;
my $cache = $self->{cache};
my $key = $self->{key};
my $entry = $self->{store_entry};
my $exists = defined $entry->{data};
my $orig_size;
unless ($exists) {
# we're creating the element
my $time = time();
$entry->{age_elem} = $cache->add_age_to_heap($key, $time);
$entry->{use_elem} = $cache->add_use_to_heap($key, $time);
$orig_size = 0;
}
elsif (not exists $entry->{handlelock}) {
# only remove current size if there is no active handle
$orig_size = length(${$entry->{data}});
}
else {
$orig_size = 0;
}
$entry->{data} = \$data;
# invalidate any active handles
delete $entry->{handlelock};
$self->_set_expiry($expiry) if $expiry or $exists;
$cache->update_last_used($key) if $exists;
$cache->change_size(length($data) - $orig_size);
# ensure pending expiries are removed;
$cache->purge();
}
sub _get {
my Cache::Memory::Entry $self = shift;
$self->exists() or return undef;
my $entry = $self->{store_entry};
$entry->{handlelock}
and warnings::warnif('Cache', 'get called whilst write handle is open');
$self->{cache}->update_last_used($self->{key});
return ${$self->{store_entry}->{data}};
}
sub size {
my Cache::Memory::Entry $self = shift;
defined $self->{store_entry}->{data}
or return undef;
return length(${$self->{store_entry}->{data}});
}
sub remove {
my Cache::Memory::Entry $self = shift;
# send remove request directly to cache object
return $self->{cache}->remove($self->{key});
}
sub expiry {
my Cache::Memory::Entry $self = shift;
$self->exists() or return undef;
my $exp_elem = $self->{store_entry}->{exp_elem}
or return undef;
return $exp_elem->val();
}
sub _set_expiry {
my Cache::Memory::Entry $self = shift;
my ($time) = @_;
my $cache = $self->{cache};
my $entry = $self->{store_entry};
defined $entry->{data}
or croak "Cannot set expiry on non-existant entry: $self->{key}";
my $exp_elem = $entry->{exp_elem};
if ($exp_elem) {
$cache->del_expiry_from_heap($self->{key}, $exp_elem);
$entry->{exp_elem} = undef;
}
return unless $time;
$entry->{exp_elem} = $cache->add_expiry_to_heap($self->{key}, $time);
}
# create a handle. The entry is 'locked' via the use of a 'handlelock'
# element. The current data reference is reset to an empty string whilst the
# handle is active to allow set and remove to work correctly without
# corrupting size tracking. If set or remove are used to change the entry,
# this is detected when the handle is closed again and the size is adjusted
# (downwards) and the original data discarded.
sub _handle {
my Cache::Memory::Entry $self = shift;
my ($mode, $expiry) = @_;
require Cache::IOString;
my $writing = $mode =~ />|\+/;
my $entry = $self->{store_entry};
# set the entry to a empty string if the entry doesn't exist or
# should be truncated
if (not defined $entry->{data} or $mode =~ /^\+?>$/) {
# return undef unless we're writing to the string
$writing or return undef;
$self->_set('', $expiry);
}
else {
$self->{cache}->update_last_used($self->{key});
}
my $dataref = $entry->{data};
if ($writing) {
exists $entry->{handlelock}
and croak "Write handle already active for this entry";
my $orig_size = length($$dataref);
# replace data with empty string whilst handle is active
$entry->{handlelock} = $dataref;
return Cache::IOString->new($dataref, $mode,
sub { $self->_handle_closed(shift, $orig_size); });
}
else {
return Cache::IOString->new($dataref, $mode);
}
}
sub validity {
my Cache::Memory::Entry $self = shift;
$self->exists() or return undef;
my $validity = $self->{store_entry}->{validity};
# return a clone of the validity if it's a reference
return Storable::dclone($validity) if ref($validity);
return $validity;
}
sub set_validity {
my Cache::Memory::Entry $self = shift;
my ($data) = @_;
my $entry = $self->{store_entry};
# ensure data is not undefined
unless (defined $entry->{data}) {
$self->set('');
}
$entry->{validity} = $data;
}
# UTILITY METHODS
sub _handle_closed {
my Cache::Memory::Entry $self = shift;
my ($iostring, $orig_size) = @_;
$orig_size ||= 0;
my $dataref = $iostring->sref();
my $entry = $self->{store_entry};
# ensure the data hasn't been removed or been replaced
my $removed = !$self->exists();
# check our handle marker
if (defined $entry->{handlelock} and $entry->{handlelock} == $dataref) {
delete $entry->{handlelock};
}
else {
$removed = 1;
}
if ($removed) {
# remove original size and discard dataref
$self->{cache}->change_size(-$orig_size) if $orig_size;
return;
}
# reinsert data
$entry->{data} = $dataref;
my $new_size = length(${$entry->{data}});
if ($orig_size != $new_size) {
$self->{cache}->change_size($new_size - $orig_size);
}
}
1;
__END__
=head1 SEE ALSO
Cache::Entry, Cache::Memory
=head1 AUTHOR
Chris Leishman <chris@leishman.org>
Based on work by DeWitt Clinton <dewitt@unto.net>
=head1 COPYRIGHT
Copyright (C) 2003-2006 Chris Leishman. All Rights Reserved.
This module is distributed on an "AS IS" basis, WITHOUT WARRANTY OF ANY KIND,
either expressed or implied. This program is free software; you can
redistribute or modify it under the same terms as Perl itself.
$Id: Entry.pm,v 1.8 2006/01/31 15:23:58 caleishm Exp $
=cut
|