From: Stephen Lin Date: Sun, 14 Jul 2013 01:42:54 +0000 (+0000) Subject: Update Transforms tests to use CHECK-LABEL for easier debugging. No functionality... X-Git-Url: http://plrg.eecs.uci.edu/git/?p=oota-llvm.git;a=commitdiff_plain;h=39f4e8d9cce22b60a3417a5f17c847fa5b1daebf;hp=82e539d037a33f968e4a5476d3d471e1112f8ab2 Update Transforms tests to use CHECK-LABEL for easier debugging. No functionality change. This update was done with the following bash script: find test/Transforms -name "*.ll" | \ while read NAME; do echo "$NAME" if ! grep -q "^; *RUN: *llc" $NAME; then TEMP=`mktemp -t temp` cp $NAME $TEMP sed -n "s/^define [^@]*@\([A-Za-z0-9_]*\)(.*$/\1/p" < $NAME | \ while read FUNC; do sed -i '' "s/;\(.*\)\([A-Za-z0-9_]*\):\( *\)@$FUNC\([( ]*\)\$/;\1\2-LABEL:\3@$FUNC(/g" $TEMP done mv $TEMP $NAME fi done git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@186268 91177308-0d34-0410-b5e6-96231b3b80d8 --- diff --git a/test/Transforms/BBVectorize/X86/cmp-types.ll b/test/Transforms/BBVectorize/X86/cmp-types.ll index a4fcbb6048f..fc1da1b0c60 100644 --- a/test/Transforms/BBVectorize/X86/cmp-types.ll +++ b/test/Transforms/BBVectorize/X86/cmp-types.ll @@ -11,6 +11,6 @@ entry: %tobool21 = icmp ne %"struct.btSoftBody"* %n2, null %cond22 = zext i1 %tobool21 to i32 ret void -; CHECK: @test1 +; CHECK-LABEL: @test1( } diff --git a/test/Transforms/BBVectorize/X86/loop1.ll b/test/Transforms/BBVectorize/X86/loop1.ll index bbf565d1cc7..401808441c2 100644 --- a/test/Transforms/BBVectorize/X86/loop1.ll +++ b/test/Transforms/BBVectorize/X86/loop1.ll @@ -7,8 +7,8 @@ target triple = "x86_64-unknown-linux-gnu" define void @test1(double* noalias %out, double* noalias %in1, double* noalias %in2) nounwind uwtable { entry: br label %for.body -; CHECK: @test1 -; CHECK-UNRL: @test1 +; CHECK-LABEL: @test1( +; CHECK-UNRL-LABEL: @test1( for.body: ; preds = %for.body, %entry %indvars.iv = phi i64 [ 0, %entry ], [ %indvars.iv.next, %for.body ] diff --git a/test/Transforms/BBVectorize/X86/sh-rec.ll b/test/Transforms/BBVectorize/X86/sh-rec.ll index 1e0492c2a8c..ad75fc96d9f 100644 --- a/test/Transforms/BBVectorize/X86/sh-rec.ll +++ b/test/Transforms/BBVectorize/X86/sh-rec.ll @@ -46,7 +46,7 @@ if.end10: ; preds = %entry return: ; preds = %entry ret void -; CHECK: @ptoa +; CHECK-LABEL: @ptoa( } declare noalias i8* @malloc() nounwind diff --git a/test/Transforms/BBVectorize/X86/sh-rec2.ll b/test/Transforms/BBVectorize/X86/sh-rec2.ll index ef2239932fa..d65ac1cc12f 100644 --- a/test/Transforms/BBVectorize/X86/sh-rec2.ll +++ b/test/Transforms/BBVectorize/X86/sh-rec2.ll @@ -77,7 +77,7 @@ entry: %and390 = shl i8 %conv3898, 6 store i8 %and390, i8* %incdec.ptr387, align 1 unreachable -; CHECK: @gsm_encode +; CHECK-LABEL: @gsm_encode( } declare void @Gsm_Coder(%struct.gsm_state.2.8.14.15.16.17.19.22.23.25.26.28.29.31.32.33.35.36.37.38.40.41.42.44.45.47.48.50.52.53.54.56.57.58.59.60.61.62.63.66.73.83.84.89.90.91.92.93.94.95.96.99.100.101.102.103.104.106.107.114.116.121.122.129.130.135.136.137.138.139.140.141.142.143.144.147.148.149.158.159.160.161.164.165.166.167.168.169.172.179.181.182.183.188.195.200.201.202.203.204.205.208.209.210.212.213.214.215.222.223.225.226.230.231.232.233.234.235.236.237.238.239.240.241.242.243.244.352*, i16*, i16*, i16*, i16*, i16*, i16*, i16*) diff --git a/test/Transforms/BBVectorize/X86/sh-rec3.ll b/test/Transforms/BBVectorize/X86/sh-rec3.ll index fd2cc8bdd91..ad880ed8895 100644 --- a/test/Transforms/BBVectorize/X86/sh-rec3.ll +++ b/test/Transforms/BBVectorize/X86/sh-rec3.ll @@ -162,7 +162,7 @@ entry: %conv365 = trunc i32 %or364 to i8 store i8 %conv365, i8* %incdec.ptr350, align 1 unreachable -; CHECK: @gsm_encode +; CHECK-LABEL: @gsm_encode( } declare void @Gsm_Coder(%struct.gsm_state.2.8.39.44.45.55.56.57.58.59.62.63.64.65.74.75.76.77.80.87.92.93.94.95.96.97.110.111.112.113.114.128.130.135.136.137.138.139.140.141.142.143.144.145.148.149.150.151.152.169.170.177.178.179.184.185.186.187.188.201.208.209.219.220.221.223.224.225.230.231.232.233.235.236.237.238.245.246.248.249.272.274.279.280.281.282.283.286.293.298.299.314.315.316.317.318.319.320.321.322.323.324.325.326.327.328.329.330.331.332.333.334.335.336.337.338.339.340.341.342.343.344.345.346.347.348.349.350.351.352.353.565*, i16*, i16*, i16*, i16*, i16*, i16*, i16*) diff --git a/test/Transforms/BBVectorize/X86/sh-types.ll b/test/Transforms/BBVectorize/X86/sh-types.ll index 0bcb714d5e6..fbff2fb86eb 100644 --- a/test/Transforms/BBVectorize/X86/sh-types.ll +++ b/test/Transforms/BBVectorize/X86/sh-types.ll @@ -18,7 +18,7 @@ define <4 x float> @test7(<4 x float> %A1, <4 x float> %B1, double %C1, double % %R = fmul <4 x float> %Y1, %Y2 ret <4 x float> %R -; CHECK: @test7 +; CHECK-LABEL: @test7( ; CHECK-NOT: <8 x float> ; CHECK: ret <4 x float> } diff --git a/test/Transforms/BBVectorize/X86/simple-int.ll b/test/Transforms/BBVectorize/X86/simple-int.ll index f5dbe46b148..7842ec85b6c 100644 --- a/test/Transforms/BBVectorize/X86/simple-int.ll +++ b/test/Transforms/BBVectorize/X86/simple-int.ll @@ -16,7 +16,7 @@ define double @test1(double %A1, double %A2, double %B1, double %B2, double %C1, %Z2 = fadd double %Y2, %B2 %R = fmul double %Z1, %Z2 ret double %R -; CHECK: @test1 +; CHECK-LABEL: @test1( ; CHECK: ret double %R } @@ -30,7 +30,7 @@ define double @test1a(double %A1, double %A2, double %B1, double %B2, double %C1 %Z2 = fadd double %Y2, %B2 %R = fmul double %Z1, %Z2 ret double %R -; CHECK: @test1a +; CHECK-LABEL: @test1a( ; CHECK: ret double %R } @@ -44,7 +44,7 @@ define double @test2(double %A1, double %A2, double %B1, double %B2) { %Z2 = fadd double %Y2, %B2 %R = fmul double %Z1, %Z2 ret double %R -; CHECK: @test2 +; CHECK-LABEL: @test2( ; CHECK: ret double %R } @@ -58,7 +58,7 @@ define double @test3(double %A1, double %A2, double %B1, double %B2, i32 %P) { %Z2 = fadd double %Y2, %B2 %R = fmul double %Z1, %Z2 ret double %R -; CHECK: @test3 +; CHECK-LABEL: @test3( ; CHECK: ret double %R } @@ -73,7 +73,7 @@ define double @test4(double %A1, double %A2, double %B1, double %B2, i32 %P) { %Z2 = fadd double %Y2, %B2 %R = fmul double %Z1, %Z2 ret double %R -; CHECK: @test4 +; CHECK-LABEL: @test4( ; CHECK: ret double %R } diff --git a/test/Transforms/BBVectorize/X86/simple-ldstr.ll b/test/Transforms/BBVectorize/X86/simple-ldstr.ll index 0124399bad9..1abbc34b68e 100644 --- a/test/Transforms/BBVectorize/X86/simple-ldstr.ll +++ b/test/Transforms/BBVectorize/X86/simple-ldstr.ll @@ -16,7 +16,7 @@ entry: %arrayidx5 = getelementptr inbounds double* %c, i64 1 store double %mul5, double* %arrayidx5, align 8 ret void -; CHECK: @test1 +; CHECK-LABEL: @test1( ; CHECK: %i0.v.i0 = bitcast double* %a to <2 x double>* ; CHECK: %i1.v.i0 = bitcast double* %b to <2 x double>* ; CHECK: %i0 = load <2 x double>* %i0.v.i0, align 8 diff --git a/test/Transforms/BBVectorize/X86/simple.ll b/test/Transforms/BBVectorize/X86/simple.ll index 8abfa5f8bd2..a11e3090f20 100644 --- a/test/Transforms/BBVectorize/X86/simple.ll +++ b/test/Transforms/BBVectorize/X86/simple.ll @@ -11,7 +11,7 @@ define double @test1(double %A1, double %A2, double %B1, double %B2) { %Z2 = fadd double %Y2, %B2 %R = fmul double %Z1, %Z2 ret double %R -; CHECK: @test1 +; CHECK-LABEL: @test1( ; CHECK: fsub <2 x double> ; CHECK: fmul <2 x double> ; CHECK: fadd <2 x double> @@ -38,7 +38,7 @@ define double @test1a(double %A1, double %A2, double %B1, double %B2) { %S2 = fadd double %W2, %Q2 %R = fmul double %S1, %S2 ret double %R -; CHECK: @test1a +; CHECK-LABEL: @test1a( ; CHECK: %X1.v.i1.1 = insertelement <2 x double> undef, double %B1, i32 0 ; CHECK: %X1.v.i1.2 = insertelement <2 x double> %X1.v.i1.1, double %B2, i32 1 ; CHECK: %X1.v.i0.1 = insertelement <2 x double> undef, double %A1, i32 0 @@ -66,7 +66,7 @@ define double @test2(double %A1, double %A2, double %B1, double %B2) { %Z2 = fadd double %Y1, %B2 %R = fmul double %Z1, %Z2 ret double %R -; CHECK: @test2 +; CHECK-LABEL: @test2( ; CHECK: insertelement ; CHECK: insertelement ; CHECK: insertelement @@ -88,7 +88,7 @@ define double @test4(double %A1, double %A2, double %B1, double %B2) { %W2 = fadd double %Y1, %Z2 %R = fmul double %Z1, %Z2 ret double %R -; CHECK: @test4 +; CHECK-LABEL: @test4( ; CHECK: insertelement ; CHECK: insertelement ; CHECK: insertelement @@ -113,7 +113,7 @@ define <8 x i8> @test6(<8 x i8> %A1, <8 x i8> %A2, <8 x i8> %B1, <8 x i8> %B2) { %Q2 = shufflevector <8 x i8> %Z2, <8 x i8> %Z2, <8 x i32> %R = mul <8 x i8> %Q1, %Q2 ret <8 x i8> %R -; CHECK: @test6 +; CHECK-LABEL: @test6( ; CHECK-NOT: sub <16 x i8> ; CHECK: ret <8 x i8> } diff --git a/test/Transforms/BBVectorize/X86/vs-cast.ll b/test/Transforms/BBVectorize/X86/vs-cast.ll index be3efca925b..0c666b11976 100644 --- a/test/Transforms/BBVectorize/X86/vs-cast.ll +++ b/test/Transforms/BBVectorize/X86/vs-cast.ll @@ -7,6 +7,6 @@ entry: %0 = bitcast <2 x i64> undef to i128 %1 = bitcast <2 x i64> undef to i128 ret void -; CHECK: @main +; CHECK-LABEL: @main( } diff --git a/test/Transforms/BBVectorize/cycle.ll b/test/Transforms/BBVectorize/cycle.ll index bdcb30da887..6bfa625ea5f 100644 --- a/test/Transforms/BBVectorize/cycle.ll +++ b/test/Transforms/BBVectorize/cycle.ll @@ -105,7 +105,7 @@ go: br i1 %or.cond, label %done, label %go done: ret void -; CHECK: @test1 +; CHECK-LABEL: @test1( ; CHECK: go: ; CHECK: %conv.v.i0.1 = insertelement <2 x i32> undef, i32 %n.0, i32 0 ; FIXME: When tree pruning is deterministic, include the entire output. diff --git a/test/Transforms/BBVectorize/ld1.ll b/test/Transforms/BBVectorize/ld1.ll index ea5cb5dd93f..9c79eef05f7 100644 --- a/test/Transforms/BBVectorize/ld1.ll +++ b/test/Transforms/BBVectorize/ld1.ll @@ -22,7 +22,7 @@ entry: %add15 = fadd double %mul13, %i5 %mul16 = fmul double %add11, %add15 ret double %mul16 -; CHECK: @test1 +; CHECK-LABEL: @test1( ; CHECK: %i0.v.i0 = bitcast double* %a to <2 x double>* ; CHECK: %i1.v.i0 = bitcast double* %b to <2 x double>* ; CHECK: %i2.v.i0 = bitcast double* %c to <2 x double>* diff --git a/test/Transforms/BBVectorize/loop1.ll b/test/Transforms/BBVectorize/loop1.ll index e592edb44a0..ed7be15f7ad 100644 --- a/test/Transforms/BBVectorize/loop1.ll +++ b/test/Transforms/BBVectorize/loop1.ll @@ -7,8 +7,8 @@ target triple = "x86_64-unknown-linux-gnu" define void @test1(double* noalias %out, double* noalias %in1, double* noalias %in2) nounwind uwtable { entry: br label %for.body -; CHECK: @test1 -; CHECK-UNRL: @test1 +; CHECK-LABEL: @test1( +; CHECK-UNRL-LABEL: @test1( for.body: ; preds = %for.body, %entry %indvars.iv = phi i64 [ 0, %entry ], [ %indvars.iv.next, %for.body ] diff --git a/test/Transforms/BBVectorize/mem-op-depth.ll b/test/Transforms/BBVectorize/mem-op-depth.ll index 84f16bd2f47..c31d4521183 100644 --- a/test/Transforms/BBVectorize/mem-op-depth.ll +++ b/test/Transforms/BBVectorize/mem-op-depth.ll @@ -6,7 +6,7 @@ target triple = "x86_64-unknown-linux-gnu" @B = common global [1024 x float] zeroinitializer, align 16 define i32 @test1() nounwind { -; CHECK: @test1 +; CHECK-LABEL: @test1( %V1 = load float* getelementptr inbounds ([1024 x float]* @A, i64 0, i64 0), align 16 %V2 = load float* getelementptr inbounds ([1024 x float]* @A, i64 0, i64 1), align 4 %V3= load float* getelementptr inbounds ([1024 x float]* @A, i64 0, i64 2), align 8 diff --git a/test/Transforms/BBVectorize/metadata.ll b/test/Transforms/BBVectorize/metadata.ll index 1e3aaa127a0..ac7297dd541 100644 --- a/test/Transforms/BBVectorize/metadata.ll +++ b/test/Transforms/BBVectorize/metadata.ll @@ -16,7 +16,7 @@ entry: %arrayidx5 = getelementptr inbounds double* %c, i64 1 store double %mul5, double* %arrayidx5, align 8 ret void -; CHECK: @test1 +; CHECK-LABEL: @test1( ; CHECK: !fpmath ; CHECK: ret void } @@ -36,7 +36,7 @@ entry: %arrayidx5 = getelementptr inbounds i64* %c, i64 1 store i64 %mul5, i64* %arrayidx5, align 8 ret void -; CHECK: @test2 +; CHECK-LABEL: @test2( ; CHECK-NOT: !range ; CHECK: ret void } diff --git a/test/Transforms/BBVectorize/no-ldstr-conn.ll b/test/Transforms/BBVectorize/no-ldstr-conn.ll index ada2a71e36e..bcc5ce7531b 100644 --- a/test/Transforms/BBVectorize/no-ldstr-conn.ll +++ b/test/Transforms/BBVectorize/no-ldstr-conn.ll @@ -17,7 +17,7 @@ entry: store i64 %v3a, i64* %a3, align 8 %r = add i64 %v2, %v3 ret i64 %r -; CHECK: @test2 +; CHECK-LABEL: @test2( ; CHECK-NOT: getelementptr <2 x i64*> } diff --git a/test/Transforms/BBVectorize/req-depth.ll b/test/Transforms/BBVectorize/req-depth.ll index e0120059b95..2675354183a 100644 --- a/test/Transforms/BBVectorize/req-depth.ll +++ b/test/Transforms/BBVectorize/req-depth.ll @@ -9,8 +9,8 @@ define double @test1(double %A1, double %A2, double %B1, double %B2) { %Y2 = fmul double %X2, %A2 %R = fmul double %Y1, %Y2 ret double %R -; CHECK-RD3: @test1 -; CHECK-RD2: @test1 +; CHECK-RD3-LABEL: @test1( +; CHECK-RD2-LABEL: @test1( ; CHECK-RD3-NOT: <2 x double> ; CHECK-RD2: <2 x double> } diff --git a/test/Transforms/BBVectorize/search-limit.ll b/test/Transforms/BBVectorize/search-limit.ll index a694e45bc18..be38d340260 100644 --- a/test/Transforms/BBVectorize/search-limit.ll +++ b/test/Transforms/BBVectorize/search-limit.ll @@ -3,8 +3,8 @@ target datalayout = "e-p:64:64:64-i1:8:8-i8:8:8-i16:16:16-i32:32:32-i64:64:64-f3 ; RUN: opt < %s -bb-vectorize -bb-vectorize-req-chain-depth=3 -bb-vectorize-search-limit=4 -bb-vectorize-ignore-target-info -instcombine -gvn -S | FileCheck %s -check-prefix=CHECK-SL4 define double @test1(double %A1, double %A2, double %B1, double %B2) { -; CHECK: @test1 -; CHECK-SL4: @test1 +; CHECK-LABEL: @test1( +; CHECK-SL4-LABEL: @test1( ; CHECK-SL4-NOT: <2 x double> ; CHECK: %X1.v.i1.1 = insertelement <2 x double> undef, double %B1, i32 0 ; CHECK: %X1.v.i1.2 = insertelement <2 x double> %X1.v.i1.1, double %B2, i32 1 diff --git a/test/Transforms/BBVectorize/simple-int.ll b/test/Transforms/BBVectorize/simple-int.ll index e4d51526ca1..e33ac612edc 100644 --- a/test/Transforms/BBVectorize/simple-int.ll +++ b/test/Transforms/BBVectorize/simple-int.ll @@ -16,7 +16,7 @@ define double @test1(double %A1, double %A2, double %B1, double %B2, double %C1, %Z2 = fadd double %Y2, %B2 %R = fmul double %Z1, %Z2 ret double %R -; CHECK: @test1 +; CHECK-LABEL: @test1( ; CHECK: %X1.v.i1.1 = insertelement <2 x double> undef, double %B1, i32 0 ; CHECK: %X1.v.i1.2 = insertelement <2 x double> %X1.v.i1.1, double %B2, i32 1 ; CHECK: %X1.v.i0.1 = insertelement <2 x double> undef, double %A1, i32 0 @@ -42,7 +42,7 @@ define double @test1a(double %A1, double %A2, double %B1, double %B2, double %C1 %Z2 = fadd double %Y2, %B2 %R = fmul double %Z1, %Z2 ret double %R -; CHECK: @test1a +; CHECK-LABEL: @test1a( ; CHECK: %X1.v.i1.1 = insertelement <2 x double> undef, double %B1, i32 0 ; CHECK: %X1.v.i1.2 = insertelement <2 x double> %X1.v.i1.1, double %B2, i32 1 ; CHECK: %X1.v.i0.1 = insertelement <2 x double> undef, double %A1, i32 0 @@ -68,7 +68,7 @@ define double @test2(double %A1, double %A2, double %B1, double %B2) { %Z2 = fadd double %Y2, %B2 %R = fmul double %Z1, %Z2 ret double %R -; CHECK: @test2 +; CHECK-LABEL: @test2( ; CHECK: %X1.v.i1.1 = insertelement <2 x double> undef, double %B1, i32 0 ; CHECK: %X1.v.i1.2 = insertelement <2 x double> %X1.v.i1.1, double %B2, i32 1 ; CHECK: %X1.v.i0.1 = insertelement <2 x double> undef, double %A1, i32 0 @@ -93,7 +93,7 @@ define double @test3(double %A1, double %A2, double %B1, double %B2, i32 %P) { %Z2 = fadd double %Y2, %B2 %R = fmul double %Z1, %Z2 ret double %R -; CHECK: @test3 +; CHECK-LABEL: @test3( ; CHECK: %X1.v.i1.1 = insertelement <2 x double> undef, double %B1, i32 0 ; CHECK: %X1.v.i1.2 = insertelement <2 x double> %X1.v.i1.1, double %B2, i32 1 ; CHECK: %X1.v.i0.1 = insertelement <2 x double> undef, double %A1, i32 0 @@ -119,7 +119,7 @@ define double @test4(double %A1, double %A2, double %B1, double %B2, i32 %P) { %Z2 = fadd double %Y2, %B2 %R = fmul double %Z1, %Z2 ret double %R -; CHECK: @test4 +; CHECK-LABEL: @test4( ; CHECK-NOT: <2 x double> ; CHECK: ret double %R } diff --git a/test/Transforms/BBVectorize/simple-ldstr-ptrs.ll b/test/Transforms/BBVectorize/simple-ldstr-ptrs.ll index d46f7692b6d..4d2298c1a11 100644 --- a/test/Transforms/BBVectorize/simple-ldstr-ptrs.ll +++ b/test/Transforms/BBVectorize/simple-ldstr-ptrs.ll @@ -27,7 +27,7 @@ entry: %arrayidx5 = getelementptr inbounds i64* %c, i64 1 store i64 %mul5, i64* %arrayidx5, align 8 ret double %r -; CHECK: @test1 +; CHECK-LABEL: @test1( ; CHECK: %i0.v.i0 = bitcast i64* %a to <2 x i64>* ; CHECK: %i1.v.i0 = bitcast i64* %b to <2 x i64>* ; CHECK: %i0 = load <2 x i64>* %i0.v.i0, align 8 @@ -43,7 +43,7 @@ entry: ; CHECK: %0 = bitcast i64* %c to <2 x i64>* ; CHECK: store <2 x i64> %mul, <2 x i64>* %0, align 8 ; CHECK: ret double %r -; CHECK-AO: @test1 +; CHECK-AO-LABEL: @test1( ; CHECK-AO-NOT: load <2 x } @@ -64,7 +64,7 @@ entry: %arrayidx5 = getelementptr inbounds i64** %c, i64 1 store i64* %ptr3, i64** %arrayidx5, align 8 ret void -; CHECK: @test2 +; CHECK-LABEL: @test2( ; CHECK: %i0.v.i0 = bitcast i64** %a to <2 x i64*>* ; CHECK: %i1 = load i64** %b, align 8 ; CHECK: %i0 = load <2 x i64*>* %i0.v.i0, align 8 @@ -78,7 +78,7 @@ entry: ; CHECK: %0 = bitcast i64** %c to <2 x i64*>* ; CHECK: store <2 x i64*> %ptr0, <2 x i64*>* %0, align 8 ; CHECK: ret void -; CHECK-AO: @test2 +; CHECK-AO-LABEL: @test2( ; CHECK-AO-NOT: <2 x } @@ -108,7 +108,7 @@ entry: %arrayidx5 = getelementptr inbounds <2 x i64*>* %c, i64 1 store <2 x i64*> %rtr3, <2 x i64*>* %arrayidx5, align 8 ret void -; CHECK: @test3 +; CHECK-LABEL: @test3( ; CHECK: %i0.v.i0 = bitcast <2 x i64*>* %a to <4 x i64*>* ; CHECK: %i1 = load <2 x i64*>* %b, align 8 ; CHECK: %i0 = load <4 x i64*>* %i0.v.i0, align 8 @@ -128,7 +128,7 @@ entry: ; CHECK: %1 = shufflevector <2 x i64*> %rtr0, <2 x i64*> %rtr3, <4 x i32> ; CHECK: store <4 x i64*> %1, <4 x i64*>* %0, align 8 ; CHECK: ret void -; CHECK-AO: @test3 +; CHECK-AO-LABEL: @test3( ; CHECK-AO-NOT: <4 x } diff --git a/test/Transforms/BBVectorize/simple-ldstr.ll b/test/Transforms/BBVectorize/simple-ldstr.ll index 8e51d297e8e..558f8b38d79 100644 --- a/test/Transforms/BBVectorize/simple-ldstr.ll +++ b/test/Transforms/BBVectorize/simple-ldstr.ll @@ -17,7 +17,7 @@ entry: %arrayidx5 = getelementptr inbounds double* %c, i64 1 store double %mul5, double* %arrayidx5, align 8 ret void -; CHECK: @test1 +; CHECK-LABEL: @test1( ; CHECK: %i0.v.i0 = bitcast double* %a to <2 x double>* ; CHECK: %i1.v.i0 = bitcast double* %b to <2 x double>* ; CHECK: %i0 = load <2 x double>* %i0.v.i0, align 8 @@ -26,7 +26,7 @@ entry: ; CHECK: %0 = bitcast double* %c to <2 x double>* ; CHECK: store <2 x double> %mul, <2 x double>* %0, align 8 ; CHECK: ret void -; CHECK-AO: @test1 +; CHECK-AO-LABEL: @test1( ; CHECK-AO-NOT: <2 x double> } @@ -49,7 +49,7 @@ entry: %arrayidx5 = getelementptr inbounds double* %c, i64 1 store double %mul5, double* %arrayidx5, align 8 ret void -; CHECK: @test2 +; CHECK-LABEL: @test2( ; CHECK: %i0f.v.i0 = bitcast float* %a to <2 x float>* ; CHECK: %i1f.v.i0 = bitcast float* %b to <2 x float>* ; CHECK: %i0f = load <2 x float>* %i0f.v.i0, align 4 @@ -60,7 +60,7 @@ entry: ; CHECK: %0 = bitcast double* %c to <2 x double>* ; CHECK: store <2 x double> %mul, <2 x double>* %0, align 8 ; CHECK: ret void -; CHECK-AO: @test2 +; CHECK-AO-LABEL: @test2( ; CHECK-AO-NOT: <2 x double> } @@ -81,7 +81,7 @@ entry: %arrayidx5 = getelementptr inbounds float* %c, i64 1 store float %mul5f, float* %arrayidx5, align 4 ret void -; CHECK: @test3 +; CHECK-LABEL: @test3( ; CHECK: %i0.v.i0 = bitcast double* %a to <2 x double>* ; CHECK: %i1.v.i0 = bitcast double* %b to <2 x double>* ; CHECK: %i0 = load <2 x double>* %i0.v.i0, align 8 @@ -91,7 +91,7 @@ entry: ; CHECK: %0 = bitcast float* %c to <2 x float>* ; CHECK: store <2 x float> %mulf, <2 x float>* %0, align 8 ; CHECK: ret void -; CHECK-AO: @test3 +; CHECK-AO-LABEL: @test3( ; CHECK-AO: %i0 = load double* %a, align 8 ; CHECK-AO: %i1 = load double* %b, align 8 ; CHECK-AO: %arrayidx3 = getelementptr inbounds double* %a, i64 1 @@ -134,9 +134,9 @@ if.then: if.end: ret void -; CHECK: @test4 +; CHECK-LABEL: @test4( ; CHECK-NOT: <2 x double> -; CHECK-AO: @test4 +; CHECK-AO-LABEL: @test4( ; CHECK-AO-NOT: <2 x double> } @@ -155,7 +155,7 @@ entry: store double %mul5, double* %arrayidx5, align 8 store double %mul, double* %c, align 4 ret void -; CHECK: @test5 +; CHECK-LABEL: @test5( ; CHECK: %i0.v.i0 = bitcast double* %a to <2 x double>* ; CHECK: %i1.v.i0 = bitcast double* %b to <2 x double>* ; CHECK: %i0 = load <2 x double>* %i0.v.i0, align 8 @@ -164,7 +164,7 @@ entry: ; CHECK: %0 = bitcast double* %c to <2 x double>* ; CHECK: store <2 x double> %mul, <2 x double>* %0, align 4 ; CHECK: ret void -; CHECK-AO: @test5 +; CHECK-AO-LABEL: @test5( ; CHECK-AO-NOT: <2 x double> } diff --git a/test/Transforms/BBVectorize/simple-sel.ll b/test/Transforms/BBVectorize/simple-sel.ll index 8caccfd32c3..269b07f82d1 100644 --- a/test/Transforms/BBVectorize/simple-sel.ll +++ b/test/Transforms/BBVectorize/simple-sel.ll @@ -4,7 +4,7 @@ target datalayout = "e-p:64:64:64-i1:8:8-i8:8:8-i16:16:16-i32:32:32-i64:64:64-f3 ; Basic depth-3 chain with select define double @test1(double %A1, double %A2, double %B1, double %B2, i1 %C1, i1 %C2) { -; CHECK: @test1 +; CHECK-LABEL: @test1( ; CHECK: %X1.v.i1.1 = insertelement <2 x double> undef, double %B1, i32 0 ; CHECK: %X1.v.i1.2 = insertelement <2 x double> %X1.v.i1.1, double %B2, i32 1 ; CHECK: %X1.v.i0.1 = insertelement <2 x double> undef, double %A1, i32 0 @@ -30,8 +30,8 @@ define double @test1(double %A1, double %A2, double %B1, double %B2, i1 %C1, i1 ; Basic depth-3 chain with select (and vect. compare) define double @test2(double %A1, double %A2, double %B1, double %B2) { -; CHECK: @test2 -; CHECK-NB: @test2 +; CHECK-LABEL: @test2( +; CHECK-NB-LABEL: @test2( ; CHECK: %X1.v.i1.1 = insertelement <2 x double> undef, double %B1, i32 0 ; CHECK: %X1.v.i1.2 = insertelement <2 x double> %X1.v.i1.1, double %B2, i32 1 ; CHECK: %X1.v.i0.1 = insertelement <2 x double> undef, double %A1, i32 0 diff --git a/test/Transforms/BBVectorize/simple-tst.ll b/test/Transforms/BBVectorize/simple-tst.ll index 42146c6d14a..6a88e1b09c1 100644 --- a/test/Transforms/BBVectorize/simple-tst.ll +++ b/test/Transforms/BBVectorize/simple-tst.ll @@ -4,7 +4,7 @@ target triple = "powerpc64-unknown-linux" ; Basic depth-3 chain (target-specific type should not vectorize) define ppc_fp128 @test7(ppc_fp128 %A1, ppc_fp128 %A2, ppc_fp128 %B1, ppc_fp128 %B2) { -; CHECK: @test7 +; CHECK-LABEL: @test7( ; CHECK-NOT: <2 x ppc_fp128> %X1 = fsub ppc_fp128 %A1, %B1 %X2 = fsub ppc_fp128 %A2, %B2 diff --git a/test/Transforms/BBVectorize/simple.ll b/test/Transforms/BBVectorize/simple.ll index a447908d16c..0fe33f17a64 100644 --- a/test/Transforms/BBVectorize/simple.ll +++ b/test/Transforms/BBVectorize/simple.ll @@ -3,7 +3,7 @@ target datalayout = "e-p:64:64:64-i1:8:8-i8:8:8-i16:16:16-i32:32:32-i64:64:64-f3 ; Basic depth-3 chain define double @test1(double %A1, double %A2, double %B1, double %B2) { -; CHECK: @test1 +; CHECK-LABEL: @test1( ; CHECK: %X1.v.i1.1 = insertelement <2 x double> undef, double %B1, i32 0 ; CHECK: %X1.v.i1.2 = insertelement <2 x double> %X1.v.i1.1, double %B2, i32 1 ; CHECK: %X1.v.i0.1 = insertelement <2 x double> undef, double %A1, i32 0 @@ -27,7 +27,7 @@ define double @test1(double %A1, double %A2, double %B1, double %B2) { ; Basic depth-3 chain (last pair permuted) define double @test2(double %A1, double %A2, double %B1, double %B2) { -; CHECK: @test2 +; CHECK-LABEL: @test2( ; CHECK: %X1.v.i1.1 = insertelement <2 x double> undef, double %B1, i32 0 ; CHECK: %X1.v.i1.2 = insertelement <2 x double> %X1.v.i1.1, double %B2, i32 1 ; CHECK: %X1.v.i0.1 = insertelement <2 x double> undef, double %A1, i32 0 @@ -53,7 +53,7 @@ define double @test2(double %A1, double %A2, double %B1, double %B2) { ; Basic depth-3 chain (last pair first splat) define double @test3(double %A1, double %A2, double %B1, double %B2) { -; CHECK: @test3 +; CHECK-LABEL: @test3( ; CHECK: %X1.v.i1.1 = insertelement <2 x double> undef, double %B1, i32 0 ; CHECK: %X1.v.i1.2 = insertelement <2 x double> %X1.v.i1.1, double %B2, i32 1 ; CHECK: %X1.v.i0.1 = insertelement <2 x double> undef, double %A1, i32 0 @@ -78,7 +78,7 @@ define double @test3(double %A1, double %A2, double %B1, double %B2) { ; Basic depth-3 chain (last pair second splat) define double @test4(double %A1, double %A2, double %B1, double %B2) { -; CHECK: @test4 +; CHECK-LABEL: @test4( ; CHECK: %X1.v.i1.1 = insertelement <2 x double> undef, double %B1, i32 0 ; CHECK: %X1.v.i1.2 = insertelement <2 x double> %X1.v.i1.1, double %B2, i32 1 ; CHECK: %X1.v.i0.1 = insertelement <2 x double> undef, double %A1, i32 0 @@ -103,7 +103,7 @@ define double @test4(double %A1, double %A2, double %B1, double %B2) { ; Basic depth-3 chain define <2 x float> @test5(<2 x float> %A1, <2 x float> %A2, <2 x float> %B1, <2 x float> %B2) { -; CHECK: @test5 +; CHECK-LABEL: @test5( ; CHECK: %X1.v.i1 = shufflevector <2 x float> %B1, <2 x float> %B2, <4 x i32> ; CHECK: %X1.v.i0 = shufflevector <2 x float> %A1, <2 x float> %A2, <4 x i32> %X1 = fsub <2 x float> %A1, %B1 @@ -125,7 +125,7 @@ define <2 x float> @test5(<2 x float> %A1, <2 x float> %A2, <2 x float> %B1, <2 ; Basic chain with shuffles define <8 x i8> @test6(<8 x i8> %A1, <8 x i8> %A2, <8 x i8> %B1, <8 x i8> %B2) { -; CHECK: @test6 +; CHECK-LABEL: @test6( ; CHECK: %X1.v.i1 = shufflevector <8 x i8> %B1, <8 x i8> %B2, <16 x i32> ; CHECK: %X1.v.i0 = shufflevector <8 x i8> %A1, <8 x i8> %A2, <16 x i32> %X1 = sub <8 x i8> %A1, %B1 @@ -151,7 +151,7 @@ define <8 x i8> @test6(<8 x i8> %A1, <8 x i8> %A2, <8 x i8> %B1, <8 x i8> %B2) { ; Basic depth-3 chain (flipped order) define double @test7(double %A1, double %A2, double %B1, double %B2) { -; CHECK: @test7 +; CHECK-LABEL: @test7( ; CHECK: %X1.v.i1.1 = insertelement <2 x double> undef, double %B1, i32 0 ; CHECK: %X1.v.i1.2 = insertelement <2 x double> %X1.v.i1.1, double %B2, i32 1 ; CHECK: %X1.v.i0.1 = insertelement <2 x double> undef, double %A1, i32 0 @@ -175,7 +175,7 @@ define double @test7(double %A1, double %A2, double %B1, double %B2) { ; Basic depth-3 chain (subclass data) define i64 @test8(i64 %A1, i64 %A2, i64 %B1, i64 %B2) { -; CHECK: @test8 +; CHECK-LABEL: @test8( ; CHECK: %X1.v.i1.1 = insertelement <2 x i64> undef, i64 %B1, i32 0 ; CHECK: %X1.v.i1.2 = insertelement <2 x i64> %X1.v.i1.1, i64 %B2, i32 1 ; CHECK: %X1.v.i0.1 = insertelement <2 x i64> undef, i64 %A1, i32 0 diff --git a/test/Transforms/BBVectorize/simple3.ll b/test/Transforms/BBVectorize/simple3.ll index 78bcc9f8308..6edf7f07ac1 100644 --- a/test/Transforms/BBVectorize/simple3.ll +++ b/test/Transforms/BBVectorize/simple3.ll @@ -3,7 +3,7 @@ target datalayout = "e-p:64:64:64-i1:8:8-i8:8:8-i16:16:16-i32:32:32-i64:64:64-f3 ; Basic depth-3 chain define double @test1(double %A1, double %A2, double %A3, double %B1, double %B2, double %B3) { -; CHECK: @test1 +; CHECK-LABEL: @test1( ; CHECK: %X1.v.i1.11 = insertelement <3 x double> undef, double %B1, i32 0 ; CHECK: %X1.v.i1.22 = insertelement <3 x double> %X1.v.i1.11, double %B2, i32 1 ; CHECK: %X1.v.i1 = insertelement <3 x double> %X1.v.i1.22, double %B3, i32 2 diff --git a/test/Transforms/CodeGenPrepare/basic.ll b/test/Transforms/CodeGenPrepare/basic.ll index d617e43be86..495d910b5cd 100644 --- a/test/Transforms/CodeGenPrepare/basic.ll +++ b/test/Transforms/CodeGenPrepare/basic.ll @@ -3,7 +3,7 @@ target 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" target triple = "x86_64-apple-darwin10.0.0" -; CHECK: @test1 +; CHECK-LABEL: @test1( ; objectsize should fold to a constant, which causes the branch to fold to an ; uncond branch. Next, we fold the control flow alltogether. ; rdar://8785296 diff --git a/test/Transforms/ConstProp/basictest.ll b/test/Transforms/ConstProp/basictest.ll index e9b5a0a9e1d..afe6ef91240 100644 --- a/test/Transforms/ConstProp/basictest.ll +++ b/test/Transforms/ConstProp/basictest.ll @@ -16,7 +16,7 @@ BB2: br label %BB3 BB3: -; CHECK: @test1 +; CHECK-LABEL: @test1( ; CHECK: %Ret = phi i32 [ 0, %BB1 ], [ 1, %BB2 ] %Ret = phi i32 [ %Val, %BB1 ], [ 1, %BB2 ] ret i32 %Ret @@ -31,12 +31,12 @@ entry: bb: ret i1 %V -; CHECK: @test2 +; CHECK-LABEL: @test2( ; CHECK: ret i1 true } define i1 @TNAN() { -; CHECK: @TNAN +; CHECK-LABEL: @TNAN( ; CHECK: ret i1 true %A = fcmp uno double 0x7FF8000000000000, 1.000000e+00 %B = fcmp uno double 1.230000e+02, 1.000000e+00 @@ -47,7 +47,7 @@ define i1 @TNAN() { define i128 @vector_to_int_cast() { %A = bitcast <4 x i32> to i128 ret i128 %A -; CHECK: @vector_to_int_cast +; CHECK-LABEL: @vector_to_int_cast( ; CHECK: ret i128 85070591750041656499021422275829170176 } diff --git a/test/Transforms/ConstProp/bitcast.ll b/test/Transforms/ConstProp/bitcast.ll index 53239c7e4fe..5e1581d801c 100644 --- a/test/Transforms/ConstProp/bitcast.ll +++ b/test/Transforms/ConstProp/bitcast.ll @@ -4,7 +4,7 @@ define <1 x i64> @test1() { %A = bitcast i64 63 to <1 x i64> ret <1 x i64> %A -; CHECK: @test1 +; CHECK-LABEL: @test1( ; CHECK: ret <1 x i64> } diff --git a/test/Transforms/ConstProp/calls.ll b/test/Transforms/ConstProp/calls.ll index 7a405a539c5..7541418b06e 100644 --- a/test/Transforms/ConstProp/calls.ll +++ b/test/Transforms/ConstProp/calls.ll @@ -11,7 +11,7 @@ declare double @sqrt(double) declare double @exp2(double) define double @T() { -; CHECK: @T +; CHECK-LABEL: @T( ; CHECK-NOT: call ; CHECK: ret %A = call double @cos(double 0.000000e+00) @@ -29,7 +29,7 @@ define double @T() { } define i1 @test_sse_cvt() nounwind readnone { -; CHECK: @test_sse_cvt +; CHECK-LABEL: @test_sse_cvt( ; CHECK-NOT: call ; CHECK: ret i1 true entry: @@ -63,7 +63,7 @@ declare i64 @llvm.x86.sse2.cvttsd2si64(<2 x double>) nounwind readnone define double @test_intrinsic_pow() nounwind uwtable ssp { entry: -; CHECK: @test_intrinsic_pow +; CHECK-LABEL: @test_intrinsic_pow( ; CHECK-NOT: call %0 = call double @llvm.pow.f64(double 1.500000e+00, double 3.000000e+00) ret double %0 @@ -72,7 +72,7 @@ declare double @llvm.pow.f64(double, double) nounwind readonly ; Shouldn't fold because of -fno-builtin define double @sin_() nounwind uwtable ssp { -; FNOBUILTIN: @sin_ +; FNOBUILTIN-LABEL: @sin_( ; FNOBUILTIN: %1 = call double @sin(double 3.000000e+00) %1 = call double @sin(double 3.000000e+00) ret double %1 @@ -80,7 +80,7 @@ define double @sin_() nounwind uwtable ssp { ; Shouldn't fold because of -fno-builtin define double @sqrt_() nounwind uwtable ssp { -; FNOBUILTIN: @sqrt_ +; FNOBUILTIN-LABEL: @sqrt_( ; FNOBUILTIN: %1 = call double @sqrt(double 3.000000e+00) %1 = call double @sqrt(double 3.000000e+00) ret double %1 @@ -88,7 +88,7 @@ define double @sqrt_() nounwind uwtable ssp { ; Shouldn't fold because of -fno-builtin define float @sqrtf_() nounwind uwtable ssp { -; FNOBUILTIN: @sqrtf_ +; FNOBUILTIN-LABEL: @sqrtf_( ; FNOBUILTIN: %1 = call float @sqrtf(float 3.000000e+00) %1 = call float @sqrtf(float 3.000000e+00) ret float %1 @@ -97,7 +97,7 @@ declare float @sqrtf(float) ; Shouldn't fold because of -fno-builtin define float @sinf_() nounwind uwtable ssp { -; FNOBUILTIN: @sinf_ +; FNOBUILTIN-LABEL: @sinf_( ; FNOBUILTIN: %1 = call float @sinf(float 3.000000e+00) %1 = call float @sinf(float 3.000000e+00) ret float %1 @@ -106,7 +106,7 @@ declare float @sinf(float) ; Shouldn't fold because of -fno-builtin define double @tan_() nounwind uwtable ssp { -; FNOBUILTIN: @tan_ +; FNOBUILTIN-LABEL: @tan_( ; FNOBUILTIN: %1 = call double @tan(double 3.000000e+00) %1 = call double @tan(double 3.000000e+00) ret double %1 @@ -114,7 +114,7 @@ define double @tan_() nounwind uwtable ssp { ; Shouldn't fold because of -fno-builtin define double @tanh_() nounwind uwtable ssp { -; FNOBUILTIN: @tanh_ +; FNOBUILTIN-LABEL: @tanh_( ; FNOBUILTIN: %1 = call double @tanh(double 3.000000e+00) %1 = call double @tanh(double 3.000000e+00) ret double %1 @@ -123,7 +123,7 @@ declare double @tanh(double) ; Shouldn't fold because of -fno-builtin define double @pow_() nounwind uwtable ssp { -; FNOBUILTIN: @pow_ +; FNOBUILTIN-LABEL: @pow_( ; FNOBUILTIN: %1 = call double @pow(double 3.000000e+00, double 3.000000e+00) %1 = call double @pow(double 3.000000e+00, double 3.000000e+00) ret double %1 @@ -132,7 +132,7 @@ declare double @pow(double, double) ; Shouldn't fold because of -fno-builtin define double @fmod_() nounwind uwtable ssp { -; FNOBUILTIN: @fmod_ +; FNOBUILTIN-LABEL: @fmod_( ; FNOBUILTIN: %1 = call double @fmod(double 3.000000e+00, double 3.000000e+00) %1 = call double @fmod(double 3.000000e+00, double 3.000000e+00) ret double %1 @@ -141,7 +141,7 @@ declare double @fmod(double, double) ; Shouldn't fold because of -fno-builtin define double @atan2_() nounwind uwtable ssp { -; FNOBUILTIN: @atan2_ +; FNOBUILTIN-LABEL: @atan2_( ; FNOBUILTIN: %1 = call double @atan2(double 3.000000e+00, double 3.000000e+00) %1 = call double @atan2(double 3.000000e+00, double 3.000000e+00) ret double %1 diff --git a/test/Transforms/ConstProp/extractvalue.ll b/test/Transforms/ConstProp/extractvalue.ll index f947b22f23a..72d6cb714a5 100644 --- a/test/Transforms/ConstProp/extractvalue.ll +++ b/test/Transforms/ConstProp/extractvalue.ll @@ -5,21 +5,21 @@ define i32 @test1() { %A = extractvalue %struct { i32 2, [4 x i8] c"foo\00" }, 0 ret i32 %A -; CHECK: @test1 +; CHECK-LABEL: @test1( ; CHECK: ret i32 2 } define i8 @test2() { %A = extractvalue %struct { i32 2, [4 x i8] c"foo\00" }, 1, 2 ret i8 %A -; CHECK: @test2 +; CHECK-LABEL: @test2( ; CHECK: ret i8 111 } define i32 @test3() { %A = extractvalue [3 x %struct] [ %struct { i32 0, [4 x i8] c"aaaa" }, %struct { i32 1, [4 x i8] c"bbbb" }, %struct { i32 2, [4 x i8] c"cccc" } ], 1, 0 ret i32 %A -; CHECK: @test3 +; CHECK-LABEL: @test3( ; CHECK: ret i32 1 } diff --git a/test/Transforms/ConstProp/insertvalue.ll b/test/Transforms/ConstProp/insertvalue.ll index a4b7bb1019c..0d288b3841d 100644 --- a/test/Transforms/ConstProp/insertvalue.ll +++ b/test/Transforms/ConstProp/insertvalue.ll @@ -5,21 +5,21 @@ define %struct @test1() { %A = insertvalue %struct { i32 2, [4 x i8] c"foo\00" }, i32 1, 0 ret %struct %A -; CHECK: @test1 +; CHECK-LABEL: @test1( ; CHECK: ret %struct { i32 1, [4 x i8] c"foo\00" } } define %struct @test2() { %A = insertvalue %struct { i32 2, [4 x i8] c"foo\00" }, i8 1, 1, 2 ret %struct %A -; CHECK: @test2 +; CHECK-LABEL: @test2( ; CHECK: ret %struct { i32 2, [4 x i8] c"fo\01\00" } } define [3 x %struct] @test3() { %A = insertvalue [3 x %struct] [ %struct { i32 0, [4 x i8] c"aaaa" }, %struct { i32 1, [4 x i8] c"bbbb" }, %struct { i32 2, [4 x i8] c"cccc" } ], i32 -1, 1, 0 ret [3 x %struct] %A -; CHECK: @test3 +; CHECK-LABEL: @test3( ; CHECK:ret [3 x %struct] [%struct { i32 0, [4 x i8] c"aaaa" }, %struct { i32 -1, [4 x i8] c"bbbb" }, %struct { i32 2, [4 x i8] c"cccc" }] } diff --git a/test/Transforms/ConstProp/loads.ll b/test/Transforms/ConstProp/loads.ll index 6794288a0ef..795dc07111f 100644 --- a/test/Transforms/ConstProp/loads.ll +++ b/test/Transforms/ConstProp/loads.ll @@ -13,11 +13,11 @@ define i32 @test1() { ret i32 %r ; 0xDEADBEEF -; LE: @test1 +; LE-LABEL: @test1( ; LE: ret i32 -559038737 ; 0xDEADBEEF -; BE: @test1 +; BE-LABEL: @test1( ; BE: ret i32 -559038737 } @@ -28,11 +28,11 @@ define i16 @test2() { ret i16 %r ; 0xBEEF -; LE: @test2 +; LE-LABEL: @test2( ; LE: ret i16 -16657 ; 0xDEAD -; BE: @test2 +; BE-LABEL: @test2( ; BE: ret i16 -8531 } @@ -42,11 +42,11 @@ define i16 @test3() { ret i16 %r ; 0xDEAD -; LE: @test3 +; LE-LABEL: @test3( ; LE: ret i16 -8531 ; 0xBEEF -; BE: @test3 +; BE-LABEL: @test3( ; BE: ret i16 -16657 } @@ -56,11 +56,11 @@ define i16 @test4() { ret i16 %r ; 0x00BA -; LE: @test4 +; LE-LABEL: @test4( ; LE: ret i16 186 ; 0xBA00 -; BE: @test4 +; BE-LABEL: @test4( ; BE: ret i16 -17920 } @@ -70,11 +70,11 @@ define i64 @test6() { ret i64 %r ; 0x3FF_0000000000000 -; LE: @test6 +; LE-LABEL: @test6( ; LE: ret i64 4607182418800017408 ; 0x3FF_0000000000000 -; BE: @test6 +; BE-LABEL: @test6( ; BE: ret i64 4607182418800017408 } @@ -84,11 +84,11 @@ define i16 @test7() { ret i16 %r ; 0x0000 -; LE: @test7 +; LE-LABEL: @test7( ; LE: ret i16 0 ; 0x3FF0 -; BE: @test7 +; BE-LABEL: @test7( ; BE: ret i16 16368 } @@ -97,10 +97,10 @@ define double @test8() { %r = load double* bitcast({{i32,i8},i32}* @g1 to double*) ret double %r -; LE: @test8 +; LE-LABEL: @test8( ; LE: ret double 0xBADEADBEEF -; BE: @test8 +; BE-LABEL: @test8( ; BE: ret double 0xDEADBEEFBA000000 } @@ -111,11 +111,11 @@ define i128 @test9() { ret i128 %r ; 0x00000000_06B1BFF8_00000000_0000007B -; LE: @test9 +; LE-LABEL: @test9( ; LE: ret i128 2071796475790618158476296315 ; 0x00000000_0000007B_00000000_06B1BFF8 -; BE: @test9 +; BE-LABEL: @test9( ; BE: ret i128 2268949521066387161080 } @@ -124,10 +124,10 @@ define <2 x i64> @test10() { %r = load <2 x i64>* bitcast({i64, i64}* @g3 to <2 x i64>*) ret <2 x i64> %r -; LE: @test10 +; LE-LABEL: @test10( ; LE: ret <2 x i64> -; BE: @test10 +; BE-LABEL: @test10( ; BE: ret <2 x i64> } @@ -142,11 +142,11 @@ entry: ret i16 %a ; 0x08A1 -; LE: @test11 +; LE-LABEL: @test11( ; LE: ret i16 2209 ; 0xA108 -; BE: @test11 +; BE-LABEL: @test11( ; BE: ret i16 -24312 } @@ -159,11 +159,11 @@ define i16 @test12() { ret i16 %a ; 0x0062 -; LE: @test12 +; LE-LABEL: @test12( ; LE: ret i16 98 ; 0x6200 -; BE: @test12 +; BE-LABEL: @test12( ; BE: ret i16 25088 } @@ -174,10 +174,10 @@ define i1 @test13() { %A = load i1* bitcast (i8* @g5 to i1*) ret i1 %A -; LE: @test13 +; LE-LABEL: @test13( ; LE: ret i1 false -; BE: @test13 +; BE-LABEL: @test13( ; BE: ret i1 false } @@ -187,10 +187,10 @@ entry: %tmp = load i64* bitcast ([2 x i8*]* @g6 to i64*) ret i64 %tmp -; LE: @test14 +; LE-LABEL: @test14( ; LE: ret i64 1 -; BE: @test14 +; BE-LABEL: @test14( ; BE: ret i64 1 } @@ -199,9 +199,9 @@ entry: %tmp = load i64* bitcast (i8** getelementptr inbounds ([2 x i8*]* @g6, i32 0, i64 1) to i64*) ret i64 %tmp -; LE: @test15 +; LE-LABEL: @test15( ; LE: ret i64 2 -; BE: @test15 +; BE-LABEL: @test15( ; BE: ret i64 2 } diff --git a/test/Transforms/ConstProp/overflow-ops.ll b/test/Transforms/ConstProp/overflow-ops.ll index 849bf9ef75b..1ae3e562e7e 100644 --- a/test/Transforms/ConstProp/overflow-ops.ll +++ b/test/Transforms/ConstProp/overflow-ops.ll @@ -18,7 +18,7 @@ entry: %t = call {i8, i1} @llvm.uadd.with.overflow.i8(i8 42, i8 100) ret {i8, i1} %t -; CHECK: @uadd_1 +; CHECK-LABEL: @uadd_1( ; CHECK: ret { i8, i1 } { i8 -114, i1 false } } @@ -27,7 +27,7 @@ entry: %t = call {i8, i1} @llvm.uadd.with.overflow.i8(i8 142, i8 120) ret {i8, i1} %t -; CHECK: @uadd_2 +; CHECK-LABEL: @uadd_2( ; CHECK: ret { i8, i1 } { i8 6, i1 true } } @@ -40,7 +40,7 @@ entry: %t = call {i8, i1} @llvm.usub.with.overflow.i8(i8 4, i8 2) ret {i8, i1} %t -; CHECK: @usub_1 +; CHECK-LABEL: @usub_1( ; CHECK: ret { i8, i1 } { i8 2, i1 false } } @@ -49,7 +49,7 @@ entry: %t = call {i8, i1} @llvm.usub.with.overflow.i8(i8 4, i8 6) ret {i8, i1} %t -; CHECK: @usub_2 +; CHECK-LABEL: @usub_2( ; CHECK: ret { i8, i1 } { i8 -2, i1 true } } @@ -62,7 +62,7 @@ entry: %t = call {i8, i1} @llvm.umul.with.overflow.i8(i8 100, i8 3) ret {i8, i1} %t -; CHECK: @umul_1 +; CHECK-LABEL: @umul_1( ; CHECK: ret { i8, i1 } { i8 44, i1 true } } @@ -71,7 +71,7 @@ entry: %t = call {i8, i1} @llvm.umul.with.overflow.i8(i8 100, i8 2) ret {i8, i1} %t -; CHECK: @umul_2 +; CHECK-LABEL: @umul_2( ; CHECK: ret { i8, i1 } { i8 -56, i1 false } } @@ -84,7 +84,7 @@ entry: %t = call {i8, i1} @llvm.sadd.with.overflow.i8(i8 42, i8 2) ret {i8, i1} %t -; CHECK: @sadd_1 +; CHECK-LABEL: @sadd_1( ; CHECK: ret { i8, i1 } { i8 44, i1 false } } @@ -93,7 +93,7 @@ entry: %t = call {i8, i1} @llvm.sadd.with.overflow.i8(i8 120, i8 10) ret {i8, i1} %t -; CHECK: @sadd_2 +; CHECK-LABEL: @sadd_2( ; CHECK: ret { i8, i1 } { i8 -126, i1 true } } @@ -102,7 +102,7 @@ entry: %t = call {i8, i1} @llvm.sadd.with.overflow.i8(i8 -120, i8 10) ret {i8, i1} %t -; CHECK: @sadd_3 +; CHECK-LABEL: @sadd_3( ; CHECK: ret { i8, i1 } { i8 -110, i1 false } } @@ -111,7 +111,7 @@ entry: %t = call {i8, i1} @llvm.sadd.with.overflow.i8(i8 -120, i8 -10) ret {i8, i1} %t -; CHECK: @sadd_4 +; CHECK-LABEL: @sadd_4( ; CHECK: ret { i8, i1 } { i8 126, i1 true } } @@ -120,7 +120,7 @@ entry: %t = call {i8, i1} @llvm.sadd.with.overflow.i8(i8 2, i8 -10) ret {i8, i1} %t -; CHECK: @sadd_5 +; CHECK-LABEL: @sadd_5( ; CHECK: ret { i8, i1 } { i8 -8, i1 false } } @@ -134,7 +134,7 @@ entry: %t = call {i8, i1} @llvm.ssub.with.overflow.i8(i8 4, i8 2) ret {i8, i1} %t -; CHECK: @ssub_1 +; CHECK-LABEL: @ssub_1( ; CHECK: ret { i8, i1 } { i8 2, i1 false } } @@ -143,7 +143,7 @@ entry: %t = call {i8, i1} @llvm.ssub.with.overflow.i8(i8 4, i8 6) ret {i8, i1} %t -; CHECK: @ssub_2 +; CHECK-LABEL: @ssub_2( ; CHECK: ret { i8, i1 } { i8 -2, i1 false } } @@ -152,7 +152,7 @@ entry: %t = call {i8, i1} @llvm.ssub.with.overflow.i8(i8 -10, i8 120) ret {i8, i1} %t -; CHECK: @ssub_3 +; CHECK-LABEL: @ssub_3( ; CHECK: ret { i8, i1 } { i8 126, i1 true } } @@ -161,7 +161,7 @@ entry: %t = call {i8, i1} @llvm.ssub.with.overflow.i8(i8 -10, i8 10) ret {i8, i1} %t -; CHECK: @ssub_3b +; CHECK-LABEL: @ssub_3b( ; CHECK: ret { i8, i1 } { i8 -20, i1 false } } @@ -170,7 +170,7 @@ entry: %t = call {i8, i1} @llvm.ssub.with.overflow.i8(i8 120, i8 -10) ret {i8, i1} %t -; CHECK: @ssub_4 +; CHECK-LABEL: @ssub_4( ; CHECK: ret { i8, i1 } { i8 -126, i1 true } } @@ -179,7 +179,7 @@ entry: %t = call {i8, i1} @llvm.ssub.with.overflow.i8(i8 20, i8 -10) ret {i8, i1} %t -; CHECK: @ssub_4b +; CHECK-LABEL: @ssub_4b( ; CHECK: ret { i8, i1 } { i8 30, i1 false } } @@ -188,7 +188,7 @@ entry: %t = call {i8, i1} @llvm.ssub.with.overflow.i8(i8 -20, i8 -10) ret {i8, i1} %t -; CHECK: @ssub_5 +; CHECK-LABEL: @ssub_5( ; CHECK: ret { i8, i1 } { i8 -10, i1 false } } @@ -202,6 +202,6 @@ entry: %t = call {i8, i1} @llvm.smul.with.overflow.i8(i8 -20, i8 -10) ret {i8, i1} %t -; CHECK: @smul_1 +; CHECK-LABEL: @smul_1( ; CHECK: ret { i8, i1 } { i8 -56, i1 true } } diff --git a/test/Transforms/CorrelatedValuePropagation/2010-09-02-Trunc.ll b/test/Transforms/CorrelatedValuePropagation/2010-09-02-Trunc.ll index a8efa38fdd0..0754f868d24 100644 --- a/test/Transforms/CorrelatedValuePropagation/2010-09-02-Trunc.ll +++ b/test/Transforms/CorrelatedValuePropagation/2010-09-02-Trunc.ll @@ -1,6 +1,6 @@ ; RUN: opt -S < %s -correlated-propagation | FileCheck %s -; CHECK: @test +; CHECK-LABEL: @test( define i16 @test(i32 %a, i1 %b) { entry: %c = icmp eq i32 %a, 0 diff --git a/test/Transforms/CorrelatedValuePropagation/basic.ll b/test/Transforms/CorrelatedValuePropagation/basic.ll index 39c437ccfae..9a2264793c5 100644 --- a/test/Transforms/CorrelatedValuePropagation/basic.ll +++ b/test/Transforms/CorrelatedValuePropagation/basic.ll @@ -1,7 +1,7 @@ ; RUN: opt < %s -correlated-propagation -S | FileCheck %s ; PR2581 -; CHECK: @test1 +; CHECK-LABEL: @test1( define i32 @test1(i1 %C) nounwind { br i1 %C, label %exit, label %body @@ -18,7 +18,7 @@ exit: ; preds = %0 ; PR4420 declare i1 @ext() -; CHECK: @test2 +; CHECK-LABEL: @test2( define i1 @test2() { entry: %cond = tail call i1 @ext() ; [#uses=2] @@ -42,7 +42,7 @@ bb3: ; preds = %bb1 ; PR4855 @gv = internal constant i8 7 -; CHECK: @test3 +; CHECK-LABEL: @test3( define i8 @test3(i8* %a) nounwind { entry: %cond = icmp eq i8* %a, @gv @@ -58,7 +58,7 @@ bb2: ; preds = %entry } ; PR1757 -; CHECK: @test4 +; CHECK-LABEL: @test4( define i32 @test4(i32) { EntryBlock: ; CHECK: icmp sgt i32 %0, 2 @@ -83,7 +83,7 @@ LessThanOrEqualToTwo: declare i32* @f(i32*) define void @test5(i32* %x, i32* %y) { -; CHECK: @test5 +; CHECK-LABEL: @test5( entry: %pre = icmp eq i32* %x, null br i1 %pre, label %return, label %loop @@ -102,7 +102,7 @@ return: } define i32 @switch1(i32 %s) { -; CHECK: @switch1 +; CHECK-LABEL: @switch1( entry: %cmp = icmp slt i32 %s, 0 br i1 %cmp, label %negative, label %out @@ -134,7 +134,7 @@ next: } define i32 @switch2(i32 %s) { -; CHECK: @switch2 +; CHECK-LABEL: @switch2( entry: %cmp = icmp sgt i32 %s, 0 br i1 %cmp, label %positive, label %out @@ -157,7 +157,7 @@ next: } define i32 @switch3(i32 %s) { -; CHECK: @switch3 +; CHECK-LABEL: @switch3( entry: %cmp = icmp sgt i32 %s, 0 br i1 %cmp, label %positive, label %out @@ -180,7 +180,7 @@ next: } define void @switch4(i32 %s) { -; CHECK: @switch4 +; CHECK-LABEL: @switch4( entry: %cmp = icmp eq i32 %s, 0 br i1 %cmp, label %zero, label %out diff --git a/test/Transforms/CorrelatedValuePropagation/range.ll b/test/Transforms/CorrelatedValuePropagation/range.ll index 6750546ba18..e40c6391907 100644 --- a/test/Transforms/CorrelatedValuePropagation/range.ll +++ b/test/Transforms/CorrelatedValuePropagation/range.ll @@ -17,7 +17,7 @@ else: end: ret i32 2 -; CHECK: @test1 +; CHECK-LABEL: @test1( ; CHECK: then: ; CHECK-NEXT: br i1 false, label %end, label %else } @@ -37,12 +37,12 @@ else: end: ret i32 2 -; CHECK: @test2 +; CHECK-LABEL: @test2( ; CHECK: then: ; CHECK-NEXT: br i1 false, label %end, label %else } -; CHECK: @test3 +; CHECK-LABEL: @test3( define i32 @test3(i32 %c) nounwind { %cmp = icmp slt i32 %c, 2 br i1 %cmp, label %if.then, label %if.end @@ -71,7 +71,7 @@ if.end8: ret i32 4 } -; CHECK: @test4 +; CHECK-LABEL: @test4( define i32 @test4(i32 %c) nounwind { switch i32 %c, label %sw.default [ i32 1, label %sw.bb @@ -99,7 +99,7 @@ return: ret i32 %retval.0 } -; CHECK: @test5 +; CHECK-LABEL: @test5( define i1 @test5(i32 %c) nounwind { %cmp = icmp slt i32 %c, 5 br i1 %cmp, label %if.then, label %if.end @@ -121,7 +121,7 @@ if.end8: ret i1 %cmp2 } -; CHECK: @test6 +; CHECK-LABEL: @test6( define i1 @test6(i32 %c) nounwind { %cmp = icmp ule i32 %c, 7 br i1 %cmp, label %if.then, label %if.end @@ -143,7 +143,7 @@ sw.bb: ret i1 %cmp2 } -; CHECK: @test7 +; CHECK-LABEL: @test7( define i1 @test7(i32 %c) nounwind { entry: switch i32 %c, label %sw.default [ diff --git a/test/Transforms/DeadArgElim/deadexternal.ll b/test/Transforms/DeadArgElim/deadexternal.ll index cca58721e53..acbcf75ee49 100644 --- a/test/Transforms/DeadArgElim/deadexternal.ll +++ b/test/Transforms/DeadArgElim/deadexternal.ll @@ -7,7 +7,7 @@ define void @test(i32) { define void @foo() { call void @test(i32 0) ret void -; CHECK: @foo +; CHECK-LABEL: @foo( ; CHECK: i32 undef } diff --git a/test/Transforms/DeadStoreElimination/2011-09-06-EndOfFunction.ll b/test/Transforms/DeadStoreElimination/2011-09-06-EndOfFunction.ll index d114e513ed2..95253f6570b 100644 --- a/test/Transforms/DeadStoreElimination/2011-09-06-EndOfFunction.ll +++ b/test/Transforms/DeadStoreElimination/2011-09-06-EndOfFunction.ll @@ -5,7 +5,7 @@ target triple = "x86_64-apple-darwin" %"class.std::auto_ptr" = type { i32* } -; CHECK: @_Z3foov +; CHECK-LABEL: @_Z3foov( define void @_Z3foov(%"class.std::auto_ptr"* noalias nocapture sret %agg.result) uwtable ssp { _ZNSt8auto_ptrIiED1Ev.exit: %temp.lvalue = alloca %"class.std::auto_ptr", align 8 diff --git a/test/Transforms/DeadStoreElimination/OverwriteStoreEnd.ll b/test/Transforms/DeadStoreElimination/OverwriteStoreEnd.ll index ed53eb524c2..968d608c67e 100644 --- a/test/Transforms/DeadStoreElimination/OverwriteStoreEnd.ll +++ b/test/Transforms/DeadStoreElimination/OverwriteStoreEnd.ll @@ -8,7 +8,7 @@ target datalayout = "e-p:64:64:64-i1:8:8-i8:8:8-i16:16:16-i32:32:32-i64:64:64-f3 @glob2 = global %struct.vec2plusi zeroinitializer, align 16 define void @write24to28(i32* nocapture %p) nounwind uwtable ssp { -; CHECK: @write24to28 +; CHECK-LABEL: @write24to28( entry: %arrayidx0 = getelementptr inbounds i32* %p, i64 1 %p3 = bitcast i32* %arrayidx0 to i8* @@ -20,7 +20,7 @@ entry: } define void @write28to32(i32* nocapture %p) nounwind uwtable ssp { -; CHECK: @write28to32 +; CHECK-LABEL: @write28to32( entry: %p3 = bitcast i32* %p to i8* ; CHECK: call void @llvm.memset.p0i8.i64(i8* %p3, i8 0, i64 28, i32 4, i1 false) @@ -31,7 +31,7 @@ entry: } define void @dontwrite28to32memset(i32* nocapture %p) nounwind uwtable ssp { -; CHECK: @dontwrite28to32memset +; CHECK-LABEL: @dontwrite28to32memset( entry: %p3 = bitcast i32* %p to i8* ; CHECK: call void @llvm.memset.p0i8.i64(i8* %p3, i8 0, i64 32, i32 16, i1 false) @@ -42,7 +42,7 @@ entry: } define void @write32to36(%struct.vec2plusi* nocapture %p) nounwind uwtable ssp { -; CHECK: @write32to36 +; CHECK-LABEL: @write32to36( entry: %0 = bitcast %struct.vec2plusi* %p to i8* ; CHECK: tail call void @llvm.memcpy.p0i8.p0i8.i64(i8* %0, i8* bitcast (%struct.vec2plusi* @glob2 to i8*), i64 32, i32 16, i1 false) @@ -53,7 +53,7 @@ entry: } define void @write16to32(%struct.vec2* nocapture %p) nounwind uwtable ssp { -; CHECK: @write16to32 +; CHECK-LABEL: @write16to32( entry: %0 = bitcast %struct.vec2* %p to i8* ; CHECK: tail call void @llvm.memcpy.p0i8.p0i8.i64(i8* %0, i8* bitcast (%struct.vec2* @glob1 to i8*), i64 16, i32 16, i1 false) @@ -64,7 +64,7 @@ entry: } define void @dontwrite28to32memcpy(%struct.vec2* nocapture %p) nounwind uwtable ssp { -; CHECK: @dontwrite28to32memcpy +; CHECK-LABEL: @dontwrite28to32memcpy( entry: %0 = bitcast %struct.vec2* %p to i8* ; CHECK: tail call void @llvm.memcpy.p0i8.p0i8.i64(i8* %0, i8* bitcast (%struct.vec2* @glob1 to i8*), i64 32, i32 16, i1 false) @@ -80,7 +80,7 @@ declare void @llvm.memset.p0i8.i64(i8* nocapture, i8, i64, i32, i1) nounwind %struct.trapframe = type { i64, i64, i64 } ; bugzilla 11455 - make sure negative GEP's don't break this optimisation -; CHECK: @cpu_lwp_fork +; CHECK-LABEL: @cpu_lwp_fork( define void @cpu_lwp_fork(%struct.trapframe* %md_regs, i64 %pcb_rsp0) nounwind uwtable noinline ssp { entry: %0 = inttoptr i64 %pcb_rsp0 to %struct.trapframe* diff --git a/test/Transforms/DeadStoreElimination/PartialStore.ll b/test/Transforms/DeadStoreElimination/PartialStore.ll index 7ac1e0844ed..4799ef3383b 100644 --- a/test/Transforms/DeadStoreElimination/PartialStore.ll +++ b/test/Transforms/DeadStoreElimination/PartialStore.ll @@ -8,13 +8,13 @@ define void @test1(i32 *%V) { store i8 0, i8* %V2 store i32 1234567, i32* %V ret void -; CHECK: @test1 +; CHECK-LABEL: @test1( ; CHECK-NEXT: store i32 1234567 } ; Note that we could do better by merging the two stores into one. define void @test2(i32* %P) { -; CHECK: @test2 +; CHECK-LABEL: @test2( store i32 0, i32* %P ; CHECK: store i32 %Q = bitcast i32* %P to i16* @@ -25,7 +25,7 @@ define void @test2(i32* %P) { define i32 @test3(double %__x) { -; CHECK: @test3 +; CHECK-LABEL: @test3( ; CHECK: store double %__u = alloca { [3 x i32] } %tmp.1 = bitcast { [3 x i32] }* %__u to double* @@ -39,7 +39,7 @@ define i32 @test3(double %__x) { ; PR6043 define void @test4(i8* %P) { -; CHECK: @test4 +; CHECK-LABEL: @test4( ; CHECK-NEXT: bitcast ; CHECK-NEXT: store double @@ -64,7 +64,7 @@ define void @test5(i32 %i) nounwind ssp { call void @test5a(i32* %A) ret void -; CHECK: @test5( +; CHECK-LABEL: @test5( ; CHECK-NEXT: alloca ; CHECK-NEXT: store i32 20 ; CHECK-NEXT: call void @test5a diff --git a/test/Transforms/DeadStoreElimination/free.ll b/test/Transforms/DeadStoreElimination/free.ll index a5fbdc76387..1d273d67a50 100644 --- a/test/Transforms/DeadStoreElimination/free.ll +++ b/test/Transforms/DeadStoreElimination/free.ll @@ -5,7 +5,7 @@ target datalayout = "e-p:64:64:64" declare void @free(i8* nocapture) declare noalias i8* @malloc(i64) -; CHECK: @test +; CHECK-LABEL: @test( ; CHECK-NEXT: bitcast ; CHECK-NEXT: @free ; CHECK-NEXT: ret void @@ -17,7 +17,7 @@ define void @test(i32* %Q, i32* %P) { ret void } -; CHECK: @test2 +; CHECK-LABEL: @test2( ; CHECK-NEXT: bitcast ; CHECK-NEXT: @free ; CHECK-NEXT: ret void @@ -29,7 +29,7 @@ define void @test2({i32, i32}* %P) { ret void } -; CHECK: @test3 +; CHECK-LABEL: @test3( ; CHECK-NOT: store ; CHECK: ret void define void @test3() { @@ -42,7 +42,7 @@ define void @test3() { } ; PR11240 -; CHECK: @test4 +; CHECK-LABEL: @test4( ; CHECK-NOT: store ; CHECK: ret void define void @test4(i1 %x) nounwind { @@ -59,7 +59,7 @@ skipinit1: ret void } -; CHECK: @test5 +; CHECK-LABEL: @test5( define void @test5() { br label %bb diff --git a/test/Transforms/DeadStoreElimination/libcalls.ll b/test/Transforms/DeadStoreElimination/libcalls.ll index 4639c0bc962..65396945bf6 100644 --- a/test/Transforms/DeadStoreElimination/libcalls.ll +++ b/test/Transforms/DeadStoreElimination/libcalls.ll @@ -2,7 +2,7 @@ declare i8* @strcpy(i8* %dest, i8* %src) nounwind define void @test1(i8* %src) { -; CHECK: @test1 +; CHECK-LABEL: @test1( %B = alloca [16 x i8] %dest = getelementptr inbounds [16 x i8]* %B, i64 0, i64 0 ; CHECK-NOT: @strcpy @@ -13,7 +13,7 @@ define void @test1(i8* %src) { declare i8* @strncpy(i8* %dest, i8* %src, i32 %n) nounwind define void @test2(i8* %src) { -; CHECK: @test2 +; CHECK-LABEL: @test2( %B = alloca [16 x i8] %dest = getelementptr inbounds [16 x i8]* %B, i64 0, i64 0 ; CHECK-NOT: @strncpy @@ -24,7 +24,7 @@ define void @test2(i8* %src) { declare i8* @strcat(i8* %dest, i8* %src) nounwind define void @test3(i8* %src) { -; CHECK: @test3 +; CHECK-LABEL: @test3( %B = alloca [16 x i8] %dest = getelementptr inbounds [16 x i8]* %B, i64 0, i64 0 ; CHECK-NOT: @strcat @@ -35,7 +35,7 @@ define void @test3(i8* %src) { declare i8* @strncat(i8* %dest, i8* %src, i32 %n) nounwind define void @test4(i8* %src) { -; CHECK: @test4 +; CHECK-LABEL: @test4( %B = alloca [16 x i8] %dest = getelementptr inbounds [16 x i8]* %B, i64 0, i64 0 ; CHECK-NOT: @strncat @@ -45,7 +45,7 @@ define void @test4(i8* %src) { } define void @test5(i8* nocapture %src) { -; CHECK: @test5 +; CHECK-LABEL: @test5( %dest = alloca [100 x i8], align 16 %arraydecay = getelementptr inbounds [100 x i8]* %dest, i64 0, i64 0 %call = call i8* @strcpy(i8* %arraydecay, i8* %src) @@ -57,7 +57,7 @@ define void @test5(i8* nocapture %src) { declare void @user(i8* %p) define void @test6(i8* %src) { -; CHECK: @test6 +; CHECK-LABEL: @test6( %B = alloca [16 x i8] %dest = getelementptr inbounds [16 x i8]* %B, i64 0, i64 0 ; CHECK: @strcpy diff --git a/test/Transforms/DeadStoreElimination/lifetime.ll b/test/Transforms/DeadStoreElimination/lifetime.ll index 678565315e3..7fe7fbfa747 100644 --- a/test/Transforms/DeadStoreElimination/lifetime.ll +++ b/test/Transforms/DeadStoreElimination/lifetime.ll @@ -7,7 +7,7 @@ declare void @llvm.lifetime.end(i64, i8* nocapture) nounwind declare void @llvm.memset.p0i8.i8(i8* nocapture, i8, i8, i32, i1) nounwind define void @test1() { -; CHECK: @test1 +; CHECK-LABEL: @test1( %A = alloca i8 store i8 0, i8* %A ;; Written to by memset diff --git a/test/Transforms/DeadStoreElimination/memintrinsics.ll b/test/Transforms/DeadStoreElimination/memintrinsics.ll index d5c5365771d..5bbb8e099c4 100644 --- a/test/Transforms/DeadStoreElimination/memintrinsics.ll +++ b/test/Transforms/DeadStoreElimination/memintrinsics.ll @@ -5,7 +5,7 @@ declare void @llvm.memmove.p0i8.p0i8.i8(i8* nocapture, i8* nocapture, i8, i32, i declare void @llvm.memset.p0i8.i8(i8* nocapture, i8, i8, i32, i1) nounwind define void @test1() { -; CHECK: @test1 +; CHECK-LABEL: @test1( %A = alloca i8 %B = alloca i8 @@ -19,7 +19,7 @@ define void @test1() { } define void @test2() { -; CHECK: @test2 +; CHECK-LABEL: @test2( %A = alloca i8 %B = alloca i8 @@ -33,7 +33,7 @@ define void @test2() { } define void @test3() { -; CHECK: @test3 +; CHECK-LABEL: @test3( %A = alloca i8 %B = alloca i8 diff --git a/test/Transforms/DeadStoreElimination/simple.ll b/test/Transforms/DeadStoreElimination/simple.ll index e0eb90af943..ec98466d33b 100644 --- a/test/Transforms/DeadStoreElimination/simple.ll +++ b/test/Transforms/DeadStoreElimination/simple.ll @@ -10,7 +10,7 @@ define void @test1(i32* %Q, i32* %P) { store i32 %DEAD, i32* %P store i32 0, i32* %P ret void -; CHECK: @test1 +; CHECK-LABEL: @test1( ; CHECK-NEXT: store i32 0, i32* %P ; CHECK-NEXT: ret void } @@ -21,7 +21,7 @@ define void @test2(i32 *%p, i32 *%q) { store i32 20, i32* %q, align 4 store i32 30, i32* %p, align 4 ret void -; CHECK: @test2 +; CHECK-LABEL: @test2( ; CHECK-NEXT: store i32 20 } @@ -30,7 +30,7 @@ define void @test2(i32 *%p, i32 *%q) { @g = global i32 1 define i32 @test3(i32* %g_addr) nounwind { -; CHECK: @test3 +; CHECK-LABEL: @test3( ; CHECK: load i32* %g_addr %g_value = load i32* %g_addr, align 4 store i32 -1, i32* @g, align 4 @@ -44,7 +44,7 @@ define void @test4(i32* %Q) { %a = load i32* %Q store volatile i32 %a, i32* %Q ret void -; CHECK: @test4 +; CHECK-LABEL: @test4( ; CHECK-NEXT: load i32 ; CHECK-NEXT: store volatile ; CHECK-NEXT: ret void @@ -54,7 +54,7 @@ define void @test5(i32* %Q) { %a = load volatile i32* %Q store i32 %a, i32* %Q ret void -; CHECK: @test5 +; CHECK-LABEL: @test5( ; CHECK-NEXT: load volatile ; CHECK-NEXT: ret void } @@ -66,7 +66,7 @@ define void @test6(i32 *%p, i8 *%q) { call void @llvm.memset.p0i8.i64(i8* %q, i8 42, i64 900, i32 1, i1 false) store i32 30, i32* %p, align 4 ret void -; CHECK: @test6 +; CHECK-LABEL: @test6( ; CHECK-NEXT: call void @llvm.memset } @@ -77,7 +77,7 @@ define void @test7(i32 *%p, i8 *%q, i8* noalias %r) { call void @llvm.memcpy.p0i8.p0i8.i64(i8* %q, i8* %r, i64 900, i32 1, i1 false) store i32 30, i32* %p, align 4 ret void -; CHECK: @test7 +; CHECK-LABEL: @test7( ; CHECK-NEXT: call void @llvm.memcpy } @@ -90,7 +90,7 @@ define i32 @test8() { %X = load i32* %V ret i32 %X -; CHECK: @test8 +; CHECK-LABEL: @test8( ; CHECK: store i32 1234567 } @@ -101,7 +101,7 @@ define void @test9(%struct.x* byval %a) nounwind { %tmp2 = getelementptr %struct.x* %a, i32 0, i32 0 store i32 1, i32* %tmp2, align 4 ret void -; CHECK: @test9 +; CHECK-LABEL: @test9( ; CHECK-NEXT: ret void } @@ -111,7 +111,7 @@ define double @test10(i8* %X) { store i8* %X, i8** %X_addr %tmp.0 = va_arg i8** %X_addr, double ret double %tmp.0 -; CHECK: @test10 +; CHECK-LABEL: @test10( ; CHECK: store } @@ -119,7 +119,7 @@ define double @test10(i8* %X) { ; DSE should delete the dead trampoline. declare void @test11f() define void @test11() { -; CHECK: @test11 +; CHECK-LABEL: @test11( %storage = alloca [10 x i8], align 16 ; <[10 x i8]*> [#uses=1] ; CHECK-NOT: alloca %cast = getelementptr [10 x i8]* %storage, i32 0, i32 0 ; [#uses=1] @@ -140,7 +140,7 @@ define void @test12({ i32, i32 }* %x) nounwind { store i32 %tmp5, i32* %tmp4, align 4 store i32 %tmp17, i32* %tmp7, align 4 ret void -; CHECK: @test12 +; CHECK-LABEL: @test12( ; CHECK-NOT: tmp5 ; CHECK: ret void } @@ -173,7 +173,7 @@ define void @test14(i32* %Q) { store i32 %DEAD, i32* %P ret void -; CHECK: @test14 +; CHECK-LABEL: @test14( ; CHECK-NEXT: ret void } @@ -185,7 +185,7 @@ define void @test15(i8* %P, i8* %Q) nounwind ssp { tail call void @llvm.memcpy.p0i8.p0i8.i64(i8* %P, i8* %Q, i64 12, i32 1, i1 false) tail call void @llvm.memcpy.p0i8.p0i8.i64(i8* %P, i8* %Q, i64 12, i32 1, i1 false) ret void -; CHECK: @test15 +; CHECK-LABEL: @test15( ; CHECK-NEXT: call void @llvm.memcpy ; CHECK-NEXT: ret } @@ -195,7 +195,7 @@ define void @test16(i8* %P, i8* %Q) nounwind ssp { tail call void @llvm.memcpy.p0i8.p0i8.i64(i8* %P, i8* %Q, i64 8, i32 1, i1 false) tail call void @llvm.memcpy.p0i8.p0i8.i64(i8* %P, i8* %Q, i64 12, i32 1, i1 false) ret void -; CHECK: @test16 +; CHECK-LABEL: @test16( ; CHECK-NEXT: call void @llvm.memcpy ; CHECK-NEXT: ret } @@ -205,7 +205,7 @@ define void @test17(i8* %P, i8* noalias %Q) nounwind ssp { tail call void @llvm.memset.p0i8.i64(i8* %P, i8 42, i64 8, i32 1, i1 false) tail call void @llvm.memcpy.p0i8.p0i8.i64(i8* %P, i8* %Q, i64 12, i32 1, i1 false) ret void -; CHECK: @test17 +; CHECK-LABEL: @test17( ; CHECK-NEXT: call void @llvm.memcpy ; CHECK-NEXT: ret } @@ -215,7 +215,7 @@ define void @test17v(i8* %P, i8* %Q) nounwind ssp { tail call void @llvm.memset.p0i8.i64(i8* %P, i8 42, i64 8, i32 1, i1 true) tail call void @llvm.memcpy.p0i8.p0i8.i64(i8* %P, i8* %Q, i64 12, i32 1, i1 false) ret void -; CHECK: @test17v +; CHECK-LABEL: @test17v( ; CHECK-NEXT: call void @llvm.memset ; CHECK-NEXT: call void @llvm.memcpy ; CHECK-NEXT: ret @@ -229,7 +229,7 @@ define void @test18(i8* %P, i8* %Q, i8* %R) nounwind ssp { tail call void @llvm.memcpy.p0i8.p0i8.i64(i8* %P, i8* %Q, i64 12, i32 1, i1 false) tail call void @llvm.memcpy.p0i8.p0i8.i64(i8* %P, i8* %R, i64 12, i32 1, i1 false) ret void -; CHECK: @test18 +; CHECK-LABEL: @test18( ; CHECK-NEXT: call void @llvm.memcpy ; CHECK-NEXT: call void @llvm.memcpy ; CHECK-NEXT: ret @@ -246,7 +246,7 @@ bb: call void @test19f({i32}* byval align 4 %arg5) ret void -; CHECK: @test19( +; CHECK-LABEL: @test19( ; CHECK: store i32 912 ; CHECK: call void @test19f } @@ -256,10 +256,10 @@ define void @test20() { store i8 0, i8* %m ret void } -; CHECK: @test20 +; CHECK-LABEL: @test20( ; CHECK-NEXT: ret void -; CHECK: @test21 +; CHECK-LABEL: @test21( define void @test21() { %m = call i8* @calloc(i32 9, i32 7) store i8 0, i8* %m @@ -267,7 +267,7 @@ define void @test21() { ret void } -; CHECK: @test22( +; CHECK-LABEL: @test22( define void @test22(i1 %i, i32 %k, i32 %m) nounwind { %k.addr = alloca i32 %m.addr = alloca i32 @@ -278,7 +278,7 @@ define void @test22(i1 %i, i32 %k, i32 %m) nounwind { } ; PR13547 -; CHECK: @test23 +; CHECK-LABEL: @test23( ; CHECK: store i8 97 ; CHECK: store i8 0 declare noalias i8* @strdup(i8* nocapture) nounwind @@ -293,7 +293,7 @@ define noalias i8* @test23() nounwind uwtable ssp { } ; Make sure same sized store to later element is deleted -; CHECK: @test24 +; CHECK-LABEL: @test24( ; CHECK-NOT: store i32 0 ; CHECK-NOT: store i32 0 ; CHECK: store i32 %b @@ -312,7 +312,7 @@ define void @test24([2 x i32]* %a, i32 %b, i32 %c) nounwind { } ; Check another case like PR13547 where strdup is not like malloc. -; CHECK: @test25 +; CHECK-LABEL: @test25( ; CHECK: load i8 ; CHECK: store i8 0 ; CHECK: store i8 %tmp diff --git a/test/Transforms/EarlyCSE/basic.ll b/test/Transforms/EarlyCSE/basic.ll index 32c302c9205..80704df9852 100644 --- a/test/Transforms/EarlyCSE/basic.ll +++ b/test/Transforms/EarlyCSE/basic.ll @@ -1,7 +1,7 @@ ; RUN: opt < %s -S -early-cse | FileCheck %s -; CHECK: @test1 +; CHECK-LABEL: @test1( define void @test1(i8 %V, i32 *%P) { %A = bitcast i64 42 to double ;; dead %B = add i32 4, 19 ;; constant folds @@ -33,7 +33,7 @@ define void @test1(i8 %V, i32 *%P) { ;; Simple load value numbering. -; CHECK: @test2 +; CHECK-LABEL: @test2( define i32 @test2(i32 *%P) { %V1 = load i32* %P %V2 = load i32* %P @@ -43,7 +43,7 @@ define i32 @test2(i32 *%P) { } ;; Cross block load value numbering. -; CHECK: @test3 +; CHECK-LABEL: @test3( define i32 @test3(i32 *%P, i1 %Cond) { %V1 = load i32* %P br i1 %Cond, label %T, label %F @@ -59,7 +59,7 @@ F: } ;; Cross block load value numbering stops when stores happen. -; CHECK: @test4 +; CHECK-LABEL: @test4( define i32 @test4(i32 *%P, i1 %Cond) { %V1 = load i32* %P br i1 %Cond, label %T, label %F @@ -79,7 +79,7 @@ F: declare i32 @func(i32 *%P) readonly ;; Simple call CSE'ing. -; CHECK: @test5 +; CHECK-LABEL: @test5( define i32 @test5(i32 *%P) { %V1 = call i32 @func(i32* %P) %V2 = call i32 @func(i32* %P) @@ -89,7 +89,7 @@ define i32 @test5(i32 *%P) { } ;; Trivial Store->load forwarding -; CHECK: @test6 +; CHECK-LABEL: @test6( define i32 @test6(i32 *%P) { store i32 42, i32* %P %V1 = load i32* %P @@ -98,7 +98,7 @@ define i32 @test6(i32 *%P) { } ;; Trivial dead store elimination. -; CHECK: @test7 +; CHECK-LABEL: @test7( define void @test7(i32 *%P) { store i32 42, i32* %P store i32 45, i32* %P @@ -108,7 +108,7 @@ define void @test7(i32 *%P) { } ;; Readnone functions aren't invalidated by stores. -; CHECK: @test8 +; CHECK-LABEL: @test8( define i32 @test8(i32 *%P) { %V1 = call i32 @func(i32* %P) readnone store i32 4, i32* %P diff --git a/test/Transforms/EarlyCSE/commute.ll b/test/Transforms/EarlyCSE/commute.ll index 8cf04d1765b..985fe04ab3c 100644 --- a/test/Transforms/EarlyCSE/commute.ll +++ b/test/Transforms/EarlyCSE/commute.ll @@ -1,6 +1,6 @@ ; RUN: opt < %s -S -early-cse | FileCheck %s -; CHECK: @test1 +; CHECK-LABEL: @test1( define void @test1(float %A, float %B, float* %PA, float* %PB) { ; CHECK-NEXT: fadd ; CHECK-NEXT: store @@ -13,7 +13,7 @@ define void @test1(float %A, float %B, float* %PA, float* %PB) { ret void } -; CHECK: @test2 +; CHECK-LABEL: @test2( define void @test2(float %A, float %B, i1* %PA, i1* %PB) { ; CHECK-NEXT: fcmp ; CHECK-NEXT: store @@ -26,7 +26,7 @@ define void @test2(float %A, float %B, i1* %PA, i1* %PB) { ret void } -; CHECK: @test3 +; CHECK-LABEL: @test3( define void @test3(float %A, float %B, i1* %PA, i1* %PB) { ; CHECK-NEXT: fcmp ; CHECK-NEXT: store @@ -39,7 +39,7 @@ define void @test3(float %A, float %B, i1* %PA, i1* %PB) { ret void } -; CHECK: @test4 +; CHECK-LABEL: @test4( define void @test4(i32 %A, i32 %B, i1* %PA, i1* %PB) { ; CHECK-NEXT: icmp ; CHECK-NEXT: store @@ -52,7 +52,7 @@ define void @test4(i32 %A, i32 %B, i1* %PA, i1* %PB) { ret void } -; CHECK: @test5 +; CHECK-LABEL: @test5( define void @test5(i32 %A, i32 %B, i1* %PA, i1* %PB) { ; CHECK-NEXT: icmp ; CHECK-NEXT: store diff --git a/test/Transforms/FunctionAttrs/noreturn.ll b/test/Transforms/FunctionAttrs/noreturn.ll index 470ebcb1d3c..990bea984df 100644 --- a/test/Transforms/FunctionAttrs/noreturn.ll +++ b/test/Transforms/FunctionAttrs/noreturn.ll @@ -7,7 +7,7 @@ entry: while.body: br label %while.body } -;CHECK: @main +;CHECK-LABEL: @main( ;CHECK: endless_loop ;CHECK: ret define i32 @main() noreturn nounwind ssp uwtable { diff --git a/test/Transforms/GVN/2010-11-13-Simplify.ll b/test/Transforms/GVN/2010-11-13-Simplify.ll index 07585a20b6c..9d0becc4d0e 100644 --- a/test/Transforms/GVN/2010-11-13-Simplify.ll +++ b/test/Transforms/GVN/2010-11-13-Simplify.ll @@ -3,7 +3,7 @@ declare i32 @foo(i32) readnone define i1 @bar() { -; CHECK: @bar +; CHECK-LABEL: @bar( %a = call i32 @foo (i32 0) readnone %b = call i32 @foo (i32 0) readnone %c = and i32 %a, %b diff --git a/test/Transforms/GVN/2011-06-01-NonLocalMemdepMiscompile.ll b/test/Transforms/GVN/2011-06-01-NonLocalMemdepMiscompile.ll index f24e956a2b1..4613bc49c55 100644 --- a/test/Transforms/GVN/2011-06-01-NonLocalMemdepMiscompile.ll +++ b/test/Transforms/GVN/2011-06-01-NonLocalMemdepMiscompile.ll @@ -7,7 +7,7 @@ target datalayout = "e-p:64:64:64-i1:8:8-i8:8:8-i16:16:16-i32:32:32-i64:64:64-f3 target triple = "x86_64-apple-macosx10.7.0" define i1 @rb_intern() nounwind ssp { -; CHECK: @rb_intern +; CHECK-LABEL: @rb_intern( bb: %tmp = alloca i8*, align 8 diff --git a/test/Transforms/GVN/2011-07-07-MatchIntrinsicExtract.ll b/test/Transforms/GVN/2011-07-07-MatchIntrinsicExtract.ll index 18178e45a22..ce60ffe449a 100644 --- a/test/Transforms/GVN/2011-07-07-MatchIntrinsicExtract.ll +++ b/test/Transforms/GVN/2011-07-07-MatchIntrinsicExtract.ll @@ -11,7 +11,7 @@ entry: ret i64 %add1 } -; CHECK: @test1 +; CHECK-LABEL: @test1( ; CHECK-NOT: add1 ; CHECK: ret @@ -23,7 +23,7 @@ entry: ret i64 %sub1 } -; CHECK: @test2 +; CHECK-LABEL: @test2( ; CHECK-NOT: sub1 ; CHECK: ret @@ -35,7 +35,7 @@ entry: ret i64 %mul1 } -; CHECK: @test3 +; CHECK-LABEL: @test3( ; CHECK-NOT: mul1 ; CHECK: ret @@ -47,7 +47,7 @@ entry: ret i64 %add1 } -; CHECK: @test4 +; CHECK-LABEL: @test4( ; CHECK-NOT: add1 ; CHECK: ret @@ -59,7 +59,7 @@ entry: ret i64 %sub1 } -; CHECK: @test5 +; CHECK-LABEL: @test5( ; CHECK-NOT: sub1 ; CHECK: ret @@ -71,7 +71,7 @@ entry: ret i64 %mul1 } -; CHECK: @test6 +; CHECK-LABEL: @test6( ; CHECK-NOT: mul1 ; CHECK: ret diff --git a/test/Transforms/GVN/commute.ll b/test/Transforms/GVN/commute.ll index cf4fb7f1729..cdd6ecf2ede 100644 --- a/test/Transforms/GVN/commute.ll +++ b/test/Transforms/GVN/commute.ll @@ -3,7 +3,7 @@ declare void @use(i32, i32) define void @foo(i32 %x, i32 %y) { - ; CHECK: @foo + ; CHECK-LABEL: @foo( %add1 = add i32 %x, %y %add2 = add i32 %y, %x call void @use(i32 %add1, i32 %add2) @@ -14,7 +14,7 @@ define void @foo(i32 %x, i32 %y) { declare void @vse(i1, i1) define void @bar(i32 %x, i32 %y) { - ; CHECK: @bar + ; CHECK-LABEL: @bar( %cmp1 = icmp ult i32 %x, %y %cmp2 = icmp ugt i32 %y, %x call void @vse(i1 %cmp1, i1 %cmp2) diff --git a/test/Transforms/GVN/condprop.ll b/test/Transforms/GVN/condprop.ll index 9c28955801f..708e4b23cb5 100644 --- a/test/Transforms/GVN/condprop.ll +++ b/test/Transforms/GVN/condprop.ll @@ -2,7 +2,7 @@ @a = external global i32 ; [#uses=7] -; CHECK: @test1 +; CHECK-LABEL: @test1( define i32 @test1() nounwind { entry: %0 = load i32* @a, align 4 @@ -57,7 +57,7 @@ return: ; preds = %bb8 declare void @foo(i1) declare void @bar(i32) -; CHECK: @test3 +; CHECK-LABEL: @test3( define void @test3(i32 %x, i32 %y) { %xz = icmp eq i32 %x, 0 %yz = icmp eq i32 %y, 0 @@ -79,7 +79,7 @@ nope: ret void } -; CHECK: @test4 +; CHECK-LABEL: @test4( define void @test4(i1 %b, i32 %x) { br i1 %b, label %sw, label %case3 sw: @@ -112,7 +112,7 @@ case3: ret void } -; CHECK: @test5 +; CHECK-LABEL: @test5( define i1 @test5(i32 %x, i32 %y) { %cmp = icmp eq i32 %x, %y br i1 %cmp, label %same, label %different @@ -128,7 +128,7 @@ different: ret i1 %cmp3 } -; CHECK: @test6 +; CHECK-LABEL: @test6( define i1 @test6(i32 %x, i32 %y) { %cmp2 = icmp ne i32 %x, %y %cmp = icmp eq i32 %x, %y @@ -144,7 +144,7 @@ different: ret i1 %cmp3 } -; CHECK: @test7 +; CHECK-LABEL: @test7( define i1 @test7(i32 %x, i32 %y) { %cmp = icmp sgt i32 %x, %y br i1 %cmp, label %same, label %different @@ -160,7 +160,7 @@ different: ret i1 %cmp3 } -; CHECK: @test8 +; CHECK-LABEL: @test8( define i1 @test8(i32 %x, i32 %y) { %cmp2 = icmp sle i32 %x, %y %cmp = icmp sgt i32 %x, %y @@ -177,7 +177,7 @@ different: } ; PR1768 -; CHECK: @test9 +; CHECK-LABEL: @test9( define i32 @test9(i32 %i, i32 %j) { %cmp = icmp eq i32 %i, %j br i1 %cmp, label %cond_true, label %ret @@ -193,7 +193,7 @@ ret: } ; PR1768 -; CHECK: @test10 +; CHECK-LABEL: @test10( define i32 @test10(i32 %j, i32 %i) { %cmp = icmp eq i32 %i, %j br i1 %cmp, label %cond_true, label %ret @@ -210,7 +210,7 @@ ret: declare i32 @yogibar() -; CHECK: @test11 +; CHECK-LABEL: @test11( define i32 @test11(i32 %x) { %v0 = call i32 @yogibar() %v1 = call i32 @yogibar() @@ -233,7 +233,7 @@ next2: ret i32 0 } -; CHECK: @test12 +; CHECK-LABEL: @test12( define i32 @test12(i32 %x) { %cmp = icmp eq i32 %x, 0 br i1 %cmp, label %cond_true, label %cond_false diff --git a/test/Transforms/GVN/load-pre-align.ll b/test/Transforms/GVN/load-pre-align.ll index d8ad59f9df4..4816af2f441 100644 --- a/test/Transforms/GVN/load-pre-align.ll +++ b/test/Transforms/GVN/load-pre-align.ll @@ -5,7 +5,7 @@ target datalayout = "e-p:32:32:32-i1:8:32-i8:8:32-i16:16:32-i32:32:32-i64:32:32- @p = external global i32 define i32 @test(i32 %n) nounwind { -; CHECK: @test +; CHECK-LABEL: @test( entry: br label %for.cond diff --git a/test/Transforms/GVN/malloc-load-removal.ll b/test/Transforms/GVN/malloc-load-removal.ll index 66b6929d303..e93a62a6c78 100644 --- a/test/Transforms/GVN/malloc-load-removal.ll +++ b/test/Transforms/GVN/malloc-load-removal.ll @@ -21,11 +21,11 @@ if.then: ; preds = %entry if.end: ; preds = %if.then, %entry ret i8* %call -; CHECK: @test +; CHECK-LABEL: @test( ; CHECK-NOT: load ; CHECK-NOT: icmp -; CHECK_NO_LIBCALLS: @test +; CHECK_NO_LIBCALLS-LABEL: @test( ; CHECK_NO_LIBCALLS: load ; CHECK_NO_LIBCALLS: icmp } diff --git a/test/Transforms/GVN/non-local-offset.ll b/test/Transforms/GVN/non-local-offset.ll index 8eaa99933ab..0b9edcb8e43 100644 --- a/test/Transforms/GVN/non-local-offset.ll +++ b/test/Transforms/GVN/non-local-offset.ll @@ -5,7 +5,7 @@ target datalayout = "e-p:64:64:64" ; GVN should ignore the store to p[1] to see that the load from p[0] is ; fully redundant. -; CHECK: @yes +; CHECK-LABEL: @yes( ; CHECK: if.then: ; CHECK-NEXT: store i32 0, i32* %q ; CHECK-NEXT: ret void @@ -30,7 +30,7 @@ if.else: ; fully redundant. However, the second load is larger, so it's not a simple ; redundancy. -; CHECK: @watch_out_for_size_change +; CHECK-LABEL: @watch_out_for_size_change( ; CHECK: if.then: ; CHECK-NEXT: store i32 0, i32* %q ; CHECK-NEXT: ret void diff --git a/test/Transforms/GVN/phi-translate.ll b/test/Transforms/GVN/phi-translate.ll index fa91d2919eb..50d6178c5cc 100644 --- a/test/Transforms/GVN/phi-translate.ll +++ b/test/Transforms/GVN/phi-translate.ll @@ -2,7 +2,7 @@ target datalayout = "e-p:64:64:64" -; CHECK: @foo +; CHECK-LABEL: @foo( ; CHECK: entry.end_crit_edge: ; CHECK: %n.pre = load i32* %q.phi.trans.insert ; CHECK: then: diff --git a/test/Transforms/GVN/pr14166.ll b/test/Transforms/GVN/pr14166.ll index 9f47e464265..4d682050687 100644 --- a/test/Transforms/GVN/pr14166.ll +++ b/test/Transforms/GVN/pr14166.ll @@ -10,7 +10,7 @@ define <2 x i32> @test1() { store <2 x i8*> %v3, <2 x i8*>* %v4 %v5 = load <2 x i32>* %v1 ret <2 x i32> %v5 -; CHECK: @test1 +; CHECK-LABEL: @test1( ; CHECK: %v1 = alloca <2 x i32> ; CHECK: call void @anything(<2 x i32>* %v1) ; CHECK: %v2 = load <2 x i32>* %v1 diff --git a/test/Transforms/GVN/pre-load.ll b/test/Transforms/GVN/pre-load.ll index bf4add42e80..9842886fe3a 100644 --- a/test/Transforms/GVN/pre-load.ll +++ b/test/Transforms/GVN/pre-load.ll @@ -2,7 +2,7 @@ target 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" define i32 @test1(i32* %p, i1 %C) { -; CHECK: @test1 +; CHECK-LABEL: @test1( block1: br i1 %C, label %block2, label %block3 @@ -25,7 +25,7 @@ block4: ; This is a simple phi translation case. define i32 @test2(i32* %p, i32* %q, i1 %C) { -; CHECK: @test2 +; CHECK-LABEL: @test2( block1: br i1 %C, label %block2, label %block3 @@ -50,7 +50,7 @@ block4: ; This is a PRE case that requires phi translation through a GEP. define i32 @test3(i32* %p, i32* %q, i32** %Hack, i1 %C) { -; CHECK: @test3 +; CHECK-LABEL: @test3( block1: %B = getelementptr i32* %q, i32 1 store i32* %B, i32** %Hack @@ -80,7 +80,7 @@ block4: ;; Here the loaded address is available, but the computation is in 'block3' ;; which does not dominate 'block2'. define i32 @test4(i32* %p, i32* %q, i32** %Hack, i1 %C) { -; CHECK: @test4 +; CHECK-LABEL: @test4( block1: br i1 %C, label %block2, label %block3 @@ -116,7 +116,7 @@ block4: ;} define void @test5(i32 %N, double* nocapture %G) nounwind ssp { -; CHECK: @test5 +; CHECK-LABEL: @test5( entry: %0 = add i32 %N, -1 %1 = icmp sgt i32 %0, 0 @@ -159,7 +159,7 @@ return: ;} define void @test6(i32 %N, double* nocapture %G) nounwind ssp { -; CHECK: @test6 +; CHECK-LABEL: @test6( entry: %0 = add i32 %N, -1 %1 = icmp sgt i32 %0, 0 @@ -242,7 +242,7 @@ return: ;; Here the loaded address isn't available in 'block2' at all, requiring a new ;; GEP to be inserted into it. define i32 @test8(i32* %p, i32* %q, i32** %Hack, i1 %C) { -; CHECK: @test8 +; CHECK-LABEL: @test8( block1: br i1 %C, label %block2, label %block3 @@ -365,7 +365,7 @@ return: ; Test critical edge splitting. define i32 @test11(i32* %p, i1 %C, i32 %N) { -; CHECK: @test11 +; CHECK-LABEL: @test11( block1: br i1 %C, label %block2, label %block3 diff --git a/test/Transforms/GVN/preserve-tbaa.ll b/test/Transforms/GVN/preserve-tbaa.ll index a93675556cd..e52772bfd9e 100644 --- a/test/Transforms/GVN/preserve-tbaa.ll +++ b/test/Transforms/GVN/preserve-tbaa.ll @@ -4,7 +4,7 @@ target datalayout = "e-p:64:64:64" ; GVN should preserve the TBAA tag on loads when doing PRE. -; CHECK: @test +; CHECK-LABEL: @test( ; CHECK: %tmp33.pre = load i16* %P, align 2, !tbaa !0 ; CHECK: br label %for.body define void @test(i16 *%P, i16* %Q) nounwind { diff --git a/test/Transforms/GVN/rle-phi-translate.ll b/test/Transforms/GVN/rle-phi-translate.ll index 6731f43c0d2..1ce7e0b9379 100644 --- a/test/Transforms/GVN/rle-phi-translate.ll +++ b/test/Transforms/GVN/rle-phi-translate.ll @@ -4,7 +4,7 @@ target datalayout = "e-p:32:32:32-i1:8:8-i8:8:8-i16:16:16-i32:32:32-i64:32:64-f3 target triple = "i386-apple-darwin7" define i32 @test1(i32* %b, i32* %c) nounwind { -; CHECK: @test1 +; CHECK-LABEL: @test1( entry: %g = alloca i32 %t1 = icmp eq i32* %b, null @@ -36,7 +36,7 @@ bb2: ; preds = %bb1, %bb } define i8 @test2(i1 %cond, i32* %b, i32* %c) nounwind { -; CHECK: @test2 +; CHECK-LABEL: @test2( entry: br i1 %cond, label %bb, label %bb1 @@ -61,7 +61,7 @@ bb2: } define i32 @test3(i1 %cond, i32* %b, i32* %c) nounwind { -; CHECK: @test3 +; CHECK-LABEL: @test3( entry: br i1 %cond, label %bb, label %bb1 @@ -88,7 +88,7 @@ bb2: ; PR5313 define i32 @test4(i1 %cond, i32* %b, i32* %c) nounwind { -; CHECK: @test4 +; CHECK-LABEL: @test4( entry: br i1 %cond, label %bb, label %bb1 @@ -121,7 +121,7 @@ bb2: ; ; Should compile into one load in the loop. define void @test5(i32 %N, double* nocapture %G) nounwind ssp { -; CHECK: @test5 +; CHECK-LABEL: @test5( bb.nph: br label %for.body diff --git a/test/Transforms/GVN/rle.ll b/test/Transforms/GVN/rle.ll index f470ed88bb9..8787dd5333b 100644 --- a/test/Transforms/GVN/rle.ll +++ b/test/Transforms/GVN/rle.ll @@ -7,7 +7,7 @@ define i32 @test0(i32 %V, i32* %P) { %A = load i32* %P ret i32 %A -; CHECK: @test0 +; CHECK-LABEL: @test0( ; CHECK: ret i32 %V } @@ -47,7 +47,7 @@ define float @coerce_mustalias1(i32 %V, i32* %P) { %A = load float* %P2 ret float %A -; CHECK: @coerce_mustalias1 +; CHECK-LABEL: @coerce_mustalias1( ; CHECK-NOT: load ; CHECK: ret float } @@ -60,7 +60,7 @@ define float @coerce_mustalias2(i32* %V, i32** %P) { %A = load float* %P2 ret float %A -; CHECK: @coerce_mustalias2 +; CHECK-LABEL: @coerce_mustalias2( ; CHECK-NOT: load ; CHECK: ret float } @@ -73,7 +73,7 @@ define i32* @coerce_mustalias3(float %V, float* %P) { %A = load i32** %P2 ret i32* %A -; CHECK: @coerce_mustalias3 +; CHECK-LABEL: @coerce_mustalias3( ; CHECK-NOT: load ; CHECK: ret i32* } @@ -92,7 +92,7 @@ F: %X = bitcast i32 %A to float ret float %X -; CHECK: @coerce_mustalias4 +; CHECK-LABEL: @coerce_mustalias4( ; CHECK: %A = load i32* %P ; CHECK-NOT: load ; CHECK: ret float @@ -107,7 +107,7 @@ define i8 @coerce_mustalias5(i32 %V, i32* %P) { %A = load i8* %P2 ret i8 %A -; CHECK: @coerce_mustalias5 +; CHECK-LABEL: @coerce_mustalias5( ; CHECK-NOT: load ; CHECK: ret i8 } @@ -120,7 +120,7 @@ define float @coerce_mustalias6(i64 %V, i64* %P) { %A = load float* %P2 ret float %A -; CHECK: @coerce_mustalias6 +; CHECK-LABEL: @coerce_mustalias6( ; CHECK-NOT: load ; CHECK: ret float } @@ -133,7 +133,7 @@ define i8* @coerce_mustalias7(i64 %V, i64* %P) { %A = load i8** %P2 ret i8* %A -; CHECK: @coerce_mustalias7 +; CHECK-LABEL: @coerce_mustalias7( ; CHECK-NOT: load ; CHECK: ret i8* } @@ -146,7 +146,7 @@ entry: %arrayidx = getelementptr inbounds i16* %A, i64 42 %tmp2 = load i16* %arrayidx ret i16 %tmp2 -; CHECK: @memset_to_i16_local +; CHECK-LABEL: @memset_to_i16_local( ; CHECK-NOT: load ; CHECK: ret i16 257 } @@ -159,7 +159,7 @@ entry: %arrayidx = getelementptr inbounds float* %A, i64 42 ; [#uses=1] %tmp2 = load float* %arrayidx ; [#uses=1] ret float %tmp2 -; CHECK: @memset_to_float_local +; CHECK-LABEL: @memset_to_float_local( ; CHECK-NOT: load ; CHECK: zext ; CHECK-NEXT: shl @@ -187,7 +187,7 @@ Cont: %A = load i16* %P2 ret i16 %A -; CHECK: @memset_to_i16_nonlocal0 +; CHECK-LABEL: @memset_to_i16_nonlocal0( ; CHECK: Cont: ; CHECK-NEXT: %A = phi i16 [ 514, %F ], [ 257, %T ] ; CHECK-NOT: load @@ -204,7 +204,7 @@ entry: %arrayidx = getelementptr inbounds float* %A, i64 1 ; [#uses=1] %tmp2 = load float* %arrayidx ; [#uses=1] ret float %tmp2 -; CHECK: @memcpy_to_float_local +; CHECK-LABEL: @memcpy_to_float_local( ; CHECK-NOT: load ; CHECK: ret float 1.400000e+01 } @@ -228,7 +228,7 @@ Cont: %A = load i8* %P3 ret i8 %A -; CHECK: @coerce_mustalias_nonlocal0 +; CHECK-LABEL: @coerce_mustalias_nonlocal0( ; CHECK: Cont: ; CHECK: %A = phi i8 [ ; CHECK-NOT: load @@ -254,7 +254,7 @@ Cont: %A = load i8* %P3 ret i8 %A -; CHECK: @coerce_mustalias_nonlocal1 +; CHECK-LABEL: @coerce_mustalias_nonlocal1( ; CHECK: Cont: ; CHECK: %A = phi i8 [ ; CHECK-NOT: load @@ -277,7 +277,7 @@ Cont: %A = load i8* %P3 ret i8 %A -; CHECK: @coerce_mustalias_pre0 +; CHECK-LABEL: @coerce_mustalias_pre0( ; CHECK: F: ; CHECK: load i8* %P3 ; CHECK: Cont: @@ -301,7 +301,7 @@ define i8 @coerce_offset0(i32 %V, i32* %P) { %A = load i8* %P3 ret i8 %A -; CHECK: @coerce_offset0 +; CHECK-LABEL: @coerce_offset0( ; CHECK-NOT: load ; CHECK: ret i8 } @@ -324,7 +324,7 @@ Cont: %A = load i8* %P4 ret i8 %A -; CHECK: @coerce_offset_nonlocal0 +; CHECK-LABEL: @coerce_offset_nonlocal0( ; CHECK: Cont: ; CHECK: %A = phi i8 [ ; CHECK-NOT: load @@ -348,7 +348,7 @@ Cont: %A = load i8* %P4 ret i8 %A -; CHECK: @coerce_offset_pre0 +; CHECK-LABEL: @coerce_offset_pre0( ; CHECK: F: ; CHECK: load i8* %P4 ; CHECK: Cont: @@ -378,7 +378,7 @@ block4: %d = load i32* %c ret i32 %d -; CHECK: @chained_load +; CHECK-LABEL: @chained_load( ; CHECK: %z = load i32** %p ; CHECK-NOT: load ; CHECK: %d = load i32* %z @@ -390,7 +390,7 @@ declare i1 @cond() readonly declare i1 @cond2() readonly define i32 @phi_trans2() { -; CHECK: @phi_trans2 +; CHECK-LABEL: @phi_trans2( entry: %P = alloca i32, i32 400 br label %F1 @@ -428,7 +428,7 @@ TY: } define i32 @phi_trans3(i32* %p) { -; CHECK: @phi_trans3 +; CHECK-LABEL: @phi_trans3( block1: br i1 true, label %block2, label %block3 @@ -469,7 +469,7 @@ exit: } define i8 @phi_trans4(i8* %p) { -; CHECK: @phi_trans4 +; CHECK-LABEL: @phi_trans4( entry: %X3 = getelementptr i8* %p, i32 192 store i8 192, i8* %X3 @@ -499,7 +499,7 @@ out: } define i8 @phi_trans5(i8* %p) { -; CHECK: @phi_trans5 +; CHECK-LABEL: @phi_trans5( entry: %X4 = getelementptr i8* %p, i32 2 @@ -542,7 +542,7 @@ entry: %arraydecay = getelementptr inbounds [256 x i32]* %x, i32 0, i32 0 ; %tmp1 = load i32* %arraydecay ; [#uses=1] ret i32 %tmp1 -; CHECK: @memset_to_load +; CHECK-LABEL: @memset_to_load( ; CHECK: ret i32 0 } @@ -561,7 +561,7 @@ entry: %add = add nsw i32 %tmp2, %conv ret i32 %add -; TEMPORARILYDISABLED: @load_load_partial_alias +; TEMPORARILYDISABLED-LABEL: @load_load_partial_alias( ; TEMPORARILYDISABLED: load i32* ; TEMPORARILYDISABLED-NOT: load ; TEMPORARILYDISABLED: lshr i32 {{.*}}, 8 @@ -588,7 +588,7 @@ land.lhs.true: ; preds = %entry if.end: ret i32 52 -; TEMPORARILY_DISABLED: @load_load_partial_alias_cross_block +; TEMPORARILY_DISABLED-LABEL: @load_load_partial_alias_cross_block( ; TEMPORARILY_DISABLED: land.lhs.true: ; TEMPORARILY_DISABLED-NOT: load i8 ; TEMPORARILY_DISABLED: ret i32 %conv6 @@ -611,7 +611,7 @@ entry: %conv2 = zext i8 %tmp1 to i32 %add = add nsw i32 %conv, %conv2 ret i32 %add -; CHECK: @test_widening1 +; CHECK-LABEL: @test_widening1( ; CHECK-NOT: load ; CHECK: load i16* ; CHECK-NOT: load @@ -635,7 +635,7 @@ entry: %add3 = add nsw i32 %add2, %conv3 ret i32 %add3 -; CHECK: @test_widening2 +; CHECK-LABEL: @test_widening2( ; CHECK-NOT: load ; CHECK: load i32* ; CHECK-NOT: load diff --git a/test/Transforms/GlobalOpt/2009-02-15-ResolveAlias.ll b/test/Transforms/GlobalOpt/2009-02-15-ResolveAlias.ll index a5be2b17d4a..7fb8d9c172b 100644 --- a/test/Transforms/GlobalOpt/2009-02-15-ResolveAlias.ll +++ b/test/Transforms/GlobalOpt/2009-02-15-ResolveAlias.ll @@ -1,7 +1,7 @@ ; RUN: opt < %s -globalopt -S | FileCheck %s define internal void @f() { -; CHECK-NOT: @f +; CHECK-NOT-LABEL: @f( ; CHECK: define void @a ret void } diff --git a/test/Transforms/GlobalOpt/blockaddress.ll b/test/Transforms/GlobalOpt/blockaddress.ll index 13da76299d5..f7f830869b8 100644 --- a/test/Transforms/GlobalOpt/blockaddress.ll +++ b/test/Transforms/GlobalOpt/blockaddress.ll @@ -3,7 +3,7 @@ @x = internal global i8* zeroinitializer define void @f() { -; CHECK: @f +; CHECK-LABEL: @f( ; Check that we don't hit an assert in Constant::IsThreadDependent() ; when storing this blockaddress into a global. @@ -13,7 +13,7 @@ define void @f() { } define void @g() { -; CHECK: @g +; CHECK-LABEL: @g( here: ret void diff --git a/test/Transforms/GlobalOpt/cleanup-pointer-root-users.ll b/test/Transforms/GlobalOpt/cleanup-pointer-root-users.ll index a472f1033ff..b6dfdea0610 100644 --- a/test/Transforms/GlobalOpt/cleanup-pointer-root-users.ll +++ b/test/Transforms/GlobalOpt/cleanup-pointer-root-users.ll @@ -3,7 +3,7 @@ @glbl = internal global i8* null define void @test1a() { -; CHECK: @test1a +; CHECK-LABEL: @test1a( ; CHECK-NOT: store ; CHECK-NEXT: ret void store i8* null, i8** @glbl @@ -11,7 +11,7 @@ define void @test1a() { } define void @test1b(i8* %p) { -; CHECK: @test1b +; CHECK-LABEL: @test1b( ; CHECK-NEXT: store ; CHECK-NEXT: ret void store i8* %p, i8** @glbl @@ -19,7 +19,7 @@ define void @test1b(i8* %p) { } define void @test2() { -; CHECK: @test2 +; CHECK-LABEL: @test2( ; CHECK: alloca i8 %txt = alloca i8 call void @foo2(i8* %txt) @@ -31,7 +31,7 @@ declare i8* @strdup(i8*) declare void @foo2(i8*) define void @test3() uwtable { -; CHECK: @test3 +; CHECK-LABEL: @test3( ; CHECK-NOT: bb1: ; CHECK-NOT: bb2: ; CHECK: invoke diff --git a/test/Transforms/GlobalOpt/ctor-list-opt-constexpr.ll b/test/Transforms/GlobalOpt/ctor-list-opt-constexpr.ll index c9076109443..dd86f01924a 100644 --- a/test/Transforms/GlobalOpt/ctor-list-opt-constexpr.ll +++ b/test/Transforms/GlobalOpt/ctor-list-opt-constexpr.ll @@ -20,7 +20,7 @@ entry: store i32* inttoptr (i64 sdiv (i64 ptrtoint (i32* @G to i64), i64 ptrtoint (i32* @H to i64)) to i32*), i32** %tmp, align 8 ret void } -; CHECK: @init1 +; CHECK-LABEL: @init1( ; CHECK: store i32* ; PR11705 - ptrtoint isn't safe in general in global initializers. @@ -30,5 +30,5 @@ entry: store i128 ptrtoint (i32* @G to i128), i128* %tmp, align 16 ret void } -; CHECK: @init2 +; CHECK-LABEL: @init2( ; CHECK: store i128 diff --git a/test/Transforms/GlobalOpt/integer-bool.ll b/test/Transforms/GlobalOpt/integer-bool.ll index 51858069ac5..abf5fdd2ef3 100644 --- a/test/Transforms/GlobalOpt/integer-bool.ll +++ b/test/Transforms/GlobalOpt/integer-bool.ll @@ -19,7 +19,7 @@ define void @set2() { } define i1 @get() { -; CHECK: @get +; CHECK-LABEL: @get( %A = load i32 addrspace(1) * @G %C = icmp slt i32 %A, 2 ret i1 %C diff --git a/test/Transforms/GlobalOpt/load-store-global.ll b/test/Transforms/GlobalOpt/load-store-global.ll index 25a53370fa0..ad7326dc682 100644 --- a/test/Transforms/GlobalOpt/load-store-global.ll +++ b/test/Transforms/GlobalOpt/load-store-global.ll @@ -7,14 +7,14 @@ define void @foo() { %V = load i32* @G ; [#uses=1] store i32 %V, i32* @G ret void -; CHECK: @foo +; CHECK-LABEL: @foo( ; CHECK-NEXT: ret void } define i32 @bar() { %X = load i32* @G ; [#uses=1] ret i32 %X -; CHECK: @bar +; CHECK-LABEL: @bar( ; CHECK-NEXT: ret i32 17 } @@ -31,7 +31,7 @@ define void @qux() nounwind { store i64* inttoptr (i64 1 to i64*), i64** @a, align 8 %l = load i64** @a, align 8 ret void -; CHECK: @qux +; CHECK-LABEL: @qux( ; CHECK-NOT: store ; CHECK-NOT: load } diff --git a/test/Transforms/GlobalOpt/metadata.ll b/test/Transforms/GlobalOpt/metadata.ll index 730e2b08023..ecf3f94196b 100644 --- a/test/Transforms/GlobalOpt/metadata.ll +++ b/test/Transforms/GlobalOpt/metadata.ll @@ -6,7 +6,7 @@ @G = internal global i8** null define i32 @main(i32 %argc, i8** %argv) { -; CHECK: @main +; CHECK-LABEL: @main( ; CHECK: %G = alloca store i8** %argv, i8*** @G ret i32 0 diff --git a/test/Transforms/GlobalOpt/tls.ll b/test/Transforms/GlobalOpt/tls.ll index 7a410e5ed20..59ae23a4f6a 100644 --- a/test/Transforms/GlobalOpt/tls.ll +++ b/test/Transforms/GlobalOpt/tls.ll @@ -29,7 +29,7 @@ entry: %1 = load i32* %0, align 4 ret i32 %1 -; CHECK: @f +; CHECK-LABEL: @f( ; Make sure that the load from @ip hasn't been removed. ; CHECK: load i32** @ip ; CHECK: ret @@ -46,7 +46,7 @@ entry: tail call void @signal() nounwind ret void -; CHECK: @g +; CHECK-LABEL: @g( ; Make sure that the store to @ip hasn't been removed. ; CHECK: store {{.*}} @ip ; CHECK: ret diff --git a/test/Transforms/GlobalOpt/zeroinitializer-gep-load.ll b/test/Transforms/GlobalOpt/zeroinitializer-gep-load.ll index d613601e8d7..d9787232d97 100644 --- a/test/Transforms/GlobalOpt/zeroinitializer-gep-load.ll +++ b/test/Transforms/GlobalOpt/zeroinitializer-gep-load.ll @@ -6,6 +6,6 @@ define i32 @test1(i64 %idx) nounwind { %arrayidx = getelementptr inbounds [10 x i32]* @zero, i64 0, i64 %idx %l = load i32* %arrayidx ret i32 %l -; CHECK: @test1 +; CHECK-LABEL: @test1( ; CHECK: ret i32 0 } diff --git a/test/Transforms/IndVarSimplify/2011-10-27-lftrnull.ll b/test/Transforms/IndVarSimplify/2011-10-27-lftrnull.ll index 76c90e0cddd..a8020e6014b 100644 --- a/test/Transforms/IndVarSimplify/2011-10-27-lftrnull.ll +++ b/test/Transforms/IndVarSimplify/2011-10-27-lftrnull.ll @@ -4,7 +4,7 @@ target datalayout = "e-p:32:32:32-i1:8:32-i8:8:32-i16:16:32-i32:32:32-i64:32:64-f32:32:32-f64:32:64-v64:32:64-v128:32:128-a0:0:32-n32-S32" target triple = "thumbv7-apple-darwin" -; CHECK: @test +; CHECK-LABEL: @test( ; CHECK: if.end.i126: ; CHECK: %exitcond = icmp ne i8* %incdec.ptr.i, getelementptr (i8* null, i32 undef) define void @test() nounwind { diff --git a/test/Transforms/IndVarSimplify/2011-11-01-lftrptr.ll b/test/Transforms/IndVarSimplify/2011-11-01-lftrptr.ll index c0c508f02ec..8247886e66d 100644 --- a/test/Transforms/IndVarSimplify/2011-11-01-lftrptr.ll +++ b/test/Transforms/IndVarSimplify/2011-11-01-lftrptr.ll @@ -9,7 +9,7 @@ ; SCEV. Since it's an i8*, it has unit stride so we never adjust the ; SCEV expression in a way that would convert it to an integer type. -; CHECK: @testnullptrptr +; CHECK-LABEL: @testnullptrptr( ; CHECK: loop: ; CHECK: icmp ne define i8 @testnullptrptr(i8* %buf, i8* %end) nounwind { @@ -34,7 +34,7 @@ exit: ret i8 %snext } -; CHECK: @testptrptr +; CHECK-LABEL: @testptrptr( ; CHECK: loop: ; CHECK: icmp ne define i8 @testptrptr(i8* %buf, i8* %end) nounwind { @@ -59,7 +59,7 @@ exit: ret i8 %snext } -; CHECK: @testnullptrint +; CHECK-LABEL: @testnullptrint( ; CHECK: loop: ; CHECK: icmp ne define i8 @testnullptrint(i8* %buf, i8* %end) nounwind { @@ -89,7 +89,7 @@ exit: ret i8 %snext } -; CHECK: @testptrint +; CHECK-LABEL: @testptrint( ; CHECK: loop: ; CHECK: icmp ne define i8 @testptrint(i8* %buf, i8* %end) nounwind { diff --git a/test/Transforms/IndVarSimplify/2011-11-17-selfphi.ll b/test/Transforms/IndVarSimplify/2011-11-17-selfphi.ll index ccf259597e3..8f0cb80a107 100644 --- a/test/Transforms/IndVarSimplify/2011-11-17-selfphi.ll +++ b/test/Transforms/IndVarSimplify/2011-11-17-selfphi.ll @@ -1,7 +1,7 @@ ; RUN: opt < %s -indvars -S | FileCheck %s ; PR11350: Check that SimplifyIndvar handles a cycle of useless self-phis. -; CHECK: @test +; CHECK-LABEL: @test( ; CHECK-NOT: lcssa = phi define void @test() nounwind { entry: diff --git a/test/Transforms/IndVarSimplify/2012-07-17-lftr-undef.ll b/test/Transforms/IndVarSimplify/2012-07-17-lftr-undef.ll index 7c5f81896f1..643d3cb333e 100644 --- a/test/Transforms/IndVarSimplify/2012-07-17-lftr-undef.ll +++ b/test/Transforms/IndVarSimplify/2012-07-17-lftr-undef.ll @@ -2,7 +2,7 @@ ; PR13371: indvars pass incorrectly substitutes 'undef' values ; ; LFTR should not user %undef as the loop counter. -; CHECK: @test +; CHECK-LABEL: @test( ; CHECK-NOT: icmp{{.*}}undef @.str3 = private constant [6 x i8] c"%lld\0A\00", align 1 declare i32 @printf(i8* noalias nocapture, ...) nounwind diff --git a/test/Transforms/IndVarSimplify/2012-10-19-congruent-constant.ll b/test/Transforms/IndVarSimplify/2012-10-19-congruent-constant.ll index 5c478669d29..5f6ff36cf57 100644 --- a/test/Transforms/IndVarSimplify/2012-10-19-congruent-constant.ll +++ b/test/Transforms/IndVarSimplify/2012-10-19-congruent-constant.ll @@ -19,7 +19,7 @@ for.body: ; preds = %for.body, %entry for.end: ; preds = %for.body ret void -; CHECK: @test1 +; CHECK-LABEL: @test1( ; CHECK-NOT: phi i1 ; CHECK: call void @aux(i1 false, i1 false) } diff --git a/test/Transforms/IndVarSimplify/dont-recompute.ll b/test/Transforms/IndVarSimplify/dont-recompute.ll index d37b0e21f82..e5ced0f2e4b 100644 --- a/test/Transforms/IndVarSimplify/dont-recompute.ll +++ b/test/Transforms/IndVarSimplify/dont-recompute.ll @@ -21,7 +21,7 @@ declare void @func(i32) -; CHECK: @test +; CHECK-LABEL: @test( define void @test(i32 %m) nounwind uwtable { entry: br label %for.body @@ -45,7 +45,7 @@ for.end: ; preds = %for.body ret void } -; CHECK: @test2 +; CHECK-LABEL: @test2( define i32 @test2(i32 %m) nounwind uwtable { entry: br label %for.body diff --git a/test/Transforms/IndVarSimplify/eliminate-comparison.ll b/test/Transforms/IndVarSimplify/eliminate-comparison.ll index 5dca7126466..b48403e9a23 100644 --- a/test/Transforms/IndVarSimplify/eliminate-comparison.ll +++ b/test/Transforms/IndVarSimplify/eliminate-comparison.ll @@ -7,7 +7,7 @@ target datalayout = "e-p:64:64:64-i1:8:8-i8:8:8-i16:16:16-i32:32:32-i64:64:64-f3 ; Indvars should be able to simplify simple comparisons involving ; induction variables. -; CHECK: @foo +; CHECK-LABEL: @foo( ; CHECK: %cond = and i1 %tobool.not, true define void @foo(i64 %n, i32* nocapture %p) nounwind { @@ -42,7 +42,7 @@ return: ; Don't eliminate an icmp that's contributing to the loop exit test though. -; CHECK: @_ZNK4llvm5APInt3ultERKS0_ +; CHECK-LABEL: @_ZNK4llvm5APInt3ultERKS0_( ; CHECK: %tmp99 = icmp sgt i32 %i, -1 define i32 @_ZNK4llvm5APInt3ultERKS0_(i32 %tmp2.i1, i64** %tmp65, i64** %tmp73, i64** %tmp82, i64** %tmp90) { @@ -85,7 +85,7 @@ bb20.loopexit: ; Indvars should eliminate the icmp here. -; CHECK: @func_10 +; CHECK-LABEL: @func_10( ; CHECK-NOT: icmp ; CHECK: ret void @@ -110,7 +110,7 @@ return: ; PR14432 ; Indvars should not turn the second loop into an infinite one. -; CHECK: @func_11 +; CHECK-LABEL: @func_11( ; CHECK: %tmp5 = icmp slt i32 %__key6.0, 10 ; CHECK-NOT: br i1 true, label %noassert68, label %unrolledend @@ -162,7 +162,7 @@ unrolledend: ; preds = %forcond38 declare void @llvm.trap() noreturn nounwind ; In this case the second loop only has a single iteration, fold the header away -; CHECK: @func_12 +; CHECK-LABEL: @func_12( ; CHECK: %tmp5 = icmp slt i32 %__key6.0, 10 ; CHECK: br i1 true, label %noassert68, label %unrolledend define i32 @func_12() nounwind uwtable { diff --git a/test/Transforms/IndVarSimplify/eliminate-rem.ll b/test/Transforms/IndVarSimplify/eliminate-rem.ll index f756389398f..64fe7107b63 100644 --- a/test/Transforms/IndVarSimplify/eliminate-rem.ll +++ b/test/Transforms/IndVarSimplify/eliminate-rem.ll @@ -3,7 +3,7 @@ target 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" ; Indvars should be able to eliminate this srem. -; CHECK: @simple +; CHECK-LABEL: @simple( ; CHECK-NOT: rem ; CHECK: ret @@ -32,7 +32,7 @@ bb12: ; preds = %bb11, %bb } ; Indvars should be able to eliminate the (i+1)%n. -; CHECK: @f +; CHECK-LABEL: @f( ; CHECK-NOT: rem ; CHECK: rem ; CHECK-NOT: rem diff --git a/test/Transforms/IndVarSimplify/floating-point-iv.ll b/test/Transforms/IndVarSimplify/floating-point-iv.ll index 266eebd5bb6..c5bf3860ab5 100644 --- a/test/Transforms/IndVarSimplify/floating-point-iv.ll +++ b/test/Transforms/IndVarSimplify/floating-point-iv.ll @@ -12,7 +12,7 @@ bb: ; preds = %bb, %entry return: ; preds = %bb ret void -; CHECK: @test1 +; CHECK-LABEL: @test1( ; CHECK: icmp } @@ -31,7 +31,7 @@ bb: ; preds = %bb, %entry return: ; preds = %bb ret void -; CHECK: @test2 +; CHECK-LABEL: @test2( ; CHECK: icmp } @@ -49,7 +49,7 @@ bb: ; preds = %bb, %entry return: ret void -; CHECK: @test3 +; CHECK-LABEL: @test3( ; CHECK: fcmp } @@ -66,7 +66,7 @@ bb: ; preds = %bb, %entry return: ret void -; CHECK: @test4 +; CHECK-LABEL: @test4( ; CHECK-NOT: cmp ; CHECK: br i1 false } @@ -86,7 +86,7 @@ define void @test5() nounwind { exit: ret void -; CHECK: @test5 +; CHECK-LABEL: @test5( ; CHECK: icmp slt i32 {{.*}}, 0 ; CHECK-NEXT: br i1 } diff --git a/test/Transforms/IndVarSimplify/iv-fold.ll b/test/Transforms/IndVarSimplify/iv-fold.ll index e0b05cdb31f..41a1f5ff91a 100644 --- a/test/Transforms/IndVarSimplify/iv-fold.ll +++ b/test/Transforms/IndVarSimplify/iv-fold.ll @@ -4,7 +4,7 @@ target datalayout = "e-p:64:64:64-i1:8:8-i8:8:8-i16:16:16-i32:32:32-i64:64:64-f3 ; Indvars should be able to fold IV increments into shr when low bits are zero. ; -; CHECK: @foldIncShr +; CHECK-LABEL: @foldIncShr( ; CHECK: shr.1 = lshr i32 %0, 5 define i32 @foldIncShr(i32* %bitmap, i32 %bit_addr, i32 %nbits) nounwind { entry: @@ -31,7 +31,7 @@ while.end: ; Invdars should not fold an increment into shr unless 2^shiftBits is ; a multiple of the recurrence step. ; -; CHECK: @noFoldIncShr +; CHECK-LABEL: @noFoldIncShr( ; CHECK: shr.1 = lshr i32 %inc.1, 5 define i32 @noFoldIncShr(i32* %bitmap, i32 %bit_addr, i32 %nbits) nounwind { entry: diff --git a/test/Transforms/IndVarSimplify/lftr-extend-const.ll b/test/Transforms/IndVarSimplify/lftr-extend-const.ll index 18e1507764b..2fac4a797e2 100644 --- a/test/Transforms/IndVarSimplify/lftr-extend-const.ll +++ b/test/Transforms/IndVarSimplify/lftr-extend-const.ll @@ -1,6 +1,6 @@ ;RUN: opt -S %s -indvars | FileCheck %s -; CHECK-LABEL: @foo +; CHECK-LABEL-LABEL: @foo( ; CHECK-NOT: %lftr.wideiv = trunc i32 %indvars.iv.next to i16 ; CHECK: %exitcond = icmp ne i32 %indvars.iv.next, 512 define void @foo() #0 { @@ -20,7 +20,7 @@ for.end: ; preds = %for.body } ; Check that post-incrementing the backedge taken count does not overflow. -; CHECK-LABEL: @postinc +; CHECK-LABEL-LABEL: @postinc( ; CHECK: icmp eq i32 %indvars.iv.next, 256 define i32 @postinc() #0 { entry: diff --git a/test/Transforms/IndVarSimplify/lftr-reuse.ll b/test/Transforms/IndVarSimplify/lftr-reuse.ll index 7fb36e509ae..fe3df5cfa88 100644 --- a/test/Transforms/IndVarSimplify/lftr-reuse.ll +++ b/test/Transforms/IndVarSimplify/lftr-reuse.ll @@ -165,7 +165,7 @@ entry: %lim = add i32 %x, %n %cmp.ph = icmp ult i32 %x, %lim br i1 %cmp.ph, label %loop, label %exit -; CHECK: @geplftr +; CHECK-LABEL: @geplftr( ; CHECK: loop: ; CHECK: phi i8* ; DISABLE-NOT: phi // This check is currently disabled @@ -190,7 +190,7 @@ exit: define void @nevertaken() nounwind uwtable ssp { entry: br label %loop -; CHECK: @nevertaken +; CHECK-LABEL: @nevertaken( ; CHECK: loop: ; CHECK-NOT: phi ; CHECK-NOT: add diff --git a/test/Transforms/IndVarSimplify/tripcount_compute.ll b/test/Transforms/IndVarSimplify/tripcount_compute.ll index 8835b9627fd..626a29b20b7 100644 --- a/test/Transforms/IndVarSimplify/tripcount_compute.ll +++ b/test/Transforms/IndVarSimplify/tripcount_compute.ll @@ -5,7 +5,7 @@ ; the exit value of the loop will be for some value, allowing us to substitute ; it directly into users outside of the loop, making the loop dead. -; CHECK: @linear_setne +; CHECK-LABEL: @linear_setne( ; CHECK: ret i32 100 define i32 @linear_setne() { @@ -22,7 +22,7 @@ loopexit: ; preds = %loop ret i32 %i } -; CHECK: @linear_setne_2 +; CHECK-LABEL: @linear_setne_2( ; CHECK: ret i32 100 define i32 @linear_setne_2() { @@ -39,7 +39,7 @@ loopexit: ; preds = %loop ret i32 %i } -; CHECK: @linear_setne_overflow +; CHECK-LABEL: @linear_setne_overflow( ; CHECK: ret i32 0 define i32 @linear_setne_overflow() { @@ -56,7 +56,7 @@ loopexit: ; preds = %loop ret i32 %i } -; CHECK: @linear_setlt +; CHECK-LABEL: @linear_setlt( ; CHECK: ret i32 100 define i32 @linear_setlt() { @@ -73,7 +73,7 @@ loopexit: ; preds = %loop ret i32 %i } -; CHECK: @quadratic_setlt +; CHECK-LABEL: @quadratic_setlt( ; CHECK: ret i32 34 define i32 @quadratic_setlt() { @@ -91,7 +91,7 @@ loopexit: ; preds = %loop ret i32 %i } -; CHECK: @chained +; CHECK-LABEL: @chained( ; CHECK: ret i32 200 define i32 @chained() { @@ -117,7 +117,7 @@ loopexit2: ; preds = %loop2 ret i32 %j } -; CHECK: @chained4 +; CHECK-LABEL: @chained4( ; CHECK: ret i32 400 define i32 @chained4() { diff --git a/test/Transforms/IndVarSimplify/udiv-invariant-but-traps.ll b/test/Transforms/IndVarSimplify/udiv-invariant-but-traps.ll index b2d2629eb34..ef38f5d6a91 100644 --- a/test/Transforms/IndVarSimplify/udiv-invariant-but-traps.ll +++ b/test/Transforms/IndVarSimplify/udiv-invariant-but-traps.ll @@ -27,6 +27,6 @@ bb14: ret i32 0 } -; CHECK: @foo +; CHECK-LABEL: @foo( ; CHECK: bb8: ; CHECK: udiv diff --git a/test/Transforms/IndVarSimplify/udiv.ll b/test/Transforms/IndVarSimplify/udiv.ll index 8260093d1c3..aee455d08c8 100644 --- a/test/Transforms/IndVarSimplify/udiv.ll +++ b/test/Transforms/IndVarSimplify/udiv.ll @@ -8,7 +8,7 @@ target datalayout = "e-p:64:64:64-i1:8:8-i8:8:8-i16:16:16-i32:32:32-i64:64:64-f3 ; Indvars shouldn't emit a udiv here, because there's no udiv in the ; original code. This comes from SingleSource/Benchmarks/Shootout/sieve.c. -; CHECK: @main +; CHECK-LABEL: @main( ; CHECK-NOT: div define i32 @main(i32 %argc, i8** nocapture %argv) nounwind { @@ -130,7 +130,7 @@ declare i32 @printf(i8* nocapture, ...) nounwind ; IndVars shouldn't be afraid to emit a udiv here, since there's a udiv in ; the original code. -; CHECK: @foo +; CHECK-LABEL: @foo( ; CHECK: for.body.preheader: ; CHECK-NEXT: udiv diff --git a/test/Transforms/IndVarSimplify/ult-sub-to-eq.ll b/test/Transforms/IndVarSimplify/ult-sub-to-eq.ll index c58a3af62fc..a421003aa30 100644 --- a/test/Transforms/IndVarSimplify/ult-sub-to-eq.ll +++ b/test/Transforms/IndVarSimplify/ult-sub-to-eq.ll @@ -26,7 +26,7 @@ for.body: ; preds = %entry, %for.body for.end: ; preds = %for.body, %entry ret void -; CHECK: @test1 +; CHECK-LABEL: @test1( ; First check that we move the sub into the preheader, it doesn't have to be ; executed if %cmp4 == false diff --git a/test/Transforms/Inline/alloca-bonus.ll b/test/Transforms/Inline/alloca-bonus.ll index d04d54e3a53..3c5052b883b 100644 --- a/test/Transforms/Inline/alloca-bonus.ll +++ b/test/Transforms/Inline/alloca-bonus.ll @@ -7,7 +7,7 @@ declare void @llvm.lifetime.start(i64 %size, i8* nocapture %ptr) @glbl = external global i32 define void @outer1() { -; CHECK: @outer1 +; CHECK-LABEL: @outer1( ; CHECK-NOT: call void @inner1 %ptr = alloca i32 call void @inner1(i32* %ptr) @@ -26,7 +26,7 @@ define void @inner1(i32 *%ptr) { } define void @outer2() { -; CHECK: @outer2 +; CHECK-LABEL: @outer2( ; CHECK: call void @inner2 %ptr = alloca i32 call void @inner2(i32* %ptr) @@ -46,7 +46,7 @@ define void @inner2(i32 *%ptr) { } define void @outer3() { -; CHECK: @outer3 +; CHECK-LABEL: @outer3( ; CHECK-NOT: call void @inner3 %ptr = alloca i32 call void @inner3(i32* %ptr, i1 undef) @@ -85,7 +85,7 @@ bb.false: } define void @outer4(i32 %A) { -; CHECK: @outer4 +; CHECK-LABEL: @outer4( ; CHECK-NOT: call void @inner4 %ptr = alloca i32 call void @inner4(i32* %ptr, i32 %A) @@ -126,7 +126,7 @@ bb.false: } define void @outer5() { -; CHECK: @outer5 +; CHECK-LABEL: @outer5( ; CHECK-NOT: call void @inner5 %ptr = alloca i32 call void @inner5(i1 false, i32* %ptr) diff --git a/test/Transforms/Inline/always-inline.ll b/test/Transforms/Inline/always-inline.ll index c918bc9d5db..a8703b89877 100644 --- a/test/Transforms/Inline/always-inline.ll +++ b/test/Transforms/Inline/always-inline.ll @@ -8,7 +8,7 @@ define i32 @inner1() alwaysinline { ret i32 1 } define i32 @outer1() { -; CHECK: @outer1 +; CHECK-LABEL: @outer1( ; CHECK-NOT: call ; CHECK: ret @@ -17,7 +17,7 @@ define i32 @outer1() { } ; The always inliner can't DCE internal functions. PR2945 -; CHECK: @pr2945 +; CHECK-LABEL: @pr2945( define internal i32 @pr2945() nounwind { ret i32 0 } @@ -31,7 +31,7 @@ define void @outer2(i32 %N) { ; a function with a dynamic alloca into one without a dynamic alloca. ; rdar://6655932 ; -; CHECK: @outer2 +; CHECK-LABEL: @outer2( ; CHECK-NOT: call void @inner2 ; CHECK-NOT: call void @inner2 ; CHECK: ret void @@ -51,7 +51,7 @@ entry: } define i32 @outer3() { entry: -; CHECK: @outer3 +; CHECK-LABEL: @outer3( ; CHECK-NOT: call i32 @a ; CHECK: ret @@ -69,7 +69,7 @@ entry: define i32 @outer4() { entry: -; CHECK: @outer4 +; CHECK-LABEL: @outer4( ; CHECK: call i32 @b() ; CHECK: ret @@ -89,7 +89,7 @@ two: ret i32 44 } define i32 @outer5(i32 %x) { -; CHECK: @outer5 +; CHECK-LABEL: @outer5( ; CHECK: call i32 @inner5 ; CHECK: ret @@ -113,7 +113,7 @@ return: ret void } define void @outer6() { -; CHECK: @outer6 +; CHECK-LABEL: @outer6( ; CHECK: call void @inner6(i32 42) ; CHECK: ret diff --git a/test/Transforms/Inline/basictest.ll b/test/Transforms/Inline/basictest.ll index 39e25cb5d62..93bf9dddee2 100644 --- a/test/Transforms/Inline/basictest.ll +++ b/test/Transforms/Inline/basictest.ll @@ -9,7 +9,7 @@ define i32 @test1(i32 %W) { %X = call i32 @test1f(i32 7) %Y = add i32 %X, %W ret i32 %Y -; CHECK: @test1( +; CHECK-LABEL: @test1( ; CHECK-NEXT: %Y = add i32 7, %W ; CHECK-NEXT: ret i32 %Y } @@ -20,7 +20,7 @@ define i32 @test1(i32 %W) { %T = type { i32, i32 } -; CHECK-NOT: @test2f +; CHECK-NOT-LABEL: @test2f( define internal %T* @test2f(i1 %cond, %T* %P) { br i1 %cond, label %T, label %F @@ -41,7 +41,7 @@ define i32 @test2(i1 %cond) { %D = load i32* %C ret i32 %D -; CHECK: @test2( +; CHECK-LABEL: @test2( ; CHECK-NOT: = alloca ; CHECK: ret i32 } @@ -75,7 +75,7 @@ define i32 @test3() { ; ; The call to @h *can* be inlined. -; CHECK: @test +; CHECK-LABEL: @test( define i32 @test() { ; CHECK: call i32 @f() %a = call i32 @f() diff --git a/test/Transforms/Inline/devirtualize-2.ll b/test/Transforms/Inline/devirtualize-2.ll index 02ff7679148..b7eb1be19db 100644 --- a/test/Transforms/Inline/devirtualize-2.ll +++ b/test/Transforms/Inline/devirtualize-2.ll @@ -40,5 +40,5 @@ define i32 @test2(i8* %this) ssp align 2 { ret i32 %X } -; CHECK: @test2 +; CHECK-LABEL: @test2( ; CHECK-NEXT: ret i32 41 diff --git a/test/Transforms/Inline/devirtualize.ll b/test/Transforms/Inline/devirtualize.ll index d46154ef6a9..89482941267 100644 --- a/test/Transforms/Inline/devirtualize.ll +++ b/test/Transforms/Inline/devirtualize.ll @@ -14,7 +14,7 @@ entry: %X = add i32 %call, 4 ret i32 %X -; CHECK: @foo +; CHECK-LABEL: @foo( ; CHECK-NEXT: entry: ; CHECK-NEXT: store ; CHECK-NEXT: store diff --git a/test/Transforms/Inline/dynamic_alloca_test.ll b/test/Transforms/Inline/dynamic_alloca_test.ll index 15a5c66815d..1c17c7cd974 100644 --- a/test/Transforms/Inline/dynamic_alloca_test.ll +++ b/test/Transforms/Inline/dynamic_alloca_test.ll @@ -19,7 +19,7 @@ define internal void @callee(i32 %N) { } define void @foo(i32 %N) { -; CHECK: @foo +; CHECK-LABEL: @foo( ; CHECK: alloca i32, i32 %{{.*}} ; CHECK: call i8* @llvm.stacksave() ; CHECK: alloca i32, i32 %{{.*}} diff --git a/test/Transforms/Inline/gvn-inline-iteration.ll b/test/Transforms/Inline/gvn-inline-iteration.ll index 526ed79e7b4..7916a13df99 100644 --- a/test/Transforms/Inline/gvn-inline-iteration.ll +++ b/test/Transforms/Inline/gvn-inline-iteration.ll @@ -12,9 +12,9 @@ entry: %call = tail call i32 %tmp3() nounwind ; [#uses=1] ret i32 %call } -; CHECK: @foo +; CHECK-LABEL: @foo( ; CHECK: ret i32 7 -; CHECK: @bar +; CHECK-LABEL: @bar( ; CHECK: ret i32 7 define internal i32 @bar() nounwind readnone ssp { diff --git a/test/Transforms/Inline/inline-byval-bonus.ll b/test/Transforms/Inline/inline-byval-bonus.ll index f3ed819a7f3..052a5f12a19 100644 --- a/test/Transforms/Inline/inline-byval-bonus.ll +++ b/test/Transforms/Inline/inline-byval-bonus.ll @@ -21,7 +21,7 @@ define i32 @caller(%struct.sphere* %i) { %call = call i32 @ray_sphere(%struct.sphere* %i, %struct.ray* byval align 8 %shadow_ray, %struct.spoint* null) ret i32 %call -; CHECK: @caller +; CHECK-LABEL: @caller( ; CHECK-NOT: call i32 @ray_sphere ; CHECK: ret i32 } diff --git a/test/Transforms/Inline/inline_cleanup.ll b/test/Transforms/Inline/inline_cleanup.ll index 3898aa7044a..c2808dece01 100644 --- a/test/Transforms/Inline/inline_cleanup.ll +++ b/test/Transforms/Inline/inline_cleanup.ll @@ -52,7 +52,7 @@ UnifiedReturnBlock: ; preds = %cond_next13 declare void @ext(i32*) define void @test() { -; CHECK: @test +; CHECK-LABEL: @test( ; CHECK-NOT: ret ; ; FIXME: This should be a CHECK-NOT, but currently we have a bug that causes us @@ -202,7 +202,7 @@ for.cond12.for.inc26_crit_edge.2: } define void @crasher_outer() { -; CHECK: @crasher_outer +; CHECK-LABEL: @crasher_outer( ; CHECK-NOT: call ; CHECK: ret void ; CHECK-NOT: ret diff --git a/test/Transforms/Inline/inline_constprop.ll b/test/Transforms/Inline/inline_constprop.ll index 77bc3784acb..30dd158295b 100644 --- a/test/Transforms/Inline/inline_constprop.ll +++ b/test/Transforms/Inline/inline_constprop.ll @@ -21,7 +21,7 @@ define i32 @caller2() { ; inline and be cheap. We should eventually do that and lower the threshold here ; to 1. ; -; CHECK: @caller2 +; CHECK-LABEL: @caller2( ; CHECK-NOT: call void @callee2 ; CHECK: ret @@ -61,7 +61,7 @@ define i32 @caller3() { ; it doesn't count toward the inline cost when constant-prop proves those paths ; dead. ; -; CHECK: @caller3 +; CHECK-LABEL: @caller3( ; CHECK-NOT: call ; CHECK: ret i32 6 @@ -119,7 +119,7 @@ define i8 @caller4(i8 %z) { ; as they are used heavily in standard library code and generic C++ code where ; the arguments are oftent constant but complete generality is required. ; -; CHECK: @caller4 +; CHECK-LABEL: @caller4( ; CHECK-NOT: call ; CHECK: ret i8 -1 @@ -153,7 +153,7 @@ define i64 @caller5(i64 %y) { ; Check that we can round trip constants through various kinds of casts etc w/o ; losing track of the constant prop in the inline cost analysis. ; -; CHECK: @caller5 +; CHECK-LABEL: @caller5( ; CHECK-NOT: call ; CHECK: ret i64 -1 diff --git a/test/Transforms/Inline/inline_minisize.ll b/test/Transforms/Inline/inline_minisize.ll index 3dddbcf3303..b9aad608339 100644 --- a/test/Transforms/Inline/inline_minisize.ll +++ b/test/Transforms/Inline/inline_minisize.ll @@ -200,7 +200,7 @@ for.end21: ; preds = %for.cond14 define i32 @fct3(i32 %c) nounwind uwtable ssp { entry: - ;CHECK: @fct3 + ;CHECK-LABEL: @fct3( ;CHECK: call i32 @fct1 ; The inline keyword gives a sufficient benefits to inline fct2 ;CHECK-NOT: call i32 @fct2 @@ -216,7 +216,7 @@ entry: define i32 @fct4(i32 %c) minsize nounwind uwtable ssp { entry: - ;CHECK: @fct4 + ;CHECK-LABEL: @fct4( ;CHECK: call i32 @fct1 ; With Oz (minsize attribute), the benefit of inlining fct2 ; is the same as fct1, thus no inlining for fct2 diff --git a/test/Transforms/Inline/lifetime-no-datalayout.ll b/test/Transforms/Inline/lifetime-no-datalayout.ll index f4ffef3850f..5abb77f2c3f 100644 --- a/test/Transforms/Inline/lifetime-no-datalayout.ll +++ b/test/Transforms/Inline/lifetime-no-datalayout.ll @@ -10,7 +10,7 @@ define void @helper() { ; Size in llvm.lifetime.X should be -1 (unknown). define void @test() { -; CHECK: @test +; CHECK-LABEL: @test( ; CHECK-NOT: lifetime ; CHECK: llvm.lifetime.start(i64 -1 ; CHECK-NOT: lifetime diff --git a/test/Transforms/Inline/lifetime.ll b/test/Transforms/Inline/lifetime.ll index fc73385295e..12c433b9e62 100644 --- a/test/Transforms/Inline/lifetime.ll +++ b/test/Transforms/Inline/lifetime.ll @@ -14,7 +14,7 @@ define void @helper_both_markers() { } define void @test_both_markers() { -; CHECK: @test_both_markers +; CHECK-LABEL: @test_both_markers( ; CHECK: llvm.lifetime.start(i64 2 ; CHECK-NEXT: llvm.lifetime.end(i64 2 call void @helper_both_markers() @@ -38,7 +38,7 @@ define void @helper_no_markers() { ;; We can't use CHECK-NEXT because there's an extra call void @use in between. ;; Instead, we use CHECK-NOT to verify that there are no other lifetime calls. define void @test_no_marker() { -; CHECK: @test_no_marker +; CHECK-LABEL: @test_no_marker( ; CHECK-NOT: lifetime ; CHECK: llvm.lifetime.start(i64 1 ; CHECK-NOT: lifetime @@ -64,7 +64,7 @@ define void @helper_two_casts() { } define void @test_two_casts() { -; CHECK: @test_two_casts +; CHECK-LABEL: @test_two_casts( ; CHECK-NOT: lifetime ; CHECK: llvm.lifetime.start(i64 4 ; CHECK-NOT: lifetime @@ -88,7 +88,7 @@ define void @helper_arrays_alloca() { } define void @test_arrays_alloca() { -; CHECK: @test_arrays_alloca +; CHECK-LABEL: @test_arrays_alloca( ; CHECK-NOT: lifetime ; CHECK: llvm.lifetime.start(i64 40, ; CHECK-NOT: lifetime diff --git a/test/Transforms/Inline/nested-inline.ll b/test/Transforms/Inline/nested-inline.ll index 12926671722..9c23774b702 100644 --- a/test/Transforms/Inline/nested-inline.ll +++ b/test/Transforms/Inline/nested-inline.ll @@ -6,7 +6,7 @@ define fastcc void @foo(i32 %X) { entry: -; CHECK: @foo +; CHECK-LABEL: @foo( %ALL = alloca i32, align 4 ; [#uses=1] %tmp1 = and i32 %X, 1 ; [#uses=1] %tmp1.upgrd.1 = icmp eq i32 %tmp1, 0 ; [#uses=1] @@ -47,7 +47,7 @@ UnifiedReturnBlock: ; preds = %cond_next13 ret void } -; CHECK-NOT: @bar +; CHECK-NOT-LABEL: @bar( define internal fastcc void @bar(i32 %X) { entry: %ALL = alloca i32, align 4 ; [#uses=1] @@ -101,7 +101,7 @@ declare void @ext(i32*) define void @test(i32 %X) { entry: ; CHECK: test -; CHECK-NOT: @bar +; CHECK-NOT-LABEL: @bar( tail call fastcc void @bar( i32 %X ) tail call fastcc void @bar( i32 %X ) tail call fastcc void @bar2( i32 %X ) diff --git a/test/Transforms/Inline/noinline-recursive-fn.ll b/test/Transforms/Inline/noinline-recursive-fn.ll index 5520093ee45..2e581a7dbc4 100644 --- a/test/Transforms/Inline/noinline-recursive-fn.ll +++ b/test/Transforms/Inline/noinline-recursive-fn.ll @@ -25,7 +25,7 @@ return: ; preds = %entry } -;; CHECK: @bonk +;; CHECK-LABEL: @bonk( ;; CHECK: call void @foo(i32 42) define void @bonk() nounwind ssp { entry: @@ -62,7 +62,7 @@ return: ; preds = %entry } -; CHECK: @top_level +; CHECK-LABEL: @top_level( ; CHECK: call void @f2(i32 122 ; Here we inline one instance of the cycle, but we don't want to completely ; unroll it. @@ -100,7 +100,7 @@ one.else: } define i32 @fib_caller() { -; CHECK: @fib_caller +; CHECK-LABEL: @fib_caller( ; CHECK-NOT: call ; CHECK: ret %f1 = call i32 @fib(i32 0) diff --git a/test/Transforms/Inline/ptr-diff.ll b/test/Transforms/Inline/ptr-diff.ll index 60fc3e2a332..01b42daddfa 100644 --- a/test/Transforms/Inline/ptr-diff.ll +++ b/test/Transforms/Inline/ptr-diff.ll @@ -3,7 +3,7 @@ target datalayout = "p:32:32" define i32 @outer1() { -; CHECK: @outer1 +; CHECK-LABEL: @outer1( ; CHECK-NOT: call ; CHECK: ret i32 @@ -32,7 +32,7 @@ else: define i32 @outer2(i32* %ptr) { ; Test that an inbounds GEP disables this -- it isn't safe in general as ; wrapping changes the behavior of lessthan and greaterthan comparisions. -; CHECK: @outer2 +; CHECK-LABEL: @outer2( ; CHECK: call i32 @inner2 ; CHECK: ret i32 diff --git a/test/Transforms/InstCombine/2008-11-20-DivMulRem.ll b/test/Transforms/InstCombine/2008-11-20-DivMulRem.ll index 43af190abce..0c0e55a0b2d 100644 --- a/test/Transforms/InstCombine/2008-11-20-DivMulRem.ll +++ b/test/Transforms/InstCombine/2008-11-20-DivMulRem.ll @@ -2,7 +2,7 @@ ; PR3103 define i8 @test1(i8 %x, i8 %y) { -; CHECK: @test1 +; CHECK-LABEL: @test1( %A = udiv i8 %x, %y ; CHECK-NEXT: urem %B = mul i8 %A, %y @@ -12,7 +12,7 @@ define i8 @test1(i8 %x, i8 %y) { } define i8 @test2(i8 %x, i8 %y) { -; CHECK: @test2 +; CHECK-LABEL: @test2( %A = sdiv i8 %x, %y ; CHECK-NEXT: srem %B = mul i8 %A, %y @@ -22,7 +22,7 @@ define i8 @test2(i8 %x, i8 %y) { } define i8 @test3(i8 %x, i8 %y) { -; CHECK: @test3 +; CHECK-LABEL: @test3( %A = udiv i8 %x, %y ; CHECK-NEXT: urem %B = mul i8 %A, %y @@ -33,7 +33,7 @@ define i8 @test3(i8 %x, i8 %y) { } define i8 @test4(i8 %x) { -; CHECK: @test4 +; CHECK-LABEL: @test4( %A = udiv i8 %x, 3 ; CHECK-NEXT: urem %B = mul i8 %A, -3 @@ -45,7 +45,7 @@ define i8 @test4(i8 %x) { } define i32 @test5(i32 %x, i32 %y) { -; CHECK: @test5 +; CHECK-LABEL: @test5( ; (((X / Y) * Y) / Y) -> X / Y %div = sdiv i32 %x, %y ; CHECK-NEXT: sdiv @@ -56,7 +56,7 @@ define i32 @test5(i32 %x, i32 %y) { } define i32 @test6(i32 %x, i32 %y) { -; CHECK: @test6 +; CHECK-LABEL: @test6( ; (((X / Y) * Y) / Y) -> X / Y %div = udiv i32 %x, %y ; CHECK-NEXT: udiv diff --git a/test/Transforms/InstCombine/2010-03-03-ExtElim.ll b/test/Transforms/InstCombine/2010-03-03-ExtElim.ll index 4b1930584c5..b1384ec0020 100644 --- a/test/Transforms/InstCombine/2010-03-03-ExtElim.ll +++ b/test/Transforms/InstCombine/2010-03-03-ExtElim.ll @@ -7,7 +7,7 @@ target triple = "i386-unknown-linux-gnu" @g_177 = constant i32** bitcast (i8* getelementptr (i8* bitcast ([2 x i32*]* @g_92 to i8*), i64 4) to i32**), align 4 ; [#uses=1] define i1 @PR6486() nounwind { -; CHECK: @PR6486 +; CHECK-LABEL: @PR6486( %tmp = load i32*** @g_177 ; [#uses=1] %cmp = icmp ne i32** null, %tmp ; [#uses=1] %conv = zext i1 %cmp to i32 ; [#uses=1] @@ -20,13 +20,13 @@ define i1 @PR6486() nounwind { @a = common global [1 x i32] zeroinitializer, align 4 define i1 @PR16462_1() nounwind { -; CHECK: @PR16462_1 +; CHECK-LABEL: @PR16462_1( ret i1 icmp sgt (i32 sext (i16 trunc (i32 select (i1 icmp eq (i32* getelementptr inbounds ([1 x i32]* @a, i32 0, i32 0), i32* @d), i32 0, i32 1) to i16) to i32), i32 65535) ; CHECK: ret i1 icmp sgt (i32 sext (i16 trunc (i32 select (i1 icmp eq (i32* getelementptr inbounds ([1 x i32]* @a, i32 0, i32 0), i32* @d), i32 0, i32 1) to i16) to i32), i32 65535) } define i1 @PR16462_2() nounwind { -; CHECK: @PR16462_2 +; CHECK-LABEL: @PR16462_2( ret i1 icmp sgt (i32 sext (i16 trunc (i32 select (i1 icmp eq (i32* getelementptr inbounds ([1 x i32]* @a, i32 0, i32 0), i32* @d), i32 0, i32 1) to i16) to i32), i32 42) ; CHECK: ret i1 icmp sgt (i16 trunc (i32 select (i1 icmp eq (i32* getelementptr inbounds ([1 x i32]* @a, i32 0, i32 0), i32* @d), i32 0, i32 1) to i16), i16 42) } diff --git a/test/Transforms/InstCombine/2010-11-01-lshr-mask.ll b/test/Transforms/InstCombine/2010-11-01-lshr-mask.ll index 80016219791..1549c0d0f46 100644 --- a/test/Transforms/InstCombine/2010-11-01-lshr-mask.ll +++ b/test/Transforms/InstCombine/2010-11-01-lshr-mask.ll @@ -1,7 +1,7 @@ ; RUN: opt -instcombine -S < %s | FileCheck %s ; -; CHECK: @main +; CHECK-LABEL: @main( define i32 @main(i32 %argc) nounwind ssp { entry: %tmp3151 = trunc i32 %argc to i8 @@ -23,7 +23,7 @@ entry: } ; rdar://8739316 -; CHECK: @foo +; CHECK-LABEL: @foo( define i8 @foo(i8 %arg, i8 %arg1) nounwind { bb: %tmp = shl i8 %arg, 7 diff --git a/test/Transforms/InstCombine/2010-11-21-SizeZeroTypeGEP.ll b/test/Transforms/InstCombine/2010-11-21-SizeZeroTypeGEP.ll index 720365c4d6b..80983ef2709 100644 --- a/test/Transforms/InstCombine/2010-11-21-SizeZeroTypeGEP.ll +++ b/test/Transforms/InstCombine/2010-11-21-SizeZeroTypeGEP.ll @@ -3,14 +3,14 @@ target 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" define {}* @foo({}* %x, i32 %n) { -; CHECK: @foo +; CHECK-LABEL: @foo( ; CHECK-NOT: getelementptr %p = getelementptr {}* %x, i32 %n ret {}* %p } define i8* @bar(i64 %n, {{}, [0 x {[0 x i8]}]}* %p) { -; CHECK: @bar +; CHECK-LABEL: @bar( %g = getelementptr {{}, [0 x {[0 x i8]}]}* %p, i64 %n, i32 1, i64 %n, i32 0, i64 %n ; CHECK: %p, i64 0, i32 1, i64 0, i32 0, i64 %n ret i8* %g diff --git a/test/Transforms/InstCombine/2010-11-23-Distributed.ll b/test/Transforms/InstCombine/2010-11-23-Distributed.ll index 4f8e8dc713b..20bfed87798 100644 --- a/test/Transforms/InstCombine/2010-11-23-Distributed.ll +++ b/test/Transforms/InstCombine/2010-11-23-Distributed.ll @@ -1,6 +1,6 @@ ; RUN: opt < %s -instcombine -S | FileCheck %s define i32 @foo(i32 %x, i32 %y) { -; CHECK: @foo +; CHECK-LABEL: @foo( %add = add nsw i32 %y, %x %mul = mul nsw i32 %add, %y %square = mul nsw i32 %y, %y @@ -11,7 +11,7 @@ define i32 @foo(i32 %x, i32 %y) { } define i1 @bar(i64 %x, i64 %y) { -; CHECK: @bar +; CHECK-LABEL: @bar( %a = and i64 %y, %x ; CHECK: and ; CHECK-NOT: and diff --git a/test/Transforms/InstCombine/2012-03-10-InstCombine.ll b/test/Transforms/InstCombine/2012-03-10-InstCombine.ll index 58ccf12e6cf..d1860bccd75 100644 --- a/test/Transforms/InstCombine/2012-03-10-InstCombine.ll +++ b/test/Transforms/InstCombine/2012-03-10-InstCombine.ll @@ -2,7 +2,7 @@ ; Derived from gcc.c-torture/execute/frame-address.c -; CHECK: @func +; CHECK-LABEL: @func( ; CHECK: return: ; CHECK-NOT: ret i32 0 ; CHECK: ret i32 %retval diff --git a/test/Transforms/InstCombine/2012-04-24-vselect.ll b/test/Transforms/InstCombine/2012-04-24-vselect.ll index 8d2de2b2431..211d401a3bc 100644 --- a/test/Transforms/InstCombine/2012-04-24-vselect.ll +++ b/test/Transforms/InstCombine/2012-04-24-vselect.ll @@ -1,6 +1,6 @@ ; RUN: opt -instcombine -S < %s | FileCheck %s -; CHECK: @foo +; CHECK-LABEL: @foo( ; CHECK: define <8 x i32> @foo() nounwind { diff --git a/test/Transforms/InstCombine/2012-05-28-select-hang.ll b/test/Transforms/InstCombine/2012-05-28-select-hang.ll index c580bacb0dc..db1dbd5b6e2 100644 --- a/test/Transforms/InstCombine/2012-05-28-select-hang.ll +++ b/test/Transforms/InstCombine/2012-05-28-select-hang.ll @@ -34,6 +34,6 @@ land.end: ; preds = %land.rhs, %entry store i8 %conv9, i8* @a, align 1 ret void -; CHECK: @func +; CHECK-LABEL: @func( ; CHECK-NOT: select } diff --git a/test/Transforms/InstCombine/2012-08-28-udiv_ashl.ll b/test/Transforms/InstCombine/2012-08-28-udiv_ashl.ll index 4efaf8c1725..0374bd52afd 100644 --- a/test/Transforms/InstCombine/2012-08-28-udiv_ashl.ll +++ b/test/Transforms/InstCombine/2012-08-28-udiv_ashl.ll @@ -5,7 +5,7 @@ target 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-S128" target triple = "x86_64-apple-macosx10.8.0" -; CHECK: @udiv400 +; CHECK-LABEL: @udiv400( ; CHECK: udiv i32 %x, 400 ; CHECK: ret define i32 @udiv400(i32 %x) { @@ -16,7 +16,7 @@ entry: } -; CHECK: @udiv400_no +; CHECK-LABEL: @udiv400_no( ; CHECK: ashr ; CHECK: div ; CHECK: ret @@ -27,7 +27,7 @@ entry: ret i32 %div1 } -; CHECK: @sdiv400_yes +; CHECK-LABEL: @sdiv400_yes( ; CHECK: udiv i32 %x, 400 ; CHECK: ret define i32 @sdiv400_yes(i32 %x) { @@ -41,7 +41,7 @@ entry: } -; CHECK: @udiv_i80 +; CHECK-LABEL: @udiv_i80( ; CHECK: udiv i80 %x, 400 ; CHECK: ret define i80 @udiv_i80(i80 %x) { diff --git a/test/Transforms/InstCombine/2012-09-17-ZeroSizedAlloca.ll b/test/Transforms/InstCombine/2012-09-17-ZeroSizedAlloca.ll index ba025e92b01..7015725feb1 100644 --- a/test/Transforms/InstCombine/2012-09-17-ZeroSizedAlloca.ll +++ b/test/Transforms/InstCombine/2012-09-17-ZeroSizedAlloca.ll @@ -9,7 +9,7 @@ target 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-S128" target triple = "x86_64-apple-macosx10.8.0" -; CHECK: @f +; CHECK-LABEL: @f( ; CHECK-NEXT: alloca [0 x i8], align 1024 ; CHECK-NOT: alloca ; CHECK: ret void diff --git a/test/Transforms/InstCombine/2012-09-24-MemcpyFromGlobalCrash.ll b/test/Transforms/InstCombine/2012-09-24-MemcpyFromGlobalCrash.ll index 4cd60b42fbe..35b62850c62 100644 --- a/test/Transforms/InstCombine/2012-09-24-MemcpyFromGlobalCrash.ll +++ b/test/Transforms/InstCombine/2012-09-24-MemcpyFromGlobalCrash.ll @@ -8,7 +8,7 @@ declare void @bar(i8*) declare void @llvm.memcpy.p0i8.p0i8.i64(i8* nocapture, i8* nocapture, i64, i32, i1) nounwind define void @test() { -; CHECK: @test +; CHECK-LABEL: @test( ; CHECK: llvm.memcpy ; CHECK: ret void %A = alloca [100 x i8] diff --git a/test/Transforms/InstCombine/2013-03-05-Combine-BitcastTy-Into-Alloca.ll b/test/Transforms/InstCombine/2013-03-05-Combine-BitcastTy-Into-Alloca.ll index b20c3a07c0a..789e3172e7c 100644 --- a/test/Transforms/InstCombine/2013-03-05-Combine-BitcastTy-Into-Alloca.ll +++ b/test/Transforms/InstCombine/2013-03-05-Combine-BitcastTy-Into-Alloca.ll @@ -10,7 +10,7 @@ target triple = "x86_64-apple-macosx10.9.0" ; allocation of an i96 because of the bitcast to create %2. That's not valid, ; as the other 32 bits of the structure still feed into the return value define { i64, i64 } @function(i32 %x, i32 %y, i32 %z) nounwind { -; CHECK: @function +; CHECK-LABEL: @function( ; CHECK-NEXT: entry: ; CHECK-NEXT: %retval = alloca %struct._my_struct, align 8 ; CHECK-NOT: bitcast i96* %retval to %struct._my_struct* diff --git a/test/Transforms/InstCombine/ExtractCast.ll b/test/Transforms/InstCombine/ExtractCast.ll index 5ebbefd97b3..9a8872f2fb1 100644 --- a/test/Transforms/InstCombine/ExtractCast.ll +++ b/test/Transforms/InstCombine/ExtractCast.ll @@ -1,6 +1,6 @@ ; RUN: opt < %s -instcombine -S -o - | FileCheck %s -; CHECK: @a +; CHECK-LABEL: @a( define i32 @a(<4 x i64> %I) { entry: ; CHECK-NOT: trunc <4 x i64> @@ -13,7 +13,7 @@ entry: } -; CHECK: @b +; CHECK-LABEL: @b( define i32 @b(<4 x float> %I) { entry: ; CHECK-NOT: fptosi <4 x float> diff --git a/test/Transforms/InstCombine/LandingPadClauses.ll b/test/Transforms/InstCombine/LandingPadClauses.ll index de3b2d34fb9..10af4bcadf6 100644 --- a/test/Transforms/InstCombine/LandingPadClauses.ll +++ b/test/Transforms/InstCombine/LandingPadClauses.ll @@ -11,7 +11,7 @@ declare i32 @__objc_personality_v0(i32, i64, i8*, i8*) declare void @bar() define void @foo_generic() { -; CHECK: @foo_generic +; CHECK-LABEL: @foo_generic( invoke void @bar() to label %cont.a unwind label %lpad.a cont.a: @@ -131,7 +131,7 @@ lpad.i: } define void @foo_cxx() { -; CHECK: @foo_cxx +; CHECK-LABEL: @foo_cxx( invoke void @bar() to label %cont.a unwind label %lpad.a cont.a: @@ -182,7 +182,7 @@ lpad.d: } define void @foo_objc() { -; CHECK: @foo_objc +; CHECK-LABEL: @foo_objc( invoke void @bar() to label %cont.a unwind label %lpad.a cont.a: diff --git a/test/Transforms/InstCombine/abs-1.ll b/test/Transforms/InstCombine/abs-1.ll index 807f238755b..2c223edcfa7 100644 --- a/test/Transforms/InstCombine/abs-1.ll +++ b/test/Transforms/InstCombine/abs-1.ll @@ -11,7 +11,7 @@ declare i64 @llabs(i64) ; Check abs(x) -> x >s -1 ? x : -x. define i32 @test_simplify1(i32 %x) { -; CHECK: @test_simplify1 +; CHECK-LABEL: @test_simplify1( %ret = call i32 @abs(i32 %x) ; CHECK-NEXT: [[ISPOS:%[a-z0-9]+]] = icmp sgt i32 %x, -1 ; CHECK-NEXT: [[NEG:%[a-z0-9]+]] = sub i32 0, %x @@ -21,7 +21,7 @@ define i32 @test_simplify1(i32 %x) { } define i64 @test_simplify2(i64 %x) { -; CHECK: @test_simplify2 +; CHECK-LABEL: @test_simplify2( %ret = call i64 @labs(i64 %x) ; CHECK-NEXT: [[ISPOS:%[a-z0-9]+]] = icmp sgt i64 %x, -1 ; CHECK-NEXT: [[NEG:%[a-z0-9]+]] = sub i64 0, %x @@ -31,7 +31,7 @@ define i64 @test_simplify2(i64 %x) { } define i64 @test_simplify3(i64 %x) { -; CHECK: @test_simplify3 +; CHECK-LABEL: @test_simplify3( %ret = call i64 @llabs(i64 %x) ; CHECK-NEXT: [[ISPOS:%[a-z0-9]+]] = icmp sgt i64 %x, -1 ; CHECK-NEXT: [[NEG:%[a-z0-9]+]] = sub i64 0, %x diff --git a/test/Transforms/InstCombine/add2.ll b/test/Transforms/InstCombine/add2.ll index c5109c52885..0964bc00d1c 100644 --- a/test/Transforms/InstCombine/add2.ll +++ b/test/Transforms/InstCombine/add2.ll @@ -6,7 +6,7 @@ define i64 @test1(i64 %A, i32 %B) { %tmp5 = add i64 %tmp3, %A %tmp6 = and i64 %tmp5, 123 ret i64 %tmp6 -; CHECK: @test1 +; CHECK-LABEL: @test1( ; CHECK-NEXT: and i64 %A, 123 ; CHECK-NEXT: ret i64 } @@ -16,7 +16,7 @@ define i32 @test2(i32 %A) { %C = and i32 %A, 32 %F = add i32 %B, %C ret i32 %F -; CHECK: @test2 +; CHECK-LABEL: @test2( ; CHECK-NEXT: and i32 %A, 39 ; CHECK-NEXT: ret i32 } @@ -26,7 +26,7 @@ define i32 @test3(i32 %A) { %C = lshr i32 %A, 30 %F = add i32 %B, %C ret i32 %F -; CHECK: @test3 +; CHECK-LABEL: @test3( ; CHECK-NEXT: and ; CHECK-NEXT: lshr ; CHECK-NEXT: or i32 %B, %C @@ -36,7 +36,7 @@ define i32 @test3(i32 %A) { define i32 @test4(i32 %A) { %B = add nuw i32 %A, %A ret i32 %B -; CHECK: @test4 +; CHECK-LABEL: @test4( ; CHECK-NEXT: %B = shl nuw i32 %A, 1 ; CHECK-NEXT: ret i32 %B } diff --git a/test/Transforms/InstCombine/add4.ll b/test/Transforms/InstCombine/add4.ll index 1047e162b57..898ba962a44 100644 --- a/test/Transforms/InstCombine/add4.ll +++ b/test/Transforms/InstCombine/add4.ll @@ -12,7 +12,7 @@ EntryBlock: %s2 = select i1 %C, float %A, float 0.000000e+00 %sum = fadd fast float %s1, %s2 ret float %sum -; CHECK: @test1 +; CHECK-LABEL: @test1( ; CHECK: select i1 %C, float %A, float %B } @@ -25,7 +25,7 @@ EntryBlock: %p2 = fmul fast float %B, %cf %s1 = fadd fast float %p2, %p1 ret float %s1 -; CHECK: @test2 +; CHECK-LABEL: @test2( ; CHECK: select i1 %C, float %B, float %A } @@ -38,7 +38,7 @@ EntryBlock: %p2 = fmul fast float %B, %cf %s1 = fadd fast float %p1, %p2 ret float %s1 -; CHECK: @test3 +; CHECK-LABEL: @test3( ; CHECK: select i1 %C, float %B, float %A } diff --git a/test/Transforms/InstCombine/align-addr.ll b/test/Transforms/InstCombine/align-addr.ll index 4ea1bd9beb3..e33ee9f5a07 100644 --- a/test/Transforms/InstCombine/align-addr.ll +++ b/test/Transforms/InstCombine/align-addr.ll @@ -4,7 +4,7 @@ target datalayout = "E-p:64:64:64-a0:0:8-f32:32:32-f64:64:64-i1:8:8-i8:8:8-i16:1 ; Instcombine should be able to prove vector alignment in the ; presence of a few mild address computation tricks. -; CHECK: @test0( +; CHECK-LABEL: @test0( ; CHECK: align 16 define void @test0(i8* %b, i64 %n, i64 %u, i64 %y) nounwind { @@ -35,7 +35,7 @@ return: ; When we see a unaligned load from an insufficiently aligned global or ; alloca, increase the alignment of the load, turning it into an aligned load. -; CHECK: @test1( +; CHECK-LABEL: @test1( ; CHECK: tmp = load ; CHECK: GLOBAL{{.*}}align 16 @@ -49,7 +49,7 @@ entry: ; When a load or store lacks an explicit alignment, add one. -; CHECK: @test2( +; CHECK-LABEL: @test2( ; CHECK: load double* %p, align 8 ; CHECK: store double %n, double* %p, align 8 @@ -67,7 +67,7 @@ declare void @use(i8*) define void @test3(%struct.s* sret %a4) { ; Check that the alignment is bumped up the alignment of the sret type. -; CHECK: @test3 +; CHECK-LABEL: @test3( %a4.cast = bitcast %struct.s* %a4 to i8* call void @llvm.memset.p0i8.i64(i8* %a4.cast, i8 0, i64 16, i32 1, i1 false) ; CHECK: call void @llvm.memset.p0i8.i64(i8* %a4.cast, i8 0, i64 16, i32 4, i1 false) diff --git a/test/Transforms/InstCombine/align-external.ll b/test/Transforms/InstCombine/align-external.ll index c3ef2dbb70f..66ff9c16e42 100644 --- a/test/Transforms/InstCombine/align-external.ll +++ b/test/Transforms/InstCombine/align-external.ll @@ -22,7 +22,7 @@ define i64 @foo(i64 %a) { } define i32 @bar() { -; CHECK: @bar +; CHECK-LABEL: @bar( %r = load i32* @B, align 1 ; CHECK: align 1 ret i32 %r diff --git a/test/Transforms/InstCombine/alloca.ll b/test/Transforms/InstCombine/alloca.ll index 68a671cec88..9a80ad9df62 100644 --- a/test/Transforms/InstCombine/alloca.ll +++ b/test/Transforms/InstCombine/alloca.ll @@ -8,7 +8,7 @@ declare void @use(...) @int = global i32 zeroinitializer ; Zero byte allocas should be merged if they can't be deleted. -; CHECK: @test +; CHECK-LABEL: @test( ; CHECK: alloca ; CHECK-NOT: alloca define void @test() { @@ -25,7 +25,7 @@ define void @test() { } ; Zero byte allocas should be deleted. -; CHECK: @test2 +; CHECK-LABEL: @test2( ; CHECK-NOT: alloca define void @test2() { %A = alloca i32 ; [#uses=1] @@ -34,7 +34,7 @@ define void @test2() { } ; Zero byte allocas should be deleted. -; CHECK: @test3 +; CHECK-LABEL: @test3( ; CHECK-NOT: alloca define void @test3() { %A = alloca { i32 } ; <{ i32 }*> [#uses=1] @@ -43,7 +43,7 @@ define void @test3() { ret void } -; CHECK: @test4 +; CHECK-LABEL: @test4( ; CHECK: = zext i32 %n to i64 ; CHECK: %A = alloca i32, i64 % define i32* @test4(i32 %n) { @@ -54,7 +54,7 @@ define i32* @test4(i32 %n) { ; Allocas which are only used by GEPs, bitcasts, and stores (transitively) ; should be deleted. define void @test5() { -; CHECK: @test5 +; CHECK-LABEL: @test5( ; CHECK-NOT: alloca ; CHECK-NOT: store ; CHECK: ret @@ -80,7 +80,7 @@ declare void @f(i32* %p) ; Check that we don't delete allocas in some erroneous cases. define void @test6() { -; CHECK: @test6 +; CHECK-LABEL: @test6( ; CHECK-NOT: ret ; CHECK: alloca ; CHECK-NEXT: alloca diff --git a/test/Transforms/InstCombine/and-xor-or.ll b/test/Transforms/InstCombine/and-xor-or.ll index 7ff810b6eee..ec36d13ec1a 100644 --- a/test/Transforms/InstCombine/and-xor-or.ll +++ b/test/Transforms/InstCombine/and-xor-or.ll @@ -7,7 +7,7 @@ define i64 @or(i64 %x, i64 %y) nounwind uwtable readnone ssp { %2 = xor i64 %y, %x %3 = add i64 %1, %2 ret i64 %3 -; CHECK: @or +; CHECK-LABEL: @or( ; CHECK: or i64 ; CHECK-NEXT: ret } @@ -18,7 +18,7 @@ define i64 @or2(i64 %x, i64 %y) nounwind uwtable readnone ssp { %2 = xor i64 %y, %x %3 = or i64 %1, %2 ret i64 %3 -; CHECK: @or2 +; CHECK-LABEL: @or2( ; CHECK: or i64 ; CHECK-NEXT: ret } diff --git a/test/Transforms/InstCombine/and2.ll b/test/Transforms/InstCombine/and2.ll index 531aedb668a..504391aa485 100644 --- a/test/Transforms/InstCombine/and2.ll +++ b/test/Transforms/InstCombine/and2.ll @@ -13,7 +13,7 @@ define i1 @test2(i1 %X, i1 %Y) { %a = and i1 %X, %Y %b = and i1 %a, %X ret i1 %b -; CHECK: @test2 +; CHECK-LABEL: @test2( ; CHECK-NEXT: and i1 %X, %Y ; CHECK-NEXT: ret } @@ -22,7 +22,7 @@ define i32 @test3(i32 %X, i32 %Y) { %a = and i32 %X, %Y %b = and i32 %Y, %a ret i32 %b -; CHECK: @test3 +; CHECK-LABEL: @test3( ; CHECK-NEXT: and i32 %X, %Y ; CHECK-NEXT: ret } @@ -32,7 +32,7 @@ define i1 @test4(i32 %X) { %b = icmp slt i32 %X, 0 %c = and i1 %a, %b ret i1 %c -; CHECK: @test4 +; CHECK-LABEL: @test4( ; CHECK-NEXT: ret i1 false } diff --git a/test/Transforms/InstCombine/apint-shift-simplify.ll b/test/Transforms/InstCombine/apint-shift-simplify.ll index 14e895ad4bf..63703ba112a 100644 --- a/test/Transforms/InstCombine/apint-shift-simplify.ll +++ b/test/Transforms/InstCombine/apint-shift-simplify.ll @@ -5,7 +5,7 @@ define i41 @test0(i41 %A, i41 %B, i41 %C) { %Y = shl i41 %B, %C %Z = and i41 %X, %Y ret i41 %Z -; CHECK: @test0 +; CHECK-LABEL: @test0( ; CHECK-NEXT: and i41 %A, %B ; CHECK-NEXT: shl i41 ; CHECK-NEXT: ret @@ -16,7 +16,7 @@ define i57 @test1(i57 %A, i57 %B, i57 %C) { %Y = lshr i57 %B, %C %Z = or i57 %X, %Y ret i57 %Z -; CHECK: @test1 +; CHECK-LABEL: @test1( ; CHECK-NEXT: or i57 %A, %B ; CHECK-NEXT: lshr i57 ; CHECK-NEXT: ret @@ -27,7 +27,7 @@ define i49 @test2(i49 %A, i49 %B, i49 %C) { %Y = ashr i49 %B, %C %Z = xor i49 %X, %Y ret i49 %Z -; CHECK: @test2 +; CHECK-LABEL: @test2( ; CHECK-NEXT: xor i49 %A, %B ; CHECK-NEXT: ashr i49 ; CHECK-NEXT: ret diff --git a/test/Transforms/InstCombine/apint-shift.ll b/test/Transforms/InstCombine/apint-shift.ll index 73f630ebfec..f5764c2d5e8 100644 --- a/test/Transforms/InstCombine/apint-shift.ll +++ b/test/Transforms/InstCombine/apint-shift.ll @@ -2,14 +2,14 @@ ; even with arbitrary precision integers. ; RUN: opt < %s -instcombine -S | FileCheck %s -; CHECK: @test1 +; CHECK-LABEL: @test1( ; CHECK-NOT: sh define i47 @test1(i47 %A) { %B = shl i47 %A, 0 ; [#uses=1] ret i47 %B } -; CHECK: @test2 +; CHECK-LABEL: @test2( ; CHECK-NOT: sh define i41 @test2(i7 %X) { %A = zext i7 %X to i41 ; [#uses=1] @@ -17,14 +17,14 @@ define i41 @test2(i7 %X) { ret i41 %B } -; CHECK: @test3 +; CHECK-LABEL: @test3( ; CHECK-NOT: sh define i41 @test3(i41 %A) { %B = ashr i41 %A, 0 ; [#uses=1] ret i41 %B } -; CHECK: @test4 +; CHECK-LABEL: @test4( ; CHECK-NOT: sh define i39 @test4(i7 %X) { %A = zext i7 %X to i39 ; [#uses=1] @@ -32,21 +32,21 @@ define i39 @test4(i7 %X) { ret i39 %B } -; CHECK: @test5 +; CHECK-LABEL: @test5( ; CHECK-NOT: sh define i55 @test5(i55 %A) { %B = lshr i55 %A, 55 ; [#uses=1] ret i55 %B } -; CHECK: @test5a +; CHECK-LABEL: @test5a( ; CHECK-NOT: sh define i32 @test5a(i32 %A) { %B = shl i32 %A, 32 ; [#uses=1] ret i32 %B } -; CHECK: @test6 +; CHECK-LABEL: @test6( ; CHECK: mul i55 %A, 6 define i55 @test6(i55 %A) { %B = shl i55 %A, 1 ; [#uses=1] @@ -54,7 +54,7 @@ define i55 @test6(i55 %A) { ret i55 %C } -; CHECK: @test6a +; CHECK-LABEL: @test6a( ; CHECK: mul i55 %A, 6 define i55 @test6a(i55 %A) { %B = mul i55 %A, 3 ; [#uses=1] @@ -62,7 +62,7 @@ define i55 @test6a(i55 %A) { ret i55 %C } -; CHECK: @test7 +; CHECK-LABEL: @test7( ; CHECK-NOT: sh define i29 @test7(i8 %X) { %A = zext i8 %X to i29 ; [#uses=1] @@ -70,7 +70,7 @@ define i29 @test7(i8 %X) { ret i29 %B } -; CHECK: @test8 +; CHECK-LABEL: @test8( ; CHECK-NOT: sh define i7 @test8(i7 %A) { %B = shl i7 %A, 4 ; [#uses=1] @@ -78,7 +78,7 @@ define i7 @test8(i7 %A) { ret i7 %C } -; CHECK: @test9 +; CHECK-LABEL: @test9( ; CHECK-NOT: sh define i17 @test9(i17 %A) { %B = shl i17 %A, 16 ; [#uses=1] @@ -86,7 +86,7 @@ define i17 @test9(i17 %A) { ret i17 %C } -; CHECK: @test10 +; CHECK-LABEL: @test10( ; CHECK-NOT: sh define i19 @test10(i19 %A) { %B = lshr i19 %A, 18 ; [#uses=1] @@ -94,7 +94,7 @@ define i19 @test10(i19 %A) { ret i19 %C } -; CHECK: @test11 +; CHECK-LABEL: @test11( ; Don't hide the shl from scalar evolution. DAGCombine will get it. ; CHECK: shl define i23 @test11(i23 %A) { @@ -104,7 +104,7 @@ define i23 @test11(i23 %A) { ret i23 %C } -; CHECK: @test12 +; CHECK-LABEL: @test12( ; CHECK-NOT: sh define i47 @test12(i47 %A) { %B = ashr i47 %A, 8 ; [#uses=1] @@ -112,7 +112,7 @@ define i47 @test12(i47 %A) { ret i47 %C } -; CHECK: @test13 +; CHECK-LABEL: @test13( ; Don't hide the shl from scalar evolution. DAGCombine will get it. ; CHECK: shl define i18 @test13(i18 %A) { @@ -122,7 +122,7 @@ define i18 @test13(i18 %A) { ret i18 %C } -; CHECK: @test14 +; CHECK-LABEL: @test14( ; CHECK-NOT: sh define i35 @test14(i35 %A) { %B = lshr i35 %A, 4 ; [#uses=1] @@ -131,7 +131,7 @@ define i35 @test14(i35 %A) { ret i35 %D } -; CHECK: @test14a +; CHECK-LABEL: @test14a( ; CHECK-NOT: sh define i79 @test14a(i79 %A) { %B = shl i79 %A, 4 ; [#uses=1] @@ -140,7 +140,7 @@ define i79 @test14a(i79 %A) { ret i79 %D } -; CHECK: @test15 +; CHECK-LABEL: @test15( ; CHECK-NOT: sh define i45 @test15(i1 %C) { %A = select i1 %C, i45 3, i45 1 ; [#uses=1] @@ -148,7 +148,7 @@ define i45 @test15(i1 %C) { ret i45 %V } -; CHECK: @test15a +; CHECK-LABEL: @test15a( ; CHECK-NOT: sh define i53 @test15a(i1 %X) { %A = select i1 %X, i8 3, i8 1 ; [#uses=1] @@ -157,7 +157,7 @@ define i53 @test15a(i1 %X) { ret i53 %V } -; CHECK: @test16 +; CHECK-LABEL: @test16( ; CHECK-NOT: sh define i1 @test16(i84 %X) { %tmp.3 = ashr i84 %X, 4 ; [#uses=1] @@ -166,7 +166,7 @@ define i1 @test16(i84 %X) { ret i1 %tmp.7 } -; CHECK: @test17 +; CHECK-LABEL: @test17( ; CHECK-NOT: sh define i1 @test17(i106 %A) { %B = lshr i106 %A, 3 ; [#uses=1] @@ -174,7 +174,7 @@ define i1 @test17(i106 %A) { ret i1 %C } -; CHECK: @test18 +; CHECK-LABEL: @test18( ; CHECK-NOT: sh define i1 @test18(i11 %A) { %B = lshr i11 %A, 10 ; [#uses=1] @@ -182,7 +182,7 @@ define i1 @test18(i11 %A) { ret i1 %C } -; CHECK: @test19 +; CHECK-LABEL: @test19( ; CHECK-NOT: sh define i1 @test19(i37 %A) { %B = ashr i37 %A, 2 ; [#uses=1] @@ -190,7 +190,7 @@ define i1 @test19(i37 %A) { ret i1 %C } -; CHECK: @test19a +; CHECK-LABEL: @test19a( ; CHECK-NOT: sh define i1 @test19a(i39 %A) { %B = ashr i39 %A, 2 ; [#uses=1] @@ -198,7 +198,7 @@ define i1 @test19a(i39 %A) { ret i1 %C } -; CHECK: @test20 +; CHECK-LABEL: @test20( ; CHECK-NOT: sh define i1 @test20(i13 %A) { %B = ashr i13 %A, 12 ; [#uses=1] @@ -206,7 +206,7 @@ define i1 @test20(i13 %A) { ret i1 %C } -; CHECK: @test21 +; CHECK-LABEL: @test21( ; CHECK-NOT: sh define i1 @test21(i12 %A) { %B = shl i12 %A, 6 ; [#uses=1] @@ -214,7 +214,7 @@ define i1 @test21(i12 %A) { ret i1 %C } -; CHECK: @test22 +; CHECK-LABEL: @test22( ; CHECK-NOT: sh define i1 @test22(i14 %A) { %B = shl i14 %A, 7 ; [#uses=1] @@ -222,7 +222,7 @@ define i1 @test22(i14 %A) { ret i1 %C } -; CHECK: @test23 +; CHECK-LABEL: @test23( ; CHECK-NOT: sh define i11 @test23(i44 %A) { %B = shl i44 %A, 33 ; [#uses=1] @@ -231,7 +231,7 @@ define i11 @test23(i44 %A) { ret i11 %D } -; CHECK: @test25 +; CHECK-LABEL: @test25( ; CHECK-NOT: sh define i37 @test25(i37 %tmp.2, i37 %AA) { %x = lshr i37 %AA, 17 ; [#uses=1] @@ -241,7 +241,7 @@ define i37 @test25(i37 %tmp.2, i37 %AA) { ret i37 %tmp.6 } -; CHECK: @test26 +; CHECK-LABEL: @test26( ; CHECK-NOT: sh define i40 @test26(i40 %A) { %B = lshr i40 %A, 1 ; [#uses=1] diff --git a/test/Transforms/InstCombine/apint-shl-trunc.ll b/test/Transforms/InstCombine/apint-shl-trunc.ll index f2dc7d5130a..b4450d4a3a0 100644 --- a/test/Transforms/InstCombine/apint-shl-trunc.ll +++ b/test/Transforms/InstCombine/apint-shl-trunc.ll @@ -1,7 +1,7 @@ ; RUN: opt < %s -instcombine -S | FileCheck %s define i1 @test0(i39 %X, i39 %A) { -; CHECK: @test0 +; CHECK-LABEL: @test0( ; CHECK: %[[V1:.*]] = shl i39 1, %A ; CHECK: %[[V2:.*]] = and i39 %[[V1]], %X ; CHECK: %[[V3:.*]] = icmp ne i39 %[[V2]], 0 @@ -13,7 +13,7 @@ define i1 @test0(i39 %X, i39 %A) { } define i1 @test1(i799 %X, i799 %A) { -; CHECK: @test1 +; CHECK-LABEL: @test1( ; CHECK: %[[V1:.*]] = shl i799 1, %A ; CHECK: %[[V2:.*]] = and i799 %[[V1]], %X ; CHECK: %[[V3:.*]] = icmp ne i799 %[[V2]], 0 diff --git a/test/Transforms/InstCombine/badmalloc.ll b/test/Transforms/InstCombine/badmalloc.ll index 3abe28aede5..2074d262ccb 100644 --- a/test/Transforms/InstCombine/badmalloc.ll +++ b/test/Transforms/InstCombine/badmalloc.ll @@ -15,11 +15,11 @@ define i1 @test1() { call void @free(i8* %A) ret i1 %B -; CHECK: @test1 +; CHECK-LABEL: @test1( ; CHECK: ret i1 false } -; CHECK: @test2 +; CHECK-LABEL: @test2( define noalias i8* @test2() nounwind { entry: ; CHECK: @malloc diff --git a/test/Transforms/InstCombine/bitcast-bigendian.ll b/test/Transforms/InstCombine/bitcast-bigendian.ll index 4ded581a14c..28b0e9ae3fa 100644 --- a/test/Transforms/InstCombine/bitcast-bigendian.ll +++ b/test/Transforms/InstCombine/bitcast-bigendian.ll @@ -18,7 +18,7 @@ define float @test2(<2 x float> %A, <2 x i32> %B) { %add = fadd float %tmp24, %tmp4 ret float %add -; CHECK: @test2 +; CHECK-LABEL: @test2( ; CHECK-NEXT: %tmp24 = extractelement <2 x float> %A, i32 1 ; CHECK-NEXT: bitcast <2 x i32> %B to <2 x float> ; CHECK-NEXT: %tmp4 = extractelement <2 x float> {{.*}}, i32 1 @@ -40,7 +40,7 @@ define float @test3(<2 x float> %A, <2 x i64> %B) { %add = fadd float %tmp24, %tmp4 ret float %add -; CHECK: @test3 +; CHECK-LABEL: @test3( ; CHECK-NEXT: %tmp24 = extractelement <2 x float> %A, i32 0 ; CHECK-NEXT: bitcast <2 x i64> %B to <4 x float> ; CHECK-NEXT: %tmp4 = extractelement <4 x float> {{.*}}, i32 1 diff --git a/test/Transforms/InstCombine/bitcast-vec-uniform.ll b/test/Transforms/InstCombine/bitcast-vec-uniform.ll index 5975f1ec396..bfb77191a75 100644 --- a/test/Transforms/InstCombine/bitcast-vec-uniform.ll +++ b/test/Transforms/InstCombine/bitcast-vec-uniform.ll @@ -1,6 +1,6 @@ ; RUN: opt < %s -instcombine -S | FileCheck %s -; CHECK: @a +; CHECK-LABEL: @a( ; CHECK-NOT: bitcast ; CHECK: ret define <4 x i32> @a(<1 x i64> %y) { @@ -8,7 +8,7 @@ define <4 x i32> @a(<1 x i64> %y) { ret <4 x i32> %c } -; CHECK: @b +; CHECK-LABEL: @b( ; CHECK-NOT: bitcast ; CHECK: ret @@ -17,7 +17,7 @@ define <4 x i32> @b(<1 x i64> %y) { ret <4 x i32> %c } -; CHECK: @foo +; CHECK-LABEL: @foo( ; CHECK-NOT: bitcast ; CHECK: ret @@ -28,7 +28,7 @@ define <2 x float> @foo() { } -; CHECK: @foo2 +; CHECK-LABEL: @foo2( ; CHECK-NOT: bitcast ; CHECK: ret define <2 x double> @foo2() { @@ -36,7 +36,7 @@ define <2 x double> @foo2() { ret <2 x double> %cast } -; CHECK: @foo3 +; CHECK-LABEL: @foo3( ; CHECK-NOT: bitcast ; CHECK: ret define <1 x float> @foo3() { @@ -44,7 +44,7 @@ define <1 x float> @foo3() { ret <1 x float> %cast } -; CHECK: @foo4 +; CHECK-LABEL: @foo4( ; CHECK-NOT: bitcast ; CHECK: ret define float @foo4() { @@ -52,7 +52,7 @@ define float @foo4() { ret float %cast } -; CHECK: @foo5 +; CHECK-LABEL: @foo5( ; CHECK-NOT: bitcast ; CHECK: ret define double @foo5() { @@ -61,7 +61,7 @@ define double @foo5() { } -; CHECK: @foo6 +; CHECK-LABEL: @foo6( ; CHECK-NOT: bitcast ; CHECK: ret define <2 x double> @foo6() { diff --git a/test/Transforms/InstCombine/bitcast.ll b/test/Transforms/InstCombine/bitcast.ll index 1e6113256bf..4ef87909cff 100644 --- a/test/Transforms/InstCombine/bitcast.ll +++ b/test/Transforms/InstCombine/bitcast.ll @@ -12,7 +12,7 @@ define i32 @test1(i64 %a) { %t4 = extractelement <2 x i32> %t3, i32 0 ret i32 %t4 -; CHECK: @test1 +; CHECK-LABEL: @test1( ; CHECK: ret i32 0 } @@ -31,7 +31,7 @@ define float @test2(<2 x float> %A, <2 x i32> %B) { %add = fadd float %tmp24, %tmp4 ret float %add -; CHECK: @test2 +; CHECK-LABEL: @test2( ; CHECK-NEXT: %tmp24 = extractelement <2 x float> %A, i32 0 ; CHECK-NEXT: bitcast <2 x i32> %B to <2 x float> ; CHECK-NEXT: %tmp4 = extractelement <2 x float> {{.*}}, i32 0 @@ -56,7 +56,7 @@ define float @test3(<2 x float> %A, <2 x i64> %B) { %add = fadd float %tmp24, %tmp4 ret float %add -; CHECK: @test3 +; CHECK-LABEL: @test3( ; CHECK-NEXT: %tmp24 = extractelement <2 x float> %A, i32 1 ; CHECK-NEXT: bitcast <2 x i64> %B to <4 x float> ; CHECK-NEXT: %tmp4 = extractelement <4 x float> {{.*}}, i32 2 @@ -72,7 +72,7 @@ define <2 x i32> @test4(i32 %A, i32 %B){ %ins35 = or i64 %tmp33, %tmp38 %tmp43 = bitcast i64 %ins35 to <2 x i32> ret <2 x i32> %tmp43 - ; CHECK: @test4 + ; CHECK-LABEL: @test4( ; CHECK-NEXT: insertelement <2 x i32> undef, i32 %A, i32 0 ; CHECK-NEXT: insertelement <2 x i32> {{.*}}, i32 %B, i32 1 ; CHECK-NEXT: ret <2 x i32> @@ -89,7 +89,7 @@ define <2 x float> @test5(float %A, float %B) { %ins35 = or i64 %tmp33, %tmp38 %tmp43 = bitcast i64 %ins35 to <2 x float> ret <2 x float> %tmp43 - ; CHECK: @test5 + ; CHECK-LABEL: @test5( ; CHECK-NEXT: insertelement <2 x float> undef, float %A, i32 0 ; CHECK-NEXT: insertelement <2 x float> {{.*}}, float %B, i32 1 ; CHECK-NEXT: ret <2 x float> @@ -102,7 +102,7 @@ define <2 x float> @test6(float %A){ %mask20 = or i64 %tmp25, 1109917696 ; [#uses=1] %tmp35 = bitcast i64 %mask20 to <2 x float> ; <<2 x float>> [#uses=1] ret <2 x float> %tmp35 -; CHECK: @test6 +; CHECK-LABEL: @test6( ; CHECK-NEXT: insertelement <2 x float> , float %A, i32 1 ; CHECK: ret } @@ -110,7 +110,7 @@ define <2 x float> @test6(float %A){ define i64 @ISPC0(i64 %in) { %out = and i64 %in, xor (i64 bitcast (<4 x i16> to i64), i64 -1) ret i64 %out -; CHECK: @ISPC0 +; CHECK-LABEL: @ISPC0( ; CHECK: ret i64 0 } @@ -118,14 +118,14 @@ define i64 @ISPC0(i64 %in) { define i64 @Vec2(i64 %in) { %out = and i64 %in, xor (i64 bitcast (<4 x i16> to i64), i64 0) ret i64 %out -; CHECK: @Vec2 +; CHECK-LABEL: @Vec2( ; CHECK: ret i64 0 } define i64 @All11(i64 %in) { %out = and i64 %in, xor (i64 bitcast (<2 x float> bitcast (i64 -1 to <2 x float>) to i64), i64 -1) ret i64 %out -; CHECK: @All11 +; CHECK-LABEL: @All11( ; CHECK: ret i64 0 } @@ -133,7 +133,7 @@ define i64 @All11(i64 %in) { define i32 @All111(i32 %in) { %out = and i32 %in, xor (i32 bitcast (<1 x float> bitcast (i32 -1 to <1 x float>) to i32), i32 -1) ret i32 %out -; CHECK: @All111 +; CHECK-LABEL: @All111( ; CHECK: ret i32 0 } @@ -141,6 +141,6 @@ define <2 x i16> @BitcastInsert(i32 %a) { %v = insertelement <1 x i32> undef, i32 %a, i32 0 %r = bitcast <1 x i32> %v to <2 x i16> ret <2 x i16> %r -; CHECK: @BitcastInsert +; CHECK-LABEL: @BitcastInsert( ; CHECK: bitcast i32 %a to <2 x i16> } diff --git a/test/Transforms/InstCombine/call.ll b/test/Transforms/InstCombine/call.ll index 96ec420eaa8..974a871820a 100644 --- a/test/Transforms/InstCombine/call.ll +++ b/test/Transforms/InstCombine/call.ll @@ -130,7 +130,7 @@ define i8* @test9(i8* %arg, i8* %tmp3) nounwind ssp noredzone { entry: %call = call i8* bitcast (i8* (i8*, i8*, ...)* @test9x to i8* (i8*, i8*)*)(i8* %arg, i8* %tmp3) noredzone ret i8* %call -; CHECK: @test9( +; CHECK-LABEL: @test9( ; CHECK: call i8* bitcast } diff --git a/test/Transforms/InstCombine/canonicalize_branch.ll b/test/Transforms/InstCombine/canonicalize_branch.ll index 869546d57dc..b62b143d9d5 100644 --- a/test/Transforms/InstCombine/canonicalize_branch.ll +++ b/test/Transforms/InstCombine/canonicalize_branch.ll @@ -5,7 +5,7 @@ define i32 @test0(i32 %X, i32 %Y) { %C = icmp eq i32 %X, %Y br i1 %C, label %T, label %F, !prof !0 -; CHECK: @test0 +; CHECK-LABEL: @test0( ; CHECK: %C = icmp eq i32 %X, %Y ; CHECK: br i1 %C, label %T, label %F @@ -19,7 +19,7 @@ define i32 @test1(i32 %X, i32 %Y) { %C = icmp ne i32 %X, %Y br i1 %C, label %T, label %F, !prof !1 -; CHECK: @test1 +; CHECK-LABEL: @test1( ; CHECK: %C = icmp eq i32 %X, %Y ; CHECK: br i1 %C, label %F, label %T @@ -33,7 +33,7 @@ define i32 @test2(i32 %X, i32 %Y) { %C = icmp ule i32 %X, %Y br i1 %C, label %T, label %F, !prof !2 -; CHECK: @test2 +; CHECK-LABEL: @test2( ; CHECK: %C = icmp ugt i32 %X, %Y ; CHECK: br i1 %C, label %F, label %T @@ -47,7 +47,7 @@ define i32 @test3(i32 %X, i32 %Y) { %C = icmp uge i32 %X, %Y br i1 %C, label %T, label %F, !prof !3 -; CHECK: @test3 +; CHECK-LABEL: @test3( ; CHECK: %C = icmp ult i32 %X, %Y ; CHECK: br i1 %C, label %F, label %T diff --git a/test/Transforms/InstCombine/cast.ll b/test/Transforms/InstCombine/cast.ll index ff2c0a92898..52ea7b973cf 100644 --- a/test/Transforms/InstCombine/cast.ll +++ b/test/Transforms/InstCombine/cast.ll @@ -326,7 +326,7 @@ define i16 @test39(i16 %a) { %tmp.upgrd.32 = or i32 %tmp21, %tmp5 %tmp.upgrd.3 = trunc i32 %tmp.upgrd.32 to i16 ret i16 %tmp.upgrd.3 -; CHECK: @test39 +; CHECK-LABEL: @test39( ; CHECK: %tmp.upgrd.32 = call i16 @llvm.bswap.i16(i16 %a) ; CHECK: ret i16 %tmp.upgrd.32 } @@ -338,7 +338,7 @@ define i16 @test40(i16 %a) { %tmp.upgrd.32 = or i32 %tmp21, %tmp5 %tmp.upgrd.3 = trunc i32 %tmp.upgrd.32 to i16 ret i16 %tmp.upgrd.3 -; CHECK: @test40 +; CHECK-LABEL: @test40( ; CHECK: %tmp21 = lshr i16 %a, 9 ; CHECK: %tmp5 = shl i16 %a, 8 ; CHECK: %tmp.upgrd.32 = or i16 %tmp21, %tmp5 @@ -350,7 +350,7 @@ define i32* @test41(i32* %tmp1) { %tmp64 = bitcast i32* %tmp1 to { i32 }* %tmp65 = getelementptr { i32 }* %tmp64, i32 0, i32 0 ret i32* %tmp65 -; CHECK: @test41 +; CHECK-LABEL: @test41( ; CHECK: ret i32* %tmp1 } @@ -358,7 +358,7 @@ define i32 @test42(i32 %X) { %Y = trunc i32 %X to i8 ; [#uses=1] %Z = zext i8 %Y to i32 ; [#uses=1] ret i32 %Z -; CHECK: @test42 +; CHECK-LABEL: @test42( ; CHECK: %Z = and i32 %X, 255 } @@ -368,7 +368,7 @@ define zeroext i64 @test43(i8 zeroext %on_off) nounwind readonly { %B = add i32 %A, -1 %C = sext i32 %B to i64 ret i64 %C ;; Should be (add (zext i8 -> i64), -1) -; CHECK: @test43 +; CHECK-LABEL: @test43( ; CHECK-NEXT: %A = zext i8 %on_off to i64 ; CHECK-NEXT: %B = add i64 %A, -1 ; CHECK-NEXT: ret i64 %B @@ -379,7 +379,7 @@ define i64 @test44(i8 %T) { %B = or i16 %A, 1234 %C = zext i16 %B to i64 ret i64 %C -; CHECK: @test44 +; CHECK-LABEL: @test44( ; CHECK-NEXT: %A = zext i8 %T to i64 ; CHECK-NEXT: %B = or i64 %A, 1234 ; CHECK-NEXT: ret i64 %B @@ -391,7 +391,7 @@ define i64 @test45(i8 %A, i64 %Q) { %C = or i32 %B, %D %E = zext i32 %C to i64 ret i64 %E -; CHECK: @test45 +; CHECK-LABEL: @test45( ; CHECK-NEXT: %B = sext i8 %A to i64 ; CHECK-NEXT: %C = or i64 %B, %Q ; CHECK-NEXT: %E = and i64 %C, 4294967295 @@ -405,7 +405,7 @@ define i64 @test46(i64 %A) { %D = shl i32 %C, 8 %E = zext i32 %D to i64 ret i64 %E -; CHECK: @test46 +; CHECK-LABEL: @test46( ; CHECK-NEXT: %C = shl i64 %A, 8 ; CHECK-NEXT: %D = and i64 %C, 10752 ; CHECK-NEXT: ret i64 %D @@ -416,7 +416,7 @@ define i64 @test47(i8 %A) { %C = or i32 %B, 42 %E = zext i32 %C to i64 ret i64 %E -; CHECK: @test47 +; CHECK-LABEL: @test47( ; CHECK-NEXT: %B = sext i8 %A to i64 ; CHECK-NEXT: %C = and i64 %B, 4294967253 ; CHECK-NEXT: %E = or i64 %C, 42 @@ -430,7 +430,7 @@ define i64 @test48(i8 %A, i8 %a) { %D = or i32 %C, %b %E = zext i32 %D to i64 ret i64 %E -; CHECK: @test48 +; CHECK-LABEL: @test48( ; CHECK-NEXT: %b = zext i8 %a to i64 ; CHECK-NEXT: %B = zext i8 %A to i64 ; CHECK-NEXT: %C = shl nuw nsw i64 %B, 8 @@ -443,7 +443,7 @@ define i64 @test49(i64 %A) { %C = or i32 %B, 1 %D = sext i32 %C to i64 ret i64 %D -; CHECK: @test49 +; CHECK-LABEL: @test49( ; CHECK-NEXT: %C = shl i64 %A, 32 ; CHECK-NEXT: ashr exact i64 %C, 32 ; CHECK-NEXT: %D = or i64 {{.*}}, 1 @@ -456,7 +456,7 @@ define i64 @test50(i64 %A) { %D = add i32 %B, -1 %E = sext i32 %D to i64 ret i64 %E -; CHECK: @test50 +; CHECK-LABEL: @test50( ; lshr+shl will be handled by DAGCombine. ; CHECK-NEXT: lshr i64 %A, 2 ; CHECK-NEXT: shl i64 %a, 32 @@ -472,7 +472,7 @@ define i64 @test51(i64 %A, i1 %cond) { %E = select i1 %cond, i32 %C, i32 %D %F = sext i32 %E to i64 ret i64 %F -; CHECK: @test51 +; CHECK-LABEL: @test51( ; CHECK-NEXT: %C = and i64 %A, 4294967294 ; CHECK-NEXT: %D = or i64 %A, 1 ; CHECK-NEXT: %E = select i1 %cond, i64 %C, i64 %D @@ -487,7 +487,7 @@ define i32 @test52(i64 %A) { %D = and i16 %C, -25350 %E = zext i16 %D to i32 ret i32 %E -; CHECK: @test52 +; CHECK-LABEL: @test52( ; CHECK-NEXT: %B = trunc i64 %A to i32 ; CHECK-NEXT: %C = and i32 %B, 7224 ; CHECK-NEXT: %D = or i32 %C, 32962 @@ -500,7 +500,7 @@ define i64 @test53(i32 %A) { %D = and i16 %C, -25350 %E = zext i16 %D to i64 ret i64 %E -; CHECK: @test53 +; CHECK-LABEL: @test53( ; CHECK-NEXT: %B = zext i32 %A to i64 ; CHECK-NEXT: %C = and i64 %B, 7224 ; CHECK-NEXT: %D = or i64 %C, 32962 @@ -513,7 +513,7 @@ define i32 @test54(i64 %A) { %D = and i16 %C, -25350 %E = sext i16 %D to i32 ret i32 %E -; CHECK: @test54 +; CHECK-LABEL: @test54( ; CHECK-NEXT: %B = trunc i64 %A to i32 ; CHECK-NEXT: %C = and i32 %B, 7224 ; CHECK-NEXT: %D = or i32 %C, -32574 @@ -526,7 +526,7 @@ define i64 @test55(i32 %A) { %D = and i16 %C, -25350 %E = sext i16 %D to i64 ret i64 %E -; CHECK: @test55 +; CHECK-LABEL: @test55( ; CHECK-NEXT: %B = zext i32 %A to i64 ; CHECK-NEXT: %C = and i64 %B, 7224 ; CHECK-NEXT: %D = or i64 %C, -32574 @@ -538,7 +538,7 @@ define i64 @test56(i16 %A) nounwind { %tmp354 = lshr i32 %tmp353, 5 %tmp355 = zext i32 %tmp354 to i64 ret i64 %tmp355 -; CHECK: @test56 +; CHECK-LABEL: @test56( ; CHECK-NEXT: %tmp353 = sext i16 %A to i64 ; CHECK-NEXT: %tmp354 = lshr i64 %tmp353, 5 ; CHECK-NEXT: %tmp355 = and i64 %tmp354, 134217727 @@ -550,7 +550,7 @@ define i64 @test57(i64 %A) nounwind { %C = lshr i32 %B, 8 %E = zext i32 %C to i64 ret i64 %E -; CHECK: @test57 +; CHECK-LABEL: @test57( ; CHECK-NEXT: %C = lshr i64 %A, 8 ; CHECK-NEXT: %E = and i64 %C, 16777215 ; CHECK-NEXT: ret i64 %E @@ -563,7 +563,7 @@ define i64 @test58(i64 %A) nounwind { %E = zext i32 %D to i64 ret i64 %E -; CHECK: @test58 +; CHECK-LABEL: @test58( ; CHECK-NEXT: %C = lshr i64 %A, 8 ; CHECK-NEXT: %D = and i64 %C, 16777087 ; CHECK-NEXT: %E = or i64 %D, 128 @@ -579,7 +579,7 @@ define i64 @test59(i8 %A, i8 %B) nounwind { %H = or i32 %G, %E %I = zext i32 %H to i64 ret i64 %I -; CHECK: @test59 +; CHECK-LABEL: @test59( ; CHECK-NEXT: %C = zext i8 %A to i64 ; CHECK-NOT: i32 ; CHECK: %F = zext i8 %B to i64 @@ -593,7 +593,7 @@ define <3 x i32> @test60(<4 x i32> %call4) nounwind { %tmp10 = bitcast i96 %tmp9 to <3 x i32> ret <3 x i32> %tmp10 -; CHECK: @test60 +; CHECK-LABEL: @test60( ; CHECK-NEXT: shufflevector ; CHECK-NEXT: ret } @@ -603,7 +603,7 @@ define <4 x i32> @test61(<3 x i32> %call4) nounwind { %tmp9 = zext i96 %tmp11 to i128 %tmp10 = bitcast i128 %tmp9 to <4 x i32> ret <4 x i32> %tmp10 -; CHECK: @test61 +; CHECK-LABEL: @test61( ; CHECK-NEXT: shufflevector ; CHECK-NEXT: ret } @@ -613,7 +613,7 @@ define <4 x i32> @test62(<3 x float> %call4) nounwind { %tmp9 = zext i96 %tmp11 to i128 %tmp10 = bitcast i128 %tmp9 to <4 x i32> ret <4 x i32> %tmp10 -; CHECK: @test62 +; CHECK-LABEL: @test62( ; CHECK-NEXT: bitcast ; CHECK-NEXT: shufflevector ; CHECK-NEXT: ret @@ -625,7 +625,7 @@ entry: %a = bitcast i64 %tmp8 to <2 x i32> %vcvt.i = uitofp <2 x i32> %a to <2 x float> ret <2 x float> %vcvt.i -; CHECK: @test63 +; CHECK-LABEL: @test63( ; CHECK: bitcast ; CHECK: uitofp } @@ -634,7 +634,7 @@ define <4 x float> @test64(<4 x float> %c) nounwind { %t0 = bitcast <4 x float> %c to <4 x i32> %t1 = bitcast <4 x i32> %t0 to <4 x float> ret <4 x float> %t1 -; CHECK: @test64 +; CHECK-LABEL: @test64( ; CHECK-NEXT: ret <4 x float> %c } @@ -642,7 +642,7 @@ define <4 x float> @test65(<4 x float> %c) nounwind { %t0 = bitcast <4 x float> %c to <2 x double> %t1 = bitcast <2 x double> %t0 to <4 x float> ret <4 x float> %t1 -; CHECK: @test65 +; CHECK-LABEL: @test65( ; CHECK-NEXT: ret <4 x float> %c } @@ -650,13 +650,13 @@ define <2 x float> @test66(<2 x float> %c) nounwind { %t0 = bitcast <2 x float> %c to double %t1 = bitcast double %t0 to <2 x float> ret <2 x float> %t1 -; CHECK: @test66 +; CHECK-LABEL: @test66( ; CHECK-NEXT: ret <2 x float> %c } define float @test2c() { ret float extractelement (<2 x float> bitcast (double bitcast (<2 x float> to double) to <2 x float>), i32 0) -; CHECK: @test2c +; CHECK-LABEL: @test2c( ; CHECK-NOT: extractelement } @@ -665,7 +665,7 @@ define i64 @test_mmx(<2 x i32> %c) nounwind { %B = bitcast x86_mmx %A to <2 x i32> %C = bitcast <2 x i32> %B to i64 ret i64 %C -; CHECK: @test_mmx +; CHECK-LABEL: @test_mmx( ; CHECK-NOT: x86_mmx } @@ -674,7 +674,7 @@ define i64 @test_mmx_const(<2 x i32> %c) nounwind { %B = bitcast x86_mmx %A to <2 x i32> %C = bitcast <2 x i32> %B to i64 ret i64 %C -; CHECK: @test_mmx_const +; CHECK-LABEL: @test_mmx_const( ; CHECK-NOT: x86_mmx } @@ -689,14 +689,14 @@ define i1 @test67(i1 %a, i32 %b) { %trunc = trunc i32 %conv.i.i to i8 %tobool.i = icmp eq i8 %trunc, 0 ret i1 %tobool.i -; CHECK: @test67 +; CHECK-LABEL: @test67( ; CHECK: ret i1 false } %s = type { i32, i32, i32 } define %s @test68(%s *%p, i64 %i) { -; CHECK: @test68 +; CHECK-LABEL: @test68( %o = mul i64 %i, 12 %q = bitcast %s* %p to i8* %pp = getelementptr inbounds i8* %q, i64 %o @@ -709,7 +709,7 @@ define %s @test68(%s *%p, i64 %i) { } define double @test69(double *%p, i64 %i) { -; CHECK: @test69 +; CHECK-LABEL: @test69( %o = shl nsw i64 %i, 3 %q = bitcast double* %p to i8* %pp = getelementptr inbounds i8* %q, i64 %o @@ -722,7 +722,7 @@ define double @test69(double *%p, i64 %i) { } define %s @test70(%s *%p, i64 %i) { -; CHECK: @test70 +; CHECK-LABEL: @test70( %o = mul nsw i64 %i, 36 ; CHECK-NEXT: mul nsw i64 %i, 3 %q = bitcast %s* %p to i8* @@ -736,7 +736,7 @@ define %s @test70(%s *%p, i64 %i) { } define double @test71(double *%p, i64 %i) { -; CHECK: @test71 +; CHECK-LABEL: @test71( %o = shl i64 %i, 5 ; CHECK-NEXT: shl i64 %i, 2 %q = bitcast double* %p to i8* @@ -750,7 +750,7 @@ define double @test71(double *%p, i64 %i) { } define double @test72(double *%p, i32 %i) { -; CHECK: @test72 +; CHECK-LABEL: @test72( %so = mul nsw i32 %i, 8 %o = sext i32 %so to i64 ; CHECK-NEXT: sext i32 %i to i64 @@ -765,7 +765,7 @@ define double @test72(double *%p, i32 %i) { } define double @test73(double *%p, i128 %i) { -; CHECK: @test73 +; CHECK-LABEL: @test73( %lo = mul nsw i128 %i, 8 %o = trunc i128 %lo to i64 ; CHECK-NEXT: trunc i128 %i to i64 @@ -780,7 +780,7 @@ define double @test73(double *%p, i128 %i) { } define double @test74(double *%p, i64 %i) { -; CHECK: @test74 +; CHECK-LABEL: @test74( %q = bitcast double* %p to i64* %pp = getelementptr inbounds i64* %q, i64 %i ; CHECK-NEXT: getelementptr inbounds double* @@ -792,7 +792,7 @@ define double @test74(double *%p, i64 %i) { } define i32* @test75(i32* %p, i32 %x) { -; CHECK: @test75 +; CHECK-LABEL: @test75( %y = shl i32 %x, 3 ; CHECK-NEXT: shl i32 %x, 3 %z = sext i32 %y to i64 @@ -804,7 +804,7 @@ define i32* @test75(i32* %p, i32 %x) { } define %s @test76(%s *%p, i64 %i, i64 %j) { -; CHECK: @test76 +; CHECK-LABEL: @test76( %o = mul i64 %i, 12 %o2 = mul nsw i64 %o, %j ; CHECK-NEXT: %o2 = mul i64 %i, %j @@ -819,7 +819,7 @@ define %s @test76(%s *%p, i64 %i, i64 %j) { } define %s @test77(%s *%p, i64 %i, i64 %j) { -; CHECK: @test77 +; CHECK-LABEL: @test77( %o = mul nsw i64 %i, 36 %o2 = mul nsw i64 %o, %j ; CHECK-NEXT: %o = mul nsw i64 %i, 3 @@ -835,7 +835,7 @@ define %s @test77(%s *%p, i64 %i, i64 %j) { } define %s @test78(%s *%p, i64 %i, i64 %j, i32 %k, i32 %l, i128 %m, i128 %n) { -; CHECK: @test78 +; CHECK-LABEL: @test78( %a = mul nsw i32 %k, 36 ; CHECK-NEXT: mul nsw i32 %k, 3 %b = mul nsw i32 %a, %l @@ -863,7 +863,7 @@ define %s @test78(%s *%p, i64 %i, i64 %j, i32 %k, i32 %l, i128 %m, i128 %n) { } define %s @test79(%s *%p, i64 %i, i32 %j) { -; CHECK: @test79 +; CHECK-LABEL: @test79( %a = mul nsw i64 %i, 36 ; CHECK: mul nsw i64 %i, 36 %b = trunc i64 %a to i32 @@ -877,7 +877,7 @@ define %s @test79(%s *%p, i64 %i, i32 %j) { } define double @test80([100 x double]* %p, i32 %i) { -; CHECK: @test80 +; CHECK-LABEL: @test80( %tmp = mul nsw i32 %i, 8 ; CHECK-NEXT: sext i32 %i to i64 %q = bitcast [100 x double]* %p to i8* @@ -906,7 +906,7 @@ define i64 @test82(i64 %A) nounwind { %E = zext i32 %D to i64 ret i64 %E -; CHECK: @test82 +; CHECK-LABEL: @test82( ; CHECK-NEXT: [[REG:%[0-9]*]] = shl i64 %A, 1 ; CHECK-NEXT: %E = and i64 [[REG]], 4294966784 ; CHECK-NEXT: ret i64 %E @@ -921,7 +921,7 @@ define i64 @test83(i16 %a, i64 %k) { %sh_prom1 = zext i32 %shl to i64 ret i64 %sh_prom1 -; CHECK: @test83 +; CHECK-LABEL: @test83( ; CHECK: %sub = add nsw i64 %k, 4294967295 ; CHECK: %sh_prom = trunc i64 %sub to i32 ; CHECK: %shl = shl i32 %conv, %sh_prom diff --git a/test/Transforms/InstCombine/cast_ptr.ll b/test/Transforms/InstCombine/cast_ptr.ll index 09910fbc848..7910ea333ad 100644 --- a/test/Transforms/InstCombine/cast_ptr.ll +++ b/test/Transforms/InstCombine/cast_ptr.ll @@ -6,7 +6,7 @@ target datalayout = "p:32:32" ; This shouldn't convert to getelementptr because the relationship ; between the arithmetic and the layout of allocated memory is ; entirely unknown. -; CHECK: @test1 +; CHECK-LABEL: @test1( ; CHECK: ptrtoint ; CHECK: add ; CHECK: inttoptr @@ -18,7 +18,7 @@ define i8* @test1(i8* %t) { } ; These casts should be folded away. -; CHECK: @test2 +; CHECK-LABEL: @test2( ; CHECK: icmp eq i8* %a, %b define i1 @test2(i8* %a, i8* %b) { %tmpa = ptrtoint i8* %a to i32 ; [#uses=1] @@ -28,7 +28,7 @@ define i1 @test2(i8* %a, i8* %b) { } ; These casts should also be folded away. -; CHECK: @test3 +; CHECK-LABEL: @test3( ; CHECK: icmp eq i8* %a, @global @global = global i8 0 define i1 @test3(i8* %a) { @@ -41,7 +41,7 @@ define i1 @test4(i32 %A) { %B = inttoptr i32 %A to i8* %C = icmp eq i8* %B, null ret i1 %C -; CHECK: @test4 +; CHECK-LABEL: @test4( ; CHECK-NEXT: %C = icmp eq i32 %A, 0 ; CHECK-NEXT: ret i1 %C } @@ -60,7 +60,7 @@ define %unop* @test5(%op* %O) { %tmp = load %unop* (%op*)** bitcast ([1 x %op* (%op*)*]* @Array to %unop* (%op*)**); <%unop* (%op*)*> [#uses=1] %tmp.2 = call %unop* %tmp( %op* %O ) ; <%unop*> [#uses=1] ret %unop* %tmp.2 -; CHECK: @test5 +; CHECK-LABEL: @test5( ; CHECK: call %op* @foo(%op* %O) } @@ -74,6 +74,6 @@ entry: %arrayidx223 = bitcast i8 addrspace(1)* %source to i8* %tmp4 = load i8* %arrayidx223 ret i8 %tmp4 -; CHECK: @test6 +; CHECK-LABEL: @test6( ; CHECK: load i8* %arrayidx223 } diff --git a/test/Transforms/InstCombine/compare-signs.ll b/test/Transforms/InstCombine/compare-signs.ll index 72db66e3ab0..cdf95abcec5 100644 --- a/test/Transforms/InstCombine/compare-signs.ll +++ b/test/Transforms/InstCombine/compare-signs.ll @@ -22,7 +22,7 @@ ;} define i32 @test3(i32 %a, i32 %b) nounwind readnone { -; CHECK: @test3 +; CHECK-LABEL: @test3( entry: ; CHECK: xor i32 %a, %b ; CHECK: lshr i32 %0, 31 @@ -40,7 +40,7 @@ entry: ; Variation on @test3: checking the 2nd bit in a situation where the 5th bit ; is one, not zero. define i32 @test3i(i32 %a, i32 %b) nounwind readnone { -; CHECK: @test3i +; CHECK-LABEL: @test3i( entry: ; CHECK: xor i32 %a, %b ; CHECK: lshr i32 %0, 31 diff --git a/test/Transforms/InstCombine/constant-fold-gep.ll b/test/Transforms/InstCombine/constant-fold-gep.ll index e5b16ea0ffd..9f82e66b383 100644 --- a/test/Transforms/InstCombine/constant-fold-gep.ll +++ b/test/Transforms/InstCombine/constant-fold-gep.ll @@ -56,7 +56,7 @@ define void @frob() { ; PR8883 - Constant fold exotic gep subtract -; CHECK: @test2 +; CHECK-LABEL: @test2( @X = global [1000 x i8] zeroinitializer, align 16 define i64 @test2() { diff --git a/test/Transforms/InstCombine/cos-1.ll b/test/Transforms/InstCombine/cos-1.ll index b92e448abd9..c2e9a0db405 100644 --- a/test/Transforms/InstCombine/cos-1.ll +++ b/test/Transforms/InstCombine/cos-1.ll @@ -10,7 +10,7 @@ declare double @cos(double) ; Check cos(-x) -> cos(x); define double @test_simplify1(double %d) { -; NO-FLOAT-SHRINK: @test_simplify1 +; NO-FLOAT-SHRINK-LABEL: @test_simplify1( %neg = fsub double -0.000000e+00, %d %cos = call double @cos(double %neg) ; NO-FLOAT-SHRINK: call double @cos(double %d) @@ -18,7 +18,7 @@ define double @test_simplify1(double %d) { } define float @test_simplify2(float %f) { -; DO-FLOAT-SHRINK: @test_simplify2 +; DO-FLOAT-SHRINK-LABEL: @test_simplify2( %conv1 = fpext float %f to double %neg = fsub double -0.000000e+00, %conv1 %cos = call double @cos(double %neg) @@ -28,7 +28,7 @@ define float @test_simplify2(float %f) { } define float @test_simplify3(float %f) { -; NO-FLOAT-SHRINK: @test_simplify3 +; NO-FLOAT-SHRINK-LABEL: @test_simplify3( %conv1 = fpext float %f to double %neg = fsub double -0.000000e+00, %conv1 %cos = call double @cos(double %neg) diff --git a/test/Transforms/InstCombine/cos-2.ll b/test/Transforms/InstCombine/cos-2.ll index 2f2dfafe484..c9a9c7c0771 100644 --- a/test/Transforms/InstCombine/cos-2.ll +++ b/test/Transforms/InstCombine/cos-2.ll @@ -9,7 +9,7 @@ declare float @cos(double) ; Check that cos functions with the wrong prototype aren't simplified. define float @test_no_simplify1(double %d) { -; CHECK: @test_no_simplify1 +; CHECK-LABEL: @test_no_simplify1( %neg = fsub double -0.000000e+00, %d %cos = call float @cos(double %neg) ; CHECK: call float @cos(double %neg) diff --git a/test/Transforms/InstCombine/disable-simplify-libcalls.ll b/test/Transforms/InstCombine/disable-simplify-libcalls.ll index c2c29368b1a..66527886179 100644 --- a/test/Transforms/InstCombine/disable-simplify-libcalls.ll +++ b/test/Transforms/InstCombine/disable-simplify-libcalls.ll @@ -51,42 +51,42 @@ declare i32 @printf(i8*) declare i32 @sprintf(i8*, i8*) define double @t1(double %x) { -; CHECK: @t1 +; CHECK-LABEL: @t1( %ret = call double @ceil(double %x) ret double %ret ; CHECK: call double @ceil } define double @t2(double %x, double %y) { -; CHECK: @t2 +; CHECK-LABEL: @t2( %ret = call double @copysign(double %x, double %y) ret double %ret ; CHECK: call double @copysign } define double @t3(double %x) { -; CHECK: @t3 +; CHECK-LABEL: @t3( %call = call double @cos(double %x) ret double %call ; CHECK: call double @cos } define double @t4(double %x) { -; CHECK: @t4 +; CHECK-LABEL: @t4( %ret = call double @fabs(double %x) ret double %ret ; CHECK: call double @fabs } define double @t5(double %x) { -; CHECK: @t5 +; CHECK-LABEL: @t5( %ret = call double @floor(double %x) ret double %ret ; CHECK: call double @floor } define i8* @t6(i8* %x) { -; CHECK: @t6 +; CHECK-LABEL: @t6( %empty = getelementptr [1 x i8]* @empty, i32 0, i32 0 %ret = call i8* @strcat(i8* %x, i8* %empty) ret i8* %ret @@ -94,7 +94,7 @@ define i8* @t6(i8* %x) { } define i8* @t7(i8* %x) { -; CHECK: @t7 +; CHECK-LABEL: @t7( %empty = getelementptr [1 x i8]* @empty, i32 0, i32 0 %ret = call i8* @strncat(i8* %x, i8* %empty, i32 1) ret i8* %ret @@ -102,7 +102,7 @@ define i8* @t7(i8* %x) { } define i8* @t8() { -; CHECK: @t8 +; CHECK-LABEL: @t8( %x = getelementptr inbounds [13 x i8]* @.str1, i32 0, i32 0 %ret = call i8* @strchr(i8* %x, i32 119) ret i8* %ret @@ -110,7 +110,7 @@ define i8* @t8() { } define i8* @t9() { -; CHECK: @t9 +; CHECK-LABEL: @t9( %x = getelementptr inbounds [13 x i8]* @.str1, i32 0, i32 0 %ret = call i8* @strrchr(i8* %x, i32 119) ret i8* %ret @@ -118,7 +118,7 @@ define i8* @t9() { } define i32 @t10() { -; CHECK: @t10 +; CHECK-LABEL: @t10( %x = getelementptr inbounds [4 x i8]* @.str2, i32 0, i32 0 %y = getelementptr inbounds [4 x i8]* @.str3, i32 0, i32 0 %ret = call i32 @strcmp(i8* %x, i8* %y) @@ -127,7 +127,7 @@ define i32 @t10() { } define i32 @t11() { -; CHECK: @t11 +; CHECK-LABEL: @t11( %x = getelementptr inbounds [4 x i8]* @.str2, i32 0, i32 0 %y = getelementptr inbounds [4 x i8]* @.str3, i32 0, i32 0 %ret = call i32 @strncmp(i8* %x, i8* %y, i64 3) @@ -136,7 +136,7 @@ define i32 @t11() { } define i8* @t12(i8* %x) { -; CHECK: @t12 +; CHECK-LABEL: @t12( %y = getelementptr inbounds [4 x i8]* @.str2, i32 0, i32 0 %ret = call i8* @strcpy(i8* %x, i8* %y) ret i8* %ret @@ -144,7 +144,7 @@ define i8* @t12(i8* %x) { } define i8* @t13(i8* %x) { -; CHECK: @t13 +; CHECK-LABEL: @t13( %y = getelementptr inbounds [4 x i8]* @.str2, i32 0, i32 0 %ret = call i8* @stpcpy(i8* %x, i8* %y) ret i8* %ret @@ -152,7 +152,7 @@ define i8* @t13(i8* %x) { } define i8* @t14(i8* %x) { -; CHECK: @t14 +; CHECK-LABEL: @t14( %y = getelementptr inbounds [4 x i8]* @.str2, i32 0, i32 0 %ret = call i8* @strncpy(i8* %x, i8* %y, i64 3) ret i8* %ret @@ -160,7 +160,7 @@ define i8* @t14(i8* %x) { } define i64 @t15() { -; CHECK: @t15 +; CHECK-LABEL: @t15( %x = getelementptr inbounds [4 x i8]* @.str2, i32 0, i32 0 %ret = call i64 @strlen(i8* %x) ret i64 %ret @@ -168,7 +168,7 @@ define i64 @t15() { } define i8* @t16(i8* %x) { -; CHECK: @t16 +; CHECK-LABEL: @t16( %y = getelementptr inbounds [1 x i8]* @.str, i32 0, i32 0 %ret = call i8* @strpbrk(i8* %x, i8* %y) ret i8* %ret @@ -176,7 +176,7 @@ define i8* @t16(i8* %x) { } define i64 @t17(i8* %x) { -; CHECK: @t17 +; CHECK-LABEL: @t17( %y = getelementptr inbounds [1 x i8]* @.str, i32 0, i32 0 %ret = call i64 @strspn(i8* %x, i8* %y) ret i64 %ret @@ -184,7 +184,7 @@ define i64 @t17(i8* %x) { } define double @t18(i8** %y) { -; CHECK: @t18 +; CHECK-LABEL: @t18( %x = getelementptr inbounds [6 x i8]* @.str4, i64 0, i64 0 %ret = call double @strtod(i8* %x, i8** %y) ret double %ret @@ -192,7 +192,7 @@ define double @t18(i8** %y) { } define float @t19(i8** %y) { -; CHECK: @t19 +; CHECK-LABEL: @t19( %x = getelementptr inbounds [6 x i8]* @.str4, i64 0, i64 0 %ret = call float @strtof(i8* %x, i8** %y) ret float %ret @@ -200,7 +200,7 @@ define float @t19(i8** %y) { } define x86_fp80 @t20(i8** %y) { -; CHECK: @t20 +; CHECK-LABEL: @t20( %x = getelementptr inbounds [6 x i8]* @.str4, i64 0, i64 0 %ret = call x86_fp80 @strtold(i8* %x, i8** %y) ret x86_fp80 %ret @@ -208,7 +208,7 @@ define x86_fp80 @t20(i8** %y) { } define i64 @t21(i8** %y) { -; CHECK: @t21 +; CHECK-LABEL: @t21( %x = getelementptr inbounds [5 x i8]* @.str5, i64 0, i64 0 %ret = call i64 @strtol(i8* %x, i8** %y, i32 10) ret i64 %ret @@ -216,7 +216,7 @@ define i64 @t21(i8** %y) { } define i64 @t22(i8** %y) { -; CHECK: @t22 +; CHECK-LABEL: @t22( %x = getelementptr inbounds [5 x i8]* @.str5, i64 0, i64 0 %ret = call i64 @strtoll(i8* %x, i8** %y, i32 10) ret i64 %ret @@ -224,7 +224,7 @@ define i64 @t22(i8** %y) { } define i64 @t23(i8** %y) { -; CHECK: @t23 +; CHECK-LABEL: @t23( %x = getelementptr inbounds [5 x i8]* @.str5, i64 0, i64 0 %ret = call i64 @strtoul(i8* %x, i8** %y, i32 10) ret i64 %ret @@ -232,7 +232,7 @@ define i64 @t23(i8** %y) { } define i64 @t24(i8** %y) { -; CHECK: @t24 +; CHECK-LABEL: @t24( %x = getelementptr inbounds [5 x i8]* @.str5, i64 0, i64 0 %ret = call i64 @strtoull(i8* %x, i8** %y, i32 10) ret i64 %ret @@ -240,7 +240,7 @@ define i64 @t24(i8** %y) { } define i64 @t25(i8* %y) { -; CHECK: @t25 +; CHECK-LABEL: @t25( %x = getelementptr [1 x i8]* @empty, i32 0, i32 0 %ret = call i64 @strcspn(i8* %x, i8* %y) ret i64 %ret @@ -248,35 +248,35 @@ define i64 @t25(i8* %y) { } define i32 @t26(i32 %y) { -; CHECK: @t26 +; CHECK-LABEL: @t26( %ret = call i32 @abs(i32 %y) ret i32 %ret ; CHECK: call i32 @abs } define i32 @t27(i32 %y) { -; CHECK: @t27 +; CHECK-LABEL: @t27( %ret = call i32 @ffs(i32 %y) ret i32 %ret ; CHECK: call i32 @ffs } define i32 @t28(i64 %y) { -; CHECK: @t28 +; CHECK-LABEL: @t28( %ret = call i32 @ffsl(i64 %y) ret i32 %ret ; CHECK: call i32 @ffsl } define i32 @t29(i64 %y) { -; CHECK: @t29 +; CHECK-LABEL: @t29( %ret = call i32 @ffsll(i64 %y) ret i32 %ret ; CHECK: call i32 @ffsll } define void @t30() { -; CHECK: @t30 +; CHECK-LABEL: @t30( %x = getelementptr inbounds [13 x i8]* @.str1, i32 0, i32 0 call i32 @fprintf(i8* null, i8* %x) ret void @@ -284,42 +284,42 @@ define void @t30() { } define i32 @t31(i32 %y) { -; CHECK: @t31 +; CHECK-LABEL: @t31( %ret = call i32 @isascii(i32 %y) ret i32 %ret ; CHECK: call i32 @isascii } define i32 @t32(i32 %y) { -; CHECK: @t32 +; CHECK-LABEL: @t32( %ret = call i32 @isdigit(i32 %y) ret i32 %ret ; CHECK: call i32 @isdigit } define i32 @t33(i32 %y) { -; CHECK: @t33 +; CHECK-LABEL: @t33( %ret = call i32 @toascii(i32 %y) ret i32 %ret ; CHECK: call i32 @toascii } define i64 @t34(i64 %y) { -; CHECK: @t34 +; CHECK-LABEL: @t34( %ret = call i64 @labs(i64 %y) ret i64 %ret ; CHECK: call i64 @labs } define i64 @t35(i64 %y) { -; CHECK: @t35 +; CHECK-LABEL: @t35( %ret = call i64 @llabs(i64 %y) ret i64 %ret ; CHECK: call i64 @llabs } define void @t36() { -; CHECK: @t36 +; CHECK-LABEL: @t36( %x = getelementptr inbounds [1 x i8]* @empty, i32 0, i32 0 call i32 @printf(i8* %x) ret void @@ -327,7 +327,7 @@ define void @t36() { } define void @t37(i8* %x) { -; CHECK: @t37 +; CHECK-LABEL: @t37( %y = getelementptr inbounds [13 x i8]* @.str1, i32 0, i32 0 call i32 @sprintf(i8* %x, i8* %y) ret void diff --git a/test/Transforms/InstCombine/div.ll b/test/Transforms/InstCombine/div.ll index 8a0897b972d..f67fd1c51be 100644 --- a/test/Transforms/InstCombine/div.ll +++ b/test/Transforms/InstCombine/div.ll @@ -5,7 +5,7 @@ define i32 @test1(i32 %A) { %B = sdiv i32 %A, 1 ; [#uses=1] ret i32 %B -; CHECK: @test1 +; CHECK-LABEL: @test1( ; CHECK-NEXT: ret i32 %A } @@ -13,7 +13,7 @@ define i32 @test2(i32 %A) { ; => Shift %B = udiv i32 %A, 8 ; [#uses=1] ret i32 %B -; CHECK: @test2 +; CHECK-LABEL: @test2( ; CHECK-NEXT: lshr i32 %A, 3 } @@ -21,7 +21,7 @@ define i32 @test3(i32 %A) { ; => 0, don't need to keep traps %B = sdiv i32 0, %A ; [#uses=1] ret i32 %B -; CHECK: @test3 +; CHECK-LABEL: @test3( ; CHECK-NEXT: ret i32 0 } @@ -29,7 +29,7 @@ define i32 @test4(i32 %A) { ; 0-A %B = sdiv i32 %A, -1 ; [#uses=1] ret i32 %B -; CHECK: @test4 +; CHECK-LABEL: @test4( ; CHECK-NEXT: sub i32 0, %A } @@ -37,7 +37,7 @@ define i32 @test5(i32 %A) { %B = udiv i32 %A, -16 ; [#uses=1] %C = udiv i32 %B, -4 ; [#uses=1] ret i32 %C -; CHECK: @test5 +; CHECK-LABEL: @test5( ; CHECK-NEXT: ret i32 0 } @@ -46,7 +46,7 @@ define i1 @test6(i32 %A) { ; A < 123 %C = icmp eq i32 %B, 0 ; [#uses=1] ret i1 %C -; CHECK: @test6 +; CHECK-LABEL: @test6( ; CHECK-NEXT: icmp ult i32 %A, 123 } @@ -55,7 +55,7 @@ define i1 @test7(i32 %A) { ; A >= 20 && A < 30 %C = icmp eq i32 %B, 2 ; [#uses=1] ret i1 %C -; CHECK: @test7 +; CHECK-LABEL: @test7( ; CHECK-NEXT: add i32 %A, -20 ; CHECK-NEXT: icmp ult i32 } @@ -65,7 +65,7 @@ define i1 @test8(i8 %A) { ; A >= 246 %C = icmp eq i8 %B, 2 ; [#uses=1] ret i1 %C -; CHECK: @test8 +; CHECK-LABEL: @test8( ; CHECK-NEXT: icmp ugt i8 %A, -11 } @@ -74,7 +74,7 @@ define i1 @test9(i8 %A) { ; A < 246 %C = icmp ne i8 %B, 2 ; [#uses=1] ret i1 %C -; CHECK: @test9 +; CHECK-LABEL: @test9( ; CHECK-NEXT: icmp ult i8 %A, -10 } @@ -82,7 +82,7 @@ define i32 @test10(i32 %X, i1 %C) { %V = select i1 %C, i32 64, i32 8 ; [#uses=1] %R = udiv i32 %X, %V ; [#uses=1] ret i32 %R -; CHECK: @test10 +; CHECK-LABEL: @test10( ; CHECK-NEXT: select i1 %C, i32 6, i32 3 ; CHECK-NEXT: lshr i32 %X } @@ -91,7 +91,7 @@ define i32 @test11(i32 %X, i1 %C) { %A = select i1 %C, i32 1024, i32 32 ; [#uses=1] %B = udiv i32 %X, %A ; [#uses=1] ret i32 %B -; CHECK: @test11 +; CHECK-LABEL: @test11( ; CHECK-NEXT: select i1 %C, i32 10, i32 5 ; CHECK-NEXT: lshr i32 %X } @@ -100,14 +100,14 @@ define i32 @test11(i32 %X, i1 %C) { define i32 @test12(i32 %x) nounwind { %tmp3 = udiv i32 %x, %x ; 1 ret i32 %tmp3 -; CHECK: @test12 +; CHECK-LABEL: @test12( ; CHECK-NEXT: ret i32 1 } define i32 @test13(i32 %x) nounwind { %tmp3 = sdiv i32 %x, %x ; 1 ret i32 %tmp3 -; CHECK: @test13 +; CHECK-LABEL: @test13( ; CHECK-NEXT: ret i32 1 } @@ -115,7 +115,7 @@ define i32 @test14(i8 %x) nounwind { %zext = zext i8 %x to i32 %div = udiv i32 %zext, 257 ; 0 ret i32 %div -; CHECK: @test14 +; CHECK-LABEL: @test14( ; CHECK-NEXT: ret i32 0 } @@ -125,7 +125,7 @@ define i32 @test15(i32 %a, i32 %b) nounwind { %div = lshr i32 %shl, 2 %div2 = udiv i32 %a, %div ret i32 %div2 -; CHECK: @test15 +; CHECK-LABEL: @test15( ; CHECK-NEXT: add i32 %b, -2 ; CHECK-NEXT: lshr i32 %a, ; CHECK-NEXT: ret i32 diff --git a/test/Transforms/InstCombine/exact.ll b/test/Transforms/InstCombine/exact.ll index 88ca88c3b92..868d60ac46b 100644 --- a/test/Transforms/InstCombine/exact.ll +++ b/test/Transforms/InstCombine/exact.ll @@ -1,20 +1,20 @@ ; RUN: opt < %s -instcombine -S | FileCheck %s -; CHECK: @sdiv1 +; CHECK-LABEL: @sdiv1( ; CHECK: sdiv i32 %x, 8 define i32 @sdiv1(i32 %x) { %y = sdiv i32 %x, 8 ret i32 %y } -; CHECK: @sdiv2 +; CHECK-LABEL: @sdiv2( ; CHECK: ashr exact i32 %x, 3 define i32 @sdiv2(i32 %x) { %y = sdiv exact i32 %x, 8 ret i32 %y } -; CHECK: @sdiv3 +; CHECK-LABEL: @sdiv3( ; CHECK: %y = srem i32 %x, 3 ; CHECK: %z = sub i32 %x, %y ; CHECK: ret i32 %z @@ -24,7 +24,7 @@ define i32 @sdiv3(i32 %x) { ret i32 %z } -; CHECK: @sdiv4 +; CHECK-LABEL: @sdiv4( ; CHECK: ret i32 %x define i32 @sdiv4(i32 %x) { %y = sdiv exact i32 %x, 3 @@ -42,7 +42,7 @@ define i32 @sdiv5(i32 %x) { ret i32 %z } -; CHECK: @sdiv6 +; CHECK-LABEL: @sdiv6( ; CHECK: %z = sub i32 0, %x ; CHECK: ret i32 %z define i32 @sdiv6(i32 %x) { @@ -51,7 +51,7 @@ define i32 @sdiv6(i32 %x) { ret i32 %z } -; CHECK: @udiv1 +; CHECK-LABEL: @udiv1( ; CHECK: ret i32 %x define i32 @udiv1(i32 %x, i32 %w) { %y = udiv exact i32 %x, %w @@ -59,7 +59,7 @@ define i32 @udiv1(i32 %x, i32 %w) { ret i32 %z } -; CHECK: @udiv2 +; CHECK-LABEL: @udiv2( ; CHECK: %z = lshr exact i32 %x, %w ; CHECK: ret i32 %z define i32 @udiv2(i32 %x, i32 %w) { @@ -68,7 +68,7 @@ define i32 @udiv2(i32 %x, i32 %w) { ret i32 %z } -; CHECK: @ashr1 +; CHECK-LABEL: @ashr1( ; CHECK: %B = ashr exact i64 %A, 2 ; CHECK: ret i64 %B define i64 @ashr1(i64 %X) nounwind { @@ -78,7 +78,7 @@ define i64 @ashr1(i64 %X) nounwind { } ; PR9120 -; CHECK: @ashr_icmp1 +; CHECK-LABEL: @ashr_icmp1( ; CHECK: %B = icmp eq i64 %X, 0 ; CHECK: ret i1 %B define i1 @ashr_icmp1(i64 %X) nounwind { @@ -87,7 +87,7 @@ define i1 @ashr_icmp1(i64 %X) nounwind { ret i1 %B } -; CHECK: @ashr_icmp2 +; CHECK-LABEL: @ashr_icmp2( ; CHECK: %Z = icmp slt i64 %X, 16 ; CHECK: ret i1 %Z define i1 @ashr_icmp2(i64 %X) nounwind { @@ -98,7 +98,7 @@ define i1 @ashr_icmp2(i64 %X) nounwind { ; PR9998 ; Make sure we don't transform the ashr here into an sdiv -; CHECK: @pr9998 +; CHECK-LABEL: @pr9998( ; CHECK: [[BIT:%[A-Za-z0-9.]+]] = and i32 %V, 1 ; CHECK-NEXT: [[CMP:%[A-Za-z0-9.]+]] = icmp ne i32 [[BIT]], 0 ; CHECK-NEXT: ret i1 [[CMP]] @@ -113,7 +113,7 @@ entry: -; CHECK: @udiv_icmp1 +; CHECK-LABEL: @udiv_icmp1( ; CHECK: icmp ne i64 %X, 0 define i1 @udiv_icmp1(i64 %X) nounwind { %A = udiv exact i64 %X, 5 ; X/5 @@ -121,7 +121,7 @@ define i1 @udiv_icmp1(i64 %X) nounwind { ret i1 %B } -; CHECK: @sdiv_icmp1 +; CHECK-LABEL: @sdiv_icmp1( ; CHECK: icmp eq i64 %X, 0 define i1 @sdiv_icmp1(i64 %X) nounwind { %A = sdiv exact i64 %X, 5 ; X/5 == 0 --> x == 0 @@ -129,7 +129,7 @@ define i1 @sdiv_icmp1(i64 %X) nounwind { ret i1 %B } -; CHECK: @sdiv_icmp2 +; CHECK-LABEL: @sdiv_icmp2( ; CHECK: icmp eq i64 %X, 5 define i1 @sdiv_icmp2(i64 %X) nounwind { %A = sdiv exact i64 %X, 5 ; X/5 == 1 --> x == 5 @@ -137,7 +137,7 @@ define i1 @sdiv_icmp2(i64 %X) nounwind { ret i1 %B } -; CHECK: @sdiv_icmp3 +; CHECK-LABEL: @sdiv_icmp3( ; CHECK: icmp eq i64 %X, -5 define i1 @sdiv_icmp3(i64 %X) nounwind { %A = sdiv exact i64 %X, 5 ; X/5 == -1 --> x == -5 @@ -145,7 +145,7 @@ define i1 @sdiv_icmp3(i64 %X) nounwind { ret i1 %B } -; CHECK: @sdiv_icmp4 +; CHECK-LABEL: @sdiv_icmp4( ; CHECK: icmp eq i64 %X, 0 define i1 @sdiv_icmp4(i64 %X) nounwind { %A = sdiv exact i64 %X, -5 ; X/-5 == 0 --> x == 0 @@ -153,7 +153,7 @@ define i1 @sdiv_icmp4(i64 %X) nounwind { ret i1 %B } -; CHECK: @sdiv_icmp5 +; CHECK-LABEL: @sdiv_icmp5( ; CHECK: icmp eq i64 %X, -5 define i1 @sdiv_icmp5(i64 %X) nounwind { %A = sdiv exact i64 %X, -5 ; X/-5 == 1 --> x == -5 @@ -161,7 +161,7 @@ define i1 @sdiv_icmp5(i64 %X) nounwind { ret i1 %B } -; CHECK: @sdiv_icmp6 +; CHECK-LABEL: @sdiv_icmp6( ; CHECK: icmp eq i64 %X, 5 define i1 @sdiv_icmp6(i64 %X) nounwind { %A = sdiv exact i64 %X, -5 ; X/-5 == 1 --> x == 5 diff --git a/test/Transforms/InstCombine/exp2-1.ll b/test/Transforms/InstCombine/exp2-1.ll index 1b0ad500041..99fb9ecfd2b 100644 --- a/test/Transforms/InstCombine/exp2-1.ll +++ b/test/Transforms/InstCombine/exp2-1.ll @@ -10,7 +10,7 @@ declare float @exp2f(float) ; Check exp2(sitofp(x)) -> ldexp(1.0, sext(x)). define double @test_simplify1(i32 %x) { -; CHECK: @test_simplify1 +; CHECK-LABEL: @test_simplify1( %conv = sitofp i32 %x to double %ret = call double @exp2(double %conv) ; CHECK: call double @ldexp @@ -18,7 +18,7 @@ define double @test_simplify1(i32 %x) { } define double @test_simplify2(i16 signext %x) { -; CHECK: @test_simplify2 +; CHECK-LABEL: @test_simplify2( %conv = sitofp i16 %x to double %ret = call double @exp2(double %conv) ; CHECK: call double @ldexp @@ -26,7 +26,7 @@ define double @test_simplify2(i16 signext %x) { } define double @test_simplify3(i8 signext %x) { -; CHECK: @test_simplify3 +; CHECK-LABEL: @test_simplify3( %conv = sitofp i8 %x to double %ret = call double @exp2(double %conv) ; CHECK: call double @ldexp @@ -34,7 +34,7 @@ define double @test_simplify3(i8 signext %x) { } define float @test_simplify4(i32 %x) { -; CHECK: @test_simplify4 +; CHECK-LABEL: @test_simplify4( %conv = sitofp i32 %x to float %ret = call float @exp2f(float %conv) ; CHECK: call float @ldexpf @@ -44,7 +44,7 @@ define float @test_simplify4(i32 %x) { ; Check exp2(uitofp(x)) -> ldexp(1.0, zext(x)). define double @test_no_simplify1(i32 %x) { -; CHECK: @test_no_simplify1 +; CHECK-LABEL: @test_no_simplify1( %conv = uitofp i32 %x to double %ret = call double @exp2(double %conv) ; CHECK: call double @exp2 @@ -52,7 +52,7 @@ define double @test_no_simplify1(i32 %x) { } define double @test_simplify6(i16 zeroext %x) { -; CHECK: @test_simplify6 +; CHECK-LABEL: @test_simplify6( %conv = uitofp i16 %x to double %ret = call double @exp2(double %conv) ; CHECK: call double @ldexp @@ -60,7 +60,7 @@ define double @test_simplify6(i16 zeroext %x) { } define double @test_simplify7(i8 zeroext %x) { -; CHECK: @test_simplify7 +; CHECK-LABEL: @test_simplify7( %conv = uitofp i8 %x to double %ret = call double @exp2(double %conv) ; CHECK: call double @ldexp @@ -68,7 +68,7 @@ define double @test_simplify7(i8 zeroext %x) { } define float @test_simplify8(i8 zeroext %x) { -; CHECK: @test_simplify8 +; CHECK-LABEL: @test_simplify8( %conv = uitofp i8 %x to float %ret = call float @exp2f(float %conv) ; CHECK: call float @ldexpf diff --git a/test/Transforms/InstCombine/exp2-2.ll b/test/Transforms/InstCombine/exp2-2.ll index bed063798e2..19368dc48c6 100644 --- a/test/Transforms/InstCombine/exp2-2.ll +++ b/test/Transforms/InstCombine/exp2-2.ll @@ -9,7 +9,7 @@ declare float @exp2(double) ; Check that exp2 functions with the wrong prototype aren't simplified. define float @test_no_simplify1(i32 %x) { -; CHECK: @test_no_simplify1 +; CHECK-LABEL: @test_no_simplify1( %conv = sitofp i32 %x to double %ret = call float @exp2(double %conv) ; CHECK: call float @exp2(double %conv) diff --git a/test/Transforms/InstCombine/fast-math.ll b/test/Transforms/InstCombine/fast-math.ll index edcbcc71dfb..a9a7015f62d 100644 --- a/test/Transforms/InstCombine/fast-math.ll +++ b/test/Transforms/InstCombine/fast-math.ll @@ -6,14 +6,14 @@ define float @fold(float %a) { %mul = fmul fast float %a, 0x3FF3333340000000 %mul1 = fmul fast float %mul, 0x4002666660000000 ret float %mul1 -; CHECK: @fold +; CHECK-LABEL: @fold( ; CHECK: fmul fast float %a, 0x4006147AE0000000 } ; Same testing-case as the one used in fold() except that the operators have ; fixed FP mode. define float @notfold(float %a) { -; CHECK: @notfold +; CHECK-LABEL: @notfold( ; CHECK: %mul = fmul fast float %a, 0x3FF3333340000000 %mul = fmul fast float %a, 0x3FF3333340000000 %mul1 = fmul float %mul, 0x4002666660000000 @@ -21,7 +21,7 @@ define float @notfold(float %a) { } define float @fold2(float %a) { -; CHECK: @fold2 +; CHECK-LABEL: @fold2( ; CHECK: fmul fast float %a, 0x4006147AE0000000 %mul = fmul float %a, 0x3FF3333340000000 %mul1 = fmul fast float %mul, 0x4002666660000000 @@ -33,7 +33,7 @@ define double @fold3(double %f1) { %t1 = fmul fast double 2.000000e+00, %f1 %t2 = fadd fast double %f1, %t1 ret double %t2 -; CHECK: @fold3 +; CHECK-LABEL: @fold3( ; CHECK: fmul fast double %f1, 3.000000e+00 } @@ -43,7 +43,7 @@ define float @fold4(float %f1, float %f2) { %sub1 = fsub float 5.000000e+00, %f2 %add = fadd fast float %sub, %sub1 ret float %add -; CHECK: @fold4 +; CHECK-LABEL: @fold4( ; CHECK: %1 = fadd fast float %f1, %f2 ; CHECK: fsub fast float 9.000000e+00, %1 } @@ -53,7 +53,7 @@ define float @fold5(float %f1, float %f2) { %add = fadd float %f1, 4.000000e+00 %add1 = fadd fast float %add, 5.000000e+00 ret float %add1 -; CHECK: @fold5 +; CHECK-LABEL: @fold5( ; CHECK: fadd fast float %f1, 9.000000e+00 } @@ -62,7 +62,7 @@ define float @fold6(float %f1) { %t1 = fadd fast float %f1, %f1 %t2 = fadd fast float %f1, %t1 ret float %t2 -; CHECK: @fold6 +; CHECK-LABEL: @fold6( ; CHECK: fmul fast float %f1, 3.000000e+00 } @@ -72,7 +72,7 @@ define float @fold7(float %f1) { %t2 = fadd fast float %f1, %f1 %t3 = fadd fast float %t1, %t2 ret float %t3 -; CHECK: @fold7 +; CHECK-LABEL: @fold7( ; CHECK: fmul fast float %f1, 7.000000e+00 } @@ -92,7 +92,7 @@ define float @fold9(float %f1, float %f2) { %t3 = fsub fast float %f1, %t1 ret float %t3 -; CHECK: @fold9 +; CHECK-LABEL: @fold9( ; CHECK: fsub fast float 0.000000e+00, %f2 } @@ -106,7 +106,7 @@ define float @fold10(float %f1, float %f2) { %t2 = fsub fast float %f2, 3.000000e+00 %t3 = fadd fast float %t1, %t2 ret float %t3 -; CHECK: @fold10 +; CHECK-LABEL: @fold10( ; CHECK: %t3 = fadd fast float %t2, -1.000000e+00 ; CHECK: ret float %t3 } @@ -117,7 +117,7 @@ define float @fail1(float %f1, float %f2) { %add = fadd fast float %conv3, %conv3 %add2 = fadd fast float %add, %conv3 ret float %add2 -; CHECK: @fail1 +; CHECK-LABEL: @fail1( ; CHECK: ret } @@ -126,7 +126,7 @@ define double @fail2(double %f1, double %f2) { %t2 = fadd fast double %f1, %f2 %t3 = fsub fast double %t1, %t2 ret double %t3 -; CHECK: @fail2 +; CHECK-LABEL: @fail2( ; CHECK: ret } @@ -152,7 +152,7 @@ define float @fmul_distribute1(float %f1) { %t2 = fadd float %t1, 2.0e+3 %t3 = fmul fast float %t2, 5.0e+3 ret float %t3 -; CHECK: @fmul_distribute1 +; CHECK-LABEL: @fmul_distribute1( ; CHECK: %1 = fmul fast float %f1, 3.000000e+07 ; CHECK: %t3 = fadd fast float %1, 1.000000e+07 } @@ -165,7 +165,7 @@ define double @fmul_distribute2(double %f1, double %f2) { %t3 = fmul fast double %t2, 0x10000000000000 ret double %t3 -; CHECK: @fmul_distribute2 +; CHECK-LABEL: @fmul_distribute2( ; CHECK: %1 = fdiv fast double %f1, 0x7FE8000000000000 ; CHECK: fadd fast double %1, 0x69000000000000 } @@ -178,7 +178,7 @@ define double @fmul_distribute3(double %f1) { %t3 = fmul fast double %t2, 0x10000000000000 ret double %t3 -; CHECK: @fmul_distribute3 +; CHECK-LABEL: @fmul_distribute3( ; CHECK: fmul fast double %t2, 0x10000000000000 } @@ -188,7 +188,7 @@ define float @fmul_distribute4(float %f1) { %t2 = fsub float 2.0e+3, %t1 %t3 = fmul fast float %t2, 5.0e+3 ret float %t3 -; CHECK: @fmul_distribute4 +; CHECK-LABEL: @fmul_distribute4( ; CHECK: %1 = fmul fast float %f1, 3.000000e+07 ; CHECK: %t3 = fsub fast float 1.000000e+07, %1 } @@ -198,7 +198,7 @@ define float @fmul2(float %f1) { %t1 = fdiv float 2.0e+3, %f1 %t3 = fmul fast float %t1, 6.0e+3 ret float %t3 -; CHECK: @fmul2 +; CHECK-LABEL: @fmul2( ; CHECK: fdiv fast float 1.200000e+07, %f1 } @@ -207,7 +207,7 @@ define float @fmul3(float %f1, float %f2) { %t1 = fdiv float %f1, 2.0e+3 %t3 = fmul fast float %t1, 6.0e+3 ret float %t3 -; CHECK: @fmul3 +; CHECK-LABEL: @fmul3( ; CHECK: fmul fast float %f1, 3.000000e+00 } @@ -218,7 +218,7 @@ define float @fmul4(float %f1, float %f2) { %t1 = fdiv float %f1, 2.0e+3 %t3 = fmul fast float %t1, 0x3810000000000000 ret float %t3 -; CHECK: @fmul4 +; CHECK-LABEL: @fmul4( ; CHECK: fmul fast float %t1, 0x3810000000000000 } @@ -229,7 +229,7 @@ define float @fmul5(float %f1, float %f2) { %t1 = fdiv float %f1, 3.0e+0 %t3 = fmul fast float %t1, 0x3810000000000000 ret float %t3 -; CHECK: @fmul5 +; CHECK-LABEL: @fmul5( ; CHECK: fdiv fast float %f1, 0x47E8000000000000 } @@ -238,7 +238,7 @@ define float @fmul6(float %f1, float %f2) { %mul = fmul float %f1, %f2 %mul1 = fmul fast float %mul, %f1 ret float %mul1 -; CHECK: @fmul6 +; CHECK-LABEL: @fmul6( ; CHECK: fmul fast float %f1, %f1 } @@ -248,7 +248,7 @@ define float @fmul7(float %f1, float %f2) { %mul1 = fmul fast float %mul, %f1 %add = fadd float %mul1, %mul ret float %add -; CHECK: @fmul7 +; CHECK-LABEL: @fmul7( ; CHECK: fmul fast float %mul, %f1 } @@ -262,7 +262,7 @@ define float @fneg1(float %f1, float %f2) { %sub1 = fsub nsz float 0.000000e+00, %f2 %mul = fmul float %sub, %sub1 ret float %mul -; CHECK: @fneg1 +; CHECK-LABEL: @fneg1( ; CHECK: fmul float %f1, %f2 } @@ -280,7 +280,7 @@ define float @fdiv1(float %x) { ; 0x3FF3333340000000 = 1.2f ; 0x4002666660000000 = 2.3f ; 0x3FD7303B60000000 = 0.36231884057971014492 -; CHECK: @fdiv1 +; CHECK-LABEL: @fdiv1( ; CHECK: fmul fast float %x, 0x3FD7303B60000000 } @@ -293,7 +293,7 @@ define float @fdiv2(float %x) { ; 0x3FF3333340000000 = 1.2f ; 0x4002666660000000 = 2.3f ; 0x3FE0B21660000000 = 0.52173918485641479492 -; CHECK: @fdiv2 +; CHECK-LABEL: @fdiv2( ; CHECK: fmul fast float %x, 0x3FE0B21660000000 } @@ -303,7 +303,7 @@ define float @fdiv3(float %x) { %div = fdiv float %x, 0x47EFFFFFE0000000 %div1 = fdiv fast float %div, 0x4002666660000000 ret float %div1 -; CHECK: @fdiv3 +; CHECK-LABEL: @fdiv3( ; CHECK: fdiv float %x, 0x47EFFFFFE0000000 } @@ -312,7 +312,7 @@ define float @fdiv4(float %x) { %mul = fmul float %x, 0x47EFFFFFE0000000 %div = fdiv float %mul, 0x3FC99999A0000000 ret float %div -; CHECK: @fdiv4 +; CHECK-LABEL: @fdiv4( ; CHECK: fmul float %x, 0x47EFFFFFE0000000 } @@ -321,7 +321,7 @@ define float @fdiv5(float %f1, float %f2, float %f3) { %t1 = fdiv float %f1, %f2 %t2 = fdiv fast float %t1, %f3 ret float %t2 -; CHECK: @fdiv5 +; CHECK-LABEL: @fdiv5( ; CHECK: fmul float %f2, %f3 } @@ -330,7 +330,7 @@ define float @fdiv6(float %f1, float %f2, float %f3) { %t1 = fdiv float %f1, %f2 %t2 = fdiv fast float %f3, %t1 ret float %t2 -; CHECK: @fdiv6 +; CHECK-LABEL: @fdiv6( ; CHECK: fmul float %f3, %f2 } @@ -339,7 +339,7 @@ define float @fdiv7(float %x) { %t1 = fmul float %x, 3.0e0 %t2 = fdiv fast float 15.0e0, %t1 ret float %t2 -; CHECK: @fdiv7 +; CHECK-LABEL: @fdiv7( ; CHECK: fdiv fast float 5.000000e+00, %x } @@ -348,7 +348,7 @@ define float @fdiv8(float %x) { %t1 = fdiv float %x, 3.0e0 %t2 = fdiv fast float 15.0e0, %t1 ret float %t2 -; CHECK: @fdiv8 +; CHECK-LABEL: @fdiv8( ; CHECK: fdiv fast float 4.500000e+01, %x } @@ -357,7 +357,7 @@ define float @fdiv9(float %x) { %t1 = fdiv float 3.0e0, %x %t2 = fdiv fast float 15.0e0, %t1 ret float %t2 -; CHECK: @fdiv9 +; CHECK-LABEL: @fdiv9( ; CHECK: fmul fast float %x, 5.000000e+00 } @@ -372,7 +372,7 @@ define float @fact_mul1(float %x, float %y, float %z) { %t2 = fmul fast float %y, %z %t3 = fadd fast float %t1, %t2 ret float %t3 -; CHECK: @fact_mul1 +; CHECK-LABEL: @fact_mul1( ; CHECK: fmul fast float %1, %z } @@ -382,7 +382,7 @@ define float @fact_mul2(float %x, float %y, float %z) { %t2 = fmul fast float %y, %z %t3 = fsub fast float %t1, %t2 ret float %t3 -; CHECK: @fact_mul2 +; CHECK-LABEL: @fact_mul2( ; CHECK: fmul fast float %1, %z } @@ -392,7 +392,7 @@ define float @fact_mul3(float %x, float %y, float %z) { %t1 = fmul fast float %z, %x %t3 = fsub fast float %t1, %t2 ret float %t3 -; CHECK: @fact_mul3 +; CHECK-LABEL: @fact_mul3( ; CHECK: fmul fast float %1, %z } @@ -402,7 +402,7 @@ define float @fact_mul4(float %x, float %y, float %z) { %t2 = fmul fast float %z, %y %t3 = fsub fast float %t1, %t2 ret float %t3 -; CHECK: @fact_mul4 +; CHECK-LABEL: @fact_mul4( ; CHECK: fmul fast float %1, %z } diff --git a/test/Transforms/InstCombine/fcmp.ll b/test/Transforms/InstCombine/fcmp.ll index 376fa079d24..afc6782a012 100644 --- a/test/Transforms/InstCombine/fcmp.ll +++ b/test/Transforms/InstCombine/fcmp.ll @@ -5,7 +5,7 @@ define i1 @test1(float %x, float %y) nounwind { %ext2 = fpext float %y to double %cmp = fcmp ogt double %ext1, %ext2 ret i1 %cmp -; CHECK: @test1 +; CHECK-LABEL: @test1( ; CHECK-NEXT: fcmp ogt float %x, %y } @@ -13,7 +13,7 @@ define i1 @test2(float %a) nounwind { %ext = fpext float %a to double %cmp = fcmp ogt double %ext, 1.000000e+00 ret i1 %cmp -; CHECK: @test2 +; CHECK-LABEL: @test2( ; CHECK-NEXT: fcmp ogt float %a, 1.0 } @@ -21,7 +21,7 @@ define i1 @test3(float %a) nounwind { %ext = fpext float %a to double %cmp = fcmp ogt double %ext, 0x3FF0000000000001 ; more precision than float. ret i1 %cmp -; CHECK: @test3 +; CHECK-LABEL: @test3( ; CHECK-NEXT: fpext float %a to double } @@ -29,7 +29,7 @@ define i1 @test4(float %a) nounwind { %ext = fpext float %a to double %cmp = fcmp ogt double %ext, 0x36A0000000000000 ; denormal in float. ret i1 %cmp -; CHECK: @test4 +; CHECK-LABEL: @test4( ; CHECK-NEXT: fpext float %a to double } @@ -37,7 +37,7 @@ define i1 @test5(float %a) nounwind { %neg = fsub float -0.000000e+00, %a %cmp = fcmp ogt float %neg, 1.000000e+00 ret i1 %cmp -; CHECK: @test5 +; CHECK-LABEL: @test5( ; CHECK-NEXT: fcmp olt float %a, -1.0 } @@ -46,7 +46,7 @@ define i1 @test6(float %x, float %y) nounwind { %neg2 = fsub float -0.000000e+00, %y %cmp = fcmp olt float %neg1, %neg2 ret i1 %cmp -; CHECK: @test6 +; CHECK-LABEL: @test6( ; CHECK-NEXT: fcmp ogt float %x, %y } @@ -54,7 +54,7 @@ define i1 @test7(float %x) nounwind readnone ssp noredzone { %ext = fpext float %x to ppc_fp128 %cmp = fcmp ogt ppc_fp128 %ext, 0xM00000000000000000000000000000000 ret i1 %cmp -; CHECK: @test7 +; CHECK-LABEL: @test7( ; CHECK-NEXT: fcmp ogt float %x, 0.000000e+00 } @@ -65,7 +65,7 @@ define float @test8(float %x) nounwind readnone optsize ssp { %conv2 = sitofp i32 %conv1 to float ret float %conv2 ; Float comparison to zero shouldn't cast to double. -; CHECK: @test8 +; CHECK-LABEL: @test8( ; CHECK-NEXT: fcmp olt float %x, 0.000000e+00 } @@ -76,7 +76,7 @@ define i32 @test9(double %a) nounwind { %cmp = fcmp olt double %call, 0.000000e+00 %conv = zext i1 %cmp to i32 ret i32 %conv -; CHECK: @test9 +; CHECK-LABEL: @test9( ; CHECK-NOT: fabs ; CHECK: ret i32 0 } @@ -86,7 +86,7 @@ define i32 @test10(double %a) nounwind { %cmp = fcmp ole double %call, 0.000000e+00 %conv = zext i1 %cmp to i32 ret i32 %conv -; CHECK: @test10 +; CHECK-LABEL: @test10( ; CHECK-NOT: fabs ; CHECK: fcmp oeq double %a, 0.000000e+00 } @@ -96,7 +96,7 @@ define i32 @test11(double %a) nounwind { %cmp = fcmp ogt double %call, 0.000000e+00 %conv = zext i1 %cmp to i32 ret i32 %conv -; CHECK: @test11 +; CHECK-LABEL: @test11( ; CHECK-NOT: fabs ; CHECK: fcmp one double %a, 0.000000e+00 } @@ -106,7 +106,7 @@ define i32 @test12(double %a) nounwind { %cmp = fcmp oge double %call, 0.000000e+00 %conv = zext i1 %cmp to i32 ret i32 %conv -; CHECK: @test12 +; CHECK-LABEL: @test12( ; CHECK-NOT: fabs ; CHECK: fcmp ord double %a, 0.000000e+00 } @@ -116,7 +116,7 @@ define i32 @test13(double %a) nounwind { %cmp = fcmp une double %call, 0.000000e+00 %conv = zext i1 %cmp to i32 ret i32 %conv -; CHECK: @test13 +; CHECK-LABEL: @test13( ; CHECK-NOT: fabs ; CHECK: fcmp une double %a, 0.000000e+00 } @@ -126,7 +126,7 @@ define i32 @test14(double %a) nounwind { %cmp = fcmp oeq double %call, 0.000000e+00 %conv = zext i1 %cmp to i32 ret i32 %conv -; CHECK: @test14 +; CHECK-LABEL: @test14( ; CHECK-NOT: fabs ; CHECK: fcmp oeq double %a, 0.000000e+00 } @@ -136,7 +136,7 @@ define i32 @test15(double %a) nounwind { %cmp = fcmp one double %call, 0.000000e+00 %conv = zext i1 %cmp to i32 ret i32 %conv -; CHECK: @test15 +; CHECK-LABEL: @test15( ; CHECK-NOT: fabs ; CHECK: fcmp one double %a, 0.000000e+00 } @@ -146,7 +146,7 @@ define i32 @test16(double %a) nounwind { %cmp = fcmp ueq double %call, 0.000000e+00 %conv = zext i1 %cmp to i32 ret i32 %conv -; CHECK: @test16 +; CHECK-LABEL: @test16( ; CHECK-NOT: fabs ; CHECK: fcmp ueq double %a, 0.000000e+00 } diff --git a/test/Transforms/InstCombine/fdiv.ll b/test/Transforms/InstCombine/fdiv.ll index a2cce016e18..1edbc5ecd60 100644 --- a/test/Transforms/InstCombine/fdiv.ll +++ b/test/Transforms/InstCombine/fdiv.ll @@ -4,7 +4,7 @@ define float @test1(float %x) nounwind readnone ssp { %div = fdiv float %x, 0x3810000000000000 ret float %div -; CHECK: @test1 +; CHECK-LABEL: @test1( ; CHECK-NEXT: fmul float %x, 0x47D0000000000000 } @@ -12,7 +12,7 @@ define float @test2(float %x) nounwind readnone ssp { %div = fdiv float %x, 0x47E0000000000000 ret float %div -; CHECK: @test2 +; CHECK-LABEL: @test2( ; CHECK-NEXT: fdiv float %x, 0x47E0000000000000 } @@ -20,6 +20,6 @@ define float @test3(float %x) nounwind readnone ssp { %div = fdiv float %x, 0x36A0000000000000 ret float %div -; CHECK: @test3 +; CHECK-LABEL: @test3( ; CHECK-NEXT: fdiv float %x, 0x36A0000000000000 } diff --git a/test/Transforms/InstCombine/ffs-1.ll b/test/Transforms/InstCombine/ffs-1.ll index 0510df3d24b..8f0b38fa9c4 100644 --- a/test/Transforms/InstCombine/ffs-1.ll +++ b/test/Transforms/InstCombine/ffs-1.ll @@ -12,21 +12,21 @@ declare i32 @ffsll(i64) ; Check ffs(0) -> 0. define i32 @test_simplify1() { -; CHECK: @test_simplify1 +; CHECK-LABEL: @test_simplify1( %ret = call i32 @ffs(i32 0) ret i32 %ret ; CHECK-NEXT: ret i32 0 } define i32 @test_simplify2() { -; CHECK-LINUX: @test_simplify2 +; CHECK-LINUX-LABEL: @test_simplify2( %ret = call i32 @ffsl(i32 0) ret i32 %ret ; CHECK-LINUX-NEXT: ret i32 0 } define i32 @test_simplify3() { -; CHECK-LINUX: @test_simplify3 +; CHECK-LINUX-LABEL: @test_simplify3( %ret = call i32 @ffsll(i64 0) ret i32 %ret ; CHECK-LINUX-NEXT: ret i32 0 @@ -35,63 +35,63 @@ define i32 @test_simplify3() { ; Check ffs(c) -> cttz(c) + 1, where 'c' is a constant. define i32 @test_simplify4() { -; CHECK: @test_simplify4 +; CHECK-LABEL: @test_simplify4( %ret = call i32 @ffs(i32 1) ret i32 %ret ; CHECK-NEXT: ret i32 1 } define i32 @test_simplify5() { -; CHECK: @test_simplify5 +; CHECK-LABEL: @test_simplify5( %ret = call i32 @ffs(i32 2048) ret i32 %ret ; CHECK-NEXT: ret i32 12 } define i32 @test_simplify6() { -; CHECK: @test_simplify6 +; CHECK-LABEL: @test_simplify6( %ret = call i32 @ffs(i32 65536) ret i32 %ret ; CHECK-NEXT: ret i32 17 } define i32 @test_simplify7() { -; CHECK-LINUX: @test_simplify7 +; CHECK-LINUX-LABEL: @test_simplify7( %ret = call i32 @ffsl(i32 65536) ret i32 %ret ; CHECK-LINUX-NEXT: ret i32 17 } define i32 @test_simplify8() { -; CHECK-LINUX: @test_simplify8 +; CHECK-LINUX-LABEL: @test_simplify8( %ret = call i32 @ffsll(i64 1024) ret i32 %ret ; CHECK-LINUX-NEXT: ret i32 11 } define i32 @test_simplify9() { -; CHECK-LINUX: @test_simplify9 +; CHECK-LINUX-LABEL: @test_simplify9( %ret = call i32 @ffsll(i64 65536) ret i32 %ret ; CHECK-LINUX-NEXT: ret i32 17 } define i32 @test_simplify10() { -; CHECK-LINUX: @test_simplify10 +; CHECK-LINUX-LABEL: @test_simplify10( %ret = call i32 @ffsll(i64 17179869184) ret i32 %ret ; CHECK-LINUX-NEXT: ret i32 35 } define i32 @test_simplify11() { -; CHECK-LINUX: @test_simplify11 +; CHECK-LINUX-LABEL: @test_simplify11( %ret = call i32 @ffsll(i64 281474976710656) ret i32 %ret ; CHECK-LINUX-NEXT: ret i32 49 } define i32 @test_simplify12() { -; CHECK-LINUX: @test_simplify12 +; CHECK-LINUX-LABEL: @test_simplify12( %ret = call i32 @ffsll(i64 1152921504606846976) ret i32 %ret ; CHECK-LINUX-NEXT: ret i32 61 @@ -100,7 +100,7 @@ define i32 @test_simplify12() { ; Check ffs(x) -> x != 0 ? (i32)llvm.cttz(x) + 1 : 0. define i32 @test_simplify13(i32 %x) { -; CHECK: @test_simplify13 +; CHECK-LABEL: @test_simplify13( %ret = call i32 @ffs(i32 %x) ; CHECK-NEXT: [[CTTZ:%[a-z0-9]+]] = call i32 @llvm.cttz.i32(i32 %x, i1 false) ; CHECK-NEXT: [[INC:%[a-z0-9]+]] = add i32 [[CTTZ]], 1 @@ -111,7 +111,7 @@ define i32 @test_simplify13(i32 %x) { } define i32 @test_simplify14(i32 %x) { -; CHECK-LINUX: @test_simplify14 +; CHECK-LINUX-LABEL: @test_simplify14( %ret = call i32 @ffsl(i32 %x) ; CHECK-LINUX-NEXT: [[CTTZ:%[a-z0-9]+]] = call i32 @llvm.cttz.i32(i32 %x, i1 false) ; CHECK-LINUX-NEXT: [[INC:%[a-z0-9]+]] = add i32 [[CTTZ]], 1 @@ -122,7 +122,7 @@ define i32 @test_simplify14(i32 %x) { } define i32 @test_simplify15(i64 %x) { -; CHECK-LINUX: @test_simplify15 +; CHECK-LINUX-LABEL: @test_simplify15( %ret = call i32 @ffsll(i64 %x) ; CHECK-LINUX-NEXT: [[CTTZ:%[a-z0-9]+]] = call i64 @llvm.cttz.i64(i64 %x, i1 false) ; CHECK-LINUX-NEXT: [[INC:%[a-z0-9]+]] = add i64 [[CTTZ]], 1 diff --git a/test/Transforms/InstCombine/float-shrink-compare.ll b/test/Transforms/InstCombine/float-shrink-compare.ll index 0b93e841dc1..26f77a7f702 100644 --- a/test/Transforms/InstCombine/float-shrink-compare.ll +++ b/test/Transforms/InstCombine/float-shrink-compare.ll @@ -9,7 +9,7 @@ define i32 @test1(float %x, float %y) nounwind uwtable { %4 = fcmp oeq double %2, %3 %5 = zext i1 %4 to i32 ret i32 %5 -; CHECK: @test1 +; CHECK-LABEL: @test1( ; CHECK-NEXT: %ceilf = call float @ceilf(float %x) ; CHECK-NEXT: fcmp oeq float %ceilf, %y } @@ -21,7 +21,7 @@ define i32 @test2(float %x, float %y) nounwind uwtable { %4 = fcmp oeq double %2, %3 %5 = zext i1 %4 to i32 ret i32 %5 -; CHECK: @test2 +; CHECK-LABEL: @test2( ; CHECK-NEXT: %fabsf = call float @fabsf(float %x) ; CHECK-NEXT: fcmp oeq float %fabsf, %y } @@ -33,7 +33,7 @@ define i32 @test3(float %x, float %y) nounwind uwtable { %4 = fcmp oeq double %2, %3 %5 = zext i1 %4 to i32 ret i32 %5 -; CHECK: @test3 +; CHECK-LABEL: @test3( ; CHECK-NEXT: %floorf = call float @floorf(float %x) ; CHECK-NEXT: fcmp oeq float %floorf, %y } @@ -45,7 +45,7 @@ define i32 @test4(float %x, float %y) nounwind uwtable { %4 = fcmp oeq double %2, %3 %5 = zext i1 %4 to i32 ret i32 %5 -; CHECK: @test4 +; CHECK-LABEL: @test4( ; CHECK-NEXT: %nearbyintf = call float @nearbyintf(float %x) ; CHECK-NEXT: fcmp oeq float %nearbyintf, %y } @@ -57,7 +57,7 @@ define i32 @test5(float %x, float %y) nounwind uwtable { %4 = fcmp oeq double %2, %3 %5 = zext i1 %4 to i32 ret i32 %5 -; CHECK: @test5 +; CHECK-LABEL: @test5( ; CHECK-NEXT: %rintf = call float @rintf(float %x) ; CHECK-NEXT: fcmp oeq float %rintf, %y } @@ -69,7 +69,7 @@ define i32 @test6(float %x, float %y) nounwind uwtable { %4 = fcmp oeq double %2, %3 %5 = zext i1 %4 to i32 ret i32 %5 -; CHECK: @test6 +; CHECK-LABEL: @test6( ; CHECK-NEXT: %roundf = call float @roundf(float %x) ; CHECK-NEXT: fcmp oeq float %roundf, %y } @@ -81,7 +81,7 @@ define i32 @test7(float %x, float %y) nounwind uwtable { %4 = fcmp oeq double %2, %3 %5 = zext i1 %4 to i32 ret i32 %5 -; CHECK: @test7 +; CHECK-LABEL: @test7( ; CHECK-NEXT: %truncf = call float @truncf(float %x) ; CHECK-NEXT: fcmp oeq float %truncf, %y } @@ -93,7 +93,7 @@ define i32 @test8(float %x, float %y) nounwind uwtable { %4 = fcmp oeq double %1, %3 %5 = zext i1 %4 to i32 ret i32 %5 -; CHECK: @test8 +; CHECK-LABEL: @test8( ; CHECK-NEXT: %ceilf = call float @ceilf(float %x) ; CHECK-NEXT: fcmp oeq float %ceilf, %y } @@ -105,7 +105,7 @@ define i32 @test9(float %x, float %y) nounwind uwtable { %4 = fcmp oeq double %1, %3 %5 = zext i1 %4 to i32 ret i32 %5 -; CHECK: @test9 +; CHECK-LABEL: @test9( ; CHECK-NEXT: %fabsf = call float @fabsf(float %x) ; CHECK-NEXT: fcmp oeq float %fabsf, %y } @@ -117,7 +117,7 @@ define i32 @test10(float %x, float %y) nounwind uwtable { %4 = fcmp oeq double %1, %3 %5 = zext i1 %4 to i32 ret i32 %5 -; CHECK: @test10 +; CHECK-LABEL: @test10( ; CHECK-NEXT: %floorf = call float @floorf(float %x) ; CHECK-NEXT: fcmp oeq float %floorf, %y } @@ -129,7 +129,7 @@ define i32 @test11(float %x, float %y) nounwind uwtable { %4 = fcmp oeq double %1, %3 %5 = zext i1 %4 to i32 ret i32 %5 -; CHECK: @test11 +; CHECK-LABEL: @test11( ; CHECK-NEXT: %nearbyintf = call float @nearbyintf(float %x) ; CHECK-NEXT: fcmp oeq float %nearbyintf, %y } @@ -141,7 +141,7 @@ define i32 @test12(float %x, float %y) nounwind uwtable { %4 = fcmp oeq double %1, %3 %5 = zext i1 %4 to i32 ret i32 %5 -; CHECK: @test12 +; CHECK-LABEL: @test12( ; CHECK-NEXT: %rintf = call float @rintf(float %x) ; CHECK-NEXT: fcmp oeq float %rintf, %y } @@ -153,7 +153,7 @@ define i32 @test13(float %x, float %y) nounwind uwtable { %4 = fcmp oeq double %1, %3 %5 = zext i1 %4 to i32 ret i32 %5 -; CHECK: @test13 +; CHECK-LABEL: @test13( ; CHECK-NEXT: %roundf = call float @roundf(float %x) ; CHECK-NEXT: fcmp oeq float %roundf, %y } @@ -165,7 +165,7 @@ define i32 @test14(float %x, float %y) nounwind uwtable { %4 = fcmp oeq double %1, %3 %5 = zext i1 %4 to i32 ret i32 %5 -; CHECK: @test14 +; CHECK-LABEL: @test14( ; CHECK-NEXT: %truncf = call float @truncf(float %x) ; CHECK-NEXT: fcmp oeq float %truncf, %y } diff --git a/test/Transforms/InstCombine/fmul.ll b/test/Transforms/InstCombine/fmul.ll index 3671b4c6991..cf57bed82a0 100644 --- a/test/Transforms/InstCombine/fmul.ll +++ b/test/Transforms/InstCombine/fmul.ll @@ -6,7 +6,7 @@ define float @test1(float %x) { %mul = fmul float %sub, 2.0e+1 ret float %mul -; CHECK: @test1 +; CHECK-LABEL: @test1( ; CHECK: fmul float %x, -2.000000e+01 } @@ -16,7 +16,7 @@ define float @test2(float %x) { %mul = fmul float %sub, 2.0e+1 ret float %mul -; CHECK: @test2 +; CHECK-LABEL: @test2( ; CHECK: fmul float %x, -2.000000e+01 } @@ -26,7 +26,7 @@ define float @test3(float %x, float %y) { %sub2 = fsub float -0.000000e+00, %y %mul = fmul float %sub1, %sub2 ret float %mul -; CHECK: @test3 +; CHECK-LABEL: @test3( ; CHECK: fmul float %x, %y } @@ -36,7 +36,7 @@ define float @test4(float %x, float %y) { %sub2 = fsub nsz float 0.000000e+00, %y %mul = fmul float %sub1, %sub2 ret float %mul -; CHECK: @test4 +; CHECK-LABEL: @test4( ; CHECK: fmul float %x, %y } @@ -45,7 +45,7 @@ define float @test5(float %x, float %y) { %sub1 = fsub float -0.000000e+00, %x %mul = fmul float %sub1, %y ret float %mul -; CHECK: @test5 +; CHECK-LABEL: @test5( ; CHECK: %1 = fmul float %x, %y ; CHECK: %mul = fsub float -0.000000e+00, %1 } @@ -55,7 +55,7 @@ define float @test6(float %x, float %y) { %sub1 = fsub nsz float 0.000000e+00, %x %mul = fmul float %sub1, %y ret float %mul -; CHECK: @test6 +; CHECK-LABEL: @test6( ; CHECK: %1 = fmul float %x, %y ; CHECK: %mul = fsub float -0.000000e+00, %1 } @@ -67,6 +67,6 @@ define float @test7(float %x, float %y) { %mul = fmul float %sub1, %y %mul2 = fmul float %mul, %sub1 ret float %mul2 -; CHECK: @test7 +; CHECK-LABEL: @test7( ; CHECK: fsub float -0.000000e+00, %x } diff --git a/test/Transforms/InstCombine/fold-bin-operand.ll b/test/Transforms/InstCombine/fold-bin-operand.ll index a8bad0df596..d3303262be3 100644 --- a/test/Transforms/InstCombine/fold-bin-operand.ll +++ b/test/Transforms/InstCombine/fold-bin-operand.ll @@ -2,14 +2,14 @@ target datalayout = "E-p:64:64:64-a0:0:8-f32:32:32-f64:64:64-i1:8:8-i8:8:8-i16:16:16-i32:32:32-i64:32:64-v64:64:64-v128:128:128" define i1 @f(i1 %x) { -; CHECK: @f +; CHECK-LABEL: @f( ; CHECK: ret i1 false %b = and i1 %x, icmp eq (i8* inttoptr (i32 1 to i8*), i8* inttoptr (i32 2 to i8*)) ret i1 %b } define i32 @g(i32 %x) { -; CHECK: @g +; CHECK-LABEL: @g( ; CHECK: ret i32 %x %b = add i32 %x, zext (i1 icmp eq (i8* inttoptr (i32 1000000 to i8*), i8* inttoptr (i32 2000000 to i8*)) to i32) ret i32 %b diff --git a/test/Transforms/InstCombine/fold-calls.ll b/test/Transforms/InstCombine/fold-calls.ll index 504f874beae..1a9a9fd2e9e 100644 --- a/test/Transforms/InstCombine/fold-calls.ll +++ b/test/Transforms/InstCombine/fold-calls.ll @@ -1,7 +1,7 @@ ; RUN: opt -instcombine -S < %s | FileCheck %s ; This shouldn't fold, because sin(inf) is invalid. -; CHECK: @foo +; CHECK-LABEL: @foo( ; CHECK: %t = call double @sin(double 0x7FF0000000000000) define double @foo() { %t = call double @sin(double 0x7FF0000000000000) @@ -9,7 +9,7 @@ define double @foo() { } ; This should fold. -; CHECK: @bar +; CHECK-LABEL: @bar( ; CHECK: ret double 0.0 define double @bar() { %t = call double @sin(double 0.0) diff --git a/test/Transforms/InstCombine/fprintf-1.ll b/test/Transforms/InstCombine/fprintf-1.ll index e1dc191bd70..1b7c104051e 100644 --- a/test/Transforms/InstCombine/fprintf-1.ll +++ b/test/Transforms/InstCombine/fprintf-1.ll @@ -18,7 +18,7 @@ declare i32 @fprintf(%FILE*, i8*, ...) ; Check fprintf(fp, "foo") -> fwrite("foo", 3, 1, fp). define void @test_simplify1(%FILE* %fp) { -; CHECK: @test_simplify1 +; CHECK-LABEL: @test_simplify1( %fmt = getelementptr [13 x i8]* @hello_world, i32 0, i32 0 call i32 (%FILE*, i8*, ...)* @fprintf(%FILE* %fp, i8* %fmt) ; CHECK-NEXT: call i32 @fwrite(i8* getelementptr inbounds ([13 x i8]* @hello_world, i32 0, i32 0), i32 12, i32 1, %FILE* %fp) @@ -29,7 +29,7 @@ define void @test_simplify1(%FILE* %fp) { ; Check fprintf(fp, "%c", chr) -> fputc(chr, fp). define void @test_simplify2(%FILE* %fp) { -; CHECK: @test_simplify2 +; CHECK-LABEL: @test_simplify2( %fmt = getelementptr [3 x i8]* @percent_c, i32 0, i32 0 call i32 (%FILE*, i8*, ...)* @fprintf(%FILE* %fp, i8* %fmt, i8 104) ; CHECK-NEXT: call i32 @fputc(i32 104, %FILE* %fp) @@ -41,7 +41,7 @@ define void @test_simplify2(%FILE* %fp) { ; NOTE: The fputs simplifier simplifies this further to fwrite. define void @test_simplify3(%FILE* %fp) { -; CHECK: @test_simplify3 +; CHECK-LABEL: @test_simplify3( %fmt = getelementptr [3 x i8]* @percent_s, i32 0, i32 0 %str = getelementptr [13 x i8]* @hello_world, i32 0, i32 0 call i32 (%FILE*, i8*, ...)* @fprintf(%FILE* %fp, i8* %fmt, i8* %str) @@ -53,7 +53,7 @@ define void @test_simplify3(%FILE* %fp) { ; Check fprintf(fp, fmt, ...) -> fiprintf(fp, fmt, ...) if no floating point. define void @test_simplify4(%FILE* %fp) { -; CHECK-IPRINTF: @test_simplify4 +; CHECK-IPRINTF-LABEL: @test_simplify4( %fmt = getelementptr [3 x i8]* @percent_d, i32 0, i32 0 call i32 (%FILE*, i8*, ...)* @fprintf(%FILE* %fp, i8* %fmt, i32 187) ; CHECK-NEXT-IPRINTF: call i32 (%FILE*, i8*, ...)* @fiprintf(%FILE* %fp, i8* getelementptr inbounds ([3 x i8]* @percent_d, i32 0, i32 0), i32 187) @@ -62,7 +62,7 @@ define void @test_simplify4(%FILE* %fp) { } define void @test_no_simplify1(%FILE* %fp) { -; CHECK-IPRINTF: @test_no_simplify1 +; CHECK-IPRINTF-LABEL: @test_no_simplify1( %fmt = getelementptr [3 x i8]* @percent_f, i32 0, i32 0 call i32 (%FILE*, i8*, ...)* @fprintf(%FILE* %fp, i8* %fmt, double 1.87) ; CHECK-NEXT-IPRINTF: call i32 (%FILE*, i8*, ...)* @fprintf(%FILE* %fp, i8* getelementptr inbounds ([3 x i8]* @percent_f, i32 0, i32 0), double 1.870000e+00) @@ -71,7 +71,7 @@ define void @test_no_simplify1(%FILE* %fp) { } define void @test_no_simplify2(%FILE* %fp, double %d) { -; CHECK: @test_no_simplify2 +; CHECK-LABEL: @test_no_simplify2( %fmt = getelementptr [3 x i8]* @percent_f, i32 0, i32 0 call i32 (%FILE*, i8*, ...)* @fprintf(%FILE* %fp, i8* %fmt, double %d) ; CHECK-NEXT: call i32 (%FILE*, i8*, ...)* @fprintf(%FILE* %fp, i8* getelementptr inbounds ([3 x i8]* @percent_f, i32 0, i32 0), double %d) @@ -80,7 +80,7 @@ define void @test_no_simplify2(%FILE* %fp, double %d) { } define i32 @test_no_simplify3(%FILE* %fp) { -; CHECK: @test_no_simplify3 +; CHECK-LABEL: @test_no_simplify3( %fmt = getelementptr [13 x i8]* @hello_world, i32 0, i32 0 %1 = call i32 (%FILE*, i8*, ...)* @fprintf(%FILE* %fp, i8* %fmt) ; CHECK-NEXT: call i32 (%FILE*, i8*, ...)* @fprintf(%FILE* %fp, i8* getelementptr inbounds ([13 x i8]* @hello_world, i32 0, i32 0)) diff --git a/test/Transforms/InstCombine/fputs-1.ll b/test/Transforms/InstCombine/fputs-1.ll index c7c5becfd03..473610e6120 100644 --- a/test/Transforms/InstCombine/fputs-1.ll +++ b/test/Transforms/InstCombine/fputs-1.ll @@ -15,7 +15,7 @@ declare i32 @fputs(i8*, %FILE*) ; Check fputs(str, fp) --> fwrite(str, 1, strlen(s), fp). define void @test_simplify1(%FILE* %fp) { -; CHECK: @test_simplify1 +; CHECK-LABEL: @test_simplify1( %str = getelementptr [1 x i8]* @empty, i32 0, i32 0 call i32 @fputs(i8* %str, %FILE* %fp) ret void @@ -25,7 +25,7 @@ define void @test_simplify1(%FILE* %fp) { ; NOTE: The fwrite simplifier simplifies this further to fputc. define void @test_simplify2(%FILE* %fp) { -; CHECK: @test_simplify2 +; CHECK-LABEL: @test_simplify2( %str = getelementptr [2 x i8]* @A, i32 0, i32 0 call i32 @fputs(i8* %str, %FILE* %fp) ; CHECK-NEXT: call i32 @fputc(i32 65, %FILE* %fp) @@ -34,7 +34,7 @@ define void @test_simplify2(%FILE* %fp) { } define void @test_simplify3(%FILE* %fp) { -; CHECK: @test_simplify3 +; CHECK-LABEL: @test_simplify3( %str = getelementptr [7 x i8]* @hello, i32 0, i32 0 call i32 @fputs(i8* %str, %FILE* %fp) ; CHECK-NEXT: call i32 @fwrite(i8* getelementptr inbounds ([7 x i8]* @hello, i32 0, i32 0), i32 6, i32 1, %FILE* %fp) diff --git a/test/Transforms/InstCombine/fwrite-1.ll b/test/Transforms/InstCombine/fwrite-1.ll index 528cdec217f..6f9a8e463a8 100644 --- a/test/Transforms/InstCombine/fwrite-1.ll +++ b/test/Transforms/InstCombine/fwrite-1.ll @@ -14,7 +14,7 @@ declare i64 @fwrite(i8*, i64, i64, %FILE *) ; Check fwrite(S, 1, 1, fp) -> fputc(S[0], fp). define void @test_simplify1(%FILE* %fp) { -; CHECK: @test_simplify1 +; CHECK-LABEL: @test_simplify1( %str = getelementptr inbounds [1 x i8]* @str, i64 0, i64 0 call i64 @fwrite(i8* %str, i64 1, i64 1, %FILE* %fp) ; CHECK-NEXT: call i32 @fputc(i32 0, %FILE* %fp) @@ -23,7 +23,7 @@ define void @test_simplify1(%FILE* %fp) { } define void @test_simplify2(%FILE* %fp) { -; CHECK: @test_simplify2 +; CHECK-LABEL: @test_simplify2( %str = getelementptr inbounds [0 x i8]* @empty, i64 0, i64 0 call i64 @fwrite(i8* %str, i64 1, i64 0, %FILE* %fp) ret void @@ -31,7 +31,7 @@ define void @test_simplify2(%FILE* %fp) { } define void @test_simplify3(%FILE* %fp) { -; CHECK: @test_simplify3 +; CHECK-LABEL: @test_simplify3( %str = getelementptr inbounds [0 x i8]* @empty, i64 0, i64 0 call i64 @fwrite(i8* %str, i64 0, i64 1, %FILE* %fp) ret void @@ -39,7 +39,7 @@ define void @test_simplify3(%FILE* %fp) { } define i64 @test_no_simplify1(%FILE* %fp) { -; CHECK: @test_no_simplify1 +; CHECK-LABEL: @test_no_simplify1( %str = getelementptr inbounds [1 x i8]* @str, i64 0, i64 0 %ret = call i64 @fwrite(i8* %str, i64 1, i64 1, %FILE* %fp) ; CHECK-NEXT: call i64 @fwrite @@ -48,7 +48,7 @@ define i64 @test_no_simplify1(%FILE* %fp) { } define void @test_no_simplify2(%FILE* %fp, i64 %size) { -; CHECK: @test_no_simplify2 +; CHECK-LABEL: @test_no_simplify2( %str = getelementptr inbounds [1 x i8]* @str, i64 0, i64 0 call i64 @fwrite(i8* %str, i64 %size, i64 1, %FILE* %fp) ; CHECK-NEXT: call i64 @fwrite diff --git a/test/Transforms/InstCombine/getelementptr.ll b/test/Transforms/InstCombine/getelementptr.ll index 844678a6745..90f144a06fc 100644 --- a/test/Transforms/InstCombine/getelementptr.ll +++ b/test/Transforms/InstCombine/getelementptr.ll @@ -13,7 +13,7 @@ target datalayout = "e-p:64:64" define i32* @test1(i32* %I) { %A = getelementptr i32* %I, i64 0 ret i32* %A -; CHECK: @test1 +; CHECK-LABEL: @test1( ; CHECK: ret i32* %I } @@ -21,7 +21,7 @@ define i32* @test1(i32* %I) { define i32* @test2(i32* %I) { %A = getelementptr i32* %I ret i32* %A -; CHECK: @test2 +; CHECK-LABEL: @test2( ; CHECK: ret i32* %I } @@ -30,7 +30,7 @@ define i32* @test3(i32* %I) { %A = getelementptr i32* %I, i64 17 %B = getelementptr i32* %A, i64 4 ret i32* %B -; CHECK: @test3 +; CHECK-LABEL: @test3( ; CHECK: getelementptr i32* %I, i64 21 } @@ -39,7 +39,7 @@ define i32* @test4({ i32 }* %I) { %A = getelementptr { i32 }* %I, i64 1 %B = getelementptr { i32 }* %A, i64 0, i32 0 ret i32* %B -; CHECK: @test4 +; CHECK-LABEL: @test4( ; CHECK: getelementptr { i32 }* %I, i64 1, i32 0 } @@ -48,7 +48,7 @@ define void @test5(i8 %B) { %A = getelementptr [10 x i8]* @Global, i64 0, i64 4 store i8 %B, i8* %A ret void -; CHECK: @test5 +; CHECK-LABEL: @test5( ; CHECK: store i8 %B, i8* getelementptr inbounds ([10 x i8]* @Global, i64 0, i64 4) } @@ -57,7 +57,7 @@ define i32* @test7(i32* %I, i64 %C, i64 %D) { %A = getelementptr i32* %I, i64 %C %B = getelementptr i32* %A, i64 %D ret i32* %B -; CHECK: @test7 +; CHECK-LABEL: @test7( ; CHECK: %A.sum = add i64 %C, %D ; CHECK: getelementptr i32* %I, i64 %A.sum } @@ -67,7 +67,7 @@ define i8* @test8([10 x i32]* %X) { %A = getelementptr [10 x i32]* %X, i64 0, i64 0 %B = bitcast i32* %A to i8* ret i8* %B -; CHECK: @test8 +; CHECK-LABEL: @test8( ; CHECK: bitcast [10 x i32]* %X to i8* } @@ -75,7 +75,7 @@ define i32 @test9() { %A = getelementptr { i32, double }* null, i32 0, i32 1 %B = ptrtoint double* %A to i32 ret i32 %B -; CHECK: @test9 +; CHECK-LABEL: @test9( ; CHECK: ret i32 8 } @@ -85,7 +85,7 @@ define i1 @test10({ i32, i32 }* %x, { i32, i32 }* %y) { ;; seteq x, y %tmp.4 = icmp eq i32* %tmp.1, %tmp.3 ret i1 %tmp.4 -; CHECK: @test10 +; CHECK-LABEL: @test10( ; CHECK: icmp eq { i32, i32 }* %x, %y } @@ -93,7 +93,7 @@ define i1 @test11({ i32, i32 }* %X) { %P = getelementptr { i32, i32 }* %X, i32 0, i32 0 %Q = icmp eq i32* %P, null ret i1 %Q -; CHECK: @test11 +; CHECK-LABEL: @test11( ; CHECK: icmp eq { i32, i32 }* %X, null } @@ -111,7 +111,7 @@ entry: %g5 = getelementptr %struct.A* %new_a, i32 0, i32 1 %a_a = load i32* %g5, align 4 ret i32 %a_a -; CHECK: @test12 +; CHECK-LABEL: @test12( ; CHECK: getelementptr %struct.A* %a, i64 0, i32 1 ; CHECK-NEXT: store i32 10, i32* %g3 ; CHECK-NEXT: ret i32 10 @@ -125,7 +125,7 @@ define i1 @test13(i64 %X, %S* %P) { %B = getelementptr inbounds %S* %P, i32 0, i32 0 %C = icmp eq i32* %A, %B ret i1 %C -; CHECK: @test13 +; CHECK-LABEL: @test13( ; CHECK: %C = icmp eq i64 %X, -1 } @@ -135,7 +135,7 @@ define i8* @test14(i32 %Idx) { %idx = zext i32 %Idx to i64 %tmp = getelementptr i8* getelementptr ([3 x i8]* @G, i32 0, i32 0), i64 %idx ret i8* %tmp -; CHECK: @test14 +; CHECK-LABEL: @test14( ; CHECK: getelementptr [3 x i8]* @G, i64 0, i64 %idx } @@ -145,7 +145,7 @@ define i8* @test14(i32 %Idx) { define i32 *@test15(i64 %X) { %A = getelementptr i32* getelementptr ([40 x i32]* @Array, i64 0, i64 0), i64 %X ret i32* %A -; CHECK: @test15 +; CHECK-LABEL: @test15( ; CHECK: getelementptr [40 x i32]* @Array, i64 0, i64 %X } @@ -153,7 +153,7 @@ define i32 *@test15(i64 %X) { define i32* @test16(i32* %X, i32 %Idx) { %R = getelementptr i32* %X, i32 %Idx ret i32* %R -; CHECK: @test16 +; CHECK-LABEL: @test16( ; CHECK: sext i32 %Idx to i64 } @@ -163,7 +163,7 @@ define i1 @test17(i16* %P, i32 %I, i32 %J) { %Y = getelementptr inbounds i16* %P, i32 %J %C = icmp ult i16* %X, %Y ret i1 %C -; CHECK: @test17 +; CHECK-LABEL: @test17( ; CHECK: %C = icmp slt i32 %I, %J } @@ -171,7 +171,7 @@ define i1 @test18(i16* %P, i32 %I) { %X = getelementptr inbounds i16* %P, i32 %I %C = icmp ult i16* %X, %P ret i1 %C -; CHECK: @test18 +; CHECK-LABEL: @test18( ; CHECK: %C = icmp slt i32 %I, 0 } @@ -181,7 +181,7 @@ define i32 @test19(i32* %P, i32 %A, i32 %B) { %tmp.10 = icmp eq i32* %tmp.4, %tmp.9 %tmp.11 = zext i1 %tmp.10 to i32 ret i32 %tmp.11 -; CHECK: @test19 +; CHECK-LABEL: @test19( ; CHECK: icmp eq i32 %A, %B } @@ -190,7 +190,7 @@ define i32 @test20(i32* %P, i32 %A, i32 %B) { %tmp.6 = icmp eq i32* %tmp.4, %P %tmp.7 = zext i1 %tmp.6 to i32 ret i32 %tmp.7 -; CHECK: @test20 +; CHECK-LABEL: @test20( ; CHECK: icmp eq i32 %A, 0 } @@ -201,7 +201,7 @@ define i32 @test21() { %pbobel = getelementptr %intstruct* %pbob2, i64 0, i32 0 %rval = load i32* %pbobel ret i32 %rval -; CHECK: @test21 +; CHECK-LABEL: @test21( ; CHECK: getelementptr %intstruct* %pbob1, i64 0, i32 0 } @@ -213,7 +213,7 @@ define i1 @test22() { %C = icmp ult i32* getelementptr (i32* @A, i64 1), getelementptr (i32* @B, i64 2) ret i1 %C -; CHECK: @test22 +; CHECK-LABEL: @test22( ; CHECK: icmp ult (i32* getelementptr inbounds (i32* @A, i64 1), i32* getelementptr (i32* @B, i64 2)) } @@ -224,7 +224,7 @@ define i1 @test23() { %A = getelementptr %X* null, i64 0, i32 0, i64 0 ; [#uses=1] %B = icmp ne i32* %A, null ; [#uses=1] ret i1 %B -; CHECK: @test23 +; CHECK-LABEL: @test23( ; CHECK: ret i1 false } @@ -239,7 +239,7 @@ entry: %tmp27.i = sext i32 %sext to i64 ; [#uses=1] tail call void @foo25( i32 0, i64 %tmp27.i ) unreachable -; CHECK: @test25 +; CHECK-LABEL: @test25( } declare void @foo25(i32, i64) @@ -251,7 +251,7 @@ define i1 @test26(i8* %arr) { %Y = getelementptr i8* %arr, i32 1 %test = icmp uge i8* %X, %Y ret i1 %test -; CHECK: @test26 +; CHECK-LABEL: @test26( ; CHECK: ret i1 true } @@ -275,7 +275,7 @@ entry: "=r,ir,*m,i,0,~{dirflag},~{fpsr},~{flags}"( i32 %tmp351, %struct.__large_struct* null, i32 -14, i32 0 ) unreachable -; CHECK: @test27 +; CHECK-LABEL: @test27( } ; PR1978 @@ -303,7 +303,7 @@ bb10: bb17: ret i32 0 -; CHECK: @test28 +; CHECK-LABEL: @test28( ; CHECK: icmp eq i32 %indvar, 0 } @@ -332,7 +332,7 @@ if.then216: if.end363: ret i32 0 -; CHECK: @test29 +; CHECK-LABEL: @test29( } @@ -345,7 +345,7 @@ entry: %2 = getelementptr [0 x i32]* %1, i32 0, i32 %m %3 = load i32* %2, align 4 ret i32 %3 -; CHECK: @test30 +; CHECK-LABEL: @test30( ; CHECK: getelementptr i32 } @@ -358,7 +358,7 @@ define i1 @test31(i32* %A) { %C = getelementptr i32* %A, i64 1 %V = icmp eq i32* %B, %C ret i1 %V -; CHECK: @test31 +; CHECK-LABEL: @test31( ; CHECK: ret i1 true } @@ -375,7 +375,7 @@ define i8* @test32(i8* %v) { %F = getelementptr [4 x i8*]* %A, i32 0, i32 2 %G = load i8** %F ret i8* %G -; CHECK: @test32 +; CHECK-LABEL: @test32( ; CHECK: %D = getelementptr [4 x i8*]* %A, i64 0, i64 1 ; CHECK: %F = getelementptr [4 x i8*]* %A, i64 0, i64 2 } @@ -388,7 +388,7 @@ define i32 *@test33(%struct.Key *%A) { %B = bitcast %struct.Key* %A to %struct.anon* %C = getelementptr %struct.anon* %B, i32 0, i32 2 ret i32 *%C -; CHECK: @test33 +; CHECK-LABEL: @test33( ; CHECK: getelementptr %struct.Key* %A, i64 0, i32 0, i32 1 } @@ -404,7 +404,7 @@ entry: store i64 %V, i64* %mrv_gep %C = load i8** %B, align 8 ret i8* %C -; CHECK: @test34 +; CHECK-LABEL: @test34( ; CHECK: %V.c = inttoptr i64 %V to i8* ; CHECK: ret i8* %V.c } @@ -423,7 +423,7 @@ define i32 @test35() nounwind { call i32 (i8*, ...)* @printf(i8* getelementptr ([17 x i8]* @"\01LC8", i32 0, i32 0), i8* getelementptr (%t1* bitcast (%t0* @s to %t1*), i32 0, i32 1, i32 0)) nounwind ret i32 0 -; CHECK: @test35 +; CHECK-LABEL: @test35( ; CHECK: call i32 (i8*, ...)* @printf(i8* getelementptr inbounds ([17 x i8]* @"\01LC8", i64 0, i64 0), i8* getelementptr inbounds (%t0* @s, i64 0, i32 1, i64 0)) [[NUW:#[0-9]+]] } @@ -434,14 +434,14 @@ define i32 @test35() nounwind { define i8* @test36() nounwind { ret i8* getelementptr ([11 x i8]* @array, i32 0, i64 -1) -; CHECK: @test36 +; CHECK-LABEL: @test36( ; CHECK: ret i8* getelementptr ([11 x i8]* @array, i64 1676976733973595601, i64 4) } ; Instcombine shouldn't assume that gep(A,0,1) != gep(A,1,0). @A37 = external constant [1 x i8] define i1 @test37() nounwind { -; CHECK: @test37 +; CHECK-LABEL: @test37( ; CHECK: ret i1 true %t = icmp eq i8* getelementptr ([1 x i8]* @A37, i64 0, i64 1), getelementptr ([1 x i8]* @A37, i64 1, i64 0) @@ -452,7 +452,7 @@ define i1 @test37() nounwind { define i32* @test38(i32* %I, i32 %n) { %A = getelementptr i32* %I, i32 %n ret i32* %A -; CHECK: @test38 +; CHECK-LABEL: @test38( ; CHECK: = sext i32 %n to i64 ; CHECK: %A = getelementptr i32* %I, i64 % } @@ -469,7 +469,7 @@ entry: call void @pr10322_f3(i8** %tmp2) nounwind ret void -; CHECK: @pr10322_f1 +; CHECK-LABEL: @pr10322_f1( ; CHECK: %tmp2 = getelementptr inbounds %pr10322_t* %arrayidx8, i64 0, i32 0 } @@ -485,7 +485,7 @@ define void @three_gep_f(%three_gep_t2* %x) { %gep3 = getelementptr %three_gep_t* %gep2, i64 0, i32 0 call void @three_gep_g(i32* %gep3) -; CHECK: @three_gep_f +; CHECK-LABEL: @three_gep_f( ; CHECK: %gep3 = getelementptr %three_gep_t2* %gep1, i64 0, i32 0, i32 0 ret void } @@ -504,7 +504,7 @@ define void @test39(%struct.ham* %arg, i8 %arg1) nounwind { store i8 %arg1, i8* %tmp4, align 8 ret void -; CHECK: @test39 +; CHECK-LABEL: @test39( ; CHECK: getelementptr inbounds %struct.ham* %arg, i64 0, i32 2 ; CHECK: getelementptr inbounds i8* %tmp3, i64 -8 } @@ -515,7 +515,7 @@ define i1 @pr16483([1 x i8]* %a, [1 x i8]* %b) { %cmp = icmp ult i8* %c, %d ret i1 %cmp -; CHECK: @pr16483 +; CHECK-LABEL: @pr16483( ; CHECK-NEXT: icmp ult [1 x i8]* %a, %b } diff --git a/test/Transforms/InstCombine/icmp.ll b/test/Transforms/InstCombine/icmp.ll index c541a695cd6..bc3112ba3f7 100644 --- a/test/Transforms/InstCombine/icmp.ll +++ b/test/Transforms/InstCombine/icmp.ll @@ -8,7 +8,7 @@ entry: icmp slt i32 %X, 0 ; :0 [#uses=1] zext i1 %0 to i32 ; :1 [#uses=1] ret i32 %1 -; CHECK: @test1 +; CHECK-LABEL: @test1( ; CHECK: lshr i32 %X, 31 ; CHECK-NEXT: ret i32 } @@ -18,7 +18,7 @@ entry: icmp ult i32 %X, -2147483648 ; :0 [#uses=1] zext i1 %0 to i32 ; :1 [#uses=1] ret i32 %1 -; CHECK: @test2 +; CHECK-LABEL: @test2( ; CHECK: lshr i32 %X, 31 ; CHECK-NEXT: xor i32 ; CHECK-NEXT: ret i32 @@ -29,7 +29,7 @@ entry: icmp slt i32 %X, 0 ; :0 [#uses=1] sext i1 %0 to i32 ; :1 [#uses=1] ret i32 %1 -; CHECK: @test3 +; CHECK-LABEL: @test3( ; CHECK: ashr i32 %X, 31 ; CHECK-NEXT: ret i32 } @@ -39,7 +39,7 @@ entry: icmp ult i32 %X, -2147483648 ; :0 [#uses=1] sext i1 %0 to i32 ; :1 [#uses=1] ret i32 %1 -; CHECK: @test4 +; CHECK-LABEL: @test4( ; CHECK: ashr i32 %X, 31 ; CHECK-NEXT: xor i32 ; CHECK-NEXT: ret i32 @@ -50,7 +50,7 @@ define <2 x i1> @test5(<2 x i64> %x) { entry: %V = icmp eq <2 x i64> %x, undef ret <2 x i1> %V -; CHECK: @test5 +; CHECK-LABEL: @test5( ; CHECK: ret <2 x i1> } @@ -60,7 +60,7 @@ define i32 @test6(i32 %a, i32 %b) { %e = sub i32 0, %d %f = and i32 %e, %b ret i32 %f -; CHECK: @test6 +; CHECK-LABEL: @test6( ; CHECK-NEXT: ashr i32 %a, 31 ; CHECK-NEXT: %f = and i32 %e, %b ; CHECK-NEXT: ret i32 %f @@ -72,7 +72,7 @@ entry: %a = add i32 %x, -1 %b = icmp ult i32 %a, %x ret i1 %b -; CHECK: @test7 +; CHECK-LABEL: @test7( ; CHECK: %b = icmp ne i32 %x, 0 ; CHECK: ret i1 %b } @@ -82,7 +82,7 @@ entry: %a = add i32 %x, -1 %b = icmp eq i32 %a, %x ret i1 %b -; CHECK: @test8 +; CHECK-LABEL: @test8( ; CHECK: ret i1 false } @@ -91,7 +91,7 @@ entry: %a = add i32 %x, -2 %b = icmp ugt i32 %x, %a ret i1 %b -; CHECK: @test9 +; CHECK-LABEL: @test9( ; CHECK: icmp ugt i32 %x, 1 ; CHECK: ret i1 %b } @@ -102,7 +102,7 @@ entry: %b = icmp slt i32 %a, %x ret i1 %b -; CHECK: @test10 +; CHECK-LABEL: @test10( ; CHECK: %b = icmp ne i32 %x, -2147483648 ; CHECK: ret i1 %b } @@ -111,7 +111,7 @@ define i1 @test11(i32 %x) { %a = add nsw i32 %x, 8 %b = icmp slt i32 %x, %a ret i1 %b -; CHECK: @test11 +; CHECK-LABEL: @test11( ; CHECK: ret i1 true } @@ -120,7 +120,7 @@ define i1 @test12(i1 %A) { %S = select i1 %A, i64 -4294967295, i64 8589934591 %B = icmp ne i64 bitcast (<2 x i32> to i64), %S ret i1 %B -; CHECK: @test12 +; CHECK-LABEL: @test12( ; CHECK-NEXT: = xor i1 %A, true ; CHECK-NEXT: ret i1 } @@ -130,7 +130,7 @@ define i1 @test13(i8 %X) nounwind readnone { entry: %cmp = icmp slt i8 undef, %X ret i1 %cmp -; CHECK: @test13 +; CHECK-LABEL: @test13( ; CHECK: ret i1 false } @@ -138,7 +138,7 @@ define i1 @test14(i8 %X) nounwind readnone { entry: %cmp = icmp slt i8 undef, -128 ret i1 %cmp -; CHECK: @test14 +; CHECK-LABEL: @test14( ; CHECK: ret i1 false } @@ -146,7 +146,7 @@ define i1 @test15() nounwind readnone { entry: %cmp = icmp eq i8 undef, -128 ret i1 %cmp -; CHECK: @test15 +; CHECK-LABEL: @test15( ; CHECK: ret i1 undef } @@ -154,7 +154,7 @@ define i1 @test16() nounwind readnone { entry: %cmp = icmp ne i8 undef, -128 ret i1 %cmp -; CHECK: @test16 +; CHECK-LABEL: @test16( ; CHECK: ret i1 undef } @@ -163,7 +163,7 @@ define i1 @test17(i32 %x) nounwind { %and = and i32 %shl, 8 %cmp = icmp eq i32 %and, 0 ret i1 %cmp -; CHECK: @test17 +; CHECK-LABEL: @test17( ; CHECK-NEXT: %cmp = icmp ne i32 %x, 3 } @@ -173,7 +173,7 @@ define i1 @test18(i32 %x) nounwind { %and = and i32 %sh, 1 %cmp = icmp eq i32 %and, 0 ret i1 %cmp -; CHECK: @test18 +; CHECK-LABEL: @test18( ; CHECK-NEXT: %cmp = icmp ne i32 %x, 3 } @@ -182,7 +182,7 @@ define i1 @test19(i32 %x) nounwind { %and = and i32 %shl, 8 %cmp = icmp eq i32 %and, 8 ret i1 %cmp -; CHECK: @test19 +; CHECK-LABEL: @test19( ; CHECK-NEXT: %cmp = icmp eq i32 %x, 3 } @@ -191,12 +191,12 @@ define i1 @test20(i32 %x) nounwind { %and = and i32 %shl, 8 %cmp = icmp ne i32 %and, 0 ret i1 %cmp -; CHECK: @test20 +; CHECK-LABEL: @test20( ; CHECK-NEXT: %cmp = icmp eq i32 %x, 3 } define i1 @test21(i8 %x, i8 %y) { -; CHECK: @test21 +; CHECK-LABEL: @test21( ; CHECK-NOT: or i8 ; CHECK: icmp ugt %A = or i8 %x, 1 @@ -205,7 +205,7 @@ define i1 @test21(i8 %x, i8 %y) { } define i1 @test22(i8 %x, i8 %y) { -; CHECK: @test22 +; CHECK-LABEL: @test22( ; CHECK-NOT: or i8 ; CHECK: icmp ult %A = or i8 %x, 1 @@ -214,7 +214,7 @@ define i1 @test22(i8 %x, i8 %y) { } ; PR2740 -; CHECK: @test23 +; CHECK-LABEL: @test23( ; CHECK: icmp sgt i32 %x, 1328634634 define i1 @test23(i32 %x) nounwind { %i3 = sdiv i32 %x, -1328634635 @@ -225,7 +225,7 @@ define i1 @test23(i32 %x) nounwind { @X = global [1000 x i32] zeroinitializer ; PR8882 -; CHECK: @test24 +; CHECK-LABEL: @test24( ; CHECK: %cmp = icmp eq i64 %i, 1000 ; CHECK: ret i1 %cmp define i1 @test24(i64 %i) { @@ -234,7 +234,7 @@ define i1 @test24(i64 %i) { ret i1 %cmp } -; CHECK: @test25 +; CHECK-LABEL: @test25( ; X + Z > Y + Z -> X > Y if there is no overflow. ; CHECK: %c = icmp sgt i32 %x, %y ; CHECK: ret i1 %c @@ -245,7 +245,7 @@ define i1 @test25(i32 %x, i32 %y, i32 %z) { ret i1 %c } -; CHECK: @test26 +; CHECK-LABEL: @test26( ; X + Z > Y + Z -> X > Y if there is no overflow. ; CHECK: %c = icmp ugt i32 %x, %y ; CHECK: ret i1 %c @@ -256,7 +256,7 @@ define i1 @test26(i32 %x, i32 %y, i32 %z) { ret i1 %c } -; CHECK: @test27 +; CHECK-LABEL: @test27( ; X - Z > Y - Z -> X > Y if there is no overflow. ; CHECK: %c = icmp sgt i32 %x, %y ; CHECK: ret i1 %c @@ -267,7 +267,7 @@ define i1 @test27(i32 %x, i32 %y, i32 %z) { ret i1 %c } -; CHECK: @test28 +; CHECK-LABEL: @test28( ; X - Z > Y - Z -> X > Y if there is no overflow. ; CHECK: %c = icmp ugt i32 %x, %y ; CHECK: ret i1 %c @@ -278,7 +278,7 @@ define i1 @test28(i32 %x, i32 %y, i32 %z) { ret i1 %c } -; CHECK: @test29 +; CHECK-LABEL: @test29( ; X + Y > X -> Y > 0 if there is no overflow. ; CHECK: %c = icmp sgt i32 %y, 0 ; CHECK: ret i1 %c @@ -288,7 +288,7 @@ define i1 @test29(i32 %x, i32 %y) { ret i1 %c } -; CHECK: @test30 +; CHECK-LABEL: @test30( ; X + Y > X -> Y > 0 if there is no overflow. ; CHECK: %c = icmp ne i32 %y, 0 ; CHECK: ret i1 %c @@ -298,7 +298,7 @@ define i1 @test30(i32 %x, i32 %y) { ret i1 %c } -; CHECK: @test31 +; CHECK-LABEL: @test31( ; X > X + Y -> 0 > Y if there is no overflow. ; CHECK: %c = icmp slt i32 %y, 0 ; CHECK: ret i1 %c @@ -308,7 +308,7 @@ define i1 @test31(i32 %x, i32 %y) { ret i1 %c } -; CHECK: @test32 +; CHECK-LABEL: @test32( ; X > X + Y -> 0 > Y if there is no overflow. ; CHECK: ret i1 false define i1 @test32(i32 %x, i32 %y) { @@ -317,7 +317,7 @@ define i1 @test32(i32 %x, i32 %y) { ret i1 %c } -; CHECK: @test33 +; CHECK-LABEL: @test33( ; X - Y > X -> 0 > Y if there is no overflow. ; CHECK: %c = icmp slt i32 %y, 0 ; CHECK: ret i1 %c @@ -327,7 +327,7 @@ define i1 @test33(i32 %x, i32 %y) { ret i1 %c } -; CHECK: @test34 +; CHECK-LABEL: @test34( ; X - Y > X -> 0 > Y if there is no overflow. ; CHECK: ret i1 false define i1 @test34(i32 %x, i32 %y) { @@ -336,7 +336,7 @@ define i1 @test34(i32 %x, i32 %y) { ret i1 %c } -; CHECK: @test35 +; CHECK-LABEL: @test35( ; X > X - Y -> Y > 0 if there is no overflow. ; CHECK: %c = icmp sgt i32 %y, 0 ; CHECK: ret i1 %c @@ -346,7 +346,7 @@ define i1 @test35(i32 %x, i32 %y) { ret i1 %c } -; CHECK: @test36 +; CHECK-LABEL: @test36( ; X > X - Y -> Y > 0 if there is no overflow. ; CHECK: %c = icmp ne i32 %y, 0 ; CHECK: ret i1 %c @@ -356,7 +356,7 @@ define i1 @test36(i32 %x, i32 %y) { ret i1 %c } -; CHECK: @test37 +; CHECK-LABEL: @test37( ; X - Y > X - Z -> Z > Y if there is no overflow. ; CHECK: %c = icmp sgt i32 %z, %y ; CHECK: ret i1 %c @@ -367,7 +367,7 @@ define i1 @test37(i32 %x, i32 %y, i32 %z) { ret i1 %c } -; CHECK: @test38 +; CHECK-LABEL: @test38( ; X - Y > X - Z -> Z > Y if there is no overflow. ; CHECK: %c = icmp ugt i32 %z, %y ; CHECK: ret i1 %c @@ -379,7 +379,7 @@ define i1 @test38(i32 %x, i32 %y, i32 %z) { } ; PR9343 #1 -; CHECK: @test39 +; CHECK-LABEL: @test39( ; CHECK: %B = icmp eq i32 %X, 0 define i1 @test39(i32 %X, i32 %Y) { %A = ashr exact i32 %X, %Y @@ -387,7 +387,7 @@ define i1 @test39(i32 %X, i32 %Y) { ret i1 %B } -; CHECK: @test40 +; CHECK-LABEL: @test40( ; CHECK: %B = icmp ne i32 %X, 0 define i1 @test40(i32 %X, i32 %Y) { %A = lshr exact i32 %X, %Y @@ -396,7 +396,7 @@ define i1 @test40(i32 %X, i32 %Y) { } ; PR9343 #3 -; CHECK: @test41 +; CHECK-LABEL: @test41( ; CHECK: ret i1 true define i1 @test41(i32 %X, i32 %Y) { %A = urem i32 %X, %Y @@ -404,7 +404,7 @@ define i1 @test41(i32 %X, i32 %Y) { ret i1 %B } -; CHECK: @test42 +; CHECK-LABEL: @test42( ; CHECK: %B = icmp sgt i32 %Y, -1 define i1 @test42(i32 %X, i32 %Y) { %A = srem i32 %X, %Y @@ -412,7 +412,7 @@ define i1 @test42(i32 %X, i32 %Y) { ret i1 %B } -; CHECK: @test43 +; CHECK-LABEL: @test43( ; CHECK: %B = icmp slt i32 %Y, 0 define i1 @test43(i32 %X, i32 %Y) { %A = srem i32 %X, %Y @@ -420,7 +420,7 @@ define i1 @test43(i32 %X, i32 %Y) { ret i1 %B } -; CHECK: @test44 +; CHECK-LABEL: @test44( ; CHECK: %B = icmp sgt i32 %Y, -1 define i1 @test44(i32 %X, i32 %Y) { %A = srem i32 %X, %Y @@ -428,7 +428,7 @@ define i1 @test44(i32 %X, i32 %Y) { ret i1 %B } -; CHECK: @test45 +; CHECK-LABEL: @test45( ; CHECK: %B = icmp slt i32 %Y, 0 define i1 @test45(i32 %X, i32 %Y) { %A = srem i32 %X, %Y @@ -437,7 +437,7 @@ define i1 @test45(i32 %X, i32 %Y) { } ; PR9343 #4 -; CHECK: @test46 +; CHECK-LABEL: @test46( ; CHECK: %C = icmp ult i32 %X, %Y define i1 @test46(i32 %X, i32 %Y, i32 %Z) { %A = ashr exact i32 %X, %Z @@ -447,7 +447,7 @@ define i1 @test46(i32 %X, i32 %Y, i32 %Z) { } ; PR9343 #5 -; CHECK: @test47 +; CHECK-LABEL: @test47( ; CHECK: %C = icmp ugt i32 %X, %Y define i1 @test47(i32 %X, i32 %Y, i32 %Z) { %A = ashr exact i32 %X, %Z @@ -457,7 +457,7 @@ define i1 @test47(i32 %X, i32 %Y, i32 %Z) { } ; PR9343 #8 -; CHECK: @test48 +; CHECK-LABEL: @test48( ; CHECK: %C = icmp eq i32 %X, %Y define i1 @test48(i32 %X, i32 %Y, i32 %Z) { %A = sdiv exact i32 %X, %Z @@ -467,7 +467,7 @@ define i1 @test48(i32 %X, i32 %Y, i32 %Z) { } ; PR8469 -; CHECK: @test49 +; CHECK-LABEL: @test49( ; CHECK: ret <2 x i1> define <2 x i1> @test49(<2 x i32> %tmp3) { entry: @@ -477,7 +477,7 @@ entry: } ; PR9343 #7 -; CHECK: @test50 +; CHECK-LABEL: @test50( ; CHECK: ret i1 true define i1 @test50(i16 %X, i32 %Y) { %A = zext i16 %X to i32 @@ -486,7 +486,7 @@ define i1 @test50(i16 %X, i32 %Y) { ret i1 %C } -; CHECK: @test51 +; CHECK-LABEL: @test51( ; CHECK: ret i1 %C define i1 @test51(i32 %X, i32 %Y) { %A = and i32 %X, 2147483648 @@ -495,7 +495,7 @@ define i1 @test51(i32 %X, i32 %Y) { ret i1 %C } -; CHECK: @test52 +; CHECK-LABEL: @test52( ; CHECK-NEXT: and i32 %x1, 16711935 ; CHECK-NEXT: icmp eq i32 {{.*}}, 4980863 ; CHECK-NEXT: ret i1 @@ -511,7 +511,7 @@ define i1 @test52(i32 %x1) nounwind { } ; PR9838 -; CHECK: @test53 +; CHECK-LABEL: @test53( ; CHECK-NEXT: ashr exact ; CHECK-NEXT: ashr ; CHECK-NEXT: icmp @@ -522,7 +522,7 @@ define i1 @test53(i32 %a, i32 %b) nounwind { ret i1 %z } -; CHECK: @test54 +; CHECK-LABEL: @test54( ; CHECK-NEXT: %and = and i8 %a, -64 ; CHECK-NEXT: icmp eq i8 %and, -128 define i1 @test54(i8 %a) nounwind { @@ -532,7 +532,7 @@ define i1 @test54(i8 %a) nounwind { ret i1 %ret } -; CHECK: @test55 +; CHECK-LABEL: @test55( ; CHECK-NEXT: icmp eq i32 %a, -123 define i1 @test55(i32 %a) { %sub = sub i32 0, %a @@ -540,7 +540,7 @@ define i1 @test55(i32 %a) { ret i1 %cmp } -; CHECK: @test56 +; CHECK-LABEL: @test56( ; CHECK-NEXT: icmp eq i32 %a, -113 define i1 @test56(i32 %a) { %sub = sub i32 10, %a @@ -550,7 +550,7 @@ define i1 @test56(i32 %a) { ; PR10267 Don't make icmps more expensive when no other inst is subsumed. declare void @foo(i32) -; CHECK: @test57 +; CHECK-LABEL: @test57( ; CHECK: %and = and i32 %a, -2 ; CHECK: %cmp = icmp ne i32 %and, 0 define i1 @test57(i32 %a) { @@ -561,7 +561,7 @@ define i1 @test57(i32 %a) { } ; rdar://problem/10482509 -; CHECK: @cmpabs1 +; CHECK-LABEL: @cmpabs1( ; CHECK-NEXT: icmp ne define zeroext i1 @cmpabs1(i64 %val) { %sub = sub nsw i64 0, %val @@ -571,7 +571,7 @@ define zeroext i1 @cmpabs1(i64 %val) { ret i1 %tobool } -; CHECK: @cmpabs2 +; CHECK-LABEL: @cmpabs2( ; CHECK-NEXT: icmp ne define zeroext i1 @cmpabs2(i64 %val) { %sub = sub nsw i64 0, %val @@ -581,7 +581,7 @@ define zeroext i1 @cmpabs2(i64 %val) { ret i1 %tobool } -; CHECK: @test58 +; CHECK-LABEL: @test58( ; CHECK-NEXT: call i32 @test58_d(i64 36029346783166592) define void @test58() nounwind { %cast = bitcast <1 x i64> to i64 @@ -599,7 +599,7 @@ define i1 @test59(i8* %foo) { %use = ptrtoint i8* %cast1 to i64 %call = call i32 @test58_d(i64 %use) nounwind ret i1 %cmp -; CHECK: @test59 +; CHECK-LABEL: @test59( ; CHECK: ret i1 true } @@ -610,7 +610,7 @@ define i1 @test60(i8* %foo, i64 %i, i64 %j) { %cast1 = bitcast i32* %gep1 to i8* %cmp = icmp ult i8* %cast1, %gep2 ret i1 %cmp -; CHECK: @test60 +; CHECK-LABEL: @test60( ; CHECK-NEXT: %gep1.idx = shl nuw i64 %i, 2 ; CHECK-NEXT: icmp slt i64 %gep1.idx, %j ; CHECK-NEXT: ret i1 @@ -624,7 +624,7 @@ define i1 @test61(i8* %foo, i64 %i, i64 %j) { %cmp = icmp ult i8* %cast1, %gep2 ret i1 %cmp ; Don't transform non-inbounds GEPs. -; CHECK: @test61 +; CHECK-LABEL: @test61( ; CHECK: icmp ult i8* %cast1, %gep2 ; CHECK-NEXT: ret i1 } @@ -634,7 +634,7 @@ define i1 @test62(i8* %a) { %arrayidx2 = getelementptr inbounds i8* %a, i64 10 %cmp = icmp slt i8* %arrayidx1, %arrayidx2 ret i1 %cmp -; CHECK: @test62 +; CHECK-LABEL: @test62( ; CHECK-NEXT: ret i1 true } @@ -643,7 +643,7 @@ define i1 @test63(i8 %a, i32 %b) nounwind { %t = and i32 %b, 255 %c = icmp eq i32 %z, %t ret i1 %c -; CHECK: @test63 +; CHECK-LABEL: @test63( ; CHECK-NEXT: %1 = trunc i32 %b to i8 ; CHECK-NEXT: %c = icmp eq i8 %1, %a ; CHECK-NEXT: ret i1 %c @@ -654,7 +654,7 @@ define i1 @test64(i8 %a, i32 %b) nounwind { %z = zext i8 %a to i32 %c = icmp eq i32 %t, %z ret i1 %c -; CHECK: @test64 +; CHECK-LABEL: @test64( ; CHECK-NEXT: %1 = trunc i32 %b to i8 ; CHECK-NEXT: %c = icmp eq i8 %1, %a ; CHECK-NEXT: ret i1 %c @@ -664,7 +664,7 @@ define i1 @test65(i64 %A, i64 %B) { %s1 = add i64 %A, %B %s2 = add i64 %A, %B %cmp = icmp eq i64 %s1, %s2 -; CHECK: @test65 +; CHECK-LABEL: @test65( ; CHECK-NEXT: ret i1 true ret i1 %cmp } @@ -673,12 +673,12 @@ define i1 @test66(i64 %A, i64 %B) { %s1 = add i64 %A, %B %s2 = add i64 %B, %A %cmp = icmp eq i64 %s1, %s2 -; CHECK: @test66 +; CHECK-LABEL: @test66( ; CHECK-NEXT: ret i1 true ret i1 %cmp } -; CHECK: @test67 +; CHECK-LABEL: @test67( ; CHECK: %and = and i32 %x, 96 ; CHECK: %cmp = icmp ne i32 %and, 0 define i1 @test67(i32 %x) nounwind uwtable { @@ -687,7 +687,7 @@ define i1 @test67(i32 %x) nounwind uwtable { ret i1 %cmp } -; CHECK: @test68 +; CHECK-LABEL: @test68( ; CHECK: %cmp = icmp ugt i32 %and, 30 define i1 @test68(i32 %x) nounwind uwtable { %and = and i32 %x, 127 @@ -696,7 +696,7 @@ define i1 @test68(i32 %x) nounwind uwtable { } ; PR14708 -; CHECK: @test69 +; CHECK-LABEL: @test69( ; CHECK: %1 = and i32 %c, -33 ; CHECK: %2 = icmp eq i32 %1, 65 ; CHECK: ret i1 %2 @@ -708,7 +708,7 @@ define i1 @test69(i32 %c) nounwind uwtable { } ; PR15940 -; CHECK: @test70 +; CHECK-LABEL: @test70( ; CHECK-NEXT: %A = srem i32 5, %X ; CHECK-NEXT: %C = icmp ne i32 %A, 2 ; CHECK-NEXT: ret i1 %C @@ -719,7 +719,7 @@ define i1 @test70(i32 %X) { ret i1 %C } -; CHECK: @icmp_sext16trunc +; CHECK-LABEL: @icmp_sext16trunc( ; CHECK-NEXT: %1 = trunc i32 %x to i16 ; CHECK-NEXT: %cmp = icmp slt i16 %1, 36 define i1 @icmp_sext16trunc(i32 %x) { @@ -729,7 +729,7 @@ define i1 @icmp_sext16trunc(i32 %x) { ret i1 %cmp } -; CHECK: @icmp_sext8trunc +; CHECK-LABEL: @icmp_sext8trunc( ; CHECK-NEXT: %1 = trunc i32 %x to i8 ; CHECK-NEXT: %cmp = icmp slt i8 %1, 36 define i1 @icmp_sext8trunc(i32 %x) { @@ -739,7 +739,7 @@ define i1 @icmp_sext8trunc(i32 %x) { ret i1 %cmp } -; CHECK: @icmp_shl16 +; CHECK-LABEL: @icmp_shl16( ; CHECK-NEXT: %1 = trunc i32 %x to i16 ; CHECK-NEXT: %cmp = icmp slt i16 %1, 36 define i1 @icmp_shl16(i32 %x) { @@ -748,7 +748,7 @@ define i1 @icmp_shl16(i32 %x) { ret i1 %cmp } -; CHECK: @icmp_shl24 +; CHECK-LABEL: @icmp_shl24( ; CHECK-NEXT: %1 = trunc i32 %x to i8 ; CHECK-NEXT: %cmp = icmp slt i8 %1, 36 define i1 @icmp_shl24(i32 %x) { @@ -759,7 +759,7 @@ define i1 @icmp_shl24(i32 %x) { ; If the (shl x, C) preserved the sign and this is a sign test, ; compare the LHS operand instead -; CHECK: @icmp_shl_nsw_sgt +; CHECK-LABEL: @icmp_shl_nsw_sgt( ; CHECK-NEXT: icmp sgt i32 %x, 0 define i1 @icmp_shl_nsw_sgt(i32 %x) { %shl = shl nsw i32 %x, 21 @@ -767,7 +767,7 @@ define i1 @icmp_shl_nsw_sgt(i32 %x) { ret i1 %cmp } -; CHECK: @icmp_shl_nsw_sge0 +; CHECK-LABEL: @icmp_shl_nsw_sge0( ; CHECK-NEXT: icmp sgt i32 %x, -1 define i1 @icmp_shl_nsw_sge0(i32 %x) { %shl = shl nsw i32 %x, 21 @@ -775,7 +775,7 @@ define i1 @icmp_shl_nsw_sge0(i32 %x) { ret i1 %cmp } -; CHECK: @icmp_shl_nsw_sge1 +; CHECK-LABEL: @icmp_shl_nsw_sge1( ; CHECK-NEXT: icmp sgt i32 %x, 0 define i1 @icmp_shl_nsw_sge1(i32 %x) { %shl = shl nsw i32 %x, 21 @@ -784,7 +784,7 @@ define i1 @icmp_shl_nsw_sge1(i32 %x) { } ; Checks for icmp (eq|ne) (shl x, C), 0 -; CHECK: @icmp_shl_nsw_eq +; CHECK-LABEL: @icmp_shl_nsw_eq( ; CHECK-NEXT: icmp eq i32 %x, 0 define i1 @icmp_shl_nsw_eq(i32 %x) { %mul = shl nsw i32 %x, 5 @@ -792,7 +792,7 @@ define i1 @icmp_shl_nsw_eq(i32 %x) { ret i1 %cmp } -; CHECK: @icmp_shl_eq +; CHECK-LABEL: @icmp_shl_eq( ; CHECK-NOT: icmp eq i32 %mul, 0 define i1 @icmp_shl_eq(i32 %x) { %mul = shl i32 %x, 5 @@ -800,7 +800,7 @@ define i1 @icmp_shl_eq(i32 %x) { ret i1 %cmp } -; CHECK: @icmp_shl_nsw_ne +; CHECK-LABEL: @icmp_shl_nsw_ne( ; CHECK-NEXT: icmp ne i32 %x, 0 define i1 @icmp_shl_nsw_ne(i32 %x) { %mul = shl nsw i32 %x, 7 @@ -808,7 +808,7 @@ define i1 @icmp_shl_nsw_ne(i32 %x) { ret i1 %cmp } -; CHECK: @icmp_shl_ne +; CHECK-LABEL: @icmp_shl_ne( ; CHECK-NOT: icmp ne i32 %x, 0 define i1 @icmp_shl_ne(i32 %x) { %mul = shl i32 %x, 7 @@ -818,7 +818,7 @@ define i1 @icmp_shl_ne(i32 %x) { ; If the (mul x, C) preserved the sign and this is sign test, ; compare the LHS operand instead -; CHECK: @icmp_mul_nsw +; CHECK-LABEL: @icmp_mul_nsw( ; CHECK-NEXT: icmp sgt i32 %x, 0 define i1 @icmp_mul_nsw(i32 %x) { %mul = mul nsw i32 %x, 12 @@ -826,7 +826,7 @@ define i1 @icmp_mul_nsw(i32 %x) { ret i1 %cmp } -; CHECK: @icmp_mul_nsw1 +; CHECK-LABEL: @icmp_mul_nsw1( ; CHECK-NEXT: icmp slt i32 %x, 0 define i1 @icmp_mul_nsw1(i32 %x) { %mul = mul nsw i32 %x, 12 @@ -834,7 +834,7 @@ define i1 @icmp_mul_nsw1(i32 %x) { ret i1 %cmp } -; CHECK: @icmp_mul_nsw_neg +; CHECK-LABEL: @icmp_mul_nsw_neg( ; CHECK-NEXT: icmp slt i32 %x, 1 define i1 @icmp_mul_nsw_neg(i32 %x) { %mul = mul nsw i32 %x, -12 @@ -842,7 +842,7 @@ define i1 @icmp_mul_nsw_neg(i32 %x) { ret i1 %cmp } -; CHECK: @icmp_mul_nsw_neg1 +; CHECK-LABEL: @icmp_mul_nsw_neg1( ; CHECK-NEXT: icmp slt i32 %x, 0 define i1 @icmp_mul_nsw_neg1(i32 %x) { %mul = mul nsw i32 %x, -12 @@ -850,7 +850,7 @@ define i1 @icmp_mul_nsw_neg1(i32 %x) { ret i1 %cmp } -; CHECK: @icmp_mul_nsw_0 +; CHECK-LABEL: @icmp_mul_nsw_0( ; CHECK-NOT: icmp sgt i32 %x, 0 define i1 @icmp_mul_nsw_0(i32 %x) { %mul = mul nsw i32 %x, 0 @@ -858,7 +858,7 @@ define i1 @icmp_mul_nsw_0(i32 %x) { ret i1 %cmp } -; CHECK: @icmp_mul +; CHECK-LABEL: @icmp_mul( ; CHECK-NEXT: %mul = mul i32 %x, -12 define i1 @icmp_mul(i32 %x) { %mul = mul i32 %x, -12 @@ -867,7 +867,7 @@ define i1 @icmp_mul(i32 %x) { } ; Checks for icmp (eq|ne) (mul x, C), 0 -; CHECK: @icmp_mul_neq0 +; CHECK-LABEL: @icmp_mul_neq0( ; CHECK-NEXT: icmp ne i32 %x, 0 define i1 @icmp_mul_neq0(i32 %x) { %mul = mul nsw i32 %x, -12 @@ -875,7 +875,7 @@ define i1 @icmp_mul_neq0(i32 %x) { ret i1 %cmp } -; CHECK: @icmp_mul_eq0 +; CHECK-LABEL: @icmp_mul_eq0( ; CHECK-NEXT: icmp eq i32 %x, 0 define i1 @icmp_mul_eq0(i32 %x) { %mul = mul nsw i32 %x, 12 @@ -883,7 +883,7 @@ define i1 @icmp_mul_eq0(i32 %x) { ret i1 %cmp } -; CHECK: @icmp_mul0_eq0 +; CHECK-LABEL: @icmp_mul0_eq0( ; CHECK-NEXT: ret i1 true define i1 @icmp_mul0_eq0(i32 %x) { %mul = mul i32 %x, 0 @@ -891,7 +891,7 @@ define i1 @icmp_mul0_eq0(i32 %x) { ret i1 %cmp } -; CHECK: @icmp_mul0_ne0 +; CHECK-LABEL: @icmp_mul0_ne0( ; CHECK-NEXT: ret i1 false define i1 @icmp_mul0_ne0(i32 %x) { %mul = mul i32 %x, 0 @@ -899,7 +899,7 @@ define i1 @icmp_mul0_ne0(i32 %x) { ret i1 %cmp } -; CHECK: @icmp_sub1_sge +; CHECK-LABEL: @icmp_sub1_sge( ; CHECK-NEXT: icmp sgt i32 %x, %y define i1 @icmp_sub1_sge(i32 %x, i32 %y) { %sub = add nsw i32 %x, -1 @@ -907,7 +907,7 @@ define i1 @icmp_sub1_sge(i32 %x, i32 %y) { ret i1 %cmp } -; CHECK: @icmp_add1_sgt +; CHECK-LABEL: @icmp_add1_sgt( ; CHECK-NEXT: icmp sge i32 %x, %y define i1 @icmp_add1_sgt(i32 %x, i32 %y) { %add = add nsw i32 %x, 1 @@ -915,7 +915,7 @@ define i1 @icmp_add1_sgt(i32 %x, i32 %y) { ret i1 %cmp } -; CHECK: @icmp_sub1_slt +; CHECK-LABEL: @icmp_sub1_slt( ; CHECK-NEXT: icmp sle i32 %x, %y define i1 @icmp_sub1_slt(i32 %x, i32 %y) { %sub = add nsw i32 %x, -1 @@ -923,7 +923,7 @@ define i1 @icmp_sub1_slt(i32 %x, i32 %y) { ret i1 %cmp } -; CHECK: @icmp_add1_sle +; CHECK-LABEL: @icmp_add1_sle( ; CHECK-NEXT: icmp slt i32 %x, %y define i1 @icmp_add1_sle(i32 %x, i32 %y) { %add = add nsw i32 %x, 1 @@ -931,7 +931,7 @@ define i1 @icmp_add1_sle(i32 %x, i32 %y) { ret i1 %cmp } -; CHECK: @icmp_add20_sge_add57 +; CHECK-LABEL: @icmp_add20_sge_add57( ; CHECK-NEXT: [[ADD:%[a-z0-9]+]] = add nsw i32 %y, 37 ; CHECK-NEXT: icmp sle i32 [[ADD]], %x define i1 @icmp_add20_sge_add57(i32 %x, i32 %y) { @@ -941,7 +941,7 @@ define i1 @icmp_add20_sge_add57(i32 %x, i32 %y) { ret i1 %cmp } -; CHECK: @icmp_sub57_sge_sub20 +; CHECK-LABEL: @icmp_sub57_sge_sub20( ; CHECK-NEXT: [[SUB:%[a-z0-9]+]] = add nsw i32 %x, -37 ; CHECK-NEXT: icmp sge i32 [[SUB]], %y define i1 @icmp_sub57_sge_sub20(i32 %x, i32 %y) { @@ -951,7 +951,7 @@ define i1 @icmp_sub57_sge_sub20(i32 %x, i32 %y) { ret i1 %cmp } -; CHECK: @icmp_and_shl_neg_ne_0 +; CHECK-LABEL: @icmp_and_shl_neg_ne_0( ; CHECK-NEXT: [[SHL:%[a-z0-9]+]] = shl i32 1, %B ; CHECK-NEXT: [[AND:%[a-z0-9]+]] = and i32 [[SHL]], %A ; CHECK-NEXT: [[CMP:%[a-z0-9]+]] = icmp eq i32 [[AND]], 0 @@ -964,7 +964,7 @@ define i1 @icmp_and_shl_neg_ne_0(i32 %A, i32 %B) { ret i1 %cmp } -; CHECK: @icmp_and_shl_neg_eq_0 +; CHECK-LABEL: @icmp_and_shl_neg_eq_0( ; CHECK-NEXT: [[SHL:%[a-z0-9]+]] = shl i32 1, %B ; CHECK-NEXT: [[AND:%[a-z0-9]+]] = and i32 [[SHL]], %A ; CHECK-NEXT: [[CMP:%[a-z0-9]+]] = icmp ne i32 [[AND]], 0 @@ -977,7 +977,7 @@ define i1 @icmp_and_shl_neg_eq_0(i32 %A, i32 %B) { ret i1 %cmp } -; CHECK: @icmp_add_and_shr_ne_0 +; CHECK-LABEL: @icmp_add_and_shr_ne_0( ; CHECK-NEXT: [[AND:%[a-z0-9]+]] = and i32 %X, 240 ; CHECK-NEXT: [[CMP:%[a-z0-9]+]] = icmp ne i32 [[AND]], 224 ; CHECK-NEXT: ret i1 [[CMP]] @@ -999,7 +999,7 @@ define i1 @test71(i8* %x) { ret i1 %c } -; CHECK: @icmp_shl_1_V_ult_32 +; CHECK-LABEL: @icmp_shl_1_V_ult_32( ; CHECK-NEXT: [[CMP:%[a-z0-9]+]] = icmp ult i32 %V, 5 ; CHECK-NEXT: ret i1 [[CMP]] define i1 @icmp_shl_1_V_ult_32(i32 %V) { @@ -1008,7 +1008,7 @@ define i1 @icmp_shl_1_V_ult_32(i32 %V) { ret i1 %cmp } -; CHECK: @icmp_shl_1_V_eq_32 +; CHECK-LABEL: @icmp_shl_1_V_eq_32( ; CHECK-NEXT: [[CMP:%[a-z0-9]+]] = icmp eq i32 %V, 5 ; CHECK-NEXT: ret i1 [[CMP]] define i1 @icmp_shl_1_V_eq_32(i32 %V) { @@ -1017,7 +1017,7 @@ define i1 @icmp_shl_1_V_eq_32(i32 %V) { ret i1 %cmp } -; CHECK: @icmp_shl_1_V_eq_31 +; CHECK-LABEL: @icmp_shl_1_V_eq_31( ; CHECK-NEXT: ret i1 false define i1 @icmp_shl_1_V_eq_31(i32 %V) { %shl = shl i32 1, %V @@ -1025,7 +1025,7 @@ define i1 @icmp_shl_1_V_eq_31(i32 %V) { ret i1 %cmp } -; CHECK: @icmp_shl_1_V_ne_31 +; CHECK-LABEL: @icmp_shl_1_V_ne_31( ; CHECK-NEXT: ret i1 true define i1 @icmp_shl_1_V_ne_31(i32 %V) { %shl = shl i32 1, %V @@ -1033,7 +1033,7 @@ define i1 @icmp_shl_1_V_ne_31(i32 %V) { ret i1 %cmp } -; CHECK: @icmp_shl_1_V_ult_30 +; CHECK-LABEL: @icmp_shl_1_V_ult_30( ; CHECK-NEXT: [[CMP:%[a-z0-9]+]] = icmp ult i32 %V, 5 ; CHECK-NEXT: ret i1 [[CMP]] define i1 @icmp_shl_1_V_ult_30(i32 %V) { @@ -1042,7 +1042,7 @@ define i1 @icmp_shl_1_V_ult_30(i32 %V) { ret i1 %cmp } -; CHECK: @icmp_shl_1_V_ugt_30 +; CHECK-LABEL: @icmp_shl_1_V_ugt_30( ; CHECK-NEXT: [[CMP:%[a-z0-9]+]] = icmp ugt i32 %V, 4 ; CHECK-NEXT: ret i1 [[CMP]] define i1 @icmp_shl_1_V_ugt_30(i32 %V) { @@ -1051,7 +1051,7 @@ define i1 @icmp_shl_1_V_ugt_30(i32 %V) { ret i1 %cmp } -; CHECK: @icmp_shl_1_V_ule_30 +; CHECK-LABEL: @icmp_shl_1_V_ule_30( ; CHECK-NEXT: [[CMP:%[a-z0-9]+]] = icmp ult i32 %V, 5 ; CHECK-NEXT: ret i1 [[CMP]] define i1 @icmp_shl_1_V_ule_30(i32 %V) { @@ -1060,7 +1060,7 @@ define i1 @icmp_shl_1_V_ule_30(i32 %V) { ret i1 %cmp } -; CHECK: @icmp_shl_1_V_uge_30 +; CHECK-LABEL: @icmp_shl_1_V_uge_30( ; CHECK-NEXT: [[CMP:%[a-z0-9]+]] = icmp ugt i32 %V, 4 ; CHECK-NEXT: ret i1 [[CMP]] define i1 @icmp_shl_1_V_uge_30(i32 %V) { @@ -1069,7 +1069,7 @@ define i1 @icmp_shl_1_V_uge_30(i32 %V) { ret i1 %cmp } -; CHECK: @icmp_shl_1_V_uge_2147483648 +; CHECK-LABEL: @icmp_shl_1_V_uge_2147483648( ; CHECK-NEXT: [[CMP:%[a-z0-9]+]] = icmp eq i32 %V, 31 ; CHECK-NEXT: ret i1 [[CMP]] define i1 @icmp_shl_1_V_uge_2147483648(i32 %V) { @@ -1078,7 +1078,7 @@ define i1 @icmp_shl_1_V_uge_2147483648(i32 %V) { ret i1 %cmp } -; CHECK: @icmp_shl_1_V_ugt_2147483648 +; CHECK-LABEL: @icmp_shl_1_V_ugt_2147483648( ; CHECK-NEXT: ret i1 false define i1 @icmp_shl_1_V_ugt_2147483648(i32 %V) { %shl = shl i32 1, %V @@ -1086,7 +1086,7 @@ define i1 @icmp_shl_1_V_ugt_2147483648(i32 %V) { ret i1 %cmp } -; CHECK: @icmp_shl_1_V_ule_2147483648 +; CHECK-LABEL: @icmp_shl_1_V_ule_2147483648( ; CHECK-NEXT: ret i1 true define i1 @icmp_shl_1_V_ule_2147483648(i32 %V) { %shl = shl i32 1, %V @@ -1094,7 +1094,7 @@ define i1 @icmp_shl_1_V_ule_2147483648(i32 %V) { ret i1 %cmp } -; CHECK: @icmp_shl_1_V_ult_2147483648 +; CHECK-LABEL: @icmp_shl_1_V_ult_2147483648( ; CHECK-NEXT: [[CMP:%[a-z0-9]+]] = icmp ne i32 %V, 31 ; CHECK-NEXT: ret i1 [[CMP]] define i1 @icmp_shl_1_V_ult_2147483648(i32 %V) { @@ -1103,7 +1103,7 @@ define i1 @icmp_shl_1_V_ult_2147483648(i32 %V) { ret i1 %cmp } -; CHECK: @or_icmp_eq_B_0_icmp_ult_A_B +; CHECK-LABEL: @or_icmp_eq_B_0_icmp_ult_A_B( ; CHECK-NEXT: [[SUB:%[a-z0-9]+]] = add i64 %b, -1 ; CHECK-NEXT: [[CMP:%[a-z0-9]+]] = icmp uge i64 [[SUB]], %a ; CHECK-NEXT: ret i1 [[CMP]] @@ -1114,7 +1114,7 @@ define i1 @or_icmp_eq_B_0_icmp_ult_A_B(i64 %a, i64 %b) { ret i1 %3 } -; CHECK: @icmp_add_ult_2 +; CHECK-LABEL: @icmp_add_ult_2( ; CHECK-NEXT: [[AND:%[a-z0-9]+]] = and i32 %X, -2 ; CHECK-NEXT: [[CMP:%[a-z0-9]+]] = icmp eq i32 [[AND]], 14 ; CHECK-NEXT: ret i1 [[CMP]] @@ -1134,7 +1134,7 @@ define i1 @icmp_add_X_-14_ult_2(i32 %X) { ret i1 %cmp } -; CHECK: @icmp_sub_3_X_ult_2 +; CHECK-LABEL: @icmp_sub_3_X_ult_2( ; CHECK-NEXT: [[OR:%[a-z0-9]+]] = or i32 %X, 1 ; CHECK-NEXT: [[CMP:%[a-z0-9]+]] = icmp eq i32 [[OR]], 3 ; CHECK-NEXT: ret i1 [[CMP]] @@ -1154,7 +1154,7 @@ define i1 @icmp_add_X_-14_uge_2(i32 %X) { ret i1 %cmp } -; CHECK: @icmp_sub_3_X_uge_2 +; CHECK-LABEL: @icmp_sub_3_X_uge_2( ; CHECK-NEXT: [[OR:%[a-z0-9]+]] = or i32 %X, 1 ; CHECK-NEXT: [[CMP:%[a-z0-9]+]] = icmp ne i32 [[OR]], 3 ; CHECK-NEXT: ret i1 [[CMP]] diff --git a/test/Transforms/InstCombine/idioms.ll b/test/Transforms/InstCombine/idioms.ll index 1a211668c3b..58485442230 100644 --- a/test/Transforms/InstCombine/idioms.ll +++ b/test/Transforms/InstCombine/idioms.ll @@ -25,7 +25,7 @@ bb3: bb4: %f = phi i32 [ %not2, %bb2 ], [ %e, %bb3 ] ret i32 %f -; CHECK: @test_asr +; CHECK-LABEL: @test_asr( ; CHECK: bb4: ; CHECK: %f = ashr i32 %a, %b ; CHECK: ret i32 %f diff --git a/test/Transforms/InstCombine/intrinsics.ll b/test/Transforms/InstCombine/intrinsics.ll index f334b3b1e93..91c44704ce7 100644 --- a/test/Transforms/InstCombine/intrinsics.ll +++ b/test/Transforms/InstCombine/intrinsics.ll @@ -14,7 +14,7 @@ define i8 @uaddtest1(i8 %A, i8 %B) { %x = call %overflow.result @llvm.uadd.with.overflow.i8(i8 %A, i8 %B) %y = extractvalue %overflow.result %x, 0 ret i8 %y -; CHECK: @uaddtest1 +; CHECK-LABEL: @uaddtest1( ; CHECK-NEXT: %y = add i8 %A, %B ; CHECK-NEXT: ret i8 %y } @@ -27,7 +27,7 @@ define i8 @uaddtest2(i8 %A, i8 %B, i1* %overflowPtr) { %z = extractvalue %overflow.result %x, 1 store i1 %z, i1* %overflowPtr ret i8 %y -; CHECK: @uaddtest2 +; CHECK-LABEL: @uaddtest2( ; CHECK-NEXT: %and.A = and i8 %A, 127 ; CHECK-NEXT: %and.B = and i8 %B, 127 ; CHECK-NEXT: %x = add nuw i8 %and.A, %and.B @@ -43,7 +43,7 @@ define i8 @uaddtest3(i8 %A, i8 %B, i1* %overflowPtr) { %z = extractvalue %overflow.result %x, 1 store i1 %z, i1* %overflowPtr ret i8 %y -; CHECK: @uaddtest3 +; CHECK-LABEL: @uaddtest3( ; CHECK-NEXT: %or.A = or i8 %A, -128 ; CHECK-NEXT: %or.B = or i8 %B, -128 ; CHECK-NEXT: %x = add i8 %or.A, %or.B @@ -57,7 +57,7 @@ define i8 @uaddtest4(i8 %A, i1* %overflowPtr) { %z = extractvalue %overflow.result %x, 1 store i1 %z, i1* %overflowPtr ret i8 %y -; CHECK: @uaddtest4 +; CHECK-LABEL: @uaddtest4( ; CHECK-NEXT: ret i8 undef } @@ -67,7 +67,7 @@ define i8 @uaddtest5(i8 %A, i1* %overflowPtr) { %z = extractvalue %overflow.result %x, 1 store i1 %z, i1* %overflowPtr ret i8 %y -; CHECK: @uaddtest5 +; CHECK-LABEL: @uaddtest5( ; CHECK: ret i8 %A } @@ -75,7 +75,7 @@ define i1 @uaddtest6(i8 %A, i8 %B) { %x = call %overflow.result @llvm.uadd.with.overflow.i8(i8 %A, i8 -4) %z = extractvalue %overflow.result %x, 1 ret i1 %z -; CHECK: @uaddtest6 +; CHECK-LABEL: @uaddtest6( ; CHECK-NEXT: %z = icmp ugt i8 %A, 3 ; CHECK-NEXT: ret i1 %z } @@ -84,7 +84,7 @@ define i8 @uaddtest7(i8 %A, i8 %B) { %x = call %overflow.result @llvm.uadd.with.overflow.i8(i8 %A, i8 %B) %z = extractvalue %overflow.result %x, 0 ret i8 %z -; CHECK: @uaddtest7 +; CHECK-LABEL: @uaddtest7( ; CHECK-NEXT: %z = add i8 %A, %B ; CHECK-NEXT: ret i8 %z } @@ -96,7 +96,7 @@ define i8 @umultest1(i8 %A, i1* %overflowPtr) { %z = extractvalue %overflow.result %x, 1 store i1 %z, i1* %overflowPtr ret i8 %y -; CHECK: @umultest1 +; CHECK-LABEL: @umultest1( ; CHECK-NEXT: store i1 false, i1* %overflowPtr ; CHECK-NEXT: ret i8 0 } @@ -107,7 +107,7 @@ define i8 @umultest2(i8 %A, i1* %overflowPtr) { %z = extractvalue %overflow.result %x, 1 store i1 %z, i1* %overflowPtr ret i8 %y -; CHECK: @umultest2 +; CHECK-LABEL: @umultest2( ; CHECK-NEXT: store i1 false, i1* %overflowPtr ; CHECK-NEXT: ret i8 %A } @@ -122,7 +122,7 @@ define i32 @umultest3(i32 %n) nounwind { %res = extractvalue %ov.result.32 %mul, 0 %ret = select i1 %ov, i32 -1, i32 %res ret i32 %ret -; CHECK: @umultest3 +; CHECK-LABEL: @umultest3( ; CHECK-NEXT: shr ; CHECK-NEXT: mul nuw ; CHECK-NEXT: ret @@ -135,7 +135,7 @@ define i32 @umultest4(i32 %n) nounwind { %res = extractvalue %ov.result.32 %mul, 0 %ret = select i1 %ov, i32 -1, i32 %res ret i32 %ret -; CHECK: @umultest4 +; CHECK-LABEL: @umultest4( ; CHECK: umul.with.overflow } @@ -150,7 +150,7 @@ entry: %C = tail call double @llvm.powi.f64(double %V, i32 1) nounwind store volatile double %C, double* %P ret void -; CHECK: @powi +; CHECK-LABEL: @powi( ; CHECK: %A = fdiv double 1.0{{.*}}, %V ; CHECK: store volatile double %A, ; CHECK: store volatile double 1.0 @@ -163,7 +163,7 @@ entry: %and = and i32 %or, -8 %count = tail call i32 @llvm.cttz.i32(i32 %and, i1 true) nounwind readnone ret i32 %count -; CHECK: @cttz +; CHECK-LABEL: @cttz( ; CHECK-NEXT: entry: ; CHECK-NEXT: ret i32 3 } @@ -174,7 +174,7 @@ entry: %and = and i8 %or, 63 %count = tail call i8 @llvm.ctlz.i8(i8 %and, i1 true) nounwind readnone ret i8 %count -; CHECK: @ctlz +; CHECK-LABEL: @ctlz( ; CHECK-NEXT: entry: ; CHECK-NEXT: ret i8 2 } @@ -206,7 +206,7 @@ define i32 @cttz_simplify1a(i32 %x) nounwind readnone ssp { %shr3 = lshr i32 %tmp1, 5 ret i32 %shr3 -; CHECK: @cttz_simplify1a +; CHECK-LABEL: @cttz_simplify1a( ; CHECK: icmp eq i32 %x, 0 ; CHECK-NEXT: zext i1 ; CHECK-NEXT: ret i32 @@ -217,7 +217,7 @@ define i32 @cttz_simplify1b(i32 %x) nounwind readnone ssp { %shr3 = lshr i32 %tmp1, 5 ret i32 %shr3 -; CHECK: @cttz_simplify1b +; CHECK-LABEL: @cttz_simplify1b( ; CHECK-NEXT: ret i32 0 } @@ -225,7 +225,7 @@ define i32 @ctlz_undef(i32 %Value) nounwind { %ctlz = call i32 @llvm.ctlz.i32(i32 0, i1 true) ret i32 %ctlz -; CHECK: @ctlz_undef +; CHECK-LABEL: @ctlz_undef( ; CHECK-NEXT: ret i32 undef } @@ -233,7 +233,7 @@ define i32 @cttz_undef(i32 %Value) nounwind { %cttz = call i32 @llvm.cttz.i32(i32 0, i1 true) ret i32 %cttz -; CHECK: @cttz_undef +; CHECK-LABEL: @cttz_undef( ; CHECK-NEXT: ret i32 undef } @@ -243,7 +243,7 @@ define i32 @ctlz_select(i32 %Value) nounwind { %s = select i1 %tobool, i32 %ctlz, i32 32 ret i32 %s -; CHECK: @ctlz_select +; CHECK-LABEL: @ctlz_select( ; CHECK: select i1 %tobool, i32 %ctlz, i32 32 } @@ -253,6 +253,6 @@ define i32 @cttz_select(i32 %Value) nounwind { %s = select i1 %tobool, i32 %cttz, i32 32 ret i32 %s -; CHECK: @cttz_select +; CHECK-LABEL: @cttz_select( ; CHECK: select i1 %tobool, i32 %cttz, i32 32 } diff --git a/test/Transforms/InstCombine/invoke.ll b/test/Transforms/InstCombine/invoke.ll index 04eaf86a287..c4b58de6194 100644 --- a/test/Transforms/InstCombine/invoke.ll +++ b/test/Transforms/InstCombine/invoke.ll @@ -7,7 +7,7 @@ declare i64 @llvm.objectsize.i64(i8*, i1) nounwind readonly declare i8* @_Znwm(i64) -; CHECK: @f1 +; CHECK-LABEL: @f1( define i64 @f1() nounwind uwtable ssp { entry: ; CHECK: nvoke noalias i8* undef() @@ -27,7 +27,7 @@ lpad: unreachable } -; CHECK: @f2 +; CHECK-LABEL: @f2( define i64 @f2() nounwind uwtable ssp { entry: ; CHECK: nvoke noalias i8* null() @@ -47,7 +47,7 @@ lpad: unreachable } -; CHECK: @f3 +; CHECK-LABEL: @f3( define void @f3() nounwind uwtable ssp { ; CHECK: invoke void @llvm.donothing() %call = invoke noalias i8* @_Znwm(i64 13) diff --git a/test/Transforms/InstCombine/isascii-1.ll b/test/Transforms/InstCombine/isascii-1.ll index 2a413d89b49..88f5ad66d2e 100644 --- a/test/Transforms/InstCombine/isascii-1.ll +++ b/test/Transforms/InstCombine/isascii-1.ll @@ -9,21 +9,21 @@ declare i32 @isascii(i32) ; Check isascii(c) -> c (c - '0') = len. define void @test_simplify1() { -; CHECK: @test_simplify1 +; CHECK-LABEL: @test_simplify1( %dst = bitcast %struct.T1* @t1 to i8* %src = bitcast %struct.T2* @t2 to i8* @@ -26,7 +26,7 @@ define void @test_simplify1() { } define void @test_simplify2() { -; CHECK: @test_simplify2 +; CHECK-LABEL: @test_simplify2( %dst = bitcast %struct.T1* @t1 to i8* %src = bitcast %struct.T3* @t3 to i8* @@ -38,7 +38,7 @@ define void @test_simplify2() { ; Check cases where dstlen < len. define void @test_no_simplify1() { -; CHECK: @test_no_simplify1 +; CHECK-LABEL: @test_no_simplify1( %dst = bitcast %struct.T3* @t3 to i8* %src = bitcast %struct.T1* @t1 to i8* @@ -48,7 +48,7 @@ define void @test_no_simplify1() { } define void @test_no_simplify2() { -; CHECK: @test_no_simplify2 +; CHECK-LABEL: @test_no_simplify2( %dst = bitcast %struct.T1* @t1 to i8* %src = bitcast %struct.T2* @t2 to i8* diff --git a/test/Transforms/InstCombine/memcpy_chk-2.ll b/test/Transforms/InstCombine/memcpy_chk-2.ll index aa43029d47f..320b54f82dc 100644 --- a/test/Transforms/InstCombine/memcpy_chk-2.ll +++ b/test/Transforms/InstCombine/memcpy_chk-2.ll @@ -12,7 +12,7 @@ target datalayout = "e-p:64:64:64-i1:8:8-i8:8:8-i16:16:16-i32:32:32-i64:64:64-f3 @t2 = common global %struct.T2 zeroinitializer define void @test_no_simplify() { -; CHECK: @test_no_simplify +; CHECK-LABEL: @test_no_simplify( %dst = bitcast %struct.T1* @t1 to i8* %src = bitcast %struct.T2* @t2 to i8* diff --git a/test/Transforms/InstCombine/memmove-1.ll b/test/Transforms/InstCombine/memmove-1.ll index 53f2f116c77..0445a60aedd 100644 --- a/test/Transforms/InstCombine/memmove-1.ll +++ b/test/Transforms/InstCombine/memmove-1.ll @@ -9,7 +9,7 @@ declare i8* @memmove(i8*, i8*, i32) ; Check memmove(mem1, mem2, size) -> llvm.memmove(mem1, mem2, size, 1). define i8* @test_simplify1(i8* %mem1, i8* %mem2, i32 %size) { -; CHECK: @test_simplify1 +; CHECK-LABEL: @test_simplify1( %ret = call i8* @memmove(i8* %mem1, i8* %mem2, i32 %size) ; CHECK: call void @llvm.memmove ret i8* %ret diff --git a/test/Transforms/InstCombine/memmove-2.ll b/test/Transforms/InstCombine/memmove-2.ll index 23887bce31d..b20e96bc555 100644 --- a/test/Transforms/InstCombine/memmove-2.ll +++ b/test/Transforms/InstCombine/memmove-2.ll @@ -9,7 +9,7 @@ declare i8 @memmove(i8*, i8*, i32) ; Check that memmove functions with the wrong prototype aren't simplified. define i8 @test_no_simplify1(i8* %mem1, i8* %mem2, i32 %size) { -; CHECK: @test_no_simplify1 +; CHECK-LABEL: @test_no_simplify1( %ret = call i8 @memmove(i8* %mem1, i8* %mem2, i32 %size) ; CHECK: call i8 @memmove ret i8 %ret diff --git a/test/Transforms/InstCombine/memmove_chk-1.ll b/test/Transforms/InstCombine/memmove_chk-1.ll index f9ff9a103a3..6d93bbbf959 100644 --- a/test/Transforms/InstCombine/memmove_chk-1.ll +++ b/test/Transforms/InstCombine/memmove_chk-1.ll @@ -16,7 +16,7 @@ target datalayout = "e-p:64:64:64-i1:8:8-i8:8:8-i16:16:16-i32:32:32-i64:64:64-f3 ; Check cases where dstlen >= len. define void @test_simplify1() { -; CHECK: @test_simplify1 +; CHECK-LABEL: @test_simplify1( %dst = bitcast %struct.T1* @t1 to i8* %src = bitcast %struct.T2* @t2 to i8* @@ -26,7 +26,7 @@ define void @test_simplify1() { } define void @test_simplify2() { -; CHECK: @test_simplify2 +; CHECK-LABEL: @test_simplify2( %dst = bitcast %struct.T1* @t1 to i8* %src = bitcast %struct.T3* @t3 to i8* @@ -38,7 +38,7 @@ define void @test_simplify2() { ; Check cases where dstlen < len. define void @test_no_simplify1() { -; CHECK: @test_no_simplify1 +; CHECK-LABEL: @test_no_simplify1( %dst = bitcast %struct.T3* @t3 to i8* %src = bitcast %struct.T1* @t1 to i8* @@ -48,7 +48,7 @@ define void @test_no_simplify1() { } define void @test_no_simplify2() { -; CHECK: @test_no_simplify2 +; CHECK-LABEL: @test_no_simplify2( %dst = bitcast %struct.T1* @t1 to i8* %src = bitcast %struct.T2* @t2 to i8* diff --git a/test/Transforms/InstCombine/memmove_chk-2.ll b/test/Transforms/InstCombine/memmove_chk-2.ll index f0a915fde2e..adadf905a58 100644 --- a/test/Transforms/InstCombine/memmove_chk-2.ll +++ b/test/Transforms/InstCombine/memmove_chk-2.ll @@ -12,7 +12,7 @@ target datalayout = "e-p:64:64:64-i1:8:8-i8:8:8-i16:16:16-i32:32:32-i64:64:64-f3 @t2 = common global %struct.T2 zeroinitializer define void @test_no_simplify() { -; CHECK: @test_no_simplify +; CHECK-LABEL: @test_no_simplify( %dst = bitcast %struct.T1* @t1 to i8* %src = bitcast %struct.T2* @t2 to i8* diff --git a/test/Transforms/InstCombine/memset-1.ll b/test/Transforms/InstCombine/memset-1.ll index 48b433e137c..991567d6b59 100644 --- a/test/Transforms/InstCombine/memset-1.ll +++ b/test/Transforms/InstCombine/memset-1.ll @@ -9,7 +9,7 @@ declare i8* @memset(i8*, i32, i32) ; Check memset(mem1, val, size) -> llvm.memset(mem1, val, size, 1). define i8* @test_simplify1(i8* %mem, i32 %val, i32 %size) { -; CHECK: @test_simplify1 +; CHECK-LABEL: @test_simplify1( %ret = call i8* @memset(i8* %mem, i32 %val, i32 %size) ; CHECK: call void @llvm.memset ret i8* %ret diff --git a/test/Transforms/InstCombine/memset-2.ll b/test/Transforms/InstCombine/memset-2.ll index 8a9033302d0..5e446cb0ee0 100644 --- a/test/Transforms/InstCombine/memset-2.ll +++ b/test/Transforms/InstCombine/memset-2.ll @@ -9,7 +9,7 @@ declare i8 @memset(i8*, i32, i32) ; Check that memset functions with the wrong prototype aren't simplified. define i8 @test_no_simplify1(i8* %mem, i32 %val, i32 %size) { -; CHECK: @test_no_simplify1 +; CHECK-LABEL: @test_no_simplify1( %ret = call i8 @memset(i8* %mem, i32 %val, i32 %size) ; CHECK: call i8 @memset ret i8 %ret diff --git a/test/Transforms/InstCombine/memset_chk-1.ll b/test/Transforms/InstCombine/memset_chk-1.ll index be4c1cfccdb..47cc7db998e 100644 --- a/test/Transforms/InstCombine/memset_chk-1.ll +++ b/test/Transforms/InstCombine/memset_chk-1.ll @@ -12,7 +12,7 @@ target datalayout = "e-p:64:64:64-i1:8:8-i8:8:8-i16:16:16-i32:32:32-i64:64:64-f3 ; Check cases where dstlen >= len. define void @test_simplify1() { -; CHECK: @test_simplify1 +; CHECK-LABEL: @test_simplify1( %dst = bitcast %struct.T* @t to i8* ; CHECK-NEXT: call void @llvm.memset.p0i8.i64 @@ -21,7 +21,7 @@ define void @test_simplify1() { } define void @test_simplify2() { -; CHECK: @test_simplify2 +; CHECK-LABEL: @test_simplify2( %dst = bitcast %struct.T* @t to i8* ; CHECK-NEXT: call void @llvm.memset.p0i8.i64 @@ -30,7 +30,7 @@ define void @test_simplify2() { } define void @test_simplify3() { -; CHECK: @test_simplify3 +; CHECK-LABEL: @test_simplify3( %dst = bitcast %struct.T* @t to i8* ; CHECK-NEXT: call void @llvm.memset.p0i8.i64 @@ -41,7 +41,7 @@ define void @test_simplify3() { ; Check cases where dstlen < len. define void @test_no_simplify1() { -; CHECK: @test_no_simplify1 +; CHECK-LABEL: @test_no_simplify1( %dst = bitcast %struct.T* @t to i8* ; CHECK-NEXT: call i8* @__memset_chk @@ -50,7 +50,7 @@ define void @test_no_simplify1() { } define void @test_no_simplify2() { -; CHECK: @test_no_simplify2 +; CHECK-LABEL: @test_no_simplify2( %dst = bitcast %struct.T* @t to i8* ; CHECK-NEXT: call i8* @__memset_chk diff --git a/test/Transforms/InstCombine/memset_chk-2.ll b/test/Transforms/InstCombine/memset_chk-2.ll index 60fbf163c21..bb4f772785e 100644 --- a/test/Transforms/InstCombine/memset_chk-2.ll +++ b/test/Transforms/InstCombine/memset_chk-2.ll @@ -9,7 +9,7 @@ target datalayout = "e-p:64:64:64-i1:8:8-i8:8:8-i16:16:16-i32:32:32-i64:64:64-f3 @t = common global %struct.T zeroinitializer define void @test_no_simplify() { -; CHECK: @test_no_simplify +; CHECK-LABEL: @test_no_simplify( %dst = bitcast %struct.T* @t to i8* ; CHECK-NEXT: call i8* @__memset_chk diff --git a/test/Transforms/InstCombine/merge-icmp.ll b/test/Transforms/InstCombine/merge-icmp.ll index 00020b157e0..b021fe0429a 100644 --- a/test/Transforms/InstCombine/merge-icmp.ll +++ b/test/Transforms/InstCombine/merge-icmp.ll @@ -8,7 +8,7 @@ define i1 @test1(i16* %x) { %cmp2 = icmp eq i16 %and, 17664 %or = and i1 %cmp1, %cmp2 ret i1 %or -; CHECK: @test1 +; CHECK-LABEL: @test1( ; CHECK-NEXT: load i16 ; CHECK-NEXT: icmp eq i16 %load, 17791 ; CHECK-NEXT: ret i1 @@ -22,7 +22,7 @@ define i1 @test2(i16* %x) { %cmp2 = icmp eq i8 %trunc, 69 %or = and i1 %cmp1, %cmp2 ret i1 %or -; CHECK: @test2 +; CHECK-LABEL: @test2( ; CHECK-NEXT: load i16 ; CHECK-NEXT: icmp eq i16 %load, 32581 ; CHECK-NEXT: ret i1 diff --git a/test/Transforms/InstCombine/mul.ll b/test/Transforms/InstCombine/mul.ll index 16213b8628c..94fc1183c55 100644 --- a/test/Transforms/InstCombine/mul.ll +++ b/test/Transforms/InstCombine/mul.ll @@ -2,14 +2,14 @@ ; RUN: opt < %s -instcombine -S | FileCheck %s define i32 @test1(i32 %A) { -; CHECK: @test1 +; CHECK-LABEL: @test1( %B = mul i32 %A, 1 ; [#uses=1] ret i32 %B ; CHECK: ret i32 %A } define i32 @test2(i32 %A) { -; CHECK: @test2 +; CHECK-LABEL: @test2( ; Should convert to an add instruction %B = mul i32 %A, 2 ; [#uses=1] ret i32 %B @@ -17,7 +17,7 @@ define i32 @test2(i32 %A) { } define i32 @test3(i32 %A) { -; CHECK: @test3 +; CHECK-LABEL: @test3( ; This should disappear entirely %B = mul i32 %A, 0 ; [#uses=1] ret i32 %B @@ -25,7 +25,7 @@ define i32 @test3(i32 %A) { } define double @test4(double %A) { -; CHECK: @test4 +; CHECK-LABEL: @test4( ; This is safe for FP %B = fmul double 1.000000e+00, %A ; [#uses=1] ret double %B @@ -33,14 +33,14 @@ define double @test4(double %A) { } define i32 @test5(i32 %A) { -; CHECK: @test5 +; CHECK-LABEL: @test5( %B = mul i32 %A, 8 ; [#uses=1] ret i32 %B ; CHECK: shl i32 %A, 3 } define i8 @test6(i8 %A) { -; CHECK: @test6 +; CHECK-LABEL: @test6( %B = mul i8 %A, 8 ; [#uses=1] %C = mul i8 %B, 8 ; [#uses=1] ret i8 %C @@ -48,28 +48,28 @@ define i8 @test6(i8 %A) { } define i32 @test7(i32 %i) { -; CHECK: @test7 +; CHECK-LABEL: @test7( %tmp = mul i32 %i, -1 ; [#uses=1] ret i32 %tmp ; CHECK: sub i32 0, %i } define i64 @test8(i64 %i) { -; CHECK: @test8 +; CHECK-LABEL: @test8( %j = mul i64 %i, -1 ; [#uses=1] ret i64 %j ; CHECK: sub i64 0, %i } define i32 @test9(i32 %i) { -; CHECK: @test9 +; CHECK-LABEL: @test9( %j = mul i32 %i, -1 ; [#uses=1] ret i32 %j ; CHECK: sub i32 0, %i } define i32 @test10(i32 %a, i32 %b) { -; CHECK: @test10 +; CHECK-LABEL: @test10( %c = icmp slt i32 %a, 0 ; [#uses=1] %d = zext i1 %c to i32 ; [#uses=1] ; e = b & (a >> 31) @@ -81,7 +81,7 @@ define i32 @test10(i32 %a, i32 %b) { } define i32 @test11(i32 %a, i32 %b) { -; CHECK: @test11 +; CHECK-LABEL: @test11( %c = icmp sle i32 %a, -1 ; [#uses=1] %d = zext i1 %c to i32 ; [#uses=1] ; e = b & (a >> 31) @@ -93,7 +93,7 @@ define i32 @test11(i32 %a, i32 %b) { } define i32 @test12(i32 %a, i32 %b) { -; CHECK: @test12 +; CHECK-LABEL: @test12( %c = icmp ugt i32 %a, 2147483647 ; [#uses=1] %d = zext i1 %c to i32 ; [#uses=1] %e = mul i32 %d, %b ; [#uses=1] @@ -106,7 +106,7 @@ define i32 @test12(i32 %a, i32 %b) { ; PR2642 define internal void @test13(<4 x float>*) { -; CHECK: @test13 +; CHECK-LABEL: @test13( load <4 x float>* %0, align 1 fmul <4 x float> %2, < float 1.000000e+00, float 1.000000e+00, float 1.000000e+00, float 1.000000e+00 > store <4 x float> %3, <4 x float>* %0, align 1 @@ -115,7 +115,7 @@ define internal void @test13(<4 x float>*) { } define <16 x i8> @test14(<16 x i8> %a) { -; CHECK: @test14 +; CHECK-LABEL: @test14( %b = mul <16 x i8> %a, zeroinitializer ret <16 x i8> %b ; CHECK-NEXT: ret <16 x i8> zeroinitializer @@ -123,7 +123,7 @@ define <16 x i8> @test14(<16 x i8> %a) { ; rdar://7293527 define i32 @test15(i32 %A, i32 %B) { -; CHECK: @test15 +; CHECK-LABEL: @test15( entry: %shl = shl i32 1, %B %m = mul i32 %shl, %A @@ -133,7 +133,7 @@ entry: ; X * Y (when Y is 0 or 1) --> x & (0-Y) define i32 @test16(i32 %b, i1 %c) { -; CHECK: @test16 +; CHECK-LABEL: @test16( %d = zext i1 %c to i32 ; [#uses=1] ; e = b & (a >> 31) %e = mul i32 %d, %b ; [#uses=1] @@ -144,7 +144,7 @@ define i32 @test16(i32 %b, i1 %c) { ; X * Y (when Y is 0 or 1) --> x & (0-Y) define i32 @test17(i32 %a, i32 %b) { -; CHECK: @test17 +; CHECK-LABEL: @test17( %a.lobit = lshr i32 %a, 31 %e = mul i32 %a.lobit, %b ret i32 %e @@ -154,7 +154,7 @@ define i32 @test17(i32 %a, i32 %b) { } define i32 @test18(i32 %A, i32 %B) { -; CHECK: @test18 +; CHECK-LABEL: @test18( %C = and i32 %A, 1 %D = and i32 %B, 1 @@ -168,7 +168,7 @@ declare {i32, i1} @llvm.smul.with.overflow.i32(i32, i32) declare void @use(i1) define i32 @test19(i32 %A, i32 %B) { -; CHECK: @test19 +; CHECK-LABEL: @test19( %C = and i32 %A, 1 %D = and i32 %B, 1 diff --git a/test/Transforms/InstCombine/no-negzero.ll b/test/Transforms/InstCombine/no-negzero.ll index f295130b0ea..4ed28360344 100644 --- a/test/Transforms/InstCombine/no-negzero.ll +++ b/test/Transforms/InstCombine/no-negzero.ll @@ -4,7 +4,7 @@ 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-darwin9.8" -; CHECK: @mysqrt +; CHECK-LABEL: @mysqrt( ; CHECK-NOT: fadd ; CHECK: ret define double @mysqrt(double %x) nounwind { diff --git a/test/Transforms/InstCombine/nsw.ll b/test/Transforms/InstCombine/nsw.ll index 0140c2f8012..0bed76717ce 100644 --- a/test/Transforms/InstCombine/nsw.ll +++ b/test/Transforms/InstCombine/nsw.ll @@ -1,6 +1,6 @@ ; RUN: opt < %s -instcombine -S | FileCheck %s -; CHECK: @sub1 +; CHECK-LABEL: @sub1( ; CHECK: %y = sub i32 0, %x ; CHECK: %z = sdiv i32 %y, 337 ; CHECK: ret i32 %z @@ -10,7 +10,7 @@ define i32 @sub1(i32 %x) { ret i32 %z } -; CHECK: @sub2 +; CHECK-LABEL: @sub2( ; CHECK: %z = sdiv i32 %x, -337 ; CHECK: ret i32 %z define i32 @sub2(i32 %x) { @@ -19,7 +19,7 @@ define i32 @sub2(i32 %x) { ret i32 %z } -; CHECK: @shl_icmp +; CHECK-LABEL: @shl_icmp( ; CHECK: %B = icmp eq i64 %X, 0 ; CHECK: ret i1 %B define i1 @shl_icmp(i64 %X) nounwind { @@ -28,7 +28,7 @@ define i1 @shl_icmp(i64 %X) nounwind { ret i1 %B } -; CHECK: @shl1 +; CHECK-LABEL: @shl1( ; CHECK: %B = shl nuw nsw i64 %A, 8 ; CHECK: ret i64 %B define i64 @shl1(i64 %X, i64* %P) nounwind { @@ -38,7 +38,7 @@ define i64 @shl1(i64 %X, i64* %P) nounwind { ret i64 %B } -; CHECK: @preserve1 +; CHECK-LABEL: @preserve1( ; CHECK: add nsw i32 %x, 5 define i32 @preserve1(i32 %x) nounwind { %add = add nsw i32 %x, 2 @@ -46,7 +46,7 @@ define i32 @preserve1(i32 %x) nounwind { ret i32 %add3 } -; CHECK: @nopreserve1 +; CHECK-LABEL: @nopreserve1( ; CHECK: add i8 %x, -126 define i8 @nopreserve1(i8 %x) nounwind { %add = add nsw i8 %x, 127 @@ -54,7 +54,7 @@ define i8 @nopreserve1(i8 %x) nounwind { ret i8 %add3 } -; CHECK: @nopreserve2 +; CHECK-LABEL: @nopreserve2( ; CHECK: add i8 %x, 3 define i8 @nopreserve2(i8 %x) nounwind { %add = add i8 %x, 1 @@ -62,7 +62,7 @@ define i8 @nopreserve2(i8 %x) nounwind { ret i8 %add3 } -; CHECK: @nopreserve3 +; CHECK-LABEL: @nopreserve3( ; CHECK: add i8 %A, %B ; CHECK: add i8 define i8 @nopreserve3(i8 %A, i8 %B) nounwind { @@ -72,7 +72,7 @@ define i8 @nopreserve3(i8 %A, i8 %B) nounwind { ret i8 %add } -; CHECK: @nopreserve4 +; CHECK-LABEL: @nopreserve4( ; CHECK: add i8 %A, %B ; CHECK: add i8 define i8 @nopreserve4(i8 %A, i8 %B) nounwind { diff --git a/test/Transforms/InstCombine/objsize-64.ll b/test/Transforms/InstCombine/objsize-64.ll index 530e1234b4a..5046724038a 100644 --- a/test/Transforms/InstCombine/objsize-64.ll +++ b/test/Transforms/InstCombine/objsize-64.ll @@ -7,7 +7,7 @@ declare i32 @__gxx_personality_v0(...) declare void @__cxa_call_unexpected(i8*) declare i64 @llvm.objectsize.i64(i8*, i1) nounwind readonly -; CHECK: @f1 +; CHECK-LABEL: @f1( define i64 @f1(i8 **%esc) { %call = call i8* @malloc(i32 4) store i8* %call, i8** %esc @@ -17,7 +17,7 @@ define i64 @f1(i8 **%esc) { } -; CHECK: @f2 +; CHECK-LABEL: @f2( define i64 @f2(i8** %esc) nounwind uwtable ssp { entry: ; CHECK: invoke noalias i8* @_Znwm(i64 13) diff --git a/test/Transforms/InstCombine/objsize.ll b/test/Transforms/InstCombine/objsize.ll index 122c6501a3f..b5351e9fd0e 100644 --- a/test/Transforms/InstCombine/objsize.ll +++ b/test/Transforms/InstCombine/objsize.ll @@ -7,14 +7,14 @@ target datalayout = "e-p:32:32:32-i1:8:8-i8:8:8-i16:16:16-i32:32:32-i64:32:64-f3 @.str = private constant [8 x i8] c"abcdefg\00" ; <[8 x i8]*> define i32 @foo() nounwind { -; CHECK: @foo +; CHECK-LABEL: @foo( ; CHECK-NEXT: ret i32 60 %1 = call i32 @llvm.objectsize.i32(i8* getelementptr inbounds ([60 x i8]* @a, i32 0, i32 0), i1 false) ret i32 %1 } define i8* @bar() nounwind { -; CHECK: @bar +; CHECK-LABEL: @bar( entry: %retval = alloca i8* %0 = call i32 @llvm.objectsize.i32(i8* getelementptr inbounds ([60 x i8]* @a, i32 0, i32 0), i1 false) @@ -32,7 +32,7 @@ cond.false: } define i32 @f() nounwind { -; CHECK: @f +; CHECK-LABEL: @f( ; CHECK-NEXT: ret i32 0 %1 = call i32 @llvm.objectsize.i32(i8* getelementptr ([60 x i8]* @a, i32 1, i32 0), i1 false) ret i32 %1 @@ -41,7 +41,7 @@ define i32 @f() nounwind { @window = external global [0 x i8] define i1 @baz() nounwind { -; CHECK: @baz +; CHECK-LABEL: @baz( ; CHECK-NEXT: objectsize %1 = tail call i32 @llvm.objectsize.i32(i8* getelementptr inbounds ([0 x i8]* @window, i32 0, i32 0), i1 false) %2 = icmp eq i32 %1, -1 @@ -49,7 +49,7 @@ define i1 @baz() nounwind { } define void @test1(i8* %q, i32 %x) nounwind noinline { -; CHECK: @test1 +; CHECK-LABEL: @test1( ; CHECK: objectsize.i32 entry: %0 = call i32 @llvm.objectsize.i32(i8* getelementptr inbounds ([0 x i8]* @window, i32 0, i32 10), i1 false) ; [#uses=1] @@ -66,7 +66,7 @@ entry: @.str5 = private constant [9 x i32] [i32 97, i32 98, i32 99, i32 100, i32 0, i32 101, i32 102, i32 103, i32 0], align 4 define i32 @test2() nounwind { -; CHECK: @test2 +; CHECK-LABEL: @test2( ; CHECK-NEXT: ret i32 34 %1 = call i32 @llvm.objectsize.i32(i8* getelementptr (i8* bitcast ([9 x i32]* @.str5 to i8*), i32 2), i1 false) ret i32 %1 @@ -82,7 +82,7 @@ declare i32 @llvm.objectsize.i32(i8*, i1) nounwind readonly declare i8* @__inline_memcpy_chk(i8*, i8*, i32) nounwind inlinehint define void @test3() nounwind { -; CHECK: @test3 +; CHECK-LABEL: @test3( entry: br i1 undef, label %bb11, label %bb12 @@ -107,7 +107,7 @@ bb12: %struct.data = type { [100 x i32], [100 x i32], [1024 x i8] } define i32 @test4(i8** %esc) nounwind ssp { -; CHECK: @test4 +; CHECK-LABEL: @test4( entry: %0 = alloca %struct.data, align 8 %1 = bitcast %struct.data* %0 to i8* @@ -123,7 +123,7 @@ entry: @s = external global i8* define i8* @test5(i32 %n) nounwind ssp { -; CHECK: @test5 +; CHECK-LABEL: @test5( entry: %0 = tail call noalias i8* @malloc(i32 20) nounwind %1 = tail call i32 @llvm.objectsize.i32(i8* %0, i1 false) @@ -135,7 +135,7 @@ entry: } define void @test6(i32 %n) nounwind ssp { -; CHECK: @test6 +; CHECK-LABEL: @test6( entry: %0 = tail call noalias i8* @malloc(i32 20) nounwind %1 = tail call i32 @llvm.objectsize.i32(i8* %0, i1 false) @@ -151,7 +151,7 @@ declare i8* @__memset_chk(i8*, i32, i32, i32) nounwind declare noalias i8* @malloc(i32) nounwind define i32 @test7(i8** %esc) { -; CHECK: @test7 +; CHECK-LABEL: @test7( %alloc = call noalias i8* @malloc(i32 48) nounwind store i8* %alloc, i8** %esc %gep = getelementptr inbounds i8* %alloc, i32 16 @@ -163,7 +163,7 @@ define i32 @test7(i8** %esc) { declare noalias i8* @calloc(i32, i32) nounwind define i32 @test8(i8** %esc) { -; CHECK: @test8 +; CHECK-LABEL: @test8( %alloc = call noalias i8* @calloc(i32 5, i32 7) nounwind store i8* %alloc, i8** %esc %gep = getelementptr inbounds i8* %alloc, i32 5 @@ -175,7 +175,7 @@ define i32 @test8(i8** %esc) { declare noalias i8* @strdup(i8* nocapture) nounwind declare noalias i8* @strndup(i8* nocapture, i32) nounwind -; CHECK: @test9 +; CHECK-LABEL: @test9( define i32 @test9(i8** %esc) { %call = tail call i8* @strdup(i8* getelementptr inbounds ([8 x i8]* @.str, i64 0, i64 0)) nounwind store i8* %call, i8** %esc, align 8 @@ -184,7 +184,7 @@ define i32 @test9(i8** %esc) { ret i32 %1 } -; CHECK: @test10 +; CHECK-LABEL: @test10( define i32 @test10(i8** %esc) { %call = tail call i8* @strndup(i8* getelementptr inbounds ([8 x i8]* @.str, i64 0, i64 0), i32 3) nounwind store i8* %call, i8** %esc, align 8 @@ -193,7 +193,7 @@ define i32 @test10(i8** %esc) { ret i32 %1 } -; CHECK: @test11 +; CHECK-LABEL: @test11( define i32 @test11(i8** %esc) { %call = tail call i8* @strndup(i8* getelementptr inbounds ([8 x i8]* @.str, i64 0, i64 0), i32 7) nounwind store i8* %call, i8** %esc, align 8 @@ -202,7 +202,7 @@ define i32 @test11(i8** %esc) { ret i32 %1 } -; CHECK: @test12 +; CHECK-LABEL: @test12( define i32 @test12(i8** %esc) { %call = tail call i8* @strndup(i8* getelementptr inbounds ([8 x i8]* @.str, i64 0, i64 0), i32 8) nounwind store i8* %call, i8** %esc, align 8 @@ -211,7 +211,7 @@ define i32 @test12(i8** %esc) { ret i32 %1 } -; CHECK: @test13 +; CHECK-LABEL: @test13( define i32 @test13(i8** %esc) { %call = tail call i8* @strndup(i8* getelementptr inbounds ([8 x i8]* @.str, i64 0, i64 0), i32 57) nounwind store i8* %call, i8** %esc, align 8 @@ -220,7 +220,7 @@ define i32 @test13(i8** %esc) { ret i32 %1 } -; CHECK: @PR13390 +; CHECK-LABEL: @PR13390( define i32 @PR13390(i1 %bool, i8* %a) { entry: %cond = or i1 %bool, true @@ -239,7 +239,7 @@ return: ret i32 42 } -; CHECK: @PR13621 +; CHECK-LABEL: @PR13621( define i32 @PR13621(i1 %bool) nounwind { entry: %cond = or i1 %bool, true @@ -259,7 +259,7 @@ return: @globalalias = alias internal [60 x i8]* @a -; CHECK: @test18 +; CHECK-LABEL: @test18( ; CHECK-NEXT: ret i32 60 define i32 @test18() { %bc = bitcast [60 x i8]* @globalalias to i8* @@ -269,7 +269,7 @@ define i32 @test18() { @globalalias2 = alias weak [60 x i8]* @a -; CHECK: @test19 +; CHECK-LABEL: @test19( ; CHECK: llvm.objectsize define i32 @test19() { %bc = bitcast [60 x i8]* @globalalias2 to i8* diff --git a/test/Transforms/InstCombine/or-fcmp.ll b/test/Transforms/InstCombine/or-fcmp.ll index 09a3c994d93..29963f6c5c2 100644 --- a/test/Transforms/InstCombine/or-fcmp.ll +++ b/test/Transforms/InstCombine/or-fcmp.ll @@ -1,6 +1,6 @@ ; RUN: opt < %s -instcombine -S | FileCheck %s -; CHECK: @t1 +; CHECK-LABEL: @t1( define zeroext i8 @t1(float %x, float %y) nounwind { %a = fcmp ueq float %x, %y ; [#uses=1] %b = fcmp uno float %x, %y ; [#uses=1] @@ -11,7 +11,7 @@ define zeroext i8 @t1(float %x, float %y) nounwind { ret i8 %retval } -; CHECK: @t2 +; CHECK-LABEL: @t2( define zeroext i8 @t2(float %x, float %y) nounwind { %a = fcmp olt float %x, %y ; [#uses=1] %b = fcmp oeq float %x, %y ; [#uses=1] @@ -23,7 +23,7 @@ define zeroext i8 @t2(float %x, float %y) nounwind { ret i8 %retval } -; CHECK: @t3 +; CHECK-LABEL: @t3( define zeroext i8 @t3(float %x, float %y) nounwind { %a = fcmp ult float %x, %y ; [#uses=1] %b = fcmp uge float %x, %y ; [#uses=1] @@ -33,7 +33,7 @@ define zeroext i8 @t3(float %x, float %y) nounwind { ret i8 %retval } -; CHECK: @t4 +; CHECK-LABEL: @t4( define zeroext i8 @t4(float %x, float %y) nounwind { %a = fcmp ult float %x, %y ; [#uses=1] %b = fcmp ugt float %x, %y ; [#uses=1] @@ -45,7 +45,7 @@ define zeroext i8 @t4(float %x, float %y) nounwind { ret i8 %retval } -; CHECK: @t5 +; CHECK-LABEL: @t5( define zeroext i8 @t5(float %x, float %y) nounwind { %a = fcmp olt float %x, %y ; [#uses=1] %b = fcmp oge float %x, %y ; [#uses=1] diff --git a/test/Transforms/InstCombine/or-xor.ll b/test/Transforms/InstCombine/or-xor.ll index f496dd48c40..cec36f119a9 100644 --- a/test/Transforms/InstCombine/or-xor.ll +++ b/test/Transforms/InstCombine/or-xor.ll @@ -5,7 +5,7 @@ define i32 @test1(i32 %x, i32 %y) nounwind { %not = xor i32 %or, -1 %z = or i32 %x, %not ret i32 %z -; CHECK: @test1 +; CHECK-LABEL: @test1( ; CHECK-NEXT: %y.not = xor i32 %y, -1 ; CHECK-NEXT: %z = or i32 %y.not, %x ; CHECK-NEXT: ret i32 %z @@ -16,7 +16,7 @@ define i32 @test2(i32 %x, i32 %y) nounwind { %not = xor i32 %or, -1 %z = or i32 %y, %not ret i32 %z -; CHECK: @test2 +; CHECK-LABEL: @test2( ; CHECK-NEXT: %x.not = xor i32 %x, -1 ; CHECK-NEXT: %z = or i32 %x.not, %y ; CHECK-NEXT: ret i32 %z @@ -27,7 +27,7 @@ define i32 @test3(i32 %x, i32 %y) nounwind { %not = xor i32 %xor, -1 %z = or i32 %x, %not ret i32 %z -; CHECK: @test3 +; CHECK-LABEL: @test3( ; CHECK-NEXT: %y.not = xor i32 %y, -1 ; CHECK-NEXT: %z = or i32 %y.not, %x ; CHECK-NEXT: ret i32 %z @@ -38,7 +38,7 @@ define i32 @test4(i32 %x, i32 %y) nounwind { %not = xor i32 %xor, -1 %z = or i32 %y, %not ret i32 %z -; CHECK: @test4 +; CHECK-LABEL: @test4( ; CHECK-NEXT: %x.not = xor i32 %x, -1 ; CHECK-NEXT: %z = or i32 %x.not, %y ; CHECK-NEXT: ret i32 %z @@ -49,7 +49,7 @@ define i32 @test5(i32 %x, i32 %y) nounwind { %not = xor i32 %and, -1 %z = or i32 %x, %not ret i32 %z -; CHECK: @test5 +; CHECK-LABEL: @test5( ; CHECK-NEXT: ret i32 -1 } @@ -58,7 +58,7 @@ define i32 @test6(i32 %x, i32 %y) nounwind { %not = xor i32 %and, -1 %z = or i32 %y, %not ret i32 %z -; CHECK: @test6 +; CHECK-LABEL: @test6( ; CHECK-NEXT: ret i32 -1 } @@ -66,7 +66,7 @@ define i32 @test7(i32 %x, i32 %y) nounwind { %xor = xor i32 %x, %y %z = or i32 %y, %xor ret i32 %z -; CHECK: @test7 +; CHECK-LABEL: @test7( ; CHECK-NEXT: %z = or i32 %x, %y ; CHECK-NEXT: ret i32 %z } @@ -76,7 +76,7 @@ define i32 @test8(i32 %x, i32 %y) nounwind { %xor = xor i32 %x, %not %z = or i32 %y, %xor ret i32 %z -; CHECK: @test8 +; CHECK-LABEL: @test8( ; CHECK-NEXT: %x.not = xor i32 %x, -1 ; CHECK-NEXT: %z = or i32 %x.not, %y ; CHECK-NEXT: ret i32 %z @@ -87,7 +87,7 @@ define i32 @test9(i32 %x, i32 %y) nounwind { %xor = xor i32 %not, %y %z = or i32 %x, %xor ret i32 %z -; CHECK: @test9 +; CHECK-LABEL: @test9( ; CHECK-NEXT: %y.not = xor i32 %y, -1 ; CHECK-NEXT: %z = or i32 %y.not, %x ; CHECK-NEXT: ret i32 %z diff --git a/test/Transforms/InstCombine/or.ll b/test/Transforms/InstCombine/or.ll index 7226bd93996..1cd897ee90c 100644 --- a/test/Transforms/InstCombine/or.ll +++ b/test/Transforms/InstCombine/or.ll @@ -6,49 +6,49 @@ target datalayout = "e-p:32:32:32-i1:8:8-i8:8:8-i16:16:16-i32:32:32-i64:32:64-f3 define i32 @test1(i32 %A) { %B = or i32 %A, 0 ret i32 %B -; CHECK: @test1 +; CHECK-LABEL: @test1( ; CHECK: ret i32 %A } define i32 @test2(i32 %A) { %B = or i32 %A, -1 ret i32 %B -; CHECK: @test2 +; CHECK-LABEL: @test2( ; CHECK: ret i32 -1 } define i8 @test2a(i8 %A) { %B = or i8 %A, -1 ret i8 %B -; CHECK: @test2a +; CHECK-LABEL: @test2a( ; CHECK: ret i8 -1 } define i1 @test3(i1 %A) { %B = or i1 %A, false ret i1 %B -; CHECK: @test3 +; CHECK-LABEL: @test3( ; CHECK: ret i1 %A } define i1 @test4(i1 %A) { %B = or i1 %A, true ret i1 %B -; CHECK: @test4 +; CHECK-LABEL: @test4( ; CHECK: ret i1 true } define i1 @test5(i1 %A) { %B = or i1 %A, %A ret i1 %B -; CHECK: @test5 +; CHECK-LABEL: @test5( ; CHECK: ret i1 %A } define i32 @test6(i32 %A) { %B = or i32 %A, %A ret i32 %B -; CHECK: @test6 +; CHECK-LABEL: @test6( ; CHECK: ret i32 %A } @@ -57,7 +57,7 @@ define i32 @test7(i32 %A) { %NotA = xor i32 -1, %A %B = or i32 %A, %NotA ret i32 %B -; CHECK: @test7 +; CHECK-LABEL: @test7( ; CHECK: ret i32 -1 } @@ -65,7 +65,7 @@ define i8 @test8(i8 %A) { %B = or i8 %A, -2 %C = or i8 %B, 1 ret i8 %C -; CHECK: @test8 +; CHECK-LABEL: @test8( ; CHECK: ret i8 -1 } @@ -75,7 +75,7 @@ define i8 @test9(i8 %A, i8 %B) { %D = or i8 %B, -2 %E = or i8 %C, %D ret i8 %E -; CHECK: @test9 +; CHECK-LABEL: @test9( ; CHECK: ret i8 -1 } @@ -85,7 +85,7 @@ define i8 @test10(i8 %A) { ; (X & C1) | C2 --> (X | C2) & (C1|C2) %D = or i8 %C, -2 ret i8 %D -; CHECK: @test10 +; CHECK-LABEL: @test10( ; CHECK: ret i8 -2 } @@ -96,7 +96,7 @@ define i8 @test11(i8 %A) { %D = or i8 %C, 1 %E = xor i8 %D, 12 ret i8 %E -; CHECK: @test11 +; CHECK-LABEL: @test11( ; CHECK: ret i8 -1 } @@ -105,7 +105,7 @@ define i32 @test12(i32 %A) { %B = or i32 %A, 4 %C = and i32 %B, 8 ret i32 %C -; CHECK: @test12 +; CHECK-LABEL: @test12( ; CHECK: %C = and i32 %A, 8 ; CHECK: ret i32 %C } @@ -115,7 +115,7 @@ define i32 @test13(i32 %A) { ; Always equal to 8 %C = and i32 %B, 8 ret i32 %C -; CHECK: @test13 +; CHECK-LABEL: @test13( ; CHECK: ret i32 8 } @@ -125,7 +125,7 @@ define i1 @test14(i32 %A, i32 %B) { ; (A < B) | (A > B) === A != B %D = or i1 %C1, %C2 ret i1 %D -; CHECK: @test14 +; CHECK-LABEL: @test14( ; CHECK: icmp ne i32 %A, %B ; CHECK: ret i1 } @@ -136,7 +136,7 @@ define i1 @test15(i32 %A, i32 %B) { ; (A < B) | (A == B) === A <= B %D = or i1 %C1, %C2 ret i1 %D -; CHECK: @test15 +; CHECK-LABEL: @test15( ; CHECK: icmp ule i32 %A, %B ; CHECK: ret i1 } @@ -148,7 +148,7 @@ define i32 @test16(i32 %A) { ; %D = and int %B, -1 == %B %D = or i32 %B, %C ret i32 %D -; CHECK: @test16 +; CHECK-LABEL: @test16( ; CHECK: ret i32 %A } @@ -158,7 +158,7 @@ define i32 @test17(i32 %A) { ; %D = and int %B, 5 %D = or i32 %B, %C ret i32 %D -; CHECK: @test17 +; CHECK-LABEL: @test17( ; CHECK: %D = and i32 %A, 5 ; CHECK: ret i32 %D } @@ -169,7 +169,7 @@ define i1 @test18(i32 %A) { ;; (A-50) >u 50 %D = or i1 %B, %C ret i1 %D -; CHECK: @test18 +; CHECK-LABEL: @test18( ; CHECK: add i32 ; CHECK: icmp ugt ; CHECK: ret i1 @@ -181,7 +181,7 @@ define i1 @test19(i32 %A) { ;; (A&-2) == 50 %D = or i1 %B, %C ret i1 %D -; CHECK: @test19 +; CHECK-LABEL: @test19( ; CHECK: and i32 ; CHECK: icmp eq ; CHECK: ret i1 @@ -191,7 +191,7 @@ define i32 @test20(i32 %x) { %y = and i32 %x, 123 %z = or i32 %y, %x ret i32 %z -; CHECK: @test20 +; CHECK-LABEL: @test20( ; CHECK: ret i32 %x } @@ -202,7 +202,7 @@ define i32 @test21(i32 %tmp.1) { ;; add tmp.1, 2 %tmp.6 = or i32 %tmp.5, %tmp.3 ret i32 %tmp.6 -; CHECK: @test21 +; CHECK-LABEL: @test21( ; CHECK: add i32 %{{[^,]*}}, 2 ; CHECK: ret i32 } @@ -212,7 +212,7 @@ define i32 @test22(i32 %B) { %ELIM7 = and i32 %B, -2 %ELIM5 = or i32 %ELIM41, %ELIM7 ret i32 %ELIM5 -; CHECK: @test22 +; CHECK-LABEL: @test22( ; CHECK: ret i32 %B } @@ -222,7 +222,7 @@ define i16 @test23(i16 %A) { %C = or i16 %B, -32768 %D = xor i16 %C, 8193 ret i16 %D -; CHECK: @test23 +; CHECK-LABEL: @test23( ; CHECK: %B = lshr i16 %A, 1 ; CHECK: %D = xor i16 %B, -24575 ; CHECK: ret i16 %D @@ -235,7 +235,7 @@ define i1 @test24(double %X, double %Y) { %bothcond = or i1 %tmp13, %tmp9 ; [#uses=1] ret i1 %bothcond -; CHECK: @test24 +; CHECK-LABEL: @test24( ; CHECK: = fcmp uno double %Y, %X ; CHECK: ret i1 } @@ -248,7 +248,7 @@ define i1 @test25(i32 %A, i32 %B) { %F = xor i1 %E, -1 ret i1 %F -; CHECK: @test25 +; CHECK-LABEL: @test25( ; CHECK: icmp ne i32 %A, 0 ; CHECK-NEXT: icmp ne i32 %B, 57 ; CHECK-NEXT: %F = and i1 @@ -262,7 +262,7 @@ define i1 @test26(i32 %A, i32 %B) { ; (A == 0) & (A == 0) --> (A|B) == 0 %D = and i1 %C1, %C2 ret i1 %D -; CHECK: @test26 +; CHECK-LABEL: @test26( ; CHECK: or i32 %A, %B ; CHECK: icmp eq i32 {{.*}}, 0 ; CHECK: ret i1 @@ -274,7 +274,7 @@ define i1 @test27(i32* %A, i32* %B) { %D = or i32 %C1, %C2 %E = icmp eq i32 %D, 0 ret i1 %E -; CHECK: @test27 +; CHECK-LABEL: @test27( ; CHECK: icmp eq i32* %A, null ; CHECK: icmp eq i32* %B, null ; CHECK: and i1 @@ -288,7 +288,7 @@ define i1 @test28(i32 %A, i32 %B) { ; (A != 0) | (A != 0) --> (A|B) != 0 %D = or i1 %C1, %C2 ret i1 %D -; CHECK: @test28 +; CHECK-LABEL: @test28( ; CHECK: or i32 %A, %B ; CHECK: icmp ne i32 {{.*}}, 0 ; CHECK: ret i1 @@ -300,7 +300,7 @@ define i1 @test29(i32* %A, i32* %B) { %D = or i32 %C1, %C2 %E = icmp ne i32 %D, 0 ret i1 %E -; CHECK: @test29 +; CHECK-LABEL: @test29( ; CHECK: icmp ne i32* %A, null ; CHECK: icmp ne i32* %B, null ; CHECK: or i1 @@ -315,7 +315,7 @@ entry: %D = and i32 %B, 40186 %E = or i32 %D, %C ret i32 %E -; CHECK: @test30 +; CHECK-LABEL: @test30( ; CHECK: %D = and i32 %A, -58312 ; CHECK: %E = or i32 %D, 32962 ; CHECK: ret i32 %E @@ -331,7 +331,7 @@ define i64 @test31(i64 %A) nounwind readnone ssp noredzone { %F = or i64 %D, %E ret i64 %F -; CHECK: @test31 +; CHECK-LABEL: @test31( ; CHECK-NEXT: %E = and i64 %A, 4294908984 ; CHECK-NEXT: %F = or i64 %E, 32962 ; CHECK-NEXT: ret i64 %F @@ -345,7 +345,7 @@ define <4 x i32> @test32(<4 x i1> %and.i1352, <4 x i32> %vecinit6.i176, <4 x i32 %or.i = or <4 x i32> %and.i, %and.i129 ; <<4 x i32>> [#uses=1] ret <4 x i32> %or.i ; codegen is mature enough to handle vector selects. -; CHECK: @test32 +; CHECK-LABEL: @test32( ; CHECK: select <4 x i1> %and.i1352, <4 x i32> %vecinit6.i176, <4 x i32> %vecinit6.i191 } @@ -353,7 +353,7 @@ define i1 @test33(i1 %X, i1 %Y) { %a = or i1 %X, %Y %b = or i1 %a, %X ret i1 %b -; CHECK: @test33 +; CHECK-LABEL: @test33( ; CHECK-NEXT: or i1 %X, %Y ; CHECK-NEXT: ret } @@ -362,7 +362,7 @@ define i32 @test34(i32 %X, i32 %Y) { %a = or i32 %X, %Y %b = or i32 %Y, %a ret i32 %b -; CHECK: @test34 +; CHECK-LABEL: @test34( ; CHECK-NEXT: or i32 %X, %Y ; CHECK-NEXT: ret } @@ -371,7 +371,7 @@ define i32 @test35(i32 %a, i32 %b) { %1 = or i32 %a, 1135 %2 = or i32 %1, %b ret i32 %2 - ; CHECK: @test35 + ; CHECK-LABEL: @test35( ; CHECK-NEXT: or i32 %a, %b ; CHECK-NEXT: or i32 %1, 1135 } @@ -383,14 +383,14 @@ define i1 @test36(i32 %x) { %cmp3 = icmp eq i32 %x, 25 %ret2 = or i1 %ret1, %cmp3 ret i1 %ret2 -; CHECK: @test36 +; CHECK-LABEL: @test36( ; CHECK-NEXT: %x.off = add i32 %x, -23 ; CHECK-NEXT: icmp ult i32 %x.off, 3 ; CHECK-NEXT: ret i1 } define i32 @test37(i32* %xp, i32 %y) { -; CHECK: @test37 +; CHECK-LABEL: @test37( ; CHECK: select i1 %tobool, i32 -1, i32 %x %tobool = icmp ne i32 %y, 0 %sext = sext i1 %tobool to i32 @@ -400,7 +400,7 @@ define i32 @test37(i32* %xp, i32 %y) { } define i32 @test38(i32* %xp, i32 %y) { -; CHECK: @test38 +; CHECK-LABEL: @test38( ; CHECK: select i1 %tobool, i32 -1, i32 %x %tobool = icmp ne i32 %y, 0 %sext = sext i1 %tobool to i32 diff --git a/test/Transforms/InstCombine/overflow.ll b/test/Transforms/InstCombine/overflow.ll index 81ceef8c41c..3eddc80a704 100644 --- a/test/Transforms/InstCombine/overflow.ll +++ b/test/Transforms/InstCombine/overflow.ll @@ -3,7 +3,7 @@ declare void @throwAnExceptionOrWhatever() -; CHECK: @test1 +; CHECK-LABEL: @test1( define i32 @test1(i32 %a, i32 %b) nounwind ssp { entry: ; CHECK-NOT: sext @@ -26,7 +26,7 @@ if.end: ret i32 %conv9 } -; CHECK: @test2 +; CHECK-LABEL: @test2( ; This form should not be promoted for two reasons: 1) it is unprofitable to ; promote it since the add.off instruction has another use, and 2) it is unsafe ; because the add-with-off makes the high bits of the original add live. @@ -76,7 +76,7 @@ if.end: ; CHECK: ret i64 } -; CHECK: @test4 +; CHECK-LABEL: @test4( ; Should be able to form an i8 sadd computed in an i32. define zeroext i8 @test4(i8 signext %a, i8 signext %b) nounwind ssp { entry: @@ -97,7 +97,7 @@ if.end: ; preds = %entry ; CHECK: ret i8 } -; CHECK: @test5 +; CHECK-LABEL: @test5( ; CHECK: llvm.uadd.with.overflow ; CHECK: ret i64 define i64 @test5(i64 %a, i64 %b) nounwind ssp { @@ -108,7 +108,7 @@ entry: ret i64 %Q } -; CHECK: @test6 +; CHECK-LABEL: @test6( ; CHECK: llvm.uadd.with.overflow ; CHECK: ret i64 define i64 @test6(i64 %a, i64 %b) nounwind ssp { @@ -119,7 +119,7 @@ entry: ret i64 %Q } -; CHECK: @test7 +; CHECK-LABEL: @test7( ; CHECK: llvm.uadd.with.overflow ; CHECK: ret i64 define i64 @test7(i64 %a, i64 %b) nounwind ssp { @@ -130,7 +130,7 @@ entry: ret i64 %Q } -; CHECK: @test8 +; CHECK-LABEL: @test8( ; PR11438 ; This is @test1, but the operands are not sign-extended. Make sure ; we don't transform this case. diff --git a/test/Transforms/InstCombine/phi.ll b/test/Transforms/InstCombine/phi.ll index 1c307d430f3..6e314651383 100644 --- a/test/Transforms/InstCombine/phi.ll +++ b/test/Transforms/InstCombine/phi.ll @@ -15,7 +15,7 @@ BB1: BB2: ret i32 %A -; CHECK: @test1 +; CHECK-LABEL: @test1( ; CHECK: BB1: ; CHECK-NEXT: ret i32 %A } @@ -31,7 +31,7 @@ BB2: ; Combine away PHI nodes with same values %B = phi i32 [ %A, %BB0 ], [ %A, %BB1 ] ret i32 %B -; CHECK: @test2 +; CHECK-LABEL: @test2( ; CHECK: BB2: ; CHECK-NEXT: ret i32 %A } @@ -47,7 +47,7 @@ Loop: Exit: ret i32 %B -; CHECK: @test3 +; CHECK-LABEL: @test3( ; CHECK: Exit: ; CHECK-NEXT: ret i32 %A } @@ -64,7 +64,7 @@ Loop: ; preds = %L2, %Loop L2: ; preds = %Loop br label %Loop -; CHECK: @test4 +; CHECK-LABEL: @test4( ; CHECK: Loop: ; CHECK-NEXT: br i1 %b } @@ -80,7 +80,7 @@ Loop: ; preds = %Loop, %BB0 Exit: ; preds = %Loop ret i32 %B -; CHECK: @test5 +; CHECK-LABEL: @test5( ; CHECK: Loop: ; CHECK-NEXT: br i1 %b ; CHECK: Exit: @@ -100,7 +100,7 @@ BB2: ;; Suck casts into phi %B = phi i32 [ %X, %BB0 ], [ %Y, %BB1 ] ret i32 %B -; CHECK: @test6 +; CHECK-LABEL: @test6( ; CHECK: BB2: ; CHECK: zext i16 %A to i32 ; CHECK-NEXT: ret i32 @@ -118,7 +118,7 @@ Loop: ; preds = %Loop, %BB0 Exit: ; preds = %Loop ret i32 0 -; CHECK: @test7 +; CHECK-LABEL: @test7( ; CHECK: Loop: ; CHECK-NEXT: br i1 %b } @@ -136,7 +136,7 @@ BB2: ;; Suck GEPs into phi %B = phi i32* [ %X, %BB0 ], [ %Y, %BB1 ] ret i32* %B -; CHECK: @test8 +; CHECK-LABEL: @test8( ; CHECK-NOT: phi ; CHECK: BB2: ; CHECK-NEXT: %B = getelementptr { i32, i32 }* %A @@ -159,7 +159,7 @@ bb1: bb2: %E = phi i32 [ %C, %bb ], [ %D, %bb1 ] ret i32 %E -; CHECK: @test9 +; CHECK-LABEL: @test9( ; CHECK: bb2: ; CHECK-NEXT: phi i32* [ %B, %bb ], [ %A, %bb1 ] ; CHECK-NEXT: %E = load i32* %{{[^,]*}}, align 1 @@ -183,7 +183,7 @@ bb1: bb2: %E = phi i32 [ %C, %bb ], [ %D, %bb1 ] ret i32 %E -; CHECK: @test10 +; CHECK-LABEL: @test10( ; CHECK: bb2: ; CHECK-NEXT: phi i32* [ %B, %bb ], [ %A, %bb1 ] ; CHECK-NEXT: %E = load i32* %{{[^,]*}}, align 16 @@ -219,7 +219,7 @@ end: store i32 10, i32* %g %z = call i1 @test11a() ret i1 %z -; CHECK: @test11 +; CHECK-LABEL: @test11( ; CHECK-NOT: phi i32 ; CHECK: ret i1 %z } @@ -245,7 +245,7 @@ end: %tmp2 = add i64 %tmp32, %tmp30 ret i64 %tmp2 -; CHECK: @test12 +; CHECK-LABEL: @test12( ; CHECK-NOT: zext ; CHECK: end: ; CHECK-NEXT: phi i64 [ 0, %entry ], [ %Val, %two ] @@ -276,7 +276,7 @@ end: call void @test13f(double %tmp31, i32 %tmp32) ret void -; CHECK: @test13 +; CHECK-LABEL: @test13( ; CHECK-NOT: zext ; CHECK: end: ; CHECK-NEXT: phi double [ 0.000000e+00, %entry ], [ %Vald, %two ] @@ -296,7 +296,7 @@ Loop: Exit: ; preds = %Loop ret i640 %C -; CHECK: @test14a +; CHECK-LABEL: @test14a( ; CHECK: Loop: ; CHECK-NEXT: phi i320 } @@ -313,7 +313,7 @@ Loop: Exit: ; preds = %Loop ret i160 %C -; CHECK: @test14b +; CHECK-LABEL: @test14b( ; CHECK: Loop: ; CHECK-NEXT: phi i160 } @@ -321,7 +321,7 @@ Exit: ; preds = %Loop declare i64 @test15a(i64) define i64 @test15b(i64 %A, i1 %b) { -; CHECK: @test15b +; CHECK-LABEL: @test15b( entry: %i0 = zext i64 %A to i128 %i1 = shl i128 %i0, 64 @@ -405,7 +405,7 @@ if.else: ; preds = %entry ; PR4413 declare i32 @ext() -; CHECK: @test17 +; CHECK-LABEL: @test17( define i32 @test17(i1 %a) { entry: br i1 %a, label %bb1, label %bb2 @@ -435,7 +435,7 @@ ret: %ptr = phi i32* [ %zero, %true ] , [ %one, %false ] %isnull = icmp eq i32* %ptr, null ret i1 %isnull -; CHECK: @test18 +; CHECK-LABEL: @test18( ; CHECK: ret i1 false } @@ -449,7 +449,7 @@ ret: %p = phi double [ %x, %true ], [ 0x7FF0000000000000, %false ]; RHS = +infty %cmp = fcmp ule double %x, %p ret i1 %cmp -; CHECK: @test19 +; CHECK-LABEL: @test19( ; CHECK: ret i1 true } @@ -466,7 +466,7 @@ ret: %p = phi i32* [ %a, %true ], [ %b, %false ] %r = icmp eq i32* %p, %c ret i1 %r -; CHECK: @test20 +; CHECK-LABEL: @test20( ; CHECK: ret i1 false } @@ -485,12 +485,12 @@ loop: br i1 %c2, label %ret, label %loop ret: ret i1 %r -; CHECK: @test21 +; CHECK-LABEL: @test21( ; CHECK: ret i1 false } define void @test22() { -; CHECK: @test22 +; CHECK-LABEL: @test22( entry: br label %loop loop: @@ -518,7 +518,7 @@ Loop: ; preds = %Loop, %BB0 Exit: ; preds = %Loop %E = add i32 %B, 19 ret i32 %E -; CHECK: @test23 +; CHECK-LABEL: @test23( ; CHECK: %phitmp = add i32 %A, 19 ; CHECK: Loop: ; CHECK-NEXT: %B = phi i32 [ %phitmp, %BB0 ], [ 61, %Loop ] @@ -538,7 +538,7 @@ BB1: BB2: %C = phi i32 [ %X, %BB0 ], [ %Y, %BB1 ] ret i32 %C -; CHECK: @test24 +; CHECK-LABEL: @test24( ; CHECK-NOT: phi ; CHECK: BB2: ; CHECK-NEXT: %C = add nuw i32 %A, 1 @@ -573,7 +573,7 @@ end: store i32 10, i32* %g %z = call i1 @test25a() ret i1 %z -; CHECK: @test25 +; CHECK-LABEL: @test25( ; CHECK-NOT: phi i32 ; CHECK: ret i1 %z } @@ -616,12 +616,12 @@ end: store i32 10, i32* %g %z = call i1 @test26a() ret i1 %z -; CHECK: @test26 +; CHECK-LABEL: @test26( ; CHECK-NOT: phi i32 ; CHECK: ret i1 %z } -; CHECK: @test27( +; CHECK-LABEL: @test27( ; CHECK: ret i32 undef define i32 @test27(i1 %b) { entry: diff --git a/test/Transforms/InstCombine/pow-1.ll b/test/Transforms/InstCombine/pow-1.ll index 8a311f0b74c..0fdafebcd4a 100644 --- a/test/Transforms/InstCombine/pow-1.ll +++ b/test/Transforms/InstCombine/pow-1.ll @@ -12,14 +12,14 @@ declare double @pow(double, double) nounwind readonly ; Check pow(1.0, x) -> 1.0. define float @test_simplify1(float %x) { -; CHECK: @test_simplify1 +; CHECK-LABEL: @test_simplify1( %retval = call float @powf(float 1.0, float %x) ret float %retval ; CHECK-NEXT: ret float 1.000000e+00 } define double @test_simplify2(double %x) { -; CHECK: @test_simplify2 +; CHECK-LABEL: @test_simplify2( %retval = call double @pow(double 1.0, double %x) ret double %retval ; CHECK-NEXT: ret double 1.000000e+00 @@ -28,7 +28,7 @@ define double @test_simplify2(double %x) { ; Check pow(2.0, x) -> exp2(x). define float @test_simplify3(float %x) { -; CHECK: @test_simplify3 +; CHECK-LABEL: @test_simplify3( %retval = call float @powf(float 2.0, float %x) ; CHECK-NEXT: [[EXP2F:%[a-z0-9]+]] = call float @exp2f(float %x) [[NUW_RO:#[0-9]+]] ret float %retval @@ -36,7 +36,7 @@ define float @test_simplify3(float %x) { } define double @test_simplify4(double %x) { -; CHECK: @test_simplify4 +; CHECK-LABEL: @test_simplify4( %retval = call double @pow(double 2.0, double %x) ; CHECK-NEXT: [[EXP2:%[a-z0-9]+]] = call double @exp2(double %x) [[NUW_RO]] ret double %retval @@ -46,14 +46,14 @@ define double @test_simplify4(double %x) { ; Check pow(x, 0.0) -> 1.0. define float @test_simplify5(float %x) { -; CHECK: @test_simplify5 +; CHECK-LABEL: @test_simplify5( %retval = call float @powf(float %x, float 0.0) ret float %retval ; CHECK-NEXT: ret float 1.000000e+00 } define double @test_simplify6(double %x) { -; CHECK: @test_simplify6 +; CHECK-LABEL: @test_simplify6( %retval = call double @pow(double %x, double 0.0) ret double %retval ; CHECK-NEXT: ret double 1.000000e+00 @@ -62,7 +62,7 @@ define double @test_simplify6(double %x) { ; Check pow(x, 0.5) -> fabs(sqrt(x)), where x != -infinity. define float @test_simplify7(float %x) { -; CHECK: @test_simplify7 +; CHECK-LABEL: @test_simplify7( %retval = call float @powf(float %x, float 0.5) ; CHECK-NEXT: [[SQRTF:%[a-z0-9]+]] = call float @sqrtf(float %x) [[NUW_RO]] ; CHECK-NEXT: [[FABSF:%[a-z0-9]+]] = call float @fabsf(float [[SQRTF]]) [[NUW_RO]] @@ -73,7 +73,7 @@ define float @test_simplify7(float %x) { } define double @test_simplify8(double %x) { -; CHECK: @test_simplify8 +; CHECK-LABEL: @test_simplify8( %retval = call double @pow(double %x, double 0.5) ; CHECK-NEXT: [[SQRT:%[a-z0-9]+]] = call double @sqrt(double %x) [[NUW_RO]] ; CHECK-NEXT: [[FABS:%[a-z0-9]+]] = call double @fabs(double [[SQRT]]) [[NUW_RO]] @@ -86,14 +86,14 @@ define double @test_simplify8(double %x) { ; Check pow(-infinity, 0.5) -> +infinity. define float @test_simplify9(float %x) { -; CHECK: @test_simplify9 +; CHECK-LABEL: @test_simplify9( %retval = call float @powf(float 0xFFF0000000000000, float 0.5) ret float %retval ; CHECK-NEXT: ret float 0x7FF0000000000000 } define double @test_simplify10(double %x) { -; CHECK: @test_simplify10 +; CHECK-LABEL: @test_simplify10( %retval = call double @pow(double 0xFFF0000000000000, double 0.5) ret double %retval ; CHECK-NEXT: ret double 0x7FF0000000000000 @@ -102,14 +102,14 @@ define double @test_simplify10(double %x) { ; Check pow(x, 1.0) -> x. define float @test_simplify11(float %x) { -; CHECK: @test_simplify11 +; CHECK-LABEL: @test_simplify11( %retval = call float @powf(float %x, float 1.0) ret float %retval ; CHECK-NEXT: ret float %x } define double @test_simplify12(double %x) { -; CHECK: @test_simplify12 +; CHECK-LABEL: @test_simplify12( %retval = call double @pow(double %x, double 1.0) ret double %retval ; CHECK-NEXT: ret double %x @@ -118,7 +118,7 @@ define double @test_simplify12(double %x) { ; Check pow(x, 2.0) -> x*x. define float @test_simplify13(float %x) { -; CHECK: @test_simplify13 +; CHECK-LABEL: @test_simplify13( %retval = call float @powf(float %x, float 2.0) ; CHECK-NEXT: [[SQUARE:%[a-z0-9]+]] = fmul float %x, %x ret float %retval @@ -126,7 +126,7 @@ define float @test_simplify13(float %x) { } define double @test_simplify14(double %x) { -; CHECK: @test_simplify14 +; CHECK-LABEL: @test_simplify14( %retval = call double @pow(double %x, double 2.0) ; CHECK-NEXT: [[SQUARE:%[a-z0-9]+]] = fmul double %x, %x ret double %retval @@ -136,7 +136,7 @@ define double @test_simplify14(double %x) { ; Check pow(x, -1.0) -> 1.0/x. define float @test_simplify15(float %x) { -; CHECK: @test_simplify15 +; CHECK-LABEL: @test_simplify15( %retval = call float @powf(float %x, float -1.0) ; CHECK-NEXT: [[RECIPROCAL:%[a-z0-9]+]] = fdiv float 1.000000e+00, %x ret float %retval @@ -144,7 +144,7 @@ define float @test_simplify15(float %x) { } define double @test_simplify16(double %x) { -; CHECK: @test_simplify16 +; CHECK-LABEL: @test_simplify16( %retval = call double @pow(double %x, double -1.0) ; CHECK-NEXT: [[RECIPROCAL:%[a-z0-9]+]] = fdiv double 1.000000e+00, %x ret double %retval diff --git a/test/Transforms/InstCombine/pow-2.ll b/test/Transforms/InstCombine/pow-2.ll index af64cda0904..d1ffde703fa 100644 --- a/test/Transforms/InstCombine/pow-2.ll +++ b/test/Transforms/InstCombine/pow-2.ll @@ -7,7 +7,7 @@ declare float @pow(double, double) ; Check that pow functions with the wrong prototype aren't simplified. define float @test_no_simplify1(double %x) { -; CHECK: @test_no_simplify1 +; CHECK-LABEL: @test_no_simplify1( %retval = call float @pow(double 1.0, double %x) ; CHECK-NEXT: call float @pow(double 1.000000e+00, double %x) ret float %retval diff --git a/test/Transforms/InstCombine/printf-1.ll b/test/Transforms/InstCombine/printf-1.ll index 3a910ea437b..59d0f1638aa 100644 --- a/test/Transforms/InstCombine/printf-1.ll +++ b/test/Transforms/InstCombine/printf-1.ll @@ -20,7 +20,7 @@ declare i32 @printf(i8*, ...) ; Check printf("") -> noop. define void @test_simplify1() { -; CHECK: @test_simplify1 +; CHECK-LABEL: @test_simplify1( %fmt = getelementptr [1 x i8]* @empty, i32 0, i32 0 call i32 (i8*, ...)* @printf(i8* %fmt) ret void @@ -30,7 +30,7 @@ define void @test_simplify1() { ; Check printf("x") -> putchar('x'), even for '%'. define void @test_simplify2() { -; CHECK: @test_simplify2 +; CHECK-LABEL: @test_simplify2( %fmt = getelementptr [2 x i8]* @h, i32 0, i32 0 call i32 (i8*, ...)* @printf(i8* %fmt) ; CHECK-NEXT: call i32 @putchar(i32 104) @@ -39,7 +39,7 @@ define void @test_simplify2() { } define void @test_simplify3() { -; CHECK: @test_simplify3 +; CHECK-LABEL: @test_simplify3( %fmt = getelementptr [2 x i8]* @percent, i32 0, i32 0 call i32 (i8*, ...)* @printf(i8* %fmt) ; CHECK-NEXT: call i32 @putchar(i32 37) @@ -50,7 +50,7 @@ define void @test_simplify3() { ; Check printf("foo\n") -> puts("foo"). define void @test_simplify4() { -; CHECK: @test_simplify4 +; CHECK-LABEL: @test_simplify4( %fmt = getelementptr [13 x i8]* @hello_world, i32 0, i32 0 call i32 (i8*, ...)* @printf(i8* %fmt) ; CHECK-NEXT: call i32 @puts(i8* getelementptr inbounds ([12 x i8]* [[STR]], i32 0, i32 0)) @@ -61,7 +61,7 @@ define void @test_simplify4() { ; Check printf("%c", chr) -> putchar(chr). define void @test_simplify5() { -; CHECK: @test_simplify5 +; CHECK-LABEL: @test_simplify5( %fmt = getelementptr [3 x i8]* @percent_c, i32 0, i32 0 call i32 (i8*, ...)* @printf(i8* %fmt, i8 104) ; CHECK-NEXT: call i32 @putchar(i32 104) @@ -72,7 +72,7 @@ define void @test_simplify5() { ; Check printf("%s\n", str) -> puts(str). define void @test_simplify6() { -; CHECK: @test_simplify6 +; CHECK-LABEL: @test_simplify6( %fmt = getelementptr [4 x i8]* @percent_s, i32 0, i32 0 %str = getelementptr [13 x i8]* @hello_world, i32 0, i32 0 call i32 (i8*, ...)* @printf(i8* %fmt, i8* %str) @@ -84,7 +84,7 @@ define void @test_simplify6() { ; Check printf(format, ...) -> iprintf(format, ...) if no floating point. define void @test_simplify7() { -; CHECK-IPRINTF: @test_simplify7 +; CHECK-IPRINTF-LABEL: @test_simplify7( %fmt = getelementptr [3 x i8]* @percent_d, i32 0, i32 0 call i32 (i8*, ...)* @printf(i8* %fmt, i32 187) ; CHECK-NEXT-IPRINTF: call i32 (i8*, ...)* @iprintf(i8* getelementptr inbounds ([3 x i8]* @percent_d, i32 0, i32 0), i32 187) @@ -93,7 +93,7 @@ define void @test_simplify7() { } define void @test_no_simplify1() { -; CHECK-IPRINTF: @test_no_simplify1 +; CHECK-IPRINTF-LABEL: @test_no_simplify1( %fmt = getelementptr [3 x i8]* @percent_f, i32 0, i32 0 call i32 (i8*, ...)* @printf(i8* %fmt, double 1.87) ; CHECK-NEXT-IPRINTF: call i32 (i8*, ...)* @printf(i8* getelementptr inbounds ([3 x i8]* @percent_f, i32 0, i32 0), double 1.870000e+00) @@ -102,7 +102,7 @@ define void @test_no_simplify1() { } define void @test_no_simplify2(i8* %fmt, double %d) { -; CHECK: @test_no_simplify2 +; CHECK-LABEL: @test_no_simplify2( call i32 (i8*, ...)* @printf(i8* %fmt, double %d) ; CHECK-NEXT: call i32 (i8*, ...)* @printf(i8* %fmt, double %d) ret void @@ -110,7 +110,7 @@ define void @test_no_simplify2(i8* %fmt, double %d) { } define i32 @test_no_simplify3() { -; CHECK: @test_no_simplify3 +; CHECK-LABEL: @test_no_simplify3( %fmt = getelementptr [2 x i8]* @h, i32 0, i32 0 %ret = call i32 (i8*, ...)* @printf(i8* %fmt) ; CHECK-NEXT: call i32 (i8*, ...)* @printf(i8* getelementptr inbounds ([2 x i8]* @h, i32 0, i32 0)) diff --git a/test/Transforms/InstCombine/printf-2.ll b/test/Transforms/InstCombine/printf-2.ll index 466ee1c7577..7e018ebba04 100644 --- a/test/Transforms/InstCombine/printf-2.ll +++ b/test/Transforms/InstCombine/printf-2.ll @@ -13,7 +13,7 @@ declare void @printf(i8*, ...) ; Check simplification of printf with void return type. define void @test_simplify1() { -; CHECK: @test_simplify1 +; CHECK-LABEL: @test_simplify1( %fmt = getelementptr [2 x i8]* @h, i32 0, i32 0 call void (i8*, ...)* @printf(i8* %fmt) ; CHECK-NEXT: call i32 @putchar(i32 104) @@ -22,7 +22,7 @@ define void @test_simplify1() { } define void @test_simplify2() { -; CHECK: @test_simplify2 +; CHECK-LABEL: @test_simplify2( %fmt = getelementptr [13 x i8]* @hello_world, i32 0, i32 0 call void (i8*, ...)* @printf(i8* %fmt) ; CHECK-NEXT: call i32 @puts(i8* getelementptr inbounds ([12 x i8]* @str, i32 0, i32 0)) @@ -31,7 +31,7 @@ define void @test_simplify2() { } define void @test_simplify6() { -; CHECK: @test_simplify6 +; CHECK-LABEL: @test_simplify6( %fmt = getelementptr [4 x i8]* @percent_s, i32 0, i32 0 %str = getelementptr [13 x i8]* @hello_world, i32 0, i32 0 call void (i8*, ...)* @printf(i8* %fmt, i8* %str) diff --git a/test/Transforms/InstCombine/ptr-int-cast.ll b/test/Transforms/InstCombine/ptr-int-cast.ll index 7a6ecff9c0b..826c0048422 100644 --- a/test/Transforms/InstCombine/ptr-int-cast.ll +++ b/test/Transforms/InstCombine/ptr-int-cast.ll @@ -28,7 +28,7 @@ define i64 @f0(i32 %a0) nounwind { } define <4 x i32> @test4(<4 x i8*> %arg) nounwind { -; CHECK: @test4 +; CHECK-LABEL: @test4( ; CHECK: ptrtoint <4 x i8*> %arg to <4 x i64> ; CHECK: trunc <4 x i64> %1 to <4 x i32> %p1 = ptrtoint <4 x i8*> %arg to <4 x i32> @@ -36,7 +36,7 @@ define <4 x i32> @test4(<4 x i8*> %arg) nounwind { } define <4 x i128> @test5(<4 x i8*> %arg) nounwind { -; CHECK: @test5 +; CHECK-LABEL: @test5( ; CHECK: ptrtoint <4 x i8*> %arg to <4 x i64> ; CHECK: zext <4 x i64> %1 to <4 x i128> %p1 = ptrtoint <4 x i8*> %arg to <4 x i128> @@ -44,7 +44,7 @@ define <4 x i128> @test5(<4 x i8*> %arg) nounwind { } define <4 x i8*> @test6(<4 x i32> %arg) nounwind { -; CHECK: @test6 +; CHECK-LABEL: @test6( ; CHECK: zext <4 x i32> %arg to <4 x i64> ; CHECK: inttoptr <4 x i64> %1 to <4 x i8*> %p1 = inttoptr <4 x i32> %arg to <4 x i8*> @@ -52,7 +52,7 @@ define <4 x i8*> @test6(<4 x i32> %arg) nounwind { } define <4 x i8*> @test7(<4 x i128> %arg) nounwind { -; CHECK: @test7 +; CHECK-LABEL: @test7( ; CHECK: trunc <4 x i128> %arg to <4 x i64> ; CHECK: inttoptr <4 x i64> %1 to <4 x i8*> %p1 = inttoptr <4 x i128> %arg to <4 x i8*> diff --git a/test/Transforms/InstCombine/puts-1.ll b/test/Transforms/InstCombine/puts-1.ll index ef4e1bbd824..bd7557ef650 100644 --- a/test/Transforms/InstCombine/puts-1.ll +++ b/test/Transforms/InstCombine/puts-1.ll @@ -11,7 +11,7 @@ declare i32 @puts(i8*) ; Check puts("") -> putchar('\n'). define void @test_simplify1() { -; CHECK: @test_simplify1 +; CHECK-LABEL: @test_simplify1( %str = getelementptr [1 x i8]* @empty, i32 0, i32 0 call i32 @puts(i8* %str) ; CHECK-NEXT: call i32 @putchar(i32 10) @@ -22,7 +22,7 @@ define void @test_simplify1() { ; Don't simplify if the return value is used. define i32 @test_no_simplify1() { -; CHECK: @test_no_simplify1 +; CHECK-LABEL: @test_no_simplify1( %str = getelementptr [1 x i8]* @empty, i32 0, i32 0 %ret = call i32 @puts(i8* %str) ; CHECK-NEXT: call i32 @puts(i8* getelementptr inbounds ([1 x i8]* @empty, i32 0, i32 0)) diff --git a/test/Transforms/InstCombine/rem.ll b/test/Transforms/InstCombine/rem.ll index c6fd7211995..9272f83b12e 100644 --- a/test/Transforms/InstCombine/rem.ll +++ b/test/Transforms/InstCombine/rem.ll @@ -4,21 +4,21 @@ ; END. define i32 @test1(i32 %A) { -; CHECK: @test1 +; CHECK-LABEL: @test1( ; CHECK-NEXT: ret i32 0 %B = srem i32 %A, 1 ; ISA constant 0 ret i32 %B } define i32 @test2(i32 %A) { ; 0 % X = 0, we don't need to preserve traps -; CHECK: @test2 +; CHECK-LABEL: @test2( ; CHECK-NEXT: ret i32 0 %B = srem i32 0, %A ret i32 %B } define i32 @test3(i32 %A) { -; CHECK: @test3 +; CHECK-LABEL: @test3( ; CHECK-NEXT: [[AND:%.*]] = and i32 %A, 7 ; CHECK-NEXT: ret i32 [[AND]] %B = urem i32 %A, 8 @@ -26,7 +26,7 @@ define i32 @test3(i32 %A) { } define i1 @test3a(i32 %A) { -; CHECK: @test3a +; CHECK-LABEL: @test3a( ; CHECK-NEXT: [[AND:%.*]] = and i32 %A, 7 ; CHECK-NEXT: [[CMP:%.*]] = icmp ne i32 [[AND]], 0 ; CHECK-NEXT: ret i1 [[CMP]] @@ -36,7 +36,7 @@ define i1 @test3a(i32 %A) { } define i32 @test4(i32 %X, i1 %C) { -; CHECK: @test4 +; CHECK-LABEL: @test4( ; CHECK-NEXT: [[SEL:%.*]] = select i1 %C, i32 0, i32 7 ; CHECK-NEXT: [[AND:%.*]] = and i32 [[SEL]], %X %V = select i1 %C, i32 1, i32 8 @@ -45,7 +45,7 @@ define i32 @test4(i32 %X, i1 %C) { } define i32 @test5(i32 %X, i8 %B) { -; CHECK: @test5 +; CHECK-LABEL: @test5( ; CHECK-NEXT: [[ZEXT:%.*]] = zext i8 %B to i32 ; CHECK-NEXT: [[SHL:%.*]] = shl nuw i32 32, [[ZEXT]] ; CHECK-NEXT: [[ADD:%.*]] = add i32 [[SHL]], -1 @@ -58,14 +58,14 @@ define i32 @test5(i32 %X, i8 %B) { } define i32 @test6(i32 %A) { -; CHECK: @test6 +; CHECK-LABEL: @test6( ; CHECK-NEXT: ret i32 undef %B = srem i32 %A, 0 ;; undef ret i32 %B } define i32 @test7(i32 %A) { -; CHECK: @test7 +; CHECK-LABEL: @test7( ; CHECK-NEXT: ret i32 0 %B = mul i32 %A, 8 %C = srem i32 %B, 4 @@ -73,7 +73,7 @@ define i32 @test7(i32 %A) { } define i32 @test8(i32 %A) { -; CHECK: @test8 +; CHECK-LABEL: @test8( ; CHECK-NEXT: ret i32 0 %B = shl i32 %A, 4 %C = srem i32 %B, 8 @@ -81,7 +81,7 @@ define i32 @test8(i32 %A) { } define i32 @test9(i32 %A) { -; CHECK: @test9 +; CHECK-LABEL: @test9( ; CHECK-NEXT: ret i32 0 %B = mul i32 %A, 64 %C = urem i32 %B, 32 @@ -89,7 +89,7 @@ define i32 @test9(i32 %A) { } define i32 @test10(i8 %c) { -; CHECK: @test10 +; CHECK-LABEL: @test10( ; CHECK-NEXT: ret i32 0 %tmp.1 = zext i8 %c to i32 %tmp.2 = mul i32 %tmp.1, 4 @@ -100,7 +100,7 @@ define i32 @test10(i8 %c) { } define i32 @test11(i32 %i) { -; CHECK: @test11 +; CHECK-LABEL: @test11( ; CHECK-NEXT: ret i32 0 %tmp.1 = and i32 %i, -2 %tmp.3 = mul i32 %tmp.1, 2 @@ -109,7 +109,7 @@ define i32 @test11(i32 %i) { } define i32 @test12(i32 %i) { -; CHECK: @test12 +; CHECK-LABEL: @test12( ; CHECK-NEXT: ret i32 0 %tmp.1 = and i32 %i, -4 %tmp.5 = srem i32 %tmp.1, 2 @@ -117,14 +117,14 @@ define i32 @test12(i32 %i) { } define i32 @test13(i32 %i) { -; CHECK: @test13 +; CHECK-LABEL: @test13( ; CHECK-NEXT: ret i32 0 %x = srem i32 %i, %i ret i32 %x } define i64 @test14(i64 %x, i32 %y) { -; CHECK: @test14 +; CHECK-LABEL: @test14( ; CHECK-NEXT: [[SHL:%.*]] = shl i32 1, %y ; CHECK-NEXT: [[ZEXT:%.*]] = zext i32 [[SHL]] to i64 ; CHECK-NEXT: [[ADD:%.*]] = add i64 [[ZEXT]], -1 @@ -137,7 +137,7 @@ define i64 @test14(i64 %x, i32 %y) { } define i64 @test15(i32 %x, i32 %y) { -; CHECK: @test15 +; CHECK-LABEL: @test15( ; CHECK-NEXT: [[SHL:%.*]] = shl nuw i32 1, %y ; CHECK-NEXT: [[ADD:%.*]] = add i32 [[SHL]], -1 ; CHECK-NEXT: [[AND:%.*]] = and i32 [[ADD]], %x @@ -151,7 +151,7 @@ define i64 @test15(i32 %x, i32 %y) { } define i32 @test16(i32 %x, i32 %y) { -; CHECK: @test16 +; CHECK-LABEL: @test16( ; CHECK-NEXT: [[SHR:%.*]] = lshr i32 %y, 11 ; CHECK-NEXT: [[AND:%.*]] = and i32 [[SHR]], 4 ; CHECK-NEXT: [[OR:%.*]] = or i32 [[AND]], 3 @@ -165,7 +165,7 @@ define i32 @test16(i32 %x, i32 %y) { } define i32 @test17(i32 %X) { -; CHECK: @test17 +; CHECK-LABEL: @test17( ; CHECK-NEXT: icmp ne i32 %X, 1 ; CHECK-NEXT: zext i1 ; CHECK-NEXT: ret diff --git a/test/Transforms/InstCombine/select-crash.ll b/test/Transforms/InstCombine/select-crash.ll index 946ea2b8b70..77446cd8ba0 100644 --- a/test/Transforms/InstCombine/select-crash.ll +++ b/test/Transforms/InstCombine/select-crash.ll @@ -21,7 +21,7 @@ entry: ; PR10180: same crash, but with vectors define <4 x float> @foo(i1 %b, <4 x float> %x, <4 x float> %y, <4 x float> %z) { -; CHECK: @foo +; CHECK-LABEL: @foo( ; CHECK: fsub <4 x float> ; CHECK: select ; CHECK: fadd <4 x float> @@ -31,7 +31,7 @@ define <4 x float> @foo(i1 %b, <4 x float> %x, <4 x float> %y, <4 x float> %z) { ret <4 x float> %sel } -; CHECK: @test3 +; CHECK-LABEL: @test3( define i32 @test3(i1 %bool, i32 %a) { entry: %cond = or i1 %bool, true diff --git a/test/Transforms/InstCombine/select.ll b/test/Transforms/InstCombine/select.ll index 5bf94232910..c7809f70b7f 100644 --- a/test/Transforms/InstCombine/select.ll +++ b/test/Transforms/InstCombine/select.ll @@ -6,14 +6,14 @@ define i32 @test1(i32 %A, i32 %B) { %C = select i1 false, i32 %A, i32 %B ret i32 %C -; CHECK: @test1 +; CHECK-LABEL: @test1( ; CHECK: ret i32 %B } define i32 @test2(i32 %A, i32 %B) { %C = select i1 true, i32 %A, i32 %B ret i32 %C -; CHECK: @test2 +; CHECK-LABEL: @test2( ; CHECK: ret i32 %A } @@ -22,7 +22,7 @@ define i32 @test3(i1 %C, i32 %I) { ; V = I %V = select i1 %C, i32 %I, i32 %I ret i32 %V -; CHECK: @test3 +; CHECK-LABEL: @test3( ; CHECK: ret i32 %I } @@ -30,7 +30,7 @@ define i1 @test4(i1 %C) { ; V = C %V = select i1 %C, i1 true, i1 false ret i1 %V -; CHECK: @test4 +; CHECK-LABEL: @test4( ; CHECK: ret i1 %C } @@ -38,7 +38,7 @@ define i1 @test5(i1 %C) { ; V = !C %V = select i1 %C, i1 false, i1 true ret i1 %V -; CHECK: @test5 +; CHECK-LABEL: @test5( ; CHECK: xor i1 %C, true ; CHECK: ret i1 } @@ -47,7 +47,7 @@ define i32 @test6(i1 %C) { ; V = cast C to int %V = select i1 %C, i32 1, i32 0 ret i32 %V -; CHECK: @test6 +; CHECK-LABEL: @test6( ; CHECK: %V = zext i1 %C to i32 ; CHECK: ret i32 %V } @@ -56,7 +56,7 @@ define i1 @test7(i1 %C, i1 %X) { ; R = or C, X %R = select i1 %C, i1 true, i1 %X ret i1 %R -; CHECK: @test7 +; CHECK-LABEL: @test7( ; CHECK: %R = or i1 %C, %X ; CHECK: ret i1 %R } @@ -65,7 +65,7 @@ define i1 @test8(i1 %C, i1 %X) { ; R = and C, X %R = select i1 %C, i1 %X, i1 false ret i1 %R -; CHECK: @test8 +; CHECK-LABEL: @test8( ; CHECK: %R = and i1 %C, %X ; CHECK: ret i1 %R } @@ -74,7 +74,7 @@ define i1 @test9(i1 %C, i1 %X) { ; R = and !C, X %R = select i1 %C, i1 false, i1 %X ret i1 %R -; CHECK: @test9 +; CHECK-LABEL: @test9( ; CHECK: xor i1 %C, true ; CHECK: %R = and i1 ; CHECK: ret i1 %R @@ -84,7 +84,7 @@ define i1 @test10(i1 %C, i1 %X) { ; R = or !C, X %R = select i1 %C, i1 %X, i1 true ret i1 %R -; CHECK: @test10 +; CHECK-LABEL: @test10( ; CHECK: xor i1 %C, true ; CHECK: %R = or i1 ; CHECK: ret i1 %R @@ -94,7 +94,7 @@ define i32 @test11(i32 %a) { %C = icmp eq i32 %a, 0 %R = select i1 %C, i32 0, i32 1 ret i32 %R -; CHECK: @test11 +; CHECK-LABEL: @test11( ; CHECK: icmp ne i32 %a, 0 ; CHECK: %R = zext i1 ; CHECK: ret i32 %R @@ -104,7 +104,7 @@ define i32 @test12(i1 %cond, i32 %a) { %b = or i32 %a, 1 %c = select i1 %cond, i32 %b, i32 %a ret i32 %c -; CHECK: @test12 +; CHECK-LABEL: @test12( ; CHECK: %b = zext i1 %cond to i32 ; CHECK: %c = or i32 %b, %a ; CHECK: ret i32 %c @@ -114,7 +114,7 @@ define i32 @test12a(i1 %cond, i32 %a) { %b = ashr i32 %a, 1 %c = select i1 %cond, i32 %b, i32 %a ret i32 %c -; CHECK: @test12a +; CHECK-LABEL: @test12a( ; CHECK: %b = zext i1 %cond to i32 ; CHECK: %c = ashr i32 %a, %b ; CHECK: ret i32 %c @@ -124,7 +124,7 @@ define i32 @test12b(i1 %cond, i32 %a) { %b = ashr i32 %a, 1 %c = select i1 %cond, i32 %a, i32 %b ret i32 %c -; CHECK: @test12b +; CHECK-LABEL: @test12b( ; CHECK: zext i1 %cond to i32 ; CHECK: %b = xor i32 ; CHECK: %c = ashr i32 %a, %b @@ -135,7 +135,7 @@ define i32 @test13(i32 %a, i32 %b) { %C = icmp eq i32 %a, %b %V = select i1 %C, i32 %a, i32 %b ret i32 %V -; CHECK: @test13 +; CHECK-LABEL: @test13( ; CHECK: ret i32 %b } @@ -143,7 +143,7 @@ define i32 @test13a(i32 %a, i32 %b) { %C = icmp ne i32 %a, %b %V = select i1 %C, i32 %a, i32 %b ret i32 %V -; CHECK: @test13a +; CHECK-LABEL: @test13a( ; CHECK: ret i32 %a } @@ -151,7 +151,7 @@ define i32 @test13b(i32 %a, i32 %b) { %C = icmp eq i32 %a, %b %V = select i1 %C, i32 %b, i32 %a ret i32 %V -; CHECK: @test13b +; CHECK-LABEL: @test13b( ; CHECK: ret i32 %a } @@ -160,7 +160,7 @@ define i1 @test14a(i1 %C, i32 %X) { ; (X < 1) | !C %R = icmp slt i32 %V, 1 ret i1 %R -; CHECK: @test14a +; CHECK-LABEL: @test14a( ; CHECK: icmp slt i32 %X, 1 ; CHECK: xor i1 %C, true ; CHECK: or i1 @@ -172,7 +172,7 @@ define i1 @test14b(i1 %C, i32 %X) { ; (X < 1) | C %R = icmp slt i32 %V, 1 ret i1 %R -; CHECK: @test14b +; CHECK-LABEL: @test14b( ; CHECK: icmp slt i32 %X, 1 ; CHECK: or i1 ; CHECK: ret i1 %R @@ -184,7 +184,7 @@ define i32 @test15a(i32 %X) { %t2 = icmp eq i32 %t1, 0 %t3 = select i1 %t2, i32 0, i32 16 ret i32 %t3 -; CHECK: @test15a +; CHECK-LABEL: @test15a( ; CHECK: %t1 = and i32 %X, 16 ; CHECK: ret i32 %t1 } @@ -195,7 +195,7 @@ define i32 @test15b(i32 %X) { %t2 = icmp eq i32 %t1, 0 %t3 = select i1 %t2, i32 32, i32 0 ret i32 %t3 -; CHECK: @test15b +; CHECK-LABEL: @test15b( ; CHECK: %t1 = and i32 %X, 32 ; CHECK: xor i32 %t1, 32 ; CHECK: ret i32 @@ -207,7 +207,7 @@ define i32 @test15c(i32 %X) { %t2 = icmp eq i32 %t1, 16 %t3 = select i1 %t2, i32 16, i32 0 ret i32 %t3 -; CHECK: @test15c +; CHECK-LABEL: @test15c( ; CHECK: %t1 = and i32 %X, 16 ; CHECK: ret i32 %t1 } @@ -218,7 +218,7 @@ define i32 @test15d(i32 %X) { %t2 = icmp ne i32 %t1, 0 %t3 = select i1 %t2, i32 16, i32 0 ret i32 %t3 -; CHECK: @test15d +; CHECK-LABEL: @test15d( ; CHECK: %t1 = and i32 %X, 16 ; CHECK: ret i32 %t1 } @@ -229,7 +229,7 @@ define i32 @test15e(i32 %X) { %t2 = icmp ne i32 %t1, 0 %t3 = select i1 %t2, i32 256, i32 0 ret i32 %t3 -; CHECK: @test15e +; CHECK-LABEL: @test15e( ; CHECK: %t1 = shl i32 %X, 1 ; CHECK: and i32 %t1, 256 ; CHECK: ret i32 @@ -241,7 +241,7 @@ define i32 @test15f(i32 %X) { %t2 = icmp ne i32 %t1, 0 %t3 = select i1 %t2, i32 0, i32 256 ret i32 %t3 -; CHECK: @test15f +; CHECK-LABEL: @test15f( ; CHECK: %t1 = shl i32 %X, 1 ; CHECK: and i32 %t1, 256 ; CHECK: xor i32 %{{.*}}, 256 @@ -254,7 +254,7 @@ define i32 @test15g(i32 %X) { %t2 = icmp ne i32 %t1, 0 %t3 = select i1 %t2, i32 -1, i32 -9 ret i32 %t3 -; CHECK: @test15g +; CHECK-LABEL: @test15g( ; CHECK-NEXT: %1 = or i32 %X, -9 ; CHECK-NEXT: ret i32 %1 } @@ -265,7 +265,7 @@ define i32 @test15h(i32 %X) { %t2 = icmp ne i32 %t1, 0 %t3 = select i1 %t2, i32 -9, i32 -1 ret i32 %t3 -; CHECK: @test15h +; CHECK-LABEL: @test15h( ; CHECK-NEXT: %1 = or i32 %X, -9 ; CHECK-NEXT: %2 = xor i32 %1, 8 ; CHECK-NEXT: ret i32 %2 @@ -277,7 +277,7 @@ define i32 @test15i(i32 %X) { %t2 = icmp ne i32 %t1, 0 %t3 = select i1 %t2, i32 577, i32 1089 ret i32 %t3 -; CHECK: @test15i +; CHECK-LABEL: @test15i( ; CHECK-NEXT: %t1 = shl i32 %X, 8 ; CHECK-NEXT: %1 = and i32 %t1, 512 ; CHECK-NEXT: %2 = xor i32 %1, 512 @@ -291,7 +291,7 @@ define i32 @test15j(i32 %X) { %t2 = icmp ne i32 %t1, 0 %t3 = select i1 %t2, i32 1089, i32 577 ret i32 %t3 -; CHECK: @test15j +; CHECK-LABEL: @test15j( ; CHECK-NEXT: %t1 = shl i32 %X, 8 ; CHECK-NEXT: %1 = and i32 %t1, 512 ; CHECK-NEXT: %2 = add i32 %1, 577 @@ -302,7 +302,7 @@ define i32 @test16(i1 %C, i32* %P) { %P2 = select i1 %C, i32* %P, i32* null %V = load i32* %P2 ret i32 %V -; CHECK: @test16 +; CHECK-LABEL: @test16( ; CHECK-NEXT: %V = load i32* %P ; CHECK: ret i32 %V } @@ -311,7 +311,7 @@ define i1 @test17(i32* %X, i1 %C) { %R = select i1 %C, i32* %X, i32* null %RV = icmp eq i32* %R, null ret i1 %RV -; CHECK: @test17 +; CHECK-LABEL: @test17( ; CHECK: icmp eq i32* %X, null ; CHECK: xor i1 %C, true ; CHECK: %RV = or i1 @@ -322,7 +322,7 @@ define i32 @test18(i32 %X, i32 %Y, i1 %C) { %R = select i1 %C, i32 %X, i32 0 %V = sdiv i32 %Y, %R ret i32 %V -; CHECK: @test18 +; CHECK-LABEL: @test18( ; CHECK: %V = sdiv i32 %Y, %X ; CHECK: ret i32 %V } @@ -331,7 +331,7 @@ define i32 @test19(i32 %x) { %tmp = icmp ugt i32 %x, 2147483647 %retval = select i1 %tmp, i32 -1, i32 0 ret i32 %retval -; CHECK: @test19 +; CHECK-LABEL: @test19( ; CHECK-NEXT: ashr i32 %x, 31 ; CHECK-NEXT: ret i32 } @@ -340,7 +340,7 @@ define i32 @test20(i32 %x) { %tmp = icmp slt i32 %x, 0 %retval = select i1 %tmp, i32 -1, i32 0 ret i32 %retval -; CHECK: @test20 +; CHECK-LABEL: @test20( ; CHECK-NEXT: ashr i32 %x, 31 ; CHECK-NEXT: ret i32 } @@ -349,7 +349,7 @@ define i64 @test21(i32 %x) { %tmp = icmp slt i32 %x, 0 %retval = select i1 %tmp, i64 -1, i64 0 ret i64 %retval -; CHECK: @test21 +; CHECK-LABEL: @test21( ; CHECK-NEXT: ashr i32 %x, 31 ; CHECK-NEXT: sext i32 ; CHECK-NEXT: ret i64 @@ -359,7 +359,7 @@ define i16 @test22(i32 %x) { %tmp = icmp slt i32 %x, 0 %retval = select i1 %tmp, i16 -1, i16 0 ret i16 %retval -; CHECK: @test22 +; CHECK-LABEL: @test22( ; CHECK-NEXT: ashr i32 %x, 31 ; CHECK-NEXT: trunc i32 ; CHECK-NEXT: ret i16 @@ -368,7 +368,7 @@ define i16 @test22(i32 %x) { define i1 @test23(i1 %a, i1 %b) { %c = select i1 %a, i1 %b, i1 %a ret i1 %c -; CHECK: @test23 +; CHECK-LABEL: @test23( ; CHECK-NEXT: %c = and i1 %a, %b ; CHECK-NEXT: ret i1 %c } @@ -376,7 +376,7 @@ define i1 @test23(i1 %a, i1 %b) { define i1 @test24(i1 %a, i1 %b) { %c = select i1 %a, i1 %a, i1 %b ret i1 %c -; CHECK: @test24 +; CHECK-LABEL: @test24( ; CHECK-NEXT: %c = or i1 %a, %b ; CHECK-NEXT: ret i1 %c } @@ -390,7 +390,7 @@ ret: %a = phi i1 [true, %jump], [false, %entry] %b = select i1 %a, i32 10, i32 20 ret i32 %b -; CHECK: @test25 +; CHECK-LABEL: @test25( ; CHECK: %a = phi i32 [ 10, %jump ], [ 20, %entry ] ; CHECK-NEXT: ret i32 %a } @@ -405,7 +405,7 @@ ret: %a = phi i1 [true, %jump], [%c, %entry] %b = select i1 %a, i32 10, i32 20 ret i32 %b -; CHECK: @test26 +; CHECK-LABEL: @test26( ; CHECK: %a = phi i32 [ 10, %jump ], [ 20, %entry ] ; CHECK-NEXT: ret i32 %a } @@ -419,7 +419,7 @@ ret: %a = phi i1 [true, %jump], [false, %entry] %b = select i1 %a, i32 %A, i32 %B ret i32 %b -; CHECK: @test27 +; CHECK-LABEL: @test27( ; CHECK: %a = phi i32 [ %A, %jump ], [ %B, %entry ] ; CHECK-NEXT: ret i32 %a } @@ -434,7 +434,7 @@ ret: %a = phi i1 [true, %jump], [false, %entry] %b = select i1 %a, i32 %A, i32 %c ret i32 %b -; CHECK: @test28 +; CHECK-LABEL: @test28( ; CHECK: %a = phi i32 [ %A, %jump ], [ %B, %entry ] ; CHECK-NEXT: ret i32 %a } @@ -452,7 +452,7 @@ ret: next: %b = select i1 %a, i32 %A, i32 %c ret i32 %b -; CHECK: @test29 +; CHECK-LABEL: @test29( ; CHECK: %a = phi i32 [ %A, %jump ], [ %B, %entry ] ; CHECK: ret i32 %a } @@ -466,7 +466,7 @@ define i32 @test30(i32 %x, i32 %y) { %cmp5 = icmp sgt i32 %cond, %x %retval = select i1 %cmp5, i32 %cond, i32 %x ret i32 %retval -; CHECK: @test30 +; CHECK-LABEL: @test30( ; CHECK: ret i32 %cond } @@ -477,7 +477,7 @@ define i32 @test31(i32 %x, i32 %y) { %cmp5 = icmp ugt i32 %cond, %x %retval = select i1 %cmp5, i32 %cond, i32 %x ret i32 %retval -; CHECK: @test31 +; CHECK-LABEL: @test31( ; CHECK: ret i32 %cond } @@ -488,7 +488,7 @@ define i32 @test32(i32 %x, i32 %y) { %cmp5 = icmp sgt i32 %cond, %x %retval = select i1 %cmp5, i32 %x, i32 %cond ret i32 %retval -; CHECK: @test32 +; CHECK-LABEL: @test32( ; CHECK: ret i32 %cond } @@ -499,7 +499,7 @@ define i32 @test33(i32 %x, i32 %y) { %cmp5 = icmp sgt i32 %cond, %x %retval = select i1 %cmp5, i32 %cond, i32 %x ret i32 %retval -; CHECK: @test33 +; CHECK-LABEL: @test33( ; CHECK: ret i32 %x } @@ -510,7 +510,7 @@ define i32 @test34(i32 %x, i32 %y) { %cmp5 = icmp sgt i32 %cond, %x %retval = select i1 %cmp5, i32 %x, i32 %cond ret i32 %retval -; CHECK: @test34 +; CHECK-LABEL: @test34( ; CHECK: ret i32 %x } @@ -518,7 +518,7 @@ define i32 @test35(i32 %x) { %cmp = icmp sge i32 %x, 0 %cond = select i1 %cmp, i32 60, i32 100 ret i32 %cond -; CHECK: @test35 +; CHECK-LABEL: @test35( ; CHECK: ashr i32 %x, 31 ; CHECK: and i32 {{.*}}, 40 ; CHECK: add i32 {{.*}}, 60 @@ -529,7 +529,7 @@ define i32 @test36(i32 %x) { %cmp = icmp slt i32 %x, 0 %cond = select i1 %cmp, i32 60, i32 100 ret i32 %cond -; CHECK: @test36 +; CHECK-LABEL: @test36( ; CHECK: ashr i32 %x, 31 ; CHECK: and i32 {{.*}}, -40 ; CHECK: add i32 {{.*}}, 100 @@ -540,7 +540,7 @@ define i32 @test37(i32 %x) { %cmp = icmp sgt i32 %x, -1 %cond = select i1 %cmp, i32 1, i32 -1 ret i32 %cond -; CHECK: @test37 +; CHECK-LABEL: @test37( ; CHECK: ashr i32 %x, 31 ; CHECK: or i32 {{.*}}, 1 ; CHECK: ret @@ -552,7 +552,7 @@ define i1 @test38(i1 %cond) { %ptr = select i1 %cond, i32* %zero, i32* %one %isnull = icmp eq i32* %ptr, null ret i1 %isnull -; CHECK: @test38 +; CHECK-LABEL: @test38( ; CHECK: ret i1 false } @@ -560,7 +560,7 @@ define i1 @test39(i1 %cond, double %x) { %s = select i1 %cond, double %x, double 0x7FF0000000000000 ; RHS = +infty %cmp = fcmp ule double %x, %s ret i1 %cmp -; CHECK: @test39 +; CHECK-LABEL: @test39( ; CHECK: ret i1 true } @@ -571,7 +571,7 @@ define i1 @test40(i1 %cond) { %s = select i1 %cond, i32* %a, i32* %b %r = icmp eq i32* %s, %c ret i1 %r -; CHECK: @test40 +; CHECK-LABEL: @test40( ; CHECK: ret i1 false } @@ -580,7 +580,7 @@ define i32 @test41(i1 %cond, i32 %x, i32 %y) { %s = select i1 %cond, i32 %y, i32 %z %r = and i32 %x, %s ret i32 %r -; CHECK: @test41 +; CHECK-LABEL: @test41( ; CHECK-NEXT: and i32 %x, %y ; CHECK-NEXT: ret i32 } @@ -590,7 +590,7 @@ define i32 @test42(i32 %x, i32 %y) { %cond = icmp eq i32 %x, 0 %c = select i1 %cond, i32 %b, i32 %y ret i32 %c -; CHECK: @test42 +; CHECK-LABEL: @test42( ; CHECK-NEXT: %cond = icmp eq i32 %x, 0 ; CHECK-NEXT: %b = sext i1 %cond to i32 ; CHECK-NEXT: %c = add i32 %b, %y @@ -602,7 +602,7 @@ define i64 @test43(i32 %a) nounwind { %is_a_nonnegative = icmp sgt i32 %a, -1 %max = select i1 %is_a_nonnegative, i64 %a_ext, i64 0 ret i64 %max -; CHECK: @test43 +; CHECK-LABEL: @test43( ; CHECK-NEXT: %a_ext = sext i32 %a to i64 ; CHECK-NEXT: %is_a_nonnegative = icmp slt i64 %a_ext, 0 ; CHECK-NEXT: %max = select i1 %is_a_nonnegative, i64 0, i64 %a_ext @@ -614,7 +614,7 @@ define i64 @test44(i32 %a) nounwind { %is_a_nonpositive = icmp slt i32 %a, 1 %min = select i1 %is_a_nonpositive, i64 %a_ext, i64 0 ret i64 %min -; CHECK: @test44 +; CHECK-LABEL: @test44( ; CHECK-NEXT: %a_ext = sext i32 %a to i64 ; CHECK-NEXT: %is_a_nonpositive = icmp sgt i64 %a_ext, 0 ; CHECK-NEXT: %min = select i1 %is_a_nonpositive, i64 0, i64 %a_ext @@ -625,7 +625,7 @@ define i64 @test45(i32 %a) nounwind { %is_a_nonnegative = icmp ugt i32 %a, 2 %max = select i1 %is_a_nonnegative, i64 %a_ext, i64 3 ret i64 %max -; CHECK: @test45 +; CHECK-LABEL: @test45( ; CHECK-NEXT: %a_ext = zext i32 %a to i64 ; CHECK-NEXT: %is_a_nonnegative = icmp ult i64 %a_ext, 3 ; CHECK-NEXT: %max = select i1 %is_a_nonnegative, i64 3, i64 %a_ext @@ -637,7 +637,7 @@ define i64 @test46(i32 %a) nounwind { %is_a_nonpositive = icmp ult i32 %a, 3 %min = select i1 %is_a_nonpositive, i64 %a_ext, i64 2 ret i64 %min -; CHECK: @test46 +; CHECK-LABEL: @test46( ; CHECK-NEXT: %a_ext = zext i32 %a to i64 ; CHECK-NEXT: %is_a_nonpositive = icmp ugt i64 %a_ext, 2 ; CHECK-NEXT: %min = select i1 %is_a_nonpositive, i64 2, i64 %a_ext @@ -648,7 +648,7 @@ define i64 @test47(i32 %a) nounwind { %is_a_nonnegative = icmp ugt i32 %a, 2 %max = select i1 %is_a_nonnegative, i64 %a_ext, i64 3 ret i64 %max -; CHECK: @test47 +; CHECK-LABEL: @test47( ; CHECK-NEXT: %a_ext = sext i32 %a to i64 ; CHECK-NEXT: %is_a_nonnegative = icmp ult i64 %a_ext, 3 ; CHECK-NEXT: %max = select i1 %is_a_nonnegative, i64 3, i64 %a_ext @@ -660,7 +660,7 @@ define i64 @test48(i32 %a) nounwind { %is_a_nonpositive = icmp ult i32 %a, 3 %min = select i1 %is_a_nonpositive, i64 %a_ext, i64 2 ret i64 %min -; CHECK: @test48 +; CHECK-LABEL: @test48( ; CHECK-NEXT: %a_ext = sext i32 %a to i64 ; CHECK-NEXT: %is_a_nonpositive = icmp ugt i64 %a_ext, 2 ; CHECK-NEXT: %min = select i1 %is_a_nonpositive, i64 2, i64 %a_ext @@ -672,7 +672,7 @@ define i64 @test49(i32 %a) nounwind { %is_a_nonpositive = icmp ult i32 %a, 3 %min = select i1 %is_a_nonpositive, i64 2, i64 %a_ext ret i64 %min -; CHECK: @test49 +; CHECK-LABEL: @test49( ; CHECK-NEXT: %a_ext = sext i32 %a to i64 ; CHECK-NEXT: %is_a_nonpositive = icmp ugt i64 %a_ext, 2 ; CHECK-NEXT: %min = select i1 %is_a_nonpositive, i64 %a_ext, i64 2 @@ -683,7 +683,7 @@ define i64 @test50(i32 %a) nounwind { %a_ext = sext i32 %a to i64 %min = select i1 %is_a_nonpositive, i64 2, i64 %a_ext ret i64 %min -; CHECK: @test50 +; CHECK-LABEL: @test50( ; CHECK-NEXT: %a_ext = sext i32 %a to i64 ; CHECK-NEXT: %is_a_nonpositive = icmp ugt i64 %a_ext, 2 ; CHECK-NEXT: %min = select i1 %is_a_nonpositive, i64 %a_ext, i64 2 @@ -695,7 +695,7 @@ define i64 @test50(i32 %a) nounwind { ; This select instruction can't be eliminated because trying to do so would ; change the number of vector elements. This used to assert. define i48 @test51(<3 x i1> %icmp, <3 x i16> %tmp) { -; CHECK: @test51 +; CHECK-LABEL: @test51( %select = select <3 x i1> %icmp, <3 x i16> zeroinitializer, <3 x i16> %tmp ; CHECK: select <3 x i1> %tmp2 = bitcast <3 x i16> %select to i48 @@ -705,7 +705,7 @@ define i48 @test51(<3 x i1> %icmp, <3 x i16> %tmp) { ; PR8575 define i32 @test52(i32 %n, i32 %m) nounwind { -; CHECK: @test52 +; CHECK-LABEL: @test52( %cmp = icmp sgt i32 %n, %m %. = select i1 %cmp, i32 1, i32 3 %add = add nsw i32 %., 3 @@ -720,7 +720,7 @@ define i32 @test53(i32 %x) nounwind { %cmp = icmp eq i32 %and, %x %sel = select i1 %cmp, i32 2, i32 1 ret i32 %sel -; CHECK: @test53 +; CHECK-LABEL: @test53( ; CHECK: select i1 %cmp ; CHECK: ret } @@ -730,7 +730,7 @@ define i32 @test54(i32 %X, i32 %Y) { %B = icmp eq i32 %A, 0 %C = select i1 %B, i32 %A, i32 1 ret i32 %C -; CHECK: @test54 +; CHECK-LABEL: @test54( ; CHECK-NOT: ashr ; CHECK-NOT: select ; CHECK: icmp ne i32 %X, 0 @@ -743,7 +743,7 @@ define i1 @test55(i1 %X, i32 %Y, i32 %Z) { %B = select i1 %X, i32 %Y, i32 %A %C = icmp eq i32 %B, 0 ret i1 %C -; CHECK: @test55 +; CHECK-LABEL: @test55( ; CHECK-NOT: ashr ; CHECK-NOT: select ; CHECK: icmp eq @@ -755,7 +755,7 @@ define i32 @test56(i16 %x) nounwind { %conv = zext i16 %x to i32 %cond = select i1 %tobool, i32 0, i32 %conv ret i32 %cond -; CHECK: @test56 +; CHECK-LABEL: @test56( ; CHECK-NEXT: zext ; CHECK-NEXT: ret } @@ -765,7 +765,7 @@ define i32 @test57(i32 %x, i32 %y) nounwind { %tobool = icmp eq i32 %x, 0 %.and = select i1 %tobool, i32 0, i32 %and ret i32 %.and -; CHECK: @test57 +; CHECK-LABEL: @test57( ; CHECK-NEXT: and i32 %x, %y ; CHECK-NEXT: ret } @@ -775,7 +775,7 @@ define i32 @test58(i16 %x) nounwind { %conv = zext i16 %x to i32 %cond = select i1 %tobool, i32 %conv, i32 1 ret i32 %cond -; CHECK: @test58 +; CHECK-LABEL: @test58( ; CHECK-NEXT: zext ; CHECK-NEXT: ret } @@ -785,7 +785,7 @@ define i32 @test59(i32 %x, i32 %y) nounwind { %tobool = icmp ne i32 %x, %y %.and = select i1 %tobool, i32 %and, i32 %y ret i32 %.and -; CHECK: @test59 +; CHECK-LABEL: @test59( ; CHECK-NEXT: and i32 %x, %y ; CHECK-NEXT: ret } @@ -796,7 +796,7 @@ define i1 @test60(i32 %x, i1* %y) nounwind { %cmp1 = icmp slt i32 %x, 1 %sel = select i1 %cmp, i1 %load, i1 %cmp1 ret i1 %sel -; CHECK: @test60 +; CHECK-LABEL: @test60( ; CHECK: select } @@ -806,7 +806,7 @@ define i32 @test61(i32* %ptr) { %B = icmp eq i32* %ptr, @glbl %C = select i1 %B, i32 %A, i32 10 ret i32 %C -; CHECK: @test61 +; CHECK-LABEL: @test61( ; CHECK: ret i32 10 } @@ -814,7 +814,7 @@ define i1 @test62(i1 %A, i1 %B) { %not = xor i1 %A, true %C = select i1 %A, i1 %not, i1 %B ret i1 %C -; CHECK: @test62 +; CHECK-LABEL: @test62( ; CHECK: %not = xor i1 %A, true ; CHECK: %C = and i1 %not, %B ; CHECK: ret i1 %C @@ -824,7 +824,7 @@ define i1 @test63(i1 %A, i1 %B) { %not = xor i1 %A, true %C = select i1 %A, i1 %B, i1 %not ret i1 %C -; CHECK: @test63 +; CHECK-LABEL: @test63( ; CHECK: %not = xor i1 %A, true ; CHECK: %C = or i1 %B, %not ; CHECK: ret i1 %C @@ -860,11 +860,11 @@ cond.end17: while.body: br label %while.body -; CHECK: @test64 +; CHECK-LABEL: @test64( ; CHECK-NOT: select } -; CHECK: @select_icmp_eq_and_1_0_or_2 +; CHECK-LABEL: @select_icmp_eq_and_1_0_or_2( ; CHECK-NEXT: [[SHL:%[a-z0-9]+]] = shl i32 %x, 1 ; CHECK-NEXT: [[AND:%[a-z0-9]+]] = and i32 [[SHL]], 2 ; CHECK-NEXT: [[OR:%[a-z0-9]+]] = or i32 [[AND]], %y @@ -877,7 +877,7 @@ define i32 @select_icmp_eq_and_1_0_or_2(i32 %x, i32 %y) { ret i32 %select } -; CHECK: @select_icmp_eq_and_32_0_or_8 +; CHECK-LABEL: @select_icmp_eq_and_32_0_or_8( ; CHECK-NEXT: [[LSHR:%[a-z0-9]+]] = lshr i32 %x, 2 ; CHECK-NEXT: [[AND:%[a-z0-9]+]] = and i32 [[LSHR]], 8 ; CHECK-NEXT: [[OR:%[a-z0-9]+]] = or i32 [[AND]], %y @@ -890,7 +890,7 @@ define i32 @select_icmp_eq_and_32_0_or_8(i32 %x, i32 %y) { ret i32 %select } -; CHECK: @select_icmp_ne_0_and_4096_or_4096 +; CHECK-LABEL: @select_icmp_ne_0_and_4096_or_4096( ; CHECK-NEXT: [[AND:%[a-z0-9]+]] = and i32 %x, 4096 ; CHECK-NEXT: [[XOR:%[a-z0-9]+]] = xor i32 [[AND]], 4096 ; CHECK-NEXT: [[OR:%[a-z0-9]+]] = or i32 [[XOR]], %y @@ -903,7 +903,7 @@ define i32 @select_icmp_ne_0_and_4096_or_4096(i32 %x, i32 %y) { ret i32 %select } -; CHECK: @select_icmp_eq_and_4096_0_or_4096 +; CHECK-LABEL: @select_icmp_eq_and_4096_0_or_4096( ; CHECK-NEXT: [[AND:%[a-z0-9]+]] = and i32 %x, 4096 ; CHECK-NEXT: [[OR:%[a-z0-9]+]] = or i32 [[AND]], %y ; CHECK-NEXT: ret i32 [[OR]] @@ -915,7 +915,7 @@ define i32 @select_icmp_eq_and_4096_0_or_4096(i32 %x, i32 %y) { ret i32 %select } -; CHECK: @select_icmp_eq_0_and_1_or_1 +; CHECK-LABEL: @select_icmp_eq_0_and_1_or_1( ; CHECK-NEXT: [[AND:%[a-z0-9]+]] = and i64 %x, 1 ; CHECK-NEXT: [[ZEXT:%[a-z0-9]+]] = trunc i64 [[AND]] to i32 ; CHECK-NEXT: [[OR:%[a-z0-9]+]] = or i32 [[XOR]], %y @@ -928,7 +928,7 @@ define i32 @select_icmp_eq_0_and_1_or_1(i64 %x, i32 %y) { ret i32 %select } -; CHECK: @select_icmp_ne_0_and_4096_or_32 +; CHECK-LABEL: @select_icmp_ne_0_and_4096_or_32( ; CHECK-NEXT: [[LSHR:%[a-z0-9]+]] = lshr i32 %x, 7 ; CHECK-NEXT: [[AND:%[a-z0-9]+]] = and i32 [[LSHR]], 32 ; CHECK-NEXT: [[XOR:%[a-z0-9]+]] = xor i32 [[AND]], 32 @@ -942,7 +942,7 @@ define i32 @select_icmp_ne_0_and_4096_or_32(i32 %x, i32 %y) { ret i32 %select } -; CHECK: @select_icmp_ne_0_and_32_or_4096 +; CHECK-LABEL: @select_icmp_ne_0_and_32_or_4096( ; CHECK-NEXT: [[SHL:%[a-z0-9]+]] = shl i32 %x, 7 ; CHECK-NEXT: [[AND:%[a-z0-9]+]] = and i32 [[SHL]], 4096 ; CHECK-NEXT: [[XOR:%[a-z0-9]+]] = xor i32 [[AND]], 4096 @@ -956,7 +956,7 @@ define i32 @select_icmp_ne_0_and_32_or_4096(i32 %x, i32 %y) { ret i32 %select } -; CHECK: @select_icmp_ne_0_and_1073741824_or_8 +; CHECK-LABEL: @select_icmp_ne_0_and_1073741824_or_8( ; CHECK-NEXT: [[LSHR:%[a-z0-9]+]] = lshr i32 %x, 27 ; CHECK-NEXT: [[AND:%[a-z0-9]+]] = and i32 [[LSHR]], 8 ; CHECK-NEXT: [[TRUNC:%[a-z0-9]+]] = trunc i32 [[AND]] to i8 @@ -971,7 +971,7 @@ define i8 @select_icmp_ne_0_and_1073741824_or_8(i32 %x, i8 %y) { ret i8 %select } -; CHECK: @select_icmp_ne_0_and_8_or_1073741824 +; CHECK-LABEL: @select_icmp_ne_0_and_8_or_1073741824( ; CHECK-NEXT: [[AND:%[a-z0-9]+]] = and i8 %x, 8 ; CHECK-NEXT: [[ZEXT:%[a-z0-9]+]] = zext i8 [[AND]] to i32 ; CHECK-NEXT: [[SHL:%[a-z0-9]+]] = shl nuw nsw i32 [[ZEXT]], 27 @@ -992,7 +992,7 @@ define i32 @test65(i64 %x) { %3 = select i1 %2, i32 40, i32 42 ret i32 %3 -; CHECK: @test65 +; CHECK-LABEL: @test65( ; CHECK: and i64 %x, 16 ; CHECK: trunc i64 %1 to i32 ; CHECK: lshr exact i32 %2, 3 @@ -1005,7 +1005,7 @@ define i32 @test66(i64 %x) { %3 = select i1 %2, i32 40, i32 42 ret i32 %3 -; CHECK: @test66 +; CHECK-LABEL: @test66( ; CHECK: select } @@ -1015,7 +1015,7 @@ define i32 @test67(i16 %x) { %3 = select i1 %2, i32 40, i32 42 ret i32 %3 -; CHECK: @test67 +; CHECK-LABEL: @test67( ; CHECK: and i16 %x, 4 ; CHECK: zext i16 %1 to i32 ; CHECK: lshr exact i32 %2, 1 diff --git a/test/Transforms/InstCombine/sext.ll b/test/Transforms/InstCombine/sext.ll index 968f37c9c12..b8dfe2257b1 100644 --- a/test/Transforms/InstCombine/sext.ll +++ b/test/Transforms/InstCombine/sext.ll @@ -11,7 +11,7 @@ define i64 @test1(i32 %x) { %s = sext i32 %t to i64 ret i64 %s -; CHECK: @test1 +; CHECK-LABEL: @test1( ; CHECK: zext i32 %t } @@ -20,7 +20,7 @@ define i64 @test2(i32 %x) { %s = sext i32 %t to i64 ret i64 %s -; CHECK: @test2 +; CHECK-LABEL: @test2( ; CHECK: zext i32 %t } @@ -29,7 +29,7 @@ define i64 @test3(i32 %x) { %s = sext i32 %t to i64 ret i64 %s -; CHECK: @test3 +; CHECK-LABEL: @test3( ; CHECK: zext i32 %t } @@ -38,7 +38,7 @@ define i64 @test4(i32 %x) { %s = sext i32 %t to i64 ret i64 %s -; CHECK: @test4 +; CHECK-LABEL: @test4( ; CHECK: zext i32 %t } @@ -46,7 +46,7 @@ define i64 @test5(i32 %x) { %t = urem i32 %x, 30000 %s = sext i32 %t to i64 ret i64 %s -; CHECK: @test5 +; CHECK-LABEL: @test5( ; CHECK: zext i32 %t } @@ -55,7 +55,7 @@ define i64 @test6(i32 %x) { %t = mul i32 %u, 3 %s = sext i32 %t to i64 ret i64 %s -; CHECK: @test6 +; CHECK-LABEL: @test6( ; CHECK: zext i32 %t } @@ -64,7 +64,7 @@ define i64 @test7(i32 %x) { %u = sub i32 20000, %t %s = sext i32 %u to i64 ret i64 %s -; CHECK: @test7 +; CHECK-LABEL: @test7( ; CHECK: zext i32 %u to i64 } @@ -74,7 +74,7 @@ define i32 @test8(i8 %a, i32 %f, i1 %p, i32* %z) { %s = trunc i32 %e to i16 %n = sext i16 %s to i32 ret i32 %n -; CHECK: @test8 +; CHECK-LABEL: @test8( ; CHECK: %d = lshr i32 %f, 24 ; CHECK: %n = select i1 %p, i32 %d, i32 0 ; CHECK: ret i32 %n @@ -92,7 +92,7 @@ F: %V = phi i32 [%t2, %T], [42, %entry] %W = trunc i32 %V to i16 ret i16 %W -; CHECK: @test9 +; CHECK-LABEL: @test9( ; CHECK: T: ; CHECK-NEXT: br label %F ; CHECK: F: @@ -108,7 +108,7 @@ entry: %a = ashr i8 %tmp16, 6 %b = sext i8 %a to i32 ret i32 %b -; CHECK: @test10 +; CHECK-LABEL: @test10( ; CHECK: shl i32 %i, 30 ; CHECK-NEXT: ashr exact i32 ; CHECK-NEXT: ret i32 @@ -120,7 +120,7 @@ define void @test11(<2 x i16> %srcA, <2 x i16> %srcB, <2 x i16>* %dst) { %tmask = ashr <2 x i16> %sext, store <2 x i16> %tmask, <2 x i16>* %dst ret void -; CHECK: @test11 +; CHECK-LABEL: @test11( ; CHECK-NEXT: icmp eq ; CHECK-NEXT: sext <2 x i1> ; CHECK-NEXT: store <2 x i16> @@ -132,7 +132,7 @@ define i64 @test12(i32 %x) nounwind { %sub = sub nsw i32 0, %shr %conv = sext i32 %sub to i64 ret i64 %conv -; CHECK: @test12 +; CHECK-LABEL: @test12( ; CHECK: sext ; CHECK: ret } @@ -142,7 +142,7 @@ define i32 @test13(i32 %x) nounwind { %cmp = icmp eq i32 %and, 0 %ext = sext i1 %cmp to i32 ret i32 %ext -; CHECK: @test13 +; CHECK-LABEL: @test13( ; CHECK-NEXT: %and = lshr i32 %x, 3 ; CHECK-NEXT: %1 = and i32 %and, 1 ; CHECK-NEXT: %sext = add i32 %1, -1 @@ -154,7 +154,7 @@ define i32 @test14(i16 %x) nounwind { %cmp = icmp ne i16 %and, 16 %ext = sext i1 %cmp to i32 ret i32 %ext -; CHECK: @test14 +; CHECK-LABEL: @test14( ; CHECK-NEXT: %and = lshr i16 %x, 4 ; CHECK-NEXT: %1 = and i16 %and, 1 ; CHECK-NEXT: %sext = add i16 %1, -1 @@ -167,7 +167,7 @@ define i32 @test15(i32 %x) nounwind { %cmp = icmp ne i32 %and, 0 %ext = sext i1 %cmp to i32 ret i32 %ext -; CHECK: @test15 +; CHECK-LABEL: @test15( ; CHECK-NEXT: %1 = shl i32 %x, 27 ; CHECK-NEXT: %sext = ashr i32 %1, 31 ; CHECK-NEXT: ret i32 %sext @@ -178,7 +178,7 @@ define i32 @test16(i16 %x) nounwind { %cmp = icmp eq i16 %and, 8 %ext = sext i1 %cmp to i32 ret i32 %ext -; CHECK: @test16 +; CHECK-LABEL: @test16( ; CHECK-NEXT: %1 = shl i16 %x, 12 ; CHECK-NEXT: %sext = ashr i16 %1, 15 ; CHECK-NEXT: %ext = sext i16 %sext to i32 @@ -189,7 +189,7 @@ define i32 @test17(i1 %x) nounwind { %c1 = sext i1 %x to i32 %c2 = sub i32 0, %c1 ret i32 %c2 -; CHECK: @test17 +; CHECK-LABEL: @test17( ; CHECK-NEXT: [[TEST17:%.*]] = zext i1 %x to i32 ; CHECK-NEXT: ret i32 [[TEST17]] } diff --git a/test/Transforms/InstCombine/shift-sra.ll b/test/Transforms/InstCombine/shift-sra.ll index a578bbe4d4f..75235500d51 100644 --- a/test/Transforms/InstCombine/shift-sra.ll +++ b/test/Transforms/InstCombine/shift-sra.ll @@ -7,7 +7,7 @@ define i32 @test1(i32 %X, i8 %A) { %Y = ashr i32 %X, %shift.upgrd.1 ; [#uses=1] %Z = and i32 %Y, 1 ; [#uses=1] ret i32 %Z -; CHECK: @test1 +; CHECK-LABEL: @test1( ; CHECK: lshr i32 %X, %shift.upgrd.1 } @@ -16,7 +16,7 @@ define i32 @test2(i8 %tmp) { %tmp4 = add i32 %tmp3, 7 ; [#uses=1] %tmp5 = ashr i32 %tmp4, 3 ; [#uses=1] ret i32 %tmp5 -; CHECK: @test2 +; CHECK-LABEL: @test2( ; CHECK: lshr i32 %tmp4, 3 } @@ -33,7 +33,7 @@ C: %S = ashr i64 %P, 12 ret i64 %S -; CHECK: @test3 +; CHECK-LABEL: @test3( ; CHECK: %P = phi i64 ; CHECK-NEXT: ret i64 %P } @@ -52,7 +52,7 @@ C: %S = ashr i64 %R, 12 ret i64 %S -; CHECK: @test4 +; CHECK-LABEL: @test4( ; CHECK: %P = phi i64 ; CHECK-NEXT: ret i64 %P } @@ -70,7 +70,7 @@ D: %P = phi i32 [0, %A], [0, %B], [%Y, %C] %S = ashr i32 %P, 16 ret i32 %S -; CHECK: @test5 +; CHECK-LABEL: @test5( ; CHECK: %P = phi i32 ; CHECK-NEXT: ashr i32 %P, 16 E: diff --git a/test/Transforms/InstCombine/shift.ll b/test/Transforms/InstCombine/shift.ll index aac8803398f..0bdab139b7c 100644 --- a/test/Transforms/InstCombine/shift.ll +++ b/test/Transforms/InstCombine/shift.ll @@ -3,14 +3,14 @@ ; RUN: opt < %s -instcombine -S | FileCheck %s define i32 @test1(i32 %A) { -; CHECK: @test1 +; CHECK-LABEL: @test1( ; CHECK: ret i32 %A %B = shl i32 %A, 0 ; [#uses=1] ret i32 %B } define i32 @test2(i8 %A) { -; CHECK: @test2 +; CHECK-LABEL: @test2( ; CHECK: ret i32 0 %shift.upgrd.1 = zext i8 %A to i32 ; [#uses=1] %B = shl i32 0, %shift.upgrd.1 ; [#uses=1] @@ -18,14 +18,14 @@ define i32 @test2(i8 %A) { } define i32 @test3(i32 %A) { -; CHECK: @test3 +; CHECK-LABEL: @test3( ; CHECK: ret i32 %A %B = ashr i32 %A, 0 ; [#uses=1] ret i32 %B } define i32 @test4(i8 %A) { -; CHECK: @test4 +; CHECK-LABEL: @test4( ; CHECK: ret i32 0 %shift.upgrd.2 = zext i8 %A to i32 ; [#uses=1] %B = ashr i32 0, %shift.upgrd.2 ; [#uses=1] @@ -34,35 +34,35 @@ define i32 @test4(i8 %A) { define i32 @test5(i32 %A) { -; CHECK: @test5 +; CHECK-LABEL: @test5( ; CHECK: ret i32 undef %B = lshr i32 %A, 32 ;; shift all bits out ret i32 %B } define i32 @test5a(i32 %A) { -; CHECK: @test5a +; CHECK-LABEL: @test5a( ; CHECK: ret i32 undef %B = shl i32 %A, 32 ;; shift all bits out ret i32 %B } define i32 @test5b() { -; CHECK: @test5b +; CHECK-LABEL: @test5b( ; CHECK: ret i32 -1 %B = ashr i32 undef, 2 ;; top two bits must be equal, so not undef ret i32 %B } define i32 @test5b2(i32 %A) { -; CHECK: @test5b2 +; CHECK-LABEL: @test5b2( ; CHECK: ret i32 -1 %B = ashr i32 undef, %A ;; top %A bits must be equal, so not undef ret i32 %B } define i32 @test6(i32 %A) { -; CHECK: @test6 +; CHECK-LABEL: @test6( ; CHECK-NEXT: mul i32 %A, 6 ; CHECK-NEXT: ret i32 %B = shl i32 %A, 1 ;; convert to an mul instruction @@ -71,7 +71,7 @@ define i32 @test6(i32 %A) { } define i32 @test6a(i32 %A) { -; CHECK: @test6a +; CHECK-LABEL: @test6a( ; CHECK-NEXT: mul i32 %A, 6 ; CHECK-NEXT: ret i32 %B = mul i32 %A, 3 @@ -80,7 +80,7 @@ define i32 @test6a(i32 %A) { } define i32 @test7(i8 %A) { -; CHECK: @test7 +; CHECK-LABEL: @test7( ; CHECK-NEXT: ret i32 -1 %shift.upgrd.3 = zext i8 %A to i32 %B = ashr i32 -1, %shift.upgrd.3 ;; Always equal to -1 @@ -89,7 +89,7 @@ define i32 @test7(i8 %A) { ;; (A << 5) << 3 === A << 8 == 0 define i8 @test8(i8 %A) { -; CHECK: @test8 +; CHECK-LABEL: @test8( ; CHECK: ret i8 0 %B = shl i8 %A, 5 ; [#uses=1] %C = shl i8 %B, 3 ; [#uses=1] @@ -98,7 +98,7 @@ define i8 @test8(i8 %A) { ;; (A << 7) >> 7 === A & 1 define i8 @test9(i8 %A) { -; CHECK: @test9 +; CHECK-LABEL: @test9( ; CHECK-NEXT: and i8 %A, 1 ; CHECK-NEXT: ret i8 %B = shl i8 %A, 7 ; [#uses=1] @@ -110,7 +110,7 @@ define i8 @test9(i8 %A) { ;; (A >> 7) << 7 === A & 128 ;; The shl may be valuable to scalar evolution. define i8 @test10(i8 %A) { -; CHECK: @test10 +; CHECK-LABEL: @test10( ; CHECK-NEXT: and i8 %A, -128 ; CHECK-NEXT: ret i8 %B = lshr i8 %A, 7 ; [#uses=1] @@ -120,7 +120,7 @@ define i8 @test10(i8 %A) { ;; Allow the simplification when the lshr shift is exact. define i8 @test10a(i8 %A) { -; CHECK: @test10a +; CHECK-LABEL: @test10a( ; CHECK-NEXT: ret i8 %A %B = lshr exact i8 %A, 7 %C = shl i8 %B, 7 @@ -131,7 +131,7 @@ define i8 @test10a(i8 %A) { ;; (A >> 3) << 4 === (A & 0x1F) << 1 ;; The shl may be valuable to scalar evolution. define i8 @test11(i8 %A) { -; CHECK: @test11 +; CHECK-LABEL: @test11( ; CHECK: shl i8 ; CHECK-NEXT: ret i8 %a = mul i8 %A, 3 ; [#uses=1] @@ -142,7 +142,7 @@ define i8 @test11(i8 %A) { ;; Allow the simplification in InstCombine when the lshr shift is exact. define i8 @test11a(i8 %A) { -; CHECK: @test11a +; CHECK-LABEL: @test11a( ; CHECK-NEXT: mul i8 %A, 6 ; CHECK-NEXT: ret i8 %a = mul i8 %A, 3 @@ -154,7 +154,7 @@ define i8 @test11a(i8 %A) { ;; This is deferred to DAGCombine unless %B is single-use. ;; (A >> 8) << 8 === A & -256 define i32 @test12(i32 %A) { -; CHECK: @test12 +; CHECK-LABEL: @test12( ; CHECK-NEXT: and i32 %A, -256 ; CHECK-NEXT: ret i32 %B = ashr i32 %A, 8 ; [#uses=1] @@ -166,7 +166,7 @@ define i32 @test12(i32 %A) { ;; (A >> 3) << 4 === (A & -8) * 2 ;; The shl may be valuable to scalar evolution. define i8 @test13(i8 %A) { -; CHECK: @test13 +; CHECK-LABEL: @test13( ; CHECK: shl i8 ; CHECK-NEXT: ret i8 %a = mul i8 %A, 3 ; [#uses=1] @@ -176,7 +176,7 @@ define i8 @test13(i8 %A) { } define i8 @test13a(i8 %A) { -; CHECK: @test13a +; CHECK-LABEL: @test13a( ; CHECK-NEXT: mul i8 %A, 6 ; CHECK-NEXT: ret i8 %a = mul i8 %A, 3 @@ -187,7 +187,7 @@ define i8 @test13a(i8 %A) { ;; D = ((B | 1234) << 4) === ((B << 4)|(1234 << 4) define i32 @test14(i32 %A) { -; CHECK: @test14 +; CHECK-LABEL: @test14( ; CHECK-NEXT: %B = and i32 %A, -19760 ; CHECK-NEXT: or i32 %B, 19744 ; CHECK-NEXT: ret i32 @@ -199,7 +199,7 @@ define i32 @test14(i32 %A) { ;; D = ((B | 1234) << 4) === ((B << 4)|(1234 << 4) define i32 @test14a(i32 %A) { -; CHECK: @test14a +; CHECK-LABEL: @test14a( ; CHECK-NEXT: and i32 %A, 77 ; CHECK-NEXT: ret i32 %B = shl i32 %A, 4 ; [#uses=1] @@ -209,7 +209,7 @@ define i32 @test14a(i32 %A) { } define i32 @test15(i1 %C) { -; CHECK: @test15 +; CHECK-LABEL: @test15( ; CHECK-NEXT: select i1 %C, i32 12, i32 4 ; CHECK-NEXT: ret i32 %A = select i1 %C, i32 3, i32 1 ; [#uses=1] @@ -218,7 +218,7 @@ define i32 @test15(i1 %C) { } define i32 @test15a(i1 %C) { -; CHECK: @test15a +; CHECK-LABEL: @test15a( ; CHECK-NEXT: select i1 %C, i32 512, i32 128 ; CHECK-NEXT: ret i32 %A = select i1 %C, i8 3, i8 1 ; [#uses=1] @@ -228,7 +228,7 @@ define i32 @test15a(i1 %C) { } define i1 @test16(i32 %X) { -; CHECK: @test16 +; CHECK-LABEL: @test16( ; CHECK-NEXT: and i32 %X, 16 ; CHECK-NEXT: icmp ne i32 ; CHECK-NEXT: ret i1 @@ -239,7 +239,7 @@ define i1 @test16(i32 %X) { } define i1 @test17(i32 %A) { -; CHECK: @test17 +; CHECK-LABEL: @test17( ; CHECK-NEXT: and i32 %A, -8 ; CHECK-NEXT: icmp eq i32 ; CHECK-NEXT: ret i1 @@ -250,7 +250,7 @@ define i1 @test17(i32 %A) { define i1 @test18(i8 %A) { -; CHECK: @test18 +; CHECK-LABEL: @test18( ; CHECK: ret i1 false %B = lshr i8 %A, 7 ; [#uses=1] @@ -260,7 +260,7 @@ define i1 @test18(i8 %A) { } define i1 @test19(i32 %A) { -; CHECK: @test19 +; CHECK-LABEL: @test19( ; CHECK-NEXT: icmp ult i32 %A, 4 ; CHECK-NEXT: ret i1 %B = ashr i32 %A, 2 ; [#uses=1] @@ -271,7 +271,7 @@ define i1 @test19(i32 %A) { define i1 @test19a(i32 %A) { -; CHECK: @test19a +; CHECK-LABEL: @test19a( ; CHECK-NEXT: icmp ugt i32 %A, -5 ; CHECK-NEXT: ret i1 %B = ashr i32 %A, 2 ; [#uses=1] @@ -281,7 +281,7 @@ define i1 @test19a(i32 %A) { } define i1 @test20(i8 %A) { -; CHECK: @test20 +; CHECK-LABEL: @test20( ; CHECK: ret i1 false %B = ashr i8 %A, 7 ; [#uses=1] ;; false @@ -290,7 +290,7 @@ define i1 @test20(i8 %A) { } define i1 @test21(i8 %A) { -; CHECK: @test21 +; CHECK-LABEL: @test21( ; CHECK-NEXT: and i8 %A, 15 ; CHECK-NEXT: icmp eq i8 ; CHECK-NEXT: ret i1 @@ -300,7 +300,7 @@ define i1 @test21(i8 %A) { } define i1 @test22(i8 %A) { -; CHECK: @test22 +; CHECK-LABEL: @test22( ; CHECK-NEXT: and i8 %A, 15 ; CHECK-NEXT: icmp eq i8 ; CHECK-NEXT: ret i1 @@ -310,7 +310,7 @@ define i1 @test22(i8 %A) { } define i8 @test23(i32 %A) { -; CHECK: @test23 +; CHECK-LABEL: @test23( ; CHECK-NEXT: trunc i32 %A to i8 ; CHECK-NEXT: ret i8 @@ -322,7 +322,7 @@ define i8 @test23(i32 %A) { } define i8 @test24(i8 %X) { -; CHECK: @test24 +; CHECK-LABEL: @test24( ; CHECK-NEXT: and i8 %X, 3 ; CHECK-NEXT: ret i8 %Y = and i8 %X, -5 ; [#uses=1] @@ -332,7 +332,7 @@ define i8 @test24(i8 %X) { } define i32 @test25(i32 %tmp.2, i32 %AA) { -; CHECK: @test25 +; CHECK-LABEL: @test25( ; CHECK-NEXT: and i32 %tmp.2, -131072 ; CHECK-NEXT: add i32 %{{[^,]*}}, %AA ; CHECK-NEXT: and i32 %{{[^,]*}}, -131072 @@ -346,7 +346,7 @@ define i32 @test25(i32 %tmp.2, i32 %AA) { ;; handle casts between shifts. define i32 @test26(i32 %A) { -; CHECK: @test26 +; CHECK-LABEL: @test26( ; CHECK-NEXT: and i32 %A, -2 ; CHECK-NEXT: ret i32 %B = lshr i32 %A, 1 ; [#uses=1] @@ -357,7 +357,7 @@ define i32 @test26(i32 %A) { define i1 @test27(i32 %x) nounwind { -; CHECK: @test27 +; CHECK-LABEL: @test27( ; CHECK-NEXT: and i32 %x, 8 ; CHECK-NEXT: icmp ne i32 ; CHECK-NEXT: ret i1 @@ -368,7 +368,7 @@ define i1 @test27(i32 %x) nounwind { define i8 @test28(i8 %x) { entry: -; CHECK: @test28 +; CHECK-LABEL: @test28( ; CHECK: icmp slt i8 %x, 0 ; CHECK-NEXT: br i1 %tmp1 = lshr i8 %x, 7 @@ -385,7 +385,7 @@ bb2: define i8 @test28a(i8 %x, i8 %y) { entry: ; This shouldn't be transformed. -; CHECK: @test28a +; CHECK-LABEL: @test28a( ; CHECK: %tmp1 = lshr i8 %x, 7 ; CHECK: %cond1 = icmp eq i8 %tmp1, 0 ; CHECK: br i1 %cond1, label %bb2, label %bb1 @@ -406,7 +406,7 @@ entry: %tmp917 = trunc i64 %tmp916 to i32 %tmp10 = lshr i32 %tmp917, 31 ret i32 %tmp10 -; CHECK: @test29 +; CHECK-LABEL: @test29( ; CHECK: %tmp916 = lshr i64 %d18, 63 ; CHECK: %tmp10 = trunc i64 %tmp916 to i32 } @@ -417,7 +417,7 @@ define i32 @test30(i32 %A, i32 %B, i32 %C) { %Y = shl i32 %B, %C %Z = and i32 %X, %Y ret i32 %Z -; CHECK: @test30 +; CHECK-LABEL: @test30( ; CHECK: %X1 = and i32 %A, %B ; CHECK: %Z = shl i32 %X1, %C } @@ -427,7 +427,7 @@ define i32 @test31(i32 %A, i32 %B, i32 %C) { %Y = lshr i32 %B, %C %Z = or i32 %X, %Y ret i32 %Z -; CHECK: @test31 +; CHECK-LABEL: @test31( ; CHECK: %X1 = or i32 %A, %B ; CHECK: %Z = lshr i32 %X1, %C } @@ -437,7 +437,7 @@ define i32 @test32(i32 %A, i32 %B, i32 %C) { %Y = ashr i32 %B, %C %Z = xor i32 %X, %Y ret i32 %Z -; CHECK: @test32 +; CHECK-LABEL: @test32( ; CHECK: %X1 = xor i32 %A, %B ; CHECK: %Z = ashr i32 %X1, %C ; CHECK: ret i32 %Z @@ -447,7 +447,7 @@ define i1 @test33(i32 %X) { %tmp1 = shl i32 %X, 7 %tmp2 = icmp slt i32 %tmp1, 0 ret i1 %tmp2 -; CHECK: @test33 +; CHECK-LABEL: @test33( ; CHECK: %tmp1.mask = and i32 %X, 16777216 ; CHECK: %tmp2 = icmp ne i32 %tmp1.mask, 0 } @@ -456,7 +456,7 @@ define i1 @test34(i32 %X) { %tmp1 = lshr i32 %X, 7 %tmp2 = icmp slt i32 %tmp1, 0 ret i1 %tmp2 -; CHECK: @test34 +; CHECK-LABEL: @test34( ; CHECK: ret i1 false } @@ -464,7 +464,7 @@ define i1 @test35(i32 %X) { %tmp1 = ashr i32 %X, 7 %tmp2 = icmp slt i32 %tmp1, 0 ret i1 %tmp2 -; CHECK: @test35 +; CHECK-LABEL: @test35( ; CHECK: %tmp2 = icmp slt i32 %X, 0 ; CHECK: ret i1 %tmp2 } @@ -477,7 +477,7 @@ entry: %tmp45 = lshr i128 %ins, 64 ret i128 %tmp45 -; CHECK: @test36 +; CHECK-LABEL: @test36( ; CHECK: %tmp231 = or i128 %B, %A ; CHECK: %ins = and i128 %tmp231, 18446744073709551615 ; CHECK: ret i128 %ins @@ -493,7 +493,7 @@ entry: %tmp46 = trunc i128 %tmp45 to i64 ret i64 %tmp46 -; CHECK: @test37 +; CHECK-LABEL: @test37( ; CHECK: %tmp23 = shl nuw nsw i128 %tmp22, 32 ; CHECK: %ins = or i128 %tmp23, %A ; CHECK: %tmp46 = trunc i128 %ins to i64 @@ -503,14 +503,14 @@ define i32 @test38(i32 %x) nounwind readnone { %rem = srem i32 %x, 32 %shl = shl i32 1, %rem ret i32 %shl -; CHECK: @test38 +; CHECK-LABEL: @test38( ; CHECK-NEXT: and i32 %x, 31 ; CHECK-NEXT: shl i32 1 ; CHECK-NEXT: ret i32 } ; -; CHECK: @test39 +; CHECK-LABEL: @test39( define i8 @test39(i32 %a0) { entry: %tmp4 = trunc i32 %a0 to i8 @@ -536,7 +536,7 @@ define i32 @test40(i32 %a, i32 %b) nounwind { %shl2 = shl i32 %shl1, 2 %div = udiv i32 %a, %shl2 ret i32 %div -; CHECK: @test40 +; CHECK-LABEL: @test40( ; CHECK-NEXT: add i32 %b, 2 ; CHECK-NEXT: lshr i32 %a ; CHECK-NEXT: ret i32 @@ -546,7 +546,7 @@ define i32 @test41(i32 %a, i32 %b) nounwind { %1 = shl i32 1, %b %2 = shl i32 %1, 3 ret i32 %2 -; CHECK: @test41 +; CHECK-LABEL: @test41( ; CHECK-NEXT: shl i32 8, %b ; CHECK-NEXT: ret i32 } @@ -555,7 +555,7 @@ define i32 @test42(i32 %a, i32 %b) nounwind { %div = lshr i32 4096, %b ; must be exact otherwise we'd divide by zero %div2 = udiv i32 %a, %div ret i32 %div2 -; CHECK: @test42 +; CHECK-LABEL: @test42( ; CHECK-NEXT: lshr exact i32 4096, %b } @@ -563,7 +563,7 @@ define i32 @test43(i32 %a, i32 %b) nounwind { %div = shl i32 4096, %b ; must be exact otherwise we'd divide by zero %div2 = udiv i32 %a, %div ret i32 %div2 -; CHECK: @test43 +; CHECK-LABEL: @test43( ; CHECK-NEXT: add i32 %b, 12 ; CHECK-NEXT: lshr ; CHECK-NEXT: ret @@ -573,7 +573,7 @@ define i32 @test44(i32 %a) nounwind { %y = shl nuw i32 %a, 1 %z = shl i32 %y, 4 ret i32 %z -; CHECK: @test44 +; CHECK-LABEL: @test44( ; CHECK-NEXT: %y = shl i32 %a, 5 ; CHECK-NEXT: ret i32 %y } @@ -582,7 +582,7 @@ define i32 @test45(i32 %a) nounwind { %y = lshr exact i32 %a, 1 %z = lshr i32 %y, 4 ret i32 %z -; CHECK: @test45 +; CHECK-LABEL: @test45( ; CHECK-NEXT: %y = lshr i32 %a, 5 ; CHECK-NEXT: ret i32 %y } @@ -591,7 +591,7 @@ define i32 @test46(i32 %a) { %y = ashr exact i32 %a, 3 %z = shl i32 %y, 1 ret i32 %z -; CHECK: @test46 +; CHECK-LABEL: @test46( ; CHECK-NEXT: %z = ashr exact i32 %a, 2 ; CHECK-NEXT: ret i32 %z } @@ -600,7 +600,7 @@ define i32 @test47(i32 %a) { %y = lshr exact i32 %a, 3 %z = shl i32 %y, 1 ret i32 %z -; CHECK: @test47 +; CHECK-LABEL: @test47( ; CHECK-NEXT: %z = lshr exact i32 %a, 2 ; CHECK-NEXT: ret i32 %z } @@ -609,7 +609,7 @@ define i32 @test48(i32 %x) { %A = lshr exact i32 %x, 1 %B = shl i32 %A, 3 ret i32 %B -; CHECK: @test48 +; CHECK-LABEL: @test48( ; CHECK-NEXT: %B = shl i32 %x, 2 ; CHECK-NEXT: ret i32 %B } @@ -618,7 +618,7 @@ define i32 @test49(i32 %x) { %A = ashr exact i32 %x, 1 %B = shl i32 %A, 3 ret i32 %B -; CHECK: @test49 +; CHECK-LABEL: @test49( ; CHECK-NEXT: %B = shl i32 %x, 2 ; CHECK-NEXT: ret i32 %B } @@ -627,7 +627,7 @@ define i32 @test50(i32 %x) { %A = shl nsw i32 %x, 1 %B = ashr i32 %A, 3 ret i32 %B -; CHECK: @test50 +; CHECK-LABEL: @test50( ; CHECK-NEXT: %B = ashr i32 %x, 2 ; CHECK-NEXT: ret i32 %B } @@ -636,7 +636,7 @@ define i32 @test51(i32 %x) { %A = shl nuw i32 %x, 1 %B = lshr i32 %A, 3 ret i32 %B -; CHECK: @test51 +; CHECK-LABEL: @test51( ; CHECK-NEXT: %B = lshr i32 %x, 2 ; CHECK-NEXT: ret i32 %B } @@ -645,7 +645,7 @@ define i32 @test52(i32 %x) { %A = shl nsw i32 %x, 3 %B = ashr i32 %A, 1 ret i32 %B -; CHECK: @test52 +; CHECK-LABEL: @test52( ; CHECK-NEXT: %B = shl nsw i32 %x, 2 ; CHECK-NEXT: ret i32 %B } @@ -654,7 +654,7 @@ define i32 @test53(i32 %x) { %A = shl nuw i32 %x, 3 %B = lshr i32 %A, 1 ret i32 %B -; CHECK: @test53 +; CHECK-LABEL: @test53( ; CHECK-NEXT: %B = shl nuw i32 %x, 2 ; CHECK-NEXT: ret i32 %B } @@ -664,7 +664,7 @@ define i32 @test54(i32 %x) { %shl = shl i32 %shr2, 4 %and = and i32 %shl, 16 ret i32 %and -; CHECK: @test54 +; CHECK-LABEL: @test54( ; CHECK: shl i32 %x, 3 } @@ -674,7 +674,7 @@ define i32 @test55(i32 %x) { %shl = shl i32 %shr2, 4 %or = or i32 %shl, 8 ret i32 %or -; CHECK: @test55 +; CHECK-LABEL: @test55( ; CHECK: shl i32 %x, 3 } @@ -683,7 +683,7 @@ define i32 @test56(i32 %x) { %shl = shl i32 %shr2, 4 %or = or i32 %shl, 7 ret i32 %or -; CHECK: @test56 +; CHECK-LABEL: @test56( ; CHECK: shl i32 %shr2, 4 } @@ -693,7 +693,7 @@ define i32 @test57(i32 %x) { %shl = shl i32 %shr, 4 %and = and i32 %shl, 16 ret i32 %and -; CHECK: @test57 +; CHECK-LABEL: @test57( ; CHECK: shl i32 %x, 3 } @@ -702,7 +702,7 @@ define i32 @test58(i32 %x) { %shl = shl i32 %shr, 4 %or = or i32 %shl, 8 ret i32 %or -; CHECK: @test58 +; CHECK-LABEL: @test58( ; CHECK: shl i32 %x, 3 } @@ -711,7 +711,7 @@ define i32 @test59(i32 %x) { %shl = shl i32 %shr, 4 %or = or i32 %shl, 7 ret i32 %or -; CHECK: @test59 +; CHECK-LABEL: @test59( ; CHECK: %shl = shl i32 %shr1, 4 } @@ -721,7 +721,7 @@ define i32 @test60(i32 %x) { %shl = shl i32 %shr, 1 %or = or i32 %shl, 1 ret i32 %or -; CHECK: @test60 +; CHECK-LABEL: @test60( ; CHECK: ashr i32 %x, 3 } @@ -731,7 +731,7 @@ define i32 @test61(i32 %x) { %shl = shl i32 %shr, 1 %or = or i32 %shl, 2 ret i32 %or -; CHECK: @test61 +; CHECK-LABEL: @test61( ; CHECK: ashr i32 %x, 4 } @@ -741,6 +741,6 @@ define i32 @test62(i32 %x) { %shl = shl i32 %shr, 1 %or = or i32 %shl, 1 ret i32 %or -; CHECK: @test62 +; CHECK-LABEL: @test62( ; CHECK: ashr exact i32 %x, 3 } diff --git a/test/Transforms/InstCombine/sign-test-and-or.ll b/test/Transforms/InstCombine/sign-test-and-or.ll index a6066d80020..95ed9b976ba 100644 --- a/test/Transforms/InstCombine/sign-test-and-or.ll +++ b/test/Transforms/InstCombine/sign-test-and-or.ll @@ -8,7 +8,7 @@ define void @test1(i32 %a, i32 %b) nounwind { %or.cond = or i1 %1, %2 br i1 %or.cond, label %if.then, label %if.end -; CHECK: @test1 +; CHECK-LABEL: @test1( ; CHECK-NEXT: %1 = or i32 %a, %b ; CHECK-NEXT: %2 = icmp slt i32 %1, 0 ; CHECK-NEXT: br @@ -27,7 +27,7 @@ define void @test2(i32 %a, i32 %b) nounwind { %or.cond = or i1 %1, %2 br i1 %or.cond, label %if.then, label %if.end -; CHECK: @test2 +; CHECK-LABEL: @test2( ; CHECK-NEXT: %1 = and i32 %a, %b ; CHECK-NEXT: %2 = icmp sgt i32 %1, -1 ; CHECK-NEXT: br @@ -46,7 +46,7 @@ define void @test3(i32 %a, i32 %b) nounwind { %or.cond = and i1 %1, %2 br i1 %or.cond, label %if.then, label %if.end -; CHECK: @test3 +; CHECK-LABEL: @test3( ; CHECK-NEXT: %1 = and i32 %a, %b ; CHECK-NEXT: %2 = icmp slt i32 %1, 0 ; CHECK-NEXT: br @@ -65,7 +65,7 @@ define void @test4(i32 %a, i32 %b) nounwind { %or.cond = and i1 %1, %2 br i1 %or.cond, label %if.then, label %if.end -; CHECK: @test4 +; CHECK-LABEL: @test4( ; CHECK-NEXT: %1 = or i32 %a, %b ; CHECK-NEXT: %2 = icmp sgt i32 %1, -1 ; CHECK-NEXT: br @@ -85,7 +85,7 @@ define void @test5(i32 %a) nounwind { %or.cond = and i1 %1, %2 br i1 %or.cond, label %if.then, label %if.end -; CHECK: @test5 +; CHECK-LABEL: @test5( ; CHECK-NEXT: %1 = and i32 %a, -2013265920 ; CHECK-NEXT: %2 = icmp eq i32 %1, 0 ; CHECK-NEXT: br i1 %2, label %if.then, label %if.end @@ -105,7 +105,7 @@ define void @test6(i32 %a) nounwind { %or.cond = and i1 %1, %2 br i1 %or.cond, label %if.then, label %if.end -; CHECK: @test6 +; CHECK-LABEL: @test6( ; CHECK-NEXT: %1 = and i32 %a, -2013265920 ; CHECK-NEXT: %2 = icmp eq i32 %1, 0 ; CHECK-NEXT: br i1 %2, label %if.then, label %if.end @@ -125,7 +125,7 @@ define void @test7(i32 %a) nounwind { %or.cond = or i1 %1, %2 br i1 %or.cond, label %if.then, label %if.end -; CHECK: @test7 +; CHECK-LABEL: @test7( ; CHECK-NEXT: %1 = and i32 %a, -2013265920 ; CHECK-NEXT: %2 = icmp eq i32 %1, 0 ; CHECK-NEXT: br i1 %2, label %if.end, label %if.the @@ -145,7 +145,7 @@ define void @test8(i32 %a) nounwind { %or.cond = or i1 %1, %2 br i1 %or.cond, label %if.then, label %if.end -; CHECK: @test8 +; CHECK-LABEL: @test8( ; CHECK-NEXT: %1 = and i32 %a, -2013265920 ; CHECK-NEXT: %2 = icmp eq i32 %1, 0 ; CHECK-NEXT: br i1 %2, label %if.end, label %if.the @@ -165,7 +165,7 @@ define void @test9(i32 %a) nounwind { %or.cond = and i1 %2, %3 br i1 %or.cond, label %if.then, label %if.end -; CHECK: @test9 +; CHECK-LABEL: @test9( ; CHECK-NEXT: %1 = and i32 %a, -1073741824 ; CHECK-NEXT: %2 = icmp eq i32 %1, 1073741824 ; CHECK-NEXT: br i1 %2, label %if.then, label %if.end diff --git a/test/Transforms/InstCombine/signext.ll b/test/Transforms/InstCombine/signext.ll index 5ed1cd5590a..d7004977cd6 100644 --- a/test/Transforms/InstCombine/signext.ll +++ b/test/Transforms/InstCombine/signext.ll @@ -7,7 +7,7 @@ define i32 @test1(i32 %x) { %tmp.2 = xor i32 %tmp.1, -32768 ; [#uses=1] %tmp.3 = add i32 %tmp.2, 32768 ; [#uses=1] ret i32 %tmp.3 -; CHECK: @test1 +; CHECK-LABEL: @test1( ; CHECK: %sext = shl i32 %x, 16 ; CHECK: %tmp.3 = ashr exact i32 %sext, 16 ; CHECK: ret i32 %tmp.3 @@ -18,7 +18,7 @@ define i32 @test2(i32 %x) { %tmp.2 = xor i32 %tmp.1, 32768 ; [#uses=1] %tmp.3 = add i32 %tmp.2, -32768 ; [#uses=1] ret i32 %tmp.3 -; CHECK: @test2 +; CHECK-LABEL: @test2( ; CHECK: %sext = shl i32 %x, 16 ; CHECK: %tmp.3 = ashr exact i32 %sext, 16 ; CHECK: ret i32 %tmp.3 @@ -29,7 +29,7 @@ define i32 @test3(i16 %P) { %tmp.4 = xor i32 %tmp.1, 32768 ; [#uses=1] %tmp.5 = add i32 %tmp.4, -32768 ; [#uses=1] ret i32 %tmp.5 -; CHECK: @test3 +; CHECK-LABEL: @test3( ; CHECK: %tmp.5 = sext i16 %P to i32 ; CHECK: ret i32 %tmp.5 } @@ -39,7 +39,7 @@ define i32 @test4(i16 %P) { %tmp.4 = xor i32 %tmp.1, 32768 ; [#uses=1] %tmp.5 = add i32 %tmp.4, -32768 ; [#uses=1] ret i32 %tmp.5 -; CHECK: @test4 +; CHECK-LABEL: @test4( ; CHECK: %tmp.5 = sext i16 %P to i32 ; CHECK: ret i32 %tmp.5 } @@ -49,7 +49,7 @@ define i32 @test5(i32 %x) { %tmp.2 = xor i32 %tmp.1, 128 ; [#uses=1] %tmp.3 = add i32 %tmp.2, -128 ; [#uses=1] ret i32 %tmp.3 -; CHECK: @test5 +; CHECK-LABEL: @test5( ; CHECK: %sext = shl i32 %x, 24 ; CHECK: %tmp.3 = ashr exact i32 %sext, 24 ; CHECK: ret i32 %tmp.3 @@ -59,7 +59,7 @@ define i32 @test6(i32 %x) { %tmp.2 = shl i32 %x, 16 ; [#uses=1] %tmp.4 = ashr i32 %tmp.2, 16 ; [#uses=1] ret i32 %tmp.4 -; CHECK: @test6 +; CHECK-LABEL: @test6( ; CHECK: %tmp.2 = shl i32 %x, 16 ; CHECK: %tmp.4 = ashr exact i32 %tmp.2, 16 ; CHECK: ret i32 %tmp.4 @@ -70,7 +70,7 @@ define i32 @test7(i16 %P) { %sext1 = shl i32 %tmp.1, 16 ; [#uses=1] %tmp.5 = ashr i32 %sext1, 16 ; [#uses=1] ret i32 %tmp.5 -; CHECK: @test7 +; CHECK-LABEL: @test7( ; CHECK: %tmp.5 = sext i16 %P to i32 ; CHECK: ret i32 %tmp.5 } @@ -81,7 +81,7 @@ entry: %xor = xor i32 %shr, 67108864 ; [#uses=1] %sub = add i32 %xor, -67108864 ; [#uses=1] ret i32 %sub -; CHECK: @test8 +; CHECK-LABEL: @test8( ; CHECK: %sub = ashr i32 %x, 5 ; CHECK: ret i32 %sub } diff --git a/test/Transforms/InstCombine/simplify-libcalls.ll b/test/Transforms/InstCombine/simplify-libcalls.ll index ad29a445de6..fae3e6e3d9b 100644 --- a/test/Transforms/InstCombine/simplify-libcalls.ll +++ b/test/Transforms/InstCombine/simplify-libcalls.ll @@ -18,7 +18,7 @@ define i8* @test1() { %tmp3 = tail call i8* @strchr( i8* getelementptr ([5 x i8]* @str, i32 0, i32 2), i32 103 ) ; [#uses=1] ret i8* %tmp3 -; CHECK: @test1 +; CHECK-LABEL: @test1( ; CHECK: ret i8* getelementptr inbounds ([5 x i8]* @str, i32 0, i64 3) } @@ -28,7 +28,7 @@ define i8* @test2() { %tmp3 = tail call i8* @strchr( i8* getelementptr ([8 x i8]* @str1, i32 0, i32 2), i32 0 ) ; [#uses=1] ret i8* %tmp3 -; CHECK: @test2 +; CHECK-LABEL: @test2( ; CHECK: ret i8* getelementptr inbounds ([8 x i8]* @str1, i32 0, i64 7) } @@ -37,7 +37,7 @@ entry: %tmp3 = tail call i8* @strchr( i8* getelementptr ([5 x i8]* @str2, i32 0, i32 1), i32 80 ) ; [#uses=1] ret i8* %tmp3 -; CHECK: @test3 +; CHECK-LABEL: @test3( ; CHECK: ret i8* null } @@ -52,7 +52,7 @@ entry: %tmp6 = icmp eq i32 %tmp5, 0 ; [#uses=1] ret i1 %tmp6 -; CHECK: @PR2341 +; CHECK-LABEL: @PR2341( ; CHECK: i32 } @@ -65,7 +65,7 @@ entry: %call = call i32 @memcmp(i8* %c0, i8* %c2, i32 1) ; [#uses=1] ret i32 %call -; CHECK: @PR4284 +; CHECK-LABEL: @PR4284( ; CHECK: ret i32 -65 } @@ -124,7 +124,7 @@ define i32 @MemCpy() { call void @llvm.memcpy.p0i8.p0i8.i32(i8* %target_p, i8* %hello_u_p, i32 8, i32 8, i1 false) ret i32 0 -; CHECK: @MemCpy +; CHECK-LABEL: @MemCpy( ; CHECK-NOT: llvm.memcpy ; CHECK: ret i32 0 } @@ -134,7 +134,7 @@ declare void @llvm.memcpy.p0i8.p0i8.i32(i8* nocapture, i8* nocapture, i32, i32, declare i32 @strcmp(i8*, i8*) #0 define void @test9(i8* %x) { -; CHECK: @test9 +; CHECK-LABEL: @test9( ; CHECK-NOT: strcmp %y = call i32 @strcmp(i8* %x, i8* %x) #1 ret void diff --git a/test/Transforms/InstCombine/sink_instruction.ll b/test/Transforms/InstCombine/sink_instruction.ll index 5c4019a98df..1bbd6b76384 100644 --- a/test/Transforms/InstCombine/sink_instruction.ll +++ b/test/Transforms/InstCombine/sink_instruction.ll @@ -4,7 +4,7 @@ ;; arm of the 'if'. define i32 @test1(i1 %C, i32 %A, i32 %B) { -; CHECK: @test1 +; CHECK-LABEL: @test1( entry: %tmp.2 = sdiv i32 %A, %B ; [#uses=1] %tmp.9 = add i32 %B, %A ; [#uses=1] @@ -22,7 +22,7 @@ endif: ; preds = %entry ;; PHI use, sink divide before call. define i32 @test2(i32 %x) nounwind ssp { -; CHECK: @test2 +; CHECK-LABEL: @test2( ; CHECK-NOT: sdiv i32 entry: br label %bb diff --git a/test/Transforms/InstCombine/sprintf-1.ll b/test/Transforms/InstCombine/sprintf-1.ll index 9b8c8b1b12c..6d0ab135261 100644 --- a/test/Transforms/InstCombine/sprintf-1.ll +++ b/test/Transforms/InstCombine/sprintf-1.ll @@ -19,7 +19,7 @@ declare i32 @sprintf(i8*, i8*, ...) ; Check sprintf(dst, fmt) -> llvm.memcpy(str, fmt, strlen(fmt) + 1, 1). define void @test_simplify1(i8* %dst) { -; CHECK: @test_simplify1 +; CHECK-LABEL: @test_simplify1( %fmt = getelementptr [13 x i8]* @hello_world, i32 0, i32 0 call i32 (i8*, i8*, ...)* @sprintf(i8* %dst, i8* %fmt) ; CHECK-NEXT: call void @llvm.memcpy.p0i8.p0i8.i32(i8* %dst, i8* getelementptr inbounds ([13 x i8]* @hello_world, i32 0, i32 0), i32 13, i32 1, i1 false) @@ -28,7 +28,7 @@ define void @test_simplify1(i8* %dst) { } define void @test_simplify2(i8* %dst) { -; CHECK: @test_simplify2 +; CHECK-LABEL: @test_simplify2( %fmt = getelementptr [1 x i8]* @null, i32 0, i32 0 call i32 (i8*, i8*, ...)* @sprintf(i8* %dst, i8* %fmt) ; CHECK-NEXT: store i8 0, i8* %dst, align 1 @@ -37,7 +37,7 @@ define void @test_simplify2(i8* %dst) { } define void @test_simplify3(i8* %dst) { -; CHECK: @test_simplify3 +; CHECK-LABEL: @test_simplify3( %fmt = getelementptr [7 x i8]* @null_hello, i32 0, i32 0 call i32 (i8*, i8*, ...)* @sprintf(i8* %dst, i8* %fmt) ; CHECK-NEXT: store i8 0, i8* %dst, align 1 @@ -48,7 +48,7 @@ define void @test_simplify3(i8* %dst) { ; Check sprintf(dst, "%c", chr) -> *(i8*)dst = chr; *((i8*)dst + 1) = 0. define void @test_simplify4(i8* %dst) { -; CHECK: @test_simplify4 +; CHECK-LABEL: @test_simplify4( %fmt = getelementptr [3 x i8]* @percent_c, i32 0, i32 0 call i32 (i8*, i8*, ...)* @sprintf(i8* %dst, i8* %fmt, i8 104) ; CHECK-NEXT: store i8 104, i8* %dst, align 1 @@ -61,7 +61,7 @@ define void @test_simplify4(i8* %dst) { ; Check sprintf(dst, "%s", str) -> llvm.memcpy(dest, str, strlen(str) + 1, 1). define void @test_simplify5(i8* %dst, i8* %str) { -; CHECK: @test_simplify5 +; CHECK-LABEL: @test_simplify5( %fmt = getelementptr [3 x i8]* @percent_s, i32 0, i32 0 call i32 (i8*, i8*, ...)* @sprintf(i8* %dst, i8* %fmt, i8* %str) ; CHECK-NEXT: [[STRLEN:%[a-z0-9]+]] = call i32 @strlen(i8* %str) @@ -74,7 +74,7 @@ define void @test_simplify5(i8* %dst, i8* %str) { ; Check sprintf(dst, format, ...) -> siprintf(str, format, ...) if no floating. define void @test_simplify6(i8* %dst) { -; CHECK-IPRINTF: @test_simplify6 +; CHECK-IPRINTF-LABEL: @test_simplify6( %fmt = getelementptr [3 x i8]* @percent_d, i32 0, i32 0 call i32 (i8*, i8*, ...)* @sprintf(i8* %dst, i8* %fmt, i32 187) ; CHECK-NEXT-IPRINTF: call i32 (i8*, i8*, ...)* @siprintf(i8* %dst, i8* getelementptr inbounds ([3 x i8]* @percent_d, i32 0, i32 0), i32 187) @@ -83,7 +83,7 @@ define void @test_simplify6(i8* %dst) { } define void @test_no_simplify1(i8* %dst) { -; CHECK-IPRINTF: @test_no_simplify1 +; CHECK-IPRINTF-LABEL: @test_no_simplify1( %fmt = getelementptr [3 x i8]* @percent_f, i32 0, i32 0 call i32 (i8*, i8*, ...)* @sprintf(i8* %dst, i8* %fmt, double 1.87) ; CHECK-NEXT-IPRINTF: call i32 (i8*, i8*, ...)* @sprintf(i8* %dst, i8* getelementptr inbounds ([3 x i8]* @percent_f, i32 0, i32 0), double 1.870000e+00) @@ -92,7 +92,7 @@ define void @test_no_simplify1(i8* %dst) { } define void @test_no_simplify2(i8* %dst, i8* %fmt, double %d) { -; CHECK: @test_no_simplify2 +; CHECK-LABEL: @test_no_simplify2( call i32 (i8*, i8*, ...)* @sprintf(i8* %dst, i8* %fmt, double %d) ; CHECK-NEXT: call i32 (i8*, i8*, ...)* @sprintf(i8* %dst, i8* %fmt, double %d) ret void diff --git a/test/Transforms/InstCombine/sqrt.ll b/test/Transforms/InstCombine/sqrt.ll index 440b9748518..650b10c6e96 100644 --- a/test/Transforms/InstCombine/sqrt.ll +++ b/test/Transforms/InstCombine/sqrt.ll @@ -2,7 +2,7 @@ define float @test1(float %x) nounwind readnone ssp { entry: -; CHECK: @test1 +; CHECK-LABEL: @test1( ; CHECK-NOT: fpext ; CHECK-NOT: sqrt( ; CHECK: sqrtf( @@ -17,7 +17,7 @@ entry: ; PR8096 define float @test2(float %x) nounwind readnone ssp { entry: -; CHECK: @test2 +; CHECK-LABEL: @test2( ; CHECK-NOT: fpext ; CHECK-NOT: sqrt( ; CHECK: sqrtf( @@ -34,7 +34,7 @@ entry: ; use of sqrt result. define float @test3(float* %v) nounwind uwtable ssp { entry: -; CHECK: @test3 +; CHECK-LABEL: @test3( ; CHECK: sqrt( ; CHECK-NOT: sqrtf( ; CHECK: fptrunc diff --git a/test/Transforms/InstCombine/store.ll b/test/Transforms/InstCombine/store.ll index 164ba763268..9b666b9dcb6 100644 --- a/test/Transforms/InstCombine/store.ll +++ b/test/Transforms/InstCombine/store.ll @@ -5,7 +5,7 @@ define void @test1(i32* %P) { store i32 123, i32* undef store i32 124, i32* null ret void -; CHECK: @test1( +; CHECK-LABEL: @test1( ; CHECK-NEXT: store i32 123, i32* undef ; CHECK-NEXT: store i32 undef, i32* null ; CHECK-NEXT: ret void @@ -16,7 +16,7 @@ define void @test2(i32* %P) { %Y = add i32 %X, 0 ; [#uses=1] store i32 %Y, i32* %P ret void -; CHECK: @test2 +; CHECK-LABEL: @test2( ; CHECK-NEXT: ret void } @@ -38,7 +38,7 @@ Cond2: Cont: %V = load i32* %A ret i32 %V -; CHECK: @test3 +; CHECK-LABEL: @test3( ; CHECK-NOT: alloca ; CHECK: Cont: ; CHECK-NEXT: %storemerge = phi i32 [ 47, %Cond2 ], [ -987654321, %Cond ] @@ -58,7 +58,7 @@ Cond: Cont: %V = load i32* %A ret i32 %V -; CHECK: @test4 +; CHECK-LABEL: @test4( ; CHECK-NOT: alloca ; CHECK: Cont: ; CHECK-NEXT: %storemerge = phi i32 [ -987654321, %Cond ], [ 47, %0 ] @@ -76,7 +76,7 @@ Cond: Cont: ret void -; CHECK: @test5 +; CHECK-LABEL: @test5( ; CHECK: Cont: ; CHECK-NEXT: %storemerge = phi i32 ; CHECK-NEXT: store i32 %storemerge, i32* %P, align 1 @@ -107,7 +107,7 @@ for.body: ; preds = %for.cond for.end: ; preds = %for.cond ret void -; CHECK: @test6 +; CHECK-LABEL: @test6( ; CHECK: for.cond: ; CHECK-NEXT: phi i32 [ 42 ; CHECK-NEXT: store i32 %storemerge, i32* %gi, align 4, !tbaa !0 diff --git a/test/Transforms/InstCombine/stpcpy-1.ll b/test/Transforms/InstCombine/stpcpy-1.ll index 8b6bb0e0d50..b918c9e9e89 100644 --- a/test/Transforms/InstCombine/stpcpy-1.ll +++ b/test/Transforms/InstCombine/stpcpy-1.ll @@ -12,7 +12,7 @@ target datalayout = "e-p:32:32:32-i1:8:8-i8:8:8-i16:16:16-i32:32:32-i64:32:64-f3 declare i8* @stpcpy(i8*, i8*) define i8* @test_simplify1() { -; CHECK: @test_simplify1 +; CHECK-LABEL: @test_simplify1( %dst = getelementptr [32 x i8]* @a, i32 0, i32 0 %src = getelementptr [6 x i8]* @hello, i32 0, i32 0 @@ -24,7 +24,7 @@ define i8* @test_simplify1() { } define i8* @test_simplify2() { -; CHECK: @test_simplify2 +; CHECK-LABEL: @test_simplify2( %dst = getelementptr [32 x i8]* @a, i32 0, i32 0 @@ -35,7 +35,7 @@ define i8* @test_simplify2() { } define i8* @test_no_simplify1() { -; CHECK: @test_no_simplify1 +; CHECK-LABEL: @test_no_simplify1( %dst = getelementptr [32 x i8]* @a, i32 0, i32 0 %src = getelementptr [32 x i8]* @b, i32 0, i32 0 diff --git a/test/Transforms/InstCombine/stpcpy-2.ll b/test/Transforms/InstCombine/stpcpy-2.ll index 2e92c0895ed..6a0f7530d5a 100644 --- a/test/Transforms/InstCombine/stpcpy-2.ll +++ b/test/Transforms/InstCombine/stpcpy-2.ll @@ -11,7 +11,7 @@ target datalayout = "e-p:32:32:32-i1:8:8-i8:8:8-i16:16:16-i32:32:32-i64:32:64-f3 declare i16* @stpcpy(i8*, i8*) define void @test_no_simplify1() { -; CHECK: @test_no_simplify1 +; CHECK-LABEL: @test_no_simplify1( %dst = getelementptr [32 x i8]* @a, i32 0, i32 0 %src = getelementptr [6 x i8]* @hello, i32 0, i32 0 diff --git a/test/Transforms/InstCombine/stpcpy_chk-1.ll b/test/Transforms/InstCombine/stpcpy_chk-1.ll index 05603918c64..a6d5585bbb0 100644 --- a/test/Transforms/InstCombine/stpcpy_chk-1.ll +++ b/test/Transforms/InstCombine/stpcpy_chk-1.ll @@ -12,7 +12,7 @@ target datalayout = "e-p:32:32:32-i1:8:8-i8:8:8-i16:16:16-i32:32:32-i64:32:64-f3 ; Check cases where slen >= strlen (src). define void @test_simplify1() { -; CHECK: @test_simplify1 +; CHECK-LABEL: @test_simplify1( %dst = getelementptr inbounds [60 x i8]* @a, i32 0, i32 0 %src = getelementptr inbounds [12 x i8]* @.str, i32 0, i32 0 @@ -22,7 +22,7 @@ define void @test_simplify1() { } define void @test_simplify2() { -; CHECK: @test_simplify2 +; CHECK-LABEL: @test_simplify2( %dst = getelementptr inbounds [60 x i8]* @a, i32 0, i32 0 %src = getelementptr inbounds [12 x i8]* @.str, i32 0, i32 0 @@ -32,7 +32,7 @@ define void @test_simplify2() { } define void @test_simplify3() { -; CHECK: @test_simplify3 +; CHECK-LABEL: @test_simplify3( %dst = getelementptr inbounds [60 x i8]* @a, i32 0, i32 0 %src = getelementptr inbounds [12 x i8]* @.str, i32 0, i32 0 @@ -44,7 +44,7 @@ define void @test_simplify3() { ; Check cases where there are no string constants. define void @test_simplify4() { -; CHECK: @test_simplify4 +; CHECK-LABEL: @test_simplify4( %dst = getelementptr inbounds [60 x i8]* @a, i32 0, i32 0 %src = getelementptr inbounds [60 x i8]* @b, i32 0, i32 0 @@ -56,7 +56,7 @@ define void @test_simplify4() { ; Check case where the string length is not constant. define i8* @test_simplify5() { -; CHECK: @test_simplify5 +; CHECK-LABEL: @test_simplify5( %dst = getelementptr inbounds [60 x i8]* @a, i32 0, i32 0 %src = getelementptr inbounds [12 x i8]* @.str, i32 0, i32 0 @@ -70,7 +70,7 @@ define i8* @test_simplify5() { ; Check case where the source and destination are the same. define i8* @test_simplify6() { -; CHECK: @test_simplify6 +; CHECK-LABEL: @test_simplify6( %dst = getelementptr inbounds [60 x i8]* @a, i32 0, i32 0 ; CHECK: [[LEN:%[a-z]+]] = call i32 @strlen @@ -83,7 +83,7 @@ define i8* @test_simplify6() { ; Check case where slen < strlen (src). define void @test_no_simplify1() { -; CHECK: @test_no_simplify1 +; CHECK-LABEL: @test_no_simplify1( %dst = getelementptr inbounds [60 x i8]* @a, i32 0, i32 0 %src = getelementptr inbounds [60 x i8]* @b, i32 0, i32 0 diff --git a/test/Transforms/InstCombine/stpcpy_chk-2.ll b/test/Transforms/InstCombine/stpcpy_chk-2.ll index 46c2139276e..b503da9c191 100644 --- a/test/Transforms/InstCombine/stpcpy_chk-2.ll +++ b/test/Transforms/InstCombine/stpcpy_chk-2.ll @@ -9,7 +9,7 @@ target datalayout = "e-p:32:32:32-i1:8:8-i8:8:8-i16:16:16-i32:32:32-i64:32:64-f3 @.str = private constant [8 x i8] c"abcdefg\00" define void @test_no_simplify() { -; CHECK: @test_no_simplify +; CHECK-LABEL: @test_no_simplify( %dst = getelementptr inbounds [60 x i16]* @a, i32 0, i32 0 %src = getelementptr inbounds [8 x i8]* @.str, i32 0, i32 0 diff --git a/test/Transforms/InstCombine/strcat-1.ll b/test/Transforms/InstCombine/strcat-1.ll index 3c05d6b06fa..131ad483483 100644 --- a/test/Transforms/InstCombine/strcat-1.ll +++ b/test/Transforms/InstCombine/strcat-1.ll @@ -13,7 +13,7 @@ declare i8* @strcat(i8*, i8*) declare i32 @puts(i8*) define i32 @main() { -; CHECK: @main +; CHECK-LABEL: @main( ; CHECK-NOT: call i8* @strcat ; CHECK: call i32 @puts diff --git a/test/Transforms/InstCombine/strcat-2.ll b/test/Transforms/InstCombine/strcat-2.ll index 379ee749531..48f82670c32 100644 --- a/test/Transforms/InstCombine/strcat-2.ll +++ b/test/Transforms/InstCombine/strcat-2.ll @@ -11,7 +11,7 @@ target datalayout = "e-p:32:32:32-i1:8:8-i8:8:8-i16:16:16-i32:32:32-i64:32:64-f3 declare i8* @strcat(i8*, i8*) define void @test_simplify1() { -; CHECK: @test_simplify1 +; CHECK-LABEL: @test_simplify1( ; CHECK-NOT: call i8* @strcat ; CHECK: ret void @@ -22,7 +22,7 @@ define void @test_simplify1() { } define void @test_simplify2() { -; CHECK: @test_simplify2 +; CHECK-LABEL: @test_simplify2( ; CHECK-NEXT: ret void %dst = getelementptr [32 x i8]* @a, i32 0, i32 0 diff --git a/test/Transforms/InstCombine/strcat-3.ll b/test/Transforms/InstCombine/strcat-3.ll index 15aff2f1aa2..e3396df73d3 100644 --- a/test/Transforms/InstCombine/strcat-3.ll +++ b/test/Transforms/InstCombine/strcat-3.ll @@ -11,7 +11,7 @@ target datalayout = "e-p:32:32:32-i1:8:8-i8:8:8-i16:16:16-i32:32:32-i64:32:64-f3 declare i16* @strcat(i8*, i8*) define void @test_nosimplify1() { -; CHECK: @test_nosimplify1 +; CHECK-LABEL: @test_nosimplify1( ; CHECK: call i16* @strcat ; CHECK: ret void diff --git a/test/Transforms/InstCombine/strcmp-1.ll b/test/Transforms/InstCombine/strcmp-1.ll index 0679246e091..fc58ffcb8cb 100644 --- a/test/Transforms/InstCombine/strcmp-1.ll +++ b/test/Transforms/InstCombine/strcmp-1.ll @@ -12,7 +12,7 @@ declare i32 @strcmp(i8*, i8*) ; strcmp("", x) -> -*x define i32 @test1(i8* %str2) { -; CHECK: @test1 +; CHECK-LABEL: @test1( ; CHECK: %strcmpload = load i8* %str ; CHECK: %1 = zext i8 %strcmpload to i32 ; CHECK: %2 = sub i32 0, %1 @@ -26,7 +26,7 @@ define i32 @test1(i8* %str2) { ; strcmp(x, "") -> *x define i32 @test2(i8* %str1) { -; CHECK: @test2 +; CHECK-LABEL: @test2( ; CHECK: %strcmpload = load i8* %str ; CHECK: %1 = zext i8 %strcmpload to i32 ; CHECK: ret i32 %1 @@ -38,7 +38,7 @@ define i32 @test2(i8* %str1) { ; strcmp(x, y) -> cnst define i32 @test3() { -; CHECK: @test3 +; CHECK-LABEL: @test3( ; CHECK: ret i32 -1 %str1 = getelementptr inbounds [5 x i8]* @hell, i32 0, i32 0 @@ -48,7 +48,7 @@ define i32 @test3() { } define i32 @test4() { -; CHECK: @test4 +; CHECK-LABEL: @test4( ; CHECK: ret i32 1 %str1 = getelementptr inbounds [5 x i8]* @hell, i32 0, i32 0 @@ -60,7 +60,7 @@ define i32 @test4() { ; strcmp(x, y) -> memcmp(x, y, ) ; (This transform is rather difficult to trigger in a useful manner) define i32 @test5(i1 %b) { -; CHECK: @test5 +; CHECK-LABEL: @test5( ; CHECK: %memcmp = call i32 @memcmp(i8* getelementptr inbounds ([6 x i8]* @hello, i32 0, i32 0), i8* %str2, i32 5) ; CHECK: ret i32 %memcmp @@ -74,7 +74,7 @@ define i32 @test5(i1 %b) { ; strcmp(x,x) -> 0 define i32 @test6(i8* %str) { -; CHECK: @test6 +; CHECK-LABEL: @test6( ; CHECK: ret i32 0 %temp1 = call i32 @strcmp(i8* %str, i8* %str) diff --git a/test/Transforms/InstCombine/strcmp-2.ll b/test/Transforms/InstCombine/strcmp-2.ll index 20518960f30..f0ef5165227 100644 --- a/test/Transforms/InstCombine/strcmp-2.ll +++ b/test/Transforms/InstCombine/strcmp-2.ll @@ -9,7 +9,7 @@ target datalayout = "e-p:32:32:32-i1:8:8-i8:8:8-i16:16:16-i32:32:32-i64:32:64-f3 declare i16 @strcmp(i8*, i8*) define i16 @test_nosimplify() { -; CHECK: @test_nosimplify +; CHECK-LABEL: @test_nosimplify( ; CHECK: call i16 @strcmp ; CHECK: ret i16 %temp1 diff --git a/test/Transforms/InstCombine/strcpy-1.ll b/test/Transforms/InstCombine/strcpy-1.ll index b6cf048b2a8..7c253f6f9fc 100644 --- a/test/Transforms/InstCombine/strcpy-1.ll +++ b/test/Transforms/InstCombine/strcpy-1.ll @@ -13,7 +13,7 @@ target datalayout = "e-p:32:32:32-i1:8:8-i8:8:8-i16:16:16-i32:32:32-i64:32:64-f3 declare i8* @strcpy(i8*, i8*) define void @test_simplify1() { -; CHECK: @test_simplify1 +; CHECK-LABEL: @test_simplify1( %dst = getelementptr [32 x i8]* @a, i32 0, i32 0 %src = getelementptr [6 x i8]* @hello, i32 0, i32 0 @@ -24,7 +24,7 @@ define void @test_simplify1() { } define i8* @test_simplify2() { -; CHECK: @test_simplify2 +; CHECK-LABEL: @test_simplify2( %dst = getelementptr [32 x i8]* @a, i32 0, i32 0 @@ -34,7 +34,7 @@ define i8* @test_simplify2() { } define i8* @test_no_simplify1() { -; CHECK: @test_no_simplify1 +; CHECK-LABEL: @test_no_simplify1( %dst = getelementptr [32 x i8]* @a, i32 0, i32 0 %src = getelementptr [32 x i8]* @b, i32 0, i32 0 diff --git a/test/Transforms/InstCombine/strcpy-2.ll b/test/Transforms/InstCombine/strcpy-2.ll index 779e9fdd959..bad392d7c64 100644 --- a/test/Transforms/InstCombine/strcpy-2.ll +++ b/test/Transforms/InstCombine/strcpy-2.ll @@ -11,7 +11,7 @@ target datalayout = "e-p:32:32:32-i1:8:8-i8:8:8-i16:16:16-i32:32:32-i64:32:64-f3 declare i16* @strcpy(i8*, i8*) define void @test_no_simplify1() { -; CHECK: @test_no_simplify1 +; CHECK-LABEL: @test_no_simplify1( %dst = getelementptr [32 x i8]* @a, i32 0, i32 0 %src = getelementptr [6 x i8]* @hello, i32 0, i32 0 diff --git a/test/Transforms/InstCombine/strcpy_chk-1.ll b/test/Transforms/InstCombine/strcpy_chk-1.ll index 3e48f4fd305..5b98cf86881 100644 --- a/test/Transforms/InstCombine/strcpy_chk-1.ll +++ b/test/Transforms/InstCombine/strcpy_chk-1.ll @@ -12,7 +12,7 @@ target datalayout = "e-p:32:32:32-i1:8:8-i8:8:8-i16:16:16-i32:32:32-i64:32:64-f3 ; Check cases where slen >= strlen (src). define void @test_simplify1() { -; CHECK: @test_simplify1 +; CHECK-LABEL: @test_simplify1( %dst = getelementptr inbounds [60 x i8]* @a, i32 0, i32 0 %src = getelementptr inbounds [12 x i8]* @.str, i32 0, i32 0 @@ -22,7 +22,7 @@ define void @test_simplify1() { } define void @test_simplify2() { -; CHECK: @test_simplify2 +; CHECK-LABEL: @test_simplify2( %dst = getelementptr inbounds [60 x i8]* @a, i32 0, i32 0 %src = getelementptr inbounds [12 x i8]* @.str, i32 0, i32 0 @@ -32,7 +32,7 @@ define void @test_simplify2() { } define void @test_simplify3() { -; CHECK: @test_simplify3 +; CHECK-LABEL: @test_simplify3( %dst = getelementptr inbounds [60 x i8]* @a, i32 0, i32 0 %src = getelementptr inbounds [12 x i8]* @.str, i32 0, i32 0 @@ -44,7 +44,7 @@ define void @test_simplify3() { ; Check cases where there are no string constants. define void @test_simplify4() { -; CHECK: @test_simplify4 +; CHECK-LABEL: @test_simplify4( %dst = getelementptr inbounds [60 x i8]* @a, i32 0, i32 0 %src = getelementptr inbounds [60 x i8]* @b, i32 0, i32 0 @@ -56,7 +56,7 @@ define void @test_simplify4() { ; Check case where the string length is not constant. define void @test_simplify5() { -; CHECK: @test_simplify5 +; CHECK-LABEL: @test_simplify5( %dst = getelementptr inbounds [60 x i8]* @a, i32 0, i32 0 %src = getelementptr inbounds [12 x i8]* @.str, i32 0, i32 0 @@ -69,7 +69,7 @@ define void @test_simplify5() { ; Check case where the source and destination are the same. define i8* @test_simplify6() { -; CHECK: @test_simplify6 +; CHECK-LABEL: @test_simplify6( %dst = getelementptr inbounds [60 x i8]* @a, i32 0, i32 0 ; CHECK: getelementptr inbounds ([60 x i8]* @a, i32 0, i32 0) @@ -81,7 +81,7 @@ define i8* @test_simplify6() { ; Check case where slen < strlen (src). define void @test_no_simplify1() { -; CHECK: @test_no_simplify1 +; CHECK-LABEL: @test_no_simplify1( %dst = getelementptr inbounds [60 x i8]* @a, i32 0, i32 0 %src = getelementptr inbounds [60 x i8]* @b, i32 0, i32 0 diff --git a/test/Transforms/InstCombine/strcpy_chk-2.ll b/test/Transforms/InstCombine/strcpy_chk-2.ll index d76ea5d068b..1eff5a822e7 100644 --- a/test/Transforms/InstCombine/strcpy_chk-2.ll +++ b/test/Transforms/InstCombine/strcpy_chk-2.ll @@ -9,7 +9,7 @@ target datalayout = "e-p:32:32:32-i1:8:8-i8:8:8-i16:16:16-i32:32:32-i64:32:64-f3 @.str = private constant [8 x i8] c"abcdefg\00" define void @test_no_simplify() { -; CHECK: @test_no_simplify +; CHECK-LABEL: @test_no_simplify( %dst = getelementptr inbounds [60 x i16]* @a, i32 0, i32 0 %src = getelementptr inbounds [8 x i8]* @.str, i32 0, i32 0 diff --git a/test/Transforms/InstCombine/strcpy_chk-64.ll b/test/Transforms/InstCombine/strcpy_chk-64.ll index 036fcbe6de1..31447d9569e 100644 --- a/test/Transforms/InstCombine/strcpy_chk-64.ll +++ b/test/Transforms/InstCombine/strcpy_chk-64.ll @@ -3,7 +3,7 @@ target datalayout = "e-p:64:64:64-i1:8:8-i8:8:8-i16:16:16-i32:32:32-i64:64:64-f3 target triple = "x86_64-apple-darwin10.0.0" define void @func(i8* %i) nounwind ssp { -; CHECK: @func +; CHECK-LABEL: @func( ; CHECK: @__strcpy_chk(i8* %arraydecay, i8* %i, i64 32) entry: %s = alloca [32 x i8], align 16 diff --git a/test/Transforms/InstCombine/strcspn-1.ll b/test/Transforms/InstCombine/strcspn-1.ll index 60fad897b2c..b3b52b5025a 100644 --- a/test/Transforms/InstCombine/strcspn-1.ll +++ b/test/Transforms/InstCombine/strcspn-1.ll @@ -13,7 +13,7 @@ declare i64 @strcspn(i8*, i8*) ; Check strcspn(s, "") -> strlen(s). define i64 @test_simplify1(i8* %str) { -; CHECK: @test_simplify1 +; CHECK-LABEL: @test_simplify1( %pat = getelementptr [1 x i8]* @null, i32 0, i32 0 %ret = call i64 @strcspn(i8* %str, i8* %pat) @@ -25,7 +25,7 @@ define i64 @test_simplify1(i8* %str) { ; Check strcspn("", s) -> 0. define i64 @test_simplify2(i8* %pat) { -; CHECK: @test_simplify2 +; CHECK-LABEL: @test_simplify2( %str = getelementptr [1 x i8]* @null, i32 0, i32 0 %ret = call i64 @strcspn(i8* %str, i8* %pat) @@ -36,7 +36,7 @@ define i64 @test_simplify2(i8* %pat) { ; Check strcspn(s1, s2), where s1 and s2 are constants. define i64 @test_simplify3() { -; CHECK: @test_simplify3 +; CHECK-LABEL: @test_simplify3( %str = getelementptr [6 x i8]* @abcba, i32 0, i32 0 %pat = getelementptr [4 x i8]* @abc, i32 0, i32 0 @@ -48,7 +48,7 @@ define i64 @test_simplify3() { ; Check cases that shouldn't be simplified. define i64 @test_no_simplify1(i8* %str, i8* %pat) { -; CHECK: @test_no_simplify1 +; CHECK-LABEL: @test_no_simplify1( %ret = call i64 @strcspn(i8* %str, i8* %pat) ; CHECK-NEXT: %ret = call i64 @strcspn(i8* %str, i8* %pat) diff --git a/test/Transforms/InstCombine/strcspn-2.ll b/test/Transforms/InstCombine/strcspn-2.ll index 4e2393686c7..ecfa27d3b6b 100644 --- a/test/Transforms/InstCombine/strcspn-2.ll +++ b/test/Transforms/InstCombine/strcspn-2.ll @@ -11,7 +11,7 @@ declare double @strcspn(i8*, i8*) ; Check that strcspn functions with the wrong prototype aren't simplified. define double @test_no_simplify1(i8* %pat) { -; CHECK: @test_no_simplify1 +; CHECK-LABEL: @test_no_simplify1( %str = getelementptr [1 x i8]* @null, i32 0, i32 0 %ret = call double @strcspn(i8* %str, i8* %pat) diff --git a/test/Transforms/InstCombine/strlen-1.ll b/test/Transforms/InstCombine/strlen-1.ll index 6d7464a4cc8..4fa5b4fdb62 100644 --- a/test/Transforms/InstCombine/strlen-1.ll +++ b/test/Transforms/InstCombine/strlen-1.ll @@ -15,7 +15,7 @@ declare i32 @strlen(i8*) ; Check strlen(string constant) -> integer constant. define i32 @test_simplify1() { -; CHECK: @test_simplify1 +; CHECK-LABEL: @test_simplify1( %hello_p = getelementptr [6 x i8]* @hello, i32 0, i32 0 %hello_l = call i32 @strlen(i8* %hello_p) ret i32 %hello_l @@ -23,7 +23,7 @@ define i32 @test_simplify1() { } define i32 @test_simplify2() { -; CHECK: @test_simplify2 +; CHECK-LABEL: @test_simplify2( %null_p = getelementptr [1 x i8]* @null, i32 0, i32 0 %null_l = call i32 @strlen(i8* %null_p) ret i32 %null_l @@ -31,7 +31,7 @@ define i32 @test_simplify2() { } define i32 @test_simplify3() { -; CHECK: @test_simplify3 +; CHECK-LABEL: @test_simplify3( %null_hello_p = getelementptr [7 x i8]* @null_hello, i32 0, i32 0 %null_hello_l = call i32 @strlen(i8* %null_hello_p) ret i32 %null_hello_l @@ -39,7 +39,7 @@ define i32 @test_simplify3() { } define i32 @test_simplify4() { -; CHECK: @test_simplify4 +; CHECK-LABEL: @test_simplify4( %len = tail call i32 @strlen(i8* @nullstring) nounwind ret i32 %len ; CHECK-NEXT: ret i32 0 @@ -48,7 +48,7 @@ define i32 @test_simplify4() { ; Check strlen(x) == 0 --> *x == 0. define i1 @test_simplify5() { -; CHECK: @test_simplify5 +; CHECK-LABEL: @test_simplify5( %hello_p = getelementptr [6 x i8]* @hello, i32 0, i32 0 %hello_l = call i32 @strlen(i8* %hello_p) %eq_hello = icmp eq i32 %hello_l, 0 @@ -57,7 +57,7 @@ define i1 @test_simplify5() { } define i1 @test_simplify6() { -; CHECK: @test_simplify6 +; CHECK-LABEL: @test_simplify6( %null_p = getelementptr [1 x i8]* @null, i32 0, i32 0 %null_l = call i32 @strlen(i8* %null_p) %eq_null = icmp eq i32 %null_l, 0 @@ -68,7 +68,7 @@ define i1 @test_simplify6() { ; Check strlen(x) != 0 --> *x != 0. define i1 @test_simplify7() { -; CHECK: @test_simplify7 +; CHECK-LABEL: @test_simplify7( %hello_p = getelementptr [6 x i8]* @hello, i32 0, i32 0 %hello_l = call i32 @strlen(i8* %hello_p) %ne_hello = icmp ne i32 %hello_l, 0 @@ -77,7 +77,7 @@ define i1 @test_simplify7() { } define i1 @test_simplify8() { -; CHECK: @test_simplify8 +; CHECK-LABEL: @test_simplify8( %null_p = getelementptr [1 x i8]* @null, i32 0, i32 0 %null_l = call i32 @strlen(i8* %null_p) %ne_null = icmp ne i32 %null_l, 0 @@ -88,7 +88,7 @@ define i1 @test_simplify8() { ; Check cases that shouldn't be simplified. define i32 @test_no_simplify1() { -; CHECK: @test_no_simplify1 +; CHECK-LABEL: @test_no_simplify1( %a_p = getelementptr [32 x i8]* @a, i32 0, i32 0 %a_l = call i32 @strlen(i8* %a_p) ; CHECK-NEXT: %a_l = call i32 @strlen diff --git a/test/Transforms/InstCombine/strlen-2.ll b/test/Transforms/InstCombine/strlen-2.ll index c4fd54c06db..6652a310ba6 100644 --- a/test/Transforms/InstCombine/strlen-2.ll +++ b/test/Transforms/InstCombine/strlen-2.ll @@ -9,7 +9,7 @@ target datalayout = "e-p:32:32:32-i1:8:8-i8:8:8-i16:16:16-i32:32:32-i64:32:64-f3 declare i32 @strlen(i8*, i32) define i32 @test_no_simplify1() { -; CHECK: @test_no_simplify1 +; CHECK-LABEL: @test_no_simplify1( %hello_p = getelementptr [6 x i8]* @hello, i32 0, i32 0 %hello_l = call i32 @strlen(i8* %hello_p, i32 187) ; CHECK-NEXT: %hello_l = call i32 @strlen diff --git a/test/Transforms/InstCombine/strncat-1.ll b/test/Transforms/InstCombine/strncat-1.ll index ad2a18b1465..8eae3dae2e2 100644 --- a/test/Transforms/InstCombine/strncat-1.ll +++ b/test/Transforms/InstCombine/strncat-1.ll @@ -12,7 +12,7 @@ declare i8* @strncat(i8*, i8*, i32) declare i32 @puts(i8*) define i32 @main() { -; CHECK: @main +; CHECK-LABEL: @main( ; CHECK-NOT: call i8* @strncat ; CHECK: call i32 @puts diff --git a/test/Transforms/InstCombine/strncat-2.ll b/test/Transforms/InstCombine/strncat-2.ll index c56deacd39b..b09fa1260a0 100644 --- a/test/Transforms/InstCombine/strncat-2.ll +++ b/test/Transforms/InstCombine/strncat-2.ll @@ -11,7 +11,7 @@ target datalayout = "e-p:32:32:32-i1:8:8-i8:8:8-i16:16:16-i32:32:32-i64:32:64-f3 declare i8* @strncat(i8*, i8*, i32) define void @test_simplify1() { -; CHECK: @test_simplify1 +; CHECK-LABEL: @test_simplify1( ; CHECK-NOT: call i8* @strncat ; CHECK: ret void @@ -22,7 +22,7 @@ define void @test_simplify1() { } define void @test_simplify2() { -; CHECK: @test_simplify2 +; CHECK-LABEL: @test_simplify2( ; CHECK-NEXT: ret void %dst = getelementptr [32 x i8]* @a, i32 0, i32 0 @@ -32,7 +32,7 @@ define void @test_simplify2() { } define void @test_simplify3() { -; CHECK: @test_simplify3 +; CHECK-LABEL: @test_simplify3( ; CHECK-NEXT: ret void %dst = getelementptr [32 x i8]* @a, i32 0, i32 0 @@ -42,7 +42,7 @@ define void @test_simplify3() { } define void @test_nosimplify1() { -; CHECK: @test_nosimplify1 +; CHECK-LABEL: @test_nosimplify1( ; CHECK: call i8* @strncat ; CHECK: ret void diff --git a/test/Transforms/InstCombine/strncat-3.ll b/test/Transforms/InstCombine/strncat-3.ll index 3cd79716870..1b25b4aca1a 100644 --- a/test/Transforms/InstCombine/strncat-3.ll +++ b/test/Transforms/InstCombine/strncat-3.ll @@ -11,7 +11,7 @@ target datalayout = "e-p:32:32:32-i1:8:8-i8:8:8-i16:16:16-i32:32:32-i64:32:64-f3 declare i16* @strncat(i8*, i8*, i32) define void @test_nosimplify1() { -; CHECK: @test_nosimplify1 +; CHECK-LABEL: @test_nosimplify1( ; CHECK: call i16* @strncat ; CHECK: ret void diff --git a/test/Transforms/InstCombine/strncmp-1.ll b/test/Transforms/InstCombine/strncmp-1.ll index 187c2fa50e8..df30dd10044 100644 --- a/test/Transforms/InstCombine/strncmp-1.ll +++ b/test/Transforms/InstCombine/strncmp-1.ll @@ -12,7 +12,7 @@ declare i32 @strncmp(i8*, i8*, i32) ; strncmp("", x, n) -> -*x define i32 @test1(i8* %str2) { -; CHECK: @test1 +; CHECK-LABEL: @test1( ; CHECK: %strcmpload = load i8* %str ; CHECK: %1 = zext i8 %strcmpload to i32 ; CHECK: %2 = sub i32 0, %1 @@ -25,7 +25,7 @@ define i32 @test1(i8* %str2) { ; strncmp(x, "", n) -> *x define i32 @test2(i8* %str1) { -; CHECK: @test2 +; CHECK-LABEL: @test2( ; CHECK: %strcmpload = load i8* %str1 ; CHECK: %1 = zext i8 %strcmpload to i32 ; CHECK: ret i32 %1 @@ -37,7 +37,7 @@ define i32 @test2(i8* %str1) { ; strncmp(x, y, n) -> cnst define i32 @test3() { -; CHECK: @test3 +; CHECK-LABEL: @test3( ; CHECK: ret i32 -1 %str1 = getelementptr inbounds [5 x i8]* @hell, i32 0, i32 0 @@ -47,7 +47,7 @@ define i32 @test3() { } define i32 @test4() { -; CHECK: @test4 +; CHECK-LABEL: @test4( ; CHECK: ret i32 1 %str1 = getelementptr inbounds [5 x i8]* @hell, i32 0, i32 0 @@ -57,7 +57,7 @@ define i32 @test4() { } define i32 @test5() { -; CHECK: @test5 +; CHECK-LABEL: @test5( ; CHECK: ret i32 0 %str1 = getelementptr inbounds [5 x i8]* @hell, i32 0, i32 0 @@ -68,7 +68,7 @@ define i32 @test5() { ; strncmp(x,y,1) -> memcmp(x,y,1) define i32 @test6(i8* %str1, i8* %str2) { -; CHECK: @test6 +; CHECK-LABEL: @test6( ; CHECK: [[LOAD1:%[a-z]+]] = load i8* %str1, align 1 ; CHECK: [[ZEXT1:%[a-z]+]] = zext i8 [[LOAD1]] to i32 ; CHECK: [[LOAD2:%[a-z]+]] = load i8* %str2, align 1 @@ -82,7 +82,7 @@ define i32 @test6(i8* %str1, i8* %str2) { ; strncmp(x,y,0) -> 0 define i32 @test7(i8* %str1, i8* %str2) { -; CHECK: @test7 +; CHECK-LABEL: @test7( ; CHECK: ret i32 0 %temp1 = call i32 @strncmp(i8* %str1, i8* %str2, i32 0) @@ -91,7 +91,7 @@ define i32 @test7(i8* %str1, i8* %str2) { ; strncmp(x,x,n) -> 0 define i32 @test8(i8* %str, i32 %n) { -; CHECK: @test8 +; CHECK-LABEL: @test8( ; CHECK: ret i32 0 %temp1 = call i32 @strncmp(i8* %str, i8* %str, i32 %n) diff --git a/test/Transforms/InstCombine/strncmp-2.ll b/test/Transforms/InstCombine/strncmp-2.ll index 3fc43a6fd4f..16ad8a4f62a 100644 --- a/test/Transforms/InstCombine/strncmp-2.ll +++ b/test/Transforms/InstCombine/strncmp-2.ll @@ -9,7 +9,7 @@ target datalayout = "e-p:32:32:32-i1:8:8-i8:8:8-i16:16:16-i32:32:32-i64:32:64-f3 declare i16 @strncmp(i8*, i8*, i32) define i16 @test_nosimplify() { -; CHECK: @test_nosimplify +; CHECK-LABEL: @test_nosimplify( ; CHECK: call i16 @strncmp ; CHECK: ret i16 %temp1 diff --git a/test/Transforms/InstCombine/strncpy-1.ll b/test/Transforms/InstCombine/strncpy-1.ll index 3ce2b9b5eec..c70197f12e2 100644 --- a/test/Transforms/InstCombine/strncpy-1.ll +++ b/test/Transforms/InstCombine/strncpy-1.ll @@ -16,7 +16,7 @@ declare i32 @puts(i8*) ; Check a bunch of strncpy invocations together. define i32 @test_simplify1() { -; CHECK: @test_simplify1 +; CHECK-LABEL: @test_simplify1( ; CHECK-NOT: call i8* @strncpy ; CHECK: call i32 @puts %target = alloca [1024 x i8] @@ -39,7 +39,7 @@ define i32 @test_simplify1() { ; Check strncpy(x, "", y) -> memset(x, '\0', y, 1). define void @test_simplify2() { -; CHECK: @test_simplify2 +; CHECK-LABEL: @test_simplify2( %dst = getelementptr [32 x i8]* @a, i32 0, i32 0 %src = getelementptr [1 x i8]* @null, i32 0, i32 0 @@ -51,7 +51,7 @@ define void @test_simplify2() { ; Check strncpy(x, y, 0) -> x. define i8* @test_simplify3() { -; CHECK: @test_simplify3 +; CHECK-LABEL: @test_simplify3( %dst = getelementptr [32 x i8]* @a, i32 0, i32 0 %src = getelementptr [6 x i8]* @hello, i32 0, i32 0 @@ -63,7 +63,7 @@ define i8* @test_simplify3() { ; Check strncpy(x, s, c) -> memcpy(x, s, c, 1) [s and c are constant]. define void @test_simplify4() { -; CHECK: @test_simplify4 +; CHECK-LABEL: @test_simplify4( %dst = getelementptr [32 x i8]* @a, i32 0, i32 0 %src = getelementptr [6 x i8]* @hello, i32 0, i32 0 @@ -75,7 +75,7 @@ define void @test_simplify4() { ; Check cases that shouldn't be simplified. define void @test_no_simplify1() { -; CHECK: @test_no_simplify1 +; CHECK-LABEL: @test_no_simplify1( %dst = getelementptr [32 x i8]* @a, i32 0, i32 0 %src = getelementptr [32 x i8]* @b, i32 0, i32 0 @@ -85,7 +85,7 @@ define void @test_no_simplify1() { } define void @test_no_simplify2() { -; CHECK: @test_no_simplify2 +; CHECK-LABEL: @test_no_simplify2( %dst = getelementptr [32 x i8]* @a, i32 0, i32 0 %src = getelementptr [6 x i8]* @hello, i32 0, i32 0 diff --git a/test/Transforms/InstCombine/strncpy-2.ll b/test/Transforms/InstCombine/strncpy-2.ll index ac28ea65500..acc2878648f 100644 --- a/test/Transforms/InstCombine/strncpy-2.ll +++ b/test/Transforms/InstCombine/strncpy-2.ll @@ -12,7 +12,7 @@ declare i16* @strncpy(i8*, i8*, i32) ; Check that 'strncpy' functions with the wrong prototype aren't simplified. define void @test_no_simplify1() { -; CHECK: @test_no_simplify1 +; CHECK-LABEL: @test_no_simplify1( %dst = getelementptr [32 x i8]* @a, i32 0, i32 0 %src = getelementptr [6 x i8]* @hello, i32 0, i32 0 diff --git a/test/Transforms/InstCombine/strncpy_chk-1.ll b/test/Transforms/InstCombine/strncpy_chk-1.ll index aadff4268ec..90b4173ced7 100644 --- a/test/Transforms/InstCombine/strncpy_chk-1.ll +++ b/test/Transforms/InstCombine/strncpy_chk-1.ll @@ -12,7 +12,7 @@ target datalayout = "e-p:32:32:32-i1:8:8-i8:8:8-i16:16:16-i32:32:32-i64:32:64-f3 ; Check cases where dstlen >= len define void @test_simplify1() { -; CHECK: @test_simplify1 +; CHECK-LABEL: @test_simplify1( %dst = getelementptr inbounds [60 x i8]* @a, i32 0, i32 0 %src = getelementptr inbounds [12 x i8]* @.str, i32 0, i32 0 @@ -22,7 +22,7 @@ define void @test_simplify1() { } define void @test_simplify2() { -; CHECK: @test_simplify2 +; CHECK-LABEL: @test_simplify2( %dst = getelementptr inbounds [60 x i8]* @a, i32 0, i32 0 %src = getelementptr inbounds [12 x i8]* @.str, i32 0, i32 0 @@ -32,7 +32,7 @@ define void @test_simplify2() { } define void @test_simplify3() { -; CHECK: @test_simplify3 +; CHECK-LABEL: @test_simplify3( %dst = getelementptr inbounds [60 x i8]* @a, i32 0, i32 0 %src = getelementptr inbounds [60 x i8]* @b, i32 0, i32 0 @@ -44,7 +44,7 @@ define void @test_simplify3() { ; Check cases where dstlen < len define void @test_no_simplify1() { -; CHECK: @test_no_simplify1 +; CHECK-LABEL: @test_no_simplify1( %dst = getelementptr inbounds [60 x i8]* @a, i32 0, i32 0 %src = getelementptr inbounds [12 x i8]* @.str, i32 0, i32 0 @@ -54,7 +54,7 @@ define void @test_no_simplify1() { } define void @test_no_simplify2() { -; CHECK: @test_no_simplify2 +; CHECK-LABEL: @test_no_simplify2( %dst = getelementptr inbounds [60 x i8]* @a, i32 0, i32 0 %src = getelementptr inbounds [60 x i8]* @b, i32 0, i32 0 diff --git a/test/Transforms/InstCombine/strncpy_chk-2.ll b/test/Transforms/InstCombine/strncpy_chk-2.ll index a0f132ebf63..829a4798f09 100644 --- a/test/Transforms/InstCombine/strncpy_chk-2.ll +++ b/test/Transforms/InstCombine/strncpy_chk-2.ll @@ -9,7 +9,7 @@ target datalayout = "e-p:32:32:32-i1:8:8-i8:8:8-i16:16:16-i32:32:32-i64:32:64-f3 @b = common global [60 x i16] zeroinitializer, align 1 define void @test_no_simplify() { -; CHECK: @test_no_simplify +; CHECK-LABEL: @test_no_simplify( %dst = getelementptr inbounds [60 x i16]* @a, i32 0, i32 0 %src = getelementptr inbounds [60 x i16]* @b, i32 0, i32 0 diff --git a/test/Transforms/InstCombine/strpbrk-1.ll b/test/Transforms/InstCombine/strpbrk-1.ll index a5d0d86501b..58b2d9e88d2 100644 --- a/test/Transforms/InstCombine/strpbrk-1.ll +++ b/test/Transforms/InstCombine/strpbrk-1.ll @@ -13,7 +13,7 @@ declare i8* @strpbrk(i8*, i8*) ; Check strpbrk(s, "") -> NULL. define i8* @test_simplify1(i8* %str) { -; CHECK: @test_simplify1 +; CHECK-LABEL: @test_simplify1( %pat = getelementptr [1 x i8]* @null, i32 0, i32 0 %ret = call i8* @strpbrk(i8* %str, i8* %pat) @@ -24,7 +24,7 @@ define i8* @test_simplify1(i8* %str) { ; Check strpbrk("", s) -> NULL. define i8* @test_simplify2(i8* %pat) { -; CHECK: @test_simplify2 +; CHECK-LABEL: @test_simplify2( %str = getelementptr [1 x i8]* @null, i32 0, i32 0 %ret = call i8* @strpbrk(i8* %str, i8* %pat) @@ -35,7 +35,7 @@ define i8* @test_simplify2(i8* %pat) { ; Check strpbrk(s1, s2), where s1 and s2 are constants. define i8* @test_simplify3() { -; CHECK: @test_simplify3 +; CHECK-LABEL: @test_simplify3( %str = getelementptr [12 x i8]* @hello, i32 0, i32 0 %pat = getelementptr [2 x i8]* @w, i32 0, i32 0 @@ -47,7 +47,7 @@ define i8* @test_simplify3() { ; Check strpbrk(s, "a") -> strchr(s, 'a'). define i8* @test_simplify4(i8* %str) { -; CHECK: @test_simplify4 +; CHECK-LABEL: @test_simplify4( %pat = getelementptr [2 x i8]* @w, i32 0, i32 0 %ret = call i8* @strpbrk(i8* %str, i8* %pat) @@ -59,7 +59,7 @@ define i8* @test_simplify4(i8* %str) { ; Check cases that shouldn't be simplified. define i8* @test_no_simplify1(i8* %str, i8* %pat) { -; CHECK: @test_no_simplify1 +; CHECK-LABEL: @test_no_simplify1( %ret = call i8* @strpbrk(i8* %str, i8* %pat) ; CHECK-NEXT: %ret = call i8* @strpbrk(i8* %str, i8* %pat) diff --git a/test/Transforms/InstCombine/strpbrk-2.ll b/test/Transforms/InstCombine/strpbrk-2.ll index 31ac2905df2..b797d7a5952 100644 --- a/test/Transforms/InstCombine/strpbrk-2.ll +++ b/test/Transforms/InstCombine/strpbrk-2.ll @@ -12,7 +12,7 @@ declare i16* @strpbrk(i8*, i8*) ; Check that 'strpbrk' functions with the wrong prototype aren't simplified. define i16* @test_no_simplify1() { -; CHECK: @test_no_simplify1 +; CHECK-LABEL: @test_no_simplify1( %str = getelementptr [12 x i8]* @hello, i32 0, i32 0 %pat = getelementptr [2 x i8]* @w, i32 0, i32 0 diff --git a/test/Transforms/InstCombine/strrchr-1.ll b/test/Transforms/InstCombine/strrchr-1.ll index 854ce45bffb..a0bdb229307 100644 --- a/test/Transforms/InstCombine/strrchr-1.ll +++ b/test/Transforms/InstCombine/strrchr-1.ll @@ -43,7 +43,7 @@ define void @test_simplify3() { } define void @test_nosimplify1(i32 %chr) { -; CHECK: @test_nosimplify1 +; CHECK-LABEL: @test_nosimplify1( ; CHECK: call i8* @strrchr ; CHECK: ret void diff --git a/test/Transforms/InstCombine/strspn-1.ll b/test/Transforms/InstCombine/strspn-1.ll index 393f88735bd..ac940cce9e5 100644 --- a/test/Transforms/InstCombine/strspn-1.ll +++ b/test/Transforms/InstCombine/strspn-1.ll @@ -13,7 +13,7 @@ declare i64 @strspn(i8*, i8*) ; Check strspn(s, "") -> 0. define i64 @test_simplify1(i8* %str) { -; CHECK: @test_simplify1 +; CHECK-LABEL: @test_simplify1( %pat = getelementptr [1 x i8]* @null, i32 0, i32 0 %ret = call i64 @strspn(i8* %str, i8* %pat) @@ -24,7 +24,7 @@ define i64 @test_simplify1(i8* %str) { ; Check strspn("", s) -> 0. define i64 @test_simplify2(i8* %pat) { -; CHECK: @test_simplify2 +; CHECK-LABEL: @test_simplify2( %str = getelementptr [1 x i8]* @null, i32 0, i32 0 %ret = call i64 @strspn(i8* %str, i8* %pat) @@ -35,7 +35,7 @@ define i64 @test_simplify2(i8* %pat) { ; Check strspn(s1, s2), where s1 and s2 are constants. define i64 @test_simplify3() { -; CHECK: @test_simplify3 +; CHECK-LABEL: @test_simplify3( %str = getelementptr [6 x i8]* @abcba, i32 0, i32 0 %pat = getelementptr [4 x i8]* @abc, i32 0, i32 0 @@ -47,7 +47,7 @@ define i64 @test_simplify3() { ; Check cases that shouldn't be simplified. define i64 @test_no_simplify1(i8* %str, i8* %pat) { -; CHECK: @test_no_simplify1 +; CHECK-LABEL: @test_no_simplify1( %ret = call i64 @strspn(i8* %str, i8* %pat) ; CHECK-NEXT: %ret = call i64 @strspn(i8* %str, i8* %pat) diff --git a/test/Transforms/InstCombine/strstr-1.ll b/test/Transforms/InstCombine/strstr-1.ll index 81f52718747..a946dd32779 100644 --- a/test/Transforms/InstCombine/strstr-1.ll +++ b/test/Transforms/InstCombine/strstr-1.ll @@ -14,7 +14,7 @@ declare i8* @strstr(i8*, i8*) ; Check strstr(str, "") -> str. define i8* @test_simplify1(i8* %str) { -; CHECK: @test_simplify1 +; CHECK-LABEL: @test_simplify1( %pat = getelementptr inbounds [1 x i8]* @.str, i32 0, i32 0 %ret = call i8* @strstr(i8* %str, i8* %pat) ret i8* %ret @@ -24,7 +24,7 @@ define i8* @test_simplify1(i8* %str) { ; Check strstr(str, "a") -> strchr(str, 'a'). define i8* @test_simplify2(i8* %str) { -; CHECK: @test_simplify2 +; CHECK-LABEL: @test_simplify2( %pat = getelementptr inbounds [2 x i8]* @.str1, i32 0, i32 0 %ret = call i8* @strstr(i8* %str, i8* %pat) ret i8* %ret @@ -34,7 +34,7 @@ define i8* @test_simplify2(i8* %str) { ; Check strstr("abcde", "bcd") -> "abcde" + 1. define i8* @test_simplify3() { -; CHECK: @test_simplify3 +; CHECK-LABEL: @test_simplify3( %str = getelementptr inbounds [6 x i8]* @.str2, i32 0, i32 0 %pat = getelementptr inbounds [4 x i8]* @.str3, i32 0, i32 0 %ret = call i8* @strstr(i8* %str, i8* %pat) @@ -45,7 +45,7 @@ define i8* @test_simplify3() { ; Check strstr(str, str) -> str. define i8* @test_simplify4(i8* %str) { -; CHECK: @test_simplify4 +; CHECK-LABEL: @test_simplify4( %ret = call i8* @strstr(i8* %str, i8* %str) ret i8* %ret ; CHECK-NEXT: ret i8* %str @@ -54,7 +54,7 @@ define i8* @test_simplify4(i8* %str) { ; Check strstr(str, pat) == str -> strncmp(str, pat, strlen(str)) == 0. define i1 @test_simplify5(i8* %str, i8* %pat) { -; CHECK: @test_simplify5 +; CHECK-LABEL: @test_simplify5( %ret = call i8* @strstr(i8* %str, i8* %pat) %cmp = icmp eq i8* %ret, %str ret i1 %cmp diff --git a/test/Transforms/InstCombine/strstr-2.ll b/test/Transforms/InstCombine/strstr-2.ll index 5092f9b4f80..7b28ed0e691 100644 --- a/test/Transforms/InstCombine/strstr-2.ll +++ b/test/Transforms/InstCombine/strstr-2.ll @@ -9,7 +9,7 @@ target datalayout = "e-p:64:64:64-i1:8:8-i8:8:8-i16:16:16-i32:32:32-i64:64:64-f3 declare i8 @strstr(i8*, i8*) define i8 @test_no_simplify1(i8* %str) { -; CHECK: @test_no_simplify1 +; CHECK-LABEL: @test_no_simplify1( %pat = getelementptr inbounds [1 x i8]* @null, i32 0, i32 0 %ret = call i8 @strstr(i8* %str, i8* %pat) ; CHECK-NEXT: call i8 @strstr diff --git a/test/Transforms/InstCombine/strto-1.ll b/test/Transforms/InstCombine/strto-1.ll index dfd772f9d96..fc35dddcae5 100644 --- a/test/Transforms/InstCombine/strto-1.ll +++ b/test/Transforms/InstCombine/strto-1.ll @@ -26,56 +26,56 @@ declare i64 @strtoull(i8* %s, i8** %endptr, i32 %base) ; CHECK: declare i64 @strtoull(i8* readonly, i8** nocapture, i32) define void @test_simplify1(i8* %x, i8** %endptr) { -; CHECK: @test_simplify1 +; CHECK-LABEL: @test_simplify1( call i64 @strtol(i8* %x, i8** null, i32 10) ; CHECK-NEXT: call i64 @strtol(i8* nocapture %x, i8** null, i32 10) ret void } define void @test_simplify2(i8* %x, i8** %endptr) { -; CHECK: @test_simplify2 +; CHECK-LABEL: @test_simplify2( call double @strtod(i8* %x, i8** null, i32 10) ; CHECK-NEXT: call double @strtod(i8* nocapture %x, i8** null, i32 10) ret void } define void @test_simplify3(i8* %x, i8** %endptr) { -; CHECK: @test_simplify3 +; CHECK-LABEL: @test_simplify3( call float @strtof(i8* %x, i8** null, i32 10) ; CHECK-NEXT: call float @strtof(i8* nocapture %x, i8** null, i32 10) ret void } define void @test_simplify4(i8* %x, i8** %endptr) { -; CHECK: @test_simplify4 +; CHECK-LABEL: @test_simplify4( call i64 @strtoul(i8* %x, i8** null, i32 10) ; CHECK-NEXT: call i64 @strtoul(i8* nocapture %x, i8** null, i32 10) ret void } define void @test_simplify5(i8* %x, i8** %endptr) { -; CHECK: @test_simplify5 +; CHECK-LABEL: @test_simplify5( call i64 @strtoll(i8* %x, i8** null, i32 10) ; CHECK-NEXT: call i64 @strtoll(i8* nocapture %x, i8** null, i32 10) ret void } define void @test_simplify6(i8* %x, i8** %endptr) { -; CHECK: @test_simplify6 +; CHECK-LABEL: @test_simplify6( call double @strtold(i8* %x, i8** null) ; CHECK-NEXT: call double @strtold(i8* nocapture %x, i8** null) ret void } define void @test_simplify7(i8* %x, i8** %endptr) { -; CHECK: @test_simplify7 +; CHECK-LABEL: @test_simplify7( call i64 @strtoull(i8* %x, i8** null, i32 10) ; CHECK-NEXT: call i64 @strtoull(i8* nocapture %x, i8** null, i32 10) ret void } define void @test_no_simplify1(i8* %x, i8** %endptr) { -; CHECK: @test_no_simplify1 +; CHECK-LABEL: @test_no_simplify1( call i64 @strtol(i8* %x, i8** %endptr, i32 10) ; CHECK-NEXT: call i64 @strtol(i8* %x, i8** %endptr, i32 10) ret void diff --git a/test/Transforms/InstCombine/struct-assign-tbaa.ll b/test/Transforms/InstCombine/struct-assign-tbaa.ll index 33a771e6d8b..d7a26fabbc8 100644 --- a/test/Transforms/InstCombine/struct-assign-tbaa.ll +++ b/test/Transforms/InstCombine/struct-assign-tbaa.ll @@ -24,7 +24,7 @@ entry: %struct.test2 = type { i32 (i8*, i32*, double*)** } define i32 (i8*, i32*, double*)*** @test2() { -; CHECK: @test2 +; CHECK-LABEL: @test2( ; CHECK-NOT: memcpy ; CHECK: ret %tmp = alloca %struct.test2, align 8 diff --git a/test/Transforms/InstCombine/sub-xor.ll b/test/Transforms/InstCombine/sub-xor.ll index 1d14852bc80..e7aff00ba8d 100644 --- a/test/Transforms/InstCombine/sub-xor.ll +++ b/test/Transforms/InstCombine/sub-xor.ll @@ -5,7 +5,7 @@ define i32 @test1(i32 %x) nounwind { %sub = sub i32 63, %and ret i32 %sub -; CHECK: @test1 +; CHECK-LABEL: @test1( ; CHECK-NEXT: and i32 %x, 31 ; CHECK-NEXT: xor i32 %and, 63 ; CHECK-NEXT: ret @@ -18,7 +18,7 @@ define i32 @test2(i32 %x) nounwind { %sub = sub i32 31, %count ret i32 %sub -; CHECK: @test2 +; CHECK-LABEL: @test2( ; CHECK-NEXT: ctlz ; CHECK-NEXT: xor i32 %count, 31 ; CHECK-NEXT: ret @@ -30,7 +30,7 @@ define i32 @test3(i32 %x) nounwind { %add = add i32 %sub, 42 ret i32 %add -; CHECK: @test3 +; CHECK-LABEL: @test3( ; CHECK-NEXT: and i32 %x, 31 ; CHECK-NEXT: sub i32 73, %and ; CHECK-NEXT: ret @@ -41,7 +41,7 @@ define i32 @test4(i32 %x) nounwind { %add = add i32 %sub, 42 ret i32 %add -; CHECK: @test4 +; CHECK-LABEL: @test4( ; CHECK-NEXT: add i32 %x, -2147483606 ; CHECK-NEXT: ret } diff --git a/test/Transforms/InstCombine/sub.ll b/test/Transforms/InstCombine/sub.ll index b71ec8c98f8..54496562b6d 100644 --- a/test/Transforms/InstCombine/sub.ll +++ b/test/Transforms/InstCombine/sub.ll @@ -7,14 +7,14 @@ target datalayout = "e-p:64:64:64-i1:8:8-i8:8:8-i16:16:16-i32:32:32-i64:64:64-f3 define i32 @test1(i32 %A) { %B = sub i32 %A, %A ret i32 %B -; CHECK: @test1 +; CHECK-LABEL: @test1( ; CHECK: ret i32 0 } define i32 @test2(i32 %A) { %B = sub i32 %A, 0 ret i32 %B -; CHECK: @test2 +; CHECK-LABEL: @test2( ; CHECK: ret i32 %A } @@ -22,7 +22,7 @@ define i32 @test3(i32 %A) { %B = sub i32 0, %A %C = sub i32 0, %B ret i32 %C -; CHECK: @test3 +; CHECK-LABEL: @test3( ; CHECK: ret i32 %A } @@ -30,7 +30,7 @@ define i32 @test4(i32 %A, i32 %x) { %B = sub i32 0, %A %C = sub i32 %x, %B ret i32 %C -; CHECK: @test4 +; CHECK-LABEL: @test4( ; CHECK: %C = add i32 %x, %A ; CHECK: ret i32 %C } @@ -39,7 +39,7 @@ define i32 @test5(i32 %A, i32 %B, i32 %C) { %D = sub i32 %B, %C %E = sub i32 %A, %D ret i32 %E -; CHECK: @test5 +; CHECK-LABEL: @test5( ; CHECK: %D1 = sub i32 %C, %B ; CHECK: %E = add ; CHECK: ret i32 %E @@ -49,7 +49,7 @@ define i32 @test6(i32 %A, i32 %B) { %C = and i32 %A, %B %D = sub i32 %A, %C ret i32 %D -; CHECK: @test6 +; CHECK-LABEL: @test6( ; CHECK-NEXT: xor i32 %B, -1 ; CHECK-NEXT: %D = and i32 ; CHECK-NEXT: ret i32 %D @@ -58,7 +58,7 @@ define i32 @test6(i32 %A, i32 %B) { define i32 @test7(i32 %A) { %B = sub i32 -1, %A ret i32 %B -; CHECK: @test7 +; CHECK-LABEL: @test7( ; CHECK: %B = xor i32 %A, -1 ; CHECK: ret i32 %B } @@ -67,7 +67,7 @@ define i32 @test8(i32 %A) { %B = mul i32 9, %A %C = sub i32 %B, %A ret i32 %C -; CHECK: @test8 +; CHECK-LABEL: @test8( ; CHECK: %C = shl i32 %A, 3 ; CHECK: ret i32 %C } @@ -76,7 +76,7 @@ define i32 @test9(i32 %A) { %B = mul i32 3, %A %C = sub i32 %A, %B ret i32 %C -; CHECK: @test9 +; CHECK-LABEL: @test9( ; CHECK: %C = mul i32 %A, -2 ; CHECK: ret i32 %C } @@ -86,7 +86,7 @@ define i32 @test10(i32 %A, i32 %B) { %D = sub i32 0, %B %E = mul i32 %C, %D ret i32 %E -; CHECK: @test10 +; CHECK-LABEL: @test10( ; CHECK: %E = mul i32 %A, %B ; CHECK: ret i32 %E } @@ -95,7 +95,7 @@ define i32 @test10a(i32 %A) { %C = sub i32 0, %A %E = mul i32 %C, 7 ret i32 %E -; CHECK: @test10a +; CHECK-LABEL: @test10a( ; CHECK: %E = mul i32 %A, -7 ; CHECK: ret i32 %E } @@ -104,7 +104,7 @@ define i1 @test11(i8 %A, i8 %B) { %C = sub i8 %A, %B %cD = icmp ne i8 %C, 0 ret i1 %cD -; CHECK: @test11 +; CHECK-LABEL: @test11( ; CHECK: %cD = icmp ne i8 %A, %B ; CHECK: ret i1 %cD } @@ -113,7 +113,7 @@ define i32 @test12(i32 %A) { %B = ashr i32 %A, 31 %C = sub i32 0, %B ret i32 %C -; CHECK: @test12 +; CHECK-LABEL: @test12( ; CHECK: %C = lshr i32 %A, 31 ; CHECK: ret i32 %C } @@ -122,7 +122,7 @@ define i32 @test13(i32 %A) { %B = lshr i32 %A, 31 %C = sub i32 0, %B ret i32 %C -; CHECK: @test13 +; CHECK-LABEL: @test13( ; CHECK: %C = ashr i32 %A, 31 ; CHECK: ret i32 %C } @@ -132,7 +132,7 @@ define i32 @test14(i32 %A) { %C = bitcast i32 %B to i32 %D = sub i32 0, %C ret i32 %D -; CHECK: @test14 +; CHECK-LABEL: @test14( ; CHECK: %D = ashr i32 %A, 31 ; CHECK: ret i32 %D } @@ -141,7 +141,7 @@ define i32 @test15(i32 %A, i32 %B) { %C = sub i32 0, %A %D = srem i32 %B, %C ret i32 %D -; CHECK: @test15 +; CHECK-LABEL: @test15( ; CHECK: %D = srem i32 %B, %A ; CHECK: ret i32 %D } @@ -150,7 +150,7 @@ define i32 @test16(i32 %A) { %X = sdiv i32 %A, 1123 %Y = sub i32 0, %X ret i32 %Y -; CHECK: @test16 +; CHECK-LABEL: @test16( ; CHECK: %Y = sdiv i32 %A, -1123 ; CHECK: ret i32 %Y } @@ -161,7 +161,7 @@ define i32 @test17(i32 %A) { %B = sub i32 0, %A %C = sdiv i32 %B, 1234 ret i32 %C -; CHECK: @test17 +; CHECK-LABEL: @test17( ; CHECK: %B = sub i32 0, %A ; CHECK: %C = sdiv i32 %B, 1234 ; CHECK: ret i32 %C @@ -172,7 +172,7 @@ define i64 @test18(i64 %Y) { %tmp.12 = shl i64 %Y, 2 %tmp.8 = sub i64 %tmp.4, %tmp.12 ret i64 %tmp.8 -; CHECK: @test18 +; CHECK-LABEL: @test18( ; CHECK: ret i64 0 } @@ -180,7 +180,7 @@ define i32 @test19(i32 %X, i32 %Y) { %Z = sub i32 %X, %Y %Q = add i32 %Z, %Y ret i32 %Q -; CHECK: @test19 +; CHECK-LABEL: @test19( ; CHECK: ret i32 %X } @@ -188,7 +188,7 @@ define i1 @test20(i32 %g, i32 %h) { %tmp.2 = sub i32 %g, %h %tmp.4 = icmp ne i32 %tmp.2, %g ret i1 %tmp.4 -; CHECK: @test20 +; CHECK-LABEL: @test20( ; CHECK: %tmp.4 = icmp ne i32 %h, 0 ; CHECK: ret i1 %tmp.4 } @@ -197,7 +197,7 @@ define i1 @test21(i32 %g, i32 %h) { %tmp.2 = sub i32 %g, %h %tmp.4 = icmp ne i32 %tmp.2, %g ret i1 %tmp.4 -; CHECK: @test21 +; CHECK-LABEL: @test21( ; CHECK: %tmp.4 = icmp ne i32 %h, 0 ; CHECK: ret i1 %tmp.4 } @@ -208,7 +208,7 @@ define zeroext i1 @test22(i32 %a, i32 %b) nounwind { %tmp4 = sub i32 0, %b %tmp5 = icmp eq i32 %tmp2, %tmp4 ret i1 %tmp5 -; CHECK: @test22 +; CHECK-LABEL: @test22( ; CHECK: %tmp5 = icmp eq i32 %b, %a ; CHECK: ret i1 %tmp5 } @@ -222,7 +222,7 @@ define i32 @test23(i8* %P, i64 %A){ %F = trunc i64 %E to i32 %G = sub i32 %D, %F ret i32 %G -; CHECK: @test23 +; CHECK-LABEL: @test23( ; CHECK-NEXT: = trunc i64 %A to i32 ; CHECK-NEXT: ret i32 } @@ -233,7 +233,7 @@ define i64 @test24(i8* %P, i64 %A){ %E = ptrtoint i8* %P to i64 %G = sub i64 %C, %E ret i64 %G -; CHECK: @test24 +; CHECK-LABEL: @test24( ; CHECK-NEXT: ret i64 %A } @@ -243,7 +243,7 @@ define i64 @test24a(i8* %P, i64 %A){ %E = ptrtoint i8* %P to i64 %G = sub i64 %E, %C ret i64 %G -; CHECK: @test24a +; CHECK-LABEL: @test24a( ; CHECK-NEXT: sub i64 0, %A ; CHECK-NEXT: ret i64 } @@ -255,7 +255,7 @@ define i64 @test24b(i8* %P, i64 %A){ %C = ptrtoint i16* %B to i64 %G = sub i64 %C, ptrtoint ([42 x i16]* @Arr to i64) ret i64 %G -; CHECK: @test24b +; CHECK-LABEL: @test24b( ; CHECK-NEXT: shl nuw i64 %A, 1 ; CHECK-NEXT: ret i64 } @@ -266,7 +266,7 @@ define i64 @test25(i8* %P, i64 %A){ %C = ptrtoint i16* %B to i64 %G = sub i64 %C, ptrtoint (i16* getelementptr ([42 x i16]* @Arr, i64 1, i64 0) to i64) ret i64 %G -; CHECK: @test25 +; CHECK-LABEL: @test25( ; CHECK-NEXT: shl nuw i64 %A, 1 ; CHECK-NEXT: add i64 {{.*}}, -84 ; CHECK-NEXT: ret i64 @@ -276,7 +276,7 @@ define i32 @test26(i32 %x) { %shl = shl i32 3, %x %neg = sub i32 0, %shl ret i32 %neg -; CHECK: @test26 +; CHECK-LABEL: @test26( ; CHECK-NEXT: shl i32 -3 ; CHECK-NEXT: ret i32 } @@ -285,7 +285,7 @@ define i32 @test27(i32 %x, i32 %y) { %mul = mul i32 %y, -8 %sub = sub i32 %x, %mul ret i32 %sub -; CHECK: @test27 +; CHECK-LABEL: @test27( ; CHECK-NEXT: shl i32 %y, 3 ; CHECK-NEXT: add i32 ; CHECK-NEXT: ret i32 @@ -296,7 +296,7 @@ define i32 @test28(i32 %x, i32 %y, i32 %z) { %mul = mul i32 %neg, %y %sub = sub i32 %x, %mul ret i32 %sub -; CHECK: @test28 +; CHECK-LABEL: @test28( ; CHECK-NEXT: mul i32 %z, %y ; CHECK-NEXT: add i32 ; CHECK-NEXT: ret i32 @@ -309,7 +309,7 @@ define i64 @test29(i8* %foo, i64 %i, i64 %j) { %cast2 = ptrtoint i8* %gep2 to i64 %sub = sub i64 %cast1, %cast2 ret i64 %sub -; CHECK: @test29 +; CHECK-LABEL: @test29( ; CHECK-NEXT: sub i64 %i, %j ; CHECK-NEXT: ret i64 } @@ -322,7 +322,7 @@ define i64 @test30(i8* %foo, i64 %i, i64 %j) { %cast2 = ptrtoint i8* %gep2 to i64 %sub = sub i64 %cast1, %cast2 ret i64 %sub -; CHECK: @test30 +; CHECK-LABEL: @test30( ; CHECK-NEXT: %gep1.idx = shl nuw i64 %i, 2 ; CHECK-NEXT: sub i64 %gep1.idx, %j ; CHECK-NEXT: ret i64 diff --git a/test/Transforms/InstCombine/toascii-1.ll b/test/Transforms/InstCombine/toascii-1.ll index c4a13e22939..f5e18983e12 100644 --- a/test/Transforms/InstCombine/toascii-1.ll +++ b/test/Transforms/InstCombine/toascii-1.ll @@ -9,49 +9,49 @@ declare i32 @toascii(i32) ; Check isascii(c) -> c & 0x7f. define i32 @test_simplify1() { -; CHECK: @test_simplify1 +; CHECK-LABEL: @test_simplify1( %ret = call i32 @toascii(i32 0) ret i32 %ret ; CHECK-NEXT: ret i32 0 } define i32 @test_simplify2() { -; CHECK: @test_simplify2 +; CHECK-LABEL: @test_simplify2( %ret = call i32 @toascii(i32 1) ret i32 %ret ; CHECK-NEXT: ret i32 1 } define i32 @test_simplify3() { -; CHECK: @test_simplify3 +; CHECK-LABEL: @test_simplify3( %ret = call i32 @toascii(i32 127) ret i32 %ret ; CHECK-NEXT: ret i32 127 } define i32 @test_simplify4() { -; CHECK: @test_simplify4 +; CHECK-LABEL: @test_simplify4( %ret = call i32 @toascii(i32 128) ret i32 %ret ; CHECK-NEXT: ret i32 0 } define i32 @test_simplify5() { -; CHECK: @test_simplify5 +; CHECK-LABEL: @test_simplify5( %ret = call i32 @toascii(i32 255) ret i32 %ret ; CHECK-NEXT: ret i32 127 } define i32 @test_simplify6() { -; CHECK: @test_simplify6 +; CHECK-LABEL: @test_simplify6( %ret = call i32 @toascii(i32 256) ret i32 %ret ; CHECK-NEXT: ret i32 0 } define i32 @test_simplify7(i32 %x) { -; CHECK: @test_simplify7 +; CHECK-LABEL: @test_simplify7( %ret = call i32 @toascii(i32 %x) ; CHECK-NEXT: [[AND:%[a-z0-9]+]] = and i32 %x, 127 ret i32 %ret diff --git a/test/Transforms/InstCombine/trunc.ll b/test/Transforms/InstCombine/trunc.ll index cbbad7f7977..ee81cf8c3c5 100644 --- a/test/Transforms/InstCombine/trunc.ll +++ b/test/Transforms/InstCombine/trunc.ll @@ -11,7 +11,7 @@ define i64 @test1(i64 %a) { %d = zext i32 %c to i64 call void @use(i32 %b) ret i64 %d -; CHECK: @test1 +; CHECK-LABEL: @test1( ; CHECK-NOT: ext ; CHECK: ret } @@ -22,7 +22,7 @@ define i64 @test2(i64 %a) { %d = sext i32 %q to i64 call void @use(i32 %b) ret i64 %d -; CHECK: @test2 +; CHECK-LABEL: @test2( ; CHECK: shl i64 %a, 36 ; CHECK: %d = ashr exact i64 {{.*}}, 36 ; CHECK: ret i64 %d @@ -33,7 +33,7 @@ define i64 @test3(i64 %a) { %d = zext i32 %c to i64 call void @use(i32 %b) ret i64 %d -; CHECK: @test3 +; CHECK-LABEL: @test3( ; CHECK-NOT: ext ; CHECK: ret } @@ -44,7 +44,7 @@ define i64 @test4(i64 %a) { %d = zext i32 %x to i64 call void @use(i32 %b) ret i64 %d -; CHECK: @test4 +; CHECK-LABEL: @test4( ; CHECK: = and i64 %a, 8 ; CHECK: = xor i64 {{.*}}, 8 ; CHECK-NOT: ext @@ -56,7 +56,7 @@ define i32 @test5(i32 %A) { %C = lshr i128 %B, 16 %D = trunc i128 %C to i32 ret i32 %D -; CHECK: @test5 +; CHECK-LABEL: @test5( ; CHECK: %C = lshr i32 %A, 16 ; CHECK: ret i32 %C } @@ -66,7 +66,7 @@ define i32 @test6(i64 %A) { %C = lshr i128 %B, 32 %D = trunc i128 %C to i32 ret i32 %D -; CHECK: @test6 +; CHECK-LABEL: @test6( ; CHECK: %C = lshr i64 %A, 32 ; CHECK: %D = trunc i64 %C to i32 ; CHECK: ret i32 %D @@ -77,7 +77,7 @@ define i92 @test7(i64 %A) { %C = lshr i128 %B, 32 %D = trunc i128 %C to i92 ret i92 %D -; CHECK: @test7 +; CHECK-LABEL: @test7( ; CHECK: %B = zext i64 %A to i92 ; CHECK: %C = lshr i92 %B, 32 ; CHECK: ret i92 %C @@ -90,7 +90,7 @@ define i64 @test8(i32 %A, i32 %B) { %ins35 = or i128 %tmp33, %tmp38 %tmp42 = trunc i128 %ins35 to i64 ret i64 %tmp42 -; CHECK: @test8 +; CHECK-LABEL: @test8( ; CHECK: %tmp38 = zext i32 %A to i64 ; CHECK: %tmp32 = zext i32 %B to i64 ; CHECK: %tmp33 = shl nuw i64 %tmp32, 32 @@ -102,7 +102,7 @@ define i8 @test9(i32 %X) { %Y = and i32 %X, 42 %Z = trunc i32 %Y to i8 ret i8 %Z -; CHECK: @test9 +; CHECK-LABEL: @test9( ; CHECK: trunc ; CHECK: and ; CHECK: ret @@ -113,7 +113,7 @@ define i8 @test10(i32 %X) { %Y = trunc i32 %X to i8 %Z = and i8 %Y, 42 ret i8 %Z -; CHECK: @test10 +; CHECK-LABEL: @test10( ; CHECK: trunc ; CHECK: and ; CHECK: ret diff --git a/test/Transforms/InstCombine/udivrem-change-width.ll b/test/Transforms/InstCombine/udivrem-change-width.ll index b388a3b0634..478e9ca387f 100644 --- a/test/Transforms/InstCombine/udivrem-change-width.ll +++ b/test/Transforms/InstCombine/udivrem-change-width.ll @@ -9,7 +9,7 @@ define i8 @udiv_i8(i8 %a, i8 %b) nounwind { %div = udiv i32 %conv, %conv2 %conv3 = trunc i32 %div to i8 ret i8 %conv3 -; CHECK: @udiv_i8 +; CHECK-LABEL: @udiv_i8( ; CHECK: udiv i8 %a, %b } @@ -19,7 +19,7 @@ define i8 @urem_i8(i8 %a, i8 %b) nounwind { %div = urem i32 %conv, %conv2 %conv3 = trunc i32 %div to i8 ret i8 %conv3 -; CHECK: @urem_i8 +; CHECK-LABEL: @urem_i8( ; CHECK: urem i8 %a, %b } @@ -28,7 +28,7 @@ define i32 @udiv_i32(i8 %a, i8 %b) nounwind { %conv2 = zext i8 %b to i32 %div = udiv i32 %conv, %conv2 ret i32 %div -; CHECK: @udiv_i32 +; CHECK-LABEL: @udiv_i32( ; CHECK: udiv i8 %a, %b ; CHECK: zext } @@ -38,7 +38,7 @@ define i32 @urem_i32(i8 %a, i8 %b) nounwind { %conv2 = zext i8 %b to i32 %div = urem i32 %conv, %conv2 ret i32 %div -; CHECK: @urem_i32 +; CHECK-LABEL: @urem_i32( ; CHECK: urem i8 %a, %b ; CHECK: zext } @@ -47,7 +47,7 @@ define i32 @udiv_i32_c(i8 %a) nounwind { %conv = zext i8 %a to i32 %div = udiv i32 %conv, 10 ret i32 %div -; CHECK: @udiv_i32_c +; CHECK-LABEL: @udiv_i32_c( ; CHECK: udiv i8 %a, 10 ; CHECK: zext } @@ -56,7 +56,7 @@ define i32 @urem_i32_c(i8 %a) nounwind { %conv = zext i8 %a to i32 %div = urem i32 %conv, 10 ret i32 %div -; CHECK: @urem_i32_c +; CHECK-LABEL: @urem_i32_c( ; CHECK: urem i8 %a, 10 ; CHECK: zext } diff --git a/test/Transforms/InstCombine/vec_demanded_elts.ll b/test/Transforms/InstCombine/vec_demanded_elts.ll index 0019a57627c..727680032ee 100644 --- a/test/Transforms/InstCombine/vec_demanded_elts.ll +++ b/test/Transforms/InstCombine/vec_demanded_elts.ll @@ -2,7 +2,7 @@ define i16 @test1(float %f) { entry: -; CHECK: @test1 +; CHECK-LABEL: @test1( ; CHECK: fmul float ; CHECK-NOT: insertelement {{.*}} 0.00 ; CHECK-NOT: call {{.*}} @llvm.x86.sse.mul @@ -22,7 +22,7 @@ entry: } define i32 @test2(float %f) { -; CHECK: @test2 +; CHECK-LABEL: @test2( ; CHECK-NOT: insertelement ; CHECK-NOT: extractelement ; CHECK: ret @@ -37,7 +37,7 @@ define i32 @test2(float %f) { } define i64 @test3(float %f, double %d) { -; CHECK: @test3 +; CHECK-LABEL: @test3( ; CHECK-NOT: insertelement {{.*}} 0.00 ; CHECK: ret entry: @@ -85,7 +85,7 @@ entry: } define void @get_image() nounwind { -; CHECK: @get_image +; CHECK-LABEL: @get_image( ; CHECK-NOT: extractelement ; CHECK: unreachable entry: @@ -105,7 +105,7 @@ bb3: ; preds = %bb2, %entry ; PR4340 define void @vac(<4 x float>* nocapture %a) nounwind { -; CHECK: @vac +; CHECK-LABEL: @vac( ; CHECK-NOT: load ; CHECK: ret entry: @@ -163,7 +163,7 @@ entry: } define <2 x float> @test_fptrunc(double %f) { -; CHECK: @test_fptrunc +; CHECK-LABEL: @test_fptrunc( ; CHECK: insertelement ; CHECK: insertelement ; CHECK-NOT: insertelement @@ -177,7 +177,7 @@ define <2 x float> @test_fptrunc(double %f) { } define <2 x double> @test_fpext(float %f) { -; CHECK: @test_fpext +; CHECK-LABEL: @test_fpext( ; CHECK: insertelement ; CHECK: insertelement ; CHECK-NOT: insertelement @@ -191,7 +191,7 @@ define <2 x double> @test_fpext(float %f) { } define <4 x float> @test_select(float %f, float %g) { -; CHECK: @test_select +; CHECK-LABEL: @test_select( ; CHECK: %a0 = insertelement <4 x float> undef, float %f, i32 0 ; CHECK-NOT: insertelement ; CHECK: %a3 = insertelement <4 x float> %a0, float 3.000000e+00, i32 3 diff --git a/test/Transforms/InstCombine/vec_shuffle.ll b/test/Transforms/InstCombine/vec_shuffle.ll index 8d14a6c7032..738e05b519d 100644 --- a/test/Transforms/InstCombine/vec_shuffle.ll +++ b/test/Transforms/InstCombine/vec_shuffle.ll @@ -1,21 +1,21 @@ ; RUN: opt < %s -instcombine -S | FileCheck %s define <4 x float> @test1(<4 x float> %v1) { -; CHECK: @test1 +; CHECK-LABEL: @test1( ; CHECK: ret <4 x float> %v1 %v2 = shufflevector <4 x float> %v1, <4 x float> undef, <4 x i32> ret <4 x float> %v2 } define <4 x float> @test2(<4 x float> %v1) { -; CHECK: @test2 +; CHECK-LABEL: @test2( ; CHECK: ret <4 x float> %v1 %v2 = shufflevector <4 x float> %v1, <4 x float> %v1, <4 x i32> ret <4 x float> %v2 } define float @test3(<4 x float> %A, <4 x float> %B, float %f) { -; CHECK: @test3 +; CHECK-LABEL: @test3( ; CHECK: ret float %f %C = insertelement <4 x float> %A, float %f, i32 0 %D = shufflevector <4 x float> %C, <4 x float> %B, <4 x i32> @@ -24,7 +24,7 @@ define float @test3(<4 x float> %A, <4 x float> %B, float %f) { } define i32 @test4(<4 x i32> %X) { -; CHECK: @test4 +; CHECK-LABEL: @test4( ; CHECK-NEXT: extractelement ; CHECK-NEXT: ret %tmp152.i53899.i = shufflevector <4 x i32> %X, <4 x i32> undef, <4 x i32> zeroinitializer @@ -33,7 +33,7 @@ define i32 @test4(<4 x i32> %X) { } define i32 @test5(<4 x i32> %X) { -; CHECK: @test5 +; CHECK-LABEL: @test5( ; CHECK-NEXT: extractelement ; CHECK-NEXT: ret %tmp152.i53899.i = shufflevector <4 x i32> %X, <4 x i32> undef, <4 x i32> @@ -42,7 +42,7 @@ define i32 @test5(<4 x i32> %X) { } define float @test6(<4 x float> %X) { -; CHECK: @test6 +; CHECK-LABEL: @test6( ; CHECK-NEXT: extractelement ; CHECK-NEXT: ret %X1 = bitcast <4 x float> %X to <4 x i32> @@ -53,7 +53,7 @@ define float @test6(<4 x float> %X) { } define <4 x float> @test7(<4 x float> %tmp45.i) { -; CHECK: @test7 +; CHECK-LABEL: @test7( ; CHECK-NEXT: ret <4 x float> %tmp45.i %tmp1642.i = shufflevector <4 x float> %tmp45.i, <4 x float> undef, <4 x i32> < i32 0, i32 1, i32 6, i32 7 > ret <4 x float> %tmp1642.i @@ -61,7 +61,7 @@ define <4 x float> @test7(<4 x float> %tmp45.i) { ; This should turn into a single shuffle. define <4 x float> @test8(<4 x float> %tmp, <4 x float> %tmp1) { -; CHECK: @test8 +; CHECK-LABEL: @test8( ; CHECK-NEXT: shufflevector ; CHECK-NEXT: ret %tmp4 = extractelement <4 x float> %tmp, i32 1 @@ -77,7 +77,7 @@ define <4 x float> @test8(<4 x float> %tmp, <4 x float> %tmp1) { ; Test fold of two shuffles where the first shuffle vectors inputs are a ; different length then the second. define <4 x i8> @test9(<16 x i8> %tmp6) nounwind { -; CHECK: @test9 +; CHECK-LABEL: @test9( ; CHECK-NEXT: shufflevector ; CHECK-NEXT: ret %tmp7 = shufflevector <16 x i8> %tmp6, <16 x i8> undef, <4 x i32> < i32 13, i32 9, i32 4, i32 13 > ; <<4 x i8>> [#uses=1] @@ -89,7 +89,7 @@ define <4 x i8> @test9(<16 x i8> %tmp6) nounwind { ; mask values of 2*N, where N is the mask length. These shuffles should not ; be folded (because [8,9,4,8] may not be a mask supported by the target). define <4 x i8> @test9a(<16 x i8> %tmp6) nounwind { -; CHECK: @test9a +; CHECK-LABEL: @test9a( ; CHECK-NEXT: shufflevector ; CHECK-NEXT: shufflevector ; CHECK-NEXT: ret @@ -101,7 +101,7 @@ define <4 x i8> @test9a(<16 x i8> %tmp6) nounwind { ; Test fold of two shuffles where the first shuffle vectors inputs are a ; different length then the second. define <4 x i8> @test9b(<4 x i8> %tmp6, <4 x i8> %tmp7) nounwind { -; CHECK: @test9b +; CHECK-LABEL: @test9b( ; CHECK-NEXT: shufflevector ; CHECK-NEXT: ret %tmp1 = shufflevector <4 x i8> %tmp6, <4 x i8> %tmp7, <8 x i32> ; <<4 x i8>> [#uses=1] @@ -111,7 +111,7 @@ define <4 x i8> @test9b(<4 x i8> %tmp6, <4 x i8> %tmp7) nounwind { ; Redundant vector splats should be removed. Radar 8597790. define <4 x i32> @test10(<4 x i32> %tmp5) nounwind { -; CHECK: @test10 +; CHECK-LABEL: @test10( ; CHECK-NEXT: shufflevector ; CHECK-NEXT: ret %tmp6 = shufflevector <4 x i32> %tmp5, <4 x i32> undef, <4 x i32> @@ -122,7 +122,7 @@ define <4 x i32> @test10(<4 x i32> %tmp5) nounwind { ; Test fold of two shuffles where the two shufflevector inputs's op1 are ; the same define <8 x i8> @test11(<16 x i8> %tmp6) nounwind { -; CHECK: @test11 +; CHECK-LABEL: @test11( ; CHECK-NEXT: shufflevector <16 x i8> %tmp6, <16 x i8> undef, <8 x i32> ; CHECK-NEXT: ret %tmp1 = shufflevector <16 x i8> %tmp6, <16 x i8> undef, <4 x i32> ; <<4 x i8>> [#uses=1] @@ -134,7 +134,7 @@ define <8 x i8> @test11(<16 x i8> %tmp6) nounwind { ; Test fold of two shuffles where the first shufflevector's inputs are ; the same as the second define <8 x i8> @test12(<8 x i8> %tmp6, <8 x i8> %tmp2) nounwind { -; CHECK: @test12 +; CHECK-LABEL: @test12( ; CHECK-NEXT: shufflevector <8 x i8> %tmp6, <8 x i8> %tmp2, <8 x i32> ; CHECK-NEXT: ret %tmp1 = shufflevector <8 x i8> %tmp6, <8 x i8> undef, <8 x i32> ; <<8 x i8>> [#uses=1] @@ -145,7 +145,7 @@ define <8 x i8> @test12(<8 x i8> %tmp6, <8 x i8> %tmp2) nounwind { ; Test fold of two shuffles where the first shufflevector's inputs are ; the same as the second define <8 x i8> @test12a(<8 x i8> %tmp6, <8 x i8> %tmp2) nounwind { -; CHECK: @test12a +; CHECK-LABEL: @test12a( ; CHECK-NEXT: shufflevector <8 x i8> %tmp2, <8 x i8> %tmp6, <8 x i32> ; CHECK-NEXT: ret %tmp1 = shufflevector <8 x i8> %tmp6, <8 x i8> undef, <8 x i32> ; <<8 x i8>> [#uses=1] @@ -154,7 +154,7 @@ define <8 x i8> @test12a(<8 x i8> %tmp6, <8 x i8> %tmp2) nounwind { } define <2 x i8> @test13a(i8 %x1, i8 %x2) { -; CHECK: @test13a +; CHECK-LABEL: @test13a( ; CHECK-NEXT: insertelement {{.*}} undef, i8 %x1, i32 1 ; CHECK-NEXT: insertelement {{.*}} i8 %x2, i32 0 ; CHECK-NEXT: add {{.*}} @@ -167,7 +167,7 @@ define <2 x i8> @test13a(i8 %x1, i8 %x2) { } define <2 x i8> @test13b(i8 %x) { -; CHECK: @test13b +; CHECK-LABEL: @test13b( ; CHECK-NEXT: insertelement <2 x i8> undef, i8 %x, i32 1 ; CHECK-NEXT: ret %A = insertelement <2 x i8> undef, i8 %x, i32 0 @@ -176,7 +176,7 @@ define <2 x i8> @test13b(i8 %x) { } define <2 x i8> @test13c(i8 %x1, i8 %x2) { -; CHECK: @test13c +; CHECK-LABEL: @test13c( ; CHECK-NEXT: insertelement <2 x i8> {{.*}}, i32 0 ; CHECK-NEXT: insertelement <2 x i8> {{.*}}, i32 1 ; CHECK-NEXT: ret diff --git a/test/Transforms/InstCombine/vector-casts.ll b/test/Transforms/InstCombine/vector-casts.ll index 2f2990b7b05..ca97b3407da 100644 --- a/test/Transforms/InstCombine/vector-casts.ll +++ b/test/Transforms/InstCombine/vector-casts.ll @@ -5,7 +5,7 @@ define <2 x i1> @test1(<2 x i64> %a) { %t = trunc <2 x i64> %a to <2 x i1> ret <2 x i1> %t -; CHECK: @test1 +; CHECK-LABEL: @test1( ; CHECK: and <2 x i64> %a, ; CHECK: icmp ne <2 x i64> %1, zeroinitializer } @@ -16,7 +16,7 @@ define <2 x i64> @test2(<2 x i64> %a) { %t = ashr <2 x i64> %b, ret <2 x i64> %t -; CHECK: @test2 +; CHECK-LABEL: @test2( ; CHECK: and <2 x i64> %a, ; CHECK: lshr <2 x i64> %b, } @@ -33,7 +33,7 @@ entry: %conv = bitcast <4 x i32> %and to <2 x i64> ret <2 x i64> %conv -; CHECK: @test3 +; CHECK-LABEL: @test3( ; CHECK: fcmp ord <4 x float> %a, %b } @@ -46,7 +46,7 @@ entry: %or = or <4 x i32> %sext, %sext5 %conv = bitcast <4 x i32> %or to <2 x i64> ret <2 x i64> %conv -; CHECK: @test4 +; CHECK-LABEL: @test4( ; CHECK: fcmp uno <4 x float> %a, %b } @@ -62,7 +62,7 @@ entry: %conv = bitcast <4 x i32> %and to <2 x i64> ret <2 x i64> %conv -; CHECK: @test5 +; CHECK-LABEL: @test5( ; CHECK: sext <4 x i1> %cmp to <4 x i32> ; The sext-and pair is canonicalized to a select. ; CHECK: select <4 x i1> %cmp4, <4 x i32> %sext, <4 x i32> zeroinitializer @@ -126,7 +126,7 @@ define <2 x double> @fc(<2 x double> %t) { ; PR9228 ; This was a crasher, so no CHECK statements. define <4 x float> @f(i32 %a) nounwind alwaysinline { -; CHECK: @f +; CHECK-LABEL: @f( entry: %dim = insertelement <4 x i32> undef, i32 %a, i32 0 %dim30 = insertelement <4 x i32> %dim, i32 %a, i32 1 diff --git a/test/Transforms/InstCombine/vector-mul.ll b/test/Transforms/InstCombine/vector-mul.ll index 4e4417f93c0..284d407ce33 100644 --- a/test/Transforms/InstCombine/vector-mul.ll +++ b/test/Transforms/InstCombine/vector-mul.ll @@ -9,7 +9,7 @@ entry: ret <4 x i8> %mul } -; CHECK: @Zero_i8 +; CHECK-LABEL: @Zero_i8( ; CHECK: ret <4 x i8> zeroinitializer define <4 x i8> @Identity_i8(<4 x i8> %InVec) { @@ -18,7 +18,7 @@ entry: ret <4 x i8> %mul } -; CHECK: @Identity_i8 +; CHECK-LABEL: @Identity_i8( ; CHECK: ret <4 x i8> %InVec define <4 x i8> @AddToSelf_i8(<4 x i8> %InVec) { @@ -27,7 +27,7 @@ entry: ret <4 x i8> %mul } -; CHECK: @AddToSelf_i8 +; CHECK-LABEL: @AddToSelf_i8( ; CHECK: shl <4 x i8> %InVec, ; CHECK: ret @@ -37,7 +37,7 @@ entry: ret <4 x i8> %mul } -; CHECK: @SplatPow2Test1_i8 +; CHECK-LABEL: @SplatPow2Test1_i8( ; CHECK: shl <4 x i8> %InVec, ; CHECK: ret @@ -47,7 +47,7 @@ entry: ret <4 x i8> %mul } -; CHECK: @SplatPow2Test2_i8 +; CHECK-LABEL: @SplatPow2Test2_i8( ; CHECK: shl <4 x i8> %InVec, ; CHECK: ret @@ -57,7 +57,7 @@ entry: ret <4 x i8> %mul } -; CHECK: @MulTest1_i8 +; CHECK-LABEL: @MulTest1_i8( ; CHECK: shl <4 x i8> %InVec, ; CHECK: ret @@ -67,7 +67,7 @@ entry: ret <4 x i8> %mul } -; CHECK: @MulTest2_i8 +; CHECK-LABEL: @MulTest2_i8( ; CHECK: mul <4 x i8> %InVec, ; CHECK: ret @@ -77,7 +77,7 @@ entry: ret <4 x i8> %mul } -; CHECK: @MulTest3_i8 +; CHECK-LABEL: @MulTest3_i8( ; CHECK: shl <4 x i8> %InVec, ; CHECK: ret @@ -88,7 +88,7 @@ entry: ret <4 x i8> %mul } -; CHECK: @MulTest4_i8 +; CHECK-LABEL: @MulTest4_i8( ; CHECK: mul <4 x i8> %InVec, ; CHECK: ret @@ -98,7 +98,7 @@ entry: ret <4 x i16> %mul } -; CHECK: @Zero_i16 +; CHECK-LABEL: @Zero_i16( ; CHECK: ret <4 x i16> zeroinitializer define <4 x i16> @Identity_i16(<4 x i16> %InVec) { @@ -107,7 +107,7 @@ entry: ret <4 x i16> %mul } -; CHECK: @Identity_i16 +; CHECK-LABEL: @Identity_i16( ; CHECK: ret <4 x i16> %InVec define <4 x i16> @AddToSelf_i16(<4 x i16> %InVec) { @@ -116,7 +116,7 @@ entry: ret <4 x i16> %mul } -; CHECK: @AddToSelf_i16 +; CHECK-LABEL: @AddToSelf_i16( ; CHECK: shl <4 x i16> %InVec, ; CHECK: ret @@ -126,7 +126,7 @@ entry: ret <4 x i16> %mul } -; CHECK: @SplatPow2Test1_i16 +; CHECK-LABEL: @SplatPow2Test1_i16( ; CHECK: shl <4 x i16> %InVec, ; CHECK: ret @@ -136,7 +136,7 @@ entry: ret <4 x i16> %mul } -; CHECK: @SplatPow2Test2_i16 +; CHECK-LABEL: @SplatPow2Test2_i16( ; CHECK: shl <4 x i16> %InVec, ; CHECK: ret @@ -146,7 +146,7 @@ entry: ret <4 x i16> %mul } -; CHECK: @MulTest1_i16 +; CHECK-LABEL: @MulTest1_i16( ; CHECK: shl <4 x i16> %InVec, ; CHECK: ret @@ -156,7 +156,7 @@ entry: ret <4 x i16> %mul } -; CHECK: @MulTest2_i16 +; CHECK-LABEL: @MulTest2_i16( ; CHECK: mul <4 x i16> %InVec, ; CHECK: ret @@ -166,7 +166,7 @@ entry: ret <4 x i16> %mul } -; CHECK: @MulTest3_i16 +; CHECK-LABEL: @MulTest3_i16( ; CHECK: shl <4 x i16> %InVec, ; CHECK: ret @@ -176,7 +176,7 @@ entry: ret <4 x i16> %mul } -; CHECK: @MulTest4_i16 +; CHECK-LABEL: @MulTest4_i16( ; CHECK: mul <4 x i16> %InVec, ; CHECK: ret @@ -186,7 +186,7 @@ entry: ret <4 x i32> %mul } -; CHECK: @Zero_i32 +; CHECK-LABEL: @Zero_i32( ; CHECK: ret <4 x i32> zeroinitializer define <4 x i32> @Identity_i32(<4 x i32> %InVec) { @@ -195,7 +195,7 @@ entry: ret <4 x i32> %mul } -; CHECK: @Identity_i32 +; CHECK-LABEL: @Identity_i32( ; CHECK: ret <4 x i32> %InVec define <4 x i32> @AddToSelf_i32(<4 x i32> %InVec) { @@ -204,7 +204,7 @@ entry: ret <4 x i32> %mul } -; CHECK: @AddToSelf_i32 +; CHECK-LABEL: @AddToSelf_i32( ; CHECK: shl <4 x i32> %InVec, ; CHECK: ret @@ -215,7 +215,7 @@ entry: ret <4 x i32> %mul } -; CHECK: @SplatPow2Test1_i32 +; CHECK-LABEL: @SplatPow2Test1_i32( ; CHECK: shl <4 x i32> %InVec, ; CHECK: ret @@ -225,7 +225,7 @@ entry: ret <4 x i32> %mul } -; CHECK: @SplatPow2Test2_i32 +; CHECK-LABEL: @SplatPow2Test2_i32( ; CHECK: shl <4 x i32> %InVec, ; CHECK: ret @@ -235,7 +235,7 @@ entry: ret <4 x i32> %mul } -; CHECK: @MulTest1_i32 +; CHECK-LABEL: @MulTest1_i32( ; CHECK: shl <4 x i32> %InVec, ; CHECK: ret @@ -245,7 +245,7 @@ entry: ret <4 x i32> %mul } -; CHECK: @MulTest2_i32 +; CHECK-LABEL: @MulTest2_i32( ; CHECK: mul <4 x i32> %InVec, ; CHECK: ret @@ -255,7 +255,7 @@ entry: ret <4 x i32> %mul } -; CHECK: @MulTest3_i32 +; CHECK-LABEL: @MulTest3_i32( ; CHECK: shl <4 x i32> %InVec, ; CHECK: ret @@ -266,7 +266,7 @@ entry: ret <4 x i32> %mul } -; CHECK: @MulTest4_i32 +; CHECK-LABEL: @MulTest4_i32( ; CHECK: mul <4 x i32> %InVec, ; CHECK: ret @@ -276,7 +276,7 @@ entry: ret <4 x i64> %mul } -; CHECK: @Zero_i64 +; CHECK-LABEL: @Zero_i64( ; CHECK: ret <4 x i64> zeroinitializer define <4 x i64> @Identity_i64(<4 x i64> %InVec) { @@ -285,7 +285,7 @@ entry: ret <4 x i64> %mul } -; CHECK: @Identity_i64 +; CHECK-LABEL: @Identity_i64( ; CHECK: ret <4 x i64> %InVec define <4 x i64> @AddToSelf_i64(<4 x i64> %InVec) { @@ -294,7 +294,7 @@ entry: ret <4 x i64> %mul } -; CHECK: @AddToSelf_i64 +; CHECK-LABEL: @AddToSelf_i64( ; CHECK: shl <4 x i64> %InVec, ; CHECK: ret @@ -304,7 +304,7 @@ entry: ret <4 x i64> %mul } -; CHECK: @SplatPow2Test1_i64 +; CHECK-LABEL: @SplatPow2Test1_i64( ; CHECK: shl <4 x i64> %InVec, ; CHECK: ret @@ -314,7 +314,7 @@ entry: ret <4 x i64> %mul } -; CHECK: @SplatPow2Test2_i64 +; CHECK-LABEL: @SplatPow2Test2_i64( ; CHECK: shl <4 x i64> %InVec, ; CHECK: ret @@ -324,7 +324,7 @@ entry: ret <4 x i64> %mul } -; CHECK: @MulTest1_i64 +; CHECK-LABEL: @MulTest1_i64( ; CHECK: shl <4 x i64> %InVec, ; CHECK: ret @@ -334,7 +334,7 @@ entry: ret <4 x i64> %mul } -; CHECK: @MulTest2_i64 +; CHECK-LABEL: @MulTest2_i64( ; CHECK: mul <4 x i64> %InVec, ; CHECK: ret @@ -344,7 +344,7 @@ entry: ret <4 x i64> %mul } -; CHECK: @MulTest3_i64 +; CHECK-LABEL: @MulTest3_i64( ; CHECK: shl <4 x i64> %InVec, ; CHECK: ret @@ -354,7 +354,7 @@ entry: ret <4 x i64> %mul } -; CHECK: @MulTest4_i64 +; CHECK-LABEL: @MulTest4_i64( ; CHECK: mul <4 x i64> %InVec, ; CHECK: ret @@ -369,7 +369,7 @@ entry: ret <4 x i8> %mul } -; CHECK: @ShiftMulTest1 +; CHECK-LABEL: @ShiftMulTest1( ; CHECK: mul <4 x i8> %InVec, ; CHECK: ret @@ -380,7 +380,7 @@ entry: ret <4 x i16> %mul } -; CHECK: @ShiftMulTest2 +; CHECK-LABEL: @ShiftMulTest2( ; CHECK: mul <4 x i16> %InVec, ; CHECK: ret @@ -391,7 +391,7 @@ entry: ret <4 x i32> %mul } -; CHECK: @ShiftMulTest3 +; CHECK-LABEL: @ShiftMulTest3( ; CHECK: mul <4 x i32> %InVec, ; CHECK: ret @@ -402,7 +402,7 @@ entry: ret <4 x i64> %mul } -; CHECK: @ShiftMulTest4 +; CHECK-LABEL: @ShiftMulTest4( ; CHECK: mul <4 x i64> %InVec, ; CHECK: ret diff --git a/test/Transforms/InstCombine/vector_gep2.ll b/test/Transforms/InstCombine/vector_gep2.ll index 20165b11001..42057d60b8c 100644 --- a/test/Transforms/InstCombine/vector_gep2.ll +++ b/test/Transforms/InstCombine/vector_gep2.ll @@ -4,7 +4,7 @@ target datalayout = "e-p:64:64:64-i1:8:8-i8:8:8-i16:16:16-i32:32:32-i64:64:64-f3 target triple = "x86_64-unknown-linux-gnu" define <2 x i8*> @testa(<2 x i8*> %a) { -; CHECK: @testa +; CHECK-LABEL: @testa( %g = getelementptr <2 x i8*> %a, <2 x i32> ; CHECK: getelementptr <2 x i8*> %a, <2 x i64> ret <2 x i8*> %g diff --git a/test/Transforms/InstCombine/win-math.ll b/test/Transforms/InstCombine/win-math.ll index 367e5b80721..df3ac934a75 100644 --- a/test/Transforms/InstCombine/win-math.ll +++ b/test/Transforms/InstCombine/win-math.ll @@ -9,7 +9,7 @@ declare double @acos(double %x) define float @float_acos(float %x) nounwind readnone { -; WIN32: @float_acos +; WIN32-LABEL: @float_acos( ; WIN32-NOT: float @acosf ; WIN32: double @acos %1 = fpext float %x to double @@ -20,7 +20,7 @@ define float @float_acos(float %x) nounwind readnone { declare double @asin(double %x) define float @float_asin(float %x) nounwind readnone { -; WIN32: @float_asin +; WIN32-LABEL: @float_asin( ; WIN32-NOT: float @asinf ; WIN32: double @asin %1 = fpext float %x to double @@ -31,7 +31,7 @@ define float @float_asin(float %x) nounwind readnone { declare double @atan(double %x) define float @float_atan(float %x) nounwind readnone { -; WIN32: @float_atan +; WIN32-LABEL: @float_atan( ; WIN32-NOT: float @atanf ; WIN32: double @atan %1 = fpext float %x to double @@ -42,7 +42,7 @@ define float @float_atan(float %x) nounwind readnone { declare double @atan2(double %x, double %y) define float @float_atan2(float %x, float %y) nounwind readnone { -; WIN32: @float_atan2 +; WIN32-LABEL: @float_atan2( ; WIN32-NOT: float @atan2f ; WIN32: double @atan2 %1 = fpext float %x to double @@ -54,16 +54,16 @@ define float @float_atan2(float %x, float %y) nounwind readnone { declare double @ceil(double %x) define float @float_ceil(float %x) nounwind readnone { -; WIN32: @float_ceil +; WIN32-LABEL: @float_ceil( ; WIN32-NOT: float @ceilf ; WIN32: double @ceil -; WIN64: @float_ceil +; WIN64-LABEL: @float_ceil( ; WIN64: float @ceilf ; WIN64-NOT: double @ceil -; MINGW32: @float_ceil +; MINGW32-LABEL: @float_ceil( ; MINGW32: float @ceilf ; MINGW32-NOT: double @ceil -; MINGW64: @float_ceil +; MINGW64-LABEL: @float_ceil( ; MINGW64: float @ceilf ; MINGW64-NOT: double @ceil %1 = fpext float %x to double @@ -74,7 +74,7 @@ define float @float_ceil(float %x) nounwind readnone { declare double @_copysign(double %x) define float @float_copysign(float %x) nounwind readnone { -; WIN32: @float_copysign +; WIN32-LABEL: @float_copysign( ; WIN32-NOT: float @copysignf ; WIN32-NOT: float @_copysignf ; WIN32: double @_copysign @@ -86,7 +86,7 @@ define float @float_copysign(float %x) nounwind readnone { declare double @cos(double %x) define float @float_cos(float %x) nounwind readnone { -; WIN32: @float_cos +; WIN32-LABEL: @float_cos( ; WIN32-NOT: float @cosf ; WIN32: double @cos %1 = fpext float %x to double @@ -97,7 +97,7 @@ define float @float_cos(float %x) nounwind readnone { declare double @cosh(double %x) define float @float_cosh(float %x) nounwind readnone { -; WIN32: @float_cosh +; WIN32-LABEL: @float_cosh( ; WIN32-NOT: float @coshf ; WIN32: double @cosh %1 = fpext float %x to double @@ -108,7 +108,7 @@ define float @float_cosh(float %x) nounwind readnone { declare double @exp(double %x, double %y) define float @float_exp(float %x, float %y) nounwind readnone { -; WIN32: @float_exp +; WIN32-LABEL: @float_exp( ; WIN32-NOT: float @expf ; WIN32: double @exp %1 = fpext float %x to double @@ -120,10 +120,10 @@ define float @float_exp(float %x, float %y) nounwind readnone { declare double @fabs(double %x, double %y) define float @float_fabs(float %x, float %y) nounwind readnone { -; WIN32: @float_fabs +; WIN32-LABEL: @float_fabs( ; WIN32-NOT: float @fabsf ; WIN32: double @fabs -; WIN64: @float_fabs +; WIN64-LABEL: @float_fabs( ; WIN64-NOT: float @fabsf ; WIN64: double @fabs %1 = fpext float %x to double @@ -135,16 +135,16 @@ define float @float_fabs(float %x, float %y) nounwind readnone { declare double @floor(double %x) define float @float_floor(float %x) nounwind readnone { -; WIN32: @float_floor +; WIN32-LABEL: @float_floor( ; WIN32-NOT: float @floorf ; WIN32: double @floor -; WIN64: @float_floor +; WIN64-LABEL: @float_floor( ; WIN64: float @floorf ; WIN64-NOT: double @floor -; MINGW32: @float_floor +; MINGW32-LABEL: @float_floor( ; MINGW32: float @floorf ; MINGW32-NOT: double @floor -; MINGW64: @float_floor +; MINGW64-LABEL: @float_floor( ; MINGW64: float @floorf ; MINGW64-NOT: double @floor %1 = fpext float %x to double @@ -155,7 +155,7 @@ define float @float_floor(float %x) nounwind readnone { declare double @fmod(double %x, double %y) define float @float_fmod(float %x, float %y) nounwind readnone { -; WIN32: @float_fmod +; WIN32-LABEL: @float_fmod( ; WIN32-NOT: float @fmodf ; WIN32: double @fmod %1 = fpext float %x to double @@ -167,7 +167,7 @@ define float @float_fmod(float %x, float %y) nounwind readnone { declare double @log(double %x) define float @float_log(float %x) nounwind readnone { -; WIN32: @float_log +; WIN32-LABEL: @float_log( ; WIN32-NOT: float @logf ; WIN32: double @log %1 = fpext float %x to double @@ -178,7 +178,7 @@ define float @float_log(float %x) nounwind readnone { declare double @pow(double %x, double %y) define float @float_pow(float %x, float %y) nounwind readnone { -; WIN32: @float_pow +; WIN32-LABEL: @float_pow( ; WIN32-NOT: float @powf ; WIN32: double @pow %1 = fpext float %x to double @@ -190,7 +190,7 @@ define float @float_pow(float %x, float %y) nounwind readnone { declare double @sin(double %x) define float @float_sin(float %x) nounwind readnone { -; WIN32: @float_sin +; WIN32-LABEL: @float_sin( ; WIN32-NOT: float @sinf ; WIN32: double @sin %1 = fpext float %x to double @@ -201,7 +201,7 @@ define float @float_sin(float %x) nounwind readnone { declare double @sinh(double %x) define float @float_sinh(float %x) nounwind readnone { -; WIN32: @float_sinh +; WIN32-LABEL: @float_sinh( ; WIN32-NOT: float @sinhf ; WIN32: double @sinh %1 = fpext float %x to double @@ -212,16 +212,16 @@ define float @float_sinh(float %x) nounwind readnone { declare double @sqrt(double %x) define float @float_sqrt(float %x) nounwind readnone { -; WIN32: @float_sqrt +; WIN32-LABEL: @float_sqrt( ; WIN32-NOT: float @sqrtf ; WIN32: double @sqrt -; WIN64: @float_sqrt +; WIN64-LABEL: @float_sqrt( ; WIN64: float @sqrtf ; WIN64-NOT: double @sqrt -; MINGW32: @float_sqrt +; MINGW32-LABEL: @float_sqrt( ; MINGW32: float @sqrtf ; MINGW32-NOT: double @sqrt -; MINGW64: @float_sqrt +; MINGW64-LABEL: @float_sqrt( ; MINGW64: float @sqrtf ; MINGW64-NOT: double @sqrt %1 = fpext float %x to double @@ -232,7 +232,7 @@ define float @float_sqrt(float %x) nounwind readnone { declare double @tan(double %x) define float @float_tan(float %x) nounwind readnone { -; WIN32: @float_tan +; WIN32-LABEL: @float_tan( ; WIN32-NOT: float @tanf ; WIN32: double @tan %1 = fpext float %x to double @@ -243,7 +243,7 @@ define float @float_tan(float %x) nounwind readnone { declare double @tanh(double %x) define float @float_tanh(float %x) nounwind readnone { -; WIN32: @float_tanh +; WIN32-LABEL: @float_tanh( ; WIN32-NOT: float @tanhf ; WIN32: double @tanh %1 = fpext float %x to double @@ -255,16 +255,16 @@ define float @float_tanh(float %x) nounwind readnone { ; win32 does not have round; mingw32 does declare double @round(double %x) define float @float_round(float %x) nounwind readnone { -; WIN32: @float_round +; WIN32-LABEL: @float_round( ; WIN32-NOT: float @roundf ; WIN32: double @round -; WIN64: @float_round +; WIN64-LABEL: @float_round( ; WIN64-NOT: float @roundf ; WIN64: double @round -; MINGW32: @float_round +; MINGW32-LABEL: @float_round( ; MINGW32: float @roundf ; MINGW32-NOT: double @round -; MINGW64: @float_round +; MINGW64-LABEL: @float_round( ; MINGW64: float @roundf ; MINGW64-NOT: double @round %1 = fpext float %x to double diff --git a/test/Transforms/InstCombine/xor2.ll b/test/Transforms/InstCombine/xor2.ll index be06d7999d8..d153e035c89 100644 --- a/test/Transforms/InstCombine/xor2.ll +++ b/test/Transforms/InstCombine/xor2.ll @@ -4,7 +4,7 @@ ; PR1253 define i1 @test0(i32 %A) { -; CHECK: @test0 +; CHECK-LABEL: @test0( ; CHECK: %C = icmp slt i32 %A, 0 %B = xor i32 %A, -2147483648 %C = icmp sgt i32 %B, -1 @@ -12,7 +12,7 @@ define i1 @test0(i32 %A) { } define i1 @test1(i32 %A) { -; CHECK: @test1 +; CHECK-LABEL: @test1( ; CHECK: %C = icmp slt i32 %A, 0 %B = xor i32 %A, 12345 %C = icmp slt i32 %B, 0 @@ -21,7 +21,7 @@ define i1 @test1(i32 %A) { ; PR1014 define i32 @test2(i32 %tmp1) { -; CHECK: @test2 +; CHECK-LABEL: @test2( ; CHECK-NEXT: and i32 %tmp1, 32 ; CHECK-NEXT: or i32 %ovm, 8 ; CHECK-NEXT: ret i32 @@ -32,7 +32,7 @@ define i32 @test2(i32 %tmp1) { } define i32 @test3(i32 %tmp1) { -; CHECK: @test3 +; CHECK-LABEL: @test3( ; CHECK-NEXT: and i32 %tmp1, 32 ; CHECK-NEXT: or i32 %ovm, 8 ; CHECK-NEXT: ret i32 @@ -47,7 +47,7 @@ define i32 @test4(i32 %A, i32 %B) { %2 = ashr i32 %1, %B %3 = xor i32 %2, -1 ret i32 %3 -; CHECK: @test4 +; CHECK-LABEL: @test4( ; CHECK: %1 = ashr i32 %A, %B ; CHECK: ret i32 %1 } @@ -62,7 +62,7 @@ test5: %xor1 = xor i32 %shr, 1 %add = add i32 %xor1, %xor ret i32 %add -; CHECK: @test5 +; CHECK-LABEL: @test5( ; CHECK: lshr i32 %val1, 8 ; CHECK: ret } @@ -78,7 +78,7 @@ define i32 @test6(i32 %x) { %shr = lshr i32 %xor, 16 %add = add i32 %shr, %xor ret i32 %add -; CHECK: @test6 +; CHECK-LABEL: @test6( ; CHECK: lshr i32 %x, 16 ; CHECK: ret } diff --git a/test/Transforms/InstCombine/zext-bool-add-sub.ll b/test/Transforms/InstCombine/zext-bool-add-sub.ll index b5310575502..d7f338b659b 100644 --- a/test/Transforms/InstCombine/zext-bool-add-sub.ll +++ b/test/Transforms/InstCombine/zext-bool-add-sub.ll @@ -3,7 +3,7 @@ define i32 @a(i1 zeroext %x, i1 zeroext %y) { entry: -; CHECK: @a +; CHECK-LABEL: @a( ; CHECK: [[TMP1:%.*]] = sext i1 %y to i32 ; CHECK: [[TMP2:%.*]] = select i1 %x, i32 2, i32 1 ; CHECK-NEXT: add i32 [[TMP2]], [[TMP1]] diff --git a/test/Transforms/InstSimplify/2010-12-20-Boolean.ll b/test/Transforms/InstSimplify/2010-12-20-Boolean.ll index 3aa1bd60cfd..28c25c0e77e 100644 --- a/test/Transforms/InstSimplify/2010-12-20-Boolean.ll +++ b/test/Transforms/InstSimplify/2010-12-20-Boolean.ll @@ -1,28 +1,28 @@ ; RUN: opt < %s -instsimplify -S | FileCheck %s define i1 @add(i1 %x) { -; CHECK: @add +; CHECK-LABEL: @add( %z = add i1 %x, %x ret i1 %z ; CHECK: ret i1 false } define i1 @sub(i1 %x) { -; CHECK: @sub +; CHECK-LABEL: @sub( %z = sub i1 false, %x ret i1 %z ; CHECK: ret i1 %x } define i1 @mul(i1 %x) { -; CHECK: @mul +; CHECK-LABEL: @mul( %z = mul i1 %x, %x ret i1 %z ; CHECK: ret i1 %x } define i1 @ne(i1 %x) { -; CHECK: @ne +; CHECK-LABEL: @ne( %z = icmp ne i1 %x, 0 ret i1 %z ; CHECK: ret i1 %x diff --git a/test/Transforms/InstSimplify/2010-12-20-Distribute.ll b/test/Transforms/InstSimplify/2010-12-20-Distribute.ll index d20abd68c20..9ea0a5e1070 100644 --- a/test/Transforms/InstSimplify/2010-12-20-Distribute.ll +++ b/test/Transforms/InstSimplify/2010-12-20-Distribute.ll @@ -1,7 +1,7 @@ ; RUN: opt < %s -instsimplify -S | FileCheck %s define i32 @factorize(i32 %x, i32 %y) { -; CHECK: @factorize +; CHECK-LABEL: @factorize( ; (X | 1) & (X | 2) -> X | (1 & 2) -> X %l = or i32 %x, 1 %r = or i32 %x, 2 @@ -11,7 +11,7 @@ define i32 @factorize(i32 %x, i32 %y) { } define i32 @factorize2(i32 %x) { -; CHECK: @factorize2 +; CHECK-LABEL: @factorize2( ; 3*X - 2*X -> X %l = mul i32 3, %x %r = mul i32 2, %x @@ -21,7 +21,7 @@ define i32 @factorize2(i32 %x) { } define i32 @factorize3(i32 %x, i32 %a, i32 %b) { -; CHECK: @factorize3 +; CHECK-LABEL: @factorize3( ; (X | (A|B)) & (X | B) -> X | ((A|B) & B) -> X | B %aORb = or i32 %a, %b %l = or i32 %x, %aORb @@ -32,7 +32,7 @@ define i32 @factorize3(i32 %x, i32 %a, i32 %b) { } define i32 @factorize4(i32 %x, i32 %y) { -; CHECK: @factorize4 +; CHECK-LABEL: @factorize4( %sh = shl i32 %y, 1 %ml = mul i32 %sh, %x %mr = mul i32 %x, %y @@ -42,7 +42,7 @@ define i32 @factorize4(i32 %x, i32 %y) { } define i32 @factorize5(i32 %x, i32 %y) { -; CHECK: @factorize5 +; CHECK-LABEL: @factorize5( %sh = mul i32 %y, 2 %ml = mul i32 %sh, %x %mr = mul i32 %x, %y @@ -52,7 +52,7 @@ define i32 @factorize5(i32 %x, i32 %y) { } define i32 @expand(i32 %x) { -; CHECK: @expand +; CHECK-LABEL: @expand( ; ((X & 1) | 2) & 1 -> ((X & 1) & 1) | (2 & 1) -> (X & 1) | 0 -> X & 1 %a = and i32 %x, 1 %b = or i32 %a, 2 diff --git a/test/Transforms/InstSimplify/2011-01-14-Thread.ll b/test/Transforms/InstSimplify/2011-01-14-Thread.ll index 8fc4dc5d5bb..9de06600c0c 100644 --- a/test/Transforms/InstSimplify/2011-01-14-Thread.ll +++ b/test/Transforms/InstSimplify/2011-01-14-Thread.ll @@ -1,7 +1,7 @@ ; RUN: opt < %s -instsimplify -S | FileCheck %s define i32 @shift_select(i1 %cond) { -; CHECK: @shift_select +; CHECK-LABEL: @shift_select( %s = select i1 %cond, i32 0, i32 1 %r = lshr i32 %s, 1 ret i32 %r diff --git a/test/Transforms/InstSimplify/2011-02-01-Vector.ll b/test/Transforms/InstSimplify/2011-02-01-Vector.ll index 3039a663fa4..3cbbf350ec1 100644 --- a/test/Transforms/InstSimplify/2011-02-01-Vector.ll +++ b/test/Transforms/InstSimplify/2011-02-01-Vector.ll @@ -1,7 +1,7 @@ ; RUN: opt < %s -instsimplify -S | FileCheck %s define <2 x i32> @sdiv(<2 x i32> %x) { -; CHECK: @sdiv +; CHECK-LABEL: @sdiv( %div = sdiv <2 x i32> %x, ret <2 x i32> %div ; CHECK: ret <2 x i32> %x diff --git a/test/Transforms/InstSimplify/2011-09-05-InsertExtractValue.ll b/test/Transforms/InstSimplify/2011-09-05-InsertExtractValue.ll index d10c61fe2cf..3514b347937 100644 --- a/test/Transforms/InstSimplify/2011-09-05-InsertExtractValue.ll +++ b/test/Transforms/InstSimplify/2011-09-05-InsertExtractValue.ll @@ -14,7 +14,7 @@ lpad: %exc_ptr2 = insertvalue { i8*, i32 } undef, i8* %exc_ptr, 0 %filter2 = insertvalue { i8*, i32 } %exc_ptr2, i32 %filter, 1 resume { i8*, i32 } %filter2 -; CHECK: @test1 +; CHECK-LABEL: @test1( ; CHECK-NOT: extractvalue ; CHECK-NOT: insertvalue } @@ -25,5 +25,5 @@ define { i8, i32 } @test2({ i8*, i32 } %x) { %ex = extractvalue { i8*, i32 } %x, 1 %ins = insertvalue { i8, i32 } undef, i32 %ex, 1 ret { i8, i32 } %ins -; CHECK: @test2 +; CHECK-LABEL: @test2( } diff --git a/test/Transforms/InstSimplify/AndOrXor.ll b/test/Transforms/InstSimplify/AndOrXor.ll index 33a4d6b02d6..c59d6c916a6 100644 --- a/test/Transforms/InstSimplify/AndOrXor.ll +++ b/test/Transforms/InstSimplify/AndOrXor.ll @@ -1,7 +1,7 @@ ; RUN: opt < %s -instsimplify -S | FileCheck %s define i64 @pow2(i32 %x) { -; CHECK: @pow2 +; CHECK-LABEL: @pow2( %negx = sub i32 0, %x %x2 = and i32 %x, %negx %e = zext i32 %x2 to i64 @@ -12,7 +12,7 @@ define i64 @pow2(i32 %x) { } define i64 @pow2b(i32 %x) { -; CHECK: @pow2b +; CHECK-LABEL: @pow2b( %sh = shl i32 2, %x %e = zext i32 %sh to i64 %nege = sub i64 0, %e diff --git a/test/Transforms/InstSimplify/call.ll b/test/Transforms/InstSimplify/call.ll index cf2f8476763..3e1621c8388 100644 --- a/test/Transforms/InstSimplify/call.ll +++ b/test/Transforms/InstSimplify/call.ll @@ -3,7 +3,7 @@ declare {i8, i1} @llvm.uadd.with.overflow.i8(i8 %a, i8 %b) define i1 @test_uadd1() { -; CHECK: @test_uadd1 +; CHECK-LABEL: @test_uadd1( %x = call {i8, i1} @llvm.uadd.with.overflow.i8(i8 254, i8 3) %overflow = extractvalue {i8, i1} %x, 1 ret i1 %overflow @@ -11,7 +11,7 @@ define i1 @test_uadd1() { } define i8 @test_uadd2() { -; CHECK: @test_uadd2 +; CHECK-LABEL: @test_uadd2( %x = call {i8, i1} @llvm.uadd.with.overflow.i8(i8 254, i8 44) %result = extractvalue {i8, i1} %x, 0 ret i8 %result @@ -21,7 +21,7 @@ define i8 @test_uadd2() { declare i256 @llvm.cttz.i256(i256 %src, i1 %is_zero_undef) define i256 @test_cttz() { -; CHECK: @test_cttz +; CHECK-LABEL: @test_cttz( %x = call i256 @llvm.cttz.i256(i256 10, i1 false) ret i256 %x ; CHECK-NEXT: ret i256 1 @@ -30,7 +30,7 @@ define i256 @test_cttz() { declare i256 @llvm.ctpop.i256(i256 %src) define i256 @test_ctpop() { -; CHECK: @test_ctpop +; CHECK-LABEL: @test_ctpop( %x = call i256 @llvm.ctpop.i256(i256 10) ret i256 %x ; CHECK-NEXT: ret i256 2 @@ -40,7 +40,7 @@ define i256 @test_ctpop() { declare float @fabs(float %x) define float @test_fabs_libcall() { -; CHECK: @test_fabs_libcall +; CHECK-LABEL: @test_fabs_libcall( %x = call float @fabs(float -42.0) ; This is still a real function call, so instsimplify won't nuke it -- other @@ -61,7 +61,7 @@ declare float @llvm.nearbyint.f32(float) nounwind readnone ; Test idempotent intrinsics define float @test_idempotence(float %a) { -; CHECK: @test_idempotence +; CHECK-LABEL: @test_idempotence( ; CHECK: fabs ; CHECK-NOT: fabs diff --git a/test/Transforms/InstSimplify/compare.ll b/test/Transforms/InstSimplify/compare.ll index a0a9c8540ab..095794923b9 100644 --- a/test/Transforms/InstSimplify/compare.ll +++ b/test/Transforms/InstSimplify/compare.ll @@ -2,7 +2,7 @@ target datalayout = "p:32:32" define i1 @ptrtoint() { -; CHECK: @ptrtoint +; CHECK-LABEL: @ptrtoint( %a = alloca i8 %tmp = ptrtoint i8* %a to i32 %r = icmp eq i32 %tmp, 0 @@ -11,7 +11,7 @@ define i1 @ptrtoint() { } define i1 @bitcast() { -; CHECK: @bitcast +; CHECK-LABEL: @bitcast( %a = alloca i32 %b = alloca i64 %x = bitcast i32* %a to i8* @@ -22,7 +22,7 @@ define i1 @bitcast() { } define i1 @gep() { -; CHECK: @gep +; CHECK-LABEL: @gep( %a = alloca [3 x i8], align 8 %x = getelementptr inbounds [3 x i8]* %a, i32 0, i32 0 %cmp = icmp eq i8* %x, null @@ -31,7 +31,7 @@ define i1 @gep() { } define i1 @gep2() { -; CHECK: @gep2 +; CHECK-LABEL: @gep2( %a = alloca [3 x i8], align 8 %x = getelementptr inbounds [3 x i8]* %a, i32 0, i32 0 %y = getelementptr inbounds [3 x i8]* %a, i32 0, i32 0 @@ -46,7 +46,7 @@ define i1 @gep2() { @gepz = extern_weak global %gept define i1 @gep3() { -; CHECK: @gep3 +; CHECK-LABEL: @gep3( %x = alloca %gept, align 8 %a = getelementptr %gept* %x, i64 0, i32 0 %b = getelementptr %gept* %x, i64 0, i32 1 @@ -56,7 +56,7 @@ define i1 @gep3() { } define i1 @gep4() { -; CHECK: @gep4 +; CHECK-LABEL: @gep4( %x = alloca %gept, align 8 %a = getelementptr %gept* @gepy, i64 0, i32 0 %b = getelementptr %gept* @gepy, i64 0, i32 1 @@ -66,7 +66,7 @@ define i1 @gep4() { } define i1 @gep5() { -; CHECK: @gep5 +; CHECK-LABEL: @gep5( %x = alloca %gept, align 8 %a = getelementptr inbounds %gept* %x, i64 0, i32 1 %b = getelementptr %gept* @gepy, i64 0, i32 0 @@ -77,7 +77,7 @@ define i1 @gep5() { define i1 @gep6(%gept* %x) { ; Same as @gep3 but potentially null. -; CHECK: @gep6 +; CHECK-LABEL: @gep6( %a = getelementptr %gept* %x, i64 0, i32 0 %b = getelementptr %gept* %x, i64 0, i32 1 %equal = icmp eq i32* %a, %b @@ -86,7 +86,7 @@ define i1 @gep6(%gept* %x) { } define i1 @gep7(%gept* %x) { -; CHECK: @gep7 +; CHECK-LABEL: @gep7( %a = getelementptr %gept* %x, i64 0, i32 0 %b = getelementptr %gept* @gepz, i64 0, i32 0 %equal = icmp eq i32* %a, %b @@ -95,7 +95,7 @@ define i1 @gep7(%gept* %x) { } define i1 @gep8(%gept* %x) { -; CHECK: @gep8 +; CHECK-LABEL: @gep8( %a = getelementptr %gept* %x, i32 1 %b = getelementptr %gept* %x, i32 -1 %equal = icmp ugt %gept* %a, %b @@ -104,7 +104,7 @@ define i1 @gep8(%gept* %x) { } define i1 @gep9(i8* %ptr) { -; CHECK: @gep9 +; CHECK-LABEL: @gep9( ; CHECK-NOT: ret ; CHECK: ret i1 true @@ -124,7 +124,7 @@ entry: } define i1 @gep10(i8* %ptr) { -; CHECK: @gep10 +; CHECK-LABEL: @gep10( ; CHECK-NOT: ret ; CHECK: ret i1 true @@ -140,7 +140,7 @@ entry: } define i1 @gep11(i8* %ptr) { -; CHECK: @gep11 +; CHECK-LABEL: @gep11( ; CHECK-NOT: ret ; CHECK: ret i1 true @@ -153,7 +153,7 @@ entry: } define i1 @gep12(i8* %ptr) { -; CHECK: @gep12 +; CHECK-LABEL: @gep12( ; CHECK-NOT: ret ; CHECK: ret i1 %cmp @@ -166,7 +166,7 @@ entry: } define i1 @gep13(i8* %ptr) { -; CHECK: @gep13 +; CHECK-LABEL: @gep13( ; We can prove this GEP is non-null because it is inbounds. %x = getelementptr inbounds i8* %ptr, i32 1 %cmp = icmp eq i8* %x, null @@ -175,7 +175,7 @@ define i1 @gep13(i8* %ptr) { } define i1 @gep14({ {}, i8 }* %ptr) { -; CHECK: @gep14 +; CHECK-LABEL: @gep14( ; We can't simplify this because the offset of one in the GEP actually doesn't ; move the pointer. %x = getelementptr inbounds { {}, i8 }* %ptr, i32 0, i32 1 @@ -185,7 +185,7 @@ define i1 @gep14({ {}, i8 }* %ptr) { } define i1 @gep15({ {}, [4 x {i8, i8}]}* %ptr, i32 %y) { -; CHECK: @gep15 +; CHECK-LABEL: @gep15( ; We can prove this GEP is non-null even though there is a user value, as we ; would necessarily violate inbounds on one side or the other. %x = getelementptr inbounds { {}, [4 x {i8, i8}]}* %ptr, i32 0, i32 1, i32 %y, i32 1 @@ -195,7 +195,7 @@ define i1 @gep15({ {}, [4 x {i8, i8}]}* %ptr, i32 %y) { } define i1 @gep16(i8* %ptr, i32 %a) { -; CHECK: @gep16 +; CHECK-LABEL: @gep16( ; We can prove this GEP is non-null because it is inbounds and because we know ; %b is non-zero even though we don't know its value. %b = or i32 %a, 1 @@ -206,7 +206,7 @@ define i1 @gep16(i8* %ptr, i32 %a) { } define i1 @zext(i32 %x) { -; CHECK: @zext +; CHECK-LABEL: @zext( %e1 = zext i32 %x to i64 %e2 = zext i32 %x to i64 %r = icmp eq i64 %e1, %e2 @@ -215,7 +215,7 @@ define i1 @zext(i32 %x) { } define i1 @zext2(i1 %x) { -; CHECK: @zext2 +; CHECK-LABEL: @zext2( %e = zext i1 %x to i32 %c = icmp ne i32 %e, 0 ret i1 %c @@ -223,7 +223,7 @@ define i1 @zext2(i1 %x) { } define i1 @zext3() { -; CHECK: @zext3 +; CHECK-LABEL: @zext3( %e = zext i1 1 to i32 %c = icmp ne i32 %e, 0 ret i1 %c @@ -231,7 +231,7 @@ define i1 @zext3() { } define i1 @sext(i32 %x) { -; CHECK: @sext +; CHECK-LABEL: @sext( %e1 = sext i32 %x to i64 %e2 = sext i32 %x to i64 %r = icmp eq i64 %e1, %e2 @@ -240,7 +240,7 @@ define i1 @sext(i32 %x) { } define i1 @sext2(i1 %x) { -; CHECK: @sext2 +; CHECK-LABEL: @sext2( %e = sext i1 %x to i32 %c = icmp ne i32 %e, 0 ret i1 %c @@ -248,7 +248,7 @@ define i1 @sext2(i1 %x) { } define i1 @sext3() { -; CHECK: @sext3 +; CHECK-LABEL: @sext3( %e = sext i1 1 to i32 %c = icmp ne i32 %e, 0 ret i1 %c @@ -256,7 +256,7 @@ define i1 @sext3() { } define i1 @add(i32 %x, i32 %y) { -; CHECK: @add +; CHECK-LABEL: @add( %l = lshr i32 %x, 1 %q = lshr i32 %y, 1 %r = or i32 %q, 1 @@ -267,7 +267,7 @@ define i1 @add(i32 %x, i32 %y) { } define i1 @add2(i8 %x, i8 %y) { -; CHECK: @add2 +; CHECK-LABEL: @add2( %l = or i8 %x, 128 %r = or i8 %y, 129 %s = add i8 %l, %r @@ -277,7 +277,7 @@ define i1 @add2(i8 %x, i8 %y) { } define i1 @add3(i8 %x, i8 %y) { -; CHECK: @add3 +; CHECK-LABEL: @add3( %l = zext i8 %x to i32 %r = zext i8 %y to i32 %s = add i32 %l, %r @@ -287,7 +287,7 @@ define i1 @add3(i8 %x, i8 %y) { } define i1 @add4(i32 %x, i32 %y) { -; CHECK: @add4 +; CHECK-LABEL: @add4( %z = add nsw i32 %y, 1 %s1 = add nsw i32 %x, %y %s2 = add nsw i32 %x, %z @@ -297,7 +297,7 @@ define i1 @add4(i32 %x, i32 %y) { } define i1 @add5(i32 %x, i32 %y) { -; CHECK: @add5 +; CHECK-LABEL: @add5( %z = add nuw i32 %y, 1 %s1 = add nuw i32 %x, %z %s2 = add nuw i32 %x, %y @@ -307,7 +307,7 @@ define i1 @add5(i32 %x, i32 %y) { } define i1 @add6(i64 %A, i64 %B) { -; CHECK: @add6 +; CHECK-LABEL: @add6( %s1 = add i64 %A, %B %s2 = add i64 %B, %A %cmp = icmp eq i64 %s1, %s2 @@ -316,7 +316,7 @@ define i1 @add6(i64 %A, i64 %B) { } define i1 @addpowtwo(i32 %x, i32 %y) { -; CHECK: @addpowtwo +; CHECK-LABEL: @addpowtwo( %l = lshr i32 %x, 1 %r = shl i32 1, %y %s = add i32 %l, %r @@ -326,7 +326,7 @@ define i1 @addpowtwo(i32 %x, i32 %y) { } define i1 @or(i32 %x) { -; CHECK: @or +; CHECK-LABEL: @or( %o = or i32 %x, 1 %c = icmp eq i32 %o, 0 ret i1 %c @@ -334,7 +334,7 @@ define i1 @or(i32 %x) { } define i1 @shl(i32 %x) { -; CHECK: @shl +; CHECK-LABEL: @shl( %s = shl i32 1, %x %c = icmp eq i32 %s, 0 ret i1 %c @@ -342,7 +342,7 @@ define i1 @shl(i32 %x) { } define i1 @lshr1(i32 %x) { -; CHECK: @lshr1 +; CHECK-LABEL: @lshr1( %s = lshr i32 -1, %x %c = icmp eq i32 %s, 0 ret i1 %c @@ -350,7 +350,7 @@ define i1 @lshr1(i32 %x) { } define i1 @lshr2(i32 %x) { -; CHECK: @lshr2 +; CHECK-LABEL: @lshr2( %s = lshr i32 %x, 30 %c = icmp ugt i32 %s, 8 ret i1 %c @@ -358,7 +358,7 @@ define i1 @lshr2(i32 %x) { } define i1 @lshr3(i32 %x) { -; CHECK: @lshr3 +; CHECK-LABEL: @lshr3( %s = lshr i32 %x, %x %c = icmp eq i32 %s, 0 ret i1 %c @@ -366,7 +366,7 @@ define i1 @lshr3(i32 %x) { } define i1 @ashr1(i32 %x) { -; CHECK: @ashr1 +; CHECK-LABEL: @ashr1( %s = ashr i32 -1, %x %c = icmp eq i32 %s, 0 ret i1 %c @@ -374,7 +374,7 @@ define i1 @ashr1(i32 %x) { } define i1 @ashr2(i32 %x) { -; CHECK: @ashr2 +; CHECK-LABEL: @ashr2( %s = ashr i32 %x, 30 %c = icmp slt i32 %s, -5 ret i1 %c @@ -382,7 +382,7 @@ define i1 @ashr2(i32 %x) { } define i1 @ashr3(i32 %x) { -; CHECK: @ashr3 +; CHECK-LABEL: @ashr3( %s = ashr i32 %x, %x %c = icmp eq i32 %s, 0 ret i1 %c @@ -390,7 +390,7 @@ define i1 @ashr3(i32 %x) { } define i1 @select1(i1 %cond) { -; CHECK: @select1 +; CHECK-LABEL: @select1( %s = select i1 %cond, i32 1, i32 0 %c = icmp eq i32 %s, 1 ret i1 %c @@ -398,7 +398,7 @@ define i1 @select1(i1 %cond) { } define i1 @select2(i1 %cond) { -; CHECK: @select2 +; CHECK-LABEL: @select2( %x = zext i1 %cond to i32 %s = select i1 %cond, i32 %x, i32 0 %c = icmp ne i32 %s, 0 @@ -407,7 +407,7 @@ define i1 @select2(i1 %cond) { } define i1 @select3(i1 %cond) { -; CHECK: @select3 +; CHECK-LABEL: @select3( %x = zext i1 %cond to i32 %s = select i1 %cond, i32 1, i32 %x %c = icmp ne i32 %s, 0 @@ -416,7 +416,7 @@ define i1 @select3(i1 %cond) { } define i1 @select4(i1 %cond) { -; CHECK: @select4 +; CHECK-LABEL: @select4( %invert = xor i1 %cond, 1 %s = select i1 %invert, i32 0, i32 1 %c = icmp ne i32 %s, 0 @@ -425,7 +425,7 @@ define i1 @select4(i1 %cond) { } define i1 @select5(i32 %x) { -; CHECK: @select5 +; CHECK-LABEL: @select5( %c = icmp eq i32 %x, 0 %s = select i1 %c, i32 1, i32 %x %c2 = icmp eq i32 %s, 0 @@ -434,7 +434,7 @@ define i1 @select5(i32 %x) { } define i1 @select6(i32 %x) { -; CHECK: @select6 +; CHECK-LABEL: @select6( %c = icmp sgt i32 %x, 0 %s = select i1 %c, i32 %x, i32 4 %c2 = icmp eq i32 %s, 0 @@ -443,7 +443,7 @@ define i1 @select6(i32 %x) { } define i1 @urem1(i32 %X, i32 %Y) { -; CHECK: @urem1 +; CHECK-LABEL: @urem1( %A = urem i32 %X, %Y %B = icmp ult i32 %A, %Y ret i1 %B @@ -451,7 +451,7 @@ define i1 @urem1(i32 %X, i32 %Y) { } define i1 @urem2(i32 %X, i32 %Y) { -; CHECK: @urem2 +; CHECK-LABEL: @urem2( %A = urem i32 %X, %Y %B = icmp eq i32 %A, %Y ret i1 %B @@ -459,7 +459,7 @@ define i1 @urem2(i32 %X, i32 %Y) { } define i1 @urem3(i32 %X) { -; CHECK: @urem3 +; CHECK-LABEL: @urem3( %A = urem i32 %X, 10 %B = icmp ult i32 %A, 15 ret i1 %B @@ -467,7 +467,7 @@ define i1 @urem3(i32 %X) { } define i1 @urem4(i32 %X) { -; CHECK: @urem4 +; CHECK-LABEL: @urem4( %A = urem i32 %X, 15 %B = icmp ult i32 %A, 10 ret i1 %B @@ -475,7 +475,7 @@ define i1 @urem4(i32 %X) { } define i1 @urem5(i16 %X, i32 %Y) { -; CHECK: @urem5 +; CHECK-LABEL: @urem5( %A = zext i16 %X to i32 %B = urem i32 %A, %Y %C = icmp slt i32 %B, %Y @@ -484,7 +484,7 @@ define i1 @urem5(i16 %X, i32 %Y) { } define i1 @urem6(i32 %X, i32 %Y) { -; CHECK: @urem6 +; CHECK-LABEL: @urem6( %A = urem i32 %X, %Y %B = icmp ugt i32 %Y, %A ret i1 %B @@ -492,7 +492,7 @@ define i1 @urem6(i32 %X, i32 %Y) { } define i1 @urem7(i32 %X) { -; CHECK: @urem7 +; CHECK-LABEL: @urem7( %A = urem i32 1, %X %B = icmp sgt i32 %A, %X ret i1 %B @@ -500,7 +500,7 @@ define i1 @urem7(i32 %X) { } define i1 @srem1(i32 %X) { -; CHECK: @srem1 +; CHECK-LABEL: @srem1( %A = srem i32 %X, -5 %B = icmp sgt i32 %A, 5 ret i1 %B @@ -508,7 +508,7 @@ define i1 @srem1(i32 %X) { } ; PR9343 #15 -; CHECK: @srem2 +; CHECK-LABEL: @srem2( ; CHECK: ret i1 false define i1 @srem2(i16 %X, i32 %Y) { %A = zext i16 %X to i32 @@ -518,7 +518,7 @@ define i1 @srem2(i16 %X, i32 %Y) { ret i1 %D } -; CHECK: @srem3 +; CHECK-LABEL: @srem3( ; CHECK-NEXT: ret i1 false define i1 @srem3(i16 %X, i32 %Y) { %A = zext i16 %X to i32 @@ -530,7 +530,7 @@ define i1 @srem3(i16 %X, i32 %Y) { } define i1 @udiv1(i32 %X) { -; CHECK: @udiv1 +; CHECK-LABEL: @udiv1( %A = udiv i32 %X, 1000000 %B = icmp ult i32 %A, 5000 ret i1 %B @@ -538,7 +538,7 @@ define i1 @udiv1(i32 %X) { } define i1 @udiv2(i32 %X, i32 %Y, i32 %Z) { -; CHECK: @udiv2 +; CHECK-LABEL: @udiv2( %A = udiv exact i32 10, %Z %B = udiv exact i32 20, %Z %C = icmp ult i32 %A, %B @@ -547,7 +547,7 @@ define i1 @udiv2(i32 %X, i32 %Y, i32 %Z) { } define i1 @udiv3(i32 %X, i32 %Y) { -; CHECK: @udiv3 +; CHECK-LABEL: @udiv3( %A = udiv i32 %X, %Y %C = icmp ugt i32 %A, %X ret i1 %C @@ -555,7 +555,7 @@ define i1 @udiv3(i32 %X, i32 %Y) { } define i1 @udiv4(i32 %X, i32 %Y) { -; CHECK: @udiv4 +; CHECK-LABEL: @udiv4( %A = udiv i32 %X, %Y %C = icmp ule i32 %A, %X ret i1 %C @@ -563,7 +563,7 @@ define i1 @udiv4(i32 %X, i32 %Y) { } define i1 @udiv5(i32 %X) { -; CHECK: @udiv5 +; CHECK-LABEL: @udiv5( %A = udiv i32 123, %X %C = icmp ugt i32 %A, 124 ret i1 %C @@ -572,7 +572,7 @@ define i1 @udiv5(i32 %X) { ; PR11340 define i1 @udiv6(i32 %X) nounwind { -; CHECK: @udiv6 +; CHECK-LABEL: @udiv6( %A = udiv i32 1, %X %C = icmp eq i32 %A, 0 ret i1 %C @@ -581,7 +581,7 @@ define i1 @udiv6(i32 %X) nounwind { define i1 @sdiv1(i32 %X) { -; CHECK: @sdiv1 +; CHECK-LABEL: @sdiv1( %A = sdiv i32 %X, 1000000 %B = icmp slt i32 %A, 3000 ret i1 %B @@ -589,7 +589,7 @@ define i1 @sdiv1(i32 %X) { } define i1 @or1(i32 %X) { -; CHECK: @or1 +; CHECK-LABEL: @or1( %A = or i32 %X, 62 %B = icmp ult i32 %A, 50 ret i1 %B @@ -597,7 +597,7 @@ define i1 @or1(i32 %X) { } define i1 @and1(i32 %X) { -; CHECK: @and1 +; CHECK-LABEL: @and1( %A = and i32 %X, 62 %B = icmp ugt i32 %A, 70 ret i1 %B @@ -605,7 +605,7 @@ define i1 @and1(i32 %X) { } define i1 @mul1(i32 %X) { -; CHECK: @mul1 +; CHECK-LABEL: @mul1( ; Square of a non-zero number is non-zero if there is no overflow. %Y = or i32 %X, 1 %M = mul nuw i32 %Y, %Y @@ -615,7 +615,7 @@ define i1 @mul1(i32 %X) { } define i1 @mul2(i32 %X) { -; CHECK: @mul2 +; CHECK-LABEL: @mul2( ; Square of a non-zero number is positive if there is no signed overflow. %Y = or i32 %X, 1 %M = mul nsw i32 %Y, %Y @@ -625,7 +625,7 @@ define i1 @mul2(i32 %X) { } define i1 @mul3(i32 %X, i32 %Y) { -; CHECK: @mul3 +; CHECK-LABEL: @mul3( ; Product of non-negative numbers is non-negative if there is no signed overflow. %XX = mul nsw i32 %X, %X %YY = mul nsw i32 %Y, %Y @@ -636,7 +636,7 @@ define i1 @mul3(i32 %X, i32 %Y) { } define <2 x i1> @vectorselect1(<2 x i1> %cond) { -; CHECK: @vectorselect1 +; CHECK-LABEL: @vectorselect1( %invert = xor <2 x i1> %cond, %s = select <2 x i1> %invert, <2 x i32> , <2 x i32> %c = icmp ne <2 x i32> %s, @@ -708,7 +708,7 @@ define zeroext i1 @external_compare(i32* noalias %x) { } define i1 @alloca_gep(i64 %a, i64 %b) { -; CHECK: @alloca_gep +; CHECK-LABEL: @alloca_gep( ; We can prove this GEP is non-null because it is inbounds and the pointer ; is non-null. %strs = alloca [1000 x [1001 x i8]], align 16 diff --git a/test/Transforms/InstSimplify/exact-nsw-nuw.ll b/test/Transforms/InstSimplify/exact-nsw-nuw.ll index f3a804eb5b5..a0e326b13c0 100644 --- a/test/Transforms/InstSimplify/exact-nsw-nuw.ll +++ b/test/Transforms/InstSimplify/exact-nsw-nuw.ll @@ -2,7 +2,7 @@ ; PR8862 -; CHECK: @shift1 +; CHECK-LABEL: @shift1( ; CHECK: ret i32 %A define i32 @shift1(i32 %A, i32 %B) { %C = lshr exact i32 %A, %B @@ -10,7 +10,7 @@ define i32 @shift1(i32 %A, i32 %B) { ret i32 %D } -; CHECK: @shift2 +; CHECK-LABEL: @shift2( ; CHECK: lshr ; CHECK: ret i32 %D define i32 @shift2(i32 %A, i32 %B) { @@ -19,7 +19,7 @@ define i32 @shift2(i32 %A, i32 %B) { ret i32 %D } -; CHECK: @shift3 +; CHECK-LABEL: @shift3( ; CHECK: ret i32 %A define i32 @shift3(i32 %A, i32 %B) { %C = ashr exact i32 %A, %B @@ -27,7 +27,7 @@ define i32 @shift3(i32 %A, i32 %B) { ret i32 %D } -; CHECK: @shift4 +; CHECK-LABEL: @shift4( ; CHECK: ret i32 %A define i32 @shift4(i32 %A, i32 %B) { %C = shl nuw i32 %A, %B @@ -35,7 +35,7 @@ define i32 @shift4(i32 %A, i32 %B) { ret i32 %D } -; CHECK: @shift5 +; CHECK-LABEL: @shift5( ; CHECK: ret i32 %A define i32 @shift5(i32 %A, i32 %B) { %C = shl nsw i32 %A, %B diff --git a/test/Transforms/InstSimplify/fast-math.ll b/test/Transforms/InstSimplify/fast-math.ll index 154b9673979..71d1ed83849 100644 --- a/test/Transforms/InstSimplify/fast-math.ll +++ b/test/Transforms/InstSimplify/fast-math.ll @@ -71,7 +71,7 @@ define float @fadd_fsub_0(float %a) { } ; fsub nnan ninf x, x ==> 0.0 -; CHECK: @fsub_x_x +; CHECK-LABEL: @fsub_x_x( define float @fsub_x_x(float %a) { ; X - X ==> 0 %zero1 = fsub nnan ninf float %a, %a @@ -92,7 +92,7 @@ define float @fsub_x_x(float %a) { } ; fadd nsz X, 0 ==> X -; CHECK: @nofold_fadd_x_0 +; CHECK-LABEL: @nofold_fadd_x_0( define float @nofold_fadd_x_0(float %a) { ; Dont fold ; CHECK: %no_zero1 = fadd diff --git a/test/Transforms/InstSimplify/fdiv.ll b/test/Transforms/InstSimplify/fdiv.ll index 9d85154b240..53ad25d0747 100644 --- a/test/Transforms/InstSimplify/fdiv.ll +++ b/test/Transforms/InstSimplify/fdiv.ll @@ -1,7 +1,7 @@ ; RUN: opt < %s -instsimplify -S | FileCheck %s define double @fdiv_of_undef(double %X) { -; CHECK: @fdiv_of_undef +; CHECK-LABEL: @fdiv_of_undef( ; undef / X -> undef %r = fdiv double undef, %X ret double %r @@ -9,7 +9,7 @@ define double @fdiv_of_undef(double %X) { } define double @fdiv_by_undef(double %X) { -; CHECK: @fdiv_by_undef +; CHECK-LABEL: @fdiv_by_undef( ; X / undef -> undef %r = fdiv double %X, undef ret double %r diff --git a/test/Transforms/InstSimplify/floating-point-arithmetic.ll b/test/Transforms/InstSimplify/floating-point-arithmetic.ll index 91ce26324b8..8177440472c 100644 --- a/test/Transforms/InstSimplify/floating-point-arithmetic.ll +++ b/test/Transforms/InstSimplify/floating-point-arithmetic.ll @@ -1,7 +1,7 @@ ; RUN: opt < %s -instsimplify -S | FileCheck %s ; fsub 0, (fsub 0, X) ==> X -; CHECK: @fsub_0_0_x +; CHECK-LABEL: @fsub_0_0_x( define float @fsub_0_0_x(float %a) { %t1 = fsub float -0.0, %a %ret = fsub float -0.0, %t1 @@ -11,7 +11,7 @@ define float @fsub_0_0_x(float %a) { } ; fsub X, 0 ==> X -; CHECK: @fsub_x_0 +; CHECK-LABEL: @fsub_x_0( define float @fsub_x_0(float %a) { %ret = fsub float %a, 0.0 ; CHECK: ret float %a @@ -19,7 +19,7 @@ define float @fsub_x_0(float %a) { } ; fadd X, -0 ==> X -; CHECK: @fadd_x_n0 +; CHECK-LABEL: @fadd_x_n0( define float @fadd_x_n0(float %a) { %ret = fadd float %a, -0.0 ; CHECK: ret float %a @@ -27,7 +27,7 @@ define float @fadd_x_n0(float %a) { } ; fmul X, 1.0 ==> X -; CHECK: @fmul_X_1 +; CHECK-LABEL: @fmul_X_1( define double @fmul_X_1(double %a) { %b = fmul double 1.000000e+00, %a ; [#uses=1] ; CHECK: ret double %a diff --git a/test/Transforms/InstSimplify/maxmin.ll b/test/Transforms/InstSimplify/maxmin.ll index e921214e0f0..3c643ed3e03 100644 --- a/test/Transforms/InstSimplify/maxmin.ll +++ b/test/Transforms/InstSimplify/maxmin.ll @@ -1,7 +1,7 @@ ; RUN: opt < %s -instsimplify -S | FileCheck %s define i1 @max1(i32 %x, i32 %y) { -; CHECK: @max1 +; CHECK-LABEL: @max1( %c = icmp sgt i32 %x, %y %m = select i1 %c, i32 %x, i32 %y %r = icmp slt i32 %m, %x @@ -10,7 +10,7 @@ define i1 @max1(i32 %x, i32 %y) { } define i1 @max2(i32 %x, i32 %y) { -; CHECK: @max2 +; CHECK-LABEL: @max2( %c = icmp sge i32 %x, %y %m = select i1 %c, i32 %x, i32 %y %r = icmp sge i32 %m, %x @@ -19,7 +19,7 @@ define i1 @max2(i32 %x, i32 %y) { } define i1 @max3(i32 %x, i32 %y) { -; CHECK: @max3 +; CHECK-LABEL: @max3( %c = icmp ugt i32 %x, %y %m = select i1 %c, i32 %x, i32 %y %r = icmp ult i32 %m, %x @@ -28,7 +28,7 @@ define i1 @max3(i32 %x, i32 %y) { } define i1 @max4(i32 %x, i32 %y) { -; CHECK: @max4 +; CHECK-LABEL: @max4( %c = icmp uge i32 %x, %y %m = select i1 %c, i32 %x, i32 %y %r = icmp uge i32 %m, %x @@ -37,7 +37,7 @@ define i1 @max4(i32 %x, i32 %y) { } define i1 @max5(i32 %x, i32 %y) { -; CHECK: @max5 +; CHECK-LABEL: @max5( %c = icmp sgt i32 %x, %y %m = select i1 %c, i32 %x, i32 %y %r = icmp sgt i32 %x, %m @@ -46,7 +46,7 @@ define i1 @max5(i32 %x, i32 %y) { } define i1 @max6(i32 %x, i32 %y) { -; CHECK: @max6 +; CHECK-LABEL: @max6( %c = icmp sge i32 %x, %y %m = select i1 %c, i32 %x, i32 %y %r = icmp sle i32 %x, %m @@ -55,7 +55,7 @@ define i1 @max6(i32 %x, i32 %y) { } define i1 @max7(i32 %x, i32 %y) { -; CHECK: @max7 +; CHECK-LABEL: @max7( %c = icmp ugt i32 %x, %y %m = select i1 %c, i32 %x, i32 %y %r = icmp ugt i32 %x, %m @@ -64,7 +64,7 @@ define i1 @max7(i32 %x, i32 %y) { } define i1 @max8(i32 %x, i32 %y) { -; CHECK: @max8 +; CHECK-LABEL: @max8( %c = icmp uge i32 %x, %y %m = select i1 %c, i32 %x, i32 %y %r = icmp ule i32 %x, %m @@ -73,7 +73,7 @@ define i1 @max8(i32 %x, i32 %y) { } define i1 @min1(i32 %x, i32 %y) { -; CHECK: @min1 +; CHECK-LABEL: @min1( %c = icmp sgt i32 %x, %y %m = select i1 %c, i32 %y, i32 %x %r = icmp sgt i32 %m, %x @@ -82,7 +82,7 @@ define i1 @min1(i32 %x, i32 %y) { } define i1 @min2(i32 %x, i32 %y) { -; CHECK: @min2 +; CHECK-LABEL: @min2( %c = icmp sge i32 %x, %y %m = select i1 %c, i32 %y, i32 %x %r = icmp sle i32 %m, %x @@ -91,7 +91,7 @@ define i1 @min2(i32 %x, i32 %y) { } define i1 @min3(i32 %x, i32 %y) { -; CHECK: @min3 +; CHECK-LABEL: @min3( %c = icmp ugt i32 %x, %y %m = select i1 %c, i32 %y, i32 %x %r = icmp ugt i32 %m, %x @@ -100,7 +100,7 @@ define i1 @min3(i32 %x, i32 %y) { } define i1 @min4(i32 %x, i32 %y) { -; CHECK: @min4 +; CHECK-LABEL: @min4( %c = icmp uge i32 %x, %y %m = select i1 %c, i32 %y, i32 %x %r = icmp ule i32 %m, %x @@ -109,7 +109,7 @@ define i1 @min4(i32 %x, i32 %y) { } define i1 @min5(i32 %x, i32 %y) { -; CHECK: @min5 +; CHECK-LABEL: @min5( %c = icmp sgt i32 %x, %y %m = select i1 %c, i32 %y, i32 %x %r = icmp slt i32 %x, %m @@ -118,7 +118,7 @@ define i1 @min5(i32 %x, i32 %y) { } define i1 @min6(i32 %x, i32 %y) { -; CHECK: @min6 +; CHECK-LABEL: @min6( %c = icmp sge i32 %x, %y %m = select i1 %c, i32 %y, i32 %x %r = icmp sge i32 %x, %m @@ -127,7 +127,7 @@ define i1 @min6(i32 %x, i32 %y) { } define i1 @min7(i32 %x, i32 %y) { -; CHECK: @min7 +; CHECK-LABEL: @min7( %c = icmp ugt i32 %x, %y %m = select i1 %c, i32 %y, i32 %x %r = icmp ult i32 %x, %m @@ -136,7 +136,7 @@ define i1 @min7(i32 %x, i32 %y) { } define i1 @min8(i32 %x, i32 %y) { -; CHECK: @min8 +; CHECK-LABEL: @min8( %c = icmp uge i32 %x, %y %m = select i1 %c, i32 %y, i32 %x %r = icmp uge i32 %x, %m @@ -145,7 +145,7 @@ define i1 @min8(i32 %x, i32 %y) { } define i1 @maxmin1(i32 %x, i32 %y, i32 %z) { -; CHECK: @maxmin1 +; CHECK-LABEL: @maxmin1( %c1 = icmp sge i32 %x, %y %max = select i1 %c1, i32 %x, i32 %y %c2 = icmp sge i32 %x, %z @@ -156,7 +156,7 @@ define i1 @maxmin1(i32 %x, i32 %y, i32 %z) { } define i1 @maxmin2(i32 %x, i32 %y, i32 %z) { -; CHECK: @maxmin2 +; CHECK-LABEL: @maxmin2( %c1 = icmp sge i32 %x, %y %max = select i1 %c1, i32 %x, i32 %y %c2 = icmp sge i32 %x, %z @@ -167,7 +167,7 @@ define i1 @maxmin2(i32 %x, i32 %y, i32 %z) { } define i1 @maxmin3(i32 %x, i32 %y, i32 %z) { -; CHECK: @maxmin3 +; CHECK-LABEL: @maxmin3( %c1 = icmp sge i32 %x, %y %max = select i1 %c1, i32 %x, i32 %y %c2 = icmp sge i32 %x, %z @@ -178,7 +178,7 @@ define i1 @maxmin3(i32 %x, i32 %y, i32 %z) { } define i1 @maxmin4(i32 %x, i32 %y, i32 %z) { -; CHECK: @maxmin4 +; CHECK-LABEL: @maxmin4( %c1 = icmp sge i32 %x, %y %max = select i1 %c1, i32 %x, i32 %y %c2 = icmp sge i32 %x, %z @@ -189,7 +189,7 @@ define i1 @maxmin4(i32 %x, i32 %y, i32 %z) { } define i1 @maxmin5(i32 %x, i32 %y, i32 %z) { -; CHECK: @maxmin5 +; CHECK-LABEL: @maxmin5( %c1 = icmp uge i32 %x, %y %max = select i1 %c1, i32 %x, i32 %y %c2 = icmp uge i32 %x, %z @@ -200,7 +200,7 @@ define i1 @maxmin5(i32 %x, i32 %y, i32 %z) { } define i1 @maxmin6(i32 %x, i32 %y, i32 %z) { -; CHECK: @maxmin6 +; CHECK-LABEL: @maxmin6( %c1 = icmp uge i32 %x, %y %max = select i1 %c1, i32 %x, i32 %y %c2 = icmp uge i32 %x, %z @@ -211,7 +211,7 @@ define i1 @maxmin6(i32 %x, i32 %y, i32 %z) { } define i1 @maxmin7(i32 %x, i32 %y, i32 %z) { -; CHECK: @maxmin7 +; CHECK-LABEL: @maxmin7( %c1 = icmp uge i32 %x, %y %max = select i1 %c1, i32 %x, i32 %y %c2 = icmp uge i32 %x, %z @@ -222,7 +222,7 @@ define i1 @maxmin7(i32 %x, i32 %y, i32 %z) { } define i1 @maxmin8(i32 %x, i32 %y, i32 %z) { -; CHECK: @maxmin8 +; CHECK-LABEL: @maxmin8( %c1 = icmp uge i32 %x, %y %max = select i1 %c1, i32 %x, i32 %y %c2 = icmp uge i32 %x, %z @@ -233,7 +233,7 @@ define i1 @maxmin8(i32 %x, i32 %y, i32 %z) { } define i1 @eqcmp1(i32 %x, i32 %y) { -; CHECK: @eqcmp1 +; CHECK-LABEL: @eqcmp1( %c = icmp sge i32 %x, %y %max = select i1 %c, i32 %x, i32 %y %r = icmp eq i32 %max, %x @@ -242,7 +242,7 @@ define i1 @eqcmp1(i32 %x, i32 %y) { } define i1 @eqcmp2(i32 %x, i32 %y) { -; CHECK: @eqcmp2 +; CHECK-LABEL: @eqcmp2( %c = icmp sge i32 %x, %y %max = select i1 %c, i32 %x, i32 %y %r = icmp eq i32 %x, %max @@ -251,7 +251,7 @@ define i1 @eqcmp2(i32 %x, i32 %y) { } define i1 @eqcmp3(i32 %x, i32 %y) { -; CHECK: @eqcmp3 +; CHECK-LABEL: @eqcmp3( %c = icmp uge i32 %x, %y %max = select i1 %c, i32 %x, i32 %y %r = icmp eq i32 %max, %x @@ -260,7 +260,7 @@ define i1 @eqcmp3(i32 %x, i32 %y) { } define i1 @eqcmp4(i32 %x, i32 %y) { -; CHECK: @eqcmp4 +; CHECK-LABEL: @eqcmp4( %c = icmp uge i32 %x, %y %max = select i1 %c, i32 %x, i32 %y %r = icmp eq i32 %x, %max diff --git a/test/Transforms/InstSimplify/phi.ll b/test/Transforms/InstSimplify/phi.ll index 05cd40d9021..5b7aaa93caf 100644 --- a/test/Transforms/InstSimplify/phi.ll +++ b/test/Transforms/InstSimplify/phi.ll @@ -2,7 +2,7 @@ ; PR12189 define i1 @test1(i32 %x) { -; CHECK: @test1 +; CHECK-LABEL: @test1( br i1 true, label %a, label %b a: diff --git a/test/Transforms/InstSimplify/ptr_diff.ll b/test/Transforms/InstSimplify/ptr_diff.ll index 8b4aa796013..6a3f65237c5 100644 --- a/test/Transforms/InstSimplify/ptr_diff.ll +++ b/test/Transforms/InstSimplify/ptr_diff.ll @@ -3,7 +3,7 @@ target datalayout = "e-p:64:64:64-i1:8:8-i8:8:8-i16:16:16-i32:32:32-i64:64:64-f3 target triple = "x86_64-unknown-linux-gnu" define i64 @ptrdiff1(i8* %ptr) { -; CHECK: @ptrdiff1 +; CHECK-LABEL: @ptrdiff1( ; CHECK-NEXT: ret i64 42 %first = getelementptr inbounds i8* %ptr, i32 0 @@ -15,7 +15,7 @@ define i64 @ptrdiff1(i8* %ptr) { } define i64 @ptrdiff2(i8* %ptr) { -; CHECK: @ptrdiff2 +; CHECK-LABEL: @ptrdiff2( ; CHECK-NEXT: ret i64 42 %first1 = getelementptr inbounds i8* %ptr, i32 0 @@ -34,7 +34,7 @@ define i64 @ptrdiff2(i8* %ptr) { define i64 @ptrdiff3(i8* %ptr) { ; Don't bother with non-inbounds GEPs. -; CHECK: @ptrdiff3 +; CHECK-LABEL: @ptrdiff3( ; CHECK: getelementptr ; CHECK: sub ; CHECK: ret @@ -49,7 +49,7 @@ define i64 @ptrdiff3(i8* %ptr) { define <4 x i32> @ptrdiff4(<4 x i8*> %arg) nounwind { ; Handle simple cases of vectors of pointers. -; CHECK: @ptrdiff4 +; CHECK-LABEL: @ptrdiff4( ; CHECK: ret <4 x i32> zeroinitializer %p1 = ptrtoint <4 x i8*> %arg to <4 x i32> %bc = bitcast <4 x i8*> %arg to <4 x i32*> @@ -73,6 +73,6 @@ bb: %tmp6 = ptrtoint [2 x i32]* %tmp5 to i32 %tmp7 = sub i32 %tmp3, %tmp6 ret i32 %tmp7 -; CHECK: @ptrdiff5 +; CHECK-LABEL: @ptrdiff5( ; CHECK: ret i32 0 } diff --git a/test/Transforms/InstSimplify/reassociate.ll b/test/Transforms/InstSimplify/reassociate.ll index e659e6f42c8..d44f7155ffd 100644 --- a/test/Transforms/InstSimplify/reassociate.ll +++ b/test/Transforms/InstSimplify/reassociate.ll @@ -1,7 +1,7 @@ ; RUN: opt < %s -instsimplify -S | FileCheck %s define i32 @add1(i32 %x) { -; CHECK: @add1 +; CHECK-LABEL: @add1( ; (X + -1) + 1 -> X %l = add i32 %x, -1 %r = add i32 %l, 1 @@ -10,7 +10,7 @@ define i32 @add1(i32 %x) { } define i32 @and1(i32 %x, i32 %y) { -; CHECK: @and1 +; CHECK-LABEL: @and1( ; (X & Y) & X -> X & Y %l = and i32 %x, %y %r = and i32 %l, %x @@ -19,7 +19,7 @@ define i32 @and1(i32 %x, i32 %y) { } define i32 @and2(i32 %x, i32 %y) { -; CHECK: @and2 +; CHECK-LABEL: @and2( ; X & (X & Y) -> X & Y %r = and i32 %x, %y %l = and i32 %x, %r @@ -28,7 +28,7 @@ define i32 @and2(i32 %x, i32 %y) { } define i32 @or1(i32 %x, i32 %y) { -; CHECK: @or1 +; CHECK-LABEL: @or1( ; (X | Y) | X -> X | Y %l = or i32 %x, %y %r = or i32 %l, %x @@ -37,7 +37,7 @@ define i32 @or1(i32 %x, i32 %y) { } define i32 @or2(i32 %x, i32 %y) { -; CHECK: @or2 +; CHECK-LABEL: @or2( ; X | (X | Y) -> X | Y %r = or i32 %x, %y %l = or i32 %x, %r @@ -46,7 +46,7 @@ define i32 @or2(i32 %x, i32 %y) { } define i32 @xor1(i32 %x, i32 %y) { -; CHECK: @xor1 +; CHECK-LABEL: @xor1( ; (X ^ Y) ^ X = Y %l = xor i32 %x, %y %r = xor i32 %l, %x @@ -55,7 +55,7 @@ define i32 @xor1(i32 %x, i32 %y) { } define i32 @xor2(i32 %x, i32 %y) { -; CHECK: @xor2 +; CHECK-LABEL: @xor2( ; X ^ (X ^ Y) = Y %r = xor i32 %x, %y %l = xor i32 %x, %r @@ -64,7 +64,7 @@ define i32 @xor2(i32 %x, i32 %y) { } define i32 @sub1(i32 %x, i32 %y) { -; CHECK: @sub1 +; CHECK-LABEL: @sub1( %d = sub i32 %x, %y %r = sub i32 %x, %d ret i32 %r @@ -72,7 +72,7 @@ define i32 @sub1(i32 %x, i32 %y) { } define i32 @sub2(i32 %x) { -; CHECK: @sub2 +; CHECK-LABEL: @sub2( ; X - (X + 1) -> -1 %xp1 = add i32 %x, 1 %r = sub i32 %x, %xp1 @@ -81,7 +81,7 @@ define i32 @sub2(i32 %x) { } define i32 @sub3(i32 %x, i32 %y) { -; CHECK: @sub3 +; CHECK-LABEL: @sub3( ; ((X + 1) + Y) - (Y + 1) -> X %xp1 = add i32 %x, 1 %lhs = add i32 %xp1, %y @@ -92,7 +92,7 @@ define i32 @sub3(i32 %x, i32 %y) { } define i32 @sdiv1(i32 %x, i32 %y) { -; CHECK: @sdiv1 +; CHECK-LABEL: @sdiv1( ; (no overflow X * Y) / Y -> X %mul = mul nsw i32 %x, %y %r = sdiv i32 %mul, %y @@ -101,7 +101,7 @@ define i32 @sdiv1(i32 %x, i32 %y) { } define i32 @sdiv2(i32 %x, i32 %y) { -; CHECK: @sdiv2 +; CHECK-LABEL: @sdiv2( ; (((X / Y) * Y) / Y) -> X / Y %div = sdiv i32 %x, %y %mul = mul i32 %div, %y @@ -111,7 +111,7 @@ define i32 @sdiv2(i32 %x, i32 %y) { } define i32 @sdiv3(i32 %x, i32 %y) { -; CHECK: @sdiv3 +; CHECK-LABEL: @sdiv3( ; (X rem Y) / Y -> 0 %rem = srem i32 %x, %y %div = sdiv i32 %rem, %y @@ -120,7 +120,7 @@ define i32 @sdiv3(i32 %x, i32 %y) { } define i32 @sdiv4(i32 %x, i32 %y) { -; CHECK: @sdiv4 +; CHECK-LABEL: @sdiv4( ; (X / Y) * Y -> X if the division is exact %div = sdiv exact i32 %x, %y %mul = mul i32 %div, %y @@ -129,7 +129,7 @@ define i32 @sdiv4(i32 %x, i32 %y) { } define i32 @sdiv5(i32 %x, i32 %y) { -; CHECK: @sdiv5 +; CHECK-LABEL: @sdiv5( ; Y * (X / Y) -> X if the division is exact %div = sdiv exact i32 %x, %y %mul = mul i32 %y, %div @@ -139,7 +139,7 @@ define i32 @sdiv5(i32 %x, i32 %y) { define i32 @udiv1(i32 %x, i32 %y) { -; CHECK: @udiv1 +; CHECK-LABEL: @udiv1( ; (no overflow X * Y) / Y -> X %mul = mul nuw i32 %x, %y %r = udiv i32 %mul, %y @@ -148,7 +148,7 @@ define i32 @udiv1(i32 %x, i32 %y) { } define i32 @udiv2(i32 %x, i32 %y) { -; CHECK: @udiv2 +; CHECK-LABEL: @udiv2( ; (((X / Y) * Y) / Y) -> X / Y %div = udiv i32 %x, %y %mul = mul i32 %div, %y @@ -158,7 +158,7 @@ define i32 @udiv2(i32 %x, i32 %y) { } define i32 @udiv3(i32 %x, i32 %y) { -; CHECK: @udiv3 +; CHECK-LABEL: @udiv3( ; (X rem Y) / Y -> 0 %rem = urem i32 %x, %y %div = udiv i32 %rem, %y @@ -167,7 +167,7 @@ define i32 @udiv3(i32 %x, i32 %y) { } define i32 @udiv4(i32 %x, i32 %y) { -; CHECK: @udiv4 +; CHECK-LABEL: @udiv4( ; (X / Y) * Y -> X if the division is exact %div = udiv exact i32 %x, %y %mul = mul i32 %div, %y @@ -176,7 +176,7 @@ define i32 @udiv4(i32 %x, i32 %y) { } define i32 @udiv5(i32 %x, i32 %y) { -; CHECK: @udiv5 +; CHECK-LABEL: @udiv5( ; Y * (X / Y) -> X if the division is exact %div = udiv exact i32 %x, %y %mul = mul i32 %y, %div @@ -185,7 +185,7 @@ define i32 @udiv5(i32 %x, i32 %y) { } define i16 @trunc1(i32 %x) { -; CHECK: @trunc1 +; CHECK-LABEL: @trunc1( %y = add i32 %x, 1 %tx = trunc i32 %x to i16 %ty = trunc i32 %y to i16 diff --git a/test/Transforms/InstSimplify/rem.ll b/test/Transforms/InstSimplify/rem.ll index 4c8f87cf5e9..80fa8e7b483 100644 --- a/test/Transforms/InstSimplify/rem.ll +++ b/test/Transforms/InstSimplify/rem.ll @@ -1,7 +1,7 @@ ; RUN: opt < %s -instsimplify -S | FileCheck %s define i32 @select1(i32 %x, i1 %b) { -; CHECK: @select1 +; CHECK-LABEL: @select1( %rhs = select i1 %b, i32 %x, i32 1 %rem = srem i32 %x, %rhs ret i32 %rem @@ -9,7 +9,7 @@ define i32 @select1(i32 %x, i1 %b) { } define i32 @select2(i32 %x, i1 %b) { -; CHECK: @select2 +; CHECK-LABEL: @select2( %rhs = select i1 %b, i32 %x, i32 1 %rem = urem i32 %x, %rhs ret i32 %rem diff --git a/test/Transforms/JumpThreading/basic.ll b/test/Transforms/JumpThreading/basic.ll index fe3dc77c9c1..32cc4de9285 100644 --- a/test/Transforms/JumpThreading/basic.ll +++ b/test/Transforms/JumpThreading/basic.ll @@ -5,7 +5,7 @@ declare i32 @f2() declare void @f3() define i32 @test1(i1 %cond) { -; CHECK: @test1 +; CHECK-LABEL: @test1( br i1 %cond, label %T1, label %F1 @@ -37,7 +37,7 @@ F2: ;; cond is known false on Entry -> F1 edge! define i32 @test2(i1 %cond) { -; CHECK: @test2 +; CHECK-LABEL: @test2( Entry: br i1 %cond, label %T1, label %F1 @@ -62,7 +62,7 @@ F2: ; Undef handling. define i32 @test3(i1 %cond) { -; CHECK: @test3 +; CHECK-LABEL: @test3( ; CHECK-NEXT: T1: ; CHECK-NEXT: ret i32 42 br i1 undef, label %T1, label %F1 @@ -75,7 +75,7 @@ F1: } define i32 @test4(i1 %cond, i1 %cond2) { -; CHECK: @test4 +; CHECK-LABEL: @test4( br i1 %cond, label %T1, label %F1 @@ -108,7 +108,7 @@ F2: ;; This tests that the branch in 'merge' can be cloned up into T1. define i32 @test5(i1 %cond, i1 %cond2) { -; CHECK: @test5 +; CHECK-LABEL: @test5( br i1 %cond, label %T1, label %F1 @@ -144,7 +144,7 @@ F2: define i32 @test6(i32 %A) { -; CHECK: @test6 +; CHECK-LABEL: @test6( %tmp455 = icmp eq i32 %A, 42 br i1 %tmp455, label %BB1, label %BB2 @@ -180,7 +180,7 @@ BB4: ;; rdar://7367025 define i32 @test7(i1 %cond, i1 %cond2) { Entry: -; CHECK: @test7 +; CHECK-LABEL: @test7( %v1 = call i32 @f1() br i1 %cond, label %Merge, label %F1 @@ -213,7 +213,7 @@ F2: declare i1 @test8a() define i32 @test8b(i1 %cond, i1 %cond2) { -; CHECK: @test8b +; CHECK-LABEL: @test8b( T0: %A = call i1 @test8a() br i1 %A, label %T1, label %F1 @@ -255,7 +255,7 @@ Y: ;;; Verify that we can handle constraint propagation through "xor x, 1". define i32 @test9(i1 %cond, i1 %cond2) { Entry: -; CHECK: @test9 +; CHECK-LABEL: @test9( %v1 = call i32 @f1() br i1 %cond, label %Merge, label %F1 @@ -298,7 +298,7 @@ declare void @test10f3() ;; Non-local condition threading. define i32 @test10g(i1 %cond) { -; CHECK: @test10g +; CHECK-LABEL: @test10g( ; CHECK-NEXT: br i1 %cond, label %T2, label %F2 br i1 %cond, label %T1, label %F1 @@ -329,7 +329,7 @@ F2: ; Impossible conditional constraints should get threaded. BB3 is dead here. define i32 @test11(i32 %A) { -; CHECK: @test11 +; CHECK-LABEL: @test11( ; CHECK-NEXT: icmp ; CHECK-NEXT: br i1 %tmp455, label %BB4, label %BB2 %tmp455 = icmp eq i32 %A, 42 @@ -357,7 +357,7 @@ BB4: ;; Correlated value through boolean expression. GCC PR18046. define void @test12(i32 %A) { -; CHECK: @test12 +; CHECK-LABEL: @test12( entry: %cond = icmp eq i32 %A, 0 br i1 %cond, label %bb, label %bb1 @@ -393,7 +393,7 @@ return: ;; rdar://7391699 define i32 @test13(i1 %cond, i1 %cond2) { Entry: -; CHECK: @test13 +; CHECK-LABEL: @test13( %v1 = call i32 @f1() br i1 %cond, label %Merge, label %F1 @@ -421,7 +421,7 @@ F2: ; CHECK-NEXT: br i1 %N, label %T2, label %F2 } -; CHECK: @test14 +; CHECK-LABEL: @test14( define i32 @test14(i32 %in) { entry: %A = icmp eq i32 %in, 0 @@ -453,7 +453,7 @@ right_ret: } ; PR5652 -; CHECK: @test15 +; CHECK-LABEL: @test15( define i32 @test15(i32 %len) { entry: ; CHECK: icmp ult i32 %len, 13 diff --git a/test/Transforms/JumpThreading/indirectbr.ll b/test/Transforms/JumpThreading/indirectbr.ll index 141277fec62..b87fb6c2228 100644 --- a/test/Transforms/JumpThreading/indirectbr.ll +++ b/test/Transforms/JumpThreading/indirectbr.ll @@ -67,7 +67,7 @@ L2: ; preds = %indirectgoto ; Don't merge address-taken blocks. @.str = private unnamed_addr constant [4 x i8] c"%p\0A\00" -; CHECK: @test3 +; CHECK-LABEL: @test3( ; CHECK: __here: ; CHECK: blockaddress(@test3, %__here) ; CHECK: __here1: diff --git a/test/Transforms/JumpThreading/select.ll b/test/Transforms/JumpThreading/select.ll index 9676efec9df..18f5e23fac4 100644 --- a/test/Transforms/JumpThreading/select.ll +++ b/test/Transforms/JumpThreading/select.ll @@ -10,7 +10,7 @@ declare void @quux() ; Mostly theoretical since instruction combining simplifies all selects of ; booleans where at least one operand is true/false/undef. -; CHECK: @test_br +; CHECK-LABEL: @test_br( ; CHECK-NEXT: entry: ; CHECK-NEXT: br i1 %cond, label %L1, define void @test_br(i1 %cond, i1 %value) nounwind { @@ -34,7 +34,7 @@ L3: ; Jump threading of switch with select as condition. -; CHECK: @test_switch +; CHECK-LABEL: @test_switch( ; CHECK-NEXT: entry: ; CHECK-NEXT: br i1 %cond, label %L1, define void @test_switch(i1 %cond, i8 %value) nounwind { @@ -69,7 +69,7 @@ L4: ; Jump threading of indirectbr with select as address. -; CHECK: @test_indirectbr +; CHECK-LABEL: @test_indirectbr( ; CHECK-NEXT: entry: ; CHECK-NEXT: br i1 %cond, label %L1, label %L3 define void @test_indirectbr(i1 %cond, i8* %address) nounwind { @@ -93,7 +93,7 @@ L3: ; A more complicated case: the condition is a select based on a comparison. -; CHECK: @test_switch_cmp +; CHECK-LABEL: @test_switch_cmp( ; CHECK-NEXT: entry: ; CHECK-NEXT: br i1 %cond, label %L0, label %[[THREADED:[A-Za-z.0-9]+]] ; CHECK: [[THREADED]]: diff --git a/test/Transforms/JumpThreading/thread-loads.ll b/test/Transforms/JumpThreading/thread-loads.ll index 78d36e7053c..e651f9aab6f 100644 --- a/test/Transforms/JumpThreading/thread-loads.ll +++ b/test/Transforms/JumpThreading/thread-loads.ll @@ -6,7 +6,7 @@ target triple = "i386-apple-darwin7" ; Test that we can thread through the block with the partially redundant load (%2). ; rdar://6402033 define i32 @test1(i32* %P) nounwind { -; CHECK: @test1 +; CHECK-LABEL: @test1( entry: %0 = tail call i32 (...)* @f1() nounwind ; [#uses=1] %1 = icmp eq i32 %0, 0 ; [#uses=1] @@ -45,7 +45,7 @@ declare i32 @f2(...) ; rdar://11039258 define i32 @test2(i32* %P) nounwind { -; CHECK: @test2 +; CHECK-LABEL: @test2( entry: %0 = tail call i32 (...)* @f1() nounwind ; [#uses=1] %1 = icmp eq i32 %0, 0 ; [#uses=1] diff --git a/test/Transforms/LICM/hoisting.ll b/test/Transforms/LICM/hoisting.ll index 1ca377eb4a9..9da06754637 100644 --- a/test/Transforms/LICM/hoisting.ll +++ b/test/Transforms/LICM/hoisting.ll @@ -7,7 +7,7 @@ declare void @foo() ; This testcase tests for a problem where LICM hoists ; potentially trapping instructions when they are not guaranteed to execute. define i32 @test1(i1 %c) { -; CHECK: @test1 +; CHECK-LABEL: @test1( %A = load i32* @X ; [#uses=2] br label %Loop Loop: ; preds = %LoopTail, %0 @@ -34,7 +34,7 @@ declare void @foo2(i32) nounwind ;; It is ok and desirable to hoist this potentially trapping instruction. define i32 @test2(i1 %c) { -; CHECK: @test2 +; CHECK-LABEL: @test2( ; CHECK-NEXT: load i32* @X ; CHECK-NEXT: %B = sdiv i32 4, %A %A = load i32* @X ; [#uses=2] @@ -65,7 +65,7 @@ Out: ; preds = %Loop ret i32 %C } -; CHECK: @test4 +; CHECK-LABEL: @test4( ; CHECK: call ; CHECK: sdiv ; CHECK: ret @@ -91,7 +91,7 @@ for.end: ; preds = %for.body declare void @foo_may_call_exit(i32) ; PR14854 -; CHECK: @test5 +; CHECK-LABEL: @test5( ; CHECK: extractvalue ; CHECK: br label %tailrecurse ; CHECK: tailrecurse: diff --git a/test/Transforms/LICM/scalar_promote.ll b/test/Transforms/LICM/scalar_promote.ll index e7eab92aa8d..b3e45c5fde3 100644 --- a/test/Transforms/LICM/scalar_promote.ll +++ b/test/Transforms/LICM/scalar_promote.ll @@ -6,7 +6,7 @@ target datalayout = "E-p:64:64:64-a0:0:8-f32:32:32-f64:64:64-i1:8:8-i8:8:8-i16:1 define void @test1(i32 %i) { Entry: br label %Loop -; CHECK: @test1 +; CHECK-LABEL: @test1( ; CHECK: Entry: ; CHECK-NEXT: load i32* @X ; CHECK-NEXT: br label %Loop @@ -32,7 +32,7 @@ Out: define void @test2(i32 %i) { Entry: br label %Loop -; CHECK: @test2 +; CHECK-LABEL: @test2( ; CHECK: Entry: ; CHECK-NEXT: %.promoted = load i32* getelementptr inbounds (i32* @X, i64 1) ; CHECK-NEXT: br label %Loop @@ -55,7 +55,7 @@ Exit: ; preds = %Loop define void @test3(i32 %i) { -; CHECK: @test3 +; CHECK-LABEL: @test3( br label %Loop Loop: ; Should not promote this to a register @@ -73,7 +73,7 @@ Out: ; preds = %Loop ; PR8041 define void @test4(i8* %x, i8 %n) { -; CHECK: @test4 +; CHECK-LABEL: @test4( %handle1 = alloca i8* %handle2 = alloca i8* store i8* %x, i8** %handle1 @@ -121,7 +121,7 @@ exit: define void @test5(i32 %i, i32** noalias %P2) { Entry: br label %Loop -; CHECK: @test5 +; CHECK-LABEL: @test5( ; CHECK: Entry: ; CHECK-NEXT: load i32* @X ; CHECK-NEXT: br label %Loop diff --git a/test/Transforms/LICM/sinking.ll b/test/Transforms/LICM/sinking.ll index 68e4b64bf9b..b503f96e42c 100644 --- a/test/Transforms/LICM/sinking.ll +++ b/test/Transforms/LICM/sinking.ll @@ -14,7 +14,7 @@ Loop: ; preds = %Loop, %0 Out: ; preds = %Loop ret i32 %A -; CHECK: @test1 +; CHECK-LABEL: @test1( ; CHECK: Out: ; CHECK-NEXT: call i32 @strlen ; CHECK-NEXT: ret i32 %A @@ -33,7 +33,7 @@ Loop: ; preds = %Loop, %0 Out: ; preds = %Loop ret double %A -; CHECK: @test2 +; CHECK-LABEL: @test2( ; CHECK: Out: ; CHECK-NEXT: call double @sin ; CHECK-NEXT: ret double %A @@ -51,7 +51,7 @@ Exit: %Y = phi i32 [ 0, %Entry ], [ %X, %Loop ] ret void -; CHECK: @test3 +; CHECK-LABEL: @test3( ; CHECK: Exit.loopexit: ; CHECK-NEXT: %X = add i32 0, 1 ; CHECK-NEXT: br label %Exit @@ -74,7 +74,7 @@ Loop: ; preds = %Loop, %Entry br i1 %tmp.1, label %Loop, label %Out Out: ; preds = %Loop ret i32 %tmp.7 -; CHECK: @test4 +; CHECK-LABEL: @test4( ; CHECK: Out: ; CHECK-NEXT: mul i32 %N, %N_addr.0.pn ; CHECK-NEXT: sub i32 %tmp.6, %N @@ -98,7 +98,7 @@ Loop: ; preds = %Loop, %Entry br i1 %tmp.1, label %Loop, label %Out Out: ; preds = %Loop ret i32 %tmp.6 -; CHECK: @test5 +; CHECK-LABEL: @test5( ; CHECK: Out: ; CHECK-NEXT: %tmp.6 = load i32* @X ; CHECK-NEXT: ret i32 %tmp.6 @@ -122,7 +122,7 @@ Loop: br i1 false, label %Loop, label %Out Out: ; preds = %Loop ret i32 %sunk2 -; CHECK: @test6 +; CHECK-LABEL: @test6( ; CHECK: Out: ; CHECK-NEXT: %dead = getelementptr %Ty* @X2, i64 0, i32 0 ; CHECK-NEXT: %sunk2 = load i32* %dead @@ -150,7 +150,7 @@ Out1: ; preds = %Loop ret i32 %tmp.7 Out2: ; preds = %ContLoop ret i32 %tmp.7 -; CHECK: @test7 +; CHECK-LABEL: @test7( ; CHECK: Out1: ; CHECK-NEXT: mul i32 %N, %N_addr.0.pn ; CHECK-NEXT: sub i32 %tmp.6, %N @@ -179,7 +179,7 @@ exit1: ; preds = %Loop ret i32 0 exit2: ; preds = %Cont ret i32 %V -; CHECK: @test8 +; CHECK-LABEL: @test8( ; CHECK: exit1: ; CHECK-NEXT: ret i32 0 ; CHECK: exit2: @@ -206,7 +206,7 @@ loopentry.3.i.preheader: ; preds = %loopentry.3.i.preheader.loopexit, %loopentr return.i: ; preds = %no_exit.1.i ret void -; CHECK: @test9 +; CHECK-LABEL: @test9( ; CHECK: loopentry.3.i.preheader.loopexit: ; CHECK-NEXT: %inc.1.i = add i32 0, 1 ; CHECK-NEXT: br label %loopentry.3.i.preheader @@ -227,7 +227,7 @@ Loop: ; preds = %Loop, %Entry Out: ; preds = %Loop ret i32 %tmp.6 -; CHECK: @test10 +; CHECK-LABEL: @test10( ; CHECK: Out: ; CHECK-NEXT: %tmp.6 = sdiv i32 %N, %N_addr.0.pn ; CHECK-NEXT: ret i32 %tmp.6 @@ -241,7 +241,7 @@ Loop: br i1 false, label %Loop, label %Out Out: ret void -; CHECK: @test11 +; CHECK-LABEL: @test11( ; CHECK: Out: ; CHECK-NEXT: ret void } diff --git a/test/Transforms/LICM/speculate.ll b/test/Transforms/LICM/speculate.ll index 4c4d036b7db..4244f157d9f 100644 --- a/test/Transforms/LICM/speculate.ll +++ b/test/Transforms/LICM/speculate.ll @@ -2,7 +2,7 @@ ; UDiv is safe to speculate if the denominator is known non-zero. -; CHECK: @safe_udiv +; CHECK-LABEL: @safe_udiv( ; CHECK: %div = udiv i64 %x, %or ; CHECK-NEXT: br label %for.body @@ -35,7 +35,7 @@ for.end: ; preds = %for.inc, %entry ; UDiv is unsafe to speculate if the denominator is not known non-zero. -; CHECK: @unsafe_udiv +; CHECK-LABEL: @unsafe_udiv( ; CHECK-NOT: udiv ; CHECK: for.body: @@ -68,7 +68,7 @@ for.end: ; preds = %for.inc, %entry ; SDiv is safe to speculate if the denominator is known non-zero and ; known to have at least one zero bit. -; CHECK: @safe_sdiv +; CHECK-LABEL: @safe_sdiv( ; CHECK: %div = sdiv i64 %x, %or ; CHECK-NEXT: br label %for.body @@ -102,7 +102,7 @@ for.end: ; preds = %for.inc, %entry ; SDiv is unsafe to speculate if the denominator is not known non-zero. -; CHECK: @unsafe_sdiv_a +; CHECK-LABEL: @unsafe_sdiv_a( ; CHECK-NOT: sdiv ; CHECK: for.body: @@ -135,7 +135,7 @@ for.end: ; preds = %for.inc, %entry ; SDiv is unsafe to speculate if the denominator is not known to have a zero bit. -; CHECK: @unsafe_sdiv_b +; CHECK-LABEL: @unsafe_sdiv_b( ; CHECK-NOT: sdiv ; CHECK: for.body: diff --git a/test/Transforms/LoopIdiom/basic.ll b/test/Transforms/LoopIdiom/basic.ll index 06a5bd90864..835a9f695ca 100644 --- a/test/Transforms/LoopIdiom/basic.ll +++ b/test/Transforms/LoopIdiom/basic.ll @@ -16,7 +16,7 @@ for.body: ; preds = %bb.nph, %for.body for.end: ; preds = %for.body, %entry ret void -; CHECK: @test1 +; CHECK-LABEL: @test1( ; CHECK: call void @llvm.memset.p0i8.i64(i8* %Base, i8 0, i64 %Size, i32 1, i1 false) ; CHECK-NOT: store } @@ -39,7 +39,7 @@ for.body.cont: for.end: ; preds = %for.body, %entry ret void -; CHECK: @test1a +; CHECK-LABEL: @test1a( ; CHECK: call void @llvm.memset.p0i8.i64(i8* %Base, i8 0, i64 %Size, i32 1, i1 false) ; CHECK-NOT: store } @@ -60,7 +60,7 @@ for.body: ; preds = %entry, %for.body for.end: ; preds = %for.body, %entry ret void -; CHECK: @test2 +; CHECK-LABEL: @test2( ; CHECK: br i1 %cmp10, ; CHECK: %0 = mul i64 %Size, 4 ; CHECK: call void @llvm.memset.p0i8.i64(i8* %Base1, i8 1, i64 %0, i32 4, i1 false) @@ -85,7 +85,7 @@ for.body: ; preds = %entry, %for.body for.end: ; preds = %entry ret void -; CHECK: @test3 +; CHECK-LABEL: @test3( ; CHECK-NOT: memset ; CHECK: ret void } @@ -111,7 +111,7 @@ for.body: ; preds = %bb.nph, %for.body for.end: ; preds = %for.body, %entry ret void -; CHECK-TODO: @test4 +; CHECK-TODO-LABEL: @test4( ; CHECK-TODO: call void @llvm.memset.p0i8.i64(i8* %Base, i8 0, i64 100, i32 1, i1 false) ; CHECK-TODO-NOT: store } @@ -133,7 +133,7 @@ for.body: ; preds = %bb.nph, %for.body for.end: ; preds = %for.body, %entry ret void -; CHECK: @test5 +; CHECK-LABEL: @test5( ; CHECK-NOT: memset ; CHECK: ret void } @@ -158,7 +158,7 @@ for.body: ; preds = %bb.nph, %for.body for.end: ; preds = %for.body, %entry ret void -; CHECK: @test6 +; CHECK-LABEL: @test6( ; CHECK: call void @llvm.memcpy.p0i8.p0i8.i64(i8* %Dest, i8* %Base, i64 %Size, i32 1, i1 false) ; CHECK-NOT: store ; CHECK: ret void @@ -183,7 +183,7 @@ for.body.cont: for.end: ; preds = %for.body, %entry ret void -; CHECK: @test7 +; CHECK-LABEL: @test7( ; CHECK: call void @llvm.memset.p0i8.i64(i8* %Base, i8 0, i64 %Size, i32 1, i1 false) ; CHECK-NOT: store } @@ -203,7 +203,7 @@ for.body: ; preds = %bb.nph, %for.body for.end: ; preds = %for.body, %entry ret void -; CHECK: @test8 +; CHECK-LABEL: @test8( ; CHECK: store i64 0, i64* %PI } @@ -235,7 +235,7 @@ for.body: ; preds = %bb.nph, %for.body for.end: ; preds = %for.body, %entry ret void -; CHECK: @test9 +; CHECK-LABEL: @test9( ; CHECK-NOT: llvm.memcpy ; CHECK: ret void } @@ -267,7 +267,7 @@ for.inc10: ; preds = %for.body5 for.end13: ; preds = %for.inc10 ret void -; CHECK: @test10 +; CHECK-LABEL: @test10( ; CHECK: entry: ; CHECK-NEXT: call void @llvm.memset.p0i8.i64(i8* %X, i8 0, i64 10000, i32 1, i1 false) ; CHECK-NOT: store @@ -291,7 +291,7 @@ for.body: ; preds = %entry, %for.body for.end: ; preds = %for.body ret void -; CHECK: @test11_pattern +; CHECK-LABEL: @test11_pattern( ; CHECK-NEXT: entry: ; CHECK-NEXT: bitcast ; CHECK-NEXT: memset_pattern @@ -314,7 +314,7 @@ for.body: ; preds = %entry, %for.body for.end: ; preds = %for.body ret void -; CHECK: @test12 +; CHECK-LABEL: @test12( ; CHECK-NEXT: entry: ; CHECK-NEXT: bitcast ; CHECK-NEXT: call void @llvm.memset.p0i8.i64(i8* %P1, i8 0, i64 80000, i32 4, i1 false) @@ -340,7 +340,7 @@ for.body: ; preds = %entry, %for.body for.end: ; preds = %for.body ret void -; CHECK: @test13_pattern +; CHECK-LABEL: @test13_pattern( ; CHECK-NEXT: entry: ; CHECK-NEXT: bitcast ; CHECK-NEXT: memset_pattern @@ -375,7 +375,7 @@ for.body: ; preds = %for.inc, %for.body. for.end: ; preds = %for.inc %tmp8 = load i32* getelementptr inbounds ([7 x i32]* @g_50, i32 0, i64 6), align 4 ret i32 %tmp8 -; CHECK: @test14 +; CHECK-LABEL: @test14( ; CHECK: for.body: ; CHECK: load i32 ; CHECK: store i32 @@ -389,7 +389,7 @@ define void @PR14241(i32* %s, i64 %size) { ; instead of a memmove. If we get the memmove transform back, this will catch ; regressions. ; -; CHECK: @PR14241 +; CHECK-LABEL: @PR14241( entry: %end.idx = add i64 %size, -1 diff --git a/test/Transforms/LoopIdiom/memset_noidiom.ll b/test/Transforms/LoopIdiom/memset_noidiom.ll index 168eb95357c..f2b55aed546 100644 --- a/test/Transforms/LoopIdiom/memset_noidiom.ll +++ b/test/Transforms/LoopIdiom/memset_noidiom.ll @@ -2,7 +2,7 @@ target 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" target triple = "x86_64-apple-darwin10.0.0" -; CHECK: @memset +; CHECK-LABEL: @memset( ; CHECK-NOT: llvm.memset define i8* @memset(i8* %b, i32 %c, i64 %len) nounwind uwtable ssp { entry: diff --git a/test/Transforms/LoopRotate/basic.ll b/test/Transforms/LoopRotate/basic.ll index 78878f9fa66..6b92a6ecac1 100644 --- a/test/Transforms/LoopRotate/basic.ll +++ b/test/Transforms/LoopRotate/basic.ll @@ -5,7 +5,7 @@ target triple = "x86_64-apple-darwin10.0.0" ; PR5319 - The "arrayidx" gep should be hoisted, not duplicated. We should ; end up with one phi node. define void @test1() nounwind ssp { -; CHECK: @test1 +; CHECK-LABEL: @test1( entry: %array = alloca [20 x i32], align 16 br label %for.cond @@ -33,7 +33,7 @@ for.end: ; preds = %for.cond declare void @g(i32*) -; CHECK: @test2 +; CHECK-LABEL: @test2( define void @test2() nounwind ssp { entry: %array = alloca [20 x i32], align 16 diff --git a/test/Transforms/LoopRotate/multiple-exits.ll b/test/Transforms/LoopRotate/multiple-exits.ll index 675d71f60da..cc8738e479d 100644 --- a/test/Transforms/LoopRotate/multiple-exits.ll +++ b/test/Transforms/LoopRotate/multiple-exits.ll @@ -32,7 +32,7 @@ return: ; preds = %for.cond, %land.rhs %retval.0 = phi i32 [ 1000, %land.rhs ], [ %sum.0, %for.cond ] ret i32 %retval.0 -; CHECK: @test1 +; CHECK-LABEL: @test1( ; CHECK: for.cond1.preheader: ; CHECK: %sum.04 = phi i32 [ 0, %entry ], [ %sum.1.lcssa, %for.cond.loopexit ] ; CHECK: br label %for.cond1 @@ -73,7 +73,7 @@ return.loopexit: ; preds = %for.cond return: ; preds = %return.loopexit, %a ret void -; CHECK: @test2 +; CHECK-LABEL: @test2( ; CHECK: if.end: ; CHECK: %inc = add i32 %i.02, 1 ; CHECK: %cmp = icmp eq i32 %inc, %x diff --git a/test/Transforms/LoopRotate/simplifylatch.ll b/test/Transforms/LoopRotate/simplifylatch.ll index 037bb2042f9..d646cb9d6cb 100644 --- a/test/Transforms/LoopRotate/simplifylatch.ll +++ b/test/Transforms/LoopRotate/simplifylatch.ll @@ -3,7 +3,7 @@ @mode_table = global [4 x i32] zeroinitializer ; <[4 x i32]*> [#uses=1] -; CHECK: @f +; CHECK-LABEL: @f( ; CHECK-NOT: bb4 define i8 @f() { entry: diff --git a/test/Transforms/LoopSimplify/preserve-scev.ll b/test/Transforms/LoopSimplify/preserve-scev.ll index 854c612f02d..89626b2af51 100644 --- a/test/Transforms/LoopSimplify/preserve-scev.ll +++ b/test/Transforms/LoopSimplify/preserve-scev.ll @@ -50,7 +50,7 @@ return: ; preds = %for.body18, %for.bo declare void @foo() nounwind ; Notify SCEV when removing an ExitingBlock. -; CHECK: @mergeExit +; CHECK-LABEL: @mergeExit( ; CHECK: while.cond191: ; CHECK: br i1 %or.cond, label %while.body197 ; CHECK-NOT: land.rhs: diff --git a/test/Transforms/LoopStrengthReduce/2011-10-03-CritEdgeMerge.ll b/test/Transforms/LoopStrengthReduce/2011-10-03-CritEdgeMerge.ll index af3a53708b4..ccf8ebdd5d1 100644 --- a/test/Transforms/LoopStrengthReduce/2011-10-03-CritEdgeMerge.ll +++ b/test/Transforms/LoopStrengthReduce/2011-10-03-CritEdgeMerge.ll @@ -5,7 +5,7 @@ target triple = "x86-apple-darwin" ; Verify that identical edges are merged. rdar://problem/6453893 -; CHECK: @test1 +; CHECK-LABEL: @test1( ; CHECK: bb89: ; CHECK: phi i8* [ %lsr.iv.next1, %bbA.bb89_crit_edge ], [ %lsr.iv.next1, %bbB.bb89_crit_edge ]{{$}} @@ -43,7 +43,7 @@ exit: } ; Handle single-predecessor phis: PR13756 -; CHECK: @test2 +; CHECK-LABEL: @test2( ; CHECK: bb89: ; CHECK: phi i8* [ %lsr.iv.next1, %bbA ], [ %lsr.iv.next1, %bbA ], [ %lsr.iv.next1, %bbA ]{{$}} define i8* @test2() { diff --git a/test/Transforms/LoopStrengthReduce/2011-10-06-ReusePhi.ll b/test/Transforms/LoopStrengthReduce/2011-10-06-ReusePhi.ll index 1ee9bb409d9..83963e3126d 100644 --- a/test/Transforms/LoopStrengthReduce/2011-10-06-ReusePhi.ll +++ b/test/Transforms/LoopStrengthReduce/2011-10-06-ReusePhi.ll @@ -5,7 +5,7 @@ target triple = "x86-apple-darwin" -; CHECK: @test +; CHECK-LABEL: @test( ; multiplies are hoisted out of the loop ; CHECK: while.body.lr.ph: ; CHECK: mul i64 diff --git a/test/Transforms/LoopStrengthReduce/2011-10-13-SCEVChain.ll b/test/Transforms/LoopStrengthReduce/2011-10-13-SCEVChain.ll index 4718529bfd5..484fefaad41 100644 --- a/test/Transforms/LoopStrengthReduce/2011-10-13-SCEVChain.ll +++ b/test/Transforms/LoopStrengthReduce/2011-10-13-SCEVChain.ll @@ -8,7 +8,7 @@ target triple = "x86_64-apple-darwin" ; Verify that -loop-reduce runs without "hanging" and reuses post-inc ; expansions. -; CHECK: @test +; CHECK-LABEL: @test( ; CHECK: icmp ; CHECK: icmp ; CHECK: icmp diff --git a/test/Transforms/LoopStrengthReduce/2011-10-14-IntPtr.ll b/test/Transforms/LoopStrengthReduce/2011-10-14-IntPtr.ll index 60cc7a51632..068b716651d 100644 --- a/test/Transforms/LoopStrengthReduce/2011-10-14-IntPtr.ll +++ b/test/Transforms/LoopStrengthReduce/2011-10-14-IntPtr.ll @@ -5,7 +5,7 @@ target triple = "x86_64-apple-darwin" -; CHECK: @test +; CHECK-LABEL: @test( ; CHECK: phi ; CHECK-NOT: phi define void @test(i32 %rowStride) ssp align 2 { diff --git a/test/Transforms/LoopStrengthReduce/2011-12-19-PostincQuadratic.ll b/test/Transforms/LoopStrengthReduce/2011-12-19-PostincQuadratic.ll index 392a8bcf89d..6c128feb541 100644 --- a/test/Transforms/LoopStrengthReduce/2011-12-19-PostincQuadratic.ll +++ b/test/Transforms/LoopStrengthReduce/2011-12-19-PostincQuadratic.ll @@ -9,7 +9,7 @@ target triple = "i386-unknown-freebsd10.0" @b = external global [121 x i32] -; CHECK: @vb +; CHECK-LABEL: @vb( ; Outer recurrence: ; CHECK: %lsr.iv1 = phi [121 x i32]* ; Inner recurrence: diff --git a/test/Transforms/LoopStrengthReduce/2012-01-02-nopreheader.ll b/test/Transforms/LoopStrengthReduce/2012-01-02-nopreheader.ll index d7f5723188c..87dd39730ec 100644 --- a/test/Transforms/LoopStrengthReduce/2012-01-02-nopreheader.ll +++ b/test/Transforms/LoopStrengthReduce/2012-01-02-nopreheader.ll @@ -11,7 +11,7 @@ target triple = "i386-apple-darwin" ; cannot find a preheader, so they should be expanded in the loop header ; (bb7.lr.ph.us) below the existing phi i.12.us. ; Currently, LSR won't kick in on such loops. -; CHECK: @nopreheader +; CHECK-LABEL: @nopreheader( ; CHECK: bb7.us: ; CHECK-NOT: phi float* ; CHECK: %j.01.us = phi i32 @@ -54,7 +54,7 @@ return: ; preds = %bb9, %bb9.us, %bb10 ; In this case, SCEVExpander simply cannot materialize the AddRecExpr ; that LSR picks. We must detect that %bb8.preheader does not have a ; preheader and avoid performing LSR on %bb7. -; CHECK: @nopreheader2 +; CHECK-LABEL: @nopreheader2( ; CHECK: bb7: ; CHECK: %indvar = phi i32 define fastcc void @nopreheader2([200 x i32]* nocapture %Array2) nounwind { diff --git a/test/Transforms/LoopStrengthReduce/2012-01-16-nopreheader.ll b/test/Transforms/LoopStrengthReduce/2012-01-16-nopreheader.ll index 3036a7e38bb..94a037ec28e 100644 --- a/test/Transforms/LoopStrengthReduce/2012-01-16-nopreheader.ll +++ b/test/Transforms/LoopStrengthReduce/2012-01-16-nopreheader.ll @@ -8,7 +8,7 @@ target triple = "x86_64-apple-darwin10.0.0" ; while.cond197 is a dominates the simplified loop while.cond238 but ; has no with no preheader. ; -; CHECK: @nopreheader +; CHECK-LABEL: @nopreheader( ; CHECK: %while.cond238 ; CHECK: phi i64 ; CHECK-NOT: phi diff --git a/test/Transforms/LoopStrengthReduce/2012-03-15-nopreheader.ll b/test/Transforms/LoopStrengthReduce/2012-03-15-nopreheader.ll index 0172492edc9..5fa3838c829 100644 --- a/test/Transforms/LoopStrengthReduce/2012-03-15-nopreheader.ll +++ b/test/Transforms/LoopStrengthReduce/2012-03-15-nopreheader.ll @@ -7,7 +7,7 @@ target triple = "x86_64-apple-darwin10.0.0" ; IVUsers should not consider tmp128 a valid user because it is not in a ; simplified loop nest. -; CHECK: @nopreheader +; CHECK-LABEL: @nopreheader( ; CHECK: for.cond: ; CHECK: %tmp128 = add i64 %0, %indvar65 define void @nopreheader(i8* %cmd) nounwind ssp { diff --git a/test/Transforms/LoopStrengthReduce/2012-07-13-ExpandUDiv.ll b/test/Transforms/LoopStrengthReduce/2012-07-13-ExpandUDiv.ll index 8bac639ae55..ea1d65b1652 100644 --- a/test/Transforms/LoopStrengthReduce/2012-07-13-ExpandUDiv.ll +++ b/test/Transforms/LoopStrengthReduce/2012-07-13-ExpandUDiv.ll @@ -10,7 +10,7 @@ target triple = "x86_64-apple-darwin" @g_3 = global i32 0, align 4 ; Ensure that %div.i.i.us is not hoisted. -; CHECK: @main +; CHECK-LABEL: @main( ; CHECK: for.body.i.i.us: ; CHECK: %div.i.i.i.us ; CHECK: %cmp5.i.i.us diff --git a/test/Transforms/LoopStrengthReduce/2013-01-05-IndBr.ll b/test/Transforms/LoopStrengthReduce/2013-01-05-IndBr.ll index bce234cd406..8a5a0a4c5fc 100644 --- a/test/Transforms/LoopStrengthReduce/2013-01-05-IndBr.ll +++ b/test/Transforms/LoopStrengthReduce/2013-01-05-IndBr.ll @@ -5,7 +5,7 @@ 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-n8:16:32-S128" -; CHECK: @test +; CHECK-LABEL: @test( ; CHECK: bb8: ; CHECK-NEXT: phi i8 ; CHECK-NEXT: phi i8 diff --git a/test/Transforms/LoopStrengthReduce/2013-01-14-ReuseCast.ll b/test/Transforms/LoopStrengthReduce/2013-01-14-ReuseCast.ll index 652eb06225c..79dbf0d5370 100644 --- a/test/Transforms/LoopStrengthReduce/2013-01-14-ReuseCast.ll +++ b/test/Transforms/LoopStrengthReduce/2013-01-14-ReuseCast.ll @@ -8,7 +8,7 @@ target 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-S128" ; Verify that nothing uses the "dead" ptrtoint from "undef". -; CHECK: @VerifyDiagnosticConsumerTest +; CHECK-LABEL: @VerifyDiagnosticConsumerTest( ; CHECK: bb: ; "dead" ptrpoint not emitted (or dead code eliminated) with ; current LSR cost model. diff --git a/test/Transforms/LoopStrengthReduce/X86/2011-07-20-DoubleIV.ll b/test/Transforms/LoopStrengthReduce/X86/2011-07-20-DoubleIV.ll index a932b479258..2fe62e39fc9 100644 --- a/test/Transforms/LoopStrengthReduce/X86/2011-07-20-DoubleIV.ll +++ b/test/Transforms/LoopStrengthReduce/X86/2011-07-20-DoubleIV.ll @@ -5,7 +5,7 @@ ; rdar://9786536 ; First, make sure LSR doesn't crash on an empty IVUsers list. -; CHECK: @dummyIV +; CHECK-LABEL: @dummyIV( ; CHECK-NOT: phi ; CHECK-NOT: sitofp ; CHECK: br @@ -24,7 +24,7 @@ for.end: } ; Now check that the computed double constant is correct. -; CHECK: @doubleIV +; CHECK-LABEL: @doubleIV( ; CHECK: phi double [ -3.900000e+01, %entry ] ; CHECK: br define void @doubleIV() nounwind { diff --git a/test/Transforms/LoopStrengthReduce/X86/2011-12-04-loserreg.ll b/test/Transforms/LoopStrengthReduce/X86/2011-12-04-loserreg.ll index eedfc200f48..fad52410ac8 100644 --- a/test/Transforms/LoopStrengthReduce/X86/2011-12-04-loserreg.ll +++ b/test/Transforms/LoopStrengthReduce/X86/2011-12-04-loserreg.ll @@ -14,7 +14,7 @@ target 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-S128" target triple = "x86_64-apple-darwin" -; CHECK: @test +; CHECK-LABEL: @test( ; CHECK: for.body: ; CHECK: %lsr.iv ; CHECK-NOT: %dummyout diff --git a/test/Transforms/LoopStrengthReduce/ivchain.ll b/test/Transforms/LoopStrengthReduce/ivchain.ll index ce7ad198de4..233800b71c6 100644 --- a/test/Transforms/LoopStrengthReduce/ivchain.ll +++ b/test/Transforms/LoopStrengthReduce/ivchain.ll @@ -6,7 +6,7 @@ %struct = type { i8*, i8*, i16, i64, i16, i16, i16, i64, i64, i16, i8*, i64, i64, i64 } -; CHECK: @test +; CHECK-LABEL: @test( ; CHECK: for.body: ; CHECK: lsr.iv = phi %struct ; CHECK: br diff --git a/test/Transforms/LoopStrengthReduce/scaling_factor_cost_crash.ll b/test/Transforms/LoopStrengthReduce/scaling_factor_cost_crash.ll index cd8fec3d2c8..a652a7661e2 100644 --- a/test/Transforms/LoopStrengthReduce/scaling_factor_cost_crash.ll +++ b/test/Transforms/LoopStrengthReduce/scaling_factor_cost_crash.ll @@ -3,7 +3,7 @@ target datalayout = "e-p:32:32:32-i1:8:8-i8:8:8-i16:16:16-i32:32:32-i64:64:64-f3 target triple = "i686-pc-win32" ; Assertion failed: (CurScaleCost >= 0 && "Legal addressing mode has an illegal cost!") -; CHECK: @scalingFactorCrash +; CHECK-LABEL: @scalingFactorCrash( define void @scalingFactorCrash() { br i1 undef, label %1, label %24 diff --git a/test/Transforms/LoopStrengthReduce/uglygep.ll b/test/Transforms/LoopStrengthReduce/uglygep.ll index 10c77d5f645..e744cf92256 100644 --- a/test/Transforms/LoopStrengthReduce/uglygep.ll +++ b/test/Transforms/LoopStrengthReduce/uglygep.ll @@ -52,7 +52,7 @@ bb14: ; preds = %bb14, %bb10 } define fastcc void @TransformLine() nounwind { -; CHECK: @TransformLine +; CHECK-LABEL: @TransformLine( bb: br label %loop0 diff --git a/test/Transforms/LoopUnroll/2011-08-08-PhiUpdate.ll b/test/Transforms/LoopUnroll/2011-08-08-PhiUpdate.ll index cd954c80ec3..bf6d6d5989c 100644 --- a/test/Transforms/LoopUnroll/2011-08-08-PhiUpdate.ll +++ b/test/Transforms/LoopUnroll/2011-08-08-PhiUpdate.ll @@ -30,7 +30,7 @@ if.then: ; preds = %if.else, %entry ; PR7318: assertion failure after doing a simple loop unroll ; -; CHECK: @test2 +; CHECK-LABEL: @test2( ; CHECK: bb1.bb2_crit_edge: ; CHECK: %.lcssa = phi i32 [ %{{[2468]}}, %bb1{{.*}} ], [ %{{[2468]}}, %bb1{{.*}} ], [ %{{[2468]}}, %bb1{{.*}} ], [ %{{[2468]}}, %bb1{{.*}} ] ; CHECK: bb1.3: @@ -67,7 +67,7 @@ bb2: ; preds = %bb1.bb2_crit_edge, ; Check phi update for loop with an early-exit. ; -; CHECK: @test3 +; CHECK-LABEL: @test3( ; CHECK: return.loopexit: ; CHECK: %tmp7.i.lcssa = phi i32 [ %tmp7.i{{.*}}, %land.lhs.true{{.*}} ], [ %tmp7.i{{.*}}, %land.lhs.true{{.*}} ], [ %tmp7.i{{.*}}, %land.lhs.true{{.*}} ], [ %tmp7.i{{.*}}, %land.lhs.true{{.*}} ] ; CHECK: exit.3: diff --git a/test/Transforms/LoopUnroll/2011-08-09-PhiUpdate.ll b/test/Transforms/LoopUnroll/2011-08-09-PhiUpdate.ll index c1221f595ac..cf5f5e0011e 100644 --- a/test/Transforms/LoopUnroll/2011-08-09-PhiUpdate.ll +++ b/test/Transforms/LoopUnroll/2011-08-09-PhiUpdate.ll @@ -12,10 +12,10 @@ declare i32 @getval() nounwind ; Check that the loop exit merges values from all the iterations. This ; could be a tad fragile, but it's a good test. ; -; CHECK: @foo +; CHECK-LABEL: @foo( ; CHECK: return: ; CHECK: %retval.0 = phi i32 [ %tmp7.i, %land.lhs.true ], [ 0, %do.cond ], [ %tmp7.i.1, %land.lhs.true.1 ], [ 0, %do.cond.1 ], [ %tmp7.i.2, %land.lhs.true.2 ], [ 0, %do.cond.2 ], [ %tmp7.i.3, %land.lhs.true.3 ], [ 0, %do.cond.3 ] -; CHECK-NOT: @bar +; CHECK-NOT-LABEL: @bar( ; CHECK: bar.exit.3 define i32 @foo() uwtable ssp align 2 { entry: diff --git a/test/Transforms/LoopUnroll/2011-10-01-NoopTrunc.ll b/test/Transforms/LoopUnroll/2011-10-01-NoopTrunc.ll index 7fb471ea750..617d4dbe8fd 100644 --- a/test/Transforms/LoopUnroll/2011-10-01-NoopTrunc.ll +++ b/test/Transforms/LoopUnroll/2011-10-01-NoopTrunc.ll @@ -8,7 +8,7 @@ target 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" ; Check that for.body was unrolled 19 times. -; CHECK: @test +; CHECK-LABEL: @test( ; CHECK: %0 = load ; CHECK: %conv = sext i8 %0 to i32 ; CHECK: %add.1 = add nsw i32 %conv.1, %conv diff --git a/test/Transforms/LoopUnroll/basic.ll b/test/Transforms/LoopUnroll/basic.ll index ab5bc568ede..2bfd3e6de8f 100644 --- a/test/Transforms/LoopUnroll/basic.ll +++ b/test/Transforms/LoopUnroll/basic.ll @@ -3,7 +3,7 @@ ; This should not unroll since the address of the loop header is taken. -; CHECK: @test1 +; CHECK-LABEL: @test1( ; CHECK: store i8* blockaddress(@test1, %l1), i8** %P ; CHECK: l1: ; CHECK-NEXT: phi i32 @@ -25,7 +25,7 @@ l2: ; preds = %l1 ; This should not unroll since the call is 'noduplicate'. -; CHECK: @test2 +; CHECK-LABEL: @test2( define i32 @test2(i8** %P) nounwind ssp { entry: br label %l1 diff --git a/test/Transforms/LoopUnroll/pr14167.ll b/test/Transforms/LoopUnroll/pr14167.ll index 205ae44b72e..9aac70115d9 100644 --- a/test/Transforms/LoopUnroll/pr14167.ll +++ b/test/Transforms/LoopUnroll/pr14167.ll @@ -4,7 +4,7 @@ target triple = "powerpc64-bgq-linux" define void @test1() nounwind { ; Ensure that we don't crash when the trip count == -1. -; CHECK: @test1 +; CHECK-LABEL: @test1( entry: br label %for.cond2.preheader diff --git a/test/Transforms/LoopUnroll/scevunroll.ll b/test/Transforms/LoopUnroll/scevunroll.ll index d2645a79d0e..c3086e8335f 100644 --- a/test/Transforms/LoopUnroll/scevunroll.ll +++ b/test/Transforms/LoopUnroll/scevunroll.ll @@ -7,7 +7,7 @@ ; Completely unroll loops without a canonical IV. ; -; CHECK: @sansCanonical +; CHECK-LABEL: @sansCanonical( ; CHECK-NOT: phi ; CHECK-NOT: icmp ; CHECK: ret @@ -35,7 +35,7 @@ exit: ; latch block. Canonical unrolling incorrectly unrolls it, but SCEV ; unrolling does not. ; -; CHECK: @earlyLoopTest +; CHECK-LABEL: @earlyLoopTest( ; CHECK: tail: ; CHECK-NOT: br ; CHECK: br i1 %cmp2, label %loop, label %exit2 @@ -69,7 +69,7 @@ exit2: ; SCEV cannot currently unroll this loop. ; It should ideally detect a trip count of 5. ; rdar:14038809 [SCEV]: Optimize trip count computation for multi-exit loops. -; CHECK: @multiExit +; CHECK-LABEL: @multiExit( ; CHECKFIXME: getelementptr i32* %base, i32 10 ; CHECKFIXME-NEXT: load i32* ; CHECKFIXME: br i1 false, label %l2.10, label %exit1 @@ -103,7 +103,7 @@ exit2: ; LoopUnroll utility uses this assumption to optimize the latch ; block's branch. ; -; CHECK: @multiExitIncomplete +; CHECK-LABEL: @multiExitIncomplete( ; CHECK: l3: ; CHECK-NOT: br ; CHECK: br i1 %cmp3, label %l1, label %exit3 @@ -137,7 +137,7 @@ exit3: ; When loop unroll merges a loop exit with one of its parent loop's ; exits, SCEV must forget its ExitNotTaken info. ; -; CHECK: @nestedUnroll +; CHECK-LABEL: @nestedUnroll( ; CHECK-NOT: br i1 ; CHECK: for.body87: define void @nestedUnroll() nounwind { @@ -183,7 +183,7 @@ for.body87: ; the loop latch's exit count of zero is an upper bound on the number ; of iterations. ; -; CHECK: @nsw_latch +; CHECK-LABEL: @nsw_latch( ; CHECK: for.body: ; CHECK: %b.03 = phi i32 [ 0, %entry ], [ %add, %for.cond ] ; CHECK: return: diff --git a/test/Transforms/LoopUnroll/unloop.ll b/test/Transforms/LoopUnroll/unloop.ll index 9a938cc2877..b98b4a3fffb 100644 --- a/test/Transforms/LoopUnroll/unloop.ll +++ b/test/Transforms/LoopUnroll/unloop.ll @@ -7,7 +7,7 @@ declare i1 @check() nounwind ; Ensure that tail->inner is removed and rely on verify-loopinfo to ; check soundness. ; -; CHECK: @skiplevelexit +; CHECK-LABEL: @skiplevelexit( ; CHECK: tail: ; CHECK-NOT: br ; CHECK: ret void @@ -38,7 +38,7 @@ exit: ; Ensure that only the middle loop is removed and rely on verify-loopinfo to ; check soundness. ; -; CHECK: @unloopNested +; CHECK-LABEL: @unloopNested( ; Outer loop control. ; CHECK: while.body: ; CHECK: br i1 %cmp3, label %if.then, label %if.end @@ -128,7 +128,7 @@ return: ; ; This test must be disabled until trip count computation can be optimized... ; rdar:14038809 [SCEV]: Optimize trip count computation for multi-exit loops. -; CHECKFIXME: @unloopDeepNested +; CHECKFIXME-LABEL: @unloopDeepNested( ; Inner-inner loop control. ; CHECKFIXME: while.cond.us.i: ; CHECKFIXME: br i1 %cmp.us.i, label %next_data.exit, label %while.body.us.i @@ -248,7 +248,7 @@ while.end: ; Ensure that only the middle loop is removed and rely on verify-loopinfo to ; check soundness. ; -; CHECK: @unloopIrreducible +; CHECK-LABEL: @unloopIrreducible( ; Irreducible loop. ; CHECK: for.inc117: ; CHECK: br label %for.cond103t @@ -326,7 +326,7 @@ for.end166: ; Ensure that only the loop is removed and rely on verify-loopinfo to ; check soundness. ; -; CHECK: @unloopCriticalEdge +; CHECK-LABEL: @unloopCriticalEdge( ; CHECK: while.cond.outer.i.loopexit.split: ; CHECK: br label %while.body ; CHECK: while.body: @@ -431,7 +431,7 @@ return: ; preds = %sw.bb304 } ; PR11335: the most deeply nested block should be removed from the outer loop. -; CHECK: @removeSubloopBlocks2 +; CHECK-LABEL: @removeSubloopBlocks2( ; CHECK: for.cond3: ; CHECK-NOT: br ; CHECK: ret void diff --git a/test/Transforms/LoopUnswitch/basictest.ll b/test/Transforms/LoopUnswitch/basictest.ll index e98d82b6522..85e44eca9b6 100644 --- a/test/Transforms/LoopUnswitch/basictest.ll +++ b/test/Transforms/LoopUnswitch/basictest.ll @@ -32,7 +32,7 @@ return: ; preds = %endif, %then ; This simple test would normally unswitch, but should be inhibited by the presence of ; the noduplicate call. -; CHECK: @test2 +; CHECK-LABEL: @test2( define i32 @test2(i32* %var) { %mem = alloca i32 store i32 2, i32* %mem diff --git a/test/Transforms/LoopUnswitch/infinite-loop.ll b/test/Transforms/LoopUnswitch/infinite-loop.ll index 8261e389370..e79d874d9ca 100644 --- a/test/Transforms/LoopUnswitch/infinite-loop.ll +++ b/test/Transforms/LoopUnswitch/infinite-loop.ll @@ -11,7 +11,7 @@ ; STATS: 2 loop-unswitch - Number of branches unswitched ; STATS: 1 loop-unswitch - Number of unswitches that are trivial -; CHECK: @func_16 +; CHECK-LABEL: @func_16( ; CHECK-NEXT: entry: ; CHECK-NEXT: br i1 %a, label %entry.split, label %abort0.split diff --git a/test/Transforms/LoopVectorize/12-12-11-if-conv.ll b/test/Transforms/LoopVectorize/12-12-11-if-conv.ll index 6ef101074de..1e1396f8008 100644 --- a/test/Transforms/LoopVectorize/12-12-11-if-conv.ll +++ b/test/Transforms/LoopVectorize/12-12-11-if-conv.ll @@ -3,7 +3,7 @@ target 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-S128" target triple = "x86_64-apple-macosx10.8.0" -;CHECK: @foo +;CHECK-LABEL: @foo( ;CHECK: icmp eq <4 x i32> ;CHECK: select <4 x i1> ;CHECK: ret i32 diff --git a/test/Transforms/LoopVectorize/ARM/arm-unroll.ll b/test/Transforms/LoopVectorize/ARM/arm-unroll.ll index c8d307f5d44..39363ab2d80 100644 --- a/test/Transforms/LoopVectorize/ARM/arm-unroll.ll +++ b/test/Transforms/LoopVectorize/ARM/arm-unroll.ll @@ -4,11 +4,11 @@ target datalayout = "e-p:32:32:32-i1:8:32-i8:8:32-i16:16:32-i32:32:32-i64:32:64-f32:32:32-f64:32:64-v64:32:64-v128:32:128-a0:0:32-n32-S32" target triple = "thumbv7-apple-ios3.0.0" -;CHECK: @foo +;CHECK-LABEL: @foo( ;CHECK: load <4 x i32> ;CHECK-NOT: load <4 x i32> ;CHECK: ret -;SWIFT: @foo +;SWIFT-LABEL: @foo( ;SWIFT: load <4 x i32> ;SWIFT: load <4 x i32> ;SWIFT: ret diff --git a/test/Transforms/LoopVectorize/ARM/gcc-examples.ll b/test/Transforms/LoopVectorize/ARM/gcc-examples.ll index 6a68e81bcae..f2bd0ac200d 100644 --- a/test/Transforms/LoopVectorize/ARM/gcc-examples.ll +++ b/test/Transforms/LoopVectorize/ARM/gcc-examples.ll @@ -8,7 +8,7 @@ target triple = "thumbv7-apple-ios3.0.0" @a = common global [2048 x i32] zeroinitializer, align 16 ; Select VF = 8; -;CHECK: @example1 +;CHECK-LABEL: @example1( ;CHECK: load <4 x i32> ;CHECK: add nsw <4 x i32> ;CHECK: store <4 x i32> @@ -34,7 +34,7 @@ define void @example1() nounwind uwtable ssp { ret void } -;CHECK: @example10b +;CHECK-LABEL: @example10b( ;CHECK: load <4 x i16> ;CHECK: sext <4 x i16> ;CHECK: store <4 x i32> diff --git a/test/Transforms/LoopVectorize/X86/avx1.ll b/test/Transforms/LoopVectorize/X86/avx1.ll index 6c0366eae97..01c912567b6 100644 --- a/test/Transforms/LoopVectorize/X86/avx1.ll +++ b/test/Transforms/LoopVectorize/X86/avx1.ll @@ -3,7 +3,7 @@ target 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-S128" target triple = "x86_64-apple-macosx10.8.0" -;CHECK: @read_mod_write_single_ptr +;CHECK-LABEL: @read_mod_write_single_ptr( ;CHECK: load <8 x float> ;CHECK: ret i32 define i32 @read_mod_write_single_ptr(float* nocapture %a, i32 %n) nounwind uwtable ssp { @@ -26,7 +26,7 @@ define i32 @read_mod_write_single_ptr(float* nocapture %a, i32 %n) nounwind uwta } -;CHECK: @read_mod_i64 +;CHECK-LABEL: @read_mod_i64( ;CHECK: load <2 x i64> ;CHECK: ret i32 define i32 @read_mod_i64(i64* nocapture %a, i32 %n) nounwind uwtable ssp { diff --git a/test/Transforms/LoopVectorize/X86/conversion-cost.ll b/test/Transforms/LoopVectorize/X86/conversion-cost.ll index 760d28deaf2..0af562db847 100644 --- a/test/Transforms/LoopVectorize/X86/conversion-cost.ll +++ b/test/Transforms/LoopVectorize/X86/conversion-cost.ll @@ -3,7 +3,7 @@ target 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-S128" target triple = "x86_64-apple-macosx10.8.0" -;CHECK: @conversion_cost1 +;CHECK-LABEL: @conversion_cost1( ;CHECK: store <32 x i8> ;CHECK: ret define i32 @conversion_cost1(i32 %n, i8* nocapture %A, float* nocapture %B) nounwind uwtable ssp { @@ -24,7 +24,7 @@ define i32 @conversion_cost1(i32 %n, i8* nocapture %A, float* nocapture %B) noun ret i32 undef } -;CHECK: @conversion_cost2 +;CHECK-LABEL: @conversion_cost2( ;CHECK: <2 x float> ;CHECK: ret define i32 @conversion_cost2(i32 %n, i8* nocapture %A, float* nocapture %B) nounwind uwtable ssp { diff --git a/test/Transforms/LoopVectorize/X86/gcc-examples.ll b/test/Transforms/LoopVectorize/X86/gcc-examples.ll index d2d0eac305f..e1113fdd911 100644 --- a/test/Transforms/LoopVectorize/X86/gcc-examples.ll +++ b/test/Transforms/LoopVectorize/X86/gcc-examples.ll @@ -9,13 +9,13 @@ target triple = "x86_64-apple-macosx10.8.0" @a = common global [2048 x i32] zeroinitializer, align 16 ; Select VF = 8; -;CHECK: @example1 +;CHECK-LABEL: @example1( ;CHECK: load <4 x i32> ;CHECK: add nsw <4 x i32> ;CHECK: store <4 x i32> ;CHECK: ret void -;UNROLL: @example1 +;UNROLL-LABEL: @example1( ;UNROLL: load <4 x i32> ;UNROLL: load <4 x i32> ;UNROLL: add nsw <4 x i32> @@ -45,12 +45,12 @@ define void @example1() nounwind uwtable ssp { } ; Select VF=4 because sext <8 x i1> to <8 x i32> is expensive. -;CHECK: @example10b +;CHECK-LABEL: @example10b( ;CHECK: load <4 x i16> ;CHECK: sext <4 x i16> ;CHECK: store <4 x i32> ;CHECK: ret void -;UNROLL: @example10b +;UNROLL-LABEL: @example10b( ;UNROLL: load <4 x i16> ;UNROLL: load <4 x i16> ;UNROLL: store <4 x i32> diff --git a/test/Transforms/LoopVectorize/X86/illegal-parallel-loop-uniform-write.ll b/test/Transforms/LoopVectorize/X86/illegal-parallel-loop-uniform-write.ll index 30579cebb1b..d6120e76cc0 100644 --- a/test/Transforms/LoopVectorize/X86/illegal-parallel-loop-uniform-write.ll +++ b/test/Transforms/LoopVectorize/X86/illegal-parallel-loop-uniform-write.ll @@ -3,7 +3,7 @@ target 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-S128" target triple = "x86_64-unknown-linux-gnu" -;CHECK: @foo +;CHECK-LABEL: @foo( ;CHECK-NOT: <4 x i32> ;CHECK: ret void diff --git a/test/Transforms/LoopVectorize/X86/parallel-loops.ll b/test/Transforms/LoopVectorize/X86/parallel-loops.ll index 681a815d32a..7e156a9edad 100644 --- a/test/Transforms/LoopVectorize/X86/parallel-loops.ll +++ b/test/Transforms/LoopVectorize/X86/parallel-loops.ll @@ -12,7 +12,7 @@ target triple = "x86_64-unknown-linux-gnu" ; } ;} -;CHECK: @loop +;CHECK-LABEL: @loop( ;CHECK-NOT: <4 x i32> define void @loop(i32* nocapture %a, i32* nocapture %b) nounwind uwtable { entry: @@ -42,7 +42,7 @@ for.end: ; preds = %for.body ; The same loop with parallel loop metadata added to the loop branch ; and the memory instructions. -;CHECK: @parallel_loop +;CHECK-LABEL: @parallel_loop( ;CHECK: <4 x i32> define void @parallel_loop(i32* nocapture %a, i32* nocapture %b) nounwind uwtable { entry: @@ -74,7 +74,7 @@ for.end: ; preds = %for.body ; The same loop with an illegal parallel loop metadata: the memory ; accesses refer to a different loop's identifier. -;CHECK: @mixed_metadata +;CHECK-LABEL: @mixed_metadata( ;CHECK-NOT: <4 x i32> define void @mixed_metadata(i32* nocapture %a, i32* nocapture %b) nounwind uwtable { diff --git a/test/Transforms/LoopVectorize/X86/reduction-crash.ll b/test/Transforms/LoopVectorize/X86/reduction-crash.ll index f580846a022..3957a554142 100644 --- a/test/Transforms/LoopVectorize/X86/reduction-crash.ll +++ b/test/Transforms/LoopVectorize/X86/reduction-crash.ll @@ -5,7 +5,7 @@ target triple = "i386-apple-darwin" ; PR15344 define void @test1(float* nocapture %arg, i32 %arg1) nounwind { -; CHECK: @test1 +; CHECK-LABEL: @test1( ; CHECK: preheader ; CHECK: insertelement <2 x double> zeroinitializer, double %tmp, i32 0 ; CHECK: vector.memcheck diff --git a/test/Transforms/LoopVectorize/X86/small-size.ll b/test/Transforms/LoopVectorize/X86/small-size.ll index f390b33c038..14ac417bb57 100644 --- a/test/Transforms/LoopVectorize/X86/small-size.ll +++ b/test/Transforms/LoopVectorize/X86/small-size.ll @@ -20,7 +20,7 @@ target triple = "x86_64-apple-macosx10.8.0" @dj = common global [1024 x i32] zeroinitializer, align 16 ; We can optimize this test without a tail. -;CHECK: @example1 +;CHECK-LABEL: @example1( ;CHECK: load <4 x i32> ;CHECK: add nsw <4 x i32> ;CHECK: store <4 x i32> @@ -47,7 +47,7 @@ define void @example1() optsize { } ; Can't vectorize in 'optsize' mode because we need a tail. -;CHECK: @example2 +;CHECK-LABEL: @example2( ;CHECK-NOT: store <4 x i32> ;CHECK: ret void define void @example2(i32 %n, i32 %x) optsize { @@ -92,7 +92,7 @@ define void @example2(i32 %n, i32 %x) optsize { } ; N is unknown, we need a tail. Can't vectorize. -;CHECK: @example3 +;CHECK-LABEL: @example3( ;CHECK-NOT: <4 x i32> ;CHECK: ret void define void @example3(i32 %n, i32* noalias nocapture %p, i32* noalias nocapture %q) optsize { @@ -117,7 +117,7 @@ define void @example3(i32 %n, i32* noalias nocapture %p, i32* noalias nocapture ; We can't vectorize this one because we need a runtime ptr check. -;CHECK: @example23 +;CHECK-LABEL: @example23( ;CHECK-NOT: <4 x i32> ;CHECK: ret void define void @example23(i16* nocapture %src, i32* nocapture %dst) optsize { @@ -143,7 +143,7 @@ define void @example23(i16* nocapture %src, i32* nocapture %dst) optsize { ; We CAN vectorize this example because the pointers are marked as noalias. -;CHECK: @example23b +;CHECK-LABEL: @example23b( ;CHECK: <4 x i32> ;CHECK: ret void define void @example23b(i16* noalias nocapture %src, i32* noalias nocapture %dst) optsize { diff --git a/test/Transforms/LoopVectorize/X86/unroll-small-loops.ll b/test/Transforms/LoopVectorize/X86/unroll-small-loops.ll index ef63a145d0c..ea107dc4dc5 100644 --- a/test/Transforms/LoopVectorize/X86/unroll-small-loops.ll +++ b/test/Transforms/LoopVectorize/X86/unroll-small-loops.ll @@ -2,7 +2,7 @@ target 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-S128" target triple = "x86_64-apple-macosx10.8.0" -;CHECK: @foo +;CHECK-LABEL: @foo( ;CHECK: load <4 x i32> ;CHECK-NOT: load <4 x i32> ;CHECK: store <4 x i32> @@ -26,7 +26,7 @@ define i32 @foo(i32* nocapture %A) nounwind uwtable ssp { ret i32 undef } -;CHECK: @bar +;CHECK-LABEL: @bar( ;CHECK: store <4 x i32> ;CHECK: store <4 x i32> ;CHECK: ret diff --git a/test/Transforms/LoopVectorize/X86/x86_fp80-vector-store.ll b/test/Transforms/LoopVectorize/X86/x86_fp80-vector-store.ll index b66119f4ef5..efc93d94a7c 100644 --- a/test/Transforms/LoopVectorize/X86/x86_fp80-vector-store.ll +++ b/test/Transforms/LoopVectorize/X86/x86_fp80-vector-store.ll @@ -5,7 +5,7 @@ target triple = "x86_64-apple-macosx10.7.0" @x = common global [1024 x x86_fp80] zeroinitializer, align 16 -;CHECK: @example +;CHECK-LABEL: @example( ;CHECK-NOT: bitcast x86_fp80* {{%[^ ]+}} to <{{[2-9][0-9]*}} x x86_fp80>* ;CHECK: store ;CHECK: ret void diff --git a/test/Transforms/LoopVectorize/cast-induction.ll b/test/Transforms/LoopVectorize/cast-induction.ll index 2aa29ed2c82..255ce9c77ea 100644 --- a/test/Transforms/LoopVectorize/cast-induction.ll +++ b/test/Transforms/LoopVectorize/cast-induction.ll @@ -7,7 +7,7 @@ target triple = "x86_64-apple-macosx10.8.0" @a = common global [2048 x i32] zeroinitializer, align 16 -;CHECK: @example12 +;CHECK-LABEL: @example12( ;CHECK: trunc i64 ;CHECK: store <4 x i32> ;CHECK: ret void diff --git a/test/Transforms/LoopVectorize/cpp-new-array.ll b/test/Transforms/LoopVectorize/cpp-new-array.ll index da0fb05fe84..c8215a107de 100644 --- a/test/Transforms/LoopVectorize/cpp-new-array.ll +++ b/test/Transforms/LoopVectorize/cpp-new-array.ll @@ -3,7 +3,7 @@ target 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-S128" target triple = "x86_64-apple-macosx10.8.0" -;CHECK: @cpp_new_arrays +;CHECK-LABEL: @cpp_new_arrays( ;CHECK: sext i32 ;CHECK: load <4 x float> ;CHECK: fadd <4 x float> diff --git a/test/Transforms/LoopVectorize/dbg.value.ll b/test/Transforms/LoopVectorize/dbg.value.ll index 127d479b3a0..70fcc44c681 100644 --- a/test/Transforms/LoopVectorize/dbg.value.ll +++ b/test/Transforms/LoopVectorize/dbg.value.ll @@ -8,7 +8,7 @@ target triple = "x86_64-apple-macosx10.8.0" @B = global [1024 x i32] zeroinitializer, align 16 @C = global [1024 x i32] zeroinitializer, align 16 -; CHECK: @test +; CHECK-LABEL: @test( define i32 @test() #0 { entry: tail call void @llvm.dbg.value(metadata !1, i64 0, metadata !9), !dbg !18 diff --git a/test/Transforms/LoopVectorize/flags.ll b/test/Transforms/LoopVectorize/flags.ll index 656912e178f..a4ebb428488 100644 --- a/test/Transforms/LoopVectorize/flags.ll +++ b/test/Transforms/LoopVectorize/flags.ll @@ -3,7 +3,7 @@ target 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-S128" target triple = "x86_64-apple-macosx10.8.0" -;CHECK: @flags1 +;CHECK-LABEL: @flags1( ;CHECK: load <4 x i32> ;CHECK: mul nsw <4 x i32> ;CHECK: store <4 x i32> @@ -28,7 +28,7 @@ define i32 @flags1(i32 %n, i32* nocapture %A) nounwind uwtable ssp { } -;CHECK: @flags2 +;CHECK-LABEL: @flags2( ;CHECK: load <4 x i32> ;CHECK: mul <4 x i32> ;CHECK: store <4 x i32> diff --git a/test/Transforms/LoopVectorize/float-reduction.ll b/test/Transforms/LoopVectorize/float-reduction.ll index 54ca172e869..c45098dd2c3 100644 --- a/test/Transforms/LoopVectorize/float-reduction.ll +++ b/test/Transforms/LoopVectorize/float-reduction.ll @@ -2,7 +2,7 @@ target 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-S128" target triple = "x86_64-apple-macosx10.8.0" -;CHECK: @foo +;CHECK-LABEL: @foo( ;CHECK: fadd <4 x float> ;CHECK: ret define float @foo(float* nocapture %A, i32* nocapture %n) nounwind uwtable readonly ssp { diff --git a/test/Transforms/LoopVectorize/gcc-examples.ll b/test/Transforms/LoopVectorize/gcc-examples.ll index f335557c001..d8959d4c106 100644 --- a/test/Transforms/LoopVectorize/gcc-examples.ll +++ b/test/Transforms/LoopVectorize/gcc-examples.ll @@ -20,12 +20,12 @@ target triple = "x86_64-apple-macosx10.8.0" @dd = common global [1024 x float] zeroinitializer, align 16 @dj = common global [1024 x i32] zeroinitializer, align 16 -;CHECK: @example1 +;CHECK-LABEL: @example1( ;CHECK: load <4 x i32> ;CHECK: add nsw <4 x i32> ;CHECK: store <4 x i32> ;CHECK: ret void -;UNROLL: @example1 +;UNROLL-LABEL: @example1( ;UNROLL: load <4 x i32> ;UNROLL: load <4 x i32> ;UNROLL: load <4 x i32> @@ -60,10 +60,10 @@ define void @example1() nounwind uwtable ssp { ret void } -;CHECK: @example2 +;CHECK-LABEL: @example2( ;CHECK: store <4 x i32> ;CHECK: ret void -;UNROLL: @example2 +;UNROLL-LABEL: @example2( ;UNROLL: store <4 x i32> ;UNROLL: store <4 x i32> ;UNROLL: store <4 x i32> @@ -110,10 +110,10 @@ define void @example2(i32 %n, i32 %x) nounwind uwtable ssp { ret void } -;CHECK: @example3 +;CHECK-LABEL: @example3( ;CHECK: <4 x i32> ;CHECK: ret void -;UNROLL: @example3 +;UNROLL-LABEL: @example3( ;UNROLL: <4 x i32> ;UNROLL: <4 x i32> ;UNROLL: <4 x i32> @@ -139,10 +139,10 @@ define void @example3(i32 %n, i32* noalias nocapture %p, i32* noalias nocapture ret void } -;CHECK: @example4 +;CHECK-LABEL: @example4( ;CHECK: load <4 x i32> ;CHECK: ret void -;UNROLL: @example4 +;UNROLL-LABEL: @example4( ;UNROLL: load <4 x i32> ;UNROLL: load <4 x i32> ;UNROLL: load <4 x i32> @@ -205,10 +205,10 @@ define void @example4(i32 %n, i32* noalias nocapture %p, i32* noalias nocapture ret void } -;CHECK: @example8 +;CHECK-LABEL: @example8( ;CHECK: store <4 x i32> ;CHECK: ret void -;UNROLL: @example8 +;UNROLL-LABEL: @example8( ;UNROLL: store <4 x i32> ;UNROLL: store <4 x i32> ;UNROLL: store <4 x i32> @@ -240,7 +240,7 @@ define void @example8(i32 %x) nounwind uwtable ssp { ret void } -;CHECK: @example9 +;CHECK-LABEL: @example9( ;CHECK: phi <4 x i32> ;CHECK: ret i32 define i32 @example9() nounwind uwtable readonly ssp { @@ -264,7 +264,7 @@ define i32 @example9() nounwind uwtable readonly ssp { ret i32 %7 } -;CHECK: @example10a +;CHECK-LABEL: @example10a( ;CHECK: load <4 x i32> ;CHECK: add nsw <4 x i32> ;CHECK: load <4 x i16> @@ -299,7 +299,7 @@ define void @example10a(i16* noalias nocapture %sa, i16* noalias nocapture %sb, ret void } -;CHECK: @example10b +;CHECK-LABEL: @example10b( ;CHECK: load <4 x i16> ;CHECK: sext <4 x i16> ;CHECK: store <4 x i32> @@ -323,7 +323,7 @@ define void @example10b(i16* noalias nocapture %sa, i16* noalias nocapture %sb, ret void } -;CHECK: @example11 +;CHECK-LABEL: @example11( ;CHECK: load i32 ;CHECK: load i32 ;CHECK: load i32 @@ -367,7 +367,7 @@ define void @example11() nounwind uwtable ssp { ret void } -;CHECK: @example12 +;CHECK-LABEL: @example12( ;CHECK: trunc i64 ;CHECK: store <4 x i32> ;CHECK: ret void @@ -389,7 +389,7 @@ define void @example12() nounwind uwtable ssp { } ; Can't vectorize because of reductions. -;CHECK: @example13 +;CHECK-LABEL: @example13( ;CHECK-NOT: <4 x i32> ;CHECK: ret void define void @example13(i32** nocapture %A, i32** nocapture %B, i32* nocapture %out) nounwind uwtable ssp { @@ -430,7 +430,7 @@ define void @example13(i32** nocapture %A, i32** nocapture %B, i32* nocapture %o } ; Can vectorize. -;CHECK: @example14 +;CHECK-LABEL: @example14( ;CHECK: <4 x i32> ;CHECK: ret void define void @example14(i32** nocapture %in, i32** nocapture %coeff, i32* nocapture %out) nounwind uwtable ssp { @@ -575,7 +575,7 @@ define void @example14(i32** nocapture %in, i32** nocapture %coeff, i32* nocaptu ret void } -;CHECK: @example21 +;CHECK-LABEL: @example21( ;CHECK: load <4 x i32> ;CHECK: shufflevector {{.*}} ;CHECK: ret i32 @@ -603,7 +603,7 @@ define i32 @example21(i32* nocapture %b, i32 %n) nounwind uwtable readonly ssp { ret i32 %a.0.lcssa } -;CHECK: @example23 +;CHECK-LABEL: @example23( ;CHECK: <4 x i32> ;CHECK: ret void define void @example23(i16* nocapture %src, i32* nocapture %dst) nounwind uwtable ssp { @@ -627,7 +627,7 @@ define void @example23(i16* nocapture %src, i32* nocapture %dst) nounwind uwtabl ret void } -;CHECK: @example24 +;CHECK-LABEL: @example24( ;CHECK: shufflevector <4 x i16> ;CHECK: ret void define void @example24(i16 signext %x, i16 signext %y) nounwind uwtable ssp { @@ -653,7 +653,7 @@ define void @example24(i16 signext %x, i16 signext %y) nounwind uwtable ssp { ret void } -;CHECK: @example25 +;CHECK-LABEL: @example25( ;CHECK: and <4 x i1> ;CHECK: zext <4 x i1> ;CHECK: ret void diff --git a/test/Transforms/LoopVectorize/if-conversion-nest.ll b/test/Transforms/LoopVectorize/if-conversion-nest.ll index f44862a2ebb..92cb06e5e52 100644 --- a/test/Transforms/LoopVectorize/if-conversion-nest.ll +++ b/test/Transforms/LoopVectorize/if-conversion-nest.ll @@ -2,7 +2,7 @@ target 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-S128" -;CHECK: @foo +;CHECK-LABEL: @foo( ;CHECK: icmp sgt ;CHECK: icmp sgt ;CHECK: icmp slt diff --git a/test/Transforms/LoopVectorize/if-conversion-reduction.ll b/test/Transforms/LoopVectorize/if-conversion-reduction.ll index 3a2d82e15d6..8cb703cdfa4 100644 --- a/test/Transforms/LoopVectorize/if-conversion-reduction.ll +++ b/test/Transforms/LoopVectorize/if-conversion-reduction.ll @@ -3,7 +3,7 @@ target 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-S128" target triple = "x86_64-apple-macosx10.9.0" -;CHECK: @reduction_func +;CHECK-LABEL: @reduction_func( ;CHECK-NOT: load <4 x i32> ;CHECK: ret i32 define i32 @reduction_func(i32* nocapture %A, i32 %n) nounwind uwtable readonly ssp { diff --git a/test/Transforms/LoopVectorize/if-conversion.ll b/test/Transforms/LoopVectorize/if-conversion.ll index 6e7c03a556c..88e56b2457d 100644 --- a/test/Transforms/LoopVectorize/if-conversion.ll +++ b/test/Transforms/LoopVectorize/if-conversion.ll @@ -17,7 +17,7 @@ target triple = "x86_64-apple-macosx10.9.0" ; } ;} -;CHECK: @function0 +;CHECK-LABEL: @function0( ;CHECK: load <4 x i32> ;CHECK: icmp sgt <4 x i32> ;CHECK: mul <4 x i32> @@ -70,7 +70,7 @@ for.end: ; return sum; ; } -;CHECK: @reduction_func +;CHECK-LABEL: @reduction_func( ;CHECK: load <4 x i32> ;CHECK: icmp sgt <4 x i32> ;CHECK: add <4 x i32> diff --git a/test/Transforms/LoopVectorize/increment.ll b/test/Transforms/LoopVectorize/increment.ll index 3fa6b19ca92..d35bd58a028 100644 --- a/test/Transforms/LoopVectorize/increment.ll +++ b/test/Transforms/LoopVectorize/increment.ll @@ -9,7 +9,7 @@ target triple = "x86_64-apple-macosx10.8.0" ; for (i=0; i ;CHECK: add nsw <4 x i32> ;CHECK: store <4 x i32> @@ -39,7 +39,7 @@ define void @inc(i32 %n) nounwind uwtable noinline ssp { ; for (i = 0; i < n; ++i) { ; A[B[i]]++; ; -;CHECK: @histogram +;CHECK-LABEL: @histogram( ;CHECK-NOT: <4 x i32> ;CHECK: ret i32 define i32 @histogram(i32* nocapture noalias %A, i32* nocapture noalias %B, i32 %n) nounwind uwtable ssp { diff --git a/test/Transforms/LoopVectorize/induction_plus.ll b/test/Transforms/LoopVectorize/induction_plus.ll index 96595cdc16b..6141c39462a 100644 --- a/test/Transforms/LoopVectorize/induction_plus.ll +++ b/test/Transforms/LoopVectorize/induction_plus.ll @@ -5,7 +5,7 @@ target triple = "x86_64-apple-macosx10.8.0" @array = common global [1024 x i32] zeroinitializer, align 16 -;CHECK: @array_at_plus_one +;CHECK-LABEL: @array_at_plus_one( ;CHECK: trunc i64 ;CHECK: add i64 %index, 12 ;CHECK: ret i32 diff --git a/test/Transforms/LoopVectorize/intrinsic.ll b/test/Transforms/LoopVectorize/intrinsic.ll index defbb5bd94b..95b53b70ea8 100644 --- a/test/Transforms/LoopVectorize/intrinsic.ll +++ b/test/Transforms/LoopVectorize/intrinsic.ll @@ -3,7 +3,7 @@ target 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-S128" target triple = "x86_64-unknown-linux-gnu" -;CHECK: @sqrt_f32 +;CHECK-LABEL: @sqrt_f32( ;CHECK: llvm.sqrt.v4f32 ;CHECK: ret void define void @sqrt_f32(i32 %n, float* noalias %y, float* noalias %x) nounwind uwtable { @@ -29,7 +29,7 @@ for.end: ; preds = %for.body, %entry declare float @llvm.sqrt.f32(float) nounwind readnone -;CHECK: @sqrt_f64 +;CHECK-LABEL: @sqrt_f64( ;CHECK: llvm.sqrt.v4f64 ;CHECK: ret void define void @sqrt_f64(i32 %n, double* noalias %y, double* noalias %x) nounwind uwtable { @@ -55,7 +55,7 @@ for.end: ; preds = %for.body, %entry declare double @llvm.sqrt.f64(double) nounwind readnone -;CHECK: @sin_f32 +;CHECK-LABEL: @sin_f32( ;CHECK: llvm.sin.v4f32 ;CHECK: ret void define void @sin_f32(i32 %n, float* noalias %y, float* noalias %x) nounwind uwtable { @@ -81,7 +81,7 @@ for.end: ; preds = %for.body, %entry declare float @llvm.sin.f32(float) nounwind readnone -;CHECK: @sin_f64 +;CHECK-LABEL: @sin_f64( ;CHECK: llvm.sin.v4f64 ;CHECK: ret void define void @sin_f64(i32 %n, double* noalias %y, double* noalias %x) nounwind uwtable { @@ -107,7 +107,7 @@ for.end: ; preds = %for.body, %entry declare double @llvm.sin.f64(double) nounwind readnone -;CHECK: @cos_f32 +;CHECK-LABEL: @cos_f32( ;CHECK: llvm.cos.v4f32 ;CHECK: ret void define void @cos_f32(i32 %n, float* noalias %y, float* noalias %x) nounwind uwtable { @@ -133,7 +133,7 @@ for.end: ; preds = %for.body, %entry declare float @llvm.cos.f32(float) nounwind readnone -;CHECK: @cos_f64 +;CHECK-LABEL: @cos_f64( ;CHECK: llvm.cos.v4f64 ;CHECK: ret void define void @cos_f64(i32 %n, double* noalias %y, double* noalias %x) nounwind uwtable { @@ -159,7 +159,7 @@ for.end: ; preds = %for.body, %entry declare double @llvm.cos.f64(double) nounwind readnone -;CHECK: @exp_f32 +;CHECK-LABEL: @exp_f32( ;CHECK: llvm.exp.v4f32 ;CHECK: ret void define void @exp_f32(i32 %n, float* noalias %y, float* noalias %x) nounwind uwtable { @@ -185,7 +185,7 @@ for.end: ; preds = %for.body, %entry declare float @llvm.exp.f32(float) nounwind readnone -;CHECK: @exp_f64 +;CHECK-LABEL: @exp_f64( ;CHECK: llvm.exp.v4f64 ;CHECK: ret void define void @exp_f64(i32 %n, double* noalias %y, double* noalias %x) nounwind uwtable { @@ -211,7 +211,7 @@ for.end: ; preds = %for.body, %entry declare double @llvm.exp.f64(double) nounwind readnone -;CHECK: @exp2_f32 +;CHECK-LABEL: @exp2_f32( ;CHECK: llvm.exp2.v4f32 ;CHECK: ret void define void @exp2_f32(i32 %n, float* noalias %y, float* noalias %x) nounwind uwtable { @@ -237,7 +237,7 @@ for.end: ; preds = %for.body, %entry declare float @llvm.exp2.f32(float) nounwind readnone -;CHECK: @exp2_f64 +;CHECK-LABEL: @exp2_f64( ;CHECK: llvm.exp2.v4f64 ;CHECK: ret void define void @exp2_f64(i32 %n, double* noalias %y, double* noalias %x) nounwind uwtable { @@ -263,7 +263,7 @@ for.end: ; preds = %for.body, %entry declare double @llvm.exp2.f64(double) nounwind readnone -;CHECK: @log_f32 +;CHECK-LABEL: @log_f32( ;CHECK: llvm.log.v4f32 ;CHECK: ret void define void @log_f32(i32 %n, float* noalias %y, float* noalias %x) nounwind uwtable { @@ -289,7 +289,7 @@ for.end: ; preds = %for.body, %entry declare float @llvm.log.f32(float) nounwind readnone -;CHECK: @log_f64 +;CHECK-LABEL: @log_f64( ;CHECK: llvm.log.v4f64 ;CHECK: ret void define void @log_f64(i32 %n, double* noalias %y, double* noalias %x) nounwind uwtable { @@ -315,7 +315,7 @@ for.end: ; preds = %for.body, %entry declare double @llvm.log.f64(double) nounwind readnone -;CHECK: @log10_f32 +;CHECK-LABEL: @log10_f32( ;CHECK: llvm.log10.v4f32 ;CHECK: ret void define void @log10_f32(i32 %n, float* noalias %y, float* noalias %x) nounwind uwtable { @@ -341,7 +341,7 @@ for.end: ; preds = %for.body, %entry declare float @llvm.log10.f32(float) nounwind readnone -;CHECK: @log10_f64 +;CHECK-LABEL: @log10_f64( ;CHECK: llvm.log10.v4f64 ;CHECK: ret void define void @log10_f64(i32 %n, double* noalias %y, double* noalias %x) nounwind uwtable { @@ -367,7 +367,7 @@ for.end: ; preds = %for.body, %entry declare double @llvm.log10.f64(double) nounwind readnone -;CHECK: @log2_f32 +;CHECK-LABEL: @log2_f32( ;CHECK: llvm.log2.v4f32 ;CHECK: ret void define void @log2_f32(i32 %n, float* noalias %y, float* noalias %x) nounwind uwtable { @@ -393,7 +393,7 @@ for.end: ; preds = %for.body, %entry declare float @llvm.log2.f32(float) nounwind readnone -;CHECK: @log2_f64 +;CHECK-LABEL: @log2_f64( ;CHECK: llvm.log2.v4f64 ;CHECK: ret void define void @log2_f64(i32 %n, double* noalias %y, double* noalias %x) nounwind uwtable { @@ -419,7 +419,7 @@ for.end: ; preds = %for.body, %entry declare double @llvm.log2.f64(double) nounwind readnone -;CHECK: @fabs_f32 +;CHECK-LABEL: @fabs_f32( ;CHECK: llvm.fabs.v4f32 ;CHECK: ret void define void @fabs_f32(i32 %n, float* noalias %y, float* noalias %x) nounwind uwtable { @@ -468,7 +468,7 @@ for.end: ; preds = %for.body, %entry declare double @llvm.fabs(double) nounwind readnone -;CHECK: @floor_f32 +;CHECK-LABEL: @floor_f32( ;CHECK: llvm.floor.v4f32 ;CHECK: ret void define void @floor_f32(i32 %n, float* noalias %y, float* noalias %x) nounwind uwtable { @@ -494,7 +494,7 @@ for.end: ; preds = %for.body, %entry declare float @llvm.floor.f32(float) nounwind readnone -;CHECK: @floor_f64 +;CHECK-LABEL: @floor_f64( ;CHECK: llvm.floor.v4f64 ;CHECK: ret void define void @floor_f64(i32 %n, double* noalias %y, double* noalias %x) nounwind uwtable { @@ -520,7 +520,7 @@ for.end: ; preds = %for.body, %entry declare double @llvm.floor.f64(double) nounwind readnone -;CHECK: @ceil_f32 +;CHECK-LABEL: @ceil_f32( ;CHECK: llvm.ceil.v4f32 ;CHECK: ret void define void @ceil_f32(i32 %n, float* noalias %y, float* noalias %x) nounwind uwtable { @@ -546,7 +546,7 @@ for.end: ; preds = %for.body, %entry declare float @llvm.ceil.f32(float) nounwind readnone -;CHECK: @ceil_f64 +;CHECK-LABEL: @ceil_f64( ;CHECK: llvm.ceil.v4f64 ;CHECK: ret void define void @ceil_f64(i32 %n, double* noalias %y, double* noalias %x) nounwind uwtable { @@ -572,7 +572,7 @@ for.end: ; preds = %for.body, %entry declare double @llvm.ceil.f64(double) nounwind readnone -;CHECK: @trunc_f32 +;CHECK-LABEL: @trunc_f32( ;CHECK: llvm.trunc.v4f32 ;CHECK: ret void define void @trunc_f32(i32 %n, float* noalias %y, float* noalias %x) nounwind uwtable { @@ -598,7 +598,7 @@ for.end: ; preds = %for.body, %entry declare float @llvm.trunc.f32(float) nounwind readnone -;CHECK: @trunc_f64 +;CHECK-LABEL: @trunc_f64( ;CHECK: llvm.trunc.v4f64 ;CHECK: ret void define void @trunc_f64(i32 %n, double* noalias %y, double* noalias %x) nounwind uwtable { @@ -624,7 +624,7 @@ for.end: ; preds = %for.body, %entry declare double @llvm.trunc.f64(double) nounwind readnone -;CHECK: @rint_f32 +;CHECK-LABEL: @rint_f32( ;CHECK: llvm.rint.v4f32 ;CHECK: ret void define void @rint_f32(i32 %n, float* noalias %y, float* noalias %x) nounwind uwtable { @@ -650,7 +650,7 @@ for.end: ; preds = %for.body, %entry declare float @llvm.rint.f32(float) nounwind readnone -;CHECK: @rint_f64 +;CHECK-LABEL: @rint_f64( ;CHECK: llvm.rint.v4f64 ;CHECK: ret void define void @rint_f64(i32 %n, double* noalias %y, double* noalias %x) nounwind uwtable { @@ -676,7 +676,7 @@ for.end: ; preds = %for.body, %entry declare double @llvm.rint.f64(double) nounwind readnone -;CHECK: @nearbyint_f32 +;CHECK-LABEL: @nearbyint_f32( ;CHECK: llvm.nearbyint.v4f32 ;CHECK: ret void define void @nearbyint_f32(i32 %n, float* noalias %y, float* noalias %x) nounwind uwtable { @@ -702,7 +702,7 @@ for.end: ; preds = %for.body, %entry declare float @llvm.nearbyint.f32(float) nounwind readnone -;CHECK: @nearbyint_f64 +;CHECK-LABEL: @nearbyint_f64( ;CHECK: llvm.nearbyint.v4f64 ;CHECK: ret void define void @nearbyint_f64(i32 %n, double* noalias %y, double* noalias %x) nounwind uwtable { @@ -728,7 +728,7 @@ for.end: ; preds = %for.body, %entry declare double @llvm.nearbyint.f64(double) nounwind readnone -;CHECK: @fma_f32 +;CHECK-LABEL: @fma_f32( ;CHECK: llvm.fma.v4f32 ;CHECK: ret void define void @fma_f32(i32 %n, float* noalias %y, float* noalias %x, float* noalias %z, float* noalias %w) nounwind uwtable { @@ -758,7 +758,7 @@ for.end: ; preds = %for.body, %entry declare float @llvm.fma.f32(float, float, float) nounwind readnone -;CHECK: @fma_f64 +;CHECK-LABEL: @fma_f64( ;CHECK: llvm.fma.v4f64 ;CHECK: ret void define void @fma_f64(i32 %n, double* noalias %y, double* noalias %x, double* noalias %z, double* noalias %w) nounwind uwtable { @@ -788,7 +788,7 @@ for.end: ; preds = %for.body, %entry declare double @llvm.fma.f64(double, double, double) nounwind readnone -;CHECK: @fmuladd_f32 +;CHECK-LABEL: @fmuladd_f32( ;CHECK: llvm.fmuladd.v4f32 ;CHECK: ret void define void @fmuladd_f32(i32 %n, float* noalias %y, float* noalias %x, float* noalias %z, float* noalias %w) nounwind uwtable { @@ -818,7 +818,7 @@ for.end: ; preds = %for.body, %entry declare float @llvm.fmuladd.f32(float, float, float) nounwind readnone -;CHECK: @fmuladd_f64 +;CHECK-LABEL: @fmuladd_f64( ;CHECK: llvm.fmuladd.v4f64 ;CHECK: ret void define void @fmuladd_f64(i32 %n, double* noalias %y, double* noalias %x, double* noalias %z, double* noalias %w) nounwind uwtable { @@ -848,7 +848,7 @@ for.end: ; preds = %for.body, %entry declare double @llvm.fmuladd.f64(double, double, double) nounwind readnone -;CHECK: @pow_f32 +;CHECK-LABEL: @pow_f32( ;CHECK: llvm.pow.v4f32 ;CHECK: ret void define void @pow_f32(i32 %n, float* noalias %y, float* noalias %x, float* noalias %z) nounwind uwtable { @@ -876,7 +876,7 @@ for.end: ; preds = %for.body, %entry declare float @llvm.pow.f32(float, float) nounwind readnone -;CHECK: @pow_f64 +;CHECK-LABEL: @pow_f64( ;CHECK: llvm.pow.v4f64 ;CHECK: ret void define void @pow_f64(i32 %n, double* noalias %y, double* noalias %x, double* noalias %z) nounwind uwtable { diff --git a/test/Transforms/LoopVectorize/memdep.ll b/test/Transforms/LoopVectorize/memdep.ll index 56e86a4c0dc..b6d9e2e331f 100644 --- a/test/Transforms/LoopVectorize/memdep.ll +++ b/test/Transforms/LoopVectorize/memdep.ll @@ -159,7 +159,7 @@ for.end: ; happen. ; -; CHECK: @nostoreloadforward +; CHECK-LABEL: @nostoreloadforward( ; CHECK-NOT: <2 x i32> define void @nostoreloadforward(i32* %A) { @@ -194,7 +194,7 @@ for.end: ; happen. ; -; CHECK: @nostoreloadforward2 +; CHECK-LABEL: @nostoreloadforward2( ; CHECK-NOT: <2 x i32> define void @nostoreloadforward2(i32* noalias %A, i32* noalias %B, i32* noalias %C) { diff --git a/test/Transforms/LoopVectorize/metadata-unroll.ll b/test/Transforms/LoopVectorize/metadata-unroll.ll index 0112feeca02..7f103720065 100644 --- a/test/Transforms/LoopVectorize/metadata-unroll.ll +++ b/test/Transforms/LoopVectorize/metadata-unroll.ll @@ -9,7 +9,7 @@ target triple = "x86_64-apple-macosx10.8.0" ; for (i=0; i ;CHECK: load <4 x i32> ;CHECK: add nsw <4 x i32> diff --git a/test/Transforms/LoopVectorize/metadata-width.ll b/test/Transforms/LoopVectorize/metadata-width.ll index b06d4424168..1960c0bad6b 100644 --- a/test/Transforms/LoopVectorize/metadata-width.ll +++ b/test/Transforms/LoopVectorize/metadata-width.ll @@ -3,7 +3,7 @@ target 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-S128" target triple = "x86_64-unknown-linux-gnu" -; CHECK: @test1 +; CHECK-LABEL: @test1( ; CHECK: store <8 x i32> ; CHECK: ret void define void @test1(i32* nocapture %a, i32 %n) #0 { diff --git a/test/Transforms/LoopVectorize/minmax_reduction.ll b/test/Transforms/LoopVectorize/minmax_reduction.ll index 502fd8b9383..bade561c9e3 100644 --- a/test/Transforms/LoopVectorize/minmax_reduction.ll +++ b/test/Transforms/LoopVectorize/minmax_reduction.ll @@ -10,7 +10,7 @@ target datalayout = "e-p:64:64:64-i1:8:8-i8:8:8-i16:16:16-i32:32:32-i64:64:64-f3 ; Turn this into a max reduction. Make sure we use a splat to initialize the ; vector for the reduction. -; CHECK: @max_red +; CHECK-LABEL: @max_red( ; CHECK: %[[VAR:.*]] = insertelement <2 x i32> undef, i32 %max, i32 0 ; CHECK: {{.*}} = shufflevector <2 x i32> %[[VAR]], <2 x i32> undef, <2 x i32> zeroinitializer ; CHECK: icmp sgt <2 x i32> @@ -41,7 +41,7 @@ for.end: ; Turn this into a max reduction. The select has its inputs reversed therefore ; this is a max reduction. -; CHECK: @max_red_inverse_select +; CHECK-LABEL: @max_red_inverse_select( ; CHECK: icmp slt <2 x i32> ; CHECK: select <2 x i1> ; CHECK: middle.block @@ -69,7 +69,7 @@ for.end: } ; Turn this into a min reduction. -; CHECK: @min_red +; CHECK-LABEL: @min_red( ; CHECK: icmp slt <2 x i32> ; CHECK: select <2 x i1> ; CHECK: middle.block @@ -98,7 +98,7 @@ for.end: ; Turn this into a min reduction. The select has its inputs reversed therefore ; this is a min reduction. -; CHECK: @min_red_inverse_select +; CHECK-LABEL: @min_red_inverse_select( ; CHECK: icmp sgt <2 x i32> ; CHECK: select <2 x i1> ; CHECK: middle.block @@ -128,7 +128,7 @@ for.end: ; Unsigned tests. ; Turn this into a max reduction. -; CHECK: @umax_red +; CHECK-LABEL: @umax_red( ; CHECK: icmp ugt <2 x i32> ; CHECK: select <2 x i1> ; CHECK: middle.block @@ -157,7 +157,7 @@ for.end: ; Turn this into a max reduction. The select has its inputs reversed therefore ; this is a max reduction. -; CHECK: @umax_red_inverse_select +; CHECK-LABEL: @umax_red_inverse_select( ; CHECK: icmp ult <2 x i32> ; CHECK: select <2 x i1> ; CHECK: middle.block @@ -185,7 +185,7 @@ for.end: } ; Turn this into a min reduction. -; CHECK: @umin_red +; CHECK-LABEL: @umin_red( ; CHECK: icmp ult <2 x i32> ; CHECK: select <2 x i1> ; CHECK: middle.block @@ -214,7 +214,7 @@ for.end: ; Turn this into a min reduction. The select has its inputs reversed therefore ; this is a min reduction. -; CHECK: @umin_red_inverse_select +; CHECK-LABEL: @umin_red_inverse_select( ; CHECK: icmp ugt <2 x i32> ; CHECK: select <2 x i1> ; CHECK: middle.block @@ -243,7 +243,7 @@ for.end: ; SGE -> SLT ; Turn this into a min reduction (select inputs are reversed). -; CHECK: @sge_min_red +; CHECK-LABEL: @sge_min_red( ; CHECK: icmp sge <2 x i32> ; CHECK: select <2 x i1> ; CHECK: middle.block @@ -272,7 +272,7 @@ for.end: ; SLE -> SGT ; Turn this into a max reduction (select inputs are reversed). -; CHECK: @sle_min_red +; CHECK-LABEL: @sle_min_red( ; CHECK: icmp sle <2 x i32> ; CHECK: select <2 x i1> ; CHECK: middle.block @@ -301,7 +301,7 @@ for.end: ; UGE -> ULT ; Turn this into a min reduction (select inputs are reversed). -; CHECK: @uge_min_red +; CHECK-LABEL: @uge_min_red( ; CHECK: icmp uge <2 x i32> ; CHECK: select <2 x i1> ; CHECK: middle.block @@ -330,7 +330,7 @@ for.end: ; ULE -> UGT ; Turn this into a max reduction (select inputs are reversed). -; CHECK: @ule_min_red +; CHECK-LABEL: @ule_min_red( ; CHECK: icmp ule <2 x i32> ; CHECK: select <2 x i1> ; CHECK: middle.block @@ -358,7 +358,7 @@ for.end: } ; No reduction. -; CHECK: @no_red_1 +; CHECK-LABEL: @no_red_1( ; CHECK-NOT: icmp <2 x i32> define i32 @no_red_1(i32 %max) { entry: @@ -382,7 +382,7 @@ for.end: ret i32 %max.red.0 } -; CHECK: @no_red_2 +; CHECK-LABEL: @no_red_2( ; CHECK-NOT: icmp <2 x i32> define i32 @no_red_2(i32 %max) { entry: @@ -411,7 +411,7 @@ for.end: ; Maximum. ; Turn this into a max reduction in the presence of a no-nans-fp-math attribute. -; CHECK: @max_red_float +; CHECK-LABEL: @max_red_float( ; CHECK: fcmp ogt <2 x float> ; CHECK: select <2 x i1> ; CHECK: middle.block @@ -437,7 +437,7 @@ for.end: ret float %max.red.0 } -; CHECK: @max_red_float_ge +; CHECK-LABEL: @max_red_float_ge( ; CHECK: fcmp oge <2 x float> ; CHECK: select <2 x i1> ; CHECK: middle.block @@ -463,7 +463,7 @@ for.end: ret float %max.red.0 } -; CHECK: @inverted_max_red_float +; CHECK-LABEL: @inverted_max_red_float( ; CHECK: fcmp olt <2 x float> ; CHECK: select <2 x i1> ; CHECK: middle.block @@ -489,7 +489,7 @@ for.end: ret float %max.red.0 } -; CHECK: @inverted_max_red_float_le +; CHECK-LABEL: @inverted_max_red_float_le( ; CHECK: fcmp ole <2 x float> ; CHECK: select <2 x i1> ; CHECK: middle.block @@ -541,7 +541,7 @@ for.end: ret float %max.red.0 } -; CHECK: @unordered_max_red_float_ge +; CHECK-LABEL: @unordered_max_red_float_ge( ; CHECK: fcmp uge <2 x float> ; CHECK: select <2 x i1> ; CHECK: middle.block @@ -593,7 +593,7 @@ for.end: ret float %max.red.0 } -; CHECK: @inverted_unordered_max_red_float_le +; CHECK-LABEL: @inverted_unordered_max_red_float_le( ; CHECK: fcmp ule <2 x float> ; CHECK: select <2 x i1> ; CHECK: middle.block @@ -622,7 +622,7 @@ for.end: ; Minimum. ; Turn this into a min reduction in the presence of a no-nans-fp-math attribute. -; CHECK: @min_red_float +; CHECK-LABEL: @min_red_float( ; CHECK: fcmp olt <2 x float> ; CHECK: select <2 x i1> ; CHECK: middle.block @@ -648,7 +648,7 @@ for.end: ret float %min.red.0 } -; CHECK: @min_red_float_le +; CHECK-LABEL: @min_red_float_le( ; CHECK: fcmp ole <2 x float> ; CHECK: select <2 x i1> ; CHECK: middle.block @@ -674,7 +674,7 @@ for.end: ret float %min.red.0 } -; CHECK: @inverted_min_red_float +; CHECK-LABEL: @inverted_min_red_float( ; CHECK: fcmp ogt <2 x float> ; CHECK: select <2 x i1> ; CHECK: middle.block @@ -700,7 +700,7 @@ for.end: ret float %min.red.0 } -; CHECK: @inverted_min_red_float_ge +; CHECK-LABEL: @inverted_min_red_float_ge( ; CHECK: fcmp oge <2 x float> ; CHECK: select <2 x i1> ; CHECK: middle.block @@ -752,7 +752,7 @@ for.end: ret float %min.red.0 } -; CHECK: @unordered_min_red_float_le +; CHECK-LABEL: @unordered_min_red_float_le( ; CHECK: fcmp ule <2 x float> ; CHECK: select <2 x i1> ; CHECK: middle.block @@ -804,7 +804,7 @@ for.end: ret float %min.red.0 } -; CHECK: @inverted_unordered_min_red_float_ge +; CHECK-LABEL: @inverted_unordered_min_red_float_ge( ; CHECK: fcmp uge <2 x float> ; CHECK: select <2 x i1> ; CHECK: middle.block @@ -831,7 +831,7 @@ for.end: } ; Make sure we handle doubles, too. -; CHECK: @min_red_double +; CHECK-LABEL: @min_red_double( ; CHECK: fcmp olt <2 x double> ; CHECK: select <2 x i1> ; CHECK: middle.block @@ -859,7 +859,7 @@ for.end: ; Don't this into a max reduction. The no-nans-fp-math attribute is missing -; CHECK: @max_red_float_nans +; CHECK-LABEL: @max_red_float_nans( ; CHECK-NOT: <2 x float> define float @max_red_float_nans(float %max) { diff --git a/test/Transforms/LoopVectorize/multiple-address-spaces.ll b/test/Transforms/LoopVectorize/multiple-address-spaces.ll index 70ced7c4064..6906195f4a1 100644 --- a/test/Transforms/LoopVectorize/multiple-address-spaces.ll +++ b/test/Transforms/LoopVectorize/multiple-address-spaces.ll @@ -16,7 +16,7 @@ target triple = "x86_64-unknown-linux-gnu" @Y = common addrspace(1) global [40000 x i8] zeroinitializer, align 16 @X = common global [40000 x i8] zeroinitializer, align 16 -;CHECK: @main +;CHECK-LABEL: @main( ;CHECK: bitcast i8 addrspace(1)* %{{.*}} to <4 x i8> addrspace(1)* ;CHECK: bitcast i8* %{{.*}} to <4 x i8>* diff --git a/test/Transforms/LoopVectorize/no_idiv_reduction.ll b/test/Transforms/LoopVectorize/no_idiv_reduction.ll index cdfb3fd66f0..295fcabb0b2 100644 --- a/test/Transforms/LoopVectorize/no_idiv_reduction.ll +++ b/test/Transforms/LoopVectorize/no_idiv_reduction.ll @@ -7,7 +7,7 @@ entry: br label %for.body for.body: - ; CHECK: @g + ; CHECK-LABEL: @g( ; CHECK-NOT: sdiv <2 x i32> %indvars.iv = phi i64 [ 0, %entry ], [ %indvars.iv.next, %for.body ] %r.05 = phi i32 [ 80, %entry ], [ %div, %for.body ] diff --git a/test/Transforms/LoopVectorize/no_int_induction.ll b/test/Transforms/LoopVectorize/no_int_induction.ll index 45aa8c7cd9b..66d53018814 100644 --- a/test/Transforms/LoopVectorize/no_int_induction.ll +++ b/test/Transforms/LoopVectorize/no_int_induction.ll @@ -7,7 +7,7 @@ target 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-S128" target triple = "x86_64-apple-macosx10.8.0" -;CHECK: @sum_array +;CHECK-LABEL: @sum_array( ;CHECK: phi <4 x i32> ;CHECK: load <4 x i32> ;CHECK: add nsw <4 x i32> diff --git a/test/Transforms/LoopVectorize/nofloat.ll b/test/Transforms/LoopVectorize/nofloat.ll index de23bf02b63..c3c81b6f845 100644 --- a/test/Transforms/LoopVectorize/nofloat.ll +++ b/test/Transforms/LoopVectorize/nofloat.ll @@ -7,7 +7,7 @@ target triple = "x86_64-apple-macosx10.8.0" @a = common global [2048 x i32] zeroinitializer, align 16 -;CHECK: @example12 +;CHECK-LABEL: @example12( ;CHECK-NOT: store <4 x i32> ;CHECK: ret void define void @example12() noimplicitfloat { ; <--------- "noimplicitfloat" attribute here! diff --git a/test/Transforms/LoopVectorize/non-const-n.ll b/test/Transforms/LoopVectorize/non-const-n.ll index 8262a18f180..0c54a2b0122 100644 --- a/test/Transforms/LoopVectorize/non-const-n.ll +++ b/test/Transforms/LoopVectorize/non-const-n.ll @@ -7,7 +7,7 @@ target triple = "x86_64-apple-macosx10.8.0" @c = common global [2048 x i32] zeroinitializer, align 16 @a = common global [2048 x i32] zeroinitializer, align 16 -;CHECK: @example1 +;CHECK-LABEL: @example1( ;CHECK: shl i32 ;CHECK: zext i32 ;CHECK: load <4 x i32> diff --git a/test/Transforms/LoopVectorize/read-only.ll b/test/Transforms/LoopVectorize/read-only.ll index bfaa6d452bc..fc8f0a5482f 100644 --- a/test/Transforms/LoopVectorize/read-only.ll +++ b/test/Transforms/LoopVectorize/read-only.ll @@ -3,7 +3,7 @@ target 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-S128" target triple = "x86_64-apple-macosx10.8.0" -;CHECK: @read_only_func +;CHECK-LABEL: @read_only_func( ;CHECK: load <4 x i32> ;CHECK: ret i32 define i32 @read_only_func(i32* nocapture %A, i32* nocapture %B, i32 %n) nounwind uwtable readonly ssp { diff --git a/test/Transforms/LoopVectorize/reduction.ll b/test/Transforms/LoopVectorize/reduction.ll index fbc584994f6..18a0a9341e0 100644 --- a/test/Transforms/LoopVectorize/reduction.ll +++ b/test/Transforms/LoopVectorize/reduction.ll @@ -3,7 +3,7 @@ target 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-S128" target triple = "x86_64-apple-macosx10.8.0" -;CHECK: @reduction_sum +;CHECK-LABEL: @reduction_sum( ;CHECK: phi <4 x i32> ;CHECK: load <4 x i32> ;CHECK: add <4 x i32> @@ -38,7 +38,7 @@ define i32 @reduction_sum(i32 %n, i32* noalias nocapture %A, i32* noalias nocapt ret i32 %sum.0.lcssa } -;CHECK: @reduction_prod +;CHECK-LABEL: @reduction_prod( ;CHECK: phi <4 x i32> ;CHECK: load <4 x i32> ;CHECK: mul <4 x i32> @@ -73,7 +73,7 @@ define i32 @reduction_prod(i32 %n, i32* noalias nocapture %A, i32* noalias nocap ret i32 %prod.0.lcssa } -;CHECK: @reduction_mix +;CHECK-LABEL: @reduction_mix( ;CHECK: phi <4 x i32> ;CHECK: load <4 x i32> ;CHECK: mul nsw <4 x i32> @@ -108,7 +108,7 @@ define i32 @reduction_mix(i32 %n, i32* noalias nocapture %A, i32* noalias nocapt ret i32 %sum.0.lcssa } -;CHECK: @reduction_mul +;CHECK-LABEL: @reduction_mul( ;CHECK: mul <4 x i32> ;CHECK: shufflevector <4 x i32> %{{.*}}, <4 x i32> undef, <4 x i32> ;CHECK: mul <4 x i32> @@ -141,7 +141,7 @@ define i32 @reduction_mul(i32 %n, i32* noalias nocapture %A, i32* noalias nocapt ret i32 %sum.0.lcssa } -;CHECK: @start_at_non_zero +;CHECK-LABEL: @start_at_non_zero( ;CHECK: phi <4 x i32> ;CHECK: ;CHECK: shufflevector <4 x i32> %{{.*}}, <4 x i32> undef, <4 x i32> @@ -174,7 +174,7 @@ for.end: ; preds = %for.body, %entry ret i32 %sum.0.lcssa } -;CHECK: @reduction_and +;CHECK-LABEL: @reduction_and( ;CHECK: and <4 x i32> ;CHECK: ;CHECK: shufflevector <4 x i32> %{{.*}}, <4 x i32> undef, <4 x i32> @@ -207,7 +207,7 @@ for.end: ; preds = %for.body, %entry ret i32 %result.0.lcssa } -;CHECK: @reduction_or +;CHECK-LABEL: @reduction_or( ;CHECK: or <4 x i32> ;CHECK: shufflevector <4 x i32> %{{.*}}, <4 x i32> undef, <4 x i32> ;CHECK: or <4 x i32> @@ -239,7 +239,7 @@ for.end: ; preds = %for.body, %entry ret i32 %result.0.lcssa } -;CHECK: @reduction_xor +;CHECK-LABEL: @reduction_xor( ;CHECK: xor <4 x i32> ;CHECK: shufflevector <4 x i32> %{{.*}}, <4 x i32> undef, <4 x i32> ;CHECK: xor <4 x i32> @@ -272,7 +272,7 @@ for.end: ; preds = %for.body, %entry } ; In this code the subtracted variable is on the RHS and this is not an induction variable. -;CHECK: @reduction_sub_rhs +;CHECK-LABEL: @reduction_sub_rhs( ;CHECK-NOT: phi <4 x i32> ;CHECK-NOT: sub nsw <4 x i32> ;CHECK: ret i32 @@ -299,7 +299,7 @@ for.end: ; preds = %for.body, %entry ; In this test the reduction variable is on the LHS and we can vectorize it. -;CHECK: @reduction_sub_lhs +;CHECK-LABEL: @reduction_sub_lhs( ;CHECK: phi <4 x i32> ;CHECK: sub nsw <4 x i32> ;CHECK: ret i32 @@ -449,7 +449,7 @@ for.end: ; outside user misses a few iterations (VF-1) of the loop. ; PR16522 -; CHECK: @phivalueredux +; CHECK-LABEL: @phivalueredux( ; CHECK-NOT: x i32> define i32 @phivalueredux(i32 %p) { diff --git a/test/Transforms/LoopVectorize/reverse_iter.ll b/test/Transforms/LoopVectorize/reverse_iter.ll index 6ff4f1f8d1f..f803120c4d5 100644 --- a/test/Transforms/LoopVectorize/reverse_iter.ll +++ b/test/Transforms/LoopVectorize/reverse_iter.ll @@ -13,7 +13,7 @@ target triple = "x86_64-apple-macosx10.8.0" ; } ; -;CHECK: @foo +;CHECK-LABEL: @foo( ;CHECK: ;CHECK: ret define i32 @foo(i32 %n, i32* nocapture %A) { diff --git a/test/Transforms/LoopVectorize/same-base-access.ll b/test/Transforms/LoopVectorize/same-base-access.ll index 15738936457..d623a346909 100644 --- a/test/Transforms/LoopVectorize/same-base-access.ll +++ b/test/Transforms/LoopVectorize/same-base-access.ll @@ -11,7 +11,7 @@ target triple = "x86_64-apple-macosx10.9.0" ; x[k] = x[k-1] + y[k]; ; } -; CHECK: @kernel11 +; CHECK-LABEL: @kernel11( ; CHECK-NOT: <4 x double> ; CHECK: ret define i32 @kernel11(double* %x, double* %y, i32 %n) nounwind uwtable ssp { @@ -77,7 +77,7 @@ define i32 @kernel11(double* %x, double* %y, i32 %n) nounwind uwtable ssp { ; } ; } -; CHECK: @func2 +; CHECK-LABEL: @func2( ; CHECK-NOT: <4 x i32> ; CHECK: ret define i32 @func2(i32* nocapture %a) nounwind uwtable ssp { diff --git a/test/Transforms/LoopVectorize/scalar-select.ll b/test/Transforms/LoopVectorize/scalar-select.ll index 7a14d247c9b..257c7bebe4d 100644 --- a/test/Transforms/LoopVectorize/scalar-select.ll +++ b/test/Transforms/LoopVectorize/scalar-select.ll @@ -7,7 +7,7 @@ target triple = "x86_64-apple-macosx10.8.0" @b = common global [2048 x i32] zeroinitializer, align 16 @c = common global [2048 x i32] zeroinitializer, align 16 -;CHECK: @example1 +;CHECK-LABEL: @example1( ;CHECK: load <4 x i32> ; make sure that we have a scalar condition and a vector operand. ;CHECK: select i1 %cond, <4 x i32> diff --git a/test/Transforms/LoopVectorize/scev-exitlim-crash.ll b/test/Transforms/LoopVectorize/scev-exitlim-crash.ll index cc0765cfa21..768773859a2 100644 --- a/test/Transforms/LoopVectorize/scev-exitlim-crash.ll +++ b/test/Transforms/LoopVectorize/scev-exitlim-crash.ll @@ -10,7 +10,7 @@ target triple = "x86_64-apple-macosx" @e = common global i32* null, align 8 @c = common global i32 0, align 4 -; CHECK-LABEL: @fn1 +; CHECK-LABEL-LABEL: @fn1( ; CHECK: vector.body define void @fn1() #0 { entry: diff --git a/test/Transforms/LoopVectorize/simple-unroll.ll b/test/Transforms/LoopVectorize/simple-unroll.ll index 7e2dd5fc0fc..83f35ffb609 100644 --- a/test/Transforms/LoopVectorize/simple-unroll.ll +++ b/test/Transforms/LoopVectorize/simple-unroll.ll @@ -9,7 +9,7 @@ target triple = "x86_64-apple-macosx10.8.0" ; for (i=0; i ;CHECK: load <4 x i32> ;CHECK: add nsw <4 x i32> diff --git a/test/Transforms/LoopVectorize/small-loop.ll b/test/Transforms/LoopVectorize/small-loop.ll index fa83dba3d36..49ce5c53972 100644 --- a/test/Transforms/LoopVectorize/small-loop.ll +++ b/test/Transforms/LoopVectorize/small-loop.ll @@ -7,7 +7,7 @@ target triple = "x86_64-apple-macosx10.8.0" @b = common global [2048 x i32] zeroinitializer, align 16 @c = common global [2048 x i32] zeroinitializer, align 16 -;CHECK: @example1 +;CHECK-LABEL: @example1( ;CHECK-NOT: load <4 x i32> ;CHECK: ret void define void @example1() nounwind uwtable ssp { diff --git a/test/Transforms/LoopVectorize/start-non-zero.ll b/test/Transforms/LoopVectorize/start-non-zero.ll index e8a089a9812..8f675afd80c 100644 --- a/test/Transforms/LoopVectorize/start-non-zero.ll +++ b/test/Transforms/LoopVectorize/start-non-zero.ll @@ -3,7 +3,7 @@ target 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-S128" target triple = "x86_64-apple-macosx10.8.0" -;CHECK: @start_at_nonzero +;CHECK-LABEL: @start_at_nonzero( ;CHECK: mul nuw <4 x i32> ;CHECK: ret i32 define i32 @start_at_nonzero(i32* nocapture %a, i32 %start, i32 %end) nounwind uwtable ssp { diff --git a/test/Transforms/LoopVectorize/store-shuffle-bug.ll b/test/Transforms/LoopVectorize/store-shuffle-bug.ll index b18a57b74ef..0ec8010756d 100644 --- a/test/Transforms/LoopVectorize/store-shuffle-bug.ll +++ b/test/Transforms/LoopVectorize/store-shuffle-bug.ll @@ -17,7 +17,7 @@ define void @t() { entry: br label %for.body -; CHECK: @t +; CHECK-LABEL: @t( ; CHECK: vector.body: ; CHECK: load <4 x i32> ; CHECK: [[VAR1:%[a-zA-Z0-9]+]] = shufflevector diff --git a/test/Transforms/LoopVectorize/struct_access.ll b/test/Transforms/LoopVectorize/struct_access.ll index 573480d77cd..0cfaabe1774 100644 --- a/test/Transforms/LoopVectorize/struct_access.ll +++ b/test/Transforms/LoopVectorize/struct_access.ll @@ -21,7 +21,7 @@ target triple = "x86_64-apple-macosx10.9.0" ; return sum; ; } -;CHECK: @foo +;CHECK-LABEL: @foo( ;CHECK-NOT: load <4 x i32> ;CHECK: ret define i32 @foo(%struct.coordinate* nocapture %A, i32 %n) nounwind uwtable readonly ssp { diff --git a/test/Transforms/LoopVectorize/undef-inst-bug.ll b/test/Transforms/LoopVectorize/undef-inst-bug.ll index f6b17ba713c..ed60e801afd 100644 --- a/test/Transforms/LoopVectorize/undef-inst-bug.ll +++ b/test/Transforms/LoopVectorize/undef-inst-bug.ll @@ -11,7 +11,7 @@ target datalayout = "e-p:64:64:64-i1:8:8-i8:8:8-i16:16:16-i32:32:32-i64:64:64-f3 ; Verify that we don't miscompile this loop. -; CHECK: @t +; CHECK-LABEL: @t( ; CHECK: <4 x i32> define void @t() { diff --git a/test/Transforms/LoopVectorize/write-only.ll b/test/Transforms/LoopVectorize/write-only.ll index 54cbe8df46b..71a9cd0dc5b 100644 --- a/test/Transforms/LoopVectorize/write-only.ll +++ b/test/Transforms/LoopVectorize/write-only.ll @@ -3,7 +3,7 @@ target 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-S128" target triple = "x86_64-apple-macosx10.8.0" -;CHECK: @read_mod_write_single_ptr +;CHECK-LABEL: @read_mod_write_single_ptr( ;CHECK: load <4 x float> ;CHECK: ret i32 define i32 @read_mod_write_single_ptr(float* nocapture %a, i32 %n) nounwind uwtable ssp { diff --git a/test/Transforms/LowerAtomic/atomic-load.ll b/test/Transforms/LowerAtomic/atomic-load.ll index bc04e88344e..1279bf72201 100644 --- a/test/Transforms/LowerAtomic/atomic-load.ll +++ b/test/Transforms/LowerAtomic/atomic-load.ll @@ -1,7 +1,7 @@ ; RUN: opt < %s -loweratomic -S | FileCheck %s define i8 @add() { -; CHECK: @add +; CHECK-LABEL: @add( %i = alloca i8 %j = atomicrmw add i8* %i, i8 42 monotonic ; CHECK: [[INST:%[a-z0-9]+]] = load @@ -12,7 +12,7 @@ define i8 @add() { } define i8 @nand() { -; CHECK: @nand +; CHECK-LABEL: @nand( %i = alloca i8 %j = atomicrmw nand i8* %i, i8 42 monotonic ; CHECK: [[INST:%[a-z0-9]+]] = load @@ -24,7 +24,7 @@ define i8 @nand() { } define i8 @min() { -; CHECK: @min +; CHECK-LABEL: @min( %i = alloca i8 %j = atomicrmw min i8* %i, i8 42 monotonic ; CHECK: [[INST:%[a-z0-9]+]] = load diff --git a/test/Transforms/LowerAtomic/atomic-swap.ll b/test/Transforms/LowerAtomic/atomic-swap.ll index 5e2f034a517..4331677764b 100644 --- a/test/Transforms/LowerAtomic/atomic-swap.ll +++ b/test/Transforms/LowerAtomic/atomic-swap.ll @@ -1,7 +1,7 @@ ; RUN: opt < %s -loweratomic -S | FileCheck %s define i8 @cmpswap() { -; CHECK: @cmpswap +; CHECK-LABEL: @cmpswap( %i = alloca i8 %j = cmpxchg i8* %i, i8 0, i8 42 monotonic ; CHECK: [[INST:%[a-z0-9]+]] = load @@ -13,7 +13,7 @@ define i8 @cmpswap() { } define i8 @swap() { -; CHECK: @swap +; CHECK-LABEL: @swap( %i = alloca i8 %j = atomicrmw xchg i8* %i, i8 42 monotonic ; CHECK: [[INST:%[a-z0-9]+]] = load diff --git a/test/Transforms/LowerAtomic/barrier.ll b/test/Transforms/LowerAtomic/barrier.ll index 814d7afb5ff..665f9d756d3 100644 --- a/test/Transforms/LowerAtomic/barrier.ll +++ b/test/Transforms/LowerAtomic/barrier.ll @@ -1,7 +1,7 @@ ; RUN: opt < %s -loweratomic -S | FileCheck %s define void @barrier() { -; CHECK: @barrier +; CHECK-LABEL: @barrier( fence seq_cst ; CHECK-NEXT: ret ret void diff --git a/test/Transforms/LowerExpectIntrinsic/basic.ll b/test/Transforms/LowerExpectIntrinsic/basic.ll index c00127e1ed2..955209af14a 100644 --- a/test/Transforms/LowerExpectIntrinsic/basic.ll +++ b/test/Transforms/LowerExpectIntrinsic/basic.ll @@ -1,6 +1,6 @@ ; RUN: opt -lower-expect -strip-dead-prototypes -S -o - < %s | FileCheck %s -; CHECK: @test1 +; CHECK-LABEL: @test1( define i32 @test1(i32 %x) nounwind uwtable ssp { entry: %retval = alloca i32, align 4 @@ -34,7 +34,7 @@ declare i64 @llvm.expect.i64(i64, i64) nounwind readnone declare i32 @f(...) -; CHECK: @test2 +; CHECK-LABEL: @test2( define i32 @test2(i32 %x) nounwind uwtable ssp { entry: %retval = alloca i32, align 4 @@ -62,7 +62,7 @@ return: ; preds = %if.end, %if.then ret i32 %0 } -; CHECK: @test3 +; CHECK-LABEL: @test3( define i32 @test3(i32 %x) nounwind uwtable ssp { entry: %retval = alloca i32, align 4 @@ -93,7 +93,7 @@ return: ; preds = %if.end, %if.then ret i32 %0 } -; CHECK: @test4 +; CHECK-LABEL: @test4( define i32 @test4(i32 %x) nounwind uwtable ssp { entry: %retval = alloca i32, align 4 @@ -125,7 +125,7 @@ return: ; preds = %if.end, %if.then ret i32 %0 } -; CHECK: @test5 +; CHECK-LABEL: @test5( define i32 @test5(i32 %x) nounwind uwtable ssp { entry: %retval = alloca i32, align 4 @@ -155,7 +155,7 @@ return: ; preds = %if.end, %if.then ret i32 %0 } -; CHECK: @test6 +; CHECK-LABEL: @test6( define i32 @test6(i32 %x) nounwind uwtable ssp { entry: %retval = alloca i32, align 4 @@ -184,7 +184,7 @@ return: ; preds = %sw.epilog, %sw.bb ret i32 %0 } -; CHECK: @test7 +; CHECK-LABEL: @test7( define i32 @test7(i32 %x) nounwind uwtable ssp { entry: %retval = alloca i32, align 4 @@ -214,7 +214,7 @@ return: ; preds = %sw.epilog, %sw.bb ret i32 %0 } -; CHECK: @test8 +; CHECK-LABEL: @test8( define i32 @test8(i32 %x) nounwind uwtable ssp { entry: %retval = alloca i32, align 4 diff --git a/test/Transforms/Mem2Reg/atomic.ll b/test/Transforms/Mem2Reg/atomic.ll index 982c41318b1..5bc9e9281b2 100644 --- a/test/Transforms/Mem2Reg/atomic.ll +++ b/test/Transforms/Mem2Reg/atomic.ll @@ -3,7 +3,7 @@ ; mem2reg is allowed with arbitrary atomic operations (although we only support ; it for atomic load and store at the moment). define i32 @test1(i32 %x) { -; CHECK: @test1 +; CHECK-LABEL: @test1( ; CHECK: ret i32 %x %a = alloca i32 store atomic i32 %x, i32* %a seq_cst, align 4 diff --git a/test/Transforms/MemCpyOpt/align.ll b/test/Transforms/MemCpyOpt/align.ll index 1b98f6ad383..5d5bfbdafc5 100644 --- a/test/Transforms/MemCpyOpt/align.ll +++ b/test/Transforms/MemCpyOpt/align.ll @@ -8,7 +8,7 @@ declare void @llvm.memset.p0i8.i64(i8* nocapture, i8, i64, i32, i1) nounwind ; a 16-byte aligned store in the middle. define void @foo(i32* %p) { -; CHECK: @foo +; CHECK-LABEL: @foo( ; CHECK: call void @llvm.memset.p0i8.i64(i8* {{.*}}, i8 0, i64 16, i32 4, i1 false) %a0 = getelementptr i32* %p, i64 0 store i32 0, i32* %a0, align 4 @@ -24,7 +24,7 @@ define void @foo(i32* %p) { ; Replacing %a8 with %a4 in the memset requires boosting the alignment of %a4. define void @bar() { -; CHECK: @bar +; CHECK-LABEL: @bar( ; CHECK: %a4 = alloca i32, align 8 ; CHECK-NOT: memcpy %a4 = alloca i32, align 4 diff --git a/test/Transforms/MemCpyOpt/form-memset.ll b/test/Transforms/MemCpyOpt/form-memset.ll index f63b1dcfdd5..7c7b4fc0880 100644 --- a/test/Transforms/MemCpyOpt/form-memset.ll +++ b/test/Transforms/MemCpyOpt/form-memset.ll @@ -48,7 +48,7 @@ entry: store i8 %c, i8* %tmp73, align 1 %tmp76 = call i32 (...)* @bar( [19 x i8]* %x ) nounwind ret void -; CHECK: @test1 +; CHECK-LABEL: @test1( ; CHECK-NOT: store ; CHECK: call void @llvm.memset.p0i8.i64 ; CHECK-NOT: store @@ -150,7 +150,7 @@ entry: call void @foo( %struct.MV* %up_mvd252, %struct.MV* %left_mvd253, i8* %tmp41 ) nounwind ret void -; CHECK: @test2 +; CHECK-LABEL: @test2( ; CHECK-NOT: store ; CHECK: call void @llvm.memset.p0i8.i64(i8* %tmp41, i8 -1, i64 8, i32 1, i1 false) ; CHECK-NOT: store @@ -173,7 +173,7 @@ entry: %0 = bitcast i32* %add.ptr to i8* tail call void @llvm.memset.p0i8.i64(i8* %0, i8 0, i64 11, i32 1, i1 false) ret void -; CHECK: @test3 +; CHECK-LABEL: @test3( ; CHECK-NOT: store ; CHECK: call void @llvm.memset.p0i8.i64(i8* %1, i8 0, i64 15, i32 4, i1 false) } @@ -186,7 +186,7 @@ entry: %0 = bitcast i32* %add.ptr to i8* tail call void @llvm.memset.p0i8.i64(i8* %0, i8 0, i64 11, i32 1, i1 false) ret void -; CHECK: @test4 +; CHECK-LABEL: @test4( ; CHECK-NOT: store ; CHECK: call void @llvm.memset.p0i8.i64(i8* %1, i8 0, i64 15, i32 4, i1 false) } @@ -202,7 +202,7 @@ entry: %arrayidx = getelementptr inbounds i32* %P, i64 1 store i32 0, i32* %arrayidx, align 4 ret void -; CHECK: @test5 +; CHECK-LABEL: @test5( ; CHECK-NOT: store ; CHECK: call void @llvm.memset.p0i8.i64(i8* %1, i8 0, i64 15, i32 4, i1 false) } @@ -216,7 +216,7 @@ entry: %1 = bitcast i32* %add.ptr to i8* tail call void @llvm.memset.p0i8.i64(i8* %1, i8 0, i64 12, i32 1, i1 false) ret void -; CHECK: @test6 +; CHECK-LABEL: @test6( ; CHECK: call void @llvm.memset.p0i8.i64(i8* %2, i8 0, i64 24, i32 1, i1 false) } @@ -232,7 +232,7 @@ define void @test7(i32* nocapture %c) nounwind optsize { store i32 -1, i32* %3, align 4 %4 = getelementptr inbounds i32* %c, i32 4 store i32 -1, i32* %4, align 4 -; CHECK: @test7 +; CHECK-LABEL: @test7( ; CHECK: call void @llvm.memset.p0i8.i64(i8* %5, i8 -1, i64 20, i32 4, i1 false) ret void } @@ -245,7 +245,7 @@ entry: %0 = bitcast %struct.test8* %memtmp to <4 x i32>* store <4 x i32> , <4 x i32>* %0, align 16 ret void -; CHECK: @test8 +; CHECK-LABEL: @test8( ; CHECK: store <4 x i32> , <4 x i32>* %0, align 16 } @@ -269,6 +269,6 @@ define void @test9() nounwind { store i8 -1, i8* getelementptr (i8* bitcast ([16 x i64]* @test9buf to i8*), i64 14), align 2 store i8 -1, i8* getelementptr (i8* bitcast ([16 x i64]* @test9buf to i8*), i64 15), align 1 ret void -; CHECK: @test9( +; CHECK-LABEL: @test9( ; CHECK: call void @llvm.memset.p0i8.i64(i8* bitcast ([16 x i64]* @test9buf to i8*), i8 -1, i64 16, i32 16, i1 false) } diff --git a/test/Transforms/MemCpyOpt/loadstore-sret.ll b/test/Transforms/MemCpyOpt/loadstore-sret.ll index 67e7137e7e4..89eabca21bf 100644 --- a/test/Transforms/MemCpyOpt/loadstore-sret.ll +++ b/test/Transforms/MemCpyOpt/loadstore-sret.ll @@ -6,7 +6,7 @@ target triple = "x86_64-apple-darwin10.0.0" %"class.std::auto_ptr" = type { i32* } -; CHECK: @_Z3foov +; CHECK-LABEL: @_Z3foov( define void @_Z3foov(%"class.std::auto_ptr"* noalias nocapture sret %agg.result) ssp { _ZNSt8auto_ptrIiED1Ev.exit: %temp.lvalue = alloca %"class.std::auto_ptr", align 8 diff --git a/test/Transforms/MemCpyOpt/memcpy-to-memset.ll b/test/Transforms/MemCpyOpt/memcpy-to-memset.ll index b18d176f003..8409de7ad20 100644 --- a/test/Transforms/MemCpyOpt/memcpy-to-memset.ll +++ b/test/Transforms/MemCpyOpt/memcpy-to-memset.ll @@ -12,7 +12,7 @@ define void @test1() nounwind { %arraydecay = getelementptr inbounds [3 x i32]* %arr, i64 0, i64 0 call void @foo(i32* %arraydecay) nounwind ret void -; CHECK: @test1 +; CHECK-LABEL: @test1( ; CHECK: call void @llvm.memset ; CHECK-NOT: call void @llvm.memcpy ; CHECK: ret void diff --git a/test/Transforms/MemCpyOpt/memcpy.ll b/test/Transforms/MemCpyOpt/memcpy.ll index 148623a6ce7..2417cd11f7f 100644 --- a/test/Transforms/MemCpyOpt/memcpy.ll +++ b/test/Transforms/MemCpyOpt/memcpy.ll @@ -22,7 +22,7 @@ entry: ; Check that one of the memcpy's are removed. ;; FIXME: PR 8643 We should be able to eliminate the last memcpy here. -; CHECK: @test1 +; CHECK-LABEL: @test1( ; CHECK: call void @ccoshl ; CHECK: call void @llvm.memcpy ; CHECK-NOT: llvm.memcpy @@ -41,7 +41,7 @@ define void @test2(i8* %P, i8* %Q) nounwind { call void @llvm.memcpy.p0i8.p0i8.i32(i8* %Q, i8* %R, i32 32, i32 16, i1 false) ret void -; CHECK: @test2 +; CHECK-LABEL: @test2( ; CHECK-NEXT: call void @llvm.memmove{{.*}}(i8* %Q, i8* %P ; CHECK-NEXT: ret void } @@ -58,7 +58,7 @@ define void @test3(%0* noalias sret %agg.result) nounwind { %agg.result2 = bitcast %0* %agg.result to i8* call void @llvm.memcpy.p0i8.p0i8.i32(i8* %agg.result2, i8* %x.01, i32 32, i32 16, i1 false) ret void -; CHECK: @test3 +; CHECK-LABEL: @test3( ; CHECK-NEXT: %agg.result1 = bitcast ; CHECK-NEXT: call void @llvm.memcpy ; CHECK-NEXT: ret void @@ -72,7 +72,7 @@ define void @test4(i8 *%P) { call void @llvm.memcpy.p0i8.p0i8.i64(i8* %a, i8* %P, i64 8, i32 4, i1 false) call void @test4a(i8* align 1 byval %a) ret void -; CHECK: @test4 +; CHECK-LABEL: @test4( ; CHECK-NEXT: call void @test4a( } @@ -96,7 +96,7 @@ entry: store i8 4, i8* %a call void @test5a(%struct.S* align 16 byval %y) ret i32 0 - ; CHECK: @test5( + ; CHECK-LABEL: @test5( ; CHECK: store i8 4 ; CHECK: call void @test5a(%struct.S* byval align 16 %y) } @@ -105,7 +105,7 @@ entry: define void @test6(i8 *%P) { call void @llvm.memcpy.p0i8.p0i8.i64(i8* %P, i8* %P, i64 8, i32 4, i1 false) ret void -; CHECK: @test6 +; CHECK-LABEL: @test6( ; CHECK-NEXT: ret void } @@ -122,7 +122,7 @@ entry: call void @llvm.memcpy.p0i8.p0i8.i64(i8* %tmp, i8* %tmp1, i64 48, i32 4, i1 false) %call = call i32 @g(%struct.p* align 8 byval %agg.tmp) nounwind ret i32 %call -; CHECK: @test7 +; CHECK-LABEL: @test7( ; CHECK: call i32 @g(%struct.p* byval align 8 %q) [[NUW:#[0-9]+]] } diff --git a/test/Transforms/MemCpyOpt/memmove.ll b/test/Transforms/MemCpyOpt/memmove.ll index 7f1667a4555..2057760efa0 100644 --- a/test/Transforms/MemCpyOpt/memmove.ll +++ b/test/Transforms/MemCpyOpt/memmove.ll @@ -8,7 +8,7 @@ declare void @llvm.memmove.p0i8.p0i8.i64(i8* nocapture, i8* nocapture, i64, i32, define i8* @test1(i8* nocapture %src) nounwind { entry: -; CHECK: @test1 +; CHECK-LABEL: @test1( ; CHECK: call void @llvm.memcpy %malloccall = tail call i8* @malloc(i32 trunc (i64 mul nuw (i64 ptrtoint (i8* getelementptr (i8* null, i32 1) to i64), i64 13) to i32)) @@ -22,7 +22,7 @@ declare noalias i8* @malloc(i32) define void @test2(i8* %P) nounwind { entry: -; CHECK: @test2 +; CHECK-LABEL: @test2( ; CHECK: call void @llvm.memcpy %add.ptr = getelementptr i8* %P, i64 16 tail call void @llvm.memmove.p0i8.p0i8.i64(i8* %P, i8* %add.ptr, i64 16, i32 1, i1 false) @@ -32,7 +32,7 @@ entry: ; This cannot be optimize because the src/dst really do overlap. define void @test3(i8* %P) nounwind { entry: -; CHECK: @test3 +; CHECK-LABEL: @test3( ; CHECK: call void @llvm.memmove %add.ptr = getelementptr i8* %P, i64 16 tail call void @llvm.memmove.p0i8.p0i8.i64(i8* %P, i8* %add.ptr, i64 17, i32 1, i1 false) diff --git a/test/Transforms/ObjCARC/retain-not-declared.ll b/test/Transforms/ObjCARC/retain-not-declared.ll index 165829f7c01..3a2bd03692e 100644 --- a/test/Transforms/ObjCARC/retain-not-declared.ll +++ b/test/Transforms/ObjCARC/retain-not-declared.ll @@ -28,7 +28,7 @@ entry: ; Properly create the @objc_retain declaration when it doesn't already exist. ; rdar://9825114 -; CHECK: @test1( +; CHECK-LABEL: @test1( ; CHECK: @objc_retain( ; CHECK: @objc_retainAutoreleasedReturnValue( ; CHECK: @objc_release( diff --git a/test/Transforms/PhaseOrdering/PR6627.ll b/test/Transforms/PhaseOrdering/PR6627.ll index 58b762a7af4..cf95363e655 100644 --- a/test/Transforms/PhaseOrdering/PR6627.ll +++ b/test/Transforms/PhaseOrdering/PR6627.ll @@ -42,7 +42,7 @@ if.then: ; preds = %land.lhs.true17 if.end: ret void -; CHECK: @test2 +; CHECK-LABEL: @test2( ; CHECK: %x1 = load i32* %xx, align 4 ; CHECK-NEXT: icmp eq i32 %x1, 1179403647 ; CHECK-NEXT: br i1 {{.*}}, label %if.then, label %if.end @@ -86,7 +86,7 @@ if.then: ; preds = %land.lhs.true17 if.end: ret void -; CHECK: @test2a +; CHECK-LABEL: @test2a( ; CHECK: %x1 = load i32* {{.*}}, align 4 ; CHECK-NEXT: icmp eq i32 %x1, 1179403647 ; CHECK-NEXT: br i1 {{.*}}, label %if.then, label %if.end diff --git a/test/Transforms/PhaseOrdering/basic.ll b/test/Transforms/PhaseOrdering/basic.ll index 8fbe8c58f45..2deefa61810 100644 --- a/test/Transforms/PhaseOrdering/basic.ll +++ b/test/Transforms/PhaseOrdering/basic.ll @@ -19,7 +19,7 @@ define void @test1() nounwind ssp { call void @free(i8* %tmp1) ret void -; CHECK: @test1 +; CHECK-LABEL: @test1( ; CHECK-NEXT: ret void } @@ -44,7 +44,7 @@ entry: %sub = sub i32 %0, %mul ret i32 %sub -; CHECK: @test2 +; CHECK-LABEL: @test2( ; CHECK: %div = lshr i32 %a, 2 ; CHECK: %add = shl nuw nsw i32 %div, 1 ; CHECK: ret i32 0 diff --git a/test/Transforms/Reassociate/2012-05-08-UndefLeak.ll b/test/Transforms/Reassociate/2012-05-08-UndefLeak.ll index 2f5a53e0ce4..c563fe26c13 100644 --- a/test/Transforms/Reassociate/2012-05-08-UndefLeak.ll +++ b/test/Transforms/Reassociate/2012-05-08-UndefLeak.ll @@ -5,7 +5,7 @@ ; Transform disabled until PR13021 is fixed. define i64 @f(i64 %x0) { -; CHECK: @f +; CHECK-LABEL: @f( ; CHECK-NEXT: mul i64 %x0, 208 ; CHECK-NEXT: add i64 %{{.*}}, 1617 ; CHECK-NEXT: ret i64 diff --git a/test/Transforms/Reassociate/absorption.ll b/test/Transforms/Reassociate/absorption.ll index 2ccc2b57949..40b3d80eee9 100644 --- a/test/Transforms/Reassociate/absorption.ll +++ b/test/Transforms/Reassociate/absorption.ll @@ -6,6 +6,6 @@ define i8 @foo(i8 %x) { %tmp1 = or i8 %x, 127 %tmp2 = or i8 %tmp1, 128 ret i8 %tmp2 -; CHECK: @foo +; CHECK-LABEL: @foo( ; CHECK: ret i8 -1 } diff --git a/test/Transforms/Reassociate/basictest.ll b/test/Transforms/Reassociate/basictest.ll index 086474066c5..fda0ca6be1a 100644 --- a/test/Transforms/Reassociate/basictest.ll +++ b/test/Transforms/Reassociate/basictest.ll @@ -6,7 +6,7 @@ define i32 @test1(i32 %arg) { %tmp1 = sub i32 -12, %arg %tmp2 = add i32 %tmp1, 12 ret i32 %tmp2 -; CHECK: @test1 +; CHECK-LABEL: @test1( ; CHECK-NEXT: sub i32 0, %arg ; CHECK-NEXT: ret i32 } @@ -16,7 +16,7 @@ define i32 @test2(i32 %reg109, i32 %reg1111) { %reg116 = add i32 %reg115, %reg1111 ; [#uses=1] %reg117 = add i32 %reg116, 30 ; [#uses=1] ret i32 %reg117 -; CHECK: @test2 +; CHECK-LABEL: @test2( ; CHECK-NEXT: add i32 %reg1111, %reg109 ; CHECK-NEXT: ret i32 } @@ -40,7 +40,7 @@ define void @test3() { ; f = (a+c)+b store i32 %t4, i32* @f ret void -; CHECK: @test3 +; CHECK-LABEL: @test3( ; CHECK: add i32 ; CHECK: add i32 ; CHECK-NOT: add i32 @@ -60,7 +60,7 @@ define void @test4() { ; f = (c+a)+b store i32 %t4, i32* @f ret void -; CHECK: @test4 +; CHECK-LABEL: @test4( ; CHECK: add i32 ; CHECK: add i32 ; CHECK-NOT: add i32 @@ -80,7 +80,7 @@ define void @test5() { ; f = (c+a)+b store i32 %t4, i32* @f ret void -; CHECK: @test5 +; CHECK-LABEL: @test5( ; CHECK: add i32 ; CHECK: add i32 ; CHECK-NOT: add i32 @@ -102,7 +102,7 @@ define i32 @test6() { ; X ^ X = 0 %RV = xor i32 %tmp.5, %tmp.11 ret i32 %RV -; CHECK: @test6 +; CHECK-LABEL: @test6( ; CHECK: ret i32 0 } @@ -115,7 +115,7 @@ define i32 @test7(i32 %A, i32 %B, i32 %C) { %aac = mul i32 %ac, %A %r = add i32 %aab, %aac ret i32 %r -; CHECK: @test7 +; CHECK-LABEL: @test7( ; CHECK-NEXT: add i32 %C, %B ; CHECK-NEXT: mul i32 ; CHECK-NEXT: mul i32 @@ -129,7 +129,7 @@ define i32 @test8(i32 %X, i32 %Y, i32 %Z) { ; (-X)*Y + Z -> Z-X*Y %C = add i32 %B, %Z ret i32 %C -; CHECK: @test8 +; CHECK-LABEL: @test8( ; CHECK-NEXT: %A = mul i32 %Y, %X ; CHECK-NEXT: %C = sub i32 %Z, %A ; CHECK-NEXT: ret i32 %C @@ -141,7 +141,7 @@ define i32 @test9(i32 %X) { %Y = mul i32 %X, 47 %Z = add i32 %Y, %Y ret i32 %Z -; CHECK: @test9 +; CHECK-LABEL: @test9( ; CHECK-NEXT: mul i32 %X, 94 ; CHECK-NEXT: ret i32 } @@ -150,7 +150,7 @@ define i32 @test10(i32 %X) { %Y = add i32 %X ,%X %Z = add i32 %Y, %X ret i32 %Z -; CHECK: @test10 +; CHECK-LABEL: @test10( ; CHECK-NEXT: mul i32 %X, 3 ; CHECK-NEXT: ret i32 } @@ -160,7 +160,7 @@ define i32 @test11(i32 %W) { %Y = add i32 %X ,%X %Z = add i32 %Y, %X ret i32 %Z -; CHECK: @test11 +; CHECK-LABEL: @test11( ; CHECK-NEXT: mul i32 %W, 381 ; CHECK-NEXT: ret i32 } @@ -173,7 +173,7 @@ define i32 @test12(i32 %X) { %Y = add i32 %A ,%B %Z = add i32 %Y, %C ret i32 %Z -; CHECK: @test12 +; CHECK-LABEL: @test12( ; CHECK-NEXT: mul i32 %X, -3 ; CHECK-NEXT: add i32{{.*}}, 6 ; CHECK-NEXT: ret i32 @@ -185,7 +185,7 @@ define i32 @test13(i32 %X1, i32 %X2, i32 %X3) { %C = mul i32 %X1, %X3 ; X1*X3 %D = add i32 %B, %C ; -X1*X2 + X1*X3 -> X1*(X3-X2) ret i32 %D -; CHECK: @test13 +; CHECK-LABEL: @test13( ; CHECK-NEXT: sub i32 %X3, %X2 ; CHECK-NEXT: mul i32 {{.*}}, %X1 ; CHECK-NEXT: ret i32 @@ -197,7 +197,7 @@ define i32 @test14(i32 %X1, i32 %X2) { %C = mul i32 %X2, -47 ; X2*-47 %D = add i32 %B, %C ; X1*47 + X2*-47 -> 47*(X1-X2) ret i32 %D -; CHECK: @test14 +; CHECK-LABEL: @test14( ; CHECK-NEXT: sub i32 %X1, %X2 ; CHECK-NEXT: mul i32 {{.*}}, 47 ; CHECK-NEXT: ret i32 @@ -210,7 +210,7 @@ define i32 @test15(i32 %X1, i32 %X2, i32 %X3) { %C = and i1 %A, %B %D = select i1 %C, i32 %X1, i32 0 ret i32 %D -; CHECK: @test15 +; CHECK-LABEL: @test15( ; CHECK: and i1 %A, %B } diff --git a/test/Transforms/Reassociate/inverses.ll b/test/Transforms/Reassociate/inverses.ll index 34abdc7aae0..afe076caea9 100644 --- a/test/Transforms/Reassociate/inverses.ll +++ b/test/Transforms/Reassociate/inverses.ll @@ -6,7 +6,7 @@ define i32 @test1(i32 %a, i32 %b) { ; (A&B)&~A == 0 %tmp.5 = and i32 %tmp.2, %tmp.4 ret i32 %tmp.5 -; CHECK: @test1 +; CHECK-LABEL: @test1( ; CHECK: ret i32 0 } @@ -17,7 +17,7 @@ define i32 @test2(i32 %a, i32 %b) { ; A&~A == 0 %tmp.5 = and i32 %tmp.2, %tmp.4 ret i32 %tmp.5 -; CHECK: @test2 +; CHECK-LABEL: @test2( ; CHECK: ret i32 0 } @@ -28,7 +28,7 @@ define i32 @test3(i32 %b, i32 %a) { ; (b+(a+1234))+-a -> b+1234 %tmp.5 = add i32 %tmp.2, %tmp.4 ret i32 %tmp.5 -; CHECK: @test3 +; CHECK-LABEL: @test3( ; CHECK: %tmp.5 = add i32 %b, 1234 ; CHECK: ret i32 %tmp.5 } diff --git a/test/Transforms/Reassociate/mulfactor.ll b/test/Transforms/Reassociate/mulfactor.ll index 6c099b43b36..951228ec3cc 100644 --- a/test/Transforms/Reassociate/mulfactor.ll +++ b/test/Transforms/Reassociate/mulfactor.ll @@ -1,7 +1,7 @@ ; RUN: opt < %s -reassociate -S | FileCheck %s define i32 @test1(i32 %a, i32 %b) { -; CHECK: @test1 +; CHECK-LABEL: @test1( ; CHECK: mul i32 %a, %a ; CHECK-NEXT: mul i32 %a, 2 ; CHECK-NEXT: add @@ -20,7 +20,7 @@ entry: } define i32 @test2(i32 %t) { -; CHECK: @test2 +; CHECK-LABEL: @test2( ; CHECK: mul ; CHECK-NEXT: add ; CHECK-NEXT: ret @@ -35,7 +35,7 @@ entry: define i32 @test3(i32 %x) { ; (x^8) -; CHECK: @test3 +; CHECK-LABEL: @test3( ; CHECK: mul ; CHECK-NEXT: mul ; CHECK-NEXT: mul @@ -54,7 +54,7 @@ entry: define i32 @test4(i32 %x) { ; (x^7) -; CHECK: @test4 +; CHECK-LABEL: @test4( ; CHECK: mul ; CHECK-NEXT: mul ; CHECK-NEXT: mul @@ -73,7 +73,7 @@ entry: define i32 @test5(i32 %x, i32 %y) { ; (x^4) * (y^2) -; CHECK: @test5 +; CHECK-LABEL: @test5( ; CHECK: mul ; CHECK-NEXT: mul ; CHECK-NEXT: mul @@ -90,7 +90,7 @@ entry: define i32 @test6(i32 %x, i32 %y, i32 %z) { ; (x^5) * (y^3) * z -; CHECK: @test6 +; CHECK-LABEL: @test6( ; CHECK: mul ; CHECK-NEXT: mul ; CHECK-NEXT: mul @@ -113,7 +113,7 @@ entry: define i32 @test7(i32 %x, i32 %y, i32 %z) { ; (x^4) * (y^3) * (z^2) -; CHECK: @test7 +; CHECK-LABEL: @test7( ; CHECK: mul ; CHECK-NEXT: mul ; CHECK-NEXT: mul diff --git a/test/Transforms/Reassociate/multistep.ll b/test/Transforms/Reassociate/multistep.ll index 7466d2e99d8..d79464753f1 100644 --- a/test/Transforms/Reassociate/multistep.ll +++ b/test/Transforms/Reassociate/multistep.ll @@ -2,7 +2,7 @@ define i64 @multistep1(i64 %a, i64 %b, i64 %c) { ; Check that a*a*b+a*a*c is turned into a*(a*(b+c)). -; CHECK: @multistep1 +; CHECK-LABEL: @multistep1( %t0 = mul i64 %a, %b %t1 = mul i64 %a, %t0 ; a*(a*b) %t2 = mul i64 %a, %c @@ -17,7 +17,7 @@ define i64 @multistep1(i64 %a, i64 %b, i64 %c) { define i64 @multistep2(i64 %a, i64 %b, i64 %c, i64 %d) { ; Check that a*b+a*c+d is turned into a*(b+c)+d. -; CHECK: @multistep2 +; CHECK-LABEL: @multistep2( %t0 = mul i64 %a, %b %t1 = mul i64 %a, %c %t2 = add i64 %t1, %d ; a*c+d diff --git a/test/Transforms/Reassociate/no-op.ll b/test/Transforms/Reassociate/no-op.ll index 0444cf082d0..7b02df99464 100644 --- a/test/Transforms/Reassociate/no-op.ll +++ b/test/Transforms/Reassociate/no-op.ll @@ -8,7 +8,7 @@ declare void @use(i32) define void @test1(i32 %a, i32 %b) { ; Shouldn't change or move any of the add instructions. Should commute but ; otherwise not change or move any of the mul instructions. -; CHECK: @test1 +; CHECK-LABEL: @test1( %a0 = add nsw i32 %a, 1 ; CHECK-NEXT: %a0 = add nsw i32 %a, 1 %m0 = mul nsw i32 3, %a @@ -25,7 +25,7 @@ define void @test1(i32 %a, i32 %b) { define void @test2(i32 %a, i32 %b, i32 %c, i32 %d) { ; The initial add doesn't change so should not lose the nsw flag. -; CHECK: @test2 +; CHECK-LABEL: @test2( %a0 = add nsw i32 %b, %a ; CHECK-NEXT: %a0 = add nsw i32 %b, %a %a1 = add nsw i32 %a0, %d diff --git a/test/Transforms/Reassociate/optional-flags.ll b/test/Transforms/Reassociate/optional-flags.ll index 40f7d5bf5b8..bf599be78bc 100644 --- a/test/Transforms/Reassociate/optional-flags.ll +++ b/test/Transforms/Reassociate/optional-flags.ll @@ -3,7 +3,7 @@ ; Reassociate should clear optional flags like nsw when reassociating. -; CHECK: @test0 +; CHECK-LABEL: @test0( ; CHECK: %y = add i64 %b, %a ; CHECK: %z = add i64 %y, %c define i64 @test0(i64 %a, i64 %b, i64 %c) { @@ -12,7 +12,7 @@ define i64 @test0(i64 %a, i64 %b, i64 %c) { ret i64 %z } -; CHECK: @test1 +; CHECK-LABEL: @test1( ; CHECK: %y = add i64 %b, %a ; CHECK: %z = add i64 %y, %c define i64 @test1(i64 %a, i64 %b, i64 %c) { diff --git a/test/Transforms/Reassociate/repeats.ll b/test/Transforms/Reassociate/repeats.ll index 6a020470f37..547cb0ad72c 100644 --- a/test/Transforms/Reassociate/repeats.ll +++ b/test/Transforms/Reassociate/repeats.ll @@ -3,14 +3,14 @@ ; Tests involving repeated operations on the same value. define i8 @nilpotent(i8 %x) { -; CHECK: @nilpotent +; CHECK-LABEL: @nilpotent( %tmp = xor i8 %x, %x ret i8 %tmp ; CHECK: ret i8 0 } define i2 @idempotent(i2 %x) { -; CHECK: @idempotent +; CHECK-LABEL: @idempotent( %tmp1 = and i2 %x, %x %tmp2 = and i2 %tmp1, %x %tmp3 = and i2 %tmp2, %x @@ -19,7 +19,7 @@ define i2 @idempotent(i2 %x) { } define i2 @add(i2 %x) { -; CHECK: @add +; CHECK-LABEL: @add( %tmp1 = add i2 %x, %x %tmp2 = add i2 %tmp1, %x %tmp3 = add i2 %tmp2, %x @@ -28,7 +28,7 @@ define i2 @add(i2 %x) { } define i2 @cst_add() { -; CHECK: @cst_add +; CHECK-LABEL: @cst_add( %tmp1 = add i2 1, 1 %tmp2 = add i2 %tmp1, 1 ret i2 %tmp2 @@ -36,7 +36,7 @@ define i2 @cst_add() { } define i8 @cst_mul() { -; CHECK: @cst_mul +; CHECK-LABEL: @cst_mul( %tmp1 = mul i8 3, 3 %tmp2 = mul i8 %tmp1, 3 %tmp3 = mul i8 %tmp2, 3 @@ -47,7 +47,7 @@ define i8 @cst_mul() { define i3 @foo3x5(i3 %x) { ; Can be done with two multiplies. -; CHECK: @foo3x5 +; CHECK-LABEL: @foo3x5( ; CHECK-NEXT: mul ; CHECK-NEXT: mul ; CHECK-NEXT: ret @@ -60,7 +60,7 @@ define i3 @foo3x5(i3 %x) { define i3 @foo3x6(i3 %x) { ; Can be done with two multiplies. -; CHECK: @foo3x6 +; CHECK-LABEL: @foo3x6( ; CHECK-NEXT: mul ; CHECK-NEXT: mul ; CHECK-NEXT: ret @@ -74,7 +74,7 @@ define i3 @foo3x6(i3 %x) { define i3 @foo3x7(i3 %x) { ; Can be done with two multiplies. -; CHECK: @foo3x7 +; CHECK-LABEL: @foo3x7( ; CHECK-NEXT: mul ; CHECK-NEXT: mul ; CHECK-NEXT: ret @@ -89,7 +89,7 @@ define i3 @foo3x7(i3 %x) { define i4 @foo4x8(i4 %x) { ; Can be done with two multiplies. -; CHECK: @foo4x8 +; CHECK-LABEL: @foo4x8( ; CHECK-NEXT: mul ; CHECK-NEXT: mul ; CHECK-NEXT: ret @@ -105,7 +105,7 @@ define i4 @foo4x8(i4 %x) { define i4 @foo4x9(i4 %x) { ; Can be done with three multiplies. -; CHECK: @foo4x9 +; CHECK-LABEL: @foo4x9( ; CHECK-NEXT: mul ; CHECK-NEXT: mul ; CHECK-NEXT: mul @@ -123,7 +123,7 @@ define i4 @foo4x9(i4 %x) { define i4 @foo4x10(i4 %x) { ; Can be done with three multiplies. -; CHECK: @foo4x10 +; CHECK-LABEL: @foo4x10( ; CHECK-NEXT: mul ; CHECK-NEXT: mul ; CHECK-NEXT: mul @@ -142,7 +142,7 @@ define i4 @foo4x10(i4 %x) { define i4 @foo4x11(i4 %x) { ; Can be done with four multiplies. -; CHECK: @foo4x11 +; CHECK-LABEL: @foo4x11( ; CHECK-NEXT: mul ; CHECK-NEXT: mul ; CHECK-NEXT: mul @@ -163,7 +163,7 @@ define i4 @foo4x11(i4 %x) { define i4 @foo4x12(i4 %x) { ; Can be done with two multiplies. -; CHECK: @foo4x12 +; CHECK-LABEL: @foo4x12( ; CHECK-NEXT: mul ; CHECK-NEXT: mul ; CHECK-NEXT: ret @@ -183,7 +183,7 @@ define i4 @foo4x12(i4 %x) { define i4 @foo4x13(i4 %x) { ; Can be done with three multiplies. -; CHECK: @foo4x13 +; CHECK-LABEL: @foo4x13( ; CHECK-NEXT: mul ; CHECK-NEXT: mul ; CHECK-NEXT: mul @@ -205,7 +205,7 @@ define i4 @foo4x13(i4 %x) { define i4 @foo4x14(i4 %x) { ; Can be done with three multiplies. -; CHECK: @foo4x14 +; CHECK-LABEL: @foo4x14( ; CHECK-NEXT: mul ; CHECK-NEXT: mul ; CHECK-NEXT: mul @@ -228,7 +228,7 @@ define i4 @foo4x14(i4 %x) { define i4 @foo4x15(i4 %x) { ; Can be done with four multiplies. -; CHECK: @foo4x15 +; CHECK-LABEL: @foo4x15( ; CHECK-NEXT: mul ; CHECK-NEXT: mul ; CHECK-NEXT: mul diff --git a/test/Transforms/Reassociate/xor_reassoc.ll b/test/Transforms/Reassociate/xor_reassoc.ll index b9353c7f81f..a22689805fb 100644 --- a/test/Transforms/Reassociate/xor_reassoc.ll +++ b/test/Transforms/Reassociate/xor_reassoc.ll @@ -14,7 +14,7 @@ define i32 @xor1(i32 %x) { %xor = xor i32 %or, %or1 ret i32 %xor -;CHECK: @xor1 +;CHECK-LABEL: @xor1( ;CHECK: %and.ra = and i32 %x, 435 ;CHECK: %xor = xor i32 %and.ra, 435 } @@ -28,7 +28,7 @@ define i32 @xor2(i32 %x, i32 %y) { %xor2 = xor i32 %xor, %and1 ret i32 %xor2 -;CHECK: @xor2 +;CHECK-LABEL: @xor2( ;CHECK: %and.ra = and i32 %x, 435 ;CHECK: %xor2 = xor i32 %and.ra, %y } @@ -42,7 +42,7 @@ define i32 @xor3(i32 %x, i32 %y) { %xor1 = xor i32 %xor, %and ret i32 %xor1 -;CHECK: @xor3 +;CHECK-LABEL: @xor3( ;CHECK: %and.ra = and i32 %x, -436 ;CHECK: %xor = xor i32 %y, 123 ;CHECK: %xor1 = xor i32 %xor, %and.ra @@ -54,7 +54,7 @@ define i32 @xor4(i32 %x, i32 %y) { %xor = xor i32 %y, 435 %xor1 = xor i32 %xor, %and ret i32 %xor1 -; CHECK: @xor4 +; CHECK-LABEL: @xor4( ; CHECK: %and = and i32 %x, -124 ; CHECK: %xor = xor i32 %y, 435 ; CHECK: %xor1 = xor i32 %xor, %and @@ -74,7 +74,7 @@ define i32 @xor_special1(i32 %x, i32 %y) { %and = and i32 %x, -124 %xor1 = xor i32 %xor, %and ret i32 %xor1 -; CHECK: @xor_special1 +; CHECK-LABEL: @xor_special1( ; CHECK: %xor1 = xor i32 %y, 123 ; CHECK: ret i32 %xor1 } @@ -87,7 +87,7 @@ define i32 @xor_special2(i32 %x, i32 %y) { %and = and i32 %x, 123 %xor1 = xor i32 %xor, %and ret i32 %xor1 -; CHECK: @xor_special2 +; CHECK-LABEL: @xor_special2( ; CHECK: %xor = xor i32 %y, 123 ; CHECK: %xor1 = xor i32 %xor, %x ; CHECK: ret i32 %xor1 @@ -99,7 +99,7 @@ define i32 @xor_special3(i32 %x) { %or1 = or i32 %x, 123 %xor = xor i32 %or, %or1 ret i32 %xor -;CHECK: @xor_special3 +;CHECK-LABEL: @xor_special3( ;CHECK: ret i32 0 } @@ -109,7 +109,7 @@ define i32 @xor_special4(i32 %x) { %or1 = and i32 123, %x %xor = xor i32 %or, %or1 ret i32 %xor -;CHECK: @xor_special4 +;CHECK-LABEL: @xor_special4( ;CHECK: ret i32 0 } @@ -129,7 +129,7 @@ define i32 @xor_ra_size1(i32 %x) { %add = add i32 %xor, %or ret i32 %add -;CHECK: @xor_ra_size1 +;CHECK-LABEL: @xor_ra_size1( ;CHECK: %xor = xor i32 %and.ra, 435 } @@ -145,7 +145,7 @@ define i32 @xor_ra_size2(i32 %x) { %add2 = add i32 %add, %or1 ret i32 %add2 -;CHECK: @xor_ra_size2 +;CHECK-LABEL: @xor_ra_size2( ;CHECK: %or1 = or i32 %x, 456 ;CHECK: %xor = xor i32 %or, %or1 } @@ -188,6 +188,6 @@ define i32 @xor_bug2(i32, i32, i32, i32) { %19 = add i32 %18, %12 %20 = add i32 %19, %15 ret i32 %20 -;CHECK: @xor_bug2 +;CHECK-LABEL: @xor_bug2( ;CHECK: xor i32 %5, 891034567 } diff --git a/test/Transforms/SCCP/ipsccp-addr-taken.ll b/test/Transforms/SCCP/ipsccp-addr-taken.ll index b49da97ab2c..ca586a009b3 100644 --- a/test/Transforms/SCCP/ipsccp-addr-taken.ll +++ b/test/Transforms/SCCP/ipsccp-addr-taken.ll @@ -6,7 +6,7 @@ target triple = "x86_64-apple-darwin10.0.0" define internal i32 @foo() nounwind noinline ssp { entry: ret i32 0 -; CHECK: @foo +; CHECK-LABEL: @foo( ; CHECK: entry: ; CHECK: ret i32 0 } diff --git a/test/Transforms/SCCP/ipsccp-basic.ll b/test/Transforms/SCCP/ipsccp-basic.ll index 8340f0c1e12..7e05ce4ce71 100644 --- a/test/Transforms/SCCP/ipsccp-basic.ll +++ b/test/Transforms/SCCP/ipsccp-basic.ll @@ -162,7 +162,7 @@ define internal %T @test7a(i32 %A) { %mrv0 = insertvalue %T undef, i32 %X, 0 %mrv1 = insertvalue %T %mrv0, i32 %A, 1 ret %T %mrv1 -; CHECK: @test7a +; CHECK-LABEL: @test7a( ; CHECK-NEXT: %mrv0 = insertvalue %T undef, i32 18, 0 ; CHECK-NEXT: %mrv1 = insertvalue %T %mrv0, i32 17, 1 } @@ -183,7 +183,7 @@ define i32 @test7b() { define internal {} @test8a(i32 %A, i32* %P) { store i32 %A, i32* %P ret {} {} -; CHECK: @test8a +; CHECK-LABEL: @test8a( ; CHECK-NEXT: store i32 5, ; CHECK-NEXT: ret } diff --git a/test/Transforms/SCCP/sccptest.ll b/test/Transforms/SCCP/sccptest.ll index a719f6cfb48..5cc5087b101 100644 --- a/test/Transforms/SCCP/sccptest.ll +++ b/test/Transforms/SCCP/sccptest.ll @@ -14,7 +14,7 @@ BB3: ; preds = %BB2, %BB1 %Ret = phi i32 [ %Val, %BB1 ], [ 1, %BB2 ] ; [#uses=1] ret i32 %Ret -; CHECK: @test1 +; CHECK-LABEL: @test1( ; CHECK: %Ret = phi i32 [ 0, %BB1 ], [ 1, %BB2 ] } @@ -22,7 +22,7 @@ BB3: ; preds = %BB2, %BB1 ; that SCCP gets right. ; define i32 @test2(i32 %i0, i32 %j0) { -; CHECK: @test2 +; CHECK-LABEL: @test2( BB1: br label %BB2 BB2: diff --git a/test/Transforms/SCCP/undef-resolve.ll b/test/Transforms/SCCP/undef-resolve.ll index a1a600c9607..2b40183c2cc 100644 --- a/test/Transforms/SCCP/undef-resolve.ll +++ b/test/Transforms/SCCP/undef-resolve.ll @@ -5,7 +5,7 @@ define double @test1() { %t = sitofp i32 undef to double ret double %t -; CHECK: @test1 +; CHECK-LABEL: @test1( ; CHECK: ret double 0.0 } @@ -13,7 +13,7 @@ define double @test1() { ; rdar://7832370 ; Check that lots of stuff doesn't get turned into undef. define i32 @test2() nounwind readnone ssp { -; CHECK: @test2 +; CHECK-LABEL: @test2( init: br label %control.outer.outer @@ -110,7 +110,7 @@ bb1: ; preds = %bb1.us-lcssa, %bb1. define i32 @test3() { %t = xor i32 undef, undef ret i32 %t -; CHECK: @test3 +; CHECK-LABEL: @test3( ; CHECK: ret i32 0 } @@ -118,7 +118,7 @@ define i32 @test3() { define double @test4(double %x) { %t = fadd double %x, undef ret double %t -; CHECK: @test4 +; CHECK-LABEL: @test4( ; CHECK: fadd double %x, undef } @@ -126,7 +126,7 @@ define double @test4(double %x) { define i32 @test5() { %t = sext i8 undef to i32 ret i32 %t -; CHECK: @test5 +; CHECK-LABEL: @test5( ; CHECK: ret i32 0 } @@ -134,7 +134,7 @@ define i32 @test5() { define i32 @test6() { %t = ashr i32 undef, 31 ret i32 %t -; CHECK: @test6 +; CHECK-LABEL: @test6( ; CHECK: ret i32 -1 } @@ -142,7 +142,7 @@ define i32 @test6() { define i32 @test7() { %t = lshr i32 undef, 31 ret i32 %t -; CHECK: @test7 +; CHECK-LABEL: @test7( ; CHECK: ret i32 0 } @@ -150,7 +150,7 @@ define i32 @test7() { define i1 @test8() { %t = icmp eq i32 undef, -1 ret i1 %t -; CHECK: @test8 +; CHECK-LABEL: @test8( ; CHECK: ret i1 undef } @@ -158,7 +158,7 @@ define i1 @test8() { define i1 @test9() { %t = icmp ugt i32 undef, -1 ret i1 %t -; CHECK: @test9 +; CHECK-LABEL: @test9( ; CHECK: icmp ugt } @@ -167,6 +167,6 @@ define i64 @test10() { entry: %e = extractvalue { i64, i64 } undef, 1 ret i64 %e -; CHECK: @test10 +; CHECK-LABEL: @test10( ; CHECK: ret i64 undef } diff --git a/test/Transforms/SLPVectorizer/X86/barriercall.ll b/test/Transforms/SLPVectorizer/X86/barriercall.ll index 04eb8f919bc..bba285526a4 100644 --- a/test/Transforms/SLPVectorizer/X86/barriercall.ll +++ b/test/Transforms/SLPVectorizer/X86/barriercall.ll @@ -3,7 +3,7 @@ target 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-S128" target triple = "x86_64-apple-macosx10.8.0" -;CHECK: @foo +;CHECK-LABEL: @foo( ;CHECK: store <4 x i32> ;CHECK: ret define i32 @foo(i32* nocapture %A, i32 %n) { diff --git a/test/Transforms/SLPVectorizer/X86/cast.ll b/test/Transforms/SLPVectorizer/X86/cast.ll index 344dbbca2c5..e340fba351a 100644 --- a/test/Transforms/SLPVectorizer/X86/cast.ll +++ b/test/Transforms/SLPVectorizer/X86/cast.ll @@ -9,7 +9,7 @@ target triple = "x86_64-apple-macosx10.9.0" ; A[2] = B[2]; ; A[3] = B[3]; ; } -;CHECK: @foo +;CHECK-LABEL: @foo( ;CHECK: load <4 x i8> ;CHECK: sext ;CHECK: store <4 x i32> diff --git a/test/Transforms/SLPVectorizer/X86/cmp_sel.ll b/test/Transforms/SLPVectorizer/X86/cmp_sel.ll index 3bf4f19517a..0c124a75d41 100644 --- a/test/Transforms/SLPVectorizer/X86/cmp_sel.ll +++ b/test/Transforms/SLPVectorizer/X86/cmp_sel.ll @@ -8,7 +8,7 @@ target triple = "x86_64-apple-macosx10.8.0" ; A[1] = (B[11] ? G : 1); ; } -;CHECK: @foo +;CHECK-LABEL: @foo( ;CHECK: load <2 x double> ;CHECK: fcmp une <2 x double> ;CHECK: select <2 x i1> diff --git a/test/Transforms/SLPVectorizer/X86/compare-reduce.ll b/test/Transforms/SLPVectorizer/X86/compare-reduce.ll index 05f8e616bb8..9653d18db56 100644 --- a/test/Transforms/SLPVectorizer/X86/compare-reduce.ll +++ b/test/Transforms/SLPVectorizer/X86/compare-reduce.ll @@ -5,7 +5,7 @@ target triple = "x86_64-apple-macosx10.7.0" @.str = private unnamed_addr constant [6 x i8] c"bingo\00", align 1 -;CHECK: @reduce_compare +;CHECK-LABEL: @reduce_compare( ;CHECK: load <2 x double> ;CHECK: fmul <2 x double> ;CHECK: fmul <2 x double> diff --git a/test/Transforms/SLPVectorizer/X86/cross_block_slp.ll b/test/Transforms/SLPVectorizer/X86/cross_block_slp.ll index 8246453519b..06c4b524ee9 100644 --- a/test/Transforms/SLPVectorizer/X86/cross_block_slp.ll +++ b/test/Transforms/SLPVectorizer/X86/cross_block_slp.ll @@ -16,7 +16,7 @@ target triple = "x86_64-apple-macosx10.8.0" ; } -;CHECK: @foo +;CHECK-LABEL: @foo( ;CHECK: load <2 x float> ;CHECK: fadd <2 x float> ;CHECK: call i32 diff --git a/test/Transforms/SLPVectorizer/X86/cse.ll b/test/Transforms/SLPVectorizer/X86/cse.ll index 63eaeecf110..bbfd6f28ea9 100644 --- a/test/Transforms/SLPVectorizer/X86/cse.ll +++ b/test/Transforms/SLPVectorizer/X86/cse.ll @@ -10,7 +10,7 @@ target triple = "i386-apple-macosx10.8.0" ; G[3] = 8+G[6]*4; ;} -;CHECK: @test +;CHECK-LABEL: @test( ;CHECK: load <2 x double> ;CHECK: fadd <2 x double> ;CHECK: store <2 x double> @@ -48,7 +48,7 @@ entry: ; A[2] = A[2] * 7.6 * n + 3.0; ; A[3] = A[3] * 7.4 * n + 4.0; ;} -;CHECK: @foo +;CHECK-LABEL: @foo( ;CHECK: insertelement <2 x double> ;CHECK: insertelement <2 x double> ;CHECK-NOT: insertelement <2 x double> @@ -140,7 +140,7 @@ define i32 @test2(double* nocapture %G, i32 %k) { ; A[2] = A[2] * 7.9 * n + 6.0; ; A[3] = A[3] * 7.9 * n + 6.0; ;} -;CHECK: @foo4 +;CHECK-LABEL: @foo4( ;CHECK: insertelement <2 x double> ;CHECK: insertelement <2 x double> ;CHECK-NOT: insertelement <2 x double> @@ -181,7 +181,7 @@ entry: ; A[2] = A[2] * n; ; A[3] = A[3] * (n+4); ;} -;CHECK: @partial_mrg +;CHECK-LABEL: @partial_mrg( ;CHECK: insertelement <2 x double> ;CHECK: insertelement <2 x double> ;CHECK: insertelement <2 x double> diff --git a/test/Transforms/SLPVectorizer/X86/diamond.ll b/test/Transforms/SLPVectorizer/X86/diamond.ll index 099f7cfb97e..5135a92a7bd 100644 --- a/test/Transforms/SLPVectorizer/X86/diamond.ll +++ b/test/Transforms/SLPVectorizer/X86/diamond.ll @@ -11,7 +11,7 @@ target triple = "x86_64-apple-macosx10.8.0" ; return 0; ; } -; CHECK: @foo +; CHECK-LABEL: @foo( ; CHECK: load <4 x i32> ; CHECK: mul <4 x i32> ; CHECK: store <4 x i32> @@ -49,7 +49,7 @@ entry: ; return A[0]; ; } -; CHECK: @extr_user +; CHECK-LABEL: @extr_user( ; CHECK: load <4 x i32> ; CHECK: store <4 x i32> ; CHECK: extractelement <4 x i32> @@ -79,7 +79,7 @@ entry: } ; In this example we have an external user that is not the first element in the vector. -; CHECK: @extr_user1 +; CHECK-LABEL: @extr_user1( ; CHECK: load <4 x i32> ; CHECK: store <4 x i32> ; CHECK: extractelement <4 x i32> diff --git a/test/Transforms/SLPVectorizer/X86/in-tree-user.ll b/test/Transforms/SLPVectorizer/X86/in-tree-user.ll index 69dc8897d63..3115232887b 100644 --- a/test/Transforms/SLPVectorizer/X86/in-tree-user.ll +++ b/test/Transforms/SLPVectorizer/X86/in-tree-user.ll @@ -6,7 +6,7 @@ target triple = "x86_64-apple-macosx10.7.0" @.str = private unnamed_addr constant [6 x i8] c"bingo\00", align 1 ; We can't vectorize when the roots are used inside the tree. -;CHECK: @in_tree_user +;CHECK-LABEL: @in_tree_user( ;CHECK-NOT: load <2 x double> ;CHECK: ret define void @in_tree_user(double* nocapture %A, i32 %n) { diff --git a/test/Transforms/SLPVectorizer/X86/loopinvariant.ll b/test/Transforms/SLPVectorizer/X86/loopinvariant.ll index 4a37fce2ff2..aef2479dd52 100644 --- a/test/Transforms/SLPVectorizer/X86/loopinvariant.ll +++ b/test/Transforms/SLPVectorizer/X86/loopinvariant.ll @@ -3,7 +3,7 @@ target 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-S128" target triple = "x86_64-apple-macosx10.8.0" -;CHECK: @foo +;CHECK-LABEL: @foo( ;CHECK: load <4 x i32> ;CHECK: add <4 x i32> ;CHECK: store <4 x i32> diff --git a/test/Transforms/SLPVectorizer/X86/multi_block.ll b/test/Transforms/SLPVectorizer/X86/multi_block.ll index eed3f371b80..2f1cc74d05f 100644 --- a/test/Transforms/SLPVectorizer/X86/multi_block.ll +++ b/test/Transforms/SLPVectorizer/X86/multi_block.ll @@ -16,7 +16,7 @@ target triple = "x86_64-apple-macosx10.7.0" ; } -;CHECK: @bar +;CHECK-LABEL: @bar( ;CHECK: load <2 x double> ;CHECK: fptrunc <2 x double> ;CHECK: call i32 diff --git a/test/Transforms/SLPVectorizer/X86/multi_user.ll b/test/Transforms/SLPVectorizer/X86/multi_user.ll index aaa6063fded..cab99945e29 100644 --- a/test/Transforms/SLPVectorizer/X86/multi_user.ll +++ b/test/Transforms/SLPVectorizer/X86/multi_user.ll @@ -11,7 +11,7 @@ target triple = "x86_64-apple-macosx10.7.0" ; A[4] += n * 5 + 11; ;} -;CHECK: @foo +;CHECK-LABEL: @foo( ;CHECK: insertelement <4 x i32> ;CHECK: load <4 x i32> ;CHECK: add <4 x i32> diff --git a/test/Transforms/SLPVectorizer/X86/odd_store.ll b/test/Transforms/SLPVectorizer/X86/odd_store.ll index cb2b6862990..de6503b477f 100644 --- a/test/Transforms/SLPVectorizer/X86/odd_store.ll +++ b/test/Transforms/SLPVectorizer/X86/odd_store.ll @@ -9,7 +9,7 @@ target triple = "x86_64-apple-macosx10.8.0" ; A[2] = (T * B[12] + 6.0); ;} -;CHECK: @foo +;CHECK-LABEL: @foo( ;CHECK: load <3 x float> ;CHECK: fmul <3 x float> ;CHECK: fpext <3 x float> diff --git a/test/Transforms/SLPVectorizer/X86/reduction2.ll b/test/Transforms/SLPVectorizer/X86/reduction2.ll index 7aa7d7e243d..1dc77d2ef5b 100644 --- a/test/Transforms/SLPVectorizer/X86/reduction2.ll +++ b/test/Transforms/SLPVectorizer/X86/reduction2.ll @@ -3,7 +3,7 @@ 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-n8:16:32-S128" target triple = "i386-apple-macosx10.8.0" -;CHECK: @foo +;CHECK-LABEL: @foo( ;CHECK: load <2 x double> ;CHECK: ret define double @foo(double* nocapture %D) { diff --git a/test/Transforms/SLPVectorizer/X86/rgb_phi.ll b/test/Transforms/SLPVectorizer/X86/rgb_phi.ll index 9f5a6213c2f..3235fd9a30f 100644 --- a/test/Transforms/SLPVectorizer/X86/rgb_phi.ll +++ b/test/Transforms/SLPVectorizer/X86/rgb_phi.ll @@ -17,7 +17,7 @@ target triple = "i386-apple-macosx10.9.0" ; return R+G+B; ; } -;CHECK: @foo +;CHECK-LABEL: @foo( ;CHECK: br ;CHECK: phi <3 x float> ;CHECK: fmul <3 x float> diff --git a/test/Transforms/SROA/alignment.ll b/test/Transforms/SROA/alignment.ll index ad5fb6c4a5d..5fa78766ed0 100644 --- a/test/Transforms/SROA/alignment.ll +++ b/test/Transforms/SROA/alignment.ll @@ -4,7 +4,7 @@ target datalayout = "e-p:64:64:64-i1:8:8-i8:8:8-i16:16:16-i32:32:32-i64:32:64-f3 declare void @llvm.memcpy.p0i8.p0i8.i32(i8*, i8*, i32, i32, i1) define void @test1({ i8, i8 }* %a, { i8, i8 }* %b) { -; CHECK: @test1 +; CHECK-LABEL: @test1( ; CHECK: %[[gep_a0:.*]] = getelementptr inbounds { i8, i8 }* %a, i64 0, i32 0 ; CHECK: %[[a0:.*]] = load i8* %[[gep_a0]], align 16 ; CHECK: %[[gep_a1:.*]] = getelementptr inbounds { i8, i8 }* %a, i64 0, i32 1 @@ -29,7 +29,7 @@ entry: } define void @test2() { -; CHECK: @test2 +; CHECK-LABEL: @test2( ; CHECK: alloca i16 ; CHECK: load i8* %{{.*}} ; CHECK: store i8 42, i8* %{{.*}} @@ -48,7 +48,7 @@ entry: define void @PR13920(<2 x i64>* %a, i16* %b) { ; Test that alignments on memcpy intrinsics get propagated to loads and stores. -; CHECK: @PR13920 +; CHECK-LABEL: @PR13920( ; CHECK: load <2 x i64>* %a, align 2 ; CHECK: store <2 x i64> {{.*}}, <2 x i64>* {{.*}}, align 2 ; CHECK: ret void @@ -68,7 +68,7 @@ define void @test3(i8* %x) { ; provide the needed explicit alignment that code using the alloca may be ; expecting. However, also check that any offset within an alloca can in turn ; reduce the alignment. -; CHECK: @test3 +; CHECK-LABEL: @test3( ; CHECK: alloca [22 x i8], align 8 ; CHECK: alloca [18 x i8], align 2 ; CHECK: ret void @@ -86,7 +86,7 @@ entry: define void @test5() { ; Test that we preserve underaligned loads and stores when splitting. -; CHECK: @test5 +; CHECK-LABEL: @test5( ; CHECK: alloca [9 x i8] ; CHECK: alloca [9 x i8] ; CHECK: store volatile double 0.0{{.*}}, double* %{{.*}}, align 1 @@ -119,7 +119,7 @@ entry: define void @test6() { ; Test that we promote alignment when the underlying alloca switches to one ; that innately provides it. -; CHECK: @test6 +; CHECK-LABEL: @test6( ; CHECK: alloca double ; CHECK: alloca double ; CHECK-NOT: align @@ -142,7 +142,7 @@ entry: define void @test7(i8* %out) { ; Test that we properly compute the destination alignment when rewriting ; memcpys as direct loads or stores. -; CHECK: @test7 +; CHECK-LABEL: @test7( ; CHECK-NOT: alloca entry: diff --git a/test/Transforms/SROA/basictest.ll b/test/Transforms/SROA/basictest.ll index 834032246f9..7a05b55693d 100644 --- a/test/Transforms/SROA/basictest.ll +++ b/test/Transforms/SROA/basictest.ll @@ -7,7 +7,7 @@ declare void @llvm.lifetime.start(i64, i8* nocapture) declare void @llvm.lifetime.end(i64, i8* nocapture) define i32 @test0() { -; CHECK: @test0 +; CHECK-LABEL: @test0( ; CHECK-NOT: alloca ; CHECK: ret i32 @@ -37,7 +37,7 @@ entry: } define i32 @test1() { -; CHECK: @test1 +; CHECK-LABEL: @test1( ; CHECK-NOT: alloca ; CHECK: ret i32 0 @@ -50,7 +50,7 @@ entry: } define i64 @test2(i64 %X) { -; CHECK: @test2 +; CHECK-LABEL: @test2( ; CHECK-NOT: alloca ; CHECK: ret i64 %X @@ -66,7 +66,7 @@ L2: } define void @test3(i8* %dst, i8* %src) { -; CHECK: @test3 +; CHECK-LABEL: @test3( entry: %a = alloca [300 x i8] @@ -302,7 +302,7 @@ entry: } define void @test4(i8* %dst, i8* %src) { -; CHECK: @test4 +; CHECK-LABEL: @test4( entry: %a = alloca [100 x i8] @@ -408,7 +408,7 @@ declare void @llvm.memmove.p0i8.p0i8.i32(i8* nocapture, i8* nocapture, i32, i32, declare void @llvm.memset.p0i8.i32(i8* nocapture, i8, i32, i32, i1) nounwind define i16 @test5() { -; CHECK: @test5 +; CHECK-LABEL: @test5( ; CHECK-NOT: alloca float ; CHECK: %[[cast:.*]] = bitcast float 0.0{{.*}} to i32 ; CHECK-NEXT: %[[shr:.*]] = lshr i32 %[[cast]], 16 @@ -426,7 +426,7 @@ entry: } define i32 @test6() { -; CHECK: @test6 +; CHECK-LABEL: @test6( ; CHECK: alloca i32 ; CHECK-NEXT: store volatile i32 ; CHECK-NEXT: load i32* @@ -442,7 +442,7 @@ entry: } define void @test7(i8* %src, i8* %dst) { -; CHECK: @test7 +; CHECK-LABEL: @test7( ; CHECK: alloca i32 ; CHECK-NEXT: bitcast i8* %src to i32* ; CHECK-NEXT: load volatile i32* @@ -465,7 +465,7 @@ entry: %S2 = type { %S1*, %S2* } define %S2 @test8(%S2* %s2) { -; CHECK: @test8 +; CHECK-LABEL: @test8( entry: %new = alloca %S2 ; CHECK-NOT: alloca @@ -503,7 +503,7 @@ define i64 @test9() { ; weird bit casts and types. This is valid IR due to the alignment and masking ; off the bits past the end of the alloca. ; -; CHECK: @test9 +; CHECK-LABEL: @test9( ; CHECK-NOT: alloca ; CHECK: %[[b2:.*]] = zext i8 26 to i64 ; CHECK-NEXT: %[[s2:.*]] = shl i64 %[[b2]], 16 @@ -535,7 +535,7 @@ entry: } define %S2* @test10() { -; CHECK: @test10 +; CHECK-LABEL: @test10( ; CHECK-NOT: alloca %S2* ; CHECK: ret %S2* null @@ -549,7 +549,7 @@ entry: } define i32 @test11() { -; CHECK: @test11 +; CHECK-LABEL: @test11( ; CHECK-NOT: alloca ; CHECK: ret i32 0 @@ -574,7 +574,7 @@ define i8 @test12() { ; We fully promote these to the i24 load or store size, resulting in just masks ; and other operations that instcombine will fold, but no alloca. ; -; CHECK: @test12 +; CHECK-LABEL: @test12( entry: %a = alloca [3 x i8] @@ -630,7 +630,7 @@ entry: define i32 @test13() { ; Ensure we don't crash and handle undefined loads that straddle the end of the ; allocation. -; CHECK: @test13 +; CHECK-LABEL: @test13( ; CHECK: %[[value:.*]] = zext i8 0 to i16 ; CHECK-NEXT: %[[ret:.*]] = zext i16 %[[value]] to i32 ; CHECK-NEXT: ret i32 %[[ret]] @@ -657,7 +657,7 @@ define void @test14(...) nounwind uwtable { ; also gain enough data to prove they must be dead allocas due to GEPs that walk ; across two adjacent allocas. Test that we don't try to promote or otherwise ; do bad things to these dead allocas, they should just be removed. -; CHECK: @test14 +; CHECK-LABEL: @test14( ; CHECK-NEXT: entry: ; CHECK-NEXT: ret void @@ -688,7 +688,7 @@ define i32 @test15(i1 %flag) nounwind uwtable { ; Ensure that when there are dead instructions using an alloca that are not ; loads or stores we still delete them during partitioning and rewriting. ; Otherwise we'll go to promote them while thy still have unpromotable uses. -; CHECK: @test15 +; CHECK-LABEL: @test15( ; CHECK-NEXT: entry: ; CHECK-NEXT: br label %loop ; CHECK: loop: @@ -731,7 +731,7 @@ loop: define void @test16(i8* %src, i8* %dst) { ; Ensure that we can promote an alloca of [3 x i8] to an i24 SSA value. -; CHECK: @test16 +; CHECK-LABEL: @test16( ; CHECK-NOT: alloca ; CHECK: %[[srccast:.*]] = bitcast i8* %src to i24* ; CHECK-NEXT: load i24* %[[srccast]] @@ -752,7 +752,7 @@ entry: define void @test17(i8* %src, i8* %dst) { ; Ensure that we can rewrite unpromotable memcpys which extend past the end of ; the alloca. -; CHECK: @test17 +; CHECK-LABEL: @test17( ; CHECK: %[[a:.*]] = alloca [3 x i8] ; CHECK-NEXT: %[[ptr:.*]] = getelementptr [3 x i8]* %[[a]], i32 0, i32 0 ; CHECK-NEXT: call void @llvm.memcpy.p0i8.p0i8.i32(i8* %[[ptr]], i8* %src, @@ -771,7 +771,7 @@ define void @test18(i8* %src, i8* %dst, i32 %size) { ; Preserve transfer instrinsics with a variable size, even if they overlap with ; fixed size operations. Further, continue to split and promote allocas preceding ; the variable sized intrinsic. -; CHECK: @test18 +; CHECK-LABEL: @test18( ; CHECK: %[[a:.*]] = alloca [34 x i8] ; CHECK: %[[srcgep1:.*]] = getelementptr inbounds i8* %src, i64 4 ; CHECK-NEXT: %[[srccast1:.*]] = bitcast i8* %[[srcgep1]] to i32* @@ -810,7 +810,7 @@ define i32 @test19(%opaque* %x) { ; pointers in such a way that we try to GEP through the opaque type. Previously, ; a check for an unsized type was missing and this crashed. Ensure it behaves ; reasonably now. -; CHECK: @test19 +; CHECK-LABEL: @test19( ; CHECK-NOT: alloca ; CHECK: ret i32 undef @@ -827,7 +827,7 @@ entry: define i32 @test20() { ; Ensure we can track negative offsets (before the beginning of the alloca) and ; negative relative offsets from offsets starting past the end of the alloca. -; CHECK: @test20 +; CHECK-LABEL: @test20( ; CHECK-NOT: alloca ; CHECK: %[[sum1:.*]] = add i32 1, 2 ; CHECK: %[[sum2:.*]] = add i32 %[[sum1]], 3 @@ -858,7 +858,7 @@ define i8 @test21() { ; Test allocations and offsets which border on overflow of the int64_t used ; internally. This is really awkward to really test as LLVM doesn't really ; support such extreme constructs cleanly. -; CHECK: @test21 +; CHECK-LABEL: @test21( ; CHECK-NOT: alloca ; CHECK: or i8 -1, -1 @@ -926,7 +926,7 @@ define void @PR13990() { ; Ensure we can handle cases where processing one alloca causes the other ; alloca to become dead and get deleted. This might crash or fail under ; Valgrind if we regress. -; CHECK: @PR13990 +; CHECK-LABEL: @PR13990( ; CHECK-NOT: alloca ; CHECK: unreachable ; CHECK: unreachable @@ -955,7 +955,7 @@ define double @PR13969(double %x) { ; Check that we detect when promotion will un-escape an alloca and iterate to ; re-try running SROA over that alloca. Without that, the two allocas that are ; stored into a dead alloca don't get rewritten and promoted. -; CHECK: @PR13969 +; CHECK-LABEL: @PR13969( entry: %a = alloca double @@ -982,7 +982,7 @@ define void @PR14034() { ; This test case tries to form GEPs into the empty leading struct members, and ; subsequently crashed (under valgrind) before we fixed the PR. The important ; thing is to handle empty structs gracefully. -; CHECK: @PR14034 +; CHECK-LABEL: @PR14034( entry: %a = alloca %PR14034.struct @@ -998,7 +998,7 @@ entry: define i32 @test22(i32 %x) { ; Test that SROA and promotion is not confused by a grab bax mixture of pointer ; types involving wrapper aggregates and zero-length aggregate members. -; CHECK: @test22 +; CHECK-LABEL: @test22( entry: %a1 = alloca { { [1 x { i32 }] } } @@ -1134,7 +1134,7 @@ define void @PR14105({ [16 x i8] }* %ptr) { ; Ensure that when rewriting the GEP index '-1' for this alloca we preserve is ; sign as negative. We use a volatile memcpy to ensure promotion never actually ; occurs. -; CHECK: @PR14105 +; CHECK-LABEL: @PR14105( entry: %a = alloca { [16 x i8] }, align 8 @@ -1153,7 +1153,7 @@ entry: define void @PR14465() { ; Ensure that we don't crash when analyzing a alloca larger than the maximum ; integer type width (MAX_INT_BITS) supported by llvm (1048576*32 > (1<<23)-1). -; CHECK: @PR14465 +; CHECK-LABEL: @PR14465( %stack = alloca [1048576 x i32], align 16 ; CHECK: alloca [1048576 x i32] @@ -1170,7 +1170,7 @@ define void @PR14548(i1 %x) { ; iteratively. ; Note that we don't do a particularly good *job* of handling these mixtures, ; but the hope is that this is very rare. -; CHECK: @PR14548 +; CHECK-LABEL: @PR14548( entry: %a = alloca <{ i1 }>, align 8 @@ -1232,7 +1232,7 @@ entry: define i32 @PR14601(i32 %x) { ; Don't try to form a promotable integer alloca when there is a variable length ; memory intrinsic. -; CHECK: @PR14601 +; CHECK-LABEL: @PR14601( entry: %a = alloca i32 @@ -1250,7 +1250,7 @@ define void @PR15674(i8* %data, i8* %src, i32 %size) { ; beginning of the array. Ensure that the final integer store, despite being ; convertable to the integer type that we end up promoting this alloca toward, ; doesn't get widened to a full alloca store. -; CHECK: @PR15674 +; CHECK-LABEL: @PR15674( entry: %tmp = alloca [4 x i8], align 1 @@ -1307,7 +1307,7 @@ end: } define void @PR15805(i1 %a, i1 %b) { -; CHECK: @PR15805 +; CHECK-LABEL: @PR15805( ; CHECK: select i1 undef, i64* %c, i64* %c ; CHECK: ret void diff --git a/test/Transforms/SROA/big-endian.ll b/test/Transforms/SROA/big-endian.ll index 64a0cc74397..9e87a9f073c 100644 --- a/test/Transforms/SROA/big-endian.ll +++ b/test/Transforms/SROA/big-endian.ll @@ -9,7 +9,7 @@ define i8 @test1() { ; the same as test12 in basictest.ll, but here we assert big-endian byte ; ordering. ; -; CHECK: @test1 +; CHECK-LABEL: @test1( entry: %a = alloca [3 x i8] @@ -66,7 +66,7 @@ define i64 @test2() { ; Test for various mixed sizes of integer loads and stores all getting ; promoted. ; -; CHECK: @test2 +; CHECK-LABEL: @test2( entry: %a = alloca [7 x i8] diff --git a/test/Transforms/SROA/fca.ll b/test/Transforms/SROA/fca.ll index c30a5cc974f..e8b4c6c13c8 100644 --- a/test/Transforms/SROA/fca.ll +++ b/test/Transforms/SROA/fca.ll @@ -3,7 +3,7 @@ target datalayout = "e-p:64:64:64-i1:8:8-i8:8:8-i16:16:16-i32:32:32-i64:32:64-f32:32:32-f64:64:64-v64:64:64-v128:128:128-a0:0:64-n8:16:32:64" define { i32, i32 } @test0(i32 %x, i32 %y) { -; CHECK: @test0 +; CHECK-LABEL: @test0( ; CHECK-NOT: alloca ; CHECK: insertvalue { i32, i32 } ; CHECK: insertvalue { i32, i32 } @@ -27,7 +27,7 @@ define { i32, i32 } @test1(i32 %x, i32 %y) { ; FIXME: This may be too conservative. Duncan argues that we are allowed to ; split the volatile load and store here but must produce volatile scalar loads ; and stores from them. -; CHECK: @test1 +; CHECK-LABEL: @test1( ; CHECK: alloca ; CHECK: alloca ; CHECK: load volatile { i32, i32 }* diff --git a/test/Transforms/SROA/phi-and-select.ll b/test/Transforms/SROA/phi-and-select.ll index b9931800e7f..86375780b63 100644 --- a/test/Transforms/SROA/phi-and-select.ll +++ b/test/Transforms/SROA/phi-and-select.ll @@ -2,7 +2,7 @@ target datalayout = "e-p:64:64:64-i1:8:8-i8:8:8-i16:16:16-i32:32:32-i64:32:64-f32:32:32-f64:64:64-v64:64:64-v128:128:128-a0:0:64-n8:16:32:64" define i32 @test1() { -; CHECK: @test1 +; CHECK-LABEL: @test1( entry: %a = alloca [2 x i32] ; CHECK-NOT: alloca @@ -31,7 +31,7 @@ exit: } define i32 @test2() { -; CHECK: @test2 +; CHECK-LABEL: @test2( entry: %a = alloca [2 x i32] ; CHECK-NOT: alloca @@ -54,7 +54,7 @@ entry: } define i32 @test3(i32 %x) { -; CHECK: @test3 +; CHECK-LABEL: @test3( entry: %a = alloca [2 x i32] ; CHECK-NOT: alloca @@ -105,7 +105,7 @@ exit: } define i32 @test4() { -; CHECK: @test4 +; CHECK-LABEL: @test4( entry: %a = alloca [2 x i32] ; CHECK-NOT: alloca @@ -129,7 +129,7 @@ entry: } define i32 @test5(i32* %b) { -; CHECK: @test5 +; CHECK-LABEL: @test5( entry: %a = alloca [2 x i32] ; CHECK-NOT: alloca @@ -151,7 +151,7 @@ entry: declare void @f(i32*, i32*) define i32 @test6(i32* %b) { -; CHECK: @test6 +; CHECK-LABEL: @test6( entry: %a = alloca [2 x i32] %c = alloca i32 @@ -182,7 +182,7 @@ entry: } define i32 @test7() { -; CHECK: @test7 +; CHECK-LABEL: @test7( ; CHECK-NOT: alloca entry: @@ -210,7 +210,7 @@ exit: define i32 @test8(i32 %b, i32* %ptr) { ; Ensure that we rewrite allocas to the used type when that use is hidden by ; a PHI that can be speculated. -; CHECK: @test8 +; CHECK-LABEL: @test8( ; CHECK-NOT: alloca ; CHECK-NOT: load ; CHECK: %[[value:.*]] = load i32* %ptr @@ -238,7 +238,7 @@ exit: define i32 @test9(i32 %b, i32* %ptr) { ; Same as @test8 but for a select rather than a PHI node. -; CHECK: @test9 +; CHECK-LABEL: @test9( ; CHECK-NOT: alloca ; CHECK-NOT: load ; CHECK: %[[value:.*]] = load i32* %ptr @@ -260,7 +260,7 @@ define float @test10(i32 %b, float* %ptr) { ; Don't try to promote allocas which are not elligible for it even after ; rewriting due to the necessity of inserting bitcasts when speculating a PHI ; node. -; CHECK: @test10 +; CHECK-LABEL: @test10( ; CHECK: %[[alloca:.*]] = alloca ; CHECK: %[[argvalue:.*]] = load float* %ptr ; CHECK: %[[cast:.*]] = bitcast double* %[[alloca]] to float* @@ -289,7 +289,7 @@ exit: define float @test11(i32 %b, float* %ptr) { ; Same as @test10 but for a select rather than a PHI node. -; CHECK: @test11 +; CHECK-LABEL: @test11( ; CHECK: %[[alloca:.*]] = alloca ; CHECK: %[[cast:.*]] = bitcast double* %[[alloca]] to float* ; CHECK: %[[allocavalue:.*]] = load float* %[[cast]] @@ -311,7 +311,7 @@ entry: define i32 @test12(i32 %x, i32* %p) { ; Ensure we don't crash or fail to nuke dead selects of allocas if no load is ; never found. -; CHECK: @test12 +; CHECK-LABEL: @test12( ; CHECK-NOT: alloca ; CHECK-NOT: select ; CHECK: ret i32 %x @@ -327,7 +327,7 @@ entry: define i32 @test13(i32 %x, i32* %p) { ; Ensure we don't crash or fail to nuke dead phis of allocas if no load is ever ; found. -; CHECK: @test13 +; CHECK-LABEL: @test13( ; CHECK-NOT: alloca ; CHECK-NOT: phi ; CHECK: ret i32 %x @@ -349,7 +349,7 @@ exit: define i32 @PR13905() { ; Check a pattern where we have a chain of dead phi nodes to ensure they are ; deleted and promotion can proceed. -; CHECK: @PR13905 +; CHECK-LABEL: @PR13905( ; CHECK-NOT: alloca i32 ; CHECK: ret i32 undef @@ -374,7 +374,7 @@ define i32 @PR13906() { ; Another pattern which can lead to crashes due to failing to clear out dead ; PHI nodes or select nodes. This triggers subtly differently from the above ; cases because the PHI node is (recursively) alive, but the select is dead. -; CHECK: @PR13906 +; CHECK-LABEL: @PR13906( ; CHECK-NOT: alloca entry: @@ -392,7 +392,7 @@ if.then: } define i64 @PR14132(i1 %flag) { -; CHECK: @PR14132 +; CHECK-LABEL: @PR14132( ; Here we form a PHI-node by promoting the pointer alloca first, and then in ; order to promote the other two allocas, we speculate the load of the ; now-phi-node-pointer. In doing so we end up loading a 64-bit value from an i8 diff --git a/test/Transforms/SROA/vector-promotion.ll b/test/Transforms/SROA/vector-promotion.ll index 3336515770a..4f084214d39 100644 --- a/test/Transforms/SROA/vector-promotion.ll +++ b/test/Transforms/SROA/vector-promotion.ll @@ -4,7 +4,7 @@ target datalayout = "e-p:64:64:64-i1:8:8-i8:8:8-i16:16:16-i32:32:32-i64:32:64-f3 %S1 = type { i64, [42 x float] } define i32 @test1(<4 x i32> %x, <4 x i32> %y) { -; CHECK: @test1 +; CHECK-LABEL: @test1( entry: %a = alloca [2 x <4 x i32>] ; CHECK-NOT: alloca @@ -35,7 +35,7 @@ entry: } define i32 @test2(<4 x i32> %x, <4 x i32> %y) { -; CHECK: @test2 +; CHECK-LABEL: @test2( entry: %a = alloca [2 x <4 x i32>] ; CHECK-NOT: alloca @@ -69,7 +69,7 @@ entry: } define i32 @test3(<4 x i32> %x, <4 x i32> %y) { -; CHECK: @test3 +; CHECK-LABEL: @test3( entry: %a = alloca [2 x <4 x i32>] ; CHECK-NOT: alloca @@ -107,7 +107,7 @@ entry: } define i32 @test4(<4 x i32> %x, <4 x i32> %y, <4 x i32>* %z) { -; CHECK: @test4 +; CHECK-LABEL: @test4( entry: %a = alloca [2 x <4 x i32>] ; CHECK-NOT: alloca @@ -151,7 +151,7 @@ entry: } define i32 @test5(<4 x i32> %x, <4 x i32> %y, <4 x i32>* %z) { -; CHECK: @test5 +; CHECK-LABEL: @test5( ; The same as the above, but with reversed source and destination for the ; element memcpy, and a self copy. entry: @@ -199,7 +199,7 @@ declare void @llvm.memcpy.p0i8.p0i8.i32(i8* nocapture, i8* nocapture, i32, i32, declare void @llvm.memset.p0i8.i32(i8* nocapture, i8, i32, i32, i1) nounwind define i64 @test6(<4 x i64> %x, <4 x i64> %y, i64 %n) { -; CHECK: @test6 +; CHECK-LABEL: @test6( ; The old scalarrepl pass would wrongly drop the store to the second alloca. ; PR13254 %tmp = alloca { <4 x i64>, <4 x i64> } @@ -215,7 +215,7 @@ define i64 @test6(<4 x i64> %x, <4 x i64> %y, i64 %n) { } define <4 x i32> @test_subvec_store() { -; CHECK: @test_subvec_store +; CHECK-LABEL: @test_subvec_store( entry: %a = alloca <4 x i32> ; CHECK-NOT: alloca @@ -247,7 +247,7 @@ entry: } define <4 x i32> @test_subvec_load() { -; CHECK: @test_subvec_load +; CHECK-LABEL: @test_subvec_load( entry: %a = alloca <4 x i32> ; CHECK-NOT: alloca @@ -282,7 +282,7 @@ entry: declare void @llvm.memset.p0i32.i32(i32* nocapture, i32, i32, i32, i1) nounwind define <4 x float> @test_subvec_memset() { -; CHECK: @test_subvec_memset +; CHECK-LABEL: @test_subvec_memset( entry: %a = alloca <4 x float> ; CHECK-NOT: alloca @@ -315,7 +315,7 @@ entry: } define <4 x float> @test_subvec_memcpy(i8* %x, i8* %y, i8* %z, i8* %f, i8* %out) { -; CHECK: @test_subvec_memcpy +; CHECK-LABEL: @test_subvec_memcpy( entry: %a = alloca <4 x float> ; CHECK-NOT: alloca @@ -363,7 +363,7 @@ entry: } define i32 @PR14212() { -; CHECK: @PR14212 +; CHECK-LABEL: @PR14212( ; This caused a crash when "splitting" the load of the i32 in order to promote ; the store of <3 x i8> properly. Heavily reduced from an OpenCL test case. entry: diff --git a/test/Transforms/ScalarRepl/2009-12-11-NeonTypes.ll b/test/Transforms/ScalarRepl/2009-12-11-NeonTypes.ll index 1993e4f526d..1f921914fcb 100644 --- a/test/Transforms/ScalarRepl/2009-12-11-NeonTypes.ll +++ b/test/Transforms/ScalarRepl/2009-12-11-NeonTypes.ll @@ -10,7 +10,7 @@ target triple = "thumbv7-apple-darwin10" %union..0anon = type { %struct.int16x8x2_t } define void @test(<8 x i16> %tmp.0, %struct.int16x8x2_t* %dst) nounwind { -; CHECK: @test +; CHECK-LABEL: @test( ; CHECK-NOT: alloca ; CHECK: "alloca point" ; CHECK: store <8 x i16> @@ -82,7 +82,7 @@ cond.true: ; preds = %entry cond.false: ; preds = %entry ret void -; CHECK: @test_memcpy_self +; CHECK-LABEL: @test_memcpy_self( ; CHECK-NOT: alloca ; CHECK: br i1 } diff --git a/test/Transforms/ScalarRepl/2010-01-18-SelfCopy.ll b/test/Transforms/ScalarRepl/2010-01-18-SelfCopy.ll index 52df6d5c596..b926b021caf 100644 --- a/test/Transforms/ScalarRepl/2010-01-18-SelfCopy.ll +++ b/test/Transforms/ScalarRepl/2010-01-18-SelfCopy.ll @@ -6,7 +6,7 @@ target datalayout = "e-p:32:32:32-i1:8:8-i8:8:8-i16:16:16-i32:32:32-i64:32:64-f3 %struct.test = type { [3 x double] } define void @test_memcpy_self() nounwind { -; CHECK: @test_memcpy_self +; CHECK-LABEL: @test_memcpy_self( ; CHECK-NOT: alloca ; CHECK: ret void %1 = alloca %struct.test diff --git a/test/Transforms/ScalarRepl/2011-10-22-VectorCrash.ll b/test/Transforms/ScalarRepl/2011-10-22-VectorCrash.ll index cd21ff5f0b5..e4456361a66 100644 --- a/test/Transforms/ScalarRepl/2011-10-22-VectorCrash.ll +++ b/test/Transforms/ScalarRepl/2011-10-22-VectorCrash.ll @@ -4,7 +4,7 @@ target triple = "thumbv7-apple-ios5.0.0" %union.anon = type { <4 x float> } -; CHECK: @test +; CHECK-LABEL: @test( ; CHECK-NOT: alloca define void @test() nounwind { diff --git a/test/Transforms/ScalarRepl/badarray.ll b/test/Transforms/ScalarRepl/badarray.ll index 768fec63062..480e12b8d44 100644 --- a/test/Transforms/ScalarRepl/badarray.ll +++ b/test/Transforms/ScalarRepl/badarray.ll @@ -7,7 +7,7 @@ target triple = "i386-pc-linux-gnu" ; PR3466 ; Off end of array, don't transform. define i32 @test1() { -; CHECK: @test1 +; CHECK-LABEL: @test1( ; CHECK-NOT: = alloca %X = alloca [4 x i32] %Y = getelementptr [4 x i32]* %X, i64 0, i64 6 ; [#uses=2] @@ -20,7 +20,7 @@ define i32 @test1() { ; Off end of array, don't transform. define i32 @test2() nounwind { entry: -; CHECK: @test2 +; CHECK-LABEL: @test2( ; CHECK-NOT: = alloca %yx2.i = alloca float, align 4 ; [#uses=1] %yx26.i = bitcast float* %yx2.i to i64* ; [#uses=1] @@ -34,7 +34,7 @@ entry: ; PR5436 define void @test3() { entry: -; CHECK: @test3 +; CHECK-LABEL: @test3( ; CHECK-NOT: = alloca ; CHECK: store i64 %var_1 = alloca %padded, align 8 ; <%padded*> [#uses=3] diff --git a/test/Transforms/ScalarRepl/basictest.ll b/test/Transforms/ScalarRepl/basictest.ll index 9676873c30c..af3c237d491 100644 --- a/test/Transforms/ScalarRepl/basictest.ll +++ b/test/Transforms/ScalarRepl/basictest.ll @@ -7,7 +7,7 @@ define i32 @test1() { store i32 0, i32* %Y %Z = load i32* %Y ; [#uses=1] ret i32 %Z -; CHECK: @test1 +; CHECK-LABEL: @test1( ; CHECK-NOT: alloca ; CHECK: ret i32 0 } @@ -23,7 +23,7 @@ define i64 @test2(i64 %X) { L2: %Z = load i64* %B ; [#uses=1] ret i64 %Z -; CHECK: @test2 +; CHECK-LABEL: @test2( ; CHECK-NOT: alloca ; CHECK: ret i64 %X } diff --git a/test/Transforms/ScalarRepl/lifetime.ll b/test/Transforms/ScalarRepl/lifetime.ll index 3f558a1c373..47cb8549822 100644 --- a/test/Transforms/ScalarRepl/lifetime.ll +++ b/test/Transforms/ScalarRepl/lifetime.ll @@ -9,7 +9,7 @@ declare void @llvm.lifetime.end(i64, i8*) %t1 = type {i32, i32, i32} define void @test1() { -; CHECK: @test1 +; CHECK-LABEL: @test1( %A = alloca %t1 %A1 = getelementptr %t1* %A, i32 0, i32 0 %A2 = getelementptr %t1* %A, i32 0, i32 1 @@ -22,7 +22,7 @@ define void @test1() { } define void @test2() { -; CHECK: @test2 +; CHECK-LABEL: @test2( %A = alloca %t1 %A1 = getelementptr %t1* %A, i32 0, i32 0 %A2 = getelementptr %t1* %A, i32 0, i32 1 @@ -36,7 +36,7 @@ define void @test2() { } define void @test3() { -; CHECK: @test3 +; CHECK-LABEL: @test3( %A = alloca %t1 %A1 = getelementptr %t1* %A, i32 0, i32 0 %A2 = getelementptr %t1* %A, i32 0, i32 1 @@ -50,7 +50,7 @@ define void @test3() { } define void @test4() { -; CHECK: @test4 +; CHECK-LABEL: @test4( %A = alloca %t1 %A1 = getelementptr %t1* %A, i32 0, i32 0 %A2 = getelementptr %t1* %A, i32 0, i32 1 @@ -66,7 +66,7 @@ define void @test4() { %t2 = type {i32, [4 x i8], i32} define void @test5() { -; CHECK: @test5 +; CHECK-LABEL: @test5( %A = alloca %t2 ; CHECK: alloca{{.*}}i8 ; CHECK: alloca{{.*}}i8 @@ -97,7 +97,7 @@ define void @test5() { %t3 = type {[4 x i16], [4 x i8]} define void @test6() { -; CHECK: @test6 +; CHECK-LABEL: @test6( %A = alloca %t3 ; CHECK: alloca i8 ; CHECK: alloca i8 diff --git a/test/Transforms/ScalarRepl/nonzero-first-index.ll b/test/Transforms/ScalarRepl/nonzero-first-index.ll index 60f414b7175..b2e93feb6cc 100644 --- a/test/Transforms/ScalarRepl/nonzero-first-index.ll +++ b/test/Transforms/ScalarRepl/nonzero-first-index.ll @@ -8,7 +8,7 @@ target triple = "i386-pc-linux-gnu" ; Check that a GEP with a non-zero first index does not prevent SROA as long ; as the resulting offset corresponds to an element in the alloca. define i32 @test1() { -; CHECK: @test1 +; CHECK-LABEL: @test1( ; CHECK-NOT: = i160 ; CHECK: ret i32 undef %A = alloca %nested @@ -20,7 +20,7 @@ define i32 @test1() { ; But, if the offset is out of range, then it should not be transformed. define i32 @test2() { -; CHECK: @test2 +; CHECK-LABEL: @test2( ; CHECK: i160 %A = alloca %nested %B = getelementptr %nested* %A, i32 0, i32 1, i32 0 @@ -31,7 +31,7 @@ define i32 @test2() { ; Try it with a bitcast and single GEP.... define i32 @test3() { -; CHECK: @test3 +; CHECK-LABEL: @test3( ; CHECK-NOT: = i160 ; CHECK: ret i32 undef %A = alloca %nested @@ -43,7 +43,7 @@ define i32 @test3() { ; ...and again make sure that out-of-range accesses are not transformed. define i32 @test4() { -; CHECK: @test4 +; CHECK-LABEL: @test4( ; CHECK: i160 %A = alloca %nested %B = bitcast %nested* %A to i32* diff --git a/test/Transforms/ScalarRepl/only-memcpy-uses.ll b/test/Transforms/ScalarRepl/only-memcpy-uses.ll index cfb88bd80d6..935c2895520 100644 --- a/test/Transforms/ScalarRepl/only-memcpy-uses.ll +++ b/test/Transforms/ScalarRepl/only-memcpy-uses.ll @@ -4,7 +4,7 @@ target triple = "x86_64-apple-darwin10.0.0" %struct.S = type { [12 x i32] } -; CHECK: @bar4 +; CHECK-LABEL: @bar4( define void @bar4(%struct.S* byval %s) nounwind ssp { entry: ; CHECK: alloca diff --git a/test/Transforms/ScalarRepl/phi-select.ll b/test/Transforms/ScalarRepl/phi-select.ll index 5c21c3bd9f3..a5da2dcf49d 100644 --- a/test/Transforms/ScalarRepl/phi-select.ll +++ b/test/Transforms/ScalarRepl/phi-select.ll @@ -6,7 +6,7 @@ target triple = "x86_64-apple-darwin10.2" %struct.X = type { i32 } %PairTy = type {i32, i32} -; CHECK: @test1 +; CHECK-LABEL: @test1( ; CHECK: %a.0 = alloca i32 ; CHECK: %b.0 = alloca i32 define i32 @test1(i32 %x) nounwind readnone ssp { @@ -24,7 +24,7 @@ entry: ret i32 %4 } -; CHECK: @test2 +; CHECK-LABEL: @test2( ; CHECK: %X.ld = phi i32 [ 1, %entry ], [ 2, %T ] ; CHECK-NEXT: ret i32 %X.ld define i32 @test2(i1 %c) { @@ -43,7 +43,7 @@ F: ret i32 %Q } -; CHECK: @test3 +; CHECK-LABEL: @test3( ; CHECK-NEXT: %Q = select i1 %c, i32 1, i32 2 ; CHECK-NEXT: ret i32 %Q ; rdar://8904039 @@ -63,7 +63,7 @@ define i32 @test3(i1 %c) { define i64 @test4(i1 %c) { entry: %A = alloca %PairTy - ; CHECK: @test4 + ; CHECK-LABEL: @test4( ; CHECK: %A = alloca %PairTy %B = getelementptr %PairTy* %A, i32 0, i32 0 store i32 1, i32* %B @@ -94,7 +94,7 @@ entry: %r = load i32* %b, align 8 ret i32 %r -; CHECK: @test5 +; CHECK-LABEL: @test5( ; CHECK: store i32 123, i32* %P ; CHECK: ret i32 2 } @@ -107,7 +107,7 @@ define i32 @test6(i32 %x, i1 %c) nounwind readnone ssp { %p.0 = select i1 %c, i32* %b, i32* %a %r = load i32* %p.0, align 8 ret i32 %r -; CHECK: @test6 +; CHECK-LABEL: @test6( ; CHECK-NEXT: %r = select i1 %c, i32 2, i32 1 ; CHECK-NEXT: ret i32 %r } @@ -124,7 +124,7 @@ define i32 @test7(i32 %x, i1 %c) nounwind readnone ssp { %r = load i32* %p.0, align 8 ret i32 %r -; CHECK: @test7 +; CHECK-LABEL: @test7( ; CHECK-NOT: alloca i32 ; CHECK: %r = select i1 %c, i32 2, i32 0 ; CHECK: ret i32 %r @@ -132,7 +132,7 @@ define i32 @test7(i32 %x, i1 %c) nounwind readnone ssp { ;; Promote allocs that are PHI'd together by moving the loads. define i32 @test8(i32 %x) nounwind readnone ssp { -; CHECK: @test8 +; CHECK-LABEL: @test8( ; CHECK-NOT: load i32 ; CHECK-NOT: store i32 ; CHECK: %p.0.ld = phi i32 [ 2, %entry ], [ 1, %T ] diff --git a/test/Transforms/ScalarRepl/vector_promote.ll b/test/Transforms/ScalarRepl/vector_promote.ll index 03ef475c3ed..8ca1ed5005b 100644 --- a/test/Transforms/ScalarRepl/vector_promote.ll +++ b/test/Transforms/ScalarRepl/vector_promote.ll @@ -14,7 +14,7 @@ entry: %tmp6 = fadd <4 x float> %tmp4, %tmp4 ; <<4 x float>> [#uses=1] store <4 x float> %tmp6, <4 x float>* %F ret void -; CHECK: @test1 +; CHECK-LABEL: @test1( ; CHECK-NOT: alloca ; CHECK: %tmp = load <4 x float>* %F ; CHECK: fadd <4 x float> %tmp, %tmp @@ -33,7 +33,7 @@ entry: %tmp6 = fadd <4 x float> %tmp4, %tmp4 ; <<4 x float>> [#uses=1] store <4 x float> %tmp6, <4 x float>* %F ret void -; CHECK: @test2 +; CHECK-LABEL: @test2( ; CHECK-NOT: alloca ; CHECK: %tmp = load <4 x float>* %F ; CHECK: fadd <4 x float> %tmp, %tmp @@ -50,7 +50,7 @@ entry: %tmp.upgrd.4 = load float* %tmp.upgrd.3 ; [#uses=1] store float %tmp.upgrd.4, float* %f ret void -; CHECK: @test3 +; CHECK-LABEL: @test3( ; CHECK-NOT: alloca ; CHECK: %tmp = load <4 x float>* %F ; CHECK: fadd <4 x float> %tmp, %tmp @@ -67,7 +67,7 @@ entry: %tmp.upgrd.6 = load float* %G.upgrd.5 ; [#uses=1] store float %tmp.upgrd.6, float* %f ret void -; CHECK: @test4 +; CHECK-LABEL: @test4( ; CHECK-NOT: alloca ; CHECK: %tmp = load <4 x float>* %F ; CHECK: fadd <4 x float> %tmp, %tmp @@ -81,7 +81,7 @@ define i32 @test5(float %X) { ;; should turn into bitcast. %a = bitcast float* %X1 to i32* %tmp = load i32* %a ret i32 %tmp -; CHECK: @test5 +; CHECK-LABEL: @test5( ; CHECK-NEXT: bitcast float %X to i32 ; CHECK-NEXT: ret i32 } @@ -92,7 +92,7 @@ define i64 @test6(<2 x float> %X) { %P = bitcast <2 x float>* %X_addr to i64* %tmp = load i64* %P ret i64 %tmp -; CHECK: @test6 +; CHECK-LABEL: @test6( ; CHECK: bitcast <2 x float> %X to i64 ; CHECK: ret i64 } @@ -107,7 +107,7 @@ entry: %1 = getelementptr inbounds %struct.test7* %memtmp, i64 0, i32 0, i64 5 store i32 0, i32* %1, align 4 ret void -; CHECK: @test7 +; CHECK-LABEL: @test7( ; CHECK-NOT: alloca ; CHECK: and i192 } @@ -130,7 +130,7 @@ entry: store <1 x i64> %vshl_n, <1 x i64>* %tmp %4 = load <1 x i64>* %tmp ret <1 x i64> %4 -; CHECK: @test8 +; CHECK-LABEL: @test8( ; CHECK-NOT: alloca ; CHECK-NOT: insertelement ; CHECK: ret <1 x i64> diff --git a/test/Transforms/SimplifyCFG/2009-01-19-UnconditionalTrappingConstantExpr.ll b/test/Transforms/SimplifyCFG/2009-01-19-UnconditionalTrappingConstantExpr.ll index e2765e5f50e..740ea25f93a 100644 --- a/test/Transforms/SimplifyCFG/2009-01-19-UnconditionalTrappingConstantExpr.ll +++ b/test/Transforms/SimplifyCFG/2009-01-19-UnconditionalTrappingConstantExpr.ll @@ -4,7 +4,7 @@ @G = extern_weak global i32 -; CHECK: @test( +; CHECK-LABEL: @test( ; CHECK: br i1 %tmp25 ; CHECK: bb1: ; CHECK: sdiv @@ -23,7 +23,7 @@ bb6: ret i32 927 } -; CHECK: @test2( +; CHECK-LABEL: @test2( ; CHECK: br i1 %tmp34 ; CHECK: bb5: ; CHECK: sdiv diff --git a/test/Transforms/SimplifyCFG/SPARC/switch_to_lookup_table.ll b/test/Transforms/SimplifyCFG/SPARC/switch_to_lookup_table.ll index 9d1568557f3..bb48c80268a 100644 --- a/test/Transforms/SimplifyCFG/SPARC/switch_to_lookup_table.ll +++ b/test/Transforms/SimplifyCFG/SPARC/switch_to_lookup_table.ll @@ -26,7 +26,7 @@ return: %retval.0 = phi i32 [ 15, %sw.default ], [ 1, %sw.bb6 ], [ 62, %sw.bb5 ], [ 27, %sw.bb4 ], [ -1, %sw.bb3 ], [ 0, %sw.bb2 ], [ 123, %sw.bb1 ], [ 55, %entry ] ret i32 %retval.0 -; CHECK: @f +; CHECK-LABEL: @f( ; CHECK-NOT: getelementptr ; CHECK: switch i32 %c } diff --git a/test/Transforms/SimplifyCFG/SpeculativeExec.ll b/test/Transforms/SimplifyCFG/SpeculativeExec.ll index dd2e5d1c3a7..83fa4190003 100644 --- a/test/Transforms/SimplifyCFG/SpeculativeExec.ll +++ b/test/Transforms/SimplifyCFG/SpeculativeExec.ll @@ -4,7 +4,7 @@ target datalayout = "e-p:64:64:64-i1:8:8-i8:8:8-i16:16:16-i32:32:32-i64:64:64-f3 target triple = "x86_64-unknown-linux-gnu" define i32 @test1(i32 %a, i32 %b, i32 %c) nounwind { -; CHECK: @test1 +; CHECK-LABEL: @test1( entry: %tmp1 = icmp eq i32 %b, 0 br i1 %tmp1, label %bb1, label %bb3 @@ -31,7 +31,7 @@ bb3: ; preds = %bb2, %entry declare i8 @llvm.cttz.i8(i8, i1) define i8 @test2(i8 %a) { -; CHECK: @test2 +; CHECK-LABEL: @test2( br i1 undef, label %bb_true, label %bb_false bb_true: %b = tail call i8 @llvm.cttz.i8(i8 %a, i1 false) @@ -47,7 +47,7 @@ join: define i8* @test4(i1* %dummy, i8* %a, i8* %b) { ; Test that we don't speculate an arbitrarily large number of unfolded constant ; expressions. -; CHECK: @test4 +; CHECK-LABEL: @test4( entry: %cond1 = load volatile i1* %dummy diff --git a/test/Transforms/SimplifyCFG/UnreachableEliminate.ll b/test/Transforms/SimplifyCFG/UnreachableEliminate.ll index 4a692f3622e..e1635f49115 100644 --- a/test/Transforms/SimplifyCFG/UnreachableEliminate.ll +++ b/test/Transforms/SimplifyCFG/UnreachableEliminate.ll @@ -1,7 +1,7 @@ ; RUN: opt < %s -simplifycfg -S | FileCheck %s define void @test1(i1 %C, i1* %BP) { -; CHECK: @test1 +; CHECK-LABEL: @test1( ; CHECK: entry: ; CHECK-NEXT: ret void entry: @@ -14,7 +14,7 @@ F: } define void @test2() { -; CHECK: @test2 +; CHECK-LABEL: @test2( ; CHECK: entry: ; CHECK-NEXT: call void @test2() ; CHECK-NEXT: ret void @@ -28,7 +28,7 @@ N: } define i32 @test3(i32 %v) { -; CHECK: @test3 +; CHECK-LABEL: @test3( ; CHECK: entry: ; CHECK-NEXT: [[CMP:%[A-Za-z0-9]+]] = icmp eq i32 %v, 2 ; CHECK-NEXT: select i1 [[CMP]], i32 2, i32 1 diff --git a/test/Transforms/SimplifyCFG/X86/switch_to_lookup_table.ll b/test/Transforms/SimplifyCFG/X86/switch_to_lookup_table.ll index 5f70465c64d..8530448d000 100644 --- a/test/Transforms/SimplifyCFG/X86/switch_to_lookup_table.ll +++ b/test/Transforms/SimplifyCFG/X86/switch_to_lookup_table.ll @@ -52,7 +52,7 @@ return: %retval.0 = phi i32 [ 15, %sw.default ], [ 1, %sw.bb6 ], [ 62, %sw.bb5 ], [ 27, %sw.bb4 ], [ -1, %sw.bb3 ], [ 0, %sw.bb2 ], [ 123, %sw.bb1 ], [ 55, %entry ] ret i32 %retval.0 -; CHECK: @f +; CHECK-LABEL: @f( ; CHECK: entry: ; CHECK-NEXT: %switch.tableidx = sub i32 %c, 42 ; CHECK-NEXT: %0 = icmp ult i32 %switch.tableidx, 7 @@ -88,7 +88,7 @@ sw.epilog: call void @dummy(i8 signext %a.0, float %b.0) ret void -; CHECK: @h +; CHECK-LABEL: @h( ; CHECK: entry: ; CHECK-NEXT: %switch.tableidx = sub i32 %x, 0 ; CHECK-NEXT: %0 = icmp ult i32 %switch.tableidx, 4 @@ -138,7 +138,7 @@ return: [ getelementptr inbounds ([4 x i8]* @.str, i64 0, i64 0), %entry ] ret i8* %retval.0 -; CHECK: @foostring +; CHECK-LABEL: @foostring( ; CHECK: entry: ; CHECK-NEXT: %switch.tableidx = sub i32 %x, 0 ; CHECK-NEXT: %0 = icmp ult i32 %switch.tableidx, 4 @@ -171,7 +171,7 @@ sw.epilog: %b.0 = phi i32 [ 10, %sw.default ], [ 5, %sw.bb3 ], [ 1, %sw.bb2 ], [ 4, %sw.bb1 ], [ 3, %entry ] ret i32 %a.0 -; CHECK: @earlyreturncrash +; CHECK-LABEL: @earlyreturncrash( ; CHECK: switch.lookup: ; CHECK-NEXT: %switch.gep = getelementptr inbounds [4 x i32]* @switch.table3, i32 0, i32 %switch.tableidx ; CHECK-NEXT: %switch.load = load i32* %switch.gep @@ -221,7 +221,7 @@ lor.end: %lor.ext = zext i1 %0 to i32 ret i32 %lor.ext -; CHECK: @crud +; CHECK-LABEL: @crud( ; CHECK: entry: ; CHECK-NEXT: %cmp = icmp ult i8 %c, 33 ; CHECK-NEXT: br i1 %cmp, label %lor.end, label %switch.early.test @@ -744,7 +744,7 @@ return: %retval.0 = phi i32 [ 123, %sw.default ], [ %sext, %sw.bb3 ], [ %sub, %sw.bb2 ], [ 42, %sw.bb1 ], [ 5, %entry ] ret i32 %retval.0 -; CHECK: @cprop +; CHECK-LABEL: @cprop( ; CHECK: switch.lookup: ; CHECK: %switch.gep = getelementptr inbounds [7 x i32]* @switch.table5, i32 0, i32 %switch.tableidx } @@ -773,7 +773,7 @@ return: %retval.0 = phi i32 [ 1, %sw.bb3 ], [ -1, %sw.bb2 ], [ 0, %sw.bb ] ret i32 %retval.0 -; CHECK: @unreachable +; CHECK-LABEL: @unreachable( ; CHECK: switch.lookup: ; CHECK: getelementptr inbounds [5 x i32]* @switch.table6, i32 0, i32 %switch.tableidx } @@ -799,7 +799,7 @@ return: %retval.0 = phi i96 [ 15, %sw.default ], [ 27, %sw.bb4 ], [ -1, %sw.bb3 ], [ 0, %sw.bb2 ], [ 123, %sw.bb1 ], [ 55, %entry ] ret i96 %retval.0 -; CHECK: @illegaltype +; CHECK-LABEL: @illegaltype( ; CHECK-NOT: @switch.table ; CHECK: switch i32 %c } diff --git a/test/Transforms/SimplifyCFG/basictest.ll b/test/Transforms/SimplifyCFG/basictest.ll index 052e10667da..9c4edd68b80 100644 --- a/test/Transforms/SimplifyCFG/basictest.ll +++ b/test/Transforms/SimplifyCFG/basictest.ll @@ -5,14 +5,14 @@ define void @test1() { br label %1 ret void -; CHECK: @test1 +; CHECK-LABEL: @test1( ; CHECK-NEXT: ret void } define void @test2() { ret void ret void -; CHECK: @test2 +; CHECK-LABEL: @test2( ; CHECK-NEXT: ret void ; CHECK-NEXT: } } @@ -20,7 +20,7 @@ define void @test2() { define void @test3(i1 %T) { br i1 %T, label %1, label %1 ret void -; CHECK: @test3 +; CHECK-LABEL: @test3( ; CHECK-NEXT: ret void } @@ -38,6 +38,6 @@ define void @test5(i32 %A) { return: ; preds = %entry ret void -; CHECK: @test5 +; CHECK-LABEL: @test5( ; CHECK-NEXT: ret void } diff --git a/test/Transforms/SimplifyCFG/dce-cond-after-folding-terminator.ll b/test/Transforms/SimplifyCFG/dce-cond-after-folding-terminator.ll index 3996efd82b5..036a615e7ff 100644 --- a/test/Transforms/SimplifyCFG/dce-cond-after-folding-terminator.ll +++ b/test/Transforms/SimplifyCFG/dce-cond-after-folding-terminator.ll @@ -2,7 +2,7 @@ define void @test_br(i32 %x) { entry: -; CHECK: @test_br +; CHECK-LABEL: @test_br( ; CHECK-NEXT: entry: ; CHECK-NEXT: ret void %cmp = icmp eq i32 %x, 10 @@ -17,7 +17,7 @@ if.end: ; preds = %if.else, %if.then define void @test_switch(i32 %x) nounwind { entry: -; CHECK: @test_switch +; CHECK-LABEL: @test_switch( ; CHECK-NEXT: entry: ; CHECK-NEXT: ret void %rem = srem i32 %x, 3 @@ -35,7 +35,7 @@ sw.epilog: ; preds = %sw.bb define void @test_indirectbr(i32 %x) { entry: -; CHECK: @test_indirectbr +; CHECK-LABEL: @test_indirectbr( ; CHECK-NEXT: entry: ; Ideally this should now check: ; CHK-NEXT: ret void diff --git a/test/Transforms/SimplifyCFG/indirectbr.ll b/test/Transforms/SimplifyCFG/indirectbr.ll index 7853e9abd2e..d0020d001b0 100644 --- a/test/Transforms/SimplifyCFG/indirectbr.ll +++ b/test/Transforms/SimplifyCFG/indirectbr.ll @@ -77,7 +77,7 @@ BB0: ; SimplifyCFG should turn the indirectbr into a conditional branch on the ; condition of the select. -; CHECK: @indbrtest3 +; CHECK-LABEL: @indbrtest3( ; CHECK-NEXT: entry: ; CHECK-NEXT: br i1 %cond, label %L1, label %L2 ; CHECK-NOT: indirectbr @@ -104,7 +104,7 @@ L3: ; As in @indbrtest1, it should really remove the branch entirely, but it doesn't ; because it's in the entry block. -; CHECK: @indbrtest4 +; CHECK-LABEL: @indbrtest4( ; CHECK-NEXT: entry: ; CHECK-NEXT: br label %L1 define void @indbrtest4(i1 %cond) nounwind { @@ -126,7 +126,7 @@ L3: ; SimplifyCFG should turn the indirectbr into an unreachable because neither ; destination is listed as a successor. -; CHECK: @indbrtest5 +; CHECK-LABEL: @indbrtest5( ; CHECK-NEXT: entry: ; CHECK-NEXT: unreachable ; CHECK-NEXT: } @@ -156,7 +156,7 @@ L4: ; The same as above, except the selected addresses are equal. -; CHECK: @indbrtest6 +; CHECK-LABEL: @indbrtest6( ; CHECK-NEXT: entry: ; CHECK-NEXT: unreachable ; CHECK-NEXT: } diff --git a/test/Transforms/SimplifyCFG/invoke.ll b/test/Transforms/SimplifyCFG/invoke.ll index 10dc41b44bc..5f513ac3e6d 100644 --- a/test/Transforms/SimplifyCFG/invoke.ll +++ b/test/Transforms/SimplifyCFG/invoke.ll @@ -9,7 +9,7 @@ declare i32 @nounwind_fn() nounwind declare i32 @fn() -; CHECK: @f1 +; CHECK-LABEL: @f1( define i8* @f1() nounwind uwtable ssp { entry: ; CHECK: call void @llvm.trap() @@ -28,7 +28,7 @@ lpad: unreachable } -; CHECK: @f2 +; CHECK-LABEL: @f2( define i8* @f2() nounwind uwtable ssp { entry: ; CHECK: call void @llvm.trap() @@ -47,7 +47,7 @@ lpad: unreachable } -; CHECK: @f3 +; CHECK-LABEL: @f3( define i32 @f3() nounwind uwtable ssp { ; CHECK-NEXT: entry entry: @@ -66,7 +66,7 @@ lpad: unreachable } -; CHECK: @f4 +; CHECK-LABEL: @f4( define i32 @f4() nounwind uwtable ssp { ; CHECK-NEXT: entry entry: @@ -86,7 +86,7 @@ lpad: unreachable } -; CHECK: @f5 +; CHECK-LABEL: @f5( define i32 @f5(i1 %cond, i8* %a, i8* %b) { entry: br i1 %cond, label %x, label %y @@ -117,7 +117,7 @@ lpad: unreachable } -; CHECK: @f6 +; CHECK-LABEL: @f6( define void @f6() { entry: invoke void @purefn() diff --git a/test/Transforms/SimplifyCFG/invoke_unwind.ll b/test/Transforms/SimplifyCFG/invoke_unwind.ll index ed7ff8287f2..435bed0c295 100644 --- a/test/Transforms/SimplifyCFG/invoke_unwind.ll +++ b/test/Transforms/SimplifyCFG/invoke_unwind.ll @@ -5,7 +5,7 @@ declare void @bar() ; This testcase checks to see if the simplifycfg pass is converting invoke ; instructions to call instructions if the handler just rethrows the exception. define i32 @test1() { -; CHECK: @test1 +; CHECK-LABEL: @test1( ; CHECK-NEXT: call void @bar() ; CHECK-NEXT: ret i32 0 invoke void @bar( ) diff --git a/test/Transforms/SimplifyCFG/phi-undef-loadstore.ll b/test/Transforms/SimplifyCFG/phi-undef-loadstore.ll index 028fb074563..f34aec525df 100644 --- a/test/Transforms/SimplifyCFG/phi-undef-loadstore.ll +++ b/test/Transforms/SimplifyCFG/phi-undef-loadstore.ll @@ -24,7 +24,7 @@ if.end7: ; preds = %if.else, %if.then4, %tmp9 = load i32* %x.0 ret i32 %tmp9 -; CHECK: @test1 +; CHECK-LABEL: @test1( ; CHECK: if.else: ; CHECK: br label %if.end7 @@ -52,7 +52,7 @@ if.end7: ; preds = %if.else, %if.then4, %x.0 = phi i32* [ %a, %if.then ], [ null, %if.then4 ], [ null, %if.else ] %tmp9 = load i32* %x.0 ret i32 %tmp9 -; CHECK: @test2 +; CHECK-LABEL: @test2( ; CHECK: if.else: ; CHECK: unreachable @@ -81,7 +81,7 @@ if.end7: ; preds = %if.else, %if.then4, tail call void @bar() nounwind %tmp9 = load i32* %x.0 ret i32 %tmp9 -; CHECK: @test3 +; CHECK-LABEL: @test3( ; CHECK: if.end7: ; CHECK: phi i32* [ %a, %if.then ], [ null, %if.then4 ], [ null, %if.else ] } @@ -110,6 +110,6 @@ if.end7: ; preds = %if.else, %if.then4, %tmp10 = or i32 %tmp9, 1 store i32 %tmp10, i32* %gep ret i32 %tmp9 -; CHECK: @test4 +; CHECK-LABEL: @test4( ; CHECK-NOT: phi } diff --git a/test/Transforms/SimplifyCFG/preserve-branchweights.ll b/test/Transforms/SimplifyCFG/preserve-branchweights.ll index beef5270082..4022ed6927e 100644 --- a/test/Transforms/SimplifyCFG/preserve-branchweights.ll +++ b/test/Transforms/SimplifyCFG/preserve-branchweights.ll @@ -3,7 +3,7 @@ declare void @helper(i32) define void @test1(i1 %a, i1 %b) { -; CHECK: @test1 +; CHECK-LABEL: @test1( entry: br i1 %a, label %Y, label %X, !prof !0 ; CHECK: br i1 %or.cond, label %Z, label %Y, !prof !0 @@ -22,7 +22,7 @@ Z: } define void @test2(i1 %a, i1 %b) { -; CHECK: @test2 +; CHECK-LABEL: @test2( entry: br i1 %a, label %X, label %Y, !prof !1 ; CHECK: br i1 %or.cond, label %Z, label %Y, !prof !1 @@ -42,7 +42,7 @@ Z: } define void @test3(i1 %a, i1 %b) { -; CHECK: @test3 +; CHECK-LABEL: @test3( ; CHECK-NOT: !prof entry: br i1 %a, label %X, label %Y, !prof !1 @@ -61,7 +61,7 @@ Z: } define void @test4(i1 %a, i1 %b) { -; CHECK: @test4 +; CHECK-LABEL: @test4( ; CHECK-NOT: !prof entry: br i1 %a, label %X, label %Y @@ -156,7 +156,7 @@ sw.epilog: ;; This test is based on test1 but swapped the targets of the second branch. define void @test1_swap(i1 %a, i1 %b) { -; CHECK: @test1_swap +; CHECK-LABEL: @test1_swap( entry: br i1 %a, label %Y, label %X, !prof !0 ; CHECK: br i1 %or.cond, label %Y, label %Z, !prof !4 @@ -175,7 +175,7 @@ Z: } define void @test7(i1 %a, i1 %b) { -; CHECK: @test7 +; CHECK-LABEL: @test7( entry: %c = or i1 %b, false br i1 %a, label %Y, label %X, !prof !0 @@ -195,7 +195,7 @@ Z: ; Test basic folding to a conditional branch. define void @test8(i64 %x, i64 %y) nounwind { -; CHECK: @test8 +; CHECK-LABEL: @test8( entry: %lt = icmp slt i64 %x, %y ; CHECK: br i1 %lt, label %a, label %b, !prof !6 @@ -219,7 +219,7 @@ bees: ; Test edge splitting when the default target has icmp and unconditinal ; branch define i1 @test9(i32 %x, i32 %y) nounwind { -; CHECK: @test9 +; CHECK-LABEL: @test9( entry: switch i32 %x, label %bees [ i32 0, label %a diff --git a/test/Transforms/SimplifyCFG/select-gep.ll b/test/Transforms/SimplifyCFG/select-gep.ll index 3e2a6237b27..96c214cbc81 100644 --- a/test/Transforms/SimplifyCFG/select-gep.ll +++ b/test/Transforms/SimplifyCFG/select-gep.ll @@ -14,7 +14,7 @@ if.end: %x.addr = phi i8* [ %incdec.ptr, %if.then ], [ %x, %entry ] ret i8* %x.addr -; CHECK: @test1 +; CHECK-LABEL: @test1( ; CHECK-NOT: select ; CHECK: ret i8* %x.addr } @@ -34,7 +34,7 @@ if.end: %x.addr = phi i8* [ %incdec.ptr, %if.then ], [ %y, %entry ] ret i8* %x.addr -; CHECK: @test2 +; CHECK-LABEL: @test2( ; CHECK: %incdec.ptr.y = select i1 %cmp, i8* %incdec.ptr, i8* %y ; CHECK: ret i8* %incdec.ptr.y } diff --git a/test/Transforms/SimplifyCFG/speculate-store.ll b/test/Transforms/SimplifyCFG/speculate-store.ll index 8d7fe79dcd4..e241901a878 100644 --- a/test/Transforms/SimplifyCFG/speculate-store.ll +++ b/test/Transforms/SimplifyCFG/speculate-store.ll @@ -17,7 +17,7 @@ entry: ; Make sure we speculate stores like the following one. It is cheap compared to ; a mispredicated branch. -; CHECK: @ifconvertstore +; CHECK-LABEL: @ifconvertstore( ; CHECK: %add5.add = select i1 %cmp6, i32 %add5, i32 %add ; CHECK: store i32 %add5.add, i32* %arrayidx2, align 4 if.then: @@ -43,7 +43,7 @@ entry: %cmp6 = icmp sgt i32 %add5, %C br i1 %cmp6, label %if.then, label %ret.end -; CHECK: @noifconvertstore1 +; CHECK-LABEL: @noifconvertstore1( ; CHECK-NOT: select if.then: store i32 %add5, i32* %arrayidx2, align 4 @@ -71,7 +71,7 @@ entry: %cmp6 = icmp sgt i32 %add5, %C br i1 %cmp6, label %if.then, label %ret.end -; CHECK: @noifconvertstore2 +; CHECK-LABEL: @noifconvertstore2( ; CHECK-NOT: select if.then: store i32 %add5, i32* %arrayidx2, align 4 @@ -97,7 +97,7 @@ entry: br i1 %cmp6, label %if.then, label %ret.end ; Make sure we don't speculate volatile stores. -; CHECK: @noifconvertstore_volatile +; CHECK-LABEL: @noifconvertstore_volatile( ; CHECK-NOT: select if.then: store volatile i32 %add5, i32* %arrayidx2, align 4 diff --git a/test/Transforms/SimplifyCFG/speculate-with-offset.ll b/test/Transforms/SimplifyCFG/speculate-with-offset.ll index a737d5602e8..64fed85c795 100644 --- a/test/Transforms/SimplifyCFG/speculate-with-offset.ll +++ b/test/Transforms/SimplifyCFG/speculate-with-offset.ll @@ -3,7 +3,7 @@ ; This load is safe to speculate, as it's from a safe offset ; within an alloca. -; CHECK: @yes +; CHECK-LABEL: @yes( ; CHECK-NOT: br define void @yes(i1 %c) nounwind { @@ -25,7 +25,7 @@ return: ; preds = %if.end, %if.then ret void } -; CHECK: @no0 +; CHECK-LABEL: @no0( ; CHECK: br i1 %c define void @no0(i1 %c) nounwind { @@ -47,7 +47,7 @@ return: ; preds = %if.end, %if.then ret void } -; CHECK: @no1 +; CHECK-LABEL: @no1( ; CHECK: br i1 %c define void @no1(i1 %c, i64 %n) nounwind { @@ -69,7 +69,7 @@ return: ; preds = %if.end, %if.then ret void } -; CHECK: @no2 +; CHECK-LABEL: @no2( ; CHECK: br i1 %c define void @no2(i1 %c, i64 %n) nounwind { diff --git a/test/Transforms/SimplifyCFG/switch-masked-bits.ll b/test/Transforms/SimplifyCFG/switch-masked-bits.ll index 3b0c48be6e2..692973c362b 100644 --- a/test/Transforms/SimplifyCFG/switch-masked-bits.ll +++ b/test/Transforms/SimplifyCFG/switch-masked-bits.ll @@ -13,7 +13,7 @@ b: ret i32 3 c: ret i32 5 -; CHECK: @test1 +; CHECK-LABEL: @test1( ; CHECK: %cond = icmp eq i32 %i, 24 ; CHECK: %. = select i1 %cond, i32 5, i32 0 ; CHECK: ret i32 %. @@ -33,6 +33,6 @@ b: ret i32 3 c: ret i32 5 -; CHECK: @test2 +; CHECK-LABEL: @test2( ; CHECK: ret i32 0 } diff --git a/test/Transforms/SimplifyCFG/switch-on-const-select.ll b/test/Transforms/SimplifyCFG/switch-on-const-select.ll index 9cd709ff8ec..dec5f80ab98 100644 --- a/test/Transforms/SimplifyCFG/switch-on-const-select.ll +++ b/test/Transforms/SimplifyCFG/switch-on-const-select.ll @@ -2,7 +2,7 @@ ; Test basic folding to a conditional branch. define i32 @foo(i64 %x, i64 %y) nounwind { -; CHECK: @foo +; CHECK-LABEL: @foo( entry: %eq = icmp eq i64 %x, %y br i1 %eq, label %b, label %switch @@ -32,7 +32,7 @@ bees: ; Test basic folding to an unconditional branch. define i32 @bar(i64 %x, i64 %y) nounwind { -; CHECK: @bar +; CHECK-LABEL: @bar( entry: ; CHECK-NEXT: entry: ; CHECK-NEXT: tail call void @bees.a() [[NUW:#[0-9]+]] @@ -58,7 +58,7 @@ bees: ; Test the edge case where both values from the select are the default case. define void @bazz(i64 %x, i64 %y) nounwind { -; CHECK: @bazz +; CHECK-LABEL: @bazz( entry: ; CHECK-NEXT: entry: ; CHECK-NEXT: tail call void @bees.b() [[NUW]] @@ -83,7 +83,7 @@ bees: ; Test the edge case where both values from the select are equal. define void @quux(i64 %x, i64 %y) nounwind { -; CHECK: @quux +; CHECK-LABEL: @quux( entry: ; CHECK-NEXT: entry: ; CHECK-NEXT: tail call void @bees.a() [[NUW]] @@ -108,7 +108,7 @@ bees: ; A final test, for phi node munging. define i32 @xyzzy(i64 %x, i64 %y) { -; CHECK: @xyzzy +; CHECK-LABEL: @xyzzy( entry: %eq = icmp eq i64 %x, %y br i1 %eq, label %r, label %cont diff --git a/test/Transforms/SimplifyCFG/switch-to-icmp.ll b/test/Transforms/SimplifyCFG/switch-to-icmp.ll index e9a6db45cb0..bfacf25ca7f 100644 --- a/test/Transforms/SimplifyCFG/switch-to-icmp.ll +++ b/test/Transforms/SimplifyCFG/switch-to-icmp.ll @@ -15,7 +15,7 @@ lor.end: %0 = phi i1 [ true, %entry ], [ false, %lor.rhs ], [ true, %entry ], [ true, %entry ] ret i1 %0 -; CHECK: @test1 +; CHECK-LABEL: @test1( ; CHECK: %x.off = add i32 %x, -1 ; CHECK: %switch = icmp ult i32 %x.off, 3 } @@ -34,7 +34,7 @@ lor.end: %0 = phi i1 [ true, %entry ], [ false, %lor.rhs ], [ true, %entry ] ret i1 %0 -; CHECK: @test2 +; CHECK-LABEL: @test2( ; CHECK: %switch = icmp ult i32 %x, 2 } @@ -51,7 +51,7 @@ good: bad: ret i32 1 -; CHECK: @test3 +; CHECK-LABEL: @test3( ; CHECK: entry: ; CHECK-NEXT: ret i32 0 } diff --git a/test/Transforms/SimplifyCFG/switch_create.ll b/test/Transforms/SimplifyCFG/switch_create.ll index 9d4e31961f4..5500ba2cf7c 100644 --- a/test/Transforms/SimplifyCFG/switch_create.ll +++ b/test/Transforms/SimplifyCFG/switch_create.ll @@ -15,7 +15,7 @@ T: ; preds = %0 F: ; preds = %0 call void @foo2( ) ret void -; CHECK: @test1 +; CHECK-LABEL: @test1( ; CHECK: switch i32 %V, label %F [ ; CHECK: i32 17, label %T ; CHECK: i32 4, label %T @@ -33,7 +33,7 @@ T: ; preds = %0 F: ; preds = %0 call void @foo2( ) ret void -; CHECK: @test2 +; CHECK-LABEL: @test2( ; CHECK: switch i32 %V, label %T [ ; CHECK: i32 17, label %F ; CHECK: i32 4, label %F @@ -53,7 +53,7 @@ F: ; preds = %N call void @foo2( ) ret void -; CHECK: @test3 +; CHECK-LABEL: @test3( ; CHECK: switch i32 %V, label %F [ ; CHECK: i32 4, label %T ; CHECK: i32 17, label %T @@ -80,7 +80,7 @@ lor.end: ; preds = %lor.rhs, %lor.lhs.f %lor.ext = zext i1 %0 to i32 ret i32 %lor.ext -; CHECK: @test4 +; CHECK-LABEL: @test4( ; CHECK: switch i8 %c, label %lor.rhs [ ; CHECK: i8 62, label %lor.end ; CHECK: i8 34, label %lor.end @@ -104,7 +104,7 @@ lor.end: ; preds = %entry, %entry, %ent %0 = phi i1 [ true, %entry ], [ %V, %lor.rhs ], [ true, %entry ], [ true, %entry ] %lor.ext = zext i1 %0 to i32 ret i32 %lor.ext -; CHECK: @test5 +; CHECK-LABEL: @test5( ; CHECK: switch i8 %c, label %lor.rhs [ ; CHECK: i8 62, label %lor.end ; CHECK: i8 34, label %lor.end @@ -140,7 +140,7 @@ UnifiedReturnBlock: ; preds = %shortcirc_done.4, %shortcirc_next.4 %UnifiedRetVal = phi i1 [ %tmp.26, %shortcirc_next.4 ], [ true, %shortcirc_done.4 ] ; [#uses=1] ret i1 %UnifiedRetVal -; CHECK: @test6 +; CHECK-LABEL: @test6( ; CHECK: %tmp.2.i.off = add i32 %tmp.2.i, -14 ; CHECK: %switch = icmp ult i32 %tmp.2.i.off, 6 } @@ -161,7 +161,7 @@ if.then: ; preds = %entry if.end: ; preds = %entry ret void -; CHECK: @test7 +; CHECK-LABEL: @test7( ; CHECK: %cmp = icmp ult i32 %x, 32 ; CHECK: br i1 %cmp, label %if.then, label %switch.early.test ; CHECK: switch.early.test: @@ -190,7 +190,7 @@ if.then: ; preds = %entry if.end: ; preds = %entry ret i32 0 -; CHECK: @test8 +; CHECK-LABEL: @test8( ; CHECK: switch.early.test: ; CHECK: switch i8 %c, label %if.end [ ; CHECK: i8 99, label %if.then @@ -246,7 +246,7 @@ lor.end: ; preds = %lor.rhs, %lor.lhs.f %conv46 = zext i1 %0 to i32 ret i32 %conv46 -; CHECK: @test9 +; CHECK-LABEL: @test9( ; CHECK: %cmp = icmp ult i8 %c, 33 ; CHECK: br i1 %cmp, label %lor.end, label %switch.early.test @@ -275,7 +275,7 @@ T: F: ret i32 324 -; CHECK: @test10 +; CHECK-LABEL: @test10( ; CHECK: br i1 %Cond, label %switch.early.test, label %F ; CHECK:switch.early.test: ; CHECK: switch i32 %mode, label %T [ @@ -314,7 +314,7 @@ return: ; preds = %if.end, %if.then %retval.0 = phi i32 [ 1, %if.then ], [ 0, %if.end ] ret i32 %retval.0 -; CHECK: @test11 +; CHECK-LABEL: @test11( ; CHECK: switch i32 %bar, label %if.end [ ; CHECK: i32 55, label %return ; CHECK: i32 53, label %return @@ -343,7 +343,7 @@ bb55.us.us: malformed: ret void -; CHECK: @test12 +; CHECK-LABEL: @test12( } @@ -371,7 +371,7 @@ if.then: ; preds = %lor.lhs.false9, %lo if.end: ; preds = %if.then, %lor.lhs.false9 ret void -; CHECK: @test13 +; CHECK-LABEL: @test13( ; CHECK: switch i32 %x, label %if.end [ ; CHECK: i32 6, label %if.then ; CHECK: i32 4, label %if.then @@ -405,7 +405,7 @@ if.then: ; preds = %lor.lhs.false9, %lo if.end: ; preds = %if.then, %lor.lhs.false9 ret void -; CHECK: @test14 +; CHECK-LABEL: @test14( ; CHECK: switch i32 %x, label %if.end [ ; CHECK: i32 6, label %if.then ; CHECK: i32 4, label %if.then @@ -431,7 +431,7 @@ if.then: if.end: ret void -; CHECK: @test15 +; CHECK-LABEL: @test15( ; CHECK-NOT: switch ; CHECK: ret void } @@ -440,7 +440,7 @@ if.end: ; rdar://5134905 define zeroext i1 @test16(i32 %x) nounwind { entry: -; CHECK: @test16 +; CHECK-LABEL: @test16( ; CHECK: %x.off = add i32 %x, -1 ; CHECK: %switch = icmp ult i32 %x.off, 3 %cmp.i = icmp eq i32 %x, 1 @@ -473,7 +473,7 @@ lor.lhs.false8: return: ret void -; CHECK: @test17 +; CHECK-LABEL: @test17( ; CHECK-NOT: switch.early.test ; CHECK-NOT: switch i32 ; CHECK: ret void @@ -511,7 +511,7 @@ bb19: ; preds = %bb8, %bb bb20: ; preds = %bb19, %bb8 ret void -; CHECK: @test18 +; CHECK-LABEL: @test18( ; CHECK: %arg.off = add i32 %arg, -8 ; CHECK: icmp ult i32 %arg.off, 11 } diff --git a/test/Transforms/SimplifyCFG/trapping-load-unreachable.ll b/test/Transforms/SimplifyCFG/trapping-load-unreachable.ll index 10d6981af0e..e9d93e834a5 100644 --- a/test/Transforms/SimplifyCFG/trapping-load-unreachable.ll +++ b/test/Transforms/SimplifyCFG/trapping-load-unreachable.ll @@ -17,7 +17,7 @@ bb: ; preds = %entry br label %return return: ; preds = %entry ret void -; CHECK: @test1 +; CHECK-LABEL: @test1( ; CHECK: load volatile } @@ -27,7 +27,7 @@ entry: store i32 4,i32* null ret void -; CHECK: @test2 +; CHECK-LABEL: @test2( ; CHECK: call void @llvm.trap ; CHECK: unreachable } @@ -38,14 +38,14 @@ entry: store volatile i32 4, i32* null ret void -; CHECK: @test3 +; CHECK-LABEL: @test3( ; CHECK: store volatile i32 4, i32* null ; CHECK: ret } ; Check store before unreachable. define void @test4(i1 %C, i32* %P) { -; CHECK: @test4 +; CHECK-LABEL: @test4( ; CHECK: entry: ; CHECK-NEXT: br i1 %C entry: @@ -59,7 +59,7 @@ F: ; Check cmpxchg before unreachable. define void @test5(i1 %C, i32* %P) { -; CHECK: @test5 +; CHECK-LABEL: @test5( ; CHECK: entry: ; CHECK-NEXT: br i1 %C entry: @@ -73,7 +73,7 @@ F: ; Check atomicrmw before unreachable. define void @test6(i1 %C, i32* %P) { -; CHECK: @test6 +; CHECK-LABEL: @test6( ; CHECK: entry: ; CHECK-NEXT: br i1 %C entry: diff --git a/test/Transforms/SimplifyCFG/volatile-phioper.ll b/test/Transforms/SimplifyCFG/volatile-phioper.ll index 164898897ef..398b3532ea3 100644 --- a/test/Transforms/SimplifyCFG/volatile-phioper.ll +++ b/test/Transforms/SimplifyCFG/volatile-phioper.ll @@ -7,7 +7,7 @@ ; it can no longer use language standard as an excuse. The compiler ; needs to expose the volatile access to the platform. ; -; CHECK: @test +; CHECK-LABEL: @test( ; CHECK: entry: ; CHECK: @Trace ; CHECK: while.body: diff --git a/test/Transforms/Sink/basic.ll b/test/Transforms/Sink/basic.ll index 1d0b6b529d5..85ab3766002 100644 --- a/test/Transforms/Sink/basic.ll +++ b/test/Transforms/Sink/basic.ll @@ -6,7 +6,7 @@ ; Sink should sink the load past the store (which doesn't overlap) into ; the block that uses it. -; CHECK: @foo +; CHECK-LABEL: @foo( ; CHECK: true: ; CHECK-NEXT: %l = load i32* @A ; CHECK-NEXT: ret i32 %l @@ -23,7 +23,7 @@ false: ; But don't sink load volatiles... -; CHECK: @foo2 +; CHECK-LABEL: @foo2( ; CHECK: load volatile ; CHECK-NEXT: store i32 @@ -39,7 +39,7 @@ false: ; Sink to the nearest post-dominator -; CHECK: @diamond +; CHECK-LABEL: @diamond( ; CHECK: X: ; CHECK-NEXT: phi ; CHECK-NEXT: mul nsw diff --git a/test/Transforms/TailCallElim/accum_recursion.ll b/test/Transforms/TailCallElim/accum_recursion.ll index 9475f87e8f5..8911b6d3616 100644 --- a/test/Transforms/TailCallElim/accum_recursion.ll +++ b/test/Transforms/TailCallElim/accum_recursion.ll @@ -41,7 +41,7 @@ return: ; preds = %entry define i64 @test3_fib(i64 %n) nounwind readnone { -; CHECK: @test3_fib +; CHECK-LABEL: @test3_fib( entry: ; CHECK: tailrecurse: ; CHECK: %accumulator.tr = phi i64 [ %n, %entry ], [ %3, %bb1 ] diff --git a/test/Transforms/TailCallElim/basic.ll b/test/Transforms/TailCallElim/basic.ll index ffb757005c2..35420ab08c3 100644 --- a/test/Transforms/TailCallElim/basic.ll +++ b/test/Transforms/TailCallElim/basic.ll @@ -98,7 +98,7 @@ cond_false: ; ; rdar://14324281. define void @test6(i32* %a, i32* %b) { -; CHECK: @test6 +; CHECK-LABEL: @test6( ; CHECK-NOT: tail call ; CHECK: ret void %c = alloca [100 x i8], align 16 @@ -112,7 +112,7 @@ define void @test6(i32* %a, i32* %b) { ; rdar://14324281 define void @test7(i32* %a, i32* %b) nounwind uwtable { entry: -; CHECK: @test7 +; CHECK-LABEL: @test7( ; CHECK-NOT: tail call ; CHECK: ret void %c = alloca [100 x i8], align 16