tdb 0.1.0

data/LICENSE

@@ -0,0 +1,17 @@
+Ruby tdb is copyrighted Free Software by all contributors, see logs in
+revision control for names and email addresses of all of them.
+
+This library is free software; you can redistribute it and/or modify it
+under the terms of the GNU Lesser General Public License as published by
+the Free Software Foundation; either version
+{3}[http://www.gnu.org/licenses/lgpl-3.0.txt] of the License, or (at
+your option) any later version.
+
+Ruby tdb is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE.  See the GNU Lesser General Public
+License for more details.
+
+You should have received a copy of the GNU Lesser General Public License
+along with Ruby tdb; if not, write to the Free Software
+Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301

data/README

@@ -0,0 +1,57 @@
+= tdb - Trivial Database bindings for Ruby
+
+TDB is much like other DBM implementations, except it allows concurrent
+writer processes.  TDB was initially developed for Samba, but is used by
+other projects as well.  These Ruby bindings allow Ruby apps to read and
+write to the same databases used by Samba!
+
+== Features
+
+* Concurrent reader and writer processes may safely operate on the
+  same file.
+
+* Releases the GVL for slow disk operations under Ruby 1.9
+
+* Includes several {hash functions}[link:Hash_Functions.html]
+  not included by upstream TDB.
+
+== Install
+
+The original tdb library from the {main site}[http://tdb.samba.org/] is
+required.  Debian users can just <code>apt-get install tdb-dev</code>.
+
+The library consists of a C extension so you'll need a C compiler
+and Ruby development libraries/headers.
+
+You may download the tarball from our
+{download site}[http://bogomips.org/ruby-tdb/files/] and run setup.rb after
+unpacking it:
+
+  http://bogomips.org/ruby-tdb/files/
+
+You may also install it via RubyGems on RubyGems.org:
+
+  gem install tdb
+
+You can get the latest source via git from the following locations
+(these versions may not be stable):
+
+  git://git.bogomips.org/ruby-tdb.git
+  git://repo.or.cz/ruby-tdb.git (mirror)
+
+You may browse the code from the web and download the latest snapshot
+tarballs here:
+
+* http://git.bogomips.org/cgit/ruby-tdb.git (cgit)
+* http://repo.or.cz/w/ruby-tdb.git (gitweb)
+
+See the HACKING guide on how to contribute and build prerelease gems
+from git.
+
+== Contact
+
+All feedback (bug reports, user/development dicussion, patches, pull
+requests) go to the {mailing list}[mailto:ruby.tdb@librelist.org].
+
+For the latest on tdb releases, you may check our NEWS page (and
+subscribe to our Atom feed).

data/Rakefile

@@ -0,0 +1,140 @@
+# -*- encoding: binary -*-
+
+# most tasks are in the GNUmakefile which offers better parallelism
+
+def tags
+  timefmt = '%Y-%m-%dT%H:%M:%SZ'
+  @tags ||= `git tag -l`.split(/\n/).map do |tag|
+    if %r{\Av[\d\.]+} =~ tag
+      header, subject, body = `git cat-file tag #{tag}`.split(/\n\n/, 3)
+      header = header.split(/\n/)
+      tagger = header.grep(/\Atagger /).first
+      body ||= "initial"
+      {
+        :time => Time.at(tagger.split(/ /)[-2].to_i).utc.strftime(timefmt),
+        :tagger_name => %r{^tagger ([^<]+)}.match(tagger)[1].strip,
+        :tagger_email => %r{<([^>]+)>}.match(tagger)[1].strip,
+        :id => `git rev-parse refs/tags/#{tag}`.chomp!,
+        :tag => tag,
+        :subject => subject,
+        :body => body,
+      }
+    end
+  end.compact.sort { |a,b| b[:time] <=> a[:time] }
+end
+
+cgit_url = "http://git.bogomips.org/cgit/ruby-tdb.git"
+git_url = ENV['GIT_URL'] || 'git://git.bogomips.org/ruby-tdb.git'
+web_url = "http://bogomips.org/ruby-tdb/"
+
+desc 'prints news as an Atom feed'
+task :news_atom do
+  require 'nokogiri'
+  new_tags = tags[0,10]
+  puts(Nokogiri::XML::Builder.new do
+    feed :xmlns => "http://www.w3.org/2005/Atom" do
+      id! "#{web_url}NEWS.atom.xml"
+      title "Ruby tdb news"
+      subtitle "Trivial Database bindings for Ruby"
+      link! :rel => "alternate", :type => "text/html",
+            :href => "#{web_url}NEWS.html"
+      updated(new_tags.empty? ? "1970-01-01T00:00:00Z" : new_tags.first[:time])
+      new_tags.each do |tag|
+        entry do
+          title tag[:subject]
+          updated tag[:time]
+          published tag[:time]
+          author {
+            name tag[:tagger_name]
+            email tag[:tagger_email]
+          }
+          url = "#{cgit_url}/tag/?id=#{tag[:tag]}"
+          link! :rel => "alternate", :type => "text/html", :href =>url
+          id! url
+          message_only = tag[:body].split(/\n.+\(\d+\):\n {6}/s).first.strip
+          content({:type =>:text}, message_only)
+          content(:type =>:xhtml) { pre tag[:body] }
+        end
+      end
+    end
+  end.to_xml)
+end
+
+desc 'prints RDoc-formatted news'
+task :news_rdoc do
+  tags.each do |tag|
+    time = tag[:time].tr!('T', ' ').gsub!(/:\d\dZ/, ' UTC')
+    puts "=== #{tag[:tag].sub(/^v/, '')} / #{time}"
+    puts ""
+
+    body = tag[:body]
+    puts tag[:body].gsub(/^/sm, "  ").gsub(/[ \t]+$/sm, "")
+    puts ""
+  end
+end
+
+desc "print release changelog for Rubyforge"
+task :release_changes do
+  version = ENV['VERSION'] or abort "VERSION= needed"
+  version = "v#{version}"
+  vtags = tags.map { |tag| tag[:tag] =~ /\Av/ and tag[:tag] }.sort
+  prev = vtags[vtags.index(version) - 1]
+  if prev
+    system('git', 'diff', '--stat', prev, version) or abort $?
+    puts ""
+    system('git', 'log', "#{prev}..#{version}") or abort $?
+  else
+    system('git', 'log', version) or abort $?
+  end
+end
+
+desc "print release notes for Rubyforge"
+task :release_notes do
+  spec = Gem::Specification.load('tdb.gemspec')
+  puts spec.description.strip
+  puts ""
+  puts "* #{spec.homepage}"
+  puts "* #{spec.email}"
+  puts "* #{git_url}"
+
+  _, _, body = `git cat-file tag v#{spec.version}`.split(/\n\n/, 3)
+  print "\nChanges:\n\n"
+  puts body
+end
+
+desc "post to RAA"
+task :raa_update do
+  require 'net/http'
+  require 'net/netrc'
+  rc = Net::Netrc.locate('tdb-raa') or abort "~/.netrc not found"
+  password = rc.password
+
+  s = Gem::Specification.load('tdb.gemspec')
+  desc = [ s.description.strip ]
+  desc << ""
+  desc << "* #{s.email}"
+  desc << "* #{git_url}"
+  desc << "* #{cgit_url}"
+  desc = desc.join("\n")
+  uri = URI.parse('http://raa.ruby-lang.org/regist.rhtml')
+  form = {
+    :name => s.name,
+    :short_description => s.summary,
+    :version => s.version.to_s,
+    :status => 'experimental',
+    :owner => s.authors.first,
+    :email => s.email,
+    :category_major => 'Library',
+    :category_minor => 'Database',
+    :url => s.homepage,
+    :download => 'http://bogomips.org/ruby-tdb/files/',
+    :license => "LGPL",
+    :description_style => 'Plain',
+    :description => desc,
+    :pass => password,
+    :submit => 'Update',
+  }
+  res = Net::HTTP.post_form(uri, form)
+  p res
+  puts res.body
+end

data/TODO

@@ -0,0 +1,7 @@
+* port the final Murmur3 hash implementation
+
+* support more TDB-specific features
+
+* make it reasonably API-compatible with other DBM bindings
+
+* RDoc documentation

data/ext/tdb/djb.c

@@ -0,0 +1,26 @@
+#include "rbtdb.h"
+
+unsigned int rbtdb_djb2(TDB_DATA *data)
+{
+	unsigned char *key = data->dptr;
+	size_t len = data->dsize;
+	unsigned int hash = 5381;
+	unsigned int i;
+
+	for (i = 0; i < len; ++i)
+		hash = ((hash << 5) + hash) + key[i]; /* (hash*33) + key[i] */
+
+	return hash;
+}
+unsigned int rbtdb_djb3(TDB_DATA *data)
+{
+	unsigned char *key = data->dptr;
+	size_t len = data->dsize;
+	unsigned int hash = 5381;
+	unsigned int i;
+
+	for (i = 0; i < len; ++i)
+		hash = ((hash << 5) + hash) ^ key[i]; /* (hash*33) ^ key[i] */
+
+	return hash;
+}

data/ext/tdb/extconf.rb

@@ -0,0 +1,12 @@
+require 'mkmf'
+
+have_func('rb_thread_blocking_region')
+have_func('rb_thread_call_with_gvl')
+
+dir_config('tdb')
+have_header('tdb.h') or abort 'tdb.h missing'
+have_library('tdb') or abort 'libtdb missing'
+have_func('tdb_jenkins_hash')
+have_const('TDB_ERR_NESTING', 'tdb.h')
+
+create_makefile('tdb_ext')

data/ext/tdb/fnv.c

@@ -0,0 +1,28 @@
+#include "rbtdb.h"
+
+#define FNV1A_32A_INIT (unsigned int)0x811c9dc5
+#define FNV_32_PRIME (unsigned int)0x01000193
+
+unsigned int rbtdb_fnv1a(TDB_DATA * data)
+{
+	unsigned char *bp = data->dptr;
+	unsigned char *be = bp + data->dsize;
+	unsigned int h = FNV1A_32A_INIT;
+
+	/* FNV-1a hash each octet in the buffer */
+	while (bp < be) {
+
+		/* xor the bottom with the current octet */
+		h ^= (unsigned)*bp++;
+
+		/* multiply by the 32 bit FNV magic prime mod 2^32 */
+#if defined(NO_FNV_GCC_OPTIMIZATION)
+		h *= FNV_32_PRIME;
+#else
+		h += (h << 1) + (h << 4) + (h << 7) + (h << 8) + (h << 24);
+#endif
+	}
+
+	/* return our new hash value */
+	return h;
+}

data/ext/tdb/lookup3.c

@@ -0,0 +1,429 @@
+#include "rbtdb.h"
+
+/*
+ * lookup3 implementation copied from tdb.git
+ * (commit 3258cf3f11bf7c68a2e69e1808c4551cc899725a),
+ * as that tdb distribution isn't commonly available yet (as of 2010.11.29)
+ */
+#ifndef HAVE_TDB_JENKINS_HASH
+
+#ifndef WORDS_BIGENDIAN
+# define HASH_LITTLE_ENDIAN 1
+# define HASH_BIG_ENDIAN 0
+#else
+# define HASH_LITTLE_ENDIAN 0
+# define HASH_BIG_ENDIAN 1
+#endif
+
+/*
+-------------------------------------------------------------------------------
+lookup3.c, by Bob Jenkins, May 2006, Public Domain.
+
+These are functions for producing 32-bit hashes for hash table lookup.
+hash_word(), hashlittle(), hashlittle2(), hashbig(), mix(), and final()
+are externally useful functions.  Routines to test the hash are included
+if SELF_TEST is defined.  You can use this free for any purpose.  It's in
+the public domain.  It has no warranty.
+
+You probably want to use hashlittle().  hashlittle() and hashbig()
+hash byte arrays.  hashlittle() is is faster than hashbig() on
+little-endian machines.  Intel and AMD are little-endian machines.
+On second thought, you probably want hashlittle2(), which is identical to
+hashlittle() except it returns two 32-bit hashes for the price of one.
+You could implement hashbig2() if you wanted but I haven't bothered here.
+
+If you want to find a hash of, say, exactly 7 integers, do
+  a = i1;  b = i2;  c = i3;
+  mix(a,b,c);
+  a += i4; b += i5; c += i6;
+  mix(a,b,c);
+  a += i7;
+  final(a,b,c);
+then use c as the hash value.  If you have a variable length array of
+4-byte integers to hash, use hash_word().  If you have a byte array (like
+a character string), use hashlittle().  If you have several byte arrays, or
+a mix of things, see the comments above hashlittle().
+
+Why is this so big?  I read 12 bytes at a time into 3 4-byte integers,
+then mix those integers.  This is fast (you can do a lot more thorough
+mixing with 12*3 instructions on 3 integers than you can with 3 instructions
+on 1 byte), but shoehorning those bytes into integers efficiently is messy.
+*/
+
+#define hashsize(n) ((uint32_t)1<<(n))
+#define hashmask(n) (hashsize(n)-1)
+#define rot(x,k) (((x)<<(k)) | ((x)>>(32-(k))))
+
+/*
+-------------------------------------------------------------------------------
+mix -- mix 3 32-bit values reversibly.
+
+This is reversible, so any information in (a,b,c) before mix() is
+still in (a,b,c) after mix().
+
+If four pairs of (a,b,c) inputs are run through mix(), or through
+mix() in reverse, there are at least 32 bits of the output that
+are sometimes the same for one pair and different for another pair.
+This was tested for:
+* pairs that differed by one bit, by two bits, in any combination
+  of top bits of (a,b,c), or in any combination of bottom bits of
+  (a,b,c).
+* "differ" is defined as +, -, ^, or ~^.  For + and -, I transformed
+  the output delta to a Gray code (a^(a>>1)) so a string of 1's (as
+  is commonly produced by subtraction) look like a single 1-bit
+  difference.
+* the base values were pseudorandom, all zero but one bit set, or
+  all zero plus a counter that starts at zero.
+
+Some k values for my "a-=c; a^=rot(c,k); c+=b;" arrangement that
+satisfy this are
+    4  6  8 16 19  4
+    9 15  3 18 27 15
+   14  9  3  7 17  3
+Well, "9 15 3 18 27 15" didn't quite get 32 bits diffing
+for "differ" defined as + with a one-bit base and a two-bit delta.  I
+used http://burtleburtle.net/bob/hash/avalanche.html to choose
+the operations, constants, and arrangements of the variables.
+
+This does not achieve avalanche.  There are input bits of (a,b,c)
+that fail to affect some output bits of (a,b,c), especially of a.  The
+most thoroughly mixed value is c, but it doesn't really even achieve
+avalanche in c.
+
+This allows some parallelism.  Read-after-writes are good at doubling
+the number of bits affected, so the goal of mixing pulls in the opposite
+direction as the goal of parallelism.  I did what I could.  Rotates
+seem to cost as much as shifts on every machine I could lay my hands
+on, and rotates are much kinder to the top and bottom bits, so I used
+rotates.
+-------------------------------------------------------------------------------
+*/
+#define mix(a,b,c) \
+{ \
+  a -= c;  a ^= rot(c, 4);  c += b; \
+  b -= a;  b ^= rot(a, 6);  a += c; \
+  c -= b;  c ^= rot(b, 8);  b += a; \
+  a -= c;  a ^= rot(c,16);  c += b; \
+  b -= a;  b ^= rot(a,19);  a += c; \
+  c -= b;  c ^= rot(b, 4);  b += a; \
+}
+
+/*
+-------------------------------------------------------------------------------
+final -- final mixing of 3 32-bit values (a,b,c) into c
+
+Pairs of (a,b,c) values differing in only a few bits will usually
+produce values of c that look totally different.  This was tested for
+* pairs that differed by one bit, by two bits, in any combination
+  of top bits of (a,b,c), or in any combination of bottom bits of
+  (a,b,c).
+* "differ" is defined as +, -, ^, or ~^.  For + and -, I transformed
+  the output delta to a Gray code (a^(a>>1)) so a string of 1's (as
+  is commonly produced by subtraction) look like a single 1-bit
+  difference.
+* the base values were pseudorandom, all zero but one bit set, or
+  all zero plus a counter that starts at zero.
+
+These constants passed:
+ 14 11 25 16 4 14 24
+ 12 14 25 16 4 14 24
+and these came close:
+  4  8 15 26 3 22 24
+ 10  8 15 26 3 22 24
+ 11  8 15 26 3 22 24
+-------------------------------------------------------------------------------
+*/
+#define final(a,b,c) \
+{ \
+  c ^= b; c -= rot(b,14); \
+  a ^= c; a -= rot(c,11); \
+  b ^= a; b -= rot(a,25); \
+  c ^= b; c -= rot(b,16); \
+  a ^= c; a -= rot(c,4);  \
+  b ^= a; b -= rot(a,14); \
+  c ^= b; c -= rot(b,24); \
+}
+
+/*
+-------------------------------------------------------------------------------
+hashlittle() -- hash a variable-length key into a 32-bit value
+  k       : the key (the unaligned variable-length array of bytes)
+  length  : the length of the key, counting by bytes
+  val2    : IN: can be any 4-byte value OUT: second 32 bit hash.
+Returns a 32-bit value.  Every bit of the key affects every bit of
+the return value.  Two keys differing by one or two bits will have
+totally different hash values.  Note that the return value is better
+mixed than val2, so use that first.
+
+The best hash table sizes are powers of 2.  There is no need to do
+mod a prime (mod is sooo slow!).  If you need less than 32 bits,
+use a bitmask.  For example, if you need only 10 bits, do
+  h = (h & hashmask(10));
+In which case, the hash table should have hashsize(10) elements.
+
+If you are hashing n strings (uint8_t **)k, do it like this:
+  for (i=0, h=0; i<n; ++i) h = hashlittle( k[i], len[i], h);
+
+By Bob Jenkins, 2006.  bob_jenkins@burtleburtle.net.  You may use this
+code any way you wish, private, educational, or commercial.  It's free.
+
+Use for hash table lookup, or anything where one collision in 2^^32 is
+acceptable.  Do NOT use for cryptographic purposes.
+-------------------------------------------------------------------------------
+*/
+
+static uint32_t hashlittle(const void *key, size_t length)
+{
+	uint32_t a, b, c;	/* internal state */
+	union {
+		const void *ptr;
+		size_t i;
+	} u;			/* needed for Mac Powerbook G4 */
+
+	/* Set up the internal state */
+	a = b = c = 0xdeadbeef + ((uint32_t) length);
+
+	u.ptr = key;
+	if (HASH_LITTLE_ENDIAN && ((u.i & 0x3) == 0)) {
+		const uint32_t *k = (const uint32_t *)key;	/* read 32-bit chunks */
+#ifdef VALGRIND
+		const uint8_t *k8;
+#endif
+
+    /*------ all but last block: aligned reads and affect 32 bits of (a,b,c) */
+		while (length > 12) {
+			a += k[0];
+			b += k[1];
+			c += k[2];
+			mix(a, b, c);
+			length -= 12;
+			k += 3;
+		}
+
+    /*----------------------------- handle the last (probably partial) block */
+		/*
+		 * "k[2]&0xffffff" actually reads beyond the end of the string, but
+		 * then masks off the part it's not allowed to read.  Because the
+		 * string is aligned, the masked-off tail is in the same word as the
+		 * rest of the string.  Every machine with memory protection I've seen
+		 * does it on word boundaries, so is OK with this.  But VALGRIND will
+		 * still catch it and complain.  The masking trick does make the hash
+		 * noticably faster for short strings (like English words).
+		 */
+#ifndef VALGRIND
+
+		switch (length) {
+		case 12:
+			c += k[2];
+			b += k[1];
+			a += k[0];
+			break;
+		case 11:
+			c += k[2] & 0xffffff;
+			b += k[1];
+			a += k[0];
+			break;
+		case 10:
+			c += k[2] & 0xffff;
+			b += k[1];
+			a += k[0];
+			break;
+		case 9:
+			c += k[2] & 0xff;
+			b += k[1];
+			a += k[0];
+			break;
+		case 8:
+			b += k[1];
+			a += k[0];
+			break;
+		case 7:
+			b += k[1] & 0xffffff;
+			a += k[0];
+			break;
+		case 6:
+			b += k[1] & 0xffff;
+			a += k[0];
+			break;
+		case 5:
+			b += k[1] & 0xff;
+			a += k[0];
+			break;
+		case 4:
+			a += k[0];
+			break;
+		case 3:
+			a += k[0] & 0xffffff;
+			break;
+		case 2:
+			a += k[0] & 0xffff;
+			break;
+		case 1:
+			a += k[0] & 0xff;
+			break;
+		case 0:
+			return c;	/* zero length strings require no mixing */
+		}
+
+#else				/* make valgrind happy */
+
+		k8 = (const uint8_t *)k;
+		switch (length) {
+		case 12:
+			c += k[2];
+			b += k[1];
+			a += k[0];
+			break;
+		case 11:
+			c += ((uint32_t) k8[10]) << 16;	/* fall through */
+		case 10:
+			c += ((uint32_t) k8[9]) << 8;	/* fall through */
+		case 9:
+			c += k8[8];	/* fall through */
+		case 8:
+			b += k[1];
+			a += k[0];
+			break;
+		case 7:
+			b += ((uint32_t) k8[6]) << 16;	/* fall through */
+		case 6:
+			b += ((uint32_t) k8[5]) << 8;	/* fall through */
+		case 5:
+			b += k8[4];	/* fall through */
+		case 4:
+			a += k[0];
+			break;
+		case 3:
+			a += ((uint32_t) k8[2]) << 16;	/* fall through */
+		case 2:
+			a += ((uint32_t) k8[1]) << 8;	/* fall through */
+		case 1:
+			a += k8[0];
+			break;
+		case 0:
+			return c;
+		}
+
+#endif				/* !valgrind */
+
+	} else if (HASH_LITTLE_ENDIAN && ((u.i & 0x1) == 0)) {
+		const uint16_t *k = (const uint16_t *)key;	/* read 16-bit chunks */
+		const uint8_t *k8;
+
+    /*--------------- all but last block: aligned reads and different mixing */
+		while (length > 12) {
+			a += k[0] + (((uint32_t) k[1]) << 16);
+			b += k[2] + (((uint32_t) k[3]) << 16);
+			c += k[4] + (((uint32_t) k[5]) << 16);
+			mix(a, b, c);
+			length -= 12;
+			k += 6;
+		}
+
+    /*----------------------------- handle the last (probably partial) block */
+		k8 = (const uint8_t *)k;
+		switch (length) {
+		case 12:
+			c += k[4] + (((uint32_t) k[5]) << 16);
+			b += k[2] + (((uint32_t) k[3]) << 16);
+			a += k[0] + (((uint32_t) k[1]) << 16);
+			break;
+		case 11:
+			c += ((uint32_t) k8[10]) << 16;	/* fall through */
+		case 10:
+			c += k[4];
+			b += k[2] + (((uint32_t) k[3]) << 16);
+			a += k[0] + (((uint32_t) k[1]) << 16);
+			break;
+		case 9:
+			c += k8[8];	/* fall through */
+		case 8:
+			b += k[2] + (((uint32_t) k[3]) << 16);
+			a += k[0] + (((uint32_t) k[1]) << 16);
+			break;
+		case 7:
+			b += ((uint32_t) k8[6]) << 16;	/* fall through */
+		case 6:
+			b += k[2];
+			a += k[0] + (((uint32_t) k[1]) << 16);
+			break;
+		case 5:
+			b += k8[4];	/* fall through */
+		case 4:
+			a += k[0] + (((uint32_t) k[1]) << 16);
+			break;
+		case 3:
+			a += ((uint32_t) k8[2]) << 16;	/* fall through */
+		case 2:
+			a += k[0];
+			break;
+		case 1:
+			a += k8[0];
+			break;
+		case 0:
+			return c;	/* zero length requires no mixing */
+		}
+
+	} else {		/* need to read the key one byte at a time */
+		const uint8_t *k = (const uint8_t *)key;
+
+    /*--------------- all but the last block: affect some 32 bits of (a,b,c) */
+		while (length > 12) {
+			a += k[0];
+			a += ((uint32_t) k[1]) << 8;
+			a += ((uint32_t) k[2]) << 16;
+			a += ((uint32_t) k[3]) << 24;
+			b += k[4];
+			b += ((uint32_t) k[5]) << 8;
+			b += ((uint32_t) k[6]) << 16;
+			b += ((uint32_t) k[7]) << 24;
+			c += k[8];
+			c += ((uint32_t) k[9]) << 8;
+			c += ((uint32_t) k[10]) << 16;
+			c += ((uint32_t) k[11]) << 24;
+			mix(a, b, c);
+			length -= 12;
+			k += 12;
+		}
+
+    /*-------------------------------- last block: affect all 32 bits of (c) */
+		switch (length) {	/* all the case statements fall through */
+		case 12:
+			c += ((uint32_t) k[11]) << 24;
+		case 11:
+			c += ((uint32_t) k[10]) << 16;
+		case 10:
+			c += ((uint32_t) k[9]) << 8;
+		case 9:
+			c += k[8];
+		case 8:
+			b += ((uint32_t) k[7]) << 24;
+		case 7:
+			b += ((uint32_t) k[6]) << 16;
+		case 6:
+			b += ((uint32_t) k[5]) << 8;
+		case 5:
+			b += k[4];
+		case 4:
+			a += ((uint32_t) k[3]) << 24;
+		case 3:
+			a += ((uint32_t) k[2]) << 16;
+		case 2:
+			a += ((uint32_t) k[1]) << 8;
+		case 1:
+			a += k[0];
+			break;
+		case 0:
+			return c;
+		}
+	}
+
+	final(a, b, c);
+	return c;
+}
+
+unsigned int rbtdb_jenkins_lookup3(TDB_DATA * key)
+{
+	return hashlittle(key->dptr, key->dsize);
+}
+#endif /* !HAVE_TDB_JENKINS_HASH */