Home
last modified time | relevance | path

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

12345678910>>...101

/third_party/parse5/packages/parse5/test/
Dopen-element-stack.test.js17 const stack = new OpenElementStack(document, treeAdapter);
19 assert.strictEqual(stack.current, document);
20 assert.strictEqual(stack.stackTop, -1);
22 stack.push(element1);
23 assert.strictEqual(stack.current, element1);
24 assert.strictEqual(stack.currentTagName, treeAdapter.getTagName(element1));
25 assert.strictEqual(stack.stackTop, 0);
27 stack.push(element2);
28 assert.strictEqual(stack.current, element2);
29 assert.strictEqual(stack.currentTagName, treeAdapter.getTagName(element2));
[all …]
/third_party/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 …]
Dcil_stack.h34 struct cil_stack_item *stack; member
44 #define cil_stack_for_each_starting_at(stack, start, pos, item) \ argument
45 …for (pos = start, item = cil_stack_peek_at(stack, pos); item != NULL; pos++, item = cil_stack_peek…
47 #define cil_stack_for_each(stack, pos, item) cil_stack_for_each_starting_at(stack, 0, pos, item) argument
50 void cil_stack_init(struct cil_stack **stack);
51 void cil_stack_destroy(struct cil_stack **stack);
53 void cil_stack_empty(struct cil_stack *stack);
54 int cil_stack_is_empty(struct cil_stack *stack);
55 int cil_stack_number_of_items(struct cil_stack *stack);
57 void cil_stack_push(struct cil_stack *stack, enum cil_flavor flavor, void *data);
[all …]
/third_party/skia/third_party/externals/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 …]
/third_party/freetype/src/psaux/
Dpsstack.c59 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 …]
/third_party/flutter/skia/third_party/externals/freetype/src/psaux/
Dpsstack.c59 CF2_Stack stack = NULL; in cf2_stack_init() local
62 if ( !FT_NEW( stack ) ) in cf2_stack_init()
65 stack->memory = memory; in cf2_stack_init()
66 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 …]
/third_party/skia/tests/
DClipStackTest.cpp131 static void assert_count(skiatest::Reporter* reporter, const SkClipStack& stack, in assert_count() argument
133 SkClipStack::B2TIter iter(stack); in assert_count()
144 SkClipStack stack; in test_iterators() local
155 stack.clipRect(gRects[i], SkMatrix::I(), SkClipOp::kDifference, false); in test_iterators()
158 assert_count(reporter, stack, 4); in test_iterators()
164 SkClipStack::B2TIter iter(stack); in test_iterators()
180 SkClipStack::Iter iter(stack, SkClipStack::Iter::kTop_IterStart); in test_iterators()
196 SkClipStack::Iter iter(stack, SkClipStack::Iter::kBottom_IterStart); in test_iterators()
246 SkClipStack stack; in test_bounds() local
255 stack.save(); in test_bounds()
[all …]
/third_party/pcre2/pcre2/src/sljit/
DsljitUtils.c174 struct sljit_stack *stack; in sljit_allocate_stack() local
182 stack = (struct sljit_stack*)SLJIT_MALLOC(sizeof(struct sljit_stack), allocator_data); in sljit_allocate_stack()
183 if (stack == NULL) in sljit_allocate_stack()
188 SLJIT_FREE(stack, allocator_data); in sljit_allocate_stack()
192 stack->min_start = (sljit_u8 *)ptr; in sljit_allocate_stack()
193 stack->end = stack->min_start + max_size; in sljit_allocate_stack()
194 stack->start = stack->end - start_size; in sljit_allocate_stack()
195 stack->top = stack->end; in sljit_allocate_stack()
196 return stack; in sljit_allocate_stack()
199 SLJIT_API_FUNC_ATTRIBUTE void SLJIT_FUNC sljit_free_stack(struct sljit_stack *stack, void *allocato… in sljit_free_stack() argument
[all …]
/third_party/flutter/skia/tests/
DClipStackTest.cpp148 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 …]
/third_party/boost/libs/compute/test/
Dtest_stack.cpp22 bc::stack<int> stack; in BOOST_AUTO_TEST_CASE() local
23 BOOST_CHECK_EQUAL(stack.size(), size_t(0)); in BOOST_AUTO_TEST_CASE()
25 stack.push(1); in BOOST_AUTO_TEST_CASE()
26 stack.push(2); in BOOST_AUTO_TEST_CASE()
27 stack.push(3); in BOOST_AUTO_TEST_CASE()
28 BOOST_CHECK_EQUAL(stack.size(), size_t(3)); in BOOST_AUTO_TEST_CASE()
33 bc::stack<int> stack; in BOOST_AUTO_TEST_CASE() local
34 stack.push(1); in BOOST_AUTO_TEST_CASE()
35 stack.push(2); in BOOST_AUTO_TEST_CASE()
36 stack.push(3); in BOOST_AUTO_TEST_CASE()
[all …]
/third_party/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 …]
/third_party/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 …]
/third_party/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 …]
/third_party/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 …]
/third_party/flutter/engine/flutter/flow/
Dmutators_stack_unittests.cc12 MutatorsStack stack; in TEST() local
17 MutatorsStack stack; in TEST() local
20 stack.PushClipRect(rect); in TEST()
21 stack.PushClipRRect(rrect); in TEST()
22 MutatorsStack copy = MutatorsStack(stack); in TEST()
23 ASSERT_TRUE(copy == stack); in TEST()
27 MutatorsStack stack; in TEST() local
29 stack.PushClipRect(rect); in TEST()
30 auto iter = stack.Bottom(); in TEST()
36 MutatorsStack stack; in TEST() local
[all …]
/third_party/boost/boost/property_tree/json_parser/detail/
Dstandard_callbacks.hpp68 stack.back().k = array; in on_begin_array()
71 if (stack.back().k == leaf) stack.pop_back(); in on_end_array()
72 stack.pop_back(); in on_end_array()
77 stack.back().k = object; in on_begin_object()
80 if (stack.back().k == leaf) stack.pop_back(); in on_end_object()
81 stack.pop_back(); in on_end_object()
88 return stack.back().k == key; in is_key()
91 layer& l = stack.back(); in current_value()
103 std::vector<layer> stack; member in boost::property_tree::json_parser::detail::standard_callbacks
106 if (stack.empty()) { in new_tree()
[all …]
/third_party/boost/boost/fusion/iterator/detail/
Dsegmented_next_impl.hpp69 static type call(Stack const & stack) in call()
72 car_type(fusion::next(stack.car.first), stack.car.last), in call()
73 stack.cdr); in call()
102 static type call(Stack const & stack) in call()
104 return impl::call(stack.cdr); in call()
116 static type call(Stack const & stack) in call()
118 return type(range_type(stack.car.last, stack.car.last)); in call()
151 static type call(Stack const & stack) in call()
153 return impl::call(stack); in call()
163 static type call(Stack const & stack) in call()
[all …]
/third_party/jerryscript/jerry-core/parser/js/
Djs-parser-mem.c346 parser_data_init (&context_p->stack, PARSER_STACK_PAGE_SIZE); in parser_stack_init()
356 parser_data_free (&context_p->stack, in parser_stack_free()
373 parser_mem_page_t *page_p = context_p->stack.first_p; in parser_stack_push_uint8()
379 || context_p->stack_top_uint8 == page_p->bytes[context_p->stack.last_position - 1]); in parser_stack_push_uint8()
381 if (context_p->stack.last_position >= PARSER_STACK_PAGE_SIZE) in parser_stack_push_uint8()
394 page_p->next_p = context_p->stack.first_p; in parser_stack_push_uint8()
395 context_p->stack.last_position = 0; in parser_stack_push_uint8()
396 context_p->stack.first_p = page_p; in parser_stack_push_uint8()
399 page_p->bytes[context_p->stack.last_position++] = uint8_value; in parser_stack_push_uint8()
409 parser_mem_page_t *page_p = context_p->stack.first_p; in parser_stack_pop_uint8()
[all …]
/third_party/libwebsockets/lib/tls/mbedtls/wrapper/library/
Dssl_stack.c32 OPENSSL_STACK *stack; in OPENSSL_sk_new() local
35 stack = ssl_mem_zalloc(sizeof(OPENSSL_STACK)); in OPENSSL_sk_new()
36 if (!stack) { in OPENSSL_sk_new()
47 stack->data = data; in OPENSSL_sk_new()
48 stack->num_alloc = MIN_NODES; in OPENSSL_sk_new()
49 stack->c = c; in OPENSSL_sk_new()
51 return stack; in OPENSSL_sk_new()
54 ssl_mem_free(stack); in OPENSSL_sk_new()
70 void OPENSSL_sk_free(OPENSSL_STACK *stack) in OPENSSL_sk_free() argument
72 SSL_ASSERT3(stack); in OPENSSL_sk_free()
[all …]
/third_party/ltp/lib/
Dcloner.c54 # define clone(fn, stack, flags, arg, ptid, tls, ctid) \ argument
55 clone(fn, stack, flags, arg)
66 size_t stack_size, void *stack, pid_t *ptid, void *tls, pid_t *ctid) in ltp_clone_() argument
71 ret = __clone2(fn, stack, stack_size, flags, arg, ptid, tls, ctid); in ltp_clone_()
83 if (stack) in ltp_clone_()
84 stack += stack_size; in ltp_clone_()
87 ret = clone(fn, stack, flags, arg, ptid, tls, ctid); in ltp_clone_()
94 size_t stack_size, void *stack) in ltp_clone() argument
96 return ltp_clone_(flags, fn, arg, stack_size, stack, NULL, NULL, NULL); in ltp_clone()
100 size_t stack_size, void *stack, ...) in ltp_clone7() argument
[all …]
/third_party/boost/libs/xpressive/test/
Dtest_actions.cpp171 std::stack<int> stack_; in test5()
172 reference<std::stack<int> > stack(stack_); in test5() local
179 factor = (+_d)[ push(stack, as<int>(_)) ] | group; in test5()
182 [ right = top(stack) in test5()
183 , pop(stack) in test5()
184 , left = top(stack) in test5()
185 , pop(stack) in test5()
186 , push(stack, left * right) in test5()
189 [ right = top(stack) in test5()
190 , pop(stack) in test5()
[all …]
/third_party/flatbuffers/java/com/google/flatbuffers/
DFlexBuffersBuilder.java87 private final ArrayList<Value> stack = new ArrayList<>(); field in FlexBuffersBuilder
159 stack.clear(); in clear()
190 stack.add(Value.bool(putKey(key), val)); in putBoolean()
242 stack.add(Value.int8(iKey, (int) val)); in putInt()
244 stack.add(Value.int16(iKey, (int) val)); in putInt()
246 stack.add(Value.int32(iKey, (int) val)); in putInt()
248 stack.add(Value.int64(iKey, val)); in putInt()
286 stack.add(Value.uInt64(putKey(key), value)); in putUInt64()
304 stack.add(vVal); in putUInt()
321 stack.add(Value.float32(putKey(key), val)); in putFloat()
[all …]
/third_party/libffi/src/ia64/
Dffi.c295 struct ia64_args *stack; in ffi_call() local
306 stack = alloca (cif->bytes); in ffi_call()
315 stack->gp_regs[gpcount++] = *(SINT8 *)avalue[i]; in ffi_call()
318 stack->gp_regs[gpcount++] = *(UINT8 *)avalue[i]; in ffi_call()
321 stack->gp_regs[gpcount++] = *(SINT16 *)avalue[i]; in ffi_call()
324 stack->gp_regs[gpcount++] = *(UINT16 *)avalue[i]; in ffi_call()
327 stack->gp_regs[gpcount++] = *(SINT32 *)avalue[i]; in ffi_call()
330 stack->gp_regs[gpcount++] = *(UINT32 *)avalue[i]; in ffi_call()
334 stack->gp_regs[gpcount++] = *(UINT64 *)avalue[i]; in ffi_call()
338 stack->gp_regs[gpcount++] = (UINT64)(PTR64) *(void **)avalue[i]; in ffi_call()
[all …]
/third_party/musl/porting/liteos_m/kernel/src/regex/
Dregcomp.c297 union tre_stack_item *stack; member
309 s->stack = xmalloc(sizeof(*s->stack) * size); in tre_stack_new()
310 if (s->stack == NULL) in tre_stack_new()
326 xfree(s->stack); in tre_stack_destroy()
341 s->stack[s->ptr] = value; in tre_stack_push()
357 new_buffer = xrealloc(s->stack, sizeof(*new_buffer) * new_size); in tre_stack_push()
364 s->stack = new_buffer; in tre_stack_push()
383 return s->stack[--s->ptr].typetag ## _value; \
399 tre_stack_t *stack; member
965 tre_stack_t *stack = ctx->stack; in tre_parse() local
[all …]
/third_party/musl/porting/liteos_m_iccarm/kernel/src/regex/
Dregcomp.c297 union tre_stack_item *stack; member
309 s->stack = xmalloc(sizeof(*s->stack) * size); in tre_stack_new()
310 if (s->stack == NULL) in tre_stack_new()
326 xfree(s->stack); in tre_stack_destroy()
341 s->stack[s->ptr] = value; in tre_stack_push()
357 new_buffer = xrealloc(s->stack, sizeof(*new_buffer) * new_size); in tre_stack_push()
364 s->stack = new_buffer; in tre_stack_push()
383 return s->stack[--s->ptr].typetag ## _value; \
399 tre_stack_t *stack; member
966 tre_stack_t *stack = ctx->stack; in tre_parse() local
[all …]

12345678910>>...101