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

• Show log

  Commit

• Hash : 352beffc
  Author :
  Date : 2014-11-19T13:45:55
  

  Remove RemoveAllTreeNodes, since it was a no-op
  
  IntermNode operator delete() or any of the IntermNode destructors don't
  do anything, since all the AST memory is allocated on the PoolAllocator.
  Because of this, RemoveAllTreeNodes was simply a no-op, and redundant
  with the PoolAllocator deallocation procedure, and could confuse people
  reading the code to think that IntermNodes should be deleted
  individually, when in fact this is not the case.
  
  BUG=angle:831
  
  Change-Id: Ie1ccaa51986aabf267280d92a8e76ca9f97a19e5
  Reviewed-on: https://chromium-review.googlesource.com/230730
  Reviewed-by: Jamie Madill <jmadill@chromium.org>
  Tested-by: Olli Etuaho <oetuaho@nvidia.com>
  

Download

• src/compiler/translator/Intermediate.h

• //
  // Copyright (c) 2002-2014 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.
  //
  
  #ifndef COMPILER_TRANSLATOR_INTERMEDIATE_H_
  #define COMPILER_TRANSLATOR_INTERMEDIATE_H_
  
  #include "compiler/translator/IntermNode.h"
  
  struct TVectorFields
  {
      int offsets[4];
      int num;
  };
  
  //
  // Set of helper functions to help parse and build the tree.
  //
  class TInfoSink;
  class TIntermediate
  {
    public:
      POOL_ALLOCATOR_NEW_DELETE();
      TIntermediate(TInfoSink &i)
          : mInfoSink(i) { }
  
      TIntermSymbol *addSymbol(
          int id, const TString &, const TType &, const TSourceLoc &);
      TIntermTyped *addBinaryMath(
          TOperator op, TIntermTyped *left, TIntermTyped *right, const TSourceLoc &);
      TIntermTyped *addAssign(
          TOperator op, TIntermTyped *left, TIntermTyped *right, const TSourceLoc &);
      TIntermTyped *addIndex(
          TOperator op, TIntermTyped *base, TIntermTyped *index, const TSourceLoc &);
      TIntermTyped *addUnaryMath(
          TOperator op, TIntermNode *child, const TSourceLoc &);
      TIntermAggregate *growAggregate(
          TIntermNode *left, TIntermNode *right, const TSourceLoc &);
      TIntermAggregate *makeAggregate(TIntermNode *node, const TSourceLoc &);
      TIntermAggregate *setAggregateOperator(TIntermNode *, TOperator, const TSourceLoc &);
      TIntermNode *addSelection(TIntermTyped *cond, TIntermNodePair code, const TSourceLoc &);
      TIntermTyped *addSelection(
          TIntermTyped *cond, TIntermTyped *trueBlock, TIntermTyped *falseBlock, const TSourceLoc &);
      TIntermTyped *addComma(
          TIntermTyped *left, TIntermTyped *right, const TSourceLoc &);
      TIntermConstantUnion *addConstantUnion(ConstantUnion *, const TType &, const TSourceLoc &);
      // TODO(zmo): Get rid of default value.
      bool parseConstTree(const TSourceLoc &, TIntermNode *, ConstantUnion *,
                          TOperator, TType, bool singleConstantParam = false);
      TIntermNode *addLoop(TLoopType, TIntermNode *, TIntermTyped *, TIntermTyped *,
                           TIntermNode *, const TSourceLoc &);
      TIntermBranch *addBranch(TOperator, const TSourceLoc &);
      TIntermBranch *addBranch(TOperator, TIntermTyped *, const TSourceLoc &);
      TIntermTyped *addSwizzle(TVectorFields &, const TSourceLoc &);
      bool postProcess(TIntermNode *);
      void outputTree(TIntermNode *);
  
    private:
      void operator=(TIntermediate &); // prevent assignments
  
      TInfoSink & mInfoSink;
  };
  
  #endif  // COMPILER_TRANSLATOR_INTERMEDIATE_H_
  

Download