| /kernel/linux/linux-5.10/sound/firewire/dice/ |
| D | dice-transaction.c | 273 __be32 *pointers; in get_subaddrs() local
279 pointers = kmalloc_array(ARRAY_SIZE(min_values), sizeof(__be32), in get_subaddrs()
281 if (pointers == NULL) in get_subaddrs()
290 DICE_PRIVATE_SPACE, pointers, in get_subaddrs()
296 data = be32_to_cpu(pointers[i]); in get_subaddrs()
303 if (be32_to_cpu(pointers[1]) > 0x18) { in get_subaddrs()
310 be32_to_cpu(pointers[0]) * 4 + GLOBAL_VERSION, in get_subaddrs()
328 dice->global_offset = be32_to_cpu(pointers[0]) * 4; in get_subaddrs()
329 dice->tx_offset = be32_to_cpu(pointers[2]) * 4; in get_subaddrs()
330 dice->rx_offset = be32_to_cpu(pointers[4]) * 4; in get_subaddrs()
[all …]
|
| D | dice-extension.c | 142 __be32 *pointers; in snd_dice_detect_extension_formats() local
147 pointers = kmalloc_array(9, sizeof(__be32) * 2, GFP_KERNEL); in snd_dice_detect_extension_formats()
148 if (pointers == NULL) in snd_dice_detect_extension_formats()
152 DICE_EXT_APP_SPACE, pointers, in snd_dice_detect_extension_formats()
162 if (pointers[i * 2] == pointers[j * 2]) { in snd_dice_detect_extension_formats()
170 section_addr = DICE_EXT_APP_SPACE + be32_to_cpu(pointers[12]) * 4; in snd_dice_detect_extension_formats()
173 kfree(pointers); in snd_dice_detect_extension_formats()
|
| /kernel/linux/linux-4.19/sound/firewire/dice/ |
| D | dice-transaction.c | 274 __be32 *pointers; in get_subaddrs() local
280 pointers = kmalloc_array(ARRAY_SIZE(min_values), sizeof(__be32), in get_subaddrs()
282 if (pointers == NULL) in get_subaddrs()
291 DICE_PRIVATE_SPACE, pointers, in get_subaddrs()
297 data = be32_to_cpu(pointers[i]); in get_subaddrs()
304 if (be32_to_cpu(pointers[1]) > 0x18) { in get_subaddrs()
311 be32_to_cpu(pointers[0]) * 4 + GLOBAL_VERSION, in get_subaddrs()
329 dice->global_offset = be32_to_cpu(pointers[0]) * 4; in get_subaddrs()
330 dice->tx_offset = be32_to_cpu(pointers[2]) * 4; in get_subaddrs()
331 dice->rx_offset = be32_to_cpu(pointers[4]) * 4; in get_subaddrs()
[all …]
|
| D | dice-extension.c | 142 __be32 *pointers; in snd_dice_detect_extension_formats() local
147 pointers = kmalloc_array(9, sizeof(__be32) * 2, GFP_KERNEL); in snd_dice_detect_extension_formats()
148 if (pointers == NULL) in snd_dice_detect_extension_formats()
152 DICE_EXT_APP_SPACE, pointers, in snd_dice_detect_extension_formats()
162 if (pointers[i * 2] == pointers[j * 2]) { in snd_dice_detect_extension_formats()
170 section_addr = DICE_EXT_APP_SPACE + be32_to_cpu(pointers[12]) * 4; in snd_dice_detect_extension_formats()
173 kfree(pointers); in snd_dice_detect_extension_formats()
|
| /kernel/linux/linux-5.10/Documentation/arm64/ |
| D | tagged-address-abi.rst | 17 userspace (EL0) to perform memory accesses through 64-bit pointers with
19 syscall ABI that allows userspace to pass certain tagged pointers to
48 tagged pointers in this context is allowed with these exceptions:
55 incorrectly accept valid tagged pointers for the ``brk()``,
65 incorrectly accept valid tagged pointers for this system call.
101 - The syscall behaviour is undefined for invalid tagged pointers: it may
109 A definition of the meaning of tagged pointers on AArch64 can be found
110 in Documentation/arm64/tagged-pointers.rst.
118 - ``prctl()`` other than pointers to user data either passed directly or
121 - ``ioctl()`` other than pointers to user data either passed directly or
[all …]
|
| /kernel/linux/linux-5.10/drivers/staging/media/atomisp/pci/isp/kernels/sdis/sdis_2/ |
| D | ia_css_sdis2_types.h | 30 /* DVS 2.0 Coefficient types. This structure contains 4 pointers to
48 hor_coefs; /** struct with pointers that contain the horizontal coefficients */
50 ver_coefs; /** struct with pointers that contain the vertical coefficients */
53 /* DVS 2.0 Statistic types. This structure contains 4 pointers to
71 hor_prod; /** struct with pointers that contain the horizontal statistics */
73 ver_prod; /** struct with pointers that contain the vertical statistics */
|
| /kernel/linux/linux-4.19/Documentation/filesystems/ |
| D | sysv-fs.txt | 83 of limited size, and every now and then a free block contains pointers
85 contains pointers and so on. The list terminates with a "block number"
161 1 indirect block (pointers to blocks)
162 1 double-indirect block (pointer to pointers to blocks)
165 1 indirect block (pointers to blocks)
166 1 double-indirect block (pointer to pointers to blocks)
167 1 triple-indirect block (pointer to pointers to pointers to blocks)
|
| D | qnx6.txt | 54 addressing block holds up to blocksize / 4 bytes pointers to data blocks.
58 Unused block pointers are always set to ~0 - regardless of root node,
77 The inode structure contains pointers to the filesystem blocks which contain
85 There are also pointers to the first 16 blocks, if the object data can be
107 starting with the superblock longfilename root node pointers.
117 no block pointers and the directory file record pointing to the target file
|
| /kernel/linux/linux-5.10/drivers/net/ethernet/intel/fm10k/ |
| D | fm10k_tlv.c | 32 * pointers.
40 /* verify pointers are not NULL */ in fm10k_tlv_attr_put_null_string()
82 * with a valid pointers.
88 /* verify pointers are not NULL */ in fm10k_tlv_attr_get_null_string()
110 * valid pointers.
118 /* verify pointers are not NULL */ in fm10k_tlv_attr_put_mac_vlan()
147 * if provided with a valid pointers.
151 /* verify pointers are not NULL */ in fm10k_tlv_attr_get_mac_vlan()
170 * valid pointers.
174 /* verify pointers are not NULL */ in fm10k_tlv_attr_put_bool()
[all …]
|
| /kernel/linux/linux-4.19/drivers/net/ethernet/intel/fm10k/ |
| D | fm10k_tlv.c | 32 * pointers.
40 /* verify pointers are not NULL */ in fm10k_tlv_attr_put_null_string()
82 * with a valid pointers.
88 /* verify pointers are not NULL */ in fm10k_tlv_attr_get_null_string()
110 * valid pointers.
118 /* verify pointers are not NULL */ in fm10k_tlv_attr_put_mac_vlan()
147 * if provided with a valid pointers.
151 /* verify pointers are not NULL */ in fm10k_tlv_attr_get_mac_vlan()
170 * valid pointers.
174 /* verify pointers are not NULL */ in fm10k_tlv_attr_put_bool()
[all …]
|
| /kernel/linux/linux-5.10/Documentation/filesystems/ |
| D | sysv-fs.rst | 114 of limited size, and every now and then a free block contains pointers
116 contains pointers and so on. The list terminates with a "block number"
214 - 1 indirect block (pointers to blocks)
215 - 1 double-indirect block (pointer to pointers to blocks)
220 - 1 indirect block (pointers to blocks)
221 - 1 double-indirect block (pointer to pointers to blocks)
222 - 1 triple-indirect block (pointer to pointers to pointers to blocks)
|
| D | qnx6.rst | 61 addressing block holds up to blocksize / 4 bytes pointers to data blocks.
65 Unused block pointers are always set to ~0 - regardless of root node,
86 The inode structure contains pointers to the filesystem blocks which contain
94 There are also pointers to the first 16 blocks, if the object data can be
122 starting with the superblock longfilename root node pointers.
133 no block pointers and the directory file record pointing to the target file
|
| /kernel/linux/linux-5.10/Documentation/core-api/ |
| D | printk-formats.rst | 61 pointers of different types.
71 Plain Pointers
78 Pointers printed without a specifier extension (i.e unadorned %p) are
84 Error Pointers
91 For printing error pointers (i.e. a pointer for which IS_ERR() is true)
96 Symbols/Function Pointers
117 Probed Pointers from BPF / tracing
131 Kernel Pointers
138 For printing kernel pointers which should be hidden from unprivileged
149 For printing pointers when you *really* want to print the address. Please
[all …]
|
| D | assoc_array.rst | 11 1. Objects are opaque pointers. The implementation does not care where they
16 Pointers to objects _must_ be zero in the least significant bit.
52 pack leaf object pointers into spare space in the node rather than making an
187 pointers internally.
340 can contain mixtures of leaves and metadata pointers.
434 pointers - even if some of those leaves would like to be in the same slot.
436 A node can contain a heterogeneous mix of leaves and metadata pointers.
437 Metadata pointers must be in the slots that match their subdivisions of key
477 Each node has a maximum capacity of 16 leaves and metadata pointers. If the
523 new layout until we follow the back pointers - at which point we've
[all …]
|
| /kernel/linux/linux-5.10/fs/reiserfs/ |
| D | ibalance.c | 122 * Insert count node pointers into buffer cur before position to + 1.
124 * Items and node pointers are specified by inserted and bh respectively.
202 * Delete del_num items and node pointers from buffer cur starting from
203 * the first_i'th item and first_p'th pointers respectively.
221 "no so many pointers (%d), only (%d) or " in internal_delete_pointers_items()
276 /* delete n node pointers and items starting from given position */
284 * delete n pointers starting from `from' position in CUR; in internal_delete_childs()
291 * copy cpy_num node pointers and cpy_num - 1 items from buffer src to buffer
303 * ATTENTION! Number of node pointers in DEST is equal to number in internal_copy_pointers_items()
342 /* prepare space for cpy_num pointers */ in internal_copy_pointers_items()
[all …]
|
| /kernel/linux/linux-4.19/fs/reiserfs/ |
| D | ibalance.c | 122 * Insert count node pointers into buffer cur before position to + 1.
124 * Items and node pointers are specified by inserted and bh respectively.
202 * Delete del_num items and node pointers from buffer cur starting from
203 * the first_i'th item and first_p'th pointers respectively.
221 "no so many pointers (%d), only (%d) or " in internal_delete_pointers_items()
276 /* delete n node pointers and items starting from given position */
284 * delete n pointers starting from `from' position in CUR; in internal_delete_childs()
291 * copy cpy_num node pointers and cpy_num - 1 items from buffer src to buffer
303 * ATTENTION! Number of node pointers in DEST is equal to number in internal_copy_pointers_items()
342 /* prepare space for cpy_num pointers */ in internal_copy_pointers_items()
[all …]
|
| /kernel/linux/linux-5.10/Documentation/RCU/ |
| D | rcu_dereference.rst | 40 -not- work in general for char* pointers.
42 - XOR bits to translate pointers, as is done in some
50 "(x-(uintptr_t)x)" for char* pointers. The compiler is within its
87 - Be very careful about comparing pointers obtained from
89 explained, if the two pointers are equal, the compiler could
115 it is safe to compare pointers from rcu_dereference()
116 against NULL pointers.
155 rcu_dereference(). In this case, both pointers depend
171 - The pointers are not equal -and- the compiler does
418 SPARSE CHECKING OF RCU-PROTECTED POINTERS
[all …]
|
| /kernel/linux/linux-5.10/tools/testing/selftests/bpf/verifier/ |
| D | map_ptr_mixing.c | 2 "calls: two calls returning different map pointers for lookup (hash, array)",
32 "calls: two calls returning different map pointers for lookup (hash, map in map)",
62 "cond: two branches returning different map pointers for lookup (tail, tail)",
83 "cond: two branches returning same map pointers for lookup (tail, tail)",
|
| D | unpriv.c | 220 "unpriv: spill/fill of different pointers stx",
238 .errstr = "same insn cannot be used with different pointers",
242 "unpriv: spill/fill of different pointers stx - ctx and sock",
276 "unpriv: spill/fill of different pointers stx - leak sock",
302 //.errstr = "same insn cannot be used with different pointers",
307 "unpriv: spill/fill of different pointers stx - sock and ctx (read)",
335 .errstr = "same insn cannot be used with different pointers",
339 "unpriv: spill/fill of different pointers stx - sock and ctx (write)",
368 //.errstr = "same insn cannot be used with different pointers",
373 "unpriv: spill/fill of different pointers ldx",
[all …]
|
| /kernel/linux/linux-4.19/tools/objtool/Documentation/ |
| D | stack-validation.txt | 35 Frame pointers are used for debugging purposes. They allow runtime
40 For some architectures, frame pointers are enabled by
42 required by the ABI (sometimes referred to as "backchain pointers").
45 frame pointers when the -fno-omit-frame-pointer option is used.
51 For stack traces based on frame pointers to be reliable, all
58 pointers enabled:
95 destroyed. This is an inherent limitation of frame pointers.
99 An alternative to frame pointers and DWARF, ORC unwind data can be
100 used to walk the stack. Unlike frame pointers, ORC data is out of
|
| /kernel/linux/linux-4.19/Documentation/RCU/ |
| D | rcu_dereference.txt | 37 -not- work in general for char* pointers.
39 o XOR bits to translate pointers, as is done in some
47 "(x-(uintptr_t)x)" for char* pointers. The compiler is within its
84 o Be very careful about comparing pointers obtained from
86 explained, if the two pointers are equal, the compiler could
112 it is safe to compare pointers from rcu_dereference()
113 against NULL pointers.
152 rcu_dereference(). In this case, both pointers depend
168 o The pointers are not equal -and- the compiler does
|
| /kernel/linux/linux-4.19/Documentation/core-api/ |
| D | printk-formats.rst | 51 pointers of different types.
53 Plain Pointers
60 Pointers printed without a specifier extension (i.e unadorned %p) are
66 Symbols/Function Pointers
86 parisc64 function pointers are indirect and, in fact, are function
97 Kernel Pointers
104 For printing kernel pointers which should be hidden from unprivileged
115 For printing pointers when you *really* want to print the address. Please
117 kernel memory layout before printing pointers with %px. %px is functionally
120 printing pointers we will be better equipped to find the call sites.
[all …]
|
| D | assoc_array.rst | 11 1. Objects are opaque pointers. The implementation does not care where they
16 Pointers to objects _must_ be zero in the least significant bit.
52 pack leaf object pointers into spare space in the node rather than making an
187 pointers internally.
340 can contain mixtures of leaves and metadata pointers.
434 pointers - even if some of those leaves would like to be in the same slot.
436 A node can contain a heterogeneous mix of leaves and metadata pointers.
437 Metadata pointers must be in the slots that match their subdivisions of key
477 Each node has a maximum capacity of 16 leaves and metadata pointers. If the
523 new layout until we follow the back pointers - at which point we've
[all …]
|
| /kernel/linux/linux-5.10/drivers/staging/media/atomisp/pci/ |
| D | ia_css_3a.h | 82 /* Map with host-side pointers to ISP-format statistics.
83 * These pointers can either be copies of ISP data or memory mapped
84 * ISP pointers.
85 * All of the data behind these pointers is allocated contiguously, the
165 * pointers to all relevant subsets of the 3a statistics (dmem,
|
| /kernel/linux/linux-5.10/tools/objtool/Documentation/ |
| D | stack-validation.txt | 35 Frame pointers are used for debugging purposes. They allow runtime
40 For some architectures, frame pointers are enabled by
42 required by the ABI (sometimes referred to as "backchain pointers").
45 frame pointers when the -fno-omit-frame-pointer option is used.
51 For stack traces based on frame pointers to be reliable, all
58 pointers enabled:
95 destroyed. This is an inherent limitation of frame pointers.
99 An alternative to frame pointers and DWARF, ORC unwind data can be
100 used to walk the stack. Unlike frame pointers, ORC data is out of
|