[llvm-commits] CVS: llvm-poolalloc/lib/PoolAllocate/PoolAllocate.cpp PointerCompress.cpp

[John Criswell]

Changes in directory llvm-poolalloc/lib/PoolAllocate:

PoolAllocate.cpp updated: 1.126 -> 1.127
PointerCompress.cpp updated: 1.71 -> 1.72
---
Log message:

Removed unused variables to quelch new warnings from the LLVM build system.


---
Diffs of the changes:  (+6 -6)

 PointerCompress.cpp |    8 ++++----
 PoolAllocate.cpp    |    4 ++--
 2 files changed, 6 insertions(+), 6 deletions(-)


Index: llvm-poolalloc/lib/PoolAllocate/PoolAllocate.cpp
diff -u llvm-poolalloc/lib/PoolAllocate/PoolAllocate.cpp:1.126 llvm-poolalloc/lib/PoolAllocate/PoolAllocate.cpp:1.127
--- llvm-poolalloc/lib/PoolAllocate/PoolAllocate.cpp:1.126	Tue Oct 24 16:43:50 2006
+++ llvm-poolalloc/lib/PoolAllocate/PoolAllocate.cpp	Fri Nov  3 14:14:34 2006
@@ -613,7 +613,7 @@
   // Calculate which DSNodes are reachable from globals.  If a node is reachable
   // from a global, we will create a global pool for it, so no argument passage
   // is required.
-  DSGraph &GG = ECGraphs->getGlobalsGraph();
+  ECGraphs->getGlobalsGraph();
 
   // Map all node reachable from this global to the corresponding nodes in
   // the globals graph.
@@ -680,7 +680,7 @@
 static void DeleteIfIsPoolFree(Instruction *I, AllocaInst *PD,
                              std::multimap<AllocaInst*, CallInst*> &PoolFrees) {
   std::multimap<AllocaInst*, CallInst*>::iterator PFI, PFE;
-  if (CallInst *CI = dyn_cast<CallInst>(I))
+  if (dyn_cast<CallInst>(I))
     for (tie(PFI,PFE) = PoolFrees.equal_range(PD); PFI != PFE; ++PFI)
       if (PFI->second == I) {
         PoolFrees.erase(PFI);


Index: llvm-poolalloc/lib/PoolAllocate/PointerCompress.cpp
diff -u llvm-poolalloc/lib/PoolAllocate/PointerCompress.cpp:1.71 llvm-poolalloc/lib/PoolAllocate/PointerCompress.cpp:1.72
--- llvm-poolalloc/lib/PoolAllocate/PointerCompress.cpp:1.71	Tue Oct 24 16:43:50 2006
+++ llvm-poolalloc/lib/PoolAllocate/PointerCompress.cpp	Fri Nov  3 14:14:34 2006
@@ -234,7 +234,7 @@
 const Type *CompressedPoolInfo::
 ComputeCompressedType(const Type *OrigTy, unsigned NodeOffset,
                       std::map<const DSNode*, CompressedPoolInfo> &Nodes) {
-  if (const PointerType *PTY = dyn_cast<PointerType>(OrigTy)) {
+  if (dyn_cast<PointerType>(OrigTy)) {
     if (ADLFix) {
       DSNode *PointeeNode = getNode()->getLink(NodeOffset).getNode();
       if (PointeeNode == getNode())
@@ -792,7 +792,7 @@
   //
   Value *SrcVal = SI.getOperand(0);
   if (!isa<ConstantPointerNull>(SrcVal)) {
-    if (const CompressedPoolInfo *SrcPI = getPoolInfo(SrcVal)) {
+    if (getPoolInfo(SrcVal)) {
       // If the stored value is compressed, get the xformed version
       SrcVal = getTransformedValue(SrcVal);
 
@@ -886,7 +886,7 @@
       Size = BinaryOperator::createAdd(Size,
                                   ConstantInt::get(Type::UIntTy, OldSizeV-1),
                                        "roundup", &CI);
-      Size = BinaryOperator::createDiv(Size, OldSize, "numnodes", &CI);
+      Size = BinaryOperator::createUDiv(Size, OldSize, "numnodes", &CI);
       Size = BinaryOperator::createMul(Size, NewSize, "newbytes", &CI);
     }
 
@@ -1194,7 +1194,7 @@
 
   // Calculate which DSNodes are reachable from globals.  If a node is reachable
   // from a global, we check to see if the global pool is compressed.
-  DSGraph &GG = ECG->getGlobalsGraph();
+  ECG->getGlobalsGraph();
 
   // Map all node reachable from this global to the corresponding nodes in the
   // globals graph.