reference, declaration → definition definition → references, declarations, derived classes, virtual overrides reference to multiple definitions → definitions unreferenced |
1325 src = find_domain_node(ctx, graph, map); 1326 dst = find_range_node(ctx, graph, map); 1330 if (!is_node(graph, src) || !is_node(graph, dst)) 1330 if (!is_node(graph, src) || !is_node(graph, dst)) 1347 graph->edge[graph->n_edge].src = src; 1347 graph->edge[graph->n_edge].src = src; 1348 graph->edge[graph->n_edge].dst = dst; 1348 graph->edge[graph->n_edge].dst = dst; 1349 graph->edge[graph->n_edge].map = map; 1349 graph->edge[graph->n_edge].map = map; 1350 graph->edge[graph->n_edge].types = 0; 1350 graph->edge[graph->n_edge].types = 0; 1351 graph->edge[graph->n_edge].tagged_condition = NULL; 1351 graph->edge[graph->n_edge].tagged_condition = NULL; 1352 graph->edge[graph->n_edge].tagged_validity = NULL; 1352 graph->edge[graph->n_edge].tagged_validity = NULL; 1353 set_type(&graph->edge[graph->n_edge], data->type); 1353 set_type(&graph->edge[graph->n_edge], data->type); 1355 graph->edge[graph->n_edge].tagged_condition = 1355 graph->edge[graph->n_edge].tagged_condition = 1358 graph->edge[graph->n_edge].tagged_validity = 1358 graph->edge[graph->n_edge].tagged_validity = 1361 edge = graph_find_matching_edge(graph, &graph->edge[graph->n_edge]); 1361 edge = graph_find_matching_edge(graph, &graph->edge[graph->n_edge]); 1361 edge = graph_find_matching_edge(graph, &graph->edge[graph->n_edge]); 1363 graph->n_edge++; 1366 if (edge == &graph->edge[graph->n_edge]) 1366 if (edge == &graph->edge[graph->n_edge]) 1367 return graph_edge_table_add(ctx, graph, data->type, 1368 &graph->edge[graph->n_edge++]); 1368 &graph->edge[graph->n_edge++]); 1370 if (merge_edge(edge, &graph->edge[graph->n_edge]) < 0) 1370 if (merge_edge(edge, &graph->edge[graph->n_edge]) < 0) 1373 return graph_edge_table_add(ctx, graph, data->type, edge);