Cross Reference: /xsrc/external/mit/MesaLib/dist/src/compiler/nir/nir

Lines Matching defs:dag
25 #include "util/dag.h"
62    struct dag_node dag; /* must be first for our u_dynarray_foreach */
86    struct dag *dag;
215       dag_add_edge(&before->dag, &after->dag, NULL);
217       dag_add_edge(&after->dag, &before->dag, NULL);
603    list_for_each_entry(nir_schedule_node, n, &scoreboard->dag->heads, dag.link) {
621    list_for_each_entry(nir_schedule_node, n, &scoreboard->dag->heads, dag.link) {
649    list_for_each_entry(nir_schedule_node, n, &scoreboard->dag->heads, dag.link) {
667    list_for_each_entry(nir_schedule_node, n, &scoreboard->dag->heads, dag.link) {
690    list_for_each_entry(nir_schedule_node, n, &scoreboard->dag->heads, dag.link) {
711    list_for_each_entry(nir_schedule_node, n, &scoreboard->dag->heads, dag.link) {
729    list_for_each_entry(nir_schedule_node, n, &scoreboard->dag->heads, dag.link) {
752    list_for_each_entry(nir_schedule_node, n, &scoreboard->dag->heads, dag.link) {
770    list_for_each_entry(nir_schedule_node, n, &scoreboard->dag->heads, dag.link) {
786    list_for_each_entry(nir_schedule_node, n, &scoreboard->dag->heads, dag.link) {
803    list_for_each_entry(nir_schedule_node, n, &scoreboard->dag->heads, dag.link) {
808       util_dynarray_foreach(&n->dag.edges, struct dag_edge, edge) {
811          fprintf(stderr, " -> (%d parents) ", child->dag.parent_count);
933    util_dynarray_foreach(&n->dag.edges, struct dag_edge, edge) {
939       if (child->dag.parent_count == 1) {
948    dag_prune_head(scoreboard->dag, &n->dag);
957    while (!list_is_empty(&scoreboard->dag->heads)) {
1021    util_dynarray_foreach(&n->dag.edges, struct dag_edge, edge) {
1035    scoreboard->dag = dag_create(mem_ctx);
1043       dag_init_node(scoreboard->dag, &n->dag);
1051    dag_traverse_bottom_up(scoreboard->dag, nir_schedule_dag_max_delay_cb, NULL);