| /external/chromium_org/third_party/skia/src/core/ |
| SkScaledImageCache.cpp | 20 uint32_t hash = 0; local
28 hash ^= k;
29 hash = (hash << 13) | (hash >> 19);
30 hash *= 5;
31 hash += 0xe6546b64;
34 // hash ^= size;
35 hash ^= hash >> 16
[all...] |
| /external/skia/src/core/ |
| SkScaledImageCache.cpp | 20 uint32_t hash = 0; local
28 hash ^= k;
29 hash = (hash << 13) | (hash >> 19);
30 hash *= 5;
31 hash += 0xe6546b64;
34 // hash ^= size;
35 hash ^= hash >> 16
[all...] |
| /external/antlr/antlr-3.4/runtime/Delphi/Sources/Antlr3.Runtime/ |
| Antlr.Runtime.Tools.pas | 257 function Hash(const Key: TKey): Integer;
631 function TDictionary<TKey,TValue>.Hash(const Key: TKey): Integer;
645 index := GetBucketIndex(Key, Hash(Key));
656 index := GetBucketIndex(Key, Hash(Key));
752 hc := Hash(Key);
772 hc := Hash(Key);
777 // Removing item from linear probe hash table is moderately
779 // which may not even hash to the same location.
840 index := GetBucketIndex(Key, Hash(Key));
871 Result := GetBucketIndex(Key, Hash(Key)) >= 0
[all...] |
| /external/chromium/net/base/ |
| ssl_false_start_blacklist_process.cc | 6 // a static hash table so that it can be efficiently queried by Chrome.
200 fprintf(stderr, "Using %d entry hash table\n", kBuckets);
208 const unsigned h = SSLFalseStartBlacklist::Hash(last_two_labels);
|
| /external/chromium/sdch/open-vcdiff/src/ |
| blockhash.cc | 109 // Overallocate the hash table by making it the same size (in bytes)
111 // the empty entries in the hash table will reduce the
112 // probability of a hash collision to (sizeof(int) / kblockSize),
150 // If the hash value is already available from the rolling hash,
179 // This is the first entry with this hash value
220 // The Hash function extends (kBlockSize - 1) bytes past the index,
229 AddBlock(RollingHash<kBlockSize>::Hash(block_ptr));
281 // when the hash values of the two blocks match, it is very likely that either
|
| /external/chromium_org/chrome/browser/metrics/ |
| metrics_log.cc | 256 MetricsLogBase::Hash(it->birth.thread_name));
258 MetricsLogBase::Hash(it->death_thread_name));
260 MetricsLogBase::Hash(it->birth.location.file_name));
262 MetricsLogBase::Hash(it->birth.location.function_name));
[all...] |
| /external/chromium_org/chromeos/display/ |
| output_util.cc | 11 #include "base/hash.h"
157 0 : base::Hash(product_name);
|
| /external/chromium_org/sdch/open-vcdiff/src/ |
| blockhash.cc | 110 // Overallocate the hash table by making it the same size (in bytes)
112 // the empty entries in the hash table will reduce the
113 // probability of a hash collision to (sizeof(int) / kblockSize),
151 // If the hash value is already available from the rolling hash,
180 // This is the first entry with this hash value
221 // The Hash function extends (kBlockSize - 1) bytes past the index,
230 AddBlock(RollingHash<kBlockSize>::Hash(block_ptr));
282 // when the hash values of the two blocks match, it is very likely that either
|
| /external/chromium_org/third_party/WebKit/Source/wtf/ |
| HashCountedSet.h | 30 template<typename Value, typename HashFunctions = typename DefaultHash<Value>::Hash,
|
| /external/chromium_org/v8/src/ |
| hashmap.h | 48 // initial_capacity is the size of the initial hash map;
56 // HashMap entries are (key, value, hash) triplets.
62 uint32_t hash; // The full hash value for key member in struct:v8::internal::TemplateHashMapImpl::Entry
69 // corresponding key, key hash, and NULL value.
71 Entry* Lookup(void* key, uint32_t hash, bool insert,
77 void* Remove(void* key, uint32_t hash);
79 // Empties the hash map (occupancy() == 0).
108 Entry* Probe(void* key, uint32_t hash);
132 void* key, uint32_t hash, bool insert, AllocationPolicy allocator)
[all...] |
| interface.cc | 49 ZoneHashMap::Entry* p = map->Lookup(name.location(), name->Hash(), false,
74 void* name, uint32_t hash, Interface* interface, Zone* zone, bool* ok) {
96 ZoneHashMap::Entry* p = (*map)->Lookup(name, hash, !IsFrozen(), allocator);
185 this->DoAdd(p->key, p->hash, static_cast<Interface*>(p->value), zone, ok);
|
| log-utils.cc | 203 Append("hash %x)", symbol->Hash());
|
| log.cc | 105 AppendBytes("hash ");
106 AppendHex(symbol->Hash());
223 name_buffer_->AppendBytes("symbol(hash ");
224 name_buffer_->AppendHex(Name::cast(source)->Hash());
823 ApiEvent("api,check-security,symbol(hash %x)\n",
824 Symbol::cast(key)->Hash());
828 ApiEvent("api,check-security,symbol(\"%s\" hash %x)\n",
830 Symbol::cast(key)->Hash());
1034 uint32_t hash = symbol->Hash(); local
[all...] |
| objects.cc | 994 uint32_t hash = ComputeLongHash(double_to_uint64(Number())); local
998 uint32_t hash = Name::cast(this)->Hash(); local
1002 uint32_t hash = Oddball::cast(this)->to_string()->Hash(); local
3686 Object* hash; local
4770 Object* hash = this->hash(); local
7554 uint32_t hash = code_flags; local
9173 int hash = (static_cast<uint32_t>( local
13311 uint32_t hash = source->Hash(); local
13685 uint32_t hash = HashTable<Shape, Key>::HashForObject(key, k); local
14402 uint32_t hash = seed; local
14705 uint32_t hash = 0; local
15333 int hash; local
15394 int hash; local
[all...] |
| /external/libvpx/libvpx/examples/includes/geshi/geshi/ |
| ruby.php | 84 'Hash', 'IO', 'IOError', 'Iconv', 'Iconv::BrokenLibrary',
|
| /external/llvm/lib/CodeGen/AsmPrinter/ |
| DwarfDebug.cpp | 65 GenerateODRHash("generate-odr-hash", cl::Hidden,
66 cl::desc("Add an ODR hash to external type DIEs."),
114 // Configuration values for initial hash set sizes (log2).
[all...] |
| /external/open-vcdiff/src/ |
| blockhash.cc | 110 // Overallocate the hash table by making it the same size (in bytes)
112 // the empty entries in the hash table will reduce the
113 // probability of a hash collision to (sizeof(int) / kblockSize),
151 // If the hash value is already available from the rolling hash,
180 // This is the first entry with this hash value
221 // The Hash function extends (kBlockSize - 1) bytes past the index,
230 AddBlock(RollingHash<kBlockSize>::Hash(block_ptr));
282 // when the hash values of the two blocks match, it is very likely that either
|
| /external/srec/tools/thirdparty/OpenFst/fst/lib/ |
| float-weight.h | 54 ssize_t Hash() const {
|
| /external/v8/src/ |
| hashmap.h | 43 // initial_capacity is the size of the initial hash map;
49 // HashMap entries are (key, value, hash) triplets.
55 uint32_t hash; // the full hash value for key member in struct:v8::internal::TemplateHashMapImpl::Entry
61 // corresponding key, key hash, and NULL value.
63 Entry* Lookup(void* key, uint32_t hash, bool insert);
66 void Remove(void* key, uint32_t hash);
68 // Empties the hash map (occupancy() == 0).
97 Entry* Probe(void* key, uint32_t hash);
120 void* key, uint32_t hash, bool insert)
[all...] |
| interface.cc | 48 ZoneHashMap::Entry* p = map->Lookup(name.location(), name->Hash(), false);
72 void* name, uint32_t hash, Interface* interface, bool* ok) {
90 ZoneHashMap::Entry* p = (*map)->Lookup(name, hash, !IsFrozen());
169 this->DoAdd(p->key, p->hash, static_cast<Interface*>(p->value), ok);
|
| objects.cc | 739 uint32_t hash = ComputeLongHash(double_to_uint64(Number())); local
740 return Smi::FromInt(hash & Smi::kMaxValue);
743 uint32_t hash = String::cast(this)->Hash(); local
744 return Smi::FromInt(hash);
747 uint32_t hash = Oddball::cast(this)->to_string()->Hash(); local
748 return Smi::FromInt(hash);
2842 Object* hash; local
3608 Object* hash = this->hash(); local
5467 uint32_t hash = code_flags; local
5897 uint32_t hash = name->Hash(); local
5928 uint32_t hash = name->Hash(); local
7342 int hash = (static_cast<uint32_t>( local
10536 uint32_t hash = source->Hash(); local
10979 uint32_t hash = HashTable<Shape, Key>::HashForObject(key, k); local
11638 uint32_t hash = seed; local
11919 uint32_t hash = 0; local
12504 int hash; local
12565 int hash; local
[all...] |
| objects.h | [all...] |
| /external/chromium_org/third_party/sqlite/src/src/ |
| sqliteInt.h | 303 #include "hash.h"
689 Hash tblHash; /* All tables indexed by name */
690 Hash idxHash; /* All (named) indices indexed by name */
691 Hash trigHash; /* All triggers indexed by name */
692 Hash fkeyHash; /* All foreign keys by referenced table name */
713 ** read into internal hash tables.
765 ** A hash table for function definitions.
767 ** Hash each FuncDef structure into one of the FuncDefHash.a[] slots.
771 FuncDef *a[23]; /* Hash table for functions */
871 Hash aModule; /* populated by sqlite3_create_module() *
[all...] |
| /external/antlr/antlr-3.4/runtime/Ruby/lib/antlr3/ |
| dfa.rb | 118 values = Hash.new( 0 )
124 unpacked = Hash.new( default )
|
| /external/antlr/antlr-3.4/runtime/Ruby/test/unit/ |
| test-streams.rb | 407 when Hash then fields.update(type)
412 when Hash then fields.update(opts)
|
