- More tight value constraints increase the strength of GVN and CCP and open more transformations and simplifications.
- Currently we have some specifically crafted analysis such as CmpU of Add/Sub, And of a LShift, etc and we have some potential improvements in JBS such as the sign of an Or. These can be solved elegantly using unsigned bounds and known bits.
- Ability to express TypeInt::CC_NE
- blocks
- 
                    JDK-8359149 C2: Improve the capability to test inference on TypeInt instances -           
- Open
 
-         
- duplicates
- 
                    JDK-8311597 OrINode/OrLNode::add_ring should track positives -           
- Closed
 
-         
- relates to
- 
                    JDK-8361679 C2: assert(parse_predicate_success_proj->is_uncommon_trap_if_pattern(reason)) failed: must be a uct if pattern! -           
- Closed
 
-         
- 
                    JDK-8001436 C2: Implement bitwise constant propagation -           
- Open
 
-         
- 
                    JDK-8367341 C2: apply KnownBits and unsigned bounds to And / Or operations -           
- Open
 
-         
- 
                    JDK-8311597 OrINode/OrLNode::add_ring should track positives -           
- Closed
 
-         
- 
                    JDK-8360561 PhaseIdealLoop::create_new_if_for_predicate hits "must be a uct if pattern" assert -           
- Resolved
 
-         
- 
                    JDK-8365207 C2: Optimize integral bit compression and expansion value transforms using knownbits -           
- Open
 
-         
- 
                    JDK-8365205 C2: Optimize popcount value computation using knownbits -           
- Resolved
 
-         
- links to
- 
                     Commit(master)
        openjdk/jdk/991097b7 Commit(master)
        openjdk/jdk/991097b7
- 
                     Review
        openjdk/jdk/15440 Review
        openjdk/jdk/15440
- 
                     Review(master)
        openjdk/jdk/17508 Review(master)
        openjdk/jdk/17508