util/hash_table: update users to use new optimal integer hash functions

[mesa.git] / src / gallium / drivers / vc4 / vc4_qir_schedule.c

diff --git a/src/gallium/drivers/vc4/vc4_qir_schedule.c b/src/gallium/drivers/vc4/vc4_qir_schedule.c
index 28f65a9af93ece029708f06bf184547fae564ed8..fdd922fde4d5fca5cf4feef8b7d8618ace0123ee 100644 (file)
--- a/src/gallium/drivers/vc4/vc4_qir_schedule.c
+++ b/src/gallium/drivers/vc4/vc4_qir_schedule.c
@@ -536,9 +536,9 @@ dump_state(struct vc4_compile *c, struct schedule_state *state)
                 fprintf(stderr, " (%d cost)\n",
                         get_register_pressure_cost(state, n->inst));
 
-                util_dynarray_foreach(&n->dag.children, struct schedule_node *,
-                                      childp) {
-                        struct schedule_node *child = *childp;
+                util_dynarray_foreach(&n->dag.edges, struct dag_edge, edge) {
+                        struct schedule_node *child =
+                                (struct schedule_node *)edge->child;
                         fprintf(stderr, "   - ");
                         qir_dump_inst(c, child->inst);
                         fprintf(stderr, " (%d parents)\n",
@@ -622,7 +622,7 @@ schedule_instructions(struct vc4_compile *c,
         }
 
         state->time = 0;
-        while (!list_empty(&state->dag->heads)) {
+        while (!list_is_empty(&state->dag->heads)) {
                 struct schedule_node *chosen = choose_instruction(state);
                 struct qinst *inst = chosen->inst;