Home
last modified time | relevance | path

Searched refs:descend (Results 1 – 13 of 13) sorted by relevance

/linux/tools/
H A DMakefile68 $(call descend,power/$@)
71 $(call descend,power/$@)
74 $(call descend,$@)
77 $(call descend,$@)
80 $(call descend,lib/api)
83 $(call descend,include/nolibc)
86 $(call descend,include/nolibc,$(patsubst nolibc_%,%,$@))
97 $(call descend,sched_ext)
100 $(call descend,testing/$@)
103 $(call descend,lib/$@)
[all …]
/linux/tools/tracing/
H A DMakefile11 $(call descend,latency)
14 $(call descend,latency,install)
17 $(call descend,latency,clean)
20 $(call descend,rtla)
23 $(call descend,rtla,install)
26 $(call descend,rtla,clean)
/linux/tools/power/acpi/
H A DMakefile18 $(call descend,tools/$@,all)
20 $(call descend,tools/$(@:_clean=),clean)
22 $(call descend,tools/$(@:_install=),install)
24 $(call descend,tools/$(@:_uninstall=),uninstall)
/linux/tools/bpf/
H A DMakefile108 $(call descend,bpftool)
111 $(call descend,bpftool,install)
114 $(call descend,bpftool,clean)
117 $(call descend,resolve_btfids)
120 $(call descend,resolve_btfids,clean)
/linux/tools/bpf/bpftool/
H A DMakefile327 $(call descend,Documentation)
330 $(call descend,Documentation,clean)
333 $(call descend,Documentation,install)
336 $(call descend,Documentation,uninstall)
/linux/scripts/gdb/linux/
H A Dradixtree.py77 def descend(parent, index): function
130 offset, child = descend(node, index)
/linux/tools/scripts/
H A DMakefile.include193 # Call by doing: $(call descend,directory[,target])
195 descend = \
219 descend = \
/linux/fs/verity/
H A Dverify.c264 goto descend; in verify_data_block()
274 descend: in verify_data_block()
/linux/Documentation/misc-devices/
H A Dad525x_dpot.rst38 address of 0x2f, we descend (unrelated sysfs entries have been trimmed)::
/linux/Documentation/networking/
H A Dfib_trie.rst123 The lookup is in its simplest form just like fib_find_node(). We descend the
143 At this point we will repeatedly descend subtries to look for a match, and there
/linux/lib/
H A Dassoc_array.c1483 descend: in assoc_array_gc()
1534 goto descend; in assoc_array_gc()
/linux/tools/sched_ext/
H A DREADME.md193 is a much more performant CPU controller, which does not need to descend down
/linux/fs/ntfs/
H A Dindex.c666 * descend into the B+tree so we just break out of the loop. in ntfs_ib_read()
849 /* Child node present, descend into it. */ in ntfs_ib_alloc()
1894 descend: in ntfs_index_rm()
1910 goto descend; in ntfs_index_rm()