[llvm-commits] CVS: llvm/lib/Transforms/Scalar/ADCE.cpp CorrelatedExprs.cpp Mem2Reg.cpp ScalarReplAggregates.cpp TailRecursionElimination.cpp

[Chris Lattner]

Changes in directory llvm/lib/Transforms/Scalar:

ADCE.cpp updated: 1.61 -> 1.62
CorrelatedExprs.cpp updated: 1.13 -> 1.14
Mem2Reg.cpp updated: 1.4 -> 1.5
ScalarReplAggregates.cpp updated: 1.13 -> 1.14
TailRecursionElimination.cpp updated: 1.3 -> 1.4

---
Log message:

Rename Function::getEntryNode -> getEntryBlock



---
Diffs of the changes:

Index: llvm/lib/Transforms/Scalar/ADCE.cpp
diff -u llvm/lib/Transforms/Scalar/ADCE.cpp:1.61 llvm/lib/Transforms/Scalar/ADCE.cpp:1.62
--- llvm/lib/Transforms/Scalar/ADCE.cpp:1.61	Thu Sep 11 11:26:10 2003
+++ llvm/lib/Transforms/Scalar/ADCE.cpp	Sat Sep 20 09:38:50 2003
@@ -195,7 +195,7 @@
   // transformations safely.
   //
   PostDominatorTree &DT = getAnalysis<PostDominatorTree>();
-  if (DT[&Func->getEntryNode()] == 0) {
+  if (DT[&Func->getEntryBlock()] == 0) {
     WorkList.clear();
     return MadeChanges;
   }


Index: llvm/lib/Transforms/Scalar/CorrelatedExprs.cpp
diff -u llvm/lib/Transforms/Scalar/CorrelatedExprs.cpp:1.13 llvm/lib/Transforms/Scalar/CorrelatedExprs.cpp:1.14
--- llvm/lib/Transforms/Scalar/CorrelatedExprs.cpp:1.13	Thu Sep 11 11:26:10 2003
+++ llvm/lib/Transforms/Scalar/CorrelatedExprs.cpp	Sat Sep 20 09:38:50 2003
@@ -291,7 +291,7 @@
   DT = &getAnalysis<DominatorTree>();
   
   std::set<BasicBlock*> VisitedBlocks;
-  bool Changed = TransformRegion(&F.getEntryNode(), VisitedBlocks);
+  bool Changed = TransformRegion(&F.getEntryBlock(), VisitedBlocks);
 
   RegionInfoMap.clear();
   RankMap.clear();


Index: llvm/lib/Transforms/Scalar/Mem2Reg.cpp
diff -u llvm/lib/Transforms/Scalar/Mem2Reg.cpp:1.4 llvm/lib/Transforms/Scalar/Mem2Reg.cpp:1.5
--- llvm/lib/Transforms/Scalar/Mem2Reg.cpp:1.4	Wed Jun 25 09:58:56 2003
+++ llvm/lib/Transforms/Scalar/Mem2Reg.cpp	Sat Sep 20 09:38:50 2003
@@ -38,7 +38,7 @@
   std::vector<AllocaInst*> Allocas;
   const TargetData &TD = getAnalysis<TargetData>();
 
-  BasicBlock &BB = F.getEntryNode();  // Get the entry node for the function
+  BasicBlock &BB = F.getEntryBlock();  // Get the entry node for the function
 
   bool Changed  = false;
   


Index: llvm/lib/Transforms/Scalar/ScalarReplAggregates.cpp
diff -u llvm/lib/Transforms/Scalar/ScalarReplAggregates.cpp:1.13 llvm/lib/Transforms/Scalar/ScalarReplAggregates.cpp:1.14
--- llvm/lib/Transforms/Scalar/ScalarReplAggregates.cpp:1.13	Fri Sep 12 11:02:12 2003
+++ llvm/lib/Transforms/Scalar/ScalarReplAggregates.cpp	Sat Sep 20 09:38:50 2003
@@ -75,7 +75,7 @@
   std::vector<AllocaInst*> Allocas;
   const TargetData &TD = getAnalysis<TargetData>();
 
-  BasicBlock &BB = F.getEntryNode();  // Get the entry node for the function
+  BasicBlock &BB = F.getEntryBlock();  // Get the entry node for the function
 
   bool Changed = false;
   
@@ -108,7 +108,7 @@
   std::vector<AllocationInst*> WorkList;
 
   // Scan the entry basic block, adding any alloca's and mallocs to the worklist
-  BasicBlock &BB = F.getEntryNode();
+  BasicBlock &BB = F.getEntryBlock();
   for (BasicBlock::iterator I = BB.begin(), E = BB.end(); I != E; ++I)
     if (AllocationInst *A = dyn_cast<AllocationInst>(I))
       WorkList.push_back(A);


Index: llvm/lib/Transforms/Scalar/TailRecursionElimination.cpp
diff -u llvm/lib/Transforms/Scalar/TailRecursionElimination.cpp:1.3 llvm/lib/Transforms/Scalar/TailRecursionElimination.cpp:1.4
--- llvm/lib/Transforms/Scalar/TailRecursionElimination.cpp:1.3	Sat Sep 20 00:24:00 2003
+++ llvm/lib/Transforms/Scalar/TailRecursionElimination.cpp	Sat Sep 20 09:38:50 2003
@@ -62,7 +62,7 @@
               // Ok, so this is the first tail call we have found in this
               // function.  Insert a new entry block into the function, allowing
               // us to branch back to the old entry block.
-              OldEntry = &F.getEntryNode();
+              OldEntry = &F.getEntryBlock();
               BasicBlock *NewEntry = new BasicBlock("tailrecurse", OldEntry);
               NewEntry->getInstList().push_back(new BranchInst(OldEntry));