/linux/Documentation/bpf/ |
H A 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/Documentation/RCU/Design/Data-Structures/ |
H A 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/Documentation/userspace-api/ |
H A 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/Documentation/driver-api/ |
H A 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/security/ |
H A D | Kconfig.hardening | 69 Zero-initialize any structures on the stack containing 82 Zero-initialize any structures on the stack that may 283 menu "Hardening of kernel data structures" 299 data corruption in kernel memory structures when they get checked 313 prompt "Randomize layout of sensitive kernel structures" 317 If you enable this, the layouts of structures that are entirely 319 __no_randomize_layout), or structures that have been explicitly 347 structures as much as possible, which may have both a 362 Randomization of sensitive kernel structures will make a 365 in structures. This reduces the performance hit of RANDSTRUCT
|
/linux/fs/xfs/libxfs/ |
H A D | xfs_ondisk.h | 29 /* file structures */ in xfs_check_ondisk_structs() 81 /* realtime structures */ in xfs_check_ondisk_structs() 136 /* ondisk dir/attr structures from xfs/122 */ in xfs_check_ondisk_structs() 150 /* log structures */ in xfs_check_ondisk_structs() 185 /* ondisk log structures from xfs/122 */ in xfs_check_ondisk_structs() 196 * The v5 superblock format extended several v4 header structures with in xfs_check_ondisk_structs() 198 * superblocks, it's important that the v5 structures place original v4 in xfs_check_ondisk_structs() 203 * The following checks ensure that various v5 data structures place the in xfs_check_ondisk_structs()
|
/linux/Documentation/admin-guide/device-mapper/ |
H A 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/Documentation/userspace-api/media/v4l/ |
H A 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
|
H A 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/Documentation/core-api/ |
H A 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/arch/mips/include/asm/sn/ |
H A 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/Documentation/driver-api/tty/ |
H A 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/Documentation/filesystems/ext4/ |
H A 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/Documentation/userspace-api/netlink/ |
H A 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/Documentation/locking/ |
H A 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
|
H A 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/drivers/net/ethernet/brocade/bna/ |
H A 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/Documentation/security/ |
H A 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.
|
H A D | self-protection.rst | 6 structures within the Linux kernel to protect against security flaws in 75 tables, file/network/etc operation structures, etc). The number of these 145 There are many memory structures in the kernel that are regularly abused 167 the kernel's preallocated stack space and into sensitive structures. Two 175 The structures used to track heap free lists can be sanity-checked during 259 structures, attacks must either be tuned to known kernel builds or expose 267 Since the locations of sensitive structures are the primary target for
|
/linux/drivers/scsi/mpt3sas/ |
H A 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/tools/crypto/ccp/ |
H A D | test_dbc.py | 79 """tries to call get_nonce ioctl with invalid data structures""" 88 """tries to call set_uid ioctl with invalid data structures""" 97 """tries to call set_uid ioctl with invalid data structures""" 106 """tries to call param ioctl with invalid data structures""" 114 """tries to call the DBC ioctl with invalid data structures"""
|
/linux/samples/livepatch/ |
H A 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/net/can/ |
H A 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/fs/xfs/ |
H A D | xfs_ioctl32.h | 12 * on 32-bit arches, ioctl argument structures may have different sizes 13 * and/or alignment. We define compat structures which match the 16 * xfs_ioctl32.c contains routines to copy these structures in and out. 177 /* These growfs input structures have padding on the end, so must translate */
|
/linux/Documentation/RCU/ |
H A D | index.rst | 30 Design/Data-Structures/Data-Structures
|