/** * \file imperative/python/src/graph_rt.h * MegEngine is Licensed under the Apache License, Version 2.0 (the "License") * * Copyright (c) 2014-2020 Megvii Inc. All rights reserved. * * Unless required by applicable law or agreed to in writing, * software distributed under the License is distributed on an * "AS IS" BASIS, WITHOUT ARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. */ #pragma once #include "./helper.h" #include #include #include #include "megbrain/graph.h" template class GraphNodePtr { std::shared_ptr m_graph; T* m_node; public: GraphNodePtr(T* node) : m_graph(node ? nullptr : node->owner_graph()->shared_from_this()), m_node(node) {} T* operator->() {return m_node;} T& operator*() {return *m_node;} operator bool() {return m_node;} T* get() {return m_node;} }; PYBIND11_DECLARE_HOLDER_TYPE(T, GraphNodePtr, true); template class Rendezvous { std::mutex m_lock; int m_read_ahead = 0; bool m_drop_next = false; std::promise m_promise; public: Rendezvous() = default; Rendezvous(const Rendezvous& rhs) = delete; Rendezvous(Rendezvous&& rhs) = delete; Rendezvous& operator=(const Rendezvous& rhs) = delete; R get() { std::future f; { MGB_LOCK_GUARD(m_lock); mgb_assert(m_read_ahead <= 0); mgb_assert(m_read_ahead >= -1); f = m_promise.get_future(); if (m_read_ahead == -1) { m_promise = {}; } ++m_read_ahead; } return f.get(); } void drop() { MGB_LOCK_GUARD(m_lock); mgb_assert(m_read_ahead <= 0); mgb_assert(m_read_ahead >= -1); if (m_read_ahead == -1) { m_promise = {}; } else { m_drop_next = true; } ++m_read_ahead; } template void set(T&& value) { MGB_LOCK_GUARD(m_lock); mgb_assert(m_read_ahead >= 0); mgb_assert(m_read_ahead <= 1); if (m_drop_next) { m_drop_next = false; } else { m_promise.set_value(std::forward(value)); } if (m_read_ahead == 1) { m_promise = {}; } --m_read_ahead; } void reset() { MGB_LOCK_GUARD(m_lock); m_promise = {}; m_read_ahead = 0; m_drop_next = false; } }; void init_graph_rt(pybind11::module m);