llvm-svn: 97543

Add count() and lookup() to ScopedHashTable. It might be useful to get information out of the hash table.

llvm-svn: 97542

llvm-svn: 97541

stuff now that we don't care about emulating the old broken 
behavior of the old isel.  This eliminates the 
'CheckChainCompatible' check (along with IsChainCompatible) which
did an incorrect and inefficient scan *up* the chain nodes which
happened as the pattern was being formed and does the validation
at the end in HandleMergeInputChains when it forms a structural 
pattern.  This scans "down" the graph, which means that it is
quickly bounded by nodes already selected.  This also handles
token factors that get "trapped" in the dag.

Removing the CheckChainCompatible nodes also shrinks the 
generated tables by about 6K for X86 (down to 83K).

There are two pieces remaining before I can nuke PreprocessRMW:
1. I xfailed a test because we're now producing worse code in a 
   case that has nothing to do with the change: it turns out that
   our use of MorphNodeTo will leave dead nodes in the graph
   which (depending on how the graph is walked) end up causing
   bogus uses of chains and blocking matches.  This is really 
   bad for other reasons, so I'll fix this in a follow-up patch.

2. CheckFoldableChainNode needs to be improved to handle the TF.

llvm-svn: 97539

Based on a patch by Micah Villmow for PR6438.

llvm-svn: 97538

emitted after the increment. Make sure the insert position
reflects this. This fixes PR6453.

llvm-svn: 97537

llvm-svn: 97536

Constructors and operators for anonymous aggregates does not names. Do not force empty AT_name attribute in such cases.

llvm-svn: 97533

respectively.

llvm-svn: 97531

better reflect its meaning, now that tail call optimizations
are done by default in some cases.

llvm-svn: 97530

llvm-svn: 97529

llvm-svn: 97527

a loop and is itself the only dependency).

llvm-svn: 97526

new helper function.

llvm-svn: 97525

old isel generated code.

llvm-svn: 97522

predecessors before returning.  Otherwise, if multiple predecessor edges need
splitting, we only get one of them per iteration.  This makes a small but
measurable compile time improvement with -enable-full-load-pre.

llvm-svn: 97521

llvm-svn: 97517

now that it is gone.

llvm-svn: 97516

llvm-svn: 97515

EmitMergeInputChainsMatcher node up into EmitResultCode.  This
doesn't have much of an effect on the generated code, the X86
table is exactly the same size.

llvm-svn: 97514

(set GPR, somecomplexpattern)

if somecomplexpattern doesn't declare what it can match.

llvm-svn: 97513

llvm-svn: 97512

(the most general) the others are dead.

llvm-svn: 97511

llvm-svn: 97510

ordered correctly.  Previously it would get in trouble when
two patterns were too similar and give them nondet ordering.
We force this by using the record ID order as a fallback.

The testsuite diff is due to alpha patterns being ordered
slightly differently, the change is a semantic noop afaict:

< 	lda $0,-100($16)
---
> 	subq $16,100,$0

llvm-svn: 97509

llvm-svn: 97508

Remove the optimize for code size limitation on r67917. Optimize 64-bit imul by constants into leas + shl regardless if optimizing for code size. The size saving from using imulq isn't worth it. Also, the lea and shl instructions may expose further optimization.

llvm-svn: 97507

llvm-svn: 97504

llvm-svn: 97502

problems.  rdar://7697850.

llvm-svn: 97500

Don't accidentally produce unspillable intervals for deeply nested loops.

llvm-svn: 97496

llvm-svn: 97493

llvm-svn: 97492

llvm-svn: 97491

llvm-svn: 97490

Delete dead testcase.

llvm-svn: 97489

llvm-svn: 97488

llvm-svn: 97487

llvm-svn: 97486

llvm-svn: 97485