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

• Show log

  Commit

• Hash : 7d7f8c44
  Author :
  Date : 2015-05-19T18:38:49
  

  Ensure that conditional blocks and loop bodies are sequence nodes
  
  AST transformations such as unfolding logical operations can only
  create nodes inside sequence (block) nodes. This patch ensures that these
  AST transformations work even inside conditional blocks and loop bodies
  that were first parsed as single statements instead of blocks.
  
  BUG=angleproject:971
  TEST=WebGL conformance tests
  
  Change-Id: If98cb7be653ec7b005537b89547f4f4cf1c07c72
  Reviewed-on: https://chromium-review.googlesource.com/272141
  Reviewed-by: Zhenyao Mo <zmo@chromium.org>
  Tested-by: Olli Etuaho <oetuaho@nvidia.com>
  Reviewed-by: Jamie Madill <jmadill@chromium.org>
  

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, TIntermTyped *child, const TSourceLoc &line, const TType *funcReturnType);
      TIntermAggregate *growAggregate(
          TIntermNode *left, TIntermNode *right, const TSourceLoc &);
      TIntermAggregate *makeAggregate(TIntermNode *node, const TSourceLoc &);
      TIntermAggregate *ensureSequence(TIntermNode *node);
      TIntermAggregate *setAggregateOperator(TIntermNode *, TOperator, const TSourceLoc &);
      TIntermNode *addSelection(TIntermTyped *cond, TIntermNodePair code, const TSourceLoc &);
      TIntermTyped *addSelection(TIntermTyped *cond, TIntermTyped *trueBlock, TIntermTyped *falseBlock,
                                 const TSourceLoc &line);
      TIntermSwitch *addSwitch(
          TIntermTyped *init, TIntermAggregate *statementList, const TSourceLoc &line);
      TIntermCase *addCase(
          TIntermTyped *condition, const TSourceLoc &line);
      TIntermTyped *addComma(
          TIntermTyped *left, TIntermTyped *right, const TSourceLoc &);
      TIntermConstantUnion *addConstantUnion(
          TConstantUnion *constantUnion, const TType &type, const TSourceLoc &line);
      // TODO(zmo): Get rid of default value.
      bool parseConstTree(const TSourceLoc &, TIntermNode *, TConstantUnion *,
                          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 *);
  
      static void outputTree(TIntermNode *, TInfoSinkBase &);
  
      TIntermTyped *foldAggregateBuiltIn(TOperator op, TIntermAggregate *aggregate);
  
    private:
      void operator=(TIntermediate &); // prevent assignments
  
      TInfoSink & mInfoSink;
  };
  
  #endif  // COMPILER_TRANSLATOR_INTERMEDIATE_H_
  

Download