Home
last modified time | relevance | path

Searched full:stack (Results 1 – 25 of 5511) sorted by relevance

12345678910>>...221

/third_party/parse5/packages/parse5/lib/parser/
Dopen-element-stack.test.ts3 import { OpenElementStack } from './open-element-stack.js';
16 generateTestsForEachTreeAdapter('open-element-stack', (treeAdapter) => {
25 const stack = new OpenElementStack(document, treeAdapter, stackHandler); constant
27 assert.strictEqual(stack.current, document);
28 assert.strictEqual(stack.stackTop, -1);
30 stack.push(element1, $.UNKNOWN);
31 assert.strictEqual(stack.current, element1);
32 assert.strictEqual(stack.stackTop, 0);
34 stack.push(element2, $.UNKNOWN);
35 assert.strictEqual(stack.current, element2);
[all …]
/third_party/skia/tests/
DClipStackTest.cpp40 // 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/skia/third_party/externals/freetype/src/psaux/
Dpsstack.c5 * 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/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 …]
/third_party/mesa3d/src/mesa/main/
Dmatrix.c103 static void matrix_frustum(struct gl_matrix_stack* stack, in matrix_frustum() argument
121 _math_matrix_frustum(stack->Top, in matrix_frustum()
125 ctx->NewState |= stack->DirtyFlag; in matrix_frustum()
142 * the top matrix of the current matrix stack and sets
166 struct gl_matrix_stack *stack = get_named_matrix_stack(ctx, matrixMode, in _mesa_MatrixFrustumEXT() local
168 if (!stack) in _mesa_MatrixFrustumEXT()
171 matrix_frustum(stack, in _mesa_MatrixFrustumEXT()
180 matrix_ortho(struct gl_matrix_stack* stack, in matrix_ortho() argument
202 _math_matrix_ortho( stack->Top, in matrix_ortho()
206 ctx->NewState |= stack->DirtyFlag; in matrix_ortho()
[all …]
/third_party/node/deps/v8/src/torque/
Dinstructions.cc37 void PeekInstruction::TypeInstruction(Stack<const Type*>* stack, in TypeInstruction() argument
39 const Type* type = stack->Peek(slot); in TypeInstruction()
48 stack->Push(type); in TypeInstruction()
52 Stack<DefinitionLocation>* locations, Worklist<Block*>* worklist) const { in RecomputeDefinitionLocations()
56 void PokeInstruction::TypeInstruction(Stack<const Type*>* stack, in TypeInstruction() argument
58 const Type* type = stack->Top(); in TypeInstruction()
63 stack->Poke(slot, type); in TypeInstruction()
64 stack->Pop(); in TypeInstruction()
68 Stack<DefinitionLocation>* locations, Worklist<Block*>* worklist) const { in RecomputeDefinitionLocations()
72 void DeleteRangeInstruction::TypeInstruction(Stack<const Type*>* stack, in TypeInstruction() argument
[all …]
Dcc-generator.cc17 base::Optional<Stack<std::string>> CCGenerator::EmitGraph( in EmitGraph()
18 Stack<std::string> parameters) { in EmitGraph()
38 base::Optional<Stack<std::string>> result; in EmitGraph()
51 Stack<std::string> CCGenerator::EmitBlock(const Block* block) { in EmitBlock()
55 Stack<std::string> stack; in EmitBlock() local
59 stack.Push(DefinitionToVariable(def)); in EmitBlock()
64 << " " << stack.Top() << "{}; USE(" << stack.Top() << ");\n"; in EmitBlock()
69 TorqueCodeGenerator::EmitInstruction(instruction, &stack); in EmitBlock()
71 return stack; in EmitBlock()
86 Stack<std::string>* stack) { in EmitInstruction() argument
[all …]
Dcsa-generator.cc17 base::Optional<Stack<std::string>> CSAGenerator::EmitGraph( in EmitGraph()
18 Stack<std::string> parameters) { in EmitGraph()
69 Stack<std::string> CSAGenerator::EmitBlock(const Block* block) { in EmitBlock()
70 Stack<std::string> stack; in EmitBlock() local
75 stack.Push(DefinitionToVariable(def)); in EmitBlock()
79 << "> " << stack.Top() << ";\n"; in EmitBlock()
80 phi_names << ", &" << stack.Top(); in EmitBlock()
86 TorqueCodeGenerator::EmitInstruction(instruction, &stack); in EmitBlock()
88 return stack; in EmitBlock()
104 Stack<std::string>* stack) { in EmitInstruction() argument
[all …]
/third_party/pcre2/pcre2/src/sljit/
DsljitUtils.c2 * Stack-less Just-In-Time compiler
65 /* Stack */
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()
[all …]
/third_party/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()
35 /* Main loop. Each iteration pops the next part from stack of in realpath()
38 * pushed to the stack. */ in realpath()
40 for (; ; p+=slash_len(stack+p)) { in realpath()
41 /* If stack starts with /, the whole component is / or // in realpath()
43 if (stack[p] == '/') { in realpath()
50 if (stack[p] == '/' && stack[p+1] != '/') in realpath()
[all …]
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Target/AMDGPU/
DAMDGPUFrameLowering.cpp9 // 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/pcre2/pcre2/doc/
Dpcre2jit.366 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/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/BinaryFormat/
DMsgPackDocument.cpp61 // 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/lib/
Dcloner.c54 # 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/ltp/testcases/kernel/syscalls/mmap/
Dmmap18.c13 * 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/node/deps/npm/tap-snapshots/test/lib/utils/
Dlog-file.js.test.cjs48 14 error pre at stack trace line 0
49 14 error pre at stack trace line 1
50 14 error pre at stack trace line 2
51 14 error pre at stack trace line 3
52 14 error pre at stack trace line 4
53 14 error pre at stack trace line 5
54 14 error pre at stack trace line 6
55 14 error pre at stack trace line 7
56 14 error pre at stack trace line 8
57 14 error pre at stack trace line 9 Error: message2
[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/node/deps/v8/src/heap/base/
Dstack.h18 // Abstraction over the stack. Supports handling of:
19 // - native stack;
22 class V8_EXPORT_PRIVATE Stack final {
24 explicit Stack(const void* stack_start = nullptr);
26 // Sets the start of the stack.
29 // Returns true if |slot| is part of the stack and false otherwise.
32 // Word-aligned iteration of the stack. Callee-saved registers are pushed to
33 // the stack before iterating pointers. Slot values are passed on to
37 // Word-aligned iteration of the stack, starting at `stack_end`. Slot values
39 // only visit a subset of the stack of IteratePointers().
[all …]
Dstack.cc5 #include "src/heap/base/stack.h"
17 using IterateStackCallback = void (*)(const Stack*, StackVisitor*, intptr_t*);
18 extern "C" void PushAllRegistersAndIterateStack(const Stack*, StackVisitor*,
21 Stack::Stack(const void* stack_start) : stack_start_(stack_start) {} in Stack() function in heap::base::Stack
23 void Stack::SetStackStart(const void* stack_start) { in SetStackStart()
27 bool Stack::IsOnStack(void* slot) const { in IsOnStack()
30 // If the slot is part of a fake frame, then it is definitely on the stack. in IsOnStack()
36 // Fall through as there is still a regular stack present even when running in IsOnStack()
47 return v8::base::Stack::GetCurrentStackPosition() <= slot && in IsOnStack()
56 // "stack-use-after-scope" warnings.
[all …]
/third_party/typescript/tests/baselines/reference/
DinfinitelyGenerativeInheritance1.symbols2 interface Stack<T> {
3 >Stack : Symbol(Stack, Decl(infinitelyGenerativeInheritance1.ts, 0, 0))
7 >pop : Symbol(Stack.pop, Decl(infinitelyGenerativeInheritance1.ts, 0, 20))
10 zip<S>(a: Stack<S>): Stack<{ x: T; y: S }>
11 >zip : Symbol(Stack.zip, Decl(infinitelyGenerativeInheritance1.ts, 1, 14))
14 >Stack : Symbol(Stack, Decl(infinitelyGenerativeInheritance1.ts, 0, 0))
16 >Stack : Symbol(Stack, Decl(infinitelyGenerativeInheritance1.ts, 0, 0))
23 interface MyStack<T> extends Stack<T> {
26 >Stack : Symbol(Stack, Decl(infinitelyGenerativeInheritance1.ts, 0, 0))
29 zip<S>(a: Stack<S>): Stack<{ x: T; y: S }>
[all …]
/third_party/rust/crates/rust-openssl/openssl/src/
Dstack.rs31 /// Trait implemented by types which can be placed in a stack.
35 /// The C stack type for this element.
42 /// An owned stack of `T`.
43 pub struct Stack<T: Stackable>(*mut T::StackType); struct
45 unsafe impl<T: Stackable + Send> Send for Stack<T> {} implementation
46 unsafe impl<T: Stackable + Sync> Sync for Stack<T> {} implementation
48 impl<T> fmt::Debug for Stack<T> implementation
57 impl<T: Stackable> Drop for Stack<T> { implementation
66 impl<T: Stackable> Stack<T> { impl
67 pub fn new() -> Result<Stack<T>, ErrorStack> { in new()
[all …]
/third_party/googletest/googletest/test/
Dgoogletest-output-test-golden-lin.txt7 Stack trace: (omitted)
13 Stack trace: (omitted)
47 Stack trace: (omitted)
55 Stack trace: (omitted)
69 Stack trace: (omitted)
80 Stack trace: (omitted)
90 Stack trace: (omitted)
99 Stack trace: (omitted)
109 Stack trace: (omitted)
115 Stack trace: (omitted)
[all …]
/third_party/jerryscript/jerry-core/parser/js/
Djs-parser-mem.c335 /* Parser stack management functions */
338 /* Stack is a reversed storage. */
341 * Initialize parser stack.
346 parser_data_init (&context_p->stack, PARSER_STACK_PAGE_SIZE); in parser_stack_init()
351 * Free parser stack.
356 parser_data_free (&context_p->stack, in parser_stack_free()
367 * Pushes an uint8_t value onto the stack.
371 uint8_t uint8_value) /**< value pushed onto the stack */ in parser_stack_push_uint8()
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()
[all …]
/third_party/elfutils/libdwfl/
Dframe_unwind.c39 /* Maximum number of DWARF expression stack slots before returning an error. */
96 do_push (struct eval_stack *stack, Dwarf_Addr val) in do_push() argument
98 if (stack->used >= DWARF_EXPR_STACK_MAX) in do_push()
103 if (stack->used == stack->allocated) in do_push()
105 stack->allocated = MAX (stack->allocated * 2, 32); in do_push()
107 new_addrs = realloc (stack->addrs, in do_push()
108 stack->allocated * sizeof (*stack->addrs)); in do_push()
114 stack->addrs = new_addrs; in do_push()
116 stack->addrs[stack->used++] = val; in do_push()
121 do_pop (struct eval_stack *stack, Dwarf_Addr *val) in do_pop() argument
[all …]
/third_party/node/deps/npm/node_modules/depd/
Dindex.js82 * Create stack string from stack.
85 function createStackString (stack) { argument
92 for (var i = 0; i < stack.length; i++) {
93 str += '\n at ' + stack[i].toString()
108 var stack = getStack()
109 var site = callSiteLocation(stack[1])
199 var stack = getStack()
205 callSite = callSiteLocation(stack[1])
211 depSite = callSiteLocation(stack[i])
216 for (; i < stack.length; i++) {
[all …]

12345678910>>...221