Go to the source code of this file.
|
| | llvm |
| | Compute iterated dominance frontiers using a linear time algorithm.
|
| |
| #define DEBUG_TYPE "bypass-slow-division" |
Definition at line 78 of file BypassSlowDivision.cpp.
References llvm::PHINode::addIncoming(), assert(), llvm::BasicBlock::begin(), llvm::BasicBlock::Create(), llvm::IRBuilder< T, Inserter >::CreateSDiv(), llvm::IRBuilder< T, Inserter >::CreateUDiv(), llvm::BasicBlock::end(), llvm::Instruction::eraseFromParent(), F, llvm::IntegerType::getBitMask(), llvm::IntegerType::getBitWidth(), llvm::Function::getContext(), llvm::BasicBlock::getInstList(), llvm::User::getOperand(), llvm::Instruction::getParent(), llvm::BasicBlock::getParent(), llvm::ConstantInt::getSigned(), llvm::Value::getType(), llvm::DenseMapBase< DerivedT, KeyT, ValueT, KeyInfoT, BucketT >::insert(), llvm::BasicBlock::moveBefore(), llvm::Value::replaceAllUsesWith(), and llvm::BasicBlock::splitBasicBlock().
Referenced by reuseOrInsertFastDiv().
Definition at line 192 of file BypassSlowDivision.cpp.
References llvm::DenseMapBase< DerivedT, KeyT, ValueT, KeyInfoT, BucketT >::end(), llvm::Instruction::eraseFromParent(), llvm::DenseMapBase< DerivedT, KeyT, ValueT, KeyInfoT, BucketT >::find(), llvm::User::getOperand(), insertFastDiv(), and llvm::Value::replaceAllUsesWith().
Referenced by llvm::bypassSlowDivision().