| /external/llvm/lib/Transforms/ObjCARC/ |
| ObjCARCOpts.cpp | 879 MDString *Hash = 0;
888 // We do not have any node. Generate and attatch the hash MDString to the
900 Hash = MDString::get(Inst->getContext(), os.str());
901 Inst->setMetadata(NodeId, MDNode::get(Inst->getContext(),Hash));
903 // We have a node. Grab its hash and return it.
906 Hash = cast<MDString>(Node->getOperand(0));
913 Hash = MDString::get(Arg->getContext(), os.str());
916 return Hash;
[all...] |
| /external/chromium_org/third_party/sqlite/src/ext/fts1/ |
| fulltext.c | [all...] |
| /external/antlr/antlr-3.4/runtime/Ruby/lib/antlr3/debug/ |
| socket.rb | 265 ESCAPE_MAP = Hash.new { |h, k| k }
|
| /external/chromium_org/chrome/browser/spellchecker/ |
| feedback_sender.cc | 9 // in |FeedbackSender| to assign hash identifiers for each
12 // the same hash identifiers to avoid duplication. It detects the duplicates by
36 #include "base/hash.h"
64 // Returns a hash of |session_start|, the current timestamp, and
67 return base::Hash(
87 result.hash);
193 void FeedbackSender::SelectedSuggestion(uint32 hash, int suggestion_index) {
194 Misspelling* misspelling = feedback_.GetMisspelling(hash);
204 void FeedbackSender::AddedToDictionary(uint32 hash) {
205 Misspelling* misspelling = feedback_.GetMisspelling(hash);
[all...] |
| /external/chromium_org/third_party/WebKit/Source/wtf/text/ |
| AtomicString.h | 87 // Hash table deleted values, which are only constructed and never copied or destroyed.
245 // AtomicStringHash is the default hash for AtomicString
248 typedef AtomicStringHash Hash;
|
| StringImpl.h | 128 // Ensure that the hash is computed so that AtomicStringHash can call existingHash()
132 hash();
160 StringImpl(unsigned length, unsigned hash, StaticStringTag)
163 , m_hash(hash)
172 static StringImpl* createStatic(const char* string, unsigned length, unsigned hash);
221 // The high bits of 'hash' are always empty, but we prefer to store our flags
223 // So, we shift left and right when setting and getting our hash code.
224 void setHash(unsigned hash) const
227 // Multiple clients assume that StringHasher is the canonical string hash function.
228 ASSERT(hash == (is8Bit() ? StringHasher::computeHashAndMaskTop8Bits(characters8(), m_length) : StringHasher::c (…)
250 unsigned hash() const function in class:WTF::StringImpl
[all...] |
| /external/chromium_org/v8/src/ |
| preparser.h | 88 // Creates a hash from a sequence of bytes.
89 static uint32_t Hash(i::Vector<const byte> key, bool is_ascii);
|
| heap.h | [all...] |
| /external/llvm/tools/llvm-mc/ |
| llvm-mc.cpp | 290 case AsmToken::Hash: Out->os() << "Hash"; break;
|
| /external/openfst/src/include/fst/ |
| bi-table.h | 57 // An implementation using a hash map for the entry to ID mapping.
58 // H is the hash function and E is the equality function.
116 // Enables alternative hash set representations below.
120 // Default hash set is STL hash_set
130 // An implementation using a hash set for the entry to ID mapping.
131 // The hash set holds 'keys' which are either the ID or kCurrentKey.
133 // entry vector or, if kCurrentKey, in current_entry_ member. The hash
135 // is the hash function and E is the equality function. If passed to
324 // An implementation using a vector and a compact hash table. The
328 // suitable for indexing in a vector). The hash functor H is use
[all...] |
| /external/srec/tools/thirdparty/OpenFst/fst/lib/ |
| encode.h | 69 // Hash function for EncodeTabe Tuples. Based on the encode flags
70 // we either hash the labels, weights or compbination of them.
86 size_t hash = x->ilabel << lshift; local
87 if (encode_flags_ & kEncodeLabels) hash ^= x->olabel >> rshift;
88 if (encode_flags_ & kEncodeWeights) hash ^= x->weight.Hash();
89 return hash;
192 // The Encode mapper stores the encoding in a local hash table (EncodeTable)
|
| factor-weight.h | 303 // Hash function for Elements to Fst states.
307 return static_cast<size_t>(x.state * kPrime + x.weight.Hash());
|
| /external/v8/src/ |
| preparser.h | 88 // Creates a hash from a sequence of bytes.
89 static uint32_t Hash(i::Vector<const byte> key, bool is_ascii);
|
| profile-generator.cc | 113 uint32_t hash = local
115 return AddOrDisposeString(dst.start(), hash);
128 const char* StringsStorage::AddOrDisposeString(char* str, uint32_t hash) {
129 HashMap::Entry* cache_entry = names_.Lookup(str, hash, true);
147 uint32_t hash = HashSequentialString( local
149 return AddOrDisposeString(str.start(), hash);
158 uint32_t hash = local
160 return AddOrDisposeString(data.Detach(), hash);
184 uint32_t hash = ComputeIntegerHash(tag_, v8::internal::kZeroHashSeed); local
186 hash ^= ComputeIntegerHash(static_cast<uint32_t>(shared_id_)
2849 uint32_t hash = HashSequentialString(label_copy, local
[all...] |
| scopes.cc | 45 // Note: We are storing the handle locations as key values in the hash map.
72 Entry* p = ZoneHashMap::Lookup(name.location(), name->Hash(), true);
89 Entry* p = ZoneHashMap::Lookup(name.location(), name->Hash(), false);
[all...] |
| objects-inl.h | [all...] |
| /external/chromium_org/third_party/WebKit/PerformanceTests/SunSpider/tests/parse-only/ |
| concat-jquery-mootools-prototype.js | [all...] |
| prototype-1.6.0.3.js | 183 return object instanceof Hash;
423 return match[1].split(separator || '&').inject({ }, function(hash, pair) {
429 if (key in hash) {
430 if (!Object.isArray(hash[key])) hash[key] = [hash[key]];
431 hash[key].push(value);
433 else hash[key] = value;
435 return hash;
994 return new Hash(object)
[all...] |
| /external/antlr/antlr-3.4/runtime/Ruby/lib/antlr3/ |
| recognizers.rb | 73 set to a hash mapping previously parsed rules to cached indices
862 @state.rule_memory[ rule ] = Hash.new( MEMO_RULE_UNKNOWN )
996 if argv.is_a?( ::Hash ) then argv, options = ARGV, argv en
[all...] |
| token.rb | 422 2. add a new constant, TOKEN_NAMES, which is a hash that maps types to names
438 types with a hash pairing names to values.
535 value_maps, names = token_names.partition { |i| Hash === i }
593 if names.length == 1 and Hash === names.first
|
| /external/chromium_org/third_party/sqlite/src/src/ |
| trigger.c | 311 Hash *pHash = &db->aDb[iDb].pSchema->trigHash;
586 ** Remove a trigger from the hash tables of the sqlite* pointer.
590 Hash *pHash;
[all...] |
| /art/runtime/ |
| class_linker.cc | 126 static size_t Hash(const char* s) {
128 size_t hash = 0; local
130 hash = hash * 31 + *s;
132 return hash;
2225 size_t hash = Hash(descriptor); local
2242 size_t hash = Hash(descriptor); local
2322 size_t hash = Hash(descriptor); local
2385 size_t hash = Hash(descriptor); local
[all...] |
| /external/chromium_org/net/disk_cache/ |
| backend_impl.cc | 11 #include "base/hash.h"
483 uint32 hash = base::Hash(key);
485 EntryImpl* cache_entry = MatchEntry(key, hash, false, Addr(), &error);
499 uint32 hash = base::Hash(key); local
500 Trace("Open hash 0x%x", hash);
503 EntryImpl* cache_entry = MatchEntry(key, hash, false, Addr(), &error);
527 Trace("Open hash 0x%x end: 0x%x", hash
543 uint32 hash = base::Hash(key); local
753 uint32 hash = cache_entry->GetHash(); local
765 uint32 hash = entry->GetHash(); local
[all...] |
| /external/llvm/lib/CodeGen/ |
| BranchFolding.cpp | 252 /// HashMachineInstr - Compute a hash value for MI and its operands.
254 unsigned Hash = MI->getOpcode();
280 Hash += ((OperandHash << 3) | Op.getType()) << (i&31);
282 return Hash;
285 /// HashEndOfMBB - Hash the last instruction in the MBB.
583 /// hash CurHash (guaranteed to match the last element). Build the vector
627 /// RemoveBlocksWithHash - Remove all blocks with hash CurHash from
734 // Sort by hash value so that blocks with identical end sequences sort
742 // Build SameTails, identifying the set of blocks with this hash code
749 // instructions in common, remove all blocks with this hash code and retry
[all...] |
| /external/antlr/antlr-3.4/runtime/Ruby/lib/antlr3/streams/ |
| rewrite.rb | 367 @programs = Hash.new do |programs, name|
|
