| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/x86_64-linux/include/c++/4.6.x-google/bits/ |
| stl_stack.h | 0 // Stack implementation -*- C++ -*-
55 * Do not attempt to use it directly. @headername{stack}
81 * first-in-last-out %stack behavior.
91 * push, @c pop, and @c top, which are standard %stack/FILO
95 class stack class
105 operator==(const stack<_Tp1, _Seq1>&, const stack<_Tp1, _Seq1>&);
109 operator<(const stack<_Tp1, _Seq1>&, const stack<_Tp1, _Seq1>&);
129 stack(const _Sequence& __c = _Sequence() function in class:stack
133 stack(const _Sequence& __c) function in class:stack
137 stack(_Sequence&& __c = _Sequence()) function in class:stack
[all...] |
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.6/include/bits/ |
| stl_stack.h | 0 // Stack implementation -*- C++ -*-
55 * Do not attempt to use it directly. @headername{stack}
81 * first-in-last-out %stack behavior.
91 * push, @c pop, and @c top, which are standard %stack/FILO
95 class stack class
105 operator==(const stack<_Tp1, _Seq1>&, const stack<_Tp1, _Seq1>&);
109 operator<(const stack<_Tp1, _Seq1>&, const stack<_Tp1, _Seq1>&);
129 stack(const _Sequence& __c = _Sequence() function in class:stack
133 stack(const _Sequence& __c) function in class:stack
137 stack(_Sequence&& __c = _Sequence()) function in class:stack
[all...] |
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.7/include/bits/ |
| stl_stack.h | 0 // Stack implementation -*- C++ -*-
55 * Do not attempt to use it directly. @headername{stack}
81 * first-in-last-out %stack behavior.
91 * push, @c pop, and @c top, which are standard %stack/FILO
95 class stack class
105 operator==(const stack<_Tp1, _Seq1>&, const stack<_Tp1, _Seq1>&);
109 operator<(const stack<_Tp1, _Seq1>&, const stack<_Tp1, _Seq1>&);
129 stack(const _Sequence& __c = _Sequence() function in class:stack
133 stack(const _Sequence& __c) function in class:stack
137 stack(_Sequence&& __c = _Sequence()) function in class:stack
[all...] |
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.6/include/bits/ |
| stl_stack.h | 0 // Stack implementation -*- C++ -*-
55 * Do not attempt to use it directly. @headername{stack}
81 * first-in-last-out %stack behavior.
91 * push, @c pop, and @c top, which are standard %stack/FILO
95 class stack class
105 operator==(const stack<_Tp1, _Seq1>&, const stack<_Tp1, _Seq1>&);
109 operator<(const stack<_Tp1, _Seq1>&, const stack<_Tp1, _Seq1>&);
129 stack(const _Sequence& __c = _Sequence() function in class:stack
133 stack(const _Sequence& __c) function in class:stack
137 stack(_Sequence&& __c = _Sequence()) function in class:stack
[all...] |
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.7/include/bits/ |
| stl_stack.h | 0 // Stack implementation -*- C++ -*-
55 * Do not attempt to use it directly. @headername{stack}
81 * first-in-last-out %stack behavior.
91 * push, @c pop, and @c top, which are standard %stack/FILO
95 class stack class
105 operator==(const stack<_Tp1, _Seq1>&, const stack<_Tp1, _Seq1>&);
109 operator<(const stack<_Tp1, _Seq1>&, const stack<_Tp1, _Seq1>&);
129 stack(const _Sequence& __c = _Sequence() function in class:stack
133 stack(const _Sequence& __c) function in class:stack
137 stack(_Sequence&& __c = _Sequence()) function in class:stack
[all...] |
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.8/include/bits/ |
| stl_stack.h | 0 // Stack implementation -*- C++ -*-
53 * Do not attempt to use it directly. @headername{stack}
82 * first-in-last-out %stack behavior.
92 * push, @c pop, and @c top, which are standard %stack/FILO
96 class stack class
106 operator==(const stack<_Tp1, _Seq1>&, const stack<_Tp1, _Seq1>&);
110 operator<(const stack<_Tp1, _Seq1>&, const stack<_Tp1, _Seq1>&);
130 stack(const _Sequence& __c = _Sequence() function in class:stack
134 stack(const _Sequence& __c) function in class:stack
138 stack(_Sequence&& __c = _Sequence()) function in class:stack
[all...] |
| /external/chromium-trace/trace-viewer/src/ui/ |
| rect_view_test.js | 26 var stack = new ui.QuadStack();
29 stack.initialize(quadsBbox.asRect(), deviceViewportSizeForFrame);
30 stack.quads = quads;
32 this.addHTMLOutput(stack);
34 assertEquals('125px', stack.worldViewportRectView.style.width);
35 assertEquals((50 + 36) + 'px', stack.worldViewportRectView.style.height);
|
| /external/llvm/test/CodeGen/Generic/ |
| undef-phi.ll | 9 define i32 @push(%struct.xx_stack* %stack) nounwind uwtable readonly ssp {
11 %tobool1 = icmp eq %struct.xx_stack* %stack, null
15 %stack.addr.02 = phi %struct.xx_stack* [ %0, %for.body ], [ %stack, %entry ]
16 %next = getelementptr inbounds %struct.xx_stack* %stack.addr.02, i64 0, i32 1
22 %top.0.lcssa = phi %struct.xx_stack* [ undef, %entry ], [ %stack.addr.02, %for.body ]
|
| /external/llvm/test/CodeGen/X86/ |
| win_ftol2.ll | 11 ; the x87 stack instead of the callstack. The input value is popped by the
42 ;; stack is empty
44 ;; stack is %z
46 ;; stack is %y %z
48 ;; stack is %x %y %z
50 ;; stack is %x %1 %z
52 ;; stack is %1 %2
56 ;; stack is %2 %1
62 ;; stack is empty
76 ;; stack is empt
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/container.adaptors/stack/stack.cons/ |
| ctor_copy.pass.cpp | 10 // <stack>
12 // stack(const stack&) = default;
14 #include <stack>
29 std::stack<int> q(make<std::deque<int> >(5));
30 std::stack<int> q2 = q;
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/container.adaptors/stack/stack.defn/ |
| assign_copy.pass.cpp | 10 // <stack>
12 // stack& operator=(const stack& q);
14 #include <stack>
29 std::stack<int> q(make<std::deque<int> >(5));
30 std::stack<int> q2;
|
| /packages/apps/UnifiedEmail/src/org/apache/james/mime4j/field/address/parser/ |
| JJTAddressListParserState.java | 6 private java.util.Stack<Node> nodes;
7 private java.util.Stack<Integer> marks;
9 private int sp; // number of nodes on stack
14 nodes = new java.util.Stack<Node>();
15 marks = new java.util.Stack<Integer>();
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...] |
| /system/core/include/utils/ |
| CallStack.h | 31 // Collect/print the call stack (function, file, line) traces for a single thread.
35 // Prune the lowest-most stack frames until we have at most MAX_DEPTH.
37 // Placeholder for specifying the current thread when updating the stack.
41 // Create an empty call stack. No-op.
43 // Create a callstack with the current thread's stack trace.
62 // Get the PC address for the stack frame specified by index.
65 // Reset the stack frames (same as creating an empty call stack).
68 // Immediately collect the stack traces for the specified thread.
71 // Dump a stack trace to the log using the supplied logtag
[all...] |
| /external/chromium_org/v8/test/mjsunit/compiler/ |
| 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.indexOf("54:5") != -1)
[all...] |
| /external/compiler-rt/lib/asan/ |
| asan_report.h | 22 // on the memory type (shadow/heap/stack/global).
36 void NORETURN ReportDoubleFree(uptr addr, StackTrace *stack);
37 void NORETURN ReportFreeNotMalloced(uptr addr, StackTrace *stack);
38 void NORETURN ReportAllocTypeMismatch(uptr addr, StackTrace *stack,
42 StackTrace *stack);
44 StackTrace *stack);
47 const char *offset2, uptr length2, StackTrace *stack);
51 uptr addr, uptr zone_ptr, const char *zone_name, StackTrace *stack);
53 uptr addr, uptr zone_ptr, const char *zone_name, StackTrace *stack);
55 uptr addr, uptr zone_ptr, const char *zone_name, StackTrace *stack);
[all...] |
| /external/freetype/src/cff/ |
| cf2stack.h | 5 /* 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/llvm/test/CodeGen/ARM/ |
| 2013-04-16-AAPCS-C5-vs-VFP.ll | 5 ; byval parameter and check that it goes to stack only.
7 ;Co-Processor register candidates may be either in VFP or in stack, so after
8 ;all VFP are allocated, stack is used. We can use stack without GPR allocation
10 ;First eight params goes to d0-d7, ninth one goes to the stack.
31 double %p8, ; --> Stack
33 %struct_t* byval %p10) ; --> Stack+8
56 double 23.8, ; --> Stack
57 i32 43, ; --> R0, not Stack+8
58 %struct_t* byval @static_val) ; --> Stack+8, not R1
[all...] |
| /external/v8/test/mjsunit/compiler/ |
| 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.indexOf("54:5") != -1)
[all...] |
| /external/valgrind/main/drd/tests/ |
| annotate_trace_memory_xml.stderr.exp-32bit | 33 <stack>
42 </stack>
45 <stack>
54 </stack>
57 <stack>
66 </stack>
70 <stack>
79 </stack>
82 <stack>
91 </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/bison/examples/calc++/ |
| stack.hh | 3 /* Stack handling for Bison parsers in C++
34 ** \file ../../../../examples/calc++/stack.hh
35 ** Define the yy::stack class.
45 /* Line 34 of stack.hh */
46 #line 47 "../../../../examples/calc++/stack.hh"
48 class stack class in namespace:yy
55 stack () : seq_ () function in class:yy::stack
59 stack (unsigned int n) : seq_ (n) function in class:yy::stack
106 /// Present a slice of the top of a stack.
107 template <class T, class S = stack<T>
[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...] |
| /prebuilts/ndk/5/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...] |
