HomeSort by relevance Sort by last modified time
    Searched refs:stack (Results 26 - 50 of 3511) sorted by null

12 3 4 5 6 7 8 91011>>

  /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/container.adaptors/stack/stack.cons/
move_noexcept.pass.cpp 10 // <stack>
12 // stack(stack&&)
17 #include <stack>
26 typedef std::stack<MoveOnly> C;
  /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/container.adaptors/stack/stack.defn/
size.pass.cpp 10 // <stack>
14 #include <stack>
19 std::stack<int> q;
swap.pass.cpp 10 // <stack>
12 // void swap(stack& q);
14 #include <stack>
29 std::stack<int> q1 = make<std::stack<int> >(5);
30 std::stack<int> q2 = make<std::stack<int> >(10);
31 std::stack<int> q1_save = q1;
32 std::stack<int> q2_save = q2;
  /toolchain/binutils/binutils-2.25/ld/testsuite/ld-tic6x/
attr-stack-16-8.d 1 #name: C6X stack attribute merging, 16 8
4 #source: attr-stack-16.s
5 #source: attr-stack-8.s
6 #error: .*requires more stack alignment than .* preserves
attr-stack-8-16.d 1 #name: C6X stack attribute merging, 8 16
4 #source: attr-stack-8.s
5 #source: attr-stack-16.s
6 #error: .*requires more stack alignment than .* preserves
attr-stack-8-8.d 1 #name: C6X stack attribute merging, 8 8
4 #source: attr-stack-8.s
5 #source: attr-stack-8.s
attr-stack-8-816.d 1 #name: C6X stack attribute merging, 8 816
4 #source: attr-stack-8.s
5 #source: attr-stack-816.s
attr-stack-816-8.d 1 #name: C6X stack attribute merging, 816 8
4 #source: attr-stack-816.s
5 #source: attr-stack-8.s
  /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...]
  /external/proguard/src/proguard/evaluation/
Processor.java 31 * local variable frame and stack.
39 private final Stack stack; field in class:Processor
52 * @param stack the local stack.
59 Stack stack,
66 this.stack = stack;
87 stack.push(valueFactory.createReferenceValueNull())
    [all...]
  /external/libcxx/test/std/containers/container.adaptors/stack/
version.pass.cpp 10 // <stack>
12 #include <stack>
  /external/libunwind/src/ia64/
Linstall_cursor.S 4 /* We do not need executable stack. */
5 .section .note.GNU-stack,"",@progbits
  /frameworks/base/packages/SystemUI/src/com/android/systemui/recents/events/activity/
TaskStackUpdatedEvent.java 28 * A new TaskStack instance representing the latest stack state.
30 public final TaskStack stack; field in class:TaskStackUpdatedEvent
33 public TaskStackUpdatedEvent(TaskStack stack, boolean inMultiWindow) {
34 this.stack = stack;
  /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/container.adaptors/stack/
version.pass.cpp 10 // <stack>
12 #include <stack>
  /external/libcxx/test/std/containers/container.adaptors/stack/stack.defn/
swap.pass.cpp 10 // <stack>
12 // void swap(stack& q);
14 #include <stack>
29 std::stack<int> q1 = make<std::stack<int> >(5);
30 std::stack<int> q2 = make<std::stack<int> >(10);
31 std::stack<int> q1_save = q1;
32 std::stack<int> q2_save = q2;
  /external/libcxx/test/std/containers/container.adaptors/stack/stack.ops/
eq.pass.cpp 10 // <stack>
13 // bool operator==(const stack<T, Container>& x,const stack<T, Container>& y);
16 // bool operator!=(const stack<T, Container>& x,const stack<T, Container>& y);
18 #include <stack>
33 std::stack<int> q1 = make<std::stack<int> >(5);
34 std::stack<int> q2 = make<std::stack<int> >(10)
    [all...]
lt.pass.cpp 10 // <stack>
13 // bool operator< (const stack<T, Container>& x,const stack<T, Container>& y);
16 // bool operator> (const stack<T, Container>& x,const stack<T, Container>& y);
19 // bool operator>=(const stack<T, Container>& x,const stack<T, Container>& y);
22 // bool operator<=(const stack<T, Container>& x,const stack<T, Container>& y);
24 #include <stack>
    [all...]
  /external/libcxx/test/std/containers/container.adaptors/stack/stack.special/
swap.pass.cpp 10 // <stack>
13 // void swap(stack<T, Container>& x, stack<T, Container>& y);
15 #include <stack>
30 std::stack<int> q1 = make<std::stack<int> >(5);
31 std::stack<int> q2 = make<std::stack<int> >(10);
32 std::stack<int> q1_save = q1;
33 std::stack<int> q2_save = q2
    [all...]
  /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/container.adaptors/stack/stack.ops/
eq.pass.cpp 10 // <stack>
13 // bool operator==(const stack<T, Container>& x,const stack<T, Container>& y);
16 // bool operator!=(const stack<T, Container>& x,const stack<T, Container>& y);
18 #include <stack>
33 std::stack<int> q1 = make<std::stack<int> >(5);
34 std::stack<int> q2 = make<std::stack<int> >(10)
    [all...]
lt.pass.cpp 10 // <stack>
13 // bool operator< (const stack<T, Container>& x,const stack<T, Container>& y);
16 // bool operator> (const stack<T, Container>& x,const stack<T, Container>& y);
19 // bool operator>=(const stack<T, Container>& x,const stack<T, Container>& y);
22 // bool operator<=(const stack<T, Container>& x,const stack<T, Container>& y);
24 #include <stack>
    [all...]
  /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/container.adaptors/stack/stack.special/
swap.pass.cpp 10 // <stack>
13 // void swap(stack<T, Container>& x, stack<T, Container>& y);
15 #include <stack>
30 std::stack<int> q1 = make<std::stack<int> >(5);
31 std::stack<int> q2 = make<std::stack<int> >(10);
32 std::stack<int> q1_save = q1;
33 std::stack<int> q2_save = q2
    [all...]
  /external/testng/src/main/java/org/testng/reporters/util/
StackTraceTools.java 6 * Functionality to allow tools to analyse and subdivide stack traces.
15 /** Finds topmost position of the test method in the stack, or top of stack if <code>method</code> is not in it. */
16 public static int getTestRoot(StackTraceElement[] stack,ITestNGMethod method) {
17 if(stack!=null) {
19 for(int x=stack.length-1; x>=0; x--) {
20 if(cname.equals(stack[x].getClassName())
21 && method.getMethodName().equals(stack[x].getMethodName())) {
25 return stack.length-1;
31 /** Finds topmost position of the test method in the stack, or top of stack if <code>method</code> is not in it. *
    [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/valgrind/memcheck/tests/
descr_belowsp.stderr.exp 2 Address 0x........ is on thread 1's stack
3 .... bytes below stack pointer
5 Address 0x........ is on thread 2's stack
6 .... bytes below stack pointer
12 Address 0x........ is on thread 2's stack
13 .... bytes below stack pointer
15 describing 0x........ discovered address giving SEGV in thread stack
16 Address 0x........ is on thread 2's stack
17 In stack guard protected page, .... bytes below stack pointe
    [all...]
  /prebuilts/misc/common/swig/include/2.0.11/std/
std_stack.i 5 * @brief A wrapping of std::stack for Ruby.
12 // Stack
14 %define %std_stack_methods(stack...)
15 stack();
16 stack( const _Sequence& );
25 %define %std_stack_methods_val(stack...)
26 %std_stack_methods(stack)
30 // std::stack
35 // -- f(std::stack<T>), f(const std::stack<T>&)
    [all...]

Completed in 1599 milliseconds

12 3 4 5 6 7 8 91011>>