| Commit message (Collapse) | Author | Age | Files | Lines |
|
|
|
|
|
| |
Use the poolalloc module in CVS from now on.
llvm-svn: 7810
|
|
|
|
| |
llvm-svn: 5422
|
|
|
|
| |
llvm-svn: 4760
|
|
|
|
| |
llvm-svn: 4216
|
|
|
|
| |
llvm-svn: 4106
|
|
|
|
|
|
| |
pointer type returned.
llvm-svn: 3711
|
|
|
|
|
|
|
| |
instead of ::ID's.
- Pass::getAnalysis<> now no longer takes an optional argument
llvm-svn: 3265
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| |
* Add new RegisterOpt/RegisterAnalysis templates for registering passes that
are to show up in opt or analyze
* Register Analyses now
* Change optimizations to use RegisterOpt instead of RegisterPass
* Add support for different "PassType's"
* Add new RegisterOpt/RegisterAnalysis templates for registering passes that
are to show up in opt or analyze
* Register Analyses now
* Change optimizations to use RegisterOpt instead of RegisterPass
* Remove getPassName implementations from various subclasses
llvm-svn: 3112
|
|
|
|
| |
llvm-svn: 3075
|
|
|
|
|
|
| |
contents into IPO.h
llvm-svn: 3043
|
|
|
|
| |
llvm-svn: 3016
|
|
|
|
| |
llvm-svn: 2985
|
|
|
|
| |
llvm-svn: 2869
|
|
|
|
| |
llvm-svn: 2813
|
|
|
|
| |
llvm-svn: 2792
|
|
|
|
|
|
| |
For details, See: docs/2002-06-25-MegaPatchInfo.txt
llvm-svn: 2778
|
|
|
|
|
|
| |
the Scalar and Utils subdirectories
llvm-svn: 2523
|
|
|
|
|
|
| |
them.
llvm-svn: 2430
|
|
|
|
| |
llvm-svn: 2397
|
|
|
|
|
|
| |
to make debugging output a lot nicer.
llvm-svn: 2395
|
|
|
|
| |
llvm-svn: 2378
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| |
- Rename runOnMethod to runOnFunction
* Transform getAnalysisUsageInfo into getAnalysisUsage
- Method is now const
- It now takes one AnalysisUsage object to fill in instead of 3 vectors
to fill in
- Pass's now specify which other passes they _preserve_ not which ones
they modify (be conservative!)
- A pass can specify that it preserves all analyses (because it never
modifies the underlying program)
* s/Method/Function/g in other random places as well
llvm-svn: 2333
|
|
|
|
|
|
| |
* Add support for pool allocating array allocations of varying size
llvm-svn: 2329
|
|
|
|
| |
llvm-svn: 2307
|
|
|
|
| |
llvm-svn: 2282
|
|
|
|
|
|
| |
obviously duplicate loads of the pool base.
llvm-svn: 2255
|
|
|
|
| |
llvm-svn: 2247
|
|
|
|
|
|
|
|
| |
* Build new datatypes correctly
* Transform instructions that return null pointers from functions to return
a null index.
llvm-svn: 2244
|
|
|
|
|
|
| |
* Fill in the pool descriptor links in the pool descriptors.
llvm-svn: 2239
|
|
|
|
|
|
|
|
| |
* Handle more complex structure so that power works almost
* Fix bug with pooldestroy call where we passed in the size of the object
instead of the pool to destroy. bisort is now pool allocated successfully!
llvm-svn: 2238
|
|
|
|
|
|
| |
This now works with treeadd at least, and perhaps other programs as well.
llvm-svn: 2233
|
|
|
|
|
|
| |
be 'Argument' instead of FunctionArgument.
llvm-svn: 2216
|
|
|
|
| |
llvm-svn: 2207
|
|
|
|
| |
llvm-svn: 2087
|
|
|
|
| |
llvm-svn: 2086
|
|
|
|
| |
llvm-svn: 2066
|
|
|
|
|
|
|
|
|
|
|
| |
* Add more debugging output
* Fix problems refering to wrong versions of various graphs
* Build the pool descriptor map!
* Clear the nodemapping map after building pool descriptor to avoid assert
* Transform the NEw function body, not the old one...
* Matrix.ll now works!
llvm-svn: 2058
|
|
|
|
|
|
|
|
|
|
|
|
|
| |
* TransformFunctionInfo now has call field form field mapping. May be
removed in the future.
* Moved the computation of "Scalars" into transformFunctionBody so
transformFunction didn't have to recompute it.
* Implement the node mapping calculation in preparation to calculate
PoolDescriptors to pass to transformFunctionBody
* Print out the node mapping [it looks right!]
* Other minor changes
llvm-svn: 2056
|
|
|
|
|
|
| |
the graph can be passed around.
llvm-svn: 2053
|
|
|
|
|
|
|
|
|
|
|
| |
* Converts malloc instructions to poolalloc
* Converts free instructions to poolfree
* Convert calls to call the new cloned hacked up versions
Note that this does not modify hacked up stuff yet, just the top level
function
llvm-svn: 2052
|
|
|
|
|
|
|
|
|
| |
to modify the function next.
This also properly recycles functions so that we don't get exponential
code blowup in the common case.
llvm-svn: 2049
|
|
|
|
|
|
| |
Next step is to start hacking functions up.
llvm-svn: 2044
|
|
|
|
| |
llvm-svn: 2040
|
|
|
|
|
|
| |
destruction of the pools.
llvm-svn: 2039
|
|
|
|
| |
llvm-svn: 2031
|
|
llvm-svn: 2014
|