Home
last modified time | relevance | path

Searched refs:BlockOrder (Results 1 – 4 of 4) sorted by relevance

/freebsd/contrib/llvm-project/clang/lib/Analysis/
H A DPostOrderCFGView.cpp27 BlockOrder[*I] = Blocks.size() + 1; in PostOrderCFGView()
44 PostOrderCFGView::BlockOrderTy::const_iterator b1It = POV.BlockOrder.find(b1); in operator ()()
45 PostOrderCFGView::BlockOrderTy::const_iterator b2It = POV.BlockOrder.find(b2); in operator ()()
47 unsigned b1V = (b1It == POV.BlockOrder.end()) ? 0 : b1It->second; in operator ()()
48 unsigned b2V = (b2It == POV.BlockOrder.end()) ? 0 : b2It->second; in operator ()()
H A DIntervalPartition.cpp237 BlockOrder.resize(N, 0); in WTOCompare()
239 BlockOrder[WTO[I]->getBlockID()] = I + 1; in WTOCompare()
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Scalar/
H A DGVNSink.cpp149 const DenseMap<const BasicBlock *, unsigned> &BlockOrder) { in ModelledPHI() argument
158 auto ComesBefore = [BlockOrder](OpsType O1, OpsType O2) { in ModelledPHI()
159 return BlockOrder.lookup(O1.first) < BlockOrder.lookup(O2.first); in ModelledPHI()
180 verifyModelledPHI(const DenseMap<const BasicBlock *, unsigned> &BlockOrder) { in verifyModelledPHI() argument
183 auto ComesBefore = [BlockOrder](const BasicBlock *BB1, in verifyModelledPHI()
185 return BlockOrder.lookup(BB1) < BlockOrder.lookup(BB2); in verifyModelledPHI()
200 const DenseMap<const BasicBlock *, unsigned> &BlockOrder) { in ModelledPHI() argument
204 verifyModelledPHI(BlockOrder); in ModelledPHI()
/freebsd/contrib/llvm-project/clang/include/clang/Analysis/Analyses/
H A DPostOrderCFGView.h111 BlockOrderTy BlockOrder; variable