File: bitcount.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 (19 lines) | stat: -rw-r--r-- 630 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
 
; Tests to make sure bit counts of constants are folded
; RUN: llvm-as < %s | opt -instcombine | llvm-dis | grep {ret i32 19}
; RUN: llvm-as < %s | opt -instcombine | llvm-dis | \
; RUN:   grep -v declare | not grep llvm.ct

declare i31 @llvm.ctpop.i31(i31 %val) 
declare i32 @llvm.cttz.i32(i32 %val) 
declare i33 @llvm.ctlz.i33(i33 %val) 

define i32 @test(i32 %A) {
  %c1 = call i31 @llvm.ctpop.i31(i31 12415124)
  %c2 = call i32 @llvm.cttz.i32(i32 87359874)
  %c3 = call i33 @llvm.ctlz.i33(i33 87359874)
  %t1 = zext i31 %c1 to i32
  %t3 = trunc i33 %c3 to i32
  %r1 = add i32 %t1, %c2
  %r2 = add i32 %r1, %t3
  ret i32 %r2
}