diff options
| author | Cristian Cadar <c.cadar@imperial.ac.uk> | 2019-05-30 17:12:30 +0100 |
|---|---|---|
| committer | MartinNowack <martin.nowack@gmail.com> | 2019-06-04 11:55:50 +0200 |
| commit | 32892a0c836c6153808e2c821b86b5d36db51cbf (patch) | |
| tree | 6cd97b9b18a5e1ce874be126dcd134bf67ee5205 /lib/Solver/ConstantDivision.cpp | |
| parent | ade2bf89486ae2e44571fb547dbc96488fc3dab4 (diff) | |
| download | klee-32892a0c836c6153808e2c821b86b5d36db51cbf.tar.gz | |
Remove parenthesis around returns, as reported and discussed in #891
Diffstat (limited to 'lib/Solver/ConstantDivision.cpp')
| -rw-r--r-- | lib/Solver/ConstantDivision.cpp | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/lib/Solver/ConstantDivision.cpp b/lib/Solver/ConstantDivision.cpp index e62e1354..8ebf39ad 100644 --- a/lib/Solver/ConstantDivision.cpp +++ b/lib/Solver/ConstantDivision.cpp @@ -47,7 +47,7 @@ static uint32_t ones(uint32_t x) { x += (x >> 8); x += (x >> 16); - return( x & 0x0000003f ); + return x & 0x0000003f; } /* ldz(x) -- counts the number of leading zeroes in a 32-bit word */ @@ -65,7 +65,7 @@ static uint32_t ldz(uint32_t x) { static uint32_t exp_base_2(int32_t n) { uint32_t x = ~n & (n - 32); x = x >> 31; - return( x << n ); + return x << n; } // A simple algorithm: Iterate over all contiguous regions of 1 bits |