llvm-svn: 23246

llvm-svn: 23245

generate the fun in-register fp<->long instructions.

llvm-svn: 23244

I have run so far when run before Legalize.  It still needs to pick up the
SetCC folds, and nodes that use SetCC.

llvm-svn: 23243

llvm-svn: 23242

llvm-svn: 23241

llvm-svn: 23240

llvm-svn: 23239

llvm-svn: 23238

llvm-svn: 23237

llvm-svn: 23236

llvm-svn: 23235

switch should never be exited, so its bottom is now unreachable.

llvm-svn: 23234

Define the PatFrag class which can be used to define subpatterns to match
things with.  Define 'not', and use it to define the patterns for andc,
nand, etc.

llvm-svn: 23233

llvm-svn: 23232

values, and then we should be able to hook it up.

llvm-svn: 23231

currently don't do anything.  This elides patterns for binary operators
that ping on the carry flag, since we don't model it yet.

This patch also removes PPC::SUB, because it is dead.

llvm-svn: 23230

llvm-svn: 23229

i64 values on targets that need that expanded to 32-bit registers.  This fixes
PowerPC/2005-09-02-LegalizeDuplicatesCalls.ll and speeds up 189.lucas from
taking 122.72s to 81.96s on my desktop.

llvm-svn: 23228

and a dead one.  This is a legalize bug

llvm-svn: 23227

llvm-svn: 23226

llvm-svn: 23224

llvm-svn: 23223

llvm-svn: 23222

from the binary ops map, even if they had multiple results.  This latent bug
caused a few failures with the dag isel last night.

To prevent stuff like this from happening in the future, add some really
strict checking to make sure that the CSE maps always match up with reality!

llvm-svn: 23221

llvm-svn: 23220

number of elements.

llvm-svn: 23219

Remove the -enable-gpopt option which is subsumed by feature flags.

llvm-svn: 23218

that the fsqrt feature works.

llvm-svn: 23217

llvm-svn: 23216

llvm-svn: 23215

in building maximal expressions before simplifying them.  In particular, i
cases like this:

X-(A+B+X)

the code would consider A+B+X to be a maximal expression (not understanding
that the single use '-' would be turned into a + later), simplify it (a noop)
then later get simplified again.

Each of these simplify steps is where the cost of reassociation comes from,
so this patch should speed up the already fast pass a bit.

Thanks to Dan for noticing this!

llvm-svn: 23214

to where we need it when converting -(A+B+C) -> -A + -B + -C.

llvm-svn: 23213

llvm-svn: 23212

Ops vector out of range

llvm-svn: 23211

llvm-svn: 23210

llvm-svn: 23209

llvm-svn: 23208

llvm-svn: 23207

llvm-svn: 23206