| /third_party/parse5/packages/parse5/test/ |
| D | open-element-stack.test.js | 5 const OpenElementStack = require('../lib/parser/open-element-stack');
17 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);
[all …]
|
| /third_party/boost/boost/fusion/iterator/detail/ |
| D | segmented_next_impl.hpp | 28 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 …]
|
| /third_party/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 …]
|
| /third_party/freetype/src/psaux/ |
| D | psstack.c | 5 * Adobe's code for emulating a CFF stack (body).
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()
69 /* allocate the stack buffer */ 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()
[all …]
|
| /third_party/flutter/skia/third_party/externals/freetype/src/psaux/ |
| D | psstack.c | 5 * Adobe's code for emulating a CFF stack (body).
59 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()
69 /* allocate the stack buffer */ 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()
[all …]
|
| /third_party/skia/third_party/externals/freetype/src/psaux/ |
| D | psstack.c | 5 * 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 …]
|
| /third_party/skia/tests/ |
| D | ClipStackTest.cpp | 40 // Build up a clip stack with a path, an empty clip, and a rect. in test_assign_and_comparison()
131 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
[all …]
|
| /third_party/flutter/skia/tests/ |
| D | ClipStackTest.cpp | 56 // Build up a clip stack with a path, an empty clip, and a rect. in test_assign_and_comparison()
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
[all …]
|
| /third_party/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()
141 * the top matrix of the current matrix stack and sets
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()
[all …]
|
| /third_party/pcre2/pcre2/src/sljit/ |
| D | sljitUtils.c | 2 * Stack-less Just-In-Time compiler
65 /* Stack */
174 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()
[all …]
|
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Target/AMDGPU/ |
| D | AMDGPUFrameLowering.cpp | 9 // Interface to describe a layout of a stack frame on a AMDGPU target machine.
29 // The StackWidth determines how stack objects are laid out in memory. in getStackWidth()
30 // For a vector stack variable, like: int4 stack[2], the data will be stored in getStackWidth()
35 // T0.X = stack[0].x in getStackWidth()
36 // T1.X = stack[0].y in getStackWidth()
37 // T2.X = stack[0].z in getStackWidth()
38 // T3.X = stack[0].w in getStackWidth()
39 // T4.X = stack[1].x in getStackWidth()
40 // T5.X = stack[1].y in getStackWidth()
41 // T6.X = stack[1].z in getStackWidth()
[all …]
|
| /third_party/boost/libs/compute/test/ |
| D | test_stack.cpp | 14 #include <boost/compute/container/stack.hpp>
22 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()
[all …]
|
| /third_party/boost/libs/coroutine/doc/ |
| D | stack.qbk | 8 [section:stack Stack allocation]
10 A __coro__ uses internally a __ctx__ which manages a set of registers and a stack.
11 The memory used by the stack is allocated/deallocated via a __stack_allocator__
25 [creates a stack of at least `size` bytes and stores its pointer and
31 [deallocates the stack created by `a.allocate()`]
36 against exceeding the context's available stack size rather than leaving it as
42 [note The stack is not required to be aligned; alignment takes place inside
46 top of the stack (growing downwards) or the bottom of the stack (growing
56 It appends a guard page at the end of each stack to protect against exceeding
57 the stack. If the guard page is accessed (read or write operation) a
[all …]
|
| /third_party/boost/libs/coroutine2/doc/ |
| D | stack.qbk | 8 [section:stack Stack allocation]
10 The memory used by the stack is allocated/deallocated via a __stack_allocator__
24 [creates a stack allocator]
29 [creates a stack]
34 [deallocates the stack created by `a.allocate()`]
39 against exceeding the context's available stack size rather than leaving it as
45 [note The stack is not required to be aligned; alignment takes place inside
49 top of the stack (growing downwards) or the bottom of the stack (growing
57 It appends a guard page at the end of each stack to protect against exceeding
58 the stack. If the guard page is accessed (read or write operation) a
[all …]
|
| /third_party/boost/libs/context/doc/ |
| D | stack.qbk | 8 [#stack]
9 [section:stack Stack allocation]
11 The memory used by the stack is allocated/deallocated via a __stack_allocator__
25 [creates a stack allocator]
30 [creates a stack]
35 [deallocates the stack created by `a.allocate()`]
40 against exceeding the context's available stack size rather than leaving it as
47 top of the stack (growing downwards) or the bottom of the stack (growing
55 It appends a guard page at the end of each stack to protect against exceeding
56 the stack. If the guard page is accessed (read or write operation) a
[all …]
|
| /third_party/flutter/engine/flutter/flow/ |
| D | mutators_stack_unittests.cc | 12 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/libs/fiber/doc/ |
| D | stack.qbk | 8 [#stack]
9 [section:stack Stack allocation]
11 A __fiber__ uses internally an __econtext__ which manages a set of registers and a stack.
12 The memory used by the stack is allocated/deallocated via a __stack_allocator__
19 [heading stack-allocator concept]
20 A __stack_allocator__ must satisfy the ['stack-allocator concept] requirements
29 [creates a stack allocator]
34 [creates a stack]
39 [deallocates the stack created by `a.allocate()`]
44 against exceeding the context's available stack size rather than leaving it as
[all …]
|
| /third_party/pcre2/pcre2/doc/ |
| D | pcre2jit.3 | 66 of machine stack that it uses. The exact rules are not documented because they
96 "Controlling the JIT stack"
108 "Controlling the JIT stack"
110 below, even if you do not need to supply a non-default JIT stack. Such a
175 used for the JIT stack was insufficient. See
178 "Controlling the JIT stack"
180 below for a discussion of JIT stack usage.
190 .SH "CONTROLLING THE JIT STACK"
193 When the compiled JIT code runs, it needs a block of memory to use as a stack.
194 By default, it uses 32KiB on the machine stack. However, some large or
[all …]
|
| /third_party/ltp/lib/ |
| D | cloner.c | 54 # define clone(fn, stack, flags, arg, ptid, tls, ctid) \ argument
55 clone(fn, stack, flags, arg)
60 * 1. hppa takes bottom of stack and no stacksize (stack grows up)
61 * 2. __ia64__ takes bottom of stack and uses clone2
62 * 3. all others take top of stack (stack grows down)
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_()
75 * These arches grow their stack up, so don't need to adjust the base. in ltp_clone_()
80 * For archs where stack grows downwards, stack points to the topmost in ltp_clone_()
81 * address of the memory space set up for the child stack. in ltp_clone_()
[all …]
|
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/BinaryFormat/ |
| D | MsgPackDocument.cpp | 61 // A level in the document reading stack.
78 SmallVector<StackLevel, 4> Stack; in readFromBlob() local
82 Stack.push_back(StackLevel({Root, (size_t)-1, nullptr})); in readFromBlob()
89 if (Multi && Stack.size() == 1) { in readFromBlob()
127 if (Stack.empty()) in readFromBlob()
129 else if (Stack.back().Node.getKind() == Type::Array) { in readFromBlob()
131 auto &Array = Stack.back().Node.getArray(); in readFromBlob()
134 auto &Map = Stack.back().Node.getMap(); in readFromBlob()
135 if (!Stack.back().MapEntry) { in readFromBlob()
137 Stack.back().MapEntry = &Map[Node]; in readFromBlob()
[all …]
|
| /third_party/ltp/testcases/kernel/syscalls/mmap/ |
| D | mmap18.c | 13 * a thread as a stack and expect the mapping to grow when we touch the
15 * growable mapping as a stack.
17 * The kernel only grows the memory region when the stack pointer is within
22 * 'stack_guard_gap' pages to an existing mapping. So when we map the stack we
23 * make sure there is enough of free address space before the lowest stack
28 * The stack memory map would look like:
36 * ^ | - - stack size - - |
39 * stack bottom stack top
43 * We allocate stack as we do in the first test but we mmap a page in the
44 * space the stack is supposed to grow into and we expect the thread to
[all …]
|
| /third_party/boost/libs/spirit/example/qi/compiler_tutorial/conjure1/ |
| D | vm.hpp | 19 op_neg, // negate the top stack entry
20 op_add, // add top two stack entries
21 op_sub, // subtract top two stack entries
22 op_mul, // multiply top two stack entries
23 op_div, // divide top two stack entries
25 op_not, // boolean negate the top stack entry
26 op_eq, // compare the top two stack entries for ==
27 op_neq, // compare the top two stack entries for !=
28 op_lt, // compare the top two stack entries for <
29 op_lte, // compare the top two stack entries for <=
[all …]
|
| /third_party/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 …]
|
| /third_party/boost/libs/spirit/example/qi/compiler_tutorial/conjure2/ |
| D | vm.hpp | 19 op_neg, // negate the top stack entry
20 op_add, // add top two stack entries
21 op_sub, // subtract top two stack entries
22 op_mul, // multiply top two stack entries
23 op_div, // divide top two stack entries
25 op_not, // boolean negate the top stack entry
26 op_eq, // compare the top two stack entries for ==
27 op_neq, // compare the top two stack entries for !=
28 op_lt, // compare the top two stack entries for <
29 op_lte, // compare the top two stack entries for <=
[all …]
|
| /third_party/boost/libs/spirit/example/qi/compiler_tutorial/mini_c/ |
| D | vm.hpp | 19 op_neg, // negate the top stack entry
20 op_add, // add top two stack entries
21 op_sub, // subtract top two stack entries
22 op_mul, // multiply top two stack entries
23 op_div, // divide top two stack entries
25 op_not, // boolean negate the top stack entry
26 op_eq, // compare the top two stack entries for ==
27 op_neq, // compare the top two stack entries for !=
28 op_lt, // compare the top two stack entries for <
29 op_lte, // compare the top two stack entries for <=
[all …]
|