blob: d87f166fa6b24326755c94c6632dc446c70dc863 (
plain) (
blame)
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
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
|
/*++
Copyright (c) 1995 Microsoft Corporation
Module Name:
BList.cxx
Abstract:
Implements out of line methods on blists.
Author:
Mario Goertzel [MarioGo]
Revision History:
MarioGo 95-03-02 Bits 'n pieces
MarioGo 95-09-07 Was blist.inl, change from template to generic class for PPC.
--*/
#include<or.hxx>
ULONG
CBList::Hash(PVOID p)
{
ULONG t = (ULONG)p;
return ( ((t << 9) ^ (t >> 5) ^ (t >> 15)) % _ulmaxData);
}
ORSTATUS
CBList::Insert(PVOID p)
{
if ( _data == 0
|| _ulcElements > (_ulmaxData - (_ulmaxData/8 + 1)))
{
// Table getting full, grow it.
// See Kenuth on linear probe hash performance as the table fills.
ULONG i, ulmaxOldData = _ulmaxData;
PVOID *ppOldData = _data;
_data = new PVOID[_ulmaxData * 2];
if (0 == _data)
{
_data = ppOldData;
return(OR_NOMEM);
}
_ulmaxData *= 2;
_ulcElements = 0;
OrMemorySet(_data, 0, _ulmaxData*4);
if (ppOldData)
{
for(i = 0; i < ulmaxOldData; i++)
{
if (ppOldData[i])
{
ORSTATUS status = Insert(ppOldData[i]);
ASSERT(status == OR_OK);
}
}
delete ppOldData;
}
}
register ULONG i = Hash(p);
while(_data[i])
{
i = (i + 1) % _ulmaxData;
}
_data[i] = p;
_ulcElements++;
return(OR_OK);
}
PVOID
CBList::Remove(PVOID p)
{
register ULONG i, hash;
if (_data)
{
i = hash = Hash(p);
if (_data[i] != p)
{
do
{
i = (i + 1) % _ulmaxData;
}
while(_data[i] != p && i != hash);
}
if (_data[i] == p)
{
_data[i] = 0;
_ulcElements--;
return(p);
}
ASSERT(i == hash);
}
return(0);
}
BOOL
CBList::Member(PVOID p)
{
int i, hash;
if (0 == _data)
return(FALSE);
i = hash = Hash(p);
if (_data[i] == p)
return(TRUE);
do
{
i = (i + 1) % _ulmaxData;
}
while(_data[i] != p && i != hash);
return(_data[i] == p);
}
|
