"clang/git@repo.hca.bsc.es:rferrer/llvm-epi-0.8.git" did not exist on "0ca16601290fa748148bc9cba4b63fb07157ea2d"
- May 30, 2010
-
-
Oscar Fuentes authored
llvm-svn: 105168
-
- May 26, 2010
-
-
Dan Gohman authored
implementing pop with a linear search for a "best" element. The priority queue was a neat idea, but in practice the comparison functions depend on dynamic information. llvm-svn: 104718
-
Dan Gohman authored
base class, since all the implementations are the same. llvm-svn: 104659
-
- Nov 20, 2009
-
-
David Goodwin authored
Remove some old experimental code that is no longer needed. Remove additional, speculative scheduling pass as its cost did not translate into significant performance improvement. Minor tweaks. llvm-svn: 89471
-
- Nov 12, 2009
-
-
David Goodwin authored
llvm-svn: 87015
-
- Nov 03, 2009
-
-
David Goodwin authored
Do a scheduling pass ignoring anti-dependencies to identify candidate registers that should be renamed. llvm-svn: 85939
-
- Dec 16, 2008
-
-
Dan Gohman authored
especially in the case of addresses computed from loop induction variables. llvm-svn: 61075
-
Dan Gohman authored
computation code. Also, avoid adding output-depenency edges when both defs are dead, which frequently happens with EFLAGS defs. Compute Depth and Height lazily, and always in terms of edge latency values. For the schedulers that don't care about latency, edge latencies are set to 1. Eliminate Cycle and CycleBound, and LatencyPriorityQueue's Latencies array. These are all subsumed by the Depth and Height fields. llvm-svn: 61073
-
- Dec 10, 2008
-
-
Dan Gohman authored
node latencies. Use CalcLatency instead of manual code in CalculatePriorities to keep it consistent. Previously it computed slightly different results. llvm-svn: 60817
-
- Dec 09, 2008
-
-
Dan Gohman authored
The Cost field is removed. It was only being used in a very limited way, to indicate when the scheduler should attempt to protect a live register, and it isn't really needed to do that. If we ever want the scheduler to start inserting copies in non-prohibitive situations, we'll have to rethink some things anyway. A Latency field is added. Instead of giving each node a single fixed latency, each edge can have its own latency. This will eventually be used to model various micro-architecture properties more accurately. The PointerIntPair class and an internal union are now used, which reduce the overall size. llvm-svn: 60806
-
Dan Gohman authored
pipeline model. llvm-svn: 60733
-
- Nov 20, 2008
-
-
Dan Gohman authored
is currently off by default, and can be enabled with -disable-post-RA-scheduler=false. This doesn't have a significant impact on most code yet because it doesn't yet do anything to address anti-dependencies and it doesn't attempt to disambiguate memory references. Also, several popular targets don't have pipeline descriptions yet. The majority of the changes here are splitting the SelectionDAG-specific code out of ScheduleDAG, so that ScheduleDAG can be moved to libLLVMCodeGen.a. The interface between ScheduleDAG-using code and the rest of the scheduling code is somewhat rough and will evolve. llvm-svn: 59676
-
- Nov 17, 2008
-
-
Dan Gohman authored
llvm-svn: 59445
-
- Nov 15, 2008
-
-
Dan Gohman authored
llvm-svn: 59340
-