| /linux/Documentation/ABI/testing/ |
| H A D | sysfs-platform-dptf | 151 1: Random walk mode. FFC frequency
|
| /linux/Documentation/admin-guide/cgroup-v1/ |
| H A D | freezer-subsystem.rst | 17 walk /proc or invoke a kernel interface to gather information about the
|
| /linux/Documentation/admin-guide/kdump/ |
| H A D | vmcoreinfo.rst | 353 Used to walk through the whole page table and convert virtual addresses
|
| /linux/Documentation/admin-guide/mm/ |
| H A D | pagemap.rst | 268 4. The walk can abort before visiting the complete range such as the user buffer
269 can get full etc. The walk ending address is specified in``end_walk``.
|
| /linux/Documentation/admin-guide/pm/ |
| H A D | cpuidle.rst | 323 Now, the governor is ready to walk the list of idle states and choose one of
|
| /linux/Documentation/admin-guide/ |
| H A D | sysfs-rules.rst | 167 by its subsystem value. You need to walk up the chain until you find
|
| /linux/Documentation/arch/arm64/ |
| H A D | asymmetric-32bit.rst | 85 subset of the cpuset determined by the walk.
|
| H A D | hugetlbpage.rst | 20 mappings reduce the depth of page table walk needed to translate hugepage
|
| /linux/Documentation/block/ |
| H A D | biovecs.rst | 55 it had to walk two different bios at the same time, keeping both bi_idx and
|
| /linux/Documentation/bpf/ |
| H A D | bpf_design_QA.rst | 201 which are using helpers like bpf_probe_read() to walk kernel internal
|
| H A D | bpf_iterators.rst | 65 this section, we’ll walk through a BPF selftest which shows how to load and use
252 By default, BPF iterators walk through all the objects of the specified types
|
| H A D | verifier.rst | 305 The verifier does not actually walk all possible paths through the program. For
|
| /linux/Documentation/core-api/ |
| H A D | maple_tree.rst | 74 You can walk each entry within a range by calling mt_for_each(). You must
75 provide a temporary variable to store a cursor. If you want to walk each
77 the caller is going to hold the lock for the duration of the walk then it is
155 mas_walk() will walk the tree to the location of mas->index and set the
168 You can walk each entry within a range by using mas_for_each(). If you want
169 to walk each element of the tree then ``0`` and ``ULONG_MAX`` may be used as
|
| H A D | xarray.rst | 404 The xas_load() will walk the xa_state as close to the entry
411 will generally make the next operation walk the cursor to the desired
414 not walk the cursor around the array so does not require a lock to be
466 Calling xas_load() with a multi-index xa_state will walk the
|
| /linux/Documentation/driver-api/ |
| H A D | clk.rst | 124 Let's walk through enabling this clk from driver code::
|
| H A D | device-io.rst | 33 devices. The PCI bus walk is a good example of such a scheme. This
|
| /linux/Documentation/driver-api/nvdimm/ |
| H A D | btt.rst | 212 On startup, we analyze the BTT flog to create our list of free blocks. We walk
|
| /linux/Documentation/driver-api/usb/ |
| H A D | writing_musb_glue_layer.rst | 24 ``drivers/usb/musb/jz4740.c``. In this documentation I will walk through the
|
| H A D | writing_usb_driver.rst | 34 will walk through the basics of the skeleton driver, explaining the
|
| /linux/Documentation/filesystems/ |
| H A D | autofs-mount-control.rst | 25 needs to walk back up the mount tree to construct a path, such as
67 trigger. So when we walk on the path we mount shark:/autofs/export1 "on
|
| H A D | autofs.rst | 146 something on the second it must be able to "walk" down past the
167 The second use case only occurs during an "RCU-walk" and so `rcu_walk`
170 An RCU-walk is a fast and lightweight process for walking down a
171 filename path (i.e. it is like running on tip-toes). RCU-walk cannot
173 to "REF-walk", which is slower but more robust.
175 RCU-walk will never call `->d_automount`; the filesystems must already
176 be mounted or RCU-walk cannot handle the path.
177 To determine if a mount-trap is safe for RCU-walk mode it calls
190 VFS remain in RCU-walk mode, but can only tell it to get out of
191 RCU-walk mode by returning `-ECHILD`.
[all …]
|
| H A D | locking.rst | 37 ops rename_lock ->d_lock may block rcu-walk
39 d_revalidate: no no yes (ref-walk) maybe
50 d_manage: no no yes (ref-walk) maybe
108 permission: no (may not block if called in rcu-walk mode)
|
| H A D | path-lookup.rst | 30 will allow us to review "REF-walk" and "RCU-walk" separately. But we
606 REF-walk. The difficulty with RCU-walk comes from a different
632 using REF-walk.
640 REF-walk.
644 that a path walk with REF-walk would have found the same entries.
653 This pattern of "try RCU-walk, if that fails try REF-walk" can be
699 REF-walk increments a reference count or takes a spinlock, RCU-walk
752 REF-walk.
1064 method. This is called both in RCU-walk and REF-walk. In RCU-walk the
1272 path walk drop down to REF-walk. All of this is handled in the
[all …]
|
| H A D | path-lookup.txt | 209 RCU-walk path walking design
212 Path walking code now has two distinct modes, ref-walk and rcu-walk. ref-walk
223 path walk.
225 Where ref-walk uses a stable, refcounted ``parent'' to walk the remaining
275 "dropping rcu" or dropping from rcu-walk into ref-walk mode.
280 the path walk must be fully restarted (which we do in ref-walk mode, to avoid
285 requires ref-walk, then instead of restarting the walk, we attempt to drop rcu
291 * LOOKUP_RCU is set in nd->flags, which distinguishes rcu-walk from ref-walk.
306 during the path walk.
360 Dropping from rcu-walk to ref-walk mean that we have encountered a dentry where
[all …]
|
| /linux/Documentation/filesystems/nfs/ |
| H A D | exporting.rst | 196 filesystem is exported however, then nfsd must walk the ancestors of the
|