2011-04-21 04:49:52 +00:00
|
|
|
#
|
2015-04-13 20:30:23 +00:00
|
|
|
# spec file for package perl-Cache-FastMmap
|
2011-04-21 04:49:52 +00:00
|
|
|
#
|
2015-04-13 20:30:23 +00:00
|
|
|
# Copyright (c) 2015 SUSE LINUX GmbH, Nuernberg, Germany.
|
2011-04-21 04:49:52 +00:00
|
|
|
#
|
|
|
|
# All modifications and additions to the file contributed by third parties
|
|
|
|
# remain the property of their copyright owners, unless otherwise agreed
|
|
|
|
# upon. The license for this file, and modifications and additions to the
|
|
|
|
# file, is the same license as for the pristine package itself (unless the
|
|
|
|
# license for the pristine package is not an Open Source License, in which
|
|
|
|
# case the license is the MIT License). An "Open Source License" is a
|
|
|
|
# license that conforms to the Open Source Definition (Version 1.9)
|
|
|
|
# published by the Open Source Initiative.
|
|
|
|
|
|
|
|
# Please submit bugfixes or comments via http://bugs.opensuse.org/
|
|
|
|
#
|
|
|
|
|
2015-04-13 20:30:23 +00:00
|
|
|
|
2011-04-21 04:49:52 +00:00
|
|
|
Name: perl-Cache-FastMmap
|
2015-10-23 19:26:50 +00:00
|
|
|
Version: 1.43
|
2015-04-13 20:30:23 +00:00
|
|
|
Release: 0
|
2011-04-21 04:49:52 +00:00
|
|
|
%define cpan_name Cache-FastMmap
|
|
|
|
Summary: Uses an mmap'ed file to act as a shared memory interprocess cache
|
2015-04-13 20:30:23 +00:00
|
|
|
License: GPL-1.0+ or Artistic-1.0
|
2011-04-21 04:49:52 +00:00
|
|
|
Group: Development/Libraries/Perl
|
2015-04-13 20:30:23 +00:00
|
|
|
Url: http://search.cpan.org/dist/Cache-FastMmap/
|
2015-10-23 19:26:50 +00:00
|
|
|
Source0: http://www.cpan.org/authors/id/R/RO/ROBM/%{cpan_name}-%{version}.tar.gz
|
|
|
|
Source1: cpanspec.yml
|
2011-04-21 04:49:52 +00:00
|
|
|
BuildRoot: %{_tmppath}/%{name}-%{version}-build
|
|
|
|
BuildRequires: perl
|
|
|
|
BuildRequires: perl-macros
|
|
|
|
%{perl_requires}
|
|
|
|
|
|
|
|
%description
|
|
|
|
In multi-process environments (eg mod_perl, forking daemons, etc), it's
|
|
|
|
common to want to cache information, but have that cache shared between
|
|
|
|
processes. Many solutions already exist, and may suit your situation
|
|
|
|
better:
|
|
|
|
|
|
|
|
* *
|
|
|
|
|
|
|
|
the MLDBM::Sync manpage - acts as a database, data is not automatically
|
|
|
|
expired, slow
|
|
|
|
|
|
|
|
* *
|
|
|
|
|
|
|
|
the IPC::MM manpage - hash implementation is broken, data is not
|
|
|
|
automatically expired, slow
|
|
|
|
|
|
|
|
* *
|
|
|
|
|
|
|
|
the Cache::FileCache manpage - lots of features, slow
|
|
|
|
|
|
|
|
* *
|
|
|
|
|
|
|
|
the Cache::SharedMemoryCache manpage - lots of features, VERY slow. Uses
|
|
|
|
IPC::ShareLite which freeze/thaws ALL data at each read/write
|
|
|
|
|
|
|
|
* *
|
|
|
|
|
|
|
|
the DBI manpage - use your favourite RDBMS. can perform well, need a DB
|
|
|
|
server running. very global. socket connection latency
|
|
|
|
|
|
|
|
* *
|
|
|
|
|
|
|
|
the Cache::Mmap manpage - similar to this module, in pure perl. slows
|
|
|
|
down with larger pages
|
|
|
|
|
|
|
|
* *
|
|
|
|
|
|
|
|
the BerkeleyDB manpage - very fast (data ends up mostly in shared memory
|
|
|
|
cache) but acts as a database overall, so data is not automatically
|
|
|
|
expired
|
|
|
|
|
|
|
|
In the case I was working on, I needed:
|
|
|
|
|
|
|
|
* *
|
|
|
|
|
|
|
|
Automatic expiry and space management
|
|
|
|
|
|
|
|
* *
|
|
|
|
|
|
|
|
Very fast access to lots of small items
|
|
|
|
|
|
|
|
* *
|
|
|
|
|
|
|
|
The ability to fetch/store many items in one go
|
|
|
|
|
|
|
|
Which is why I developed this module. It tries to be quite efficient
|
|
|
|
through a number of means:
|
|
|
|
|
|
|
|
* *
|
|
|
|
|
|
|
|
Core code is written in C for performance
|
|
|
|
|
|
|
|
* *
|
|
|
|
|
|
|
|
It uses multiple pages within a file, and uses Fcntl to only lock a page
|
|
|
|
at a time to reduce contention when multiple processes access the cache.
|
|
|
|
|
|
|
|
* *
|
|
|
|
|
|
|
|
It uses a dual level hashing system (hash to find page, then hash within
|
|
|
|
each page to find a slot) to make most 'get()' calls O(1) and fast
|
|
|
|
|
|
|
|
* *
|
|
|
|
|
|
|
|
On each 'set()', if there are slots and page space available, only the
|
|
|
|
slot has to be updated and the data written at the end of the used data
|
|
|
|
space. If either runs out, a re-organisation of the page is performed to
|
|
|
|
create new slots/space which is done in an efficient way
|
|
|
|
|
|
|
|
The class also supports read-through, and write-back or write-through
|
|
|
|
callbacks to access the real data if it's not in the cache, meaning that
|
|
|
|
code like this:
|
|
|
|
|
|
|
|
my $Value = $Cache->get($Key);
|
|
|
|
if (!defined $Value) {
|
|
|
|
$Value = $RealDataSource->get($Key);
|
|
|
|
$Cache->set($Key, $Value)
|
|
|
|
}
|
|
|
|
|
|
|
|
Isn't required, you instead specify in the constructor:
|
|
|
|
|
|
|
|
Cache::FastMmap->new(
|
|
|
|
...
|
|
|
|
context => $RealDataSourceHandle,
|
|
|
|
read_cb => sub { $_[0]->get($_[1]) },
|
|
|
|
write_cb => sub { $_[0]->set($_[1], $_[2]) },
|
|
|
|
);
|
|
|
|
|
|
|
|
And then:
|
|
|
|
|
|
|
|
my $Value = $Cache->get($Key);
|
|
|
|
|
|
|
|
$Cache->set($Key, $NewValue);
|
|
|
|
|
|
|
|
Will just work and will be read/written to the underlying data source as
|
|
|
|
needed automatically.
|
|
|
|
|
|
|
|
%prep
|
|
|
|
%setup -q -n %{cpan_name}-%{version}
|
|
|
|
|
|
|
|
%build
|
|
|
|
%{__perl} Makefile.PL INSTALLDIRS=vendor OPTIMIZE="%{optflags}"
|
|
|
|
%{__make} %{?_smp_mflags}
|
|
|
|
|
|
|
|
%check
|
|
|
|
%{__make} test
|
|
|
|
|
|
|
|
%install
|
|
|
|
%perl_make_install
|
|
|
|
%perl_process_packlist
|
|
|
|
%perl_gen_filelist
|
|
|
|
|
|
|
|
%files -f %{name}.files
|
|
|
|
%defattr(-,root,root,755)
|
|
|
|
%doc Changes README
|
|
|
|
|
|
|
|
%changelog
|