File: 2011-05-13-InBoundsGEP.ll

package info (click to toggle)
llvm-toolchain-19 1%3A19.1.7-3
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid, trixie
  • size: 1,998,520 kB
  • sloc: cpp: 6,951,680; ansic: 1,486,157; asm: 913,598; python: 232,024; f90: 80,126; objc: 75,281; lisp: 37,276; pascal: 16,990; sh: 10,009; ml: 5,058; perl: 4,724; awk: 3,523; makefile: 3,167; javascript: 2,504; xml: 892; fortran: 664; cs: 573
file content (21 lines) | stat: -rw-r--r-- 639 bytes parent folder | download | duplicates (12) 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
 
; RUN: opt < %s -S -passes=instcombine | FileCheck %s
; rdar://problem/9267970
; ideally this test will run on a 32-bit host
; must not discard GEPs that might overflow at runtime (aren't inbounds)

define i32 @main(i32 %argc) {
entry:
    %tmp1 = add i32 %argc, -2
    %tmp2 = add i32 %argc, 1879048192
    %p = alloca i8
; CHECK: getelementptr
    %p1 = getelementptr i8, ptr %p, i32 %tmp1
; CHECK: getelementptr
    %p2 = getelementptr i8, ptr %p, i32 %tmp2
    %cmp = icmp ult ptr %p1, %p2
    br i1 %cmp, label %bbtrue, label %bbfalse
bbtrue:          ; preds = %entry
    ret i32 -1
bbfalse:         ; preds = %entry
    ret i32 0
}