Sam Vilain > threads-tbb > threads::tbb::concurrent::hash

Download:
threads-tbb-0.04.tar.gz

Annotate this POD

CPAN RT

New  2
Open  0
View/Report Bugs
Source  

NAME ^

threads::tbb::concurrent::hash - shared hash via tbb::concurrent_hash_map

SYNOPSIS ^

  use threads::tbb;

  #my @array :concurrent;  # TODO
  tie my %hash, "threads::tbb::concurrent::array";

  $hash{foo} = "bar";  # unsafe, use for initializing only
  print $hash{foo};    # safe, but hangs while write locked

  # threadsafe access with exclusive lock:
  my $lock = (tied %hash)->writer($key);
  print $lock->get();        # starts as undef
  $lock->set("new value");
  undef($lock);              # release lock

  # threadsafe access with share (read-only) lock:
  $lock = (tied %hash)->reader($key);  # may return undef
  print $lock->get();
  undef($lock);              # release lock

DESCRIPTION ^

The concurrent hash is a Perl tied hash that multiple threads can read to and write from. It also provides the advantage of using cache-aligned hash slots, so threads don't conflict on nearby access with each other.

Implementation of basic hash primitives is incomplete; stick with the concurrent API and you will be fine. Patches welcome!

CLASS METHODS

These methods will get you a new instance of a threads::tbb::concurrent::hash;

threads::tbb::concurrent::hash->new()
threads::tbb::concurrent::hash->TIEHASH()

Both of these class methods return a new concurrent hash container.

The TIEHASH constructor is provided for the tie built-in (see "tie" in perlfunc and perltie).

INSTANCE METHODS

The thread-safe operations on this type are:

$hash->FETCH(key)

Tied API. Access a slot in the hash. This will only return immediately if there are no other locks held on this hash slot (see below). As there is no lock object returned, this access method always deep-clones the return value.

$slot = $hash->reader(key)

Returns a const accessor for the slot at key, or undef if there is no slot there. If the slot exists, and contains undef or any other scalar value, the function will return a lazy clone handle to it. You may get a copy of the scalar in $slot with its ->get() method:

   my $slot = (tied %hash)->reader($key);
   my $value = $slot->get();

The key will have a share lock taken out - no exclusive (write) locks can exist or be taken out until the $slot value passes out of scope or is undefined.

Make sure that you do not save objects which were referenced from ->get() for longer than the lifetime of the locks, without cloning via Storable::dclone first. If you do, they must be completely constant values.

$slot = $hash->writer(key)

Returns a mutable accessor for the slot at key. If the slot does not exist, then it creates the slot with value undef first. The function will return a lazy clone handle to it which can also change the value. You may get a copy of the scalar in $slot with its ->get() method as above, and also change its value using its ->set() method:

   my $slot = (tied %hash)->reader($key);
   $slot->get($key);
   my $value = $slot->get();

   $slot->set($value);

The key will have an exclusive lock taken out - no other locks can exist or be taken out until the $slot value passes out of scope or is undefined.

THREAD UNSAFE OPERATIONS

No other operations are currently implemented; sadly, currently including iteration. So the tied hash is still quite deficient.

Also not yet supported is returning of a divisible hash key range for potential use with a new parallel_for or parallel_reduce body type.

UNSUPPORTED OPERATIONS

DELETE
CLEAR

Can't delete a slot (or all slots) at the moment..

EXISTS

Not yet implemented, but you can use the reader method of the tied object.

FIRSTKEY
NEXTKEY

This particularly badly designed API is required for keys to work, however implementation will not be straightforward - of course because of its awful side-effect-by-design nature.

SCALAR
Array with contents

Currently the TIEARRAY method doesn't respect tieing to an array with existing contents.

SEE ALSO ^

threads::tbb::concurrent, threads::tbb

syntax highlighting: