Searched refs:ancestor (Results 1 - 4 of 4) sorted by path
/haiku/src/kits/storage/ |
H A D | PathMonitor.cpp | 186 // ancestor. In practice this complicates the transitions when an 187 // ancestor is created/removed/moved. 190 TRACE(" started to watch ancestor %p (\"%s\", %#" B_PRIx32 553 status_t _StartWatchingAncestors(Ancestor* ancestor, 555 void _StopWatchingAncestors(Ancestor* ancestor, 933 Ancestor* ancestor = NULL; local 945 ancestor = new(std::nothrow) Ancestor(ancestor, ancestorPath, 947 TRACE(" created ancestor %p (\"%s\" / \"%s\")\n", ancestor, 1012 _StopWatchingAncestors(Ancestor* ancestor, bool notify) argument 1382 Ancestor* ancestor = _GetAncestor(nodeRef); local 1511 Ancestor* ancestor = _GetAncestor(nodeRef); local [all...] |
/haiku/3rdparty/docker/bootstrap/ |
H A D | Makefile | 13 ${ENGINE} ps -q --filter=ancestor=docker.io/haiku/bootstrap:${VER} | xargs -I {} ${ENGINE} kill {} 14 ${ENGINE} ps -a -q --filter=ancestor=docker.io/haiku/bootstrap:${VER} | xargs -I {} ${ENGINE} rm {}
|
/haiku/src/kits/storage/disk_device/ |
H A D | Partition.cpp | 1466 const BPartition* ancestor = this; local 1467 while ((ancestor = ancestor->Parent()))
|
/haiku/src/tests/system/kernel/file_corruption/fs/ |
H A D | checksumfs.cpp | 1353 // descendents. We iterate upwards, checking whether any ancestor of the 1357 Node* ancestor = toDirectory; local 1359 while (ancestor != volume->RootDirectory() 1360 || ancestor == fromDirectory) { 1361 if (ancestor == node) 1364 error = volume->GetNode(ancestor->ParentDirectory(), ancestor); 1367 ancestorPutter.SetTo(ancestor);
|
Completed in 159 milliseconds