| /external/llvm/lib/Transforms/IPO/ |
| SampleProfile.cpp | 165 /// \brief Set of visited blocks during propagation.
168 /// \brief Set of visited edges during propagation.
818 /// If \p E has not been visited before, we copy to \p UnknownEdge
823 /// \param UnknownEdge Set if E has not been visited before.
[all...] |
| /external/v8/test/webkit/fast/js/ |
| JSON-parse-reviver.js | 72 debug("Ensure that we visited a value that we have deleted, and that deletion is reflected while filtering.");
91 testPassed("Ensured that property was visited despite Array length being reduced.");
98 testFailed("Visited unexpected property " + i + " with value " + v);
154 debug("Ensure that we visited a value that we have deleted, and that deletion is reflected while filtering.");
164 testFailed("Visited unexpected property " + i + " with value " + v);
|
| /external/llvm/lib/CodeGen/ |
| ScheduleDAGInstrs.cpp | 97 SmallPtrSet<const Value *, 16> Visited;
108 if (!Visited.insert(V).second)
360 // Defs are pushed in the order they are visited and never reordered.
642 SmallPtrSetImpl<const SUnit *> &Visited) {
646 // Remember visited nodes.
647 if (!Visited.insert(SUb).second)
677 iterateChainSucc(AA, MFI, DL, SUa, I->getSUnit(), ExitSU, Depth, Visited);
692 SmallPtrSet<const SUnit*, 16> Visited;
706 // successors. Keep track of visited nodes.
711 Visited);
[all...] |
| MachineTraceMetrics.cpp | 410 SmallPtrSet<const MachineBasicBlock*, 8> Visited;
430 // Skip already visited To blocks.
445 // To is a new block. Mark the block as visited in case the CFG has cycles
447 return LB.Visited.insert(To).second;
461 Bounds.Visited.clear();
465 // All the predecessors have been visited, pick the preferred one.
479 Bounds.Visited.clear();
483 // All the successors have been visited, pick the preferred one.
[all...] |
| LiveVariables.cpp | 645 SmallPtrSet<MachineBasicBlock*,16> Visited;
647 for (MachineBasicBlock *MBB : depth_first_ext(Entry, Visited)) {
670 assert(Visited.count(&*i) != 0 && "unreachable basic block found");
|
| RegAllocGreedy.cpp | [all...] |
| /external/clang/lib/CodeGen/ |
| CoverageMappingGen.cpp | 155 SmallVector<FileID, 8> Visited;
160 if (std::find(Visited.begin(), Visited.end(), File) != Visited.end())
162 Visited.push_back(File);
339 /// \brief A location in the most recently visited file or macro.
439 /// \brief Adjust the most recently visited location to \c EndLoc.
[all...] |
| CodeGenModule.cpp | 263 llvm::SmallPtrSet<const llvm::GlobalAlias*, 4> Visited;
273 if (!Visited.insert(GA2).second)
356 Diags.Report(diag::warn_profile_data_out_of_date) << Visited << Missing
[all...] |
| CodeGenModule.h | 180 uint32_t Visited;
186 : VisitedInMainFile(0), MissingInMainFile(0), Visited(0), Missing(0),
188 /// Record that we've visited a function and whether or not that function was
193 ++Visited;
195 /// Record that a function we've visited has no profile data.
201 /// Record that a function we've visited has mismatched profile data.
[all...] |
| /external/clang/lib/Analysis/ |
| ThreadSafety.cpp | 261 BeforeInfo() : Visited(0) {}
262 BeforeInfo(BeforeInfo &&O) : Vect(std::move(O.Vect)), Visited(O.Visited) {}
265 int Visited;
649 // (excluding back-edges) are visited before the block itself. At
[all...] |
| AnalysisDeclContext.cpp | 484 llvm::SmallPtrSet<const VarDecl*, 4> Visited;
501 if (Visited.insert(VD).second)
|
| /external/llvm/lib/Linker/ |
| IRMover.cpp | 63 Type *get(Type *SrcTy, SmallPtrSet<StructType *, 8> &Visited);
224 SmallPtrSet<StructType *, 8> Visited;
225 return get(Ty, Visited);
228 Type *TypeMapTy::get(Type *Ty, SmallPtrSet<StructType *, 8> &Visited) {
246 if (!IsUniqued && !Visited.insert(cast<StructType>(Ty)).second) {
264 ElementTypes[I] = get(Ty->getContainedType(I), Visited);
[all...] |
| /external/llvm/lib/Transforms/Scalar/ |
| IndVarSimplify.cpp | [all...] |
| Reassociate.cpp | 576 SmallPtrSet<Value*, 8> Visited; // For sanity checking the iteration scheme.
591 assert(Visited.insert(Op).second && "Not first visit!");
601 assert(Visited.insert(Op).second && "Not first visit!");
613 assert(Visited.count(Op) && "In leaf map but not visited!");
[all...] |
| /external/llvm/include/llvm/Analysis/ |
| ScalarEvolutionExpressions.h | 500 SmallPtrSet<const SCEV *, 8> Visited;
503 if (Visited.insert(S).second && Visitor.follow(S))
|
| RegionInfo.h | 574 // Mark the exit of the region as visited, so that the children of the
576 // be visited.
577 super::Visited.insert(Exit);
[all...] |
| /external/llvm/lib/Analysis/ |
| StratifiedSets.h | 363 SmallSet<StratifiedIndex, 16> Visited;
366 if (!Visited.insert(CurrentIndex).second) {
|
| CFLAliasAnalysis.cpp | 789 SmallPtrSet<ConstantExpr *, 4> Visited;
800 if (Visited.insert(Nested).second)
804 if (Visited.insert(Nested).second)
[all...] |
| InlineCost.cpp | [all...] |
| ValueTracking.cpp | 398 SmallPtrSet<const Value *, 32> Visited;
409 if (!Visited.insert(V).second)
[all...] |
| /external/llvm/include/llvm/IR/ |
| DerivedTypes.h | 249 bool isSized(SmallPtrSetImpl<Type *> *Visited = nullptr) const;
|
| /external/llvm/lib/IR/ |
| Verifier.cpp | 207 /// Cache of constants visited in search of ConstantExprs.
269 // Now that we've visited every function, verify that we never asked to
304 void visitAliaseeSubExpr(SmallPtrSetImpl<const GlobalAlias *> &Visited,
559 SmallPtrSet<const GlobalAlias*, 4> Visited;
560 Visited.insert(&GA);
561 visitAliaseeSubExpr(Visited, GA, C);
564 void Verifier::visitAliaseeSubExpr(SmallPtrSetImpl<const GlobalAlias*> &Visited,
571 Assert(Visited.insert(GA2).second, "Aliases cannot form a cycle", &GA);
588 visitAliaseeSubExpr(Visited, GA, *GA2->getAliasee());
590 visitAliaseeSubExpr(Visited, GA, *C2)
[all...] |
| /external/llvm/lib/Transforms/Utils/ |
| PromoteMemoryToRegister.cpp | 259 /// The set of basic blocks the renamer has already visited.
261 SmallPtrSet<BasicBlock *, 16> Visited;
653 // The renamer uses the Visited set to avoid infinite loops. Clear it now.
654 Visited.clear();
[all...] |
| /external/llvm/lib/Target/AMDGPU/ |
| AMDILCFGStructurizer.cpp | 169 Visited.clear();
351 std::map<MachineLoop *, bool> Visited;
[all...] |
| /external/llvm/lib/Target/Hexagon/ |
| HexagonSplitDouble.cpp | 273 USet Visited;
276 if (Visited.count(R))
284 if (Visited.count(T))
287 Visited.insert(T);
[all...] |
