diff options
author | Graham Stott <grahams@rcp.co.uk> | 1998-06-07 19:59:23 -0600 |
---|---|---|
committer | Jeff Law <law@gcc.gnu.org> | 1998-06-07 19:59:23 -0600 |
commit | 79990a3950be4add7dfaff05549e9fe7ebf86195 (patch) | |
tree | 50470538880b5936f43c0824c7227f23f8bab879 /gcc | |
parent | 49fa02d9d67616530d588d5d4f0ac37be10ff70d (diff) | |
download | gcc-79990a3950be4add7dfaff05549e9fe7ebf86195.zip gcc-79990a3950be4add7dfaff05549e9fe7ebf86195.tar.gz gcc-79990a3950be4add7dfaff05549e9fe7ebf86195.tar.bz2 |
tree.c (tree_class_check): Add braces to eliminate ambigious else warning.
* tree.c (tree_class_check): Add braces to eliminate ambigious
else warning.
(tree_check): Likewise.
From-SVN: r20325
Diffstat (limited to 'gcc')
-rw-r--r-- | gcc/ChangeLog | 6 | ||||
-rw-r--r-- | gcc/tree.c | 24 |
2 files changed, 20 insertions, 10 deletions
diff --git a/gcc/ChangeLog b/gcc/ChangeLog index 627a3e9..86ef055 100644 --- a/gcc/ChangeLog +++ b/gcc/ChangeLog @@ -1,3 +1,9 @@ +Mon Jun 8 02:55:56 1998 Graham <grahams@rcp.co.uk> + + * tree.c (tree_class_check): Add braces to eliminate ambigious + else warning. + (tree_check): Likewise. + Mon Jun 8 02:49:23 1998 H.J. Lu (hjl@gnu.org) * reg-stack.c (subst_stack_regs_pat): Make sure the top of @@ -4951,11 +4951,13 @@ tree_check (node, code, file, line, nofatal) int nofatal; { if (TREE_CODE (node) != code) - if (nofatal) - return 0; - else - fatal ("%s:%d: Expect %s, have %s\n", file, line, - tree_code_name[code], tree_code_name[TREE_CODE (node)]); + { + if (nofatal) + return 0; + else + fatal ("%s:%d: Expect %s, have %s\n", file, line, + tree_code_name[code], tree_code_name[TREE_CODE (node)]); + } return node; } @@ -4971,11 +4973,13 @@ tree_class_check (node, cl, file, line, nofatal) int nofatal; { if (TREE_CODE_CLASS (TREE_CODE (node)) != cl) - if (nofatal) - return 0; - else - fatal ("%s:%d: Expect '%c', have '%s'\n", file, line, - cl, tree_code_name[TREE_CODE (node)]); + { + if (nofatal) + return 0; + else + fatal ("%s:%d: Expect '%c', have '%s'\n", file, line, + cl, tree_code_name[TREE_CODE (node)]); + } return node; } |