Searched full:stack (Results 1 – 25 of 298) sorted by relevance
12345678910>>...12
| /Documentation/arch/x86/ |
| 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 …]
|
| 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 …]
|
| D | entry_64.rst | 47 the IDT entries push an error code onto the stack; others don't.
48 IDT entries using the IST alternative stack mechanism need their own
49 magic to get the stack frames right. (You can find some
68 stack, from the CS of the ptregs area of the kernel stack::
88 use the faster check: the stack will be a reliable indicator of
96 stack but before we executed SWAPGS, then the only safe way to check
104 - Interrupt entry from user mode will switch off the IST stack.
|
| D | orc-unwinder.rst | 18 stack metadata validation (CONFIG_STACK_VALIDATION). After analyzing
20 stack state at each instruction address in the file and outputs that
25 correlate instruction addresses with their stack states at run time.
39 improvement across the board, and still have reliable stack traces.
82 the stack for certain optimizations. But IMO this is unlikely because
83 GCC saves the frame pointer for any unusual stack adjustments it does,
84 so I suspect we'll really only ever need to keep track of the stack
94 stack metadata validation feature, objtool already follows all code
96 generate ORC data from scratch. So it's an easy step to go from stack
113 unusual things to the stack like entry code. And even then, far fewer
[all …]
|
| D | elf_auxvec.rst | 14 allocates an alternate stack based on the kernel-provided size::
48 AT_MINSIGSTKSZ denotes the minimum stack size required by the kernel to
51 hardware configuration. It does not comprehend subsequent user-space stack
|
| /Documentation/mm/ |
| 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 cause 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 …]
|
| D | overcommit-accounting.rst | 43 The C language stack growth does an implicit mremap. If you want absolute
44 guarantees and run close to the edge you MUST mmap your stack for the
45 largest size you think you will need. For typical stack usage this does
79 * Review stack handling/building on exec
|
| D | page_owner.rst | 10 When allocation happens, information about allocation such as call stack
126 // Detailed stack
130 // Detailed stack
146 // Detailed stack
161 -s Sort by stack trace.
221 st stacktrace stack trace of the page allocation
234 st stacktrace stack trace of the page allocation
|
| /Documentation/ABI/testing/ |
| D | sysfs-ocfs2 | 38 * 'o2cb' - The classic o2cb cluster stack that ocfs2 has
62 the cluster stack in use. The contents may change
63 when all filesystems are unmounted and the cluster stack
71 of current ocfs2 cluster stack. This value is set by
72 userspace tools when bringing the cluster stack online.
74 Cluster stack names are 4 characters in length.
76 When the 'o2cb' cluster stack is used, the 'o2cb' cluster
81 cluster stack on a single line.
83 Writing a new stack name to this file changes the current
84 cluster stack unless there are mounted ocfs2 filesystems.
[all …]
|
| /Documentation/arch/x86/x86_64/ |
| D | fred.rst | 82 Stack levels
85 4 stack levels 0~3 are introduced to replace the nonreentrant IST for
86 event handling, and each stack level should be configured to use a
87 dedicated stack.
89 The current stack level could be unchanged or go higher upon FRED
91 stack. If higher, the CPU switches to a new event stack specified by
92 the MSR of the new stack level, i.e., MSR_IA32_FRED_RSP[123].
95 current stack level, causing the CPU to switch back to the stack it was
96 on before a previous event delivery that promoted the stack level.
|
| /Documentation/sound/hd-audio/ |
| D | models.rst | 7 3stack
9 3stack-digout
11 5stack
13 5stack-digout
15 6stack
17 6stack-digout
19 6stack-automute
430 3stack
431 3-stack mode
432 3stack-automute
[all …]
|
| /Documentation/livepatch/ |
| D | reliable-stacktrace.rst | 46 the stack or other unwind state is corrupt or otherwise unreliable. The
58 functions manipulate the stack pointer in a limited way, or that all
80 * Stack or frame pointer corruption.
93 * At a specific location on a stack expected for a kernel entry point.
95 * On a specific stack expected for a kernel entry point (e.g. if the
121 using '__kernel_text_address()'. Checking for this also helps to detect stack
135 At function call boundaries the stack and other unwind state is expected to be
143 If an interrupt or other exception is taken while the stack or other unwind
203 While the traced function runs its return address on the stack points to
209 return address on the stack, though the original return address is still stored
[all …]
|
| /Documentation/security/ |
| D | self-protection.rst | 147 understood is that of the stack buffer overflow in which the return
148 address stored on the stack is overwritten. Many other examples of this
151 Stack buffer overflow
154 The classic stack buffer overflow involves writing past the expected end
155 of a variable stored on the stack, ultimately writing a controlled value
156 to the stack frame's stored return address. The most widely used defense
157 is the presence of a stack canary between the stack variables and the
161 Stack depth overflow
165 kernel to consume stack memory with deep function calls or large stack
167 the kernel's preallocated stack space and into sensitive structures. Two
[all …]
|
| /Documentation/bpf/ |
| D | map_queue_stack.rst | 38 An element ``value`` can be added to a queue or stack using the
41 when the queue or stack is full, the oldest element will be removed to
52 This helper fetches an element ``value`` from a queue or stack without
64 stack. Returns ``0`` on success, or negative error in case of failure.
77 A userspace program can push ``value`` onto a queue or stack using libbpf's
90 A userspace program can peek at the ``value`` at the head of a queue or stack
102 A userspace program can pop a ``value`` from the head of a queue or stack using
|
| D | verifier.rst | 14 registers and stack.
72 stack bounds, which are [-MAX_BPF_STACK, 0). In this example offset is 8,
75 The verifier will allow eBPF program to read data from stack only after
86 and R10 - 4 is within stack bounds, there were no stores into that location.
114 the range of possible values in each register and also in each stack slot.
315 Pruning considers not only the registers but also the stack (and any spilled
325 register and stack slot. The basic idea is to track which registers and stack
327 program exit is reached. Registers and stack slots that were never used could be
380 struct bpf_stack_state *stack;
392 * ``REG_LIVE_WRITTEN`` means that the value of the register (or stack slot) is
[all …]
|
| /Documentation/networking/ |
| D | tls-offload.rst | 26 This mode integrates best with the kernel stack and is described in detail
30 NIC driver and firmware replace the kernel networking stack
32 making use of the Linux networking stack for example any firewalling
44 point on the TCP stack proceeds as normal.
56 :c:type:`struct sk_buff <sk_buff>`. The packets reach the TCP stack and
68 Layers of Kernel TLS stack
110 After TX state is installed, the stack guarantees that the first segment
123 In RX direction local networking stack has little control over the segmentation,
156 The kernel stack performs record framing reserving space for the authentication
181 the record framing unmodified, the stack takes care of record decapsulation.
[all …]
|
| D | snmp_counter.rst | 85 This counter means the packet is dropped when the IP stack receives a
353 an old kernel, the TCP stack has different behavior when TCP accept
354 queue is full. On the old kernel, TCP stack won't drop the SYN, it
356 stack will keep the socket in the TCP half-open queue. As it is in the
357 half open queue, TCP stack will send SYN+ACK on an exponential backoff
358 timer, after client replies ACK, TCP stack checks whether the accept
390 When the TCP stack wants to retransmit a packet, and finds that packet
392 stack would give up the retransmission and update this counter. It
519 Linux kernel TCP stack. By configuring the TCP_LINGER2 socket option,
570 the kernel TCP stack would use SACK, or kernel would use fast
[all …]
|
| D | xfrm_device.rst | 20 Device interface allows NIC drivers to offer to the stack access to the
84 stack's XFRM subsystem. Additionally, the feature bits NETIF_F_HW_ESP and
124 When the network stack is preparing an IPsec packet for an SA that has
140 The stack has already inserted the appropriate IPsec headers in the
149 the stack in xfrm_input().
176 HW adds and deletes XFRM headers. So in RX path, XFRM stack is bypassed if HW
188 As a netdev is set to DOWN the XFRM stack's netdev listener will call
|
| D | ieee802154.rst | 15 of the IEEE 802.15.4 and 6LoWPAN protocols. IEEE 802.15.4 is a stack
18 The stack is composed of three main parts:
21 the generic Linux networking stack to transfer IEEE 802.15.4 data
97 The MAC is the middle layer in the IEEE 802.15.4 Linux stack. This moment it
101 stack interface for network sniffers (e.g. WireShark).
113 provides a possibility to test and debug the stack without usage of real hardware.
|
| /Documentation/gpu/ |
| D | introduction.rst | 17 [Insert diagram of typical DRM stack here]
143 could face when working on the graphics user-space stack, etc. For this reason,
144 the learning material covers many aspects of the Linux graphics stack. From an
155 * `An Overview of the Linux and Userspace Graphics Stack <https://www.youtube.com/watch?v=wjAJmqwg4…
167 * `The Linux graphics stack in a nutshell, part 1 <https://lwn.net/Articles/955376/>`_ - Thomas Zim…
168 * `The Linux graphics stack in a nutshell, part 2 <https://lwn.net/Articles/955708/>`_ - Thomas Zim…
169 * `Understanding the Linux Graphics Stack <https://bootlin.com/doc/training/graphics/graphics-slide…
171 * `Linux graphic stack <https://studiopixl.com/2017-05-13/linux-graphic-stack-an-overview>`_ - Nath…
175 …tion to the Linux graphics stack <https://blogs.igalia.com/itoral/2014/07/29/a-brief-introduction-…
176 * `The Linux Graphics Stack <https://blog.mecheye.net/2012/06/the-linux-graphics-stack/>`_ - Jasper…
|
| /Documentation/core-api/ |
| D | debug-objects.rst | 34 debugging with serial consoles and stack trace transcripts from the
57 of errors are printk'ed including a full stack trace.
85 on the callers stack. If it is on the callers stack then a limited
86 number of warnings including a full stack trace is printk'ed. The
94 object which resides on the stack is called.
108 the callers stack.
110 An object which is on the stack must be removed from the tracker by
|
| /Documentation/dev-tools/ |
| D | kasan.rst | 71 stack, and global memory.
73 Software Tag-Based KASAN supports slab, page_alloc, vmalloc, and stack memory.
96 To include alloc and free stack traces of affected slab objects into reports,
97 enable ``CONFIG_STACKTRACE``. To include alloc and free stack traces of affected
121 modes below) support altering stack trace collection behavior:
123 - ``kasan.stacktrace=off`` or ``=on`` disables or enables alloc and free stack
126 in the stack ring (default: ``32768``).
243 caused it. It is followed by a stack trace of the bad access, a stack trace of
245 and a stack trace of where the object was freed (in case of a use-after-free
275 Generic KASAN also reports up to two auxiliary call stack traces. These stack
[all …]
|
| /Documentation/arch/powerpc/ |
| D | transactional_memory.rst | 153 the stack. It's possible that the stack has moved back up after the tbegin.
155 returns before a tend. In this case, the stack is part of the checkpointed
158 stack pointer will be back at the tbegin but our in memory stack won't be valid
162 the stack pointer from the checkpointed state, rather than the speculated
164 written below the stack required for the rollback. The transaction is aborted
169 normal/non-checkpointed stack pointer.
|
| /Documentation/trace/ |
| D | kprobetrace.rst | 51 $stackN : Fetch Nth entry of stack (N >= 0)
52 $stack : Fetch stack address.
67 the stack. But this only support the arguments via registers.
98 apply it to registers/stack-entries etc. (for example, '$stack1:x8[8]' is
99 wrong, but '+8($stack):x8[8]' is OK.)
189 p:myprobe do_sys_open dfd=%ax filename=%dx flags=%cx mode=+4($stack)
193 p:myprobe,do_sys_open,dfd=%ax,filename=%dx,flags=%cx,mode=+4($stack)
201 …echo 'p:myprobe do_sys_open dfd=%ax filename=%dx flags=%cx mode=+4($stack)' > /sys/kernel/tracing/…
204 1st to 4th arguments as "myprobe" event. Note, which register/stack entry is
|
| /Documentation/networking/caif/ |
| D | linux_caif.rst | 67 It implements the CAIF protocol stack in a layered approach, where
101 Stack and provides a Client interface for adding Link-Layer and
102 Driver interfaces on top of the CAIF Stack.
181 'struct cflayer', just like the CAIF Core protocol stack.
183 'struct cflayer', just like the rest of the CAIF stack. In this way, transmit and
|
12345678910>>...12