1 ; RUN: opt -instcombine -S < %s | FileCheck %s
3 target datalayout = "e-p:32:32:32-i1:8:8-i8:8:8-i16:16:16-i32:32:32-i64:32:32-f32:32:32-f64:32:32-v64:64:64-v128:128:128-a0:0:64"
5 define i32 *@test1(i32* %A, i32 %Offset) {
7 %tmp = getelementptr inbounds i32, i32* %A, i32 %Offset
11 %RHS = phi i32* [ %RHS.next, %bb ], [ %tmp, %entry ]
12 %LHS = getelementptr inbounds i32, i32* %A, i32 100
13 %RHS.next = getelementptr inbounds i32, i32* %RHS, i64 1
14 %cond = icmp ult i32 * %LHS, %RHS
15 br i1 %cond, label %bb2, label %bb
20 ; CHECK-LABEL: @test1(
21 ; CHECK: %[[INDEX:[0-9A-Za-z.]+]] = phi i32 [ %[[ADD:[0-9A-Za-z.]+]], %bb ], [ %Offset, %entry ]
22 ; CHECK: %[[ADD]] = add i32 %[[INDEX]], 1
23 ; CHECK: %cond = icmp sgt i32 %[[INDEX]], 100
24 ; CHECK: br i1 %cond, label %bb2, label %bb
25 ; CHECK: %[[PTR:[0-9A-Za-z.]+]] = getelementptr inbounds i32, i32* %A, i32 %[[INDEX]]
26 ; CHECK: ret i32* %[[PTR]]
29 define i32 *@test2(i32 %A, i32 %Offset) {
31 %A.ptr = inttoptr i32 %A to i32*
32 %tmp = getelementptr inbounds i32, i32* %A.ptr, i32 %Offset
36 %RHS = phi i32* [ %RHS.next, %bb ], [ %tmp, %entry ]
37 %LHS = getelementptr inbounds i32, i32* %A.ptr, i32 100
38 %RHS.next = getelementptr inbounds i32, i32* %RHS, i64 1
39 %cmp0 = ptrtoint i32 *%LHS to i32
40 %cmp1 = ptrtoint i32 *%RHS to i32
41 %cond = icmp ult i32 %cmp0, %cmp1
42 br i1 %cond, label %bb2, label %bb
47 ; CHECK-LABEL: @test2(
48 ; CHECK: %[[TOPTR:[0-9A-Za-z.]+]] = inttoptr i32 %[[ADD:[0-9A-Za-z.]+]] to i32*
49 ; CHECK: %[[INDEX:[0-9A-Za-z.]+]] = phi i32 [ %[[ADD:[0-9A-Za-z.]+]], %bb ], [ %Offset, %entry ]
50 ; CHECK: %[[ADD]] = add i32 %[[INDEX]], 1
51 ; CHECK: %cond = icmp sgt i32 %[[INDEX]], 100
52 ; CHECK: br i1 %cond, label %bb2, label %bb
53 ; CHECK: %[[PTR:[0-9A-Za-z.]+]] = getelementptr inbounds i32, i32* %[[TOPTR]], i32 %[[INDEX]]
54 ; CHECK: ret i32* %[[PTR]]
57 ; Perform the transformation only if we know that the GEPs used are inbounds.
58 define i32 *@test3(i32* %A, i32 %Offset) {
60 %tmp = getelementptr i32, i32* %A, i32 %Offset
64 %RHS = phi i32* [ %RHS.next, %bb ], [ %tmp, %entry ]
65 %LHS = getelementptr i32, i32* %A, i32 100
66 %RHS.next = getelementptr i32, i32* %RHS, i64 1
67 %cond = icmp ult i32 * %LHS, %RHS
68 br i1 %cond, label %bb2, label %bb
73 ; CHECK-LABEL: @test3(
74 ; CHECK-NOT: %cond = icmp sgt i32 %{{[0-9A-Za-z.]+}}, 100
77 ; An inttoptr that requires an extension or truncation will be opaque when determining
78 ; the base pointer. In this case we can still perform the transformation by considering
79 ; A.ptr as being the base pointer.
80 define i32 *@test4(i16 %A, i32 %Offset) {
82 %A.ptr = inttoptr i16 %A to i32*
83 %tmp = getelementptr inbounds i32, i32* %A.ptr, i32 %Offset
87 %RHS = phi i32* [ %RHS.next, %bb ], [ %tmp, %entry ]
88 %LHS = getelementptr inbounds i32, i32* %A.ptr, i32 100
89 %RHS.next = getelementptr inbounds i32, i32* %RHS, i64 1
90 %cmp0 = ptrtoint i32 *%LHS to i32
91 %cmp1 = ptrtoint i32 *%RHS to i32
92 %cond = icmp ult i32 %cmp0, %cmp1
93 br i1 %cond, label %bb2, label %bb
98 ; CHECK-LABEL: @test4(
99 ; CHECK: %cond = icmp sgt i32 %{{[0-9A-Za-z.]+}}, 100