diff options
| author | Eitan Adler <eadler@FreeBSD.org> | 2013-11-30 22:17:27 +0000 |
|---|---|---|
| committer | Eitan Adler <eadler@FreeBSD.org> | 2013-11-30 22:17:27 +0000 |
| commit | 7a22215c5346c9009d1dfa4d3c118ff99f89d184 (patch) | |
| tree | 050fb3b68519f6ef7d59051550fa29cdd79d6dac /sys/powerpc/fpu | |
| parent | c8aef31d309ac3f874c461619248fee9c1d74c2f (diff) | |
| download | src-7a22215c5346c9009d1dfa4d3c118ff99f89d184.tar.gz src-7a22215c5346c9009d1dfa4d3c118ff99f89d184.zip | |
Notes
Diffstat (limited to 'sys/powerpc/fpu')
| -rw-r--r-- | sys/powerpc/fpu/fpu_emu.c | 6 | ||||
| -rw-r--r-- | sys/powerpc/fpu/fpu_sqrt.c | 2 |
2 files changed, 4 insertions, 4 deletions
diff --git a/sys/powerpc/fpu/fpu_emu.c b/sys/powerpc/fpu/fpu_emu.c index 49dc758b94e0..33c1f7470366 100644 --- a/sys/powerpc/fpu/fpu_emu.c +++ b/sys/powerpc/fpu/fpu_emu.c @@ -500,7 +500,7 @@ fpu_execute(struct trapframe *tf, struct fpemu *fe, union instr *insn) memcpy(&fs->fpreg[rt], &fs->fpreg[rb], sizeof(double)); a = (int *)&fs->fpreg[rt]; - *a ^= (1 << 31); + *a ^= (1U << 31); break; case OPC63_MCRFS: FPU_EMU_EVCNT_INCR(mcrfs); @@ -547,7 +547,7 @@ fpu_execute(struct trapframe *tf, struct fpemu *fe, union instr *insn) memcpy(&fs->fpreg[rt], &fs->fpreg[rb], sizeof(double)); a = (int *)&fs->fpreg[rt]; - *a |= (1 << 31); + *a |= (1U << 31); break; case OPC63_FABS: FPU_EMU_EVCNT_INCR(fabs); @@ -555,7 +555,7 @@ fpu_execute(struct trapframe *tf, struct fpemu *fe, union instr *insn) memcpy(&fs->fpreg[rt], &fs->fpreg[rb], sizeof(double)); a = (int *)&fs->fpreg[rt]; - *a &= ~(1 << 31); + *a &= ~(1U << 31); break; case OPC63_MFFS: FPU_EMU_EVCNT_INCR(mffs); diff --git a/sys/powerpc/fpu/fpu_sqrt.c b/sys/powerpc/fpu/fpu_sqrt.c index 963a19302a9d..59cb3abc83a2 100644 --- a/sys/powerpc/fpu/fpu_sqrt.c +++ b/sys/powerpc/fpu/fpu_sqrt.c @@ -274,7 +274,7 @@ fpu_sqrt(struct fpemu *fe) * double x correctly while doing the `known q=1.0'. * * We do this one mantissa-word at a time, as noted above, to - * save work. To avoid `(1 << 31) << 1', we also do the top bit + * save work. To avoid `(1U << 31) << 1', we also do the top bit * outside of each per-word loop. * * The calculation `t = y + bit' breaks down into `t0 = y0, ..., |