Home
last modified time | relevance | path

Searched refs:Capacity (Results 1 – 25 of 79) sorted by relevance

1234

/third_party/skia/third_party/externals/swiftshader/third_party/llvm-subzero/include/llvm/ADT/
DBitVector.h38 unsigned Capacity; // Number of BitWords allocated in the Bits array. variable
78 BitVector() : Size(0), Capacity(0) { in BitVector()
85 Capacity = NumBitWords(s); in Size()
86 Bits = (BitWord *)std::malloc(Capacity * sizeof(BitWord)); in Size()
87 init_words(Bits, Capacity, t); in Size()
96 Capacity = 0; in BitVector()
100 Capacity = NumBitWords(RHS.size()); in BitVector()
101 Bits = (BitWord *)std::malloc(Capacity * sizeof(BitWord)); in BitVector()
102 std::memcpy(Bits, RHS.Bits, Capacity * sizeof(BitWord)); in BitVector()
106 : Bits(RHS.Bits), Size(RHS.Size), Capacity(RHS.Capacity) { in BitVector()
[all …]
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/Support/
DArrayRecycler.h49 __asan_unpoison_memory_region(Entry, Capacity::get(Idx).getSize()); in pop()
51 __msan_allocated_memory(Entry, Capacity::get(Idx).getSize()); in pop()
63 __asan_poison_memory_region(Ptr, Capacity::get(Idx).getSize()); in push()
71 class Capacity {
73 explicit Capacity(uint8_t idx) : Index(idx) {} in Capacity() function
76 Capacity() : Index(0) {} in Capacity() function
79 static Capacity get(size_t N) { in get()
80 return Capacity(N ? Log2_64_Ceil(N) : 0); in get()
92 Capacity getNext() const { return Capacity(Index + 1); } in getNext()
125 T *allocate(Capacity Cap, AllocatorType &Allocator) { in allocate()
[all …]
/third_party/boost/libs/container/test/
Dstatic_vector_options_test.cpp35 const std::size_t Capacity = 10u; in test_alignment() local
46 static_vector<int, Capacity, options_t> v; in test_alignment()
57 static_vector<int, Capacity, options_t> v; in test_alignment()
66 const std::size_t Capacity = 10u; in test_throw_on_overflow() local
75 static_vector<int, Capacity, options_t> v; in test_throw_on_overflow()
77 v.resize(Capacity); in test_throw_on_overflow()
89 BOOST_TEST(v.capacity() == Capacity); in test_throw_on_overflow()
100 static_vector<int, Capacity, options_t> v; in test_throw_on_overflow()
102 v.resize(Capacity); in test_throw_on_overflow()
114 BOOST_TEST(v.capacity() == Capacity); in test_throw_on_overflow()
Ddefault_init_test.hpp110 const std::size_t Capacity = 100; in default_init_test() local
115 IntDefaultInitAllocVector v(Capacity, default_init); in default_init_test()
118 for(std::size_t i = 0; i != Capacity; ++i, ++it){ in default_init_test()
126 …IntDefaultInitAllocVector v(Capacity, default_init, typename IntDefaultInitAllocVector::allocator_… in default_init_test()
129 for(std::size_t i = 0; i != Capacity; ++i, ++it){ in default_init_test()
138 v.resize(Capacity, default_init); in default_init_test()
141 for(std::size_t i = 0; i != Capacity; ++i, ++it){ in default_init_test()
Dsmall_vector_options_test.cpp15 const std::size_t Capacity = 10u; variable
29 small_vector<int, Capacity, void, options_t> v; in test_alignment()
40 small_vector<int, Capacity, void, options_t> v; in test_alignment()
55 small_vector<int, Capacity, new_allocator<int>, options_t> v; in test_growth_factor_50()
74 small_vector<int, Capacity, new_allocator<int>, options_t> v; in test_growth_factor_60()
93 small_vector<int, Capacity, new_allocator<int>, options_t> v; in test_growth_factor_100()
/third_party/skia/third_party/externals/swiftshader/third_party/subzero/src/
DIceBitVector.h258 unsigned Capacity; // Size of allocated memory in BitWord. variable
308 : Size(0), Capacity(0), Alloc(std::move(A)) {
316 Capacity = NumBitWords(s); in Size()
317 Bits = Alloc.allocate(Capacity); in Size()
318 init_words(Bits, Capacity, t); in Size()
327 Capacity = 0; in BitVectorTmpl()
331 Capacity = NumBitWords(RHS.size()); in BitVectorTmpl()
332 Bits = Alloc.allocate(Capacity); in BitVectorTmpl()
333 std::memcpy(Bits, RHS.Bits, Capacity * sizeof(BitWord)); in BitVectorTmpl()
337 : Bits(RHS.Bits), Size(RHS.Size), Capacity(RHS.Capacity), in BitVectorTmpl()
[all …]
/third_party/boost/libs/graph/test/
Dmin_cost_max_flow_utils.hpp29 typedef property_map< Graph, edge_capacity_t >::type Capacity; typedef
37 template < class Graph, class Weight, class Capacity, class Reversed,
43 Graph& g, Weight& w, Capacity& c, Reversed& rev, ResidualCapacity&) in EdgeAdder()
76 Capacity& m_cap;
83 Capacity capacity = get(edge_capacity, g); in getSampleGraph()
90 template < class Graph, class Weight, class Capacity, class Reversed,
93 vertex_descriptor& t, Capacity capacity, in getSampleGraph()
106 EdgeAdder< Graph, Weight, Capacity, Reversed, ResidualCapacity > ea( in getSampleGraph()
133 Capacity capacity = get(edge_capacity, g); in getSampleGraph2()
141 EdgeAdder< Graph, Weight, Capacity, Reversed, ResidualCapacity > ea( in getSampleGraph2()
/third_party/boost/boost/graph/
Dsuccessive_shortest_path_nonnegative_weights.hpp74 template < class Graph, class Capacity, class ResidualCapacity, class Reversed,
79 typename graph_traits< Graph >::vertex_descriptor t, Capacity capacity, in successive_shortest_path_nonnegative_weights()
123 template < class Graph, class Capacity, class ResidualCapacity,
128 typename graph_traits< Graph >::vertex_descriptor t, Capacity capacity, in successive_shortest_path_nonnegative_weights_dispatch3()
137 template < class Graph, class Capacity, class ResidualCapacity,
142 typename graph_traits< Graph >::vertex_descriptor t, Capacity capacity, in successive_shortest_path_nonnegative_weights_dispatch3()
155 template < class Graph, class P, class T, class R, class Capacity,
160 typename graph_traits< Graph >::vertex_descriptor t, Capacity capacity, in successive_shortest_path_nonnegative_weights_dispatch2()
171 template < class Graph, class P, class T, class R, class Capacity,
176 typename graph_traits< Graph >::vertex_descriptor t, Capacity capacity, in successive_shortest_path_nonnegative_weights_dispatch2()
[all …]
Dfind_flow_cost.hpp17 template < class Graph, class Capacity, class ResidualCapacity, class Weight >
19 Capacity capacity, ResidualCapacity residual_capacity, Weight weight) in find_flow_cost()
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/Demangle/
DMicrosoftDemangle.h32 size_t Capacity = 0; member
36 void addNode(size_t Capacity) { in addNode() argument
38 NewHead->Buf = new uint8_t[Capacity]; in addNode()
40 NewHead->Capacity = Capacity; in addNode()
64 if (Head->Used <= Head->Capacity) in allocUnalignedBuffer()
83 if (Head->Used <= Head->Capacity) in allocArray()
102 if (Head->Used <= Head->Capacity) in alloc()
/third_party/skia/third_party/externals/brotli/csharp/org/brotli/dec/
DBitReader.cs15 private const int Capacity = 1024; field in Org.Brotli.Dec.BitReader
19 private const int IntBufferSize = Capacity + Slack;
21 private const int ByteReadSize = Capacity << 2;
58 if (br.intOffset <= Capacity - 9) in ReadMoreInput()
151 br.intOffset = Capacity; in Init()
198 int limit = Capacity; in IntAvailable()
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/DebugInfo/PDB/Native/
DHashTable.h106 support::ulittle32_t Capacity; member
116 explicit HashTable(uint32_t Capacity) { in HashTable() argument
117 Buckets.resize(Capacity); in HashTable()
124 if (H->Capacity == 0) in load()
127 if (H->Size > maxLoad(H->Capacity)) in load()
131 Buckets.resize(H->Capacity); in load()
187 H.Capacity = capacity(); in commit()
/third_party/mindspore/mindspore/ccsrc/runtime/device/gpu/
Dblocking_queue.h57 size_t Capacity() { return capacity_; } in Capacity() function
92 size_t Capacity() { return queue_->Capacity(); } in Capacity() function
Dgpu_buffer_mgr.cc224 size_t GpuBufferMgr::Capacity(unsigned int handle) { in Capacity() function in mindspore::device::GpuBufferMgr
233 return handle_queue_map_.at(handle)->Capacity(); in Capacity()
236 size_t GpuBufferMgr::Capacity(unsigned int device_id, const std::string &channel_name) { in Capacity() function in mindspore::device::GpuBufferMgr
242 return name_queue_map_.at(name)->Capacity(); in Capacity()
Dgpu_buffer_mgr.h118 EXPORT size_t Capacity(unsigned int handle);
120 EXPORT size_t Capacity(unsigned int device_id, const std::string &channel_name);
/third_party/protobuf/csharp/src/Google.Protobuf.Test/Collections/
DRepeatedFieldTest.cs857 Assert.AreEqual(8, list.Capacity); in Capacity_Increase()
860 list.Capacity = 10; // Set capacity to a larger value to trigger growth in Capacity_Increase()
861 Assert.AreEqual(10, list.Capacity, "Capacity increased"); in Capacity_Increase()
872 Assert.AreEqual(8, list.Capacity); in Capacity_Decrease()
873 …Assert.DoesNotThrow(() => list.Capacity = 5, "Can decrease capacity if new capacity is greater tha… in Capacity_Decrease()
874 Assert.AreEqual(5, list.Capacity); in Capacity_Decrease()
876 Assert.DoesNotThrow(() => list.Capacity = 3, "Can set capacity exactly to list.Count" ); in Capacity_Decrease()
878 …Assert.Throws<ArgumentOutOfRangeException>(() => list.Capacity = 2, "Can't set the capacity smalle… in Capacity_Decrease()
880 …Assert.Throws<ArgumentOutOfRangeException>(() => list.Capacity = 0, "Can't set the capacity to zer… in Capacity_Decrease()
882 …Assert.Throws<ArgumentOutOfRangeException>(() => list.Capacity = -1, "Can't set the capacity to ne… in Capacity_Decrease()
[all …]
/third_party/boost/libs/geometry/index/test/rtree/exceptions/
Dtest_throwing.hpp103 template <typename Element, size_t Capacity>
105 : public boost::geometry::index::detail::varray<Element, Capacity>
107 typedef boost::geometry::index::detail::varray<Element, Capacity> container;
/third_party/boost/libs/container/bench/detail/
Dvarray.hpp56 template <typename Value, std::size_t Capacity, typename Strategy>
114 template <typename V, std::size_t Capacity, typename S>
115 static void check_capacity(varray<V, Capacity, S> const&, std::size_t s) in check_capacity()
117 if ( Capacity < s ) in check_capacity()
171 template <typename Value, std::size_t Capacity, typename Strategy>
220 template <typename Value, std::size_t Capacity, typename Strategy = strategy::def<Value> >
224 Value, Capacity, Strategy
229 sizeof(Value[Capacity]),
230 boost::container::dtl::alignment_of<Value[Capacity]>::value
1471 static size_type capacity() { return Capacity; } in capacity()
[all …]
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Support/
DIntervalMap.cpp119 IdxPair distribute(unsigned Nodes, unsigned Elements, unsigned Capacity, in distribute() argument
122 assert(Elements + Grow <= Nodes * Capacity && "Not enough room for elements"); in distribute()
149 assert(NewSize[n] <= Capacity && "Overallocated node"); in distribute()
/third_party/boost/boost/container/
Dstatic_vector.hpp107 template <typename T, std::size_t Capacity, class Options>
113 , Capacity
149 template <typename T, std::size_t Capacity, class Options BOOST_CONTAINER_DOCONLY(= void) >
151 : public vector<T, typename dtl::get_static_vector_allocator< T, Capacity, Options>::type>
155 typedef typename dtl::get_static_vector_allocator< T, Capacity, Options>::type allocator_type;
191 static const size_type static_capacity = Capacity;
/third_party/boost/boost/geometry/index/detail/
Dvarray.hpp53 template <typename Value, std::size_t Capacity>
152 template <typename Value, std::size_t Capacity>
155 typedef varray_detail::varray_traits<Value, Capacity> vt;
160 sizeof(typename boost::uint_value_t<Capacity>::least) <= sizeof(typename vt::size_type) ),
166 sizeof(Value[Capacity]),
167 boost::alignment_of<Value[Capacity]>::value
1458 static size_type capacity() { return Capacity; } in capacity()
1469 static size_type max_size() { return Capacity; } in max_size()
1565 Capacity < C, in swap_dispatch()
1694 std::ptrdiff_t d = std::distance(position, this->begin() + Capacity); in insert_dispatch()
[all …]
/third_party/node/src/tracing/
Dnode_trace_buffer.cc83 return ((static_cast<uint64_t>(chunk_seq) * Capacity() + in MakeHandle()
92 *chunk_seq = static_cast<uint32_t>(handle / Capacity()); in ExtractHandle()
93 size_t indices = handle % Capacity(); in ExtractHandle()
/third_party/boost/libs/graph/example/
Dexterior_properties.cpp40 template < class Graph, class Capacity, class Flow >
41 void print_network(Graph& G, Capacity capacity, Flow flow) in print_network()
/third_party/boost/libs/container/bench/
Dvarray.hpp55 template <typename Value, std::size_t Capacity>
57 : public dtl::varray<Value, Capacity>
59 typedef dtl::varray<Value, Capacity> base_t;
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/ADT/
DIntervalMap.h222 enum { Capacity = N }; enumerator
411 IdxPair distribute(unsigned Nodes, unsigned Elements, unsigned Capacity,
508 assert(n <= NodeT::Capacity && "Size too big for node"); in NodeRef()
1083 if (branched() || rootSize == RootLeaf::Capacity) in insert()
1171 const unsigned Nodes = RootLeaf::Capacity / Leaf::Capacity + 1; in branchRoot()
1181 NewOffset = distribute(Nodes, rootSize, Leaf::Capacity, nullptr, size, in branchRoot()
1212 const unsigned Nodes = RootBranch::Capacity / Branch::Capacity + 1; in splitRoot()
1222 NewOffset = distribute(Nodes, rootSize, Leaf::Capacity, nullptr, Size, in splitRoot()
1744 if (IM.rootSize < RootBranch::Capacity) { in insertNode()
1764 if (P.size(Level) == Branch::Capacity) { in insertNode()
[all …]

1234