Searched refs:ancestor (Results 1 - 4 of 4) sorted by relevance

/haiku/3rdparty/docker/bootstrap/
H A DMakefile12 ${ENGINE} ps -q --filter=ancestor=docker.io/haiku/bootstrap | xargs -I {} ${ENGINE} kill {}
13 ${ENGINE} ps -a -q --filter=ancestor=docker.io/haiku/bootstrap | xargs -I {} ${ENGINE} rm {}
/haiku/src/kits/storage/
H A DPathMonitor.cpp186 // 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/src/tests/system/kernel/file_corruption/fs/
H A Dchecksumfs.cpp1353 // 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);
/haiku/src/kits/storage/disk_device/
H A DPartition.cpp1416 const BPartition* ancestor = this; local
1417 while ((ancestor = ancestor->Parent()))

Completed in 228 milliseconds