| /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()
|
| D | graph_constructor.cc | 505 int pending_count = node_def.input_size(); in InitFromEdges() local
526 pending_count = num_control_edges + 1; in InitFromEdges()
545 --pending_count; in InitFromEdges()
546 DCHECK_GE(pending_count, 0); in InitFromEdges()
549 if (pending_count == 0) { in InitFromEdges()
552 pending_count_.push_back(pending_count); in InitFromEdges()
|
| /external/tensorflow/tensorflow/core/common_runtime/ |
| D | hierarchical_tree_broadcaster.cc | 313 int pending_count = 0; // GUARDED_BY(mu) in RunTree() local
337 ++pending_count; in RunTree()
341 [this, &mu, &pending_count, &all_done](const Status& s) { in RunTree()
344 --pending_count; in RunTree()
345 if (pending_count == 0) { in RunTree()
367 ++pending_count; in RunTree()
375 [this, &mu, &pending_count, &all_done](const Status& s) { in RunTree()
378 --pending_count; in RunTree()
379 if (0 == pending_count) { in RunTree()
389 if (pending_count > 0) { in RunTree()
|
| D | pending_counts.h | 94 void set_initial_count(Handle h, size_t pending_count) { in set_initial_count() argument
97 c->pending = pending_count; in set_initial_count()
102 DCHECK_LE(pending_count, kMaxCountForPackedCounts); in set_initial_count()
103 c->pending = pending_count; in set_initial_count()
|
| /external/tensorflow/tensorflow/python/ops/ |
| D | gradients_util.py | 178 pending_count = collections.defaultdict(int)
182 pending_count[x.op] += 1
184 return reachable_to_ops, pending_count, loop_state
321 def _StopOps(from_ops, stop_gradient_ops, pending_count, xs): argument
346 if pending_count[inp.op] > 0:
616 reachable_to_ops, pending_count, loop_state = _PendingCount(
639 ready = (pending_count[op] == 0)
645 loop_exits = loop_state.ProcessUnusedLoopExits(pending_count, to_ops_set)
651 stop_ops = _StopOps(from_ops, stop_gradient_ops, pending_count, xs)
773 _UpdatePendingAndEnqueueReady(grads, op, queue, pending_count, loop_state,
[all …]
|
| D | control_flow_ops.py | 1059 def ProcessUnusedLoopExits(self, pending_count, to_ops_set): argument
1087 if pending_count[y.op] == 0:
1095 if pending_count[y.op] == 0:
1096 pending_count[y.op] = 1
|
| /external/tensorflow/tensorflow/tools/graph_transforms/ |
| D | transform_utils.cc | 186 std::vector<int> pending_count; in SortByExecutionOrder() local
187 pending_count.reserve(num_nodes); in SortByExecutionOrder()
207 pending_count.push_back(num_control_edges + 1); in SortByExecutionOrder()
209 pending_count.push_back(node_def.input_size()); in SortByExecutionOrder()
243 pending_count[output]--; in SortByExecutionOrder()
244 if (pending_count[output] == 0) { in SortByExecutionOrder()
254 if (pending_count[i] != 0) { in SortByExecutionOrder()
256 << "WITH PENDING COUNT = " << pending_count[i]; in SortByExecutionOrder()
|
| /external/python/cpython3/Lib/concurrent/futures/ |
| D | _base.py | 158 pending_count = sum(
162 waiter = _AllCompletedWaiter(pending_count, stop_on_exception=True)
164 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)
|
| /external/autotest/scheduler/ |
| D | scheduler_models.py | 1100 pending_count = self._pending_count()
1101 ready = (pending_count >= self.synch_count)
1106 self, pending_count, self.synch_count)
|