| Commit message (Expand) | Author | Age | Files | Lines |
|---|
| * | *** empty log message *** | Chris Lattner | 2002-07-23 | 1 | -2/+1 |
| * | Always create a shadow node for a store instruction, even if it's storing | Chris Lattner | 2002-07-22 | 1 | -3/+3 |
| * | Ignore some common varargs functions. | Chris Lattner | 2002-07-19 | 1 | -0/+6 |
| * | * Inline CopyFunctionCallsList | Chris Lattner | 2002-07-18 | 1 | -35/+88 |
| * | Rename removeDeadNodes to removeTriviallyDeadNodes | Chris Lattner | 2002-07-18 | 1 | -1/+3 |
| * | Add support for a top-down propagation pass: | Vikram S. Adve | 2002-07-18 | 1 | -6/+13 |
| * | Add support for a top-down propagation pass. | Vikram S. Adve | 2002-07-18 | 1 | -17/+39 |
| * | Implement cast nodes correctly. | Chris Lattner | 2002-07-18 | 2 | -14/+19 |
| * | The graph is more accurate when I don't completely ignore the return value. | Chris Lattner | 2002-07-18 | 1 | -0/+3 |
| * | Lots of bug fixes, add BottomUpClosure, which has bugs, but is a start. | Chris Lattner | 2002-07-18 | 4 | -71/+482 |
| * | added std:: to string | Anand Shukla | 2002-07-16 | 1 | -4/+4 |
| * | * Pass the DSGraph around instead of the Function to printing fns | Chris Lattner | 2002-07-11 | 1 | -16/+26 |
| * | * Nodes now keep track of any global variables in them | Chris Lattner | 2002-07-11 | 1 | -0/+15 |
| * | * Nodes now keep track of any global variables in them | Chris Lattner | 2002-07-11 | 1 | -17/+35 |
| * | New implementation of data structure analysis. Only local analysis has been | Chris Lattner | 2002-07-10 | 3 | -130/+531 |
| * | Reimplement data structure analysis | Chris Lattner | 2002-07-10 | 5 | -1601/+0 |
| * | Fix anand's last checkin | Chris Lattner | 2002-06-30 | 6 | -47/+43 |
| * | changes to make it compatible with 64bit gcc | Anand Shukla | 2002-06-25 | 1 | -15/+15 |
| * | changes to make it compatible with 64bit gcc | Anand Shukla | 2002-06-25 | 5 | -64/+75 |
| * | *** empty log message *** | Chris Lattner | 2002-06-25 | 4 | -86/+80 |
| * | Split ConstantVals.h into Constant.h and Constants.h | Chris Lattner | 2002-04-28 | 1 | -1/+1 |
| * | Fix signed/unsigned comparison warning | Chris Lattner | 2002-04-28 | 1 | -1/+1 |
| * | Add support for tracking array allocations | Chris Lattner | 2002-04-27 | 2 | -2/+13 |
| * | Allow the inline limit to be modified on the commandline for debugging | Chris Lattner | 2002-04-27 | 1 | -1/+6 |
| * | Print argument scalars as ellipses instead of boxes | Chris Lattner | 2002-04-18 | 1 | -1/+2 |
| * | Inline indirect function calls that are only capable of calling one function | Chris Lattner | 2002-04-17 | 2 | -10/+13 |
| * | Make data structure acurately get ALL edges, even loads of null fields of | Chris Lattner | 2002-04-17 | 3 | -29/+30 |
| * | * Remove the concept of a critical shadow node | Chris Lattner | 2002-04-16 | 5 | -55/+79 |
| * | * Eliminate ArgDSNode's completely, now rely on scalar map | Chris Lattner | 2002-04-16 | 5 | -100/+94 |
| * | Move FunctionArgument out of iOther.h into Argument.h and rename class to | Chris Lattner | 2002-04-09 | 2 | -9/+12 |
| * | Add explicit #includes of Function.h to make up for the removed #include | Chris Lattner | 2002-04-09 | 1 | -0/+1 |
| * | Add #includes to make up for #includes pruned out of header files. | Chris Lattner | 2002-04-09 | 1 | -0/+2 |
| * | Play around with #includes | Chris Lattner | 2002-04-08 | 2 | -4/+1 |
| * | Call nodes are never equivalent | Chris Lattner | 2002-04-04 | 1 | -3/+4 |
| * | Add hack to get timing of analysis | Chris Lattner | 2002-04-04 | 1 | -0/+23 |
| * | * Eliminate commented out code | Chris Lattner | 2002-04-04 | 1 | -10/+4 |
| * | Support resolving function arguments/return values to pointers that index | Chris Lattner | 2002-04-01 | 1 | -5/+15 |
| * | Avoid incorrectly adding null values to the scalar map! | Chris Lattner | 2002-04-01 | 1 | -0/+1 |
| * | Critical shadow nodes no do not know their parent explictly. | Chris Lattner | 2002-04-01 | 1 | -4/+2 |
| * | Minor cleanups (use dyn_cast instead of testing manually) | Chris Lattner | 2002-04-01 | 1 | -6/+7 |
| * | Allow merging of identical call nodes. Make the shadow node pointed to | Chris Lattner | 2002-04-01 | 1 | -4/+18 |
| * | Increase limit for perimeter | Chris Lattner | 2002-04-01 | 1 | -1/+1 |
| * | Unify the destruction code used for node pairs vs normal nodes. This was | Chris Lattner | 2002-03-31 | 1 | -35/+36 |
| * | * Move the isEquivalentTo implementations here. They can probably be put | Chris Lattner | 2002-03-31 | 1 | -1/+39 |
| * | Print out the instruction instead of just the address! | Chris Lattner | 2002-03-31 | 1 | -1/+3 |
| * | * Move isEquivalentTo implementations to NodeImpl | Chris Lattner | 2002-03-31 | 1 | -56/+91 |
| * | * Convert CallMap to be a vector, because the keys can change, and the map | Chris Lattner | 2002-03-31 | 1 | -8/+45 |
| * | Implement getEscapingAllocations & getNonEscapingAllocations | Chris Lattner | 2002-03-28 | 1 | -24/+61 |
| * | * Rename UnlinkUndistinguishableShadowNodes & RemoveUnreachableShadowNodes | Chris Lattner | 2002-03-28 | 3 | -15/+16 |
| * | Ooops, I did such a great job pruning nodes, that I accidentally deleted | Chris Lattner | 2002-03-28 | 1 | -1/+2 |
