| /prebuilts/clang/host/darwin-x86/clang-4639204/include/llvm/Support/ |
| GenericDomTreeConstruction.h | 233 for (const NodePtr Succ :
235 const auto SIT = NodeToInfo.find(Succ);
239 if (Succ != BB) SIT->second.ReverseChildren.push_back(BB);
243 if (!Condition(BB, Succ)) continue;
245 // It's fine to add Succ to the map, because we know that it will be
247 auto &SuccInfo = NodeToInfo[Succ];
248 WorkList.push_back(Succ);
783 for (const NodePtr Succ :
785 const TreeNodePtr SuccTN = DT.getNode(Succ);
789 DEBUG(dbgs() << "\tSuccessor " << BlockNamePrinter(Succ)
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4691093/include/llvm/Support/ |
| GenericDomTreeConstruction.h | 233 for (const NodePtr Succ :
235 const auto SIT = NodeToInfo.find(Succ);
239 if (Succ != BB) SIT->second.ReverseChildren.push_back(BB);
243 if (!Condition(BB, Succ)) continue;
245 // It's fine to add Succ to the map, because we know that it will be
247 auto &SuccInfo = NodeToInfo[Succ];
248 WorkList.push_back(Succ);
783 for (const NodePtr Succ :
785 const TreeNodePtr SuccTN = DT.getNode(Succ);
789 DEBUG(dbgs() << "\tSuccessor " << BlockNamePrinter(Succ)
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4579689/include/llvm/Support/ |
| GenericDomTreeConstruction.h | 233 for (const NodePtr Succ :
235 const auto SIT = NodeToInfo.find(Succ);
239 if (Succ != BB) SIT->second.ReverseChildren.push_back(BB);
243 if (!Condition(BB, Succ)) continue;
245 // It's fine to add Succ to the map, because we know that it will be
247 auto &SuccInfo = NodeToInfo[Succ];
248 WorkList.push_back(Succ);
783 for (const NodePtr Succ :
785 const TreeNodePtr SuccTN = DT.getNode(Succ);
789 DEBUG(dbgs() << "\tSuccessor " << BlockNamePrinter(Succ)
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4630689/include/llvm/Support/ |
| GenericDomTreeConstruction.h | 233 for (const NodePtr Succ :
235 const auto SIT = NodeToInfo.find(Succ);
239 if (Succ != BB) SIT->second.ReverseChildren.push_back(BB);
243 if (!Condition(BB, Succ)) continue;
245 // It's fine to add Succ to the map, because we know that it will be
247 auto &SuccInfo = NodeToInfo[Succ];
248 WorkList.push_back(Succ);
783 for (const NodePtr Succ :
785 const TreeNodePtr SuccTN = DT.getNode(Succ);
789 DEBUG(dbgs() << "\tSuccessor " << BlockNamePrinter(Succ)
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4639204/include/llvm/Support/ |
| GenericDomTreeConstruction.h | 233 for (const NodePtr Succ :
235 const auto SIT = NodeToInfo.find(Succ);
239 if (Succ != BB) SIT->second.ReverseChildren.push_back(BB);
243 if (!Condition(BB, Succ)) continue;
245 // It's fine to add Succ to the map, because we know that it will be
247 auto &SuccInfo = NodeToInfo[Succ];
248 WorkList.push_back(Succ);
783 for (const NodePtr Succ :
785 const TreeNodePtr SuccTN = DT.getNode(Succ);
789 DEBUG(dbgs() << "\tSuccessor " << BlockNamePrinter(Succ)
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4691093/include/llvm/Support/ |
| GenericDomTreeConstruction.h | 233 for (const NodePtr Succ :
235 const auto SIT = NodeToInfo.find(Succ);
239 if (Succ != BB) SIT->second.ReverseChildren.push_back(BB);
243 if (!Condition(BB, Succ)) continue;
245 // It's fine to add Succ to the map, because we know that it will be
247 auto &SuccInfo = NodeToInfo[Succ];
248 WorkList.push_back(Succ);
783 for (const NodePtr Succ :
785 const TreeNodePtr SuccTN = DT.getNode(Succ);
789 DEBUG(dbgs() << "\tSuccessor " << BlockNamePrinter(Succ)
[all...] |
| /dalvik/dexgen/src/com/android/dexgen/dex/code/ |
| RopTranslator.java | 263 int succ = block.getPrimarySuccessor(); local
271 if ((succ >= 0) && (succ != nextLabel)) {
286 output.reverseBranch(1, addresses.getStart(succ));
295 addresses.getStart(succ));
|
| /dalvik/dx/src/com/android/dx/dex/code/ |
| RopTranslator.java | 270 int succ = block.getPrimarySuccessor(); local
278 if ((succ >= 0) && (succ != nextLabel)) {
293 output.reverseBranch(1, addresses.getStart(succ));
302 addresses.getStart(succ));
[all...] |
| /external/llvm/lib/Target/WebAssembly/ |
| WebAssemblyCFGStackify.cpp | 182 for (MachineBasicBlock *Succ : MBB->successors()) {
184 if (MachineLoop *SuccL = MLI.getLoopFor(Succ))
185 if (SuccL->getHeader() == Succ && SuccL->contains(MBB))
188 if (--NumPredsLeft[Succ->getNumber()] == 0)
189 Preferred.push(Succ);
|
| /external/llvm/lib/Transforms/Scalar/ |
| StructurizeCFG.cpp | 371 for (BasicBlock *Succ : Term->successors())
372 if (Visited.count(Succ))
373 Loops[Succ] = BB;
448 BasicBlock *Succ = Term->getSuccessor(i);
449 if (Succ != BB)
|
| /external/llvm/lib/Transforms/Utils/ |
| LoopUnrollRuntime.cpp | 75 for (BasicBlock *Succ : successors(Latch)) {
76 for (Instruction &BBI : *Succ) {
222 for (BasicBlock *Succ : successors(Latch)) {
224 if (!L->contains(Succ))
226 for (Instruction &BBI : *Succ) {
|
| SimplifyCFG.cpp | 188 for (BasicBlock *Succ : successors(SI2BB))
189 if (SI1Succs.count(Succ))
190 for (BasicBlock::iterator BBI = Succ->begin(); isa<PHINode>(BBI); ++BBI) {
228 for (BasicBlock *Succ : successors(SI2BB))
229 if (SI1Succs.count(Succ))
230 for (BasicBlock::iterator BBI = Succ->begin(); isa<PHINode>(BBI); ++BBI) {
240 /// Update PHI nodes in Succ to indicate that there will now be entries in it
243 /// of Succ.
244 static void AddPredecessorToBlock(BasicBlock *Succ, BasicBlock *NewPred,
246 if (!isa<PHINode>(Succ->begin())
[all...] |
| /external/mesa3d/src/gallium/drivers/vc4/ |
| vc4_qir.h | 876 #define qir_for_each_successor(succ, block) \
877 for (struct qblock *succ = block->successors[0]; \
878 succ != NULL; \
879 succ = (succ == block->successors[1] ? NULL : \
|
| /prebuilts/go/darwin-x86/src/cmd/compile/internal/ssa/ |
| likelyadjust.go | 320 fmt.Printf("loop finding succ %s of %s is header\n", bb.String(), b.String())
331 fmt.Printf("loop finding succ %s of %s is IRRED, in %s\n", bb.String(), b.String(), f.Name)
343 fmt.Printf("loop finding succ %s of %s has no loop\n", bb.String(), b.String())
345 fmt.Printf("loop finding succ %s of %s provides loop with header %s\n", bb.String(), b.String(), l.header.String())
350 fmt.Printf("loop finding succ %s of %s has no loop\n", bb.String(), b.String())
|
| /prebuilts/go/linux-x86/src/cmd/compile/internal/ssa/ |
| likelyadjust.go | 320 fmt.Printf("loop finding succ %s of %s is header\n", bb.String(), b.String())
331 fmt.Printf("loop finding succ %s of %s is IRRED, in %s\n", bb.String(), b.String(), f.Name)
343 fmt.Printf("loop finding succ %s of %s has no loop\n", bb.String(), b.String())
345 fmt.Printf("loop finding succ %s of %s provides loop with header %s\n", bb.String(), b.String(), l.header.String())
350 fmt.Printf("loop finding succ %s of %s has no loop\n", bb.String(), b.String())
|
| /external/llvm/lib/Support/ |
| DAGDeltaAlgorithm.cpp | 313 // Invariant: Required == (Required union succ*(Required))
327 // succ(CurrentSet) subset Required
329 // succ(CurrentMinSet) subset Required
|
| /external/llvm/lib/Target/AMDGPU/ |
| SIWholeQuadMode.cpp | 307 for (MachineBasicBlock *Succ : MBB.successors()) {
308 BlockInfo &SuccBI = Blocks[Succ];
313 Worklist.push_back(Succ);
|
| /external/swiftshader/third_party/LLVM/lib/Support/ |
| DAGDeltaAlgorithm.cpp | 319 // Invariant: Required == (Required union succ*(Required))
333 // succ(CurrentSet) subset Required
335 // succ(CurrentMinSet) subset Required
|
| /external/swiftshader/third_party/LLVM/lib/Transforms/Utils/ |
| LowerSwitch.cpp | 213 BasicBlock* Succ = Leaf.BB;
214 BranchInst::Create(Succ, Default, Comp, NewLeaf);
218 for (BasicBlock::iterator I = Succ->begin(); isa<PHINode>(I); ++I) {
|
| /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/clang/include/clang/StaticAnalyzer/Core/BugReporter/ |
| BugReporterVisitor.h | 63 VisitNode(const ExplodedNode *Succ, const ExplodedNode *Pred,
324 std::shared_ptr<PathDiagnosticPiece> VisitNode(const ExplodedNode *Succ,
340 std::shared_ptr<PathDiagnosticPiece> VisitNode(const ExplodedNode *Succ,
|
| /prebuilts/clang/host/darwin-x86/clang-4393122/include/clang/StaticAnalyzer/Core/BugReporter/ |
| BugReporterVisitor.h | 63 VisitNode(const ExplodedNode *Succ, const ExplodedNode *Pred,
324 std::shared_ptr<PathDiagnosticPiece> VisitNode(const ExplodedNode *Succ,
340 std::shared_ptr<PathDiagnosticPiece> VisitNode(const ExplodedNode *Succ,
|
| /prebuilts/clang/host/darwin-x86/clang-4479392/include/clang/StaticAnalyzer/Core/BugReporter/ |
| BugReporterVisitor.h | 63 VisitNode(const ExplodedNode *Succ, const ExplodedNode *Pred,
324 std::shared_ptr<PathDiagnosticPiece> VisitNode(const ExplodedNode *Succ,
340 std::shared_ptr<PathDiagnosticPiece> VisitNode(const ExplodedNode *Succ,
|
| /prebuilts/clang/host/darwin-x86/clang-4579689/include/clang/StaticAnalyzer/Core/BugReporter/ |
| BugReporterVisitor.h | 63 VisitNode(const ExplodedNode *Succ, const ExplodedNode *Pred,
324 std::shared_ptr<PathDiagnosticPiece> VisitNode(const ExplodedNode *Succ,
340 std::shared_ptr<PathDiagnosticPiece> VisitNode(const ExplodedNode *Succ,
|
| /prebuilts/clang/host/darwin-x86/clang-4630689/include/clang/StaticAnalyzer/Core/BugReporter/ |
| BugReporterVisitor.h | 63 VisitNode(const ExplodedNode *Succ, const ExplodedNode *Pred,
324 std::shared_ptr<PathDiagnosticPiece> VisitNode(const ExplodedNode *Succ,
340 std::shared_ptr<PathDiagnosticPiece> VisitNode(const ExplodedNode *Succ,
|
| /prebuilts/clang/host/darwin-x86/clang-4639204/include/clang/StaticAnalyzer/Core/BugReporter/ |
| BugReporterVisitor.h | 63 VisitNode(const ExplodedNode *Succ, const ExplodedNode *Pred,
324 std::shared_ptr<PathDiagnosticPiece> VisitNode(const ExplodedNode *Succ,
340 std::shared_ptr<PathDiagnosticPiece> VisitNode(const ExplodedNode *Succ,
|
