File: apint-and-xor-merge.ll

package info (click to toggle)
llvm-2.9 2.9%2Bdfsg-7
  • links: PTS, VCS
  • area: main
  • in suites: wheezy
  • size: 69,236 kB
  • sloc: cpp: 439,289; ansic: 16,211; asm: 13,295; sh: 12,912; python: 4,459; ml: 4,274; perl: 2,093; makefile: 1,808; pascal: 1,481; exp: 427; objc: 334; xml: 283; ada: 235; lisp: 187; csh: 117; f90: 36
file content (22 lines) | stat: -rw-r--r-- 601 bytes parent folder | download | duplicates (11)
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: opt < %s -instcombine -S | grep and | count 1
; RUN: opt < %s -instcombine -S | 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
}