56 lines · plain
1; NOTE: Assertions have been autogenerated by utils/update_test_checks.py2; RUN: opt -O3 -S < %s | FileCheck %s3 4target datalayout = "e-p:64:64:64-i1:8:8-i8:8:8-i16:16:16-i32:32:32-i64:64:64-f32:32:32-f64:64:64-v64:64:64-v128:128:128-a0:0:64-s0:64:64-f80:128:128-n8:16:32:64"5target triple = "x86_64-apple-macosx10.6.7"6 7declare ptr @malloc(i64)8declare void @free(ptr)9 10; PR233811define void @test1() nounwind ssp {12; CHECK-LABEL: @test1(13; CHECK-NEXT: ret void14;15 %retval = alloca i32, align 416 %i = alloca ptr, align 817 %call = call ptr @malloc(i64 1)18 store ptr %call, ptr %i, align 819 %tmp = load ptr, ptr %i, align 820 store i8 1, ptr %tmp21 %tmp1 = load ptr, ptr %i, align 822 call void @free(ptr %tmp1)23 ret void24 25}26 27; This function exposes a phase ordering problem when InstCombine is28; turning %add into a bitmask, making it difficult to spot a 0 return value.29;30; It it also important that %add is expressed as a multiple of %div so scalar31; evolution can recognize it.32define i32 @test2(i32 %a, ptr %p) nounwind uwtable ssp {33; CHECK-LABEL: @test2(34; CHECK-NEXT: entry:35; CHECK-NEXT: [[DIV1:%.*]] = lshr i32 [[A:%.*]], 236; CHECK-NEXT: store i32 [[DIV1]], ptr [[P:%.*]], align 437; CHECK-NEXT: [[ADD:%.*]] = shl nuw nsw i32 [[DIV1]], 138; CHECK-NEXT: [[ARRAYIDX1:%.*]] = getelementptr inbounds nuw i8, ptr [[P]], i64 439; CHECK-NEXT: store i32 [[ADD]], ptr [[ARRAYIDX1]], align 440; CHECK-NEXT: ret i32 041;42entry:43 %div = udiv i32 %a, 444 store i32 %div, ptr %p, align 445 %add = add i32 %div, %div46 %arrayidx1 = getelementptr inbounds i32, ptr %p, i64 147 store i32 %add, ptr %arrayidx1, align 448 %arrayidx2 = getelementptr inbounds i32, ptr %p, i64 149 %0 = load i32, ptr %arrayidx2, align 450 %1 = load i32, ptr %p, align 451 %mul = mul i32 2, %152 %sub = sub i32 %0, %mul53 ret i32 %sub54 55}56