- Mar 01, 2010
-
-
Chris Lattner authored
the vtlist for emitnode. llvm-svn: 97429
-
- Feb 28, 2010
-
-
Chris Lattner authored
warnings in release-assert builds if there were no cases. llvm-svn: 97428
-
Chris Lattner authored
immediate sizes into the opcode. llvm-svn: 97423
-
Chris Lattner authored
specifies whether there is an output flag or not. Use this instead of redundantly encoding the chain/flag results in the output vtlist. llvm-svn: 97419
-
Chris Lattner authored
is just a silly wrapper around MorphNodeTo. llvm-svn: 97416
-
Chris Lattner authored
even some the old isel didn't. There are several parts of this that make me feel dirty, but it's no worse than the old isel. I'll clean up the parts I can do without ripping out the old one next. llvm-svn: 97415
-
Chris Lattner authored
it will populate. llvm-svn: 97363
-
Chris Lattner authored
because I have to go on another detour first. llvm-svn: 97362
-
Chris Lattner authored
node is always guaranteed to have a particular type instead of hacking in ISD::STORE explicitly. This allows us to use implied types for a broad range of nodes, even target specific ones. llvm-svn: 97355
-
Dan Gohman authored
llvm-svn: 97348
-
- Feb 27, 2010
-
-
Chris Lattner authored
the opcode name. This gives the optimizer more semantic info. llvm-svn: 97346
-
Chris Lattner authored
dissatisfying hack. TODO: Improve it. :) llvm-svn: 97317
-
Chris Lattner authored
llvm-svn: 97315
-
Chris Lattner authored
with getType() == MVT::i32 etc. Teach it that two different integer constants are contradictory. This cuts 1K off the X86 table, down to 98k llvm-svn: 97314
-
Chris Lattner authored
predicates. For example if we have: Scope: CheckType i32 ABC CheckType f32 DEF CheckType i32 GHI Then we know that we can transform this into: Scope: CheckType i32 Scope ABC GHI CheckType f32 DEF This reorders the check for the 'GHI' predicate above the check for the 'DEF' predidate. However it is safe to do this in this situation because we know that a node cannot have both an i32 and f32 type. We're now doing more factoring that the old isel did. llvm-svn: 97312
-
Chris Lattner authored
respects -debug-only=something-else. llvm-svn: 97307
-
Chris Lattner authored
as deeply into the pattern as we can get away with. In pratice, this means "all the way to to the emitter code, but not across ComplexPatterns". This substantially increases the amount of factoring we get. llvm-svn: 97305
-
- Feb 26, 2010
-
-
Chris Lattner authored
llvm-svn: 97219
-
Chris Lattner authored
gross little neighbor merging implementation. This one has the benefit of not violating the ordering of patterns, so it generates code that passes tests again. llvm-svn: 97218
-
Chris Lattner authored
llvm-svn: 97217
-
Chris Lattner authored
llvm-svn: 97216
-
Chris Lattner authored
current design. This generates a matcher that successfully runs, but it turns out that the factoring we're doing violates the ordering of patterns, so we end up matching (e.g.) movups where we want movaps. This won't due, but I'll address this in a follow on patch. It's nice to not be on by default yet! :) llvm-svn: 97215
-
Chris Lattner authored
that we never return a tombstone value, which (thankfully) triggers an assert in densemap. llvm-svn: 97214
-
- Feb 25, 2010
-
-
Chris Lattner authored
instead of to have a chained series of scope nodes. This makes the generated table smaller, improves the efficiency of the interpreter, and make the factoring optimization much more reasonable to implement. llvm-svn: 97160
-
Chris Lattner authored
splitting all the patterns under scope nodes into equality sets based on their first node. The second step is to rewrite the graph info a form that exposes the sharing. Before I do this, I want to redesign the Scope node. llvm-svn: 97130
-
Chris Lattner authored
llvm-svn: 97125
-
Chris Lattner authored
llvm-svn: 97123
-
Chris Lattner authored
llvm-svn: 97097
-
Chris Lattner authored
llvm-svn: 97096
-
Chris Lattner authored
llvm-svn: 97094
-
Chris Lattner authored
reflect what it does. Switch the sense of the Next and the Check arms to be more logical. No functionality change. llvm-svn: 97093
-
Chris Lattner authored
llvm-svn: 97081
-
- Feb 24, 2010
-
-
Chris Lattner authored
x86 table by 1200 bytes. llvm-svn: 97053
-
Chris Lattner authored
movechild/record -> recordchild/movechild and movechild/moveparent -> noop xforms. This slightly shrinks the tables (x86 to 117454) and enables adding future improvements. llvm-svn: 97051
-
Chris Lattner authored
llvm-svn: 97047
-
Chris Lattner authored
llvm-svn: 97034
-
Chris Lattner authored
the old one around for comparative purposes: have the ENABLE_NEW_ISEL #define (which is not enabled on mainline) stop emitting the old isel at all, yay for build time win. llvm-svn: 97033
-
Chris Lattner authored
the new isel: fold movechild+record+moveparent into a single recordchild N node. This shrinks the X86 table from 125443 to 117502 bytes. llvm-svn: 97031
-
Chris Lattner authored
Also add an easy macro at the top of DAGISelEmitter.cpp to enable it. Lets see if I can avoid accidentally turning it on :) llvm-svn: 97029
-
Chris Lattner authored
internal nodes with flag results. Record these with a new OPC_MarkFlagResults opcode and use this to update the interior nodes' flag results properly. This fixes CodeGen/X86/i256-add.ll with the new isel. llvm-svn: 97021
-