/art/runtime/arch/arm64/ |
H A D | memcmp16_arm64.S | 30 #define limit x2 define 51 cbz limit, .Lret0 52 lsl limit, limit, #1 /* Half-words to bytes. */ 58 add limit_wd, limit, #7 71 /* Not reached the limit, must have found a diff. */ 75 ands limit, limit, #7 78 lsl limit, limit, # [all...] |
H A D | fault_handler_arm64.cc | 129 uint8_t* limit = ptr1 - 80; // Compiler will hoist to a max of 20 instructions. local 131 while (ptr1 > limit) {
|
/art/runtime/arch/arm/ |
H A D | fault_handler_arm.cc | 151 uint8_t* limit = ptr1 - 40; // Compiler will hoist to a max of 20 instructions. local 153 while (ptr1 > limit) {
|
/art/runtime/arch/x86/ |
H A D | thread_x86.cc | 34 unsigned limit: 4, avl: 1, l: 1, d: 1, g: 1, base2: 8; member in struct:descriptor_table_entry_t 48 const size_t limit = kPageSize; local 62 entry.limit0 = (limit & 0x0ffff); 63 entry.limit = (limit & 0xf0000) >> 16; 101 ldt_entry.limit = limit;
|
H A D | fault_handler_x86.cc | 353 uint8_t* limit = pc - 100; // Compiler will hoist to a max of 20 instructions. local 356 while (ptr > limit) {
|
/art/runtime/gc/space/ |
H A D | large_object_space_test.cc | 71 size_t limit = !phase ? requests.size() / 2 : 0; local 72 while (requests.size() > limit) {
|
H A D | valgrind_malloc_space-inl.h | 97 byte* end, byte* limit, size_t growth_limit, 100 S(name, mem_map, allocator, begin, end, limit, growth_limit, can_move_objects, starting_size, 95 ValgrindMallocSpace(const std::string& name, MemMap* mem_map, A allocator, byte* begin, byte* end, byte* limit, size_t growth_limit, size_t initial_size, bool can_move_objects, size_t starting_size) argument
|
H A D | bump_pointer_space.cc | 45 BumpPointerSpace::BumpPointerSpace(const std::string& name, byte* begin, byte* limit) argument 46 : ContinuousMemMapAllocSpace(name, nullptr, begin, begin, limit, 48 growth_end_(limit),
|
H A D | malloc_space.cc | 39 byte* begin, byte* end, byte* limit, size_t growth_limit, 42 : ContinuousMemMapAllocSpace(name, mem_map, begin, end, limit, kGcRetentionPolicyAlwaysCollect), 81 LOG(ERROR) << "Failed to create alloc space (" << name << ") where the growth limit capacity (" 87 // Page align growth limit and capacity which will be used to manage mmapped storage 224 << ",limit=" << reinterpret_cast<void*>(Limit()) 38 MallocSpace(const std::string& name, MemMap* mem_map, byte* begin, byte* end, byte* limit, size_t growth_limit, bool create_bitmaps, bool can_move_objects, size_t starting_size, size_t initial_size) argument
|
H A D | dlmalloc_space.cc | 39 byte* end, byte* limit, size_t growth_limit, 42 : MallocSpace(name, mem_map, begin, end, limit, growth_limit, true, can_move_objects, 93 // size of the large allocation) will be greater than the footprint limit. 153 byte* limit, size_t growth_limit, 155 return new DlMallocSpace(name, mem_map, allocator, begin, end, limit, growth_limit, 38 DlMallocSpace(const std::string& name, MemMap* mem_map, void* mspace, byte* begin, byte* end, byte* limit, size_t growth_limit, bool can_move_objects, size_t starting_size, size_t initial_size) argument 151 CreateInstance(const std::string& name, MemMap* mem_map, void* allocator, byte* begin, byte* end, byte* limit, size_t growth_limit, bool can_move_objects) argument
|
H A D | rosalloc_space.cc | 46 byte* limit, size_t growth_limit, bool can_move_objects, 48 : MallocSpace(name, mem_map, begin, end, limit, growth_limit, true, can_move_objects, 104 // size of the large allocation) will be greater than the footprint limit. 167 byte* begin, byte* end, byte* limit, size_t growth_limit, 170 begin, end, limit, growth_limit, can_move_objects, starting_size_, 44 RosAllocSpace(const std::string& name, MemMap* mem_map, art::gc::allocator::RosAlloc* rosalloc, byte* begin, byte* end, byte* limit, size_t growth_limit, bool can_move_objects, size_t starting_size, size_t initial_size, bool low_memory_mode) argument 166 CreateInstance(const std::string& name, MemMap* mem_map, void* allocator, byte* begin, byte* end, byte* limit, size_t growth_limit, bool can_move_objects) argument
|
H A D | space.h | 269 void SetLimit(byte* limit) { argument 270 limit_ = limit; 305 byte* begin, byte* end, byte* limit) : 306 Space(name, gc_retention_policy), begin_(begin), end_(end), limit_(limit) { 353 // Size of the space without a limit on its growth. By default this is just the Capacity, but 372 MemMapSpace(const std::string& name, MemMap* mem_map, byte* begin, byte* end, byte* limit, argument 374 : ContinuousSpace(name, gc_retention_policy, begin, end, limit), 429 byte* end, byte* limit, GcRetentionPolicy gc_retention_policy) 430 : MemMapSpace(name, mem_map, begin, end, limit, gc_retention_policy) { 304 ContinuousSpace(const std::string& name, GcRetentionPolicy gc_retention_policy, byte* begin, byte* end, byte* limit) argument 428 ContinuousMemMapAllocSpace(const std::string& name, MemMap* mem_map, byte* begin, byte* end, byte* limit, GcRetentionPolicy gc_retention_policy) argument
|
/art/compiler/utils/x86_64/ |
H A D | assembler_x86_64.h | 50 int64_t limit = static_cast<int64_t>(1) << 31; local 51 return (-limit <= value_) && (value_ < limit);
|
/art/runtime/base/ |
H A D | histogram-inl.h | 68 const size_t limit = frequency_.size() / 2; local 70 for (size_t i = 0; i < limit; ++i) { 74 while (frequency_.size() > limit) {
|
/art/compiler/ |
H A D | common_compiler_test.cc | 255 uintptr_t limit = RoundUp(data + code_length, kPageSize); local 256 uintptr_t len = limit - base;
|
/art/runtime/ |
H A D | utils.h | 118 word limit = static_cast<word>(1) << (N - 1); local 119 return (-limit <= value) && (value < limit); 125 word limit = static_cast<word>(1) << N; local 126 return (0 <= value) && (value < limit); 321 // Returns a human-readable time string which prints every nanosecond while trying to limit the 431 // implementation-defined limit.
|
H A D | mem_map.cc | 205 uintptr_t limit = expected + byte_count; local 225 CheckNonOverlapping(expected, limit, &error_detail); 401 uintptr_t limit = expected + byte_count; local 402 DCHECK(ContainedWithinExistingMap(expected, limit, error_msg));
|
H A D | dex_file_verifier.cc | 221 bool DexFileVerifier::CheckIndex(uint32_t field, uint32_t limit, const char* label) { argument 222 if (UNLIKELY(field >= limit)) { 223 ErrorStringPrintf("Bad index for %s: %x >= %x", label, field, limit);
|
/art/compiler/utils/ |
H A D | assembler.h | 258 if (buffer->cursor() >= buffer->limit()) { 264 // limit implied by the minimum gap size. 299 if (buffer->cursor() >= buffer->limit()) buffer->ExtendCapacity(); 314 // The limit is set to kMinimumGap bytes before the end of the data area. 331 byte* limit() const { return limit_; } function in class:art::AssemblerBuffer 341 // Compute the limit based on the data area and the capacity. See
|
/art/runtime/gc/collector/ |
H A D | semi_space.cc | 448 const byte* limit = byte_src + size; local 457 while (byte_src + kPageSize < limit) { 476 memcpy(byte_dest, byte_src, limit - byte_src);
|
/art/runtime/gc/ |
H A D | heap.cc | 165 /* For GC a lot mode, we limit the allocations stacks to be kGcAlotInterval allocations. This 167 * verification is enabled, we limit the size of allocation stacks to speed up their 2026 mirror::Object** limit = stack->End(); local 2027 for (mirror::Object** it = stack->Begin(); it != limit; ++it) { 2890 // We also check that the bytes allocated aren't over the footprint limit in order to prevent a
|