SPIRV-Tools/source/opt/redundancy_elimination.h
Steven Perron 5d602abd66 Add global redundancy elimination
Adds a pass that looks for redundant instruction in a function, and
removes them.  The algorithm is a hash table based value numbering
algorithm that traverses the dominator tree.

This pass removes completely redundant instructions, not partially
redundant ones.
2017-12-07 18:35:38 -05:00

55 lines
2.0 KiB
C++

// Copyright (c) 2017 Google Inc.
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.
#ifndef LIBSPIRV_OPT_REDUNDANCY_ELIMINATION_H_
#define LIBSPIRV_OPT_REDUNDANCY_ELIMINATION_H_
#include "ir_context.h"
#include "local_redundancy_elimination.h"
#include "pass.h"
#include "value_number_table.h"
namespace spvtools {
namespace opt {
// This pass implements total redundancy elimination. This is the same as
// local redundancy elimination except it looks across basic block boundaries.
// An instruction, inst, is totally redundant if there is another instruction
// that dominates inst, and also computes the same value.
class RedundancyEliminationPass : public LocalRedundancyEliminationPass {
public:
const char* name() const override { return "redundancy-elimination"; }
Status Process(ir::IRContext*) override;
protected:
// Removes for all total redundancies in the function starting at |bb|.
//
// |vnTable| must have computed a value number for every result id defined
// in the function containing |bb|.
//
// |value_to_ids| is a map from value number to ids. If {vn, id} is in
// |value_to_ids| then vn is the value number of id, and the defintion of id
// dominates |bb|.
//
// Returns true if at least one instruction is deleted.
bool EliminateRedundanciesFrom(DominatorTreeNode* bb,
const ValueNumberTable& vnTable,
std::map<uint32_t, uint32_t> value_to_ids);
};
} // namespace opt
} // namespace spvtools
#endif // LIBSPIRV_OPT_REDUNDANCY_ELIMINATION_H_