Searched refs:NextNode (Results 1 - 10 of 10) sorted by relevance

/freebsd-11.0-release/sys/contrib/dev/acpica/components/namespace/
H A Dnswalk.c117 ACPI_NAMESPACE_NODE *NextNode = NULL; local
123 NextNode = AcpiNsGetNextNode (ParentNode, ChildNode);
129 /* NextNode is NULL if we are at the end-of-list */
131 return (NextNode);
136 while (NextNode)
140 if (NextNode->Type == Type)
142 return (NextNode);
147 NextNode = NextNode->Peer;
H A Dnsalloc.c188 ACPI_NAMESPACE_NODE *NextNode; local
197 NextNode = ParentNode->Child;
201 while (NextNode != Node)
203 PrevNode = NextNode;
204 NextNode = NextNode->Peer;
339 ACPI_NAMESPACE_NODE *NextNode; local
353 NextNode = ParentNode->Child;
354 while (NextNode)
358 if (NextNode
[all...]
H A Dnsnames.c211 ACPI_NAMESPACE_NODE *NextNode; local
240 NextNode = Node;
241 while (NextNode && NextNode != AcpiGbl_RootNode)
243 if (NextNode != Node)
248 ACPI_MOVE_32_TO_32 (Name, &NextNode->Name);
263 NextNode = NextNode->Parent;
/freebsd-11.0-release/sys/contrib/dev/acpica/compiler/
H A Daslprintf.c150 ACPI_PARSE_OBJECT *NextNode; local
232 NextNode = ArgNode->Asl.Next;
235 ArgNode = NextNode;
242 NextNode = ArgNode->Asl.Next;
262 ArgNode = NextNode;
/freebsd-11.0-release/sys/contrib/dev/acpica/components/events/
H A Devregion.c852 ACPI_NAMESPACE_NODE *NextNode; local
885 NextNode = AcpiNsGetNextNode (EcDeviceNode, NULL);
886 while (NextNode)
888 if ((NextNode->Type == ACPI_TYPE_REGION) &&
889 (NextNode->Object) &&
890 (NextNode->Object->Region.SpaceId == ACPI_ADR_SPACE_EC))
895 NextNode = AcpiNsGetNextNode (EcDeviceNode, NextNode);
/freebsd-11.0-release/contrib/llvm/tools/clang/lib/StaticAnalyzer/Core/
H A DBugReporter.cpp563 const ExplodedNode *NextNode = N->pred_empty() local
568 while (NextNode) {
569 N = NextNode;
571 NextNode = N->getFirstPred();
866 if (NextNode) {
870 if (PathDiagnosticPiece *p = V->VisitNode(N, NextNode, PDB, *R)) {
1396 const ExplodedNode *NextNode = N->pred_empty() ? nullptr : *(N->pred_begin()); local
1397 while (NextNode) {
1398 N = NextNode;
1399 NextNode
1639 const ExplodedNode *NextNode = N->getFirstPred(); local
[all...]
/freebsd-11.0-release/contrib/llvm/include/llvm/ADT/
H A Dilist.h487 NodeTy *NextNode = this->getNext(Node); local
491 this->setNext(PrevNode, NextNode);
493 Head = NextNode;
494 this->setPrev(NextNode, PrevNode);
495 IT.reset(NextNode);
/freebsd-11.0-release/contrib/llvm/tools/clang/include/clang/ASTMatchers/
H A DASTMatchersInternal.h1466 QualType NextNode = (Node.*TraverseFunction)(); variable
1467 if (NextNode.isNull())
1470 ast_type_traits::DynTypedNode::create(NextNode), Finder, Builder);
1490 TypeLoc NextNode = (Node.*TraverseFunction)(); variable
1491 if (!NextNode)
1494 ast_type_traits::DynTypedNode::create(NextNode), Finder, Builder);
H A DASTMatchers.h4398 const NestedNameSpecifier *NextNode = Node.getPrefix(); local
4399 if (!NextNode)
4401 return InnerMatcher.matches(*NextNode, Finder, Builder);
4416 NestedNameSpecifierLoc NextNode = Node.getPrefix(); local
4417 if (!NextNode)
4419 return InnerMatcher.matches(NextNode, Finder, Builder);
/freebsd-11.0-release/contrib/llvm/tools/clang/lib/AST/
H A DASTDiagnostic.cpp543 /// NextNode - The index of the next sibling node or 0.
544 unsigned NextNode = 0; member in struct:__anon3631::TemplateDiff::DiffTree::DiffNode
726 for (i = Node.ChildNode; FlatTree[i].NextNode != 0;
727 i = FlatTree[i].NextNode) {
729 FlatTree[i].NextNode = NextFreeNode;
865 if (FlatTree[ReadNode].NextNode == 0)
868 ReadNode = FlatTree[ReadNode].NextNode;
874 return FlatTree[ReadNode].NextNode != 0;

Completed in 163 milliseconds