Searched refs:stack (Results 1 - 25 of 466) sorted by relevance

1234567891011>>

/linux-master/arch/um/include/asm/
H A Dsysrq.h6 extern void show_trace(struct task_struct* task, unsigned long *stack);
/linux-master/arch/x86/purgatory/
H A Dstack.S3 * purgatory: stack
10 /* A stack for the loaded kernel.
16 SYM_DATA_START(stack)
18 SYM_DATA_END_LABEL(stack, SYM_L_GLOBAL, stack_end)
/linux-master/arch/um/include/shared/skas/
H A Dmm_id.h14 unsigned long stack; member in struct:mm_id
H A Dskas.h13 extern int user_thread(unsigned long stack, int flags);
/linux-master/arch/openrisc/include/asm/
H A Dunwinder.h16 void unwind_stack(void *data, unsigned long *stack,
/linux-master/arch/um/os-Linux/skas/
H A Dmem.c26 unsigned long *stack)
28 if (stack == NULL) {
29 stack = (unsigned long *) mm_idp->stack + 2;
30 *stack = 0;
32 return stack;
76 * beginning of the stack:
80 ret = *((unsigned long *) mm_idp->stack);
81 offset = *((unsigned long *) mm_idp->stack + 1);
83 data = (unsigned long *)(mm_idp->stack
25 check_init_stack(struct mm_id * mm_idp, unsigned long *stack) argument
113 unsigned long *stack = check_init_stack(mm_idp, *addr); local
141 unsigned long *stack; local
[all...]
/linux-master/tools/testing/selftests/bpf/progs/
H A Dtest_global_func_ctx_args.c11 static long stack[256]; variable
19 return bpf_get_stack(ctx, &stack, sizeof(stack), 0);
50 return bpf_get_stack((void *)ctx, &stack, sizeof(stack), 0);
67 return bpf_get_stack(ctx, &stack, sizeof(stack), 0);
83 return bpf_get_stack(ctx, &stack, sizeof(stack), 0);
99 return bpf_get_stack(ctx, &stack, sizeo
[all...]
H A Dtest_get_stack_rawtp_err.c11 __u64 stack[MAX_STACK_RAWTP]; local
15 error = bpf_get_stack(ctx, stack, 0, -1);
/linux-master/arch/x86/kernel/
H A Ddumpstack_32.c38 static bool in_hardirq_stack(unsigned long *stack, struct stack_info *info) argument
44 * This is a software stack, so 'end' can be a valid stack pointer.
45 * It just means the stack is empty.
47 if (stack < begin || stack > end)
55 * See irq_32.c -- the next stack pointer is stored at the beginning of
56 * the stack.
63 static bool in_softirq_stack(unsigned long *stack, struct stack_info *info) argument
69 * This is a software stack, s
88 in_doublefault_stack(unsigned long *stack, struct stack_info *info) argument
108 get_stack_info(unsigned long *stack, struct task_struct *task, struct stack_info *info, unsigned long *visit_mask) argument
[all...]
H A Ddumpstack_64.c46 * On 64-bit, we have a generic entry stack that we
61 * @offs: Offset from the start of the exception stack area
62 * @size: Size of the exception stack
79 * Array of exception stack page descriptors. If the stack is larger than
80 * PAGE_SIZE, all pages covering a particular stack will have the same
81 * info. The guard pages including the not mapped DB2 stack are zeroed
94 static __always_inline bool in_exception_stack(unsigned long *stack, struct stack_info *info) argument
96 unsigned long begin, end, stk = (unsigned long)stack;
105 * Handle the case where stack trac
135 in_irq_stack(unsigned long *stack, struct stack_info *info) argument
170 get_stack_info_noinstr(unsigned long *stack, struct task_struct *task, struct stack_info *info) argument
191 get_stack_info(unsigned long *stack, struct task_struct *task, struct stack_info *info, unsigned long *visit_mask) argument
[all...]
/linux-master/arch/loongarch/include/asm/
H A Dentry-common.h10 return !(((unsigned long)(current->stack) ^ current_stack_pointer) & ~(THREAD_SIZE - 1));
/linux-master/arch/um/kernel/skas/
H A Dmmu.c21 unsigned long stack = 0; local
24 stack = __get_free_pages(GFP_KERNEL | __GFP_ZERO, ilog2(STUB_DATA_PAGES));
25 if (stack == 0)
28 to_mm->id.stack = stack;
34 to_mm->id.u.pid = copy_context_skas0(stack,
36 else to_mm->id.u.pid = start_userspace(stack);
54 if (to_mm->id.stack != 0)
55 free_pages(to_mm->id.stack, ilog2(STUB_DATA_PAGES));
77 free_pages(mmu->id.stack, ilog
[all...]
/linux-master/lib/
H A Dstackdepot.c3 * Stack depot - a stack trace storage that avoids duplication.
5 * Internally, stack depot maintains a hash table of unique stacktraces. The
6 * stack traces themselves are stored contiguously one after another in a set
57 /* Hash table of stored stack records. */
64 /* Array of memory regions that store stack records. */
72 /* Freelist of stack records within stack_pools. */
143 * stack traces being stored in stack depot.
242 * Initializes new stack pool, and updates the list of pools.
290 /* Keeps the preallocated memory to be used for a new stack depo
312 struct stack_record *stack; local
346 struct stack_record *stack; local
383 struct stack_record *stack = NULL; local
446 struct stack_record *stack; local
468 depot_free_stack(struct stack_record *stack) argument
539 struct stack_record *stack, *ret = NULL; local
701 struct stack_record *stack; local
728 struct stack_record *stack; local
746 stack_depot_print(depot_stack_handle_t stack) argument
[all...]
/linux-master/tools/testing/selftests/vDSO/
H A Dvdso_standalone_test_x86.c73 __attribute__((externally_visible)) void c_main(void **stack) argument
75 /* Parse the stack */
76 long argc = (long)*stack;
77 stack += argc + 2;
80 while(*stack)
81 stack++;
82 stack++;
85 vdso_init_from_auxv((void *)stack);
110 * This is the real entry point. It passes the initial stack into
/linux-master/arch/openrisc/kernel/
H A Dunwinder.c28 * the frame pointer should point to a location in the stack after the
40 * Create a stack trace doing scanning which is frame pointer aware. We can
41 * get reliable stack traces by matching the previously found frame
42 * pointer with the top of the stack address every time we find a valid
45 * Ideally the stack parameter will be passed as FP, but it can not be
49 * The OpenRISC stack frame looks something like the following. The
53 * SP -> (top of stack)
58 * FP -> (previous top of stack) /
60 void unwind_stack(void *data, unsigned long *stack, argument
67 while (!kstack_end(stack)) {
93 unwind_stack(void *data, unsigned long *stack, void (*trace)(void *data, unsigned long addr, int reliable)) argument
[all...]
/linux-master/include/linux/sched/
H A Dtask_stack.h6 * task->stack (kernel stack) handling interfaces:
16 * When accessing the stack of a non-current task that might exit, use
22 return task->stack;
30 return (unsigned long *)((unsigned long)task->stack + THREAD_SIZE) - 1;
32 return task->stack;
38 #define task_stack_page(task) ((void *)(task)->stack)
47 * Return the address of the last usable long on the stack.
49 * When the stack grows down, this is just above the thread
52 * When the stack grow
90 void *stack = task_stack_page(current); local
[all...]
/linux-master/tools/testing/selftests/proc/
H A Dthread-self.c51 void *stack; local
56 stack = mmap(NULL, 2 * PAGE_SIZE, PROT_READ|PROT_WRITE, MAP_PRIVATE|MAP_ANONYMOUS, -1, 0);
57 assert(stack != MAP_FAILED);
59 pid = clone(f, stack + PAGE_SIZE, CLONE_THREAD|CLONE_SIGHAND|CLONE_VM, (void *)1);
/linux-master/arch/sh/include/asm/
H A Dstacktrace.h11 /* Generic stack tracer with callbacks */
18 unsigned long *stack,
/linux-master/tools/testing/selftests/ftrace/test.d/kprobe/
H A Dkprobe_args.tc6 echo "p:testprobe $FUNCTION_FORK \$stack \$stack0 +0(\$stack)" > kprobe_events
7 grep testprobe kprobe_events | grep -q 'arg1=\$stack arg2=\$stack0 arg3=+0(\$stack)'
/linux-master/arch/x86/coco/
H A DMakefile4 CFLAGS_core.o += -fno-stack-protector
/linux-master/tools/perf/bench/
H A Dmem-memset-x86-64-asm.S11 * We need to provide note.GNU-stack section, saying that we want
12 * NOT executable stack. Otherwise the final linking will assume that
13 * the ELF stack should not be restricted at all and set it RWX.
15 .section .note.GNU-stack,"",@progbits
/linux-master/arch/um/kernel/
H A Dsysrq.c30 void show_stack(struct task_struct *task, unsigned long *stack, argument
38 " aborting stack trace!\n");
42 if (!stack)
43 stack = get_stack_pointer(task, segv_regs);
47 if (kstack_end(stack))
51 pr_cont(" %08lx", READ_ONCE_NOCHECK(*stack));
52 stack++;
/linux-master/arch/x86/include/asm/
H A Dstacktrace.h31 bool in_task_stack(unsigned long *stack, struct task_struct *task,
34 bool in_entry_stack(unsigned long *stack, struct stack_info *info);
36 int get_stack_info(unsigned long *stack, struct task_struct *task,
38 bool get_stack_info_noinstr(unsigned long *stack, struct task_struct *task,
42 bool get_stack_guard_info(unsigned long *stack, struct stack_info *info) argument
44 /* make sure it's not in the stack proper */
45 if (get_stack_info_noinstr(stack, current, info))
48 return get_stack_info_noinstr((void *)stack + PAGE_SIZE, current, info);
101 /* The form of the top of the frame on the stack */
/linux-master/drivers/misc/altera-stapl/
H A Daltera.c119 /* This function checks if enough parameters are available on the stack. */
213 long *stack = astate->stack; local
528 stack[stack_ptr] = stack[stack_ptr - 1];
534 swap(stack[stack_ptr - 2], stack[stack_ptr - 1]);
539 stack[stack_ptr - 1] += stack[stack_ptr];
545 stack[stack_pt
569 stack[stack_ptr - 1] <<= stack[stack_ptr]; local
575 stack[stack_ptr - 1] >>= stack[stack_ptr]; local
[all...]
/linux-master/sound/soc/sof/mediatek/
H A Dmtk-adsp-common.c22 * linenumber and stack.
26 * @stack: Stores the stack dump.
27 * @stack_words: Size of the stack dump.
32 u32 *stack, size_t stack_words)
48 /* then get the stack */
50 sof_mailbox_read(sdev, offset, stack, stack_words * sizeof(u32));
64 u32 stack[MTK_ADSP_STACK_DUMP_SIZE]; local
73 * number and the stack.
75 mtk_adsp_get_registers(sdev, &xoops, &panic_info, stack,
29 mtk_adsp_get_registers(struct snd_sof_dev *sdev, struct sof_ipc_dsp_oops_xtensa *xoops, struct sof_ipc_panic_info *panic_info, u32 *stack, size_t stack_words) argument
[all...]

Completed in 233 milliseconds

1234567891011>>