/art/test/451-spill-splot/src/ |
H A D | Main.java | 48 for (int count = 0; count < 2; count++) {
|
/art/compiler/optimizing/ |
H A D | optimization.h | 51 void MaybeRecordStat(MethodCompilationStat compilation_stat, size_t count = 1) const;
|
H A D | optimizing_compiler_stats.h | 63 void RecordStat(MethodCompilationStat stat, size_t count = 1) { 64 compile_stats_[stat] += count;
|
/art/compiler/dex/ |
H A D | mir_field_info.cc | 34 MirIFieldLoweringInfo* field_infos, size_t count) { 37 DCHECK_NE(count, 0u); 38 for (auto it = field_infos, end = field_infos + count; it != end; ++it) { 57 for (auto it = field_infos, end = field_infos + count; it != end; ++it) { 97 MirSFieldLoweringInfo* field_infos, size_t count) { 100 DCHECK_NE(count, 0u); 101 for (auto it = field_infos, end = field_infos + count; it != end; ++it) { 122 for (auto it = field_infos, end = field_infos + count; it != end; ++it) { 32 Resolve(CompilerDriver* compiler_driver, const DexCompilationUnit* mUnit, MirIFieldLoweringInfo* field_infos, size_t count) argument 95 Resolve(CompilerDriver* compiler_driver, const DexCompilationUnit* mUnit, MirSFieldLoweringInfo* field_infos, size_t count) argument
|
H A D | vreg_analysis.cc | 28 void MIRGraph::DumpRegLocTable(RegLocation* table, int count) { argument 29 for (int i = 0; i < count; i++) {
|
H A D | mir_graph_test.cc | 60 void DoPrepareBasicBlocks(const BBDef* defs, size_t count) { argument 63 ASSERT_LT(3u, count); // null, entry, exit and at least one bytecode block. 67 for (size_t i = 0u; i != count; ++i) { 94 ASSERT_EQ(count, cu_.mir_graph->block_list_.size()); 105 template <size_t count> 106 void PrepareBasicBlocks(const BBDef (&defs)[count]) { 107 DoPrepareBasicBlocks(defs, count); 127 void DoCheckOrder(const BasicBlockId* ids, size_t count) { argument 128 ASSERT_EQ(count, cu_.mir_graph->GetTopologicalSortOrder().size()); 129 for (size_t i = 0; i != count; 139 DoCheckLoopEnds(const uint16_t* ends, size_t count) argument [all...] |
H A D | mir_optimization_test.cc | 99 void DoPrepareBasicBlocks(const BBDef* defs, size_t count) { argument 102 ASSERT_LT(3u, count); // null, entry, exit and at least one bytecode block. 106 for (size_t i = 0u; i != count; ++i) { 133 ASSERT_EQ(count, cu_.mir_graph->block_list_.size()); 140 template <size_t count> 141 void PrepareBasicBlocks(const BBDef (&defs)[count]) { 142 DoPrepareBasicBlocks(defs, count); 252 void DoPrepareMethods(const MethodDef* defs, size_t count) { argument 254 cu_.mir_graph->method_lowering_infos_.reserve(count); 255 for (size_t i = 0u; i != count; 281 DoPrepareMIRs(const MIRDef* defs, size_t count) argument 355 DoPrepareSFields(const SFieldDef* defs, size_t count) argument 405 DoPrepareIFields(const IFieldDef* defs, size_t count) argument [all...] |
H A D | mir_method_info.cc | 36 MirMethodLoweringInfo* method_infos, size_t count) { 39 DCHECK_NE(count, 0u); 40 for (auto it = method_infos, end = method_infos + count; it != end; ++it) { 74 for (auto it = method_infos, end = method_infos + count; it != end; ++it) { 34 Resolve(CompilerDriver* compiler_driver, const DexCompilationUnit* mUnit, MirMethodLoweringInfo* method_infos, size_t count) argument
|
/art/runtime/ |
H A D | indenter.h | 29 Indenter(std::streambuf* out, char text, size_t count) argument 30 : indent_next_(true), out_sbuf_(out), text_(text), count_(count) {}
|
H A D | dex_file_verifier.h | 45 bool CheckListSize(const void* start, size_t count, size_t element_size, const char* label); 75 bool CheckIntraSectionIterate(size_t offset, uint32_t count, uint16_t type); 76 bool CheckIntraIdSection(size_t offset, uint32_t count, uint16_t type); 77 bool CheckIntraDataSection(size_t offset, uint32_t count, uint16_t type); 98 bool CheckInterSectionIterate(size_t offset, uint32_t count, uint16_t type);
|
H A D | gc_root.h | 102 virtual void VisitRoots(mirror::Object*** roots, size_t count, const RootInfo& info) 105 virtual void VisitRoots(mirror::CompressedReference<mirror::Object>** roots, size_t count, 114 void VisitRoots(mirror::Object*** roots, size_t count, const RootInfo& info) OVERRIDE 116 for (size_t i = 0; i < count; ++i) { 121 void VisitRoots(mirror::CompressedReference<mirror::Object>** roots, size_t count, 124 for (size_t i = 0; i < count; ++i) {
|
H A D | profiler.cc | 431 is_filtered = filtered_methods_.count(method_full_name) != 0; 467 // This holds a mapping of ArtMethod* to a count of how many times a sample 484 // has been seen, add it with count=1, otherwise increment the count. 500 // Add a bounded stack to the profile table. Only the count of the method on 588 uint32_t count = meth_iter.second; local 594 count += pi->second.count_; 597 os << StringPrintf("%s/%u/%u\n", method_name.c_str(), count, method_size); 614 uint32_t count = node->GetCount(); local 616 total_count += count; 638 uint32_t count = context_i.second; local 780 uint32_t count = strtoul(context_count[1].c_str(), nullptr, 10); local 785 uint32_t count = strtoul(context_count[1].c_str(), nullptr, 10); local 845 int count = atoi(info[1].c_str()); local 854 uint32_t count = -it->first; local [all...] |
H A D | reference_table.cc | 83 os << " null reference (count=" << equiv << ")\n"; 87 os << " cleared jweak (count=" << equiv << ")\n"; 158 size_t count = entries.size(); local 159 int first = count - kLast; 163 os << " Last " << (count - first) << " entries (of " << count << "):\n"; 165 for (int idx = count - 1; idx >= first; --idx) { 225 // Same class / element count, different object.
|
H A D | lock_word.h | 40 * |00|rb| lock count |thread id owner | 70 // Remaining bits are the recursive lock count. 111 static LockWord FromThinLockId(uint32_t thread_id, uint32_t count, uint32_t rb_state) { argument 113 CHECK_LE(count, static_cast<uint32_t>(kThinLockMaxCount)); 115 return LockWord((thread_id << kThinLockOwnerShift) | (count << kThinLockCountShift) |
|
/art/runtime/jdwp/ |
H A D | jdwp_event.h | 37 int count; member in struct:art::JDWP::JdwpEventMod::__anon106 38 } count; member in union:art::JDWP::JdwpEventMod
|
/art/test/004-ReferenceMap/ |
H A D | stack_walk_refmap_jni.cc | 201 extern "C" JNIEXPORT jint JNICALL Java_Main_refmap(JNIEnv*, jobject, jint count) { argument 207 return count + 1;
|
/art/runtime/mirror/ |
H A D | object_array.h | 72 int32_t count) SHARED_LOCKS_REQUIRED(Locks::mutator_lock_); 76 int32_t count) SHARED_LOCKS_REQUIRED(Locks::mutator_lock_); 80 int32_t count, bool throw_exception)
|
H A D | object.cc | 207 for (size_t i = 0, count = cur->NumInstanceFields(); i < count; ++i) { 228 for (size_t i = 0, count = AsClass()->NumStaticFields(); i < count; ++i) {
|
/art/runtime/interpreter/ |
H A D | unstarted_runtime_test.cc | 187 for (int32_t count = 0; count <= kBaseLen; ++count) { 190 if (start_index + count <= kBaseLen && trg_offset + count <= kBaseLen) { 193 tmp->SetVReg(2, count); 211 for (int32_t i = trg_offset; i < trg_offset + count; ++i) { 215 for (int32_t i = trg_offset + count; i < kBaseLen; ++i) {
|
H A D | interpreter_common.cc | 610 uint16_t count = num_ins; local 612 if (count == 5) { 615 --count; 621 --count; 623 for (; arg_index < count; ++arg_index, regList >>= 4) { 758 static void RecordArrayElementsInTransactionImpl(mirror::PrimitiveArray<T>* array, int32_t count) 761 for (int32_t i = 0; i < count; ++i) { 766 void RecordArrayElementsInTransaction(mirror::Array* array, int32_t count) 770 DCHECK_LE(count, array->GetLength()); 774 RecordArrayElementsInTransactionImpl(array->AsBooleanArray(), count); [all...] |
/art/runtime/hprof/ |
H A D | hprof.cc | 214 void AddU1List(const uint8_t* values, size_t count) { argument 215 HandleU1List(values, count); 216 length_ += count; 218 void AddU2List(const uint16_t* values, size_t count) { argument 219 HandleU2List(values, count); 220 length_ += count * sizeof(uint16_t); 222 void AddU4List(const uint32_t* values, size_t count) { argument 223 HandleU4List(values, count); 224 length_ += count * sizeof(uint32_t); 229 void AddU8List(const uint64_t* values, size_t count) { argument [all...] |
/art/runtime/base/ |
H A D | bit_vector.cc | 233 uint32_t count = 0; local 235 count += POPCOUNT(storage_[word]); 237 return count; 323 uint32_t count = 0u; local 325 count += POPCOUNT(storage[word]); 328 count += POPCOUNT(storage[word_end] & ~(0xffffffffu << partial_word_bits)); 330 return count;
|
/art/runtime/gc/accounting/ |
H A D | space_bitmap_test.cc | 138 size_t count = 0; variable 139 SimpleCounter c(&count); variable 155 EXPECT_EQ(count, manual);
|
/art/test/036-finalizer/src/ |
H A D | Main.java | 159 private static void allocFinalizableObjects(int count) { argument 160 Object[] objs = new Object[count]; 161 for (int i = 0; i < count; ++i) {
|
/art/tools/dexfuzz/src/dexfuzz/program/ |
H A D | MutatableCode.java | 321 public void allocateTemporaryVRegs(int count) { argument 322 if (count > tempVRegsAllocated) { 330 registersSize = (short) (initialTempVReg + count); 331 if (outsSize < count) { 332 outsSize = (short) count; 335 tempVRegsAllocated = (short) count;
|