HashChainSearch.c
2.2 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
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
/*
* HashChainSearch.c --
*
* Source code for HashChainSearch, a utility procedure used by
* the hash table library.
*
* Copyright 1988 Regents of the University of California
* Permission to use, copy, modify, and distribute this
* software and its documentation for any purpose and without
* fee is hereby granted, provided that the above copyright
* notice appear in all copies. The University of California
* makes no representations about the suitability of this
* software for any purpose. It is provided "as is" without
* express or implied warranty.
*/
#ifndef lint
static char rcsid[] = "$Header: /root/leakn64/depot/rf/sw/bbplayer/simos/apps/unix/ethersim/common/HashChainSearch.c,v 1.1.1.1 2002/05/29 01:09:09 blythe Exp $ SPRITE (Berkeley)";
#endif not lint
#include "hash.h"
#include "list.h"
#include <string.h>
#ifdef sgi
#include <bstring.h>
#elif sparc
#include <strings.h>
#endif
/*
*---------------------------------------------------------
*
* HashChainSearch --
*
* Search the hash table for the entry in the hash chain.
*
* Results:
* Pointer to entry in hash chain, NULL if none found.
*
* Side Effects:
* None.
*
*---------------------------------------------------------
*/
Hash_Entry *
HashChainSearch(
Hash_Table *tablePtr, /* Hash table to search. */
register Address key, /* A hash key. */
register List_Links *hashList)
{
register Hash_Entry *hashEntryPtr;
register int *hashKeyPtr;
int *keyPtr;
register int numKeys;
numKeys = tablePtr->keyType;
LIST_FORALL(hashList, (List_Links *) hashEntryPtr) {
switch (numKeys) {
case 0:
if (strcmp(hashEntryPtr->key.name, key) == 0) {
return(hashEntryPtr);
}
break;
case 1:
if (hashEntryPtr->key.ptr == key) {
return(hashEntryPtr);
}
break;
case 2:
hashKeyPtr = hashEntryPtr->key.words;
keyPtr = (int *) key;
if (*hashKeyPtr++ == *keyPtr++ && *hashKeyPtr == *keyPtr) {
return(hashEntryPtr);
}
break;
default:
if (!bcmp((char *) hashEntryPtr->key.words,
(char *) key, numKeys * sizeof(int))) {
return(hashEntryPtr);
}
break;
}
}
/*
* The desired entry isn't there
*/
return ((Hash_Entry *) NULL);
}