Chandler Carruth d3ec736574 [LCG] Build an edge abstraction for the LazyCallGraph and use it to ... differentiate between indirect references to functions an direct calls. This doesn't do a whole lot yet other than change the print out produced by the analysis, but it lays the groundwork for a very major change I'm working on next: teaching the call graph to actually be a call graph, modeling *both* the indirect reference graph and the call graph simultaneously. More details on that in the next patch though. The rest of this is essentially a bunch of over-engineering that won't be interesting until the next patch. But this also isolates essentially all of the churn necessary to introduce the edge abstraction from the very important behavior change necessary in order to separately model the two graphs. So it should make review of the subsequent patch a bit easier at the cost of making this patch seem poorly motivated. ;] Differential Revision: http://reviews.llvm.org/D16038 git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@259463 91177308-0d34-0410-b5e6-96231b3b80d8		2016-02-02 03:57:13 +00:00
..
basic.ll	[LCG] Build an edge abstraction for the LazyCallGraph and use it to	2016-02-02 03:57:13 +00:00
non-leaf-intrinsics.ll	[LCG] Build an edge abstraction for the LazyCallGraph and use it to	2016-02-02 03:57:13 +00:00