| /linux/sound/firewire/dice/ |
| H A 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 …]
|
| H A 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()
|
| /linux/Documentation/arch/arm64/ |
| H A 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/arch/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 …]
|
| H A D | pointer-authentication.rst | 21 whether pointers have been modified unexpectedly. A PAC is derived from
77 exposed for data pointers and instruction pointers, as the set of PAC
80 pointers).
128 instructions to sign and authenticate function pointers and other pointers
131 pointers.
|
| /linux/drivers/staging/media/atomisp/pci/isp/kernels/sdis/sdis_2/ |
| H A 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 */
|
| /linux/drivers/net/ethernet/intel/fm10k/ |
| H A 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 …]
|
| /linux/fs/xfs/scrub/ |
| H A D | parent.c | 47 /* Parent pointers */
208 * Checking of Parent Pointers
211 * On filesystems with directory parent pointers, we check the referential
232 /* How many parent pointers did we find at the end? */
478 /* No self-referential parent pointers. */ in xchk_parent_scan_attr()
623 /* Check all the parent pointers that we deferred the first time around. */
657 /* Count the number of parent pointers. */
685 * Compare the number of parent pointers to the link count. For
697 * If we cycled the ILOCK while cross-checking parent pointers with in xchk_parent_count_pptrs()
698 * dirents, then we need to recalculate the number of parent pointers. in xchk_parent_count_pptrs()
[all …]
|
| /linux/fs/btrfs/ |
| H A D | raid56.c | 1091 * Both @faila and @failb should be valid pointers if any of in get_rbio_veritical_errors()
1296 void **pointers = rbio->finish_pointers; in generate_pq_vertical() local
1305 pointers[stripe] = kmap_local_page(sector->page) + in generate_pq_vertical()
1312 pointers[stripe++] = kmap_local_page(sector->page) + sector->pgoff; in generate_pq_vertical()
1321 pointers[stripe++] = kmap_local_page(sector->page) + in generate_pq_vertical()
1326 pointers); in generate_pq_vertical()
1329 memcpy(pointers[rbio->nr_data], pointers[0], sectorsize); in generate_pq_vertical()
1330 run_xor(pointers + 1, rbio->nr_data - 1, sectorsize); in generate_pq_vertical()
1333 kunmap_local(pointers[stripe]); in generate_pq_vertical()
1825 * @*pointers are the pre-allocated pointers by the caller, so we don't
[all …]
|
| /linux/Documentation/filesystems/ |
| H A 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)
|
| H A 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
|
| /linux/Documentation/core-api/ |
| H A D | folio_queue.rst | 36 A pair of pointers are provided, ``next`` and ``prev``, that point to the
39 sibling pointers in terminal segments should be NULL.
43 * an ordered sequence of folio pointers,
67 necessarily initialise all the folio pointers, so care must be taken to check
184 queue. The iov iterator functions will follow the next pointers when advancing
185 and prev pointers when reverting when needed.
206 head and tail pointers from collapsing.
|
| H A D | printk-formats.rst | 61 pointers of different types.
71 Plain Pointers
78 Pointers printed without a specifier extension (i.e unadorned %p) are
96 Error Pointers
103 For printing error pointers (i.e. a pointer for which IS_ERR() is true)
108 Symbols/Function Pointers
141 Probed Pointers from BPF / tracing
155 Kernel Pointers
162 For printing kernel pointers which should be hidden from unprivileged
168 section about %p above for discussion about how to manage hashing pointers
[all …]
|
| H A 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 …]
|
| H A D | xarray.rst | 13 of pointers. It meets many of the same needs as a hash or a conventional
28 Normal pointers may be stored in the XArray directly. They must be 4-byte
30 alloc_page(). It isn't true for arbitrary user-space pointers,
31 nor for function pointers. You can store pointers to statically allocated
40 Some users want to tag the pointers they store in the XArray. You can
43 to retrieve the tag of an entry. Tagged pointers use the same bits that
44 are used to distinguish value entries from normal pointers, so you must
45 decide whether they want to store value entries or tagged pointers in
48 The XArray does not support storing IS_ERR() pointers as some
111 xa_destroy(). If the XArray entries are pointers, you may wish
|
| /linux/fs/reiserfs/ |
| H A 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 …]
|
| /linux/Documentation/RCU/ |
| H A D | rcu_dereference.rst | 7 important to correct use of things like RCU. To this end, the pointers
60 *not* work in general for char* pointers.
62 - XOR bits to translate pointers, as is done in some
70 "(x-(uintptr_t)x)" for char* pointers. The compiler is within its
107 - Be very careful about comparing pointers obtained from
109 explained, if the two pointers are equal, the compiler could
135 it is safe to compare pointers from rcu_dereference()
136 against NULL pointers.
181 rcu_dereference(). In this case, both pointers depend
197 - The pointers are not equal *and* the compiler does
[all …]
|
| /linux/rust/kernel/ |
| H A D | list.rs | 28 /// only have one `ListArc` (for each pair of prev/next pointers), this ensures that the same
29 /// prev/next pointers are not used for several linked lists.
35 /// * All prev/next pointers in `ListLinks` fields of items in the list are valid and form a cycle.
77 /// Otherwise, the returned pointer points at a read-only [`ListLinks`] with two null pointers.
140 /// The prev/next pointers for an item in a linked list.
147 // This type is `!Unpin` for aliasing reasons as the pointers are part of an intrusive linked
152 // SAFETY: The only way to access/modify the pointers inside of `ListLinks<ID>` is via holding the
275 // SAFETY: Pointers in a linked list are never dangling, and the caller just gave us in push_back()
313 // SAFETY: Pointers in a linked list are never dangling, and the caller just gave us in push_front()
384 // is in this list. The pointers are in the right order. in remove()
[all …]
|
| /linux/Documentation/devicetree/ |
| H A D | overlay-notes.rst | 127 OF_OVERLAY_PRE_REMOVE may store pointers to a device tree node in the overlay
128 or its content but these pointers must not persist past the notifier callback
136 are not allowed to store pointers to a device tree node in the overlay
137 or its content. The overlay code does not protect against such pointers
147 pointers to the overlay nodes or data. Any example of an inadvertent use
148 of such pointers is if a driver or subsystem module is loaded after an
|
| /linux/drivers/staging/media/atomisp/pci/ |
| H A D | ia_css_3a.h | 87 /* Map with host-side pointers to ISP-format statistics.
88 * These pointers can either be copies of ISP data or memory mapped
89 * ISP pointers.
90 * All of the data behind these pointers is allocated contiguously, the
170 * pointers to all relevant subsets of the 3a statistics (dmem,
|
| H A D | ia_css_env.h | 38 /* Environment with function pointers for local IA memory allocation.
48 /* Environment with function pointers to access the CSS hardware. This includes
76 /* Environment with function pointers to print error and debug messages.
85 /* Environment structure. This includes function pointers to access several
|
| /linux/fs/bcachefs/ |
| H A D | extents_format.h | 6 * In extent bkeys, the value is a list of pointers (bch_extent_ptr), optionally
42 * going to rewrite all the pointers at once - one of the replicas may be in a
47 * Thus it will only move a subset of the pointers (or in the case of
49 * current pointers), and if the extent has been partially overwritten it must
69 * Then, each bch_extent_crc32/64 applies to the pointers that follow after it,
275 /* Btree pointers don't carry around checksums: */
|
| /linux/tools/testing/selftests/bpf/progs/ |
| H A D | verifier_unpriv.c | 348 __description("unpriv: spill/fill of different pointers stx")
349 __failure __msg("same insn cannot be used with different pointers")
375 __description("unpriv: spill/fill of different pointers st")
376 __failure __msg("same insn cannot be used with different pointers")
400 __description("unpriv: spill/fill of different pointers stx - ctx and sock")
439 __description("unpriv: spill/fill of different pointers stx - leak sock")
441 //.errstr = "same insn cannot be used with different pointers",
475 __description("unpriv: spill/fill of different pointers stx - sock and ctx (read)")
476 __failure __msg("same insn cannot be used with different pointers")
512 __description("unpriv: spill/fill of different pointers stx - sock and ctx (write)")
[all …]
|
| /linux/arch/sparc/include/uapi/asm/ |
| H A D | perfctr.h | 17 * Pointers which are passed by the user are pointers to 64-bit
33 * with zero and the user counter accumulator pointers and
38 /* Add current D0 and D1 PIC values into user pointers given
|
| /linux/arch/arm/mach-omap2/ |
| H A D | clockdomain.c | 125 * _autodep_lookup - resolve autodep clkdm names to clkdm pointers; store
128 * Resolve autodep clockdomain names to clockdomain pointers via
129 * clkdm_lookup() and store the pointers in the autodep structure. An
188 * Returns -EINVAL if presented with invalid clockdomain pointers,
232 * pointers, -ENOENT if @clkdm2 cannot wake up clkdm1 in hardware, or
275 * presented with invalid clockdomain pointers or called on a machine
320 * if presented with invalid clockdomain pointers or called on a machine
362 * @co: func pointers for arch specific implementations
364 * Register the list of function pointers used to implement the
424 * names into clockdomain pointers.
[all …]
|
| /linux/tools/objtool/Documentation/ |
| H A D | objtool.txt | 46 to ensure that all functions referenced by function pointers have
115 Frame pointers are used for debugging purposes. They allow runtime
120 For some architectures, frame pointers are enabled by
122 required by the ABI (sometimes referred to as "backchain pointers").
125 frame pointers when the -fno-omit-frame-pointer option is used.
131 For stack traces based on frame pointers to be reliable, all
138 pointers enabled:
175 destroyed. This is an inherent limitation of frame pointers.
179 An alternative to frame pointers and DWARF, ORC unwind data can be
180 used to walk the stack. Unlike frame pointers, ORC data is out of
|