reference, declaration → definition definition → references, declarations, derived classes, virtual overrides reference to multiple definitions → definitions unreferenced |
3512 dst->n_edge = 0; 3526 dst_src = graph_find_node(ctx, dst, edge->src->space); 3527 dst_dst = graph_find_node(ctx, dst, edge->dst->space); 3530 if (!is_node(dst, dst_src) || !is_node(dst, dst_dst)) { 3530 if (!is_node(dst, dst_src) || !is_node(dst, dst_dst)) { 3542 dst->edge[dst->n_edge].src = dst_src; 3542 dst->edge[dst->n_edge].src = dst_src; 3543 dst->edge[dst->n_edge].dst = dst_dst; 3543 dst->edge[dst->n_edge].dst = dst_dst; 3544 dst->edge[dst->n_edge].map = map; 3544 dst->edge[dst->n_edge].map = map; 3545 dst->edge[dst->n_edge].tagged_condition = tagged_condition; 3545 dst->edge[dst->n_edge].tagged_condition = tagged_condition; 3546 dst->edge[dst->n_edge].tagged_validity = tagged_validity; 3546 dst->edge[dst->n_edge].tagged_validity = tagged_validity; 3547 dst->edge[dst->n_edge].types = edge->types; 3547 dst->edge[dst->n_edge].types = edge->types; 3548 dst->n_edge++; 3555 if (graph_edge_tables_add(ctx, dst, 3556 &dst->edge[dst->n_edge - 1]) < 0) 3556 &dst->edge[dst->n_edge - 1]) < 0)