- Sep 25, 2010
-
-
Lang Hames authored
Removed VNInfo::isDefAccurate(). Def "accuracy" can be checked by testing whether LiveIntervals::getInstructionFromIndex(def) returns NULL. llvm-svn: 114791
-
Jakob Stoklund Olesen authored
llvm-svn: 114779
-
Jakob Stoklund Olesen authored
and it will be removed shortly. llvm-svn: 114778
-
Jakob Stoklund Olesen authored
llvm-svn: 114776
-
John Thompson authored
llvm-svn: 114767
-
- Sep 24, 2010
-
-
Michael J. Spencer authored
llvm-svn: 114750
-
Nicolas Geoffray authored
llvm-svn: 114736
-
- Sep 23, 2010
-
-
Evan Cheng authored
Revert 114634 for now since buildbot claim it broke Clang self-hosting. I doubt it but it's possible it's exposing another bug somewhere. llvm-svn: 114681
-
Oscar Fuentes authored
Patch by Nathan Jeffords! llvm-svn: 114661
-
Evan Cheng authored
llvm-svn: 114634
-
Evan Cheng authored
close to their sources to facilitate coalescing. llvm-svn: 114631
-
Evan Cheng authored
when the unconditional branch destination is the fallthrough block. The canonicalization makes it easier to allow optimizations on DAGs to invert conditional branches. The branch folding pass (and AnalyzeBranch) will clean up the unnecessary unconditional branches later. This is one of the patches leading up to disabling codegen prepare critical edge splitting. llvm-svn: 114630
-
Lang Hames authored
Moved the PBQP allocator class out of the header and back in to the cpp file to hide the gory details. Allocator instances can now be created by calling createPBQPRegisterAllocator. Tidied up use of CoalescerPair as per Jakob's suggestions. Made the new PBQPBuilder based construction process the default. The internal construction process remains in-place and available via -pbqp-builder=false for now. It will be removed shortly if the new process doesn't cause any regressions. llvm-svn: 114626
-
Owen Anderson authored
lowered using a series of shifts. Fixes <rdar://problem/8285015>. llvm-svn: 114599
-
- Sep 22, 2010
-
-
Devang Patel authored
llvm-svn: 114585
-
Jakob Stoklund Olesen authored
creating it before and subtracting split ranges. This way, the SSA update code in LiveIntervalMap can properly create and use new phi values in dupli. Now it is possible to create split regions where a value escapes along two different CFG edges, creating phi values outside the split region. This is a work in progress and probably quite broken. llvm-svn: 114492
-
John Thompson authored
llvm-svn: 114490
-
Chris Lattner authored
that complex patterns are matched after the entire pattern has a structural match, therefore the NodeStack isn't in a useful state when the actual call to the matcher happens. llvm-svn: 114489
-
- Sep 21, 2010
-
-
Devang Patel authored
If only user of a vreg is an copy instruction to export copy of vreg out of current basic block then insert DBG_VALUE so that debug value of the variable is also transfered to new vreg. Testcase is in r114476. This fixes radar 8412415. llvm-svn: 114478
-
Chris Lattner authored
llvm-svn: 114474
-
Owen Anderson authored
the predicate to discover the number of sign bits. Enhance X86's target lowering to provide a useful response to this query. llvm-svn: 114473
-
Chris Lattner authored
matched, allow ComplexPatterns to opt into getting the parent node of the operand being matched. llvm-svn: 114472
-
Jakob Stoklund Olesen authored
llvm-svn: 114469
-
Chris Lattner authored
I think I've audited all uses, so it should be dependable for address spaces, and the pointer+offset info should also be accurate when there. llvm-svn: 114464
-
Chris Lattner authored
llvm-svn: 114463
-
Chris Lattner authored
llvm-svn: 114461
-
Jakob Stoklund Olesen authored
llvm-svn: 114459
-
Jakob Stoklund Olesen authored
llvm-svn: 114455
-
Bob Wilson authored
and store intrinsics are represented with MemIntrinsicSDNodes. llvm-svn: 114454
-
Chris Lattner authored
MachinePointerInfo around more. llvm-svn: 114452
-
Chris Lattner authored
llvm-svn: 114450
-
Chris Lattner authored
with an indexed load/store that has an offset in the index. llvm-svn: 114449
-
Jakob Stoklund Olesen authored
instead of calling lower_bound or upper_bound directly. This cleans up the search logic a bit because {lower,upper}_bound compare LR->start by default, and it is usually simpler to search LR->end. Funnelling all searches through one function also makes it possible to replace the search algorithm with something faster than binary search. llvm-svn: 114448
-
Jakob Stoklund Olesen authored
llvm-svn: 114447
-
Chris Lattner authored
SelectionDAG::getExtLoad overload, and eliminate it. llvm-svn: 114446
-
Chris Lattner authored
getLoad overloads. llvm-svn: 114443
-
Chris Lattner authored
with SVOffset computation. llvm-svn: 114442
-
Chris Lattner authored
llvm-svn: 114437
-
Chris Lattner authored
no functionality change (step #1) llvm-svn: 114436
-
Lang Hames authored
llvm-svn: 114431
-