| /art/runtime/ |
| D | indirect_reference_table-inl.h | 42 int idx = ExtractIndex(iref); in GetChecked() local
61 inline bool IndirectReferenceTable::CheckEntry(const char* what, IndirectRef iref, int idx) const { in CheckEntry()
78 uint32_t idx = ExtractIndex(iref); in Get() local
|
| D | dex_file_verifier.cc | 69 const char* DexFileVerifier::CheckLoadStringByIdx(uint32_t idx, const char* error_string) { in CheckLoadStringByIdx()
81 uint32_t idx = type_id.descriptor_idx_; in CheckLoadStringByTypeIdx() local
85 const DexFile::FieldId* DexFileVerifier::CheckLoadFieldId(uint32_t idx, const char* error_string) { in CheckLoadFieldId()
92 const DexFile::MethodId* DexFileVerifier::CheckLoadMethodId(uint32_t idx, const char* err_string) { in CheckLoadMethodId()
100 #define LOAD_STRING(var, idx, error) \ argument
114 #define LOAD_METHOD(var, idx, error_string, error_stmt) \ argument
121 #define LOAD_FIELD(var, idx, fmt, error_stmt) \ argument
447 bool DexFileVerifier::CheckClassDataItemField(uint32_t idx, uint32_t access_flags, in CheckClassDataItemField()
467 bool DexFileVerifier::CheckClassDataItemMethod(uint32_t idx, uint32_t access_flags, in CheckClassDataItemMethod()
563 uint32_t idx = ReadUnsignedLittleEndian(value_arg + 1); in CheckEncodedValue() local
[all …]
|
| D | reference_table.cc | 165 for (int idx = count - 1; idx >= first; --idx) { in Dump() local
223 for (size_t idx = 1; idx < count; idx++) { in Dump() local
|
| D | dex_file.h | 243 const TypeItem& GetTypeItem(uint32_t idx) const { in GetTypeItem()
458 const StringId& GetStringId(uint32_t idx) const { in GetStringId()
482 const char* StringDataAndUtf16LengthByIdx(uint32_t idx, uint32_t* utf16_length) const { in StringDataAndUtf16LengthByIdx()
491 const char* StringDataByIdx(uint32_t idx) const { in StringDataByIdx()
509 const TypeId& GetTypeId(uint32_t idx) const { in GetTypeId()
523 const char* StringByTypeIdx(uint32_t idx, uint32_t* unicode_length) const { in StringByTypeIdx()
528 const char* StringByTypeIdx(uint32_t idx) const { in StringByTypeIdx()
548 const FieldId& GetFieldId(uint32_t idx) const { in GetFieldId()
588 const MethodId& GetMethodId(uint32_t idx) const { in GetMethodId()
638 const ClassDef& GetClassDef(uint16_t idx) const { in GetClassDef()
[all …]
|
| D | indirect_reference_table.cc | 167 const int idx = ExtractIndex(iref); in Remove() local
|
| D | class_linker-inl.h | 206 inline mirror::DexCache* ClassLinker::GetDexCache(size_t idx) { in GetDexCache()
|
| /art/runtime/gc/allocator/ |
| D | rosalloc.cc | 312 size_t idx = pm_idx + 1; in FreePages() local
535 RosAlloc::Run* RosAlloc::AllocRun(Thread* self, size_t idx) { in AllocRun()
570 RosAlloc::Run* RosAlloc::RefillRun(Thread* self, size_t idx) { in RefillRun()
586 inline void* RosAlloc::AllocFromCurrentRunUnlocked(Thread* self, size_t idx) { in AllocFromCurrentRunUnlocked()
625 size_t idx = SizeToIndexAndBracketSize(size, &bracket_size); in AllocFromRunThreadUnsafe() local
644 size_t idx = SizeToIndexAndBracketSize(size, &bracket_size); in AllocFromRun() local
745 const size_t idx = run->size_bracket_idx_; in FreeFromRun() local
836 size_t idx = size_bracket_idx_; in Dump() local
854 const size_t idx = size_bracket_idx_; in AllocSlot() local
893 const byte idx = size_bracket_idx_; in FreeSlot() local
[all …]
|
| D | rosalloc.h | 286 static size_t IndexToBracketSize(size_t idx) { in IndexToBracketSize()
293 size_t idx; in BracketSizeToIndex() local
336 size_t idx = bracket_size / 16 - 1; in SizeToIndexAndBracketSize() local
342 size_t idx = kNumOfSizeBrackets - 2; in SizeToIndexAndBracketSize() local
349 size_t idx = kNumOfSizeBrackets - 1; in SizeToIndexAndBracketSize() local
577 bool IsFreePage(size_t idx) const { in IsFreePage()
|
| /art/runtime/base/ |
| D | bit_vector.cc | 144 uint32_t idx; in Intersect() local
185 for (uint32_t idx = 0; idx < src_size; idx++) { in Union() local
222 uint32_t idx = 0; in UnionIfNotIn() local
254 for (uint32_t idx = 0; idx < min_size; idx++) { in Subtract() local
289 uint32_t idx; in SetInitialBits() local
310 for (int idx = max - 1; idx >= 0; idx--) { in GetHighestBitSet() local
|
| D | histogram-inl.h | 106 for (size_t idx = 0; idx < kInitialBucketCount; idx++) { in Initialize() local
189 for (size_t idx = 0; idx < frequency_.size(); idx++) { in CreateHistogram() local
202 for (size_t idx = 0; idx < data.perc_.size(); idx++) { in Percentile() local
|
| D | histogram_test.cc | 234 for (uint64_t idx = 0ull; idx < 150ull; idx++) { in TEST() local
241 for (size_t idx = 0; idx < 200; idx++) { in TEST() local
257 for (uint64_t idx = 0ull; idx < 30ull; idx++) { in TEST() local
|
| D | timing_logger.h | 115 uint64_t GetTotalTime(size_t idx) { in GetTotalTime()
118 uint64_t GetExclusiveTime(size_t idx) { in GetExclusiveTime()
|
| D | bit_vector.h | 192 uint32_t GetRawStorageWord(size_t idx) const { return storage_[idx]; } in GetRawStorageWord()
|
| /art/runtime/mirror/ |
| D | iftable-inl.h | 28 const size_t idx = i * kMax + kInterface; in SetInterface() local
|
| /art/compiler/dex/ |
| D | ssa_transformation.cc | 141 for (uint32_t idx : bb->data_flow_info->def_v->Indexes()) { in FillDefBlockMatrix() local
447 unsigned int idx; in ComputeSuccLineIn() local
515 for (uint32_t idx : input_blocks->Indexes()) { in InsertPhiNodes() local
527 for (uint32_t idx : phi_blocks->Indexes()) { in InsertPhiNodes() local
565 int idx = 0; in InsertPhiNodeOperands() local
|
| D | dataflow_iterator-inl.h | 161 BasicBlockId idx = idx_; in Next() local
|
| D | mir_graph.cc | 321 for (uint32_t idx = 0; idx < handlers_size; idx++) { in ProcessTryCatchBlocks() local
896 int idx; in DumpCFG() local
1680 uint16_t idx = static_cast<uint16_t>(topological_order_->Size()); in ComputeTopologicalSortOrder() local
1752 uint16_t idx = static_cast<uint16_t>(topological_order_->Size()); in ComputeTopologicalSortOrder() local
1796 int idx; in HasSuspendTestBetween() local
2152 size_t idx = iterator.GetIndex() - 1; in UpdatePredecessor() local
|
| D | local_value_numbering_test.cc | 75 #define DEF_AGET(opcode, reg, obj, idx) \ argument
77 #define DEF_AGET_WIDE(opcode, reg, obj, idx) \ argument
79 #define DEF_APUT(opcode, reg, obj, idx) \ argument
81 #define DEF_APUT_WIDE(opcode, reg, obj, idx) \ argument
|
| D | frontend.cc | 579 for (unsigned int idx = 0; idx < cu.mir_graph->GetNumBlocks(); idx++) { in CanCompileMethod() local
|
| D | global_value_numbering_test.cc | 112 #define DEF_AGET(bb, opcode, reg, obj, idx) \ argument
114 #define DEF_AGET_WIDE(bb, opcode, reg, obj, idx) \ argument
116 #define DEF_APUT(bb, opcode, reg, obj, idx) \ argument
118 #define DEF_APUT_WIDE(bb, opcode, reg, obj, idx) \ argument
|
| /art/compiler/optimizing/ |
| D | ssa_liveness_analysis.cc | 190 for (uint32_t idx : live_in->Indexes()) { in ComputeLiveRanges() local
246 for (uint32_t idx : live_in->Indexes()) { in ComputeLiveRanges() local
|
| /art/runtime/verifier/ |
| D | method_verifier.cc | 609 for (uint32_t idx = 0; idx < tries_size; idx++) { in ScanTryCatchBlocks() local
632 for (uint32_t idx = 0; idx < handlers_size; idx++) { in ScanTryCatchBlocks() local
782 bool MethodVerifier::CheckRegisterIndex(uint32_t idx) { in CheckRegisterIndex()
791 bool MethodVerifier::CheckWideRegisterIndex(uint32_t idx) { in CheckWideRegisterIndex()
800 bool MethodVerifier::CheckFieldIndex(uint32_t idx) { in CheckFieldIndex()
809 bool MethodVerifier::CheckMethodIndex(uint32_t idx) { in CheckMethodIndex()
818 bool MethodVerifier::CheckNewInstance(uint32_t idx) { in CheckNewInstance()
833 bool MethodVerifier::CheckStringIndex(uint32_t idx) { in CheckStringIndex()
842 bool MethodVerifier::CheckTypeIndex(uint32_t idx) { in CheckTypeIndex()
851 bool MethodVerifier::CheckNewArray(uint32_t idx) { in CheckNewArray()
[all …]
|
| D | register_line.cc | 461 for (size_t idx = 0; idx < num_regs_; idx++) { in MergeRegisters() local
474 for (uint32_t idx = 0; idx < num_regs_; idx++) { in MergeRegisters() local
|
| D | method_verifier.h | 122 RegisterLine* GetLine(size_t idx) { in GetLine()
|
| /art/test/074-gc-thrash/src/ |
| D | Main.java | 168 int idx = 0; in run() local
|