diff --git a/llvm/include/llvm/Transforms/Utils/BasicBlockUtils.h b/llvm/include/llvm/Transforms/Utils/BasicBlockUtils.h index 2b4b97f0b77cafc8c784326c2187462bfa5584bc..a08d2a760a275e7d754c2b9c0d751375a39dcd06 100644 --- a/llvm/include/llvm/Transforms/Utils/BasicBlockUtils.h +++ b/llvm/include/llvm/Transforms/Utils/BasicBlockUtils.h @@ -46,7 +46,7 @@ void DeleteDeadBlock(BasicBlock *BB, DomTreeUpdater *DTU = nullptr); /// no predecessors that are not being deleted themselves. \p BBs must have no /// duplicating blocks. If there are loops among this set of blocks, all /// relevant loop info updates should be done before this function is called. -void DeleteDeadBlocks(SmallVectorImpl &BBs, +void DeleteDeadBlocks(ArrayRef BBs, DomTreeUpdater *DTU = nullptr); /// We know that BB has one predecessor. If there are any single-entry PHI nodes diff --git a/llvm/lib/Transforms/Utils/BasicBlockUtils.cpp b/llvm/lib/Transforms/Utils/BasicBlockUtils.cpp index 8d101f2e4da8861c52365db9aa5f9f06e201fe31..cb8614fcb98be7d9efa16e8005b233f5f713f958 100644 --- a/llvm/lib/Transforms/Utils/BasicBlockUtils.cpp +++ b/llvm/lib/Transforms/Utils/BasicBlockUtils.cpp @@ -48,11 +48,10 @@ using namespace llvm; void llvm::DeleteDeadBlock(BasicBlock *BB, DomTreeUpdater *DTU) { - SmallVector BBs = {BB}; - DeleteDeadBlocks(BBs, DTU); + DeleteDeadBlocks({BB}, DTU); } -void llvm::DeleteDeadBlocks(SmallVectorImpl &BBs, +void llvm::DeleteDeadBlocks(ArrayRef BBs, DomTreeUpdater *DTU) { #ifndef NDEBUG // Make sure that all predecessors of each dead block is also dead.