2016-06-02 22:51:05 +00:00
|
|
|
// Copyright (c) 2015-2016 The Khronos Group Inc.
|
|
|
|
//
|
|
|
|
// Permission is hereby granted, free of charge, to any person obtaining a
|
|
|
|
// copy of this software and/or associated documentation files (the
|
|
|
|
// "Materials"), to deal in the Materials without restriction, including
|
|
|
|
// without limitation the rights to use, copy, modify, merge, publish,
|
|
|
|
// distribute, sublicense, and/or sell copies of the Materials, and to
|
|
|
|
// permit persons to whom the Materials are furnished to do so, subject to
|
|
|
|
// the following conditions:
|
|
|
|
//
|
|
|
|
// The above copyright notice and this permission notice shall be included
|
|
|
|
// in all copies or substantial portions of the Materials.
|
|
|
|
//
|
|
|
|
// MODIFICATIONS TO THIS FILE MAY MEAN IT NO LONGER ACCURATELY REFLECTS
|
|
|
|
// KHRONOS STANDARDS. THE UNMODIFIED, NORMATIVE VERSIONS OF KHRONOS
|
|
|
|
// SPECIFICATIONS AND HEADER INFORMATION ARE LOCATED AT
|
|
|
|
// https://www.khronos.org/registry/
|
|
|
|
//
|
|
|
|
// THE MATERIALS ARE PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
|
|
|
|
// EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
|
|
|
|
// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
|
|
|
|
// IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY
|
|
|
|
// CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,
|
|
|
|
// TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
|
|
|
|
// MATERIALS OR THE USE OR OTHER DEALINGS IN THE MATERIALS.
|
|
|
|
|
|
|
|
#include "BasicBlock.h"
|
|
|
|
|
2016-08-05 19:20:59 +00:00
|
|
|
#include <algorithm>
|
2016-06-24 06:14:16 +00:00
|
|
|
#include <utility>
|
2016-06-02 22:51:05 +00:00
|
|
|
#include <vector>
|
|
|
|
|
|
|
|
using std::vector;
|
|
|
|
|
|
|
|
namespace libspirv {
|
|
|
|
|
2016-06-25 03:45:25 +00:00
|
|
|
BasicBlock::BasicBlock(uint32_t label_id)
|
|
|
|
: id_(label_id),
|
2016-06-02 22:51:05 +00:00
|
|
|
immediate_dominator_(nullptr),
|
2016-06-04 01:24:24 +00:00
|
|
|
immediate_post_dominator_(nullptr),
|
2016-06-02 22:51:05 +00:00
|
|
|
predecessors_(),
|
|
|
|
successors_(),
|
2016-06-04 01:24:24 +00:00
|
|
|
type_(0),
|
2016-06-02 22:51:05 +00:00
|
|
|
reachable_(false) {}
|
|
|
|
|
|
|
|
void BasicBlock::SetImmediateDominator(BasicBlock* dom_block) {
|
|
|
|
immediate_dominator_ = dom_block;
|
|
|
|
}
|
|
|
|
|
2016-06-04 01:24:24 +00:00
|
|
|
void BasicBlock::SetImmediatePostDominator(BasicBlock* pdom_block) {
|
|
|
|
immediate_post_dominator_ = pdom_block;
|
|
|
|
}
|
|
|
|
|
2016-06-25 03:45:25 +00:00
|
|
|
const BasicBlock* BasicBlock::immediate_dominator() const {
|
2016-06-02 22:51:05 +00:00
|
|
|
return immediate_dominator_;
|
|
|
|
}
|
|
|
|
|
2016-06-25 03:45:25 +00:00
|
|
|
const BasicBlock* BasicBlock::immediate_post_dominator() const {
|
2016-06-04 01:24:24 +00:00
|
|
|
return immediate_post_dominator_;
|
|
|
|
}
|
|
|
|
|
2016-06-25 03:45:25 +00:00
|
|
|
BasicBlock* BasicBlock::immediate_dominator() { return immediate_dominator_; }
|
|
|
|
BasicBlock* BasicBlock::immediate_post_dominator() {
|
2016-06-04 01:24:24 +00:00
|
|
|
return immediate_post_dominator_;
|
|
|
|
}
|
2016-06-02 22:51:05 +00:00
|
|
|
|
2016-06-04 01:24:24 +00:00
|
|
|
void BasicBlock::RegisterSuccessors(const vector<BasicBlock*>& next_blocks) {
|
2016-06-02 22:51:05 +00:00
|
|
|
for (auto& block : next_blocks) {
|
|
|
|
block->predecessors_.push_back(this);
|
|
|
|
successors_.push_back(block);
|
2016-06-04 01:24:24 +00:00
|
|
|
if (block->reachable_ == false) block->set_reachable(reachable_);
|
2016-06-02 22:51:05 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
void BasicBlock::RegisterBranchInstruction(SpvOp branch_instruction) {
|
|
|
|
if (branch_instruction == SpvOpUnreachable) reachable_ = false;
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
2016-08-05 19:20:59 +00:00
|
|
|
bool BasicBlock::dominates(const BasicBlock& other) const {
|
|
|
|
return (this == &other) ||
|
|
|
|
!(other.dom_end() ==
|
|
|
|
std::find(other.dom_begin(), other.dom_end(), this));
|
|
|
|
}
|
|
|
|
|
|
|
|
bool BasicBlock::postdominates(const BasicBlock& other) const {
|
|
|
|
return (this == &other) ||
|
|
|
|
!(other.pdom_end() ==
|
|
|
|
std::find(other.pdom_begin(), other.pdom_end(), this));
|
|
|
|
}
|
|
|
|
|
2016-06-02 22:51:05 +00:00
|
|
|
BasicBlock::DominatorIterator::DominatorIterator() : current_(nullptr) {}
|
2016-06-04 01:24:24 +00:00
|
|
|
|
|
|
|
BasicBlock::DominatorIterator::DominatorIterator(
|
|
|
|
const BasicBlock* block,
|
|
|
|
std::function<const BasicBlock*(const BasicBlock*)> dominator_func)
|
|
|
|
: current_(block), dom_func_(dominator_func) {}
|
2016-06-02 22:51:05 +00:00
|
|
|
|
|
|
|
BasicBlock::DominatorIterator& BasicBlock::DominatorIterator::operator++() {
|
2016-06-04 01:24:24 +00:00
|
|
|
if (current_ == dom_func_(current_)) {
|
2016-06-02 22:51:05 +00:00
|
|
|
current_ = nullptr;
|
|
|
|
} else {
|
2016-06-04 01:24:24 +00:00
|
|
|
current_ = dom_func_(current_);
|
2016-06-02 22:51:05 +00:00
|
|
|
}
|
|
|
|
return *this;
|
|
|
|
}
|
|
|
|
|
|
|
|
const BasicBlock::DominatorIterator BasicBlock::dom_begin() const {
|
2016-06-04 01:24:24 +00:00
|
|
|
return DominatorIterator(
|
2016-06-25 03:45:25 +00:00
|
|
|
this, [](const BasicBlock* b) { return b->immediate_dominator(); });
|
2016-06-02 22:51:05 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
BasicBlock::DominatorIterator BasicBlock::dom_begin() {
|
2016-06-04 01:24:24 +00:00
|
|
|
return DominatorIterator(
|
2016-06-25 03:45:25 +00:00
|
|
|
this, [](const BasicBlock* b) { return b->immediate_dominator(); });
|
2016-06-02 22:51:05 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
const BasicBlock::DominatorIterator BasicBlock::dom_end() const {
|
|
|
|
return DominatorIterator();
|
|
|
|
}
|
|
|
|
|
|
|
|
BasicBlock::DominatorIterator BasicBlock::dom_end() {
|
|
|
|
return DominatorIterator();
|
|
|
|
}
|
|
|
|
|
2016-06-04 01:24:24 +00:00
|
|
|
const BasicBlock::DominatorIterator BasicBlock::pdom_begin() const {
|
|
|
|
return DominatorIterator(
|
2016-06-25 03:45:25 +00:00
|
|
|
this, [](const BasicBlock* b) { return b->immediate_post_dominator(); });
|
2016-06-04 01:24:24 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
BasicBlock::DominatorIterator BasicBlock::pdom_begin() {
|
|
|
|
return DominatorIterator(
|
2016-06-25 03:45:25 +00:00
|
|
|
this, [](const BasicBlock* b) { return b->immediate_post_dominator(); });
|
2016-06-04 01:24:24 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
const BasicBlock::DominatorIterator BasicBlock::pdom_end() const {
|
|
|
|
return DominatorIterator();
|
|
|
|
}
|
|
|
|
|
|
|
|
BasicBlock::DominatorIterator BasicBlock::pdom_end() {
|
|
|
|
return DominatorIterator();
|
|
|
|
}
|
|
|
|
|
2016-06-02 22:51:05 +00:00
|
|
|
bool operator==(const BasicBlock::DominatorIterator& lhs,
|
|
|
|
const BasicBlock::DominatorIterator& rhs) {
|
|
|
|
return lhs.current_ == rhs.current_;
|
|
|
|
}
|
|
|
|
|
|
|
|
bool operator!=(const BasicBlock::DominatorIterator& lhs,
|
|
|
|
const BasicBlock::DominatorIterator& rhs) {
|
|
|
|
return !(lhs == rhs);
|
|
|
|
}
|
|
|
|
|
|
|
|
const BasicBlock*& BasicBlock::DominatorIterator::operator*() {
|
|
|
|
return current_;
|
|
|
|
}
|
|
|
|
} // namespace libspirv
|