| /art/compiler/dex/quick/mips/ |
| H A D | utility_mips.cc | 338 LIR *first = NULL; local
353 first = NewLIR3(kMipsAddu, t_reg , rBase, r_index);
355 first = OpRegRegImm(kOpLsl, t_reg, r_index, scale);
384 return (first) ? first : res;
390 LIR *first = NULL; local
405 first = NewLIR3(kMipsAddu, t_reg , rBase, r_index);
407 first = OpRegRegImm(kOpLsl, t_reg, r_index, scale);
431 return first;
|
| /art/compiler/dex/ |
| H A D | ssa_transformation.cc | 183 BasicBlock* curr_bb = curr.first;
316 /* Find the first processed predecessor */
|
| /art/compiler/driver/ |
| H A D | compiler_driver.cc | 680 // Make a first class to load all classes explicitly listed in the file
707 uint16_t exception_type_idx = exception_type.first;
1437 // The first case where we skip is for redundant class definitions in
1438 // the boot classpath. We skip all but the first definition in that case.
1449 if (pair.first != &dex_file) {
1451 << " previously found in " << pair.first->GetLocation();
2131 // after first initializing its parents, whose locks are acquired. This leads to a
2398 << PrettyDescriptor(ref.first->GetClassDescriptor(ref.first->GetClassDef(ref.second)))
|
| /art/compiler/llvm/ |
| H A D | gbc_expander.cc | 579 llvm::BasicBlock* old_bb = rewrite_pair[j].first;
585 llvm::BasicBlock* old_bb = rewrite_pair[j].first;
601 llvm::PHINode* old_phi = it->first;
1423 // All alloca instructions are generated in the first basic block of the
1424 // function, and there are no alloca instructions after the first non-alloca
1429 // Look for first non-alloca instruction
|
| /art/compiler/sea_ir/debug/ |
| H A D | dot_gen.cc | 53 dot_text_ += art::StringPrintf("vR = %d", def_it->first);
|
| /art/compiler/sea_ir/ir/ |
| H A D | sea.cc | 91 // NewIDom = first (processed) predecessor of b.
178 // Insert a fake SignatureNode for the first parameter.
524 std::pair<int const, std::set<InstructionNode*>*>(de_def->first, solo_def));
534 new_reaching.find(reaching_it->first);
540 reaching_it->first,
|
| /art/compiler/utils/ |
| H A D | dedupe_set.h | 35 if (a.first < b.first) return true;
36 if (a.first > b.first) return true;
|
| /art/oatdump/ |
| H A D | oatdump.cc | 397 bool first = true; local
404 os << (first ? "v" : ", v") << dex_reg;
410 first = false;
454 bool first = true; local
457 if (first) {
461 first = false;
532 bool first = true; local
535 if (first) {
539 first = false;
547 if (!first) {
573 bool first = true; local
1183 bool first = true; local
1222 bool first = true; local
[all...] |
| /art/runtime/arch/arm/ |
| H A D | portable_entrypoints_arm.S | 55 add sp, #16 @ first 4 args are not passed on stack for portable
|
| /art/runtime/base/ |
| H A D | mutex.cc | 271 max_tid = it->first;
282 max_tid = it->first;
|
| H A D | timing_logger.cc | 83 uint64_t split_time = split.first;
161 total_ns += split.first;
172 uint64_t split_time = split.first;
183 uint64_t split_time = split.first;
|
| /art/runtime/ |
| H A D | class_linker.cc | 209 // java_lang_Class comes first, it's needed for AllocClass
1322 return DefineClass(descriptor, NULL, *pair.first, *pair.second);
1326 // First try the boot class path, we check the descriptor first to avoid an unnecessary
1343 return DefineClass(descriptor, class_loader, *pair.first, *pair.second);
2228 for (auto it = class_table_.lower_bound(hash), end = class_table_.end(); it != end && it->first == hash;
2275 for (auto it = class_table_.lower_bound(hash); it != end && it->first == hash; ++it) {
2281 for (++it; it != end && it->first == hash; ++it) {
2389 it != end && it->first == hash; ++it) {
|
| H A D | class_reference.h | 35 return (lhs.first < rhs.first);
|
| H A D | disassembler_arm.cc | 164 bool first = true; local
167 if (first) {
168 first = false;
|
| H A D | elf_file.cc | 82 // first just map ELF header to get program header size information
464 CHECK_EQ(symbol.st_value, result.first->second->st_value);
465 CHECK_EQ(symbol.st_size, result.first->second->st_size);
466 CHECK_EQ(symbol.st_info, result.first->second->st_info);
467 CHECK_EQ(symbol.st_other, result.first->second->st_other);
468 CHECK_EQ(symbol.st_shndx, result.first->second->st_shndx);
618 // If p_vaddr is zero, it must be the first loadable segment,
620 // specific address requested, so first request a contiguous chunk
626 // base_address_ after the first zero segment).
|
| H A D | jni_internal.cc | 550 bool first = true; local
552 if (!first) {
555 first = false;
556 os << library.first;
|
| H A D | reference_table.cc | 156 int first = count - kLast; local
157 if (first < 0) {
158 first = 0;
160 os << " Last " << (count - first) << " entries (of " << count << "):\n";
161 for (int idx = count - 1; idx >= first; --idx) {
|
| H A D | runtime.cc | 390 const std::string option(options[i].first);
391 if (true && options[0].first == "-Xzygote") {
404 const StringPiece& value = options[i].first;
1007 // Register Throwable first so that registration of other native methods can throw exceptions
|
| H A D | safe_map.h | 83 result.first->second = v;
|
| /art/runtime/gc/accounting/ |
| H A D | mod_union_table.cc | 201 const byte* card = it.first;
225 const byte* card_addr = it.first;
|
| /art/runtime/gc/space/ |
| H A D | dlmalloc_space.cc | 144 freed.first = nullptr;
335 if (recent_freed_objects_[pos].first == obj) {
344 recent_freed_objects_[recent_free_pos_].first = ptr;
|
| H A D | space_test.cc | 242 // Free 1 / 2 the allocations the first phase, and all the second phase.
245 mirror::Object* obj = requests.back().first;
|
| /art/runtime/hprof/ |
| H A D | hprof.cc | 22 * appear first.
123 // Values for the first byte of HEAP_DUMP and HEAP_DUMP_SEGMENT records:
540 std::string string((*it).first);
584 const mirror::Class* present = *result.first;
|
| /art/runtime/jdwp/ |
| H A D | jdwp_main.cc | 471 bool first = true; local
488 if (first && !netState->IsAwaitingHandshake()) {
490 first = false;
|
| H A D | object_registry.cc | 58 ObjectRegistryEntry& entry = result.first->second;
|