| /ndk/sources/android/support/tests/minitest/ |
| minitest.cc | 106 size_t new_capacity = capacity_; local
107 while (new_capacity < new_size)
108 new_capacity += (new_capacity >> 1) + 8;
110 Reserve(new_capacity);
116 void String::Reserve(size_t new_capacity) {
117 str_ = reinterpret_cast<char*>(::realloc(str_, new_capacity + 1));
118 if (new_capacity > capacity_)
119 ::memset(str_ + capacity_, '\0', new_capacity - capacity_);
120 capacity_ = new_capacity;
[all...] |
| /art/compiler/utils/ |
| assembler.cc | 82 size_t new_capacity = std::min(old_capacity * 2, old_capacity + 1 * MB); local
85 byte* new_contents = NewContents(new_capacity);
96 limit_ = ComputeLimit(new_contents, new_capacity);
99 CHECK_EQ(Capacity(), new_capacity); local
|
| /external/chromium_org/third_party/libjingle/source/talk/base/ |
| atomicops.h | 138 void ClearAndResizeUnsafe(int new_capacity) {
139 capacity_ = new_capacity;
140 data_.reset(new T[new_capacity]);
|
| /external/valgrind/main/drd/ |
| drd_vc.c | 36 void DRD_(vc_reserve)(VectorClock* const vc, const unsigned new_capacity);
311 void DRD_(vc_reserve)(VectorClock* const vc, const unsigned new_capacity)
318 if (new_capacity > vc->capacity)
326 vc->vc, new_capacity * sizeof(vc->vc[0]));
328 else if (vc->vc && new_capacity > VC_PREALLOCATED)
331 && new_capacity > VC_PREALLOCATED
334 new_capacity * sizeof(vc->vc[0]));
341 && new_capacity <= VC_PREALLOCATED
344 else if (new_capacity > VC_PREALLOCATED)
347 && new_capacity > VC_PREALLOCATE
[all...] |
| /bionic/libc/bionic/ |
| scandir.cpp | 50 size_t new_capacity = capacity_ + 32; local
51 dirent** new_names = (dirent**) realloc(names_, new_capacity * sizeof(dirent*));
56 capacity_ = new_capacity;
|
| /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);
|
| /external/chromium/net/spdy/ |
| spdy_frame_builder.cc | 164 bool SpdyFrameBuilder::Resize(size_t new_capacity) {
165 if (new_capacity <= capacity_)
168 char* p = new char[new_capacity];
176 capacity_ = new_capacity;
|
| spdy_frame_builder.h | 137 // the header: new_capacity = sizeof(Header) + desired_payload_capacity.
140 bool Resize(size_t new_capacity);
|
| /external/chromium_org/v8/src/ |
| list-inl.h | 78 int new_capacity = 1 + 2 * capacity_; local
82 Resize(new_capacity, alloc);
88 void List<T, P>::Resize(int new_capacity, P alloc) {
89 ASSERT_LE(length_, new_capacity);
90 T* new_data = NewData(new_capacity, alloc);
94 capacity_ = new_capacity;
|
| utils.h | 720 int new_capacity;
724 new_capacity = min_capacity * growth_factor;
725 if (new_capacity < kMinCapacity) new_capacity = kMinCapacity;
731 new_capacity = current_length + growth;
732 if (new_capacity < min_capacity) {
733 new_capacity = min_capacity + growth;
736 NewChunk(new_capacity);
744 virtual void NewChunk(int new_capacity) {
745 Vector<T> new_chunk = Vector<T>::New(new_capacity);
[all...] |
| /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...] |
| /external/compiler-rt/lib/sanitizer_common/ |
| sanitizer_common.h | 300 uptr new_capacity = RoundUpToPowerOfTwo(size_ + 1);
301 Resize(new_capacity);
324 void Resize(uptr new_capacity) {
325 CHECK_GT(new_capacity, 0);
326 CHECK_LE(size_, new_capacity);
327 T *new_data = (T *)MmapOrDie(new_capacity * sizeof(T),
333 capacity_ = new_capacity;
|
| /external/v8/src/ |
| list-inl.h | 77 int new_capacity = 1 + 2 * capacity_; local
81 Resize(new_capacity);
87 void List<T, P>::Resize(int new_capacity) {
88 T* new_data = List<T, P>::NewData(new_capacity);
92 capacity_ = new_capacity;
|
| utils.h | 628 int new_capacity;
632 new_capacity = min_capacity * growth_factor;
633 if (new_capacity < kMinCapacity) new_capacity = kMinCapacity;
639 new_capacity = current_length + growth;
640 if (new_capacity < min_capacity) {
641 new_capacity = min_capacity + growth;
644 NewChunk(new_capacity);
652 virtual void NewChunk(int new_capacity) {
653 Vector<T> new_chunk = Vector<T>::New(new_capacity);
[all...] |
| list.h | 161 void Resize(int new_capacity);
|
| /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);
389 SharedBuffer* sb = SharedBuffer::alloc(new_capacity * mItemSize);
431 const size_t new_capacity = max(kMinVectorCapacity, new_size*2)
[all...] |
| /external/chromium_org/base/ |
| pickle.cc | 331 bool Pickle::Resize(size_t new_capacity) {
332 new_capacity = AlignInt(new_capacity, kPayloadUnit);
335 void* p = realloc(header_, new_capacity);
340 capacity_ = new_capacity;
|
| /art/runtime/gc/accounting/ |
| atomic_stack.h | 129 void Resize(size_t new_capacity) {
130 capacity_ = new_capacity;
|
| /external/chromium/base/ |
| pickle.cc | 403 bool Pickle::Resize(size_t new_capacity) {
404 new_capacity = AlignInt(new_capacity, kPayloadUnit);
407 void* p = realloc(header_, new_capacity);
412 capacity_ = new_capacity;
|
| /external/flac/libFLAC/ |
| bitwriter.c | 122 unsigned new_capacity; local
129 new_capacity = bw->words + ((bw->bits + bits_to_add + FLAC__BITS_PER_WORD - 1) / FLAC__BITS_PER_WORD);
134 if(bw->capacity >= new_capacity)
138 if((new_capacity - bw->capacity) % FLAC__BITWRITER_DEFAULT_INCREMENT)
139 new_capacity += FLAC__BITWRITER_DEFAULT_INCREMENT - ((new_capacity - bw->capacity) % FLAC__BITWRITER_DEFAULT_INCREMENT);
141 FLAC__ASSERT(0 == (new_capacity - bw->capacity) % FLAC__BITWRITER_DEFAULT_INCREMENT);
142 FLAC__ASSERT(new_capacity > bw->capacity);
143 FLAC__ASSERT(new_capacity >= bw->words + ((bw->bits + bits_to_add + FLAC__BITS_PER_WORD - 1) / FLAC__BITS_PER_WORD));
145 new_buffer = (bwword*)safe_realloc_mul_2op_(bw->buffer, sizeof(bwword), /*times*/new_capacity);
[all...] |
| /external/open-vcdiff/gtest/src/ |
| gtest-internal-inl.h | 455 void Reserve(int new_capacity) {
456 if (new_capacity <= capacity_)
459 capacity_ = new_capacity;
472 const int new_capacity = 3*(capacity_/2 + 1); local
473 GTEST_CHECK_(new_capacity > capacity_) // Does the new capacity overflow?
475 Reserve(new_capacity);
[all...] |
| /external/protobuf/gtest/src/ |
| gtest-internal-inl.h | 451 void Reserve(int new_capacity) {
452 if (new_capacity <= capacity_)
455 capacity_ = new_capacity;
468 const int new_capacity = 3*(capacity_/2 + 1); local
469 GTEST_CHECK_(new_capacity > capacity_) // Does the new capacity overflow?
471 Reserve(new_capacity);
[all...] |
