RPCS3/llvm-mirror
1
0
Fork 0
mirror of https://github.com/RPCS3/llvm-mirror.git synced 2024-11-24 19:52:54 +01:00
Code Issues Projects Releases Wiki Activity
40,035 Commits 4 Branches 5 Tags 704 MiB
15ae951af5
Commit Graph

40035 Commits

This Branch
This Branch
All Branches
Author SHA1 Message Date
Chris Lattner
15ae951af5 Add a note. 
llvm-svn: 53535
 2008-07-14 00:19:59 +00:00
Chris Lattner
14faada3a3 Fix PR2506 by being a bit more careful about reverse fact propagation when 
disproving a condition.  This actually compiles the existing testcase
(udiv_select_to_select_shift) to:

define i64 @test(i64 %X, i1 %Cond) {
entry:
	%divisor1.t = lshr i64 %X, 3		; <i64> [#uses=1]
	%quotient2 = lshr i64 %X, 3		; <i64> [#uses=1]
	%sum = add i64 %divisor1.t, %quotient2		; <i64> [#uses=1]
	ret i64 %sum
}

instead of:

define i64 @test(i64 %X, i1 %Cond) {
entry:
	%quotient1.v = select i1 %Cond, i64 3, i64 4		; <i64> [#uses=1]
	%quotient1 = lshr i64 %X, %quotient1.v		; <i64> [#uses=1]
	%quotient2 = lshr i64 %X, 3		; <i64> [#uses=1]
	%sum = add i64 %quotient1, %quotient2		; <i64> [#uses=1]
	ret i64 %sum
}

llvm-svn: 53534
 2008-07-14 00:15:52 +00:00
Chris Lattner
3444f4d4c4 Fix mishandling of the infinite loop case when merging two blocks. This 
fixes PR2540.

llvm-svn: 53533
 2008-07-13 22:23:11 +00:00
Chris Lattner
7cb257551f more refactoring. Use early exits instead of really complex logic. 
No functionality change.

llvm-svn: 53532
 2008-07-13 22:04:41 +00:00
Chris Lattner
a4a80e0092 improve comments. 
llvm-svn: 53531
 2008-07-13 21:55:46 +00:00
Chris Lattner
824fbca1ee factor another large hunk of code out into its own function. 
No functionality change.

llvm-svn: 53530
 2008-07-13 21:53:26 +00:00
Chris Lattner
631ab45eb2 add a description. 
llvm-svn: 53529
 2008-07-13 21:27:36 +00:00
Chris Lattner
67bf4acd15 Final bit of simplification for FoldBranchToCommonDest. 
llvm-svn: 53528
 2008-07-13 21:20:19 +00:00
Chris Lattner
3346d311c7 simplify logic a bit 
llvm-svn: 53527
 2008-07-13 21:15:11 +00:00
Chris Lattner
2ac1854097 Refactor some code out into its own helper function, getting rid of crazy multiline 
conditionals and commenting the code better.

No functionality change.

llvm-svn: 53526
 2008-07-13 21:12:01 +00:00
Duncan Sands
2513505573 Fix comment. 
llvm-svn: 53525
 2008-07-13 20:14:38 +00:00
Chris Lattner
540afcff82 Fix PR2231 - opt -internalize -std-compile-opts should run internalize first 
llvm-svn: 53523
 2008-07-13 19:35:21 +00:00
Cedric Venet
6f9cf0e8a6 Remove deleted files from VC++ project. 
llvm-svn: 53521
 2008-07-13 11:12:36 +00:00
Ted Kremenek
6efe7adf98 Inline typedef for alist_iterator::pointer to work with MSVC++. 
llvm-svn: 53517
 2008-07-12 18:28:46 +00:00
Nick Lewycky
df9e9f0b0e Stop creating extraneous smax/umax in SCEV. This removes a regression where we 
started complicating many loops ('for' loops, in fact).

llvm-svn: 53508
 2008-07-12 07:41:32 +00:00
Nick Lewycky
0dae6f90bb operator[] is not defined for list::iterator. Overload it in ilist::iterator 
to prevent silly things from happening accidentally. PR2171

llvm-svn: 53507
 2008-07-12 07:00:52 +00:00
Nick Lewycky
3fb5816774 Enhance analysis of srem. 
Remove dead code analyzing urem. 'urem' of power-of-2 is canonicalized to an
'and' instruction.

llvm-svn: 53506
 2008-07-12 05:04:38 +00:00
Evan Cheng
c69b53dff9 Implement llvm.atomic.cmp.swap.i32 on PPC. Patch by Gary Benson! 
llvm-svn: 53505
 2008-07-12 02:23:19 +00:00
Evan Cheng
7457283357 Typos. 
llvm-svn: 53504
 2008-07-12 02:22:07 +00:00
Evan Cheng
05e5317cab Fix PR2536: a nasty spiller bug. If a two-address instruction uses a register but the use portion of its live range is not part of its liveinterval, it must be defined by an implicit_def. In that case, do not spill the use. e.g. 
8   %reg1024<def> = IMPLICIT_DEF
12  %reg1024<def> = INSERT_SUBREG %reg1024<kill>, %reg1025, 2

The live range [12, 14) are not part of the r1024 live interval since it's defined by an implicit def. It will not conflicts with live interval of r1025. Now suppose both registers are spilled, you can easily see a situation where both registers are reloaded before the INSERT_SUBREG and both target registers that would overlap.

llvm-svn: 53503
 2008-07-12 01:56:02 +00:00
Evan Cheng
ebf7ff4531 Back out 53476 and 53480 for now. Somehow they cause llc to miscompile 179.art. 
llvm-svn: 53502
 2008-07-12 01:38:51 +00:00
Dan Gohman
bf47a27643 Add a utility function to MachineInstr for testing whether an instruction 
has exactly one MachineMemOperand, and change some X86 lowering code to
make use of it.

llvm-svn: 53498
 2008-07-12 00:10:52 +00:00
Dan Gohman
fee8b04935 Fix spelling of "hierarchy" in comments. 
llvm-svn: 53489
 2008-07-11 22:51:32 +00:00
Dan Gohman
0abdafa4f9 Fix typos in comments. 
llvm-svn: 53487
 2008-07-11 22:48:20 +00:00
Dan Gohman
4c18394001 Include a frame index in the "fixed stack" pseudo source value 
instead of using the frame index for the SVOffset, which was
inconsistent.

llvm-svn: 53486
 2008-07-11 22:44:52 +00:00
Ted Kremenek
d6dcdf8802 Minor tweaks to the ImmutableList iterator interface. 
Added partial specialization of DenseMapInfo<T> for ImmutableList.

llvm-svn: 53485
 2008-07-11 22:43:07 +00:00
Bill Wendling
688b78adf1 Porting r53478 into mainline: 
Update to build_llvm. Don't output a floating point number for the version.

llvm-svn: 53484
 2008-07-11 22:42:10 +00:00
Dan Gohman
b21183f645 Fix an obsolete top-level comment. 
llvm-svn: 53481
 2008-07-11 22:39:58 +00:00
Dan Gohman
3b91ef27b5 Factor out debugging code into the common base class. 
llvm-svn: 53480
 2008-07-11 22:36:22 +00:00
Dan Gohman
6ee2195ab1 Add support for putting NamedRegionTimers in TimerGroups, and 
use a timer group for the timers in SelectionDAGISel. Also,
Split scheduling out from emitting, to give each their own
timer.

llvm-svn: 53476
 2008-07-11 21:54:34 +00:00
Dan Gohman
d1342570f2 Use find instead of lower_bound. 
llvm-svn: 53474
 2008-07-11 20:58:19 +00:00
Chris Lattner
4f20448c91 add support for returning i128, PR2532. 
llvm-svn: 53472
 2008-07-11 20:53:00 +00:00
Dan Gohman
d7a32ecde2 Trim unnecessary #includes. 
llvm-svn: 53471
 2008-07-11 20:38:31 +00:00
Owen Anderson
cc861329ee Don't call lookupNumber more than we have to. 
llvm-svn: 53470
 2008-07-11 20:05:13 +00:00
Duncan Sands
eb04d356e3 Remove an apparently useless routine: there should 
be no need to split the result of a vector RET node,
since they are always already legal.

llvm-svn: 53462
 2008-07-11 17:02:09 +00:00
Duncan Sands
1e3fe05638 It is pointless to turn a UINT_TO_FP into an 
SINT_TO_FP libcall plus additional operations:
it might as well be a direct UINT_TO_FP libcall.
So only turn it into an SINT_TO_FP if the target
has special handling for SINT_TO_FP.

llvm-svn: 53461
 2008-07-11 17:00:14 +00:00
Duncan Sands
58130a26f4 Add two missing SINT_TO_FP libcalls. 
llvm-svn: 53460
 2008-07-11 16:57:02 +00:00
Duncan Sands
52f1dbf139 Port a shift-by-1 optimization from LegalizeDAG: it 
was presumably added after the rest of the code was
copied to LegalizeTypes.

llvm-svn: 53459
 2008-07-11 16:54:57 +00:00
Duncan Sands
669d4d6909 Add support for 128 bit shifts and 32 bit shifts 
on 16 bit machines.

llvm-svn: 53458
 2008-07-11 16:52:29 +00:00
Nick Lewycky
cafc3d583d Document 'mask' in this calculation. 
llvm-svn: 53454
 2008-07-11 08:16:26 +00:00
Duncan Sands
94f659d6cb Align comments, colons and cases. Remove trailing 
whitespace.

llvm-svn: 53453
 2008-07-11 07:37:30 +00:00
Nick Lewycky
12c88a28f5 Remove misleading constant from comment. 
llvm-svn: 53452
 2008-07-11 07:36:19 +00:00
Nick Lewycky
8cd0f2058e Add another optimization from PR2330. Also catch some missing cases that are 
similar.

llvm-svn: 53451
 2008-07-11 07:20:53 +00:00
Bill Wendling
9f17caa9a9 The frame address on an x86-64 box needs to be offset by -8, not -4. 
llvm-svn: 53450
 2008-07-11 07:18:52 +00:00
Chris Lattner
07bfade2d4 a missed optimization that Eli spotted 
llvm-svn: 53449
 2008-07-11 06:40:29 +00:00
Chris Lattner
34b0895d4d another bug in the same line. 
llvm-svn: 53448
 2008-07-11 06:38:16 +00:00
Chris Lattner
3cdb6789b9 fix a bug spotted by Eli's eagle eyes 
llvm-svn: 53447
 2008-07-11 06:36:01 +00:00
Chris Lattner
3d40848bfd simplify and merge a bunch of code. Instead of comparing against 
the min/max values for an integer type, compare against the min/max
values we can prove contain the input.  This might be a tighter bound,
so this is general goodness.

llvm-svn: 53446
 2008-07-11 05:40:05 +00:00
Chris Lattner
d1198896ae fold away (x <= cst) earlier, allowing us to not have to 
handle them in some code.

llvm-svn: 53445
 2008-07-11 05:08:55 +00:00
Chris Lattner
16b8ae98c1 Fix folding of icmp's of i1 where the comparison is signed. The code 
was using the algorithm for folding unsigned comparisons which is
completely wrong.  This has been broken since the signless types change.

llvm-svn: 53444
 2008-07-11 04:20:58 +00:00