Home
last modified time | relevance | path

Searched refs:ptr (Results 1 – 25 of 65) sorted by relevance

123

/art/runtime/
Dutf_test.cc60 const char* ptr = start; in TEST_F() local
64 pair = GetUtf16FromUtf8(&ptr); in TEST_F()
67 EXPECT_ARRAY_POSITION(1, ptr, start); in TEST_F()
70 pair = GetUtf16FromUtf8(&ptr); in TEST_F()
73 EXPECT_ARRAY_POSITION(3, ptr, start); in TEST_F()
76 pair = GetUtf16FromUtf8(&ptr); in TEST_F()
79 EXPECT_ARRAY_POSITION(6, ptr, start); in TEST_F()
82 pair = GetUtf16FromUtf8(&ptr); in TEST_F()
85 EXPECT_ARRAY_POSITION(10, ptr, start); in TEST_F()
88 pair = GetUtf16FromUtf8(&ptr); in TEST_F()
[all …]
Dleb128.h32 const uint8_t* ptr = *data; in DecodeUnsignedLeb128() local
33 int result = *(ptr++); in DecodeUnsignedLeb128()
35 int cur = *(ptr++); in DecodeUnsignedLeb128()
38 cur = *(ptr++); in DecodeUnsignedLeb128()
41 cur = *(ptr++); in DecodeUnsignedLeb128()
46 cur = *(ptr++); in DecodeUnsignedLeb128()
52 *data = ptr; in DecodeUnsignedLeb128()
68 const uint8_t* ptr = *data; in DecodeSignedLeb128() local
69 int32_t result = *(ptr++); in DecodeSignedLeb128()
73 int cur = *(ptr++); in DecodeSignedLeb128()
[all …]
Dlinear_alloc.cc26 void* LinearAlloc::Realloc(Thread* self, void* ptr, size_t old_size, size_t new_size) { in Realloc() argument
28 return allocator_.Realloc(ptr, old_size, new_size); in Realloc()
46 bool LinearAlloc::Contains(void* ptr) const { in Contains()
48 return allocator_.Contains(ptr); in Contains()
Doat.cc388 const char* ptr = reinterpret_cast<const char*>(&key_value_store_); in GetStoreValueByKey() local
389 const char* end = ptr + key_value_store_size_; in GetStoreValueByKey()
391 while (ptr < end) { in GetStoreValueByKey()
393 const char* str_end = ParseString(ptr, end); in GetStoreValueByKey()
395 if (strcmp(key, ptr) == 0) { in GetStoreValueByKey()
402 ptr = ParseString(str_end + 1, end) + 1; in GetStoreValueByKey()
414 const char* ptr = reinterpret_cast<const char*>(&key_value_store_); in GetStoreKeyValuePairByIndex() local
415 const char* end = ptr + key_value_store_size_; in GetStoreKeyValuePairByIndex()
418 while (ptr < end && counter >= 0) { in GetStoreKeyValuePairByIndex()
420 const char* str_end = ParseString(ptr, end); in GetStoreKeyValuePairByIndex()
[all …]
Dmem_map.cc141 static bool ContainedWithinExistingMap(uint8_t* ptr, size_t size, in ContainedWithinExistingMap() argument
143 uintptr_t begin = reinterpret_cast<uintptr_t>(ptr); in ContainedWithinExistingMap()
244 static inline void* TryMemMapLow4GB(void* ptr, size_t page_aligned_byte_count, int prot, int flags, in TryMemMapLow4GB() argument
246 void* actual = mmap(ptr, page_aligned_byte_count, prot, flags, fd, 0); in TryMemMapLow4GB()
334 for (uintptr_t ptr = next_mem_pos_; ptr < 4 * GB; ptr += kPageSize) { in MapAnonymous() local
337 auto it = maps_->upper_bound(reinterpret_cast<void*>(ptr)); in MapAnonymous()
342 ptr = std::max(ptr, reinterpret_cast<uintptr_t>(before_it->second->BaseEnd())); in MapAnonymous()
343 CHECK_ALIGNED(ptr, kPageSize); in MapAnonymous()
347 size_t delta = reinterpret_cast<uintptr_t>(it->first) - ptr; in MapAnonymous()
353 ptr = reinterpret_cast<uintptr_t>(it->second->BaseEnd()); in MapAnonymous()
[all …]
Ddex_file-inl.h29 const uint8_t* ptr = begin_ + string_id.string_data_off_; in GetStringLength() local
30 return DecodeUnsignedLeb128(&ptr); in GetStringLength()
36 const uint8_t* ptr = begin_ + string_id.string_data_off_; in GetStringDataAndUtf16Length() local
37 *utf16_length = DecodeUnsignedLeb128(&ptr); in GetStringDataAndUtf16Length()
38 return reinterpret_cast<const char*>(ptr); in GetStringDataAndUtf16Length()
Dintern_table.cc300 const uint8_t* ptr = image_space->Begin() + intern_section.Offset(); in AddImageInternTable() local
301 const size_t offset = ReadFromMemory(ptr); in AddImageInternTable()
305 size_t InternTable::ReadFromMemory(const uint8_t* ptr) { in ReadFromMemory() argument
307 return ReadFromMemoryLocked(ptr); in ReadFromMemory()
310 size_t InternTable::ReadFromMemoryLocked(const uint8_t* ptr) { in ReadFromMemoryLocked() argument
311 return strong_interns_.ReadIntoPreZygoteTable(ptr); in ReadFromMemoryLocked()
314 size_t InternTable::WriteToMemory(uint8_t* ptr) { in WriteToMemory() argument
316 return strong_interns_.WriteFromPostZygoteTable(ptr); in WriteToMemory()
334 size_t InternTable::Table::ReadIntoPreZygoteTable(const uint8_t* ptr) { in ReadIntoPreZygoteTable() argument
337 pre_zygote_table_ = UnorderedSet(ptr, false /* make copy */, &read_count); in ReadIntoPreZygoteTable()
[all …]
Dlinear_alloc.h34 void* Realloc(Thread* self, void* ptr, size_t old_size, size_t new_size) LOCKS_EXCLUDED(lock_);
48 bool Contains(void* ptr) const;
Dstride_iterator.h32 StrideIterator(uintptr_t ptr, size_t stride) in StrideIterator() argument
33 : ptr_(ptr), stride_(stride) { in StrideIterator()
Ddex_file_verifier.h48 bool CheckList(size_t element_size, const char* label, const uint8_t* *ptr);
84 uint16_t FindFirstClassDataDefiner(const uint8_t* ptr, bool* success);
85 uint16_t FindFirstAnnotationsDirectoryDefiner(const uint8_t* ptr, bool* success);
/art/runtime/base/
Dhash_set.h151 HashSet(const uint8_t* ptr, bool make_copy_of_data, size_t* read_count) { in HashSet() argument
154 offset = ReadFromBytes(ptr, offset, &temp); in HashSet()
156 offset = ReadFromBytes(ptr, offset, &temp); in HashSet()
159 offset = ReadFromBytes(ptr, offset, &temp); in HashSet()
161 offset = ReadFromBytes(ptr, offset, &min_load_factor_); in HashSet()
162 offset = ReadFromBytes(ptr, offset, &max_load_factor_); in HashSet()
165 data_ = const_cast<T*>(reinterpret_cast<const T*>(ptr + offset)); in HashSet()
172 offset = ReadFromBytes(ptr, offset, &data_[i]); in HashSet()
181 size_t WriteToMemory(uint8_t* ptr) { in WriteToMemory() argument
183 offset = WriteToBytes(ptr, offset, static_cast<uint64_t>(num_elements_)); in WriteToMemory()
[all …]
Dscoped_arena_allocator.cc96 uint8_t* ptr = top_ptr_; in AllocValgrind() local
97 if (UNLIKELY(static_cast<size_t>(top_end_ - ptr) < rounded_bytes)) { in AllocValgrind()
98 ptr = AllocateFromNextArena(rounded_bytes); in AllocValgrind()
99 CHECK(ptr != nullptr) << "Failed to allocate memory"; in AllocValgrind()
102 top_ptr_ = ptr + rounded_bytes; in AllocValgrind()
103 VALGRIND_MAKE_MEM_UNDEFINED(ptr, bytes); in AllocValgrind()
104 VALGRIND_MAKE_MEM_NOACCESS(ptr + bytes, rounded_bytes - bytes); in AllocValgrind()
105 return ptr; in AllocValgrind()
Dscoped_arena_allocator.h71 uint8_t* ptr = top_ptr_; in Alloc() local
72 if (UNLIKELY(static_cast<size_t>(top_end_ - ptr) < rounded_bytes)) { in Alloc()
73 ptr = AllocateFromNextArena(rounded_bytes); in Alloc()
76 top_ptr_ = ptr + rounded_bytes; in Alloc()
77 return ptr; in Alloc()
132 static void operator delete(void* ptr) { UNUSED(ptr); } in delete() argument
Darena_allocator.h146 bool Contains(const void* ptr) const { in Contains() argument
147 return memory_ <= ptr && ptr < memory_ + bytes_allocated_; in Contains()
228 void* Realloc(void* ptr, size_t ptr_size, size_t new_size,
231 DCHECK_EQ(ptr == nullptr, ptr_size == 0u);
232 auto* end = reinterpret_cast<uint8_t*>(ptr) + ptr_size;
241 return ptr;
245 memcpy(new_ptr, ptr, ptr_size);
271 bool Contains(const void* ptr) const;
Dvariant_map.h232 auto* ptr = Get(key); in GetOrDefault() local
233 return (ptr == nullptr) ? key.CreateDefaultValue() : *ptr; in GetOrDefault()
256 TValue* ptr = Get(key); in ReleaseOrDefault() local
257 if (ptr != nullptr) { in ReleaseOrDefault()
258 return std::move(*ptr); in ReleaseOrDefault()
285 TValue* ptr = Get(key); in SetIfMissing() local
286 if (ptr == nullptr) { in SetIfMissing()
Darena_allocator.cc282 for (uint8_t* ptr = ret; ptr < ptr_; ++ptr) { in AllocValgrind() local
283 CHECK_EQ(*ptr, 0U); in AllocValgrind()
305 bool ArenaAllocator::Contains(const void* ptr) const { in Contains()
306 if (ptr >= begin_ && ptr < end_) { in Contains()
310 if (cur_arena->Contains(ptr)) { in Contains()
Dvariant_map_test.cc86 auto* ptr = fm.Get(FruitMap::Label); in TEST() local
87 ASSERT_TRUE(ptr != nullptr); in TEST()
88 *ptr = "foobar"; in TEST()
92 fm.Set(FruitMap::Label, *ptr); in TEST()
95 ASSERT_TRUE(ptr != nullptr); in TEST()
/art/compiler/utils/
Dswap_space.h36 uint8_t* ptr; member
40 return reinterpret_cast<uintptr_t>(ptr); in Start()
43 return reinterpret_cast<uintptr_t>(ptr) + size; in End()
48 return (lhs.size == rhs.size) && (lhs.ptr == rhs.ptr);
54 return reinterpret_cast<uintptr_t>(a.ptr) < reinterpret_cast<uintptr_t>(b.ptr); in operator()
64 void Free(void* ptr, size_t size) LOCKS_EXCLUDED(lock_);
Dswap_space.cc122 void* ret = old_chunk.ptr; in Alloc()
126 SpaceChunk new_chunk = { old_chunk.ptr + size, old_chunk.size - size }; in Alloc()
140 uint8_t* ptr = reinterpret_cast<uint8_t*>( in NewFileChunk() local
142 if (ptr == MAP_FAILED) { in NewFileChunk()
152 SpaceChunk new_chunk = {ptr, next_part}; in NewFileChunk()
181 chunk.ptr -= prev->size; in Free()
/art/runtime/arch/arm/
Dfault_handler_arm.cc96 uint8_t* ptr = reinterpret_cast<uint8_t*>(sc->arm_pc); in GetMethodAndReturnPcAndSp() local
97 VLOG(signals) << "pc: " << std::hex << static_cast<void*>(ptr); in GetMethodAndReturnPcAndSp()
99 if (ptr == nullptr) { in GetMethodAndReturnPcAndSp()
105 uint32_t instr_size = GetInstructionSize(ptr); in GetMethodAndReturnPcAndSp()
121 uint8_t* ptr = reinterpret_cast<uint8_t*>(sc->arm_pc); in Action() local
123 uint32_t instr_size = GetInstructionSize(ptr); in Action()
/art/runtime/gc/space/
Dvalgrind_malloc_space.h47 size_t Free(Thread* self, mirror::Object* ptr) OVERRIDE
53 void RegisterRecentFree(mirror::Object* ptr) OVERRIDE { in RegisterRecentFree() argument
54 UNUSED(ptr); in RegisterRecentFree()
Ddlmalloc_space.cc165 size_t DlMallocSpace::Free(Thread* self, mirror::Object* ptr) { in Free() argument
168 CHECK(ptr != nullptr); in Free()
169 CHECK(Contains(ptr)) << "Free (" << ptr << ") not in bounds of heap " << *this; in Free()
171 const size_t bytes_freed = AllocationSizeNonvirtual(ptr, nullptr); in Free()
173 RegisterRecentFree(ptr); in Free()
175 mspace_free(mspace_, ptr); in Free()
185 mirror::Object* ptr = ptrs[i]; in FreeList() local
191 bytes_freed += AllocationSizeNonvirtual(ptr, nullptr); in FreeList()
/art/runtime/gc/allocator/
Drosalloc.cc294 size_t RosAlloc::FreePages(Thread* self, void* ptr, bool already_zero) { in FreePages() argument
296 size_t pm_idx = ToPageMapIndex(ptr); in FreePages()
311 << reinterpret_cast<intptr_t>(ptr); in FreePages()
327 const uintptr_t* word_ptr = reinterpret_cast<uintptr_t*>(ptr); in FreePages()
333 memset(ptr, 0, byte_size); in FreePages()
337 LOG(INFO) << __PRETTY_FUNCTION__ << " : 0x" << std::hex << reinterpret_cast<intptr_t>(ptr) in FreePages()
338 << "-0x" << (reinterpret_cast<intptr_t>(ptr) + byte_size) in FreePages()
343 FreePageRun* fpr = reinterpret_cast<FreePageRun*>(ptr); in FreePages()
495 size_t RosAlloc::FreeInternal(Thread* self, void* ptr) { in FreeInternal() argument
496 DCHECK_LE(base_, ptr); in FreeInternal()
[all …]
/art/runtime/base/unix_file/
Dfd_file.cc188 char* ptr = static_cast<char*>(buffer); in ReadFullyGeneric() local
190 ssize_t bytes_read = TEMP_FAILURE_RETRY(read_func(fd, ptr, byte_count, offset)); in ReadFullyGeneric()
197 ptr += bytes_read; // Move the buffer forward. in ReadFullyGeneric()
212 const char* ptr = static_cast<const char*>(buffer); in WriteFully() local
215 ssize_t bytes_written = TEMP_FAILURE_RETRY(write(fd_, ptr, byte_count)); in WriteFully()
220 ptr += bytes_written; // Move the buffer forward. in WriteFully()
/art/runtime/jit/
Djit_code_cache.cc65 bool JitCodeCache::ContainsCodePtr(const void* ptr) const { in ContainsCodePtr()
66 return ptr >= code_cache_begin_ && ptr < code_cache_end_; in ContainsCodePtr()

123