Searched defs:new_capacity (Results 1 - 25 of 27) sorted by relevance

12

/external/chromium_org/third_party/libjingle/source/talk/base/
H A Datomicops.h138 void ClearAndResizeUnsafe(int new_capacity) { argument
139 capacity_ = new_capacity;
140 data_.reset(new T[new_capacity]);
/external/chromium/net/spdy/
H A Dspdy_frame_builder.cc164 bool SpdyFrameBuilder::Resize(size_t new_capacity) { argument
165 if (new_capacity <= capacity_)
168 char* p = new char[new_capacity];
176 capacity_ = new_capacity;
/external/chromium_org/native_client_sdk/src/libraries/xray/
H A Dhashtable.c138 int new_capacity = old_capacity * 2; local
141 XRayHashTableInit(table, new_capacity);
/external/valgrind/main/drd/
H A Ddrd_vc.c36 void DRD_(vc_reserve)(VectorClock* const vc, const unsigned new_capacity);
311 void DRD_(vc_reserve)(VectorClock* const vc, const unsigned new_capacity) argument
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...]
/external/chromium/base/
H A Dpickle.cc403 bool Pickle::Resize(size_t new_capacity) { argument
404 new_capacity = AlignInt(new_capacity, kPayloadUnit);
407 void* p = realloc(header_, new_capacity);
412 capacity_ = new_capacity;
/external/chromium_org/base/
H A Dpickle.cc283 void Pickle::Resize(size_t new_capacity) { argument
284 new_capacity = AlignInt(new_capacity, kPayloadUnit);
287 void* p = realloc(header_, header_size_ + new_capacity);
290 capacity_after_header_ = new_capacity;
/external/chromium_org/v8/src/
H A Dlist-inl.h78 int new_capacity = 1 + 2 * capacity_; local
82 Resize(new_capacity, alloc);
88 void List<T, P>::Resize(int new_capacity, P alloc) { argument
89 ASSERT_LE(length_, new_capacity);
90 T* new_data = NewData(new_capacity, alloc);
94 capacity_ = new_capacity;
H A Dscanner.h270 int new_capacity = Min(capacity * kGrowthFactory, capacity + kMaxGrowth); local
271 return new_capacity;
H A Delements.cc954 uint32_t new_capacity = length > min ? length : min; local
955 if (!array->ShouldConvertToSlowElements(new_capacity)) {
957 SetFastElementsCapacityAndLength(array, new_capacity, length);
H A Disolate.cc474 int new_capacity = JSObject::NewElementsCapacity(elements->length()); local
476 factory()->NewFixedArrayWithHoles(new_capacity);
1714 int new_capacity = static_cast<int>((capacity + 10) * 1.2); local
1715 Object** new_array = new Object*[new_capacity];
1721 set_serialize_partial_snapshot_cache_capacity(new_capacity);
H A Dspaces.cc1319 int new_capacity = Min(MaximumCapacity(), 2 * static_cast<int>(Capacity())); local
1320 if (to_space_.GrowTo(new_capacity)) {
1322 if (!from_space_.GrowTo(new_capacity)) {
1337 int new_capacity = Max(InitialCapacity(), 2 * SizeAsInt()); local
1338 int rounded_new_capacity = RoundUp(new_capacity, Page::kPageSize);
1594 bool SemiSpace::GrowTo(int new_capacity) { argument
1598 ASSERT((new_capacity & Page::kPageAlignmentMask) == 0);
1599 ASSERT(new_capacity <= maximum_capacity_);
1600 ASSERT(new_capacity > capacity_);
1602 int pages_after = new_capacity / Pag
1630 ShrinkTo(int new_capacity) argument
1714 SetCapacity(int new_capacity) argument
[all...]
H A Dhydrogen.cc1323 HValue* new_capacity = BuildNewElementsCapacity(key); local
1326 new_capacity);
2299 HValue* new_capacity = AddUncasted<HAdd>(half_old_capacity, old_capacity); local
2300 new_capacity->ClearFlag(HValue::kCanOverflow);
2304 new_capacity = AddUncasted<HAdd>(new_capacity, min_growth);
2305 new_capacity->ClearFlag(HValue::kCanOverflow);
2307 return new_capacity;
2327 HValue* new_capacity) {
2328 BuildNewSpaceArrayCheck(new_capacity, new_kin
2322 BuildGrowElementsCapacity(HValue* object, HValue* elements, ElementsKind kind, ElementsKind new_kind, HValue* length, HValue* new_capacity) argument
[all...]
H A Dobjects.cc12191 uint32_t new_capacity = capacity; local
12222 new_capacity = NewElementsCapacity(index + 1);
12223 ASSERT(new_capacity > index);
12224 if (!object->ShouldConvertToSlowElements(new_capacity)) {
12243 SetFastDoubleElementsCapacityAndLength(object, new_capacity, array_length);
12260 if (new_capacity != capacity) {
12266 SetFastElementsCapacityAndLength(object, new_capacity, array_length,
12502 int new_capacity = NewElementsCapacity(index+1); local
12503 if (!object->ShouldConvertToSlowElements(new_capacity)) {
12504 ASSERT(static_cast<uint32_t>(new_capacity) > inde
13155 ShouldConvertToSlowElements(int new_capacity) argument
[all...]
/external/marisa-trie/lib/marisa/
H A Dvector-inline.h162 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) { argument
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;
/external/marisa-trie/v0_1_5/lib/marisa_alpha/
H A Dvector-inline.h162 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) { argument
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;
/external/v8/src/
H A Dlist-inl.h77 int new_capacity = 1 + 2 * capacity_; local
81 Resize(new_capacity);
87 void List<T, P>::Resize(int new_capacity) { argument
88 T* new_data = List<T, P>::NewData(new_capacity);
92 capacity_ = new_capacity;
H A Delements.cc663 uint32_t new_capacity = length > min ? length : min; local
664 if (!array->ShouldConvertToSlowElements(new_capacity)) {
666 SetFastElementsCapacityAndLength(array, new_capacity, length);
H A Dscanner.h231 int new_capacity = Min(capacity * kGrowthFactory, capacity + kMaxGrowth); local
232 return new_capacity;
H A Dspaces.cc1099 int new_capacity = Min(MaximumCapacity(), 2 * static_cast<int>(Capacity())); local
1100 if (to_space_.GrowTo(new_capacity)) {
1102 if (!from_space_.GrowTo(new_capacity)) {
1117 int new_capacity = Max(InitialCapacity(), 2 * SizeAsInt()); local
1118 int rounded_new_capacity = RoundUp(new_capacity, Page::kPageSize);
1351 bool SemiSpace::GrowTo(int new_capacity) { argument
1355 ASSERT((new_capacity & Page::kPageAlignmentMask) == 0);
1356 ASSERT(new_capacity <= maximum_capacity_);
1357 ASSERT(new_capacity > capacity_);
1359 int pages_after = new_capacity / Pag
1389 ShrinkTo(int new_capacity) argument
[all...]
/external/chromium_org/third_party/libphonenumber/src/phonenumbers/utf/
H A Dunicodetext.cc108 void UnicodeText::Repr::reserve(int new_capacity) { argument
110 if (capacity_ >= new_capacity && ours_) return;
113 capacity_ = max(new_capacity, (3 * capacity_) / 2 + 20);
/external/flac/libFLAC/
H A Dbitwriter.c122 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/v8/test/cctest/
H A Dtest-heap.cc1279 intptr_t old_capacity, new_capacity; local
1282 new_capacity = new_space->Capacity();
1283 CHECK(2 * old_capacity == new_capacity);
1287 new_capacity = new_space->Capacity();
1288 CHECK(old_capacity == new_capacity);
1293 new_capacity = new_space->Capacity();
1294 CHECK(old_capacity == new_capacity);
1303 new_capacity = new_space->Capacity();
1304 CHECK(old_capacity == 2 * new_capacity);
1311 new_capacity
1320 intptr_t old_capacity, new_capacity; local
[all...]
/external/chromium_org/v8/test/cctest/
H A Dtest-heap.cc1683 intptr_t old_capacity, new_capacity; local
1686 new_capacity = new_space->Capacity();
1687 CHECK(2 * old_capacity == new_capacity);
1691 new_capacity = new_space->Capacity();
1692 CHECK(old_capacity == new_capacity);
1697 new_capacity = new_space->Capacity();
1698 CHECK(old_capacity == new_capacity);
1707 new_capacity = new_space->Capacity();
1708 CHECK(old_capacity == 2 * new_capacity);
1715 new_capacity
1733 intptr_t old_capacity, new_capacity; local
[all...]
/external/open-vcdiff/gtest/src/
H A Dgtest-internal-inl.h455 void Reserve(int new_capacity) { argument
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);
/external/protobuf/gtest/src/
H A Dgtest-internal-inl.h451 void Reserve(int new_capacity) { argument
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);

Completed in 894 milliseconds

12