| /kernel/linux/linux-6.6/Documentation/bpf/ |
| D | graph_ds_impl.rst | 2 BPF Graph Data Structures
6 structures (linked_list, rbtree), with particular focus on the verifier's
7 implementation of semantics specific to those data structures.
14 these graph data structures. **No guarantees** of stability for either
24 The BPF map API has historically been the main way to expose data structures
25 of various types for use within BPF programs. Some data structures fit naturally
27 interacting with the latter group of data structures can be hard to parse
32 BPF allocator, it is now possible to implement BPF data structures whose API
35 Two such data structures - linked_list and rbtree - have many verification
41 structures.
[all …]
|
| /kernel/linux/linux-5.10/Documentation/userspace-api/ |
| D | unshare.rst | 34 requiring additional data structures and mechanisms in the kernel. The
188 appropriate process context structures, populates it with values from
189 the current shared version, associates newly duplicated structures
197 before associating newly duplicated context structures
199 2) unshare() has to allocate and duplicate all context structures
201 current task and releasing older shared structures. Failure
214 appropriate context structures and then associate them with the
225 are new context structures then lock the current task structure,
226 associate new context structures with the current task structure,
229 4) Appropriately release older, shared, context structures.
[all …]
|
| /kernel/linux/linux-6.6/Documentation/userspace-api/ |
| D | unshare.rst | 34 requiring additional data structures and mechanisms in the kernel. The
188 appropriate process context structures, populates it with values from
189 the current shared version, associates newly duplicated structures
197 before associating newly duplicated context structures
199 2) unshare() has to allocate and duplicate all context structures
201 current task and releasing older shared structures. Failure
214 appropriate context structures and then associate them with the
225 are new context structures then lock the current task structure,
226 associate new context structures with the current task structure,
229 4) Appropriately release older, shared, context structures.
[all …]
|
| /kernel/linux/linux-5.10/Documentation/RCU/Design/Data-Structures/ |
| D | Data-Structures.rst | 2 A Tour Through TREE_RCU's Data Structures [LWN.net]
12 This document describes RCU's major data structures and their relationship
19 data structures maintain the state in such a way as to allow RCU readers
28 of ``rcu_node`` structures. Each leaf node of the ``rcu_node`` tree has up
29 to 16 ``rcu_data`` structures associated with it, so that there are
30 ``NR_CPUS`` number of ``rcu_data`` structures, one for each possible CPU.
42 Quiescent states are recorded by the per-CPU ``rcu_data`` structures,
44 structures.
66 | ``rcu_node`` structures than further up the tree. Therefore, if the |
67 | leaf ``rcu_node`` structures have fanout of 64, the contention on |
[all …]
|
| /kernel/linux/linux-6.6/Documentation/RCU/Design/Data-Structures/ |
| D | Data-Structures.rst | 2 A Tour Through TREE_RCU's Data Structures [LWN.net]
12 This document describes RCU's major data structures and their relationship
19 data structures maintain the state in such a way as to allow RCU readers
28 of ``rcu_node`` structures. Each leaf node of the ``rcu_node`` tree has up
29 to 16 ``rcu_data`` structures associated with it, so that there are
30 ``NR_CPUS`` number of ``rcu_data`` structures, one for each possible CPU.
42 Quiescent states are recorded by the per-CPU ``rcu_data`` structures,
44 structures.
66 | ``rcu_node`` structures than further up the tree. Therefore, if the |
67 | leaf ``rcu_node`` structures have fanout of 64, the contention on |
[all …]
|
| /kernel/linux/linux-6.6/Documentation/driver-api/ |
| D | ioctl.rst | 55 Some subsystems use version numbers in data structures to overload
89 incompatible definitions of these structures in user space after the
93 in other data structures when separate second/nanosecond values are
119 As long as all the rules for data structures are followed, this is as
141 are pointers to compatible data structures.
146 Compatible data structures have the same layout on all architectures,
151 data structures. Fixed-length replacements are ``__s32``, ``__u32``,
174 To avoid this problem, all structures should have their members
179 * On ARM OABI user space, structures are padded to multiples of 32-bit,
203 implicit padding in data structures. Where there is implicit padding
|
| /kernel/linux/linux-5.10/Documentation/driver-api/ |
| D | ioctl.rst | 55 Some subsystems use version numbers in data structures to overload
89 incompatible definitions of these structures in user space after the
93 in other data structures when separate second/nanosecond values are
119 As long as all the rules for data structures are followed, this is as
141 are pointers to compatible data structures.
146 Compatible data structures have the same layout on all architectures,
151 data structures. Fixed-length replacements are ``__s32``, ``__u32``,
174 To avoid this problem, all structures should have their members
179 * On ARM OABI user space, structures are padded to multiples of 32-bit,
203 implicit padding in data structures. Where there is implicit padding
|
| D | generic-counter.rst | 244 provides several core data structures, function prototypes, and macros
257 Counter Signals via counter_signal structures. These Signals should
262 Counter Counts may be allocated via counter_count structures, and
264 counter_synapse structures. Associated counter_synapse structures are
266 respective counter_count structure. These counter_count structures are
284 and counter_signal_ext structures. In these cases, the
287 counter_count_ext and counter_signal_ext structures allow for auxiliary
364 structures that are passed in.
|
| /kernel/linux/linux-6.6/security/ |
| D | Kconfig.hardening | 69 Zero-initialize any structures on the stack containing
82 Zero-initialize any structures on the stack that may
282 menu "Hardening of kernel data structures"
298 data corruption in kernel memory structures when they get checked
312 prompt "Randomize layout of sensitive kernel structures"
316 If you enable this, the layouts of structures that are entirely
318 __no_randomize_layout), or structures that have been explicitly
346 structures as much as possible, which may have both a
361 Randomization of sensitive kernel structures will make a
364 in structures. This reduces the performance hit of RANDSTRUCT
|
| /kernel/linux/linux-5.10/fs/xfs/libxfs/ |
| D | xfs_da_format.h | 45 * ignore the differences in the rest of the structures.
105 * Note: many node blocks structures and constants are shared with the attr
117 * is in the block header and dirent formats. In many cases the v3 structures
136 * offsets of all the structures inside the blocks are different.
198 * structures. Due the different inode number storage size and the variable
248 * Data block structures.
263 * As all the entries are variable size structures the accessors below should
267 * most structures are also used for the combined data/freespace "block"
307 * directory block structures. This will be used in several structures.
309 * structures so we determine how to decode them just by the magic number.
[all …]
|
| /kernel/linux/linux-6.6/Documentation/process/ |
| D | magic-number.rst | 8 file, since it is best if the magic numbers used by various structures
11 It is a **very** good idea to protect kernel data structures with magic
15 passing pointers to structures via a void * pointer. The tty code,
17 discipline-specific structures back and forth.
30 structures following the array have been overwritten. Using this
|
| /kernel/linux/linux-6.6/fs/xfs/libxfs/ |
| D | xfs_da_format.h | 45 * ignore the differences in the rest of the structures.
105 * Note: many node blocks structures and constants are shared with the attr
117 * is in the block header and dirent formats. In many cases the v3 structures
136 * offsets of all the structures inside the blocks are different.
198 * structures. Due the different inode number storage size and the variable
248 * Data block structures.
263 * As all the entries are variable size structures the accessors below should
267 * most structures are also used for the combined data/freespace "block"
308 * directory block structures. This will be used in several structures.
310 * structures so we determine how to decode them just by the magic number.
[all …]
|
| /kernel/linux/linux-6.6/Documentation/admin-guide/device-mapper/ |
| D | persistent-data.rst | 10 different targets were rolling their own data structures, for example:
17 Maintaining these data structures takes a lot of work, so if possible
62 On-disk data structures that keep track of reference counts of blocks.
69 The data structures
|
| /kernel/linux/linux-5.10/Documentation/admin-guide/device-mapper/ |
| D | persistent-data.rst | 10 different targets were rolling their own data structures, for example:
17 Maintaining these data structures takes a lot of work, so if possible
62 On-disk data structures that keep track of reference counts of blocks.
69 The data structures
|
| /kernel/linux/linux-5.10/scripts/gcc-plugins/ |
| D | Kconfig | 64 bool "Randomize layout of sensitive kernel structures"
67 If you say Y here, the layouts of structures that are entirely
69 __no_randomize_layout), or structures that have been explicitly
100 in structures. This reduces the performance hit of RANDSTRUCT
|
| /kernel/linux/linux-5.10/Documentation/core-api/ |
| D | boot-time-mm.rst | 7 allocate memory for various data structures, for instance for the
30 Functions and structures
33 Here is the description of memblock data structures, functions and
|
| /kernel/linux/linux-6.6/Documentation/core-api/ |
| D | boot-time-mm.rst | 7 allocate memory for various data structures, for instance for the
30 Functions and structures
33 Here is the description of memblock data structures, functions and
|
| /kernel/linux/linux-5.10/Documentation/userspace-api/media/v4l/ |
| D | pixfmt-v4l2-mplane.rst | 4 Multi-planar format structures
7 The struct :c:type:`v4l2_plane_pix_format` structures define size
11 array of struct :c:type:`v4l2_plane_pix_format` structures,
86 - An array of structures describing format of each plane this pixel
|
| /kernel/linux/linux-6.6/Documentation/userspace-api/media/v4l/ |
| D | pixfmt-v4l2-mplane.rst | 4 Multi-planar format structures
7 The struct :c:type:`v4l2_plane_pix_format` structures define size
11 array of struct :c:type:`v4l2_plane_pix_format` structures,
86 - An array of structures describing format of each plane this pixel
|
| /kernel/linux/linux-5.10/fs/xfs/ |
| D | xfs_ondisk.h | 25 /* ag/file structures */ in xfs_check_ondisk_structs()
118 /* log structures */ in xfs_check_ondisk_structs()
137 * The v5 superblock format extended several v4 header structures with in xfs_check_ondisk_structs()
139 * superblocks, it's important that the v5 structures place original v4 in xfs_check_ondisk_structs()
144 * The following checks ensure that various v5 data structures place the in xfs_check_ondisk_structs()
|
| /kernel/linux/linux-6.6/fs/xfs/ |
| D | xfs_ondisk.h | 25 /* ag/file structures */ in xfs_check_ondisk_structs()
119 /* log structures */ in xfs_check_ondisk_structs()
155 * The v5 superblock format extended several v4 header structures with in xfs_check_ondisk_structs()
157 * superblocks, it's important that the v5 structures place original v4 in xfs_check_ondisk_structs()
162 * The following checks ensure that various v5 data structures place the in xfs_check_ondisk_structs()
|
| /kernel/linux/linux-5.10/Documentation/security/ |
| D | IMA-templates.rst | 25 definition of two new data structures: a template descriptor, to determine
29 Managing templates with these structures is very simple. To support
36 by translating the format into an array of template fields structures taken
53 method for each item of the array of template fields structures.
|
| /kernel/linux/linux-5.10/Documentation/filesystems/ext4/ |
| D | checksums.rst | 7 and jbd2 data structures. The associated feature flag is metadata\_csum.
10 structures did not have space to fit a full 32-bit checksum, so only the
13 structures. However, existing 32-bit filesystems cannot be extended to
|
| /kernel/linux/linux-6.6/Documentation/filesystems/ext4/ |
| D | checksums.rst | 7 and jbd2 data structures. The associated feature flag is metadata_csum.
10 structures did not have space to fit a full 32-bit checksum, so only the
13 structures. However, existing 32-bit filesystems cannot be extended to
|
| /kernel/linux/linux-6.6/Documentation/driver-api/tty/ |
| D | index.rst | 10 TTY structures
13 There are several major TTY structures. Every TTY device in a system has a
29 In-detail description of the named TTY structures is in separate documents:
|