9 void TDependencyGraphOutput::outputIndentation()
38 mSink <<
"selection\n";
44 mSink <<
"loop condition\n";
50 mSink <<
"logical " << logicalOp->
getOpString() <<
"\n";
57 for (TGraphNodeVector::const_iterator iter = graph.
begin(); iter != graph.
end(); ++iter)
60 mSink <<
"--- Dependency graph spanning tree ---\n";
virtual void traverse(TDependencyGraphTraverser *graphTraverser)
virtual void visitSelection(TGraphSelection *selection)
virtual void visitArgument(TGraphArgument *parameter)
const TIntermSymbol * getIntermSymbol() const
virtual void visitLogicalOp(TGraphLogicalOp *logicalOp)
int getArgumentNumber() const
const TIntermAggregate * getIntermFunctionCall() const
void outputAllSpanningTrees(TDependencyGraph &graph)
TGraphNodeVector::const_iterator begin() const
virtual void visitFunctionCall(TGraphFunctionCall *functionCall)
const TString & getName() const
virtual void visitLoop(TGraphLoop *loop)
virtual void visitSymbol(TGraphSymbol *symbol)
const TIntermAggregate * getIntermFunctionCall() const
const TString & getSymbol() const
const char * getOpString() const
TGraphNodeVector::const_iterator end() const