1 ; RUN: opt < %s -loop-unswitch -enable-new-pm=0 -verify-memoryssa -S | FileCheck %s
3 ; In cases where two address spaces do not have the same size pointer, the
4 ; input for the addrspacecast should not be used as a substitute for itself
5 ; when manipulating the pointer.
7 target datalayout = "e-m:e-p:16:16-p1:32:16-i32:16-i64:16-n8:16"
12 %arrayidx.i1 = getelementptr inbounds i16, i16* undef, i16 undef
13 %arrayidx.i = addrspacecast i16* %arrayidx.i1 to i16 addrspace(1)*
14 br i1 undef, label %for.body.i, label %bar.exit
16 for.body.i: ; preds = %for.body.i, %entry
17 ; When we call makeLoopInvariant (i.e. trivial LICM) on this load, it
18 ; will try to find the base object to prove deferenceability. If we look
19 ; through the addrspacecast, we'll fail an assertion about bitwidths matching
20 ; CHECK-LABEL: for.body.i
21 ; CHECK: %0 = load i16, i16 addrspace(1)* %arrayidx.i, align 2
22 %0 = load i16, i16 addrspace(1)* %arrayidx.i, align 2
23 %cmp1.i = icmp eq i16 %0, 0
24 br i1 %cmp1.i, label %bar.exit, label %for.body.i
26 bar.exit: ; preds = %for.body.i, %entry