kc3-lang/angle/src/compiler/translator/CallDAG.h

• Show log

  Commit

• Hash : 336b1470
  Author :
  Date : 2016-10-05T16:37:55
  

  Split TIntermFunctionDefinition from TIntermAggregate
  
  This makes the code easier to understand. Function definition nodes
  always have just two children, the parameters node and the function
  body node, so there was no proper reason why they should be aggregate
  nodes.
  
  As a part of this change, intermediate output is modified to print
  symbol table ids of functions so that debugging function id related
  functionality will be easier in the future.
  
  After this patch, TIntermAggregate is still used for function
  prototypes, function parameter lists, function calls, variable and
  invariant declarations and the comma (sequence) operator.
  
  BUG=angleproject:1490
  TEST=angle_unittests, angle_end2end_tests
  
  Change-Id: Ib88b4ca5d21abd5f126836ca5900d0baecabd19e
  Reviewed-on: https://chromium-review.googlesource.com/394707
  Commit-Queue: Olli Etuaho <oetuaho@nvidia.com>
  Reviewed-by: Geoff Lang <geofflang@chromium.org>
  

Download

• src/compiler/translator/CallDAG.h

• //
  // Copyright (c) 2002-2015 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.
  //
  
  // CallDAG.h: Defines a call graph DAG of functions to be re-used accross
  // analyses, allows to efficiently traverse the functions in topological
  // order.
  
  #ifndef COMPILER_TRANSLATOR_CALLDAG_H_
  #define COMPILER_TRANSLATOR_CALLDAG_H_
  
  #include <map>
  
  #include "compiler/translator/IntermNode.h"
  #include "compiler/translator/VariableInfo.h"
  
  
  // The translator needs to analyze the the graph of the function calls
  // to run checks and analyses; since in GLSL recursion is not allowed
  // that graph is a DAG.
  // This class is used to precompute that function call DAG so that it
  // can be reused by multiple analyses.
  //
  // It stores a vector of function records, with one record per function.
  // Records are accessed by index but a mangled function name can be converted
  // to the index of the corresponding record. The records mostly contain the
  // AST node of the function and the indices of the function's callees.
  //
  // In addition, records are in reverse topological order: a function F being
  // called by a function G will have index index(F) < index(G), that way
  // depth-first analysis becomes analysis in the order of indices.
  
  class CallDAG : angle::NonCopyable
  {
    public:
      CallDAG();
      ~CallDAG();
  
      struct Record
      {
          std::string name;
          TIntermFunctionDefinition *node;
          std::vector<int> callees;
      };
  
      enum InitResult
      {
          INITDAG_SUCCESS,
          INITDAG_RECURSION,
          INITDAG_UNDEFINED,
      };
  
      // Returns INITDAG_SUCCESS if it was able to create the DAG, otherwise prints
      // the initialization error in info, if present.
      InitResult init(TIntermNode *root, TInfoSinkBase *info);
  
      // Returns InvalidIndex if the function wasn't found
      size_t findIndex(const TFunctionSymbolInfo *functionInfo) const;
  
      const Record &getRecordFromIndex(size_t index) const;
      const Record &getRecord(const TIntermAggregate *function) const;
      size_t size() const;
      void clear();
  
      const static size_t InvalidIndex;
    private:
      std::vector<Record> mRecords;
      std::map<int, int> mFunctionIdToIndex;
  
      class CallDAGCreator;
  };
  
  #endif  // COMPILER_TRANSLATOR_CALLDAG_H_
  

Download