2000-09-29 Kazu Hirata <kazu@hxi.com>

	* ldcref.c: Fix formatting.
	* ldctor.c: Likewise.
	* ldemul.c: Likewise.
	* ldexp.c: Likewise.
	* ldfile.c: Likewise.
	* ldlang.c: Likewise.

1 files changed, 18 insertions, 27 deletions

diff --git a/ld/ldexp.c b/ld/ldexp.c
index 0c38314..7aa8cce 100644
--- a/ld/ldexp.c
+++ b/ld/ldexp.c
@@ -29,7 +29,6 @@ contains a value, a section to which it is relative and a valid bit.
 
 */
 
-
 #include "bfd.h"
 #include "sysdep.h"
 #include "bfdlink.h"
@@ -127,7 +126,7 @@ exp_print_token (code)
   fprintf(config.map_file, "%c",code);
 }
 
-static void 
+static void
 make_abs (ptr)
      etree_value_type *ptr;
 {
@@ -147,7 +146,7 @@ new_abs (value)
   return new;
 }
 
-static void 
+static void
 check (os, name, op)
      lang_output_section_statement_type *os;
      const char *name;
@@ -213,7 +212,7 @@ new_rel_from_section (value, section)
   return new;
 }
 
-static etree_value_type 
+static etree_value_type
 fold_binary (tree, current_section, allocation_done, dot, dotp)
      etree_type *tree;
      lang_output_section_statement_type *current_section;
@@ -264,7 +263,7 @@ fold_binary (tree, current_section, allocation_done, dot, dotp)
 	      make_abs(&other);
 	    }
 
-	  switch (tree->type.node_code) 
+	  switch (tree->type.node_code)
 	    {
 	    case '%':
 	      if (other.value == 0)
@@ -321,7 +320,7 @@ fold_binary (tree, current_section, allocation_done, dot, dotp)
   return result;
 }
 
-etree_value_type 
+etree_value_type
 invalid ()
 {
   etree_value_type new;
@@ -329,7 +328,7 @@ invalid ()
   return new;
 }
 
-static etree_value_type 
+static etree_value_type
 fold_name (tree, current_section, allocation_done, dot)
      etree_type *tree;
      lang_output_section_statement_type *current_section;
@@ -337,10 +336,10 @@ fold_name (tree, current_section, allocation_done, dot)
      bfd_vma dot;
 {
   etree_value_type result;
-  switch (tree->type.node_code) 
+  switch (tree->type.node_code)
       {
       case SIZEOF_HEADERS:
-	if (allocation_done != lang_first_phase_enum) 
+	if (allocation_done != lang_first_phase_enum)
 	  {
 	    result = new_abs ((bfd_vma)
 			      bfd_sizeof_headers (output_bfd,
@@ -474,7 +473,7 @@ fold_name (tree, current_section, allocation_done, dot)
 
   return result;
 }
-etree_value_type 
+etree_value_type
 exp_fold_tree (tree, current_section, allocation_done, dot, dotp)
      etree_type *tree;
      lang_output_section_statement_type *current_section;
@@ -490,7 +489,7 @@ exp_fold_tree (tree, current_section, allocation_done, dot, dotp)
       return result;
     }
 
-  switch (tree->type.node_class) 
+  switch (tree->type.node_class)
     {
     case etree_value:
       result = new_rel (tree->value.value, current_section);
@@ -524,7 +523,7 @@ exp_fold_tree (tree, current_section, allocation_done, dot, dotp)
 			      allocation_done, dot, dotp);
       if (result.valid_p)
 	{
-	  switch (tree->type.node_code) 
+	  switch (tree->type.node_code)
 	    {
 	    case ALIGN_K:
 	      if (allocation_done != lang_first_phase_enum)
@@ -540,7 +539,7 @@ exp_fold_tree (tree, current_section, allocation_done, dot, dotp)
 		  result.value += result.section->bfd_section->vma;
 		  result.section = abs_output_section;
 		}
-	      else 
+	      else
 		result.valid_p = false;
 	      break;
 
@@ -627,7 +626,7 @@ exp_fold_tree (tree, current_section, allocation_done, dot, dotp)
 				 dot, nextdot);
 			}
 		      else
-			*dotp = nextdot; 
+			*dotp = nextdot;
 		    }
 		}
 	    }
@@ -685,7 +684,7 @@ exp_fold_tree (tree, current_section, allocation_done, dot, dotp)
   return result;
 }
 
-static etree_value_type 
+static etree_value_type
 exp_fold_tree_no_dot (tree, current_section, allocation_done)
      etree_type *tree;
      lang_output_section_statement_type *current_section;
@@ -744,7 +743,6 @@ exp_trinop (code, cond, lhs, rhs)
   return new;
 }
 
-
 etree_type *
 exp_unop (code, child)
      int code;
@@ -766,7 +764,6 @@ exp_unop (code, child)
   return new;
 }
 
-
 etree_type *
 exp_nameop (code, name)
      int code;
@@ -778,7 +775,6 @@ exp_nameop (code, name)
   value.name.name = name;
   value.name.type.node_class = etree_name;
 
-
   r = exp_fold_tree_no_dot(&value,
 			   (lang_output_section_statement_type *)NULL,
 			   lang_first_phase_enum);
@@ -791,9 +787,6 @@ exp_nameop (code, name)
 
 }
 
-
-
-
 etree_type *
 exp_assop (code, dst, src)
      int code;
@@ -804,7 +797,6 @@ exp_assop (code, dst, src)
 
   value.assign.type.node_code = code;
 
-
   value.assign.src = src;
   value.assign.dst = dst;
   value.assign.type.node_class = etree_assign;
@@ -853,7 +845,7 @@ exp_assert (exp, message)
   return n;
 }
 
-void 
+void
 exp_print_tree (tree)
      etree_type *tree;
 {
@@ -901,13 +893,13 @@ exp_print_tree (tree)
     break;
   case etree_unary:
     exp_print_token(tree->unary.type.node_code);
-    if (tree->unary.child) 
+    if (tree->unary.child)
     {
     fprintf(config.map_file,"(");
     exp_print_tree(tree->unary.child);
     fprintf(config.map_file,")");
   }
-    
+
     break;
 
   case etree_assert:
@@ -955,7 +947,7 @@ exp_get_vma (tree, def, name, allocation_done)
     return def;
 }
 
-int 
+int
 exp_get_value_int (tree,def,name, allocation_done)
      etree_type *tree;
      int def;
@@ -965,7 +957,6 @@ exp_get_value_int (tree,def,name, allocation_done)
   return (int)exp_get_vma(tree,(bfd_vma)def,name, allocation_done);
 }
 
-
 bfd_vma
 exp_get_abs_int (tree, def, name, allocation_done)
      etree_type *tree;