Searched defs:key (Results 1 - 6 of 6) sorted by relevance
/art/test/055-enum-performance/src/ |
H A D | Main.java | 123 static String basisValueOf(String key) { argument 125 if (s.equals(key)) {
|
/art/compiler/utils/ |
H A D | dedupe_set.h | 54 Key* Add(Thread* self, const Key& key) { argument 55 HashType hash = HashFunc()(key); 56 HashedKey hashed_key(hash, const_cast<Key*>(&key)); 62 hashed_key.second = new Key(key);
|
/art/compiler/dex/ |
H A D | local_value_numbering.h | 45 uint64_t key = BuildKey(op, operand1, operand2, modifier); local 46 ValueMap::iterator it = value_map_.find(key); 51 value_map_.Put(key, res); 57 uint64_t key = BuildKey(op, operand1, operand2, modifier); local 58 ValueMap::const_iterator it = value_map_.find(key); 63 uint32_t key = (base << 16) | field; local 65 MemoryVersionMap::iterator it = memory_version_map_.find(key); 68 memory_version_map_.Put(key, res); 76 uint32_t key = (base << 16) | field; local 77 MemoryVersionMap::iterator it = memory_version_map_.find(key); [all...] |
H A D | mir_graph.h | 285 * "SuccessorBlockInfo". For catch blocks, key is type index for the exception. For swtich 286 * blocks, key is the case value. 291 int key; member in struct:art::SuccessorBlockInfo
|
/art/compiler/dex/quick/x86/ |
H A D | call_x86.cc | 31 * The sparse table in the literal pool is an array of <key,displacement> 45 int key = keys[i]; local 48 OpCmpImmBranch(kCondEq, rl_src.low_reg, key,
|
/art/runtime/verifier/ |
H A D | method_verifier.cc | 943 int32_t key = (int32_t) switch_insns[keys_offset + targ * 2] | local 945 if (key <= last_key) { 946 Fail(VERIFY_ERROR_BAD_CLASS_HARD) << "invalid packed switch: last key=" << last_key 947 << ", this=" << key; local 950 last_key = key; 2679 /* 0 = sig, 1 = count, 2/3 = first key */
|
Completed in 153 milliseconds