Lines Matching refs:dest
32 char *dest; member
75 static void add_edge(const char *source, const char *dest, in add_edge() argument
94 edge->dest = g_strdup(dest); in add_edge()
95 edge->edge_name = g_strdup(opts->edge_name ?: dest); in add_edge()
117 g_free(temp->dest); in destroy_edges()
200 const char *dest) in search_list_edges() argument
207 if (g_strcmp0(tmp->dest, dest) == 0) { in search_list_edges()
231 n = search_node(e->dest); in search_machine()
317 path = search_node(path->path_edge->dest); in qos_print_cb()
421 dest_node = search_node(e->dest); in qos_traverse_graph()
425 e->dest, v->name, e->dest); in qos_traverse_graph()
468 QOSGraphEdge *qos_graph_get_edge(const char *node, const char *dest) in qos_graph_get_edge() argument
471 return search_list_edges(list, dest); in qos_graph_get_edge()
487 return edge->dest; in qos_graph_edge_get_dest()
530 bool qos_graph_has_edge(const char *start, const char *dest) in qos_graph_has_edge() argument
533 QOSGraphEdge *e = search_list_edges(list, dest); in qos_graph_has_edge()
692 qos_graph_node_set_availability_explicit(e->dest, av); in qos_graph_node_set_availability_explicit()
725 qos_graph_node_set_availability_explicit(e->dest, av); in qos_graph_node_set_availability()
824 dest_node = g_hash_table_lookup(node_table, e->dest); in qos_dump_graph()
826 e->dest, e->type, dest_node); in qos_dump_graph()