Searched defs:stack (Results 26 - 50 of 419) sorted by relevance

1234567891011>>

/external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime.JavaExtensions/
H A DStackExtensions.cs45 public static T elementAt<T>( this Stack<T> stack, int index ) argument
47 return stack.ElementAt( index );
51 public static T peek<T>( this Stack<T> stack )
53 return stack.Peek();
57 public static T pop<T>( this Stack<T> stack )
59 return stack.Pop();
63 public static void push<T>( this Stack<T> stack, T obj ) argument
65 stack.Push( obj );
69 public static int size<T>( this Stack<T> stack )
71 return stack
75 setSize( this Stack<T> stack, int size ) argument
[all...]
/external/chromium_org/third_party/freetype/src/cff/
H A Dcf2stack.h5 /* Adobe's code for emulating a CFF stack (specification). */
46 /* CFF operand stack; specified maximum of 48 or 192 values */
75 cf2_stack_free( CF2_Stack stack ); variable
78 cf2_stack_count( CF2_Stack stack ); variable
81 cf2_stack_pushInt( CF2_Stack stack,
84 cf2_stack_pushFixed( CF2_Stack stack,
88 cf2_stack_popInt( CF2_Stack stack ); variable
90 cf2_stack_popFixed( CF2_Stack stack ); variable
93 cf2_stack_getReal( CF2_Stack stack,
97 cf2_stack_clear( CF2_Stack stack ); variable
[all...]
/external/chromium_org/third_party/tcmalloc/chromium/src/
H A Dheap-profile-stats.h9 // A bucket is data structure for heap profiling to store a pair of a stack
13 // A hash value is computed from a stack trace. Collision in the hash table
41 // Allocation and deallocation statistics per each stack trace.
43 // Longest stack trace we record.
46 uintptr_t hash; // Hash value of the stack trace.
47 int depth; // Depth of stack trace.
48 const void** stack; // Stack trace. member in struct:HeapProfileBucket
/external/chromium_org/ui/base/x/
H A Dx11_menu_list.cc42 void XMenuList::InsertMenuWindowXIDs(std::vector<XID>* stack) { argument
43 stack->insert(stack->begin(), menus_.begin(), menus_.end());
/external/compiler-rt/lib/asan/tests/
H A Dasan_benchmarks_test.cc73 int stack[1000]; local
74 Ident(stack);
/external/freetype/src/cff/
H A Dcf2stack.h5 /* Adobe's code for emulating a CFF stack (specification). */
46 /* CFF operand stack; specified maximum of 48 or 192 values */
75 cf2_stack_free( CF2_Stack stack ); variable
78 cf2_stack_count( CF2_Stack stack ); variable
81 cf2_stack_pushInt( CF2_Stack stack,
84 cf2_stack_pushFixed( CF2_Stack stack,
88 cf2_stack_popInt( CF2_Stack stack ); variable
90 cf2_stack_popFixed( CF2_Stack stack ); variable
93 cf2_stack_getReal( CF2_Stack stack,
97 cf2_stack_clear( CF2_Stack stack ); variable
[all...]
/external/guava/guava-testlib/src/com/google/common/testing/
H A DTearDownStack.java29 * A {@code TearDownStack} contains a stack of {@link TearDown} instances.
40 final LinkedList<TearDown> stack = new LinkedList<TearDown>(); field in class:TearDownStack
54 stack.addFirst(tearDown);
62 for (TearDown tearDown : stack) {
74 stack.clear();
/external/guava/guava-tests/test/com/google/common/testing/
H A DTestLogHandlerTest.java33 private TearDownStack stack = new TearDownStack(); field in class:TestLogHandlerTest
45 stack.addTearDown(new TearDown() {
84 stack.runTearDown();
/external/llvm/unittests/Support/
H A DManagedStatic.cpp31 // Valgrind's leak checker complains glibc's stack allocation.
32 // To appease valgrind, we provide our own stack for each thread.
34 void *stack = malloc(n); local
37 pthread_attr_setstack(&a, stack, n);
39 return stack;
/external/nist-sip/java/gov/nist/javax/sip/stack/
H A DDefaultRouter.java29 package gov.nist.javax.sip.stack;
H A DSIPDialogErrorEvent.java16 package gov.nist.javax.sip.stack;
H A DSIPTransactionErrorEvent.java26 package gov.nist.javax.sip.stack;
H A DStackMessageFactory.java29 package gov.nist.javax.sip.stack;
34 * by the application and called by the stack for processing requests
35 * and responses. When a Request comes in off the wire, the stack calls
37 * When a response comes off the wire, the stack calls newSIPServerResponse
61 * Generate a new server response for the stack.
/external/pdfium/core/src/fxge/fx_freetype/fxft2.5.01/src/cff/
H A Dcf2stack.h5 /* Adobe's code for emulating a CFF stack (specification). */
46 /* CFF operand stack; specified maximum of 48 or 192 values */
75 cf2_stack_free( CF2_Stack stack ); variable
78 cf2_stack_count( CF2_Stack stack ); variable
81 cf2_stack_pushInt( CF2_Stack stack,
84 cf2_stack_pushFixed( CF2_Stack stack,
88 cf2_stack_popInt( CF2_Stack stack ); variable
90 cf2_stack_popFixed( CF2_Stack stack ); variable
93 cf2_stack_getReal( CF2_Stack stack,
97 cf2_stack_clear( CF2_Stack stack ); variable
[all...]
/external/proguard/src/proguard/evaluation/
H A DInvocationUnit.java30 * and it updates the stack for the invocation of a class member.
53 * Updates the given stack corresponding to the execution of the given
61 Stack stack);
56 invokeMember(Clazz clazz, Method method, CodeAttribute codeAttribute, int offset, ConstantInstruction constantInstruction, Stack stack) argument
/external/speex/libspeex/
H A Dcb_search_bfin.h37 void compute_weighted_codebook(const signed char *shape_cb, const spx_word16_t *r, spx_word16_t *resp, spx_word16_t *resp2, spx_word32_t *E, int shape_cb_size, int subvect_size, char *stack) argument
H A Dvq_bfin.h37 void vq_nbest(spx_word16_t *in, const spx_word16_t *codebook, int len, int entries, spx_word32_t *E, int N, int *nbest, spx_word32_t *best_dist, char *stack) argument
/external/valgrind/main/exp-bbv/tests/amd64-linux/
H A Dfldcw_check.S31 # offset on stack
32 stack: label
33 sub $8,%rsp # allocate space on stack
36 add $8,%rsp # restore stack
131 fldl three # load value onto fp stack
137 fistpl result # save stack value as integer to mem
/external/valgrind/main/exp-bbv/tests/x86/
H A Dfldcw_check.S34 # offset on stack
35 stack: label
36 sub $4,%esp # allocate space on stack
39 add $4,%esp # restore stack
85 fldl three # load value onto fp stack
91 fistpl result # save stack value as integer to mem
/external/valgrind/main/memcheck/tests/linux/
H A Dstack_switch.c35 void *stack; local
40 if ( ( stack = mmap( NULL, 2* STACK_SIZE, PROT_READ|PROT_WRITE, MAP_PRIVATE|MAP_ANONYMOUS, -1, 0 ) ) == MAP_FAILED )
46 stackid = VALGRIND_STACK_REGISTER( stack, stack + STACK_SIZE );
48 if ( ( pid = clone( thread_main, stack + STACK_SIZE, CLONE_VM|CLONE_FS|CLONE_FILES|CLONE_SIGHAND|CLONE_THREAD|SIGCHLD, NULL ) ) == -1 )
/external/chromium_org/third_party/speex/libspeex/
H A Dvq.c76 void vq_nbest(spx_word16_t *in, const spx_word16_t *codebook, int len, int entries, spx_word32_t *E, int N, int *nbest, spx_word32_t *best_dist, char *stack) argument
110 void vq_nbest_sign(spx_word16_t *in, const spx_word16_t *codebook, int len, int entries, spx_word32_t *E, int N, int *nbest, spx_word32_t *best_dist, char *stack) argument
/external/compiler-rt/lib/asan/
H A Dasan_stack.h24 // Get the stack trace with the given pc and bp.
25 // The pc will be in the position 0 of the resulting stack trace.
28 void GetStackTraceWithPcBpAndContext(StackTrace *stack, uptr max_depth, uptr pc, argument
31 stack->Unwind(max_depth, pc, bp, context, 0, 0, fast);
34 stack->size = 0;
40 stack->Unwind(max_depth, pc, bp, context, stack_top, stack_bottom, fast);
43 stack->Unwind(max_depth, pc, bp, context, 0, 0, false);
51 // NOTE: A Rule of thumb is to retrieve stack trace in the interceptors
53 // don't want stack trace to contain functions from ASan internals.
56 StackTrace stack; \
[all...]
H A Dasan_win.cc81 void ReadContextStack(void *context, uptr *stack, uptr *ssize) { argument
/external/compiler-rt/test/asan/TestCases/Linux/
H A Dswapcontext_test.cc50 printf("Child stack: %p\n", child_stack);
63 // Touch childs's stack to make sure it's unpoisoned.
71 char stack[kStackSize + 1]; local
74 ret += Run(argc - 1, 0, stack);
77 ret += Run(argc - 1, 1, stack);
/external/libunwind/tests/
H A DGtest-exc.c92 long stack; local
97 n, &stack, (unsigned long) get_bsp ());
107 &stack, (unsigned long) get_bsp ());

Completed in 3681 milliseconds

1234567891011>>