[llvm-commits] [poolalloc] r119700 - in /poolalloc/trunk/lib/DSA: BottomUpClosure.cpp DSCallGraph.cpp DSTest.cpp

[Arushi Aggarwal]

Author: aggarwa4
Date: Thu Nov 18 10:25:46 2010
New Revision: 119700

URL: http://llvm.org/viewvc/llvm-project?rev=119700&view=rev
Log:
Formatting changes. 
No functionality change.

Modified:
    poolalloc/trunk/lib/DSA/BottomUpClosure.cpp
    poolalloc/trunk/lib/DSA/DSCallGraph.cpp
    poolalloc/trunk/lib/DSA/DSTest.cpp

Modified: poolalloc/trunk/lib/DSA/BottomUpClosure.cpp
URL: http://llvm.org/viewvc/llvm-project/poolalloc/trunk/lib/DSA/BottomUpClosure.cpp?rev=119700&r1=119699&r2=119700&view=diff
==============================================================================
--- poolalloc/trunk/lib/DSA/BottomUpClosure.cpp (original)
+++ poolalloc/trunk/lib/DSA/BottomUpClosure.cpp Thu Nov 18 10:25:46 2010
@@ -733,7 +733,8 @@
     
     // Fast path for noop calls.  Note that we don't care about merging globals
     // in the callee with nodes in the caller here.
-    if (!CS.isIndirectCall() && CS.getRetVal().isNull() && CS.getNumPtrArgs() == 0 && !CS.isVarArg()) {
+    if (!CS.isIndirectCall() && CS.getRetVal().isNull()
+        && CS.getNumPtrArgs() == 0 && !CS.isVarArg()) {
       TempFCs.erase(TempFCs.begin());
       continue;
     }
@@ -755,9 +756,9 @@
     // This means, that either it is a direct call site. Or if it is
     // an indirect call site, its calleeNode is complete, and we can
     // resolve this particular call site.
-    assert((CS.isDirectCall() || CS.getCalleeNode()->isCompleteNode()) 
+    assert((CS.isDirectCall() || CS.getCalleeNode()->isCompleteNode())
        && "Resolving an indirect incomplete call site");
-    
+
     if (CS.isIndirectCall()) {
         ++NumIndResolved;
     }
@@ -798,13 +799,13 @@
   Graph->markIncompleteNodes(DSGraph::MarkFormalArgs);
   Graph->computeExternalFlags(DSGraph::DontMarkFormalsExternal);
   Graph->computeIntPtrFlags();
-  
+
   //
   // Update the callgraph with the new information that we have gleaned.
   // NOTE : This must be called before removeDeadNodes, so that no 
   // information is lost due to deletion of DSCallNodes.
   Graph->buildCallGraph(callgraph,GlobalFunctionList, filterCallees);
-  
+
   // Delete dead nodes.  Treat globals that are unreachable but that can
   // reach live nodes as live.
   Graph->removeDeadNodes(DSGraph::KeepUnreachableGlobals);

Modified: poolalloc/trunk/lib/DSA/DSCallGraph.cpp
URL: http://llvm.org/viewvc/llvm-project/poolalloc/trunk/lib/DSA/DSCallGraph.cpp?rev=119700&r1=119699&r2=119700&view=diff
==============================================================================
--- poolalloc/trunk/lib/DSA/DSCallGraph.cpp (original)
+++ poolalloc/trunk/lib/DSA/DSCallGraph.cpp Thu Nov 18 10:25:46 2010
@@ -114,11 +114,11 @@
        ii != ee; ++ii)
     if (!ValMap.count(*ii))
       tarjan_rec(*ii, Stack, NextID, ValMap);
-          
+
   removeECFunctions();
 }
 
-static void removeECs(DSCallGraph::FuncSet& F, 
+static void removeECs(DSCallGraph::FuncSet& F,
                       llvm::EquivalenceClasses<const llvm::Function*>& ECs) {
   DSCallGraph::FuncSet result;
   for (DSCallGraph::FuncSet::const_iterator ii = F.begin(), ee = F.end();

Modified: poolalloc/trunk/lib/DSA/DSTest.cpp
URL: http://llvm.org/viewvc/llvm-project/poolalloc/trunk/lib/DSA/DSTest.cpp?rev=119700&r1=119699&r2=119700&view=diff
==============================================================================
--- poolalloc/trunk/lib/DSA/DSTest.cpp (original)
+++ poolalloc/trunk/lib/DSA/DSTest.cpp Thu Nov 18 10:25:46 2010
@@ -372,7 +372,8 @@
 /// See 'printNode' for more details.
 /// Returns true iff the user specified nodes to print.
 ///
-static bool printNodes(llvm::raw_ostream &O, const Module *M, const DataStructures *DS) {
+static bool printNodes(llvm::raw_ostream &O, const Module *M,
+                       const DataStructures *DS) {
   cl::list<std::string>::iterator I = PrintNodesForValues.begin(),
                                   E = PrintNodesForValues.end();
   if (I != E) {
@@ -391,7 +392,8 @@
 /// should be merged, is in fact merged.
 /// Returns true iff the user specified any nodes for this option.
 ///
-static bool checkIfNodesAreSame(llvm::raw_ostream &O, const Module *M, const DataStructures *DS) {
+static bool checkIfNodesAreSame(llvm::raw_ostream &O, const Module *M,
+                                const DataStructures *DS) {
 
   // Verify all nodes listed in "CheckNodesSame" belong to the same node.
   cl::list<std::string>::iterator I = CheckNodesSame.begin(),
@@ -416,7 +418,8 @@
 /// shouldn't be merged, wasn't merged
 /// Returns true iff the user specified any nodes for this option.
 ///
-static bool checkIfNodesAreNotSame(llvm::raw_ostream &O, const Module *M, const DataStructures *DS) {
+static bool checkIfNodesAreNotSame(llvm::raw_ostream &O, const Module *M,
+                                   const DataStructures *DS) {
 
   // Verify all nodes listed in "CheckNodesNotSame" belong to distinct nodes.
   cl::list<std::string>::iterator I = CheckNodesNotSame.begin(),
@@ -450,7 +453,8 @@
 /// Returns true iff the user specified anything for this option
 ///
 
-static bool checkTypes(llvm::raw_ostream &O, const Module *M, const DataStructures *DS) {
+static bool checkTypes(llvm::raw_ostream &O, const Module *M,
+                       const DataStructures *DS) {
 
   // Verify all nodes listed in "CheckType" have the same Type
   cl::list<std::string>::iterator I = CheckType.begin(),
@@ -490,7 +494,8 @@
 /// Where +flags means 'this node should have these flags'
 /// And -flags means 'this node should NOT have these flags'
 ///
-static bool verifyFlags(llvm::raw_ostream &O, const Module *M, const DataStructures *DS) {
+static bool verifyFlags(llvm::raw_ostream &O, const Module *M,
+                        const DataStructures *DS) {
   cl::list<std::string>::iterator I = VerifyFlags.begin(),
                                   E = VerifyFlags.end();
   if (I != E) {
@@ -549,7 +554,8 @@
 ///
 /// checks that the first function calls the rest of the
 /// functions in the list
-static bool checkCallees(llvm::raw_ostream &O, const Module *M, const DataStructures *DS) {
+static bool checkCallees(llvm::raw_ostream &O, const Module *M,
+                         const DataStructures *DS) {
 
   //Mangled names must be provided for C++
   cl::list<std::string>::iterator I = CheckCallees.begin(),