HomeSort by: relevance | last modified time | path
    Searched refs:NextNode (Results 1 - 10 of 10) sorted by relevancy

  /src/sys/external/bsd/acpica/dist/namespace/
nswalk.c 117 ACPI_NAMESPACE_NODE *NextNode = NULL;
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;
nsalloc.c 193 ACPI_NAMESPACE_NODE *NextNode;
202 NextNode = ParentNode->Child;
206 while (NextNode != Node)
208 PrevNode = NextNode;
209 NextNode = NextNode->Peer;
344 ACPI_NAMESPACE_NODE *NextNode;
358 NextNode = ParentNode->Child;
359 while (NextNode)
363 if (NextNode->Child
    [all...]
nsnames.c 266 ACPI_NAMESPACE_NODE *NextNode;
302 NextNode = Node;
303 while (NextNode && NextNode != AcpiGbl_RootNode)
305 if (NextNode != Node)
310 ACPI_MOVE_32_TO_32 (Name, &NextNode->Name);
325 NextNode = NextNode->Parent;
  /src/external/apache2/llvm/dist/llvm/lib/Support/
SuffixTree.cpp 127 SuffixTreeNode *NextNode = Active.Node->Children[FirstChar];
129 unsigned SubstringLen = NextNode->size();
138 Active.Node = NextNode;
147 if (Str[NextNode->StartIdx + Active.Len] == LastChar) {
175 insertInternalNode(Active.Node, NextNode->StartIdx,
176 NextNode->StartIdx + Active.Len - 1, FirstChar);
184 NextNode->StartIdx += Active.Len;
185 SplitNode->Children[Str[NextNode->StartIdx]] = NextNode;
  /src/sys/external/bsd/acpica/dist/compiler/
aslprintf.c 150 ACPI_PARSE_OBJECT *NextNode;
232 NextNode = ArgNode->Asl.Next;
235 ArgNode = NextNode;
242 NextNode = ArgNode->Asl.Next;
262 ArgNode = NextNode;
  /src/sys/external/bsd/acpica/dist/events/
evregion.c 914 ACPI_NAMESPACE_NODE *NextNode;
947 NextNode = AcpiNsGetNextNode (DeviceNode, NULL);
948 while (NextNode)
950 if ((NextNode->Type == ACPI_TYPE_REGION) &&
951 (NextNode->Object) &&
952 (NextNode->Object->Region.SpaceId == SpaceId))
957 NextNode = AcpiNsGetNextNode (DeviceNode, NextNode);
  /src/external/apache2/llvm/dist/clang/lib/AST/
ASTDiagnostic.cpp 575 /// NextNode - The index of the next sibling node or 0.
576 unsigned NextNode = 0;
757 for (i = Node.ChildNode; FlatTree[i].NextNode != 0;
758 i = FlatTree[i].NextNode) {
760 FlatTree[i].NextNode = NextFreeNode;
896 if (FlatTree[ReadNode].NextNode == 0)
899 ReadNode = FlatTree[ReadNode].NextNode;
905 return FlatTree[ReadNode].NextNode != 0;
  /src/external/apache2/llvm/dist/clang/include/clang/ASTMatchers/
ASTMatchersInternal.h 1859 QualType NextNode = (Node.*TraverseFunction)();
1860 if (NextNode.isNull())
1862 return this->InnerMatcher.matches(DynTypedNode::create(NextNode), Finder,
1884 TypeLoc NextNode = (Node.*TraverseFunction)();
1885 if (!NextNode)
1887 return this->InnerMatcher.matches(DynTypedNode::create(NextNode), Finder,
ASTMatchers.h 7083 const NestedNameSpecifier *NextNode = Node.getPrefix();
7084 if (!NextNode)
7086 return InnerMatcher.matches(*NextNode, Finder, Builder);
7101 NestedNameSpecifierLoc NextNode = Node.getPrefix();
7102 if (!NextNode)
7104 return InnerMatcher.matches(NextNode, Finder, Builder);
  /src/external/apache2/llvm/dist/clang/lib/StaticAnalyzer/Core/
BugReporter.cpp 2752 const ExplodedNode *NextNode = ErrorNode->getFirstPred();
2753 while (NextNode) {
2765 const ExplodedNode *Pred = NextNode->getFirstPred();
2784 auto P = V->VisitNode(NextNode, BRC, *R);
2786 (*Notes)[NextNode].push_back(std::move(P));
2792 NextNode = Pred;

Completed in 77 milliseconds