| /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/proguard/src/proguard/evaluation/ |
| Processor.java | 34 * local variable frame and stack.
44 private final Stack stack; field in class:Processor
57 * @param stack the local stack.
62 Stack stack,
68 this.stack = stack;
85 stack.push(valueFactory.createReferenceValueNull())
[all...] |
| Stack.java | 26 * This class represents an operand stack that contains <code>Value</code>
31 public class Stack
42 * Creates a new Stack with a given maximum size, accounting for the double
45 public Stack(int maxSize)
52 * Creates a Stack that is a copy of the given Stack.
54 public Stack(Stack stack)
57 this(stack.values.length)
[all...] |
| /external/valgrind/main/memcheck/tests/ |
| deep_templates.cpp | 11 class Stack
14 Stack(int = 10) { size=5; top=6; stackPtr=(T*)6; };
15 ~Stack() { }
27 typedef Stack<int,char> Foo;
28 typedef Stack<Foo,Foo> Foo2;
29 typedef Stack<Foo2,Foo2> Foo3;
30 typedef Stack<Foo3,Foo3> Foo4;
31 typedef Stack<Foo4,Foo4> Foo5;
32 typedef Stack<Foo5,Foo5> Foo6;
33 typedef Stack<Foo6,Foo6> Foo7
[all...] |
| /dalvik/dx/tests/107-verify-stack-ops/ |
| info.txt | 1 This tests that the various stack manipulation opcodes verify that their
|
| /dalvik/dx/tests/114-value-propagation/ |
| info.txt | 2 stack location to a local variable. (regression test)
|
| /external/valgrind/main/drd/tests/ |
| qt4_atomic.vgtest | 2 vgopts: --check-stack-var=yes
|
| qt4_mutex.vgtest | 2 vgopts: --check-stack-var=yes
|
| qt4_rwlock.vgtest | 2 vgopts: --check-stack-var=yes
|
| qt4_semaphore.vgtest | 2 vgopts: --check-stack-var=yes
|
| pth_cancel_locked.vgtest | 2 vgopts: --read-var-info=yes --check-stack-var=yes
|
| pth_process_shared_mutex.vgtest | 3 vgopts: --read-var-info=yes --check-stack-var=yes
|
| sem_open.vgtest | 2 vgopts: --check-stack-var=yes --read-var-info=yes
|
| tc04_free_lock.vgtest | 2 vgopts: --check-stack-var=yes
|
| /external/clang/test/Sema/ |
| pragma-pack-3.c | 3 // Stack: [], Alignment: 8
6 // Stack: [8], Alignment: 1
9 // Stack: [8, 1], Alignment: 4
12 // top stack entry and resets the current alignment. This is both
18 // Stack: [8, 1], Alignment: 8
21 // Stack: [8], Alignment: 1
29 // Stack: [], Alignment: 8
|
| /external/speex/libspeex/ |
| 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/clang/test/Misc/ |
| include-stack-for-note-flag.cpp | 1 // RUN: %clang_cc1 -fsyntax-only -fdiagnostics-show-note-include-stack %s 2>&1 | FileCheck %s -check-prefix=STACK
2 // RUN: %clang_cc1 -fsyntax-only -fno-diagnostics-show-note-include-stack %s 2>&1 | FileCheck %s -check-prefix=STACKLESS
3 // RUN: %clang_cc1 -fsyntax-only -fno-diagnostics-show-note-include-stack -fdiagnostics-show-note-include-stack %s 2>&1 | FileCheck %s -check-prefix=STACK
4 // RUN: %clang_cc1 -fsyntax-only -fdiagnostics-show-note-include-stack -fno-diagnostics-show-note-include-stack %s 2>&1 | FileCheck %s -check-prefix=STACKLESS
16 // STACK: error: no matching function for call to 'foo'
17 // STACK: In file included fro
[all...] |
| /external/proguard/src/proguard/retrace/ |
| package.html | 3 ReTrace can de-obfuscate stack traces of obfuscated programs.
|
| /ndk/ |
| .gitignore | 10 /ndk-stack*
|
| /external/javassist/src/main/javassist/bytecode/analysis/ |
| Frame.java | 19 * Represents the stack frame and local variable table at a particular point in time.
25 private Type[] stack; field in class:Frame
31 * Create a new frame with the specified local variable table size, and max stack size
34 * @param stack the maximum stack size
36 public Frame(int locals, int stack) {
38 this.stack = new Type[stack];
63 * Returns the type on the stack at the specified index.
65 * @param index the position on the stack
[all...] |
| /external/javassist/src/main/javassist/bytecode/ |
| CodeAnalyzer.java | 33 /* d = stack[i]
40 int[] stack = new int[length]; local
42 initStack(stack, codeAttr);
47 if (stack[i] < 0) {
49 visitBytecode(ci, stack, i);
55 if (stack[i] > maxStack)
56 maxStack = stack[i];
61 private void initStack(int[] stack, CodeAttribute ca) {
62 stack[0] = -1;
67 stack[et.handlerPc(i)] = -2; // an exception is on stac
[all...] |
| /external/srec/srec/crec/ |
| astar.c | 52 int astar_draw_tree_as_dotty(const char* file, srec* rec, AstarStack* stack);
238 void list_free_parps(AstarStack* stack, char* msg);
240 #define list_free_parps(stack,msg)
248 partial_path* make_new_partial_path(AstarStack* stack);
249 /*void free_partial_path(AstarStack* stack, partial_path* parp); put the proto in astar.h */
289 partial_path* extend_path(AstarStack* stack,
383 extended_parp = make_new_partial_path(stack);
421 void check_stack_root_sanity(AstarStack* stack)
423 partial_path* parp1 = stack->root_path;
424 /* append_arc_arriving(stack->root_path, parp); *
524 AstarStack *stack; local
556 AstarStack *stack = rec->astar_stack; local
657 AstarStack *stack = rec->astar_stack; local
[all...] |
| /libcore/luni/src/test/java/tests/api/java/util/ |
| StackTest.java | 21 import java.util.Stack;
25 Stack s;
28 * java.util.Stack#Stack()
31 // Test for method java.util.Stack()
32 assertEquals("Stack creation failed", 0, s.size());
36 * java.util.Stack#empty()
39 // Test for method boolean java.util.Stack.empty()
40 assertTrue("New stack answers non-empty", s.empty());
42 assertTrue("Stack should not be empty but answers empty", !s.empty())
133 Stack<Object> stack = new Stack<Object>(); local
[all...] |
| /external/valgrind/main/memcheck/tests/linux/ |
| stack_switch.c | 34 void *stack; local
39 if ( ( stack = mmap( NULL, 2* STACK_SIZE, PROT_READ|PROT_WRITE, MAP_PRIVATE|MAP_ANONYMOUS, -1, 0 ) ) == MAP_FAILED )
45 stackid = VALGRIND_STACK_REGISTER( stack, stack + STACK_SIZE );
47 if ( ( pid = clone( thread_main, stack + STACK_SIZE, CLONE_VM|CLONE_FS|CLONE_FILES|CLONE_SIGHAND|CLONE_THREAD|SIGCHLD, NULL ) ) == -1 )
|
| /frameworks/base/tools/layoutlib/bridge/src/com/android/layoutlib/bridge/impl/ |
| Stack.java | 22 * Custom Stack implementation on top of an {@link ArrayList} instead of
23 * using {@link java.util.Stack} which is on top of a vector.
27 public class Stack<T> extends ArrayList<T> {
31 public Stack() {
35 public Stack(int size) {
40 * Pushes the given object to the stack
48 * Remove the object at the top of the stack and returns it.
49 * @return the removed object or null if the stack was empty.
60 * Returns the object at the top of the stack.
61 * @return the object at the top or null if the stack is empty
[all...] |
