407 lines · plain
1; NOTE: Assertions have been autogenerated by utils/update_test_checks.py2; RUN: opt < %s -passes=instcombine -S | FileCheck %s3 4; FIXME: This is technically incorrect because it might overwrite a poison5; value. Stop folding it once #52930 is resolved.6define void @store_of_undef(ptr %P) {7; CHECK-LABEL: @store_of_undef(8; CHECK-NEXT: ret void9;10 store i32 undef, ptr %P11 ret void12}13 14define void @store_of_poison(ptr %P) {15; CHECK-LABEL: @store_of_poison(16; CHECK-NEXT: ret void17;18 store i32 poison, ptr %P19 ret void20}21 22define void @store_into_undef(ptr %P) {23; CHECK-LABEL: @store_into_undef(24; CHECK-NEXT: store i32 123, ptr undef, align 425; CHECK-NEXT: ret void26;27 store i32 123, ptr undef28 ret void29}30 31define void @store_into_null(ptr %P) {32; CHECK-LABEL: @store_into_null(33; CHECK-NEXT: store i32 poison, ptr null, align 434; CHECK-NEXT: ret void35;36 store i32 124, ptr null37 ret void38}39 40define void @test2(ptr %P) {41; CHECK-LABEL: @test2(42; CHECK-NEXT: ret void43;44 %X = load i32, ptr %P45 %Y = add i32 %X, 046 store i32 %Y, ptr %P47 ret void48}49 50define void @store_at_gep_off_null_inbounds(i64 %offset) {51; CHECK-LABEL: @store_at_gep_off_null_inbounds(52; CHECK-NEXT: [[PTR:%.*]] = getelementptr inbounds i32, ptr null, i64 [[OFFSET:%.*]]53; CHECK-NEXT: store i32 poison, ptr [[PTR]], align 454; CHECK-NEXT: ret void55;56 %ptr = getelementptr inbounds i32, ptr null, i64 %offset57 store i32 24, ptr %ptr58 ret void59}60 61define void @store_at_gep_off_null_not_inbounds(i64 %offset) {62; CHECK-LABEL: @store_at_gep_off_null_not_inbounds(63; CHECK-NEXT: [[PTR:%.*]] = getelementptr i32, ptr null, i64 [[OFFSET:%.*]]64; CHECK-NEXT: store i32 poison, ptr [[PTR]], align 465; CHECK-NEXT: ret void66;67 %ptr = getelementptr i32, ptr null, i64 %offset68 store i32 24, ptr %ptr69 ret void70}71 72define void @store_at_gep_off_no_null_opt(i64 %offset) #0 {73; CHECK-LABEL: @store_at_gep_off_no_null_opt(74; CHECK-NEXT: [[PTR:%.*]] = getelementptr inbounds i32, ptr null, i64 [[OFFSET:%.*]]75; CHECK-NEXT: store i32 24, ptr [[PTR]], align 476; CHECK-NEXT: ret void77;78 %ptr = getelementptr inbounds i32, ptr null, i64 %offset79 store i32 24, ptr %ptr80 ret void81}82 83attributes #0 = { null_pointer_is_valid }84 85;; Simple sinking tests86 87; "if then else"88define i32 @test3(i1 %C) {89; CHECK-LABEL: @test3(90; CHECK-NEXT: br i1 [[C:%.*]], label [[COND:%.*]], label [[COND2:%.*]]91; CHECK: Cond:92; CHECK-NEXT: br label [[CONT:%.*]]93; CHECK: Cond2:94; CHECK-NEXT: br label [[CONT]]95; CHECK: Cont:96; CHECK-NEXT: [[STOREMERGE:%.*]] = phi i32 [ 47, [[COND2]] ], [ -987654321, [[COND]] ]97; CHECK-NEXT: ret i32 [[STOREMERGE]]98;99 %A = alloca i32100 br i1 %C, label %Cond, label %Cond2101 102Cond:103 store i32 -987654321, ptr %A104 br label %Cont105 106Cond2:107 store i32 47, ptr %A108 br label %Cont109 110Cont:111 %V = load i32, ptr %A112 ret i32 %V113}114 115; "if then"116define i32 @test4(i1 %C) {117; CHECK-LABEL: @test4(118; CHECK-NEXT: br i1 [[C:%.*]], label [[COND:%.*]], label [[CONT:%.*]]119; CHECK: Cond:120; CHECK-NEXT: br label [[CONT]]121; CHECK: Cont:122; CHECK-NEXT: [[STOREMERGE:%.*]] = phi i32 [ -987654321, [[COND]] ], [ 47, [[TMP0:%.*]] ]123; CHECK-NEXT: ret i32 [[STOREMERGE]]124;125 %A = alloca i32126 store i32 47, ptr %A127 br i1 %C, label %Cond, label %Cont128 129Cond:130 store i32 -987654321, ptr %A131 br label %Cont132 133Cont:134 %V = load i32, ptr %A135 ret i32 %V136}137 138; "if then"139define void @test5(i1 %C, ptr %P) {140; CHECK-LABEL: @test5(141; CHECK-NEXT: br i1 [[C:%.*]], label [[COND:%.*]], label [[CONT:%.*]]142; CHECK: Cond:143; CHECK-NEXT: br label [[CONT]]144; CHECK: Cont:145; CHECK-NEXT: [[STOREMERGE:%.*]] = phi i32 [ -987654321, [[COND]] ], [ 47, [[TMP0:%.*]] ]146; CHECK-NEXT: store i32 [[STOREMERGE]], ptr [[P:%.*]], align 1147; CHECK-NEXT: ret void148;149 store i32 47, ptr %P, align 1150 br i1 %C, label %Cond, label %Cont151 152Cond:153 store i32 -987654321, ptr %P, align 1154 br label %Cont155 156Cont:157 ret void158}159 160 161; PR14753 - merging two stores should preserve the TBAA tag.162define void @test6(i32 %n, ptr %a, ptr %gi) nounwind uwtable ssp {163; CHECK-LABEL: @test6(164; CHECK-NEXT: entry:165; CHECK-NEXT: br label [[FOR_COND:%.*]]166; CHECK: for.cond:167; CHECK-NEXT: [[STOREMERGE:%.*]] = phi i32 [ 42, [[ENTRY:%.*]] ], [ [[INC:%.*]], [[FOR_BODY:%.*]] ]168; CHECK-NEXT: store i32 [[STOREMERGE]], ptr [[GI:%.*]], align 4, !tbaa [[TBAA0:![0-9]+]]169; CHECK-NEXT: [[CMP:%.*]] = icmp slt i32 [[STOREMERGE]], [[N:%.*]]170; CHECK-NEXT: br i1 [[CMP]], label [[FOR_BODY]], label [[FOR_END:%.*]]171; CHECK: for.body:172; CHECK-NEXT: [[IDXPROM:%.*]] = sext i32 [[STOREMERGE]] to i64173; CHECK-NEXT: [[ARRAYIDX:%.*]] = getelementptr inbounds float, ptr [[A:%.*]], i64 [[IDXPROM]]174; CHECK-NEXT: store float 0.000000e+00, ptr [[ARRAYIDX]], align 4, !tbaa [[TBAA4:![0-9]+]]175; CHECK-NEXT: [[TMP0:%.*]] = load i32, ptr [[GI]], align 4, !tbaa [[TBAA0]]176; CHECK-NEXT: [[INC]] = add nsw i32 [[TMP0]], 1177; CHECK-NEXT: br label [[FOR_COND]]178; CHECK: for.end:179; CHECK-NEXT: ret void180;181entry:182 store i32 42, ptr %gi, align 4, !tbaa !0183 br label %for.cond184 185for.cond:186 %storemerge = phi i32 [ 0, %entry ], [ %inc, %for.body ]187 %0 = load i32, ptr %gi, align 4, !tbaa !0188 %cmp = icmp slt i32 %0, %n189 br i1 %cmp, label %for.body, label %for.end190 191for.body:192 %idxprom = sext i32 %0 to i64193 %arrayidx = getelementptr inbounds float, ptr %a, i64 %idxprom194 store float 0.000000e+00, ptr %arrayidx, align 4, !tbaa !3195 %1 = load i32, ptr %gi, align 4, !tbaa !0196 %inc = add nsw i32 %1, 1197 store i32 %inc, ptr %gi, align 4, !tbaa !0198 br label %for.cond199 200for.end:201 ret void202}203 204define void @dse1(ptr %p) {205; CHECK-LABEL: @dse1(206; CHECK-NEXT: store i32 0, ptr [[P:%.*]], align 4207; CHECK-NEXT: ret void208;209 store i32 0, ptr %p210 store i32 0, ptr %p211 ret void212}213 214; Slightly subtle: if we're mixing atomic and non-atomic access to the215; same location, then the contents of the location are undefined if there's216; an actual race. As such, we're free to pick either store under the217; assumption that we're not racing with any other thread.218define void @dse2(ptr %p) {219; CHECK-LABEL: @dse2(220; CHECK-NEXT: store i32 0, ptr [[P:%.*]], align 4221; CHECK-NEXT: ret void222;223 store atomic i32 0, ptr %p unordered, align 4224 store i32 0, ptr %p225 ret void226}227 228define void @dse3(ptr %p) {229; CHECK-LABEL: @dse3(230; CHECK-NEXT: store atomic i32 0, ptr [[P:%.*]] unordered, align 4231; CHECK-NEXT: ret void232;233 store i32 0, ptr %p234 store atomic i32 0, ptr %p unordered, align 4235 ret void236}237 238define void @dse4(ptr %p) {239; CHECK-LABEL: @dse4(240; CHECK-NEXT: store atomic i32 0, ptr [[P:%.*]] unordered, align 4241; CHECK-NEXT: ret void242;243 store atomic i32 0, ptr %p unordered, align 4244 store atomic i32 0, ptr %p unordered, align 4245 ret void246}247 248; Implementation limit - could remove unordered store here, but249; currently don't.250define void @dse5(ptr %p) {251; CHECK-LABEL: @dse5(252; CHECK-NEXT: store atomic i32 0, ptr [[P:%.*]] unordered, align 4253; CHECK-NEXT: store atomic i32 0, ptr [[P]] seq_cst, align 4254; CHECK-NEXT: ret void255;256 store atomic i32 0, ptr %p unordered, align 4257 store atomic i32 0, ptr %p seq_cst, align 4258 ret void259}260 261define void @write_back1(ptr %p) {262; CHECK-LABEL: @write_back1(263; CHECK-NEXT: ret void264;265 %v = load i32, ptr %p266 store i32 %v, ptr %p267 ret void268}269 270define void @write_back2(ptr %p) {271; CHECK-LABEL: @write_back2(272; CHECK-NEXT: ret void273;274 %v = load atomic i32, ptr %p unordered, align 4275 store i32 %v, ptr %p276 ret void277}278 279define void @write_back3(ptr %p) {280; CHECK-LABEL: @write_back3(281; CHECK-NEXT: ret void282;283 %v = load i32, ptr %p284 store atomic i32 %v, ptr %p unordered, align 4285 ret void286}287 288define void @write_back4(ptr %p) {289; CHECK-LABEL: @write_back4(290; CHECK-NEXT: ret void291;292 %v = load atomic i32, ptr %p unordered, align 4293 store atomic i32 %v, ptr %p unordered, align 4294 ret void295}296 297; Can't remove store due to ordering side effect298define void @write_back5(ptr %p) {299; CHECK-LABEL: @write_back5(300; CHECK-NEXT: [[V:%.*]] = load atomic i32, ptr [[P:%.*]] unordered, align 4301; CHECK-NEXT: store atomic i32 [[V]], ptr [[P]] seq_cst, align 4302; CHECK-NEXT: ret void303;304 %v = load atomic i32, ptr %p unordered, align 4305 store atomic i32 %v, ptr %p seq_cst, align 4306 ret void307}308 309define void @write_back6(ptr %p) {310; CHECK-LABEL: @write_back6(311; CHECK-NEXT: [[V:%.*]] = load atomic i32, ptr [[P:%.*]] seq_cst, align 4312; CHECK-NEXT: ret void313;314 %v = load atomic i32, ptr %p seq_cst, align 4315 store atomic i32 %v, ptr %p unordered, align 4316 ret void317}318 319define void @write_back7(ptr %p) {320; CHECK-LABEL: @write_back7(321; CHECK-NEXT: [[V:%.*]] = load atomic volatile i32, ptr [[P:%.*]] seq_cst, align 4322; CHECK-NEXT: ret void323;324 %v = load atomic volatile i32, ptr %p seq_cst, align 4325 store atomic i32 %v, ptr %p unordered, align 4326 ret void327}328 329@Unknown = external constant i32330 331define void @store_to_constant() {332; CHECK-LABEL: @store_to_constant(333; CHECK-NEXT: ret void334;335 store i32 0, ptr @Unknown336 ret void337}338 339; Delete stores to readonly noalias pointers.340define void @store_to_readonly_noalias(ptr readonly noalias %0) {341; CHECK-LABEL: @store_to_readonly_noalias(342; CHECK-NEXT: ret void343;344 store i32 3, ptr %0, align 4345 ret void346}347 348define void @store_select_with_null(i1 %cond, ptr %p) {349; CHECK-LABEL: @store_select_with_null(350; CHECK-NEXT: store i32 0, ptr [[SEL:%.*]], align 4351; CHECK-NEXT: ret void352;353 %sel = select i1 %cond, ptr %p, ptr null354 store i32 0, ptr %sel, align 4355 ret void356}357 358define void @store_select_with_null_commuted(i1 %cond, ptr %p) {359; CHECK-LABEL: @store_select_with_null_commuted(360; CHECK-NEXT: store i32 0, ptr [[SEL:%.*]], align 4361; CHECK-NEXT: ret void362;363 %sel = select i1 %cond, ptr null, ptr %p364 store i32 0, ptr %sel, align 4365 ret void366}367 368define void @store_select_with_null_null_is_valid(i1 %cond, ptr %p) null_pointer_is_valid {369; CHECK-LABEL: @store_select_with_null_null_is_valid(370; CHECK-NEXT: [[SEL:%.*]] = select i1 [[COND:%.*]], ptr [[P:%.*]], ptr null371; CHECK-NEXT: store i32 0, ptr [[SEL]], align 4372; CHECK-NEXT: ret void373;374 %sel = select i1 %cond, ptr %p, ptr null375 store i32 0, ptr %sel, align 4376 ret void377}378 379define void @store_select_with_unknown(i1 %cond, ptr %p, ptr %p2) {380; CHECK-LABEL: @store_select_with_unknown(381; CHECK-NEXT: [[SEL:%.*]] = select i1 [[COND:%.*]], ptr [[P:%.*]], ptr [[P2:%.*]]382; CHECK-NEXT: store i32 0, ptr [[SEL]], align 4383; CHECK-NEXT: ret void384;385 %sel = select i1 %cond, ptr %p, ptr %p2386 store i32 0, ptr %sel, align 4387 ret void388}389 390define void @store_select_with_null_gep(i1 %cond, ptr %p, i64 %off) {391; CHECK-LABEL: @store_select_with_null_gep(392; CHECK-NEXT: [[GEP:%.*]] = getelementptr i8, ptr [[SEL:%.*]], i64 [[OFF:%.*]]393; CHECK-NEXT: store i32 0, ptr [[GEP]], align 4394; CHECK-NEXT: ret void395;396 %sel = select i1 %cond, ptr %p, ptr null397 %gep = getelementptr i8, ptr %sel, i64 %off398 store i32 0, ptr %gep, align 4399 ret void400}401 402!0 = !{!4, !4, i64 0}403!1 = !{!"omnipotent char", !2}404!2 = !{!"Simple C/C++ TBAA"}405!3 = !{!"float", !1}406!4 = !{!"int", !1}407