diff options
| author | Mike Stump <mrs@gcc.gnu.org> | 1996-07-03 22:07:53 +0000 |
|---|---|---|
| committer | Mike Stump <mrs@gcc.gnu.org> | 1996-07-03 22:07:53 +0000 |
| commit | 0f41302f4736dbb0fbf4690d6430ce581c5a9d80 (patch) | |
| tree | e82dd48a4282d7b9e8b1c71b065b52af17254c52 /gcc/expmed.c | |
| parent | 9753f1136864a98cca12ab71f0ffe1af4dd84486 (diff) | |
| download | gcc-0f41302f4736dbb0fbf4690d6430ce581c5a9d80.tar.gz | |
formatting tweaks
From-SVN: r12390
Diffstat (limited to 'gcc/expmed.c')
| -rw-r--r-- | gcc/expmed.c | 6 |
1 files changed, 3 insertions, 3 deletions
diff --git a/gcc/expmed.c b/gcc/expmed.c index a89f17b55f7..459d284968f 100644 --- a/gcc/expmed.c +++ b/gcc/expmed.c @@ -1470,7 +1470,7 @@ extract_fixed_bit_field (tmode, op0, offset, bitsize, bitpos, #ifdef SLOW_ZERO_EXTEND /* Always generate an `and' if we just zero-extended op0 and SLOW_ZERO_EXTEND, since it - will combine fruitfully with the zero-extend. */ + will combine fruitfully with the zero-extend. */ || tmode != mode #endif #endif @@ -2474,7 +2474,7 @@ invert_mod2n (x, n) unsigned HOST_WIDE_INT x; int n; { - /* Solve x*y == 1 (mod 2^n), where x is odd. Return y. */ + /* Solve x*y == 1 (mod 2^n), where x is odd. Return y. */ /* The algorithm notes that the choice y = x satisfies x*y == 1 mod 2^3, since x is assumed odd. @@ -3909,7 +3909,7 @@ emit_store_flag (target, code, op0, op1, mode, unsignedp, normalizep) /* For some comparisons with 1 and -1, we can convert this to comparisons with zero. This will often produce more opportunities for - store-flag insns. */ + store-flag insns. */ switch (code) { |