/external/skia/src/gpu/ |
GrReducedClip.h | 22 * This function takes a clip stack and a query rectangle and it produces a reduced set of 23 * SkClipStack::Elements that are equivalent to applying the full stack to the rectangle. The 33 void ReduceClipStack(const SkClipStack& stack,
|
/external/valgrind/main/memcheck/tests/ |
sigaltstack.c | 19 // ask for an alt stack with EXEC permissions, 20 // since signal returning requires execution of code on the stack. 27 fprintf(stderr, "calling sigaltstack, stack base is %p\n", sigstk.ss_sp);
|
writev1.stderr.exp | 5 Address 0x........ is not stack'd, malloc'd or (recently) free'd 11 Address 0x........ is not stack'd, malloc'd or (recently) free'd 17 Address 0x........ is not stack'd, malloc'd or (recently) free'd
|
/external/valgrind/main/none/tests/ |
sigstackgrowth.c | 9 frames, hence that it can actually expand the stack by that much 14 again, until the stack has grown to 4MB from the starting frame 20 frame will be cleared, the stack will never grow, and we'll be in
|
/external/valgrind/main/perf/ |
sarp.c | 2 // on the stack. It is a stress test for Memcheck's set_address_range_perms 9 // on the stack. 20 // away the stack allocation.
|
/libcore/luni/src/main/java/java/lang/ |
InstantiationException.java | 29 * stack trace. 35 * Constructs a new {@code InstantiationException} with the current stack 46 * Constructs a new {@code InstantiationException} with the current stack
|
StackOverflowError.java | 21 * Thrown when the depth of the stack of the running program exceeds some 32 * stack trace. 38 * Constructs a new {@code StackOverflowError} with the current stack trace
|
ThreadDeath.java | 22 * orderly unrolling of the thread's stack (eg. cleanup of monitors). 30 * ThreadDeath, the stack trace may <em>not</em> be filled in a way which 31 * allows a stack trace to be printed.
|
/libcore/luni/src/main/java/java/util/ |
EmptyStackException.java | 22 * An {@code EmptyStackException} is thrown if the pop/peek method of a stack is 23 * executed on an empty stack. 32 * Constructs a new {@code EmptyStackException} with the stack trace filled
|
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/container.adaptors/stack/stack.defn/ |
emplace.pass.cpp | 10 // <stack> 14 #include <stack> 22 std::stack<Emplaceable> q;
|
empty.pass.cpp | 10 // <stack> 14 #include <stack> 19 std::stack<int> q;
|
push.pass.cpp | 10 // <stack> 14 #include <stack> 19 std::stack<int> q;
|
size.pass.cpp | 10 // <stack> 14 #include <stack> 19 std::stack<int> q;
|
top.pass.cpp | 10 // <stack> 14 #include <stack> 19 std::stack<int> q;
|
/prebuilts/tools/common/proguard/proguard4.7/docs/manual/retrace/ |
usage.html | 39 while obfuscating the application that produced the stack trace.</dd> 43 <dd>Optionally specifies the name of the file containing the stack trace. If 44 no file is specified, a stack trace is read from the standard input. Blank 52 <dd>Specifies to print out more informative stack traces that include not only 58 stack trace. Specifying a different regular expression allows to 59 de-obfuscate more general types of input than just stack traces. The 60 default is suitable for stack traces produced by most JVMs: 95 The restored stack trace is printed to the standard output. The completeness 96 of the restored stack trace depends on the presence of line number tables in 101 ReTrace will be able to restore the stack trace completely.</li [all...] |
/external/chromium_org/base/containers/ |
stack_container.h | 18 // This allocator can be used with STL containers to provide a stack buffer 19 // from which to allocate memory and overflows onto the heap. This stack buffer 20 // would be allocated on the stack and allows us to avoid heap operations in 27 // based on our allocator will share the same stack buffer. 29 // This stack buffer implementation is very simple. The first allocation that 30 // fits in the stack buffer will use the stack buffer. Any subsequent 31 // allocations will not use the stack buffer, even if there is unused room. 33 // be sure to reserve() in the container up to the stack buffer size. Otherwise 34 // the container will allocate a small array which will "use up" the stack [all...] |
/libcore/json/src/main/java/org/json/ |
JSONStringer.java | 111 * Unlike the original implementation, this stack isn't limited to 20 114 private final List<Scope> stack = new ArrayList<Scope>(); field in class:JSONStringer 175 if (stack.isEmpty() && out.length() > 0) { 179 stack.add(empty); 194 stack.remove(stack.size() - 1); 203 * Returns the value on the top of the stack. 206 if (stack.isEmpty()) { 209 return stack.get(stack.size() - 1) [all...] |
/external/chromium_org/base/debug/ |
trace_event_memory.cc | 47 // Records a stack of TRACE_MEMORY events. One per thread is required. 63 TraceMemoryStack* stack = static_cast<TraceMemoryStack*>(value); local 64 delete stack; 80 TraceMemoryStack* stack = 82 delete stack; 92 // Returns the thread-local trace memory stack for the current thread, creating 96 TraceMemoryStack* stack = local 99 if (!stack) { 100 stack = new TraceMemoryStack; 101 tls_trace_memory_stack.Set(stack); 276 TraceMemoryStack* stack = GetTraceMemoryStack(); local 282 TraceMemoryStack* stack = GetTraceMemoryStack(); local [all...] |
/external/llvm/lib/CodeGen/ |
StackProtector.cpp | 1 //===-- StackProtector.cpp - Stack Protector Insertion --------------------===// 10 // This pass inserts stack protectors into functions which need them. A variable 11 // with a random value in it is stored onto the stack before the local variables 17 #define DEBUG_TYPE "stack-protector" 57 /// \brief The minimum size of buffers that will receive stack smashing 70 /// - The prologue code loads and stores the stack guard onto the stack. 75 /// CreateFailBB - Create a basic block to jump to when the stack protector 80 /// contains an array of sufficient size so that we need stack protectors 85 /// \brief Check whether a stack allocation has its address taken [all...] |
/dalvik/dx/src/com/android/dx/cf/code/ |
Machine.java | 47 * Pops the given number of values from the stack (of either category), 57 * Pops values from the stack of the types indicated by the given 60 * element of the stack), and store them in the arguments area, 70 * Pops a value from the stack of the indicated type, and store it 80 * Pops values from the stack of the indicated types (popped in 82 * deepest element of the stack), and store them in the arguments 93 * Pops values from the stack of the indicated types (popped in 95 * deepest element of the stack), and store them in the arguments 136 * Indicates that there is an auxiliary (inline, not stack) 139 * <p><b>Note:</b> Perhaps unintuitively, the stack manipulatio [all...] |
/external/chromium_org/third_party/tcmalloc/chromium/src/ |
stacktrace_powerpc-inl.h | 33 // Produce stack trace. I'm guessing (hoping!) the code is much like 36 // http://www.linux-foundation.org/spec/ELF/ppc64/PPC-elf64abi-1.9.html#STACK 48 // Given a pointer to a stack frame, locate and return the calling 59 // With the stack growing downwards, older stack frame must be 62 // Assume stack frames larger than 100,000 bytes are bogus. 65 // In the non-strict mode, allow discontiguous stack frames. 89 // void** result: the stack-trace, as an array 90 // int* sizes: the size of each stack frame, as an array 93 // int skip_count: how many stack pointers to skip before storing in resul [all...] |
/external/chromium_org/third_party/tcmalloc/vendor/src/ |
stacktrace_powerpc-inl.h | 33 // Produce stack trace. I'm guessing (hoping!) the code is much like 36 // http://www.linux-foundation.org/spec/ELF/ppc64/PPC-elf64abi-1.9.html#STACK 48 // Given a pointer to a stack frame, locate and return the calling 59 // With the stack growing downwards, older stack frame must be 62 // Assume stack frames larger than 100,000 bytes are bogus. 65 // In the non-strict mode, allow discontiguous stack frames. 89 // void** result: the stack-trace, as an array 90 // int* sizes: the size of each stack frame, as an array 93 // int skip_count: how many stack pointers to skip before storing in resul [all...] |
/external/chromium_org/content/renderer/pepper/ |
v8_var_converter.cc | 8 #include <stack> 34 // Used to track parent nodes on the stack while traversing the graph. 234 // To/FromV8Value use a stack-based DFS search to traverse V8/Var graph. Each 235 // iteration, the top node on the stack examined. If the node has not been 240 // Otherwise, if they can have children, we add them to the stack. If the 241 // node at the top of the stack has already been visited, then we pop it off the 242 // stack and erase it from the list of parents. 253 std::stack<StackEntry<PP_Var> > stack; local 254 stack.push(StackEntry<PP_Var>(var)) 356 std::stack<StackEntry<v8::Handle<v8::Value> > > stack; local [all...] |
/bionic/libc/arch-x86/bionic/ |
clone.S | 12 # 16-byte alignment on child stack 15 # insert arguments onto the child stack 43 # with the appropriate arguments on the child stack 71 # insert arguments onto the child stack 103 # with the appropriate arguments on the child stack
|
/development/samples/ApiDemos/src/com/example/android/apis/app/ |
IntentActivityFlags.java | 18 * Example of various Intent flags to modify the activity stack. 35 * This creates an array of Intent objects representing the back stack 40 // We are going to rebuild our task with a new back stack. This will 42 // back stack to be created, with the first entry holding the root 43 // and requesting to reset the back stack.
|