| commit | df8e9abd0593ba9597d43c7442f7d8bca4e6c303 | |
| author | Dan Carpenter <dan.carpenter@oracle.com> | |
| Mon, 20 May 2013 18:04:22 +0000 (20 21:04 +0300) | ||
| committer | Dan Carpenter <dan.carpenter@oracle.com> | |
| Mon, 20 May 2013 18:04:22 +0000 (20 21:04 +0300) | ||
| tree | a6f6de314abb487ae540617eb53ef1dc77531226 | treesnapshot (tar.gz zip) |
| parent | 7d7d745ea592f5ce2d3d2d2e1c1bb26ac773354b | commitdiff |
math: create new handle_bitwise_AND() function
I've pulled this code out into a separate function. It should work
pretty much the same as the original even though I have changed it to
use rl_intersection() now.
If we know both sides then the we just return that. Otherwise we take from
0-max of the left intersected with 0-max of the right.
Signed-off-by: Dan Carpenter <dan.carpenter@oracle.com>
I've pulled this code out into a separate function. It should work
pretty much the same as the original even though I have changed it to
use rl_intersection() now.
If we know both sides then the we just return that. Otherwise we take from
0-max of the left intersected with 0-max of the right.
Signed-off-by: Dan Carpenter <dan.carpenter@oracle.com>
| smatch_math.c | diffblobblamehistory |