Searched defs:in_edge (Results 1 – 16 of 16) sorted by relevance
73 for (const auto& in_edge : n.in_edges()) { in input_types() local79 for (const auto& in_edge : n.in_edges()) { in input_types() local
247 for (const Edge* in_edge : n->in_edges()) { in RewriteIntoAddN() local
387 for (const Edge* in_edge : n->in_edges()) { in AddNodeToConstantGraph() local
1291 for (const Edge* in_edge : n->in_edges()) { in CheckFetch() local
448 const Edge* in_edge; in FunctionalizeLoop() local464 const Edge* in_edge; in FunctionalizeLoop() local
641 for (const string& in_edge : map_entry.second->input()) { in PruneGraphDefInto() local903 for (const Edge* in_edge : n->in_edges()) { in ReplaceNode() local
779 const Edge* in_edge; in BuildIfNode() local
166 for (const Edge* in_edge : n->in_edges()) { in ReverseDFSFromHelper() local176 for (const Edge* in_edge : n->in_edges()) { in ReverseDFSFromHelper() local
373 for (const Edge* in_edge : node->in_edges()) { in OptimizeControlFlowColocation() local382 for (const Edge* in_edge : node->in_edges()) { in OptimizeControlFlowColocation() local
144 for (const Edge* in_edge : n->in_edges()) { in PartiallyDeclusterNode() local
903 for (const Edge* in_edge : n->in_edges()) { in GetInputPreds() local
144 const Edge* in_edge = nullptr; in ReplaceBroadcast() local
148 for (const Edge* in_edge : curr->in_edges()) { in ComputeAlap() local
1077 for (const Edge* in_edge : n->in_edges()) { in CheckFetches() local
590 for (const SimpleEdge* in_edge : in_edges) { in ContractEdge() local629 for (const auto& in_edge : dst->in_edges()) { in ContractEdge() local
50 return [node_names](const Edge* in_edge) -> bool { in MakeInputEdgeCandidateFn()