Home
last modified time | relevance | path

Searched refs:stack (Results 376 - 400 of 3084) sorted by relevance

1...<<11121314151617181920>>...124

/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/node/deps/v8/src/torque/
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/python/Lib/asyncio/
H A Dformat_helpers.py72 stack = traceback.StackSummary.extract(traceback.walk_stack(f),
75 stack.reverse()
76 return stack
/kernel/linux/linux-5.10/kernel/
H A Dfork.c223 void *stack; in alloc_thread_stack_node() local
234 /* Clear the KASAN shadow of the stack. */ in alloc_thread_stack_node()
237 /* Clear stale pointers from reused stack. */ in alloc_thread_stack_node()
241 tsk->stack = s->addr; in alloc_thread_stack_node()
250 stack = __vmalloc_node_range(THREAD_SIZE, THREAD_ALIGN, in alloc_thread_stack_node()
261 if (stack) { in alloc_thread_stack_node()
262 tsk->stack_vm_area = find_vm_area(stack); in alloc_thread_stack_node()
263 tsk->stack = stack; in alloc_thread_stack_node()
265 return stack; in alloc_thread_stack_node()
310 unsigned long *stack; alloc_thread_stack_node() local
387 void *stack = task_stack_page(tsk); account_kernel_stack() local
875 unsigned long *stack; dup_task_struct() local
[all...]
/third_party/typescript/tests/baselines/reference/
H A DlocalVariablesReturnedFromCatchBlocks.js5 var stack2 = e.stack;
15 var stack2 = e.stack;
/kernel/linux/linux-6.6/drivers/char/
H A Drandom.c1056 * The size of the copied stack pool is explicitly 2 longs so that we in mix_interrupt_randomness()
1073 * Copy the pool to the stack so that the mixer always has a in mix_interrupt_randomness()
1244 * activity will be touching the stack of the CPU that is generating entropy.
1270 struct entropy_timer_state *stack = PTR_ALIGN((void *)stack_bytes, SMP_CACHE_BYTES); in try_to_generate_entropy() local
1276 stack->entropy = random_get_entropy(); in try_to_generate_entropy()
1277 if (stack->entropy != last) in try_to_generate_entropy()
1279 last = stack->entropy; in try_to_generate_entropy()
1281 stack->samples_per_bit = DIV_ROUND_UP(NUM_TRIAL_SAMPLES, num_different + 1); in try_to_generate_entropy()
1282 if (stack->samples_per_bit > MAX_SAMPLES_PER_BIT) in try_to_generate_entropy()
1285 atomic_set(&stack in try_to_generate_entropy()
[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...]
/kernel/linux/linux-5.10/drivers/gpu/drm/nouveau/nvif/
H A Dvmm.c40 u8 stack[48]; in nvif_vmm_map() local
43 if (sizeof(*args) + argc > sizeof(stack)) { in nvif_vmm_map()
47 args = (void *)stack; in nvif_vmm_map()
59 if (args != (void *)stack) in nvif_vmm_map()
/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):
/third_party/node/deps/v8/third_party/jinja2/
H A Ddebug.py45 stack = []
47 # Build the stack of traceback object, replacing any in template
61 stack.append(fake_tb)
63 stack.append(tb)
70 for tb in reversed(stack):
/third_party/musl/src/math/x32/
H A Dexpl.s48 # fpu stack: 2^hi x hi
67 # fpu stack: 2^hi x hi xh xl yh
78 # fpu stack: 2^hi x lo xh xl yl
92 # fpu stack: 2^hi x lo log2e_lo
/third_party/musl/src/math/i386/
H A Dexpl.s49 # fpu stack: 2^hi x hi
68 # fpu stack: 2^hi x hi xh xl yh
79 # fpu stack: 2^hi x lo xh xl yl
92 # fpu stack: 2^hi x lo log2e_lo
/third_party/musl/src/math/x86_64/
H A Dexpl.s48 # fpu stack: 2^hi x hi
67 # fpu stack: 2^hi x hi xh xl yh
78 # fpu stack: 2^hi x lo xh xl yl
92 # fpu stack: 2^hi x lo log2e_lo
/third_party/skia/third_party/externals/jinja2/
H A Ddebug.py45 stack = []
47 # Build the stack of traceback object, replacing any in template
61 stack.append(fake_tb)
63 stack.append(tb)
70 for tb in reversed(stack):
/third_party/skia/third_party/externals/abseil-cpp/absl/debugging/internal/
H A Dexamine_stack.cc127 // Print a program counter, its stack frame size, and its symbol name.
151 // Print a program counter and the corresponding stack frame size.
167 void* pc, void* const stack[], int frame_sizes[], int depth, in DumpPCAndFrameSizesAndStackTrace()
171 // We don't know the stack frame size for PC, use 0. in DumpPCAndFrameSizesAndStackTrace()
185 DumpPCAndFrameSizeAndSymbol(writerfn, writerfn_arg, stack[i], in DumpPCAndFrameSizesAndStackTrace()
186 reinterpret_cast<char*>(stack[i]) - 1, in DumpPCAndFrameSizesAndStackTrace()
189 DumpPCAndFrameSize(writerfn, writerfn_arg, stack[i], frame_sizes[i], in DumpPCAndFrameSizesAndStackTrace()
166 DumpPCAndFrameSizesAndStackTrace( void* pc, void* const stack[], int frame_sizes[], int depth, int min_dropped_frames, bool symbolize_stacktrace, void (*writerfn)(const char*, void*), void* writerfn_arg) DumpPCAndFrameSizesAndStackTrace() argument
/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...]
/kernel/linux/linux-6.6/arch/um/kernel/
H A Dprocess.c62 void free_stack(unsigned long stack, int order) in free_stack() argument
64 free_pages(stack, order); in free_stack()
161 unsigned long sp = args->stack; in copy_thread()
230 unsigned long stack; in user_context() local
232 stack = sp & (PAGE_MASK << CONFIG_KERNEL_STACK_ORDER); in user_context()
233 return stack != (unsigned long) current_thread_info(); in user_context()
370 /* Bail if the process has no kernel stack for some reason */ in __get_wchan()
376 * Bail if the stack pointer is below the bottom of the kernel in __get_wchan()
377 * stack for some reason in __get_wchan()
/kernel/linux/linux-6.6/tools/testing/selftests/pidfd/
H A Dpidfd_fdinfo_test.c87 char *stack; member
101 ret.stack = mmap(NULL, CHILD_STACK_SIZE, PROT_READ | PROT_WRITE, in clone_newns()
103 if (ret.stack == MAP_FAILED) { in clone_newns()
104 error_set(err, -1, "mmap of stack failed (errno %d)", errno); in clone_newns()
109 ret.pid = __clone2(fn, ret.stack, CHILD_STACK_SIZE, flags, args, &ret.fd); in clone_newns()
111 ret.pid = clone(fn, ret.stack + CHILD_STACK_SIZE, flags, args, &ret.fd); in clone_newns()
141 if (munmap(child->stack, CHILD_STACK_SIZE)) { in child_join()
142 error_set(err, -1, "munmap of child stack failed (errno %d)", errno); in child_join()
/kernel/linux/linux-6.6/lib/
H A Dref_tracker.c45 depot_stack_handle_t stack = tracker->alloc_stack_handle; in ref_tracker_get_stats() local
50 if (stats->stacks[i].stack_handle == stack) in ref_tracker_get_stats()
55 stats->stacks[i].stack_handle = stack; in ref_tracker_get_stats()
89 depot_stack_handle_t stack; in __ref_tracker_dir_pr_ostream() local
107 stack = stats->stacks[i].stack_handle; in __ref_tracker_dir_pr_ostream()
108 if (sbuf && !stack_depot_snprint(stack, sbuf, STACK_BUF_SIZE, 4)) in __ref_tracker_dir_pr_ostream()
/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...]

Completed in 21 milliseconds

1...<<11121314151617181920>>...124