Lines Matching defs:dag

40 #include "util/dag.h"
47 struct dag_node dag;
75 struct dag *dag;
108 dag_add_edge(&before->dag, &after->dag, edge_data);
110 dag_add_edge(&after->dag, &before->dag, edge_data);
452 calculate_forward_deps(struct v3d_compile *c, struct dag *dag,
458 state.dag = dag;
467 calculate_reverse_deps(struct v3d_compile *c, struct dag *dag,
473 state.dag = dag;
484 struct dag *dag;
1038 list_for_each_entry(struct schedule_node, n, &scoreboard->dag->heads,
1039 dag.link) {
1052 !list_is_singular(&scoreboard->dag->heads)) {
1294 dump_state(const struct v3d_device_info *devinfo, struct dag *dag)
1296 list_for_each_entry(struct schedule_node, n, &dag->heads, dag.link) {
1301 util_dynarray_foreach(&n->dag.edges, struct dag_edge, edge) {
1310 child->dag.parent_count,
1396 util_dynarray_foreach(&n->dag.edges, struct dag_edge, edge) {
1410 pre_remove_head(struct dag *dag, struct schedule_node *n)
1412 list_delinit(&n->dag.link);
1414 util_dynarray_foreach(&n->dag.edges, struct dag_edge, edge) {
1416 dag_remove_edge(dag, edge);
1422 struct dag *dag,
1429 util_dynarray_foreach(&node->dag.edges, struct dag_edge, edge) {
1441 dag_prune_head(dag, &node->dag);
2089 while (!list_is_empty(&scoreboard->dag->heads)) {
2103 dump_state(devinfo, scoreboard->dag);
2121 pre_remove_head(scoreboard->dag, chosen);
2127 pre_remove_head(scoreboard->dag, merge);
2156 devinfo, scoreboard->dag,
2190 mark_instruction_scheduled(devinfo, scoreboard->dag, time, chosen);
2193 mark_instruction_scheduled(devinfo, scoreboard->dag, time, merge);
2223 scoreboard->dag = dag_create(mem_ctx);
2234 dag_init_node(scoreboard->dag, &n->dag);
2241 calculate_forward_deps(c, scoreboard->dag, &setup_list);
2242 calculate_reverse_deps(c, scoreboard->dag, &setup_list);
2244 dag_traverse_bottom_up(scoreboard->dag, compute_delay, c);
2252 scoreboard->dag = NULL;