Skip to content
Projects
Groups
Snippets
Help
Loading...
Sign in / Register
Toggle navigation
N
ngraph
Project
Project
Details
Activity
Cycle Analytics
Repository
Repository
Files
Commits
Branches
Tags
Contributors
Graph
Compare
Charts
Issues
0
Issues
0
List
Board
Labels
Milestones
Merge Requests
0
Merge Requests
0
CI / CD
CI / CD
Pipelines
Jobs
Schedules
Charts
Packages
Packages
Wiki
Wiki
Snippets
Snippets
Members
Members
Collapse sidebar
Close sidebar
Activity
Graph
Charts
Create a new issue
Jobs
Commits
Issue Boards
Open sidebar
submodule
ngraph
Commits
e54156cf
Commit
e54156cf
authored
Nov 09, 2018
by
Nick Korovaiko
Committed by
Robert Kimball
Nov 09, 2018
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
more passes to static (#2027)
parent
3a47eafc
Hide whitespace changes
Inline
Side-by-side
Showing
2 changed files
with
5 additions
and
5 deletions
+5
-5
cpu_horizontal_fusion.cpp
src/ngraph/runtime/cpu/pass/cpu_horizontal_fusion.cpp
+1
-1
cpu_mat_fusion.cpp
src/ngraph/runtime/cpu/pass/cpu_mat_fusion.cpp
+4
-4
No files found.
src/ngraph/runtime/cpu/pass/cpu_horizontal_fusion.cpp
View file @
e54156cf
...
...
@@ -56,7 +56,7 @@ void ngraph::runtime::cpu::pass::CPUHorizontalFusion::cpu_conv_horizontal_fusion
NGRAPH_DEBUG
<<
"conv_horizontal_fusion: In a callback for conv horizontal fusion for "
<<
m
.
get_match_root
()
->
get_name
();
auto
conv_bias_root
=
std
::
dynam
ic_pointer_cast
<
op
::
ConvolutionBias
>
(
m
.
get_match_root
());
auto
conv_bias_root
=
std
::
stat
ic_pointer_cast
<
op
::
ConvolutionBias
>
(
m
.
get_match_root
());
//check if the node has been replaced
if
(
conv_bias_root
->
get_users
().
empty
())
...
...
src/ngraph/runtime/cpu/pass/cpu_mat_fusion.cpp
View file @
e54156cf
...
...
@@ -331,7 +331,7 @@ bool runtime::cpu::pass::CPURnnMatFusion::run_on_function(std::shared_ptr<Functi
for
(
auto
op
:
op_nodes
)
{
const
auto
old_slice
=
std
::
dynam
ic_pointer_cast
<
op
::
Slice
>
(
op_seg_map
[
op
].
at
(
Type
::
DATA
));
std
::
stat
ic_pointer_cast
<
op
::
Slice
>
(
op_seg_map
[
op
].
at
(
Type
::
DATA
));
const
auto
&
old_lower_bounds
=
old_slice
->
get_lower_bounds
();
// lower bound matching the current time step
const
Coordinate
lower_bounds
{
old_lower_bounds
[
1
],
0
};
...
...
@@ -403,7 +403,7 @@ std::shared_ptr<Node> fuse_group_convolution(const std::shared_ptr<Node>& n)
std
::
shared_ptr
<
Node
>
data
;
std
::
shared_ptr
<
Node
>
weights
;
auto
concat
=
std
::
dynam
ic_pointer_cast
<
op
::
Concat
>
(
n
);
auto
concat
=
std
::
stat
ic_pointer_cast
<
op
::
Concat
>
(
n
);
std
::
shared_ptr
<
op
::
Convolution
>
sconv
;
NodeVector
slices
;
...
...
@@ -423,14 +423,14 @@ std::shared_ptr<Node> fuse_group_convolution(const std::shared_ptr<Node>& n)
return
{
nullptr
};
}
sconv
=
std
::
dynam
ic_pointer_cast
<
op
::
Convolution
>
(
arg
);
sconv
=
std
::
stat
ic_pointer_cast
<
op
::
Convolution
>
(
arg
);
if
(
arg
->
get_input_shape
(
0
).
size
()
!=
4
)
{
NGRAPH_DEBUG
<<
"convolution data's rank isn't equal to 4"
;
return
{
nullptr
};
}
if
(
!
is_trivial_convolution
(
s
td
::
dynamic_pointer_cast
<
op
::
Convolution
>
(
arg
)
))
if
(
!
is_trivial_convolution
(
s
conv
))
{
NGRAPH_DEBUG
<<
arg
->
get_name
()
<<
" isn't trivial convolution"
;
return
{
nullptr
};
...
...
Write
Preview
Markdown
is supported
0%
Try again
or
attach a new file
Attach a file
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Cancel
Please
register
or
sign in
to comment