RPCS3/llvm-mirror
1
0
Fork 0
mirror of https://github.com/RPCS3/llvm-mirror.git synced 2025-01-31 17:32:36 +00:00
Code Issues Actions Packages Projects Releases Wiki Activity

fix grammar, thanks Duncan!

Browse Source 
llvm-svn: 60875
This commit is contained in:
Torok Edwin 2008-12-11 11:44:49 +00:00
parent 751b67348d
commit 9d454874f3
2 changed files with 6 additions and 6 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
include/llvm/BasicBlock.h
View File

@ -137,8 +137,8 @@ public:
/// getUniquePredecessor - If this basic block has a unique predecessor block,
/// return the block, otherwise return a null pointer.
/// Note that unique predecessor doesn't mean single edge, there can be
/// multiple edges from the unique predecessor to this block (for example in
/// case of a switch statement with multiple cases having same destination).
/// multiple edges from the unique predecessor to this block (for example
/// a switch statement with multiple cases having the same destination).
BasicBlock *getUniquePredecessor();
const BasicBlock *getUniquePredecessor() const {
return const_cast<BasicBlock*>(this)->getUniquePredecessor();

8
lib/VMCore/BasicBlock.cpp
View File

@ -172,8 +172,8 @@ BasicBlock *BasicBlock::getSinglePredecessor() {
/// getUniquePredecessor - If this basic block has a unique predecessor block,
/// return the block, otherwise return a null pointer.
/// Note that unique predecessor doesn't mean single edge, there can be
/// multiple edges from the unique predecessor to this block (for example in
/// case of a switch statement with multiple cases having same destination).
/// multiple edges from the unique predecessor to this block (for example
/// a switch statement with multiple cases having the same destination).
BasicBlock *BasicBlock::getUniquePredecessor() {
pred_iterator PI = pred_begin(this), E = pred_end(this);
if (PI == E) return 0; // No preds.
@ -182,8 +182,8 @@ BasicBlock *BasicBlock::getUniquePredecessor() {
for (;PI != E; ++PI) {
if (*PI != PredBB)
return 0;
// same predecessor appears multiple times in predecessor list,
// this is ok
// The same predecessor appears multiple times in the predecessor list.
// This is OK.
}
return PredBB;
}