maxjhandsome
/
llvm-project
forked from OSchip/llvm-project
1
0
Fork 0
Code Issues Pull Requests Packages Releases Wiki Activity
17,595 Commits 23 Branches 0 Tags 2.2 GiB
Commit Graph

9330 Commits

Author SHA1 Message Date
Andrew Lenharth f0ab14aa24 turn on IEEE for compares 
llvm-svn: 20425
 2005-03-03 22:12:11 +00:00
Andrew Lenharth 6a5f52d15a beter Select on FP 
llvm-svn: 20424
 2005-03-03 21:47:53 +00:00
Chris Lattner 00ee68c612 Print -X like this: 
double test(double l1_X) {
  return (-l1_X);
}

instead of like this:

double test(double l1_X) {
  return (-0x0p+0 - l1_X);
}

llvm-svn: 20423
 2005-03-03 21:12:04 +00:00
Andrew Lenharth 00348ce902 LSR cleanup patch 
llvm-svn: 20422
 2005-03-03 19:03:21 +00:00
Chris Lattner 1a678c67c9 Do not lower malloc's to pass "sizeof" expressions like this: 
ltmp_0_7 = malloc(((unsigned )(&(((signed char (*)[784])/*NULL*/0)[1u]))));

Instead, just emit the literal constant, like this:

  ltmp_0_7 = malloc(784u);

This works around a bug in ICC 8.1 compiling the CBE generated code.  :-(

llvm-svn: 20415
 2005-03-03 01:04:50 +00:00
Chris Lattner ef1e989e4f Add an optional argument to lower to a specific constant value instead of 
to a "sizeof" expression.

llvm-svn: 20414
 2005-03-03 01:03:43 +00:00
Misha Brukman f090d1b3ab Fix the spelling of the word `the' 
llvm-svn: 20412
 2005-03-02 23:17:31 +00:00
Chris Lattner 4d8689edcb Print the module ID as a comment. 
llvm-svn: 20411
 2005-03-02 23:12:40 +00:00
Chris Lattner 5b5caaf3cd cleanup the cfg after lsr 
llvm-svn: 20410
 2005-03-02 21:56:00 +00:00
Andrew Lenharth 180a04a4bb remove 32 sign extend after 32 sextload and handle small negative constant 
llvm-svn: 20408
 2005-03-02 17:23:03 +00:00
Andrew Lenharth ed4b6488a7 Added LSR as a beta pass for alpha 
llvm-svn: 20407
 2005-03-02 17:21:38 +00:00
Chris Lattner c8bb99760a Add a temporary option for llc-beta: -enable-lsr-for-ppc, which turns on 
Loop Strength Reduction.

llvm-svn: 20399
 2005-03-02 06:19:22 +00:00
Reid Spencer a556669219 Be slightly more accurate in an error message. 
llvm-svn: 20397
 2005-03-02 05:45:56 +00:00
Chris Lattner fe760deb75 Fix a nasty order of evaluation bug that Gabor Greif ran into. Here's an 
explanation from IRC:

	|sabre|	I think it's an order of evaluation thing
	|sabre|	for me, the RHS of the assignment is evaluated first
	|sabre|	getTypeDescription checks to see if ConcreteTypeDescription[Ty] contains anything
	|sabre|	since it doesn't, it computes and returns the value
	|sabre|	this gets put into the map.
	|sabre|	For you, the LHS is evaluated first.
	|sabre|	Map[Ty] (aka ConcreteTypeDescriptions[Ty]) inserts an empty string into the map, returning a reference
	|sabre|	getTypeDesc then sees the empty string in the map
	|sabre|	and returns it
	|sabre|	bork :)

llvm-svn: 20394
 2005-03-02 03:54:43 +00:00
Jeff Cohen 8ea6f9e821 Fixed the following LSR bugs: 
* Loop invariant code does not dominate the loop header, but rather
    the end of the loop preheader.

  * The base for a reduced GEP isn't a constant unless all of its
    operands (preceding the induction variable) are constant.

  * Allow induction variable elimination for the simple case after all.

Also made changes recommended by Chris for properly deleting
instructions.

llvm-svn: 20383
 2005-03-01 03:46:11 +00:00
Alkis Evlogimenos b3846f4b06 Lower llvm.isunordered(a, b) into a != a | b != b. 
llvm-svn: 20382
 2005-03-01 02:07:58 +00:00
Chris Lattner 12328e9378 Remove tabs from file. 
llvm-svn: 20380
 2005-02-28 19:36:15 +00:00
Chris Lattner 811107350a Add support to the C backend for llvm.prefetch. Patch contributed by 
Justin Wick!

llvm-svn: 20378
 2005-02-28 19:29:46 +00:00
Chris Lattner 1772c1a672 recognize llvm.prefetch. Patch contributed by Justin Wick! 
llvm-svn: 20377
 2005-02-28 19:28:00 +00:00
Chris Lattner 39637ef023 Verify llvm.prefetch. 
llvm-svn: 20376
 2005-02-28 19:27:42 +00:00
Chris Lattner c87e03aeea Lower prefetch to a noop, patch contributed by Justin Wick! 
llvm-svn: 20375
 2005-02-28 19:27:23 +00:00
Andrew Lenharth 76eff48195 fix integer division and stuff 
llvm-svn: 20372
 2005-02-28 17:22:18 +00:00
Jeff Cohen dcaa48b5c4 Fix crash in LSR due to attempt to remove original induction variable. However, 
for reasons explained in the comments, I also deactivated this code as it needs
more thought.

llvm-svn: 20367
 2005-02-28 00:08:56 +00:00
Jeff Cohen fd63d3af0d PHI nodes were incorrectly placed when more than one GEP is reduced in a loop. 
llvm-svn: 20360
 2005-02-27 21:08:04 +00:00
Jeff Cohen 39751c3b7c First pass at improved Loop Strength Reduction. Still not yet ready for prime time. 
llvm-svn: 20358
 2005-02-27 19:37:07 +00:00
Chris Lattner 7f32c4aa36 Use const iterators where possible. Patch by Evan Jones! 
llvm-svn: 20354
 2005-02-27 19:06:10 +00:00
Chris Lattner 7561ca1d15 Teach globalopt how memset/cpy/move affect memory, to allow better optimization. 
llvm-svn: 20352
 2005-02-27 18:58:52 +00:00
Chris Lattner 0ce80cd542 Fix spelling, patch contributed by Gabor Greif! 
llvm-svn: 20343
 2005-02-27 06:18:25 +00:00
Chris Lattner dc166eb8f7 Fix spelling, patch contributed by Gabor Greif 
llvm-svn: 20342
 2005-02-27 06:15:51 +00:00
Chris Lattner 5315aa0ec6 Remove some stuff I checked in accidentally 
llvm-svn: 20340
 2005-02-27 04:32:35 +00:00
Chris Lattner 0b0f3520cb DCE a dead function 
llvm-svn: 20339
 2005-02-26 23:36:45 +00:00
Reid Spencer 709e10ed92 Implement an isBytecodeArchive method to determine if an archive contains 
bytecode file members or not.
Patch Contributed By Adam Treat

llvm-svn: 20338
 2005-02-26 22:00:32 +00:00
Chris Lattner f05d2b3178 1 + 100 + 51 == 152, not 52. 
If we fold three constants together (c1+c2+c3), make sure to keep
LHSC updated, instead of reusing (in this case), the 1 instead of the
partial sum.

llvm-svn: 20337
 2005-02-26 18:50:19 +00:00
Chris Lattner cc6d75fddf remove extraneous cast 
llvm-svn: 20334
 2005-02-26 18:33:28 +00:00
Andrew Lenharth 10bc4c0ff6 make BB labels be exported for debuging, add fp negation optimization, further pecimise the FP instructions 
llvm-svn: 20332
 2005-02-25 22:55:15 +00:00
Chris Lattner e99ee2b35d Handle null a bit more carefully. 
Actually teach dsa about select instructions.  This doesn't affect the
graph in any way other than not setting a spurious U marker on pointer
nodes that are selected.

llvm-svn: 20324
 2005-02-25 01:27:48 +00:00
Chris Lattner 468fd33abb This instruction: 
X = gep null, ...

Used to not create a scalar map entry for X, which caused clients to barf.
This is bad.

llvm-svn: 20316
 2005-02-24 19:55:31 +00:00
Chris Lattner d13cc49e19 Fix a bug introduced by revision 1.187 of this file. 
llvm-svn: 20308
 2005-02-24 18:48:07 +00:00
Andrew Lenharth 904650cdd0 fix Allocas. Really. I mean it this time. 
llvm-svn: 20306
 2005-02-24 18:36:32 +00:00
Chris Lattner 08f7d0c262 Fix some problems where the verifier would crash on invalid input instead of 
reporting the problem and exiting.

llvm-svn: 20302
 2005-02-24 16:58:29 +00:00
Chris Lattner 1cca959e5d Implement Transforms/SimplifyCFG/switch_thread.ll 
This does a simple form of "jump threading", which eliminates CFG edges that
are provably dead.  This triggers 90 times in the external tests, and
eliminating CFG edges is always always a good thing! :)

llvm-svn: 20300
 2005-02-24 06:17:52 +00:00
Chris Lattner 47ac187c08 switch instructions only allow constantints for their values, be more specific. 
llvm-svn: 20298
 2005-02-24 05:32:09 +00:00
Chris Lattner 75f5b42624 use more specific cast. 
llvm-svn: 20297
 2005-02-24 05:26:04 +00:00
Chris Lattner fc824c1a7e add more checking 
llvm-svn: 20296
 2005-02-24 05:25:17 +00:00
Chris Lattner 5f0df0c1e6 Do not read free'd memory when printing an error message. 
llvm-svn: 20295
 2005-02-24 04:59:49 +00:00
Chris Lattner ce046ac9c6 add a new method. 
llvm-svn: 20293
 2005-02-24 02:37:26 +00:00
Tanya Lattner ee47100d44 Only print out machine instructions before modulo scheduling if we are actually doing modulo scheduling! :) 
llvm-svn: 20292
 2005-02-24 02:14:44 +00:00
Andrew Lenharth 27cf4eb1c7 Ah the problems you have to fix when you stray from the One True Way (TM) 
llvm-svn: 20290
 2005-02-23 17:33:42 +00:00
Chris Lattner 25169caa80 make this more efficient. Scan up to 16 nodes, not the whole list. 
llvm-svn: 20289
 2005-02-23 16:53:04 +00:00
Chris Lattner d36552f34f new method 
llvm-svn: 20288
 2005-02-23 16:51:11 +00:00