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
|
/*
* Copyright (c) 2018 ARM Limited.
*
* SPDX-License-Identifier: MIT
*
* Permission is hereby granted, free of charge, to any person obtaining a copy
* of this software and associated documentation files (the "Software"), to
* deal in the Software without restriction, including without limitation the
* rights to use, copy, modify, merge, publish, distribute, sublicense, and/or
* sell copies of the Software, and to permit persons to whom the Software is
* 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 Software.
*
* THE SOFTWARE IS 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 SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
* SOFTWARE.
*/
#include "arm_compute/graph/GraphManager.h"
#include "arm_compute/graph/Graph.h"
#include "arm_compute/graph/GraphContext.h"
#include "arm_compute/graph/Logger.h"
#include "arm_compute/graph/PassManager.h"
#include "arm_compute/graph/Utils.h"
#include "arm_compute/graph/detail/ExecutionHelpers.h"
namespace arm_compute
{
namespace graph
{
GraphManager::GraphManager()
: _workloads()
{
detail::default_initialize_backends();
}
void GraphManager::finalize_graph(Graph &graph, GraphContext &ctx, PassManager &pm, Target target)
{
// Setup graph context if not done manually
setup_default_graph_context(ctx);
// Check if graph has been registered
if(_workloads.find(graph.id()) != std::end(_workloads))
{
ARM_COMPUTE_ERROR("Graph is already registered!");
}
// Force target to all graph construct
// TODO (geopin01) : Support heterogeneous execution
Target forced_target = is_target_supported(target) ? target : get_default_target();
force_target_to_graph(graph, forced_target);
// Configure all tensors
detail::configure_all_tensors(graph);
// Apply all mutating passes
pm.run_all(graph);
// TODO (geopin01): Perform a graph validation
// Perform topological sort
// FIXME : Sort nodes and pass sorted indices in configure all nodes
// Validate all nodes
detail::validate_all_nodes(graph);
// Configure all nodes
auto workload = detail::configure_all_nodes(graph, ctx);
ARM_COMPUTE_ERROR_ON_MSG(workload.tasks.empty(), "Could not configure all nodes!");
// TODO (COMPMID-920) : Update prepare for NEON/GC
if(forced_target == Target::CL)
{
// Allocate const tensors and call accessors
detail::allocate_const_tensors(graph);
detail::call_all_const_node_accessors(graph);
// Prepare graph
detail::prepare_all_tasks(workload);
// Allocate all tensors
detail::allocate_all_tensors(graph);
// Finalize Graph context
ctx.finalize();
// Register graph
_workloads.insert(std::make_pair(graph.id(), std::move(workload)));
ARM_COMPUTE_LOG_GRAPH_VERBOSE("Created workload for graph with ID : " << graph.id().get() << std::endl);
}
else
{
// Allocate all tensors
detail::allocate_all_tensors(graph);
// Call accessors on all Const nodes
detail::call_all_const_node_accessors(graph);
// Finalize Graph context
ctx.finalize();
// Register graph
_workloads.insert(std::make_pair(graph.id(), std::move(workload)));
ARM_COMPUTE_LOG_GRAPH_VERBOSE("Created workload for graph with ID : " << graph.id().get() << std::endl);
// Make first run
execute_graph(graph);
// Release all unused const tensors
detail::release_unused_tensors(graph);
}
}
void GraphManager::execute_graph(Graph &graph)
{
// Check if graph is finalized
auto it = _workloads.find(graph.id());
ARM_COMPUTE_ERROR_ON_MSG(it == std::end(_workloads), "Graph is not registered!");
// Call input accessors
detail::call_all_input_node_accessors(it->second);
// Run graph
detail::call_all_tasks(it->second);
// Call output accessors
detail::call_all_output_node_accessors(it->second);
}
void GraphManager::invalidate_graph(Graph &graph)
{
auto it = _workloads.find(graph.id());
ARM_COMPUTE_ERROR_ON_MSG(it == std::end(_workloads), "Graph is not registered!");
_workloads.erase(it);
}
} // namespace graph
} // namespace arm_compute
|