From 0f41302f4736dbb0fbf4690d6430ce581c5a9d80 Mon Sep 17 00:00:00 2001 From: Mike Stump Date: Wed, 3 Jul 1996 22:07:53 +0000 Subject: formatting tweaks From-SVN: r12390 --- gcc/genrecog.c | 10 +++++----- 1 file changed, 5 insertions(+), 5 deletions(-) (limited to 'gcc/genrecog.c') diff --git a/gcc/genrecog.c b/gcc/genrecog.c index 21f1c06..b07c70f 100644 --- a/gcc/genrecog.c +++ b/gcc/genrecog.c @@ -120,7 +120,7 @@ static int next_number; static int next_insn_code; /* Similar, but counts all expressions in the MD file; used for - error messages. */ + error messages. */ static int next_index; @@ -498,7 +498,7 @@ add_to_sequence (pattern, last, position) if (GET_CODE (XEXP (pattern, 0)) == CC0) break; - /* ... fall through ... */ + /* ... fall through ... */ case COMPARE: /* Enforce the mode on the first operand to avoid ambiguous insns. */ @@ -572,7 +572,7 @@ not_both_true (d1, d2, toplevel) struct decision *p1, *p2; /* If they are both to test modes and the modes are different, they aren't - both true. Similarly for codes, integer elements, and vector lengths. */ + both true. Similarly for codes, integer elements, and vector lengths. */ if ((d1->enforce_mode && d2->enforce_mode && d1->mode != VOIDmode && d2->mode != VOIDmode && d1->mode != d2->mode) @@ -1139,7 +1139,7 @@ write_tree_1 (tree, prevpos, afterward, type) seen any of the codes that are valid for the predicate, we can write a series of "case" statement, one for each possible code. Since we are already in a switch, these redundant tests - are very cheap and will reduce the number of predicate called. */ + are very cheap and will reduce the number of predicate called. */ if (p->pred >= 0) { @@ -1309,7 +1309,7 @@ write_tree_1 (tree, prevpos, afterward, type) } /* Now that most mode and code tests have been done, we can write out - a label for an inner node, if we haven't already. */ + a label for an inner node, if we haven't already. */ if (p->label_needed) printf ("%sL%d:\n", indents[indent - 2], p->number); -- cgit v1.1