Home
last modified time | relevance | path

Searched refs:stack (Results 1 – 25 of 4593) sorted by relevance

12345678910>>...184

/external/apache-commons-bcel/src/main/java/org/apache/bcel/verifier/structurals/
DExecutionVisitor.java84 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 …]
DInstConstraintVisitor.java91 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 …]
DOperandStack.java39 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/
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/proguard/src/proguard/evaluation/
DProcessor.java39 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/
Dpsstack.c58 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/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/skia/tests/
DClipStackTest.cpp122 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/apache-commons-bcel/src/main/java/org/apache/bcel/classfile/
DDescendingVisitor.java35 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/rust/crates/pest/src/
Dstack.rs125 let mut stack = Stack::new(); in snapshot_with_empty() localVariable
127 stack.snapshot(); in snapshot_with_empty()
129 assert!(stack.is_empty()); in snapshot_with_empty()
131 stack.push(0); in snapshot_with_empty()
132 stack.restore(); in snapshot_with_empty()
133 assert!(stack.is_empty()); in snapshot_with_empty()
138 let mut stack = Stack::new(); in snapshot_twice() localVariable
140 stack.push(0); in snapshot_twice()
142 stack.snapshot(); in snapshot_twice()
143 stack.snapshot(); in snapshot_twice()
[all …]
/external/pcre/src/sljit/
DsljitUtils.c177 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/pigweed/pw_thread/
Dsnapshot.cc32 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/easymock/src/org/easymock/internal/
DLastControl.java48 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/
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/cronet/buildtools/third_party/libc++/trunk/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/rust/crates/anyhow/src/
Densure.rs112 (0 $stack:tt ($($bail:tt)*) $fuel:tt $parse:tt $dup:tt return $($rest:tt)*) => {
116 (0 $stack:tt ($($bail:tt)*) $fuel:tt $parse:tt $dup:tt break $($rest:tt)*) => {
120 (0 $stack:tt ($($bail:tt)*) $fuel:tt $parse:tt $dup:tt continue $($rest:tt)*) => {
124 (0 $stack:tt ($($bail:tt)*) $fuel:tt $parse:tt $dup:tt yield $($rest:tt)*) => {
128 (0 $stack:tt ($($bail:tt)*) $fuel:tt $parse:tt $dup:tt move $($rest:tt)*) => {
134 …(0 $stack:tt $bail:tt (~$($fuel:tt)*) {($($buf:tt)*) $($parse:tt)*} ($deref:tt $($dup:tt)*) * $($r…
135 …$crate::__parse_ensure!(0 $stack $bail ($($fuel)*) {($($buf)* $deref) $($parse)*} ($($rest)*) $($r…
138 …(0 $stack:tt $bail:tt (~$($fuel:tt)*) {($($buf:tt)*) $($parse:tt)*} ($not:tt $($dup:tt)*) ! $($res…
139 …$crate::__parse_ensure!(0 $stack $bail ($($fuel)*) {($($buf)* $not) $($parse)*} ($($rest)*) $($res…
142 …(0 $stack:tt $bail:tt (~$($fuel:tt)*) {($($buf:tt)*) $($parse:tt)*} ($neg:tt $($dup:tt)*) - $($res…
[all …]
/external/mesa3d/src/mesa/main/
Dmatrix.c102 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/starlark-go/starlark/
Dinterp.go29 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/musl/src/misc/
Drealpath.c16 char stack[PATH_MAX+1]; in realpath() local
25 l = strnlen(filename, sizeof stack); in realpath()
31 p = sizeof stack - l - 1; in realpath()
33 memcpy(stack+p, filename, l+1); in realpath()
40 for (; ; p+=slash_len(stack+p)) { in realpath()
43 if (stack[p] == '/') { in realpath()
50 if (stack[p] == '/' && stack[p+1] != '/') in realpath()
55 char *z = __strchrnul(stack+p, '/'); in realpath()
56 l0 = l = z-(stack+p); in realpath()
61 if (l==1 && stack[p]=='.') { in realpath()
[all …]
/external/cronet/buildtools/third_party/libc++/trunk/test/std/containers/container.adaptors/stack/stack.cons/
Ddeduct.pass.cpp42 std::stack stk(v); in main()
44 static_assert(std::is_same_v<decltype(stk), std::stack<int, std::vector<int>>>, ""); in main()
51 std::stack stk(l, test_allocator<long>(0,2)); // different allocator in main()
68 std::stack<A> source; in main()
69 std::stack stk(source); // stack(stack &) in main()
85 std::stack stk(cont, Alloc(2)); in main()
86 static_assert(std::is_same_v<decltype(stk), std::stack<T, Cont>>); in main()
91 std::stack stk(cont, ConvertibleToAlloc(2)); in main()
92 static_assert(std::is_same_v<decltype(stk), std::stack<T, Cont>>); in main()
97 std::stack stk(std::move(cont), Alloc(2)); in main()
[all …]
/external/javassist/src/main/javassist/bytecode/
DCodeAnalyzer.java41 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/ruy/ruy/profiler/
Dinstrumentation.cc107 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/flatbuffers/ts/flexbuffers/
Dbuilder.ts18 readonly stack: Array<StackValue> = []; property in Builder
104 this.stack.push(this.offsetStackValue(blobOffset, ValueType.BLOB, bitWidth));
110 this.stack.push(this.stringLookup[str]);
122 this.stack.push(stackValue);
131 this.stack.push(this.keyLookup[str]);
139 this.stack.push(stackValue);
166 if (this.stack[this.stack.length - 1].type !== ValueType.KEY) {
182 this.stackPointers.push({ stackPosition: this.stack.length, isVector: true });
186 …this.stackPointers.push({ stackPosition: this.stack.length, isVector: false, presorted: presorted …
190 const vecLength = this.stack.length - stackPointer.stackPosition;
[all …]
/external/mesa3d/src/gallium/drivers/r600/sfn/
Dsfn_callstack.cpp45 ++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/libffi/src/pa/
Dffi.c142 void ffi_prep_args_pa32(UINT32 *stack, extended_cif *ecif, unsigned bytes) in ffi_prep_args_pa32() argument
151 debug(1, "%s: stack = %p, ecif = %p, bytes = %u\n", __FUNCTION__, stack, in ffi_prep_args_pa32()
164 *(SINT32 *)(stack - slot) = *(SINT8 *)(*p_argv); in ffi_prep_args_pa32()
168 *(UINT32 *)(stack - slot) = *(UINT8 *)(*p_argv); in ffi_prep_args_pa32()
172 *(SINT32 *)(stack - slot) = *(SINT16 *)(*p_argv); in ffi_prep_args_pa32()
176 *(UINT32 *)(stack - slot) = *(UINT16 *)(*p_argv); in ffi_prep_args_pa32()
184 *(UINT32 *)(stack - slot) = *(UINT32 *)(*p_argv); in ffi_prep_args_pa32()
191 *(UINT64 *)(stack - slot) = *(UINT64 *)(*p_argv); in ffi_prep_args_pa32()
197 *(UINT32 *)(stack - slot) = *(UINT32 *)(*p_argv); in ffi_prep_args_pa32()
201 case 0: fldw(stack - slot, fr4); break; in ffi_prep_args_pa32()
[all …]

12345678910>>...184