Displaying 7 results from an estimated 7 matches for "getnodelabel".
2009 Jul 16
1
[LLVMdev] [patch] Dotty printer for dependency trees
...G shows the CFG with full instructions inside it
while viewCFGOnly shows just the block without the instruction listing
inside. This pass is intended to show the details.
+ template<>
+ struct DOTGraphTraits<DomTreeNode*> : public DefaultDOTGraphTraits {
+ static std::string getNodeLabel(DomTreeNode *Node,
+ DomTreeNode *Graph,
+ bool ShortNames) {
Tabs are forbidden in LLVM. Also, neither "namespace llvm {" nor
"template<>" increase indent level.
+ return DOTGraphTraits<const Function*>::getNodeLabel(
+ (const BasicBlock*) BB,...
2009 Jul 14
0
[LLVMdev] [patch] Dotty printer for dependency trees
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
And here is the patch.
Tobi
-------------- next part --------------
A non-text attachment was scrubbed...
Name:
2009 Jul 14
2
[LLVMdev] [patch] Dotty printer for dependency trees
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
2012 May 31
2
[LLVMdev] DFG of machine functions
...} else if (OutStr[i] == ';') { // Delete
comments!
unsigned Idx = OutStr.find('\n', i+1); // Find end of
line
OutStr.erase(OutStr.begin()+i, OutStr.begin()+Idx);
--i;
}
return OutStr;
}
std::string getNodeLabel(Value *&Node,
const MCDFGraph<MachineFunction *> &Graph) {
if (isSimple())
return getSimpleNodeLabel(Node, Graph);
else
return getCompleteNodeLabel(Node, Graph);
}
};
*//Calls to ViewGraph and WriteGraph from the respect...
2012 Jun 02
0
[LLVMdev] DFG of machine functions
...// Delete
> comments!
> unsigned Idx = OutStr.find('\n', i+1); // Find end of
> line
> OutStr.erase(OutStr.begin()+i, OutStr.begin()+Idx);
> --i;
> }
>
> return OutStr;
> }
>
> std::string getNodeLabel(Value *&Node,
> const MCDFGraph<MachineFunction *> &Graph) {
> if (isSimple())
> return getSimpleNodeLabel(Node, Graph);
> else
> return getCompleteNodeLabel(Node, Graph);
> }
>
> };
>
> *//Ca...
2009 Sep 07
0
[LLVMdev] Graphviz and LLVM-TV
Edwin,
thanks, it starts making sense
inline comments...
Török Edwin wrote:
> On 2009-09-06 19:57, Ioannis Nousias wrote:
>
>> Edwin,
>>
>> thank you for your effort, but I'm not sure I understand.
>> Are you describing a graph traversal problem? Is the data model stored
>> in a predecessor/successor fashion, which requires you to 'walk' the
2009 Sep 06
3
[LLVMdev] Graphviz and LLVM-TV
On 2009-09-06 19:57, Ioannis Nousias wrote:
> Edwin,
>
> thank you for your effort, but I'm not sure I understand.
> Are you describing a graph traversal problem? Is the data model stored
> in a predecessor/successor fashion, which requires you to 'walk' the
> graph in order to visit all nodes? (and what happens when you have
> disjointed DFGs?).
Sorry for the