/art/compiler/dex/ |
D | bb_optimizations.h | 37 void Start(PassDataHolder* data) const { in Start() argument 38 DCHECK(data != nullptr); in Start() 39 CompilationUnit* c_unit = down_cast<PassMEDataHolder*>(data)->c_unit; in Start() 44 bool Gate(const PassDataHolder* data) const { in Gate() argument 45 DCHECK(data != nullptr); in Gate() 46 CompilationUnit* c_unit = down_cast<const PassMEDataHolder*>(data)->c_unit; in Gate() 61 void Start(PassDataHolder* data) const { in Start() argument 62 DCHECK(data != nullptr); in Start() 63 CompilationUnit* c_unit = down_cast<PassMEDataHolder*>(data)->c_unit; in Start() 68 bool Gate(const PassDataHolder* data) const { in Gate() argument [all …]
|
D | post_opt_passes.h | 39 bool Gate(const PassDataHolder* data) const OVERRIDE { in Gate() argument 40 DCHECK(data != nullptr); in Gate() 41 CompilationUnit* c_unit = down_cast<const PassMEDataHolder*>(data)->c_unit; in Gate() 57 void Start(PassDataHolder* data) const { in Start() argument 60 DCHECK(data != nullptr); in Start() 61 CompilationUnit* c_unit = down_cast<PassMEDataHolder*>(data)->c_unit; in Start() 77 bool Worker(PassDataHolder* data) const; 89 void Start(PassDataHolder* data) const; 101 bool Gate(const PassDataHolder* data) const { in Gate() argument 102 DCHECK(data != nullptr); in Gate() [all …]
|
D | gvn_dead_code_elimination.cc | 94 MIRData* data = &mir_data_.back(); in AddMIRWithDef() local 95 data->has_def = true; in AddMIRWithDef() 96 data->wide_def = wide; in AddMIRWithDef() 97 data->vreg_def = v_reg; in AddMIRWithDef() 100 data->prev_value = vreg_data_[v_reg]; in AddMIRWithDef() 101 data->low_def_over_high_word = in AddMIRWithDef() 111 data->prev_value_high = vreg_data_[v_reg + 1]; in AddMIRWithDef() 112 data->high_def_over_low_word = in AddMIRWithDef() 127 MIRData* data = LastMIRData(); in RemoveLastMIRData() local 128 if (data->has_def) { in RemoveLastMIRData() [all …]
|
D | bb_optimizations.cc | 26 bool CodeLayout::Worker(PassDataHolder* data) const { in Worker() 27 DCHECK(data != nullptr); in Worker() 28 PassMEDataHolder* pass_me_data_holder = down_cast<PassMEDataHolder*>(data); in Worker() 41 bool BBCombine::Worker(PassDataHolder* data) const { in Worker() 42 DCHECK(data != nullptr); in Worker() 43 PassMEDataHolder* pass_me_data_holder = down_cast<PassMEDataHolder*>(data); in Worker() 57 bool MethodUseCount::Gate(const PassDataHolder* data) const { in Gate() 58 DCHECK(data != nullptr); in Gate() 59 CompilationUnit* c_unit = down_cast<const PassMEDataHolder*>(data)->c_unit; in Gate() 70 bool MethodUseCount::Worker(PassDataHolder* data) const { in Worker() [all …]
|
D | pass.h | 56 virtual bool Gate(const PassDataHolder* data) const { in Gate() argument 58 UNUSED(data); in Gate() 67 virtual void Start(PassDataHolder* data) const { in Start() argument 69 UNUSED(data); in Start() 75 virtual void End(PassDataHolder* data) const { in End() argument 77 UNUSED(data); in End() 84 virtual bool Worker(PassDataHolder* data ATTRIBUTE_UNUSED) const { in Worker()
|
/art/test/412-new-array/smali/ |
D | fill_array_data.smali | 8 fill-array-data v0, :ArrayData 12 .array-data 4 14 .end array-data 21 fill-array-data v0, :ArrayData 25 .array-data 2 27 .end array-data 34 fill-array-data v0, :ArrayData 38 .array-data 2 40 .end array-data 47 fill-array-data v0, :ArrayData [all …]
|
/art/compiler/optimizing/ |
D | suspend_check_test.cc | 30 static void TestCode(const uint16_t* data) { in TestCode() argument 35 const DexFile::CodeItem* item = reinterpret_cast<const DexFile::CodeItem*>(data); in TestCode() 47 const uint16_t data[] = ZERO_REGISTER_CODE_ITEM( in TEST() local 51 TestCode(data); in TEST() 55 const uint16_t data[] = ZERO_REGISTER_CODE_ITEM( in TEST() local 58 TestCode(data); in TEST() 62 const uint16_t data[] = ONE_REGISTER_CODE_ITEM( in TEST() local 67 TestCode(data); in TEST() 71 const uint16_t data[] = ONE_REGISTER_CODE_ITEM( in TEST() local 76 TestCode(data); in TEST() [all …]
|
D | liveness_test.cc | 46 static void TestCode(const uint16_t* data, const char* expected) { in TestCode() argument 51 const DexFile::CodeItem* item = reinterpret_cast<const DexFile::CodeItem*>(data); in TestCode() 94 const uint16_t data[] = ONE_REGISTER_CODE_ITEM( in TEST() local 98 TestCode(data, expected); in TEST() 116 const uint16_t data[] = ONE_REGISTER_CODE_ITEM( in TEST() local 120 TestCode(data, expected); in TEST() 142 const uint16_t data[] = TWO_REGISTERS_CODE_ITEM( in TEST() local 149 TestCode(data, expected); in TEST() 189 const uint16_t data[] = ONE_REGISTER_CODE_ITEM( in TEST() local 197 TestCode(data, expected); in TEST() [all …]
|
D | ssa_test.cc | 78 static void TestCode(const uint16_t* data, const char* expected) { in TestCode() argument 83 const DexFile::CodeItem* item = reinterpret_cast<const DexFile::CodeItem*>(data); in TestCode() 126 const uint16_t data[] = ONE_REGISTER_CODE_ITEM( in TEST() local 132 TestCode(data, expected); in TEST() 157 const uint16_t data[] = ONE_REGISTER_CODE_ITEM( in TEST() local 163 TestCode(data, expected); in TEST() 188 const uint16_t data[] = ONE_REGISTER_CODE_ITEM( in TEST() local 196 TestCode(data, expected); in TEST() 221 const uint16_t data[] = ONE_REGISTER_CODE_ITEM( in TEST() local 229 TestCode(data, expected); in TEST() [all …]
|
D | pretty_printer_test.cc | 30 static void TestCode(const uint16_t* data, const char* expected) { in TestCode() argument 35 const DexFile::CodeItem* item = reinterpret_cast<const DexFile::CodeItem*>(data); in TestCode() 44 const uint16_t data[] = ZERO_REGISTER_CODE_ITEM( in TEST() local 56 TestCode(data, expected); in TEST() 71 const uint16_t data[] = in TEST() local 76 TestCode(data, expected); in TEST() 93 const uint16_t data[] = ZERO_REGISTER_CODE_ITEM( in TEST() local 98 TestCode(data, expected); in TEST() 172 const uint16_t data[] = ZERO_REGISTER_CODE_ITEM( in TEST() local 177 TestCode(data, expected); in TEST() [all …]
|
D | linearize_test.cc | 39 static void TestCode(const uint16_t* data, const int* expected_order, size_t number_of_blocks) { in TestCode() argument 44 const DexFile::CodeItem* item = reinterpret_cast<const DexFile::CodeItem*>(data); in TestCode() 76 const uint16_t data[] = ONE_REGISTER_CODE_ITEM( in TEST() local 84 TestCode(data, blocks, 9); in TEST() 101 const uint16_t data[] = ONE_REGISTER_CODE_ITEM( in TEST() local 109 TestCode(data, blocks, 9); in TEST() 127 const uint16_t data[] = ONE_REGISTER_CODE_ITEM( in TEST() local 136 TestCode(data, blocks, 10); in TEST() 157 const uint16_t data[] = ONE_REGISTER_CODE_ITEM( in TEST() local 166 TestCode(data, blocks, 12); in TEST() [all …]
|
D | dominator_test.cc | 27 static void TestCode(const uint16_t* data, const int* blocks, size_t blocks_length) { in TestCode() argument 32 const DexFile::CodeItem* item = reinterpret_cast<const DexFile::CodeItem*>(data); in TestCode() 54 const uint16_t data[] = ZERO_REGISTER_CODE_ITEM( in TEST() local 63 TestCode(data, dominators, sizeof(dominators) / sizeof(int)); in TEST() 67 const uint16_t data[] = ZERO_REGISTER_CODE_ITEM( in TEST() local 78 TestCode(data, dominators, sizeof(dominators) / sizeof(int)); in TEST() 82 const uint16_t data[] = ZERO_REGISTER_CODE_ITEM( in TEST() local 95 TestCode(data, dominators, sizeof(dominators) / sizeof(int)); in TEST() 149 const uint16_t data[] = ZERO_REGISTER_CODE_ITEM( in TEST() local 162 TestCode(data, dominators, sizeof(dominators) / sizeof(int)); in TEST() [all …]
|
D | intrinsics.cc | 47 static Primitive::Type GetType(uint64_t data, bool is_op_size) { in GetType() argument 49 switch (static_cast<OpSize>(data)) { in GetType() 59 LOG(FATAL) << "Unknown/unsupported op size " << data; in GetType() 63 if ((data & kIntrinsicFlagIsLong) != 0) { in GetType() 66 if ((data & kIntrinsicFlagIsObject) != 0) { in GetType() 77 return ((method.d.data & kIntrinsicFlagToFloatingPoint) == 0) ? in GetIntrinsic() 80 return ((method.d.data & kIntrinsicFlagToFloatingPoint) == 0) ? in GetIntrinsic() 85 switch (GetType(method.d.data, true)) { in GetIntrinsic() 91 LOG(FATAL) << "Unknown/unsupported op size " << method.d.data; in GetIntrinsic() 95 switch (GetType(method.d.data, true)) { in GetIntrinsic() [all …]
|
D | graph_checker_test.cc | 47 static void TestCode(const uint16_t* data) { in TestCode() argument 50 HGraph* graph = CreateCFG(&allocator, data); in TestCode() 58 static void TestCodeSSA(const uint16_t* data) { in TestCodeSSA() argument 61 HGraph* graph = CreateCFG(&allocator, data); in TestCodeSSA() 74 const uint16_t data[] = ZERO_REGISTER_CODE_ITEM( in TEST() local 77 TestCode(data); in TEST() 81 const uint16_t data[] = ZERO_REGISTER_CODE_ITEM( in TEST() local 85 TestCode(data); in TEST() 89 const uint16_t data[] = ONE_REGISTER_CODE_ITEM( in TEST() local 95 TestCode(data); in TEST() [all …]
|
D | codegen_test.cc | 245 static void TestCode(const uint16_t* data, bool has_result = false, int32_t expected = 0) { in TestCode() argument 250 const DexFile::CodeItem* item = reinterpret_cast<const DexFile::CodeItem*>(data); in TestCode() 258 static void TestCodeLong(const uint16_t* data, bool has_result, int64_t expected) { in TestCodeLong() argument 263 const DexFile::CodeItem* item = reinterpret_cast<const DexFile::CodeItem*>(data); in TestCodeLong() 272 const uint16_t data[] = ZERO_REGISTER_CODE_ITEM(Instruction::RETURN_VOID); in TEST() local 273 TestCode(data); in TEST() 277 const uint16_t data[] = ZERO_REGISTER_CODE_ITEM( in TEST() local 281 TestCode(data); in TEST() 285 const uint16_t data[] = ZERO_REGISTER_CODE_ITEM( in TEST() local 290 TestCode(data); in TEST() [all …]
|
D | find_loops_test.cc | 30 static HGraph* TestCode(const uint16_t* data, ArenaAllocator* allocator) { in TestCode() argument 33 const DexFile::CodeItem* item = reinterpret_cast<const DexFile::CodeItem*>(data); in TestCode() 42 const uint16_t data[] = ONE_REGISTER_CODE_ITEM( in TEST() local 48 HGraph* graph = TestCode(data, &allocator); in TEST() 55 const uint16_t data[] = ONE_REGISTER_CODE_ITEM( in TEST() local 61 HGraph* graph = TestCode(data, &allocator); in TEST() 68 const uint16_t data[] = TWO_REGISTERS_CODE_ITEM( in TEST() local 77 HGraph* graph = TestCode(data, &allocator); in TEST() 84 const uint16_t data[] = ONE_REGISTER_CODE_ITEM( in TEST() local 94 HGraph* graph = TestCode(data, &allocator); in TEST() [all …]
|
D | constant_folding_test.cc | 32 static void TestCode(const uint16_t* data, in TestCode() argument 40 HGraph* graph = CreateCFG(&allocator, data, return_type); in TestCode() 88 const uint16_t data[] = TWO_REGISTERS_CODE_ITEM( in TEST() local 127 TestCode(data, in TEST() 146 const uint16_t data[] = THREE_REGISTERS_CODE_ITEM( in TEST() local 189 TestCode(data, in TEST() 212 const uint16_t data[] = THREE_REGISTERS_CODE_ITEM( in TEST() local 279 TestCode(data, in TEST() 298 const uint16_t data[] = THREE_REGISTERS_CODE_ITEM( in TEST() local 341 TestCode(data, in TEST() [all …]
|
/art/runtime/base/ |
D | histogram_test.cc | 68 Histogram<uint64_t>::CumulativeData data; in TEST() local 88 hist->CreateHistogram(&data); in TEST() 89 PerValue = hist->Percentile(0.50, data); in TEST() 95 Histogram<uint64_t>::CumulativeData data; in TEST() local 120 hist->CreateHistogram(&data); in TEST() 121 PerValue = hist->Percentile(0.50, data); in TEST() 126 hist->PrintConfidenceIntervals(stream, 0.99, data); in TEST() 162 Histogram<uint64_t>::CumulativeData data; in TEST() local 163 hist->CreateHistogram(&data); in TEST() 164 PerValue = hist->Percentile(0.50, data); in TEST() [all …]
|
D | histogram-inl.h | 156 inline void Histogram<Value>::PrintBins(std::ostream& os, const CumulativeData& data) const { in PrintBins() argument 158 for (size_t bin_idx = 0; bin_idx < data.freq_.size(); ++bin_idx) { in PrintBins() 159 if (bin_idx > 0 && data.perc_[bin_idx] == data.perc_[bin_idx - 1]) { in PrintBins() 163 os << GetRange(bin_idx) << ": " << data.freq_[bin_idx] << "\t" in PrintBins() 164 << data.perc_[bin_idx] * 100.0 << "%\n"; in PrintBins() 187 const CumulativeData& data) const { in PrintConfidenceIntervals() argument 195 << (interval * 100) << "% C.I. " << FormatDuration(Percentile(per_0, data) * kAdjust, unit, in PrintConfidenceIntervals() 197 << "-" << FormatDuration(Percentile(per_1, data) * kAdjust, unit, kFractionalDigits) << " " in PrintConfidenceIntervals() 225 inline double Histogram<Value>::Percentile(double per, const CumulativeData& data) const { in Percentile() argument 226 DCHECK_GT(data.perc_.size(), 0ull); in Percentile() [all …]
|
/art/runtime/ |
D | leb128.h | 31 static inline uint32_t DecodeUnsignedLeb128(const uint8_t** data) { in DecodeUnsignedLeb128() argument 32 const uint8_t* ptr = *data; in DecodeUnsignedLeb128() 52 *data = ptr; in DecodeUnsignedLeb128() 60 static inline int32_t DecodeUnsignedLeb128P1(const uint8_t** data) { in DecodeUnsignedLeb128P1() argument 61 return DecodeUnsignedLeb128(data) - 1; in DecodeUnsignedLeb128P1() 67 static inline int32_t DecodeSignedLeb128(const uint8_t** data) { in DecodeSignedLeb128() argument 68 const uint8_t* ptr = *data; in DecodeSignedLeb128() 96 *data = ptr; in DecodeSignedLeb128() 101 static inline uint32_t UnsignedLeb128Size(uint32_t data) { in UnsignedLeb128Size() argument 104 uint32_t x = 6 + 32 - CLZ(data | 1); in UnsignedLeb128Size() [all …]
|
D | memory_region_test.cc | 25 uint8_t data[n] = { 0, 1, 2, 3, 4, 5, 6, 7 }; in TEST() local 26 MemoryRegion region(&data, n); in TEST() 40 uint8_t data[n] = { 0, 0, 0, 0, 0, 0, 0, 0 }; in TEST() local 41 MemoryRegion region(&data, n); in TEST() 54 ASSERT_EQ(expected[i], data[i]); in TEST()
|
/art/compiler/dwarf/ |
D | headers.h | 47 size_t cie_header_start_ = writer.data()->size(); in WriteDebugFrameCIE() 71 writer.PushData(opcodes.data()); in WriteDebugFrameCIE() 73 writer.UpdateUint32(cie_header_start_, writer.data()->size() - cie_header_start_ - 4); in WriteDebugFrameCIE() 85 size_t fde_header_start = writer.data()->size(); in WriteDebugFrameFDE() 88 uint32_t cie_pointer = writer.data()->size() - cie_offset; in WriteDebugFrameFDE() 95 debug_frame_patches->push_back(writer.data()->size()); in WriteDebugFrameFDE() 106 writer.UpdateUint32(fde_header_start, writer.data()->size() - fde_header_start - 4); in WriteDebugFrameFDE() 116 size_t start = writer.data()->size(); in WriteDebugInfoCU() 121 size_t entries_offset = writer.data()->size(); in WriteDebugInfoCU() 122 writer.PushData(entries.data()); in WriteDebugInfoCU() [all …]
|
/art/tools/dexfuzz/src/dexfuzz/rawdex/ |
D | StringDataItem.java | 26 private String data; field in StringDataItem 36 data = new String(dataAsBytes, StandardCharsets.US_ASCII); in read() 37 if (size != data.length()) { in read() 56 file.writeDexUtf(data.getBytes(StandardCharsets.US_ASCII)); in write() 77 public void setString(String data) { in setString() argument 78 this.data = data; in setString() 86 return data; in getString()
|
/art/test/413-regalloc-regression/src/ |
D | Main.java | 18 private Object[] data; field in Main 22 data = new Object[4]; in Main() 28 data[i] = data[i + 1]; in removeElementAt() 30 data[--size] = null; in removeElementAt()
|
/art/runtime/quick/ |
D | inline_method_analyser.cc | 92 method->d.data = 0u; in AnalyseMethodCode() 156 InlineReturnArgData* data = &result->d.return_data; in AnalyseReturnMethod() local 157 data->arg = reg - arg_start; in AnalyseReturnMethod() 158 data->is_wide = (return_opcode == Instruction::RETURN_WIDE) ? 1u : 0u; in AnalyseReturnMethod() 159 data->is_object = (return_opcode == Instruction::RETURN_OBJECT) ? 1u : 0u; in AnalyseReturnMethod() 160 data->reserved = 0u; in AnalyseReturnMethod() 161 data->reserved2 = 0u; in AnalyseReturnMethod() 193 result->d.data = static_cast<uint64_t>(const_value); in AnalyseConstMethod() 246 InlineIGetIPutData* data = &result->d.ifield_data; in AnalyseIGetMethod() local 247 if (!ComputeSpecialAccessorInfo(field_idx, false, verifier, data)) { in AnalyseIGetMethod() [all …]
|