File size: 9,316 Bytes
be94e5d |
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 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 |
// This file is part of OpenCV project.
// It is subject to the license terms in the LICENSE file found in the top-level directory
// of this distribution and at http://opencv.org/license.html.
//
// Copyright (C) 2018 Intel Corporation
#include "precomp.hpp"
#include <sstream>
#include <stack>
#include <ade/util/chain_range.hpp>
#include <ade/graph.hpp>
#include "compiler/gmodel.hpp"
#include "compiler/passes/passes.hpp"
namespace
{
bool is_within_same_island(const cv::gimpl::GModel::Graph &gr,
const ade::NodeHandle &dataNode,
const std::string &island)
{
// A data node is within the same island as it's reader node
// if and only if data object's producer island (if there's a producer)
// is the same as the specified one.
//
// An object may have only a single producer, but multiple consumers,
// and these consumers may be assigned to different Islands.
// Since "initIslands" traversal direction is op-to-args, i.e. reverse,
// a single Data object may be visited twice during Islands initialization.
//
// In this case, Data object is part of Island A if and only if:
// - Data object's producer is part of Island A,
// - AND any of Data object's consumers is part of Island A.
//
// Op["island0"] --> Data[ ? ] --> Op["island0"]
// :
// '---------> Op["island1"]
//
// In the above example, Data object is assigned to "island0" as
// it is surrounded by operations assigned to "island0"
using namespace cv::gimpl;
if ( gr.metadata(dataNode).contains<Island>()
&& gr.metadata(dataNode).get<Island>().island != island)
return false;
if (dataNode->inNodes().empty())
return false;
GAPI_Assert(dataNode->inNodes().size() == 1u);
const auto prod_h = dataNode->inNodes().front();
// FIXME: ADE should have something like get_or<> or get<>(default)
GAPI_Assert(gr.metadata(prod_h).get<NodeType>().t == NodeType::OP);
return ( gr.metadata(prod_h).contains<Island>()
&& gr.metadata(prod_h).get<Island>().island == island)
&& (ade::util::any_of(dataNode->outNodes(), [&](ade::NodeHandle cons_h)
{
return ( gr.metadata(cons_h).contains<Island>()
&& gr.metadata(cons_h).get<Island>().island == island);
}));
}
} // anonymous namespace
// Initially only Operations have Island tag. This pass adds Island tag
// to all data objects within an Island.
// A data object is considered within an Island if and only if
// its reader and writer are assigned to this Island (see above).
void cv::gimpl::passes::initIslands(ade::passes::PassContext &ctx)
{
GModel::Graph gr(ctx.graph);
for (const auto &nh : gr.nodes())
{
if (gr.metadata(nh).get<NodeType>().t == NodeType::OP)
{
if (gr.metadata(nh).contains<Island>())
{
const auto island = gr.metadata(nh).get<Island>().island;
// It is enough to check only input nodes
for (const auto &in_data_node : nh->inNodes())
{
if (is_within_same_island(gr, in_data_node, island))
{
gr.metadata(in_data_node).set(Island{island});
}
} // for(in_data_node)
} // if (contains<Island>)
} // if (OP)
} // for (nodes)
}
// There should be no multiple (disconnected) islands with the same name.
// This may occur if user assigns the same islands name to multiple ranges
// in the graph.
// FIXME: How it could be avoided on an earlier stage?
void cv::gimpl::passes::checkIslands(ade::passes::PassContext &ctx)
{
GModel::ConstGraph gr(ctx.graph);
// The algorithm is the following:
//
// 1. Put all Tagged nodes (both Operations and Data) into a set
// 2. Initialize Visited set as (empty)
// 3. Initialize Traversal stack as (empty)
// 4. Initialize Islands map (String -> Integer) as (empty)
// 5. For every Tagged node from a set
// a. Skip if it is Visited
// b. For every input/output node:
// * if it is tagged with the same island:
// - add it to Traversal stack
// - remove from Tagged nodes if it is t
// c. While (stack is not empty):
// - Take a node from Stack
// - Repeat (b)
// d. Increment Islands map [this island] by 1
//
//
// If whatever Island has counter is more than 1, it is a disjoint
// one (i.e. there's two islands with the same name).
using node_set = std::unordered_set
< ade::NodeHandle
, ade::HandleHasher<ade::Node>
>;
node_set tagged_nodes;
node_set visited_tagged_nodes;
std::unordered_map<std::string, int> island_counters;
for (const auto &nh : gr.nodes())
{
if (gr.metadata(nh).contains<Island>())
{
tagged_nodes.insert(nh);
island_counters[gr.metadata(nh).get<Island>().island] = 0;
}
}
// Make a copy to allow list modifications during traversal
for (const auto &tagged_nh : tagged_nodes)
{
if (visited_tagged_nodes.end() != ade::util::find(visited_tagged_nodes, tagged_nh))
continue;
// Run the recursive traversal process as described in 5/a-d.
// This process is like a flood-fill traversal for island.
// If there's to distinct successful flood-fills happened for the same island
// name, there are two islands with this name.
std::stack<ade::NodeHandle> stack;
stack.push(tagged_nh);
while (!stack.empty())
{
const auto this_nh = stack.top();
stack.pop();
// Since _this_ node is visited, it is a part of processed island
// so mark it as visited to skip in other recursive processes
visited_tagged_nodes.insert(this_nh);
GAPI_DbgAssert(gr.metadata(this_nh).contains<Island>());
GAPI_DbgAssert( gr.metadata(this_nh ).get<Island>().island
== gr.metadata(tagged_nh).get<Island>().island);
const auto &this_island = gr.metadata(this_nh).get<Island>().island;
for (const auto neighbor_nh : ade::util::chain(this_nh->inNodes(), this_nh->outNodes()))
{
if ( gr.metadata(neighbor_nh).contains<Island>()
&& gr.metadata(neighbor_nh).get<Island>().island == this_island
&& !visited_tagged_nodes.count(neighbor_nh))
{
stack.push(neighbor_nh);
}
} // for (neighbor)
} // while (stack)
// Flood-fill is over, now increment island counter for this island
island_counters[gr.metadata(tagged_nh).get<Island>().island]++;
} // for(tagged)
bool check_failed = false;
std::stringstream ss;
for (const auto &ic : island_counters)
{
GAPI_Assert(ic.second > 0);
if (ic.second > 1)
{
check_failed = true;
ss << "\"" << ic.first << "\"(" << ic.second << ") ";
}
}
if (check_failed)
{
util::throw_error
(std::logic_error("There are multiple distinct islands "
"with the same name: [" + ss.str() + "], "
"please check your cv::gapi::island() parameters!"));
}
}
void cv::gimpl::passes::checkIslandsContent(ade::passes::PassContext &ctx)
{
GModel::ConstGraph gr(ctx.graph);
std::unordered_map<std::string, cv::gapi::GBackend> backends_of_islands;
for (const auto& nh : gr.nodes())
{
if (NodeType::OP == gr.metadata(nh).get<NodeType>().t &&
gr.metadata(nh).contains<Island>())
{
const auto island = gr.metadata(nh).get<Island>().island;
auto island_backend_it = backends_of_islands.find(island);
const auto& op = gr.metadata(nh).get<Op>();
if (island_backend_it != backends_of_islands.end())
{
// Check that backend of the operation coincides with the backend of the island
// Backend of the island is determined by the backend of the first operation from this island
if (island_backend_it->second != op.backend)
{
util::throw_error(std::logic_error(island + " contains kernels " + op.k.name +
" with different backend"));
}
}
else
{
backends_of_islands.emplace(island, op.backend);
}
}
}
}
|