VTA Callgraph #794
Open
VTA Callgraph #794
Conversation
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
…st with opaque pointers
…es + compute CG statistics
…ed by merge + mino
…-graph tool + some cleanup
5 tasks
fabianbs96
added
the
blocked
…. This let's us compute SCCs and topological sorting in a single pass over the graph and also gets rid of the recursion
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
Solves #779.
The VTA call-graph can be used by specifying the
CallGraphAnalysisType::VTAto theLLVMBasedICFGor tobuildLLVMBasedCallGraph(). Alternatively, you can manually create aVTAResolverand pass it tobuildLLVMBasedCallGraph().To assess the performance and result quality of the new call-graph, use the
tools/call-graph/call-graphtool.Edit: #783 should be merged first.