| /external/libunwind/src/ppc64/ |
| setcontext.S | 7 /* We do not need executable stack. */
8 .section .note.GNU-stack,"",@progbits
|
| /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;
|
| ctor_move.pass.cpp | 12 // <stack>
14 // stack(stack&& q);
16 #include <stack>
35 std::stack<MoveOnly> q(make<std::deque<MoveOnly> >(5));
36 std::stack<MoveOnly> q2 = std::move(q);
|
| ctor_default.pass.cpp | 10 // <stack>
12 // stack();
14 #include <stack>
22 std::stack<int, std::vector<int, limited_allocator<int, 10> > > q;
|
| ctor_rcontainer.pass.cpp | 12 // <stack>
14 // explicit stack(container_type&& c);
16 #include <stack>
35 std::stack<MoveOnly> q(make<std::deque<MoveOnly> >(5));
|
| /external/libcxx/test/std/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;
|
| 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<int, std::vector<int> >::container_type, std::vector<int> >::value), "");
52 static_assert(( std::is_same<std::stack<int, 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...] |
| assign_move.pass.cpp | 12 // <stack>
14 // stack& operator=(stack&& q);
16 #include <stack>
35 std::stack<MoveOnly> q(make<std::deque<MoveOnly> >(5));
36 std::stack<MoveOnly> q2;
|
| push.pass.cpp | 10 // <stack>
14 #include <stack>
19 std::stack<int> q;
|
| /external/apache-commons-bcel/src/main/java/org/apache/bcel/verifier/structurals/ |
| Frame.java | 24 * a local variable array and an operand stack.
50 private final OperandStack stack; field in class:Frame
57 stack = new OperandStack(maxStack);
63 public Frame(final LocalVariables locals, final OperandStack stack) {
65 this.stack = stack;
73 final Frame f = new Frame(locals.getClone(), stack.getClone());
95 return stack;
101 public int hashCode() { return stack.hashCode() ^ locals.hashCode(); }
112 return this.stack.equals(f.stack) && this.locals.equals(f.locals)
[all...] |
| InstConstraintVisitor.java | 68 * @see #stack()
91 private OperandStack stack() { method in class:InstConstraintVisitor
192 * Ensures the general preconditions of an instruction that accesses the stack.
193 * This method is here because BCEL has no such superinterface for the stack
207 final int consume = o.consumeStack(cpg); // Stack values are always consumed first; then produced.
208 if (consume > stack().slotsUsed()) {
210 "Cannot consume "+consume+" stack slots: only "+stack().slotsUsed()+" slot(s) left on stack!\nStack:\n"+stack());
[all...] |
| /external/freetype/src/psaux/ |
| psstack.h | 5 * Adobe's code for emulating a CFF stack (specification).
46 /* CFF operand stack; specified maximum of 48 or 192 values */
77 cf2_stack_free( CF2_Stack stack ); variable
80 cf2_stack_count( CF2_Stack stack ); variable
83 cf2_stack_pushInt( CF2_Stack stack,
86 cf2_stack_pushFixed( CF2_Stack stack,
90 cf2_stack_popInt( CF2_Stack stack ); variable
92 cf2_stack_popFixed( CF2_Stack stack ); variable
95 cf2_stack_getReal( CF2_Stack stack,
98 cf2_stack_setReal( CF2_Stack stack,
112 cf2_stack_clear( CF2_Stack stack ); variable
[all...] |
| /external/compiler-rt/lib/sanitizer_common/tests/ |
| sanitizer_stackdepot_test.cc | 24 StackTrace stack = StackDepotGet(i1); local
25 EXPECT_NE(stack.trace, (uptr*)0);
26 EXPECT_EQ(ARRAY_SIZE(array), stack.size);
27 EXPECT_EQ(0, internal_memcmp(stack.trace, array, sizeof(array)));
31 StackTrace stack = StackDepotGet((1 << 30) - 1); local
32 EXPECT_EQ((uptr*)0, stack.trace);
37 StackTrace stack = StackDepotGet(i1); local
38 EXPECT_EQ((uptr*)0, stack.trace);
42 StackTrace stack = StackDepotGet(0); local
43 EXPECT_EQ((uptr*)0, stack.trace)
52 StackTrace stack = StackDepotGet(i1); local
86 StackTrace stack = StackDepotGet(ids[i]); local
[all...] |
| /external/ltp/lib/ |
| cloner.c | 54 # define clone(fn, stack, flags, arg, ptid, tls, ctid) \
55 clone(fn, stack, flags, arg)
60 * 1. hppa takes bottom of stack and no stacksize (stack grows up)
61 * 2. __ia64__ takes bottom of stack and uses clone2
62 * 3. all others take top of stack (stack grows down)
66 size_t stack_size, void *stack, pid_t *ptid, void *tls, pid_t *ctid)
71 ret = __clone2(fn, stack, stack_size, flags, arg, ptid, tls, ctid);
75 * These arches grow their stack up, so don't need to adjust the base
128 void *stack; local
[all...] |
| /external/compiler-rt/lib/asan/ |
| asan_suppressions.h | 25 bool IsStackTraceSuppressed(const StackTrace *stack);
|
| /external/libunwind/src/aarch64/ |
| siglongjmp.S | 10 /* We do not need executable stack. */
11 .section .note.GNU-stack,"",%progbits
|
| /external/libunwind/src/arm/ |
| siglongjmp.S | 10 /* We do not need executable stack. */
11 .section .note.GNU-stack,"",%progbits
|
| /external/nist-sip/java/gov/nist/javax/sip/stack/ |
| SIPDialogEventListener.java | 16 package gov.nist.javax.sip.stack;
|
| SIPTransactionEventListener.java | 26 package gov.nist.javax.sip.stack;
|
| /external/jacoco/org.jacoco.core/src/org/jacoco/core/internal/flow/ |
| FrameSnapshot.java | 30 private final Object[] stack; field in class:FrameSnapshot
32 private FrameSnapshot(final Object[] locals, final Object[] stack) {
34 this.stack = stack;
43 * number of items to remove from the operand stack
52 final Object[] stack = reduce(analyzer.stack, popCount); local
53 return new FrameSnapshot(locals, stack);
78 mv.visitFrame(Opcodes.F_NEW, locals.length, locals, stack.length,
79 stack);
[all...] |
| /external/pcre/dist2/src/sljit/ |
| sljitUtils.c | 2 * Stack-less Just-In-Time compiler
148 /* Stack */
208 struct sljit_stack *stack; local
233 stack = (struct sljit_stack*)SLJIT_MALLOC(sizeof(struct sljit_stack), allocator_data);
234 if (!stack)
243 SLJIT_FREE(stack, allocator_data);
247 stack->min_start = (sljit_u8 *)ptr;
248 stack->end = stack->min_start + max_size;
249 stack->start = stack->end
[all...] |
| /external/autotest/tko/ |
| status_lib_unittest.py | 107 stack = status_lib.status_stack()
108 self.assertEquals(stack.current_status(), "NOSTATUS")
112 stack = status_lib.status_stack()
113 stack.update("FAIL")
114 stack.start()
115 self.assertEquals(stack.current_status(), "NOSTATUS")
119 stack = status_lib.status_stack()
120 self.assertEquals(stack.size(), 0)
121 stack.start()
122 stack.end(
[all...] |
| /external/ltp/include/ |
| tst_clone.h | 29 size_t stack_size, void *stack);
31 size_t stack_size, void *stack, ...);
|
| /device/linaro/bootloader/edk2/StdLib/LibC/CRT/Ia32/ |
| ulldiv.c | 38 ; Original local stack when calling _aulldiv
55 ; Set up the local stack for NULL Reminder pointer
61 ; Set up the local stack for Divisor parameter
69 ; Set up the local stack for Dividend parameter
82 ; Adjust stack
local
|
