2002-05-07 18:07:59 +00:00
|
|
|
//===-- BasicBlockUtils.cpp - BasicBlock Utilities -------------------------==//
|
2003-10-20 19:43:21 +00:00
|
|
|
//
|
|
|
|
// The LLVM Compiler Infrastructure
|
|
|
|
//
|
|
|
|
// This file was developed by the LLVM research group and is distributed under
|
|
|
|
// the University of Illinois Open Source License. See LICENSE.TXT for details.
|
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
2002-05-07 18:07:59 +00:00
|
|
|
//
|
|
|
|
// This family of functions perform manipulations on basic blocks, and
|
|
|
|
// instructions contained within basic blocks.
|
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
|
|
|
#include "llvm/Transforms/Utils/BasicBlockUtils.h"
|
|
|
|
#include "llvm/Function.h"
|
2004-07-29 17:30:56 +00:00
|
|
|
#include "llvm/Instructions.h"
|
2002-07-29 22:32:08 +00:00
|
|
|
#include "llvm/Constant.h"
|
|
|
|
#include "llvm/Type.h"
|
2002-05-07 18:07:59 +00:00
|
|
|
#include <algorithm>
|
2004-01-09 06:12:26 +00:00
|
|
|
using namespace llvm;
|
2003-11-11 22:41:34 +00:00
|
|
|
|
2002-05-07 18:07:59 +00:00
|
|
|
// ReplaceInstWithValue - Replace all uses of an instruction (specified by BI)
|
|
|
|
// with a value, then remove and delete the original instruction.
|
|
|
|
//
|
2004-01-09 06:12:26 +00:00
|
|
|
void llvm::ReplaceInstWithValue(BasicBlock::InstListType &BIL,
|
|
|
|
BasicBlock::iterator &BI, Value *V) {
|
2002-06-25 16:12:52 +00:00
|
|
|
Instruction &I = *BI;
|
2002-05-07 18:07:59 +00:00
|
|
|
// Replaces all of the uses of the instruction with uses of the value
|
2002-06-25 16:12:52 +00:00
|
|
|
I.replaceAllUsesWith(V);
|
2002-05-07 18:07:59 +00:00
|
|
|
|
2002-06-25 16:12:52 +00:00
|
|
|
std::string OldName = I.getName();
|
|
|
|
|
2003-08-18 14:43:39 +00:00
|
|
|
// Delete the unnecessary instruction now...
|
2002-06-25 16:12:52 +00:00
|
|
|
BI = BIL.erase(BI);
|
2002-05-07 18:07:59 +00:00
|
|
|
|
2002-10-29 23:06:16 +00:00
|
|
|
// Make sure to propagate a name if there is one already...
|
2002-06-25 16:12:52 +00:00
|
|
|
if (OldName.size() && !V->hasName())
|
2002-11-20 18:36:02 +00:00
|
|
|
V->setName(OldName, &BIL.getParent()->getSymbolTable());
|
2002-05-07 18:07:59 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
// ReplaceInstWithInst - Replace the instruction specified by BI with the
|
|
|
|
// instruction specified by I. The original instruction is deleted and BI is
|
|
|
|
// updated to point to the new instruction.
|
|
|
|
//
|
2004-01-09 06:12:26 +00:00
|
|
|
void llvm::ReplaceInstWithInst(BasicBlock::InstListType &BIL,
|
|
|
|
BasicBlock::iterator &BI, Instruction *I) {
|
2002-05-07 18:07:59 +00:00
|
|
|
assert(I->getParent() == 0 &&
|
|
|
|
"ReplaceInstWithInst: Instruction already inserted into basic block!");
|
|
|
|
|
|
|
|
// Insert the new instruction into the basic block...
|
2002-06-25 16:12:52 +00:00
|
|
|
BasicBlock::iterator New = BIL.insert(BI, I);
|
2002-05-07 18:07:59 +00:00
|
|
|
|
|
|
|
// Replace all uses of the old instruction, and delete it.
|
|
|
|
ReplaceInstWithValue(BIL, BI, I);
|
|
|
|
|
|
|
|
// Move BI back to point to the newly inserted instruction
|
2002-06-25 16:12:52 +00:00
|
|
|
BI = New;
|
2002-05-07 18:07:59 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
// ReplaceInstWithInst - Replace the instruction specified by From with the
|
2002-07-29 22:32:08 +00:00
|
|
|
// instruction specified by To.
|
2002-05-07 18:07:59 +00:00
|
|
|
//
|
2004-01-09 06:12:26 +00:00
|
|
|
void llvm::ReplaceInstWithInst(Instruction *From, Instruction *To) {
|
2002-06-25 16:12:52 +00:00
|
|
|
BasicBlock::iterator BI(From);
|
|
|
|
ReplaceInstWithInst(From->getParent()->getInstList(), BI, To);
|
2002-05-07 18:07:59 +00:00
|
|
|
}
|
2002-07-29 22:32:08 +00:00
|
|
|
|
|
|
|
// RemoveSuccessor - Change the specified terminator instruction such that its
|
|
|
|
// successor #SuccNum no longer exists. Because this reduces the outgoing
|
|
|
|
// degree of the current basic block, the actual terminator instruction itself
|
|
|
|
// may have to be changed. In the case where the last successor of the block is
|
|
|
|
// deleted, a return instruction is inserted in its place which can cause a
|
2003-10-10 17:57:28 +00:00
|
|
|
// surprising change in program behavior if it is not expected.
|
2002-07-29 22:32:08 +00:00
|
|
|
//
|
2004-01-09 06:12:26 +00:00
|
|
|
void llvm::RemoveSuccessor(TerminatorInst *TI, unsigned SuccNum) {
|
2002-07-29 22:32:08 +00:00
|
|
|
assert(SuccNum < TI->getNumSuccessors() &&
|
|
|
|
"Trying to remove a nonexistant successor!");
|
|
|
|
|
|
|
|
// If our old successor block contains any PHI nodes, remove the entry in the
|
|
|
|
// PHI nodes that comes from this branch...
|
|
|
|
//
|
|
|
|
BasicBlock *BB = TI->getParent();
|
|
|
|
TI->getSuccessor(SuccNum)->removePredecessor(BB);
|
|
|
|
|
|
|
|
TerminatorInst *NewTI = 0;
|
|
|
|
switch (TI->getOpcode()) {
|
|
|
|
case Instruction::Br:
|
|
|
|
// If this is a conditional branch... convert to unconditional branch.
|
|
|
|
if (TI->getNumSuccessors() == 2) {
|
|
|
|
cast<BranchInst>(TI)->setUnconditionalDest(TI->getSuccessor(1-SuccNum));
|
|
|
|
} else { // Otherwise convert to a return instruction...
|
|
|
|
Value *RetVal = 0;
|
|
|
|
|
|
|
|
// Create a value to return... if the function doesn't return null...
|
|
|
|
if (BB->getParent()->getReturnType() != Type::VoidTy)
|
|
|
|
RetVal = Constant::getNullValue(BB->getParent()->getReturnType());
|
|
|
|
|
|
|
|
// Create the return...
|
|
|
|
NewTI = new ReturnInst(RetVal);
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
|
|
|
|
case Instruction::Invoke: // Should convert to call
|
|
|
|
case Instruction::Switch: // Should remove entry
|
|
|
|
default:
|
|
|
|
case Instruction::Ret: // Cannot happen, has no successors!
|
|
|
|
assert(0 && "Unhandled terminator instruction type in RemoveSuccessor!");
|
|
|
|
abort();
|
|
|
|
}
|
|
|
|
|
|
|
|
if (NewTI) // If it's a different instruction, replace.
|
|
|
|
ReplaceInstWithInst(TI, NewTI);
|
|
|
|
}
|
2003-11-11 22:41:34 +00:00
|
|
|
|