| Commit message (Expand) | Author | Age | Files | Lines |
|---|
| * | Change TargetLibraryInfo analysis passes to always require Function | Teresa Johnson | 2019-09-07 | 1 | -1/+3 |
| * | [INLINER] allow inlining of blockaddresses if sole uses are callbrs | Nick Desaulniers | 2019-05-20 | 1 | -0/+29 |
| * | Update the file headers across all of the LLVM projects in the monorepo | Chandler Carruth | 2019-01-19 | 1 | -4/+3 |
| * | llvm::sort(C.begin(), C.end(), ...) -> llvm::sort(C, ...) | Fangrui Song | 2018-09-27 | 1 | -11/+11 |
| * | [unittests] Change std::sort to llvm::sort in response to r327219 | Mandeep Singh Grang | 2018-04-07 | 1 | -11/+11 |
| * | [LCG] Switch one of the update methods for the LazyCallGraph to support | Chandler Carruth | 2017-08-09 | 1 | -23/+94 |
| * | [PM/LCG] Teach the LazyCallGraph to maintain reference edges from every | Chandler Carruth | 2017-07-15 | 1 | -20/+27 |
| * | [PM] Fix a nasty bug in the new PM where we failed to properly | Chandler Carruth | 2017-07-09 | 1 | -16/+17 |
| * | Re-sort #include lines for unittests. This uses a slightly modified | Chandler Carruth | 2017-06-06 | 1 | -1/+1 |
| * | Fix signed/unsigned comparison warnings | Simon Pilgrim | 2017-03-11 | 1 | -2/+2 |
| * | [PM/LCG] Teach LCG to support spurious reference edges. | Chandler Carruth | 2017-02-09 | 1 | -0/+81 |
| * | [PM/LCG] Teach the LazyCallGraph how to replace a function without | Chandler Carruth | 2017-02-09 | 1 | -81/+176 |
| * | [PM/LCG] Remove the lazy RefSCC formation from the LazyCallGraph during | Chandler Carruth | 2017-02-06 | 1 | -267/+17 |
| * | [PM] Teach the CGSCC's CG update utility to more carefully invalidate | Chandler Carruth | 2016-12-28 | 1 | -37/+46 |
| * | [LCG] Teach the ref edge removal to handle a ref edge that is trivial | Chandler Carruth | 2016-12-28 | 1 | -0/+78 |
| * | [LCG] Teach the LazyCallGraph to handle visiting the blockaddress | Chandler Carruth | 2016-12-27 | 1 | -0/+31 |
| * | [LCG] Start using SCC relationship predicates in the unittest. | Chandler Carruth | 2016-11-22 | 1 | -2/+26 |
| * | [LCG] Add the necessary functionality to the LazyCallGraph to support inlining. | Chandler Carruth | 2016-10-12 | 1 | -0/+318 |
| * | [LCG] Redesign the lazy post-order iteration mechanism for the | Chandler Carruth | 2016-09-16 | 1 | -12/+384 |
| * | Remove every uses of getGlobalContext() in LLVM (but the C API) | Mehdi Amini | 2016-04-14 | 1 | -243/+251 |
| * | [LCG] Construct an actual call graph with call-edge SCCs nested inside | Chandler Carruth | 2016-02-17 | 1 | -204/+781 |
| * | [LCG] Build an edge abstraction for the LazyCallGraph and use it to | Chandler Carruth | 2016-02-02 | 1 | -31/+31 |
| * | Silence gcc's -Wcomment | Filipe Cabecinhas | 2014-10-22 | 1 | -15/+17 |
| * | Modernize the .ll parsing interface. | Rafael Espindola | 2014-08-19 | 1 | -5/+3 |
| * | Reverting r211950 -- it did not help resolve the -Wcomment warnings triggered... | Aaron Ballman | 2014-06-27 | 1 | -4/+4 |
| * | Adding some trailing whitespace after a comment previously ending with \ to e... | Aaron Ballman | 2014-06-27 | 1 | -4/+4 |
| * | Disable -Wcomment when building with GCC. | Evgeniy Stepanov | 2014-05-06 | 1 | -11/+11 |
| * | [LCG] Add the last (and most complex) of the edge insertion mutation | Chandler Carruth | 2014-05-04 | 1 | -0/+155 |
| * | [LCG] Reorder the tests to be a bit more logical: inter-SCC mutation | Chandler Carruth | 2014-05-04 | 1 | -53/+53 |
| * | [LCG] Add the other simple edge insertion API to the call graph. This | Chandler Carruth | 2014-05-01 | 1 | -0/+53 |
| * | [LCG] Add some basic methods for querying the parent/child relationships | Chandler Carruth | 2014-05-01 | 1 | -0/+20 |
| * | [LCG] Add the really, *really* boring edge insertion case: adding an | Chandler Carruth | 2014-04-30 | 1 | -0/+46 |
| * | Fix multiline comment warning. | Evgeniy Stepanov | 2014-04-30 | 1 | -11/+11 |
| * | [LCG] Actually test the *basic* edge removal bits (IE, the non-SCC | Chandler Carruth | 2014-04-30 | 1 | -1/+11 |
| * | [LCG] Add the most basic of edge insertion to the lazy call graph. This | Chandler Carruth | 2014-04-28 | 1 | -0/+38 |
| * | [LCG] Make the return of the IntraSCC removal method actually match its | Chandler Carruth | 2014-04-28 | 1 | -2/+5 |
| * | [LCG] Re-organize the methods for mutating a call graph to make their | Chandler Carruth | 2014-04-27 | 1 | -3/+3 |
| * | [LCG] Re-order expectations to provide more useful output when debugging | Chandler Carruth | 2014-04-24 | 1 | -4/+4 |
| * | [LCG] Switch the SCC's parent iterators to be value iterators rather | Chandler Carruth | 2014-04-24 | 1 | -1/+1 |
| * | [LCG] Normalize the post-order SCC iterator to just iterate over the SCC | Chandler Carruth | 2014-04-23 | 1 | -24/+24 |
| * | [LCG] Switch the primary node iterator to be a *much* more normal C++ | Chandler Carruth | 2014-04-23 | 1 | -49/+49 |
| * | [LCG] Switch the SCC lookup to be in terms of call graph nodes rather | Chandler Carruth | 2014-04-23 | 1 | -35/+35 |
| * | [LCG] Add the first round of mutation support to the lazy call graph. | Chandler Carruth | 2014-04-23 | 1 | -0/+87 |
| * | [LCG] Implement Tarjan's algorithm correctly this time. We have to walk | Chandler Carruth | 2014-04-23 | 1 | -0/+57 |
| * | [LCG] Add a unittest for the LazyCallGraph. I had a weak moment and | Chandler Carruth | 2014-04-23 | 1 | -0/+251 |
