aboutsummaryrefslogtreecommitdiff
path: root/gcc/expmed.c
diff options
context:
space:
mode:
authorJeff Law <law@gcc.gnu.org>1998-04-16 17:07:05 -0600
committerJeff Law <law@gcc.gnu.org>1998-04-16 17:07:05 -0600
commitd77fac3be28ceefab764590a51a07cd6d0af3492 (patch)
tree259f043fcac33e1457c5aba5b29b3ba0ba1ab5e4 /gcc/expmed.c
parent242c13b000c85528a7bc8db97ad9a1bc325ce022 (diff)
downloadgcc-d77fac3be28ceefab764590a51a07cd6d0af3492.zip
gcc-d77fac3be28ceefab764590a51a07cd6d0af3492.tar.gz
gcc-d77fac3be28ceefab764590a51a07cd6d0af3492.tar.bz2
expr.c (store_constructor_field): Add prototype.
* expr.c (store_constructor_field): Add prototype. (memory_use_mode): Likewise. * expmed.c (synth_mult): Add prototype. (choose_multiplier, invert_mod2n): Likewise. From-SVN: r19250
Diffstat (limited to 'gcc/expmed.c')
-rw-r--r--gcc/expmed.c9
1 files changed, 9 insertions, 0 deletions
diff --git a/gcc/expmed.c b/gcc/expmed.c
index 8f0ba07..6e01c92 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