blob: d33747f85bb615e8169723e2e5451de496bc16cc [file] [log] [blame]
Olli Etuahofc0e2bc2015-04-16 13:39:56 +03001//
2// Copyright (c) 2002-2015 The ANGLE Project Authors. All rights reserved.
3// Use of this source code is governed by a BSD-style license that can be
4// found in the LICENSE file.
5//
Olli Etuahoa6f22092015-05-08 18:31:10 +03006// The SeparateDeclarations function processes declarations, so that in the end each declaration
7// contains only one declarator.
8// This is useful as an intermediate step when initialization needs to be separated from declaration,
9// or when things need to be unfolded out of the initializer.
Olli Etuahofc0e2bc2015-04-16 13:39:56 +030010// Example:
11// int a[1] = int[1](1), b[1] = int[1](2);
12// gets transformed when run through this class into the AST equivalent of:
13// int a[1] = int[1](1);
14// int b[1] = int[1](2);
15
16#include "compiler/translator/SeparateDeclarations.h"
17
18#include "compiler/translator/IntermNode.h"
19
20namespace
21{
22
Olli Etuahoa6f22092015-05-08 18:31:10 +030023class SeparateDeclarationsTraverser : private TIntermTraverser
Olli Etuahofc0e2bc2015-04-16 13:39:56 +030024{
25 public:
26 static void apply(TIntermNode *root);
27 private:
Olli Etuahoa6f22092015-05-08 18:31:10 +030028 SeparateDeclarationsTraverser();
Olli Etuahofc0e2bc2015-04-16 13:39:56 +030029 bool visitAggregate(Visit, TIntermAggregate *node) override;
30};
31
Olli Etuahoa6f22092015-05-08 18:31:10 +030032void SeparateDeclarationsTraverser::apply(TIntermNode *root)
Olli Etuahofc0e2bc2015-04-16 13:39:56 +030033{
Olli Etuahoa6f22092015-05-08 18:31:10 +030034 SeparateDeclarationsTraverser separateDecl;
Olli Etuahofc0e2bc2015-04-16 13:39:56 +030035 root->traverse(&separateDecl);
36 separateDecl.updateTree();
37}
38
Olli Etuahoa6f22092015-05-08 18:31:10 +030039SeparateDeclarationsTraverser::SeparateDeclarationsTraverser()
Olli Etuahofc0e2bc2015-04-16 13:39:56 +030040 : TIntermTraverser(true, false, false)
41{
42}
43
Olli Etuahoa6f22092015-05-08 18:31:10 +030044bool SeparateDeclarationsTraverser::visitAggregate(Visit, TIntermAggregate *node)
Olli Etuahofc0e2bc2015-04-16 13:39:56 +030045{
46 if (node->getOp() == EOpDeclaration)
47 {
48 TIntermSequence *sequence = node->getSequence();
Olli Etuahoa6f22092015-05-08 18:31:10 +030049 if (sequence->size() > 1)
Olli Etuahofc0e2bc2015-04-16 13:39:56 +030050 {
51 TIntermAggregate *parentAgg = getParentNode()->getAsAggregate();
52 ASSERT(parentAgg != nullptr);
53
54 TIntermSequence replacementDeclarations;
55 for (size_t ii = 0; ii < sequence->size(); ++ii)
56 {
57 TIntermAggregate *replacementDeclaration = new TIntermAggregate;
58
59 replacementDeclaration->setOp(EOpDeclaration);
60 replacementDeclaration->getSequence()->push_back(sequence->at(ii));
61 replacementDeclaration->setLine(sequence->at(ii)->getLine());
62 replacementDeclarations.push_back(replacementDeclaration);
63 }
64
65 mMultiReplacements.push_back(NodeReplaceWithMultipleEntry(parentAgg, node, replacementDeclarations));
66 }
67 return false;
68 }
69 return true;
70}
71
72} // namespace
73
Olli Etuahoa6f22092015-05-08 18:31:10 +030074void SeparateDeclarations(TIntermNode *root)
Olli Etuahofc0e2bc2015-04-16 13:39:56 +030075{
Olli Etuahoa6f22092015-05-08 18:31:10 +030076 SeparateDeclarationsTraverser::apply(root);
Olli Etuahofc0e2bc2015-04-16 13:39:56 +030077}