| /external/apache-commons-bcel/src/main/java/org/apache/bcel/verifier/structurals/ |
| D | ExecutionVisitor.java | 84 private OperandStack stack() { in stack() method in ExecutionVisitor
126 stack().pop(); // pop the index int in visitAALOAD()
128 final Type t = stack().pop(); // Pop Array type in visitAALOAD()
130 stack().push(Type.NULL); in visitAALOAD()
134 stack().push(at.getElementType()); in visitAALOAD()
140 stack().pop(); in visitAASTORE()
141 stack().pop(); in visitAASTORE()
142 stack().pop(); in visitAASTORE()
147 stack().push(Type.NULL); in visitACONST_NULL()
152 stack().push(locals().get(o.getIndex())); in visitALOAD()
[all …]
|
| D | InstConstraintVisitor.java | 91 private OperandStack stack() { in stack() method in InstConstraintVisitor
208 if (consume > stack().slotsUsed()) { in _visitStackAccessor()
210 …annot consume "+consume+" stack slots: only "+stack().slotsUsed()+" slot(s) left on stack!\nStack:… in _visitStackAccessor()
214 if ( produce + stack().slotsUsed() > stack().maxStack() ) { in _visitStackAccessor()
215 …intViolated(o, "Cannot produce "+produce+" stack slots: only "+(stack().maxStack()-stack().slotsUs… in _visitStackAccessor()
216 " free stack slot(s) left.\nStack:\n"+stack()); in _visitStackAccessor()
373 if ((stack().maxStack() - stack().slotsUsed()) < o.getType(cpg).getSize()) { in visitLoadInstruction()
385 …if (stack().isEmpty()) { // Don't bother about 1 or 2 stack slots used. This check is implicitly d… in visitStoreInstruction()
390 … if (! (stack().peek() == o.getType(cpg)) ) {// the other xSTORE types are singletons in BCEL. in visitStoreInstruction()
391 …ntViolated(o, "Stack top type and STOREing Instruction type mismatch: Stack top: '"+stack().peek()+ in visitStoreInstruction()
[all …]
|
| /external/libchrome/base/task_scheduler/ |
| D | scheduler_worker_stack_unittest.cc | 76 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/selinux/libsepol/cil/src/ |
| D | cil_stack.c | 40 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/ |
| D | psstack.c | 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()
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()
77 return stack; in cf2_stack_init()
82 cf2_stack_free( CF2_Stack stack ) in cf2_stack_free() argument
[all …]
|
| /external/rust/android-crates-io/crates/pest/src/ |
| D | stack.rs | 151 let mut stack = Stack::new(); in snapshot_with_empty() localVariable
153 stack.snapshot(); in snapshot_with_empty()
155 assert!(stack.is_empty()); in snapshot_with_empty()
157 stack.push(0); in snapshot_with_empty()
158 stack.restore(); in snapshot_with_empty()
159 assert!(stack.is_empty()); in snapshot_with_empty()
164 let mut stack = Stack::new(); in snapshot_twice() localVariable
166 stack.push(0); in snapshot_twice()
168 stack.snapshot(); in snapshot_twice()
169 stack.snapshot(); in snapshot_twice()
[all …]
|
| /external/pytorch/torch/csrc/jit/mobile/ |
| D | promoted_prim_ops.cpp | 7 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 …]
|
| D | promoted_prim_ops.h | 7 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 …]
|
| /external/skia/tests/ |
| D | ClipStackTest.cpp | 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
246 stack.save(); in test_bounds()
[all …]
|
| /external/pytorch/torch/csrc/jit/runtime/ |
| D | register_prim_ops.cpp | 153 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 …]
|
| D | register_ops_utils.h | 143 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 …]
|
| D | vararg_functions.cpp | 103 void tupleUnpack(Stack& stack) { in tupleUnpack() argument
104 auto tuple = pop(stack).toTuple(); in tupleUnpack()
105 stack.insert(stack.end(), tuple->elements().begin(), tuple->elements().end()); in tupleUnpack()
108 void format(Stack& stack, size_t num_inputs) { in format() argument
110 num_inputs > 0 && num_inputs <= stack.size(), in format()
115 auto format = peek(stack, 0, num_inputs).toStringRef(); in format()
123 auto args = last(stack, num_inputs - 1); in format()
139 drop(stack, num_inputs); in format()
140 push(stack, ss.str()); in format()
143 void einsum(Stack& stack, size_t num_inputs) { in einsum() argument
[all …]
|
| D | register_ops_utils.cpp | 24 void listIndex<at::Tensor>(Stack& stack) { in listIndex() argument
25 at::Tensor elem = pop(stack).to<at::Tensor>(); in listIndex()
26 c10::List<at::Tensor> list = pop(stack).to<c10::List<at::Tensor>>(); in listIndex()
35 push(stack, static_cast<int64_t>(std::distance(list.begin(), pos))); in listIndex()
42 void listCount<at::Tensor>(Stack& stack) { in listCount() argument
43 at::Tensor elem = pop(stack).to<at::Tensor>(); in listCount()
44 c10::List<at::Tensor> list = pop(stack).to<c10::List<at::Tensor>>(); in listCount()
51 push(stack, count); in listCount()
55 void listEq<at::Tensor>(Stack& stack) { in listEq() argument
56 c10::List<at::Tensor> b = pop(stack).to<c10::List<at::Tensor>>(); in listEq()
[all …]
|
| /external/apache-commons-bcel/src/main/java/org/apache/bcel/classfile/ |
| D | DescendingVisitor.java | 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()
132 stack.pop(); in visitAnnotationEntry()
[all …]
|
| /external/pigweed/pw_thread/ |
| D | snapshot.cc | 32 Status SnapshotStack(const StackContext& stack, in SnapshotStack() argument
36 encoder.WriteStackStartPointer(stack.stack_high_addr).IgnoreError(); in SnapshotStack()
37 encoder.WriteStackEndPointer(stack.stack_low_addr).IgnoreError(); in SnapshotStack()
38 encoder.WriteStackPointer(stack.stack_pointer).IgnoreError(); in SnapshotStack()
42 stack.stack_high_addr, in SnapshotStack()
43 stack.stack_pointer, in SnapshotStack()
44 static_cast<long>(stack.stack_high_addr) - in SnapshotStack()
45 static_cast<long>(stack.stack_pointer)); in SnapshotStack()
46 if (stack.stack_pointer_est_peak.has_value()) { in SnapshotStack()
48 stack.stack_pointer_est_peak.value(); in SnapshotStack()
[all …]
|
| /external/pytorch/aten/src/ATen/core/ |
| D | stack.h | 26 Operation(F&& raw): op_([raw = std::forward<F>(raw)](Stack& stack) { in Operation()
27 raw(&stack); in Operation()
41 void operator()(Stack& stack) { in operator()
42 op_(stack); in operator()
69 inline IValue& peek(Stack& stack, size_t i, size_t N) { in peek() argument
71 return *(stack.end() - N + i); in peek()
73 inline IValue& peek(Stack* stack, size_t i, size_t N) { in peek() argument
74 return peek(*stack, i, N); in peek()
76 inline const IValue& peek(const Stack& stack, size_t i, size_t N) { in peek() argument
78 return *(stack.end() - N + i); in peek()
[all …]
|
| /external/pcre/src/sljit/ |
| D | sljitUtils.c | 177 struct sljit_stack *stack; in sljit_allocate_stack() local
185 stack = (struct sljit_stack*)SLJIT_MALLOC(sizeof(struct sljit_stack), allocator_data); in sljit_allocate_stack()
186 if (stack == NULL) in sljit_allocate_stack()
191 SLJIT_FREE(stack, allocator_data); in sljit_allocate_stack()
195 stack->min_start = (sljit_u8 *)ptr; in sljit_allocate_stack()
196 stack->end = stack->min_start + max_size; in sljit_allocate_stack()
197 stack->start = stack->end - start_size; in sljit_allocate_stack()
198 stack->top = stack->end; in sljit_allocate_stack()
199 return stack; in sljit_allocate_stack()
202 SLJIT_API_FUNC_ATTRIBUTE void SLJIT_FUNC sljit_free_stack(struct sljit_stack *stack, void *allocato… in sljit_free_stack() argument
[all …]
|
| /external/executorch/kernels/prim_ops/ |
| D | register_prim_ops.cpp | 31 #define __NUMBER_ET_PRIM_OP_IMPL(operator, stack, context) \ argument
33 EValue& a = *stack[0]; \
34 EValue& b = *stack[1]; \
35 EValue& out = *stack[2]; \
46 #define ALGEBRA_ET_PRIM_OP(operator, stack, context) \ argument
47 __NUMBER_ET_PRIM_OP_IMPL(operator, stack, context) \
50 #define BOOLEAN_ET_PRIM_OP(operator, stack, context) \ argument
51 __NUMBER_ET_PRIM_OP_IMPL(operator, stack, context) \
75 [](KernelRuntimeContext& context, EValue** stack) { in __anone4f01e490202()
77 EValue& self = *stack[0]; in __anone4f01e490202()
[all …]
|
| /external/easymock/src/org/easymock/internal/ |
| D | LastControl.java | 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()
62 return new ArrayList<IArgumentMatcher>(stack); in pullMatchers()
66 Stack<IArgumentMatcher> stack = threadToArgumentMatcherStack.get(); in reportAnd() local
67 assertState(stack != null, "no matchers found."); in reportAnd()
[all …]
|
| /external/libcxx/include/ |
| D | stack | 2 //===---------------------------- 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/mesa3d/src/mesa/main/ |
| D | matrix.c | 103 static void matrix_frustum(struct gl_matrix_stack* stack, in matrix_frustum() argument
121 _math_matrix_frustum(stack->Top, in matrix_frustum()
125 stack->ChangedSincePush = true; in matrix_frustum()
126 ctx->NewState |= stack->DirtyFlag; in matrix_frustum()
167 struct gl_matrix_stack *stack = get_named_matrix_stack(ctx, matrixMode, in _mesa_MatrixFrustumEXT() local
169 if (!stack) in _mesa_MatrixFrustumEXT()
172 matrix_frustum(stack, in _mesa_MatrixFrustumEXT()
181 matrix_ortho(struct gl_matrix_stack* stack, in matrix_ortho() argument
203 _math_matrix_ortho( stack->Top, in matrix_ortho()
207 stack->ChangedSincePush = true; in matrix_ortho()
[all …]
|
| /external/cronet/tot/third_party/libc++/src/include/ |
| D | stack | 14 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/ |
| D | stack | 14 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/ |
| D | stack | 14 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/ |
| D | stack | 14 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 …]
|