| /external/tensorflow/tensorflow/core/distributed_runtime/ |
| D | scheduler.cc | 52 bool UpdatePending(const Edge* edge, std::vector<int>* pending_count) { in UpdatePending() argument
56 (*pending_count)[out->id()] -= 2; in UpdatePending()
59 return ((*pending_count)[out->id()] == 1); in UpdatePending()
61 int count = (*pending_count)[out->id()]; in UpdatePending()
62 (*pending_count)[out->id()] |= 0x1; in UpdatePending()
68 return (--(*pending_count)[out->id()] == 0); in UpdatePending()
80 std::vector<int> pending_count(graph_->num_node_ids()); in ComputeAsap() local
81 InitializePending(graph_, &pending_count); in ComputeAsap()
110 bool is_ready = UpdatePending(out_edge, &pending_count); in ComputeAsap()
122 std::vector<int> pending_count; in ComputeAlap() local
[all …]
|
| /external/tensorflow/tensorflow/core/graph/ |
| D | validate.cc | 67 std::vector<int> pending_count(graph.num_node_ids(), 0); in ValidateGraphHasNoCycle() local
72 pending_count[i] = n->in_edges().size(); in ValidateGraphHasNoCycle()
78 pending_count[i]--; in ValidateGraphHasNoCycle()
82 if (pending_count[i] == 0) { in ValidateGraphHasNoCycle()
95 pending_count[output_id]--; in ValidateGraphHasNoCycle()
96 if (pending_count[output_id] == 0) { in ValidateGraphHasNoCycle()
104 for (int i = 0; i < pending_count.size() && nodes_in_cycle.size() < 3; in ValidateGraphHasNoCycle()
106 if (pending_count[i] != 0) { in ValidateGraphHasNoCycle()
|
| /external/tensorflow/tensorflow/core/common_runtime/ |
| D | hierarchical_tree_broadcaster.cc | 313 int pending_count = 0; // TF_GUARDED_BY(mu) in RunTree() local
344 ++pending_count; in RunTree()
348 [this, &mu, &pending_count, &all_done](const Status& s) { in RunTree()
351 --pending_count; in RunTree()
352 if (pending_count == 0) { in RunTree()
374 ++pending_count; in RunTree()
382 [this, &mu, &pending_count, &all_done](const Status& s) { in RunTree()
385 --pending_count; in RunTree()
386 if (0 == pending_count) { in RunTree()
396 if (pending_count > 0) { in RunTree()
|
| D | pending_counts.h | 102 void set_initial_count(Handle h, size_t pending_count) { in set_initial_count() argument
106 c.pending = pending_count; in set_initial_count()
111 DCHECK_LE(pending_count, kMaxCountForPackedCounts); in set_initial_count()
114 c.pending = pending_count; in set_initial_count()
|
| D | graph_constructor.cc | 705 int pending_count = node_def.input_size(); in InitFromEdges() local
726 pending_count = num_control_edges + 1; in InitFromEdges()
745 --pending_count; in InitFromEdges()
746 DCHECK_GE(pending_count, 0); in InitFromEdges()
749 if (pending_count == 0) { in InitFromEdges()
752 pending_count_.push_back(pending_count); in InitFromEdges()
|
| /external/rust/crates/futures/tests/ |
| D | atomic_waker.rs | 22 let mut pending_count = 0; in basic() localVariable
29 assert_eq!(0, pending_count); in basic()
30 pending_count += 1; in basic()
|
| /external/tensorflow/tensorflow/python/ops/ |
| D | gradients_util.py | 128 pending_count = collections.defaultdict(int)
132 pending_count[x.op] += 1
134 return reachable_to_ops, pending_count, loop_state
259 def _StopOps(from_ops, stop_gradient_ops, pending_count, xs_set): argument
284 if pending_count[inp.op] > 0:
551 reachable_to_ops, pending_count, loop_state = _PendingCount(
574 ready = (pending_count[op] == 0)
580 loop_exits = loop_state.ProcessUnusedLoopExits(pending_count, to_ops_set)
586 stop_ops = _StopOps(from_ops, stop_gradient_ops, pending_count, xs_set)
726 _UpdatePendingAndEnqueueReady(grads, op, queue, pending_count, loop_state,
[all …]
|
| D | control_flow_state.py | 513 def ProcessUnusedLoopExits(self, pending_count, to_ops_set): argument
541 if pending_count[y.op] == 0:
549 if pending_count[y.op] == 0:
550 pending_count[y.op] = 1
|
| /external/tensorflow/tensorflow/tools/graph_transforms/ |
| D | transform_utils.cc | 188 std::vector<int> pending_count; in SortByExecutionOrder() local
189 pending_count.reserve(num_nodes); in SortByExecutionOrder()
209 pending_count.push_back(num_control_edges + 1); in SortByExecutionOrder()
211 pending_count.push_back(node_def.input_size()); in SortByExecutionOrder()
245 pending_count[output]--; in SortByExecutionOrder()
246 if (pending_count[output] == 0) { in SortByExecutionOrder()
256 if (pending_count[i] != 0) { in SortByExecutionOrder()
258 << "WITH PENDING COUNT = " << pending_count[i]; in SortByExecutionOrder()
|
| /external/python/cpython3/Lib/concurrent/futures/ |
| D | _base.py | 163 pending_count = sum(
167 waiter = _AllCompletedWaiter(pending_count, stop_on_exception=True)
169 waiter = _AllCompletedWaiter(pending_count, stop_on_exception=False)
|
| /external/python/futures/concurrent/futures/ |
| D | _base.py | 160 pending_count = sum(
164 waiter = _AllCompletedWaiter(pending_count, stop_on_exception=True)
166 waiter = _AllCompletedWaiter(pending_count, stop_on_exception=False)
|