File: bit-tracking.ll

package info (click to toggle)
llvm-toolchain-3.9 1%3A3.9.1-8
  • links: PTS, VCS
  • area: main
  • in suites: stretch
  • size: 441,060 kB
  • ctags: 428,777
  • sloc: cpp: 2,546,577; ansic: 538,318; asm: 119,677; objc: 103,316; python: 102,148; sh: 27,847; pascal: 5,626; ml: 5,510; perl: 5,293; lisp: 4,801; makefile: 2,177; xml: 686; cs: 362; php: 212; csh: 117
file content (26 lines) | stat: -rw-r--r-- 1,116 bytes parent folder | download | duplicates (14)
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
; This file contains various testcases that require tracking whether bits are
; set or cleared by various instructions.
; RUN: opt < %s -instcombine -instcombine -S |\
; RUN:   not grep %ELIM

; Reduce down to a single XOR
define i32 @test3(i32 %B) {
        %ELIMinc = and i32 %B, 1                ; <i32> [#uses=1]
        %tmp.5 = xor i32 %ELIMinc, 1            ; <i32> [#uses=1]
        %ELIM7 = and i32 %B, -2         ; <i32> [#uses=1]
        %tmp.8 = or i32 %tmp.5, %ELIM7          ; <i32> [#uses=1]
        ret i32 %tmp.8
}

; Finally, a bigger case where we chain things together.  This corresponds to
; incrementing a single-bit bitfield, which should become just an xor.
define i32 @test4(i32 %B) {
        %ELIM3 = shl i32 %B, 31         ; <i32> [#uses=1]
        %ELIM4 = ashr i32 %ELIM3, 31            ; <i32> [#uses=1]
        %inc = add i32 %ELIM4, 1                ; <i32> [#uses=1]
        %ELIM5 = and i32 %inc, 1                ; <i32> [#uses=1]
        %ELIM7 = and i32 %B, -2         ; <i32> [#uses=1]
        %tmp.8 = or i32 %ELIM5, %ELIM7          ; <i32> [#uses=1]
        ret i32 %tmp.8
}