| /linux/sound/firewire/dice/ |
| H A D | dice-transaction.c | 273 __be32 *pointers; in get_subaddrs() local
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()
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()
333 if (pointers[7]) in get_subaddrs()
335 if (pointers[9]) 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.
|
| H A D | index.rst | 30 tagged-pointers
|
| /linux/fs/btrfs/ |
| H A D | raid56.c | 1326 pointers); in generate_pq_vertical()
1329 memcpy(pointers[rbio->nr_data], pointers[0], sectorsize); in generate_pq_vertical()
1925 faila, pointers); in recover_vertical()
1937 memcpy(pointers[faila], pointers[rbio->nr_data], sectorsize); in recover_vertical()
1940 p = pointers[faila]; in recover_vertical()
1943 pointers[stripe_nr] = pointers[stripe_nr + 1]; in recover_vertical()
1986 void **pointers = NULL; in recover_sectors() local
2019 kfree(pointers); in recover_sectors()
2590 pointers); in finish_parity_scrub()
2593 memcpy(pointers[nr_data], pointers[0], sectorsize); in finish_parity_scrub()
[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/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/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 | assoc_array.rst | 11 1. Objects are opaque pointers. The implementation does not care where they
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
523 new layout until we follow the back pointers - at which point we've
525 leaves in a node before following any of its metadata pointers).
531 This won't affect us until we follow the back pointers. Similar to (4).
[all …]
|
| H A D | printk-formats.rst | 61 pointers of different types.
103 For printing error pointers (i.e. a pointer for which IS_ERR() is true)
162 For printing kernel pointers which should be hidden from unprivileged
168 section about %p above for discussion about how to manage hashing pointers
178 For printing pointers when you *really* want to print the address. Please
180 kernel memory layout before printing pointers with %px. %px is functionally
183 printing pointers we will be better equipped to find the call sites.
204 printk("test: difference between pointers: %td\n", ptr2 - ptr1);
439 For printing name of block_device pointers.
|
| 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/Documentation/translations/zh_CN/arch/arm64/ |
| H A D | tagged-pointers.txt | 1 Chinese translated version of Documentation/arch/arm64/tagged-pointers.rst
12 Documentation/arch/arm64/tagged-pointers.rst 的中文翻译
|
| /linux/Documentation/translations/zh_TW/arch/arm64/ |
| H A D | tagged-pointers.txt | 3 Chinese translated version of Documentation/arch/arm64/tagged-pointers.rst
15 Documentation/arch/arm64/tagged-pointers.rst 的中文翻譯
|
| /linux/Documentation/devicetree/bindings/net/ |
| H A D | marvell-neta-bm.txt | 12 - pool<0 : 3>,capacity: size of external buffer pointers' ring maintained
18 pointers' pool (id 0 : 3). It will be taken into consideration only when pool
|
| /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/Documentation/networking/ |
| H A D | sysfs-tagging.rst | 18 By using the network namespace pointers as tags to separate out
37 kernfs_node->ns pointers pointing to it.
|
| /linux/Documentation/arch/x86/x86_64/ |
| H A D | 5level-paging.rst | 38 at least some JIT compilers use higher bits in pointers to encode their
39 information. It collides with valid pointers with 5-level paging and
|
| /linux/Documentation/arch/x86/ |
| H A D | orc-unwinder.rst | 28 ORC vs frame pointers
31 With frame pointers enabled, GCC adds instrumentation code to every
38 frame pointers and enable the ORC unwinder, you get a nice performance
49 Another benefit of ORC compared to frame pointers is that it can
55 The main disadvantage of the ORC unwinder compared to frame pointers is
|
| /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
|
| /linux/drivers/media/radio/wl128x/ |
| H A D | Kconfig | 14 this API and pointers to "v4l2" programs may be found at
|
| /linux/drivers/opp/ |
| H A D | Kconfig | 10 OPP layer organizes the data internally using device pointers
|
| /linux/Documentation/networking/device_drivers/ethernet/toshiba/ |
| H A D | spider_net.rst | 21 together with three pointers into the ring that are used to manage its
42 This filling and emptying is managed by three pointers, the "head"
43 and "tail" pointers, managed by the OS, and a hardware current
74 Thus, in an idle system, the GDACTDPA, tail and head pointers will
79 GDACTDPA, tail and head pointers. It will also summarize the contents
156 Both the tail and head pointers are pointing at descr 255, which is
|
| /linux/Documentation/dev-tools/ |
| H A D | kmemleak.rst | 85 friends are traced and the pointers, together with additional
87 The corresponding freeing function calls are tracked and the pointers
111 Some allocated memory blocks have pointers stored in the kernel's
192 the memory block is known not to contain other pointers and it will no
196 systems, because of pointers temporarily stored in CPU registers or
|