"git@repo.hca.bsc.es:rferrer/llvm-epi-0.8.git" did not exist on "8d05ebc2f9db6260fdccc57369e29a8d64bb8443"
- Nov 15, 2011
-
-
Benjamin Kramer authored
llvm-svn: 144647
-
- Jun 16, 2011
-
-
Anna Zaks authored
Function::getNumBlockIDs() should be used instead of Function::size() to set the upper limit on the block IDs since basic blocks might get removed (simplified away) after being initially numbered. Plus the test case, in which SelectionDAGBuilder::visitBr() calls llvm::MachineFunction::removeFromMBBNumbering(), which introduces the hole in numbering leading to an assert in llc (prior to the fix). llvm-svn: 133113
-
- Apr 09, 2011
-
-
Jakob Stoklund Olesen authored
It is common for large live ranges to have few basic blocks with register uses and many live-through blocks without any uses. This approach grows the Hopfield network incrementally around the use blocks, completely avoiding checking interference for some through blocks. llvm-svn: 129188
-
- Jan 05, 2011
-
-
Jakob Stoklund Olesen authored
calculated. llvm-svn: 122912
-
- Jan 04, 2011
-
-
Jakob Stoklund Olesen authored
The analysis will be needed by both the greedy register allocator and the X86FloatingPoint pass. It only needs to be computed once when the CFG doesn't change. This pass is very fast, usually showing up as 0.0% wall time. llvm-svn: 122832
-