/external/stlport/test/unit/ |
stack_header_test.cpp | 8 #include <stack>
|
/ndk/tests/device/test-gnustl-full/unit/ |
stack_header_test.cpp | 8 #include <stack>
|
/ndk/tests/device/test-stlport/unit/ |
stack_header_test.cpp | 8 #include <stack>
|
/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...] |
cb_search.h | 62 char *stack, 72 char *stack, 88 char *stack, 99 char *stack,
|
/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...] |
/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/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...] |
/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...] |
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...] |
/prebuilt/linux-x86/toolchain/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/bits/ |
stl_stack.h | 0 // Stack implementation -*- C++ -*- 78 * first-in-last-out %stack behavior. 88 * push, @c pop, and @c top, which are standard %stack/FILO 92 class stack class 102 operator==(const stack<_Tp1, _Seq1>&, const stack<_Tp1, _Seq1>&); 106 operator<(const stack<_Tp1, _Seq1>&, const stack<_Tp1, _Seq1>&); 126 stack(const _Sequence& __c = _Sequence()) function in class:stack 130 stack(const _Sequence& __c function in class:stack 134 stack(_Sequence&& __c = _Sequence()) function in class:stack [all...] |
/external/nist-sip/java/gov/nist/javax/sip/stack/ |
SIPDialogEventListener.java | 16 package gov.nist.javax.sip.stack;
|
SIPTransactionEventListener.java | 26 package gov.nist.javax.sip.stack;
|
RawMessageChannel.java | 1 package gov.nist.javax.sip.stack;
|
SIPStackTimerTask.java | 9 package gov.nist.javax.sip.stack; 31 System.out.println("SIP stack timer task failed due to exception:");
|
ServerRequestInterface.java | 29 package gov.nist.javax.sip.stack; 35 * This is implemented by the application. The stack calls the message
|
/frameworks/base/libs/surfaceflinger_client/ |
SharedBufferStack.cpp | 183 SharedBufferStack& stack( *mSharedStack ); 184 return stack.status; 189 SharedBufferStack& stack( *mSharedStack ); 190 return stack.identity; 198 SharedBufferStack& stack( *mSharedStack ); 202 prefix, stack.head, stack.available, stack.queued, 203 stack.reallocMask, stack.identity, stack.status) [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...] |
/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...] |
/ndk/sources/cxx-stl/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...] |
/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/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...] |
/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/libffi/src/pa/ |
ffi.c | 82 /* PA has a downward growing stack, which looks like this: 99 The first four argument words on the stack are reserved for use by 111 The registers are allocated in the same manner as stack slots. 112 This allows the callee to save its arguments on the stack if 123 The rest of the arguments are passed on the stack starting at SP-52, 127 or in the stack. */ 129 /* ffi_prep_args is called by the assembly routine once stack space 132 The following code will put everything into the stack frame 140 void ffi_prep_args_pa32(UINT32 *stack, extended_cif *ecif, unsigned bytes) 149 debug(1, "%s: stack = %p, ecif = %p, bytes = %u\n", __FUNCTION__, stack [all...] |
/cts/tools/dasm/src/dasm/ |
parser.java | 812 java.util.Stack stack, 817 return action_obj.CUP$do_action(act_num, parser, stack, top); [all...] |