| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/container.adaptors/stack/stack.defn/ |
| top.pass.cpp | 10 // <stack>
14 #include <stack>
19 std::stack<int> q;
|
| 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;
|
| top_const.pass.cpp | 10 // <stack>
14 #include <stack>
19 std::stack<int> q;
24 const std::stack<int>& cqr = q;
|
| types.pass.cpp | 10 // <stack>
13 // class stack
27 #include <stack>
32 : private std::stack<int>
50 static_assert((std::is_same<std::stack<int>::container_type, std::deque<int> >::value), "");
51 static_assert((std::is_same<std::stack<double, std::vector<int> >::container_type, std::vector<int> >::value), "");
52 static_assert((std::is_same<std::stack<double, std::vector<int> >::value_type, int>::value), "");
53 static_assert((std::is_same<std::stack<int>::reference, std::deque<int>::reference>::value), "");
54 static_assert((std::is_same<std::stack<int>::const_reference, std::deque<int>::const_reference>::value), "");
55 static_assert((std::is_same<std::stack<int>::size_type, std::deque<int>::size_type>::value), "")
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/container.adaptors/stack/stack.special/ |
| swap_noexcept.pass.cpp | 10 // <stack>
12 // void swap(stack& c)
17 #include <stack>
26 typedef std::stack<MoveOnly> C;
|
| /external/compiler-rt/lib/asan/ |
| asan_stack.h | 24 // 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,
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...] |
| /external/libunwind/src/ppc/ |
| siglongjmp.S | 29 /* We do not need executable stack. */
30 .section .note.GNU-stack,"",@progbits
|
| /external/libunwind/src/ppc32/ |
| setcontext.S | 7 /* We do not need executable stack. */
8 .section .note.GNU-stack,"",@progbits
|
| /external/libunwind/src/ppc64/ |
| setcontext.S | 7 /* We do not need executable stack. */
8 .section .note.GNU-stack,"",@progbits
|
| /external/chromium_org/third_party/skia/tests/ |
| ClipStackTest.cpp | 24 // Build up a clip stack with a path, an empty clip, and a rect.
116 static void assert_count(skiatest::Reporter* reporter, const SkClipStack& stack,
118 SkClipStack::B2TIter iter(stack);
129 SkClipStack stack; local
140 stack.clipDevRect(gRects[i], SkRegion::kUnion_Op, false);
143 assert_count(reporter, stack, 4);
149 SkClipStack::B2TIter iter(stack);
164 SkClipStack::Iter iter(stack, SkClipStack::Iter::kTop_IterStart);
179 SkClipStack::Iter iter(stack, SkClipStack::Iter::kBottom_IterStart);
242 SkClipStack stack; local
925 SkClipStack stack; local
1022 SkClipStack stack; local
1044 SkClipStack stack; local
1149 SkClipStack stack; local
1173 SkClipStack stack; local
[all...] |
| /external/skia/tests/ |
| ClipStackTest.cpp | 24 // Build up a clip stack with a path, an empty clip, and a rect.
116 static void assert_count(skiatest::Reporter* reporter, const SkClipStack& stack,
118 SkClipStack::B2TIter iter(stack);
129 SkClipStack stack; local
140 stack.clipDevRect(gRects[i], SkRegion::kUnion_Op, false);
143 assert_count(reporter, stack, 4);
149 SkClipStack::B2TIter iter(stack);
164 SkClipStack::Iter iter(stack, SkClipStack::Iter::kTop_IterStart);
179 SkClipStack::Iter iter(stack, SkClipStack::Iter::kBottom_IterStart);
242 SkClipStack stack; local
925 SkClipStack stack; local
1022 SkClipStack stack; local
1044 SkClipStack stack; local
1149 SkClipStack stack; local
1173 SkClipStack stack; local
[all...] |
| /external/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;
|
| Android.mk | 17 test_makefile := external/libcxx/test/containers/container.adaptors/stack/stack.cons/Android.mk
19 test_name := containers/container.adaptors/stack/stack.cons/move_noexcept
23 test_name := containers/container.adaptors/stack/stack.cons/ctor_copy
27 test_name := containers/container.adaptors/stack/stack.cons/ctor_container
31 test_name := containers/container.adaptors/stack/stack.cons/default_noexcep
[all...] |
| /external/libcxx/test/containers/container.adaptors/stack/stack.cons.alloc/ |
| Android.mk | 17 test_makefile := external/libcxx/test/containers/container.adaptors/stack/stack.cons.alloc/Android.mk
19 test_name := containers/container.adaptors/stack/stack.cons.alloc/ctor_container_alloc
23 test_name := containers/container.adaptors/stack/stack.cons.alloc/ctor_rcontainer_alloc
27 test_name := containers/container.adaptors/stack/stack.cons.alloc/ctor_alloc
31 test_name := containers/container.adaptors/stack/stack.cons.alloc/ctor_copy_allo
[all...] |
| /external/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;
|
| top_const.pass.cpp | 10 // <stack>
14 #include <stack>
19 std::stack<int> q;
24 const std::stack<int>& cqr = q;
|
| Android.mk | 17 test_makefile := external/libcxx/test/containers/container.adaptors/stack/stack.defn/Android.mk
19 test_name := containers/container.adaptors/stack/stack.defn/push
23 test_name := containers/container.adaptors/stack/stack.defn/top_const
27 test_name := containers/container.adaptors/stack/stack.defn/top
31 test_name := containers/container.adaptors/stack/stack.defn/push_r
[all...] |
| types.pass.cpp | 10 // <stack>
13 // class stack
27 #include <stack>
32 : private std::stack<int>
50 static_assert((std::is_same<std::stack<int>::container_type, std::deque<int> >::value), "");
51 static_assert((std::is_same<std::stack<double, std::vector<int> >::container_type, std::vector<int> >::value), "");
52 static_assert((std::is_same<std::stack<double, std::vector<int> >::value_type, int>::value), "");
53 static_assert((std::is_same<std::stack<int>::reference, std::deque<int>::reference>::value), "");
54 static_assert((std::is_same<std::stack<int>::const_reference, std::deque<int>::const_reference>::value), "");
55 static_assert((std::is_same<std::stack<int>::size_type, std::deque<int>::size_type>::value), "")
[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;
|
| /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...] |
| /prebuilts/ndk/5/sources/cxx-stl/gnu-libstdc++/include/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...] |
| /prebuilts/ndk/6/sources/cxx-stl/gnu-libstdc++/include/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...] |
| /prebuilts/ndk/7/sources/cxx-stl/gnu-libstdc++/include/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...] |
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.4.3/include/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/chromium_org/third_party/opus/src/celt/ |
| stack_alloc.h | 5 @brief Temporary memory allocation on stack
55 * @def ALIGN(stack, size)
57 * Aligns the stack to a 'size' boundary
59 * @param stack Stack
64 * @def PUSH(stack, size, type)
66 * Allocates 'size' elements of type 'type' on the stack
68 * @param stack Stack
76 * Declare variable on stack
[all...] |
