| /external/llvm/include/llvm/IR/ |
| Type.h | 268 bool isSized(SmallPtrSet<const Type*, 4> *Visited = nullptr) const {
280 return isSizedDerivedType(Visited);
422 bool isSizedDerivedType(SmallPtrSet<const Type*, 4> *Visited = nullptr) const;
|
| /external/llvm/lib/Transforms/ObjCARC/ |
| ObjCARCOpts.cpp | 181 SmallPtrSet<const Value *, 4> Visited;
191 if (!Visited.insert(P))
[all...] |
| /external/llvm/lib/Analysis/ |
| LazyCallGraph.cpp | 24 SmallVectorImpl<Constant *> &Worklist, SmallPtrSetImpl<Constant *> &Visited,
51 if (Visited.insert(cast<Constant>(Op)))
62 SmallPtrSet<Constant *, 16> Visited;
69 if (Visited.insert(C))
75 findCallees(Worklist, Visited, Callees, CalleeIndexMap);
113 SmallPtrSet<Constant *, 16> Visited;
116 if (Visited.insert(GV.getInitializer()))
121 findCallees(Worklist, Visited, EntryNodes, EntryIndexMap);
|
| 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...] |
| /external/llvm/lib/IR/ |
| Type.cpp | 158 bool Type::isSizedDerivedType(SmallPtrSet<const Type*, 4> *Visited) const {
160 return ATy->getElementType()->isSized(Visited);
163 return VTy->getElementType()->isSized(Visited);
165 return cast<StructType>(this)->isSized(Visited);
553 bool StructType::isSized(SmallPtrSet<const Type*, 4> *Visited) const {
559 if (Visited && !Visited->insert(this))
566 if (!(*I)->isSized(Visited))
|
| 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/PowerPC/ |
| PPCCTRLoops.cpp | 573 SmallSet<MachineBasicBlock *, 16> Visited;
578 Visited.insert(MBB);
584 Visited.insert(MBB);
630 if (!Visited.count(MBB)) {
|
| /external/llvm/lib/Transforms/Scalar/ |
| 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...] |
| 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...] |
| SROA.cpp | 610 SmallPtrSet<Instruction *, 4> Visited;
612 Visited.insert(Root);
642 if (Visited.insert(cast<Instruction>(U)))
[all...] |
| IndVarSimplify.cpp | [all...] |
| 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...] |
| /external/llvm/include/llvm/Support/ |
| GenericDomTreeConstruction.h | 66 // First time we visited this BB?
92 // Visit the successor next, if it isn't already visited.
116 SmallPtrSet<typename GraphT::NodeType*, 32> Visited;
128 if (Visited.insert(VAncestor) && VInfo.Parent >= LastLinked) {
|
| /external/llvm/lib/Transforms/Utils/ |
| 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/lib/CodeGen/SelectionDAG/ |
| ScheduleDAGSDNodes.cpp | 218 SmallPtrSet<SDNode*, 16> Visited;
229 if (User == Node || !Visited.insert(User))
332 SmallPtrSet<SDNode*, 64> Visited;
334 Visited.insert(DAG->getRoot().getNode());
342 if (Visited.insert(NI->getOperand(i).getNode()))
[all...] |
| /external/chromium_org/chrome/browser/resources/local_ntp/ |
| most_visited_util.js | 7 * @fileoverview Utilities for rendering most visited thumbnails and titles.
94 * Creates a new most visited link element.
142 // Webkit's security policy prevents some Most Visited thumbnails from
186 * @param {boolean} isTitle if the style is for the Most Visited Title.
215 * Decodes most visited styles from URL parameters.
222 * @param {boolean} isTitle if the style is for the Most Visited Title.
|
| /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/chromium_org/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.");
90 testPassed("Ensured that property was visited despite Array length being reduced.");
97 testFailed("Visited unexpected property " + i + " with value " + v);
153 debug("Ensure that we visited a value that we have deleted, and that deletion is reflected while filtering.");
163 testFailed("Visited unexpected property " + i + " with value " + v);
|
| /external/llvm/include/llvm/Analysis/ |
| MemoryDependenceAnalysis.h | 429 DenseMap<BasicBlock*, Value*> &Visited,
|
| ScalarEvolutionExpressions.h | 577 SmallPtrSet<const SCEV *, 8> Visited;
580 if (Visited.insert(S) && Visitor.follow(S))
|
| /external/llvm/lib/CodeGen/ |
| LiveVariables.cpp | 526 SmallPtrSet<MachineBasicBlock*,16> Visited;
529 DFI = df_ext_begin(Entry, Visited), E = df_ext_end(Entry, Visited);
664 assert(Visited.count(&*i) != 0 && "unreachable basic block found");
|
| 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...] |
| /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/clang/lib/CodeGen/ |
| CodeGenModule.cpp | 228 llvm::SmallPtrSet<const llvm::GlobalAlias*, 4> Visited;
238 if (!Visited.insert(GA2))
323 Diags.Report(diag::warn_profile_data_out_of_date) << Visited << Missing
[all...] |
| /external/clang/lib/Analysis/ |
| AnalysisDeclContext.cpp | 460 llvm::SmallPtrSet<const VarDecl*, 4> Visited;
477 if (Visited.insert(VD))
|
