Peter Wemm 439fea92c2 Use the same API as the example code.
Allow the initial hash value to be passed in, as the examples do.
Incrementally hash in the dvp->v_id (using the official api) rather than
add it.  This seems to help power-of-two predictable filename trees
where the filenames repeat on a power-of-two cycle and the directory trees
have power-of-two components in it.  The simple add then mask was causing
things like 12000+ entry collision chains while most other entries have
between 0 and 3 entries each.  This way seems to improve things.
2001-03-20 02:10:18 +00:00
..
2000-10-09 12:34:51 +00:00
2000-01-16 09:25:10 +00:00
2000-05-01 20:32:07 +00:00
2000-07-18 19:31:52 +00:00
2001-02-15 16:34:11 +00:00
2000-10-31 14:30:29 +00:00
2000-12-01 08:57:47 +00:00
2001-03-11 22:51:05 +00:00
2001-02-11 10:44:09 +00:00
2001-02-08 20:28:57 +00:00
2000-12-18 13:28:12 +00:00
2001-02-11 10:44:09 +00:00
2001-02-11 10:44:09 +00:00
2001-01-21 01:34:14 +00:00
2001-03-07 02:06:08 +00:00
2001-01-09 04:33:49 +00:00
2001-01-28 00:13:01 +00:00
2001-02-17 03:49:24 +00:00
2000-12-01 08:57:47 +00:00
2001-03-04 06:04:50 +00:00
2001-03-09 11:34:29 +00:00