/ndk/sources/android/crazy_linker/src/ |
crazy_linker_util.cpp | 73 size_t new_capacity = capacity_; local 74 while (new_capacity < new_size) { 75 new_capacity += (new_capacity >> 1) + 16; 77 Reserve(new_capacity); 88 void String::Reserve(size_t new_capacity) { 91 ptr_ = reinterpret_cast<char*>(realloc(old_ptr, new_capacity + 1)); 92 ptr_[new_capacity] = '\0'; 93 capacity_ = new_capacity; 95 if (size_ > new_capacity) [all...] |
crazy_linker_line_reader.cpp | 100 size_t new_capacity = buff_capacity_ * 2; local 102 buff_ = static_cast<char*>(::realloc(old_buff, new_capacity)); 106 buff_capacity_ = new_capacity;
|
crazy_linker_util.h | 112 void Reserve(size_t new_capacity); 186 void Reserve(size_t new_capacity); 236 void Vector<T>::Reserve(size_t new_capacity) { 237 items_ = reinterpret_cast<T*>(realloc(items_, new_capacity * sizeof(T))); 238 capacity_ = new_capacity;
|
/ndk/sources/android/support/tests/minitest/ |
minitest.cc | 107 size_t new_capacity = capacity_; local 108 while (new_capacity < new_size) 109 new_capacity += (new_capacity >> 1) + 8; 111 Reserve(new_capacity); 117 void String::Reserve(size_t new_capacity) { 118 str_ = reinterpret_cast<char*>(::realloc(str_, new_capacity + 1)); 119 if (new_capacity > capacity_) 120 ::memset(str_ + capacity_, '\0', new_capacity - capacity_); 121 capacity_ = new_capacity; [all...] |
/external/valgrind/drd/ |
drd_vc.c | 36 void DRD_(vc_reserve)(VectorClock* const vc, const unsigned new_capacity); 314 void DRD_(vc_reserve)(VectorClock* const vc, const unsigned new_capacity) 321 if (new_capacity > vc->capacity) 329 vc->vc, new_capacity * sizeof(vc->vc[0])); 331 else if (vc->vc && new_capacity > VC_PREALLOCATED) 334 && new_capacity > VC_PREALLOCATED 337 new_capacity * sizeof(vc->vc[0])); 344 && new_capacity <= VC_PREALLOCATED 347 else if (new_capacity > VC_PREALLOCATED) 350 && new_capacity > VC_PREALLOCATE [all...] |
/external/marisa-trie/lib/marisa/ |
vector-inline.h | 162 std::size_t new_capacity = capacity; local 165 new_capacity = max_size(); 167 new_capacity = capacity_ * 2; 170 realloc(new_capacity); 198 void Vector<T>::realloc(std::size_t new_capacity) { 199 MARISA_THROW_IF(new_capacity > (MARISA_SIZE_MAX / sizeof(T)), 202 new (std::nothrow) char[sizeof(T) * new_capacity]); 211 capacity_ = (UInt32)new_capacity;
|
vector.h | 116 void realloc(std::size_t new_capacity);
|
/external/marisa-trie/v0_1_5/lib/marisa_alpha/ |
vector-inline.h | 162 std::size_t new_capacity = capacity; local 165 new_capacity = max_size(); 167 new_capacity = capacity_ * 2; 170 realloc(new_capacity); 198 void Vector<T>::realloc(std::size_t new_capacity) { 199 MARISA_ALPHA_THROW_IF(new_capacity > (MARISA_ALPHA_SIZE_MAX / sizeof(T)), 202 new (std::nothrow) char[sizeof(T) * new_capacity]); 211 capacity_ = (UInt32)new_capacity;
|
vector.h | 116 void realloc(std::size_t new_capacity);
|
/bionic/libc/bionic/ |
scandir.cpp | 52 size_t new_capacity = capacity_ + 32; local 54 reinterpret_cast<dirent**>(realloc(names_, new_capacity * sizeof(dirent*))); 59 capacity_ = new_capacity;
|
/system/bt/osi/src/ |
array.c | 100 const size_t new_capacity = array->capacity + (array->capacity / 2); local 103 void *new_data = realloc(is_moving ? NULL : array->data, new_capacity * array->element_size); 111 array->capacity = new_capacity;
|
/external/vixl/src/vixl/ |
code-buffer.cc | 98 void CodeBuffer::Grow(size_t new_capacity) { 100 VIXL_ASSERT(new_capacity > capacity_); 102 buffer_ = static_cast<byte*>(realloc(buffer_, new_capacity)); 106 capacity_ = new_capacity;
|
/system/core/libpixelflinger/codeflinger/tinyutils/ |
VectorImpl.cpp | 244 ssize_t VectorImpl::setCapacity(size_t new_capacity) 247 ssize_t amount = new_capacity - size(); 252 SharedBuffer* sb = SharedBuffer::alloc(new_capacity * mItemSize); 261 return new_capacity; 285 const size_t new_capacity = max(kMinVectorCapacity, ((new_size*3)+1)/2); 286 // ALOGV("grow vector %p, new_capacity=%d", this, (int)new_capacity); 293 SharedBuffer* sb = cur_sb->editResize(new_capacity * mItemSize); 296 SharedBuffer* sb = SharedBuffer::alloc(new_capacity * mItemSize); 338 const size_t new_capacity = max(kMinVectorCapacity, new_size*2) local [all...] |
/system/core/libutils/ |
VectorImpl.cpp | 326 ssize_t VectorImpl::setCapacity(size_t new_capacity) 329 ssize_t amount = new_capacity - size(); 334 SharedBuffer* sb = SharedBuffer::alloc(new_capacity * mItemSize); 343 return new_capacity; 378 const size_t new_capacity = max(kMinVectorCapacity, ((new_size*3)+1)/2); 379 // ALOGV("grow vector %p, new_capacity=%d", this, (int)new_capacity); 386 SharedBuffer* sb = cur_sb->editResize(new_capacity * mItemSize); 393 SharedBuffer* sb = SharedBuffer::alloc(new_capacity * mItemSize); 437 const size_t new_capacity = max(kMinVectorCapacity, new_size*2) [all...] |
/art/runtime/ |
monitor_pool.cc | 48 size_t new_capacity = 2 * capacity_; local 49 uintptr_t* new_backing = new uintptr_t[new_capacity]; 53 capacity_ = new_capacity;
|
/external/v8/src/ |
list-inl.h | 56 int new_capacity = 1 + 2 * capacity_; local 60 Resize(new_capacity, alloc); 66 void List<T, P>::Resize(int new_capacity, P alloc) { 67 DCHECK_LE(length_, new_capacity); 68 T* new_data = NewData(new_capacity, alloc); 72 capacity_ = new_capacity;
|
ostreams.cc | 145 size_t new_capacity = // Handle possible overflow by not doubling. 147 char * new_data = allocate(new_capacity); 150 capacity_ = new_capacity;
|
unique.h | 333 int new_capacity = 2 * capacity_ + size; 334 if (new_capacity > kMaxCapacity) new_capacity = kMaxCapacity; 335 Unique<T>* new_array = zone->NewArray<Unique<T> >(new_capacity); 339 capacity_ = new_capacity;
|
utils.h | 573 int new_capacity; local 577 new_capacity = min_capacity * growth_factor; 578 if (new_capacity < kMinCapacity) new_capacity = kMinCapacity; 584 new_capacity = current_length + growth; 585 if (new_capacity < min_capacity) { 586 new_capacity = min_capacity + growth; 589 NewChunk(new_capacity); 597 virtual void NewChunk(int new_capacity) { 598 Vector<T> new_chunk = Vector<T>::New(new_capacity); [all...] |
string-stream.cc | 28 unsigned new_capacity = capacity_; 29 char* new_buffer = allocator_->grow(&new_capacity); 30 if (new_capacity > capacity_) { 31 capacity_ = new_capacity;
|
/art/compiler/utils/ |
assembler.cc | 86 size_t new_capacity = std::min(old_capacity * 2, old_capacity + 1 * MB); local 89 uint8_t* new_contents = NewContents(new_capacity); 101 limit_ = ComputeLimit(new_contents, new_capacity); 104 CHECK_EQ(Capacity(), new_capacity); local
|
/art/runtime/gc/space/ |
malloc_space.cc | 252 size_t new_capacity = Capacity(); local 253 CHECK_LE(new_capacity, NonGrowthLimitCapacity()); 254 GetLiveBitmap()->SetHeapSize(new_capacity); 255 GetMarkBitmap()->SetHeapSize(new_capacity); 258 temp_bitmap_->SetHeapSize(new_capacity); 260 GetMemMap()->SetSize(new_capacity); 261 limit_ = Begin() + new_capacity;
|
/external/flac/libFLAC/ |
bitwriter.c | 87 unsigned new_capacity; local 94 new_capacity = bw->words + ((bw->bits + bits_to_add + FLAC__BITS_PER_WORD - 1) / FLAC__BITS_PER_WORD); 99 if(bw->capacity >= new_capacity) 103 if((new_capacity - bw->capacity) % FLAC__BITWRITER_DEFAULT_INCREMENT) 104 new_capacity += FLAC__BITWRITER_DEFAULT_INCREMENT - ((new_capacity - bw->capacity) % FLAC__BITWRITER_DEFAULT_INCREMENT); 106 FLAC__ASSERT(0 == (new_capacity - bw->capacity) % FLAC__BITWRITER_DEFAULT_INCREMENT); 107 FLAC__ASSERT(new_capacity > bw->capacity); 108 FLAC__ASSERT(new_capacity >= bw->words + ((bw->bits + bits_to_add + FLAC__BITS_PER_WORD - 1) / FLAC__BITS_PER_WORD)); 110 new_buffer = safe_realloc_mul_2op_(bw->buffer, sizeof(uint32_t), /*times*/new_capacity); [all...] |
/art/runtime/gc/accounting/ |
atomic_stack.h | 176 void Resize(size_t new_capacity) { 177 capacity_ = new_capacity; 178 growth_limit_ = new_capacity;
|
/external/compiler-rt/lib/sanitizer_common/ |
sanitizer_common.h | 457 uptr new_capacity = RoundUpToPowerOfTwo(size_ + 1); 458 Resize(new_capacity); 487 void Resize(uptr new_capacity) { 488 CHECK_GT(new_capacity, 0); 489 CHECK_LE(size_, new_capacity); 490 T *new_data = (T *)MmapOrDie(new_capacity * sizeof(T), 496 capacity_ = new_capacity;
|