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
3c524557
Unverified
Commit
3c524557
authored
Mar 11, 2020
by
Robert Kimball
Committed by
GitHub
Mar 11, 2020
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
Remove placement index (#4416)
* remove placement index * style
parent
b7e09d40
Hide whitespace changes
Inline
Side-by-side
Showing
3 changed files
with
0 additions
and
21 deletions
+0
-21
node.cpp
src/ngraph/node.cpp
+0
-10
node.hpp
src/ngraph/node.hpp
+0
-9
result.cpp
src/ngraph/op/result.cpp
+0
-2
No files found.
src/ngraph/node.cpp
View file @
3c524557
...
...
@@ -341,16 +341,6 @@ void Node::set_placement(Placement placement)
m_placement
=
placement
;
}
size_t
Node
::
get_placement_index
()
const
{
return
m_placement_index
;
}
void
Node
::
set_placement_index
(
size_t
placement
)
{
m_placement_index
=
placement
;
}
void
Node
::
add_provenance_group_member
(
const
shared_ptr
<
Node
>&
node
)
{
m_provenance_group
.
insert
(
node
);
...
...
src/ngraph/node.hpp
View file @
3c524557
...
...
@@ -429,12 +429,6 @@ namespace ngraph
/// Set device placement
void
set_placement
(
Placement
placement
);
/// Get device placement
size_t
get_placement_index
()
const
;
/// Set device placement
void
set_placement_index
(
size_t
placement
);
using
RTMap
=
std
::
map
<
std
::
string
,
std
::
shared_ptr
<
Variant
>>
;
RTMap
&
get_rt_info
()
{
return
m_rt_info
;
}
...
...
@@ -481,8 +475,6 @@ namespace ngraph
virtual
std
::
shared_ptr
<
Node
>
get_default_value
()
const
{
return
nullptr
;
}
/// Use instance ids for comparison instead of memory addresses to improve determinism
bool
operator
<
(
const
Node
&
other
)
const
{
return
m_instance_id
<
other
.
m_instance_id
;
}
static
const
size_t
placement_invalid
=
-
1
;
/// \return A vector containing a handle for each of this node's inputs, in order.
// TODO: Rename to get_inputs()?
std
::
vector
<
Input
<
Node
>>
inputs
();
...
...
@@ -548,7 +540,6 @@ namespace ngraph
std
::
deque
<
descriptor
::
Output
>
m_outputs
;
std
::
unordered_map
<
Node
*
,
autodiff
::
Adjoints
>
m_adjoint_map
;
Placement
m_placement
=
Placement
::
DEFAULT
;
size_t
m_placement_index
=
placement_invalid
;
std
::
shared_ptr
<
ngraph
::
op
::
util
::
OpAnnotations
>
m_op_annotations
;
std
::
map
<
std
::
string
,
std
::
shared_ptr
<
Variant
>>
m_rt_info
;
};
...
...
src/ngraph/op/result.cpp
View file @
3c524557
...
...
@@ -31,8 +31,6 @@ op::Result::Result(const Output<Node>& arg, bool needs_default_layout)
,
m_needs_default_layout
(
needs_default_layout
)
{
constructor_validate_and_infer_types
();
// always borrow the placement conf even the default one
set_placement_index
(
input_value
(
0
).
get_node
()
->
get_placement_index
());
}
bool
ngraph
::
op
::
v0
::
Result
::
visit_attributes
(
AttributeVisitor
&
visitor
)
...
...
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