Lines Matching defs:edges
82 // Function scans the graph for candidate edges where we
208 // Get the input nodes and edges
209 std::vector<const Edge*> edges;
210 TF_CHECK_OK(n->input_edges(&edges));
211 if (edges.size() != 4) {
219 CHECK_EQ(BaseType(edges[0]->src()->output_type(edges[0]->src_output())),
220 BaseType(edges[1]->src()->output_type(edges[1]->src_output())));
221 CHECK_EQ(BaseType(edges[0]->src()->output_type(edges[0]->src_output())),
224 // Check ordering of edges
226 CHECK_EQ((edges[i]->dst_input() == i), true);
234 .Input(edges[0]->src(), edges[0]->src_output())
235 .Input(edges[1]->src(), edges[1]->src_output())
236 .Input(edges[2]->src(), edges[2]->src_output())
237 .Input(edges[3]->src(), edges[3]->src_output())
244 // Change the destination of any control edges to the InputConversion node
245 if (edges.size() != n->in_edges().size()) {
259 if (GetNodeAttr(edges[0]->src()->def(), "data_format", &data_format) ==
271 // Now that we have added edges from src->conversion_node, let's add edge from
273 CHECK_NOTNULL((*g)->AddEdge(conversion_node, 0, n, edges[0]->dst_input()));
274 CHECK_NOTNULL((*g)->AddEdge(conversion_node, 1, n, edges[1]->dst_input()));
275 CHECK_NOTNULL((*g)->AddEdge(conversion_node, 2, n, edges[2]->dst_input()));
276 CHECK_NOTNULL((*g)->AddEdge(conversion_node, 3, n, edges[3]->dst_input()));
282 (*g)->RemoveEdge(edges[0]);
283 (*g)->RemoveEdge(edges[1]);
284 (*g)->RemoveEdge(edges[2]);
285 (*g)->RemoveEdge(edges[3]);
304 for (const Edge* e : (*g)->edges()) {
308 // We skip control edges.
343 // Process all candidate edges and insert conversion nodes on them.
389 // Process all candidate edges and insert conversion nodes on them.
