| /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 …]
|
| D | OperandStack.java | 39 private ArrayList<Type> stack = new ArrayList<>(); field in OperandStack
68 final ArrayList<Type> clone = (ArrayList<Type>) this.stack.clone(); in clone()
69 newstack.stack = clone; in clone()
77 stack = new ArrayList<>(); in clear()
83 public int hashCode() { return stack.hashCode(); } in hashCode()
96 return this.stack.equals(s.stack); in equals()
112 return stack.isEmpty(); in isEmpty()
134 return stack.get(size()-i-1); in peek()
141 final Type e = stack.remove(size()-1); in pop()
169 stack.add(type); in push()
[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/proguard/src/proguard/evaluation/ |
| D | Processor.java | 39 private final Stack stack; field in Processor
59 Stack stack, in Processor() argument
66 this.stack = stack; in Processor()
87 stack.push(valueFactory.createReferenceValueNull()); in visitSimpleInstruction()
99 stack.push(valueFactory.createIntegerValue(simpleInstruction.constant)); in visitSimpleInstruction()
104 stack.push(valueFactory.createLongValue(simpleInstruction.constant)); in visitSimpleInstruction()
110 stack.push(valueFactory.createFloatValue((float)simpleInstruction.constant)); in visitSimpleInstruction()
115 stack.push(valueFactory.createDoubleValue((double)simpleInstruction.constant)); in visitSimpleInstruction()
123 IntegerValue arrayIndex = stack.ipop(); in visitSimpleInstruction()
124 ReferenceValue arrayReference = stack.apop(); in visitSimpleInstruction()
[all …]
|
| /external/freetype/src/psaux/ |
| D | psstack.c | 59 CF2_Stack stack = NULL; in cf2_stack_init() local
62 if ( FT_NEW( stack ) ) in cf2_stack_init()
66 stack->memory = memory; in cf2_stack_init()
67 stack->error = e; in cf2_stack_init()
70 if ( FT_NEW_ARRAY( stack->buffer, stackSize ) ) in cf2_stack_init()
72 FT_FREE( stack ); in cf2_stack_init()
76 stack->stackSize = stackSize; in cf2_stack_init()
77 stack->top = stack->buffer; /* empty stack */ in cf2_stack_init()
79 return stack; in cf2_stack_init()
84 cf2_stack_free( CF2_Stack stack ) in cf2_stack_free() argument
[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/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/pcre/dist2/src/sljit/ |
| D | sljitUtils.c | 170 struct sljit_stack *stack; in sljit_allocate_stack() local
178 stack = (struct sljit_stack*)SLJIT_MALLOC(sizeof(struct sljit_stack), allocator_data); in sljit_allocate_stack()
179 if (stack == NULL) in sljit_allocate_stack()
184 SLJIT_FREE(stack, allocator_data); in sljit_allocate_stack()
188 stack->min_start = (sljit_u8 *)ptr; in sljit_allocate_stack()
189 stack->end = stack->min_start + max_size; in sljit_allocate_stack()
190 stack->start = stack->end - start_size; in sljit_allocate_stack()
191 stack->top = stack->end; in sljit_allocate_stack()
192 return stack; in sljit_allocate_stack()
195 SLJIT_API_FUNC_ATTRIBUTE void SLJIT_FUNC sljit_free_stack(struct sljit_stack *stack, void *allocato… in sljit_free_stack() argument
[all …]
|
| /external/skia/tests/ |
| D | ClipStackTest.cpp | 148 static void assert_count(skiatest::Reporter* reporter, const SkClipStack& stack, in assert_count() argument
150 SkClipStack::B2TIter iter(stack); in assert_count()
161 SkClipStack stack; in test_iterators() local
172 stack.clipRect(gRects[i], SkMatrix::I(), kUnion_SkClipOp, false); in test_iterators()
175 assert_count(reporter, stack, 4); in test_iterators()
181 SkClipStack::B2TIter iter(stack); in test_iterators()
197 SkClipStack::Iter iter(stack, SkClipStack::Iter::kTop_IterStart); in test_iterators()
213 SkClipStack::Iter iter(stack, SkClipStack::Iter::kBottom_IterStart); in test_iterators()
278 SkClipStack stack; in test_bounds() local
287 stack.save(); in test_bounds()
[all …]
|
| /external/skqp/tests/ |
| D | ClipStackTest.cpp | 146 static void assert_count(skiatest::Reporter* reporter, const SkClipStack& stack, in assert_count() argument
148 SkClipStack::B2TIter iter(stack); in assert_count()
159 SkClipStack stack; in test_iterators() local
170 stack.clipRect(gRects[i], SkMatrix::I(), kUnion_SkClipOp, false); in test_iterators()
173 assert_count(reporter, stack, 4); in test_iterators()
179 SkClipStack::B2TIter iter(stack); in test_iterators()
195 SkClipStack::Iter iter(stack, SkClipStack::Iter::kTop_IterStart); in test_iterators()
211 SkClipStack::Iter iter(stack, SkClipStack::Iter::kBottom_IterStart); in test_iterators()
276 SkClipStack stack; in test_bounds() local
285 stack.save(); in test_bounds()
[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/llvm-project/libcxx/include/ |
| D | stack | 2 //===---------------------------- 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);
[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 | 102 static void matrix_frustum(struct gl_matrix_stack* stack, in matrix_frustum() argument
120 _math_matrix_frustum(stack->Top, in matrix_frustum()
124 ctx->NewState |= stack->DirtyFlag; in matrix_frustum()
165 struct gl_matrix_stack *stack = get_named_matrix_stack(ctx, matrixMode, in _mesa_MatrixFrustumEXT() local
167 if (!stack) in _mesa_MatrixFrustumEXT()
170 matrix_frustum(stack, in _mesa_MatrixFrustumEXT()
179 matrix_ortho(struct gl_matrix_stack* stack, in matrix_ortho() argument
201 _math_matrix_ortho( stack->Top, in matrix_ortho()
205 ctx->NewState |= stack->DirtyFlag; in matrix_ortho()
246 struct gl_matrix_stack *stack = get_named_matrix_stack(ctx, matrixMode, in _mesa_MatrixOrthoEXT() local
[all …]
|
| /external/llvm-project/llvm/test/CodeGen/X86/ |
| D | pr30821.mir | 1 # RUN: llc -x mir < %s -run-pass=greedy,virtregrewriter,stack-slot-coloring | FileCheck %s
47 stack:
49 stack-id: default, callee-saved-register: '', callee-saved-restored: true,
52 stack-id: default, callee-saved-register: '', callee-saved-restored: true,
55 stack-id: default, callee-saved-register: '', callee-saved-restored: true,
61 ; To trick stack-slot-colouring to run its dead-store-elimination phase,
68 ; virtreg gets spilt; the corresponding stack slots merged; and faulty code
72 …$xmm0 = MOVUPDrm %stack.2.india, 1, $noreg, 0, $noreg :: (volatile dereferenceable load 16 from %i…
73 …$xmm1 = MOVUPDrm %stack.2.india, 1, $noreg, 0, $noreg :: (volatile dereferenceable load 16 from %i…
74 …$xmm2 = MOVUPDrm %stack.2.india, 1, $noreg, 0, $noreg :: (volatile dereferenceable load 16 from %i…
[all …]
|
| /external/starlark-go/starlark/ |
| D | interp.go | 29 for _, fr := range thread.stack[:len(thread.stack)-1] {
56 stack := space[nlocals:] // operand stack
68 fmt.Printf("%d stack, %d locals\n", len(stack), len(locals))
117 fmt.Fprintln(os.Stderr, stack[:sp]) // very verbose!
126 stack[sp] = stack[sp-1]
130 stack[sp] = stack[sp-2]
131 stack[sp+1] = stack[sp-1]
138 stack[sp-2], stack[sp-1] = stack[sp-1], stack[sp-2]
142 y := stack[sp-1]
143 x := stack[sp-2]
[all …]
|
| /external/llvm-project/lldb/source/Expression/ |
| D | DWARFExpression.cpp | 639 static bool Evaluate_DW_OP_entry_value(std::vector<Value> &stack, in Evaluate_DW_OP_entry_value() argument
845 stack.push_back(result); in Evaluate_DW_OP_entry_value()
920 std::vector<Value> stack; in Evaluate() local
933 stack.push_back(*initial_value_ptr); in Evaluate()
960 size_t count = stack.size(); in Evaluate()
966 stack[i].Dump(&new_value); in Evaluate()
977 stack.push_back(Scalar(opcodes.GetAddress(&offset))); in Evaluate()
978 stack.back().SetValueType(Value::eValueTypeFileAddress); in Evaluate()
982 stack.back().ConvertToLoadAddress(module_sp.get(), in Evaluate()
1030 if (stack.empty()) { in Evaluate()
[all …]
|
| /external/javassist/src/main/javassist/bytecode/ |
| D | CodeAnalyzer.java | 41 int[] stack = new int[length]; in computeMaxStack() local
43 initStack(stack, codeAttr); in computeMaxStack()
48 if (stack[i] < 0) { in computeMaxStack()
50 visitBytecode(ci, stack, i); in computeMaxStack()
56 if (stack[i] > maxStack) in computeMaxStack()
57 maxStack = stack[i]; in computeMaxStack()
62 private void initStack(int[] stack, CodeAttribute ca) { in initStack() argument
63 stack[0] = -1; in initStack()
68 stack[et.handlerPc(i)] = -2; // an exception is on stack in initStack()
72 private void visitBytecode(CodeIterator ci, int[] stack, int index) in visitBytecode() argument
[all …]
|
| /external/llvm-project/compiler-rt/lib/sanitizer_common/ |
| D | sanitizer_allocator_report.cpp | 26 stack(stack_) { in ScopedAllocatorErrorReport()
31 stack->Print(); in ~ScopedAllocatorErrorReport()
33 ReportErrorSummary(error_summary, stack); in ~ScopedAllocatorErrorReport()
39 const StackTrace* const stack; member in __sanitizer::ScopedAllocatorErrorReport
44 const StackTrace *stack) { in ReportCallocOverflow() argument
46 ScopedAllocatorErrorReport report("calloc-overflow", stack); in ReportCallocOverflow()
55 const StackTrace *stack) { in ReportReallocArrayOverflow() argument
57 ScopedAllocatorErrorReport report("reallocarray-overflow", stack); in ReportReallocArrayOverflow()
66 void NORETURN ReportPvallocOverflow(uptr size, const StackTrace *stack) { in ReportPvallocOverflow() argument
68 ScopedAllocatorErrorReport report("pvalloc-overflow", stack); in ReportPvallocOverflow()
[all …]
|
| /external/llvm-project/llvm/test/CodeGen/AArch64/ |
| D | unwind-preserved-from-mir.mir | 56 …etup STPQi killed $q23, killed $q22, $sp, 2 :: (store 16 into %stack.19), (store 16 into %stack.18)
57 …etup STPQi killed $q21, killed $q20, $sp, 4 :: (store 16 into %stack.17), (store 16 into %stack.16)
58 …etup STPQi killed $q19, killed $q18, $sp, 6 :: (store 16 into %stack.15), (store 16 into %stack.14)
59 …etup STPQi killed $q17, killed $q16, $sp, 8 :: (store 16 into %stack.13), (store 16 into %stack.12)
60 …tup STPQi killed $q15, killed $q14, $sp, 10 :: (store 16 into %stack.11), (store 16 into %stack.10)
61 …setup STPQi killed $q13, killed $q12, $sp, 12 :: (store 16 into %stack.9), (store 16 into %stack.8)
62 …setup STPQi killed $q11, killed $q10, $sp, 14 :: (store 16 into %stack.7), (store 16 into %stack.6)
63 …e-setup STPQi killed $q9, killed $q8, $sp, 16 :: (store 16 into %stack.5), (store 16 into %stack.4)
64 …ame-setup STPXi killed $fp, killed $lr, $sp, 36 :: (store 8 into %stack.3), (store 8 into %stack.2)
84 ; CHECK: STRQui $q0, $sp, 0 :: (store 16 into %stack.1)
[all …]
|
| /external/mesa3d/src/gallium/drivers/r600/sfn/ |
| D | sfn_callstack.cpp | 45 ++m_bc.stack.push; in push()
48 ++m_bc.stack.push_wqm; in push()
51 ++m_bc.stack.loop; in push()
64 --m_bc.stack.push; in pop()
65 assert(m_bc.stack.push >= 0); in pop()
68 --m_bc.stack.push_wqm; in pop()
69 assert(m_bc.stack.push_wqm >= 0); in pop()
72 --m_bc.stack.loop; in pop()
73 assert(m_bc.stack.loop >= 0); in pop()
84 r600_stack_info& stack = m_bc.stack; in update_max_depth() local
[all …]
|
| /external/autotest/tko/ |
| D | 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/ruy/ruy/profiler/ |
| D | instrumentation.cc | 107 int GetBufferSize(const Stack& stack) { in GetBufferSize() argument
108 return sizeof(stack.id) + sizeof(stack.size) + in GetBufferSize()
109 stack.size * sizeof(stack.labels[0]); in GetBufferSize()
112 void CopyToBuffer(const Stack& stack, char* dst) { in CopyToBuffer() argument
113 memcpy(dst, &stack.id, sizeof(stack.id)); in CopyToBuffer()
114 dst += sizeof(stack.id); in CopyToBuffer()
115 memcpy(dst, &stack.size, sizeof(stack.size)); in CopyToBuffer()
116 dst += sizeof(stack.size); in CopyToBuffer()
117 memcpy(dst, stack.labels, stack.size * sizeof(stack.labels[0])); in CopyToBuffer()
120 void ReadFromBuffer(const char* src, Stack* stack) { in ReadFromBuffer() argument
[all …]
|
| /external/speex/libspeexdsp/ |
| D | stack_alloc.h | 91 #define ALIGN(stack, size) ((stack) += ((size) - (long)(stack)) & ((size) - 1)) argument
93 …stack, size, type) (VALGRIND_MAKE_NOACCESS(stack, 1000),ALIGN((stack),sizeof(type)),VALGRIND_MAKE_… argument
97 #define ALIGN(stack, size) ((stack) += ((size) - (long)(stack)) & ((size) - 1)) argument
99 #define PUSH(stack, size, type) (ALIGN((stack),sizeof(type)),(stack)+=((size)*sizeof(type)),(type*)… argument
111 #define ALLOC(var, size, type) var = PUSH(stack, size, type)
|