instead of lying and saying we have it.

llvm-svn: 25775

llvm-svn: 25774

llvm-svn: 25773

custom expansion of ConstantFP nodes.

llvm-svn: 25772

'fpimm' in .td files is now TargetConstantFP.

llvm-svn: 25771

why all this code isn't autogenerated. :(

llvm-svn: 25770

targets to register custom legalizers for ConstantFP in case there isn't a
fixed list of constants that can be generated.  On some architectures (ia64?)
all fp immediates are legal.

llvm-svn: 25769

llvm-svn: 25768

llvm-svn: 25767

llvm-svn: 25766

llvm-svn: 25765

llvm-svn: 25764

    if (N1.getOpcode() == ISD::LOAD &&
        N1.hasOneUse() &&
        !CodeGenMap.count(N1.getValue(0)) &&
        !CodeGenMap.count(N1.getValue(1))) {

instead of this:

    if (N1.getOpcode() == ISD::LOAD) {
      if (N1.hasOneUse()) {
        if (!CodeGenMap.count(N1.getValue(0))) {
          if (!CodeGenMap.count(N1.getValue(1))) {

llvm-svn: 25763

GCC not jump-threading across this common code, and produces far nicer
output.

llvm-svn: 25762

llvm-svn: 25761

llvm-svn: 25760

llvm-svn: 25759

llvm-svn: 25758

"if" statements (indenting it appropriately, of course) instead of using goto's.

This inverts the logic for all of the if statements, which makes things simpler
to understand in addition to making the generated code easier to read.

llvm-svn: 25757

directly to the output file.  This makes things simple because the code doesn't
have to worry about indentation or the case when there is no goto.  It also
allows us to indent the code better without touching everything :)

llvm-svn: 25756

llvm-svn: 25755

llvm-svn: 25754

are not skewed out of view.

llvm-svn: 25753

llvm-svn: 25752

llvm-svn: 25751

llvm-svn: 25750

llvm-svn: 25749

llvm-svn: 25748

llvm-svn: 25747

faster.  This cuts about 120 lines of code out of the legalizer (mostly code
checking to see if operands have changed).

It also fixes an ugly performance issue, where the legalizer cloned the entire
graph after any change.  Now the "UpdateNodeOperands" method gives it a chance
to reuse nodes if the operands of a node change but not its opcode or valuetypes.

This speeds up instruction selection time on kimwitu++ by about 8.2% with a
release build.

llvm-svn: 25746

llvm-svn: 25745

llvm-svn: 25744

llvm-svn: 25743

llvm-svn: 25742

llvm-svn: 25741

llvm-svn: 25740

llvm-svn: 25739

llvm-svn: 25738

llvm-svn: 25737

1. Pull out the expand cases for BSWAP and CT* into a separate function,
   reducing the size of LegalizeOp.
2. Fix a bug where expand(bswap i64) was wrong when i64 is legal.
3. Changed LegalizeOp/PromoteOp so that the legalizer never needs to be
   iterative.  It now operates in a single pass over the nodes.
4. Simplify a LOT of code, with a net reduction of ~280 lines.

llvm-svn: 25736