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
10,232 Commits 4 Branches 5 Tags 704 MiB
c9900e2eb3
Commit Graph

5306 Commits

Author SHA1 Message Date
Chris Lattner
92211eb77d Generate ftst instructions for comparison against zero 
llvm-svn: 11098
 2004-02-03 18:54:04 +00:00
Chris Lattner
7b6e8f1f70 Add the ftst instruction 
llvm-svn: 11095
 2004-02-03 07:27:50 +00:00
Chris Lattner
8b623358ff Add support for one argument OneArgFP instructions 
llvm-svn: 11094
 2004-02-03 07:27:34 +00:00
Alkis Evlogimenos
5e78d4bd75 When an instruction like: A += B had both A and B virtual registers 
spilled, A was loaded from its stack location twice. This fixes the bug.

llvm-svn: 11093
 2004-02-03 01:13:07 +00:00
Alkis Evlogimenos
e128cb3295 Revert changes. Will implement this using a different set of primitives 
llvm-svn: 11091
 2004-02-02 23:08:58 +00:00
Alkis Evlogimenos
a4fab12df8 Fix debugging output. 
llvm-svn: 11088
 2004-02-02 22:00:32 +00:00
Alkis Evlogimenos
3f268a9996 Correctly update def/use information for modified machine operands. 
llvm-svn: 11087
 2004-02-02 21:56:40 +00:00
Alkis Evlogimenos
dfef24298e Should be more careful. The previously applied change made all counts 
outside of loops = 0.

llvm-svn: 11085
 2004-02-02 20:29:57 +00:00
Chris Lattner
0e438dc219 Floating point negates are -0.0 - X, not 0.0 - X 
llvm-svn: 11084
 2004-02-02 20:21:29 +00:00
Chris Lattner
f2a481f7f8 Disable (x - (y - z)) => (x + (z - y)) optimization for floating point. 
llvm-svn: 11083
 2004-02-02 20:09:56 +00:00
Chris Lattner
343ab20a2d Update comment 
llvm-svn: 11082
 2004-02-02 20:09:22 +00:00
Chris Lattner
06f08a26ac No need to declare implicit uses/defs of ST0 
llvm-svn: 11081
 2004-02-02 19:57:45 +00:00
Brian Gaeke
1aa59f5107 Make deadarghaX0r warning louder. 
(I just love typing haX0r.   haX0r haX0r haX0r.)

llvm-svn: 11079
 2004-02-02 19:32:27 +00:00
Chris Lattner
71c12c8e0d Generate the fchs instruction to negate a floating point number 
llvm-svn: 11078
 2004-02-02 19:31:38 +00:00
Chris Lattner
36367e8c90 Add support for OneArgFPRW instructions, fix a couple of typeos 
llvm-svn: 11077
 2004-02-02 19:23:15 +00:00
Brian Gaeke
355bc299b7 Include PowerPC.h. Flesh out the stub versions of addPassesToEmitAssembly() 
and addPassesToJITCompile() slightly.

llvm-svn: 11076
 2004-02-02 19:06:36 +00:00
Brian Gaeke
24f70fa16d Add comments describing how you would add prototypes for factory methods for 
PowerPC-specific passes here.

llvm-svn: 11073
 2004-02-02 19:05:28 +00:00
Chris Lattner
963082346c Codegen -0.0 correctly. Do not use fldz! This is another -0.0 == +0.0 problem, arg. 
llvm-svn: 11070
 2004-02-02 18:56:30 +00:00
Alkis Evlogimenos
1825f30a3a Create an object for tracking physical register usage. This will look 
much better when I get rid of the reserved registers.

llvm-svn: 11066
 2004-02-02 07:30:36 +00:00
Chris Lattner
a61cda01c2 Second half of a fix for PR218 & test/Regression/Assembler/2004-02-01-NegativeZero.llx. 
Basically we store floating point values as their integral components, instead of relying
on the semantics of floating point < to differentiate between values.  This is likely to
make the map search be faster anyway.

llvm-svn: 11064
 2004-02-01 22:49:04 +00:00
Alkis Evlogimenos
586dc51262 Change weight array into a vector and make it as big as the number of 
registers (not as the max number of registers).

Change toSpill from a std::set into a std::vector<bool>.

Use the reverse iterator adapter to do a reverse scan of allocatable
registers.

llvm-svn: 11061
 2004-02-01 20:13:26 +00:00
Alkis Evlogimenos
b2ea4389ca Use std::map::count() instead of std::map::find() != std::map::end() 
where appropriate.

llvm-svn: 11060
 2004-02-01 18:39:53 +00:00
Alkis Evlogimenos
eabb1b1bfa Change string for joined intervals. 
llvm-svn: 11057
 2004-02-01 16:13:05 +00:00
Alkis Evlogimenos
3c94357980 FpMOV is also a move instruction. 
llvm-svn: 11055
 2004-02-01 08:22:16 +00:00
Alkis Evlogimenos
e9d1aa31fc Change xor to ^. 
llvm-svn: 11054
 2004-02-01 08:19:25 +00:00
Chris Lattner
824015593c Disable tail duplication in any "hard" cases, where it might break SSA form. 
llvm-svn: 11052
 2004-02-01 06:32:28 +00:00
Chris Lattner
2e497b5e42 Fix a bug in a recent checkin 
llvm-svn: 11050
 2004-02-01 05:25:07 +00:00
Chris Lattner
3575c84933 Fix the count of the number of instructions removed 
llvm-svn: 11049
 2004-02-01 05:15:07 +00:00
Alkis Evlogimenos
107cf3892c Missed one silly assert :-) 
llvm-svn: 11048
 2004-02-01 02:21:31 +00:00
Alkis Evlogimenos
a7459c76aa Simplify joinIntervals() code. 
llvm-svn: 11047
 2004-02-01 02:18:31 +00:00
Chris Lattner
3818f475de Remove all of the annoying statistics now that I'm finished (for the near 
term) working on bytecode size stuff.

llvm-svn: 11046
 2004-02-01 01:50:31 +00:00
Alkis Evlogimenos
612a35f2a4 Use MRegisterInfo::isPhysicalRegister and 
MRegisterInfo::isVirtualRegister.

llvm-svn: 11045
 2004-02-01 01:27:01 +00:00
Chris Lattner
831561989c Fix a crasher bug in my constant folding rewrite 
llvm-svn: 11044
 2004-02-01 01:23:19 +00:00
Chris Lattner
becd58c6cb Print an error message if we can't materialize the bytecode file 
llvm-svn: 11043
 2004-02-01 01:07:25 +00:00
Chris Lattner
c76f82c957 Print an error message if there is an error materialize the bc file. 
llvm-svn: 11041
 2004-02-01 00:32:35 +00:00
Alkis Evlogimenos
9559cebebf Apply final part of Chris' patch. 
llvm-svn: 11040
 2004-01-31 23:48:47 +00:00
Alkis Evlogimenos
656870703f Be a little smarter on the way we handle physical register defs. 
llvm-svn: 11038
 2004-01-31 23:13:30 +00:00
Chris Lattner
0ea56952d4 Finegrainify namespacification, use new MRegisterInfo::isVirtualRegister 
method

llvm-svn: 11037
 2004-01-31 21:27:19 +00:00
Chris Lattner
bff56dc518 Fix, correctly this time, the computation of the return value 
Fix a spello
Tighten up the assertion checking

No functionality changes.

llvm-svn: 11036
 2004-01-31 21:21:43 +00:00
Chris Lattner
05b7fef02f * Fix incorrect computation of the runOnMachineFunction return value 
* Turn a bunch of instance variables into automatic variables

llvm-svn: 11035
 2004-01-31 21:14:04 +00:00
Chris Lattner
b0addcc1b0 Remove unneeded #includes 
Move Passes.h (which defines the interface to this file) to the top.
Move statistics to the top of the file.
Add a comment

llvm-svn: 11034
 2004-01-31 21:07:15 +00:00
Chris Lattner
89f03df701 Avoid referencing deleted DSgraphs when merging an SCC into a larger SCC. This 
fixes the crash in 176.gcc.

llvm-svn: 11033
 2004-01-31 21:02:18 +00:00
Alkis Evlogimenos
d1ec5f36ee Merge safe parts from last night's buggy commit. These do not break 
any test cases :-)

llvm-svn: 11032
 2004-01-31 19:59:32 +00:00
Alkis Evlogimenos
ef63827238 Optimize liveAt() and overlaps(). We now use a binary search instead 
of a linear search to find the first range for comparisons. This cuts
down the linear scan register allocator running time by a factor of 3
in 254.perlbmk and by a factor of 2.2 in 176.gcc.

llvm-svn: 11030
 2004-01-31 16:54:54 +00:00
Alkis Evlogimenos
b9df133d67 Revert last night's changes as they broke some tests. Will remerge parts of the patch. 
llvm-svn: 11029
 2004-01-31 14:37:41 +00:00
Alkis Evlogimenos
c0db519832 Several performance enhancements and cleanups from Chris. 
Simplification of LiveIntervals::Interval::overlaps() and addition of
examples to overlaps() and liveAt() to make them clearer.

llvm-svn: 11028
 2004-01-31 04:56:07 +00:00
Chris Lattner
a497e3d6e1 Fix thinko 
llvm-svn: 11027
 2004-01-30 22:48:02 +00:00
Chris Lattner
f5b5d1f2f8 Add some comments sketching out how this is to work eventually. 
llvm-svn: 11026
 2004-01-30 22:25:18 +00:00
Chris Lattner
543fbaa973 Add a new flag, which is only used for symmetry. 
llvm-svn: 11025
 2004-01-30 22:24:18 +00:00
Chris Lattner
0127841d4e Forward method request to chained aa implementation 
llvm-svn: 11024
 2004-01-30 22:20:55 +00:00
Chris Lattner
8bcdaf9b5d Implement the pointsToConstantMemory() method. 
llvm-svn: 11022
 2004-01-30 22:17:24 +00:00
Chris Lattner
71d05cef5e Improve mod/ref information based on the pointsToConstantMemory method. 
llvm-svn: 11021
 2004-01-30 22:16:42 +00:00
Chris Lattner
6f4945b965 Add (currently disabled) support to the instruction selector to only insert 
FP_REG_KILL instructions at the end of blocks involved with critical edges.

Fix a bug where FP_REG_KILL instructions weren't inserted in fall through
unconditional branches.  Perhaps this will fix some linscan problems?

llvm-svn: 11019
 2004-01-30 22:13:44 +00:00
Chris Lattner
32ec75c4ef Finegrainify namespacification 
Implement LiveVariables::getIndexMachineBasicBlock

llvm-svn: 11018
 2004-01-30 22:08:53 +00:00
Brian Gaeke
9cf840250b Give clients of MachineFunctionPrinter the ability to specify a banner and 
choose an ostream.

llvm-svn: 11016
 2004-01-30 21:53:46 +00:00
Misha Brukman
440d62207c Order #includes alphabetically, per style guide. 
llvm-svn: 11015
 2004-01-30 17:26:24 +00:00
Chris Lattner
dfa4f14e34 Fix a bug aflicting 265.gap 
llvm-svn: 11006
 2004-01-29 08:36:22 +00:00
Chris Lattner
caecd769c4 Minor bugfixes 
llvm-svn: 11005
 2004-01-29 03:32:15 +00:00
Misha Brukman
6d62b1ee69 Hyphenate `target-dependent' 
llvm-svn: 11003
 2004-01-28 20:43:01 +00:00
Brian Gaeke
923ff046c0 Add a new (static inline) std::ostream& << AllocInfo& method. Use it. 
llvm-svn: 11002
 2004-01-28 19:05:43 +00:00
Chris Lattner
7ab2349541 Rename DSGraph::ScalarMapTy -> DSScalarMap 
llvm-svn: 11001
 2004-01-28 09:15:42 +00:00
Chris Lattner
9a79b1690c Fix a bug 
llvm-svn: 11000
 2004-01-28 03:31:34 +00:00
Chris Lattner
8324e48b84 Eliminate the call to removeTriviallyDeadNodes from updateFromGlobals graph, 
moving it to the start of removeDeadNodes.  This speeds up DSA by 2s on perlbmk
from 41s

llvm-svn: 10999
 2004-01-28 03:24:41 +00:00
Chris Lattner
92eb91ed70 In the TD pass, iterate over globals directly instead of through the whole scalar 
map.  This saves 5s in the TD pass, from 22->17s on perlbmk

llvm-svn: 10998
 2004-01-28 03:12:48 +00:00
Chris Lattner
c25a7dad97 In the TD pass, don't iterate over the scalar map to find the globals, iterate over 
the globals directly.  This doesn't save any substantial time, however, because the
globals graph only contains globals!

llvm-svn: 10997
 2004-01-28 03:07:30 +00:00
Chris Lattner
394c9343b4 In updateFromGlobalsGraph, instead of iterating over all of the scalars in the 
function to find the globals, iterate over all of the globals directly.  This
speeds the function up from 14s to 6.3s on perlbmk, reducing DSA time from
53->46s.

llvm-svn: 10996
 2004-01-28 03:03:06 +00:00
Chris Lattner
528f5842dd Minor tweaks, eliminate useless integer pruning optimziation, turn on 
timers by default

llvm-svn: 10993
 2004-01-28 02:41:32 +00:00
Chris Lattner
18e0615a69 Further reduce the number of nodes cloned with getClonedNH, using merge instead. 
This reduces the number of nodes allocated, then immediately merged and DNE'd
from 2193852 to 1298049.  unfortunately this only speeds DSA up by ~1.5s (of
53s), because it's spending most of its time waddling through the scalar map :(

llvm-svn: 10992
 2004-01-28 02:11:49 +00:00
Chris Lattner
6d38674f7b Add a timer, fix a minor bug. 
Also, use RC::merge when possible, reducing the number of nodes allocated, then immediately merged away from 2985444 to 2193852 on perlbmk.

llvm-svn: 10991
 2004-01-28 02:05:05 +00:00
Chris Lattner
10881df6e2 Another bugfix, disable "spurious" output. 
You gotta love spurious

llvm-svn: 10990
 2004-01-28 01:19:52 +00:00
Chris Lattner
b0d7b564dd fix bug in previous checkin 
llvm-svn: 10989
 2004-01-27 22:54:56 +00:00
Chris Lattner
3bd20c5114 * Add a new commandline argument to control the "global roots hack". Default 
it to be off.  If it looks like it's completely unnecessary after testing, I
  will remove it completely (which is the hope).
* Callers of the DSNode "copy ctor" can not choose to not copy links.
* Make node collapsing not create a garbage node in some cases, avoiding a
  memory allocation, and a subsequent DNE.
* When merging types, allow two functions of different types to be merged
  without collapsing.
* Use DSNodeHandle::isNull more often instead of DSNodeHandle::getNode() == 0,
  as it is much more efficient.
*** Implement the new, more efficient reachability cloner class
    In addition to only cloning nodes that are reachable from interesting
    roots, this also fixes the huge inefficiency we had where we cloned lots
    of nodes, only to merge them away immediately after they were cloned.
    Now we only actually allocate a node if there isn't one to merge it into.
* Eliminate the now-obsolete cloneReachable* and clonePartiallyInto methods
* Rewrite updateFromGlobalsGraph to use the reachability cloner
* Rewrite mergeInGraph to use the reachability cloner
* Disable the scalar map scanning code in removeTriviallyDeadNodes.  In large
  SCC's, this is extremely expensive.  We need a better data structure for the
  scalar map, because we really want to scan the unique node handles, not ALL
  of the scalars.
* Remove the incorrect SANER_CODE_FOR_CHECKING_IF_ALL_REFERRERS_ARE_FROM_SCALARMAP code.
* Move the code for eliminating integer nodes from the trivially dead
  eliminator to the dead node eliminator.
* removeDeadNodes no longer uses removeTriviallyDeadNodes, as it contains a
  superset of the node removal power.
* Only futz around with the globals graph in removeDeadNodes if it is modified

llvm-svn: 10987
 2004-01-27 22:03:40 +00:00
Chris Lattner
727e11ac33 Rewrite to use the reachability cloner interface. Also, make this much more 
efficient in the case where a function calls into the same graph multiple times
(ie, it either contains multiple calls to the same function, or multiple calls
to functions in the same SCC graph)

llvm-svn: 10986
 2004-01-27 21:53:14 +00:00
Chris Lattner
25f95d2b7c minor cleanups 
llvm-svn: 10985
 2004-01-27 21:51:19 +00:00
Chris Lattner
9117f221b1 Get clone flags right, so we don't build InlinedGlobals only to clear them 
llvm-svn: 10984
 2004-01-27 21:50:41 +00:00
John Criswell
3a994220ad Fixes for PR214. Use the SHLIBEXT variable instead of hardcoding .so into 
every file.

llvm-svn: 10976
 2004-01-26 20:59:41 +00:00
Alkis Evlogimenos
2a8df1739b Fix failing test cases with joined live intervals. It turns out that 
when joining we need to check if we overlap with the second interval
or any of its aliases.

Also make joining intervals the default.

llvm-svn: 10973
 2004-01-23 13:37:51 +00:00
Brian Gaeke
bc72431950 Add the JITInfo object, accessor & initializer. 
llvm-svn: 10972
 2004-01-23 06:39:30 +00:00
Brian Gaeke
2757ec5b94 Add CodeEmitter and JITInfo stubs. Dump the old 
PowerPCTargetMachine::addPassesToJITCompile() method, in favor of the
TargetJITInfo interface.

llvm-svn: 10971
 2004-01-23 06:35:43 +00:00
Chris Lattner
6d2f67adb3 Initial support for implementing clonePartiallyInto in terms of cloneReachableSubgraph, though this support is currently disabled. 
llvm-svn: 10970
 2004-01-23 01:44:53 +00:00
Chris Lattner
317a6fec82 Fix a problem brian ran into with the bytecode reader asserting. It turns 
out that the problem was actually the writer writing out a 'null' value
because it didn't normalize it.  This fixes:
test/Regression/Assembler/2004-01-22-FloatNormalization.ll

llvm-svn: 10967
 2004-01-23 00:55:21 +00:00
Alkis Evlogimenos
b4745bda05 Add option to join live intervals. Two intervals are joined if there 
is a move between two registers, at least one of the registers is
virtual and the two live intervals do not overlap.

This results in about 40% reduction in intervals, 30% decrease in the
register allocators running time and a 20% increase in peephole
optimizations (mainly move eliminations).

The option can be enabled by passing -join-liveintervals where
appropriate.

llvm-svn: 10965
 2004-01-22 23:08:45 +00:00
Alkis Evlogimenos
8d8c76a064 Remove unneeded check. An interval in active, by definition overlaps 
with the current one.

llvm-svn: 10959
 2004-01-22 20:07:18 +00:00
Alkis Evlogimenos
abdbf4a288 Improve debugging output. Remove unneeded virtReg->0 mapping when 
virtReg lives on the stack. Now a virtual register has an entry in the
virtual->physical map or the virtual->stack slot map but never in
both.

llvm-svn: 10958
 2004-01-22 19:24:43 +00:00
Alkis Evlogimenos
a1bb8618c3 Revert previous change. The code was correct... 
llvm-svn: 10957
 2004-01-22 19:17:52 +00:00
Alkis Evlogimenos
448e6f3353 Fix incorrect negatives in LiveIntervals::Interval::liveAt(). 
llvm-svn: 10956
 2004-01-22 18:33:50 +00:00
Chris Lattner
a72f3a387a Eliminated the CompletedNodes argument to the cloneReachable* methods. This 
map was only used to implement a marginal GlobalsGraph optimization, and it
actually slows the analysis down (due to the overhead of keeping it), so just
eliminate it entirely.

llvm-svn: 10955
 2004-01-22 16:56:13 +00:00
Chris Lattner
50e765d1a2 Ok, I'm tired of pulling out all my timers to check stuff in, just do it. 
llvm-svn: 10954
 2004-01-22 16:36:28 +00:00
Chris Lattner
da04e4d383 Bug fix: X.mergeWith(Y) was not updating Y if Y was a null node handle! 
llvm-svn: 10953
 2004-01-22 16:31:08 +00:00
Chris Lattner
07d45564d0 Start implementing DSGraph::clonePartiallyInto and implement mergeInGraph 
in terms of it.

Though clonePartiallyInto is not cloning partial graphs yet, this change
dramatically speeds up inlining of graphs with many scalars.  For example,
this change speeds up the BU pass on 253.perlbmk from 69s to 36s, because
it avoids iteration over the scalar map, which can get pretty large.

llvm-svn: 10951
 2004-01-22 15:30:58 +00:00
Chris Lattner
961cc51cf1 Allow disabling of ALL printing overhead when performing timings 
llvm-svn: 10948
 2004-01-22 13:42:43 +00:00
Misha Brukman
5723c64d9a Implement ModuleProvider::materializeModule() by only materializing functions 
that are still left in the lazy reader map.

llvm-svn: 10944
 2004-01-21 22:55:34 +00:00
Misha Brukman
87ca68c2ff Let subclasses implement ModuleProvider::materializeModule() which is based on 
their implementation of book-keeping for which functions need to be materialized
and which don't.

llvm-svn: 10943
 2004-01-21 22:54:50 +00:00
Brian Gaeke
b31ce9f568 Build the PowerPC directory, so it is less likely to bit-rot (again) 
llvm-svn: 10938
 2004-01-21 21:16:10 +00:00
Brian Gaeke
764f1b476a Import of skeletal PowerPC backend I have had laying around for months... 
llvm-svn: 10937
 2004-01-21 21:13:19 +00:00
Chris Lattner
781ed02fce SlotCalculator.h moved 
llvm-svn: 10931
 2004-01-20 19:50:34 +00:00
Chris Lattner
858d41f7d4 Fix PR212 - Bytecode reader misreads 'long -9223372036854775808'! 
Fix testcase test/Regression/Assembler/2004-01-20-MaxLongLong.llx

llvm-svn: 10928
 2004-01-20 19:13:07 +00:00
Tanya Lattner
291f28ee4e Moved iterators around. 
llvm-svn: 10926
 2004-01-20 17:51:13 +00:00
Tanya Lattner
33079fad04 Moved iterators to common file. 
llvm-svn: 10925
 2004-01-20 17:49:42 +00:00
Chris Lattner
a509b856f9 Fix bogus warning and simplify code 
llvm-svn: 10924
 2004-01-20 17:06:29 +00:00
Chris Lattner
7f7b7be528 Major changes. Now we only compactify individual type planes if it is in 
fact "profitable" to do so.  This makes compactification "free" for small
programs (ie, it is completely disabled) and even helps large programs by
not having to encode pointless compactification planes.

On 176.gcc, this saves 50K from the bytecode file, which is, alas only
a couple percent.

This concludes my head bashing against the bytecode format, at least for
now.

llvm-svn: 10922
 2004-01-20 00:57:32 +00:00
Chris Lattner
85a8d1cc2b Bugfixes for dealing with partially compactified functions 
llvm-svn: 10920
 2004-01-20 00:54:06 +00:00
Chris Lattner
28e1981c25 Save another 30K from 176.gcc by encoding the compaction table a bit more 
intelligently.

llvm-svn: 10918
 2004-01-18 22:35:34 +00:00
Chris Lattner
e29a22a76a Remove -debug output 
llvm-svn: 10917
 2004-01-18 22:26:53 +00:00
Chris Lattner
2258355dda Add support for writing bytecode files with compactiontables for bytecode files. 
This shrinks the bytecode file for 176.gcc by about 200K (10%), and 254.gap by
about 167K, a 25% reduction.  There is still a lot of room for improvement in
the encoding of the compaction table.

llvm-svn: 10915
 2004-01-18 21:08:52 +00:00
Chris Lattner
5fc855775d Add support for reading bytecode files with compactiontables for bytecode files. 
This shrinks the bytecode file for 176.gcc by about 200K (10%), and 254.gap by
about 167K, a 25% reduction.  There is still a lot of room for improvement in
the encoding of the compaction table.

llvm-svn: 10914
 2004-01-18 21:08:15 +00:00
Chris Lattner
30009bbba7 Add support for building the compactiontable for bytecode files. This shrinks 
the bytecode file for 176.gcc by about 200K (10%), and 254.gap by about 167K,
a 25% reduction.  There is still a lot of room for improvement in the encoding
of the compaction table.

llvm-svn: 10913
 2004-01-18 21:07:07 +00:00
Chris Lattner
95c8aa8570 Eliminate special case handling for CPR's 
Fix some problem cases where I was building the slot calculator in bytecode
writer mode instead of asmwriter mode.

llvm-svn: 10911
 2004-01-18 21:03:06 +00:00
Chris Lattner
630c3ddea0 Bytecode format for LLVM 1.2 no longer explicitly encodes zeros in primitive 
type planes.  This saves about 5k on 176.gcc, and is needed for a subsequent
patch of mine I'm working on.

llvm-svn: 10908
 2004-01-17 23:25:43 +00:00
Chris Lattner
83e7633d7c This file goes away 
llvm-svn: 10905
 2004-01-17 19:35:57 +00:00
Alkis Evlogimenos
7f300c9ea6 Handle printing of intervals that are not assign to any physical 
register yet (2nd try).

llvm-svn: 10896
 2004-01-16 20:33:13 +00:00
Alkis Evlogimenos
e03ef29452 Handle printing of intervals that are not assign to any physical 
register yet.

llvm-svn: 10895
 2004-01-16 20:29:42 +00:00
Alkis Evlogimenos
38f0f867b3 Fold open interval ends handling into 
LiveIntervals::Interval::expiredAt() and simplify regalloc code.

llvm-svn: 10894
 2004-01-16 20:17:05 +00:00
Alkis Evlogimenos
ed3c0a91b0 Add asserts to previous change. 
llvm-svn: 10893
 2004-01-16 16:23:23 +00:00
Alkis Evlogimenos
61db3621bd Use a list instead of a vector to store intervals. This will be needed 
when we join intervals and one of the two will need to be removed.

llvm-svn: 10892
 2004-01-16 16:06:59 +00:00
Misha Brukman
bbc01f7b77 Use the LLVM standard name mangling infrastructure instead of reinventing the 
wheel.

llvm-svn: 10891
 2004-01-15 22:44:19 +00:00
Chris Lattner
cce1db873e If these blocks are empty, there is no reason to even emit the bytecode blocks. 
This saves about 15K in 176.gcc, coupled with another patch that I'm working on.

llvm-svn: 10889
 2004-01-15 21:06:57 +00:00
Chris Lattner
6e293222c3 Cleanups & efficiency improvements 
llvm-svn: 10888
 2004-01-15 20:24:09 +00:00
Chris Lattner
ba62115c2d The bcwriter does not want ConstantPointerRef's to be indexed, and the asmwriter never did! 
llvm-svn: 10885
 2004-01-15 18:47:15 +00:00
Chris Lattner
44232deeda ConstantPointerRef's are no longer emitted. This saves 20028 bytes in the 
bytecode files when compiling 176.gcc, but more importantly will make it
easier to eliminate CPR's in the future (no new .bc revision will be
required to support them)

llvm-svn: 10884
 2004-01-15 18:46:56 +00:00
Chris Lattner
844284aabe Allow bytecode files to refer directly to global values as constants, instead 
of forcing them to go through ConstantPointerRef's.  This allows bytecode
files to mirror .ll files, allows more efficient encoding, and makes it easier
to eventually eliminate CPR's.

llvm-svn: 10883
 2004-01-15 18:45:25 +00:00
Chris Lattner
5aea209da6 Fix more breakage with string change. 
llvm-svn: 10882
 2004-01-15 18:39:06 +00:00
Brian Gaeke
1459ac52af Include TargetRegInfo.h and declare SparcTargetMachine forward, to make this 
header more easily includable.

llvm-svn: 10880
 2004-01-15 18:17:07 +00:00
Brian Gaeke
13203c0416 Make this assertion more self-explanatory. 
llvm-svn: 10879
 2004-01-15 18:15:58 +00:00
Chris Lattner
04fe1058c2 Fix PR73: bytecode format inconsistent 
llvm-svn: 10876
 2004-01-15 17:55:09 +00:00
Chris Lattner
921cc4fd17 Fix PR73 
llvm-svn: 10875
 2004-01-15 17:55:01 +00:00
Chris Lattner
91f2cd914c Fix brokenness in my last checking 
llvm-svn: 10874
 2004-01-15 16:56:15 +00:00
Chris Lattner
ed98fd7216 Change all of the bytecode reader primitives to throw exceptions instead of 
returning error codes.  Because they don't return an error code, they can
return the value read, which simplifies the code and makes the reader more
efficient (yaay!).

Also eliminate the special case code for little endian machines.

llvm-svn: 10871
 2004-01-15 06:13:09 +00:00
Chris Lattner
4d2cf11dbb Remove the optimization that depends on ENDIAN_LITTLE: it's not worth it. 
llvm-svn: 10870
 2004-01-15 06:11:30 +00:00
Chris Lattner
106bba1e9b The new bytecode format supports emitting strings a special case. This is 
intended to save size (and does on small programs), but on big programs it
actually increases the size of the program slightly.  The deal is that many
functions end up using the characters that the string contained, and the
characters are no longer in the global constant table, so they have to be
emitted in function specific constant pools.

This pessimization will be fixed in subsequent patches.

llvm-svn: 10864
 2004-01-14 23:36:54 +00:00
Chris Lattner
85a0f87636 Version 1.2 now supports encoding strings as a special case, to avoid having 
to emit all of those sbyte constants.

llvm-svn: 10863
 2004-01-14 23:35:21 +00:00
Chris Lattner
e360d84c48 When emitting bytecode, handle strings specially. Do not add the characters 
that make up the strings to the slotcalculator.

llvm-svn: 10862
 2004-01-14 23:34:39 +00:00
Chris Lattner
bfd3ea609c Like output_data, it's obvious that input_data was only used with 1 character 
data.

llvm-svn: 10861
 2004-01-14 23:03:22 +00:00
Chris Lattner
6f42c62af3 "fix" a nasty race condition 
llvm-svn: 10860
 2004-01-14 21:18:03 +00:00
Chris Lattner
df58512f4d Fix some exception safety problems 
llvm-svn: 10859
 2004-01-14 20:58:17 +00:00
Chris Lattner
c33ebd6588 Hrm, apparently I missed lowering this intrinsic. :( 
llvm-svn: 10858
 2004-01-14 20:41:29 +00:00
Chris Lattner
b2f01f6c70 It is obvious that this has never been used for outputing more than a single 
byte, it's totally endian incorrect!

llvm-svn: 10857
 2004-01-14 18:50:28 +00:00
Chris Lattner
78ad123c78 Be const correct 
llvm-svn: 10856
 2004-01-14 18:41:38 +00:00
Chris Lattner
8767bd75e4 Fix bug in previous checkin: Demorgan would be ashamed of me, I need to 
lay off the crack.

llvm-svn: 10855
 2004-01-14 17:51:53 +00:00
Chris Lattner
691524bfbd Eliminate the isStringCompatible function, using ConstantArray::isString. 
It's not clear why the code was looking for signed chars < 0, but it can't
matter to the assembler anyway, so the check goes away.  This also fixes
compatibility with arrays of [us]byte that have constantexprs in them.

Also slightly restructure some code to be cleaner.

llvm-svn: 10854
 2004-01-14 17:15:17 +00:00
Chris Lattner
a14e705677 Eliminate the isStringCompatible function, using ConstantArray::isString. 
It's not clear why the code was looking for signed chars < 0, but it can't
matter to the assembler anyway, so the check goes away.

llvm-svn: 10853
 2004-01-14 17:14:42 +00:00
Chris Lattner
b57b97254b Use new method 
llvm-svn: 10852
 2004-01-14 17:07:46 +00:00
Chris Lattner
a991025919 Implement ConstantArray::isString 
llvm-svn: 10851
 2004-01-14 17:06:38 +00:00
Chris Lattner
9e65e9b460 Ok, I can't handle it. This is a temporary checkin of a ton of statistics that 
i'm using in my work to reduce the bytecode file sizes.  These will eventually
be removed.

llvm-svn: 10849
 2004-01-14 16:54:21 +00:00
Chris Lattner
238d130081 Remove support for the pre-1.0 bytecode version #1. This will become 
the bytecode revision generated by LLVM 1.2.

llvm-svn: 10848
 2004-01-14 16:44:44 +00:00
Alkis Evlogimenos
52d1db4841 Properly update #intervals statistic. 
llvm-svn: 10847
 2004-01-14 10:44:29 +00:00
Chris Lattner
f149ec635a Fix InstCombine/2004-01-13-InstCombineInvokePHI.ll, which also fixes lots 
of C++ programs in Shootout-C++, including lists1 and moments, etc

llvm-svn: 10845
 2004-01-14 06:06:08 +00:00
Brian Gaeke
7824ed3d12 Don't pass anything to the IntrinsicLowering class that is not_intrinsic, 
because that makes it abort. Also, fix a typo in a comment.

This checkin brought to you by the "It only takes about 30 seconds to run
ENABLE_LLI tests on Shootout on zion, even if they all dump core" fund.

llvm-svn: 10844
 2004-01-14 06:02:53 +00:00
Chris Lattner
13a3f4eaeb Fix check. PHI nodes must be handled specially, of course. 
llvm-svn: 10842
 2004-01-14 05:42:52 +00:00
Chris Lattner
e12d9fd9a7 Tighten up verifier checks. The result of an invoke instruction only 
dominates the normal destination, not the exceptional dest (ie, the result
of a call is undefined on an exception)

llvm-svn: 10841
 2004-01-14 04:25:59 +00:00