Searched refs:storage (Results 1 - 8 of 8) sorted by relevance
/art/runtime/jdwp/ |
H A D | jdwp_expand_buf.cc | 38 uint8_t* storage; member in struct:art::JDWP::ExpandBuf 46 * Allocate a JdwpBuf and some initial storage. 50 newBuf->storage = reinterpret_cast<uint8_t*>(malloc(kInitialStorage)); 57 * Free a JdwpBuf and associated storage. 64 free(pBuf->storage); 72 return pBuf->storage; 95 uint8_t* newPtr = reinterpret_cast<uint8_t*>(realloc(pBuf->storage, pBuf->maxLen)); 100 pBuf->storage = newPtr; 110 gapStart = pBuf->storage + pBuf->curLen; 122 *(pBuf->storage [all...] |
/art/runtime/base/ |
H A D | bit_vector.h | 120 uint32_t* storage); 231 // Is bit set in storage. (No range check.) 232 static bool IsBitSet(const uint32_t* storage, uint32_t idx) { argument 233 return (storage[WordIndex(idx)] & BitMask(idx)) != 0; 236 // Number of bits set in range [0, end) in storage. (No range check.) 237 static uint32_t NumSetBits(const uint32_t* storage, uint32_t end); 253 // The index of the word within storage. 266 uint32_t* storage_; // The storage for the bit vector.
|
H A D | bit_vector.cc | 30 uint32_t* storage) 31 : storage_(storage), 87 // ie. we are comparing all storage cells that could have difference, if both vectors have cells above our_highest_index, 151 // Is the storage size smaller than src's? 157 // Paranoid: storage size should be big enough to hold this bit now. 185 // Is the storage size smaller than src's? 189 // Paranoid: storage size should be big enough to hold this bit now. 256 // We can set every storage element with -1. 281 // Return highest bit set in value plus bits from previous storage indexes. 303 // Now set until highest bit's storage 27 BitVector(bool expandable, Allocator* allocator, uint32_t storage_size, uint32_t* storage) argument 319 NumSetBits(const uint32_t* storage, uint32_t end) argument [all...] |
/art/runtime/gc/space/ |
H A D | bump_pointer_space.cc | 139 // Returns the start of the storage. 145 uint8_t* storage = reinterpret_cast<uint8_t*>( local 147 if (LIKELY(storage != nullptr)) { 148 BlockHeader* header = reinterpret_cast<BlockHeader*>(storage); 150 storage += sizeof(BlockHeader); 153 return storage;
|
/art/runtime/ |
H A D | handle_scope.h | 92 static HandleScope* Create(void* storage, HandleScope* link, uint32_t num_references) 94 return new (storage) HandleScope(link, num_references); 98 // Return backing storage used for references. 145 // Scoped handle storage of a fixed size that is usually stack allocated. 173 // Reference storage needs to be first as expected by the HandleScope layout.
|
/art/runtime/mirror/ |
H A D | class.cc | 714 const char* Class::GetDescriptor(std::string* storage) { argument 718 return GetArrayDescriptor(storage); 720 *storage = Runtime::Current()->GetClassLinker()->GetDescriptorForProxy(this); 721 return storage->c_str(); 729 const char* Class::GetArrayDescriptor(std::string* storage) { argument 732 *storage = "["; 733 *storage += elem_desc; 734 return storage->c_str();
|
H A D | class.h | 1062 // always create one the storage argument is populated and its internal c_str() returned. We do 1064 const char* GetDescriptor(std::string* storage) SHARED_LOCKS_REQUIRED(Locks::mutator_lock_); 1066 const char* GetArrayDescriptor(std::string* storage) SHARED_LOCKS_REQUIRED(Locks::mutator_lock_); 1249 // Total size of the Class instance; used when allocating storage on gc heap. 1282 // Total object size; used when allocating storage on gc heap.
|
/art/runtime/arch/mips64/ |
H A D | quick_entrypoints_mips64.S | 146 ld $t8, 56($sp) # Restore gp back to it's temp storage. 170 ld $t8, 56($sp) # Restore gp back to it's temp storage. 275 ld $t8, 184($sp) # Restore gp back to it's temp storage. 1309 * Entry from managed code when uninitialized static storage, this stub will run the class 1310 * initializer and deliver the exception on error. On success the static storage base is
|
Completed in 625 milliseconds