/external/stlport/test/unit/ |
H A D | stack_header_test.cpp | 8 #include <stack>
|
/external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime.JavaExtensions/ |
H A D | StackExtensions.cs | 45 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/v8/test/mjsunit/compiler/ |
H A D | regress-stacktrace.js | 28 // Test correctness of stack traces with global functions. 42 var stack = e.stack.toString(); 43 var p3 = stack.indexOf("at three"); 44 var p2 = stack.indexOf("at two"); 45 var p1 = stack.indexOf("at one"); 51 print(stack);
|
H A D | regress-stacktrace-methods.js | 30 // Test stack traces with method calls. 56 var stack = e.stack.toString(); 57 var p3 = stack.indexOf("at Hest.three"); 58 var p2 = stack.indexOf("at Svin.two"); 59 var p1 = stack.indexOf("at Hest.one"); 65 assertTrue(stack.indexOf("38:56") != -1); 66 assertTrue(stack.indexOf("34:51") != -1); 67 assertTrue(stack.indexOf("36:38") != -1); 68 assertTrue(stack [all...] |
/external/speex/libspeex/ |
H A D | 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 80 * Allocate 'size' elements of 'type' on stack 91 #define ALIGN(stack, siz [all...] |
/external/proguard/src/proguard/evaluation/ |
H A D | 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()); 97 stack.push(valueFactory.createIntegerValue(simpleInstruction.constant)); 102 stack 61 Processor(Variables variables, Stack stack, ValueFactory valueFactory, BranchUnit branchUnit, InvocationUnit invocationUnit) argument [all...] |
/external/compiler-rt/lib/asan/ |
H A D | asan_stack.cc | 12 // Code for ASan stack trace. 22 void PrintStack(StackTrace *stack) { argument 23 stack->PrintStack(stack->trace, stack->size, flags()->symbolize,
|
H A D | asan_stack.h | 21 void GetStackTrace(StackTrace *stack, uptr max_s, uptr pc, uptr bp); 22 void PrintStack(StackTrace *stack); 26 // Get the stack trace with the given pc and bp. 27 // The pc will be in the position 0 of the resulting stack trace. 31 StackTrace stack; \ 32 GetStackTrace(&stack, max_s, pc, bp) 34 // NOTE: A Rule of thumb is to retrieve stack trace in the interceptors 36 // don't want stack trace to contain functions from ASan internals. 51 PrintStack(&stack); \
|
H A D | asan_report.h | 22 // on the memory type (shadow/heap/stack/global). 35 void NORETURN ReportDoubleFree(uptr addr, StackTrace *stack); 36 void NORETURN ReportFreeNotMalloced(uptr addr, StackTrace *stack); 38 StackTrace *stack); 40 StackTrace *stack); 43 const char *offset2, uptr length2, StackTrace *stack); 47 uptr addr, uptr zone_ptr, const char *zone_name, StackTrace *stack); 49 uptr addr, uptr zone_ptr, const char *zone_name, StackTrace *stack); 51 uptr addr, uptr zone_ptr, const char *zone_name, StackTrace *stack);
|
/external/easymock/src/org/easymock/internal/ |
H A D | LastControl.java | 48 Stack<IArgumentMatcher> stack = threadToArgumentMatcherStack.get();
49 if (stack == null) {
50 stack = new Stack<IArgumentMatcher>();
51 threadToArgumentMatcherStack.set(stack);
53 stack.push(matcher);
57 Stack<IArgumentMatcher> stack = threadToArgumentMatcherStack.get();
58 if (stack == null) {
62 return new ArrayList<IArgumentMatcher>(stack);
66 Stack<IArgumentMatcher> stack = threadToArgumentMatcherStack.get();
67 assertState(stack ! [all...] |
/external/webkit/Tools/Scripts/webkitpy/common/system/ |
H A D | stack_utils.py | 29 """Simple routines for logging, obtaining thread stack information.""" 37 stack = _find_thread_stack(thread_id) 38 assert(stack is not None) 41 _log_stack(logger, stack) 46 """Returns a stack object that can be used to dump a stack trace for 48 for tid, stack in sys._current_frames().items(): 50 return stack 54 def _log_stack(logger, stack): 55 """Log a stack trac [all...] |
/external/v8/test/mjsunit/regress/ |
H A D | regress-117794.js | 42 print(exc2.stack); 50 print(exc3.stack); 56 print(exc1.stack);
|
/external/srec/srec/crec/ |
H A D | 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, argument 383 extended_parp = make_new_partial_path(stack); 421 void check_stack_root_sanity(AstarStack* stack) argument 423 partial_path* parp1 = stack->root_path; 424 /* append_arc_arriving(stack 433 make_new_partial_path(AstarStack* stack) argument 464 free_partial_path(AstarStack* stack, partial_path* parp) argument 485 make_partial_path(AstarStack* stack, wtokenID token_index, srec* rec, int* pwhether_complete) argument 524 AstarStack *stack; local 556 AstarStack *stack = rec->astar_stack; local 569 astar_stack_prepare(AstarStack* stack, int request_nbest_len, srec* rec) argument 626 astar_stack_clear(AstarStack* stack) argument 657 AstarStack *stack = rec->astar_stack; local 1037 astar_draw_tree_as_dotty(const char* file, srec* rec, AstarStack* stack) argument 1073 astar_stack_prepare_from_active_search(AstarStack* stack, int nbestlen, srec* rec) argument 1142 maybe_add_to_active_paths(AstarStack* stack, word_token* word_token_array, bigcostdata parp_costsofar, wtokenID wtoken_index) argument 1243 astar_stack_flag_word_tokens_used(AstarStack* stack, srec* rec) argument 1319 list_free_parps(AstarStack* stack, char* msg) argument [all...] |
H A D | 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 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/javassist/src/main/javassist/bytecode/ |
H A D | CodeAnalyzer.java | 33 /* d = stack[i] 40 int[] stack = new int[length]; 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) { argument 62 stack[0] = -1; 67 stack[e 71 visitBytecode(CodeIterator ci, int[] stack, int index) argument 98 processBranch(int opcode, CodeIterator ci, int index, int codeLength, int[] stack, int stackDepth, int[] jsrDepth) argument 189 checkTarget(int opIndex, int target, int codeLength, int[] stack, int stackDepth) argument 211 visitInst(int op, CodeIterator ci, int index, int stack) argument [all...] |
/external/nist-sip/java/gov/nist/javax/sip/stack/ |
H A D | SIPDialogEventListener.java | 16 package gov.nist.javax.sip.stack;
|
H A D | SIPTransactionEventListener.java | 26 package gov.nist.javax.sip.stack;
|
/external/javassist/src/main/javassist/bytecode/analysis/ |
H A D | 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) { argument 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/webkit/LayoutTests/fast/js/resources/ |
H A D | script-line-number.js | 12 if (e.stack) { 14 parts = e.stack.split(":");
|
/external/stlport/stlport/stl/ |
H A D | _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_ARG [all...] |
/external/valgrind/main/memcheck/tests/linux/ |
H A D | stack_switch.c | 35 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/guava/guava-tests/test/com/google/common/testing/ |
H A D | TearDownStackTest.java | 38 final TearDownStack stack = buildTearDownStack(); 41 stack.addTearDown(tearDown); 45 stack.runTearDown(); 52 final TearDownStack stack = buildTearDownStack(); 55 stack.addTearDown(tearDownOne); 66 stack.addTearDown(tearDownTwo); 71 stack.runTearDown(); 79 final TearDownStack stack = buildTearDownStack(); 82 stack.addTearDown(tearDownOne); 85 stack [all...] |
/external/proguard/src/proguard/classfile/attribute/preverification/ |
H A D | 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 51 FullFrame(int offsetDelta, VerificationType[] variables, VerificationType[] stack) argument 66 FullFrame(int offsetDelta, int variablesCount, VerificationType[] variables, int stackCount, VerificationType[] stack) argument [all...] |
/external/libffi/src/pa/ |
H A D | 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) argument 149 debug(1, "%s: stack 417 ffi_closure_inner_pa32(ffi_closure *closure, UINT32 *stack) argument [all...] |
/external/clang/test/CodeGen/ |
H A D | 2002-12-15-StructParameters.c | 5 void *stack; member in struct:__anon4115
|