44 void node::BuildPathForNodeRecursive(bool safe, const node* node, std::stringstream* path) const {  in BuildPathForNodeRecursive()  argument
45     if (node->parent_) {  in BuildPathForNodeRecursive()
46         BuildPathForNodeRecursive(safe, node->parent_, path);  in BuildPathForNodeRecursive()
49     if (safe && node->parent_) {  in BuildPathForNodeRecursive()
50         (*path) << reinterpret_cast<uintptr_t>(node);  in BuildPathForNodeRecursive()
52         (*path) << node->GetName();  in BuildPathForNodeRecursive()
55     if (node != this) {  in BuildPathForNodeRecursive()
61 std::string node::BuildPath() const {  in BuildPath()
69 std::string node::BuildSafePath() const {  in BuildSafePath()
77 const node* node::LookupAbsolutePath(const node* root, const std::string& absolute_path) {  in LookupAbsolutePath()
86     const node* node = root;  in LookupAbsolutePath()  local
88         node = node->LookupChildByName(segment, false /* acquire */);  in LookupAbsolutePath()
89         if (!node) {  in LookupAbsolutePath()
93     return node;  in LookupAbsolutePath()
96 const node* node::LookupInode(const node* root, ino_t ino) {  in LookupInode()
105     for (node* child : root->children_) {  in LookupInode()
106         const node* node = LookupInode(child, ino);  in LookupInode()  local
107         if (node) {  in LookupInode()
108             return node;  in LookupInode()
114 void node::DeleteTree(node* tree) {  in DeleteTree()
121         std::vector<node*> children(tree->children_.begin(), tree->children_.end());  in DeleteTree()
122         for (node* child : children) {  in DeleteTree()