/external/libcxx/test/std/containers/sequences/deque/deque.cons/ |
H A D | alloc.pass.cpp | 21 template <class T, class Allocator> 23 test(const Allocator& a) 25 std::deque<T, Allocator> d(a);
|
H A D | default.pass.cpp | 21 template <class T, class Allocator> 25 std::deque<T, Allocator> d; 28 std::deque<T, Allocator> d1 = {};
|
H A D | size.pass.cpp | 21 template <class T, class Allocator> 26 typedef std::deque<T, Allocator> C; 30 C d(n, Allocator()); 43 template <class T, class Allocator> 47 typedef std::deque<T, Allocator> C; 63 template <class T, class Allocator> 65 test3(unsigned n, Allocator const &alloc = Allocator()) argument 68 typedef std::deque<T, Allocator> C; 78 template <class T, class Allocator> [all...] |
H A D | iter_iter.pass.cpp | 26 typedef std::allocator<T> Allocator; typedef 27 typedef std::deque<T, Allocator> C; 36 template <class Allocator, class InputIterator> 41 typedef std::deque<T, Allocator> C;
|
/external/libcxx/test/std/re/re.results/re.results.all/ |
H A D | get_allocator.pass.cpp | 12 // class match_results<BidirectionalIterator, Allocator> 21 template <class CharT, class Allocator> 23 test(const Allocator& a) 25 std::match_results<const CharT*, Allocator> m(a);
|
/external/libcxx/test/std/re/re.results/re.results.const/ |
H A D | allocator.pass.cpp | 12 // class match_results<BidirectionalIterator, Allocator> 14 // match_results(const Allocator& a = Allocator()); 21 template <class CharT, class Allocator> 23 test(const Allocator& a) 25 std::match_results<const CharT*, Allocator> m(a);
|
/external/skia/include/android/ |
H A D | SkBRDAllocator.h | 19 class SkBRDAllocator : public SkBitmap::Allocator {
|
/external/llvm/include/llvm/Support/ |
H A D | RecyclingAllocator.h | 1 //==- llvm/Support/RecyclingAllocator.h - Recycling Allocator ----*- C++ -*-==// 22 /// RecyclingAllocator - This class wraps an Allocator, adding the 33 /// Allocator - The wrapped allocator. 35 AllocatorType Allocator; member in class:llvm::RecyclingAllocator 38 ~RecyclingAllocator() { Base.clear(Allocator); } 44 SubClass *Allocate() { return Base.template Allocate<SubClass>(Allocator); } 46 T *Allocate() { return Base.Allocate(Allocator); } 52 void Deallocate(SubClass* E) { return Base.Deallocate(Allocator, E); } 55 Allocator.PrintStats(); 65 T, Size, Align> &Allocator) { 63 operator new(size_t size, llvm::RecyclingAllocator<AllocatorType, T, Size, Align> &Allocator) argument [all...] |
H A D | Recycler.h | 1 //==- llvm/Support/Recycler.h - Recycling Allocator --------------*- C++ -*-==// 20 #include "llvm/Support/Allocator.h" 67 void clear(AllocatorType &Allocator) { argument 70 Allocator.Deallocate(t); 82 SubClass *Allocate(AllocatorType &Allocator) { argument 88 : static_cast<SubClass *>(Allocator.Allocate(Size, Align)); 92 T *Allocate(AllocatorType &Allocator) { argument 93 return Allocate<T>(Allocator); 97 void Deallocate(AllocatorType & /*Allocator*/, SubClass* Element) {
|
H A D | Allocator.h | 1 //===--- Allocator.h - Simple memory allocation abstraction -----*- C++ -*-===// 12 /// of these conform to an LLVM "Allocator" concept which consists of an 14 /// a pointer and size. Further, the LLVM "Allocator" concept has overloads of 114 // printing code uses Allocator.h in its implementation. 145 : CurPtr(nullptr), End(nullptr), BytesAllocated(0), Allocator() {} 147 BumpPtrAllocatorImpl(T &&Allocator) argument 149 Allocator(std::forward<T &&>(Allocator)) {} 157 Allocator(std::move(Old.Allocator)) { 306 AllocatorT Allocator; member in class:llvm::BumpPtrAllocatorImpl 363 BumpPtrAllocator Allocator; member in class:llvm::SpecificBumpPtrAllocator 413 operator new(size_t Size, llvm::BumpPtrAllocatorImpl<AllocatorT, SlabSize, SizeThreshold> &Allocator) argument [all...] |
H A D | ArrayRecycler.h | 11 // arrays allocated from one of the allocators in Allocator.h 19 #include "llvm/Support/Allocator.h" 103 void clear(AllocatorType &Allocator) { argument 106 Allocator.Deallocate(Ptr); 120 /// Return an existing recycled array, or allocate one from Allocator if 124 T *allocate(Capacity Cap, AllocatorType &Allocator) { argument 129 return static_cast<T*>(Allocator.Allocate(sizeof(T)*Cap.getSize(), Align));
|
/external/v8/src/ |
H A D | splay-tree-inl.h | 14 template<typename Config, class Allocator> 15 SplayTree<Config, Allocator>::~SplayTree() { 21 template<typename Config, class Allocator> 22 bool SplayTree<Config, Allocator>::Insert(const Key& key, 46 template<typename Config, class Allocator> 47 void SplayTree<Config, Allocator>::InsertInternal(int cmp, Node* node) { 61 template<typename Config, class Allocator> 62 bool SplayTree<Config, Allocator>::FindInternal(const Key& key) { 70 template<typename Config, class Allocator> 71 bool SplayTree<Config, Allocator> [all...] |
/external/libcxx/test/std/containers/sequences/vector.bool/ |
H A D | types.pass.cpp | 14 // template <class Allocator> 15 // class vector<bool, Allocator 19 // typedef Allocator allocator_type; 38 template <class Allocator> 42 typedef std::vector<bool, Allocator> C; 45 static_assert((std::is_same<typename C::value_type, typename Allocator::value_type>::value), ""); 46 static_assert((std::is_same<typename C::allocator_type, Allocator>::value), ""); 47 static_assert((std::is_same<typename C::size_type, typename std::allocator_traits<Allocator>::size_type>::value), ""); 48 static_assert((std::is_same<typename C::difference_type, typename std::allocator_traits<Allocator>::difference_type>::value), "");
|
/external/libcxx/test/std/containers/sequences/deque/ |
H A D | types.pass.cpp | 14 // template <class T, class Allocator = allocator<T> > 19 // typedef Allocator allocator_type; 40 template <class T, class Allocator> 44 typedef std::deque<T, Allocator> C; 47 static_assert((std::is_same<typename C::value_type, typename Allocator::value_type>::value), ""); 48 static_assert((std::is_same<typename C::allocator_type, Allocator>::value), ""); 49 static_assert((std::is_same<typename C::size_type, typename Allocator::size_type>::value), ""); 50 static_assert((std::is_same<typename C::difference_type, typename Allocator::difference_type>::value), ""); 51 static_assert((std::is_same<typename C::reference, typename Allocator::reference>::value), ""); 52 static_assert((std::is_same<typename C::const_reference, typename Allocator [all...] |
/external/libcxx/test/std/containers/sequences/vector/ |
H A D | types.pass.cpp | 14 // template <class T, class Allocator = allocator<T> > 19 // typedef Allocator allocator_type; 42 template <class T, class Allocator> 46 typedef std::vector<T, Allocator> C; 49 static_assert((std::is_same<typename C::value_type, typename Allocator::value_type>::value), ""); 50 static_assert((std::is_same<typename C::allocator_type, Allocator>::value), ""); 51 static_assert((std::is_same<typename C::size_type, typename Allocator::size_type>::value), ""); 52 static_assert((std::is_same<typename C::difference_type, typename Allocator::difference_type>::value), ""); 53 static_assert((std::is_same<typename C::reference, typename Allocator::reference>::value), ""); 54 static_assert((std::is_same<typename C::const_reference, typename Allocator [all...] |
/external/llvm/unittests/Support/ |
H A D | ArrayRecyclerTest.cpp | 11 #include "llvm/Support/Allocator.h" 52 BumpPtrAllocator Allocator; local 56 Object *A1 = DUT.allocate(Cap, Allocator); 60 Object *A2 = DUT.allocate(Cap, Allocator); 64 Object *A3 = DUT.allocate(Cap, Allocator); 84 Object *A2x = DUT.allocate(Cap, Allocator); 93 Object *A3x = DUT.allocate(Cap, Allocator); 95 Object *A1x = DUT.allocate(Cap, Allocator); 97 Object *A2y = DUT.allocate(Cap, Allocator); 101 Object *A4 = DUT.allocate(Cap, Allocator); [all...] |
/external/libcxx/test/libcxx/experimental/containers/sequences/dynarray/dynarray.cons/ |
H A D | alloc.pass.cpp | 38 template <class T, class Allocator> 39 void check_allocator ( const dynarray<T> &dyn, const Allocator &alloc ) { 44 template <class T, class Allocator> 45 void test ( const std::initializer_list<T> &vals, const Allocator &alloc ) { 55 template <class T, class Allocator> 56 void test ( const T &val, const Allocator &alloc1, const Allocator &alloc2 ) {
|
/external/libcxx/test/std/strings/basic.string/ |
H A D | types.pass.cpp | 15 // class Allocator = allocator<charT> > 21 // typedef Allocator allocator_type; 22 // typedef typename Allocator::size_type size_type; 23 // typedef typename Allocator::difference_type difference_type; 24 // typedef typename Allocator::reference reference; 25 // typedef typename Allocator::const_reference const_reference; 26 // typedef typename Allocator::pointer pointer; 27 // typedef typename Allocator::const_pointer const_pointer; 43 template <class Traits, class Allocator> 47 typedef std::basic_string<typename Traits::char_type, Traits, Allocator> [all...] |
/external/clang/include/clang/Basic/ |
H A D | PartialDiagnostic.h | 122 /// \brief Allocator used to allocate storage for this diagnostic. 123 StorageAllocator *Allocator; member in class:clang::PartialDiagnostic 130 if (Allocator) 131 DiagStorage = Allocator->Allocate(); 133 assert(Allocator != reinterpret_cast<StorageAllocator *>(~uintptr_t(0))); 153 if (Allocator) 154 Allocator->Deallocate(DiagStorage); 155 else if (Allocator != reinterpret_cast<StorageAllocator *>(~uintptr_t(0))) 182 : DiagID(0), DiagStorage(nullptr), Allocator(nullptr) { } 184 PartialDiagnostic(unsigned DiagID, StorageAllocator &Allocator) argument 210 PartialDiagnostic(const Diagnostic &Other, StorageAllocator &Allocator) argument [all...] |
/external/gemmlowp/test/ |
H A D | test_allocator.cc | 20 void test_allocator(Allocator* a, int max_array_size) { 32 !(reinterpret_cast<std::uintptr_t>(int32_array) % Allocator::kAlignment)); 34 !(reinterpret_cast<std::uintptr_t>(int8_array) % Allocator::kAlignment)); 43 Allocator allocator;
|
/external/libcxx/test/std/containers/sequences/forwardlist/forwardlist.cons/ |
H A D | size.pass.cpp | 21 template <class T, class Allocator> 22 void check_allocator(unsigned n, Allocator const &alloc = Allocator()) argument 25 typedef std::forward_list<T, Allocator> C;
|
/external/llvm/include/llvm/ADT/ |
H A D | ScopedHashTable.h | 35 #include "llvm/Support/Allocator.h" 64 AllocatorTy &Allocator) { 65 ScopedHashTableVal *New = Allocator.template Allocate<ScopedHashTableVal>(); 73 template <typename AllocatorTy> void Destroy(AllocatorTy &Allocator) { argument 76 Allocator.Deallocate(this); 157 AllocatorTy Allocator; member in class:llvm::ScopedHashTable 165 ScopedHashTable(AllocatorTy A) : CurScope(0), Allocator(A) {} 171 AllocatorTy &getAllocator() { return Allocator; } 172 const AllocatorTy &getAllocator() const { return Allocator; } 213 Allocator); 61 Create(ScopedHashTableVal *nextInScope, ScopedHashTableVal *nextForKey, const K &key, const V &val, AllocatorTy &Allocator) argument [all...] |
/external/deqp/external/vulkancts/modules/vulkan/api/ |
H A D | vktApiComputeInstanceResultBuffer.hpp | 48 vk::Allocator &allocator); 59 vk::Allocator &allocator,
|
/external/deqp/external/vulkancts/framework/vulkan/ |
H A D | vkMemUtil.hpp | 36 * Allocator implementation. Test code should use Allocator for allocating 111 class Allocator class in namespace:vk 114 Allocator (void) {} function in class:vk::Allocator 115 virtual ~Allocator (void) {} 121 //! Allocator that backs every allocation with its own VkDeviceMemory 122 class SimpleAllocator : public Allocator
|
/external/skia/src/core/ |
H A D | SkBitmapScaler.h | 43 int dest_width, int dest_height, SkBitmap::Allocator* = nullptr);
|