llvm-svn: 26191

can provide work for the outer loop to canonicalize.

This fixes a case that breaks unswitching.

llvm-svn: 26189

llvm-svn: 26188

block in the appropriate loop nest.

Third time is the charm, right?

llvm-svn: 26187

llvm-svn: 26186

emit it (instead of .space), saving a bit of space in the .o file.

For example:
int foo[100];
int bar[100] = {};

when compiled with C++ or -fno-common results in shrinkage from 1160 to 360
bytes of space.  The X86 backend can also do this on darwin.

llvm-svn: 26185

llvm-svn: 26184

llvm-svn: 26183

XMM registers were not being handled.

llvm-svn: 26182

llvm-svn: 26181

llvm-svn: 26180

llvm-svn: 26179

llvm-svn: 26178

llvm-svn: 26177

llvm-svn: 26176

llvm-svn: 26175

llvm-svn: 26174

llvm-svn: 26173

maxStoresPerMemMove. Although the last one is not used.

llvm-svn: 26172

target specific theshold, e.g. 16 for x86.

llvm-svn: 26171

llvm-svn: 26169

llvm-svn: 26164

llvm-svn: 26162

llvm-svn: 26157

create these nodes with flag results.  Remember that we legalized them.

llvm-svn: 26156

llvm-svn: 26155

for a sign extension.

This fixes InstCombine/2006-02-13-DemandedMiscompile.ll and Ptrdist/bc.

llvm-svn: 26152

llvm-svn: 26150

name' issue.

llvm-svn: 26149

llvm-svn: 26148

llvm-svn: 26145

following handy-dandy properties:

1. it is always correct now
2. it is much faster than before
3. it is easier to understand

This implementation builds off of the recent simplifications of the
legalizer that made it single-pass instead of iterative.

This fixes JM/lencod, JM/ldecod, and
CodeGen/Generic/2006-02-12-InsertLibcall.ll (at least on PPC).

llvm-svn: 26144

CALLSEQ_START nodes.

llvm-svn: 26143

llvm-svn: 26142

of the input.  This fixes the mediabench/gsm/toast failure last night.

llvm-svn: 26138

PowerPC/and-imm.ll

llvm-svn: 26136

llvm-svn: 26135

llvm-svn: 26134

1. Teach GetConstantInType to handle boolean constants.
2. Teach instcombine to fold (compare X, CST) when X has known 0/1 bits.
   Testcase here: set.ll:test22
3. Improve the "(X >> c1) & C2 == 0" folding code to allow a noop cast
   between the shift and and.  More aggressive bitfolding for other reasons
   was turning signed shr's into unsigned shr's, leaving the noop cast in
   the way.

llvm-svn: 26131

llvm-svn: 26128