| /linux-6.12.1/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 …]
|
| /linux-6.12.1/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 …]
|
| /linux-6.12.1/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 …]
|
| /linux-6.12.1/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
|
| /linux-6.12.1/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
|
| /linux-6.12.1/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.
209 * structures. Due the different inode number storage size and the variable
259 * Data block structures.
274 * As all the entries are variable size structures the accessors below should
278 * most structures are also used for the combined data/freespace "block"
319 * directory block structures. This will be used in several structures.
321 * structures so we determine how to decode them just by the magic number.
[all …]
|
| D | xfs_ondisk.h | 25 /* ag/file structures */ in xfs_check_ondisk_structs()
75 /* realtime structures */ in xfs_check_ondisk_structs()
125 /* log structures */ in xfs_check_ondisk_structs()
166 * The v5 superblock format extended several v4 header structures with in xfs_check_ondisk_structs()
168 * superblocks, it's important that the v5 structures place original v4 in xfs_check_ondisk_structs()
173 * The following checks ensure that various v5 data structures place the in xfs_check_ondisk_structs()
|
| /linux-6.12.1/Documentation/staging/ |
| 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
|
| /linux-6.12.1/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
|
| /linux-6.12.1/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
|
| /linux-6.12.1/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
|
| D | planar-apis.rst | 19 Some of the V4L2 API calls and structures are interpreted differently,
35 in multi-planar API structures), while the single-planar API cannot
48 New structures for describing multi-planar formats are added: struct
|
| /linux-6.12.1/arch/mips/include/asm/sn/ |
| D | klconfig.h | 15 * The KLCONFIG structures store info about the various BOARDs found
23 * will depend on the format of the data structures in this file. In
74 #define SIZE_PAD 4096 /* 4k padding for structures */
114 /* Structures to manage various data storage areas */
223 * There are 2 different structures to represent these boards -
224 * lboard - Local board, rboard - remote board. These 2 structures
291 * Like BOARD structures, REMOTE ERRINFO structures can be built locally
296 * manipulating the structures, is that, the NODE number information should
301 * Note that these structures do not provide much info about connectivity.
306 * The data structures below define the above concepts.
[all …]
|
| /linux-6.12.1/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
|
| /linux-6.12.1/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:
|
| /linux-6.12.1/drivers/net/ethernet/brocade/bna/ |
| D | bfi_cna.h | 82 /* Data structures */
138 /* @brief mailbox command structures from host to firmware */
145 /* @brief mailbox message structures from firmware to host */
|
| /linux-6.12.1/Documentation/userspace-api/netlink/ |
| D | genetlink-legacy.rst | 85 genetlink's policy dumps create the following structures::
183 Structures section in Other quirks
186 Legacy families can define C structures both to be used as the contents of
187 an attribute and as a fixed message header. Structures are defined in
200 Note that structures defined in YAML are implicitly packed according to C
|
| /linux-6.12.1/Documentation/locking/ |
| D | robust-futex-ABI.rst | 48 kernel, then it can actually have two such structures - one using 32 bit
103 larger, user level locking structures, one per lock. The kernel
123 There may exist thousands of futex lock structures in a threads shared
124 memory, on various data structures, at a given point in time. Only those
125 lock structures for locks currently held by that thread should be on
|
| D | pi-futex.rst | 35 lockless structures are rather the exception than the norm - the current
36 ratio of lockless vs. locky code for shared data structures is somewhere
39 I.e. critical RT apps often choose lock structures to protect critical
40 data structures, instead of lockless algorithms. Furthermore, there are
|
| /linux-6.12.1/drivers/scsi/mpt3sas/ |
| D | mpt3sas_trigger_diag.h | 46 /* Diagnostic Trigger Configuration Data Structures */
104 * @ValidEntries: Number of _SL_WH_EVENT_TRIGGER_T structures contained in this
138 * @ValidEntries: Number of _SL_WH_SCSI_TRIGGER_T structures contained in this
168 * @ValidEntries: Number of _SL_WH_MPI_TRIGGER_T structures contained in this
|
| /linux-6.12.1/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.
|
| /linux-6.12.1/net/can/ |
| D | af_can.h | 22 * The provided data structures and external interfaces from this code
49 /* af_can rx dispatcher structures */
63 /* statistic structures */
|
| /linux-6.12.1/samples/livepatch/ |
| D | livepatch-shadow-fix2.c | 13 * structures through a shadow variable. The livepatch patches a
14 * routine that periodically inspects data structures, incrementing a
46 * Patch: handle in-flight dummy structures, if they do not in livepatch_fix2_dummy_check()
|
| /linux-6.12.1/Documentation/RCU/ |
| D | index.rst | 30 Design/Data-Structures/Data-Structures
|
| /linux-6.12.1/Documentation/mm/ |
| D | physical_memory.rst | 9 chapter describes the structures used to manage physical memory in a running
26 For NUMA architectures, the node structures are allocated by the architecture
27 specific code early during boot. Usually, these structures are allocated
150 structures. The actual structures are allocated early during boot when
157 Along with the node structures, kernel maintains an array of ``nodemask_t``
220 core memory management structures.
|