| /external/llvm/lib/Analysis/ |
| BasicAliasAnalysis.cpp | 521 /// \brief Track phi nodes we have visited. When interpret "Value" pointer
535 // Visited - Track instructions visited by pointsToConstantMemory.
536 SmallPtrSet<const Value*, 16> Visited;
542 /// all visited phi nodes an making sure that the phis cannot reach the
602 assert(Visited.empty() && "Visited must be cleared after use!");
609 if (!Visited.insert(V)) {
610 Visited.clear();
624 Visited.clear()
[all...] |
| Lint.cpp | 99 SmallPtrSet<Value *, 4> &Visited) const;
619 SmallPtrSet<Value *, 4> Visited;
620 return findValueImpl(V, OffsetOk, Visited);
625 SmallPtrSet<Value *, 4> &Visited) const {
627 if (!Visited.insert(V))
644 return findValueImpl(U, OffsetOk, Visited);
653 return findValueImpl(W, OffsetOk, Visited);
656 return findValueImpl(CI->getOperand(0), OffsetOk, Visited);
661 return findValueImpl(W, OffsetOk, Visited);
670 return findValueImpl(CE->getOperand(0), OffsetOk, Visited);
[all...] |
| MemoryDependenceAnalysis.cpp | 677 SmallPtrSet<BasicBlock*, 64> Visited;
688 if (!Visited.insert(DirtyBB))
784 DenseMap<BasicBlock*, Value*> Visited;
786 Result, Visited, true))
[all...] |
| InstructionSimplify.cpp | 608 SmallPtrSet<Value *, 4> Visited;
609 Visited.insert(V);
627 } while (Visited.insert(V));
[all...] |
| ValueTracking.cpp | [all...] |
| /external/llvm/lib/CodeGen/ |
| LiveIntervalAnalysis.cpp | 491 VisitedTy Visited;
496 I = df_ext_begin(*SuccI, Visited), E = df_ext_end(*SuccI, Visited);
[all...] |
| ScheduleDAGInstrs.cpp | 102 SmallPtrSet<const Value *, 16> Visited;
113 if (!Visited.insert(V))
365 // Defs are pushed in the order they are visited and never reordered.
578 SmallPtrSet<const SUnit*, 16> &Visited) {
582 // Remember visited nodes.
583 if (!Visited.insert(SUb))
613 iterateChainSucc (AA, MFI, SUa, I->getSUnit(), ExitSU, Depth, Visited);
627 SmallPtrSet<const SUnit*, 16> Visited;
640 // Keep track of visited nodes.
645 ExitSU, &Depth, Visited);
[all...] |
| RegAllocGreedy.cpp | [all...] |
| RegisterCoalescer.cpp | [all...] |
| /external/llvm/lib/Target/ARM/ |
| Thumb2SizeReduction.cpp | 193 // Has this block been visited yet?
194 bool Visited;
196 MBBInfo() : HighLatencyCPSR(false), Visited(false) {}
[all...] |
| /external/llvm/lib/Transforms/Scalar/ |
| Reassociate.cpp | 540 SmallPtrSet<Value*, 8> Visited; // For sanity checking the iteration scheme.
555 assert(Visited.insert(Op) && "Not first visit!");
565 assert(Visited.insert(Op) && "Not first visit!");
577 assert(Visited.count(Op) && "In leaf map but not visited!");
[all...] |
| LoopUnswitch.cpp | 503 std::set<BasicBlock*> &Visited) {
504 if (!Visited.insert(BB).second) {
505 // Already visited. Without more analysis, this could indicate an infinite
520 if (!isTrivialLoopExitBlockHelper(L, *SI, ExitBB, Visited))
537 std::set<BasicBlock*> Visited;
538 Visited.insert(L->getHeader()); // Branches to header make infinite loops.
540 if (isTrivialLoopExitBlockHelper(L, BB, ExitBB, Visited))
[all...] |
| SampleProfile.cpp | 188 /// \brief Set of visited blocks during propagation.
191 /// \brief Set of visited edges during propagation.
726 /// If \p E has not been visited before, we copy to \p UnknownEdge
731 /// \param UnknownEdge Set if E has not been visited before.
794 // to match. Additionally, if BB had not been visited before,
795 // we mark it visited.
797 // - Only one edge is unknown and BB has already been visited.
828 // visited, then we can compute E's weight.
[all...] |
| StructurizeCFG.cpp | 171 BBSet Visited;
293 if (Visited.count(Exit))
304 if (Visited.count(Succ))
385 if (Visited.count(*PI)) {
390 if (Visited.count(Other) && !Loops.count(Other) &&
417 if (Visited.count(Entry))
434 // Reset the visited nodes
435 Visited.clear();
444 Visited.insert((*OI)->getEntry());
722 Visited.insert(Node->getEntry())
[all...] |
| /external/llvm/lib/Transforms/Utils/ |
| Local.cpp | 379 SmallPtrSet<Instruction*, 4> Visited;
387 if (!Visited.insert(I)) {
[all...] |
| PromoteMemoryToRegister.cpp | 266 /// The set of basic blocks the renamer has already visited.
268 SmallPtrSet<BasicBlock *, 16> Visited;
647 // The renamer uses the Visited set to avoid infinite loops. Clear it now.
648 Visited.clear();
[all...] |
| /external/llvm/include/llvm/CodeGen/ |
| ScheduleDAG.h | 700 /// Visited - a set of nodes visited during a DFS traversal.
701 BitVector Visited;
710 void Shift(BitVector& Visited, int LowerBound, int UpperBound);
|
| /external/llvm/lib/Analysis/IPA/ |
| InlineCost.cpp | [all...] |
| /external/clang/lib/CodeGen/ |
| CodeGenModule.h | 224 uint32_t Visited;
230 : VisitedInMainFile(0), MissingInMainFile(0), Visited(0), Missing(0),
232 /// Record that we've visited a function and whether or not that function was
237 ++Visited;
239 /// Record that a function we've visited has no profile data.
245 /// Record that a function we've visited has mismatched profile data.
[all...] |
| /external/clang/lib/StaticAnalyzer/Core/ |
| RegionStore.cpp | 648 llvm::SmallPtrSet<const ClusterBindings *, 16> Visited;
691 return Visited.count(getCluster(R));
711 if (C && !Visited.insert(C))
[all...] |
| /external/llvm/lib/CodeGen/SelectionDAG/ |
| SelectionDAGISel.cpp | [all...] |
| /external/llvm/lib/IR/ |
| Constants.cpp | 307 SmallPtrSet<const Constant *, 8> Visited;
310 Visited.insert(C);
321 if (Visited.insert(ConstOp))
[all...] |
| Verifier.cpp | 260 void visitAliaseeSubExpr(SmallPtrSet<const GlobalAlias *, 4> &Visited,
473 SmallPtrSet<const Value *, 4> Visited;
479 if (!Visited.insert(V))
498 SmallPtrSet<const GlobalAlias*, 4> Visited;
499 Visited.insert(&GA);
500 visitAliaseeSubExpr(Visited, GA, C);
503 void Verifier::visitAliaseeSubExpr(SmallPtrSet<const GlobalAlias *, 4> &Visited,
509 Assert1(Visited.insert(GA2), "Aliases cannot form a cycle", &GA);
526 visitAliaseeSubExpr(Visited, GA, *GA2->getAliasee());
528 visitAliaseeSubExpr(Visited, GA, *C2)
[all...] |
| /external/llvm/lib/Target/R600/ |
| AMDILCFGStructurizer.cpp | 348 std::map<MachineLoop *, bool> Visited;
[all...] |
| /external/llvm/lib/Transforms/InstCombine/ |
| InstructionCombining.cpp | [all...] |
