bpf/verifier: pruning branches based on no intersection between domains #10508
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
When verifying branches that compare two registers, if we can determine that the possible value ranges of the two registers do not intersect based on their unsigned and signed min/max values and tnums, we can conclude that certain branch outcomes are impossible. This patch adds checks for intersection between the unsigned ranges/signed ranges and tnums of registers. If no intersection exists, we can prune the impossible branch.