| /dalvik/vm/mterp/x86/ |
| OP_REM_FLOAT_2ADDR.S | 5 flds (rFP,rINST_FULL,4) # vBB to fp stack
7 flds (rFP,%ecx,4) # vAA to fp stack
|
| /external/openssl/crypto/stack/ |
| Makefile | 2 # OpenSSL/crypto/stack/Makefile
5 DIR= stack
20 LIBSRC=stack.c
21 LIBOBJ=stack.o
25 EXHEADER= stack.h safestack.h
77 stack.o: ../../e_os.h ../../include/openssl/asn1.h ../../include/openssl/bio.h
78 stack.o: ../../include/openssl/buffer.h ../../include/openssl/crypto.h
79 stack.o: ../../include/openssl/e_os2.h ../../include/openssl/err.h
80 stack.o: ../../include/openssl/lhash.h ../../include/openssl/obj_mac.h
81 stack.o: ../../include/openssl/objects.h ../../include/openssl/opensslconf.
[all...] |
| stack.c | 1 /* crypto/stack/stack.c */
70 #include <openssl/stack.h>
76 const char STACK_version[]="Stack" OPENSSL_VERSION_PTEXT;
80 int (*sk_set_cmp_func(STACK *sk, int (*c)(const char * const *,const char * const *)))
92 STACK *sk_dup(STACK *sk)
94 STACK *ret;
115 STACK *sk_new_null(void)
120 STACK *sk_new(int (*c)(const char * const *, const char * const *)
[all...] |
| /frameworks/base/libs/surfaceflinger_client/ |
| SharedBufferStack.cpp | 113 SharedBufferStack& stack( *mSharedStack );
114 return stack.identity;
119 SharedBufferStack& stack( *mSharedStack );
120 return stack.status;
125 SharedBufferStack& stack( *mSharedStack );
126 return size_t( stack.head );
134 SharedBufferStack& stack( *mSharedStack );
135 int tail = (mNumBuffers + stack.head - stack.available + 1) % mNumBuffers;
139 prefix, stack.head, stack.available, stack.queued, tail
[all...] |
| /packages/apps/Email/src/org/apache/james/mime4j/field/address/parser/ |
| JJTAddressListParserState.java | 6 private java.util.Stack nodes;
7 private java.util.Stack marks;
9 private int sp; // number of nodes on stack
14 nodes = new java.util.Stack();
15 marks = new java.util.Stack();
27 /* Call this to reinitialize the node stack. It is called
42 /* Pushes a node on to the stack. */
48 /* Returns the node on the top of the stack, and remove it from the
49 stack. */
57 /* Returns the node currently on the top of the stack. *
[all...] |
| /external/srec/srec/crec/ |
| srec_results.c | 112 AstarStack* stack = rec ? rec->astar_stack : 0; local
114 if (!stack)
119 rc = astar_stack_prepare(stack, n, rec);
129 if (stack->num_complete_paths)
131 *bestcost = stack->complete_paths[0]->costsofar;
144 AstarStack* stack = rec ? rec->astar_stack : 0; local
145 astar_stack_clear(stack);
151 AstarStack* stack = rec ? rec->astar_stack : 0; local
152 return stack ? stack->num_complete_paths : 0
158 AstarStack* stack = rec ? rec->astar_stack : 0; local
173 AstarStack* stack = rec ? rec->astar_stack : 0; local
181 AstarStack* stack = rec ? rec->astar_stack : 0; local
208 AstarStack* stack = rec ? rec->astar_stack : 0; local
234 AstarStack* stack = rec ? rec->astar_stack : 0; local
286 AstarStack* stack = rec ? rec->astar_stack : 0; local
353 AstarStack* stack = rec ? rec->astar_stack : 0; local
460 AstarStack* stack = rec ? rec->astar_stack : 0; local
[all...] |
| /external/apache-http/src/org/apache/http/impl/client/ |
| ClientParamsStack.java | 42 * Represents a stack of parameter collections.
43 * When retrieving a parameter, the stack is searched in a fixed order
44 * and the first match returned. Setting parameters via the stack is
45 * not supported. To minimize overhead, the stack has a fixed size and
47 * The supported stack entries, sorted by increasing priority, are:
69 * Each stack entry may be <code>null</code>. That is preferable over
96 * Creates a new parameter stack from elements.
115 * Creates a copy of a parameter stack.
116 * The new stack will have the exact same entries as the argument stack
[all...] |
| /external/stlport/stlport/stl/ |
| _stack.h | 47 class stack class in inherits:__stlport_class
50 : public __stlport_class<stack<_Tp> >
52 : public __stlport_class<stack<_Tp, _Sequence> >
58 typedef stack<_Tp> _Self;
60 typedef stack<_Tp, _Sequence> _Self;
74 stack() : c() {} function in class:stack
75 explicit stack(const _Sequence& __s) : c(__s) {} function in class:stack
78 stack(__move_source<_Self> src) function in class:stack
106 inline bool _STLP_CALL operator==(const stack< _STLP_STACK_ARGS >& __x,
107 const stack< _STLP_STACK_ARGS >& __y
[all...] |
| /frameworks/base/tools/preload/ |
| Proc.java | 46 /** Maps thread ID to operation stack. */
96 LinkedList<Operation> stack = stacks.get(threadId); local
97 if (stack == null) {
98 stack = new LinkedList<Operation>();
99 stacks.put(threadId, stack);
102 if (!stack.isEmpty()) {
103 stack.getLast().subops.add(o);
106 stack.add(o);
118 LinkedList<Operation> stack = stacks.get(threadId); local
120 if (stack == null || stack.isEmpty())
[all...] |
| /external/proguard/src/proguard/evaluation/ |
| TracedStack.java | 26 * This Stack saves additional information with stack elements, to keep track
29 * The stack stores a given producer Value along with each Value it stores.
36 public class TracedStack extends Stack
39 private Stack producerStack;
49 producerStack = new Stack(maxSize);
60 producerStack = new Stack(tracedStack.producerStack);
75 * Gets the specified producer Value from the stack, without disturbing it.
76 * @param index the index of the stack element, counting from the bottom
77 * of the stack
[all...] |
| /dalvik/libcore/xml/src/main/java/org/apache/xpath/ |
| VariableStack.java | 30 * Defines a class to keep track of a stack for
45 * Constructor for a variable stack.
53 * Constructor for a variable stack.
54 * @param initStackSize The initial stack size. Must be at least one. The
55 * stack can grow if needed.
59 // Allow for twice as many variables as stack link entries
64 * Returns a clone of this variable stack.
66 * @return a clone of this variable stack.
83 * The stack frame where all variables and params will be kept.
89 * The top of the stack frame (<code>_stackFrames</code>)
[all...] |
| /external/webkit/WebKitTools/android/flex-2.5.4a/MISC/ |
| alloca.c | 5 which is used to allocate space off the run-time stack so
16 that are found to be deeper in the stack than the current
53 /* If your stack is a linked list of frames, you have to
86 /* Define STACK_DIRECTION if you know the direction of stack
111 auto char dummy; /* To get stack address. */
123 stack_dir = 1; /* Stack grew upward. */
125 stack_dir = -1; /* Stack grew downward. */
133 (b) keep track of stack depth.
148 char *deep; /* For stack depth measure. */
157 was supposed to be taken from the current stack frame of th
414 long size, pseg, this_segment, stack; local
[all...] |
| /packages/apps/Email/src/org/apache/james/mime4j/message/ |
| Message.java | 25 import java.util.Stack;
99 private Stack stack = new Stack();
field in class:Message.MessageBuilder
105 if (!c.isInstance(stack.peek())) {
106 throw new IllegalStateException("Internal stack error: "
108 + stack.peek().getClass().getName() + "'");
116 if (stack.isEmpty()) {
117 stack.push(Message.this);
121 ((Entity) stack.peek()).setBody(m);
[all...] |
| /dalvik/vm/compiler/template/armv5te/ |
| TEMPLATE_SAVE_STATE.S | 4 * Top of stack + 4: r7 value to save
5 * Top of stack + 0: r0 value to save
11 * the values on the stack - not the ones in those registers on entry.
|
| /external/dropbear/libtomcrypt/src/misc/ |
| burn_stack.c | 15 Burn stack, Tom St Denis
19 Burn some stack memory
20 @param len amount of stack to burn in bytes
|
| /external/stlport/test/unit/ |
| stack_test.cpp | 5 #include <stack>
35 stack<int, deque<int> > s;
49 stack<int, list<int> > s;
|
| /dalvik/libcore/xml/src/main/java/org/apache/xml/serializer/ |
| ElemContext.java | 24 * This class is a stack frame that consists of
36 * A stack frame will be pushed for "A" at depth 1,
38 * Then "B1" stackframe is popped. When the stack frame for "B2" is
39 * pushed, this implementation re-uses the old stack fram object used
94 /** The next element "stack frame". This value will only be
95 * set once as deeper stack frames are not deleted when popped off,
98 * This makes for very fast pushing and popping of stack frames
99 * because very few stack frame objects are ever created, they are
103 * as they are re-used. Only the reference to the current stack frame, which
108 /** The previous element "stack frame". *
[all...] |
| /sdk/emulator/qtools/ |
| check_stack.cpp | 45 class Stack {
51 Stack() {
60 void Stack::push(frame *pframe) {
62 fprintf(stderr, "Error: stack overflow\n");
69 frame *Stack::pop() {
76 Stack *mStacks[kMaxThreads];
121 // Get the stack for the current thread
122 Stack *mStack = mStacks[proc->pid];
124 // If the stack does not exist, then allocate a new one.
126 mStack = new Stack();
[all...] |
| read_method.cpp | 26 class Stack {
32 Stack() {
41 void Stack::push(frame *pframe) {
43 fprintf(stderr, "Error: stack overflow\n");
50 frame *Stack::pop() {
57 void Stack::dump() {
70 Stack *stacks[kMaxThreads];
115 // Get the stack for the current thread
116 Stack *pStack = stacks[proc->pid];
118 // If the stack does not exist, then allocate a new one
[all...] |
| /dalvik/libcore/xml/src/main/java/org/apache/xml/utils/ |
| IntStack.java | 26 * Implement a stack of simple integers.
67 * Pushes an item onto the top of this stack.
69 * @param i the int to be pushed onto this stack.
94 * Removes the object at the top of this stack and returns that
97 * @return The object at the top of this stack.
105 * Quickly pops a number of items from the stack.
114 * Looks at the object at the top of this stack without removing it
115 * from the stack.
117 * @return the object at the top of this stack.
118 * @throws EmptyStackException if this stack is empty
[all...] |
| ObjectStack.java | 26 * Implement a stack of simple integers.
67 * Pushes an item onto the top of this stack.
69 * @param i the int to be pushed onto this stack.
94 * Removes the object at the top of this stack and returns that
97 * @return The object at the top of this stack.
108 * Quickly pops a number of items from the stack.
117 * Looks at the object at the top of this stack without removing it
118 * from the stack.
120 * @return the object at the top of this stack.
121 * @throws EmptyStackException if this stack is empty
[all...] |
| /external/v8/src/ |
| regexp-stack.h | 34 // Maintains a per-v8thread stack area that can be used by irregexp
35 // implementation for its backtracking stack.
36 // Since there is only one stack area, the Irregexp implementation is not
41 // Number of allocated locations on the stack below the limit.
42 // No sequence of pushes must be longer that this without doing a stack-limit
46 // Create and delete an instance to control the life-time of a growing stack.
47 RegExpStack(); // Initializes the stack memory area if necessary.
48 ~RegExpStack(); // Releases the stack if it has grown.
50 // Gives the top of the memory used as stack.
56 // The total size of the memory allocated for the stack
[all...] |
| /dalvik/docs/opcodes/ |
| opcode-0e-return-void.html | 55 The stack frame of the current method invocation is removed from the stack.
59 If the stack is now empty, the current thread terminates.
65 The stack frame that caused this method invocation becomes valid. This
|
| /dalvik/dx/src/com/android/dx/cf/code/ |
| package.html | 3 is needed for verification or stack-to-register conversion.</p>
|
| /dalvik/dx/tests/076-dex-synch-and-stack/ |
| info.txt | 2 the synchronized method conversion doesn't interact poorly with stack
|
