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
a416dbc6
Commit
a416dbc6
authored
Aug 10, 2023
by
umangyadav
Browse files
use sharing
parent
dd219d6e
Changes
1
Show whitespace changes
Inline
Side-by-side
Showing
1 changed file
with
46 additions
and
3 deletions
+46
-3
src/serialize.cpp
src/serialize.cpp
+46
-3
No files found.
src/serialize.cpp
View file @
a416dbc6
...
...
@@ -21,6 +21,7 @@
* OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
* THE SOFTWARE.
*/
#include <limits>
#include <migraphx/serialize.hpp>
#include <migraphx/argument.hpp>
#include <migraphx/literal.hpp>
...
...
@@ -37,7 +38,27 @@ void raw_data_to_value(value& v, const RawData& rd)
if
(
rd
.
get_shape
().
type
()
==
shape
::
tuple_type
)
result
[
"sub"
]
=
migraphx
::
to_value
(
rd
.
get_sub_objects
());
else
if
(
not
rd
.
empty
())
{
size_t
binary_size
=
rd
.
get_shape
().
bytes
();
size_t
partition_length
=
std
::
numeric_limits
<
uint32_t
>::
max
();
if
(
binary_size
>
partition_length
)
{
size_t
array_size
=
1
+
((
binary_size
-
1
)
/
partition_length
);
std
::
vector
<
migraphx
::
value
>
v_array
(
array_size
);
for
(
size_t
i
=
0
;
i
<
array_size
;
++
i
)
{
size_t
chunk_size
=
(
i
==
(
array_size
-
1
))
?
(
binary_size
%
partition_length
)
:
partition_length
;
v_array
[
i
]
=
migraphx
::
value
::
binary
{(
rd
.
data
()
+
(
i
*
partition_length
)),
chunk_size
};
}
result
[
"data"
]
=
migraphx
::
value
(
v_array
);
}
else
{
result
[
"data"
]
=
migraphx
::
value
::
binary
(
rd
.
data
(),
rd
.
get_shape
().
bytes
());
}
}
v
=
result
;
}
...
...
@@ -45,7 +66,29 @@ void migraphx_to_value(value& v, const literal& l) { raw_data_to_value(v, l); }
void
migraphx_from_value
(
const
value
&
v
,
literal
&
l
)
{
auto
s
=
migraphx
::
from_value
<
shape
>
(
v
.
at
(
"shape"
));
size_t
binary_size
=
s
.
bytes
();
size_t
partition_length
=
std
::
numeric_limits
<
uint32_t
>::
max
();
if
(
binary_size
<=
partition_length
)
{
l
=
literal
(
s
,
v
.
at
(
"data"
).
get_binary
().
data
());
}
else
{
assert
(
v
.
is_array
());
size_t
array_size
=
1
+
((
binary_size
-
1
)
/
partition_length
);
assert
(
array_size
==
v
.
size
());
std
::
vector
<
uint8_t
>
binary_array
(
binary_size
);
size_t
read_size
=
0
;
for
(
size_t
i
=
0
;
i
<
array_size
;
++
i
)
{
binary_array
.
insert
(
binary_array
.
end
(),
v
.
at
(
i
).
get_binary
().
data
(),
v
.
at
(
i
).
get_binary
().
data
()
+
v
.
at
(
i
).
get_binary
().
size
());
read_size
+=
v
.
at
(
i
).
get_binary
().
size
();
}
assert
(
read_size
==
binary_size
);
l
=
literal
(
s
,
binary_array
.
data
());
}
}
void
migraphx_to_value
(
value
&
v
,
const
argument
&
a
)
{
raw_data_to_value
(
v
,
a
);
}
...
...
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