Home
last modified time | relevance | path

Searched refs:size (Results 1 – 25 of 507) sorted by relevance

12345678910>>...21

/art/test/913-heaps/
Dexpected.txt3 root@root --(jni-local[id=1,tag=3000,depth=0,method=followReferences])--> 3000@0 [size=136, length=…
4 …,depth=2,method=doFollowReferencesTestNonRoot,vreg=13,location= 32])--> 1@1000 [size=16, length=-1]
5 …ag=3000,depth=3,method=doFollowReferencesTest,vreg=1,location= 28])--> 3000@0 [size=136, length=-1]
6 root@root --(stack-local[id=1,tag=3000,depth=5,method=run,vreg=2,location= 0])--> 3000@0 [size=136,…
7 root@root --(thread)--> 3000@0 [size=136, length=-1]
8 1001@0 --(superclass)--> 1000@0 [size=123, length=-1]
9 1002@0 --(interface)--> 2001@0 [size=124, length=-1]
10 1002@0 --(superclass)--> 1001@0 [size=123, length=-1]
11 1@1000 --(class)--> 1000@0 [size=123, length=-1]
12 1@1000 --(field@2)--> 2@1000 [size=16, length=-1]
[all …]
/art/tools/dexfuzz/src/dexfuzz/rawdex/
DRawDexFile.java91 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 …]
DMapList.java29 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 …]
DStringDataItem.java25 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()
DEncodedArray.java22 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()
DEncodedAnnotation.java23 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()
DTypeList.java22 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()
DEncodedValue.java43 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()
DEncodedCatchHandler.java22 public int size; field in EncodedCatchHandler
28 size = file.readSleb128(); in read()
29 int absoluteSize = Math.abs(size); in read()
32 for (int i = 0; i < Math.abs(size); i++) { in read()
36 if (size <= 0) { in read()
43 file.writeSleb128(size); in write()
49 if (size <= 0) { in write()
DDebugInfoItem.java25 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/
Dswap_space.cc39 if (last_size != entry.size) { in DumpFreeMap()
40 last_size = entry.size; in DumpFreeMap()
44 << " size=" << std::dec << entry.free_by_start_entry->size; in DumpFreeMap()
55 DCHECK_NE(chunk.size, 0u); in InsertChunk()
58 free_by_size_.emplace(chunk.size, insert_result.first); in InsertChunk()
74 if (munmap(chunk.ptr, chunk.size) != 0) { in ~SwapSpace()
76 << static_cast<const void*>(chunk.ptr) << " size=" << chunk.size; in ~SwapSpace()
85 if (free_by_start.size() != free_by_size.size()) { in CollectFree()
86 LOG(FATAL) << "Size: " << free_by_start.size() << " vs " << free_by_size.size(); in CollectFree()
92 sum1 += entry.free_by_start_entry->size; in CollectFree()
[all …]
/art/test/906-iterate-heap/
Dexpected.txt1 …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/runtime/gc/allocator/
Drosalloc-inl.h31 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 …]
Drosalloc.h516 static size_t BracketSizeToIndex(size_t size) { in BracketSizeToIndex() argument
517 DCHECK(8 <= size && in BracketSizeToIndex()
518 ((size <= kMaxThreadLocalBracketSize && size % kThreadLocalBracketQuantumSize == 0) || in BracketSizeToIndex()
519 (size <= kMaxRegularBracketSize && size % kBracketQuantumSize == 0) || in BracketSizeToIndex()
520 size == 1 * KB || size == 2 * KB)); in BracketSizeToIndex()
522 if (UNLIKELY(size == 1 * KB)) { in BracketSizeToIndex()
524 } else if (UNLIKELY(size == 2 * KB)) { in BracketSizeToIndex()
526 } else if (LIKELY(size <= kMaxThreadLocalBracketSize)) { in BracketSizeToIndex()
527 DCHECK_EQ(size % kThreadLocalBracketQuantumSize, 0U); in BracketSizeToIndex()
528 idx = size / kThreadLocalBracketQuantumSize - 1; in BracketSizeToIndex()
[all …]
/art/runtime/base/
Dbit_field.h34 static constexpr size_t size = kSize; variable
37 static_assert(size != 0u, "Invalid size.");
38 static_assert(size <= sizeof(uintptr_t) * kBitsPerByte, "Invalid size.");
39 static_assert(size + position <= sizeof(uintptr_t) * kBitsPerByte, "Invalid position + size.");
43 return (static_cast<uintptr_t>(value) & ~((kUintPtrTOne << size) - 1)) == 0; in IsValid()
48 return (kUintPtrTOne << size) - 1; in Mask()
54 return ((kUintPtrTOne << size) - 1) << position; in MaskInPlace()
65 return size; in BitSize()
76 return static_cast<T>((value >> position) & ((kUintPtrTOne << size) - 1)); in Decode()
Darena_object.h31 void* operator new(size_t size, ArenaAllocator* allocator) {
32 return allocator->Alloc(size, kAllocKind);
35 static void* operator new(size_t size, ScopedArenaAllocator* arena) {
36 return arena->Alloc(size, kAllocKind);
55 void* operator new(size_t size, ArenaAllocator* allocator) {
56 return allocator->Alloc(size, kAllocKind);
59 static void* operator new(size_t size, ScopedArenaAllocator* arena) {
60 return arena->Alloc(size, kAllocKind);
Darray_ref.h61 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()
81 : array_(v.data()), size_(v.size()) { in ArrayRef()
90 : array_(v.data()), size_(v.size()) { in ArrayRef()
127 size_type size() const { return size_; } in size() function
128 bool empty() const { return size() == 0u; } in empty()
[all …]
Dstringpiece.h54 : ptr_(str.data()), length_(str.size()) { } in StringPiece()
62 size_type size() const { return length_; } in size() function
107 return std::string(data(), size()); in as_string()
115 return std::string(data(), size()); in ToString()
152 const int r = memcmp(data(), rhs.data(), std::min(size(), rhs.size())); in Compare()
156 if (size() < rhs.size()) { in Compare()
158 } else if (size() > rhs.size()) { in Compare()
175 StringPiece::size_type len = x.size();
176 if (len != y.size()) {
202 return x.size() == 0;
[all …]
/art/test/413-regalloc-regression/src/
DMain.java19 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/test/080-oom-throw/src/
DMain.java58 int size = 1000000; in eatAllMemory() local
59 while (result == null && size != 0) { in eatAllMemory()
61 result = new Object[size]; in eatAllMemory()
63 size /= 2; in eatAllMemory()
68 while (index != result.length && size != 0) { in eatAllMemory()
70 result[index] = new byte[size]; in eatAllMemory()
73 size /= 2; in eatAllMemory()
117 int size = 2 * 1024 * 1024; in blowup() local
120 holder[i] = new char[size]; in blowup()
123 size = size / 16; in blowup()
[all …]
/art/dexlayout/
Ddex_verify.cc56 if (orig.size() != output.size()) { in VerifyIds()
58 "Mismatched size for %s section: %zu vs %zu.", section_name, orig.size(), output.size()); in VerifyIds()
61 for (size_t i = 0; i < orig.size(); ++i) { in VerifyIds()
187 if (orig.size() != output.size()) { in VerifyClassDefs()
189 "Mismatched size for class defs section: %zu vs %zu.", orig.size(), output.size()); in VerifyClassDefs()
195 for (size_t i = 0; i < orig.size(); ++i) { in VerifyClassDefs()
272 if (orig_list->size() != output_list->size()) { in VerifyTypeList()
275 for (size_t i = 0; i < orig_list->size(); ++i) { in VerifyTypeList()
327 if (orig->size() != output->size()) { in VerifyFieldAnnotations()
331 orig->size(), in VerifyFieldAnnotations()
[all …]
/art/runtime/base/unix_file/
Drandom_access_file_test.h76 … ASSERT_EQ(content.size(), static_cast<uint64_t>(file->Write(content.data(), content.size(), 0))); in TestRead()
84 const int buf_size = content.size() + 10; in TestReadContent()
90 ASSERT_EQ(content.size(), static_cast<uint64_t>(file->Read(buf.get(), buf_size, 0))); in TestReadContent()
91 ASSERT_EQ(std::string(buf.get(), content.size()), content); in TestReadContent()
95 ASSERT_LT(short_request, content.size()); in TestReadContent()
116 … ASSERT_EQ(content.size(), static_cast<uint64_t>(file->Write(content.data(), content.size(), 0))); in TestSetLength()
117 ASSERT_EQ(content.size(), static_cast<uint64_t>(file->GetLength())); in TestSetLength()
152 … ASSERT_EQ(content.size(), static_cast<uint64_t>(file->Write(content.data(), content.size(), 0))); in TestWrite()
153 ASSERT_EQ(content.size(), static_cast<uint64_t>(file->GetLength())); in TestWrite()
160 ASSERT_EQ(content.size(), static_cast<uint64_t>(file->Read(buf, sizeof(buf), 0))); in TestWrite()
[all …]
/art/compiler/debug/dwarf/
Dheaders.h49 size_t cie_header_start_ = writer.data()->size(); in WriteCIE()
75 writer.UpdateUint32(cie_header_start_, writer.data()->size() - cie_header_start_ - 4); in WriteCIE()
94 size_t fde_header_start = writer.data()->size(); in WriteFDE()
97 uint32_t cie_pointer = (buffer_address + buffer->size()) - cie_address; in WriteFDE()
106 code_address -= buffer_address + buffer->size(); in WriteFDE()
110 patch_locations->push_back(buffer_address + buffer->size() - section_address); in WriteFDE()
120 writer.PushData(opcodes.data(), opcodes.size()); in WriteFDE()
122 writer.UpdateUint32(fde_header_start, writer.data()->size() - fde_header_start - 4); in WriteFDE()
135 size_t start = writer.data()->size(); in WriteDebugInfoCU()
140 size_t entries_offset = writer.data()->size(); in WriteDebugInfoCU()
[all …]
/art/compiler/optimizing/
Dstack_map_stream.cc40 current_entry_.inline_infos_start_index = inline_infos_.size(); in BeginStackMapEntry()
44 current_entry_.dex_register_entry.locations_start_index = dex_register_locations_.size(); in BeginStackMapEntry()
82 size_t index = location_catalog_entries_.size(); in AddDexRegisterEntry()
122 current_inline_info_.dex_register_entry.locations_start_index = dex_register_locations_.size(); in BeginInlineInfoEntry()
152 encoding.location_catalog.num_entries = location_catalog_entries_.size(); in PrepareForFillIn()
154 encoding.inline_info.num_entries = inline_infos_.size(); in PrepareForFillIn()
166 encoding.stack_map.num_entries = stack_maps_.size(); in PrepareForFillIn()
176 DCHECK_EQ(code_info_encoding_.size(), 0u); in PrepareForFillIn()
180 DCHECK_EQ(encoding.HeaderSize(), code_info_encoding_.size()); in PrepareForFillIn()
181 needed_size_ = code_info_encoding_.size() + encoding.NonHeaderSize(); in PrepareForFillIn()
[all …]
/art/compiler/debug/
Delf_gnu_debugdata_writer.h47 static SRes ReadImpl(void* p, void* buf, size_t* size) { in XzCompress()
49 *size = std::min(*size, ctx->src_->size() - ctx->src_pos_); in XzCompress()
50 memcpy(buf, ctx->src_->data() + ctx->src_pos_, *size); in XzCompress()
51 ctx->src_pos_ += *size; in XzCompress()
54 static size_t WriteImpl(void* p, const void* buf, size_t size) { in XzCompress()
57 ctx->dst_->insert(ctx->dst_->end(), buffer, buffer + size); in XzCompress()
58 return size; in XzCompress()
103 compressed_buffer.reserve(buffer.size() / 4); in MakeMiniDebugInfoInternal()

12345678910>>...21