| /external/valgrind/main/drd/ |
| D | drd_vc.c | 37 void DRD_(vc_reserve)(VectorClock* const vc, const unsigned new_capacity);
312 void DRD_(vc_reserve)(VectorClock* const vc, const unsigned new_capacity) in DRD_()
319 if (new_capacity > vc->capacity) in DRD_()
327 vc->vc, new_capacity * sizeof(vc->vc[0])); in DRD_()
329 else if (vc->vc && new_capacity > VC_PREALLOCATED) in DRD_()
332 && new_capacity > VC_PREALLOCATED in DRD_()
335 new_capacity * sizeof(vc->vc[0])); in DRD_()
342 && new_capacity <= VC_PREALLOCATED in DRD_()
345 else if (new_capacity > VC_PREALLOCATED) in DRD_()
348 && new_capacity > VC_PREALLOCATED in DRD_()
[all …]
|
| /external/chromium/net/spdy/ |
| D | spdy_frame_builder.cc | 164 bool SpdyFrameBuilder::Resize(size_t new_capacity) { in Resize() argument
165 if (new_capacity <= capacity_) in Resize()
168 char* p = new char[new_capacity]; in Resize()
176 capacity_ = new_capacity; in Resize()
|
| D | spdy_frame_builder.h | 140 bool Resize(size_t new_capacity);
|
| /external/v8/src/ |
| D | utils.h | 628 int new_capacity; in Grow() local
632 new_capacity = min_capacity * growth_factor; in Grow()
633 if (new_capacity < kMinCapacity) new_capacity = kMinCapacity; in Grow()
639 new_capacity = current_length + growth; in Grow()
640 if (new_capacity < min_capacity) { in Grow()
641 new_capacity = min_capacity + growth; in Grow()
644 NewChunk(new_capacity); in Grow()
652 virtual void NewChunk(int new_capacity) { in NewChunk() argument
653 Vector<T> new_chunk = Vector<T>::New(new_capacity); in NewChunk()
715 virtual void NewChunk(int new_capacity) { in NewChunk() argument
[all …]
|
| D | list-inl.h | 77 int new_capacity = 1 + 2 * capacity_; in ResizeAddInternal() local
81 Resize(new_capacity); in ResizeAddInternal()
87 void List<T, P>::Resize(int new_capacity) { in Resize() argument
88 T* new_data = List<T, P>::NewData(new_capacity); in Resize()
92 capacity_ = new_capacity; in Resize()
|
| D | spaces.cc | 1099 int new_capacity = Min(MaximumCapacity(), 2 * static_cast<int>(Capacity())); in Grow() local
1100 if (to_space_.GrowTo(new_capacity)) { in Grow()
1102 if (!from_space_.GrowTo(new_capacity)) { in Grow()
1117 int new_capacity = Max(InitialCapacity(), 2 * SizeAsInt()); in Shrink() local
1118 int rounded_new_capacity = RoundUp(new_capacity, Page::kPageSize); in Shrink()
1351 bool SemiSpace::GrowTo(int new_capacity) { in GrowTo() argument
1355 ASSERT((new_capacity & Page::kPageAlignmentMask) == 0); in GrowTo()
1356 ASSERT(new_capacity <= maximum_capacity_); in GrowTo()
1357 ASSERT(new_capacity > capacity_); in GrowTo()
1359 int pages_after = new_capacity / Page::kPageSize; in GrowTo()
[all …]
|
| D | string-stream.cc | 60 unsigned new_capacity = capacity_; in Put() local
61 char* new_buffer = allocator_->grow(&new_capacity); in Put()
62 if (new_capacity > capacity_) { in Put()
63 capacity_ = new_capacity; in Put()
|
| D | scanner.h | 231 int new_capacity = Min(capacity * kGrowthFactory, capacity + kMaxGrowth); in NewCapacity() local
232 return new_capacity; in NewCapacity()
|
| D | list.h | 161 void Resize(int new_capacity);
|
| D | elements.cc | 663 uint32_t new_capacity = length > min ? length : min; in SetLengthWithoutNormalize() local
664 if (!array->ShouldConvertToSlowElements(new_capacity)) { in SetLengthWithoutNormalize()
666 SetFastElementsCapacityAndLength(array, new_capacity, length); in SetLengthWithoutNormalize()
|
| D | objects.cc | 9147 uint32_t new_capacity = capacity; in SetFastElement() local
9163 new_capacity = NewElementsCapacity(index + 1); in SetFastElement()
9164 ASSERT(new_capacity > index); in SetFastElement()
9165 if (!ShouldConvertToSlowElements(new_capacity)) { in SetFastElement()
9179 SetFastDoubleElementsCapacityAndLength(new_capacity, array_length); in SetFastElement()
9198 if (new_capacity != capacity) { in SetFastElement()
9205 SetFastElementsCapacityAndLength(new_capacity, in SetFastElement()
9427 int new_capacity = NewElementsCapacity(index+1); in SetFastDoubleElement() local
9428 if (!ShouldConvertToSlowElements(new_capacity)) { in SetFastDoubleElement()
9429 ASSERT(static_cast<uint32_t>(new_capacity) > index); in SetFastDoubleElement()
[all …]
|
| D | spaces.h | 1832 bool GrowTo(int new_capacity);
1837 bool ShrinkTo(int new_capacity);
|
| D | objects.h | 1728 bool ShouldConvertToSlowElements(int new_capacity);
|
| D | runtime.cc | 12961 int new_capacity = JSObject::NewElementsCapacity(elements->length()); in RUNTIME_FUNCTION() local
12963 factory->NewFixedArrayWithHoles(new_capacity); in RUNTIME_FUNCTION()
|
| /external/flac/libFLAC/ |
| D | bitwriter.c | 122 unsigned new_capacity; in bitwriter_grow_() local
129 …new_capacity = bw->words + ((bw->bits + bits_to_add + FLAC__BITS_PER_WORD - 1) / FLAC__BITS_PER_WO… in bitwriter_grow_()
134 if(bw->capacity >= new_capacity) in bitwriter_grow_()
138 if((new_capacity - bw->capacity) % FLAC__BITWRITER_DEFAULT_INCREMENT) in bitwriter_grow_()
139 …new_capacity += FLAC__BITWRITER_DEFAULT_INCREMENT - ((new_capacity - bw->capacity) % FLAC__BITWRIT… in bitwriter_grow_()
141 FLAC__ASSERT(0 == (new_capacity - bw->capacity) % FLAC__BITWRITER_DEFAULT_INCREMENT); in bitwriter_grow_()
142 FLAC__ASSERT(new_capacity > bw->capacity); in bitwriter_grow_()
143 …FLAC__ASSERT(new_capacity >= bw->words + ((bw->bits + bits_to_add + FLAC__BITS_PER_WORD - 1) / FLA… in bitwriter_grow_()
145 new_buffer = (bwword*)safe_realloc_mul_2op_(bw->buffer, sizeof(bwword), /*times*/new_capacity); in bitwriter_grow_()
149 bw->capacity = new_capacity; in bitwriter_grow_()
|
| /external/chromium/base/ |
| D | pickle.cc | 403 bool Pickle::Resize(size_t new_capacity) { in Resize() argument
404 new_capacity = AlignInt(new_capacity, kPayloadUnit); in Resize()
407 void* p = realloc(header_, new_capacity); in Resize()
412 capacity_ = new_capacity; in Resize()
|
| D | pickle.h | 211 bool Resize(size_t new_capacity);
|
| /external/astl/include/ |
| D | vector | 324 const size_type new_capacity = grow();
325 if (0 == new_capacity || !reserve(new_capacity)) return;
471 size_type new_capacity;
474 new_capacity = mCapacity + kLinearIncrement;
478 new_capacity = mCapacity == 0 ? kExponentialFactor : mCapacity * kExponentialFactor;
480 if (mCapacity > new_capacity || new_capacity > max_size())
482 new_capacity = mCapacity == max_size() ? 0 : max_size();
484 return new_capacity;
|
| /external/v8/test/cctest/ |
| D | test-heap.cc | 1279 intptr_t old_capacity, new_capacity; in TEST() local
1282 new_capacity = new_space->Capacity(); in TEST()
1283 CHECK(2 * old_capacity == new_capacity); in TEST()
1287 new_capacity = new_space->Capacity(); in TEST()
1288 CHECK(old_capacity == new_capacity); in TEST()
1293 new_capacity = new_space->Capacity(); in TEST()
1294 CHECK(old_capacity == new_capacity); in TEST()
1303 new_capacity = new_space->Capacity(); in TEST()
1304 CHECK(old_capacity == 2 * new_capacity); in TEST()
1311 new_capacity = new_space->Capacity(); in TEST()
[all …]
|
| /external/protobuf/gtest/src/ |
| D | gtest-internal-inl.h | 451 void Reserve(int new_capacity) { in Reserve() argument
452 if (new_capacity <= capacity_) in Reserve()
455 capacity_ = new_capacity; in Reserve()
468 const int new_capacity = 3*(capacity_/2 + 1); in GrowIfNeeded() local
469 GTEST_CHECK_(new_capacity > capacity_) // Does the new capacity overflow? in GrowIfNeeded()
471 Reserve(new_capacity); in GrowIfNeeded()
|