Searched refs:leaf (Results 1 – 4 of 4) 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/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/json_module_graph/ |
| D | README.md | 24 * `distanceFromLeaves` prints the longest distance each module has from a leaf
|
| /build/soong/finder/ |
| D | finder.go | 358 func joinCleanPaths(base string, leaf string) string {
360 return leaf
363 return base + leaf
365 if leaf == "" {
368 return base + "/" + leaf
|