diff options
| author | Georgios Pinitas <georgios.pinitas@arm.com> | 2019-12-02 11:58:19 +0000 |
|---|---|---|
| committer | Michele Di Giorgio <michele.digiorgio@arm.com> | 2019-12-06 14:54:19 +0000 |
| commit | f4261adf78bdb9f8b2d6f2970636125096c173cb (patch) | |
| tree | a2cf7abd84787720bdc286f09422336691d6fa95 /src/graph/GraphManager.cpp | |
| parent | 6f58b37a18cfade5dbec38638926f7bd368756d9 (diff) | |
| download | ComputeLibrary-f4261adf78bdb9f8b2d6f2970636125096c173cb.tar.gz | |
COMPMID-2779: Add support for generating synthetic int8 graphs.
Adds SyntheticDataTypeMutator, which is responsible for mutating graphs
to int8 and thus enable performance analysis on a wider range of models.
Change-Id: I9a00f0ae59421ab11952660f5115b5dcd9314aaf
Signed-off-by: Georgios Pinitas <georgios.pinitas@arm.com>
Reviewed-on: https://review.mlplatform.org/c/2418
Comments-Addressed: Arm Jenkins <bsgcomp@arm.com>
Tested-by: Arm Jenkins <bsgcomp@arm.com>
Reviewed-by: Michele Di Giorgio <michele.digiorgio@arm.com>
Diffstat (limited to 'src/graph/GraphManager.cpp')
| -rw-r--r-- | src/graph/GraphManager.cpp | 7 |
1 files changed, 5 insertions, 2 deletions
diff --git a/src/graph/GraphManager.cpp b/src/graph/GraphManager.cpp index 4f942b99e4..996e50bbbc 100644 --- a/src/graph/GraphManager.cpp +++ b/src/graph/GraphManager.cpp @@ -51,6 +51,9 @@ void GraphManager::finalize_graph(Graph &graph, GraphContext &ctx, PassManager & ARM_COMPUTE_ERROR("Graph is already registered!"); } + // Apply IR mutating passes + pm.run_type(graph, IGraphMutator::MutationType::IR); + // Force target to all graph construct // TODO (COMPMID-2014) : Support heterogeneous execution Target forced_target = target; @@ -68,8 +71,8 @@ void GraphManager::finalize_graph(Graph &graph, GraphContext &ctx, PassManager & // Configure all tensors detail::configure_all_tensors(graph); - // Apply all mutating passes - pm.run_all(graph); + // Apply backend mutating passes + pm.run_type(graph, IGraphMutator::MutationType::Backend); // Perform topological sort std::vector<NodeID> topological_sorted_nodes = dfs(graph); |