/art/compiler/ |
H A D | common_compiler_test.cc | 250 uintptr_t limit = RoundUp(data + code_length, kPageSize); local 251 uintptr_t len = limit - base;
|
/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/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/arch/arm/ |
H A D | entrypoints_init_arm.cc | 121 extern "C" void art_quick_throw_array_bounds(int32_t index, int32_t limit);
|
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/arm64/ |
H A D | entrypoints_init_arm64.cc | 101 extern "C" void art_quick_throw_array_bounds(int32_t index, int32_t limit);
|
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) {
|
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...] |
/art/runtime/arch/mips/ |
H A D | entrypoints_init_mips.cc | 124 extern "C" void art_quick_throw_array_bounds(int32_t index, int32_t limit);
|
H A D | quick_entrypoints_mips.S | 390 jr $t9 # artThrowArrayBoundsFromCode(index, limit, Thread*, $sp)
|
/art/runtime/arch/x86/ |
H A D | entrypoints_init_x86.cc | 102 extern "C" void art_quick_throw_array_bounds(int32_t index, int32_t 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) {
|
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;
|
/art/runtime/arch/x86_64/ |
H A D | entrypoints_init_x86_64.cc | 103 extern "C" void art_quick_throw_array_bounds(int32_t index, int32_t 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/runtime/ |
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);
|
H A D | dex_file_verifier.h | 52 bool CheckIndex(uint32_t field, uint32_t limit, const char* label);
|
/art/runtime/gc/accounting/ |
H A D | atomic_stack.h | 194 bool AtomicPushBackInternal(const T& value, size_t limit) ALWAYS_INLINE { 201 if (UNLIKELY(static_cast<size_t>(index) >= limit)) {
|
/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 | 175 /* For GC a lot mode, we limit the allocations stacks to be kGcAlotInterval allocations. This 177 * verification is enabled, we limit the size of allocation stacks to speed up their 2084 mirror::Object** limit = stack->End(); local 2085 for (mirror::Object** it = stack->Begin(); it != limit; ++it) { 2955 // We also check that the bytes allocated aren't over the footprint limit in order to prevent a
|
/art/runtime/gc/space/ |
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 | bump_pointer_space.h | 77 // Removes the fork time growth limit on capacity, allowing the application to allocate up to the 129 BumpPointerSpace(const std::string& name, byte* begin, byte* limit);
|
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 | dlmalloc_space.h | 106 // MoreCore. Note this is used to stop the mspace growing beyond the limit to Capacity. When 107 // allocations fail we GC before increasing the footprint limit and allowing the mspace to grow. 108 void SetFootprintLimit(size_t limit) OVERRIDE; 111 byte* begin, byte* end, byte* limit, size_t growth_limit, 132 byte* limit, size_t growth_limit, bool can_move_objects, size_t starting_size,
|
H A D | large_object_space_test.cc | 71 size_t limit = !phase ? requests.size() / 2 : 0; local 72 while (requests.size() > limit) {
|