| /external/compiler-rt/lib/asan/ |
| asan_stack.h | 30 // Get the stack trace with the given pc and bp.
31 // The pc will be in the position 0 of the resulting stack trace.
34 void GetStackTraceWithPcBpAndContext(BufferedStackTrace *stack, uptr max_depth,
38 stack->Unwind(max_depth, pc, bp, context, 0, 0, fast);
41 stack->size = 0;
45 // yields the call stack of the signal's handler and not of the code
51 stack->Unwind(max_depth, pc, bp, context, stack_top, stack_bottom, fast);
54 stack->Unwind(max_depth, pc, bp, context, 0, 0, false);
62 // NOTE: A Rule of thumb is to retrieve stack trace in the interceptors
64 // don't want stack trace to contain functions from ASan internals
[all...] |
| /external/compiler-rt/test/asan/TestCases/ |
| describe_address.cc | 8 int stack; local
13 __asan_describe_address(&stack);
14 // CHECK: Address {{.*}} is located in stack of thread T{{.*}} at offset {{.*}}
|
| /external/guava/guava/src/com/google/common/collect/ |
| BinaryTreeTraverser.java | 100 private final Deque<T> stack;
103 this.stack = new ArrayDeque<T>();
104 stack.addLast(root);
109 return !stack.isEmpty();
114 T result = stack.removeLast();
115 pushIfPresent(stack, rightChild(result));
116 pushIfPresent(stack, leftChild(result));
122 return stack.getLast();
135 private final Deque<T> stack;
139 this.stack = new ArrayDeque<T>()
[all...] |
| /external/libcxx/test/std/containers/container.adaptors/stack/stack.defn/ |
| empty.pass.cpp | 10 // <stack>
14 #include <stack>
19 std::stack<int> q;
|
| 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...] |
| /external/libcxx/test/std/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/libgdx/extensions/gdx-freetype/jni/freetype-2.6.2/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/pdfium/third_party/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...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/container.adaptors/stack/stack.defn/ |
| empty.pass.cpp | 10 // <stack>
14 #include <stack>
19 std::stack<int> q;
|
| 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/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
|
| /frameworks/base/packages/SystemUI/src/com/android/systemui/recents/events/activity/ |
| MultiWindowStateChangedEvent.java | 30 public final TaskStack stack; field in class:MultiWindowStateChangedEvent
33 TaskStack stack) {
36 this.stack = stack;
|
| /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/std/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.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/libgdx/extensions/gdx-box2d/gdx-box2d-gwt/src/com/badlogic/gdx/physics/box2d/gwt/emu/org/jbox2d/pooling/normal/ |
| MutableStack.java | 30 private E[] stack; field in class:MutableStack
36 stack = null;
43 if (stack != null) {
44 System.arraycopy(stack, 0, newStack, 0, size);
49 stack = newStack;
57 return stack[index++];
62 stack[--index] = argObject;
65 /** Creates a new instance of the object contained by this stack. */
|
