| /external/elfutils/tests/ |
| run-stack-demangled-test.sh | 25 # See run-stack-d-test.sh and run-stack-i-test.sh
35 STACKCMD=${bindir}/`program_transform stack`
37 STACKCMD=${abs_top_builddir}/src/stack
46 testrun_compare ${abs_top_builddir}/src/stack -n 2 -e testfiledwarfinlines --core testfiledwarfinlines.core<<EOF
56 testrun_compare ${abs_top_builddir}/src/stack -n 2 -s -e testfiledwarfinlines --core testfiledwarfinlines.core<<EOF
68 testrun_compare ${abs_top_builddir}/src/stack -n 6 -i -e testfiledwarfinlines --core testfiledwarfinlines.core<<EOF
82 testrun_compare ${abs_top_builddir}/src/stack -n 6 -s -i -e testfiledwarfinlines --core testfiledwarfinlines.core<<EOF
|
| /external/google-breakpad/src/processor/ |
| microdump_processor.cc | 78 scoped_ptr<CallStack> stack(new CallStack());
80 if (!stackwalker->Walk(stack.get(),
91 process_state->threads_.push_back(stack.release());
|
| stackwalker_ppc64.cc | 75 StackFrame* StackwalkerPPC64::GetCallerFrame(const CallStack* stack,
77 if (!memory_ || !stack) {
78 BPLOG(ERROR) << "Can't get caller frame without memory or stack";
82 // The instruction pointers for previous frames are saved on the stack.
84 // its return address in the calling procedure's stack frame at 8(%r1),
85 // and to allocate its own stack frame by decrementing %r1 (the stack
87 // no hardware stack, there is no distinction between the stack pointer and
89 // an x86 is usually referred to as the stack pointer on a ppc64
[all...] |
| stackwalker_sparc.cc | 75 StackFrame* StackwalkerSPARC::GetCallerFrame(const CallStack* stack,
77 if (!memory_ || !stack) {
78 BPLOG(ERROR) << "Can't get caller frame without memory or stack";
83 stack->frames()->back());
96 // end of the stack.
|
| /external/guava/guava-testlib/test/com/google/common/testing/ |
| TestLogHandlerTest.java | 33 private TearDownStack stack = new TearDownStack(); field in class:TestLogHandlerTest
45 stack.addTearDown(new TearDown() {
84 stack.runTearDown();
|
| /external/javassist/src/main/javassist/expr/ |
| FieldAccess.java | 243 int stack; local
245 stack = 0;
247 stack = -1;
252 stack += ((CtPrimitiveType)fieldType).getDataSize();
254 ++stack;
258 bytecode.growStack(stack);
292 int stack; local
294 stack = 0;
296 stack = -1;
303 stack -= ((CtPrimitiveType)fieldType).getDataSize()
[all...] |
| /external/libcxx/test/std/containers/container.adaptors/stack/stack.cons.alloc/ |
| ctor_container_alloc.pass.cpp | 10 // <stack>
13 // stack(const container_type& c, const Alloc& a);
15 #include <stack>
33 : public std::stack<int, C>
35 typedef std::stack<int, C> base;
|
| ctor_rcontainer_alloc.pass.cpp | 10 // <stack>
13 // stack(const container_type& c, const Alloc& a);
15 #include <stack>
37 : public std::stack<T, C>
39 typedef std::stack<T, C> base;
|
| ctor_rqueue_alloc.pass.cpp | 10 // <stack>
13 // stack(stack&& q, const Alloc& a);
15 #include <stack>
37 : public std::stack<T, C>
39 typedef std::stack<T, C> base;
|
| /external/libgdx/extensions/gdx-box2d/gdx-box2d/jni/Box2D/Collision/ |
| b2DynamicTree.h | 171 b2GrowableStack<int32, 256> stack; local
172 stack.Push(m_root);
174 while (stack.GetCount() > 0)
176 int32 nodeId = stack.Pop();
196 stack.Push(node->child1);
197 stack.Push(node->child2);
229 b2GrowableStack<int32, 256> stack; local
230 stack.Push(m_root);
232 while (stack.GetCount() > 0)
234 int32 nodeId = stack.Pop()
[all...] |
| /external/libunwind/tests/ |
| Gtest-exc.c | 92 long stack; local
97 n, &stack, (unsigned long) get_bsp ());
107 &stack, (unsigned long) get_bsp ());
|
| /external/proguard/src/proguard/evaluation/ |
| BasicInvocationUnit.java | 34 * and it updates the stack for the invocation of a class member,
50 private Stack stack; field in class:BasicInvocationUnit
138 public void invokeMember(Clazz clazz, Method method, CodeAttribute codeAttribute, int offset, ConstantInstruction constantInstruction, Stack stack)
177 this.stack = stack;
179 this.stack = null;
190 setFieldValue(clazz, fieldrefConstant, stack.pop());
196 setFieldClassValue(clazz, fieldrefConstant, stack.apop())
[all...] |
| /external/v8/src/compiler/ |
| control-equivalence.cc | 93 ZoneStack<DFSStackEntry> stack(zone_);
94 DFSPush(stack, exit, nullptr, kInputDirection);
97 while (!stack.empty()) { // Undirected depth-first backwards traversal.
98 DFSStackEntry& entry = stack.top();
111 // Found backedge if input is on stack.
116 // Push input onto stack.
117 DFSPush(stack, input, node, kInputDirection);
141 // Found backedge if use is on stack.
146 // Push use onto stack.
147 DFSPush(stack, use, node, kUseDirection)
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/container.adaptors/stack/stack.cons.alloc/ |
| ctor_container_alloc.pass.cpp | 10 // <stack>
13 // stack(const container_type& c, const Alloc& a);
15 #include <stack>
33 : public std::stack<int, C>
35 typedef std::stack<int, C> base;
|
| ctor_rcontainer_alloc.pass.cpp | 10 // <stack>
13 // stack(const container_type& c, const Alloc& a);
15 #include <stack>
37 : public std::stack<T, C>
39 typedef std::stack<T, C> base;
|
| ctor_rqueue_alloc.pass.cpp | 10 // <stack>
13 // stack(stack&& q, const Alloc& a);
15 #include <stack>
37 : public std::stack<T, C>
39 typedef std::stack<T, C> base;
|
| /system/bt/main/ |
| Android.mk | 36 $(LOCAL_PATH)/../stack/include \
37 $(LOCAL_PATH)/../stack/l2cap \
38 $(LOCAL_PATH)/../stack/a2dp \
39 $(LOCAL_PATH)/../stack/btm \
40 $(LOCAL_PATH)/../stack/avdt \
79 libbt-stack \
|
| /toolchain/binutils/binutils-2.25/gas/testsuite/gas/i386/ |
| x86-64-inval.s | 18 enterl $0,$0 # can't have 32-bit stack operands
41 leavel # can't have 32-bit stack operands
46 popl %eax # can't have 32-bit stack operands
52 pushl %eax # can't have 32-bit stack operands
53 pushfl # can't have 32-bit stack operands
54 popfl # can't have 32-bit stack operands
55 retl # can't have 32-bit stack operands
|
| /toolchain/binutils/binutils-2.25/binutils/ |
| prdbg.c | 42 /* Type stack. */
43 struct pr_stack *stack; member in struct:pr_handle
57 /* The type stack. */
61 /* Next element on the stack. */
303 info.stack = NULL;
334 /* Push a type on the type stack. */
350 n->next = info->stack;
351 info->stack = n;
356 /* Prepend a string onto the type on the top of the type stack. */
363 assert (info->stack != NULL)
[all...] |
| /cts/tools/dasm/src/java_cup/ |
| parser.java | 303 java.util.Stack stack,
308 return action_obj.CUP$do_action(act_num, parser, stack, top);
430 java.util.Stack CUP$stack,
452 ((java_cup.runtime.str_token)CUP$result).str_val = (/*the_id*/(java_cup.runtime.str_token)CUP$stack.elementAt(CUP$top-0)).str_val;
460 ((java_cup.runtime.str_token)CUP$result).str_val = (/*the_id*/(java_cup.runtime.str_token)CUP$stack.elementAt(CUP$top-0)).str_val;
468 ((java_cup.runtime.str_token)CUP$result).str_val = (/*the_id*/(java_cup.runtime.str_token)CUP$stack.elementAt(CUP$top-0)).str_val;
478 if (symbols.get((/*non_term_id*/(java_cup.runtime.str_token)CUP$stack.elementAt(CUP$top-0)).str_val) != null)
481 lexer.emit_error( "Symbol \"" + (/*non_term_id*/(java_cup.runtime.str_token)CUP$stack.elementAt(CUP$top-0)).str_val
[all...] |
| /frameworks/base/packages/DocumentsUI/src/com/android/documentsui/services/ |
| Job.java | 74 final DocumentStack stack; field in class:Job
92 * @param stack The documents stack context relating to this request. This is the
97 @OpType int operationType, String id, DocumentStack stack) {
107 this.stack = stack;
263 intent.putExtra(Shared.EXTRA_STACK, (Parcelable) stack);
293 String id, DocumentStack stack, List<DocumentInfo> srcs) {
295 assert(stack.peek().isCreateSupported());
296 return new CopyJob(service, appContext, listener, id, stack, srcs)
[all...] |
| /prebuilts/gdb/darwin-x86/lib/python2.7/ |
| pyclbr.py | 151 stack = [] # stack of (class, indent) pairs
159 while stack and stack[-1][1] >= thisindent:
160 del stack[-1]
164 while stack and stack[-1][1] >= thisindent:
165 del stack[-1]
169 if stack:
170 cur_class = stack[-1][0
[all...] |
| /prebuilts/gdb/linux-x86/lib/python2.7/ |
| pyclbr.py | 151 stack = [] # stack of (class, indent) pairs
159 while stack and stack[-1][1] >= thisindent:
160 del stack[-1]
164 while stack and stack[-1][1] >= thisindent:
165 del stack[-1]
169 if stack:
170 cur_class = stack[-1][0
[all...] |
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/ |
| pyclbr.py | 151 stack = [] # stack of (class, indent) pairs
159 while stack and stack[-1][1] >= thisindent:
160 del stack[-1]
164 while stack and stack[-1][1] >= thisindent:
165 del stack[-1]
169 if stack:
170 cur_class = stack[-1][0
[all...] |
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/ |
| pyclbr.py | 151 stack = [] # stack of (class, indent) pairs
159 while stack and stack[-1][1] >= thisindent:
160 del stack[-1]
164 while stack and stack[-1][1] >= thisindent:
165 del stack[-1]
169 if stack:
170 cur_class = stack[-1][0
[all...] |
