Searched refs:descend (Results 1 - 5 of 5) sorted by relevance
| /third_party/FreeBSD/lib/libc/gen/ |
| H A D | fts.c | 636 int cderrno, descend, oflag, saved_errno, nostat, doadjust; in fts_build() local
690 * If we're going to need to stat anything or we want to descend in fts_build()
710 descend = 0; in fts_build()
713 descend = 1; in fts_build()
715 descend = 0; in fts_build()
852 if (descend && (type == BCHILD || !nitems) && in fts_build()
|
| /third_party/node/deps/npm/node_modules/@npmcli/arborist/lib/ |
| H A D | place-dep.js | 425 pruneDedupable (node, descend = true) {
436 if (descend) {
|
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Transforms/Scalar/ |
| H A D | LoopFuse.cpp | 457 void descend() { in descend() function
567 LDT.descend(); in fuseLoops()
|
| /third_party/ntfs-3g/libntfs-3g/ |
| H A D | index.c | 633 * descend into the B+tree so we just break out of the loop. in ntfs_ie_lookup()
832 /* Child node present, descend into it. */ in ntfs_index_lookup()
1823 descend: in ntfs_index_rm_node()
1837 goto descend; in ntfs_index_rm_node()
|
| /third_party/rust/crates/memchr/bench/data/code/ |
| H A D | rust-library.rs | 29579 Internal(internal) => internal.descend(), in search_tree()
29652 self = common_edge.descend(); in search_tree_for_bifurcation()
29983 let mut out_tree = clone_subtree(internal.first_edge().descend()); in clone()
29995 let subtree = clone_subtree(in_edge.descend()); in clone()
32145 left_node = edge.descend(); in split_off()
32146 right_node = node.first_edge().descend(); in split_off()
33817 f.descend().find_lower_bound_edge(lower_child_bound); in find_leaf_edges_spanning_range()
33819 b.descend().find_upper_bound_edge(upper_child_bound); in find_leaf_edges_spanning_range()
33844 min_node = min_int.descend(); in full_range()
33845 max_node = max_int.descend(); in full_range()
38908 pub fn descend(self) -> NodeRef<BorrowType, K, V, marker::LeafOrInternal> { descend() functions
[all...] |
Completed in 50 milliseconds