/art/runtime/mirror/ |
H A D | string.cc | 38 int32_t count = GetLength(); local 41 } else if (start > count) { 42 start = count; 46 const uint16_t* end = chars + count;
|
/art/runtime/ |
H A D | profiler.h | 124 typedef std::map<ArtMethod*, uint32_t> Map; // Map of method vs its count. 137 PreviousValue(uint32_t count, uint32_t method_size, PreviousContextMap* context_map) argument 138 : count_(count), method_size_(method_size), context_map_(context_map) {} 243 ProfileData(const std::string& method_name, uint32_t count, uint32_t method_size, argument 245 method_name_(method_name), count_(count), method_size_(method_size),
|
H A D | dex_file_verifier.cc | 173 bool DexFileVerifier::CheckListSize(const void* start, size_t count, size_t elem_size, argument 185 if (max_count < count) { 188 count, elem_size); 192 const uint8_t* range_end = range_start + count * elem_size; 205 // Check that the list is available. The first 4B are the count. 210 uint32_t count = *reinterpret_cast<const uint32_t*>(*ptr); local 211 if (count > 0) { 212 if (!CheckListSize(*ptr + 4, count, element_size, label)) { 217 *ptr += 4 + count * element_size; 297 uint32_t count local 1275 CheckIntraIdSection(size_t offset, uint32_t count, uint16_t type) argument 1323 CheckIntraDataSection(size_t offset, uint32_t count, uint16_t type) argument 1350 uint32_t count = map->size_; local 1824 uint32_t count = list->size_; local 1841 uint32_t count = set->size_; local 1969 CheckInterSectionIterate(size_t offset, uint32_t count, uint16_t type) argument 2065 uint32_t count = map->size_; local [all...] |
H A D | dex_instruction-inl.h | 444 * was done so that the field names for the argument count and 448 * Bottom line: The argument count is always in vA, and the 452 uint4_t count = InstB(inst_data); // This is labeled A in the spec. local 453 DCHECK_LE(count, 5U) << "Invalid arg count in 35c (" << count << ")"; 462 switch (count) {
|
/art/runtime/jdwp/ |
H A D | jdwp_main.cc | 75 void JdwpNetStateBase::ConsumeBytes(size_t count) { argument 76 CHECK_GT(count, 0U); 77 CHECK_LE(count, input_count_); 79 if (count == input_count_) { 84 memmove(input_buffer_, input_buffer_ + count, input_count_ - count); 85 input_count_ -= count;
|
/art/compiler/dex/ |
H A D | local_value_numbering_test.cc | 94 void DoPrepareIFields(const IFieldDef* defs, size_t count) { argument 96 cu_.mir_graph->ifield_lowering_infos_.reserve(count); 97 for (size_t i = 0u; i != count; ++i) { 109 template <size_t count> 110 void PrepareIFields(const IFieldDef (&defs)[count]) { 111 DoPrepareIFields(defs, count); 114 void DoPrepareSFields(const SFieldDef* defs, size_t count) { argument 116 cu_.mir_graph->sfield_lowering_infos_.reserve(count); 117 for (size_t i = 0u; i != count; ++i) { 132 template <size_t count> 137 DoPrepareMIRs(const MIRDef* defs, size_t count) argument [all...] |
H A D | local_value_numbering.h | 109 DCHECK_EQ(map->count(s_reg), 0u); 126 DCHECK_EQ(sreg_wide_value_map_.count(s_reg), 0u); 132 DCHECK_EQ(sreg_wide_value_map_.count(s_reg), 0u); 138 DCHECK_EQ(sreg_value_map_.count(s_reg), 0u); 145 DCHECK_EQ(sreg_value_map_.count(s_reg), 0u);
|
H A D | gvn_dead_code_elimination_test.cc | 143 void DoPrepareIFields(const IFieldDef* defs, size_t count) { argument 145 cu_.mir_graph->ifield_lowering_infos_.reserve(count); 146 for (size_t i = 0u; i != count; ++i) { 160 template <size_t count> 161 void PrepareIFields(const IFieldDef (&defs)[count]) { 162 DoPrepareIFields(defs, count); 165 void DoPrepareSFields(const SFieldDef* defs, size_t count) { argument 167 cu_.mir_graph->sfield_lowering_infos_.reserve(count); 168 for (size_t i = 0u; i != count; ++i) { 185 template <size_t count> 190 DoPrepareBasicBlocks(const BBDef* defs, size_t count) argument 258 DoPrepareMIRs(const MIRDef* defs, size_t count) argument [all...] |
H A D | mir_analysis.cc | 1044 float count = stats->dex_instructions; local 1045 stats->math_ratio = stats->math_ops / count; 1046 stats->fp_ratio = stats->fp_ops / count; 1047 stats->branch_ratio = stats->branch_ops / count; 1048 stats->array_ratio = stats->array_ops / count; 1049 stats->heavyweight_ratio = stats->heavyweight_ops / count; 1408 const size_t count = invoke_map.size(); local 1409 method_lowering_infos_.reserve(count); 1410 for (size_t pos = 0u; pos != count; ++pos) { 1425 method_lowering_infos_.data(), count); [all...] |
H A D | type_inference_test.cc | 151 void AddTypes(const TypeDef* defs, size_t count) { argument 152 for (size_t i = 0; i != count; ++i) { 158 template <size_t count> 159 void PrepareTypes(const TypeDef (&defs)[count]) { 161 type_count_ = count; 162 AddTypes(defs, count); 165 void AddFields(const FieldDef* defs, size_t count) { argument 166 for (size_t i = 0; i != count; ++i) { 172 template <size_t count> 173 void PrepareIFields(const FieldDef (&defs)[count]) { 186 AddMethods(const MethodDef* defs, size_t count) argument 302 DoPrepareBasicBlocks(const BBDef* defs, size_t count) argument 384 DoPrepareMIRs(const MIRDef* defs, size_t count) argument [all...] |
H A D | global_value_numbering_test.cc | 140 void DoPrepareIFields(const IFieldDef* defs, size_t count) { argument 142 cu_.mir_graph->ifield_lowering_infos_.reserve(count); 143 for (size_t i = 0u; i != count; ++i) { 155 template <size_t count> 156 void PrepareIFields(const IFieldDef (&defs)[count]) { 157 DoPrepareIFields(defs, count); 160 void DoPrepareSFields(const SFieldDef* defs, size_t count) { argument 162 cu_.mir_graph->sfield_lowering_infos_.reserve(count); 163 for (size_t i = 0u; i != count; ++i) { 178 template <size_t count> 183 DoPrepareBasicBlocks(const BBDef* defs, size_t count) argument 230 DoPrepareMIRs(const MIRDef* defs, size_t count) argument 279 DoPrepareVregToSsaMapExit(BasicBlockId bb_id, const int32_t* map, size_t count) argument [all...] |
H A D | mir_field_info.h | 137 MirIFieldLoweringInfo* field_infos, size_t count) 194 MirSFieldLoweringInfo* field_infos, size_t count)
|
/art/runtime/arch/ |
H A D | memcmp16_test.cc | 37 int32_t memcmp16_compare(const uint16_t* s0, const uint16_t* s1, size_t count) { argument 38 for (size_t i = 0; i < count; i++) {
|
/art/runtime/gc/collector/ |
H A D | mark_compact.cc | 311 mirror::Object*** roots, size_t count, const RootInfo& info ATTRIBUTE_UNUSED) { 312 for (size_t i = 0; i < count; ++i) { 318 mirror::CompressedReference<mirror::Object>** roots, size_t count, 320 for (size_t i = 0; i < count; ++i) { 330 void VisitRoots(mirror::Object*** roots, size_t count, const RootInfo& info ATTRIBUTE_UNUSED) 333 for (size_t i = 0; i < count; ++i) { 343 void VisitRoots(mirror::CompressedReference<mirror::Object>** roots, size_t count, 347 for (size_t i = 0; i < count; ++i) { 310 VisitRoots( mirror::Object*** roots, size_t count, const RootInfo& info ATTRIBUTE_UNUSED) argument 317 VisitRoots( mirror::CompressedReference<mirror::Object>** roots, size_t count, const RootInfo& info ATTRIBUTE_UNUSED) argument
|
H A D | mark_sweep.cc | 536 void MarkSweep::VisitRoots(mirror::Object*** roots, size_t count, argument 538 for (size_t i = 0; i < count; ++i) { 543 void MarkSweep::VisitRoots(mirror::CompressedReference<mirror::Object>** roots, size_t count, argument 545 for (size_t i = 0; i < count; ++i) { 1050 void VisitRoots(mirror::Object*** roots, size_t count, const RootInfo& info ATTRIBUTE_UNUSED) 1053 for (size_t i = 0; i < count; ++i) { 1058 void VisitRoots(mirror::CompressedReference<mirror::Object>** roots, size_t count, 1062 for (size_t i = 0; i < count; ++i) { 1097 // Request the check point is run on all threads returning a count of the threads that must 1126 size_t count local [all...] |
/art/runtime/native/ |
H A D | org_apache_harmony_dalvik_ddmc_DdmVmInternal.cc | 86 uint16_t& count = *reinterpret_cast<uint16_t*>(context); local 87 ++count; 101 * (2b) thread count
|
/art/runtime/gc/accounting/ |
H A D | space_bitmap.cc | 199 for (size_t i = 0, count = klass->NumInstanceFields(); i < count; ++i) { 226 for (size_t i = 0, count = klass->NumStaticFields(); i < count; ++i) {
|
/art/runtime/gc/ |
H A D | reference_queue.cc | 128 size_t count = 0; local 132 ++count; 136 return count;
|
/art/test/003-omnibus-opcodes/src/ |
H A D | Array.java | 187 static void checkNegAlloc(int count) { argument 193 ints = new int[count]; 200 strings = new String[count];
|
/art/test/074-gc-thrash/src/ |
H A D | Main.java | 335 int count = 0; 345 count++; 346 if ((count % 500) == 0) {
|
/art/compiler/utils/ |
H A D | assembler_test.h | 34 constexpr size_t ConstexprStrLen(char const* str, size_t count = 0) { 35 return ('\0' == str[0]) ? count : ConstexprStrLen(str+1, count+1); 494 void WarnOnCombinations(size_t count) { argument 495 if (count > kWarnManyCombinationsThreshold) { 496 GTEST_LOG_(WARNING) << "Many combinations (" << count << "), test generation might be slow.";
|
/art/compiler/dex/quick/ |
H A D | ralloc_util.cc | 1204 // Nothing to do, if an intrinsic uses ArtMethod* it's in the slow-path - don't count it. 1266 core_counts[SRegToPMap(mir_graph_->GetMethodLoc().s_reg_low)].count += weight; 1270 core_counts[SRegToPMap(pc_rel_temp_->s_reg_low)].count += weight; 1279 /* USE SSA names to count references of base Dalvik v_regs. */ 1290 counts[p_map_idx].count += use_count; 1293 counts[p_map_idx + num_regs].count += use_count; 1297 counts[p_map_idx].count += use_count; 1304 counts[p_map_idx].count += use_count; 1310 DCHECK_EQ(core_counts[SRegToPMap(mir_graph_->GetMethodLoc().s_reg_low)].count, 0); 1312 DCHECK_EQ(core_counts[SRegToPMap(pc_rel_temp_->s_reg_low)].count, [all...] |
/art/runtime/base/ |
H A D | mutex.cc | 238 ++log[slot].count; 247 log[new_slot].count.StoreRelaxed(1); 269 uint32_t count = log[i].count.LoadRelaxed(); local 270 if (count > 0) { 273 most_common_blocked.Overwrite(blocked_tid, it->second + count); 275 most_common_blocked.Put(blocked_tid, count); 279 most_common_blocker.Overwrite(owner_tid, it->second + count); 281 most_common_blocker.Put(owner_tid, count); 393 CHECK(recursion_count_ == 1 || recursive_) << "Unexpected recursion count o [all...] |
/art/tools/ |
H A D | cpplint.py | 135 'toplevel' is provided, then the count of errors in each of 137 also be printed. If 'detailed' is provided, then a count 556 self.error_count = 0 # global count of reported errors 623 for category, count in self.errors_by_category.iteritems(): 625 (category, count)) 930 return ((line.count('"') - line.count(r'\"') - line.count("'\"'")) & 1) == 1 1092 num_open = tail.count(startchar) - tail.count(endcha [all...] |
/art/compiler/optimizing/ |
H A D | liveness_test.cc | 36 size_t count, 40 for (size_t i = 0; i < count; ++i) { 34 DumpBitVector(BitVector* vector, std::ostream& buffer, size_t count, const char* prefix) argument
|