| /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...] |
| /dalvik/dx/tests/107-verify-stack-ops/ |
| info.txt | 1 This tests that the various stack manipulation opcodes verify that their
|
| /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...] |
| /dalvik/dx/src/com/android/dx/cf/code/ |
| ExecutionStack.java | 26 * Representation of a Java method execution stack.
33 /** {@code non-null;} array of stack contents */
34 private final TypeBearer[] stack; field in class:ExecutionStack
37 * {@code >= 0;} stack pointer (points one past the end) / current stack
45 * @param maxStack {@code >= 0;} the maximum size of the stack for this
50 stack = new TypeBearer[maxStack];
60 ExecutionStack result = new ExecutionStack(stack.length);
62 System.arraycopy(stack, 0, result.stack, 0, stack.length)
[all...] |
| /external/proguard/src/proguard/retrace/ |
| package.html | 3 ReTrace can de-obfuscate stack traces of obfuscated programs.
|
| /external/webkit/JavaScriptCore/pcre/ |
| pcre_exec.cpp | 129 stack-based local variables are not safe to use. Instead we have to
285 #define RRETURN_LABEL *stack.currentFrame->returnLocation
292 stack.popCurrentFrame();
296 stack.pushNewFrame((ra), (rb), RMATCH_WHERE(num)); \
302 stack.pushNewFrame((ra), (rb), RMATCH_WHERE(num)); \
303 startNewGroup(stack.currentFrame); \
393 static int matchError(int errorCode, MatchStack& stack)
395 stack.popAllFrames();
420 stack of such pointers, to be re-instated at the end of the group when we hit
422 this stack. *
452 MatchStack stack; local
[all...] |
| /dalvik/libcore/luni/src/test/java/tests/api/java/util/ |
| StackTest.java | 26 import java.util.Stack;
28 @TestTargetClass(Stack.class)
31 Stack s;
34 * @tests java.util.Stack#Stack()
39 method = "Stack",
43 // Test for method java.util.Stack()
44 assertEquals("Stack creation failed", 0, s.size());
48 * @tests java.util.Stack#empty()
57 // Test for method boolean java.util.Stack.empty(
169 Stack<Object> stack = new Stack<Object>(); local
[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...] |
| /dalvik/libcore/luni/src/main/java/java/util/ |
| Stack.java | 21 * {@code Stack} is a Last-In/First-Out(LIFO) data structure which represents a
22 * stack of objects. It enables users to pop to and push from the stack,
23 * including null objects. There is no limit to the size of the stack.
25 public class Stack<E> extends Vector<E> {
30 * Constructs a stack with the default size of {@code Vector}.
32 public Stack() {
37 * Returns whether the stack is empty or not.
39 * @return {@code true} if the stack is empty, {@code false} otherwise.
46 * Returns the element at the top of the stack without removing it
[all...] |
| /cts/tools/dasm/src/java_cup/runtime/ |
| virtual_parse_stack.java | 4 import java.util.Stack;
6 /** This class implements a temporary or "virtual" parse stack that
7 * replaces the top portion of the actual parse stack (the part that
13 * reverts to the original parse stack (which has not actually been
15 * state is maintained on the virtual stack, not full symbol objects.
27 /** Constructor to build a virtual stack out of a real stack. */
28 public virtual_parse_stack(Stack shadowing_stack) throws java.lang.Exception
33 "Internal parser error: attempt to create null virtual stack");
37 vstack = new Stack();
[all...] |
| /frameworks/base/media/libdrm/mobile2/src/util/ustl-1.0/ |
| ustack.h | 14 /// \class stack ustack.h ustl.h
17 /// \brief Stack adapter to uSTL containers.
20 class stack { class in namespace:ustl
29 inline stack (void) : m_Storage () { } function in class:ustl::stack
30 explicit inline stack (const Sequence& s) : m_Storage (s) { } function in class:ustl::stack
37 inline bool operator== (const stack& s) { return (m_Storage == s.m_Storage); }
38 inline bool operator< (const stack& s) { return (m_Storage.size() < s.m_Storage.size()); }
|
| /external/bluetooth/glib/docs/reference/glib/tmpl/ |
| trash_stack.sgml | 5 maintain a stack of unused allocated memory chunks
9 A #GTrashStack is an efficient way to keep a stack of unused allocated
11 a #gpointer. This allows the stack to be maintained without any space
12 overhead, since the stack pointers can be stored inside the memory chunks.
16 is a perfectly valid empty stack.
29 Each piece of memory that is pushed onto the stack
33 @next: pointer to the previous element of the stack,
43 @data_p: the piece of memory to push on the stack.
52 @Returns: the element at the top of the stack.
61 @Returns: the element at the top of the stack
[all...] |
| /dalvik/libcore/xml/src/main/java/org/apache/xml/serializer/ |
| NamespaceMappings.java | 31 * prefix/uri/depth triplets are pushed on a stack pushed on a stack. The depth
47 * "def" is pushed on the stack with depth 1.
52 * stack. Of course popNamespaces(2) would pop anything with depth 2 or
55 * So prefix/uri pairs are pushed and poped off the stack as elements are
57 * are on the stack and a prefix can be found given a uri, or a uri can be found
73 * Each entry (prefix) in this hashtable points to a Stack of URIs
74 * This table maps a prefix (String) to a Stack of NamespaceNodes.
75 * All Namespace nodes in that retrieved stack have the same prefix,
76 * though possibly different URI's or depths. Such a stack must hav
119 Stack stack; local
141 final Stack stack = getPrefixStack(prefix); local
152 final Stack stack = (Stack) m_namespaces.get(prefix); local
210 Stack stack; local
233 Stack stack; local
[all...] |
| /dalvik/libcore/xml/src/main/java/org/apache/xml/utils/ |
| BoolStack.java | 25 * Simple stack for boolean values.
73 * Clears the stack.
82 * Pushes an item onto the top of this stack.
85 * @param val the boolean to be pushed onto this stack.
98 * Removes the object at the top of this stack and returns that
101 * @return The object at the top of this stack.
102 * @throws EmptyStackException if this stack is empty.
110 * Removes the object at the top of this stack and returns the
125 * Set the item at the top of this stack
128 * @param b Object to set at the top of this stack
[all...] |
| /dalvik/vm/mterp/x86-atom/ |
| TODO.txt | 3 (hi) Correct stack overflow handling (dvmCleanupStackOverflow takes an
|
| /external/openssl/crypto/stack/ |
| stack.h | 1 /* crypto/stack/stack.h */
74 } STACK;
79 int sk_num(const STACK *);
80 char *sk_value(const STACK *, int);
82 char *sk_set(STACK *, int, char *);
84 STACK *sk_new(int (*cmp)(const char * const *, const char * const *));
85 STACK *sk_new_null(void);
86 void sk_free(STACK *);
87 void sk_pop_free(STACK *st, void (*func)(void *))
[all...] |
| /external/openssl/include/openssl/ |
| stack.h | 1 /* crypto/stack/stack.h */
74 } STACK;
79 int sk_num(const STACK *);
80 char *sk_value(const STACK *, int);
82 char *sk_set(STACK *, int, char *);
84 STACK *sk_new(int (*cmp)(const char * const *, const char * const *));
85 STACK *sk_new_null(void);
86 void sk_free(STACK *);
87 void sk_pop_free(STACK *st, void (*func)(void *))
[all...] |
| /external/proguard/src/proguard/classfile/attribute/preverification/ |
| FullFrame.java | 37 public VerificationType[] stack; field in class:FullFrame
49 * Creates a FullFrame with the given variables and stack.
53 VerificationType[] stack)
58 stack.length,
59 stack);
64 * Creates a FullFrame with the given variables and stack.
70 VerificationType[] stack)
76 this.stack = stack;
93 * Applies the given verification type visitor to all stack
[all...] |
| /external/stlport/etc/ |
| std_headers.txt | 27 stack
|
| /prebuilt/linux-x86/toolchain/sh-4.3.3/lib/gcc/sh-linux-gnu/4.3.3/ |
| crtend.o | |
| /dalvik/vm/mterp/x86/ |
| OP_REM_DOUBLE.S | 5 fldl (rFP,%ecx,4) # vCC to fp stack
6 fldl (rFP,%eax,4) # vCC to fp stack
|
| OP_REM_DOUBLE_2ADDR.S | 5 fldl (rFP,rINST_FULL,4) # vBB to fp stack
7 fldl (rFP,%ecx,4) # vAA to fp stack
|
| OP_REM_FLOAT.S | 5 flds (rFP,%ecx,4) # vCC to fp stack
6 flds (rFP,%eax,4) # vCC to fp stack
|
