Hash_EnumNext.c
2.08 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
/*
* Hash_EnumNext.c --
*
* Source code for the Hash_EnumNext library procedure.
*
* 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/sun/Hash_EnumNext.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"
/*
*---------------------------------------------------------
*
* Hash_EnumNext --
* This procedure returns successive entries in the hash table.
*
* Results:
* The return value is a pointer to the next HashEntry
* in the table, or NULL when the end of the table is
* reached.
*
* Side Effects:
* The information in hashSearchPtr is modified to advance to the
* next entry.
*
*---------------------------------------------------------
*/
Hash_Entry *
Hash_EnumNext(hashSearchPtr)
register Hash_Search *hashSearchPtr; /* Area used to keep state about
search. */
{
register List_Links *hashList;
register Hash_Entry *hashEntryPtr;
hashEntryPtr = hashSearchPtr->hashEntryPtr;
while (hashEntryPtr == (Hash_Entry *) NULL ||
List_IsAtEnd(hashSearchPtr->hashList,
(List_Links *) hashEntryPtr)) {
if (hashSearchPtr->nextIndex >= hashSearchPtr->tablePtr->size) {
return((Hash_Entry *) NULL);
}
hashList = &(hashSearchPtr->tablePtr->bucketPtr[
hashSearchPtr->nextIndex]);
hashSearchPtr->nextIndex++;
if (!List_IsEmpty(hashList)) {
hashEntryPtr = (Hash_Entry *) List_First(hashList);
hashSearchPtr->hashList = hashList;
break;
}
}
hashSearchPtr->hashEntryPtr =
(Hash_Entry *) List_Next((List_Links *) hashEntryPtr);
return(hashEntryPtr);
}