Searched refs:DFI (Results 1 - 12 of 12) sorted by relevance
/external/llvm/lib/Analysis/ |
H A D | IteratedDominanceFrontier.cpp | 25 for (auto DFI = df_begin(DT.getRootNode()), DFE = df_end(DT.getRootNode()); 26 DFI != DFE; ++DFI) { 27 DomLevels[*DFI] = DFI.getPathLength() - 1;
|
/external/swiftshader/third_party/LLVM/include/llvm/Analysis/ |
H A D | DominanceFrontier.h | 126 const_iterator DFI = find(Node); local 127 if (DFI == end()) 130 if (compareDomSet(I->second, DFI->second))
|
/external/swiftshader/third_party/LLVM/lib/CodeGen/ |
H A D | ProcessImplicitDefs.cpp | 100 DFI = df_ext_begin(Entry, Visited), E = df_ext_end(Entry, Visited); 101 DFI != E; ++DFI) { 102 MachineBasicBlock *MBB = *DFI;
|
H A D | ExecutionDepsFix.cpp | 483 DFI = df_ext_begin(Entry, Visited), DFE = df_ext_end(Entry, Visited); 484 DFI != DFE; ++DFI) { 485 MBB = *DFI;
|
H A D | LiveVariables.cpp | 505 DFI = df_ext_begin(Entry, Visited), E = df_ext_end(Entry, Visited); 506 DFI != E; ++DFI) { 507 MachineBasicBlock *MBB = *DFI;
|
H A D | VirtRegRewriter.cpp | 1208 DFI = df_ext_begin(Entry, Visited), E = df_ext_end(Entry, Visited); 1209 DFI != E; ++DFI) { 1210 MBB = *DFI;
|
/external/llvm/include/llvm/Analysis/ |
H A D | DominanceFrontierImpl.h | 104 const_iterator DFI = find(Node); local 105 if (DFI == end()) 108 if (compareDomSet(I->second, DFI->second))
|
/external/llvm/lib/Transforms/Utils/ |
H A D | MemorySSA.cpp | 251 for (auto DFI = df_begin(DT->getRootNode()), DFE = df_end(DT->getRootNode()); 252 DFI != DFE; ++DFI) 253 DomLevels[*DFI] = DFI.getPathLength() - 1; 1110 auto DFI = df_begin(StartingAccess); local 1111 for (auto DFE = df_end(StartingAccess); DFI != DFE;) { 1112 MemoryAccess *CurrAccess = *DFI; 1136 ++DFI; 1145 // Use a copy of DFI becaus [all...] |
/external/llvm/lib/Transforms/Scalar/ |
H A D | GuardWidening.cpp | 247 for (auto DFI = df_begin(DT.getRootNode()), DFE = df_end(DT.getRootNode()); 248 DFI != DFE; ++DFI) { 249 auto *BB = (*DFI)->getBlock(); 257 Changed |= eliminateGuardViaWidening(II, DFI, GuardsInBlock);
|
/external/llvm/lib/CodeGen/ |
H A D | PrologEpilogInserter.cpp | 1015 for (auto DFI = df_ext_begin(&Fn, Reachable), DFE = df_ext_end(&Fn, Reachable); 1016 DFI != DFE; ++DFI) { 1019 if (DFI.getPathLength() >= 2) { 1020 MachineBasicBlock *StackPred = DFI.getPath(DFI.getPathLength() - 2); 1025 MachineBasicBlock *BB = *DFI;
|
H A D | MachineVerifier.cpp | 1958 DFI = df_ext_begin(MF, Reachable), DFE = df_ext_end(MF, Reachable); 1959 DFI != DFE; ++DFI) { 1960 const MachineBasicBlock *MBB = *DFI; 1964 if (DFI.getPathLength() >= 2) { 1965 const MachineBasicBlock *StackPred = DFI.getPath(DFI.getPathLength() - 2);
|
/external/clang/lib/Sema/ |
H A D | SemaOverload.cpp | 9830 static unsigned RankDeductionFailure(const DeductionFailureInfo &DFI) { 9831 switch ((Sema::TemplateDeductionResult)DFI.Result) {
|
Completed in 553 milliseconds