Home | History | Annotate | Download | only in MemorySSA
      1 ; RUN: opt -basicaa -print-memoryssa -verify-memoryssa -analyze < %s 2>&1 | FileCheck %s
      2 ; RUN: opt -aa-pipeline=basic-aa -passes='print<memoryssa>,verify<memoryssa>' -disable-output < %s 2>&1 | FileCheck %s
      3 
      4 ; %ptr can't alias %local, so we should be able to optimize the use of %local to
      5 ; point to the store to %local.
      6 ; CHECK-LABEL: define void @check
      7 define void @check(i8* %ptr, i1 %bool) {
      8 entry:
      9   %local = alloca i8, align 1
     10 ; CHECK: 1 = MemoryDef(liveOnEntry)
     11 ; CHECK-NEXT: store i8 0, i8* %local, align 1
     12   store i8 0, i8* %local, align 1
     13   br i1 %bool, label %if.then, label %if.end
     14 
     15 if.then:
     16   %p2 = getelementptr inbounds i8, i8* %ptr, i32 1
     17 ; CHECK: 2 = MemoryDef(1)
     18 ; CHECK-NEXT: store i8 0, i8* %p2, align 1
     19   store i8 0, i8* %p2, align 1
     20   br label %if.end
     21 
     22 if.end:
     23 ; CHECK: 3 = MemoryPhi({entry,1},{if.then,2})
     24 ; CHECK: MemoryUse(1)
     25 ; CHECK-NEXT: load i8, i8* %local, align 1
     26   load i8, i8* %local, align 1
     27   ret void
     28 }
     29 
     30 ; CHECK-LABEL: define void @check2
     31 define void @check2(i1 %val1, i1 %val2, i1 %val3) {
     32 entry:
     33   %local = alloca i8, align 1
     34   %local2 = alloca i8, align 1
     35 
     36 ; CHECK: 1 = MemoryDef(liveOnEntry)
     37 ; CHECK-NEXT: store i8 0, i8* %local
     38   store i8 0, i8* %local
     39   br i1 %val1, label %if.then, label %phi.3
     40 
     41 if.then:
     42 ; CHECK: 2 = MemoryDef(1)
     43 ; CHECK-NEXT: store i8 2, i8* %local2
     44   store i8 2, i8* %local2
     45   br i1 %val2, label %phi.2, label %phi.3
     46 
     47 phi.3:
     48 ; CHECK: 7 = MemoryPhi({entry,1},{if.then,2})
     49 ; CHECK: 3 = MemoryDef(7)
     50 ; CHECK-NEXT: store i8 3, i8* %local2
     51   store i8 3, i8* %local2
     52   br i1 %val3, label %phi.2, label %phi.1
     53 
     54 phi.2:
     55 ; CHECK: 5 = MemoryPhi({if.then,2},{phi.3,3})
     56 ; CHECK: 4 = MemoryDef(5)
     57 ; CHECK-NEXT: store i8 4, i8* %local2
     58   store i8 4, i8* %local2
     59   br label %phi.1
     60 
     61 phi.1:
     62 ; Order matters here; phi.2 needs to come before phi.3, because that's the order
     63 ; they're visited in.
     64 ; CHECK: 6 = MemoryPhi({phi.2,4},{phi.3,3})
     65 ; CHECK: MemoryUse(1)
     66 ; CHECK-NEXT: load i8, i8* %local
     67   load i8, i8* %local
     68   ret void
     69 }
     70 
     71 ; CHECK-LABEL: define void @cross_phi
     72 define void @cross_phi(i8* noalias %p1, i8* noalias %p2) {
     73 ; CHECK: 1 = MemoryDef(liveOnEntry)
     74 ; CHECK-NEXT: store i8 0, i8* %p1
     75   store i8 0, i8* %p1
     76 ; CHECK: MemoryUse(1)
     77 ; CHECK-NEXT: load i8, i8* %p1
     78   load i8, i8* %p1
     79   br i1 undef, label %a, label %b
     80 
     81 a:
     82 ; CHECK: 2 = MemoryDef(1)
     83 ; CHECK-NEXT: store i8 0, i8* %p2
     84   store i8 0, i8* %p2
     85   br i1 undef, label %c, label %d
     86 
     87 b:
     88 ; CHECK: 3 = MemoryDef(1)
     89 ; CHECK-NEXT: store i8 1, i8* %p2
     90   store i8 1, i8* %p2
     91   br i1 undef, label %c, label %d
     92 
     93 c:
     94 ; CHECK: 6 = MemoryPhi({a,2},{b,3})
     95 ; CHECK: 4 = MemoryDef(6)
     96 ; CHECK-NEXT: store i8 2, i8* %p2
     97   store i8 2, i8* %p2
     98   br label %e
     99 
    100 d:
    101 ; CHECK: 7 = MemoryPhi({a,2},{b,3})
    102 ; CHECK: 5 = MemoryDef(7)
    103 ; CHECK-NEXT: store i8 3, i8* %p2
    104   store i8 3, i8* %p2
    105   br label %e
    106 
    107 e:
    108 ; 8 = MemoryPhi({c,4},{d,5})
    109 ; CHECK: MemoryUse(1)
    110 ; CHECK-NEXT: load i8, i8* %p1
    111   load i8, i8* %p1
    112   ret void
    113 }
    114 
    115 ; CHECK-LABEL: define void @looped
    116 define void @looped(i8* noalias %p1, i8* noalias %p2) {
    117 ; CHECK: 1 = MemoryDef(liveOnEntry)
    118 ; CHECK-NEXT: store i8 0, i8* %p1
    119   store i8 0, i8* %p1
    120   br label %loop.1
    121 
    122 loop.1:
    123 ; CHECK: 6 = MemoryPhi({%0,1},{loop.3,4})
    124 ; CHECK: 2 = MemoryDef(6)
    125 ; CHECK-NEXT: store i8 0, i8* %p2
    126   store i8 0, i8* %p2
    127   br i1 undef, label %loop.2, label %loop.3
    128 
    129 loop.2:
    130 ; CHECK: 5 = MemoryPhi({loop.1,2},{loop.3,4})
    131 ; CHECK: 3 = MemoryDef(5)
    132 ; CHECK-NEXT: store i8 1, i8* %p2
    133   store i8 1, i8* %p2
    134   br label %loop.3
    135 
    136 loop.3:
    137 ; CHECK: 7 = MemoryPhi({loop.1,2},{loop.2,3})
    138 ; CHECK: 4 = MemoryDef(7)
    139 ; CHECK-NEXT: store i8 2, i8* %p2
    140   store i8 2, i8* %p2
    141 ; CHECK: MemoryUse(1)
    142 ; CHECK-NEXT: load i8, i8* %p1
    143   load i8, i8* %p1
    144   br i1 undef, label %loop.2, label %loop.1
    145 }
    146 
    147 ; CHECK-LABEL: define void @looped_visitedonlyonce
    148 define void @looped_visitedonlyonce(i8* noalias %p1, i8* noalias %p2) {
    149   br label %while.cond
    150 
    151 while.cond:
    152 ; CHECK: 5 = MemoryPhi({%0,liveOnEntry},{if.end,3})
    153 ; CHECK-NEXT: br i1 undef, label %if.then, label %if.end
    154   br i1 undef, label %if.then, label %if.end
    155 
    156 if.then:
    157 ; CHECK: 1 = MemoryDef(5)
    158 ; CHECK-NEXT: store i8 0, i8* %p1
    159   store i8 0, i8* %p1
    160   br i1 undef, label %if.end, label %if.then2
    161 
    162 if.then2:
    163 ; CHECK: 2 = MemoryDef(1)
    164 ; CHECK-NEXT: store i8 1, i8* %p2
    165   store i8 1, i8* %p2
    166   br label %if.end
    167 
    168 if.end:
    169 ; CHECK: 4 = MemoryPhi({while.cond,5},{if.then,1},{if.then2,2})
    170 ; CHECK: MemoryUse(4)
    171 ; CHECK-NEXT: load i8, i8* %p1
    172   load i8, i8* %p1
    173 ; CHECK: 3 = MemoryDef(4)
    174 ; CHECK-NEXT: store i8 2, i8* %p2
    175   store i8 2, i8* %p2
    176 ; CHECK: MemoryUse(4)
    177 ; CHECK-NEXT: load i8, i8* %p1
    178   load i8, i8* %p1
    179   br label %while.cond
    180 }
    181 
    182