| /openbmc/linux/include/linux/ |
| H A D | stackdepot.h | 3 * Stack depot - a stack trace storage that avoids duplication.
5 * Stack depot is intended to be used by subsystems that need to store and
6 * later retrieve many potentially duplicated stack traces without wasting
9 * For example, KASAN needs to save allocation and free stack traces for each
10 * object. Storing two stack traces per object requires a lot of memory (e.g.
12 * stack traces often repeat, using stack depot allows to save about 100x space.
14 * Stack traces are never removed from the stack depot.
30 * Number of bits in the handle that stack depot doesn't use. Users may store
36 * Using stack depot requires its initialization, which can be done in 3 ways:
39 * scenarios where it's known at compile time that stack depot will be used.
[all …]
|
| /openbmc/linux/Documentation/arch/x86/ |
| H A D | shstk.rst | 4 Control-flow Enforcement Technology (CET) Shadow Stack
14 CET introduces shadow stack and indirect branch tracking (IBT). A shadow stack
15 is a secondary stack allocated from memory which cannot be directly modified by
17 return address to both the normal stack and the shadow stack. Upon
18 function return, the processor pops the shadow stack copy and compares it
19 to the normal stack copy. If the two differ, the processor raises a
22 Stack and Indirect Branch Tracking. Today in the 64-bit kernel, only userspace
23 shadow stack and kernel IBT are supported.
25 Requirements to use Shadow Stack
28 To use userspace shadow stack you need HW that supports it, a kernel
[all …]
|
| H A D | kernel-stacks.rst | 14 Like all other architectures, x86_64 has a kernel stack for every
17 zombie. While the thread is in user space the kernel stack is empty
25 * Interrupt stack. IRQ_STACK_SIZE
29 kernel switches from the current task to the interrupt stack. Like
32 of every per thread stack.
34 The interrupt stack is also used when processing a softirq.
36 Switching to the kernel interrupt stack is done by software based on a
41 to automatically switch to a new stack for designated events such as
43 events on x86_64. This feature is called the Interrupt Stack Table
46 point to dedicated stacks; each stack can be a different size.
[all …]
|
| /openbmc/linux/tools/testing/selftests/bpf/progs/ |
| H A D | verifier_subprog_precision.c | 44 __msg("mark_precise: frame0: regs=r0 stack= before 6: (bf) r1 = r7")
45 __msg("mark_precise: frame0: regs=r0 stack= before 5: (27) r0 *= 4")
46 __msg("mark_precise: frame0: regs=r0 stack= before 11: (95) exit")
47 __msg("mark_precise: frame1: regs=r0 stack= before 10: (bf) r0 = r1")
48 __msg("mark_precise: frame1: regs=r1 stack= before 4: (85) call pc+5")
49 __msg("mark_precise: frame0: regs=r1 stack= before 3: (bf) r1 = r6")
50 __msg("mark_precise: frame0: regs=r6 stack= before 2: (b7) r6 = 3")
83 __msg("mark_precise: frame0: regs=r0 stack= before 8: (bf) r1 = r7")
84 __msg("mark_precise: frame0: regs=r0 stack= before 7: (27) r0 *= 4")
85 __msg("mark_precise: frame0: regs=r0 stack= before 5: (a5) if r0 < 0x4 goto pc+1")
[all …]
|
| H A D | verifier_var_off.c | 36 __description("variable-offset stack read, priv vs unpriv")
38 __msg_unpriv("R2 variable stack access prohibited for !root")
43 /* Fill the top 8 bytes of the stack */ \ in stack_read_priv_vs_unpriv()
55 /* dereference it for a stack read */ \ in stack_read_priv_vs_unpriv()
63 __description("variable-offset stack read, uninitialized")
65 __failure_unpriv __msg_unpriv("R2 variable stack access prohibited for !root")
78 /* dereference it for a stack read */ \ in variable_offset_stack_read_uninitialized()
86 __description("variable-offset stack write, priv vs unpriv")
88 /* Check that the maximum stack depth is correctly maintained according to the
91 __log_level(4) __msg("stack depth 16")
[all …]
|
| H A D | verifier_scalar_ids.c | 13 __msg("frame0: regs=r0,r1,r2 stack= before 4: (bf) r3 = r10")
14 __msg("frame0: regs=r0,r1,r2 stack= before 3: (bf) r2 = r0")
15 __msg("frame0: regs=r0,r1 stack= before 2: (bf) r1 = r0")
16 __msg("frame0: regs=r0 stack= before 1: (57) r0 &= 255")
17 __msg("frame0: regs=r0 stack= before 0: (85) call bpf_ktime_get_ns")
46 __msg("frame0: regs=r0,r1,r2 stack= before 5: (bf) r3 = r10")
47 __msg("frame0: parent state regs=r0,r1,r2 stack=:")
48 __msg("frame0: regs=r0,r1,r2 stack= before 4: (05) goto pc+0")
49 __msg("frame0: regs=r0,r1,r2 stack= before 3: (bf) r2 = r0")
50 __msg("frame0: regs=r0,r1 stack= before 2: (bf) r1 = r0")
[all …]
|
| H A D | test_global_func_ctx_args.c | 11 static long stack[256]; variable
19 return bpf_get_stack(ctx, &stack, sizeof(stack), 0); in kprobe_typedef_ctx_subprog()
33 return bpf_get_stack((void *)ctx, &stack, sizeof(stack), 0); in kprobe_struct_ctx_subprog()
48 return bpf_get_stack(ctx, &stack, sizeof(stack), 0); in kprobe_workaround_ctx_subprog()
64 return bpf_get_stack(ctx, &stack, sizeof(stack), 0); in raw_tp_ctx_subprog()
80 return bpf_get_stack(ctx, &stack, sizeof(stack), 0); in raw_tp_writable_ctx_subprog()
96 return bpf_get_stack(ctx, &stack, sizeof(stack), 0); in perf_event_ctx_subprog()
|
| /openbmc/linux/arch/x86/kernel/ |
| H A D | dumpstack_32.c | 38 static bool in_hardirq_stack(unsigned long *stack, struct stack_info *info) in in_hardirq_stack() argument
44 * This is a software stack, so 'end' can be a valid stack pointer. in in_hardirq_stack()
45 * It just means the stack is empty. in in_hardirq_stack()
47 if (stack < begin || stack > end) in in_hardirq_stack()
55 * See irq_32.c -- the next stack pointer is stored at the beginning of in in_hardirq_stack()
56 * the stack. in in_hardirq_stack()
63 static bool in_softirq_stack(unsigned long *stack, struct stack_info *info) in in_softirq_stack() argument
69 * This is a software stack, so 'end' can be a valid stack pointer. in in_softirq_stack()
70 * It just means the stack is empty. in in_softirq_stack()
72 if (stack < begin || stack > end) in in_softirq_stack()
[all …]
|
| H A D | dumpstack_64.c | 46 * On 64-bit, we have a generic entry stack that we in stack_type_name()
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) in in_exception_stack() argument
96 unsigned long begin, end, stk = (unsigned long)stack; in in_exception_stack()
105 * Handle the case where stack trace is collected _before_ in in_exception_stack()
112 /* Bail if @stack is outside the exception stack area. */ in in_exception_stack()
[all …]
|
| H A D | dumpstack.c | 32 bool noinstr in_task_stack(unsigned long *stack, struct task_struct *task, in in_task_stack() argument
38 if (stack < begin || stack >= end) in in_task_stack()
50 bool noinstr in_entry_stack(unsigned long *stack, struct stack_info *info) in in_entry_stack() argument
57 if ((void *)stack < begin || (void *)stack >= end) in in_entry_stack()
128 /* No access to the user space stack of other tasks. Ignore. */ in show_opcodes()
160 * ordering reasons: if the registers are on the next stack, we don't in show_regs_if_on_stack()
162 * the wrong stack. Later, when show_trace_log_lvl() switches to the in show_regs_if_on_stack()
163 * next stack, this function will be called again with the same regs so in show_regs_if_on_stack()
181 * This function reads pointers from the stack and dereferences them. The
187 unsigned long *stack, const char *log_lvl) in show_trace_log_lvl() argument
[all …]
|
| /openbmc/linux/drivers/misc/altera-stapl/ |
| H A D | altera.c | 119 /* This function checks if enough parameters are available on the stack. */
213 long *stack = astate->stack; in altera_execute() local
528 stack[stack_ptr] = stack[stack_ptr - 1]; in altera_execute()
534 swap(stack[stack_ptr - 2], stack[stack_ptr - 1]); in altera_execute()
539 stack[stack_ptr - 1] += stack[stack_ptr]; in altera_execute()
545 stack[stack_ptr - 1] -= stack[stack_ptr]; in altera_execute()
551 stack[stack_ptr - 1] *= stack[stack_ptr]; in altera_execute()
557 stack[stack_ptr - 1] /= stack[stack_ptr]; in altera_execute()
563 stack[stack_ptr - 1] %= stack[stack_ptr]; in altera_execute()
569 stack[stack_ptr - 1] <<= stack[stack_ptr]; in altera_execute()
[all …]
|
| /openbmc/linux/arch/um/os-Linux/skas/ |
| H A D | mem.c | 26 unsigned long *stack) in check_init_stack() argument
28 if (stack == NULL) { in check_init_stack()
29 stack = (unsigned long *) mm_idp->stack + 2; in check_init_stack()
30 *stack = 0; in check_init_stack()
32 return stack; in check_init_stack()
76 * beginning of the stack: in do_syscall_stub()
80 ret = *((unsigned long *) mm_idp->stack); in do_syscall_stub()
81 offset = *((unsigned long *) mm_idp->stack + 1); in do_syscall_stub()
83 data = (unsigned long *)(mm_idp->stack + offset - STUB_DATA); in do_syscall_stub()
113 unsigned long *stack = check_init_stack(mm_idp, *addr); in run_syscall_stub() local
[all …]
|
| /openbmc/linux/Documentation/mm/ |
| H A D | vmalloced-kernel-stacks.rst | 4 Virtually Mapped Kernel Stack Support
21 Kernel stack overflows are often hard to debug and make the kernel
25 Virtually-mapped kernel stacks with guard pages causes kernel stack
31 causes reliable faults when the stack overflows. The usability of
32 the stack trace after overflow and response to the overflow itself
49 needs to work while the stack points to a virtual address with
51 most likely) needs to ensure that the stack's page table entries
52 are populated before running on a possibly unpopulated stack.
53 - If the stack overflows into a guard page, something reasonable
64 with guard pages. This causes kernel stack overflows to be caught
[all …]
|
| /openbmc/linux/tools/testing/selftests/bpf/verifier/ |
| H A D | precise.c | 42 mark_precise: frame0: regs=r2 stack= before 25\
43 mark_precise: frame0: regs=r2 stack= before 24\
44 mark_precise: frame0: regs=r2 stack= before 23\
45 mark_precise: frame0: regs=r2 stack= before 22\
46 mark_precise: frame0: regs=r2 stack= before 20\
47 mark_precise: frame0: parent state regs=r2 stack=:\
49 mark_precise: frame0: regs=r2,r9 stack= before 19\
50 mark_precise: frame0: regs=r9 stack= before 18\
51 mark_precise: frame0: regs=r8,r9 stack= before 17\
52 mark_precise: frame0: regs=r0,r9 stack= before 15\
[all …]
|
| /openbmc/linux/arch/x86/entry/ |
| H A D | entry_32.S | 7 * Stack layout while running C code:
8 * ptrace needs to have all registers on the stack.
123 * When we're here from kernel mode; the (exception) stack looks like:
171 * so any attempt to access the stack needs to use SS. (except for
180 * middle doesn't scribble our stack.
233 /* Switch to kernel stack if necessary */
325 * Setup and switch to ESPFIX stack
327 * We're returning to userspace with a 16 bit stack. The CPU will not
361 * entry-stack, it will overwrite the task-stack and everything we
362 * copied there. So allocate the stack-frame on the task-stack and
[all …]
|
| /openbmc/linux/lib/ |
| H A D | stackdepot.c | 3 * 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
47 /* Compact structure that stores a reference to a stack. */
78 /* Hash table of pointers to stored stack traces. */
85 /* Array of memory regions that store stack traces. */
94 * Stack depot tries to keep an extra pool allocated even before it runs out
136 * stack traces being stored in stack depot. in stack_depot_early_init()
221 /* Uses preallocated memory to initialize a new stack depot pool. */
258 /* Allocates a new stack in a stack depot pool. */
[all …]
|
| /openbmc/linux/kernel/ |
| H A D | stackleak.c | 3 * This code fills the used part of the kernel stack with a poison value
9 * STACKLEAK reduces the information which kernel stack leak bugs can
10 * reveal and blocks some uninitialized stack variable attacks.
43 pr_warn("stackleak: kernel stack erasing is %s\n", in stack_erasing_sysctl()
99 * Write poison to the task's stack between 'erase_low' and in __stackleak_erase()
102 * If we're running on a different stack (e.g. an entry trampoline in __stackleak_erase()
103 * stack) we can erase everything below the pt_regs at the top of the in __stackleak_erase()
104 * task stack. in __stackleak_erase()
106 * If we're running on the task stack itself, we must not clobber any in __stackleak_erase()
107 * stack used by this function and its caller. We assume that this in __stackleak_erase()
[all …]
|
| H A D | stacktrace.c | 5 * Stack trace management functions
19 * stack_trace_print - Print the entries in the stack trace
38 * stack_trace_snprint - Print the entries in the stack trace into a buffer
105 * stack_trace_save - Save a stack trace into a storage array
108 * @skipnr: Number of entries to skip at the start of the stack trace
128 * stack_trace_save_tsk - Save a task stack trace into a storage array
132 * @skipnr: Number of entries to skip at the start of the stack trace
156 * stack_trace_save_regs - Save a stack trace based on pt_regs into a storage array
160 * @skipnr: Number of entries to skip at the start of the stack trace
180 * stack_trace_save_tsk_reliable - Save task stack with verification
[all …]
|
| /openbmc/linux/security/ |
| H A D | Kconfig.hardening | 8 stack variable initializations, this warning is silenced for
38 prompt "Initialize kernel stack variables at function entry"
44 This option enables initialization of stack variables at
56 bool "no automatic stack variable initialization (weakest)"
58 Disable automatic stack variable initialization.
60 classes of uninitialized stack variable exploits
69 Zero-initialize any structures on the stack containing
71 uninitialized stack variable exploits and information
82 Zero-initialize any structures on the stack that may
85 of uninitialized stack variable exploits and information
[all …]
|
| /openbmc/linux/arch/openrisc/kernel/ |
| H A D | unwinder.c | 28 * 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, in unwind_stack() argument
67 while (!kstack_end(stack)) { in unwind_stack()
[all …]
|
| /openbmc/linux/drivers/misc/lkdtm/ |
| H A D | stackleak.c | 3 * This code tests that the current task stack is properly erased (filled
16 * Check that stackleak tracks the lowest stack pointer and erases the stack
19 * To prevent the lowest stack pointer changing during the test, IRQs are
21 * compiler will create a fixed-size stack frame for this function.
23 * Any non-inlined function may make further use of the stack, altering the
24 * lowest stack pointer and/or clobbering poison values. To avoid spurious
40 * Check that the current and lowest recorded stack pointer values fall in check_stackleak_irqoff()
41 * within the expected task stack boundaries. These tests should never in check_stackleak_irqoff()
47 pr_err("FAIL: current_stack_pointer (0x%lx) outside of task stack bounds [0x%lx..0x%lx]\n", in check_stackleak_irqoff()
54 pr_err("FAIL: current->lowest_stack (0x%lx) outside of task stack bounds [0x%lx..0x%lx]\n", in check_stackleak_irqoff()
[all …]
|
| /openbmc/libbej/src/ |
| H A D | bej_encoder_json.cpp | 13 auto stack = reinterpret_cast<std::vector<void*>*>(dataPtr); in stackPeek() local
14 if (stack->empty()) in stackPeek()
18 return stack->back(); in stackPeek()
23 auto stack = reinterpret_cast<std::vector<void*>*>(dataPtr); in stackPop() local
24 if (stack->empty()) in stackPop()
28 void* value = stack->back(); in stackPop()
29 stack->pop_back(); in stackPop()
35 auto stack = reinterpret_cast<std::vector<void*>*>(dataPtr); in stackPush() local
36 stack->emplace_back(property); in stackPush()
42 auto stack = reinterpret_cast<std::vector<uint8_t>*>(handlerContext); in getBejEncodedBuffer() local
[all …]
|
| /openbmc/linux/kernel/trace/ |
| H A D | trace_stack.c | 58 * The stack tracer looks for a maximum stack at each call from a function. It
59 * registers a callback from ftrace, and in that callback it examines the stack
60 * size. It determines the stack size from the variable passed in, which is the
62 * The stack size is calculated by the address of the local variable to the top
63 * of the current stack. If that size is smaller than the currently saved max
64 * stack size, nothing more is done.
66 * If the size of the stack is greater than the maximum recorded size, then the
70 * saving the function's local variables, the stack will look something like
73 * [ top of stack ]
80 * 31: [ do trace stack here ]
[all …]
|
| /openbmc/libbej/include/libbej/ |
| H A D | bej_encoder_json.hpp | 12 * @brief Callback for stackEmpty. Check if stack is empty
14 * @param[in] dataPtr - pointer to a valid stack of type std::vector<void*>
15 * @return true if the stack is empty.
21 * @brief Callback for stackPeek. Read the first element from the stack
23 * @param[in] dataPtr - pointer to a valid stack of type std::vector<void*>
24 * @return the value of first element in the stack
30 * @brief Callback for stackPop. Remove the top element from the stack.
32 * @param[in] dataPtr - pointer to a valid stack of type std::vector<void*>
33 * @return the value of first element in the stack
39 * @brief Callback for stackPush. Push a new element to the top of the stack.
[all …]
|
| /openbmc/linux/include/linux/sched/ |
| H A D | task_stack.h | 6 * task->stack (kernel stack) handling interfaces:
16 * When accessing the stack of a non-current task that might exit, use
22 return task->stack; in task_stack_page()
30 return (unsigned long *)((unsigned long)task->stack + THREAD_SIZE) - 1; in end_of_stack()
32 return task->stack; in end_of_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 grows up, this is the highest address.
90 void *stack = task_stack_page(current); in object_is_on_stack() local
[all …]
|