Commit e49a1d2e by Kaveh R. Ghazi Committed by Kaveh Ghazi

cse.c (fold_rtx): Avoid empty body in an if-statement.

	* cse.c (fold_rtx): Avoid empty body in an if-statement.

	* doloop.c (doloop_iterations_max, doloop_modify): Avoid using the
	`U' integer constant suffix.

	* dwarf2out.c (add_subscript_info): Avoid empty body in an
	else-statement.

	* sparc/sol2.h (__enable_execute_stack): Prototype.

From-SVN: r35687
parent 78fbdbf7
2000-08-14 Kaveh R. Ghazi <ghazi@caip.rutgers.edu>
* cse.c (fold_rtx): Avoid empty body in an if-statement.
* doloop.c (doloop_iterations_max, doloop_modify): Avoid using the
`U' integer constant suffix.
* dwarf2out.c (add_subscript_info): Avoid empty body in an
else-statement.
* sparc/sol2.h (__enable_execute_stack): Prototype.
2000-08-14 David Edelsohn <edelsohn@gnu.org> 2000-08-14 David Edelsohn <edelsohn@gnu.org>
* collect2.c: Remove use of AIX import file. * collect2.c: Remove use of AIX import file.
......
...@@ -255,6 +255,7 @@ static void check_enabling(void) \ ...@@ -255,6 +255,7 @@ static void check_enabling(void) \
need_enable_exec_stack = 1; \ need_enable_exec_stack = 1; \
} \ } \
\ \
extern void __enable_execute_stack (void *); \
void \ void \
__enable_execute_stack (addr) \ __enable_execute_stack (addr) \
void *addr; \ void *addr; \
......
...@@ -3646,7 +3646,7 @@ fold_rtx (x, insn) ...@@ -3646,7 +3646,7 @@ fold_rtx (x, insn)
if (fmt[i] == 'E') if (fmt[i] == 'E')
/* Don't try to fold inside of a vector of expressions. /* Don't try to fold inside of a vector of expressions.
Doing nothing is harmless. */ Doing nothing is harmless. */
; {;}
} }
/* If a commutative operation, place a constant integer as the second /* If a commutative operation, place a constant integer as the second
......
...@@ -197,7 +197,7 @@ doloop_iterations_max (loop_info, mode, nonneg) ...@@ -197,7 +197,7 @@ doloop_iterations_max (loop_info, mode, nonneg)
if (GET_CODE (max_value) == CONST_INT) if (GET_CODE (max_value) == CONST_INT)
umax = INTVAL (max_value); umax = INTVAL (max_value);
else else
umax = (2U << (GET_MODE_BITSIZE (mode) - 1)) - 1; umax = ((unsigned)2 << (GET_MODE_BITSIZE (mode) - 1)) - 1;
n_iterations_max = umax - umin; n_iterations_max = umax - umin;
break; break;
...@@ -212,12 +212,12 @@ doloop_iterations_max (loop_info, mode, nonneg) ...@@ -212,12 +212,12 @@ doloop_iterations_max (loop_info, mode, nonneg)
if (GET_CODE (min_value) == CONST_INT) if (GET_CODE (min_value) == CONST_INT)
smin = INTVAL (min_value); smin = INTVAL (min_value);
else else
smin = -(1U << (GET_MODE_BITSIZE (mode) - 1)); smin = -((unsigned)1 << (GET_MODE_BITSIZE (mode) - 1));
if (GET_CODE (max_value) == CONST_INT) if (GET_CODE (max_value) == CONST_INT)
smax = INTVAL (max_value); smax = INTVAL (max_value);
else else
smax = (1U << (GET_MODE_BITSIZE (mode) - 1)) - 1; smax = ((unsigned)1 << (GET_MODE_BITSIZE (mode) - 1)) - 1;
n_iterations_max = smax - smin; n_iterations_max = smax - smin;
break; break;
...@@ -230,7 +230,7 @@ doloop_iterations_max (loop_info, mode, nonneg) ...@@ -230,7 +230,7 @@ doloop_iterations_max (loop_info, mode, nonneg)
else else
/* We need to conservatively assume that we might have the maximum /* We need to conservatively assume that we might have the maximum
number of iterations without any additional knowledge. */ number of iterations without any additional knowledge. */
n_iterations_max = (2U << (GET_MODE_BITSIZE (mode) - 1)) - 1; n_iterations_max = ((unsigned)2 << (GET_MODE_BITSIZE (mode) - 1)) - 1;
break; break;
default: default:
...@@ -241,8 +241,9 @@ doloop_iterations_max (loop_info, mode, nonneg) ...@@ -241,8 +241,9 @@ doloop_iterations_max (loop_info, mode, nonneg)
/* If we know that the iteration count is non-negative then adjust /* If we know that the iteration count is non-negative then adjust
n_iterations_max if it is so large that it appears negative. */ n_iterations_max if it is so large that it appears negative. */
if (nonneg && n_iterations_max > (1U << (GET_MODE_BITSIZE (mode) - 1))) if (nonneg
n_iterations_max = (1U << (GET_MODE_BITSIZE (mode) - 1)) - 1; && n_iterations_max > ((unsigned)1 << (GET_MODE_BITSIZE (mode) - 1)))
n_iterations_max = ((unsigned)1 << (GET_MODE_BITSIZE (mode) - 1)) - 1;
return n_iterations_max; return n_iterations_max;
} }
...@@ -451,7 +452,7 @@ doloop_modify (loop, iterations, iterations_max, ...@@ -451,7 +452,7 @@ doloop_modify (loop, iterations, iterations_max,
/* Determine if the iteration counter will be non-negative. /* Determine if the iteration counter will be non-negative.
Note that the maximum value loaded is iterations_max - 1. */ Note that the maximum value loaded is iterations_max - 1. */
if ((unsigned HOST_WIDE_INT) INTVAL (iterations_max) if ((unsigned HOST_WIDE_INT) INTVAL (iterations_max)
<= (1U << (GET_MODE_BITSIZE (GET_MODE (counter_reg)) - 1))) <= ((unsigned)1 << (GET_MODE_BITSIZE (GET_MODE (counter_reg)) - 1)))
nonneg = 1; nonneg = 1;
break; break;
......
...@@ -7566,7 +7566,7 @@ add_subscript_info (type_die, type) ...@@ -7566,7 +7566,7 @@ add_subscript_info (type_die, type)
/* We have an array type with an unspecified length. The DWARF-2 /* We have an array type with an unspecified length. The DWARF-2
spec does not say how to handle this; let's just leave out the spec does not say how to handle this; let's just leave out the
bounds. */ bounds. */
; {;}
#ifndef MIPS_DEBUGGING_INFO #ifndef MIPS_DEBUGGING_INFO
} }
......
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment