Lines Matching defs:dag
27 #include "util/dag.h"
94 struct dag *dag;
122 struct dag_node dag; /* must be first for util_dynarray_foreach */
166 list_for_each_entry (struct ir3_sched_node, __n, __list, dag.link)
305 dag_prune_head(ctx->dag, &n->dag);
637 foreach_sched_node (n, &ctx->dag->heads) {
730 foreach_sched_node (n, &ctx->dag->heads) {
774 foreach_sched_node (n, &ctx->dag->heads) {
805 foreach_sched_node (n, &ctx->dag->heads) {
809 util_dynarray_foreach (&n->dag.edges, struct dag_edge, edge) {
812 di(child->instr, " -> (%d parents) ", child->dag.parent_count);
886 /* don't need to remove old dag edge since old addr is
938 /* don't need to remove old dag edge since old pred is
965 struct ir3_sched_node *n = rzalloc(ctx->dag, struct ir3_sched_node);
967 dag_init_node(ctx->dag, &n->dag);
997 dag_add_edge(&sn->dag, &n->dag, NULL);
1090 util_dynarray_foreach (&n->dag.edges, struct dag_edge, edge) {
1101 ctx->dag = dag_create(ctx);
1108 dag_traverse_bottom_up(ctx->dag, sched_dag_max_delay_cb, NULL);
1114 ralloc_free(ctx->dag);
1115 ctx->dag = NULL;