diff options
Diffstat (limited to 'gcc/expmed.c')
| -rwxr-xr-x | gcc/expmed.c | 34 |
1 files changed, 17 insertions, 17 deletions
diff --git a/gcc/expmed.c b/gcc/expmed.c index 2cfcfa9..8599fc2 100755 --- a/gcc/expmed.c +++ b/gcc/expmed.c @@ -32,17 +32,17 @@ Boston, MA 02111-1307, USA. */ #include "real.h" #include "recog.h" -static void store_fixed_bit_field PROTO((rtx, int, int, int, rtx, int)); -static void store_split_bit_field PROTO((rtx, int, int, rtx, int)); -static rtx extract_fixed_bit_field PROTO((enum machine_mode, rtx, int, - int, int, rtx, int, int)); -static rtx mask_rtx PROTO((enum machine_mode, int, - int, int)); -static rtx lshift_value PROTO((enum machine_mode, rtx, - int, int)); -static rtx extract_split_bit_field PROTO((rtx, int, int, int, int)); -static void do_cmp_and_jump PROTO((rtx, rtx, enum rtx_code, - enum machine_mode, rtx)); +static void store_fixed_bit_field (rtx, int, int, int, rtx, int); +static void store_split_bit_field (rtx, int, int, rtx, int); +static rtx extract_fixed_bit_field (enum machine_mode, rtx, int, + int, int, rtx, int, int); +static rtx mask_rtx (enum machine_mode, int, + int, int); +static rtx lshift_value (enum machine_mode, rtx, + int, int); +static rtx extract_split_bit_field (rtx, int, int, int, int); +static void do_cmp_and_jump (rtx, rtx, enum rtx_code, + enum machine_mode, rtx); #define CEIL(x,y) (((x) + (y) - 1) / (y)) @@ -2045,15 +2045,15 @@ struct algorithm char log[MAX_BITS_PER_WORD]; }; -static void synth_mult PROTO((struct algorithm *, +static void synth_mult (struct algorithm *, unsigned HOST_WIDE_INT, - int)); -static unsigned HOST_WIDE_INT choose_multiplier PROTO((unsigned HOST_WIDE_INT, + int); +static unsigned HOST_WIDE_INT choose_multiplier (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)); + int *, int *); +static unsigned HOST_WIDE_INT invert_mod2n (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 |