Searched defs:alloc (Results 1 - 11 of 11) sorted by relevance
/art/libartbase/base/ |
H A D | hash_map.h | 68 explicit HashMap(const Alloc& alloc) argument 69 : Base(alloc) { }
|
H A D | dchecked_vector.h | 60 explicit dchecked_vector(const allocator_type& alloc) argument 61 : Base(alloc) { } 62 explicit dchecked_vector(size_type n, const allocator_type& alloc = allocator_type()) 63 : Base(n, alloc) { } 66 const allocator_type& alloc = allocator_type()) 67 : Base(n, value, alloc) { } 71 const allocator_type& alloc = allocator_type()) 72 : Base(first, last, alloc) { } 75 dchecked_vector(const dchecked_vector& src, const allocator_type& alloc) argument 76 : Base(src, alloc) { } 79 dchecked_vector(dchecked_vector&& src, const allocator_type& alloc) argument [all...] |
H A D | leb128.h | 367 explicit Leb128EncodingVector(const typename Vector::allocator_type& alloc) argument 368 : Vector(alloc),
|
/art/runtime/ |
H A D | monitor_pool_test.cc | 63 bool alloc; local 65 alloc = true; 67 alloc = false; 70 alloc = r.next() % 2 == 0; 73 if (alloc) {
|
H A D | cha.cc | 82 const LinearAlloc* alloc, 87 DCHECK(alloc != nullptr); 95 // That means, some 'klass'es can belong to other classloaders. Argument 'alloc' 98 if (!alloc->ContainsUnsafe(klass->GetMethodsPtr())) { 124 if (!alloc->ContainsUnsafe(method)) { 171 alloc->ContainsUnsafe( 81 ResetSingleImplementationInHierarchy(ObjPtr<mirror::Class> klass, const LinearAlloc* alloc, const PointerSize pointer_size) const argument
|
H A D | class_linker.cc | 1169 explicit CHAOnDeleteUpdateClassVisitor(LinearAlloc* alloc) argument 1170 : allocator_(alloc), cha_(Runtime::Current()->GetClassLinker()->GetClassHierarchyAnalysis()), 2754 // end up allocating unfree-able linear alloc resources and then lose the race condition. The 3511 // Don't alloc while holding the lock, since allocation may need to 6877 // These are allocated on the heap to begin, we then transfer to linear alloc when we re-create 6881 // Use the linear alloc pool since this one is in the low 4gb for the compiler. 7032 // Maps from heap allocated miranda method to linear alloc miranda method.
|
/art/compiler/utils/ |
H A D | dedupe_set_test.cc | 56 DedupeSetTestAlloc alloc; local 61 DedupeSetTestHashFunc> deduplicator("test", alloc);
|
H A D | dedupe_set-inl.h | 57 Shard(const Alloc& alloc, const std::string& lock_name) argument 58 : alloc_(alloc), 212 const Alloc& alloc) 217 shards_[i].reset(new Shard(alloc, oss.str())); 211 DedupeSet(const char* set_name, const Alloc& alloc) argument
|
/art/openjdkjvmti/ |
H A D | jvmti_weak_table-inl.h | 252 explicit ReleasableContainer(const allocator_type& alloc, size_t reserve = 10) argument 253 : allocator(alloc),
|
H A D | ti_redefine.cc | 553 explicit CallbackCtx(ObsoleteMap* map, art::LinearAlloc* alloc) argument 554 : obsolete_map(map), allocator(alloc) {}
|
/art/runtime/jit/ |
H A D | jit_code_cache.cc | 133 void RemoveMethodsIn(const LinearAlloc& alloc) { argument 137 [&alloc](ArtMethod* method) { return alloc.ContainsUnsafe(method); }); 604 void JitCodeCache::RemoveMethodsIn(Thread* self, const LinearAlloc& alloc) { argument 619 it->second.RemoveMethodsIn(alloc); 629 if (alloc.ContainsUnsafe(it->second)) { 638 if (alloc.ContainsUnsafe(it->first)) { 648 if (alloc.ContainsUnsafe(info->GetMethod())) {
|
Completed in 117 milliseconds