File: subreg-to-reg-1.ll

package info (click to toggle)
llvm-toolchain-3.7 1%3A3.7.1-5
  • links: PTS, VCS
  • area: main
  • in suites: stretch
  • size: 345,556 kB
  • ctags: 362,199
  • sloc: cpp: 2,156,381; ansic: 458,339; objc: 91,547; python: 89,988; asm: 86,305; sh: 21,479; makefile: 6,853; perl: 5,601; ml: 5,458; pascal: 3,933; lisp: 2,429; xml: 686; cs: 239; php: 202; csh: 117
file content (16 lines) | stat: -rw-r--r-- 479 bytes parent folder | download | duplicates (9) 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
 
; RUN: llc < %s -march=x86-64 | FileCheck %s

; CHECK:     {{leal	.*[)], %e.*}}
; CHECK-NOT: {{leal	.*[)], %e.*}}

; Don't eliminate or coalesce away the explicit zero-extension!
; This is currently using an leal because of a 3-addressification detail,
; though this isn't necessary; The point of this test is to make sure
; a 32-bit add is used.

define i64 @foo(i64 %a) nounwind {
  %b = add i64 %a, 4294967295
  %c = and i64 %b, 4294967295
  %d = add i64 %c, 1
  ret i64 %d
}