File: 2011-05-13-InBoundsGEP.ll

package info (click to toggle)
llvm-toolchain-11 1%3A11.0.1-2
  • links: PTS, VCS
  • area: main
  • in suites: bullseye
  • size: 995,808 kB
  • sloc: cpp: 4,767,656; ansic: 760,916; asm: 477,436; python: 170,940; objc: 69,804; lisp: 29,914; sh: 23,855; f90: 18,173; pascal: 7,551; perl: 7,471; ml: 5,603; awk: 3,489; makefile: 2,573; xml: 915; cs: 573; fortran: 503; javascript: 452
file content (21 lines) | stat: -rw-r--r-- 632 bytes parent folder | download | duplicates (21) 
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 -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, i8* %p, i32 %tmp1
; CHECK: getelementptr
    %p2 = getelementptr i8, i8* %p, i32 %tmp2
    %cmp = icmp ult i8* %p1, %p2
    br i1 %cmp, label %bbtrue, label %bbfalse
bbtrue:          ; preds = %entry
    ret i32 -1
bbfalse:         ; preds = %entry
    ret i32 0
}