Searched refs:EnsureCapacity (Results 1 - 24 of 24) sorted by relevance

/external/chromium_org/v8/src/
H A Dregexp-stack.cc37 regexp_stack_->EnsureCapacity(0);
89 Address RegExpStack::EnsureCapacity(size_t size) { function in class:v8::internal::RegExpStack
H A Dregexp-stack.h83 Address EnsureCapacity(size_t size);
133 // you have to call EnsureCapacity before using it again.
H A Dbignum.cc55 EnsureCapacity(1);
68 EnsureCapacity(needed_bigits);
139 EnsureCapacity(needed_bigits);
192 EnsureCapacity(1 + Max(BigitLength(), other.BigitLength()) - exponent_);
245 EnsureCapacity(used_digits_ + 1);
268 EnsureCapacity(used_digits_ + 1);
295 EnsureCapacity(used_digits_ + 1);
346 EnsureCapacity(product_length);
439 EnsureCapacity(final_size / kBigitSize + 2);
707 EnsureCapacity(used_digits
[all...]
H A Dbignum.h110 void EnsureCapacity(int size) { function in class:v8::internal::Bignum
H A Ddata-flow.h227 EnsureCapacity(value, zone);
246 void EnsureCapacity(int value, Zone* zone) { function in class:v8::internal::BASE_EMBEDDED
H A Dregexp-macro-assembler.cc281 Address new_stack_base = regexp_stack->EnsureCapacity(size * 2);
H A Dobjects.cc7430 { MaybeObject* maybe_obj = EnsureCapacity(1, &key);
7622 { MaybeObject* maybe_obj = EnsureCapacity(1, &key);
13640 // EnsureCapacity will guarantee the hash table is never full.
13700 MaybeObject* HashTable<Shape, Key>::EnsureCapacity(int n, Key key) { function in class:v8::internal::HashTable
13765 // EnsureCapacity will guarantee the hash table is never full.
13861 EnsureCapacity(int, uint32_t);
13864 EnsureCapacity(int, uint32_t);
13867 EnsureCapacity(int, Name*);
14526 { MaybeObject* maybe_obj = EnsureCapacity(1, key);
14536 // If the string table grew as part of EnsureCapacity, ob
14829 MaybeObject* Dictionary<Shape, Key>::EnsureCapacity(int n, Key key) { function in class:v8::internal::Dictionary
[all...]
H A Druntime.cc3145 void EnsureCapacity(int elements) { function in class:v8::internal::FixedArrayBuilder
3254 void EnsureCapacity(int elements) { function in class:v8::internal::ReplacementStringBuilder
3255 array_builder_.EnsureCapacity(elements);
3899 builder.EnsureCapacity(parts_added_per_loop);
3924 builder.EnsureCapacity(2);
4498 builder.EnsureCapacity(kMaxBuilderEntriesPerRegExpMatch);
4565 builder.EnsureCapacity(1);
H A Dobjects.h3550 MUST_USE_RESULT MaybeObject* EnsureCapacity(int n, Key key);
3749 MUST_USE_RESULT MaybeObject* EnsureCapacity(int n, Key key);
/external/v8/src/
H A Dregexp-stack.cc37 regexp_stack_->EnsureCapacity(0);
90 Address RegExpStack::EnsureCapacity(size_t size) { function in class:v8::internal::RegExpStack
H A Dregexp-stack.h83 Address EnsureCapacity(size_t size);
133 // you have to call EnsureCapacity before using it again.
H A Dbignum.cc54 EnsureCapacity(1);
67 EnsureCapacity(needed_bigits);
138 EnsureCapacity(needed_bigits);
191 EnsureCapacity(1 + Max(BigitLength(), other.BigitLength()) - exponent_);
244 EnsureCapacity(used_digits_ + 1);
267 EnsureCapacity(used_digits_ + 1);
294 EnsureCapacity(used_digits_ + 1);
345 EnsureCapacity(product_length);
438 EnsureCapacity(final_size / kBigitSize + 2);
706 EnsureCapacity(used_digits
[all...]
H A Dbignum.h110 void EnsureCapacity(int size) { function in class:v8::internal::Bignum
H A Dlithium-allocator.h412 EnsureCapacity(value, zone);
423 void EnsureCapacity(int value, Zone* zone) { function in class:v8::internal::BASE_EMBEDDED
H A Dregexp-macro-assembler.cc260 Address new_stack_base = regexp_stack->EnsureCapacity(size * 2);
H A Dobjects.cc5344 { MaybeObject* maybe_obj = EnsureCapacity(1, &key);
5535 { MaybeObject* maybe_obj = EnsureCapacity(1, &key);
10909 // EnsureCapacity will guarantee the hash table is never full.
10994 MaybeObject* HashTable<Shape, Key>::EnsureCapacity(int n, Key key) { function in class:v8::internal::HashTable
11053 // EnsureCapacity will guarantee the hash table is never full.
11148 EnsureCapacity(int, uint32_t);
11151 EnsureCapacity(int, uint32_t);
11154 EnsureCapacity(int, String*);
11762 { MaybeObject* maybe_obj = EnsureCapacity(1, key);
11772 // If the symbol table grew as part of EnsureCapacity, ob
12030 MaybeObject* Dictionary<Shape, Key>::EnsureCapacity(int n, Key key) { function in class:v8::internal::Dictionary
[all...]
H A Dobjects.h2860 MUST_USE_RESULT MaybeObject* EnsureCapacity(int n, Key key);
3044 MUST_USE_RESULT MaybeObject* EnsureCapacity(int n, Key key);
H A Druntime.cc2319 void EnsureCapacity(int elements) { function in class:v8::internal::FixedArrayBuilder
2432 void EnsureCapacity(int elements) { function in class:v8::internal::ReplacementStringBuilder
2433 array_builder_.EnsureCapacity(elements);
3030 builder.EnsureCapacity(parts_added_per_loop);
3718 builder->EnsureCapacity(kMaxBuilderEntriesPerRegExpMatch);
3796 builder->EnsureCapacity(kMaxBuilderEntriesPerRegExpMatch);
3880 builder->EnsureCapacity(kMaxBuilderEntriesPerRegExpMatch);
/external/lzma/CPP/Common/
H A DDynamicBuffer.h39 void EnsureCapacity(size_t capacity) function in class:CDynamicBuffer
/external/chromium_org/third_party/WebKit/Source/wtf/dtoa/
H A Dbignum.cc56 EnsureCapacity(1);
69 EnsureCapacity(needed_bigits);
140 EnsureCapacity(needed_bigits);
193 EnsureCapacity(1 + Max(BigitLength(), other.BigitLength()) - exponent_);
246 EnsureCapacity(used_digits_ + 1);
269 EnsureCapacity(used_digits_ + 1);
296 EnsureCapacity(used_digits_ + 1);
347 EnsureCapacity(product_length);
440 EnsureCapacity(final_size / kBigitSize + 2);
708 EnsureCapacity(used_digits
[all...]
H A Dbignum.h112 void EnsureCapacity(int size) { function in class:WTF::double_conversion::Bignum
/external/lzma/CPP/7zip/Common/
H A DStreamObjects.cpp48 bool CByteDynBuffer::EnsureCapacity(size_t cap) function in class:CByteDynBuffer
73 if (!_buffer.EnsureCapacity(addSize))
H A DStreamObjects.h53 bool EnsureCapacity(size_t capacity);
/external/tinyxml2/
H A Dtinyxml2.h179 EnsureCapacity( size+1 );
185 EnsureCapacity( size+count );
209 void EnsureCapacity( int cap ) { function in class:tinyxml2::DynArray

Completed in 693 milliseconds