Searched refs:leaf (Results 1 – 7 of 7) sorted by relevance
| /build/soong/finder/fs/ |
| D | fs.go | 168 func pathSplit(path string) (dir string, leaf string) {
169 dir, leaf = filepath.Split(path)
173 return dir, leaf
247 parentPath, leaf := pathSplit(path)
270 link, isLink := parentNode.symlinks[leaf]
770 parentPath, leaf := pathSplit(cleanedPath)
785 childDir, dirExists := parent.subdirs[leaf]
789 _, fileExists := parent.files[leaf]
799 parent.subdirs[leaf] = childDir
815 parentPath, leaf := pathSplit(path)
[all …]
|
| /build/soong/scripts/hiddenapi/ |
| D | signature_trie.py | 265 leaf = Leaf(
270 node.nodes[last_element] = leaf
|
| /build/bazel/json_module_graph/ |
| D | distanceFromLeaves.jq | 1 # CMD: Prints the longest distance each module has from a leaf in the module graph within the trans…
|
| /build/make/tools/atree/ |
| D | files.cpp | 23 path_append(const string& base, const string& leaf) in path_append() argument
26 if (base.length() > 0 && leaf.length() > 0) { in path_append()
29 full += leaf; in path_append()
|
| /build/bazel/rules/java/ |
| D | host_for_device_test.bzl | 20 "Platform of the leaf dependency in a linear dependency chain",
|
| D | sdk_transition_test.bzl | 20 "Info about the config settings of the leaf dependency (in a linear dependency chain only)",
|
| /build/soong/finder/ |
| D | finder.go | 362 func joinCleanPaths(base string, leaf string) string {
364 return leaf
367 return base + leaf
369 if leaf == "" {
372 return base + "/" + leaf
|