| /kernel/linux/linux-6.6/arch/x86/um/ |
| H A D | setjmp_32.S | 28 popl %ecx # Return address, and adjust the stack
32 pushl %ecx # Make the call/return stack happy
|
| /kernel/linux/linux-6.6/arch/x86/xen/ |
| H A D | Makefile | 11 CFLAGS_enlighten_pv.o := -fno-stack-protector
12 CFLAGS_mmu_pv.o := -fno-stack-protector
|
| /kernel/linux/linux-6.6/mm/kasan/ |
| H A D | Makefile | 21 CC_FLAGS_KASAN_RUNTIME := $(call cc-option, -fno-conserve-stack)
22 CC_FLAGS_KASAN_RUNTIME += -fno-stack-protector
|
| /kernel/linux/linux-6.6/sound/soc/sof/xtensa/ |
| H A D | core.c | 116 u32 *stack, u32 stack_words) in xtensa_stack()
124 dev_printk(level, sdev->dev, "stack dump from 0x%8.8x\n", stack_ptr); in xtensa_stack()
131 hex_dump_to_buffer(stack + i, 16, 16, 4, in xtensa_stack()
115 xtensa_stack(struct snd_sof_dev *sdev, const char *level, void *oops, u32 *stack, u32 stack_words) xtensa_stack() argument
|
| /third_party/ltp/testcases/kernel/controllers/cgroup/ |
| H A D | cgroup_core02.c | 54 static char stack[65536]; in test_lesser_ns_open() local
67 lesser_ns_open_thread_fn, &targ, 65536, stack); in test_lesser_ns_open()
|
| /third_party/mesa3d/src/glx/ |
| H A D | clientattrib.c | 76 if (spp < &gc->attributes.stack[__GL_CLIENT_ATTRIB_STACK_DEPTH]) { in __indirect_glPushClientAttrib()
109 if (spp > &gc->attributes.stack[0]) { in __indirect_glPopClientAttrib()
|
| /third_party/musl/src/thread/sh/ |
| H A D | clone.s | 6 ! incoming: fn stack flags arg ptid tls ctid
17 !mov r5, r5 ! r5 = stack
|
| /third_party/lwip/src/include/lwip/apps/ |
| H A D | snmp_opts.h | 32 * This file is part of the lwIP TCP/IP stack.
79 #error SNMP stack can use only one of the APIs {raw, netconn}
83 #error SNMP stack needs a receive API and UDP {raw, netconn}
217 * Indicates if the MIB2 implementation of LWIP SNMP stack is used.
259 * For the stack this could be useful in case that SNMP processing is done in TCP/IP thread. In this situation a request with many
260 * repetitions could block the thread for a longer time. Setting limit here will keep the stack more responsive.
|
| /third_party/vk-gl-cts/framework/randomshaders/ |
| H A D | rsgGeneratorState.hpp | 71 // \todo [2011-06-10 pyry] Could we not expose whole statement stack to everyone?
73 void setStatementStack (std::vector<Statement*>& stack) { m_statementStack = &stack; } in setStatementStack() argument
|
| /foundation/arkui/ace_engine/frameworks/core/components_ng/pattern/menu/menu_item/ |
| H A D | menu_item_model_ng.cpp | 24 auto* stack = ViewStackProcessor::GetInstance(); in Create() local
25 int32_t nodeId = stack->ClaimNodeId(); in Create()
30 stack->Push(menuItem); in Create()
66 auto* stack = ViewStackProcessor::GetInstance(); in Create() local
67 int32_t nodeId = stack->ClaimNodeId(); in Create()
71 stack->Push(menuItem); in Create()
|
| /kernel/linux/linux-5.10/arch/m68k/fpsp040/ |
| H A D | x_snan.S | 176 movel %d1,-(%a7) |move the snan onto the stack
180 movel (%a7)+,%d1 |clear off stack
198 movel %d1,-(%a7) |move the snan onto the stack
202 movel (%a7)+,%d1 |clear off stack
219 movel %d1,-(%a7) |move the snan onto the stack
223 movel (%a7)+,%d1 |clear off stack
|
| /kernel/linux/linux-6.6/arch/ia64/kernel/ |
| H A D | process.c | 280 * This means that the stack layout is as follows:
288 * | memory stack |
296 * the stack is page aligned and the page size is at least 4KB, this is always the case,
303 unsigned long user_stack_base = args->stack; in copy_thread()
307 struct switch_stack *child_stack, *stack; in copy_thread() local
377 stack = ((struct switch_stack *) regs) - 1; in copy_thread()
379 memcpy(child_stack, stack, sizeof(*child_ptregs) + sizeof(*child_stack)); in copy_thread()
382 rbs_size = stack->ar_bspstore - rbs; in copy_thread()
415 .stack = stack_start, in ia64_clone()
|
| /kernel/linux/linux-6.6/arch/m68k/fpsp040/ |
| H A D | x_snan.S | 176 movel %d1,-(%a7) |move the snan onto the stack
180 movel (%a7)+,%d1 |clear off stack
198 movel %d1,-(%a7) |move the snan onto the stack
202 movel (%a7)+,%d1 |clear off stack
219 movel %d1,-(%a7) |move the snan onto the stack
223 movel (%a7)+,%d1 |clear off stack
|
| /kernel/linux/linux-5.10/drivers/gpu/drm/i915/ |
| H A D | i915_scheduler.c | 240 struct i915_dependency stack; in __i915_schedule() local
251 stack.signaler = node; in __i915_schedule()
252 list_add(&stack.dfs_link, &dfs); in __i915_schedule()
264 * real risk of overunning the kernel stack. Instead, we build in __i915_schedule()
306 if (stack.dfs_link.next == stack.dfs_link.prev) in __i915_schedule()
309 __list_del_entry(&stack.dfs_link); in __i915_schedule()
|
| /kernel/linux/linux-6.6/drivers/gpu/drm/i915/ |
| H A D | i915_scheduler.c | 161 struct i915_dependency stack; in __i915_schedule() local
172 stack.signaler = node; in __i915_schedule()
173 list_add(&stack.dfs_link, &dfs); in __i915_schedule()
185 * real risk of overunning the kernel stack. Instead, we build in __i915_schedule()
227 if (stack.dfs_link.next == stack.dfs_link.prev) in __i915_schedule()
230 __list_del_entry(&stack.dfs_link); in __i915_schedule()
|
| /third_party/node/deps/brotli/c/enc/ |
| H A D | entropy_encode.c | 25 int stack[16]; in BrotliSetDepth() local
29 stack[0] = -1; in BrotliSetDepth()
34 stack[level] = pool[p].index_right_or_value_; in BrotliSetDepth()
40 while (level >= 0 && stack[level] == -1) level--; in BrotliSetDepth()
42 p = stack[level]; in BrotliSetDepth()
43 stack[level] = -1; in BrotliSetDepth()
|
| /third_party/skia/third_party/externals/brotli/c/enc/ |
| H A D | entropy_encode.c | 25 int stack[16]; in BrotliSetDepth() local
29 stack[0] = -1; in BrotliSetDepth()
34 stack[level] = pool[p].index_right_or_value_; in BrotliSetDepth()
40 while (level >= 0 && stack[level] == -1) level--; in BrotliSetDepth()
42 p = stack[level]; in BrotliSetDepth()
43 stack[level] = -1; in BrotliSetDepth()
|
| /kernel/linux/linux-5.10/drivers/char/ |
| H A D | random.c | 960 * The size of the copied stack pool is explicitly 2 longs so that we in mix_interrupt_randomness()
977 * Copy the pool to the stack so that the mixer always has a in mix_interrupt_randomness()
1141 * CPU, the timer activity will be touching the stack of the CPU that is
1165 } stack; in try_to_generate_entropy() local
1167 stack.entropy = random_get_entropy(); in try_to_generate_entropy()
1170 if (stack.entropy == random_get_entropy()) in try_to_generate_entropy()
1173 timer_setup_on_stack(&stack.timer, entropy_timer, 0); in try_to_generate_entropy()
1175 if (!timer_pending(&stack.timer)) in try_to_generate_entropy()
1176 mod_timer(&stack.timer, jiffies + 1); in try_to_generate_entropy()
1177 mix_pool_bytes(&stack in try_to_generate_entropy()
[all...] |
| /third_party/python/Modules/ |
| H A D | _functoolsmodule.c | 243 PyObject **stack; in partial_vectorcall() local
246 stack = small_stack; in partial_vectorcall()
249 stack = PyMem_Malloc(newnargs_total * sizeof(PyObject *)); in partial_vectorcall()
250 if (stack == NULL) { in partial_vectorcall()
256 /* Copy to new stack, using borrowed references */ in partial_vectorcall()
257 memcpy(stack, pto_args, pto_nargs * sizeof(PyObject*)); in partial_vectorcall()
258 memcpy(stack + pto_nargs, args, nargs_total * sizeof(PyObject*)); in partial_vectorcall()
261 stack, pto_nargs + nargs, kwnames); in partial_vectorcall()
262 if (stack != small_stack) { in partial_vectorcall()
263 PyMem_Free(stack); in partial_vectorcall()
598 PyObject* stack[2]; keyobject_richcompare() local
[all...] |
| /foundation/arkui/ace_engine/frameworks/core/components_ng/pattern/tabs/ |
| H A D | tabs_pattern.cpp | 507 * 2. Traverses the tree of UINodes starting from the swiperNode using a stack.
510 * 4. Continues traversing the tree by pushing the children of the current UINode onto the stack.
523 std::stack<RefPtr<UINode>> stack; in HandleChildrenUpdated() local
524 stack.push(swiperNode); in HandleChildrenUpdated()
525 while (!stack.empty()) { in HandleChildrenUpdated()
526 auto parent = stack.top(); in HandleChildrenUpdated()
527 stack.pop(); in HandleChildrenUpdated()
536 stack.push(child); in HandleChildrenUpdated()
|
| /kernel/linux/linux-6.6/arch/arm/kernel/ |
| H A D | traps.c | 74 * If we are walking past the end of the stack, it may be due in dump_backtrace_entry()
75 * to the fact that we are on an IRQ or overflow stack. In this in dump_backtrace_entry()
76 * case, we can load the address of the other stack from the in dump_backtrace_entry()
94 dump_mem(loglvl, "Exception stack", frame + 4, end); in dump_backtrace_entry()
97 void dump_backtrace_stm(u32 *stack, u32 instruction, const char *loglvl) in dump_backtrace_stm() argument
105 p += sprintf(p, " r%d:%08x", reg, *stack--); in dump_backtrace_stm()
121 * out any information relating to the stack.
295 pr_emerg("Process %.*s (pid: %d, stack limit = 0x%p)\n", in __die()
911 u8 *stack; in allocate_overflow_stacks() local
915 stack in allocate_overflow_stacks()
[all...] |
| /third_party/jinja2/ |
| H A D | lexer.py | 689 stack = ["root"]
693 stack.append(state + "_begin")
695 statetokens = self.rules[stack[-1]]
828 stack.pop()
833 stack.append(key)
842 stack.append(new_state)
844 statetokens = self.rules[stack[-1]]
845 # we are still at the same position and no stack change.
850 f"{regex!r} yielded empty string without stack change"
|
| /third_party/node/lib/internal/ |
| H A D | util.js | 192 if (!(isError(err) && err.stack) || err[decorated_private_symbol])
198 err.stack = arrow + err.stack;
503 return e.stack;
505 })()`, { overrideStackTrace }, { filename: 'structured-stack' });
508 const stack = getStructuredStack();
510 // Iterate over all stack frames and look for the first one not coming
512 if (ArrayIsArray(stack)) {
513 for (const frame of stack) {
|
| /third_party/node/deps/v8/third_party/jinja2/ |
| H A D | lexer.py | 676 stack = ["root"]
679 stack.append(state + "_begin")
680 statetokens = self.rules[stack[-1]]
809 stack.pop()
814 stack.append(key)
824 stack.append(new_state)
825 statetokens = self.rules[stack[-1]]
826 # we are still at the same position and no stack change.
831 "%r yielded empty string without stack change" % regex
|
| /third_party/node/tools/inspector_protocol/jinja2/ |
| H A D | lexer.py | 613 stack = ['root']
616 stack.append(state + '_begin')
619 statetokens = self.rules[stack[-1]]
705 stack.pop()
710 stack.append(key)
719 stack.append(new_state)
720 statetokens = self.rules[stack[-1]]
721 # we are still at the same position and no stack change.
726 'stack change' % regex)
|