similar to: [LLVMdev] Call graph printer/viewer

Hi, I started to work with llvm and liked the CFG dotty printer a lot. However there was none for the dominance trees. I implemented dotty printing for dominance trees and introduced these new flags: -dot-dom : Print dominance tree of function to 'dot' file -dot-dom-only : Print dominance tree of function to 'dot' file (with no function

Hello Prakash, The SelectionDAG viewers (llc -view-isel-dags etc.) support both multiple edges between the same pair of nodes, and labels at least for each incoming edge. See lib/CodeGen/SelectionDAG/SelectionDAGPrinter.cpp for code you might use as an example, though it is a bit tricky. Dan On Sep 15, 2008, at 3:15 PM, Prakash Prabhu wrote: > Hi all, > > I have two questions related

Hi Prakash, I don't know of an easy way to do this, other than to use random-access iterators so you can compute the distance between the edge and the beginning of the list of edges. Dan On Sep 16, 2008, at 2:58 PM, Prakash Prabhu wrote: > Hi Dan, > > Thanks for the reply. I got the labels for each outgoing edge (at the > source node's 'structure' field) working. Is

Hi Dan, Thanks for the reply. I got the labels for each outgoing edge (at the source node's 'structure' field) working. Is there a way to find out the outgoing edge number from EdgeIter. (Basically the Node in my graph has a a bunch of outgoing edges, so that I can just index into that collection within the node to get the appropriate edges' attributes). regards, Prakash On Tue,

Hi all, I have two questions related to .dot graph output. Basically, I have a graph representing a program dependence graph like structure with (a) multiple edges between the same pair of nodes (b) each edge having a special (different) text/label I implemented a template-specialized version of DotGraphTraits for the my graph structure which given a node, uses a map_iterator (similar to the one

Tobias Grosser wrote: > On Wed, 2009-07-15 at 00:20 +0200, Tobias Grosser wrote: >> Hi, >> >> I started to work with llvm and liked the CFG dotty printer a lot. >> However there was none for the dominance trees. >> >> I implemented dotty printing for dominance trees Great! I'm a huge fan of graphviz integration in the compiler. > And here is the

After enabling assertions and recompilation I still get this error. ~/bin/llvm$ llc -view-isel-dags t3.bc llc: Unknown command line argument '-view-isel-dags'. Try: 'llc -help' llc: Did you mean '-fast-isel-abort'? and I see the view-edge bundles option but get the following error. ~/bin/llvm$ llc -view-edge-bundles t3.bc Writing

llvm/llvm/lib/CodeGen/SelectionDAG/SelectionDAGPrinter.cpp: In member function ‘void llvm::SelectionDAG::setSubgraphColor(llvm::SDNode*, const char*)’: llvm/llvm/lib/CodeGen/SelectionDAG/SelectionDAGPrinter.cpp:372: warning: comparison with string literal results in unspecified behavior llvm/llvm/lib/CodeGen/SelectionDAG/SelectionDAGPrinter.cpp:375: warning: comparison with string literal

On Monday 27 October 2008 17:06, Mike Stump wrote: > llvm/llvm/lib/CodeGen/SelectionDAG/SelectionDAGPrinter.cpp: In member > function ‘void llvm::SelectionDAG::setSubgraphColor(llvm::SDNode*, > const char*)’: > llvm/llvm/lib/CodeGen/SelectionDAG/SelectionDAGPrinter.cpp:372: > warning: comparison with string literal results in unspecified behavior >

On 7 August 2013 17:06, Jakob Stoklund Olesen <stoklund at 2pi.dk> wrote: > With the D-Wave computer in the news recently, you may find it interesting that LLVM’s register allocator is using Ising models to compute regions for live range splitting. > > The problem of finding a region for splitting a live range is mapped to an Ising model with the help of the edge bundle graph, see

Hi all, I need to look at the CFG of a loop during debugging. However the containing function is very large, so it is rather difficult to use the CFG of the complete function. I tried using the ViewGraph method, but the compiler kept complaining about undefined symbols related to GraphTraits or DOTGraphTraits. Is there any example that I could look at to find out, what exactly I need to call

I tried debugging it and the issue seems to be in the implementation of MachineInstrIterator.h and the way it interacts with GraphWriter.h functions. I found this by replacing the ( template <> struct GraphTraits<MCDFGraph<MachineFunction*> >) with a similar MCDFGraph based template of CFG similar to the one in MachineFunction.h (similarly replacing the DOTGraphTraits with the

Sorry for the rapid fire replies, but this configuration works for me: install(DIRECTORY include/ DESTINATION include # FILES_MATCHING PATTERN "*.def" PATTERN "*.h" PATTERN "*.td" PATTERN "*.inc" PATTERN ".svn" EXCLUDE ) install(DIRECTORY ${CMAKE_CURRENT_BINARY_DIR}/include/ DESTINATION include # FILES_MATCHING PATTERN

Hi, The -dot-cfg option of opt will write a diagram of an analyzed function's CFG to DOT format. If you then open the DOT file, you will see that the BasicBlocks are uniquely identified with hexadecimal addresses. For example, an edge from one block to another may look like: Node0x10026b0:s0 -> Node0x1004c20; I've been trying to figure out where these hexadecimal addresses

Hi Ioannis, On Thu, 2009-08-13 at 19:31 +0100, Ioannis Nousias wrote: > Thanks Tobi for the tip. > > however I also need the Data-Flow-Graph of each basic block/functions. > As I said, I need a view of how the instructions 'link' to each other > (via registers or memory aliasing or whatnot) I believe that there is not yet a DOT printer for this kind of information.

On 7 August 2013 17:06, Jakob Stoklund Olesen <stoklund at 2pi.dk> wrote: > With the D-Wave computer in the news recently, you may find it interesting that LLVM’s register allocator is using Ising models to compute regions for live range splitting. > > The problem of finding a region for splitting a live range is mapped to an Ising model with the help of the edge bundle graph, see

With the D-Wave computer in the news recently, you may find it interesting that LLVM’s register allocator is using Ising models to compute regions for live range splitting. The problem of finding a region for splitting a live range is mapped to an Ising model with the help of the edge bundle graph, see EdgeBundles.h. A node in the edge bundle graph represents a set of CFG edges that enter or

Hi, I am trying to generate the DFG of machine functions. Initially, I added a pass to generate the DFG of LLVM IR functions. This was based on the mail thread - http://lists.cs.uiuc.edu/pipermail/llvmdev/2009-September/025582.html. This pass worked fine and I was able to generate DFG of LLVM IR functions. Later, I ported the DFG pass code for machine functions. I ported the InstIterator.h

Hello, the patch attatched adds the option -view-dag-color-node=<list> to llc. The list of strings is matched with the names of the labels of nodes when displaying a graph, so that matching nodes are displayed in a colored bold style. I find this extremely usful on selectionDAGs to spot specific nodes in larger graphs. You may complain that the implementation should be interacting more with

On 04/07/2010 08:10 PM, Jochen Wilhelmy wrote: > Hi! > > while trying to use llvm::DominatorTreeBase on a custom graph that > has nothing to do with llvm::BasicBlock I ran into some difficulties, > because llvm::DominatorTreeBase calls e.g. getParent()->front() > directly on the nodes Yes this is a problem. However how is it related to your proposal? Do you want to add a