1. Dan Villiom Podlaski Christiansen
  2. PoolAlloc

Commits

Show all
Author Commit Message Date Builds
John T. Criswell
Reenabled and updated the code for simple pool allocation to handle the fact that LLVM 2.7 no longer has malloc and free instructions.
John T. Criswell
Taught DSA about the llvm.objectsize() intrinsic.
John T. Criswell
Modified the PoolAllocateGroup class to inherit from ModulePass, eliminating multiple inheritance in the PoolAllocate pass. This seems to fix a bizarre error where calling the getGlobalsGraph() method invoked the releaseMemory() method.
Andrew Lenharth
simplify and update callgraph after BU
Andrew Lenharth
specialize insert for other sets. MUCH FASTER
Andrew Lenharth
remove callnodes condition implemented for partial-knowledge inlining. Also add some stats to see if the results are believable
Andrew Lenharth
do something with inline asm
Andrew Lenharth
Forgot this
Andrew Lenharth
calls sites that will never contain useful information are not added
Andrew Lenharth
Use generic EquivalenceClass to store SCCs and clean up the mess that was DSSCCGraph
Andrew Lenharth
fix includes
Andrew Lenharth
split key iterator into seperate file
Andrew Lenharth
remove the dir properly this time
Andrew Lenharth
move headers and rename sv::set
Andrew Lenharth
Precompute SCCs and callgraphs inline everything in the precomputed SCC todo: don't remove unresolved callsites
Andrew Lenharth
avoid uninitialized access
John T. Criswell
Ensure that the DenseSet class is defined before using it.
John T. Criswell
Removed incomplete command-line options that break compilation.
John T. Criswell
Switched to using stdint.h instead of LLVM's DataTypes.h header file. The DataTypes.h header files was removed from LLVM 2.7.
John T. Criswell
Switched from using the old LLVM 2.6 llvm/ADT/iterator.h header file to directly defining our iterator class in terms of the standard C++ iterator class. This change was modeled on how llvm/ADT/iterator.h defined forward_iterator. This fixes some compilation problems with LLVM 2.7 (which eliminated the forward_iterator class).
Andrew Lenharth
Split out the callgraph and seperate DSGraph's impl from the big mess of stuff
Andrew Lenharth
Hold types in global uniqued sets, saves memory and time (despite being inefficient) Use sorted vector sets some places to save memory and time.
Andrew Lenharth
helper ADTs for sorted vectors and stable sets of sets
Andrew Lenharth
Handle aliases as normal variables
Andrew Lenharth
Keep poolalloc compiling, but it is broken. The FIXME for the dsa type changes need to be dealt with The malloc/free situation needs to be dealt with.
Andrew Lenharth
Add byte offset based sets of types Add byte offset links add multiple entry points, WIP get rid of stl/ext hash_ fix graph printer api update to 2.7 handle malloc, sometimes (TODO: free, generalized allocator framework) remove cruft factor common operations out
Andrew Lenharth
Update readme with known issues
Andrew Lenharth
A file to pull to link dsa into a tool
Andrew Lenharth
Drop hash_ usage, move to std for now, will move to llvm hash soon. update to 2.7 api (breaks poolalloc). Support multiple entry points
Andrew Lenharth
update to 2.7 API
  1. Prev
  2. Next