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
// 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 <cassert>
#include "opencv2/gapi/gcall.hpp"
#include "api/gcall_priv.hpp"
// GCall private implementation ////////////////////////////////////////////////
cv::GCall::Priv::Priv(const cv::GKernel &k)
: m_k(k)
{
}
// GCall public implementation /////////////////////////////////////////////////
cv::GCall::GCall(const cv::GKernel &k)
: m_priv(new Priv(k))
{
// Here we have a reference to GNode,
// and GNode has a reference to us. Cycle! Now see destructor.
m_priv->m_node = GNode::Call(*this);
}
cv::GCall::~GCall()
{
// When a GCall object is destroyed (and GCall::Priv is likely still alive,
// as there might be other references), reset m_node to break cycle.
m_priv->m_node = GNode();
}
void cv::GCall::setArgs(std::vector<GArg> &&args)
{
// FIXME: Check if argument number is matching kernel prototype
m_priv->m_args = std::move(args);
}
cv::GMat cv::GCall::yield(int output)
{
return cv::GMat(m_priv->m_node, output);
}
cv::GScalar cv::GCall::yieldScalar(int output)
{
return cv::GScalar(m_priv->m_node, output);
}
cv::detail::GArrayU cv::GCall::yieldArray(int output)
{
return cv::detail::GArrayU(m_priv->m_node, output);
}
cv::GCall::Priv& cv::GCall::priv()
{
return *m_priv;
}
const cv::GCall::Priv& cv::GCall::priv() const
{
return *m_priv;
}