HomeSort by relevance Sort by last modified time
    Searched refs:Grow (Results 1 - 25 of 143) sorted by null

1 2 3 4 5 6

  /external/llvm/lib/Support/
IntervalMap.cpp 122 unsigned Position, bool Grow) {
123 assert(Elements + Grow <= Nodes * Capacity && "Not enough room for elements");
129 const unsigned PerNode = (Elements + Grow) / Nodes;
130 const unsigned Extra = (Elements + Grow) % Nodes;
138 assert(Sum == Elements + Grow && "Bad distribution sum");
140 // Subtract the Grow element that was added.
141 if (Grow) {
143 assert(NewSize[PosPair.first] && "Too few elements to need Grow");
SmallPtrSet.cpp 41 // If more than 3/4 of the array is full, grow.
42 Grow(CurArraySize < 64 ? 128 : CurArraySize * 2);
46 Grow(CurArraySize);
115 /// Grow - Allocate a larger backing store for the buckets and move it over.
117 void SmallPtrSetImplBase::Grow(unsigned NewSize) {
  /external/swiftshader/third_party/LLVM/lib/Support/
IntervalMap.cpp 122 unsigned Position, bool Grow) {
123 assert(Elements + Grow <= Nodes * Capacity && "Not enough room for elements");
129 const unsigned PerNode = (Elements + Grow) / Nodes;
130 const unsigned Extra = (Elements + Grow) % Nodes;
138 assert(Sum == Elements + Grow && "Bad distribution sum");
140 // Subtract the Grow element that was added.
141 if (Grow) {
143 assert(NewSize[PosPair.first] && "Too few elements to need Grow");
SmallPtrSet.cpp 52 // Otherwise, hit the big set case, which will call grow.
56 // If more than 3/4 of the array is full, grow.
57 Grow(CurArraySize < 64 ? 128 : CurArraySize*2);
61 Grow(CurArraySize);
130 /// Grow - Allocate a larger backing store for the buckets and move it over.
132 void SmallPtrSetImpl::Grow(unsigned NewSize) {
  /external/v8/src/compiler/
value-numbering-reducer.h 28 void Grow();
value-numbering-reducer.cc 96 if (size_ + size_ / 4 >= capacity_) Grow();
186 void ValueNumberingReducer::Grow() {
  /external/lzma/CPP/Common/
DynamicBuffer.h 15 void Grow(size_t size)
46 Grow(addSize - rem);
MyString.cpp 338 Grow(size);
383 void AString::Grow(unsigned n)
574 Grow(len);
582 Grow(s._len);
890 Grow(size);
933 void UString::Grow(unsigned n)
1097 Grow(len);
1105 Grow(s._len);
1146 Grow(len);
  /prebuilts/go/darwin-x86/src/strings/
builder.go 59 // grow copies the buffer to a new, larger buffer so that there are at least n
61 func (b *Builder) grow(n int) { func
67 // Grow grows b's capacity, if necessary, to guarantee space for
68 // another n bytes. After Grow(n), at least n bytes can be written to b
69 // without another allocation. If n is negative, Grow panics.
70 func (b *Builder) Grow(n int) {
73 panic("strings.Builder.Grow: negative count")
76 b.grow(n)
106 b.grow(utf8.UTFMax)
builder_test.go 90 b.Grow(growLen)
97 t.Errorf("growLen=%d: bad data written after Grow", growLen)
171 b.Grow(5)
188 b.Grow(5)
284 name: "Grow",
288 a.Grow(1)
290 b.Grow(2)
  /prebuilts/go/linux-x86/src/strings/
builder.go 59 // grow copies the buffer to a new, larger buffer so that there are at least n
61 func (b *Builder) grow(n int) { func
67 // Grow grows b's capacity, if necessary, to guarantee space for
68 // another n bytes. After Grow(n), at least n bytes can be written to b
69 // without another allocation. If n is negative, Grow panics.
70 func (b *Builder) Grow(n int) {
73 panic("strings.Builder.Grow: negative count")
76 b.grow(n)
106 b.grow(utf8.UTFMax)
builder_test.go 90 b.Grow(growLen)
97 t.Errorf("growLen=%d: bad data written after Grow", growLen)
171 b.Grow(5)
188 b.Grow(5)
284 name: "Grow",
288 a.Grow(1)
290 b.Grow(2)
  /external/v8/src/
collector.h 43 Grow(1);
57 Grow(size);
74 Grow(source.length());
133 void Grow(int min_capacity) {
  /prebuilts/go/darwin-x86/src/cmd/link/internal/sym/
symbol.go 71 func (s *Symbol) Grow(siz int64) {
143 s.Grow(s.Size)
168 s.Grow(s.Size)
192 s.Grow(s.Size)
215 s.Grow(s.Size)
231 s.Grow(s.Size)
259 s.Grow(s.Size)
  /prebuilts/go/linux-x86/src/cmd/link/internal/sym/
symbol.go 71 func (s *Symbol) Grow(siz int64) {
143 s.Grow(s.Size)
168 s.Grow(s.Size)
192 s.Grow(s.Size)
215 s.Grow(s.Size)
231 s.Grow(s.Size)
259 s.Grow(s.Size)
  /external/vixl/src/
code-buffer-vixl.h 153 void Grow(size_t new_capacity);
165 if (is_full) Grow(capacity_ * 2 + amount);
178 // backing store can then grow on demand. If false the backing store is
  /prebuilts/go/darwin-x86/misc/cgo/test/
issue9400_linux.go 42 // Grow the stack and put down a test pattern
  /prebuilts/go/darwin-x86/test/
clearfat.go 50 // Grow and poison the stack space that will be used by clearfat$
  /prebuilts/go/darwin-x86/test/fixedbugs/
issue10353.go 33 // Grow stack so that partial call x becomes invalid if allocated on stack.
  /prebuilts/go/linux-x86/misc/cgo/test/
issue9400_linux.go 42 // Grow the stack and put down a test pattern