File: pr75129.ll

package info (click to toggle)
llvm-toolchain-19 1%3A19.1.7-3
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid, trixie
  • size: 1,998,520 kB
  • sloc: cpp: 6,951,680; ansic: 1,486,157; asm: 913,598; python: 232,024; f90: 80,126; objc: 75,281; lisp: 37,276; pascal: 16,990; sh: 10,009; ml: 5,058; perl: 4,724; awk: 3,523; makefile: 3,167; javascript: 2,504; xml: 892; fortran: 664; cs: 573
file content (38 lines) | stat: -rw-r--r-- 1,034 bytes parent folder | download | duplicates (8) 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
 
; NOTE: Assertions have been autogenerated by utils/update_test_checks.py
; RUN: opt < %s -passes=instcombine -S | FileCheck %s

; Pattern:
;   (or (and (add x, half_c1), c3), (and x, c2))
; IFF:
;   c1, c2, c3 is constant
;   c1 is pow2
;   c2 < c1
;   c3 == (c1 - 1) ^ c2
;   half_c1 == (lshr c1, 1)
;   (c1 >> 1) & c3 == (c1 >> 1)
;   x is known to be less than c1
; Could be transformed into:
;   (xor x, half_c1)
; The reason above transformation could be done is becase
; in (and (add x, half_c1), c3), half_c1 equals the top bit
; of the demanded mask indicated by (and ..., c3)

define i16 @or_and_add_and() {
; CHECK-LABEL: @or_and_add_and(
; CHECK-NEXT:  entry:
; CHECK-NEXT:    [[X:%.*]] = call i16 @dummy(), !range [[RNG0:![0-9]+]]
; CHECK-NEXT:    [[OR:%.*]] = xor i16 [[X]], 32
; CHECK-NEXT:    ret i16 [[OR]]
;
entry:
  %x = call i16 @dummy(), !range !0
  %add = add i16 32, %x
  %and1 = and i16 %add, 48
  %and2 = and i16 %x, 15
  %or = or i16 %and1, %and2
  ret i16 %or
}

declare i16 @dummy()

!0 = !{i16 0, i16 64}