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

1 2

  /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/v8/src/
collector.h 135 int new_capacity; local
139 new_capacity = min_capacity * growth_factor;
140 if (new_capacity < kMinCapacity) new_capacity = kMinCapacity;
146 new_capacity = current_length + growth;
147 if (new_capacity < min_capacity) {
148 new_capacity = min_capacity + growth;
151 NewChunk(new_capacity);
159 virtual void NewChunk(int new_capacity) {
160 Vector<T> new_chunk = Vector<T>::New(new_capacity);
    [all...]
list-inl.h 59 int new_capacity = 1 + 2 * capacity_; local
63 Resize(new_capacity, alloc);
69 void List<T, P>::Resize(int new_capacity, P alloc) {
70 DCHECK_LE(length_, new_capacity);
71 T* new_data = NewData(new_capacity, alloc);
75 capacity_ = new_capacity;
layout-descriptor.cc 82 int new_capacity = field_index + details.field_width_in_words(); local
83 if (new_capacity > layout_descriptor->capacity()) {
99 int new_capacity) {
101 if (new_capacity <= old_capacity) {
105 LayoutDescriptor::New(isolate, new_capacity);
layout-descriptor.h 121 int new_capacity);
transitions.cc 268 Handle<FixedArray> array, int new_capacity, Isolate* isolate) {
271 new_capacity = Min(kMaxCachedPrototypeTransitions, new_capacity);
272 DCHECK_GT(new_capacity, capacity);
273 int grow_by = new_capacity - capacity;
string-stream.cc 40 unsigned new_capacity = capacity_;
41 char* new_buffer = allocator_->grow(&new_capacity);
42 if (new_capacity > capacity_) {
43 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;
code-buffer.h 81 void Grow(size_t new_capacity);
  /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...]
  /bionic/libc/bionic/
scandir.cpp 54 size_t new_capacity = capacity_ + 32; local
56 reinterpret_cast<dirent**>(realloc(names_, new_capacity * sizeof(dirent*)));
61 capacity_ = new_capacity;
  /system/bt/osi/src/
array.c 97 const size_t new_capacity = array->capacity + (array->capacity / 2); local
100 void *new_data = realloc(is_moving ? NULL : array->data, new_capacity * array->element_size);
108 array->capacity = new_capacity;
  /art/compiler/utils/
assembler.cc 98 size_t new_capacity = std::min(old_capacity * 2, old_capacity + 1 * MB); local
99 new_capacity = std::max(new_capacity, min_capacity);
103 arena_->Realloc(contents_, old_capacity, new_capacity, kArenaAllocAssembler));
107 limit_ = ComputeLimit(contents_, new_capacity);
110 CHECK_EQ(Capacity(), new_capacity); local
  /system/core/libutils/
VectorImpl.cpp 336 ssize_t VectorImpl::setCapacity(size_t new_capacity)
340 if (new_capacity <= size()) {
345 LOG_ALWAYS_FATAL_IF(!safe_mul(&new_allocation_size, new_capacity, mItemSize));
355 return new_capacity;
399 size_t new_capacity = 0;
400 LOG_ALWAYS_FATAL_IF(!safe_add(&new_capacity, new_size, (new_size / 2)),
401 "new_capacity overflow");
402 LOG_ALWAYS_FATAL_IF(!safe_add(&new_capacity, new_capacity, static_cast<size_t>(1u)),
403 "new_capacity overflow")
    [all...]
  /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/libchrome/base/
pickle.cc 325 void Pickle::Resize(size_t new_capacity) {
327 capacity_after_header_ = bits::Align(new_capacity, kPayloadUnit);
406 size_t new_capacity = capacity_after_header_ * 2; local
408 if (new_capacity > kPickleHeapAlign)
409 new_capacity = bits::Align(new_capacity, kPickleHeapAlign) - kPayloadUnit;
410 Resize(std::max(new_capacity, new_size));
pickle.h 260 void Resize(size_t new_capacity);
  /external/v8/src/crankshaft/
unique.h 347 int new_capacity = 2 * capacity_ + size;
348 if (new_capacity > kMaxCapacity) new_capacity = kMaxCapacity;
349 Unique<T>* new_array = zone->NewArray<Unique<T> >(new_capacity);
353 capacity_ = new_capacity;
  /art/runtime/gc/accounting/
atomic_stack.h 179 void Resize(size_t new_capacity) {
180 capacity_ = new_capacity;
181 growth_limit_ = 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...]
  /external/compiler-rt/lib/sanitizer_common/
sanitizer_common.h 496 uptr new_capacity = RoundUpToPowerOfTwo(size_ + 1);
497 Resize(new_capacity);
526 void Resize(uptr new_capacity) {
527 CHECK_GT(new_capacity, 0);
528 CHECK_LE(size_, new_capacity);
529 T *new_data = (T *)MmapOrDie(new_capacity * sizeof(T),
535 capacity_ = new_capacity;
  /external/v8/src/runtime/
runtime-array.cc 371 uint32_t new_capacity = JSObject::NewElementsCapacity(index + 1); local
372 object->GetElementsAccessor()->GrowCapacityAndConvert(object, new_capacity);
  /external/libvpx/libvpx/third_party/libwebm/
mkvmuxer.cpp 324 const int32 new_capacity = local
327 if (new_capacity < 1)
331 new (std::nothrow) CuePoint*[new_capacity]; // NOLINT
342 cue_entries_capacity_ = new_capacity;
2950 const int32 new_capacity = local
3154 const int32 new_capacity = (!frames_capacity_) ? 2 : frames_capacity_ * 2; local
    [all...]
  /hardware/intel/common/omx-components/videocodec/libvpx_internal/libvpx/third_party/libwebm/
mkvmuxer.cpp 274 const int32 new_capacity = local
277 if (new_capacity < 1)
281 new (std::nothrow) CuePoint*[new_capacity]; // NOLINT
292 cue_entries_capacity_ = new_capacity;
2900 const int32 new_capacity = local
3091 const int32 new_capacity = (!frames_capacity_) ? 2 : frames_capacity_ * 2; local
    [all...]
  /external/v8/src/heap/
spaces.cc 1389 int new_capacity = local
1409 int new_capacity = Max(InitialTotalCapacity(), 2 * SizeAsInt()); local
    [all...]

Completed in 463 milliseconds

1 2