Home
last modified time | relevance | path

Searched refs:min_size (Results 1 – 6 of 6) sorted by relevance

/art/compiler/optimizing/
Dnodes_shared.cc49 int min_size = std::min(result_size, input_size); in GetOpInfoFromInstruction() local
64 switch (min_size) { in GetOpInfoFromInstruction()
69 LOG(FATAL) << "Unexpected min size " << min_size; in GetOpInfoFromInstruction()
Dcode_generator_arm64.cc6030 int min_size = std::min(result_size, input_size); in VisitTypeConversion() local
6046 __ Sbfx(output, output.IsX() ? source.X() : source.W(), 0, min_size * kBitsPerByte); in VisitTypeConversion()
/art/compiler/utils/
Dswap_space.cc147 SwapSpace::SpaceChunk SwapSpace::NewFileChunk(size_t min_size) { in NewFileChunk() argument
149 size_t next_part = std::max(RoundUp(min_size, kPageSize), RoundUp(kMininumMapSize, kPageSize)); in NewFileChunk()
158 LOG(ERROR) << "Current size: " << size_ << " requested: " << next_part << "/" << min_size; in NewFileChunk()
168 UNUSED(min_size, kMininumMapSize); in NewFileChunk()
Dswap_space.h92 SpaceChunk NewFileChunk(size_t min_size) REQUIRES(lock_);
/art/libartbase/base/
Dbit_vector.cc122 uint32_t min_size = (storage_size_ < src_storage_size) ? storage_size_ : src_storage_size; in Intersect() local
125 for (idx = 0; idx < min_size; idx++) { in Intersect()
221 unsigned int min_size = (storage_size_ > src_size) ? src_size : storage_size_; in Subtract() local
227 for (uint32_t idx = 0; idx < min_size; idx++) { in Subtract()
/art/runtime/native/
Djava_lang_Class.cc384 size_t min_size = (length < field_length) ? length : field_length; in FindFieldByName() local
385 result = memcmp(field.GetName(), data_compressed, min_size); in FindFieldByName()