RPCS3/llvm-mirror
1
0
Fork 0
mirror of https://github.com/RPCS3/llvm-mirror.git synced 2024-10-21 03:53:04 +02:00
Code Issues Projects Releases Wiki Activity
36,943 Commits 4 Branches 5 Tags 704 MiB
0ee0f38084
Commit Graph

21737 Commits

Author SHA1 Message Date
Chris Lattner
0ee0f38084 simplify this code again, try 2 :) 
llvm-svn: 47319
 2008-02-19 06:52:38 +00:00
Owen Anderson
d60bb0a64b Fix a comment. 
llvm-svn: 47318
 2008-02-19 06:51:23 +00:00
Owen Anderson
3efff61819 In addition to arguments passed to it, memcpy (and all other calls) can ModRef pointers that alias their arguments as well. This fixes PR2057. 
llvm-svn: 47317
 2008-02-19 06:47:18 +00:00
Owen Anderson
dbc264003e Major improvements to yesterday's return slot optimization. Remove some unneccessary constraints, 
and add some others that should have been in from the first place.  Document the whole thing better.

llvm-svn: 47315
 2008-02-19 06:35:43 +00:00
Chris Lattner
85482657eb Fix some minor issues folding undef, PR2052 
llvm-svn: 47314
 2008-02-19 06:22:12 +00:00
Chris Lattner
6bb889cf84 fdiv/frem of undef can produce undef, because the undef operand 
can be a SNaN.  We could be more aggressive and turn this into 
unreachable, but that is less nice, and not really worth it.

llvm-svn: 47313
 2008-02-19 06:12:18 +00:00
Chris Lattner
851ebb75de regenerate 
llvm-svn: 47312
 2008-02-19 04:36:25 +00:00
Chris Lattner
5400cc3907 Fix PR2060 by rejecting invalid types for integer constants. 
llvm-svn: 47311
 2008-02-19 04:36:07 +00:00
Owen Anderson
4e6f18d5bf Factor the profitability check for return slot optimization out into a static function. 
At some point in the future, this check will become smarter.

llvm-svn: 47310
 2008-02-19 03:27:34 +00:00
Owen Anderson
3782cd74d1 An sret parameter is required to be the first parameter, so there's no need to loop 
over all the parameters of the callee looking for it.

llvm-svn: 47309
 2008-02-19 03:15:29 +00:00
Owen Anderson
ea5cdf1a83 Cleanup some of my patches from yesterday. Refactor the check for which xform 
to apply to a memcpy into processInstruction.  Also, fix a bug in the check due to
missing braces.

llvm-svn: 47307
 2008-02-19 03:09:45 +00:00
Owen Anderson
5c258ed93d Fix Transforms/GVN/memcpy.ll, which Chris broke in r47275 by reordering the branches. memcpy's are a kind of CallInst. 
llvm-svn: 47305
 2008-02-19 02:53:23 +00:00
Evan Cheng
e18e5201fc PR1909: Tail merging pass ran wild. It makes no sense to merge blocks in order to save a single instruction since a branch will be inserted for each BB. 
llvm-svn: 47301
 2008-02-19 02:09:37 +00:00
Evan Cheng
ece0db124f Me not like duplicated comments. 
llvm-svn: 47300
 2008-02-19 02:05:16 +00:00
Evan Cheng
bb577266bf - When DAG combiner is folding a bit convert into a BUILD_VECTOR, it should check if it's essentially a SCALAR_TO_VECTOR. Avoid turning (v8i16) <10, u, u, u> to <10, 0, u, u, u, u, u, u>. Instead, simply convert it to a SCALAR_TO_VECTOR of the proper type. 
- X86 now normalize SCALAR_TO_VECTOR to (BIT_CONVERT (v4i32 SCALAR_TO_VECTOR)). Get rid of X86ISD::S2VEC.

llvm-svn: 47290
 2008-02-18 23:04:32 +00:00
Nick Lewycky
1f3c58df08 Correctly fold divide-by-constant, even when faced with overflow. 
llvm-svn: 47287
 2008-02-18 22:48:05 +00:00
Dan Gohman
0d0f16ca85 Chris pointed out that it's not necessary to set i64 MUL to Expand 
on x86-32 since i64 itself is not a Legal type. And, update some
comments.

llvm-svn: 47282
 2008-02-18 19:34:53 +00:00
Evan Cheng
03fd8ea753 - Remove the previous check which broke coalescer-commute3.ll 
- For now, conservatively ignore copy MI whose source is a physical register. Commuting its def MI can cause a physical register live interval to be live through a loop (since we know it's live coming into the def MI).

llvm-svn: 47281
 2008-02-18 18:56:31 +00:00
Chris Lattner
79ecc053ca upgrade some tests. 
llvm-svn: 47280
 2008-02-18 18:46:39 +00:00
Nate Begeman
66df9740df Add a note 
llvm-svn: 47279
 2008-02-18 18:39:23 +00:00
Chris Lattner
6ab061dd2d Add a note about sext from i1 plus flags use. 
llvm-svn: 47278
 2008-02-18 18:30:13 +00:00
Dan Gohman
70b9b2f77f Don't mark scalar integer multiplication as Expand on x86, since x86 
has plain one-result scalar integer multiplication instructions.
This avoids expanding such instructions into MUL_LOHI sequences that
must be special-cased at isel time, and avoids the problem with that
code that provented memory operands from being folded.

This fixes PR1874, addressesing the most common case. The uncommon
cases of optimizing multiply-high operations will require work
in DAGCombiner.

llvm-svn: 47277
 2008-02-18 17:55:26 +00:00
Chris Lattner
a378b03483 Transforming -A + -B --> -(A + B) isn't safe for FP, thanks 
to Dale for noticing this!

llvm-svn: 47276
 2008-02-18 17:50:16 +00:00
Chris Lattner
a3318d17d4 minor code simplification, no functionality change. 
llvm-svn: 47275
 2008-02-18 17:47:29 +00:00
Duncan Sands
a85448506d Simplify caller updating using a CallSite, as 
requested by Chris.  While there, do the same
for an existing function committed by someone
called "lattner" :)

llvm-svn: 47273
 2008-02-18 17:32:13 +00:00
Chris Lattner
57eff5b5f5 don't bother calling getUnderlyingObject for non-pointers. 
llvm-svn: 47272
 2008-02-18 17:28:21 +00:00
Owen Anderson
f3107c8546 Since we're not checking for the more general AllocationInst first, we need to explicitly check 
that Object is an Argument before casting it to one.

llvm-svn: 47268
 2008-02-18 10:11:00 +00:00
Roman Levenstein
a7d4ae1435 New helper function getMBBFromIndex() that given an index in any instruction of an MBB returns a pointer the MBB. Reviewed by Evan. 
llvm-svn: 47267
 2008-02-18 09:35:30 +00:00
Owen Anderson
7b092ea631 Add support to GVN for performing sret return slot optimization. This means that, if an sret function tail calls 
another sret function, it should pass its own sret parameter to the tail callee, allowing it to fill in the correct
return value.  llvm-gcc does not emit this by default.  Instead, it allocates space in the caller for the sret of
the tail call and then uses memcpy to copy the result into the caller's sret parameter.  This optimization detects
and optimizes that case.

llvm-svn: 47265
 2008-02-18 09:24:53 +00:00
Owen Anderson
e4e1706f95 I got the predicate backwards in my last patch. The comment is correct, the code was not. 
llvm-svn: 47264
 2008-02-18 09:22:21 +00:00
Owen Anderson
1b743c32fd This check is not correct for mallocs, so exclude them earlier. 
llvm-svn: 47263
 2008-02-18 09:11:02 +00:00
Evan Cheng
6eeae5bd62 For now, avoid commuting def MI for copy MI's whose source is not killed. That simply trade a live interval for another and because only the non-two-address operands can be folded into loads, may end up pessimising code. 
llvm-svn: 47262
 2008-02-18 08:40:53 +00:00
Chris Lattner
b22dbdf4fc switch simplifycfg from using vectors for most things to smallvectors, 
this speeds it up 2.3% on eon.

llvm-svn: 47261
 2008-02-18 07:42:56 +00:00
Chris Lattner
9851db050b optimize away stackrestore calls that have no intervening alloca or call. 
llvm-svn: 47258
 2008-02-18 06:12:38 +00:00
Owen Anderson
18a7d290cb Duncan pointed out that we can fast fail here, because the sret parameter of 
a function must be the first parameter.

llvm-svn: 47254
 2008-02-18 04:06:26 +00:00
Owen Anderson
b0891af18b Fix a comment, and a bug where we weren't applying the tail call logic in cases that failed the first test. 
llvm-svn: 47253
 2008-02-18 03:52:21 +00:00
Owen Anderson
0ef73a5d06 Fix bugs that Chris noticed in my last patch. 
llvm-svn: 47252
 2008-02-18 02:31:23 +00:00
Chris Lattner
0b6ec4a6b2 simplify some code, BreakUpSubtract always returns nonnull now. 
llvm-svn: 47251
 2008-02-18 02:18:25 +00:00
Chris Lattner
d5885d43ef bitcasts of pointers are always pointers. 
If we see a memcpy of a pointer, make sure to check later
uses of the pointer as well.

llvm-svn: 47250
 2008-02-18 02:11:28 +00:00
Owen Anderson
48dd6a0f96 Add a predicate to Argument to check for the StructRet attribute. 
llvm-svn: 47248
 2008-02-17 23:22:28 +00:00
Owen Anderson
884f6801df Teach getModRefInfo that memcpy, memmove, and memset don't "capture" memory addresses. 
Also, noalias arguments are be considered "like" stack allocated ones for this purpose, because
the only way they can be modref'ed is if they escape somewhere in the current function.

llvm-svn: 47247
 2008-02-17 21:29:08 +00:00
Chris Lattner
2fa904b3af Fold (-x + -y) -> -(x+y) which promotes better association, fixing 
the second half of PR2047

llvm-svn: 47244
 2008-02-17 21:03:36 +00:00
Chris Lattner
51a663a8fe fix pasto 
llvm-svn: 47242
 2008-02-17 20:54:40 +00:00
Chris Lattner
4a34461d64 Split up subtracts into add+negate if they have a reassociable use or operand 
that is also a subtract.  This implements PR2047 and Transforms/Reassociate/subtest2.ll 

llvm-svn: 47241
 2008-02-17 20:51:26 +00:00
Chris Lattner
cd6f9cea98 make the logic for breaking up subtracts more explicit, no 
functionality change.

llvm-svn: 47239
 2008-02-17 20:44:51 +00:00
Chris Lattner
3e886fa85a move PR2053 to here. 
llvm-svn: 47237
 2008-02-17 19:43:57 +00:00
Duncan Sands
cd0325cce1 Remove any 'nest' parameter attributes if the function 
is not passed as an argument to a trampoline intrinsic.

llvm-svn: 47220
 2008-02-16 20:56:04 +00:00
Duncan Sands
753597d1cf Some micro-optimizations. 
llvm-svn: 47219
 2008-02-16 20:53:06 +00:00
Andrew Lenharth
da54523742 I cannot find a libgcc function for this builtin. Therefor expanding it to a noop (which is how it use to be treated). If someone who knows the x86 backend better than me could tell me how to get a lock prefix on an instruction, that would be nice to complete x86 support. 
llvm-svn: 47213
 2008-02-16 14:46:26 +00:00
Duncan Sands
22ebf8b70f Teach LegalizeTypes how to expand the operands of 
br_cc.  This fixes 5 "make check" failures.

llvm-svn: 47212
 2008-02-16 10:29:26 +00:00