experiments/STT-tensorflow
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

Update topological_sort.cc

Browse Source
This commit is contained in:
tg-at-google 2020-07-14 14:33:32 -04:00 committed by GitHub
parent 0c47b7b33e
commit 603104ecf5
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 4 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

8
tensorflow/core/grappler/utils/topological_sort.cc
View File

@ -81,8 +81,8 @@ Status ComputeTopologicalOrder(
int ready_node = (*ready_nodes)[front]; int ready_node = (*ready_nodes)[front];
for (int fanout : graph_view.GetFanout(ready_node)) { for (int fanout : graph_view.GetFanout(ready_node)) {
++num_ready_inputs[fanout]; ++num_ready_inputs[fanout];
const int graph_view_get_fanin_fanout_size = graph_view.GetFanin(fanout).size(); const int max_size = graph_view.GetFanin(fanout).size();
if (num_ready_inputs[fanout] == graph_view_get_fanin_fanout_size) { if (num_ready_inputs[fanout] == max_size) {
ready_nodes->push_back(fanout); ready_nodes->push_back(fanout);
++back; ++back;
} }
@ -96,8 +96,8 @@ Status ComputeTopologicalOrder(
"at node = " "at node = "
<< graph.node(back).DebugString(); << graph.node(back).DebugString();
for (int i = 0; i < graph_view.num_nodes(); ++i) { for (int i = 0; i < graph_view.num_nodes(); ++i) {
const int graph_view_Get_fanin_i_size = graph_view.GetFanin(i).size(); const int max_size = graph_view.GetFanin(i).size();
if (num_ready_inputs[i] != graph_view_Get_fanin_i_size) { if (num_ready_inputs[i] != max_size) {
VLOG(1) << "Node not ready: " << graph.node(i).DebugString(); VLOG(1) << "Node not ready: " << graph.node(i).DebugString();
} }
} }