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

/freebsd-10-stable/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-10-stable/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-10-stable/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-10-stable/contrib/llvm/include/llvm/ADT/
H A Dilist.h438 NodeTy *NextNode = this->getNext(Node); local
442 this->setNext(PrevNode, NextNode);
444 Head = NextNode;
445 this->setPrev(NextNode, PrevNode);
446 IT = NextNode;
/freebsd-10-stable/contrib/llvm/tools/clang/lib/AST/
H A DASTDiagnostic.cpp430 /// NextNode - The index of the next sibling node or 0.
431 unsigned NextNode; member in struct:__anon3119::TemplateDiff::DiffTree::DiffNode
472 : Kind(Invalid), NextNode(0), ChildNode(0), ParentNode(ParentNode),
574 for (i = Node.ChildNode; FlatTree[i].NextNode != 0;
575 i = FlatTree[i].NextNode) {
577 FlatTree[i].NextNode = NextFreeNode;
656 if (FlatTree[ReadNode].NextNode == 0)
659 ReadNode = FlatTree[ReadNode].NextNode;
665 return FlatTree[ReadNode].NextNode != 0;
/freebsd-10-stable/contrib/llvm/tools/clang/lib/StaticAnalyzer/Core/
H A DBugReporter.cpp566 const ExplodedNode *NextNode = N->pred_empty() local
571 while (NextNode) {
572 N = NextNode;
574 NextNode = N->getFirstPred();
869 if (NextNode) {
875 if (PathDiagnosticPiece *p = (*I)->VisitNode(N, NextNode, PDB, *R)) {
1404 const ExplodedNode *NextNode = N->pred_empty() ? NULL : *(N->pred_begin()); local
1405 while (NextNode) {
1406 N = NextNode;
1407 NextNode
1651 const ExplodedNode *NextNode = N->getFirstPred(); local
[all...]
/freebsd-10-stable/contrib/llvm/tools/clang/include/clang/ASTMatchers/
H A DASTMatchers.h3361 NestedNameSpecifier *NextNode = Node.getPrefix(); local
3362 if (NextNode == NULL)
3364 return InnerMatcher.matches(*NextNode, Finder, Builder);
3379 NestedNameSpecifierLoc NextNode = Node.getPrefix(); local
3380 if (!NextNode)
3382 return InnerMatcher.matches(NextNode, Finder, Builder);
H A DASTMatchersInternal.h1531 QualType NextNode = (Node.*TraverseFunction)(); local
1532 if (NextNode.isNull())
1534 return InnerMatcher.matches(NextNode, Finder, Builder);
1555 TypeLoc NextNode = (Node.*TraverseFunction)(); local
1556 if (!NextNode)
1558 return InnerMatcher.matches(NextNode, Finder, Builder);

Completed in 201 milliseconds