Uh oh!
There was an error while loading. Please reload this page.
This repository was archived by the owner on Nov 20, 2020. It is now read-only.
- Notifications
You must be signed in to change notification settings - Fork 1
Expand file tree
/
Copy pathhash.c
More file actions
Latest commit
58 lines (42 loc) · 1.95 KB
/
Copy pathhash.c
File metadata and controls
58 lines (42 loc) · 1.95 KB
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
/* hash.c - The gdbm hash function. */
/* This file is part of GDBM, the GNU data base manager, by Philip A. Nelson.
Copyright (C) 1990, 1991, 1993 Free Software Foundation, Inc.
GDBM is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 2, or (at your option)
any later version.
GDBM 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 General Public License for more details.
You should have received a copy of the GNU General Public License
along with GDBM; see the file COPYING. If not, write to
the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA.
You may contact the author by:
e-mail: phil@cs.wwu.edu
us-mail: Philip A. Nelson
Computer Science Department
Western Washington University
Bellingham, WA 98226
*************************************************************************/
/* include system configuration before all else. */
#include"autoconf.h"
#include"gdbmdefs.h"
/* This hash function computes a 31 bit value. The value is used to index
the hash directory using the top n bits. It is also used in a hash bucket
to find the home position of the element by taking the value modulo the
bucket hash table size. */
int
_gdbm_hash (key)
datumkey;
{
unsigned intvalue; /* Used to compute the hash value. */
intindex; /* Used to cycle through random values. */
/* Set the initial value from key. */
value=0x238F13AF*key.dsize;
for (index=0; index<key.dsize; index++)
value= (value+ (key.dptr[index] << (index*5 % 24))) &0x7FFFFFFF;
value= (1103515243*value+12345) &0x7FFFFFFF;
/* Return the value. */
return((int) value);
}