Searched refs:size (Results 1 - 25 of 350) sorted by relevance

1234567891011>>

/art/runtime/base/
H A Dstringprintf_test.cc24 size_t size = 0x00107e59; local
25 EXPECT_STREQ("00107e59", StringPrintf("%08zx", size).c_str());
26 EXPECT_STREQ("0x00107e59", StringPrintf("0x%08zx", size).c_str());
H A Darena_object.h30 // Allocate a new ArenaObject of 'size' bytes in the Arena.
31 void* operator new(size_t size, ArenaAllocator* allocator) { argument
32 return allocator->Alloc(size, kAllocKind);
35 static void* operator new(size_t size, ScopedArenaAllocator* arena) { argument
36 return arena->Alloc(size, kAllocKind);
51 // Allocate a new ArenaObject of 'size' bytes in the Arena.
52 void* operator new(size_t size, ArenaAllocator* allocator) { argument
53 return allocator->Alloc(size, kAllocKind);
56 static void* operator new(size_t size, ScopedArenaAllocator* arena) { argument
57 return arena->Alloc(size, kAllocKin
[all...]
H A Dbit_field.h29 template<typename T, int position, int size>
34 return (static_cast<uintptr_t>(value) & ~((kUintPtrTOne << size) - 1)) == 0;
39 return (kUintPtrTOne << size) - 1;
45 return ((kUintPtrTOne << size) - 1) << position;
54 // Returns the size of the bit field.
56 return size;
67 return static_cast<T>((value >> position) & ((kUintPtrTOne << size) - 1));
/art/runtime/
H A Dmemory_region.cc29 CHECK_GT(from.size(), 0U);
30 CHECK_GE(this->size(), from.size());
31 CHECK_LE(offset, this->size() - from.size());
33 from.pointer(), from.size());
H A Ddex_method_iterator_test.cc33 CHECK_NE(boot_class_path_.size(), 0U);
34 for (size_t i = 0; i < boot_class_path_.size(); ++i) {
/art/test/413-regalloc-regression/src/
H A DMain.java19 private int size; field in class:Main
23 size = 0;
27 for (int i = index; i < size - 1; i++) {
30 data[--size] = null;
35 main.size++;
37 if (main.size != 0) {
38 throw new Error("Unexpected size");
/art/tools/dexfuzz/src/dexfuzz/rawdex/
H A DRawDexFile.java86 // - but only update the items that we expect to have changed size.
91 if (mapItem.size != stringIds.size()) {
92 Log.debug("Updating StringIDs List size: " + stringIds.size());
93 mapItem.size = stringIds.size();
94 header.stringIdsSize = stringIds.size();
98 if (mapItem.size != stringDatas.size()) {
[all...]
H A DEncodedAnnotation.java23 public int size; field in class:EncodedAnnotation
29 size = file.readUleb128();
30 if (size != 0) {
31 elements = new AnnotationElement[size];
32 for (int i = 0; i < size; i++) {
41 file.writeUleb128(size);
42 if (size != 0) {
54 if (size != 0) {
H A DEncodedArray.java22 public int size; field in class:EncodedArray
27 size = file.readUleb128();
28 if (size != 0) {
29 values = new EncodedValue[size];
30 for (int i = 0; i < size; i++) {
38 file.writeUleb128(size);
39 if (size != 0) {
48 if (size != 0) {
H A DDebugInfoItem.java21 // Right now we are not parsing debug_info_item, just take the raw size
23 private int size; field in class:DebugInfoItem
26 public DebugInfoItem(int size) { argument
27 this.size = size;
33 data = new byte[size];
H A DEncodedCatchHandlerList.java22 public int size; field in class:EncodedCatchHandlerList
27 size = file.readUleb128();
28 list = new EncodedCatchHandler[size];
29 for (int i = 0; i < size; i++) {
36 file.writeUleb128(size);
H A DStringDataItem.java25 private int size; field in class:StringDataItem
33 size = file.readUleb128();
34 if (size != 0) {
35 dataAsBytes = file.readDexUtf(size);
37 if (size != data.length()) {
51 file.writeUleb128(size);
52 if (size > 0) {
69 public void setSize(int size) { argument
70 this.size = size;
[all...]
H A DEncodedCatchHandler.java22 public int size; field in class:EncodedCatchHandler
28 size = file.readSleb128();
29 int absoluteSize = Math.abs(size);
32 for (int i = 0; i < Math.abs(size); i++) {
36 if (size <= 0) {
43 file.writeSleb128(size);
49 if (size <= 0) {
H A DEncodedValue.java43 int size = 0;
47 size = 1;
51 size = 0; // So we don't read into value.
55 size = 0; // So we don't read into value.
60 size = 0;
63 // All others encode value_arg as (size - 1), so...
64 size = valueArg + 1;
68 if (size != 0) {
69 value = new byte[size];
70 for (int i = 0; i < size;
[all...]
H A DTypeList.java22 public int size; field in class:TypeList
29 size = file.readUInt();
30 list = new TypeItem[size];
31 for (int i = 0; i < size; i++) {
40 file.writeUInt(size);
58 int checkSize = Math.min(size, other.size);
66 if (size == other.size) {
H A DAnnotationSetItem.java22 public int size; field in class:AnnotationSetItem
29 size = file.readUInt();
30 entries = new AnnotationOffItem[size];
31 for (int i = 0; i < size; i++) {
40 file.writeUInt(size);
H A DAnnotationSetRefList.java22 public int size; field in class:AnnotationSetRefList
29 size = file.readUInt();
30 list = new AnnotationSetRefItem[size];
31 for (int i = 0; i < size; i++) {
40 file.writeUInt(size);
H A DMapList.java29 public int size; field in class:MapList
44 size = file.readUInt();
47 mapItems = new ArrayList<MapItem>(size);
48 for (int i = 0; i < size; i++) {
69 for (int i = 0; i < mapItem.size; i++) {
76 for (int i = 0; i < mapItem.size; i++) {
83 for (int i = 0; i < mapItem.size; i++) {
90 for (int i = 0; i < mapItem.size; i++) {
97 for (int i = 0; i < mapItem.size; i++) {
104 for (int i = 0; i < mapItem.size;
[all...]
/art/compiler/utils/
H A Dstack_checks.h37 static inline bool FrameNeedsStackCheck(size_t size, InstructionSet isa ATTRIBUTE_UNUSED) { argument
38 return size >= kLargeFrameSize;
H A Dswap_space.cc29 // The chunk size by which the swap file is increased and mapped.
43 << " size=" << std::dec << entry.second->size;
60 DCHECK_NE(chunk.size, 0u);
63 free_by_size->emplace(chunk.size, insert_result.first);
82 if (free_by_start.size() != free_by_size.size()) {
83 LOG(FATAL) << "Size: " << free_by_start.size() << " vs " << free_by_size.size();
89 sum1 += entry.second->size;
104 Alloc(size_t size) argument
163 Free(void* ptrV, size_t size) argument
[all...]
H A Darray_ref.h64 template <size_t size>
65 constexpr ArrayRef(T (&array)[size])
66 : array_(array), size_(size) {
69 template <typename U, size_t size>
70 constexpr ArrayRef(U (&array)[size],
73 : array_(array), size_(size) {
82 : array_(v.data()), size_(v.size()) {
89 : array_(v.data()), size_(v.size()) {
126 size_type size() const { return size_; } function in class:art::ArrayRef
127 bool empty() const { return size()
[all...]
/art/tools/dexfuzz/src/dexfuzz/fuzzers/
H A DFuzzerMultiple.java36 if (Options.inputFileList.size() > 1) {
37 int nextIndex = iterations % Options.inputFileList.size();
/art/runtime/gc/allocator/
H A Drosalloc-inl.h31 inline ALWAYS_INLINE void* RosAlloc::Alloc(Thread* self, size_t size, size_t* bytes_allocated, argument
34 if (UNLIKELY(size > kLargeSizeThreshold)) {
35 return AllocLargeObject(self, size, bytes_allocated, usable_size,
40 m = AllocFromRun(self, size, bytes_allocated, usable_size, bytes_tl_bulk_allocated);
42 m = AllocFromRunThreadUnsafe(self, size, bytes_allocated, usable_size,
48 for (size_t i = 0; i < size; ++i) {
65 inline bool RosAlloc::CanAllocFromThreadLocalRun(Thread* self, size_t size) { argument
66 if (UNLIKELY(!IsSizeForThreadLocal(size))) {
70 size_t idx = SizeToIndexAndBracketSize(size, &bracket_size);
71 DCHECK_EQ(idx, SizeToIndex(size));
89 AllocFromThreadLocalRun(Thread* self, size_t size, size_t* bytes_allocated) argument
113 MaxBytesBulkAllocatedFor(size_t size) argument
[all...]
H A Drosalloc.h115 // Represents a run of memory slots of the same size.
160 uint8_t size_bracket_idx_; // The index of the size bracket of this run.
180 // Returns the byte size of the header except for the bit maps.
183 size_t size = reinterpret_cast<uint8_t*>(&temp.alloc_bit_map_) - reinterpret_cast<uint8_t*>(&temp); local
184 DCHECK_EQ(size, static_cast<size_t>(8));
185 return size;
226 // Marks the slots to free in the bulk free bit map. Returns the bracket size.
262 // size.
274 // The number of size brackets. Sync this with the length of Thread::rosalloc_runs_.
276 // The number of smaller size bracket
301 BracketSizeToIndex(size_t size) argument
[all...]
/art/compiler/
H A Dvector_output_stream.cc24 : OutputStream(location), offset_(vector->size()), vector_(vector) {}
39 new_offset = vector_->size() + offset;

Completed in 521 milliseconds

1234567891011>>