Searched refs:is_candidate (Results 1 – 5 of 5) sorted by relevance
94 bool* is_candidate) { in IsNodeOutputPortHostFriendly() argument95 *is_candidate = false; in IsNodeOutputPortHostFriendly()133 *is_candidate = true; in IsNodeOutputPortHostFriendly()139 *is_candidate = true; in IsNodeOutputPortHostFriendly()172 *is_candidate = true; in IsNodeOutputPortHostFriendly()223 const NodeDef& node, bool* is_candidate) { in IsNodeHostCandidate() argument224 *is_candidate = false; in IsNodeHostCandidate()228 *is_candidate = true; in IsNodeHostCandidate()267 *is_candidate = true; in IsNodeHostCandidate()330 bool is_candidate = false; in Optimize() local[all …]
92 const std::function<bool(const NodeDef&)>& is_candidate, in FindCandidateRecomputeNodes() argument96 if (!is_candidate(node)) { in FindCandidateRecomputeNodes()130 const std::function<bool(const NodeDef&)>& is_candidate, in connected_subgraph() argument149 is_candidate(*input_node)) { in connected_subgraph()156 if (expanded_nodes->count(output) == 0 && is_candidate(*output)) { in connected_subgraph()
324 auto is_candidate = [this](const BeamProbability& prob) { in Step()330 if (!is_candidate(b->oldp)) { in Step()359 if (is_candidate(c.newp)) { in Step()
329 auto is_candidate = [this](const BeamProbability& prob) { in Step()335 if (!is_candidate(b->oldp)) { in Step()364 if (is_candidate(c.newp)) { in Step()
2588 static int is_candidate(__isl_keep isl_schedule_node *node) in is_candidate() function2615 tilable = is_candidate(node); in is_outer_tilable()2626 tilable = is_candidate(ancestor); in is_outer_tilable()