mchalupa
Is there some method to check if tow nodes are conneced in a directed graph in DG?
Is there some method to check if tow nodes are conneced in a directed graph in DG?
Which graph? The best what you can do is to do some kind of BFS/DFS. DG has some predefined templates for that.
Which graph? The best what you can do is to do some kind of BFS/DFS. DG has some predefined templates for that.
It is a LLVMDependGraph. Is it possible to build SCC using LLVMNode?
Which graph? The best what you can do is to do some kind of BFS/DFS. DG has some predefined templates for that.
The essential question is that I want to map the instruction in LLVM bitcode to LLVMNode in LLVMDependGraph. But I find that my current solution is wrong. I store llvm::Value * and use findNode , but findNode return nullptr.
The API of LLVMDependenceGraph is now... well, not nice. I'm working on better one. However, you need to get the right dependence graph and search for the instruction there: https://github.com/mchalupa/dg/blob/master/include/dg/llvm/LLVMDependenceGraph.h#L229 (you can use https://github.com/mchalupa/dg/blob/master/include/dg/llvm/LLVMDependenceGraph.h#L233)
The API of LLVMDependenceGraph is now... well, not nice. I'm working on better one. However, you need to get the right dependence graph and search for the instruction there: https://github.com/mchalupa/dg/blob/master/include/dg/llvm/LLVMDependenceGraph.h#L229 (you can use https://github.com/mchalupa/dg/blob/master/include/dg/llvm/LLVMDependenceGraph.h#L233)
Hi, thanks. I find that there is another easy solution. I want to use the dependentable dot file from llvm-dump. Is ti that the node identifier is the pointer address of llvm::Value *?