| /prebuilts/gcc/linux-x86/arm/arm-linux-androideabi-4.6/lib/gcc/arm-linux-androideabi/4.6.x-google/plugin/include/ |
| cif-code.def | 70 DEFCIFCODE(UNLIKELY_CALL, N_("call is unlikely and code size would grow"))
74 N_("function not declared inline and code size would grow"))
78 N_("optimizing for size and code size would grow"))
|
| /external/clang/include/clang/Analysis/Support/ |
| BumpVector.h | 156 grow(C);
173 grow(C, size() + Cnt);
180 grow(C, N);
188 /// grow - double the size of the allocated memory, guaranteeing space for at
190 void grow(BumpVectorContext &C, size_type MinSize = 1);
215 void BumpVector<T>::grow(BumpVectorContext &C, size_t MinSize) { function in class:clang::BumpVector
|
| /development/samples/Support4Demos/res/layout/ |
| sliding_pane_layout.xml | 36 pane should grow to consume leftover available space when the
38 responsively grow in width on larger screens while still
|
| /external/bison/lib/ |
| obstack_printf.c | 29 /* Grow an obstack with formatted output. Return the number of bytes
47 /* Grow an obstack with formatted output. Return the number of bytes
|
| /external/clang/include/clang/AST/ |
| ASTVector.h | 165 grow(C);
171 grow(C, N);
187 // Grow allocated space if needed.
189 this->grow(C, this->size()+NumInputs);
201 // Grow allocated space if needed.
203 this->grow(C, this->size()+NumInputs);
233 this->grow(C);
344 this->grow(C, N);
351 /// grow - double the size of the allocated memory, guaranteeing space for at
353 void grow(ASTContext &C, size_type MinSize = 1)
373 void ASTVector<T>::grow(ASTContext &C, size_t MinSize) { function in class:clang::ASTVector
[all...] |
| /external/icu4c/layoutex/layout/ |
| RunArrays.h | 33 * When an array needs to grow, it will double in size until
34 * it becomes this large, then it will grow by this amount.
128 * calling the <code>grow</code> method.
136 * first call this method to grow the data arrays, and use the return value
144 * @see grow
180 * Grow a data array to the given initial size. This method will be
183 * the overriding method to grow the limit indices array.
191 virtual void grow(le_int32 capacity);
329 * <code>RunArray::add(limit)</code> which will create or grow the arrays as needed.
336 * The new <code>add</code> method should first call this method to grow the font and limit indice
[all...] |
| /art/runtime/gc/space/ |
| dlmalloc_space.h | 52 // Allocate num_bytes without allowing the underlying mspace to grow.
56 // Allocate num_bytes allowing the underlying mspace to grow.
93 // allocations fail we GC before increasing the footprint limit and allowing the mspace to grow.
189 // The underlying mem_map_ controls the maximum size we allow the heap to grow to. The growth
|
| /external/apache-xml/src/main/java/org/apache/xpath/objects/ |
| package.html | 22 <p>Implementation of XPath polymorphic type objects -- this package will grow
|
| /external/chromium/app/sql/ |
| diagnostic_error_delegate.h | 43 // 26 currently but 50 gives them room to grow.
|
| /external/chromium_org/ppapi/native_client/src/untrusted/nacl_ppapi_util/ |
| string_buffer.cc | 53 // insufficient space -- grow the buffer
|
| /external/chromium_org/third_party/icu/source/test/perf/usetperf/ |
| bitset.cpp | 52 while (newLen < minLen) newLen <<= 1; // grow exponentially
|
| /external/clang/lib/Sema/ |
| TypeLocBuilder.cpp | 45 void TypeLocBuilder::grow(size_t NewCapacity) { function in class:TypeLocBuilder
73 // If we need to grow, grow by a factor of 2.
79 grow(NewCapacity);
|
| /external/dropbear/libtommath/ |
| bn_mp_2expt.c | 31 /* grow a to accomodate the single bit */
|
| bn_mp_copy.c | 29 /* grow dest */
|
| /external/hamcrest/src/org/hamcrest/ |
| Matcher.java | 11 * which will ensure that the Matcher API can grow to support
|
| /external/icu4c/test/perf/usetperf/ |
| bitset.cpp | 52 while (newLen < minLen) newLen <<= 1; // grow exponentially
|
| /external/libvorbis/lib/ |
| registry.c | 22 /* seems like major overkill now; the backend numbers will grow into
|
| /external/llvm/test/ |
| CMakeLists.txt | 15 # Set the depends list as a variable so that it can grow conditionally.
|
| /external/valgrind/main/none/tests/ |
| sigstackgrowth.c | 20 frame will be cleared, the stack will never grow, and we'll be in
|
| /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/common/layout/ |
| SeekBarRule.java | 38 // almost no usable width -- so just make it grow in all layouts
|
| /external/chromium_org/third_party/icu/source/test/intltest/ |
| idnaref.cpp | 144 /* we do not have enough room so grow the buffer*/
165 /* we do not have enough room so grow the buffer*/
299 /* we do not have enough room so grow the buffer*/
357 /* we do not have enough room so grow the buffer*/
487 /* we do not have enough room so grow the buffer*/
508 /* we do not have enough room so grow the buffer*/
531 /* we do not have enough room so grow the buffer*/
550 /* we do not have enough room so grow the buffer*/
730 /* we do not have enough room so grow the buffer*/
780 /* we do not have enough room so grow the buffer*
[all...] |
| /external/icu4c/test/intltest/ |
| idnaref.cpp | 144 /* we do not have enough room so grow the buffer*/
165 /* we do not have enough room so grow the buffer*/
300 /* we do not have enough room so grow the buffer*/
359 /* we do not have enough room so grow the buffer*/
489 /* we do not have enough room so grow the buffer*/
510 /* we do not have enough room so grow the buffer*/
533 /* we do not have enough room so grow the buffer*/
552 /* we do not have enough room so grow the buffer*/
732 /* we do not have enough room so grow the buffer*/
782 /* we do not have enough room so grow the buffer*
[all...] |
| /external/llvm/lib/Support/ |
| SmallPtrSet.cpp | 50 // Otherwise, hit the big set case, which will call grow.
54 // If more than 3/4 of the array is full, grow.
55 Grow(CurArraySize < 64 ? 128 : CurArraySize*2);
59 Grow(CurArraySize);
128 /// Grow - Allocate a larger backing store for the buckets and move it over.
130 void SmallPtrSetImpl::Grow(unsigned NewSize) {
|
| /external/antlr/antlr-3.4/runtime/Java/src/main/java/org/antlr/runtime/misc/ |
| FastQueue.java | 34 /** A queue that can dequeue and get(i) in O(1) and grow arbitrarily large.
40 * buffer will not grow too large.
|
| /external/antlr/antlr-3.4/runtime/ObjC/Framework/ |
| FastQueue.h | 34 /** A queue that can dequeue and get(i) in O(1) and grow arbitrarily large.
40 * buffer will not grow too large.
|
