Fix warious warnings:

	* c-aux-info.c: Include string.h/strings.h.
	* pa.c: Include stdlib.h.
	(pa_combine_instructions): Prototype the function.
	(pa_can_combine_p, forward_branch_p, shadd_constant_p): Likewise.
	(reloc_needed): Add default case for enumeration switch.
	(remove_useless_addtr_insns): Remove unused variable `all'.
	(hppa_expand_prologue): Add explicit braces to avoid
	ambiguous `else'.
	(output_function_epilogue): Remove unused variable `i'.
	(output_millicode_call): Remove unused variable `link'.
	(shadd_constant_p, forward_branch_p): Make the function static.
	(following_call): Explicitly declare to return int.
	(pa_reorg): Declare as void.
	(pa_combine_instructions): Declare as static void.  Add
	parentheses around && within ||.
	* pa.h: Add prototypes for pa_reorg, symbolic_operand,
	following_call, function_label_operand, lhs_lshift_cint_operand
	and zdepi_cint_p.
	* pa.md: Add parentheses around && within ||.
	* cppalloc.c: Include stdlib.h.
	* cpperror.c (cpp_print_containing_files): Remove unused variable
	`i'.  Fix format specifier in fprintf.
	* cse.c (cse_around_loop): Add explicit braces to avoid
	ambiguous `else'.
	(delete_dead_from_cse): Wrap variable `tem' in macro HAVE_cc0.
	* expr.c (expand_expr): Add parentheses around && within ||.
	* final.c (app_enable): Replace fprintf with fputs where there are
	no format specifiers and no trailing argument after the string.
	Eg, when printing ASM_APP_ON/ASM_APP_OFF.
	(app_disable): Likewise.
	(final_end_function): Likewise.
	(final_scan_insn): Likewise.  Remove unused variable `set'.
	(profile_function): Wrap empty if-statement body in {} brackets.
	* function.c: Include stdlib.h.
	(pad_below): Wrap prototype and definition in ARGS_GROW_DOWNWARD.
	(reposition_prologue_and_epilogue_notes): Add parentheses
	around assignment used as truth value.
	* integrate.c (expand_inline_function): Wrap variable
	`cc0_insn' in macro HAVE_cc0.
	* jump.c (jump_optimize): Wrap variable `q' in macro
	HAVE_cc0.  Remove unused variable `prev1'.
	* libgcc2.c (__bb_exit_trace_func): Add parentheses around &&
	within ||.  Fix format specifier in fprintf.
	(__bb_init_prg): Add parentheses around assignment used as
	truth value.
	* local-alloc.c: Include stdlib.h.
	(requires_inout): Add parentheses around assignment used
	as truth value.
	* loop.c (analyze_loop_iterations): Wrap prototype and definition
	in macro HAVE_decrement_and_branch_on_count.
	(insert_bct, instrument_loop_bct): Likewise.
	(move_movables): Add parentheses around assignment used as
	truth value.
	(consec_sets_invariant_p): Likewise.
	(maybe_eliminate_biv_1): Wrap variable `new' in macro HAVE_cc0.
	* objc/objc-act.c: Include stdlib.h.
	(lookup_method_in_protocol_list): Wrap empty else-statement body
	in braces.
	(lookup_protocol_in_reflist): Likewise.
	(objc_add_static_instance): Remove unused variables `decl_expr'
	and `decl_spec'.
	(get_objc_string_decl): Remove unused variable `decl'.
	(generate_static_references): Remove unused variables `idecl' and
	`instance'.
	(check_protocols): Wrap empty else-statement body in braces.
	* protoize.c: Include stdlib.h.
	(substr): Add parentheses around assignment used as truth value.
	(abspath): Likewise.
	(shortpath): Likewise.
	* regmove.c (fixup_match_1): Add parentheses around assignment
	used as truth value.
	* reload.c (push_secondary_reload): Remove unused variable `i'.
	(find_reloads): Add parentheses around assignment used as truth
	value.
	* reload1.c: Include stdlib.h.
	* rtl.h: Correct typo in prototype of offsettable_memref_p.
	* stmt.c (add_case_node): Add parentheses around assignment used
	as truth value.
	(case_tree2list): Likewise.
	* tree.c (valid_machine_attribute): Wrap variable `decl_attr_list'
	in macro VALID_MACHINE_DECL_ATTRIBUTE.  Wrap variable
	`type_attr_list' in macro VALID_MACHINE_TYPE_ATTRIBUTE.
	(merge_attributes): Add explicit braces to avoid ambiguous
	`else'.
	* unroll.c (copy_loop_body): Wrap variable `cc0_insn' in
	macro HAVE_cc0.
	* varasm.c: Include stdlib.h.

From-SVN: r18290

1 files changed, 11 insertions, 11 deletions

diff --git a/gcc/stmt.c b/gcc/stmt.c
index 012ca2b..20140b3 100644
--- a/gcc/stmt.c
+++ b/gcc/stmt.c
@@ -4073,7 +4073,7 @@ add_case_node (low, high, label, duplicate)
 	      if (r->balance < 0)
 		{
 		  /* R-Rotation */
-		  if (p->left = s = r->right)
+		  if ((p->left = s = r->right))
 		    s->parent = p;
 
 		  r->right = p;
@@ -4082,7 +4082,7 @@ add_case_node (low, high, label, duplicate)
 		  s = p->parent;
 		  p->parent = r;
 
-		  if (r->parent = s)
+		  if ((r->parent = s))
 		    {
 		      if (s->left == p)
 			s->left = r;
@@ -4100,11 +4100,11 @@ add_case_node (low, high, label, duplicate)
 		  int b2;
 		  struct case_node *t = r->right;
 
-		  if (p->left = s = t->right)
+		  if ((p->left = s = t->right))
 		    s->parent = p;
 
 		  t->right = p;
-		  if (r->right = s = t->left)
+		  if ((r->right = s = t->left))
 		    s->parent = r;
 
 		  t->left = r;
@@ -4118,7 +4118,7 @@ add_case_node (low, high, label, duplicate)
 		  p->parent = t;
 		  r->parent = t;
 
-		  if (t->parent = s)
+		  if ((t->parent = s))
 		    {
 		      if (s->left == p)
 			s->left = t;
@@ -4152,7 +4152,7 @@ add_case_node (low, high, label, duplicate)
 		{
 		  /* L-Rotation */
 
-		  if (p->right = s = r->left)
+		  if ((p->right = s = r->left))
 		    s->parent = p;
 
 		  r->left = p;
@@ -4160,7 +4160,7 @@ add_case_node (low, high, label, duplicate)
 		  r->balance = 0;
 		  s = p->parent;
 		  p->parent = r;
-		  if (r->parent = s)
+		  if ((r->parent = s))
 		    {
 		      if (s->left == p)
 			s->left = r;
@@ -4179,12 +4179,12 @@ add_case_node (low, high, label, duplicate)
 		  int b2;
 		  struct case_node *t = r->left;
 
-		  if (p->right = s = t->left)
+		  if ((p->right = s = t->left))
 		    s->parent = p;
 
 		  t->left = p;
 
-		  if (r->left = s = t->right)
+		  if ((r->left = s = t->right))
 		    s->parent = r;
 
 		  t->right = r;
@@ -4198,7 +4198,7 @@ add_case_node (low, high, label, duplicate)
 		  p->parent = t;
 		  r->parent = t;
 
-		  if (t->parent = s)
+		  if ((t->parent = s))
 		    {
 		      if (s->left == p)
 			s->left = t;
@@ -4981,7 +4981,7 @@ case_tree2list (node, right)
     right = case_tree2list (node->right, right);
 
   node->right = right;
-  if (left = node->left)
+  if ((left = node->left))
     {
       node->left = 0;
       return case_tree2list (left, node);