/art/compiler/optimizing/ |
H A D | liveness_test.cc | 59 for (HInsertionOrderIterator it(*graph); !it.Done(); it.Advance()) { 60 HBasicBlock* block = it.Current();
|
H A D | sharpening.cc | 39 for (HInstructionIterator it(block->GetInstructions()); !it.Done(); it.Advance()) { 40 HInstruction* instruction = it.Current(); 47 // here. Rewrite it to avoid the CompilerDriver's reliance on verifier data 79 // kind as long as it's supported by the codegen 101 // kDirectAddress would be fine for image methods, we don't support it at the moment. 123 // while kCallDirect would be fine for image methods, we don't support it at the moment. 176 // Compiling boot image. Resolve the string and allocate it if needed.
|
H A D | ssa_liveness_analysis.h | 304 // If this environment use does not keep the instruction live, it does not 624 // Search start point is inside `new_interval`. Change it to null 633 // range and make it the first range of the new interval. 645 // Search start point is inside `new_interval`. Change it to `last_range` 711 // it uses the same input as the first input), returns the register as a hint. 795 // Returns whether an interval, when it is non-split, is using 800 for (HInputIterator it(defined_by_); !it.Done(); it.Advance()) { 801 LiveInterval* interval = it [all...] |
H A D | constant_folding.cc | 82 for (HInstructionIterator it(block->GetInstructions()); !it.Done(); it.Advance()) { 83 it.Current()->Accept(this);
|
H A D | parallel_move_resolver.cc | 120 // Each call to this function performs a move and deletes it from the move 164 // at the next moves. Swapping is not blocked by anything, it just 181 // We are about to resolve this move and don't need it marked as 186 // so it may now be the last move in the cycle. If so remove it. 195 // resolve it. 231 // we return the swapped move, so that the caller knows it needs to re-iterate 390 for (auto it = scratches_.begin(), end = scratches_.end(); it != end; ++it) { [all...] |
H A D | code_generator.cc | 174 // We avoid building this data when we know it will not be used. 233 for (HInstructionIterator it(block->GetInstructions()); !it.Done(); it.Advance()) { 234 HInstruction* current = it.Current(); 238 // so the runtime's stackmap is not sufficient since it is at PC after the call. 382 // allocator expects it in a floating point register. 395 // expects it in a regular register location. Allocate a temp for it and 508 // to special case it [all...] |
H A D | bounds_check_elimination.cc | 159 * (leading to the actual length). This makes it more likely related 183 // Returns if it's certain this->bound >= `bound`. 192 // Returns if it's certain this->bound <= `bound`. 201 // Returns if it's certain this->bound > `bound`. 210 // Returns if it's certain this->bound < `bound`. 321 // If it's certain that this value range fits in other_range. 332 // If it's not possible to do intersection because some 333 // bounds are not comparable, it's ok to pick either bound. 388 // To be conservative, give it full range [Min(), Max()] in case it' 1398 auto it = early_exit_loop_.find(loop_id); local 1506 auto it = taken_test_loop_.find(loop_id); local [all...] |
H A D | instruction_builder.cc | 48 // No point in creating the catch phi if it is already undefined at 81 for (HReversePostOrderIterator it(*graph_); !it.Done(); it.Advance()) { 82 HBasicBlock* current = it.Current(); 232 for (HInstructionIterator it(block->GetPhis()); !it.Done(); it.Advance()) { 233 HPhi* phi = it.Current()->AsPhi(); 238 // Vreg is undefined at this predecessor. Mark it dea 1684 auto it = skipped_interpreter_metadata_.find(dex_pc); local [all...] |
/art/runtime/jit/ |
H A D | offline_profiling_info.cc | 191 for (const auto& it : info_) { 198 const std::string& dex_location = it.first; 199 const DexFileData& dex_data = it.second; 575 for (const auto& it : info_) { 576 total += it.second.method_set.size(); 583 for (const auto& it : info_) { 584 total += it.second.class_set.size(); 599 for (const auto& it : info_) { 601 const std::string& location = it.first; 602 const DexFileData& dex_data = it [all...] |
/art/runtime/ |
H A D | intern_table_test.cc | 69 for (auto it = expected_.begin(), end = expected_.end(); it != end; ++it) { 70 if (*it == s) { 71 expected_.erase(it);
|
H A D | instrumentation.cc | 254 auto it = instrumentation_stack_->begin(); local 255 for (auto end = instrumentation_stack_->end(); it != end; ++it) { 256 const InstrumentationStackFrame& current = *it; 261 instrumentation_stack_->insert(it, instrumentation_frame); 422 // Otherwise we add it to the end of the list. 423 auto it = std::find(list.begin(), list.end(), nullptr); local 424 if (it != list.end()) { 425 *it = listener; 492 auto it local 747 auto it = deoptimized_methods_.find(method); local [all...] |
H A D | dex_file_verifier_test.cc | 296 ClassDataItemIterator it(*dex_file, class_data); 307 while (it.HasNextStaticField() || it.HasNextInstanceField()) { 308 trailing = it.DataPointer(); 309 it.Next(); 312 while (it.HasNextDirectMethod() || it.HasNextVirtualMethod()) { 313 uint32_t method_index = it.GetMemberIndex(); 325 trailing = it.DataPointer(); 326 it [all...] |
H A D | fault_handler.cc | 34 // Typically a signal handler should not need to deal with signals that occur within it. 38 // that it may not work. If the cause of the original SIGSEGV is a corrupted stack or other 53 // a. it completes successfully 54 // b. it crashes and a signal is raised. 61 // and write something to the log to tell the user that it happened. 166 // Release the fault manager so that it will remove the signal chain for 249 // If malloc calls abort, it will be holding its lock. 250 // If the handler tries to call malloc, it will deadlock. 263 // We have handled a signal so it's time to return from the 272 // if it i 295 auto it = std::find(generated_code_handlers_.begin(), generated_code_handlers_.end(), handler); local [all...] |
H A D | jni_env_ext.cc | 174 // IdentityHashCode can cause thread suspension, which would invalidate o if it moved. So 204 auto it = std::find(locked_objects_.begin(), locked_objects_.end(), exact_pair); local 206 if (it != locked_objects_.end()) { 207 locked_objects_.erase(it);
|
H A D | profiler.cc | 54 // have some performance data after it's been used for a while. 248 // We should never get a timeout. If we do, it suggests a problem with the checkpoint 257 // After the profile has been taken, write it out. 371 // Now wake up the sampler thread if it sleeping. 443 // Add to the profile table unless it is filtered out. 472 // hit it at the top of the stack. 492 // Add a method to the profile table. If it's the first time the method 493 // has been seen, add it with count=1, otherwise increment the count. 731 int n = read(fd, buf, 1); // TODO: could speed this up but is it worth it [all...] |
H A D | art_method.cc | 71 // due to the way we select it. 198 for (CatchHandlerIterator it(*code_item, dex_pc); it.HasNext(); it.Next()) { 199 uint16_t iter_type_idx = it.GetHandlerTypeIndex(); 202 found_dex_pc = it.GetHandlerAddress(); 220 found_dex_pc = it.GetHandlerAddress(); 255 // If the runtime is not yet started or it is required by the debugger, then perform the 454 // This is a downcall, it can only happen for a native method. 467 // Check whether the JIT has compiled it [all...] |
/art/runtime/native/ |
H A D | dalvik_system_VMRuntime.cc | 320 // Skip uninitialized classes because filled static storage entry implies it is initialized. 406 // Disabled because it takes a long time (extra half second) but 530 ClassDataItemIterator it(*dex_file, class_data); 531 for (; it.HasNextStaticField(); it.Next()) { 532 uint32_t field_idx = it.GetMemberIndex(); 535 for (; it.HasNextInstanceField(); it.Next()) { 536 uint32_t field_idx = it.GetMemberIndex(); 539 for (; it [all...] |
H A D | dalvik_system_DexFile.cc | 200 auto it = error_msgs.begin(); local 202 for ( ; it != itEnd; ++it) { 203 ThrowWrappedIOException("%s", it->c_str()); 224 // code using it. dex_files is a vector due to multidex. 330 // Now create output array and copy the set into it. 335 auto it = descriptors.begin(); local 338 for (; it != it_end; it++, ++i) { 339 std::string descriptor(DescriptorToDot(*it)); [all...] |
/art/runtime/base/ |
H A D | mutex.cc | 177 for (It it = all_mutexes->begin(); it != all_mutexes->end(); ++it) { 178 BaseMutex* mutex = *it; 185 for (It it = all_mutexes->begin(); it != all_mutexes->end(); ++it) { 186 BaseMutex* mutex = *it; 237 // This code is intentionally racy as it is only used for diagnostics. 274 auto it local [all...] |
H A D | timing_logger.cc | 97 auto it = histograms_.find(&dummy); local 98 if (it == histograms_.end()) { 104 histogram = *it; 123 // We don't expect DumpHistogram to be called often, so it is not performance critical.
|
/art/dexdump/ |
H A D | dexdump.cc | 462 for (CatchHandlerIterator it(*pCode, *pTry); it.HasNext(); it.Next()) { 463 const u2 tidx = it.GetHandlerTypeIndex(); 466 fprintf(gOutFile, " %s -> 0x%04x\n", descriptor, it.GetHandlerAddress()); 601 // size, so we add explicit space for it here. 992 // Primitive char, copy it. 1194 * version, so the DumpMethodCFG code will have to iterate again to find it. But dexdump is a 1214 ClassDataItemIterator it(*dex_file, class_data); 1215 while (it [all...] |
/art/compiler/debug/ |
H A D | elf_debug_line_writer.h | 89 // It would confuse the debugger and the DWARF specification forbids it. 126 // However, the debugger is more clever and it will ask us for line-number 133 // (the debugger would trust us that the PC is valid; it might try to set 190 auto it = directories_map.find(package_name); local 191 if (it == directories_map.end()) { 196 directory_index = it->second;
|
/art/runtime/gc/allocator/ |
H A D | rosalloc.cc | 129 for (auto it = free_page_runs_.begin(); it != free_page_runs_.end(); ) { 130 FreePageRun* fpr = *it; 136 free_page_runs_.erase(it++); 163 ++it; 171 auto it = free_page_runs_.rbegin(); local 172 if (it != free_page_runs_.rend() && (last_free_page_run = *it)->End(this) == base_ + footprint_) { 183 // If we grow the heap, we can allocate it. 225 it 591 auto it = bt->begin(); local 1357 auto it = free_page_runs_.rbegin(); local [all...] |
/art/runtime/hprof/ |
H A D | hprof.cc | 523 // However, WriteStackTraces() can modify the string table, so it's necessary to call 591 auto it = classes_.find(c); local 592 if (it == classes_.end()) { 625 auto it = strings_.find(string); local 626 if (it != strings_.end()) { 627 return it->second; 655 // TODO: It seems it would be correct to use U8. 671 for (const auto& it : traces_) { 672 const gc::AllocRecordStackTrace* trace = it.first; 673 HprofStackTraceSerialNumber trace_sn = it [all...] |
/art/runtime/gc/accounting/ |
H A D | mod_union_table.cc | 119 // Only add the reference if it is non null and fits our criteria. 194 // Only add the reference if it is non null and fits our criteria. 403 // Keep this card for next time since it contains a GcRoot which matches the 410 for (auto it = references_.begin(); it != references_.end();) { 411 std::vector<mirror::HeapReference<mirror::Object>*>& references = it->second; 424 ++it; 427 it = references_.erase(it);
|