154 Commits

Author	SHA1	Message	Date
Chris Lattner	b4acba49b1	Change addRange and join to be a little bit smarter. In particular, we don't ... want to insert a new range into the middle of the vector, then delete ranges one at a time next to the inserted one as they are merged. Instead, if the inserted interval overlaps, just start merging. The only time we insert into the middle of the vector is when we don't overlap at all. Also delete blocks of live ranges if we overlap with many of them. This patch speeds up joining by .7 seconds on a large testcase, but more importantly gets all of the range adding code into addRangeFrom. llvm-svn: 15141	2004-07-23 19:38:44 +00:00
Chris Lattner	2fcc5e416d	Search by the start point, not by the whole interval. This saves some ... comparisons, reducing linscan by another .1 seconds :) llvm-svn: 15139	2004-07-23 18:40:00 +00:00
Chris Lattner	c96d299569	Instead of searching for a live interval pair, search for a location. This gives ... a very modest speedup of .3 seconds compiling 176.gcc (out of 20s). llvm-svn: 15136	2004-07-23 18:13:24 +00:00
Chris Lattner	78f62e37f3	Pull the LiveRange and LiveInterval classes out of LiveIntervals.h (which ... will soon be renamed) into their own file. The new file should not emit DEBUG output or have other side effects. The LiveInterval class also now doesn't know whether its working on registers or some other thing. In the future we will want to use the LiveInterval class and friends to do stack packing. In addition to a code simplification, this will allow us to do it more easily. llvm-svn: 15134	2004-07-23 17:49:16 +00:00