- Aug 11, 2006
-
-
Evan Cheng authored
llvm-svn: 29601
-
- Aug 09, 2006
-
-
Rafael Espindola authored
llvm-svn: 29589
-
Rafael Espindola authored
llvm-svn: 29583
-
Rafael Espindola authored
llvm-svn: 29580
-
- Aug 08, 2006
-
-
Rafael Espindola authored
llvm-svn: 29571
-
Rafael Espindola authored
llvm-svn: 29567
-
Chris Lattner authored
in the start of an array and a count of operands where applicable. In many cases, the number of operands is known, so this static array can be allocated on the stack, avoiding the heap. In many other cases, a SmallVector can be used, which has the same benefit in the common cases. I updated a lot of code calling getNode that takes a vector, but ran out of time. The rest of the code should be updated, and these methods should be removed. We should also do the same thing to eliminate the methods that take a vector of MVT::ValueTypes. It would be extra nice to convert the dagiselemitter to avoid creating vectors for operands when calling getTargetNode. llvm-svn: 29566
-
Chris Lattner authored
method that took std::vector<SDOperand> to take a pointer to a first operand and #operands. This speeds up isel on kc++ by about 3%. llvm-svn: 29561
-
Evan Cheng authored
selection is done. That's rather expensive especially in situations where it isn't really needed. Move back to a searching the predecessors, but make use of topological order to trim the search space. llvm-svn: 29559
-
Reid Spencer authored
to build a loadable module is now correctly defined and documented so this workaround isn't needed any longer. llvm-svn: 29553
-
Reid Spencer authored
SlowOperatingInfo, Statistics). Besides providing an example of how to use these facilities, it also serves to debug problems with runtime linking when dlopening a loadable module. These three support facilities exercise different combinations of Text/Weak Weak/Text and Text/Text linking between the executable and the module. llvm-svn: 29552
-
Reid Spencer authored
1. Change the usage of LOADABLE_MODULE so that it implies all the things necessary to make a loadable module. This reduces the user's burdern to get a loadable module correctly built. 2. Document the usage of LOADABLE_MODULE in the MakefileGuide 3. Adjust the makefile for lib/Transforms/Hello to use the new specification for building loadable modules 4. Adjust the sample project to not attempt to build a shared library for its little library. This was just wasteful and not instructive at all. llvm-svn: 29551
-
Chris Lattner authored
eliminates a bunch of std::map's in the SelectionDAG, replacing them with a home-grown hashtable. This is still a work in progress: not all the maps have been moved over and the hashtable never resizes. That said, this still speeds up llc 20% on kimwitu++ with -fast -regalloc=local using a release build. llvm-svn: 29550
-
Evan Cheng authored
llvm-svn: 29549
-
Evan Cheng authored
llvm-svn: 29546
-
Evan Cheng authored
llvm-svn: 29545
-
- Aug 07, 2006
-
-
Evan Cheng authored
llvm-svn: 29543
-
Reid Spencer authored
llvm-svn: 29541
-
Reid Spencer authored
the removal of directories. Using std::remove is indiscriminate and can lead to the removal of things like /dev/null if run as root. The Path::eraseFromDisk method ensures that we only ever remove regular files or directories, but never character or block special nodes. This should clear up the problem with usage like: llvm-as -o /dev/null which is used in the llvm-test makefiles. llvm-svn: 29540
-
Reid Spencer authored
the erasure of non-file paths like /dev/null. llvm-svn: 29539
-
- Aug 04, 2006
-
-
Reid Spencer authored
Update ltld.[ch] to version 1.5.22. Correct the notes about updating these tools (autoconf/README.TXT) Add configure options for getting the correct option for including a whole archive when linking. llvm-svn: 29529
-
Chris Lattner authored
also make it simpler. llvm-svn: 29524
-
Rafael Espindola authored
make sure only one move is used in a hello world llvm-svn: 29520
-
Rafael Espindola authored
fixes ret_null.ll and call.ll llvm-svn: 29519
-
- Aug 03, 2006
-
-
Chris Lattner authored
Transforms/SimplifyCFG/2006-08-03-Crash.ll llvm-svn: 29515
-
Jim Laskey authored
llvm-svn: 29511
-
Chris Lattner authored
llvm-svn: 29506
-
Chris Lattner authored
llvm-svn: 29505
-
Jim Laskey authored
llvm-svn: 29504
-
Rafael Espindola authored
llvm-svn: 29499
-
Chris Lattner authored
Changes: 1. Update an obsolete comment. 2. Make the sorting by base an explicit (though still N^2) step, so that the code is more clear on what it is doing. 3. Partition uses so that uses inside the loop are handled before uses outside the loop. Note that none of these changes currently changes the code inserted by LSR, but they are a stepping stone to getting there. This code is the result of some crazy pair programming with Nate. :) llvm-svn: 29493
-
Chris Lattner authored
llvm-svn: 29490
-
Chris Lattner authored
llvm-svn: 29489
-
Evan Cheng authored
llvm-svn: 29480
-
Evan Cheng authored
- Tweak implementation to avoid using std::map. llvm-svn: 29479
-
- Aug 02, 2006
-
-
Jim Laskey authored
suppressed. llvm-svn: 29477
-
Jim Laskey authored
llvm-svn: 29471
-
Evan Cheng authored
Looks like libstdc++ implementation does not scale very well. Switch back to using directly managed arrays. llvm-svn: 29469
-
Nate Begeman authored
problem. llvm-svn: 29468
-
Nate Begeman authored
llvm-svn: 29467
-