reference, declarationdefinition
definition → references, declarations, derived classes, virtual overrides
reference to multiple definitions → definitions
unreferenced
    1
    2
    3
    4
    5
    6
    7
    8
    9
   10
   11
   12
   13
   14
   15
   16
   17
   18
   19
   20
   21
   22
   23
   24
   25
   26
   27
   28
   29
   30
   31
   32
   33
   34
   35
   36
   37
   38
   39
   40
   41
   42
   43
   44
   45
   46
   47
   48
   49
   50
   51
   52
   53
   54
   55
   56
   57
   58
   59
   60
   61
   62
   63
   64
   65
   66
   67
   68
   69
   70
   71
   72
   73
   74
   75
   76
   77
   78
   79
   80
   81
   82
   83
   84
   85
   86
   87
   88
   89
   90
   91
   92
   93
   94
   95
   96
   97
   98
   99
  100
  101
  102
  103
  104
  105
  106
  107
  108
  109
  110
  111
  112
  113
  114
  115
  116
  117
  118
  119
  120
  121
  122
; RUN: opt < %s -jump-threading -S | FileCheck %s

target datalayout = "e-p:32:32:32-i1:8:8-i8:8:8-i16:16:16-i32:32:32-i64:32:64-f32:32:32-f64:32:64-v64:64:64-v128:128:128-a0:0:64-f80:128:128"
target triple = "i386-apple-darwin7"

declare void @use(i32 *)

; Check that we propagate nonnull to dominated loads, when we find an available
; loaded value.
; CHECK-LABEL: @test1(
; CHECK-LABEL: ret1:
; CHECK-NEXT: %[[p1:.*]] = load i32*, i32** %ptr
; CHECK-NOT: !nonnull
; CHECK-NEXT: store i32 1, i32* %[[p1]]
; CHECK-NEXT: tail call void @use(i32* null)
; CHECK-NEXT: ret void

; CHECK-LABEL: ret2:
; CHECK-NEXT: %[[p2:.*]] = load i32*, i32** %ptr, !nonnull !0
; CHECK: tail call void @use(i32* %[[p2]])
; CHECK-NEXT: ret void
define void @test1(i32** %ptr, i1 %c) {
  br i1 %c, label %d1, label %d2

d1:
  %p1 = load i32*, i32** %ptr, !nonnull !0
  br label %d3

d2:
  br label %d3

d3:
  %pm = phi i32* [ null, %d2 ], [ %p1, %d1 ]
  %p2 = load i32*, i32** %ptr
  store i32 1, i32* %p2
  %c2 = icmp eq i32* %pm, null
  br i1 %c2, label %ret1, label %ret2

ret1:
  tail call void @use(i32* %pm) nounwind
  ret void

ret2:
  tail call void @use(i32* %pm) nounwind
  ret void
}

; Check that we propagate nonnull to dominated loads, when we find an available
; loaded value.
; CHECK-LABEL: @test2(
; CHECK-LABEL: d3.thread:
; CHECK-NEXT: %[[p1:.*]] = load i32*, i32** %ptr, !nonnull !0
; CHECK-NEXT: store i32 1, i32* %[[p1]]
; CHECK-NEXT: br label %ret1

; CHECK-LABEL: d3:
; CHECK-NEXT: %[[p_cmp:.*]] = load i32*, i32** %ptr
; CHECK-NEXT: %[[p2:.*]] = load i32*, i32** %ptr, !nonnull !0
; CHECK-NEXT: store i32 1, i32* %[[p2]]
; CHECK-NEXT: icmp eq i32* %[[p_cmp]], null
define void @test2(i32** %ptr, i1 %c) {
  br i1 %c, label %d1, label %d2

d1:
  %p1 = load i32*, i32** %ptr
  br label %d3

d2:
  br label %d3

d3:
  %pm = phi i32* [ null, %d2 ], [ %p1, %d1 ]
  %p2 = load i32*, i32** %ptr, !nonnull !0
  store i32 1, i32* %p2
  %c2 = icmp eq i32* %pm, null
  br i1 %c2, label %ret1, label %ret2

ret1:
  tail call void @use(i32* %pm) nounwind
  ret void

ret2:
  tail call void @use(i32* %pm) nounwind
  ret void
}

; Check that we do not propagate nonnull to loads predecessors that are combined
; to a PHI node.
; CHECK-LABEL: @test3(
; CHECK-LABEL: d1:
; CHECK-NEXT: %[[p1:.*]] = load i32*, i32** %ptr
; CHECK-NOT: !nonnull

; CHECK-LABEL: d2:
; CHECK-NEXT: %[[p2:.*]] = load i32*, i32** %ptr
; CHECK-NOT: !nonnull

; CHECK-LABEL: d3:
; CHECK-NEXT:  phi i32* [ %[[p2]], %d2 ], [ %[[p1]], %d1 ]
define void @test3(i32** %ptr) {
d1:
  %x = load i32*, i32** %ptr, !nonnull !0
  br label %d3

d2:
  br label %d3

d3:
  %y = load i32*, i32** %ptr
  store i32 1, i32* %y
  %c2 = icmp eq i32* %y, null
  br i1 %c2, label %ret1, label %ret2

ret1:
  ret void

ret2:
  ret void
}


!0 = !{}