kc3-lang/angle/src/compiler/translator/depgraph/DependencyGraphOutput.cpp

• Show log

  Commit

• Hash : e678b66c
  Author :
  Date : 2015-12-07T15:54:17
  

  TDependencyGraph: use range-base for loops instead of iterators
  
  No functional changes intended.
  
  BUG=angleproject:591
  
  Change-Id: Ieccf0b792766be86a3533e5324ce6f83ee508ad5
  Reviewed-on: https://chromium-review.googlesource.com/316601
  Reviewed-by: Jamie Madill <jmadill@chromium.org>
  Reviewed-by: Geoff Lang <geofflang@chromium.org>
  Tested-by: Corentin Wallez <cwallez@chromium.org>
  

Download

• src/compiler/translator/depgraph/DependencyGraphOutput.cpp

• //
  // Copyright (c) 2012 The ANGLE Project Authors. All rights reserved.
  // Use of this source code is governed by a BSD-style license that can be
  // found in the LICENSE file.
  //
  
  #include "compiler/translator/depgraph/DependencyGraphOutput.h"
  
  void TDependencyGraphOutput::outputIndentation()
  {
      for (int i = 0; i < getDepth(); ++i)
          mSink << "  ";
  }
  
  void TDependencyGraphOutput::visitArgument(TGraphArgument* parameter)
  {
      outputIndentation();
      mSink << "argument " << parameter->getArgumentNumber() << " of call to "
            << parameter->getIntermFunctionCall()->getName() << "\n";
  }
  
  void TDependencyGraphOutput::visitFunctionCall(TGraphFunctionCall* functionCall)
  {
      outputIndentation();
      mSink << "function call " <<  functionCall->getIntermFunctionCall()->getName() << "\n";
  }
  
  void TDependencyGraphOutput::visitSymbol(TGraphSymbol* symbol)
  {
      outputIndentation();
      mSink << symbol->getIntermSymbol()->getSymbol() << " (symbol id: "
            << symbol->getIntermSymbol()->getId() << ")\n";
  }
  
  void TDependencyGraphOutput::visitSelection(TGraphSelection* selection)
  {
      outputIndentation();
      mSink << "selection\n";
  }
  
  void TDependencyGraphOutput::visitLoop(TGraphLoop* loop)
  {
      outputIndentation();
      mSink << "loop condition\n";
  }
  
  void TDependencyGraphOutput::visitLogicalOp(TGraphLogicalOp* logicalOp)
  {
      outputIndentation();
      mSink << "logical " << logicalOp->getOpString() << "\n";
  }
  
  void TDependencyGraphOutput::outputAllSpanningTrees(TDependencyGraph& graph)
  {
      mSink << "\n";
  
      for (auto symbol : graph.allNodes())
      {
          mSink << "--- Dependency graph spanning tree ---\n";
          clearVisited();
          symbol->traverse(this);
          mSink << "\n";
      }
  }
  

Download