From e5f163a3b98a531c3ff35da0e97e7364c0e04b95 Mon Sep 17 00:00:00 2001 From: Nadav Rotem Date: Sun, 30 Sep 2012 06:24:14 +0000 Subject: A DAGCombine optimization for merging consecutive stores. This optimization is not profitable in many cases because moden processos can store multiple values in parallel, and preparing the consecutive store requires some work. We only handle these cases: 1. Consecutive stores where the values and consecutive loads. For example: int a = p->a; int b = p->b; q->a = a; q->b = b; 2. Consecutive stores where the values are constants. Foe example: q->a = 4; q->b = 5; git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@164910 91177308-0d34-0410-b5e6-96231b3b80d8 --- test/CodeGen/X86/loop-strength-reduce.ll | 5 ++--- 1 file changed, 2 insertions(+), 3 deletions(-) (limited to 'test/CodeGen/X86/loop-strength-reduce.ll') diff --git a/test/CodeGen/X86/loop-strength-reduce.ll b/test/CodeGen/X86/loop-strength-reduce.ll index 42c6ac4983..d197451eee 100644 --- a/test/CodeGen/X86/loop-strength-reduce.ll +++ b/test/CodeGen/X86/loop-strength-reduce.ll @@ -1,8 +1,7 @@ -; RUN: llc < %s -march=x86 -relocation-model=static | FileCheck %s +; RUN: llc < %s -march=x86 -mcpu=corei7 -relocation-model=static | FileCheck %s ; CHECK: align -; CHECK: movl $4, -4(%ecx) -; CHECK: movl $5, (%ecx) +; CHECK: movlpd %xmm0, -4(%ecx) ; CHECK: addl $4, %ecx ; CHECK: decl %eax ; CHECK: jne -- cgit v1.2.3