| /external/valgrind/main/none/tests/linux/ |
| mremap.stderr.exp | 2 mremap(grow, nomove, constrained): Cannot allocate memory
|
| mremap.stderr.exp-glibc27 | 2 mremap(grow, fixed): Cannot allocate memory
3 grow, nomove: p=0x........ np=0x........: shrink moved?!
4 grow, maymove: p=0x........ np=0x........: shrink moved?!
5 mremap(grow, nomove, constrained): Cannot allocate memory
|
| mremap.c | 55 np = mremap(p, 1024*1024, 2048*1024, 0); /* grow, fixed */
57 perror("mremap(grow, fixed)");
59 fprintf(stderr, "grow, nomove: p=%p np=%p: shrink moved?!\n",
65 np = mremap(p, 1024*1024, 2048*1024, MREMAP_MAYMOVE); /* grow, maymove */
67 perror("mremap(grow, maymove)");
69 fprintf(stderr, "grow, maymove: p=%p np=%p: shrink moved?!\n",
76 np = mremap(p, 512*1024, 1024*1024, 0); /* grow, nomove, constrained */
78 perror("mremap(grow, nomove, constrained)");
80 fprintf(stderr, "grow, maymove, constrained: p=%p np=%p (managed to grow without moving?!)\n"
[all...] |
| /external/webkit/Source/WebKit2/Platform/CoreIPC/ |
| ArgumentEncoder.cpp | 66 uint8_t* ArgumentEncoder::grow(unsigned alignment, size_t size) function in class:CoreIPC::ArgumentEncoder
93 uint8_t* buffer = grow(1, size);
100 uint8_t* buffer = grow(sizeof(n), sizeof(n));
107 uint8_t* buffer = grow(sizeof(n), sizeof(n));
114 uint8_t* buffer = grow(sizeof(n), sizeof(n));
121 uint8_t* buffer = grow(sizeof(n), sizeof(n));
128 uint8_t* buffer = grow(sizeof(n), sizeof(n));
135 uint8_t* buffer = grow(sizeof(n), sizeof(n));
142 uint8_t* buffer = grow(sizeof(n), sizeof(n));
|
| /external/icu4c/layoutex/ |
| RunArrays.cpp | 43 grow(fCapacity);
55 void RunArray::grow(le_int32 newCapacity) function in class:RunArray
98 void FontRuns::grow(le_int32 capacity) function in class:FontRuns
100 RunArray::grow(capacity);
150 void LocaleRuns::grow(le_int32 capacity) function in class:LocaleRuns
152 RunArray::grow(capacity);
202 void ValueRuns::grow(le_int32 capacity) function in class:ValueRuns
204 RunArray::grow(capacity);
|
| /external/webkit/Source/JavaScriptCore/assembler/ |
| AssemblerBuffer.h | 60 grow();
78 grow();
92 grow();
113 grow();
121 grow();
171 grow(size);
177 void grow(int extraCapacity = 0) function in class:JSC::AssemblerBuffer
|
| /external/webkit/Source/JavaScriptCore/heap/ |
| HandleStack.cpp | 39 grow();
56 void HandleStack::grow() function in class:JSC::HandleStack
58 HandleSlot block = m_blockStack.grow();
|
| ConservativeRoots.h | 55 void grow();
84 grow();
|
| /external/llvm/lib/Support/ |
| IntervalMap.cpp | 122 unsigned Position, bool Grow) {
123 assert(Elements + Grow <= Nodes * Capacity && "Not enough room for elements");
129 const unsigned PerNode = (Elements + Grow) / Nodes;
130 const unsigned Extra = (Elements + Grow) % Nodes;
138 assert(Sum == Elements + Grow && "Bad distribution sum");
140 // Subtract the Grow element that was added.
141 if (Grow) {
143 assert(NewSize[PosPair.first] && "Too few elements to need Grow");
|
| SmallVector.cpp | 17 /// grow_pod - This is an implementation of the grow() method which only works
21 size_t NewCapacityInBytes = 2 * capacity_in_bytes() + TSize; // Always grow.
32 // If this wasn't grown from the inline copy, grow the allocated space.
|
| SmallPtrSet.cpp | 52 // Otherwise, hit the big set case, which will call grow.
56 // If more than 3/4 of the array is full, grow.
57 Grow(CurArraySize < 64 ? 128 : CurArraySize*2);
61 Grow(CurArraySize);
130 /// Grow - Allocate a larger backing store for the buckets and move it over.
132 void SmallPtrSetImpl::Grow(unsigned NewSize) {
|
| /external/valgrind/main/none/tests/ |
| thread-exits.c | 13 grow the stack. If we don't get the siginfo, then it just looks
19 attempts to grow the stack once all the threads have been created
47 static void grow(int depth) function
54 grow(depth-1);
115 grow(10);
|
| /external/iptables/extensions/ |
| libxt_quota2.man | 10 \fB\-\-grow\fP
27 negation has no effect when \fB\-\-grow\fP is used.
36 \-A INPUT \-p tcp \-\-dport 6881 \-m quota \-\-name bt \-\-grow;
|
| libxt_quota2.c | 37 {.name = "grow", .id = O_GROW, .type = XTTYPE_NONE},
52 " --grow provide an increasing counter\n"
92 printf(" --grow ");
|
| /external/llvm/include/llvm/ADT/ |
| IntEqClasses.h | 42 IntEqClasses(unsigned N = 0) : NumClasses(0) { grow(N); }
44 /// grow - Increase capacity to hold 0 .. N-1, putting new integers in unique
47 void grow(unsigned N);
49 /// clear - Clear all classes so that grow() will assign a unique class to
|
| SmallVector.h | 91 /// grow_pod - This is an implementation of the grow() method which only works
194 /// grow - double the size of the allocated memory, guaranteeing space for at
196 void grow(size_t MinSize = 0);
201 void SmallVectorTemplateBase<T, isPodLike>::grow(size_t MinSize) {
204 size_t NewCapacity = 2*CurCapacity + 1; // Always grow, even from zero.
253 /// grow - double the size of the allocated memory, guaranteeing space for at
255 void grow(size_t MinSize = 0) { function in class:llvm::SmallVectorTemplateCommon::SmallVectorTemplateBase
299 this->grow(N);
311 this->grow(N);
319 this->grow(N)
[all...] |
| /cts/tests/res/anim/ |
| lineartest.xml | 29 <animate target="paint" id="grow" field="textSize" from="12" to="15" dur=".25"/>
32 <event kind="onEnd" target="grow">
|
| /external/guava/src/com/google/common/base/ |
| Platform.java | 46 * The starting size is 1024 characters. If we grow past this we don't
47 * put it back in the threadlocal, we just keep going and grow as needed.
|
| /packages/apps/Settings/src/com/android/settings/widget/ |
| ChartAxis.java | 48 * Test if given raw value should cause the axis to grow or shrink;
49 * returning positive value to grow and negative to shrink.
|
| /external/clang/lib/Sema/ |
| TypeLocBuilder.h | 57 grow(Requested);
138 // If we need to grow, grow by a factor of 2.
144 grow(NewCapacity);
152 /// Grow to the given capacity.
153 void grow(size_t NewCapacity) { function in class:clang::TypeLocBuilder
|
| /packages/apps/DeskClock/src/com/android/deskclock/ |
| Screensaver.java | 94 AnimatorSet grow = new AnimatorSet(); grow.play(xGrow).with(yGrow);
105 s.play(grow.setDuration(SLIDE_TIME/2)).after(shrink);
113 grow.setDuration(FADE_TIME).setInterpolator(decel);
120 s.play(grow).after(FADE_TIME);
|
| /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
|
| /external/bison/data/m4sugar/ |
| m4sugar.m4 | 835 # diversion, GROW. When the outer macro is fully expanded, we first
836 # undivert the most nested diversions (GROW - 1...), and finally
837 # undivert GROW. To understand why we need several diversions,
848 # GROW - 2: Test...3
849 # GROW - 1: Test...2
850 # GROW: Test...1
853 # Finally the epilogue of TEST1 undiverts GROW - 2, GROW - 1, and
854 # GROW into the regular flow, BODY.
856 # GROW - 2
[all...] |
| /external/webkit/Source/JavaScriptCore/wtf/ |
| BlockStack.h | 42 T* grow();
70 template <typename T> T* BlockStack<T>::grow() function in class:WTF::BlockStack
|
| /external/clang/include/clang/AST/ |
| ASTVector.h | 161 grow(C);
167 grow(C, N);
183 // Grow allocated space if needed.
185 this->grow(C, this->size()+NumInputs);
197 // Grow allocated space if needed.
199 this->grow(C, this->size()+NumInputs);
229 this->grow(C);
340 this->grow(C, N);
347 /// grow - double the size of the allocated memory, guaranteeing space for at
349 void grow(ASTContext &C, size_type MinSize = 1)
369 void ASTVector<T>::grow(ASTContext &C, size_t MinSize) { function in class:clang::ASTVector
[all...] |
