/art/test/913-heaps/ |
D | expected.txt | 3 root@root --(jni-local[id=1,tag=3000,depth=0,method=followReferences])--> 3000@0 [size=124, length=… 4 …0,depth=2,method=doFollowReferencesTestNonRoot,vreg=8,location= 31])--> 1@1000 [size=16, length=-1] 5 root@root --(stack-local[id=1,tag=3000,depth=5,method=run,vreg=2,location= 0])--> 3000@0 [size=124,… 6 root@root --(thread)--> 3000@0 [size=124, length=-1] 7 1001@0 --(superclass)--> 1000@0 [size=123456780000, length=-1] 8 1002@0 --(interface)--> 2001@0 [size=123456780004, length=-1] 9 1002@0 --(superclass)--> 1001@0 [size=123456780001, length=-1] 10 1@1000 --(class)--> 1000@0 [size=123456780000, length=-1] 11 1@1000 --(field@2)--> 2@1000 [size=16, length=-1] 12 1@1000 --(field@3)--> 3@1001 [size=24, length=-1] [all …]
|
/art/tools/dexfuzz/src/dexfuzz/rawdex/ |
D | RawDexFile.java | 91 if (mapItem.size != stringIds.size()) { in write() 92 Log.debug("Updating StringIDs List size: " + stringIds.size()); in write() 93 mapItem.size = stringIds.size(); in write() 94 header.stringIdsSize = stringIds.size(); in write() 98 if (mapItem.size != stringDatas.size()) { in write() 99 Log.debug("Updating StringDatas List size: " + stringDatas.size()); in write() 100 mapItem.size = stringDatas.size(); in write() 104 if (mapItem.size != methodIds.size()) { in write() 105 Log.debug("Updating MethodIDs List size: " + methodIds.size()); in write() 106 mapItem.size = methodIds.size(); in write() [all …]
|
D | StringDataItem.java | 25 private int size; field in StringDataItem 33 size = file.readUleb128(); in read() 34 if (size != 0) { in read() 35 dataAsBytes = file.readDexUtf(size); in read() 37 if (size != data.length()) { in read() 51 file.writeUleb128(size); in write() 52 if (size > 0) { in write() 69 public void setSize(int size) { in setSize() argument 70 this.size = size; in setSize() 74 return size; in getSize()
|
D | MapList.java | 29 public int size; field in MapList 44 size = file.readUInt(); in read() 47 mapItems = new ArrayList<MapItem>(size); in read() 48 for (int i = 0; i < size; i++) { in read() 69 for (int i = 0; i < mapItem.size; i++) { in read() 76 for (int i = 0; i < mapItem.size; i++) { in read() 83 for (int i = 0; i < mapItem.size; i++) { in read() 90 for (int i = 0; i < mapItem.size; i++) { in read() 97 for (int i = 0; i < mapItem.size; i++) { in read() 104 for (int i = 0; i < mapItem.size; i++) { in read() [all …]
|
D | EncodedArray.java | 22 public int size; field in EncodedArray 27 size = file.readUleb128(); in read() 28 if (size != 0) { in read() 29 values = new EncodedValue[size]; in read() 30 for (int i = 0; i < size; i++) { in read() 38 file.writeUleb128(size); in write() 39 if (size != 0) { in write() 48 if (size != 0) { in incrementIndex()
|
D | EncodedAnnotation.java | 23 public int size; field in EncodedAnnotation 29 size = file.readUleb128(); in read() 30 if (size != 0) { in read() 31 elements = new AnnotationElement[size]; in read() 32 for (int i = 0; i < size; i++) { in read() 41 file.writeUleb128(size); in write() 42 if (size != 0) { in write() 54 if (size != 0) { in incrementIndex()
|
D | TypeList.java | 22 public int size; field in TypeList 29 size = file.readUInt(); in read() 30 list = new TypeItem[size]; in read() 31 for (int i = 0; i < size; i++) { in read() 40 file.writeUInt(size); in write() 58 int checkSize = Math.min(size, other.size); in comesBefore() 66 if (size == other.size) { in comesBefore()
|
D | EncodedValue.java | 43 int size = 0; in read() local 47 size = 1; in read() 51 size = 0; // So we don't read into value. in read() 55 size = 0; // So we don't read into value. in read() 60 size = 0; in read() 64 size = valueArg + 1; in read() 68 if (size != 0) { in read() 69 value = new byte[size]; in read() 70 for (int i = 0; i < size; i++) { in read()
|
D | DebugInfoItem.java | 25 private int size; field in DebugInfoItem 28 public DebugInfoItem(int size) { in DebugInfoItem() argument 29 this.size = size; in DebugInfoItem() 35 data = new byte[size]; in read() 39 if (data[size - 1] != 0) { in read()
|
/art/compiler/utils/ |
D | swap_space.cc | 40 if (last_size != entry.size) { in DumpFreeMap() 41 last_size = entry.size; in DumpFreeMap() 45 << " size=" << std::dec << entry.free_by_start_entry->size; in DumpFreeMap() 56 DCHECK_NE(chunk.size, 0u); in InsertChunk() 59 free_by_size_.emplace(chunk.size, insert_result.first); in InsertChunk() 75 if (munmap(chunk.ptr, chunk.size) != 0) { in ~SwapSpace() 77 << static_cast<const void*>(chunk.ptr) << " size=" << chunk.size; in ~SwapSpace() 86 if (free_by_start.size() != free_by_size.size()) { in CollectFree() 87 LOG(FATAL) << "Size: " << free_by_start.size() << " vs " << free_by_size.size(); in CollectFree() 93 sum1 += entry.free_by_start_entry->size; in CollectFree() [all …]
|
/art/tools/ahat/src/main/com/android/ahat/heapdump/ |
D | Type.java | 76 private final int size; field in Type 83 int size(int refSize) { in size() method in Type 84 return size == 0 ? refSize : size; in size() 87 Type(String name, int size) { in Type() argument 89 this.size = size; in Type()
|
/art/test/906-iterate-heap/ |
D | expected.txt | 1 …size=8, length=-1}, {tag=2, class-tag=100, size=8, length=-1}, {tag=3, class-tag=100, size=8, leng… 2 …size=8, length=-1}, {tag=12, class-tag=110, size=8, length=-1}, {tag=13, class-tag=110, size=8, le…
|
/art/tools/ahat/src/main/com/android/ahat/ |
D | SizeTable.java | 54 doc.table(cols.toArray(new Column[cols.size()])); in table() 62 static void row(Doc doc, DocString left, Size size, Size base, DocString... values) { in row() argument 65 vals.add(DocString.size(size.getJavaSize(), false)); in row() 66 vals.add(DocString.delta(false, false, size.getJavaSize(), base.getJavaSize())); in row() 67 vals.add(DocString.size(size.getRegisteredNativeSize(), false)); in row() 69 size.getRegisteredNativeSize(), base.getRegisteredNativeSize())); in row() 70 vals.add(DocString.size(size.getSize(), false)); in row() 71 vals.add(DocString.delta(false, false, size.getSize(), base.getSize())); in row() 73 doc.row(vals.toArray(new DocString[vals.size()])); in row() 96 static void row(Doc doc, Size size, Size base, DocString... values) { in row() argument [all …]
|
/art/libelffile/elf/ |
D | xz_utils.cc | 51 lzma2Props.lzmaProps.reduceSize = src.size(); // Size of data that will be compressed. in XzCompress() 59 static SRes ReadImpl(const ISeqInStream* p, void* buf, size_t* size) { in XzCompress() 61 *size = std::min(*size, ctx->src_.size() - ctx->src_pos_); in XzCompress() 62 memcpy(buf, ctx->src_.data() + ctx->src_pos_, *size); in XzCompress() 63 ctx->src_pos_ += *size; in XzCompress() 66 static size_t WriteImpl(const ISeqOutStream* p, const void* buf, size_t size) { in XzCompress() 69 ctx->dst_->insert(ctx->dst_->end(), buffer, buffer + size); in XzCompress() 70 return size; in XzCompress() 94 DCHECK_EQ(decompressed.size(), src.size()); in XzCompress() 95 DCHECK_EQ(memcmp(decompressed.data(), src.data(), src.size()), 0); in XzCompress() [all …]
|
/art/runtime/gc/allocator/ |
D | rosalloc-inl.h | 31 inline ALWAYS_INLINE void* RosAlloc::Alloc(Thread* self, size_t size, size_t* bytes_allocated, in Alloc() argument 34 if (UNLIKELY(size > kLargeSizeThreshold)) { in Alloc() 35 return AllocLargeObject(self, size, bytes_allocated, usable_size, in Alloc() 40 m = AllocFromRun(self, size, bytes_allocated, usable_size, bytes_tl_bulk_allocated); in Alloc() 42 m = AllocFromRunThreadUnsafe(self, size, bytes_allocated, usable_size, in Alloc() 48 for (size_t i = 0; i < size; ++i) { in Alloc() 59 inline bool RosAlloc::CanAllocFromThreadLocalRun(Thread* self, size_t size) { in CanAllocFromThreadLocalRun() argument 60 if (UNLIKELY(!IsSizeForThreadLocal(size))) { in CanAllocFromThreadLocalRun() 64 size_t idx = SizeToIndexAndBracketSize(size, &bracket_size); in CanAllocFromThreadLocalRun() 78 inline void* RosAlloc::AllocFromThreadLocalRun(Thread* self, size_t size, in AllocFromThreadLocalRun() argument [all …]
|
/art/libartbase/base/ |
D | memory_region.cc | 26 CHECK_GT(from.size(), 0U); in CopyFrom() 27 CHECK_GE(this->size(), from.size()); in CopyFrom() 28 CHECK_LE(offset, this->size() - from.size()); in CopyFrom() 29 memmove(reinterpret_cast<void*>(begin() + offset), from.pointer(), from.size()); in CopyFrom()
|
D | bit_field.h | 35 static constexpr size_t size = kSize; variable 38 static_assert(size != 0u, "Invalid size."); 39 static_assert(size <= sizeof(uintptr_t) * kBitsPerByte, "Invalid size."); 40 static_assert(size + position <= sizeof(uintptr_t) * kBitsPerByte, "Invalid position + size."); 44 return (static_cast<uintptr_t>(value) & ~((kUintPtrTOne << size) - 1)) == 0; in IsValid() 49 return (kUintPtrTOne << size) - 1; in Mask() 55 return ((kUintPtrTOne << size) - 1) << position; in MaskInPlace() 66 return size; in BitSize() 77 return static_cast<T>((value >> position) & ((kUintPtrTOne << size) - 1)); in Decode()
|
D | arena_object.h | 33 void* operator new(size_t size, ArenaAllocator* allocator) { 34 return allocator->Alloc(size, kAllocKind); 37 static void* operator new(size_t size, ScopedArenaAllocator* allocator) { 38 return allocator->Alloc(size, kAllocKind); 57 void* operator new(size_t size, ArenaAllocator* allocator) { 58 return allocator->Alloc(size, kAllocKind); 61 static void* operator new(size_t size, ScopedArenaAllocator* allocator) { 62 return allocator->Alloc(size, kAllocKind);
|
D | array_ref.h | 61 template <size_t size> 62 explicit constexpr ArrayRef(T (&array)[size]) in ArrayRef() argument 63 : array_(array), size_(size) { in ArrayRef() 67 size_t size, 69 explicit constexpr ArrayRef(U (&array)[size]) in ArrayRef() argument 70 : array_(array), size_(size) { in ArrayRef() 73 constexpr ArrayRef(T* array, size_t size) in ArrayRef() argument 74 : array_(array), size_(size) { in ArrayRef() 81 : array_(v.data()), size_(v.size()) { in ArrayRef() 90 : array_(v.data()), size_(v.size()) { in ArrayRef() [all …]
|
/art/test/413-regalloc-regression/src/ |
D | Main.java | 19 private int size; field in Main 23 size = 0; in Main() 27 for (int i = index; i < size - 1; i++) { in removeElementAt() 30 data[--size] = null; in removeElementAt() 35 main.size++; in main() 37 if (main.size != 0) { in main()
|
/art/dex2oat/ |
D | dex2oat_image_test.cc | 274 size_t total_dex_files = full_bcp.size(); in TEST_F() 282 ASSERT_NE(std::string::npos, full_bcp[full_bcp.size() - 1u].find("conscrypt")); in TEST_F() 297 CHECK_EQ(1u, expanded_mid.size()); in TEST_F() 302 CHECK_EQ(1u, tail_dex_files.size()); in TEST_F() 305 CHECK_EQ(1u, expanded_tail.size()); in TEST_F() 375 ArrayRef<const std::string> single_dex_files = full_bcp.SubArray(/*pos=*/ head_dex_files.size()); in TEST_F() 386 CHECK_GE(single_dex_files.size(), 2u); in TEST_F() 392 CHECK_EQ(1u, expanded_single.size()); in TEST_F() 447 ASSERT_EQ(head_dex_files.size(), boot_image_spaces.size()); in TEST_F() 462 ASSERT_EQ(mid_bcp.size(), boot_image_spaces.size()); in TEST_F() [all …]
|
/art/libdexfile/dex/ |
D | compact_offset_table_test.cc | 45 EXPECT_LT(table_offset, data.size()); in TEST() 46 ASSERT_GT(data.size(), 0u); in TEST() 47 const size_t before_size = offsets.size() * sizeof(offsets.front()); in TEST() 48 EXPECT_LT(data.size(), before_size); in TEST() 54 std::vector<uint8_t> fake_dex(data.size() + kExtraOffset); in TEST() 58 for (size_t i = 0; i < offsets.size(); ++i) { in TEST() 70 EXPECT_LT(sorted_data.size(), data.size()); in TEST() 74 << " table size " << data.size() in TEST() 75 << " sorted table size " << sorted_data.size(); in TEST() 83 for (size_t i = 0; i < offsets.size(); ++i) { in TEST()
|
/art/runtime/interpreter/ |
D | cfi_asm_support.h | 48 #define CFI_DEF_CFA_BREG_PLUS_UCONST_1_1(reg, offset, size) .cfi_escape \ argument 52 0x23 /* DW_OP_plus_uconst */, size 54 #define CFI_DEF_CFA_BREG_PLUS_UCONST_1_2(reg, offset, size) .cfi_escape \ argument 59 ((size) & 0x7f) | 0x80, /* ULEB128 offset, byte 1 */ \ 60 ((size) >> 7) & 0x7f /* ULEB128 offset, byte 2 */ 80 #define CFI_DEF_CFA_BREG_PLUS_UCONST_1_1(reg, offset, size) argument 81 #define CFI_DEF_CFA_BREG_PLUS_UCONST_1_2(reg, offset, size) argument
|
/art/test/004-NativeAllocations/src-art/ |
D | Main.java | 51 int size = (int)(maxMem / 32); in checkRegisterNativeAllocation() local 58 runtime.registerNativeAllocation(size); in checkRegisterNativeAllocation() 59 total += size; in checkRegisterNativeAllocation() 76 runtime.registerNativeFree(size); in checkRegisterNativeAllocation() 77 total -= size; in checkRegisterNativeAllocation() 88 int size = (int)(maxMem / 5); in triggerBlockingRegisterNativeAllocation() local 93 runtime.registerNativeAllocation(size); in triggerBlockingRegisterNativeAllocation() 94 total += size; in triggerBlockingRegisterNativeAllocation() 98 runtime.registerNativeFree(size); in triggerBlockingRegisterNativeAllocation() 99 total -= size; in triggerBlockingRegisterNativeAllocation()
|
/art/test/080-oom-throw/src/ |
D | Main.java | 56 private static int exhaustJavaHeap(Object[] data, int index, int size) { in exhaustJavaHeap() argument 58 while (index != data.length && size != 0) { in exhaustJavaHeap() 60 data[index] = new byte[size]; in exhaustJavaHeap() 63 size /= 2; in exhaustJavaHeap() 71 int size = 1000000; in eatAllMemory() local 78 while (result == null && size != 0) { in eatAllMemory() 80 result = new Object[size]; in eatAllMemory() 82 size /= 2; in eatAllMemory() 88 index = exhaustJavaHeap(result, index, size); in eatAllMemory() 132 int size = 2 * 1024 * 1024; in blowup() local [all …]
|