File: 2011-05-13-InBoundsGEP.ll

package info (click to toggle)
llvm-toolchain-13 1%3A13.0.1-11
  • links: PTS, VCS
  • area: main
  • in suites: bookworm
  • size: 1,418,840 kB
  • sloc: cpp: 5,290,826; ansic: 996,570; asm: 544,593; python: 188,212; objc: 72,027; lisp: 30,291; f90: 25,395; sh: 24,898; javascript: 9,780; pascal: 9,398; perl: 7,484; ml: 5,432; awk: 3,523; makefile: 2,913; xml: 953; cs: 573; fortran: 539
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
}