Home
last modified time | relevance | path

Searched defs:pending_count (Results 1 – 9 of 9) sorted by relevance

/external/tensorflow/tensorflow/core/distributed_runtime/
Dscheduler.cc52 bool UpdatePending(const Edge* edge, std::vector<int>* pending_count) { in UpdatePending()
80 std::vector<int> pending_count(graph_->num_node_ids()); in ComputeAsap() local
122 std::vector<int> pending_count; in ComputeAlap() local
214 std::vector<int> pending_count(graph_->num_node_ids()); in ComputeSchedule() local
/external/rust/crates/futures/tests/
Datomic_waker.rs22 let mut pending_count = 0; in basic() localVariable
/external/tensorflow/tensorflow/core/graph/
Dvalidate.cc67 std::vector<int> pending_count(graph.num_node_ids(), 0); in ValidateGraphHasNoCycle() local
/external/tensorflow/tensorflow/python/ops/
Dgradients_util.py259 def _StopOps(from_ops, stop_gradient_ops, pending_count, xs_set): argument
746 def _UpdatePendingAndEnqueueReady(grads, op, queue, pending_count, loop_state, argument
Dcontrol_flow_state.py513 def ProcessUnusedLoopExits(self, pending_count, to_ops_set): argument
/external/tensorflow/tensorflow/core/common_runtime/
Dhierarchical_tree_broadcaster.cc313 int pending_count = 0; // TF_GUARDED_BY(mu) in RunTree() local
Dpending_counts.h102 void set_initial_count(Handle h, size_t pending_count) { in set_initial_count()
Dgraph_constructor.cc705 int pending_count = node_def.input_size(); in InitFromEdges() local
/external/tensorflow/tensorflow/tools/graph_transforms/
Dtransform_utils.cc188 std::vector<int> pending_count; in SortByExecutionOrder() local