RPCS3/llvm-mirror
1
0
Fork 0
mirror of https://github.com/RPCS3/llvm-mirror.git synced 2024-12-28 22:43:29 +00:00
Code Issues Actions Packages Projects Releases Wiki Activity
9,686 Commits 4 Branches 5 Tags 634 MiB
f9d6642d90
Commit Graph

664 Commits

Author SHA1 Message Date
Chris Lattner
cfd07c0971 Add some comments, add new getGlobalVariable method 
llvm-svn: 10671
 2003-12-31 08:43:01 +00:00
Chris Lattner
3f6af8506e * Make Module::getTypeName const 
* Add new Module::getTypeByName method
* Group methods in Module.cpp better

llvm-svn: 10668
 2003-12-31 07:09:33 +00:00
Chris Lattner
24a9176b66 Make the lookup method const. 
llvm-svn: 10667
 2003-12-31 07:08:19 +00:00
Chris Lattner
df22b39818 Fix PR198 
llvm-svn: 10659
 2003-12-31 03:19:37 +00:00
Chris Lattner
726d13c4d1 Add comments 
llvm-svn: 10658
 2003-12-31 02:50:02 +00:00
Chris Lattner
c37577eb9f Clean up a lot of the code I added yesterday by exposing the IntrinsicLowering 
implementation from the TargetMachine directly.

llvm-svn: 10636
 2003-12-28 21:23:38 +00:00
Chris Lattner
068ac4236d Move into the VMCore library 
llvm-svn: 10623
 2003-12-28 08:30:20 +00:00
Chris Lattner
d4abe8d28a The recalclulate method was a nasty hack that was once used by the -cee pass, 
which never worked itself.  The cee pass still doesn't work, but it doesn't use
this method anymore anyway, so eliminate the method.

llvm-svn: 10302
 2003-12-07 00:55:32 +00:00
Chris Lattner
9eeb35760f Completely rewrite domset, idom, and domtree implementation. Now it is based 
on the algorithm for directly computing immediate dominators presented in this
paper:

  A Fast Algorithm for Finding Dominators in a Flowgraph
  T. Lengauer & R. Tarjan, ACM TOPLAS July 1979, pgs 121-141.

This _substantially_ speeds up construction of all dominator related information.
Post-dominators to follow.

llvm-svn: 10301
 2003-12-07 00:38:08 +00:00
Chris Lattner
626abbe58b Fix const correctness 
llvm-svn: 10229
 2003-11-25 21:28:00 +00:00
Chris Lattner
96d8d9990b Relax constrains on GEP type indexes 
llvm-svn: 10228
 2003-11-25 21:21:46 +00:00
Chris Lattner
f987c67a53 Check return types of functions 
llvm-svn: 10146
 2003-11-21 22:32:23 +00:00
Chris Lattner
1901b23d5d Fix problem Reid was having with external globals and nonexternal linkage 
llvm-svn: 10133
 2003-11-21 20:33:27 +00:00
Chris Lattner
a1da49a55c Finegrainify namespacification 
llvm-svn: 10131
 2003-11-21 20:23:48 +00:00
Chris Lattner
797e88aee9 Fix some problems with assertions printing 
llvm-svn: 10129
 2003-11-21 17:35:51 +00:00
Chris Lattner
acd028d92a improve error message 
llvm-svn: 10128
 2003-11-21 17:06:29 +00:00
Chris Lattner
2b7309dd1c Minor cleanups and simplifications 
llvm-svn: 10127
 2003-11-21 16:52:05 +00:00
Chris Lattner
feeb3261f2 Start using the nicer terminator auto-insertion API 
llvm-svn: 10111
 2003-11-20 18:25:24 +00:00
Chris Lattner
310dac2b01 Somehow I forgot poor little UnwindInst 
*sniff*

llvm-svn: 10108
 2003-11-20 18:11:56 +00:00
Chris Lattner
3aaa812969 * Finegrainify namespacification 
* Add new constructors to allow insertion of terminator instructions at the
  end of basic blocks.
* Move a ReturnInst method out-of-line, so that the vtable and type info don't
  need to be emitted to every translation unit that uses the class.

llvm-svn: 10107
 2003-11-20 17:45:12 +00:00
Chris Lattner
5ac68ed1bf Don't crash if we are printing an orphaned basic block! 
llvm-svn: 10100
 2003-11-20 00:09:43 +00:00
Chris Lattner
072ae8be8f Really, there was a reason for me factoring that out 
llvm-svn: 10089
 2003-11-19 19:20:20 +00:00
Chris Lattner
54a3f2b134 *** Significantly speed up type resultion 
This change speeds up type resolution by checking to see if a type is
  recursive, and if it's not, using a more efficient algorithm.

  This dramatically reduces bytecode loading time of kc++, reducing time-to-jit
  kc++ --version to 17s from 33s

llvm-svn: 10088
 2003-11-19 19:10:23 +00:00
Chris Lattner
9ac58534a0 Finegrainify namespacification 
llvm-svn: 10080
 2003-11-19 06:14:38 +00:00
Chris Lattner
4bdd0d5d93 Fix PR130, and testcase test/Regression/Linker/2003-11-18-TypeResolution.ll 
llvm-svn: 10075
 2003-11-19 01:02:52 +00:00
Chris Lattner
7c9bfad92c Implement == and != correctly. Before they would incorrectly return != 
for some constant exprs when they could really be the same value

llvm-svn: 10058
 2003-11-17 20:19:35 +00:00
Chris Lattner
1f762c7571 The ConstantPointer class is now gone. 
llvm-svn: 10057
 2003-11-17 19:47:21 +00:00
Chris Lattner
3bbeca259c No REALLY, get rid of ConstantPointer references 
llvm-svn: 10054
 2003-11-17 19:21:04 +00:00
Chris Lattner
dc40851a23 Eliminate use of the ConstantPointer class 
llvm-svn: 10053
 2003-11-17 19:19:32 +00:00
Chris Lattner
daee0fa51f Constant folding shalt not be built on annotations 
llvm-svn: 10052
 2003-11-17 19:05:17 +00:00
Chris Lattner
31a03e3207 Be a bit more tolerant of broken code 
llvm-svn: 10050
 2003-11-17 01:17:04 +00:00
Brian Gaeke
675cab8d52 When you hand WriteAsOperand a type, it now prints out its symbolic name. 
llvm-svn: 10042
 2003-11-16 23:08:27 +00:00
Brian Gaeke
5db96ead48 When failing a Verifier assertion, use WriteAsOperand to print out the 
offending types and/or values.

llvm-svn: 10041
 2003-11-16 23:07:42 +00:00
Chris Lattner
21c40d8641 Don't print 'No predecessors!' on the entry block 
llvm-svn: 10038
 2003-11-16 22:59:57 +00:00
Chris Lattner
34b44fd809 Expose the verifier to opt 
llvm-svn: 9984
 2003-11-13 19:47:29 +00:00
Chris Lattner
e72202b5b8 Detect problems with PHI node operands! 
llvm-svn: 9916
 2003-11-12 07:13:37 +00:00
Brian Gaeke
d25f86d683 Put all LLVM code into the llvm namespace, as per bug 109. 
llvm-svn: 9903
 2003-11-11 22:41:34 +00:00
Chris Lattner
f40566184d Fix PR95. I'm checking this patch in for Reid Spencer, who figured it out 
and wrote it up.  Thanks!!

llvm-svn: 9832
 2003-11-09 19:39:48 +00:00
Chris Lattner
95e79d0097 Add an assertion 
llvm-svn: 9831
 2003-11-09 15:51:07 +00:00
Chris Lattner
352ad83271 Add support for constant expr shifts 
llvm-svn: 9735
 2003-11-05 19:53:03 +00:00
Chris Lattner
530eb1ffb5 If we're not checking, don't check! 
llvm-svn: 9732
 2003-11-05 19:09:40 +00:00
Chris Lattner
e0249593df Make code gcc 3.4 clean 
llvm-svn: 9719
 2003-11-05 05:15:42 +00:00
Chris Lattner
8a01e11594 Fix InstCombine/2003-11-03-VarargsCallBug.ll 
llvm-svn: 9681
 2003-11-03 18:44:58 +00:00
Chris Lattner
78b09155e1 Did I mention that I _HATE_ CPRs? 
llvm-svn: 9639
 2003-10-31 18:38:06 +00:00
Chris Lattner
18283ea9f0 Constant pointer refs are causing these to fail unnecessarily, which is causing 
a lot of code to be pessimized.  I hate CPRs.  :(

llvm-svn: 9635
 2003-10-31 17:51:16 +00:00
Alkis Evlogimenos
006108d3b6 Use already existing classes for post order iterator. 
llvm-svn: 9629
 2003-10-31 03:02:34 +00:00
Chris Lattner
c49a7fd37d Make use of the new AssemblyAnnotationWriter interface 
llvm-svn: 9619
 2003-10-30 23:41:03 +00:00
Alkis Evlogimenos
30f4eb0dc0 Output types in reverse postorder. This will allow the ByteCode/Reader 
to create the minimum number of opaque types for each type with a
cycle in its type graph.

llvm-svn: 9615
 2003-10-30 21:04:44 +00:00
Chris Lattner
f24ae5a0ed Print the names of more opaque types 
llvm-svn: 9598
 2003-10-30 00:22:33 +00:00
Chris Lattner
a2fcab56e3 Make sure to print opaque types names if they are available. 
llvm-svn: 9597
 2003-10-30 00:12:51 +00:00