Searched refs:SubNodes (Results 1 – 4 of 4) sorted by relevance
/external/lzma/CPP/Common/ |
D | Wildcard.cpp | 250 !SubNodes.IsEmpty() || in AreAllAllowed() 259 FOR_VECTOR (i, SubNodes) in FindSubNode() 260 if (CompareFileNames(SubNodes[i].Name, name) == 0) in FindSubNode() 297 index = SubNodes.Add(CCensorNode(front, this)); in AddItem() 299 SubNodes[index].AddItem(include, item, ignoreWildcardIndex - 1); in AddItem() 328 FOR_VECTOR (i, SubNodes) in AreThereIncludeItems() 329 if (SubNodes[i].AreThereIncludeItems()) in AreThereIncludeItems() 359 if (SubNodes[index].CheckPathVect(pathParts2, isFile, include)) in CheckPathVect() 434 FOR_VECTOR (i, fromNodes.SubNodes) in ExtendExclude() 436 const CCensorNode &node = fromNodes.SubNodes[i]; in ExtendExclude() [all …]
|
D | Wildcard.h | 67 CObjectVector<CCensorNode> SubNodes; variable
|
/external/lzma/CPP/7zip/UI/Common/ |
D | EnumDirItems.cpp | 481 nextNode = &curNode.SubNodes[index]; in EnumerateForItem() 687 nextNode = &curNode.SubNodes[index]; in EnumerateDirItems() 699 for (i = 0; i < curNode.SubNodes.Size(); i++) in EnumerateDirItems() 704 const NWildcard::CCensorNode &nextNode = curNode.SubNodes[i]; in EnumerateDirItems() 1035 for (i = 0; i < node.SubNodes.Size(); i++) in ConvertToLongNames() 1037 UString &name = node.SubNodes[i].Name; in ConvertToLongNames() 1043 for (i = 0; i < node.SubNodes.Size(); i++) in ConvertToLongNames() 1045 NWildcard::CCensorNode &nextNode1 = node.SubNodes[i]; in ConvertToLongNames() 1046 for (unsigned j = i + 1; j < node.SubNodes.Size();) in ConvertToLongNames() 1048 const NWildcard::CCensorNode &nextNode2 = node.SubNodes[j]; in ConvertToLongNames() [all …]
|
/external/swiftshader/third_party/llvm-7.0/llvm/lib/Target/Hexagon/ |
D | HexagonISelDAGToDAGHVX.cpp | 1389 std::deque<SDNode*> SubNodes; in scalarizeShuffle() local 1390 SubNodes.push_back(LV.getNode()); in scalarizeShuffle() 1391 for (unsigned I = 0; I != SubNodes.size(); ++I) { in scalarizeShuffle() 1392 for (SDValue Op : SubNodes[I]->ops()) in scalarizeShuffle() 1393 SubNodes.push_back(Op.getNode()); in scalarizeShuffle() 1395 while (!SubNodes.empty()) { in scalarizeShuffle() 1396 SDNode *S = SubNodes.front(); in scalarizeShuffle() 1397 SubNodes.pop_front(); in scalarizeShuffle() 1403 bool PendingUser = llvm::any_of(S->uses(), [&SubNodes](const SDNode *U) { in scalarizeShuffle() 1404 return llvm::any_of(SubNodes, [U](const SDNode *T) { in scalarizeShuffle() [all …]
|