recommonded updates
This commit is contained in:
parent
3aaf9e186b
commit
25942a2c2b
tensorflow/compiler/tf2xla
@ -236,16 +236,16 @@ StateMap::CondId StateMap::GetCondId(const StateMap::CondState& state) {
|
|||||||
}
|
}
|
||||||
|
|
||||||
void StateMap::ResetCondId(const Node* node, StateMap::CondId id) {
|
void StateMap::ResetCondId(const Node* node, StateMap::CondId id) {
|
||||||
const int64 node_to_condid_map_size = node_to_condid_map_.size();
|
const int64 node_to_map_size = node_to_condid_map_.size();
|
||||||
if (node->id() < node_to_condid_map_size)
|
if (node->id() < node_to_map_size)
|
||||||
node_to_condid_map_[node->id()] = id;
|
node_to_condid_map_[node->id()] = id;
|
||||||
else
|
else
|
||||||
added_node_condid_mapping_[node->id()] = id;
|
added_node_condid_mapping_[node->id()] = id;
|
||||||
}
|
}
|
||||||
|
|
||||||
StateMap::AncestorId StateMap::LookupAncestorId(const Node* node) const {
|
StateMap::AncestorId StateMap::LookupAncestorId(const Node* node) const {
|
||||||
const int64 node_to_ancestorid_map_size = node_to_ancestorid_map_.size();
|
const int64 node_to_map_size = node_to_ancestorid_map_.size();
|
||||||
if (node->id() < node_to_ancestorid_map_size)
|
if (node->id() < node_to_map_size)
|
||||||
return node_to_ancestorid_map_[node->id()];
|
return node_to_ancestorid_map_[node->id()];
|
||||||
return added_node_ancestorid_mapping_.at(node->id());
|
return added_node_ancestorid_mapping_.at(node->id());
|
||||||
}
|
}
|
||||||
@ -257,8 +257,8 @@ StateMap::AncestorId StateMap::GetAncestorId(
|
|||||||
}
|
}
|
||||||
|
|
||||||
void StateMap::ResetAncestorId(const Node* node, StateMap::AncestorId id) {
|
void StateMap::ResetAncestorId(const Node* node, StateMap::AncestorId id) {
|
||||||
const int64 node_to_ancestorid_map_size = node_to_ancestorid_map_.size();
|
const int64 node_to_map_size = node_to_ancestorid_map_.size();
|
||||||
if (node->id() < node_to_ancestorid_map_size)
|
if (node->id() < node_to_map_size)
|
||||||
node_to_ancestorid_map_[node->id()] = id;
|
node_to_ancestorid_map_[node->id()] = id;
|
||||||
else
|
else
|
||||||
added_node_ancestorid_mapping_[node->id()] = id;
|
added_node_ancestorid_mapping_[node->id()] = id;
|
||||||
|
@ -146,7 +146,7 @@ Status ReorderOutputEdges(Graph* g, Node* n, int input_count,
|
|||||||
int dst_input = e->dst_input();
|
int dst_input = e->dst_input();
|
||||||
g->RemoveEdge(e);
|
g->RemoveEdge(e);
|
||||||
|
|
||||||
if (new_src_output < static_cast<int64>(input_count - resource_input_count)) {
|
if (new_src_output < input_count - resource_input_count) {
|
||||||
g->AddEdge(n, new_src_output, dst, dst_input);
|
g->AddEdge(n, new_src_output, dst, dst_input);
|
||||||
} else {
|
} else {
|
||||||
const Edge* input_edge;
|
const Edge* input_edge;
|
||||||
|
Loading…
Reference in New Issue
Block a user