| /prebuilts/clang/host/linux-x86/clang-4579689/include/llvm/CodeGen/ |
| ScheduleDAG.h | 703 /// a set of nodes visited during a DFS traversal.
704 BitVector Visited;
713 void Shift(BitVector& Visited, int LowerBound, int UpperBound);
|
| /prebuilts/clang/host/linux-x86/clang-4579689/include/llvm/Support/ |
| GenericDomTreeConstruction.h | 226 // Visited nodes always have positive DFS numbers.
246 // visited later.
263 SmallPtrSet<NodePtr, 32> Visited;
274 if (Visited.insert(VAncestor).second && VInfo.Parent >= LastLinked) {
409 DEBUG(dbgs() << "Last visited node: "
417 // are reverse-unreachable were not visited by previous DFS walks (i.e. CFG
479 assert((Total + 1 == Num) && "Everything should have been visited");
631 SmallDenseSet<TreeNodePtr, 8> Visited;
757 DEBUG(dbgs() << "\tAdding to Visited and AffectedQueue: "
759 II.Visited.insert(CurrentNode)
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4630689/include/clang/AST/ |
| RecursiveASTVisitor.h | 141 /// are still visited, and the patterns of partial specializations
142 /// are visited separately. This behavior can be changed by
145 /// instantiations will be visited at the same time as the pattern
641 bool Visited = CurrSAndVisited.getInt();
642 if (Visited) {
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4630689/include/llvm/CodeGen/ |
| ScheduleDAG.h | 703 /// a set of nodes visited during a DFS traversal.
704 BitVector Visited;
713 void Shift(BitVector& Visited, int LowerBound, int UpperBound);
|
| /prebuilts/clang/host/linux-x86/clang-4630689/include/llvm/Support/ |
| GenericDomTreeConstruction.h | 226 // Visited nodes always have positive DFS numbers.
246 // visited later.
263 SmallPtrSet<NodePtr, 32> Visited;
274 if (Visited.insert(VAncestor).second && VInfo.Parent >= LastLinked) {
409 DEBUG(dbgs() << "Last visited node: "
417 // are reverse-unreachable were not visited by previous DFS walks (i.e. CFG
479 assert((Total + 1 == Num) && "Everything should have been visited");
631 SmallDenseSet<TreeNodePtr, 8> Visited;
757 DEBUG(dbgs() << "\tAdding to Visited and AffectedQueue: "
759 II.Visited.insert(CurrentNode)
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4639204/include/clang/AST/ |
| RecursiveASTVisitor.h | 141 /// are still visited, and the patterns of partial specializations
142 /// are visited separately. This behavior can be changed by
145 /// instantiations will be visited at the same time as the pattern
641 bool Visited = CurrSAndVisited.getInt();
642 if (Visited) {
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4639204/include/llvm/CodeGen/ |
| ScheduleDAG.h | 703 /// a set of nodes visited during a DFS traversal.
704 BitVector Visited;
713 void Shift(BitVector& Visited, int LowerBound, int UpperBound);
|
| /prebuilts/clang/host/linux-x86/clang-4639204/include/llvm/Support/ |
| GenericDomTreeConstruction.h | 226 // Visited nodes always have positive DFS numbers.
246 // visited later.
263 SmallPtrSet<NodePtr, 32> Visited;
274 if (Visited.insert(VAncestor).second && VInfo.Parent >= LastLinked) {
409 DEBUG(dbgs() << "Last visited node: "
417 // are reverse-unreachable were not visited by previous DFS walks (i.e. CFG
479 assert((Total + 1 == Num) && "Everything should have been visited");
631 SmallDenseSet<TreeNodePtr, 8> Visited;
757 DEBUG(dbgs() << "\tAdding to Visited and AffectedQueue: "
759 II.Visited.insert(CurrentNode)
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4691093/include/clang/AST/ |
| RecursiveASTVisitor.h | 141 /// are still visited, and the patterns of partial specializations
142 /// are visited separately. This behavior can be changed by
145 /// instantiations will be visited at the same time as the pattern
641 bool Visited = CurrSAndVisited.getInt();
642 if (Visited) {
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4691093/include/llvm/CodeGen/ |
| ScheduleDAG.h | 703 /// a set of nodes visited during a DFS traversal.
704 BitVector Visited;
713 void Shift(BitVector& Visited, int LowerBound, int UpperBound);
|
| /prebuilts/clang/host/linux-x86/clang-4691093/include/llvm/Support/ |
| GenericDomTreeConstruction.h | 226 // Visited nodes always have positive DFS numbers.
246 // visited later.
263 SmallPtrSet<NodePtr, 32> Visited;
274 if (Visited.insert(VAncestor).second && VInfo.Parent >= LastLinked) {
409 DEBUG(dbgs() << "Last visited node: "
417 // are reverse-unreachable were not visited by previous DFS walks (i.e. CFG
479 assert((Total + 1 == Num) && "Everything should have been visited");
631 SmallDenseSet<TreeNodePtr, 8> Visited;
757 DEBUG(dbgs() << "\tAdding to Visited and AffectedQueue: "
759 II.Visited.insert(CurrentNode)
[all...] |
| /external/clang/lib/CodeGen/ |
| CodeGenModule.h | 185 uint32_t Visited;
191 : VisitedInMainFile(0), MissingInMainFile(0), Visited(0), Missing(0),
193 /// Record that we've visited a function and whether or not that function was
198 ++Visited;
200 /// Record that a function we've visited has no profile data.
206 /// Record that a function we've visited has mismatched profile data.
[all...] |
| /external/clang/lib/StaticAnalyzer/Core/ |
| RegionStore.cpp | 645 llvm::SmallPtrSet<const ClusterBindings *, 16> Visited;
677 return Visited.count(getCluster(R));
698 if (C && !Visited.insert(C).second)
[all...] |
| /external/llvm/lib/Analysis/ |
| InstructionSimplify.cpp | 609 SmallPtrSet<Value *, 4> Visited;
610 Visited.insert(V);
633 } while (Visited.insert(V).second);
[all...] |
| /external/llvm/lib/CodeGen/ |
| RegAllocGreedy.cpp | [all...] |
| /external/llvm/lib/CodeGen/SelectionDAG/ |
| SelectionDAGISel.cpp | [all...] |
| /external/llvm/lib/IR/ |
| Constants.cpp | 370 SmallPtrSet<const Constant *, 8> Visited;
373 Visited.insert(C);
384 if (Visited.insert(ConstOp).second)
[all...] |
| /external/llvm/lib/Target/AMDGPU/ |
| AMDILCFGStructurizer.cpp | 167 Visited.clear();
336 std::map<MachineLoop *, bool> Visited;
[all...] |
| /external/llvm/lib/Target/Hexagon/ |
| RDFGraph.cpp | 1007 NodeSet Visited;
1025 if (Visited.count(DA.Id))
1047 // Mark all the related defs as visited.
1049 Visited.insert(T.Id);
[all...] |
| /external/llvm/lib/Transforms/IPO/ |
| MergeFunctions.cpp | 137 /// when they are first visited. This order is deterministic, and so the
302 /// visited.
[all...] |
| /external/llvm/lib/Transforms/ObjCARC/ |
| ObjCARCOpts.cpp | 88 SmallPtrSet<const Value *, 4> Visited;
98 if (!Visited.insert(P).second)
870 SmallPtrSet<const BasicBlock *, 4> Visited;
[all...] |
| /external/llvm/lib/Transforms/Scalar/ |
| IndVarSimplify.cpp | [all...] |
| LoopRerollPass.cpp | [all...] |
| /external/llvm/lib/Transforms/Utils/ |
| Local.cpp | 410 SmallPtrSet<Instruction*, 4> Visited;
418 if (!Visited.insert(I).second) {
[all...] |
| /external/swiftshader/third_party/LLVM/lib/CodeGen/SelectionDAG/ |
| SelectionDAGISel.cpp | [all...] |
