Searched refs:SuccFeasible (Results 1 – 2 of 2) sorted by relevance
| /freebsd/contrib/llvm-project/llvm/include/llvm/Analysis/ |
| H A D | SparsePropagation.h | 373 SmallVector<bool, 16> SuccFeasible; in isEdgeFeasible() local
375 getFeasibleSuccessors(*TI, SuccFeasible, AggressiveUndef); in isEdgeFeasible()
378 if (TI->getSuccessor(i) == To && SuccFeasible[i]) in isEdgeFeasible()
387 SmallVector<bool, 16> SuccFeasible; in visitTerminator() local
388 getFeasibleSuccessors(TI, SuccFeasible, true); in visitTerminator()
393 for (unsigned i = 0, e = SuccFeasible.size(); i != e; ++i) in visitTerminator()
394 if (SuccFeasible[i]) in visitTerminator()
|
| /freebsd/contrib/llvm-project/llvm/lib/Transforms/Utils/ |
| H A D | SCCPSolver.cpp | 1220 SmallVector<bool, 16> SuccFeasible; in visitTerminator() local
1221 getFeasibleSuccessors(TI, SuccFeasible); in visitTerminator()
1226 for (unsigned i = 0, e = SuccFeasible.size(); i != e; ++i) in visitTerminator()
1227 if (SuccFeasible[i]) in visitTerminator()
|