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

• Show log

  Commit

• Hash : 5c0e023c
  Author :
  Date : 2015-11-11T15:55:59
  

  Qualify stored constant union data with const
  
  This prevents accidentally changing data that may be shared between
  multiple TIntermConstantUnion nodes.
  
  Besides making the code less prone to bugs in general, this will make it
  easier to implement constant folding of array constructors.
  
  BUG=541551
  TEST=angle_unittests, WebGL conformance tests
  
  Change-Id: I4f3059f70b841d9dd0cf20fea4d37684da9cd47e
  Reviewed-on: https://chromium-review.googlesource.com/312440
  Reviewed-by: Jamie Madill <jmadill@chromium.org>
  Tryjob-Request: Jamie Madill <jmadill@chromium.org>
  Reviewed-by: Corentin Wallez <cwallez@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, 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 &line,
                             int shaderVersion);
      TIntermConstantUnion *addConstantUnion(const TConstantUnion *constantUnion,
                                             const TType &type,
                                             const TSourceLoc &line);
      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 &);
      TIntermAggregate *postProcess(TIntermNode *root);
  
      static void outputTree(TIntermNode *, TInfoSinkBase &);
  
      TIntermTyped *foldAggregateBuiltIn(TIntermAggregate *aggregate);
  
    private:
      void operator=(TIntermediate &); // prevent assignments
  
      TInfoSink & mInfoSink;
  };
  
  #endif  // COMPILER_TRANSLATOR_INTERMEDIATE_H_
  

Download