aboutsummaryrefslogtreecommitdiff
path: root/gcc/stmt.c
diff options
context:
space:
mode:
authorAndreas Jaeger <aj@suse.de>2003-07-06 22:42:56 +0200
committerAndreas Jaeger <aj@gcc.gnu.org>2003-07-06 22:42:56 +0200
commit7e51717cfba50c7bd4e44d96afc06b3ac169dca3 (patch)
tree3f6751e6128a794a9cd52796dc7b26e75a461d2c /gcc/stmt.c
parent77f9b92ca44d5e03f97cec02bda2f5bef2b5885c (diff)
downloadgcc-7e51717cfba50c7bd4e44d96afc06b3ac169dca3.zip
gcc-7e51717cfba50c7bd4e44d96afc06b3ac169dca3.tar.gz
gcc-7e51717cfba50c7bd4e44d96afc06b3ac169dca3.tar.bz2
stmt.c: Convert remaining prototypes to ISO C90.
* stmt.c: Convert remaining prototypes to ISO C90. * cfglayout.c: Likewise. * dbxout.c: Likewise. * gcc.c: Likewise. * genemit.c: Likewise. From-SVN: r69015
Diffstat (limited to 'gcc/stmt.c')
-rw-r--r--gcc/stmt.c8
1 files changed, 4 insertions, 4 deletions
diff --git a/gcc/stmt.c b/gcc/stmt.c
index ce11895..493c87a 100644
--- a/gcc/stmt.c
+++ b/gcc/stmt.c
@@ -5130,7 +5130,8 @@ struct case_bit_test
/* Determine whether "1 << x" is relatively cheap in word_mode. */
-static bool lshift_cheap_p ()
+static
+bool lshift_cheap_p (void)
{
static bool init = false;
static bool cheap = true;
@@ -5150,9 +5151,8 @@ static bool lshift_cheap_p ()
number of case nodes, i.e. the node with the most cases gets
tested first. */
-static int case_bit_test_cmp (p1, p2)
- const void *p1;
- const void *p2;
+static
+int case_bit_test_cmp (const void *p1, const void *p2)
{
const struct case_bit_test *d1 = p1;
const struct case_bit_test *d2 = p2;