File: apint-and-xor-merge.ll

package info (click to toggle)
llvm 2.6-9.1
  • links: PTS
  • area: main
  • in suites: squeeze
  • size: 57,604 kB
  • ctags: 44,336
  • sloc: cpp: 344,766; sh: 12,407; ansic: 10,617; ada: 3,070; ml: 2,505; perl: 2,496; makefile: 1,426; pascal: 1,163; exp: 389; asm: 307; python: 298; objc: 260; lisp: 182; csh: 117; xml: 38; f90: 36; tcl: 20
file content (22 lines) | stat: -rw-r--r-- 637 bytes parent folder | download | duplicates (2) 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
 
; This test case checks that the merge of and/xor can work on arbitrary
; precision integers.

; RUN: llvm-as < %s | opt -instcombine | llvm-dis | grep and | count 1
; RUN: llvm-as < %s | opt -instcombine | llvm-dis | grep xor | count 2

; (x &z ) ^ (y & z) -> (x ^ y) & z
define i57 @test1(i57 %x, i57 %y, i57 %z) {
        %tmp3 = and i57 %z, %x
        %tmp6 = and i57 %z, %y
        %tmp7 = xor i57 %tmp3, %tmp6
        ret i57 %tmp7
}

; (x & y) ^ (x | y) -> x ^ y
define i23 @test2(i23 %x, i23 %y, i23 %z) {
        %tmp3 = and i23 %y, %x
        %tmp6 = or i23 %y, %x
        %tmp7 = xor i23 %tmp3, %tmp6
        ret i23 %tmp7
}