Home
last modified time | relevance | path

Searched refs:DFI (Results 1 – 12 of 12) sorted by relevance

/external/llvm/lib/Analysis/
DIteratedDominanceFrontier.cpp25 for (auto DFI = df_begin(DT.getRootNode()), DFE = df_end(DT.getRootNode()); in calculate() local
26 DFI != DFE; ++DFI) { in calculate()
27 DomLevels[*DFI] = DFI.getPathLength() - 1; in calculate()
/external/llvm/lib/Transforms/Utils/
DMemorySSA.cpp251 for (auto DFI = df_begin(DT->getRootNode()), DFE = df_end(DT->getRootNode()); in computeDomLevels() local
252 DFI != DFE; ++DFI) in computeDomLevels()
253 DomLevels[*DFI] = DFI.getPathLength() - 1; in computeDomLevels()
1110 auto DFI = df_begin(StartingAccess); in UpwardsDFSWalk() local
1111 for (auto DFE = df_end(StartingAccess); DFI != DFE;) { in UpwardsDFSWalk()
1112 MemoryAccess *CurrAccess = *DFI; in UpwardsDFSWalk()
1136 ++DFI; in UpwardsDFSWalk()
1147 auto DFICopy = DFI; in UpwardsDFSWalk()
1203 assert(DFI.getPathLength() > 0 && "We dropped our path?"); in UpwardsDFSWalk()
1204 unsigned N = DFI.getPathLength(); in UpwardsDFSWalk()
[all …]
/external/swiftshader/third_party/LLVM/include/llvm/Analysis/
DDominanceFrontier.h126 const_iterator DFI = find(Node); in compare() local
127 if (DFI == end()) in compare()
130 if (compareDomSet(I->second, DFI->second)) in compare()
/external/swiftshader/third_party/LLVM/lib/CodeGen/
DProcessImplicitDefs.cpp100 DFI = df_ext_begin(Entry, Visited), E = df_ext_end(Entry, Visited); in runOnMachineFunction() local
101 DFI != E; ++DFI) { in runOnMachineFunction()
102 MachineBasicBlock *MBB = *DFI; in runOnMachineFunction()
DExecutionDepsFix.cpp483 DFI = df_ext_begin(Entry, Visited), DFE = df_ext_end(Entry, Visited); in runOnMachineFunction() local
484 DFI != DFE; ++DFI) { in runOnMachineFunction()
485 MBB = *DFI; in runOnMachineFunction()
DLiveVariables.cpp505 DFI = df_ext_begin(Entry, Visited), E = df_ext_end(Entry, Visited); in runOnMachineFunction() local
506 DFI != E; ++DFI) { in runOnMachineFunction()
507 MachineBasicBlock *MBB = *DFI; in runOnMachineFunction()
DVirtRegRewriter.cpp1208 DFI = df_ext_begin(Entry, Visited), E = df_ext_end(Entry, Visited); in runOnMachineFunction() local
1209 DFI != E; ++DFI) { in runOnMachineFunction()
1210 MBB = *DFI; in runOnMachineFunction()
/external/llvm/include/llvm/Analysis/
DDominanceFrontierImpl.h104 const_iterator DFI = find(Node); in compare() local
105 if (DFI == end()) in compare()
108 if (compareDomSet(I->second, DFI->second)) in compare()
/external/llvm/lib/Transforms/Scalar/
DGuardWidening.cpp247 for (auto DFI = df_begin(DT.getRootNode()), DFE = df_end(DT.getRootNode()); in run() local
248 DFI != DFE; ++DFI) { in run()
249 auto *BB = (*DFI)->getBlock(); in run()
257 Changed |= eliminateGuardViaWidening(II, DFI, GuardsInBlock); in run()
/external/llvm/lib/CodeGen/
DPrologEpilogInserter.cpp1015 for (auto DFI = df_ext_begin(&Fn, Reachable), DFE = df_ext_end(&Fn, Reachable); in replaceFrameIndices() local
1016 DFI != DFE; ++DFI) { in replaceFrameIndices()
1019 if (DFI.getPathLength() >= 2) { in replaceFrameIndices()
1020 MachineBasicBlock *StackPred = DFI.getPath(DFI.getPathLength() - 2); in replaceFrameIndices()
1025 MachineBasicBlock *BB = *DFI; in replaceFrameIndices()
DMachineVerifier.cpp1958 DFI = df_ext_begin(MF, Reachable), DFE = df_ext_end(MF, Reachable); in verifyStackFrame() local
1959 DFI != DFE; ++DFI) { in verifyStackFrame()
1960 const MachineBasicBlock *MBB = *DFI; in verifyStackFrame()
1964 if (DFI.getPathLength() >= 2) { in verifyStackFrame()
1965 const MachineBasicBlock *StackPred = DFI.getPath(DFI.getPathLength() - 2); in verifyStackFrame()
/external/clang/lib/Sema/
DSemaOverload.cpp9830 static unsigned RankDeductionFailure(const DeductionFailureInfo &DFI) { in RankDeductionFailure() argument
9831 switch ((Sema::TemplateDeductionResult)DFI.Result) { in RankDeductionFailure()