OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
refs:existingHash
(Results
1 - 10
of
10
) sorted by null
/external/webkit/WebCore/platform/text/
AtomicStringHash.h
40
return key.impl()->
existingHash
();
AtomicString.cpp
255
HashAndCharacters buffer = { string->
existingHash
(), string->data(), length };
289
HashAndCharacters buffer = { string->
existingHash
(), string->data(), length };
StringImpl.h
108
unsigned
existingHash
() const { ASSERT(m_hash); return m_hash; }
/external/webkit/JavaScriptCore/runtime/
Lookup.cpp
37
int hashIndex = identifier->
existingHash
() & compactHashSizeMask;
Structure.cpp
301
unsigned i = rep->
existingHash
();
319
unsigned k = 1 | doubleHash(rep->
existingHash
());
654
unsigned i = rep->
existingHash
();
675
unsigned k = 1 | doubleHash(rep->
existingHash
());
707
unsigned i = rep->
existingHash
();
727
unsigned k = 1 | doubleHash(rep->
existingHash
());
776
unsigned i = rep->
existingHash
();
799
k = 1 | doubleHash(rep->
existingHash
());
875
unsigned i = rep->
existingHash
();
889
k = 1 | doubleHash(rep->
existingHash
());
[
all
...]
StructureTransitionTable.h
45
return p.first->
existingHash
();
Structure.h
240
unsigned i = rep->
existingHash
();
257
unsigned k = 1 | WTF::doubleHash(rep->
existingHash
());
UStringImpl.h
158
unsigned
existingHash
() const { ASSERT(m_hash); return m_hash; } // fast path for Identifiers
Lookup.h
147
const HashEntry* entry = &table[identifier.ustring().rep()->
existingHash
() & compactHashSizeMask];
UString.h
254
static unsigned hash(const RefPtr<JSC::UString::Rep>& key) { return key->
existingHash
(); }
255
static unsigned hash(JSC::UString::Rep* key) { return key->
existingHash
(); }
Completed in 529 milliseconds