Searched refs:min_size (Results 1 - 5 of 5) sorted by relevance
/art/compiler/optimizing/ |
H A D | nodes_arm64.cc | 43 int min_size = std::min(result_size, input_size); local 56 switch (min_size) { 61 LOG(FATAL) << "Unexpected min size " << min_size;
|
H A D | code_generator_arm64.cc | 4678 int min_size = std::min(result_size, input_size); 4696 __ Sbfx(output, output.IsX() ? source.X() : source.W(), 0, min_size * kBitsPerByte);
|
/art/compiler/utils/ |
H A D | swap_space.cc | 136 SwapSpace::SpaceChunk SwapSpace::NewFileChunk(size_t min_size) { argument 138 size_t next_part = std::max(RoundUp(min_size, kPageSize), RoundUp(kMininumMapSize, kPageSize)); 147 LOG(ERROR) << "Current size: " << size_ << " requested: " << next_part << "/" << min_size; local 157 UNUSED(min_size, kMininumMapSize);
|
H A D | swap_space.h | 81 SpaceChunk NewFileChunk(size_t min_size) REQUIRES(lock_);
|
/art/runtime/base/ |
H A D | bit_vector.cc | 86 // - Therefore, min_size goes up to at least that, we are thus comparing at least what we need to, but not less. 122 uint32_t min_size = (storage_size_ < src_storage_size) ? storage_size_ : src_storage_size; local 125 for (idx = 0; idx < min_size; idx++) { 221 unsigned int min_size = (storage_size_ > src_size) ? src_size : storage_size_; local 227 for (uint32_t idx = 0; idx < min_size; idx++) {
|
Completed in 102 milliseconds