Open Source Computer Vision Library
https://opencv.org/
You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
200 lines
5.6 KiB
200 lines
5.6 KiB
// 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 |
|
|
|
|
|
#ifndef OPENCV_GAPI_COMPILER_TRANSACTIONS_HPP |
|
#define OPENCV_GAPI_COMPILER_TRANSACTIONS_HPP |
|
|
|
#include <algorithm> // find_if |
|
#include <functional> |
|
#include <list> |
|
|
|
#include <ade/graph.hpp> |
|
|
|
#include "opencv2/gapi/util/util.hpp" // Seq |
|
#include "opencv2/gapi/own/assert.hpp" |
|
|
|
enum class Direction: int {Invalid, In, Out}; |
|
|
|
//////////////////////////////////////////////////////////////////////////// |
|
//// |
|
// TODO: Probably it can be moved to ADE |
|
template<class H, class... Metatypes> |
|
class Preserved |
|
{ |
|
using S = typename cv::detail::MkSeq<sizeof...(Metatypes)>::type; |
|
std::tuple<cv::util::optional<Metatypes>...> m_data; |
|
|
|
template<class T> |
|
cv::util::optional<T> get(ade::ConstTypedGraph<Metatypes...> g, H h) { |
|
return g.metadata(h).template contains<T>() |
|
? cv::util::make_optional(g.metadata(h).template get<T>()) |
|
: cv::util::optional<T>{}; |
|
} |
|
template<std::size_t Id> |
|
int set(ade::TypedGraph<Metatypes...> &g, H &h) { |
|
const auto &opt = std::get<Id>(m_data); |
|
if (opt.has_value()) |
|
g.metadata(h).set(opt.value()); |
|
return 0; |
|
} |
|
template<int... IIs> |
|
void copyTo_impl(ade::TypedGraph<Metatypes...> &g, H h, cv::detail::Seq<IIs...>) { |
|
int unused[] = {0, set<IIs>(g, h)...}; |
|
(void) unused; |
|
} |
|
public: |
|
Preserved(const ade::Graph &g, H h) { |
|
ade::ConstTypedGraph<Metatypes...> tg(g); |
|
m_data = std::make_tuple(get<Metatypes>(tg, h)...); |
|
} |
|
void copyTo(ade::Graph &g, H h) { |
|
ade::TypedGraph<Metatypes...> tg(g); |
|
copyTo_impl(tg, h, S{}); |
|
} |
|
}; |
|
// Do nothing if there's no metadata |
|
template<class H> |
|
class Preserved<H> { |
|
public: |
|
Preserved(const ade::Graph &, H) {} |
|
void copyTo(ade::Graph &, H) {} |
|
}; |
|
|
|
template<class... Metatypes> |
|
struct ChangeT |
|
{ |
|
struct Base |
|
{ |
|
virtual void commit (ade::Graph & ) {}; |
|
virtual void rollback(ade::Graph & ) {}; |
|
virtual ~Base() = default; |
|
}; |
|
|
|
template<typename H> using Preserved = ::Preserved<H, Metatypes...>; |
|
|
|
class NodeCreated final: public Base |
|
{ |
|
ade::NodeHandle m_node; |
|
public: |
|
explicit NodeCreated(const ade::NodeHandle &nh) : m_node(nh) {} |
|
virtual void rollback(ade::Graph &g) override { g.erase(m_node); } |
|
}; |
|
|
|
// FIXME: maybe extend ADE to clone/copy the whole metadata? |
|
class DropLink final: public Base |
|
{ |
|
ade::NodeHandle m_node; |
|
Direction m_dir; |
|
|
|
ade::NodeHandle m_sibling; |
|
|
|
Preserved<ade::EdgeHandle> m_meta; |
|
|
|
public: |
|
DropLink(ade::Graph &g, |
|
const ade::NodeHandle &node, |
|
const ade::EdgeHandle &edge) |
|
: m_node(node) |
|
, m_dir(node == edge->srcNode() ? Direction::Out : Direction::In) |
|
, m_meta(g, edge) |
|
{ |
|
m_sibling = (m_dir == Direction::In |
|
? edge->srcNode() |
|
: edge->dstNode()); |
|
g.erase(edge); |
|
} |
|
|
|
virtual void rollback(ade::Graph &g) override |
|
{ |
|
// FIXME: Need to preserve metadata here! |
|
// GIslandModel edges now have metadata |
|
ade::EdgeHandle eh; |
|
switch(m_dir) |
|
{ |
|
case Direction::In: eh = g.link(m_sibling, m_node); break; |
|
case Direction::Out: eh = g.link(m_node, m_sibling); break; |
|
default: GAPI_Assert(false); |
|
} |
|
GAPI_Assert(eh != nullptr); |
|
m_meta.copyTo(g, eh); |
|
} |
|
}; |
|
|
|
class NewLink final: public Base |
|
{ |
|
ade::EdgeHandle m_edge; |
|
|
|
public: |
|
NewLink(ade::Graph &g, |
|
const ade::NodeHandle &prod, |
|
const ade::NodeHandle &cons, |
|
const ade::EdgeHandle ©_from = ade::EdgeHandle()) |
|
: m_edge(g.link(prod, cons)) |
|
{ |
|
if (copy_from != nullptr) |
|
{ |
|
Preserved<ade::EdgeHandle>(g, copy_from).copyTo(g, m_edge); |
|
} |
|
} |
|
|
|
virtual void rollback(ade::Graph &g) override |
|
{ |
|
g.erase(m_edge); |
|
} |
|
}; |
|
|
|
class DropNode final: public Base |
|
{ |
|
ade::NodeHandle m_node; |
|
|
|
public: |
|
explicit DropNode(const ade::NodeHandle &nh) |
|
: m_node(nh) |
|
{ |
|
// According to the semantic, node should be disconnected |
|
// manually before it is dropped |
|
GAPI_Assert(m_node->inEdges().size() == 0); |
|
GAPI_Assert(m_node->outEdges().size() == 0); |
|
} |
|
|
|
virtual void commit(ade::Graph &g) override |
|
{ |
|
g.erase(m_node); |
|
} |
|
}; |
|
|
|
class List |
|
{ |
|
std::list< std::unique_ptr<Base> > m_changes; |
|
|
|
public: |
|
template<typename T, typename ...Args> |
|
void enqueue(Args&&... args) |
|
{ |
|
std::unique_ptr<Base> p(new T(args...)); |
|
m_changes.push_back(std::move(p)); |
|
} |
|
|
|
void commit(ade::Graph &g) |
|
{ |
|
// Commit changes in the forward order |
|
for (auto& ch : m_changes) ch->commit(g); |
|
} |
|
|
|
void rollback(ade::Graph &g) |
|
{ |
|
// Rollback changes in the reverse order |
|
for (auto it = m_changes.rbegin(); it != m_changes.rend(); ++it) |
|
{ |
|
(*it)->rollback(g); |
|
} |
|
} |
|
}; |
|
}; // struct Change |
|
//////////////////////////////////////////////////////////////////////////// |
|
|
|
#endif // OPENCV_GAPI_COMPILER_TRANSACTIONS_HPP
|
|
|