Searched refs:size (Results 151 - 175 of 559) sorted by relevance

1234567891011>>

/art/runtime/
H A Delf_file.h70 bool GetSectionOffsetAndSize(const char* section_name, uint64_t* offset, uint64_t* size) const;
78 bool GetLoadedSize(size_t* size, std::string* error_msg) const;
H A Dexec_utils.cc35 CHECK_GE(arg_vector.size(), 1U) << command_line;
40 for (size_t i = 0; i < arg_vector.size(); ++i) {
H A Dvdex_file.h139 size_t size = sizeof(VerifierDepsHeader); local
141 size += header.GetVerifierDepsSize();
142 size += header.GetSizeOfChecksumsSection();
144 size += GetDexSectionHeader().GetDexSectionSize();
145 size += GetDexSectionHeader().GetQuickeningInfoSize();
147 return size;
/art/runtime/gc/space/
H A Dmalloc_space.cc80 LOG(ERROR) << "Failed to create alloc space (" << name << ") where the initial size ("
100 LOG(ERROR) << "Failed to allocate pages for alloc space (" << name << ") of size "
155 size_t size = -increment; local
156 CheckedCall(madvise, GetName(), new_end, size, MADV_DONTNEED);
157 CheckedCall(mprotect, GetName(), new_end, size, PROT_NONE);
176 size_t size = RoundUp(Size(), kPageSize); local
179 // Remaining size is for the new alloc space.
180 const size_t growth_limit = growth_limit_ - size;
182 const size_t capacity = NonGrowthLimitCapacity() - size;
185 << "Size " << size << "\
[all...]
/art/compiler/debug/dwarf/
H A Dwriter.h132 DCHECK_LT(offset + 3, data_->size());
140 DCHECK_LT(offset + 7, data_->size());
152 DCHECK_LE(offset + UnsignedLeb128Size(value), data_->size());
162 data_->resize(RoundUp(data_->size(), alignment), 0);
169 size_t size() const { function in class:art::dwarf::Writer
170 return data_->size();
/art/compiler/driver/
H A Dcompiled_method_storage.cc39 void* storage = allocator.allocate(LengthPrefixedArray<T>::ComputeSize(array.size()));
40 LengthPrefixedArray<T>* array_copy = new(storage) LengthPrefixedArray<T>(array.size());
48 size_t size = LengthPrefixedArray<T>::ComputeSize(array->size()); local
50 allocator.deallocate(const_cast<uint8_t*>(reinterpret_cast<const uint8_t*>(array)), size);
87 uint32_t len = sizeof(ContentType) * array.size();
/art/libartbase/base/
H A Dtransform_array_ref.h106 size_type size() const { return base().size(); } function in class:art::TransformArrayRef
165 return lhs.size() == rhs.size() && std::equal(lhs.begin(), lhs.end(), rhs.begin());
184 ArrayRef<typename Container::value_type>(container.data(), container.size()), f);
191 ArrayRef<const typename Container::value_type>(container.data(), container.size()), f);
H A Dhash_set_test.cc94 ASSERT_EQ(strings.size(), hash_set.Size());
164 for (size_t i = 0; i < strings.size(); ++i) {
165 // Insert some strings into the beginning of our hash set to establish an initial size
231 ASSERT_EQ(hash_set.Size(), std_set.size());
241 // Skew towards adding elements until we are at the desired size.
339 for (size_t size : sizes) {
340 hash_set.Reserve(size);
343 CHECK_GE(hash_set.ElementsUntilExpand(), size);
344 // Try inserting elements until we are at our reserve size and ensure the hash set did not
346 while (hash_set.Size() < size) {
352 constexpr size_t size = 100; local
[all...]
/art/runtime/jit/
H A Ddebugger_interface.cc116 static_assert(sizeof(std::atomic_uint32_t) == sizeof(uint32_t), "Weird size");
118 static_assert(sizeof(std::atomic<void*>) == sizeof(void*), "Weird size");
168 entry->symfile_size_ = symfile.size();
262 DCHECK_NE(symfile.size(), 0u);
265 uint8_t* copy = new uint8_t[symfile.size()];
267 memcpy(copy, symfile.data(), symfile.size());
272 ArrayRef<const uint8_t>(copy, symfile.size()));
300 return __jit_debug_mem_usage + __jit_debug_entries.size() * 2 * sizeof(void*);
H A Dprofile_compilation_info.cc75 "InlineCache::kIndividualCacheSize does not have the expect type size");
122 if (classes.size() + 1 >= InlineCache::kIndividualCacheSize) {
142 DCHECK(last_sep_index < dex_location.size());
279 int64_t size = OS::GetFileSizeBytes(filename.c_str());
280 if (size != -1) {
283 << size;
285 *bytes_written = static_cast<uint64_t>(size);
321 2 * sizeof(uint16_t) + // class_set.size + dex_location.size
322 3 * sizeof(uint32_t); // method_map.size
[all...]
/art/compiler/optimizing/
H A Dgraph_checker.cc51 return block->GetPredecessors().size() == 1u &&
196 if (block->GetSuccessors().size() > 1) {
201 if (successor->GetPredecessors().size() > 1) {
302 for (size_t i = 0, e = handlers.size(); i < e; ++i) {
387 if ((use_index >= user_inputs.size()) || (user_inputs[use_index] != instruction)) {
411 for (size_t i = 0; i < input_records.size(); ++i) {
579 if (loop_information->GetPreHeader()->GetSuccessors().size() != 1) {
584 loop_information->GetPreHeader()->GetSuccessors().size()));
601 size_t num_preds = loop_header->GetPredecessors().size();
614 for (size_t i = 1, e = loop_header->GetPredecessors().size();
[all...]
H A Dparallel_move_resolver.cc43 for (size_t i = 0; i < moves_.size(); ++i) {
56 for (size_t i = 0; i < moves_.size(); ++i) {
67 for (size_t i = 0; i < moves_.size(); ++i) {
147 for (size_t i = 0; i < moves_.size(); ++i) {
313 for (size_t i = 0; i < moves_.size(); ++i) {
326 for (size_t i = 0; i < moves_.size(); ++i) {
346 for (size_t i = 0; i < moves_.size(); ++i) {
434 for (size_t i = 0; i < moves_.size(); ++i) {
459 // We only care about the move size.
491 // Note: Fetch size() o
[all...]
/art/dexlayout/
H A Ddex_writer.cc192 stream->WriteUleb128(values->size());
200 stream->WriteUleb128(annotation->GetAnnotationElements()->size());
282 uint32_t size[1]; local
287 size[0] = type_list->GetTypeList()->size();
289 stream->Write(size, sizeof(uint32_t));
384 uint32_t size[1]; local
390 size[0] = annotation_set->GetItems()->size();
392 stream->Write(size, sizeo
404 uint32_t size[1]; local
507 uint32_t size = handlers->HasCatchAll() ? (handlers->GetHandlers()->size() - 1) * -1 : local
[all...]
/art/compiler/linker/arm64/
H A Drelative_patcher_arm64.cc107 if (reserved_adrp_thunks_ != adrp_thunk_locations_.size()) {
108 size_t num_adrp_thunks = adrp_thunk_locations_.size() - reserved_adrp_thunks_;
111 reserved_adrp_thunks_ = adrp_thunk_locations_.size();
124 uint32_t max_extra_space = MaxExtraSpace(num_adrp, code.size());
133 uint32_t thunk_offset = compiled_method->AlignCode(quick_code_offset + code.size());
152 if (reserved_adrp_thunks_ != adrp_thunk_locations_.size()) {
153 size_t num_adrp_thunks = adrp_thunk_locations_.size() - reserved_adrp_thunks_;
156 reserved_adrp_thunks_ = adrp_thunk_locations_.size();
167 CHECK_ALIGNED(current_method_thunks_.size(), kAdrpThunkSize);
168 size_t num_thunks = current_method_thunks_.size() / kAdrpThunkSiz
[all...]
/art/dex2oat/linker/
H A Doat_writer.cc272 return method_offsets_.size() * sizeof(method_offsets_[0]);
296 return class_offsets_.size() * sizeof(class_offsets_[0]);
305 // Dex file size. Passed in the constructor, but could be
462 LOG(ERROR) << "Dex file header specifies file size insufficient to contain the header."
606 if (data.size() < sizeof(DexFile::Header)) {
607 LOG(ERROR) << "Provided data is shorter than dex file header. size: "
608 << data.size() << " File: " << location;
615 if (data.size() < header->file_size_) {
616 LOG(ERROR) << "Truncated dex file data. Data size: " << data.size()
4158 WriteUpTo16BytesAlignment(OutputStream* out, uint32_t size, uint32_t* stat) argument
[all...]
/art/runtime/native/
H A Dsun_misc_Unsafe.cc303 jlong dst, jlong size) {
304 if (size == 0) {
307 // size is nonnegative and fits into size_t
308 if (size < 0 || size != (jlong)(size_t) size) {
312 size_t sz = (size_t)size;
320 size_t size)
323 size_t sz = size / sizeof(T);
334 size_t size)
302 Unsafe_copyMemory(JNIEnv *env, jobject unsafe ATTRIBUTE_UNUSED, jlong src, jlong dst, jlong size) argument
344 Unsafe_copyMemoryToPrimitiveArray(JNIEnv *env, jobject unsafe ATTRIBUTE_UNUSED, jlong srcAddr, jobject dstObj, jlong dstOffset, jlong size) argument
375 Unsafe_copyMemoryFromPrimitiveArray(JNIEnv *env, jobject unsafe ATTRIBUTE_UNUSED, jobject srcObj, jlong srcOffset, jlong dstAddr, jlong size) argument
[all...]
/art/cmdline/
H A Dtoken_range.h155 // The size of the range, i.e. how many tokens are in it.
172 // Equality is defined as having both the same size, and
310 new_token_list.push_back(string.substr(next_token_idx, tok.size()));
312 string_idx += tok.size();
315 size_t remaining = string.size() - string_idx;
338 // wildcard present). 0 means no match. If the size() tokens are returned.
385 if (larger.size() >= smaller.size()) {
413 assert(token_list_->size() > token_list->size()
[all...]
/art/test/906-iterate-heap/src/art/
H A DTest906.java215 long size; field in class:Test906.HeapElem
226 if (size != other.size) {
227 return Long.compare(size, other.size);
233 return "{tag=" + tag + ", class-tag=" + classTag + ", size=" +
234 (tag >= 100 ? "<class>" : size) // Class size is dependent on 32-bit vs 64-bit,
246 elem.size = sizes[i];
/art/tools/ahat/src/main/com/android/ahat/heapdump/
H A DAhatInstance.java58 // mRetainedSizes - retained size indexed by heap index.
98 * The returned size is a shallow size for the object that does not include
101 * @return the shallow size of the object
109 * beyond the standard instance size as recorded by the class of this
112 * For example, class objects will have extra size for static fields and
113 * array objects will have extra size for the array elements.
119 * The returned size includes the shallow size of this object and the size
154 addRegisteredNativeSize(long size) argument
496 public long size; field in class:AhatInstance.RegisteredNativeAllocation
[all...]
/art/tools/dexfuzz/src/dexfuzz/program/
H A DProgram.java229 int mutatableCodeIdx = mutatableCodes.size();
411 int mutatorIdx = rng.nextInt(mutators.size());
452 if (methodsToMutate > mutatableCodes.size()) {
453 methodsToMutate = mutatableCodes.size();
457 if (methodsToMutate == mutatableCodes.size()) {
470 while (mutatedCodes.size() < methodsToMutate) {
471 int randomMethodIdx = rng.nextInt(mutatableCodes.size());
571 return rawDexFile.typeIds.size();
573 return rawDexFile.fieldIds.size();
575 return rawDexFile.stringIds.size();
[all...]
/art/libartbase/base/unix_file/
H A Dfd_file.cc309 bool FdFile::Copy(FdFile* input_file, int64_t offset, int64_t size) { argument
312 off_t sz = static_cast<off_t>(size);
314 size < 0 || static_cast<int64_t>(sz) != size ||
319 if (size == 0) {
338 const size_t buffer_size = std::min<uint64_t>(size, kMaxBufferSize);
344 while (size != 0) {
345 size_t chunk_size = std::min<uint64_t>(buffer_size, size);
350 size -= chunk_size;
/art/openjdkjvmti/
H A Djvmti_weak_table-inl.h255 size(0),
263 size = 0;
271 size = 0;
283 memcpy(tmp, data, sizeof(Storage) * size);
292 if (size == capacity) {
296 data[size++] = elem;
301 size_t size; member in struct:openjdkjvmti::JvmtiWeakTable::ReleasableContainer
339 initial_object_size = (object_result_ptr != nullptr) ? tagged_objects_.size() : 0;
340 initial_tag_size = (tag_result_ptr != nullptr) ? tagged_objects_.size() : 0;
H A Dti_class_definition.cc111 return current_dex_file_.size() != dex_data_.size() ||
112 memcmp(current_dex_file_.data(), dex_data_.data(), current_dex_file_.size()) != 0;
126 name_ = descriptor.substr(1, descriptor.size() - 2);
156 memcpy(dex_data->data(), orig_dex_bytes->GetData(), dex_data->size());
288 // unfortunate. Since currently the size is just a guess though we might as well try to do it
303 current_dex_memory_.resize(dex_data_.size());
304 memcpy(current_dex_memory_.data(), dex_data_.data(), current_dex_memory_.size());
323 memcpy(dex_data_memory_.data(), orig_dex->GetData(), dex_data_memory_.size());
366 name_ = descriptor_str.substr(1, descriptor_str.size()
[all...]
/art/runtime/hprof/
H A Dhprof.cc292 size_t length_; // Current record size.
316 DCHECK_EQ(length_, buffer_.size());
321 DCHECK_EQ(length_, buffer_.size());
334 DCHECK_EQ(length_, buffer_.size());
344 DCHECK_EQ(length_, buffer_.size());
356 DCHECK_EQ(length_, buffer_.size());
372 DCHECK_EQ(buffer_.size(), length_);
424 size_t old_size = full_data_.size();
454 // First pass to measure the size of the dump.
666 // U4: size o
921 size_t size; local
1220 size_t size = 0; local
1443 size_t size; local
1491 size_t size; local
[all...]
/art/compiler/
H A Dcfi_test.h56 dwarf::WriteFDE(is64bit, 0, 0, 0, actual_asm.size(), ArrayRef<const uint8_t>(actual_cfi),
61 const uint8_t* asm_end = asm_base + actual_asm.size();
72 disasm->Dump(stream, base, base + actual_asm.size());
117 address = "0x" + line.substr(line.size() - 8);
146 for (size_t i = 0; i < data.size(); i++) {

Completed in 932 milliseconds

1234567891011>>