Searched refs:ChildNode (Results 1 - 5 of 5) sorted by relevance

/freebsd-13-stable/sys/contrib/dev/acpica/components/namespace/
H A Dnswalk.c167 * ChildNode - Previous child that was found.
182 ACPI_NAMESPACE_NODE *ChildNode)
187 if (!ChildNode)
196 return (ChildNode->Peer);
207 * ChildNode - Previous child that was found.
223 ACPI_NAMESPACE_NODE *ChildNode)
231 NextNode = AcpiNsGetNextNode (ParentNode, ChildNode);
310 ACPI_NAMESPACE_NODE *ChildNode; local
330 ChildNode = AcpiNsGetNextNode (ParentNode, NULL);
339 while (Level > 0 && ChildNode)
180 AcpiNsGetNextNode( ACPI_NAMESPACE_NODE *ParentNode, ACPI_NAMESPACE_NODE *ChildNode) argument
220 AcpiNsGetNextNodeTyped( ACPI_OBJECT_TYPE Type, ACPI_NAMESPACE_NODE *ParentNode, ACPI_NAMESPACE_NODE *ChildNode) argument
[all...]
H A Dnsalloc.c370 ACPI_NAMESPACE_NODE *ChildNode; local
402 ChildNode = ParentNode->Child;
404 if (!ChildNode)
412 while (ChildNode->Peer)
414 ChildNode = ChildNode->Peer;
417 ChildNode->Peer = Node;
510 ACPI_NAMESPACE_NODE *ChildNode = NULL; local
539 ChildNode = AcpiNsGetNextNode (ParentNode, ChildNode);
608 ACPI_NAMESPACE_NODE *ChildNode; local
[all...]
H A Dnsxfobj.c326 ACPI_NAMESPACE_NODE *ChildNode = NULL; local
360 ChildNode = AcpiNsValidateHandle (Child);
361 if (!ChildNode)
370 Node = AcpiNsGetNextNodeTyped (Type, ParentNode, ChildNode);
/freebsd-13-stable/contrib/llvm-project/clang/lib/Tooling/Syntax/
H A DBuildTree.cpp1314 syntax::Tree *ChildNode;
1319 ChildNode = new (allocator()) syntax::ExpressionStatement;
1321 Pending.foldChildren(Arena, getStmtRange(Child), ChildNode);
1323 ChildNode = Mapping.find(Child);
1325 assert(ChildNode != nullptr);
1326 setRole(ChildNode, Role);
1334 syntax::Tree *ChildNode = Mapping.find(Child); local
1335 assert(ChildNode != nullptr);
1336 setRole(ChildNode, Role);
/freebsd-13-stable/contrib/llvm-project/clang/lib/AST/
H A DASTDiagnostic.cpp578 /// ChildNode - The index of the first child node or 0.
579 unsigned ChildNode = 0; member in struct:__anon1557::TemplateDiff::DiffTree::DiffNode
750 if (Node.ChildNode == 0) {
752 Node.ChildNode = NextFreeNode;
757 for (i = Node.ChildNode; FlatTree[i].NextNode != 0;
885 return FlatTree[ReadNode].ChildNode != 0;
890 ReadNode = FlatTree[ReadNode].ChildNode;

Completed in 194 milliseconds