Skip to content
GitLab
Menu
Projects
Groups
Snippets
Loading...
Help
Help
Support
Community forum
Keyboard shortcuts
?
Submit feedback
Contribute to GitLab
Sign in / Register
Toggle navigation
Menu
Open sidebar
gaoqiong
MIGraphX
Commits
60fb49dc
Commit
60fb49dc
authored
Feb 25, 2019
by
Shucai Xiao
Browse files
add a clean implementation of the gather operator.
parent
11efa851
Changes
1
Hide whitespace changes
Inline
Side-by-side
Showing
1 changed file
with
25 additions
and
17 deletions
+25
-17
src/include/migraphx/operators.hpp
src/include/migraphx/operators.hpp
+25
-17
No files found.
src/include/migraphx/operators.hpp
View file @
60fb49dc
...
@@ -766,7 +766,7 @@ struct gather
...
@@ -766,7 +766,7 @@ struct gather
}
}
// for scalar output
// for scalar output
if
(
lens
.
size
()
==
0
)
if
(
lens
.
empty
()
)
{
{
return
{
type
,
{
1
},
{
0
}};
return
{
type
,
{
1
},
{
0
}};
}
}
...
@@ -774,6 +774,29 @@ struct gather
...
@@ -774,6 +774,29 @@ struct gather
return
{
type
,
lens
};
return
{
type
,
lens
};
}
}
template
<
typename
V
,
typename
T
>
T
compute_data_index
(
const
V
&
indices
,
const
int
axis_index
,
const
T
&
out_idx
)
const
{
auto
data_idx
=
out_idx
;
std
::
size_t
index
{};
if
(
!
indices
.
get_shape
().
scalar
())
{
auto
start_it
=
data_idx
.
begin
()
+
axis_index
;
auto
end_it
=
data_idx
.
begin
()
+
axis_index
+
indices
.
get_shape
().
lens
().
size
();
std
::
vector
<
std
::
size_t
>
ind_idx
(
start_it
,
end_it
);
data_idx
.
erase
(
start_it
,
end_it
);
index
=
indices
(
ind_idx
.
begin
(),
ind_idx
.
end
());
}
else
{
index
=
indices
.
front
();
}
data_idx
.
insert
(
data_idx
.
begin
()
+
axis_index
,
index
);
return
data_idx
;
}
argument
compute
(
const
shape
&
output_shape
,
std
::
vector
<
argument
>
args
)
const
argument
compute
(
const
shape
&
output_shape
,
std
::
vector
<
argument
>
args
)
const
{
{
argument
result
{
output_shape
};
argument
result
{
output_shape
};
...
@@ -790,22 +813,7 @@ struct gather
...
@@ -790,22 +813,7 @@ struct gather
else
else
{
{
shape_for_each
(
output
.
get_shape
(),
[
&
](
const
auto
&
out_idx
)
{
shape_for_each
(
output
.
get_shape
(),
[
&
](
const
auto
&
out_idx
)
{
auto
data_idx
=
out_idx
;
auto
data_idx
=
compute_data_index
(
indices
,
axis_index
,
out_idx
);
std
::
size_t
index
{};
if
(
!
indices
.
get_shape
().
scalar
())
{
auto
start_it
=
data_idx
.
begin
()
+
axis_index
;
auto
end_it
=
data_idx
.
begin
()
+
axis_index
+
indices
.
get_shape
().
lens
().
size
();
std
::
vector
<
std
::
size_t
>
ind_idx
(
start_it
,
end_it
);
data_idx
.
erase
(
start_it
,
end_it
);
index
=
indices
(
ind_idx
.
begin
(),
ind_idx
.
end
());
}
else
{
index
=
indices
.
front
();
}
data_idx
.
insert
(
data_idx
.
begin
()
+
axis_index
,
index
);
output
(
out_idx
.
begin
(),
out_idx
.
end
())
=
output
(
out_idx
.
begin
(),
out_idx
.
end
())
=
data
(
data_idx
.
begin
(),
data_idx
.
end
());
data
(
data_idx
.
begin
(),
data_idx
.
end
());
});
});
...
...
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