| commit | 41c85d2142b87ac4078f4a66bbeddffe37579fd4 | |
| author | Dan Carpenter <dan.carpenter@oracle.com> | |
| Tue, 22 Sep 2020 13:56:09 +0000 (22 16:56 +0300) | ||
| committer | Dan Carpenter <dan.carpenter@oracle.com> | |
| Tue, 22 Sep 2020 13:56:09 +0000 (22 16:56 +0300) | ||
| tree | eb8d78169e2c41f0d0eb8f4c408bfae809bd45cc | treesnapshot (tar.gz zip) |
| parent | 45d764473886ed4d99cd9fe37c4fe722158e77b8 | commitdiff |
math: improve AND handling
I wrote this code some time ago and have been running it, so presumably it
is good code. The original code seems to have assumed that the smallest
value was on the left.
We want to get the minimum maximum. That's the highest shared bit.
This fixes parsing of array_index_nospec().
Signed-off-by: Dan Carpenter <dan.carpenter@oracle.com>
I wrote this code some time ago and have been running it, so presumably it
is good code. The original code seems to have assumed that the smallest
value was on the left.
We want to get the minimum maximum. That's the highest shared bit.
This fixes parsing of array_index_nospec().
Signed-off-by: Dan Carpenter <dan.carpenter@oracle.com>
| smatch.h | diffblobblamehistory | |
| smatch_ranges.c | diffblobblamehistory | |
| smatch_sval.c | diffblobblamehistory |