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