HomeSort by: relevance | last modified time | path
    Searched refs:NewCapacity (Results 1 - 10 of 10) sorted by relevancy

  /src/external/apache2/llvm/dist/clang/lib/Sema/
TypeLocBuilder.cpp 44 void TypeLocBuilder::grow(size_t NewCapacity) {
45 assert(NewCapacity > Capacity);
48 char *NewBuffer = new char[NewCapacity];
49 unsigned NewIndex = Index + NewCapacity - Capacity;
58 Capacity = NewCapacity;
75 size_t NewCapacity = Capacity * 2;
76 while (RequiredCapacity > NewCapacity)
77 NewCapacity *= 2;
78 grow(NewCapacity);
TypeLocBuilder.h 130 void grow(size_t NewCapacity);
  /src/external/apache2/llvm/dist/llvm/lib/Support/
SmallVector.cpp 97 size_t NewCapacity = 2 * OldCapacity + 1; // Always grow.
98 return std::min(std::max(NewCapacity, MinSize), MaxSize);
104 size_t &NewCapacity) {
105 NewCapacity = getNewCapacity<Size_T>(MinSize, TSize, this->capacity());
106 return llvm::safe_malloc(NewCapacity * TSize);
113 size_t NewCapacity = getNewCapacity<Size_T>(MinSize, TSize, this->capacity());
116 NewElts = safe_malloc(NewCapacity * TSize);
122 NewElts = safe_realloc(this->BeginX, NewCapacity * TSize);
126 this->Capacity = NewCapacity;
  /src/external/apache2/llvm/dist/clang/include/clang/Analysis/Support/
BumpVector.h 228 size_t NewCapacity = 2*CurCapacity;
229 if (NewCapacity < MinSize)
230 NewCapacity = MinSize;
233 T *NewElts = C.getAllocator().template Allocate<T>(NewCapacity);
251 Capacity = Begin+NewCapacity;
  /src/external/apache2/llvm/dist/llvm/lib/DebugInfo/CodeView/
LazyRandomTypeCollection.cpp 164 uint32_t NewCapacity = MinSize * 3 / 2;
166 assert(NewCapacity > capacity());
167 Records.resize(NewCapacity);
  /src/external/apache2/llvm/dist/llvm/include/llvm/ADT/
SmallVector.h 62 void *mallocForGrow(size_t MinSize, size_t TSize, size_t &NewCapacity);
352 /// in \p NewCapacity. This is the first section of \a grow().
353 T *mallocForGrow(size_t MinSize, size_t &NewCapacity) {
356 MinSize, sizeof(T), NewCapacity));
364 void takeAllocationForGrow(T *NewElts, size_t NewCapacity);
384 size_t NewCapacity;
385 T *NewElts = mallocForGrow(NumElts, NewCapacity);
388 takeAllocationForGrow(NewElts, NewCapacity);
394 size_t NewCapacity;
395 T *NewElts = mallocForGrow(0, NewCapacity);
    [all...]
  /src/external/apache2/llvm/dist/clang/include/clang/AST/
ASTVector.h 383 size_t NewCapacity = 2*CurCapacity;
384 if (NewCapacity < MinSize)
385 NewCapacity = MinSize;
388 T *NewElts = new (C, alignof(T)) T[NewCapacity];
405 Capacity.setPointer(Begin+NewCapacity);
  /src/external/apache2/llvm/dist/llvm/include/llvm/DebugInfo/PDB/Native/
HashTable.h 312 uint32_t NewCapacity = (capacity() <= INT32_MAX) ? MaxLoad * 2 : UINT32_MAX;
317 HashTable NewMap(NewCapacity);
327 assert(capacity() == NewCapacity);
  /src/external/apache2/llvm/dist/clang/lib/AST/
NestedNameSpecifier.cpp 469 unsigned NewCapacity = std::max(
473 char *NewBuffer = static_cast<char *>(llvm::safe_malloc(NewCapacity));
478 Buffer = static_cast<char *>(llvm::safe_realloc(Buffer, NewCapacity));
480 BufferCapacity = NewCapacity;
  /src/external/apache2/llvm/dist/clang/lib/CodeGen/
CGCleanup.cpp 117 unsigned NewCapacity = CurrentCapacity;
119 NewCapacity *= 2;
120 } while (NewCapacity < UsedCapacity + Size);
122 char *NewStartOfBuffer = new char[NewCapacity];
123 char *NewEndOfBuffer = NewStartOfBuffer + NewCapacity;

Completed in 89 milliseconds