blob: 6fad3b6f10498608ace0bc6c52920be61a04ac7c (
plain)
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
|
/***********************************************************************
* *
* This software is part of the ast package *
* Copyright (c) 1985-2009 AT&T Intellectual Property *
* and is licensed under the *
* Common Public License, Version 1.0 *
* by AT&T Intellectual Property *
* *
* A copy of the License is available at *
* http://www.opensource.org/licenses/cpl1.0.txt *
* (with md5 checksum 059e8cd6165cb4c31e351f2b69388fd9) *
* *
* Information and Software Systems Research *
* AT&T Research *
* Florham Park NJ *
* *
* Glenn Fowler <gsf@research.att.com> *
* David Korn <dgk@research.att.com> *
* Phong Vo <kpv@research.att.com> *
* *
***********************************************************************/
#pragma prototyped
/*
* Glenn Fowler
* AT&T Bell Laboratories
*
* hash table library
*/
#include "hashlib.h"
/*
* return a running 32 bit checksum of buffer b of length n
*
* c is the return value from a previous
* memsum() or strsum() call, 0 on the first call
*
* the result is the same on all implementations
*/
unsigned long
memsum(const void* ap, int n, register unsigned long c)
{
register const unsigned char* p = (const unsigned char*)ap;
register const unsigned char* e = p + n;
while (p < e) HASHPART(c, *p++);
#if LONG_MAX > 2147483647
return(c & 0xffffffff);
#else
return(c);
#endif
}
|
