* cfganal.c (dfs_enumerate_from): Use PARAMS.
* genautomata.c (output_insn_code_cases): Likewise.
* real.c (real_format): Likewise.
* tree.c (tree_size): Revise expressions using TREE_CODE_LENGTH to
ensure value is promoted before doing subtraction.
From-SVN: r58064
+2002-10-11 John David Anglin <dave@hiauly1.hia.nrc.ca>
+
+ * cfganal.c (dfs_enumerate_from): Use PARAMS.
+ * genautomata.c (output_insn_code_cases): Likewise.
+ * real.c (real_format): Likewise.
+ * tree.c (tree_size): Revise expressions using TREE_CODE_LENGTH to
+ ensure value is promoted before doing subtraction.
+
Fri Oct 11 22:22:38 CEST 2002 Jan Hubicka <jh@suse.cz>
* calls.c (expand_call): Simplify noreturn call.
dfs_enumerate_from (bb, reverse, predicate, rslt, rslt_max, data)
basic_block bb;
int reverse;
- bool (*predicate) (basic_block, void *);
+ bool (*predicate) PARAMS ((basic_block, void *));
basic_block *rslt;
int rslt_max;
void *data;
function *output_automata_list_code. */
static void
output_insn_code_cases (output_automata_list_code)
- void (*output_automata_list_code) (automata_list_el_t);
+ void (*output_automata_list_code) PARAMS ((automata_list_el_t));
{
decl_t decl, decl2;
int i, j;
struct real_format
{
/* Move to and from the target bytes. */
- void (*encode) (const struct real_format *, long *, const REAL_VALUE_TYPE *);
- void (*decode) (const struct real_format *, REAL_VALUE_TYPE *, const long *);
+ void (*encode) PARAMS ((const struct real_format *, long *,
+ const REAL_VALUE_TYPE *));
+ void (*decode) PARAMS ((const struct real_format *, REAL_VALUE_TYPE *,
+ const long *));
/* The radix of the exponent and digits of the significand. */
int b;
case '1': /* a unary arithmetic expression */
case '2': /* a binary arithmetic expression */
return (sizeof (struct tree_exp)
- + (TREE_CODE_LENGTH (code) - 1) * sizeof (char *));
+ + TREE_CODE_LENGTH (code) * sizeof (char *) - sizeof (char *));
case 'c': /* a constant */
/* We can't use TREE_CODE_LENGTH for INTEGER_CST, since the number of
length = (sizeof (struct tree_common)
+ TREE_CODE_LENGTH (code) * sizeof (char *));
if (code == TREE_VEC)
- length += (TREE_VEC_LENGTH (node) - 1) * sizeof (char *);
+ length += TREE_VEC_LENGTH (node) * sizeof (char *) - sizeof (char *);
return length;
}