/external/v8/src/libplatform/tracing/ |
H A D | trace-buffer.h | 32 size_t Capacity() const { return max_chunks_ * TraceBufferChunk::kChunkSize; } function in class:v8::platform::tracing::TraceBufferRingBuffer
|
/external/webrtc/webrtc/base/ |
H A D | bytebuffer.h | 45 size_t Capacity() const { return size_ - start_; } function in class:rtc::ByteBuffer
|
/external/compiler-rt/lib/esan/ |
H A D | esan_circular_buffer.h | 38 Capacity = BufferCapacity; 40 Data = (T *)MmapOrDie(Capacity * sizeof(T), "CircularBuffer"); 46 UnmapOrDie(Data, Capacity * sizeof(T)); 50 uptr ArrayIdx = (StartIdx + Idx) % Capacity; 55 uptr ArrayIdx = (StartIdx + Idx) % Capacity; 59 CHECK_GT(Capacity, 0); 60 uptr ArrayIdx = (StartIdx + Count) % Capacity; 62 if (Count < Capacity) 65 StartIdx = (StartIdx + 1) % Capacity; 69 uptr ArrayIdx = (StartIdx + Count - 1) % Capacity; 91 uptr Capacity; member in class:__esan::CircularBuffer [all...] |
/external/llvm/include/llvm/Support/ |
H A D | ArrayRecycler.h | 66 /// The size of an allocated array is represented by a Capacity instance. 70 class Capacity { class in class:llvm::ArrayRecycler 72 explicit Capacity(uint8_t idx) : Index(idx) {} function in class:llvm::ArrayRecycler::Capacity 75 Capacity() : Index(0) {} function in class:llvm::ArrayRecycler::Capacity 78 static Capacity get(size_t N) { 79 return Capacity(N ? Log2_64_Ceil(N) : 0); 91 Capacity getNext() const { return Capacity(Index + 1); } 124 T *allocate(Capacity Cap, AllocatorType &Allocator) { 132 /// Deallocate an array with the specified Capacity [all...] |
/external/llvm/lib/Support/ |
H A D | IntervalMap.cpp | 120 IdxPair distribute(unsigned Nodes, unsigned Elements, unsigned Capacity, argument 123 assert(Elements + Grow <= Nodes * Capacity && "Not enough room for elements"); 150 assert(NewSize[n] <= Capacity && "Overallocated node");
|
/external/swiftshader/third_party/LLVM/lib/Support/ |
H A D | IntervalMap.cpp | 120 IdxPair distribute(unsigned Nodes, unsigned Elements, unsigned Capacity, argument 123 assert(Elements + Grow <= Nodes * Capacity && "Not enough room for elements"); 150 assert(NewSize[n] <= Capacity && "Overallocated node");
|
/external/brotli/csharp/org/brotli/dec/ |
H A D | BitReader.cs | 15 private const int Capacity = 1024;
field in class:Org.Brotli.Dec.BitReader 19 private const int IntBufferSize = Capacity + Slack;
21 private const int ByteReadSize = Capacity << 2;
58 if (br.intOffset <= Capacity - 9)
151 br.intOffset = Capacity;
198 int limit = Capacity;
|
/external/clang/lib/Sema/ |
H A D | TypeLocBuilder.h | 31 size_t Capacity; member in class:clang::TypeLocBuilder 48 : Buffer(InlineBuffer.buffer), Capacity(InlineCapacity), 60 if (Requested > Capacity) 82 Index = Capacity; 109 size_t FullDataSize = Capacity - Index; 122 size_t FullDataSize = Capacity - Index;
|
/external/swiftshader/third_party/subzero/src/ |
H A D | IceAssembler.cpp | 33 static uintptr_t NewContents(Assembler &Assemblr, intptr_t Capacity) { argument 34 uintptr_t Result = Assemblr.allocateBytes(Capacity);
|
H A D | IceAssembler.h | 231 static uintptr_t computeLimit(uintptr_t Data, intptr_t Capacity) { argument 232 return Data + Capacity - kMinimumGap;
|
H A D | IceDefs.h | 252 void reserve(VariableDeclarationArray::size_type Capacity) { argument 253 Globals.reserve(Capacity);
|
/external/clang/include/clang/Analysis/Support/ |
H A D | BumpVector.h | 59 T *Begin, *End, *Capacity; member in class:clang::BumpVector 63 : Begin(nullptr), End(nullptr), Capacity(nullptr) { 155 if (End < Capacity) { 170 if (End + Cnt <= Capacity) { 184 if (unsigned(Capacity-Begin) < N) 190 size_t capacity() const { return Capacity - Begin; } 221 size_t CurCapacity = Capacity-Begin; 246 Capacity = Begin+NewCapacity;
|
/external/llvm/include/llvm/ADT/ |
H A D | BitVector.h | 37 unsigned Capacity; // Number of BitWords allocated in the Bits array. member in class:llvm::BitVector 78 BitVector() : Size(0), Capacity(0) { 85 Capacity = NumBitWords(s); 86 Bits = (BitWord *)std::malloc(Capacity * sizeof(BitWord)); 87 init_words(Bits, Capacity, t); 96 Capacity = 0; 100 Capacity = NumBitWords(RHS.size()); 101 Bits = (BitWord *)std::malloc(Capacity * sizeof(BitWord)); 102 std::memcpy(Bits, RHS.Bits, Capacity * sizeof(BitWord)); 106 : Bits(RHS.Bits), Size(RHS.Size), Capacity(RH [all...] |
H A D | IntervalMap.h | 216 enum { Capacity = N }; enumerator in enum:llvm::IntervalMapImpl::NodeBase::__anon13570 380 /// Elements + Grow <= Nodes * Capacity. 385 /// NewSize[i] <= Capacity. 393 /// Grow is set and NewSize[idx] == Capacity-1. The index points to the node 399 /// @param Capacity The capacity of each node. 405 IdxPair distribute(unsigned Nodes, unsigned Elements, unsigned Capacity, 505 assert(n <= NodeT::Capacity && "Size too big for node"); 621 /// @return (insert position, new size), or (i, Capacity+1) on overflow. 1084 if (branched() || rootSize == RootLeaf::Capacity) 1160 const unsigned Nodes = RootLeaf::Capacity / Lea [all...] |
/external/swiftshader/third_party/LLVM/include/llvm/ADT/ |
H A D | BitVector.h | 33 unsigned Capacity; // Size of allocated memory in BitWord. member in class:llvm::BitVector 73 BitVector() : Size(0), Capacity(0) { 80 Capacity = NumBitWords(s); 81 Bits = (BitWord *)std::malloc(Capacity * sizeof(BitWord)); 82 init_words(Bits, Capacity, t); 91 Capacity = 0; 95 Capacity = NumBitWords(RHS.size()); 96 Bits = (BitWord *)std::malloc(Capacity * sizeof(BitWord)); 97 std::memcpy(Bits, RHS.Bits, Capacity * sizeof(BitWord)); 199 if (N > Capacity * BITWORD_SIZ [all...] |
H A D | IntervalMap.h | 195 enum { Capacity = N }; enumerator in enum:llvm::IntervalMapImpl::NodeBase::__anon22402 359 /// Elements + Grow <= Nodes * Capacity. 364 /// NewSize[i] <= Capacity. 372 /// Grow is set and NewSize[idx] == Capacity-1. The index points to the node 378 /// @param Capacity The capacity of each node. 384 IdxPair distribute(unsigned Nodes, unsigned Elements, unsigned Capacity, 484 assert(n <= NodeT::Capacity && "Size too big for node"); 600 /// @return (insert position, new size), or (i, Capacity+1) on overflow. 1074 if (branched() || rootSize == RootLeaf::Capacity) 1150 const unsigned Nodes = RootLeaf::Capacity / Lea [all...] |
/external/swiftshader/third_party/llvm-subzero/include/llvm/ADT/ |
H A D | BitVector.h | 38 unsigned Capacity; // Number of BitWords allocated in the Bits array. member in class:llvm::BitVector 78 BitVector() : Size(0), Capacity(0) { 85 Capacity = NumBitWords(s); 86 Bits = (BitWord *)std::malloc(Capacity * sizeof(BitWord)); 87 init_words(Bits, Capacity, t); 96 Capacity = 0; 100 Capacity = NumBitWords(RHS.size()); 101 Bits = (BitWord *)std::malloc(Capacity * sizeof(BitWord)); 102 std::memcpy(Bits, RHS.Bits, Capacity * sizeof(BitWord)); 106 : Bits(RHS.Bits), Size(RHS.Size), Capacity(RH [all...] |
/external/clang/include/clang/AST/ |
H A D | ASTVector.h | 36 llvm::PointerIntPair<T*, 1, bool> Capacity; member in class:clang::ASTVector 43 bool getTag() const { return Capacity.getInt(); } 44 void setTag(bool B) { Capacity.setInt(B); } 48 ASTVector() : Begin(nullptr), End(nullptr), Capacity(nullptr, false) {} 50 ASTVector(ASTVector &&O) : Begin(O.Begin), End(O.End), Capacity(O.Capacity) { 52 O.Capacity.setPointer(nullptr); 53 O.Capacity.setInt(false); 57 : Begin(nullptr), End(nullptr), Capacity(nullptr, false) { 66 swap(Capacity, [all...] |
/external/spirv-llvm/lib/SPIRV/libSPIRV/ |
H A D | SPIRVValue.h | 351 PacketAlign(ThePacketAlign), Capacity(TheCapacity){ 356 PacketAlign(0), Capacity(0){} 367 return Capacity; 375 SPIRVWord Capacity; member in class:SPIRV::SPIRVConstantPipeStorage 382 _SPIRV_DEF_ENCDEC5(Type, Id, PacketSize, PacketAlign, Capacity)
|
/external/v8/src/ |
H A D | transitions.cc | 94 if (new_nof <= Capacity(array)) { 385 int TransitionArray::Capacity(Object* raw_transitions) { function in class:v8::internal::TransitionArray
|
/external/swiftshader/third_party/PowerVR_SDK/Tools/ |
H A D | PVRTString.cpp | 1580 size_t Capacity = _Str.m_Capacity; local 1586 m_Capacity = Capacity;
|
/external/clang/lib/CodeGen/ |
H A D | CGCleanup.cpp | 117 unsigned Capacity = 1024; local 118 while (Capacity < Size) Capacity *= 2; 119 StartOfBuffer = new char[Capacity]; 120 StartOfData = EndOfBuffer = StartOfBuffer + Capacity;
|
/external/protobuf/src/google/protobuf/ |
H A D | repeated_field.h | 148 int Capacity() const; 425 int Capacity() const; 765 int Capacity() const; 1050 inline int RepeatedField<Element>::Capacity() const { function in class:google::protobuf::RepeatedField 1529 inline int RepeatedPtrFieldBase::Capacity() const { function in class:google::protobuf::internal::RepeatedPtrFieldBase 2047 inline int RepeatedPtrField<Element>::Capacity() const { function in class:google::protobuf::RepeatedPtrField 2048 return RepeatedPtrFieldBase::Capacity();
|
/external/spirv-llvm/lib/SPIRV/ |
H A D | SPIRVWriter.cpp | 762 Capacity = ConstV->getOperand(2)->getUniqueInteger().getZExtValue(); local 768 Capacity);
|
/external/tinyxml2/ |
H A D | tinyxml2.h | 263 int Capacity() const {
function in class:tinyxml2::DynArray
|