Lines Matching defs:dag
27 #include "util/dag.h"
67 struct dag *dag;
76 struct dag_node dag; /* must be first for util_dynarray_foreach */
87 list_for_each_entry (struct ir3_postsched_node, __n, __list, dag.link)
117 dag_prune_head(ctx->dag, &n->dag);
145 foreach_sched_node (n, &ctx->dag->heads) {
148 util_dynarray_foreach (&n->dag.edges, struct dag_edge, edge) {
152 di(child->instr, " -> (%d parents) ", child->dag.parent_count);
186 foreach_sched_node (n, &ctx->dag->heads) {
203 foreach_sched_node (n, &ctx->dag->heads) {
217 foreach_sched_node (n, &ctx->dag->heads) {
237 foreach_sched_node (n, &ctx->dag->heads) {
265 foreach_sched_node (n, &ctx->dag->heads) {
290 foreach_sched_node (n, &ctx->dag->heads) {
310 foreach_sched_node (n, &ctx->dag->heads) {
331 foreach_sched_node (n, &ctx->dag->heads) {
385 dag_add_edge(&before->dag, &after->dag, NULL);
387 dag_add_edge(&after->dag, &before->dag, NULL);
524 dag_init_node(ctx->dag, &n->dag);
536 util_dynarray_foreach (&n->dag.edges, struct dag_edge, edge) {
550 ctx->dag = dag_create(ctx->mem_ctx);
596 dag_add_edge(&sn->dag, &n->dag, NULL);
605 dag_add_edge(&in->dag, &n->dag, NULL);
612 dag_add_edge(&kn->dag, &n->dag, NULL);
618 dag_traverse_bottom_up(ctx->dag, sched_dag_max_delay_cb, NULL);
626 ctx->dag = NULL;