Home
last modified time | relevance | path

Searched full:stack (Results 1 – 25 of 12398) sorted by relevance

12345678910>>...496

/external/google-breakpad/src/processor/testdata/symbols/libc-2.13.so/F4F8DFCD5A5FB5A7CE64717E9E6AE3890/
Dlibc-2.13.so.sym1712 STACK CFI INIT 1eaf0 90 .cfa: $rsp 16 + .ra: .cfa -8 + ^
1713 STACK CFI 1eaf6 .cfa: $rsp 24 +
1714 STACK CFI INIT 1eb80 2 .cfa: $rsp 8 + .ra: .cfa -8 + ^
1715 STACK CFI INIT 1eb90 9 .cfa: $rsp 8 + .ra: .cfa -8 + ^
1716 STACK CFI 1eb94 .cfa: $rsp 16 +
1717 STACK CFI INIT 1eba0 210 .cfa: $rsp 8 + .ra: .cfa -8 + ^
1718 STACK CFI 1ebac $rbp: .cfa -32 + ^ $rbx: .cfa -40 + ^
1719 STACK CFI 1ebba .cfa: $rsp 80 +
1720 STACK CFI 1ebc7 $r12: .cfa -24 + ^ $r13: .cfa -16 + ^
1721 STACK CFI INIT 1edb0 1c7 .cfa: $rsp 8 + .ra: .cfa -8 + ^
[all …]
/external/google-breakpad/src/processor/testdata/symbols/libgcc_s.so.1/18B180F90887D8F8B5C35D185444AF4C0/
Dlibgcc_s.so.1.sym129 STACK CFI INIT 2bb0 2c0 .cfa: $rsp 16 + .ra: .cfa -8 + ^
130 STACK CFI 2bb6 .cfa: $rsp 24 +
131 STACK CFI INIT 2fe0 4b .cfa: $rsp 8 + .ra: .cfa -8 + ^
132 STACK CFI INIT 3030 29 .cfa: $rsp 8 + .ra: .cfa -8 + ^
133 STACK CFI INIT 3060 67 .cfa: $rsp 8 + .ra: .cfa -8 + ^
134 STACK CFI INIT 30d0 67 .cfa: $rsp 8 + .ra: .cfa -8 + ^
135 STACK CFI INIT 3140 6a .cfa: $rsp 8 + .ra: .cfa -8 + ^
136 STACK CFI INIT 31b0 32 .cfa: $rsp 8 + .ra: .cfa -8 + ^
137 STACK CFI INIT 31f0 32 .cfa: $rsp 8 + .ra: .cfa -8 + ^
138 STACK CFI INIT 3230 2 .cfa: $rsp 8 + .ra: .cfa -8 + ^
[all …]
/external/google-breakpad/src/processor/testdata/symbols/ld-2.13.so/C32AD7E235EA6112E02A5B9D6219C4850/
Dld-2.13.so.sym17 STACK CFI INIT b40 8 .cfa: $rsp 8 + .ra: .cfa -8 + ^
18 STACK CFI INIT b50 5 .cfa: $rsp 8 + .ra: .cfa -8 + ^
19 STACK CFI INIT b60 5 .cfa: $rsp 8 + .ra: .cfa -8 + ^
20 STACK CFI INIT b70 69 .cfa: $rsp 8 + .ra: .cfa -8 + ^
21 STACK CFI b71 .cfa: $rsp 16 +
22 STACK CFI b74 $rbx: .cfa -16 + ^
23 STACK CFI b7e .cfa: $rsp 48 +
24 STACK CFI INIT be0 49 .cfa: $rsp 8 + .ra: .cfa -8 + ^
25 STACK CFI be1 .cfa: $rsp 16 +
26 STACK CFI be4 $rbx: .cfa -16 + ^
[all …]
/external/google-breakpad/src/tools/windows/dump_syms/testdata/
Dpe_only_symbol_test.sym3 STACK CFI INIT 1440 39 .cfa: $rsp .ra: .cfa 8 - ^
4 STACK CFI 1440 .cfa: $rsp 32 +
5 STACK CFI INIT 1490 7f .cfa: $rsp .ra: .cfa 8 - ^
6 STACK CFI 1490 .cfa: $rsp 128 +
7 STACK CFI INIT 1520 41 .cfa: $rsp .ra: .cfa 8 - ^
8 STACK CFI 1520 .cfa: $rsp 48 +
9 STACK CFI INIT 1570 35 .cfa: $rsp .ra: .cfa 8 - ^
10 STACK CFI 1570 .cfa: $rsp 48 +
11 STACK CFI INIT 15b0 3a .cfa: $rsp .ra: .cfa 8 - ^
12 STACK CFI 15b0 .cfa: $rsp 48 +
[all …]
/external/pytorch/torch/csrc/jit/mobile/
Dpromoted_prim_ops.h7 void tupleIndex(Stack& stack);
9 void raiseException(Stack& stack);
11 void is(Stack& stack);
13 void unInitialized(Stack& stack);
15 void isNot(Stack& stack);
17 void aten_format(Stack& stack);
19 void size(Stack& stack);
21 void sym_size(Stack& stack);
23 void sym_size_int(Stack& stack);
25 void sym_stride_int(Stack& stack);
[all …]
Dpromoted_prim_ops.cpp7 void tupleIndex(Stack& stack) { in tupleIndex() argument
8 int64_t index = pop(stack).toInt(); in tupleIndex()
9 auto tuple = pop(stack).toTuple(); in tupleIndex()
16 stack.emplace_back(tuple->elements()[norm_index]); in tupleIndex()
19 void raiseException(Stack& stack) { in raiseException() argument
23 throw JITException(pop(stack).toStringRef()); in raiseException()
26 void raiseExceptionWithMessage(Stack& stack) { in raiseExceptionWithMessage() argument
30 pop(stack).toOptional<std::string>(); in raiseExceptionWithMessage()
32 pop(stack, message); in raiseExceptionWithMessage()
37 void is(Stack& stack) { in is() argument
[all …]
/external/sdv/vsomeip/third_party/boost/fusion/include/boost/fusion/iterator/detail/
Dsegmented_next_impl.hpp28 template <typename Sequence, typename Stack>
31 //bool is_invalid(stack)
33 // return empty(car(stack));
36 template <typename Stack>
39 typename Stack::car_type::begin_type,
40 typename Stack::car_type::end_type
45 ////top of a stack of iterator ranges. Return the
46 ////new stack.
47 //auto pop_front_car(stack)
49 // return cons(iterator_range(next(begin(car(stack))), end(car(stack))), cdr(stack));
[all …]
/external/libchrome/base/task_scheduler/
Dscheduler_worker_stack_unittest.cc76 SchedulerWorkerStack stack; in TEST_F() local
77 EXPECT_EQ(nullptr, stack.Pop()); in TEST_F()
79 EXPECT_TRUE(stack.IsEmpty()); in TEST_F()
80 EXPECT_EQ(0U, stack.Size()); in TEST_F()
82 stack.Push(worker_a_.get()); in TEST_F()
83 EXPECT_FALSE(stack.IsEmpty()); in TEST_F()
84 EXPECT_EQ(1U, stack.Size()); in TEST_F()
86 stack.Push(worker_b_.get()); in TEST_F()
87 EXPECT_FALSE(stack.IsEmpty()); in TEST_F()
88 EXPECT_EQ(2U, stack.Size()); in TEST_F()
[all …]
/external/rust/android-crates-io/crates/pest/src/
Dstack.rs14 /// Implementation of a `Stack` which maintains popped elements and length of previous states
15 /// in order to rewind the stack to a previous state.
17 pub struct Stack<T: Clone> { struct
18 /// All elements in the stack.
43 impl<T: Clone> Default for Stack<T> { implementation
49 impl<T: Clone> Stack<T> { impl
50 /// Creates a new `Stack`.
52 Stack { in new()
59 /// Returns `true` if the stack is currently empty.
65 /// Returns the top-most `&T` in the `Stack`.
[all …]
/external/apache-commons-bcel/src/main/java/org/apache/bcel/verifier/structurals/
DExecutionVisitor.java43 * visitIADD(IADD o), then there are two stack slots popped and one
44 * stack slot containing a Type.INT is pushed (where you could also
46 * stack). Monitor-specific behaviour is not simulated.</p>
50 * <p>Type.VOID will never be pushed onto the stack. Type.DOUBLE and Type.LONG
51 * that would normally take up two stack slots (like Double_HIGH and
53 * object on the stack here.</p>
84 private OperandStack stack() { in stack() method in ExecutionVisitor
126 stack().pop(); // pop the index int in visitAALOAD()
127 //System.out.print(stack().peek()); in visitAALOAD()
128 final Type t = stack().pop(); // Pop Array type in visitAALOAD()
[all …]
DInstConstraintVisitor.java68 * @see #stack()
91 private OperandStack stack() { in stack() method in 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. in _visitStackAccessor()
208 if (consume > stack().slotsUsed()) { in _visitStackAccessor()
210 …"Cannot consume "+consume+" stack slots: only "+stack().slotsUsed()+" slot(s) left on stack!\nStac… in _visitStackAccessor()
213 …final int produce = o.produceStack(cpg) - o.consumeStack(cpg); // Stack values are always consumed… in _visitStackAccessor()
214 if ( produce + stack().slotsUsed() > stack().maxStack() ) { in _visitStackAccessor()
215 …constraintViolated(o, "Cannot produce "+produce+" stack slots: only "+(stack().maxStack()-stack().… in _visitStackAccessor()
[all …]
/external/pytorch/aten/src/ATen/core/
Dstack.h15 using Stack = std::vector<IValue>; variable
23 std::enable_if_t<accepts<F, Stack*>::value, int> = 0>
24 C10_DEPRECATED_MESSAGE("Please use void(Stack&) to register operator instead.")
26 Operation(F&& raw): op_([raw = std::forward<F>(raw)](Stack& stack) { in Operation()
27 raw(&stack); in Operation()
31 std::enable_if_t<accepts<F, Stack&>::value &&
41 void operator()(Stack& stack) { in operator()
42 op_(stack); in operator()
51 std::function<void(Stack&)> op_;
55 // the stack and pushes its M inputs onto the stack
[all …]
/external/pytorch/torch/csrc/jit/runtime/
Dregister_prim_ops.cpp153 void sort_op(Stack& stack) { in sort_op() argument
154 bool reverse = has_reverse_arg ? pop(stack).toBool() : false; in sort_op()
155 auto g_list = pop(stack).toList(); in sort_op()
177 push(stack, g_list); in sort_op()
191 [](Stack& stack) { in __anonb356bc0f0202()
193 ss << pop(stack); in __anonb356bc0f0202()
194 push(stack, ss.str()); in __anonb356bc0f0202()
199 [](Stack& stack) { in __anonb356bc0f0302()
200 auto str = pop(stack).toStringRef(); in __anonb356bc0f0302()
206 push(stack, std::move(chars)); in __anonb356bc0f0302()
[all …]
Dregister_ops_utils.h143 void listAppend(Stack& stack);
145 void listReverse(Stack& stack);
148 void minList(Stack& stack) { in minList() argument
149 c10::List<T> a = pop(stack).to<c10::List<T>>(); in minList()
150 c10::List<T> b = pop(stack).to<c10::List<T>>(); in minList()
158 push(stack, a[i] < b[i] ? a : b); in minList()
162 push(stack, b.size() < a.size() ? b : a); in minList()
166 void maxList(Stack& stack) { in maxList() argument
167 c10::List<T> a = pop(stack).to<c10::List<T>>(); in maxList()
168 c10::List<T> b = pop(stack).to<c10::List<T>>(); in maxList()
[all …]
/external/google-breakpad/src/processor/testdata/symbols/microdump/breakpad_unittests/D6D1FEC9A15DE7F38A236898871A2E770/
Dbreakpad_unittests.sym58084 STACK CFI INIT 2351c 4 .cfa: sp 0 + .ra: x30
58085 STACK CFI INIT 23520 4 .cfa: sp 0 + .ra: x30
58086 STACK CFI INIT 23524 8 .cfa: sp 0 + .ra: x30
58087 STACK CFI INIT 2352c 8 .cfa: sp 0 + .ra: x30
58088 STACK CFI INIT 23534 8 .cfa: sp 0 + .ra: x30
58089 STACK CFI INIT 2353c 8 .cfa: sp 0 + .ra: x30
58090 STACK CFI INIT 23544 8 .cfa: sp 0 + .ra: x30
58091 STACK CFI INIT 2354c 8 .cfa: sp 0 + .ra: x30
58092 STACK CFI INIT 23554 4 .cfa: sp 0 + .ra: x30
58093 STACK CFI INIT 23558 8 .cfa: sp 0 + .ra: x30
[all …]
/external/skia/tests/
DClipStackTest.cpp31 // Build up a clip stack with a path, an empty clip, and a rect. in test_assign_and_comparison()
122 static void assert_count(skiatest::Reporter* reporter, const SkClipStack& stack, in assert_count() argument
124 SkClipStack::B2TIter iter(stack); in assert_count()
135 SkClipStack stack; in test_iterators() local
146 stack.clipRect(gRects[i], SkMatrix::I(), SkClipOp::kDifference, false); in test_iterators()
149 assert_count(reporter, stack, 4); in test_iterators()
155 SkClipStack::B2TIter iter(stack); in test_iterators()
171 SkClipStack::Iter iter(stack, SkClipStack::Iter::kTop_IterStart); in test_iterators()
187 SkClipStack::Iter iter(stack, SkClipStack::Iter::kBottom_IterStart); in test_iterators()
237 SkClipStack stack; in test_bounds() local
[all …]
/external/selinux/libsepol/cil/src/
Dcil_stack.c40 void cil_stack_init(struct cil_stack **stack) in cil_stack_init() argument
43 new_stack->stack = cil_malloc(sizeof(*(new_stack->stack)) * CIL_STACK_INIT_SIZE); in cil_stack_init()
46 *stack = new_stack; in cil_stack_init()
49 void cil_stack_destroy(struct cil_stack **stack) in cil_stack_destroy() argument
51 if (stack == NULL || *stack == NULL) { in cil_stack_destroy()
55 free((*stack)->stack); in cil_stack_destroy()
56 free(*stack); in cil_stack_destroy()
57 *stack = NULL; in cil_stack_destroy()
60 void cil_stack_empty(struct cil_stack *stack) in cil_stack_empty() argument
62 stack->pos = -1; in cil_stack_empty()
[all …]
/external/freetype/src/psaux/
Dpsstack.c5 * Adobe's code for emulating a CFF stack (body).
58 CF2_Stack stack = NULL; in cf2_stack_init() local
61 if ( FT_QNEW( stack ) ) in cf2_stack_init()
64 stack->memory = memory; in cf2_stack_init()
65 stack->error = e; in cf2_stack_init()
67 /* allocate the stack buffer */ in cf2_stack_init()
68 if ( FT_QNEW_ARRAY( stack->buffer, stackSize ) ) in cf2_stack_init()
70 FT_FREE( stack ); in cf2_stack_init()
74 stack->stackSize = stackSize; in cf2_stack_init()
75 stack->top = stack->buffer; /* empty stack */ in cf2_stack_init()
[all …]
/external/libcxx/include/
Dstack2 //===---------------------------- stack -----------------------------------===//
15 stack synopsis
21 class stack
34 stack() = default;
35 ~stack() = default;
37 stack(const stack& q) = default;
38 stack(stack&& q) = default;
40 stack& operator=(const stack& q) = default;
41 stack& operator=(stack&& q) = default;
43 explicit stack(const container_type& c);
[all …]
/external/apache-commons-bcel/src/main/java/org/apache/bcel/classfile/
DDescendingVisitor.java20 import java.util.Stack;
35 private final Stack<Object> stack = new Stack<>(); field in DescendingVisitor
52 final int size = stack.size(); in predecessor()
57 return stack.elementAt(size - (level + 2)); // size - 1 == current in predecessor()
65 return stack.peek(); in current()
91 stack.push(_clazz); in visitJavaClass()
106 stack.pop(); in visitJavaClass()
115 stack.push(annotation); in visitAnnotation()
121 stack.pop(); in visitAnnotation()
130 stack.push(annotationEntry); in visitAnnotationEntry()
[all …]
/external/easymock/src/org/easymock/internal/
DLastControl.java21 import java.util.Stack;
31 …private static final ThreadLocal<Stack<Invocation>> threadToCurrentInvocation = new ThreadLocal<St…
33 …private static final ThreadLocal<Stack<IArgumentMatcher>> threadToArgumentMatcherStack = new Threa…
48 Stack<IArgumentMatcher> stack = threadToArgumentMatcherStack.get(); in reportMatcher() local
49 if (stack == null) { in reportMatcher()
50 stack = new Stack<IArgumentMatcher>(); in reportMatcher()
51 threadToArgumentMatcherStack.set(stack); in reportMatcher()
53 stack.push(matcher); in reportMatcher()
57 Stack<IArgumentMatcher> stack = threadToArgumentMatcherStack.get(); in pullMatchers() local
58 if (stack == null) { in pullMatchers()
[all …]
/external/cronet/tot/third_party/libc++/src/include/
Dstack14 stack synopsis
20 class stack
33 stack() = default;
34 ~stack() = default;
36 stack(const stack& q) = default;
37 stack(stack&& q) = default;
39 stack& operator=(const stack& q) = default;
40 stack& operator=(stack&& q) = default;
42 explicit stack(const container_type& c);
43 explicit stack(container_type&& c);
[all …]
/external/cronet/stable/third_party/libc++/src/include/__cxx03/
Dstack14 stack synopsis
20 class stack
33 stack() = default;
34 ~stack() = default;
36 stack(const stack& q) = default;
37 stack(stack&& q) = default;
39 stack& operator=(const stack& q) = default;
40 stack& operator=(stack&& q) = default;
42 explicit stack(const container_type& c);
43 explicit stack(container_type&& c);
[all …]
/external/cronet/stable/third_party/libc++/src/include/
Dstack14 stack synopsis
20 class stack
33 stack() = default;
34 ~stack() = default;
36 stack(const stack& q) = default;
37 stack(stack&& q) = default;
39 stack& operator=(const stack& q) = default;
40 stack& operator=(stack&& q) = default;
42 explicit stack(const container_type& c);
43 explicit stack(container_type&& c);
[all …]
/external/cronet/tot/third_party/libc++/src/include/__cxx03/
Dstack14 stack synopsis
20 class stack
33 stack() = default;
34 ~stack() = default;
36 stack(const stack& q) = default;
37 stack(stack&& q) = default;
39 stack& operator=(const stack& q) = default;
40 stack& operator=(stack&& q) = default;
42 explicit stack(const container_type& c);
43 explicit stack(container_type&& c);
[all …]

12345678910>>...496