blob: b39c912e9ca54670503707f35df741337849237d (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
|
//
// Copyright (c) 2017 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.
//
// RemoveEmptySwitchStatements.cpp: Remove switch statements that have an empty statement list.
#include "compiler/translator/RemoveEmptySwitchStatements.h"
#include "compiler/translator/IntermTraverse.h"
namespace sh
{
namespace
{
class RemoveEmptySwitchStatementsTraverser : public TIntermTraverser
{
public:
RemoveEmptySwitchStatementsTraverser() : TIntermTraverser(true, false, false) {}
bool visitSwitch(Visit visit, TIntermSwitch *node);
};
bool RemoveEmptySwitchStatementsTraverser::visitSwitch(Visit visit, TIntermSwitch *node)
{
if (node->getStatementList()->getSequence()->empty())
{
// Just output the init statement.
if (node->getInit()->hasSideEffects())
{
queueReplacement(node->getInit(), OriginalNode::IS_DROPPED);
}
else
{
TIntermSequence emptyReplacement;
ASSERT(getParentNode()->getAsBlock());
mMultiReplacements.push_back(NodeReplaceWithMultipleEntry(getParentNode()->getAsBlock(),
node, emptyReplacement));
}
return false; // Nothing inside the child nodes to traverse.
}
return true;
}
} // anonymous namespace
void RemoveEmptySwitchStatements(TIntermBlock *root)
{
RemoveEmptySwitchStatementsTraverser traverser;
root->traverse(&traverser);
traverser.updateTree();
}
} // namespace sh
|
