| /external/apache-commons-bcel/src/main/java/org/apache/bcel/verifier/structurals/ |
| ExecutionVisitor.java | 43 * visitIADD(IADD o), then there are two stack slots popped and one
44 * stack slot containing a Type.INT is pushed (where you could also
46 * stack). Monitor-specific behaviour is not simulated.</p>
50 * <p>Type.VOID will never be pushed onto the stack. Type.DOUBLE and Type.LONG
51 * that would normally take up two stack slots (like Double_HIGH and
53 * object on the stack here.</p>
84 private OperandStack stack() { method in class:ExecutionVisitor
126 stack().pop(); // pop the index int
127 //System.out.print(stack().peek());
128 final Type t = stack().pop(); // Pop Array typ
[all...] |
| OperandStack.java | 30 * This class implements a stack used for symbolic JVM stack simulation.
31 * [It's used an an operand stack substitute.]
32 * Elements of this stack are {@link Type} objects.
38 /** We hold the stack information here. */
39 private ArrayList<Type> stack = new ArrayList<>(); field in class:OperandStack
41 /** The maximum number of stack slots this OperandStack instance may hold. */
45 * Creates an empty stack with a maximum of maxStack slots.
52 * Creates an otherwise empty stack with a maximum of maxStack slots and
61 * on a new stack. However, the Type objects on the stack ar
[all...] |
| /external/speex/libspeexdsp/ |
| stack_alloc.h | 4 @brief Temporary memory allocation on stack
51 * @def ALIGN(stack, size)
53 * Aligns the stack to a 'size' boundary
55 * @param stack Stack
60 * @def PUSH(stack, size, type)
62 * Allocates 'size' elements of type 'type' on the stack
64 * @param stack Stack
72 * Declare variable on stack
[all...] |
| /external/proguard/src/proguard/evaluation/ |
| Processor.java | 31 * local variable frame and stack.
39 private final Stack stack; field in class:Processor
52 * @param stack the local stack.
59 Stack stack,
66 this.stack = stack;
87 stack.push(valueFactory.createReferenceValueNull())
[all...] |
| /external/libcxx/test/libcxx/containers/container.adaptors/stack/ |
| version.pass.cpp | 10 // <stack>
12 #include <stack>
|
| /external/libunwind/src/ia64/ |
| Linstall_cursor.S | 4 /* We do not need executable stack. */
5 .section .note.GNU-stack,"",@progbits
|
| /external/libcxx/test/std/containers/container.adaptors/stack/stack.defn/ |
| swap.pass.cpp | 10 // <stack>
12 // void swap(stack& q);
14 #include <stack>
29 std::stack<int> q1 = make<std::stack<int> >(5);
30 std::stack<int> q2 = make<std::stack<int> >(10);
31 std::stack<int> q1_save = q1;
32 std::stack<int> q2_save = q2;
|
| empty.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;
|
| /external/libcxx/test/std/containers/container.adaptors/stack/stack.ops/ |
| eq.pass.cpp | 10 // <stack>
13 // bool operator==(const stack<T, Container>& x,const stack<T, Container>& y);
16 // bool operator!=(const stack<T, Container>& x,const stack<T, Container>& y);
18 #include <stack>
33 std::stack<int> q1 = make<std::stack<int> >(5);
34 std::stack<int> q2 = make<std::stack<int> >(10)
[all...] |
| lt.pass.cpp | 10 // <stack>
13 // bool operator< (const stack<T, Container>& x,const stack<T, Container>& y);
16 // bool operator> (const stack<T, Container>& x,const stack<T, Container>& y);
19 // bool operator>=(const stack<T, Container>& x,const stack<T, Container>& y);
22 // bool operator<=(const stack<T, Container>& x,const stack<T, Container>& y);
24 #include <stack>
[all...] |
| /external/libcxx/test/std/containers/container.adaptors/stack/stack.special/ |
| swap.pass.cpp | 10 // <stack>
13 // void swap(stack<T, Container>& x, stack<T, Container>& y);
15 #include <stack>
30 std::stack<int> q1 = make<std::stack<int> >(5);
31 std::stack<int> q2 = make<std::stack<int> >(10);
32 std::stack<int> q1_save = q1;
33 std::stack<int> q2_save = q2
[all...] |
| swap_noexcept.pass.cpp | 10 // <stack>
12 // void swap(stack& c)
19 #include <stack>
28 typedef std::stack<MoveOnly> C;
|
| /external/testng/src/main/java/org/testng/reporters/util/ |
| StackTraceTools.java | 6 * Functionality to allow tools to analyse and subdivide stack traces.
15 /** Finds topmost position of the test method in the stack, or top of stack if <code>method</code> is not in it. */
16 public static int getTestRoot(StackTraceElement[] stack,ITestNGMethod method) {
17 if(stack!=null) {
19 for(int x=stack.length-1; x>=0; x--) {
20 if(cname.equals(stack[x].getClassName())
21 && method.getMethodName().equals(stack[x].getMethodName())) {
25 return stack.length-1;
31 /** Finds topmost position of the test method in the stack, or top of stack if <code>method</code> is not in it. *
[all...] |
| /external/apache-commons-bcel/src/main/java/org/apache/bcel/util/ |
| ClassStack.java | 20 import java.util.Stack;
25 * Utility class implementing a (typesafe) stack of JavaClass objects.
28 * @see Stack
32 private final Stack<JavaClass> stack = new Stack<>(); field in class:ClassStack
36 stack.push(clazz);
41 return stack.pop();
46 return stack.peek();
51 return stack.empty()
[all...] |
| /external/easymock/src/org/easymock/internal/ |
| LastControl.java | 21 import java.util.Stack;
31 private static final ThreadLocal<Stack<Invocation>> threadToCurrentInvocation = new ThreadLocal<Stack<Invocation>>();
33 private static final ThreadLocal<Stack<IArgumentMatcher>> threadToArgumentMatcherStack = new ThreadLocal<Stack<IArgumentMatcher>>();
48 Stack<IArgumentMatcher> stack = threadToArgumentMatcherStack.get();
local
49 if (stack == null) {
50 stack = new Stack<IArgumentMatcher>();
57 Stack<IArgumentMatcher> stack = threadToArgumentMatcherStack.get(); local
66 Stack<IArgumentMatcher> stack = threadToArgumentMatcherStack.get(); local
72 Stack<IArgumentMatcher> stack = threadToArgumentMatcherStack.get(); local
78 Stack<IArgumentMatcher> stack = threadToArgumentMatcherStack.get(); local
98 Stack<IArgumentMatcher> stack = threadToArgumentMatcherStack.get(); local
104 Stack<Invocation> stack = threadToCurrentInvocation.get(); local
112 Stack<Invocation> stack = threadToCurrentInvocation.get(); local
121 Stack<Invocation> stack = threadToCurrentInvocation.get(); local
[all...] |
| /external/apache-commons-bcel/src/main/java/org/apache/bcel/classfile/ |
| DescendingVisitor.java | 20 import java.util.Stack;
35 private final Stack<Object> stack = new Stack<>(); field in class:DescendingVisitor
52 final int size = stack.size();
57 return stack.elementAt(size - (level + 2)); // size - 1 == current
65 return stack.peek();
91 stack.push(_clazz);
106 stack.pop();
115 stack.push(annotation)
[all...] |
| /external/compiler-rt/lib/asan/ |
| asan_stack.h | 30 // Get the stack trace with the given pc and bp.
31 // The pc will be in the position 0 of the resulting stack trace.
34 void GetStackTraceWithPcBpAndContext(BufferedStackTrace *stack, uptr max_depth,
38 stack->Unwind(max_depth, pc, bp, context, 0, 0, fast);
41 stack->size = 0;
45 // yields the call stack of the signal's handler and not of the code
52 stack->Unwind(max_depth, pc, bp, context, stack_top, stack_bottom,
57 stack->Unwind(max_depth, pc, bp, context, 0, 0, false);
65 // NOTE: A Rule of thumb is to retrieve stack trace in the interceptors
67 // don't want stack trace to contain functions from ASan internals
[all...] |
| /art/tools/ |
| symbolize-buildbot-crashes.sh | 17 # We push art and its dependencies to '/data/local/tmp', but the 'stack'
24 fi | sed 's,/data/local/tmp,,g' | development/scripts/stack
|
| /external/compiler-rt/test/asan/TestCases/ |
| describe_address.cc | 8 int stack; local
13 __asan_describe_address(&stack);
14 // CHECK: Address {{.*}} is located in stack of thread T{{.*}} at offset {{.*}}
|
| /external/deqp-deps/SPIRV-Tools/source/opt/ |
| pch_source_opt.h | 19 #include <stack>
|
| /external/guava/guava/src/com/google/common/collect/ |
| BinaryTreeTraverser.java | 100 private final Deque<T> stack;
103 this.stack = new ArrayDeque<T>();
104 stack.addLast(root);
109 return !stack.isEmpty();
114 T result = stack.removeLast();
115 pushIfPresent(stack, rightChild(result));
116 pushIfPresent(stack, leftChild(result));
122 return stack.getLast();
135 private final Deque<T> stack;
139 this.stack = new ArrayDeque<T>()
[all...] |
| /external/swiftshader/third_party/SPIRV-Tools/source/opt/ |
| pch_source_opt.h | 19 #include <stack>
|
| /external/libunwind/src/ppc/ |
| siglongjmp.S | 29 /* We do not need executable stack. */
30 .section .note.GNU-stack,"",@progbits
|
| /external/libunwind/src/ppc32/ |
| setcontext.S | 7 /* We do not need executable stack. */
8 .section .note.GNU-stack,"",@progbits
|
