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) 2010 Apple Inc. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY APPLE INC. AND ITS CONTRIBUTORS ``AS IS''
* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO,
* THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
* PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL APPLE INC. OR ITS CONTRIBUTORS
* BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
* CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
* SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
* INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
* CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
* ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF
* THE POSSIBILITY OF SUCH DAMAGE.
*/
#include "VisitedLinkTable.h"
#include "SharedMemory.h"
using namespace WebCore;
namespace WebKit {
VisitedLinkTable::VisitedLinkTable()
: m_tableSize(0)
, m_table(0)
{
}
VisitedLinkTable::~VisitedLinkTable()
{
}
static inline bool isPowerOf2(unsigned v)
{
// Taken from http://www.cs.utk.edu/~vose/c-stuff/bithacks.html
return !(v & (v - 1)) && v;
}
void VisitedLinkTable::setSharedMemory(PassRefPtr<SharedMemory> sharedMemory)
{
m_sharedMemory = sharedMemory;
ASSERT(m_sharedMemory);
ASSERT(!(m_sharedMemory->size() % sizeof(LinkHash)));
m_table = static_cast<LinkHash*>(m_sharedMemory->data());
m_tableSize = m_sharedMemory->size() / sizeof(LinkHash);
ASSERT(isPowerOf2(m_tableSize));
m_tableSizeMask = m_tableSize - 1;
}
static inline unsigned doubleHash(unsigned key)
{
key = ~key + (key >> 23);
key ^= (key << 12);
key ^= (key >> 7);
key ^= (key << 2);
key ^= (key >> 20);
return key;
}
bool VisitedLinkTable::addLinkHash(LinkHash linkHash)
{
ASSERT(m_sharedMemory);
int k = 0;
LinkHash* table = m_table;
int sizeMask = m_tableSizeMask;
unsigned h = static_cast<unsigned>(linkHash);
int i = h & sizeMask;
LinkHash* entry;
while (1) {
entry = table + i;
// Check if this bucket is empty.
if (!*entry)
break;
// Check if the same link hash is in the table already.
if (*entry == linkHash)
return false;
if (!k)
k = 1 | doubleHash(h);
i = (i + k) & sizeMask;
}
*entry = linkHash;
return true;
}
bool VisitedLinkTable::isLinkVisited(LinkHash linkHash) const
{
if (!m_sharedMemory)
return false;
int k = 0;
LinkHash* table = m_table;
int sizeMask = m_tableSizeMask;
unsigned h = static_cast<unsigned>(linkHash);
int i = h & sizeMask;
LinkHash* entry;
while (1) {
entry = table + i;
// Check if we've reached the end of the table.
if (!*entry)
break;
if (*entry == linkHash)
return true;
if (!k)
k = 1 | doubleHash(h);
i = (i + k) & sizeMask;
}
return false;
}
} // namespace WebKit
|
