Home
last modified time | relevance | path

Searched refs:stack (Results 151 - 175 of 959) sorted by relevance

12345678910>>...39

/third_party/pulseaudio/man/
H A Dxmltoman25 my @stack;
58 if ($stack_n == 0 or $a ne $stack[$stack_n-1]) {
63 $stack[$stack_n++] = $a;
73 $a = $stack[$stack_n-1];
/third_party/node/test/parallel/
H A Dtest-repl-pretty-custom-stack.js35 Error.prepareStackTrace = (err, stack) => {
38 stack.push(err);
39 return stack.reverse().join('--->\n');
50 command: `.load ${fixtures.path('repl-pretty-stack.js')}`,
H A Dtest-vm-basic.js90 return err.stack.startsWith('test-boom-error:1');
261 stack: 'Error: Sample Error\n at <anonymous>:1:7'
272 stack: 'Error: Sample Error\n at <anonymous>:4:7'
283 stack: 'Error: Sample Error\n at <anonymous>:1:10'
304 stack: 'ReferenceError: varInContext is not defined\n at <anonymous>:1:1'
/third_party/musl/src/thread/riscv64/
H A Dclone.s1 # __clone(func, stack, flags, arg, ptid, tls, ctid)
4 # syscall(SYS_clone, flags, stack, ptid, tls, ctid)
10 # Save func and arg to stack
/third_party/musl/src/thread/powerpc64/
H A Dclone.s6 # int clone(fn, stack, flags, arg, ptid, tls, ctid)
14 # create initial stack frame for new thread
19 # save fn and arg to child stack
/third_party/musl/src/thread/riscv32/
H A Dclone.s1 # __clone(func, stack, flags, arg, ptid, tls, ctid)
4 # syscall(SYS_clone, flags, stack, ptid, tls, ctid)
10 # Save func and arg to stack
/third_party/node/deps/v8/src/torque/
H A Dcc-generator.h30 void EmitGoto(const Block* destination, Stack<std::string>* stack,
35 std::vector<std::string> constexpr_arguments, Stack<std::string>* stack);
39 void EmitInstruction(const T& instruction, Stack<std::string>* stack) \
H A Dcsa-generator.h36 base::Optional<Block*> catch_block, Stack<std::string>* stack,
41 std::vector<std::string> constexpr_arguments, Stack<std::string>* stack);
45 void EmitInstruction(const T& instruction, Stack<std::string>* stack) \
/third_party/icu/icu4j/main/classes/core/src/com/ibm/icu/message2/
H A DMf2Parser.java60 public Nonterminal[] stack = new Nonterminal[64]; field in Mf2Parser.TopDownTreeBuilder
75 if (++top >= stack.length) stack = Arrays.copyOf(stack, stack.length << 1); in startNonterminal()
76 stack[top] = nonterminal; in startNonterminal()
82 stack[top].end = end; in endNonterminal()
99 Nonterminal current = stack[top]; in addChild()
107 stack[0].send(e); in serialize()
/third_party/python/Lib/
H A Dplistlib.py175 self.stack = []
211 if not isinstance(self.stack[-1], type({})):
214 self.stack[-1][self.current_key] = value
216 elif not self.stack:
220 if not isinstance(self.stack[-1], type([])):
223 self.stack[-1].append(value)
235 self.stack.append(d)
241 self.stack.pop()
244 if self.current_key or not isinstance(self.stack[-1], type({})):
252 self.stack
[all...]
/third_party/node/lib/internal/test_runner/reporter/
H A Dspec.js40 #stack = [];
93 const subtest = ArrayPrototypeShift(this.#stack); // This is the matching `test:start` event
100 while (this.#stack.length) {
102 const parent = ArrayPrototypePop(this.#stack);
126 ArrayPrototypeUnshift(this.#stack, { __proto__: null, data, type });
/third_party/python/Lib/idlelib/
H A Dstackviewer.py25 self.stack = self.get_stack(tb)
31 stack = []
35 stack.append((tb.tb_frame, tb.tb_lineno))
37 return stack
54 for info in self.stack:
138 # inject stack trace to sys
/third_party/rust/crates/regex/src/
H A Dpikevm.rs33 /// An explicit stack used for following epsilon transitions. (This is
35 stack: &'r mut Vec<FollowEpsilon>,
46 /// An explicit stack used for following epsilon transitions.
47 stack: Vec<FollowEpsilon>,
65 /// A representation of an explicit stack frame when following epsilon
79 Cache { clist: Threads::new(), nlist: Threads::new(), stack: vec![] } in new()
103 Fsm { prog, stack: &mut cache.stack, input }.exec_( in exec()
278 self.stack.push(FollowEpsilon::IP(ip)); in add()
279 while let Some(frame) = self.stack in add()
[all...]
/third_party/mesa3d/src/compiler/glsl/
H A Dlower_precision.cpp95 /* List of child rvalues that can be lowered. When this stack entry is
129 std::vector<stack_entry> stack; member in __anon7193::find_lowerable_rvalues_visitor
197 /* Add a new stack entry for this instruction */ in stack_enter()
203 state->stack.push_back(entry); in stack_enter()
219 const stack_entry &entry = stack.back(); in pop_stack_entry()
221 if (stack.size() >= 2) { in pop_stack_entry()
225 stack_entry &parent = stack.end()[-2]; in pop_stack_entry()
248 } else if (stack.size() >= 2) { in pop_stack_entry()
249 stack_entry &parent = stack.end()[-2]; in pop_stack_entry()
274 stack in pop_stack_entry()
[all...]
/third_party/node/lib/internal/util/
H A Dinspect.js1240 return error.stack ? String(error.stack) : ErrorPrototypeToString(error);
1243 function getStackFrames(ctx, err, stack) {
1244 const frames = StringPrototypeSplit(stack, '\n');
1253 // Remove stack frames identical to frames in cause.
1262 const msg = ` ... ${skipped} lines matching cause stack trace ...`;
1270 function improveStack(stack, constructor, name, tag) {
1271 // A stack trace may contain arbitrary data. Only manipulate the output
1277 StringPrototypeStartsWith(stack, name) &&
1278 (stack
[all...]
/third_party/libunwind/libunwind/tests/
H A DGtest-exc.c110 long stack; in a() local
115 n, &stack, (unsigned long) get_bsp ()); in a()
125 &stack, (unsigned long) get_bsp ()); in a()
/third_party/musl/src/unistd/
H A Dfaccessat.c39 char stack[1024]; in faccessat() local
50 pid = __clone(checker, stack+sizeof stack, 0, &c); in faccessat()
/third_party/musl/src/thread/s390x/
H A Dclone.s8 # stack, b = r3
23 # create initial stack frame for new thread
29 # save fn and arg to child stack
/third_party/musl/src/thread/powerpc/
H A Dclone.s6 # int clone(fn, stack, flags, arg, ptid, tls, ctid)
17 # store non-volatile regs r30, r31 on stack in order to put our
26 # create initial stack frame for new thread
67 # restore stack
/third_party/python/Lib/asyncio/
H A Dformat_helpers.py72 stack = traceback.StackSummary.extract(traceback.walk_stack(f),
75 stack.reverse()
76 return stack
/third_party/PyYAML/examples/pygments-lexer/
H A Dyaml.py129 context.stack.pop()
130 context.stack.pop()
135 context.stack.pop()
136 context.stack.pop()
148 context.stack.pop()
149 context.stack.pop()
/third_party/libunwind/libunwind/doc/
H A Dunw_resume.tex8 \begin{Name}{3}{unw\_resume}{David Mosberger-Tang}{Programming Library}{unw\_resume}unw\_resume -- resume execution in a particular stack frame
19 The \Func{unw\_resume}() routine resumes execution at the stack frame
24 and then directly resumes execution in the target stack frame. Thus
27 (callee-saved) registers. However, if execution in any of the stack
31 \Func{unw\_resume}() on a cursor which identifies the stack frame of
81 \item[\Const{UNW\_BADFRAME}] The stack frame identified by
/third_party/node/deps/npm/node_modules/npmlog/lib/
H A Dlog.js221 var stack = null
225 // resolve stack traces to a plain string.
226 if (typeof arg === 'object' && arg instanceof Error && arg.stack) {
227 Object.defineProperty(arg, 'stack', {
228 value: stack = arg.stack + '',
234 if (stack) {
235 a.unshift(stack + '\n')
/third_party/skia/src/core/
H A DSkClipStack.h28 // stores the stack depth (fSaveCount) and clips (fDeque) separately.
29 // Each clip in fDeque stores the stack state to which it belongs
47 * An element of the clip stack. It represents a shape combined with the prevoius clip using a
156 /** The GenID can be used by clip stack clients to cache representations of the clip. The
158 stack not to the element itself. That is the same clip path in different stacks will
216 int fSaveCount; // save count of stack when this element was added.
222 /* fFiniteBoundType and fFiniteBound are used to incrementally update the clip stack's
235 // When element is applied to the previous elements in the stack is the result known to be
287 stack */
387 * This method quickly and conservatively determines whether the entire stack i
471 B2TIter(const SkClipStack& stack) B2TIter() argument
481 reset(const SkClipStack& stack) reset() argument
[all...]
/third_party/jinja2/
H A Ddebug.py44 stack = []
46 # Build the stack of traceback object, replacing any in template
60 stack.append(fake_tb)
62 stack.append(tb)
69 for tb in reversed(stack):

Completed in 11 milliseconds

12345678910>>...39