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
cfbe4da6
Commit
cfbe4da6
authored
Sep 07, 2022
by
turneram
Browse files
Formatting
parent
1196b676
Changes
1
Hide whitespace changes
Inline
Side-by-side
Showing
1 changed file
with
2 additions
and
2 deletions
+2
-2
src/targets/gpu/kernels/include/migraphx/kernels/ck_elementwise.hpp
...s/gpu/kernels/include/migraphx/kernels/ck_elementwise.hpp
+2
-2
No files found.
src/targets/gpu/kernels/include/migraphx/kernels/ck_elementwise.hpp
View file @
cfbe4da6
...
@@ -54,9 +54,9 @@ __host__ __device__ constexpr auto MakeDescriptor_M(const L& lengths, const S& s
...
@@ -54,9 +54,9 @@ __host__ __device__ constexpr auto MakeDescriptor_M(const L& lengths, const S& s
[
&
](
auto
I
)
{
return
static_cast
<
ck
::
index_t
>
(
strides
[
I
]);
},
ck
::
Number
<
1
>
{});
[
&
](
auto
I
)
{
return
static_cast
<
ck
::
index_t
>
(
strides
[
I
]);
},
ck
::
Number
<
1
>
{});
const
auto
desc_m
=
make_naive_tensor_descriptor
(
tupleOfShape
,
tupleOfStride
);
const
auto
desc_m
=
make_naive_tensor_descriptor
(
tupleOfShape
,
tupleOfStride
);
const
auto
M
=
desc_m
.
GetLength
(
I0
);
const
auto
M
=
desc_m
.
GetLength
(
I0
);
const
index_t
loop_step
=
idx
.
nglobal
();
// gridSize * blockSize * MPerThread;
const
index_t
loop_step
=
idx
.
nglobal
();
// gridSize * blockSize * MPerThread;
const
auto
pad
=
ck
::
math
::
integer_least_multiple
(
M
,
loop_step
)
-
M
;
const
auto
pad
=
ck
::
math
::
integer_least_multiple
(
M
,
loop_step
)
-
M
;
const
auto
desc_m_pad
=
const
auto
desc_m_pad
=
transform_tensor_descriptor
(
desc_m
,
transform_tensor_descriptor
(
desc_m
,
make_tuple
(
ck
::
make_right_pad_transform
(
M
,
pad
)),
make_tuple
(
ck
::
make_right_pad_transform
(
M
,
pad
)),
...
...
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