1// Copyright (c) 2017 Google Inc.
2//
3// Licensed under the Apache License, Version 2.0 (the "License");
4// you may not use this file except in compliance with the License.
5// You may obtain a copy of the License at
6//
7// http://www.apache.org/licenses/LICENSE-2.0
8//
9// Unless required by applicable law or agreed to in writing, software
10// distributed under the License is distributed on an "AS IS" BASIS,
11// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
12// See the License for the specific language governing permissions and
13// limitations under the License.
14
15#include "source/opt/redundancy_elimination.h"
16
17#include "source/opt/value_number_table.h"
18
19namespace spvtools {
20namespace opt {
21
22Pass::Status RedundancyEliminationPass::Process() {
23 bool modified = false;
24 ValueNumberTable vnTable(context());
25
26 for (auto& func : *get_module()) {
27 // Build the dominator tree for this function. It is how the code is
28 // traversed.
29 DominatorTree& dom_tree =
30 context()->GetDominatorAnalysis(&func)->GetDomTree();
31
32 // Keeps track of all ids that contain a given value number. We keep
33 // track of multiple values because they could have the same value, but
34 // different decorations.
35 std::map<uint32_t, uint32_t> value_to_ids;
36
37 if (EliminateRedundanciesFrom(dom_tree.GetRoot(), vnTable, value_to_ids)) {
38 modified = true;
39 }
40 }
41 return (modified ? Status::SuccessWithChange : Status::SuccessWithoutChange);
42}
43
44bool RedundancyEliminationPass::EliminateRedundanciesFrom(
45 DominatorTreeNode* bb, const ValueNumberTable& vnTable,
46 std::map<uint32_t, uint32_t> value_to_ids) {
47 bool modified = EliminateRedundanciesInBB(bb->bb_, vnTable, &value_to_ids);
48
49 for (auto dominated_bb : bb->children_) {
50 modified |= EliminateRedundanciesFrom(dominated_bb, vnTable, value_to_ids);
51 }
52
53 return modified;
54}
55} // namespace opt
56} // namespace spvtools
57