OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
refs:pending_count
(Results
1 - 12
of
12
) sorted by null
/external/tensorflow/tensorflow/core/distributed_runtime/
scheduler.cc
52
bool UpdatePending(const Edge* edge, std::vector<int>*
pending_count
) {
56
(*
pending_count
)[out->id()] -= 2;
59
return ((*
pending_count
)[out->id()] == 1);
61
int count = (*
pending_count
)[out->id()];
62
(*
pending_count
)[out->id()] |= 0x1;
68
return (--(*
pending_count
)[out->id()] == 0);
80
std::vector<int>
pending_count
(graph_->num_node_ids());
81
InitializePending(graph_, &
pending_count
);
110
bool is_ready = UpdatePending(out_edge, &
pending_count
);
122
std::vector<int>
pending_count
;
local
[
all
...]
/frameworks/native/services/vr/bufferhubd/
buffer_hub.h
55
size_t
pending_count
= 0;
member in struct:android::dvr::BufferHubChannel::BufferInfo
66
size_t
pending_count
, uint64_t state, uint64_t signaled_mask,
76
pending_count
(
pending_count
),
buffer_hub.cpp
94
stream << std::setw(9) << info.
pending_count
;
/external/tensorflow/tensorflow/core/common_runtime/
pending_counts.h
94
void set_initial_count(Handle h, size_t
pending_count
) {
97
c->pending =
pending_count
;
102
DCHECK_LE(
pending_count
, kMaxCountForPackedCounts);
103
c->pending =
pending_count
;
/external/tensorflow/tensorflow/python/ops/
gradients_impl.py
154
'
pending_count
[op._id]' indicates the number of backprop inputs
196
pending_count
= [0] * (graph._last_id + 1)
200
pending_count
[x.op._id] += 1
202
return
pending_count
, loop_state
305
def _StopOps(from_ops, stop_gradient_ops,
pending_count
):
311
no predecessor in `from_ops`. `
pending_count
` is the result of
313
iff
pending_count
[op._id] > 0.
320
pending_count
: List of integers, indexed by operation id.
329
if
pending_count
[inp.op._id] > 0:
518
pending_count
, loop_state = _PendingCount
[
all
...]
control_flow_ops.py
[
all
...]
/external/tensorflow/tensorflow/core/graph/
graph_constructor.cc
477
int
pending_count
= node_def.input_size();
local
498
pending_count
= num_control_edges + 1;
517
--
pending_count
;
518
DCHECK_GE(
pending_count
, 0);
521
if (
pending_count
== 0) {
524
pending_count_.push_back(
pending_count
);
[
all
...]
/external/python/cpython3/Lib/concurrent/futures/
_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/tensorflow/tensorflow/tools/graph_transforms/
transform_utils.cc
186
std::vector<int>
pending_count
;
local
187
pending_count
.reserve(num_nodes);
208
pending_count
.push_back(num_control_edges + 1);
210
pending_count
.push_back(node_def.input_size());
241
// Update
pending_count
for outputs.
244
pending_count
[output]--;
245
if (
pending_count
[output] == 0) {
/external/python/futures/concurrent/futures/
_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/
scheduler_models.py
[
all
...]
/external/tensorflow/tensorflow/c/
c_api.cc
399
std::vector<int>
pending_count
(g.num_node_ids(), 0);
404
pending_count
[i] = n->in_edges().size();
407
//
pending_count
to make sure that the loop is visited.
410
pending_count
[i]--;
414
if (
pending_count
[i] == 0) {
427
pending_count
[output_id]--;
428
if (
pending_count
[output_id] == 0) {
436
for (int i = 0; i <
pending_count
.size() && nodes_in_cycle.size() < 3;
438
if (
pending_count
[i] != 0) {
[
all
...]
Completed in 976 milliseconds