|
LLVM
3.7.0
|
Go to the source code of this file.
Namespaces | |
| llvm | |
| Compute iterated dominance frontiers using a linear time algorithm. | |
Functions | |
| bool | llvm::bypassSlowDivision (Function &F, Function::iterator &I, const DenseMap< unsigned int, unsigned int > &BypassWidth) |
| This optimization identifies DIV instructions that can be profitably bypassed and carried out with a shorter, faster divide. More... | |
1.8.6