Whitespace fixups

From-SVN: r113893

1 files changed, 27 insertions, 27 deletions

diff --git a/gcc/cgraphunit.c b/gcc/cgraphunit.c
index bfa7bff..5ff4fff 100644
--- a/gcc/cgraphunit.c
+++ b/gcc/cgraphunit.c
@@ -216,7 +216,7 @@ decide_is_function_needed (struct cgraph_node *node, tree decl)
     return true;
 
   /* Externally visible functions must be output.  The exception is
-     COMDAT functions that must be output only when they are needed. 
+     COMDAT functions that must be output only when they are needed.
 
      When not optimizing, also output the static functions. (see
      PR25962), but don't do so for always_inline functions.
@@ -254,7 +254,7 @@ decide_is_function_needed (struct cgraph_node *node, tree decl)
       || (!node->local.disregard_inline_limits
 	  /* When declared inline, defer even the uninlinable functions.
 	     This allows them to be eliminated when unused.  */
-	  && !DECL_DECLARED_INLINE_P (decl) 
+	  && !DECL_DECLARED_INLINE_P (decl)
 	  && (!node->local.inlinable || !cgraph_default_inline_p (node, NULL))))
     return true;
 
@@ -280,7 +280,7 @@ cgraph_varpool_analyze_pending_decls (void)
       if (DECL_INITIAL (decl))
 	{
 	  visited_nodes = pointer_set_create ();
-          walk_tree (&DECL_INITIAL (decl), record_reference, NULL, visited_nodes);
+	  walk_tree (&DECL_INITIAL (decl), record_reference, NULL, visited_nodes);
 	  pointer_set_destroy (visited_nodes);
 	  visited_nodes = NULL;
 	}
@@ -318,7 +318,7 @@ cgraph_varpool_remove_unreferenced_decls (void)
 	       && TREE_SYMBOL_REFERENCED (DECL_ASSEMBLER_NAME (decl)))
 	      || node->force_output
 	      || decide_is_variable_needed (node, decl)
-	      /* ??? Cgraph does not yet rule the world with an iron hand, 
+	      /* ??? Cgraph does not yet rule the world with an iron hand,
 		 and does not control the emission of debug information.
 		 After a variable has its DECL_RTL set, we must assume that
 		 it may be referenced by the debug information, and we can
@@ -394,7 +394,7 @@ cgraph_reset_node (struct cgraph_node *node)
   /* If node->output is set, then this is a unit-at-a-time compilation
      and we have already begun whole-unit analysis.  This is *not*
      testing for whether we've already emitted the function.  That
-     case can be sort-of legitimately seen with real function 
+     case can be sort-of legitimately seen with real function
      redefinition errors.  I would argue that the front end should
      never present us with such a case, but don't enforce that for now.  */
   gcc_assert (!node->output);
@@ -512,7 +512,7 @@ record_reference (tree *tp, int *walk_subtrees, void *data)
 	{
 	  cgraph_varpool_mark_needed_node (cgraph_varpool_node (t));
 	  if (lang_hooks.callgraph.analyze_expr)
-	    return lang_hooks.callgraph.analyze_expr (tp, walk_subtrees, 
+	    return lang_hooks.callgraph.analyze_expr (tp, walk_subtrees,
 						      data);
 	}
       break;
@@ -558,7 +558,7 @@ cgraph_create_edges (struct cgraph_node *node, tree body)
   tree step;
   visited_nodes = pointer_set_create ();
 
-  /* Reach the trees by walking over the CFG, and note the 
+  /* Reach the trees by walking over the CFG, and note the
      enclosing basic-blocks in the call edges.  */
   FOR_EACH_BB_FN (bb, this_cfun)
     for (bsi = bsi_start (bb); !bsi_end_p (bsi); bsi_next (&bsi))
@@ -578,7 +578,7 @@ cgraph_create_edges (struct cgraph_node *node, tree body)
 	      walk_tree (&TREE_OPERAND (stmt, 0),
 			 record_reference, node, visited_nodes);
 	  }
-	else 
+	else
 	  walk_tree (bsi_stmt_ptr (bsi), record_reference, node, visited_nodes);
       }
 
@@ -595,7 +595,7 @@ cgraph_create_edges (struct cgraph_node *node, tree body)
       else if (TREE_CODE (decl) == VAR_DECL && DECL_INITIAL (decl))
 	walk_tree (&DECL_INITIAL (decl), record_reference, node, visited_nodes);
     }
-    
+
   pointer_set_destroy (visited_nodes);
   visited_nodes = NULL;
 }
@@ -742,7 +742,7 @@ verify_cgraph_node (struct cgraph_node *node)
       error ("node not found in cgraph_hash");
       error_found = true;
     }
-  
+
   if (node->analyzed
       && DECL_SAVED_TREE (node->decl) && !TREE_ASM_WRITTEN (node->decl)
       && (!DECL_EXTERNAL (node->decl) || node->global.inlined_to))
@@ -844,7 +844,7 @@ cgraph_varpool_assemble_decl (struct cgraph_varpool_node *node)
       assemble_variable (decl, 0, 1, 0);
       /* Local static variables are never seen by check_global_declarations
 	 so we need to output debug info by hand.  */
-      if (DECL_CONTEXT (decl) 
+      if (DECL_CONTEXT (decl)
 	  && (TREE_CODE (DECL_CONTEXT (decl)) == BLOCK
 	      || TREE_CODE (DECL_CONTEXT (decl)) == FUNCTION_DECL)
 	  && errorcount == 0 && sorrycount == 0)
@@ -867,7 +867,7 @@ cgraph_varpool_assemble_pending_decls (void)
 
   if (errorcount || sorrycount)
     return false;
- 
+
   /* EH might mark decls as needed during expansion.  This should be safe since
      we don't create references to new function, but it should not be used
      elsewhere.  */
@@ -1019,7 +1019,7 @@ cgraph_finalize_compilation_unit (void)
       tree decl = node->decl;
 
       if (node->local.finalized && !DECL_SAVED_TREE (decl))
-        cgraph_reset_node (node);
+	cgraph_reset_node (node);
 
       if (!node->reachable && DECL_SAVED_TREE (decl))
 	{
@@ -1053,7 +1053,7 @@ cgraph_mark_functions_to_output (void)
     {
       tree decl = node->decl;
       struct cgraph_edge *e;
-      
+
       gcc_assert (!node->output);
 
       for (e = node->callers; e; e = e->next_caller)
@@ -1085,7 +1085,7 @@ cgraph_mark_functions_to_output (void)
 		      || DECL_EXTERNAL (decl));
 
 	}
-      
+
     }
 }
 
@@ -1283,7 +1283,7 @@ cgraph_output_in_order (void)
 }
 
 /* Mark visibility of all functions.
-   
+
    A local function is one whose calls can occur only in the current
    compilation unit and all its calls are explicit, so we can change
    its calling convention.  We simply mark all static functions whose
@@ -1395,7 +1395,7 @@ cgraph_optimize (void)
     }
 
   process_pending_assemble_externals ();
-  
+
   /* Frontend may output common variables after the unit has been finalized.
      It is safe to deal with them here as they are always zero initialized.  */
   cgraph_varpool_analyze_pending_decls ();
@@ -1463,11 +1463,11 @@ cgraph_optimize (void)
       for (node = cgraph_nodes; node; node = node->next)
 	if (node->analyzed
 	    && (node->global.inlined_to
-	        || DECL_SAVED_TREE (node->decl)))
+		|| DECL_SAVED_TREE (node->decl)))
 	  {
 	    error_found = true;
 	    dump_cgraph_node (stderr, node);
- 	  }
+	  }
       if (error_found)
 	internal_error ("nodes with no released memory found");
     }
@@ -1475,7 +1475,7 @@ cgraph_optimize (void)
 }
 
 /* Generate and emit a static constructor or destructor.  WHICH must be
-   one of 'I' or 'D'.  BODY should be a STATEMENT_LIST containing 
+   one of 'I' or 'D'.  BODY should be a STATEMENT_LIST containing
    GENERIC statements.  */
 
 void
@@ -1536,7 +1536,7 @@ cgraph_build_static_cdtor (char which, tree body, int priority)
     }
   else
     cgraph_finalize_function (decl, 0);
-  
+
   if (targetm.have_ctors_dtors)
     {
       void (*fn) (rtx, int);
@@ -1555,7 +1555,7 @@ init_cgraph (void)
   cgraph_dump_file = dump_begin (TDI_cgraph, NULL);
 }
 
-/* The edges representing the callers of the NEW_VERSION node were 
+/* The edges representing the callers of the NEW_VERSION node were
    fixed by cgraph_function_versioning (), now the call_expr in their
    respective tree code should be updated to call the NEW_VERSION.  */
 
@@ -1590,7 +1590,7 @@ cgraph_copy_node_for_versioning (struct cgraph_node *old_version,
    unsigned i;
 
    gcc_assert (old_version);
-   
+
    new_version = cgraph_node (new_decl);
 
    new_version->analyzed = true;
@@ -1617,7 +1617,7 @@ cgraph_copy_node_for_versioning (struct cgraph_node *old_version,
        next_callee = e->next_callee;
        if (e->callee == old_version)
 	 cgraph_redirect_edge_callee (e, new_version);
-         
+
        if (!next_callee)
 	 break;
      }
@@ -1632,7 +1632,7 @@ cgraph_copy_node_for_versioning (struct cgraph_node *old_version,
  }
 
  /* Perform function versioning.
-    Function versioning includes copying of the tree and 
+    Function versioning includes copying of the tree and
     a callgraph update (creating a new cgraph node and updating
     its callees and callers).
 
@@ -1671,9 +1671,9 @@ cgraph_function_versioning (struct cgraph_node *old_version_node,
   /* Update the call_expr on the edges to call the new version node. */
   update_call_expr (new_version_node);
 
-  /* Update the new version's properties.  
+  /* Update the new version's properties.
      Make The new version visible only within this translation unit.
-     ??? We cannot use COMDAT linkage because there is no 
+     ??? We cannot use COMDAT linkage because there is no
      ABI support for this.  */
   DECL_EXTERNAL (new_version_node->decl) = 0;
   DECL_ONE_ONLY (new_version_node->decl) = 0;