diff options
| -rw-r--r-- | gcc/expmed.c | 9 | ||||
| -rw-r--r-- | gcc/expr.c | 3 |
2 files changed, 12 insertions, 0 deletions
diff --git a/gcc/expmed.c b/gcc/expmed.c index 8f0ba071364..6e01c929a3e 100644 --- a/gcc/expmed.c +++ b/gcc/expmed.c @@ -1914,6 +1914,15 @@ struct algorithm char log[MAX_BITS_PER_WORD]; }; +static void synth_mult PROTO((struct algorithm *, + unsigned HOST_WIDE_INT, + int)); +static unsigned HOST_WIDE_INT choose_multiplier PROTO((unsigned HOST_WIDE_INT, + int, int, + unsigned HOST_WIDE_INT *, + int *, int *)); +static unsigned HOST_WIDE_INT invert_mod2n PROTO((unsigned HOST_WIDE_INT, + int)); /* Compute and return the best algorithm for multiplying by T. The algorithm must cost less than cost_limit If retval.cost >= COST_LIMIT, no algorithm was found and all diff --git a/gcc/expr.c b/gcc/expr.c index 8dfcefb0d43..d42f6345d0c 100644 --- a/gcc/expr.c +++ b/gcc/expr.c @@ -164,9 +164,12 @@ static void clear_by_pieces_1 PROTO((rtx (*) (rtx, ...), enum machine_mode, struct clear_by_pieces *)); static int is_zeros_p PROTO((tree)); static int mostly_zeros_p PROTO((tree)); +static void store_constructor_field PROTO((rtx, int, int, enum machine_mode, + tree, tree, int)); static void store_constructor PROTO((tree, rtx, int)); static rtx store_field PROTO((rtx, int, int, enum machine_mode, tree, enum machine_mode, int, int, int)); +static enum memory_use_mode PROTO((enum expand_modifier)); static tree save_noncopied_parts PROTO((tree, tree)); static tree init_noncopied_parts PROTO((tree, tree)); static int safe_from_p PROTO((rtx, tree, int)); |