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
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
|
/*
* This file is part of the KDE libraries
* Copyright (C) 2003 Apple Computer, Inc
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Library General Public
* License as published by the Free Software Foundation; either
* version 2 of the License, or (at your option) any later version.
*
* This library is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
* Library General Public License for more details.
*
* You should have received a copy of the GNU Library General Public License
* along with this library; see the file COPYING.LIB. If not, write to
* the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,
* Boston, MA 02110-1301, USA.
*
*/
#include "identifier.h"
#include <config-kjs.h>
#include <wtf/FastMalloc.h>
#include <wtf/HashSet.h>
#include <string.h> // for strlen
#include <new> // for placement new
namespace KJS {
typedef HashSet<UString::Rep *> IdentifierTable;
static IdentifierTable *table;
static inline IdentifierTable& identifierTable()
{
if (!table)
table = new IdentifierTable;
return *table;
}
bool Identifier::equal(const UString::Rep *r, const char *s)
{
int length = r->len;
const UChar *d = r->data();
for (int i = 0; i != length; ++i)
if (d[i].uc != (unsigned char)s[i])
return false;
return s[length] == 0;
}
bool Identifier::equal(const UString::Rep *r, const UChar *s, int length)
{
if (r->len != length)
return false;
const UChar *d = r->data();
for (int i = 0; i != length; ++i)
if (d[i].uc != s[i].uc)
return false;
return true;
}
struct CStringTranslator
{
static unsigned hash(const char *c)
{
return UString::Rep::computeHash(c);
}
static bool equal(UString::Rep *r, const char *s)
{
return Identifier::equal(r, s);
}
static void translate(UString::Rep*& location, const char *c, unsigned hash)
{
size_t length = strlen(c);
UChar *d = static_cast<UChar *>(fastMalloc(sizeof(UChar) * length));
for (size_t i = 0; i != length; i++)
d[i] = c[i];
UString::Rep *r = UString::Rep::create(d, static_cast<int>(length)).releaseRef();
r->isIdentifier = 1;
r->rc = 0;
r->_hash = hash;
location = r;
}
};
PassRefPtr<UString::Rep> Identifier::add(const char *c)
{
if (!c) {
UString::Rep::null.hash();
return &UString::Rep::null;
}
if (!c[0]) {
UString::Rep::empty.hash();
return &UString::Rep::empty;
}
return *identifierTable().add<const char *, CStringTranslator>(c).first;
}
struct UCharBuffer {
const UChar *s;
unsigned int length;
};
struct UCharBufferTranslator
{
static unsigned hash(const UCharBuffer& buf)
{
return UString::Rep::computeHash(buf.s, buf.length);
}
static bool equal(UString::Rep *str, const UCharBuffer& buf)
{
return Identifier::equal(str, buf.s, buf.length);
}
static void translate(UString::Rep *& location, const UCharBuffer& buf, unsigned hash)
{
UChar *d = static_cast<UChar *>(fastMalloc(sizeof(UChar) * buf.length));
for (unsigned i = 0; i != buf.length; i++)
d[i] = buf.s[i];
UString::Rep *r = UString::Rep::create(d, buf.length).releaseRef();
r->isIdentifier = 1;
r->rc = 0;
r->_hash = hash;
location = r;
}
};
PassRefPtr<UString::Rep> Identifier::add(const UChar *s, int length)
{
if (!length) {
UString::Rep::empty.hash();
return &UString::Rep::empty;
}
UCharBuffer buf = {s, static_cast<unsigned int>(length)};
return *identifierTable().add<UCharBuffer, UCharBufferTranslator>(buf).first;
}
PassRefPtr<UString::Rep> Identifier::addSlowCase(UString::Rep *r)
{
assert(!r->isIdentifier);
if (r->len == 0) {
UString::Rep::empty.hash();
return &UString::Rep::empty;
}
UString::Rep *result = *identifierTable().add(r).first;
if (result == r)
r->isIdentifier = true;
return result;
}
void Identifier::remove(UString::Rep *r)
{
identifierTable().remove(r);
}
} // namespace KJS
|
