52 lines · plain
1; RUN: llc -regalloc=greedy -mtriple=x86_64-unknown-linux-gnu < %s -o - | FileCheck %s2;3; The test is to check no redundent mov as follows will be generated in %while.body loop.4; .LBB0_2:5; movsbl %cl, %ecx6; movl %edx, %eax ==> This movl can be promoted outside of loop.7; shll $5, %eax8; ...9; movl %eax, %edx10; jne .LBB0_211;12; CHECK-LABEL: foo:13; CHECK: [[L0:.LBB0_[0-9]+]]: # %while.body14; CHECK: movl %[[REGA:.*]], %[[REGB:.*]]15; CHECK-NOT: movl %[[REGB]], %[[REGA]]16; CHECK: jne [[L0]]17;18target datalayout = "e-m:e-i64:64-f80:128-n8:16:32:64-S128"19 20@b = common local_unnamed_addr global ptr null, align 821@a = common local_unnamed_addr global i32 0, align 422 23define i32 @foo() local_unnamed_addr {24entry:25 %t0 = load ptr, ptr @b, align 826 %t1 = load i8, ptr %t0, align 127 %cmp4 = icmp eq i8 %t1, 028 %t2 = load i32, ptr @a, align 429 br i1 %cmp4, label %while.end, label %while.body.preheader30 31while.body.preheader: ; preds = %entry32 br label %while.body33 34while.body: ; preds = %while.body.preheader, %while.body35 %t3 = phi i32 [ %add3, %while.body ], [ %t2, %while.body.preheader ]36 %t4 = phi i8 [ %t5, %while.body ], [ %t1, %while.body.preheader ]37 %conv = sext i8 %t4 to i3238 %add = mul i32 %t3, 3339 %add3 = add nsw i32 %add, %conv40 store i32 %add3, ptr @a, align 441 %t5 = load i8, ptr %t0, align 142 %cmp = icmp eq i8 %t5, 043 br i1 %cmp, label %while.end.loopexit, label %while.body44 45while.end.loopexit: ; preds = %while.body46 br label %while.end47 48while.end: ; preds = %while.end.loopexit, %entry49 %.lcssa = phi i32 [ %t2, %entry ], [ %add3, %while.end.loopexit ]50 ret i32 %.lcssa51}52