45 struct schedule_node {  struct
71         struct schedule_node *node;  argument
82         struct schedule_node *last_r[6];
83         struct schedule_node *last_rf[64];
84         struct schedule_node *last_sf;
85         struct schedule_node *last_vpm_read;
86         struct schedule_node *last_tmu_write;
87         struct schedule_node *last_tmu_config;
88         struct schedule_node *last_tlb;
89         struct schedule_node *last_vpm;
90         struct schedule_node *last_unif;
91         struct schedule_node *last_rtop;
99         struct schedule_node *before,  in add_dep()
100         struct schedule_node *after,  in add_dep()
111                 struct schedule_node *t = before;  in add_dep()
139               struct schedule_node *before,  in add_read_dep()
140               struct schedule_node *after)  in add_read_dep()
147               struct schedule_node **before,  in add_write_dep()
148               struct schedule_node *after)  in add_write_dep()
174 process_mux_deps(struct schedule_state *state, struct schedule_node *n,  in process_mux_deps()
192 process_waddr_deps(struct schedule_state *state, struct schedule_node *n,  in process_waddr_deps()
247 process_cond_deps(struct schedule_state *state, struct schedule_node *n,  in process_cond_deps()
255 process_pf_deps(struct schedule_state *state, struct schedule_node *n,  in process_pf_deps()
263 process_uf_deps(struct schedule_state *state, struct schedule_node *n,  in process_uf_deps()
278 calculate_deps(struct schedule_state *state, struct schedule_node *n)  in calculate_deps()
441         list_for_each_entry(struct schedule_node, node, schedule_list, link)  in calculate_forward_deps()
456                 calculate_deps(&state, (struct schedule_node *)node);  in calculate_reverse_deps()
728 static struct schedule_node *
732                                struct schedule_node *prev_inst)  in choose_instruction_to_schedule()
734         struct schedule_node *chosen = NULL;  in choose_instruction_to_schedule()
745         list_for_each_entry(struct schedule_node, n, schedule_list, link) {  in choose_instruction_to_schedule()
892         list_for_each_entry(struct schedule_node, n, schedule_list, link) {  in dump_state()
898                         struct schedule_node *child = n->children[i].node;  in dump_state()
948 instruction_latency(struct schedule_node *before, struct schedule_node *after)  in instruction_latency()
975 compute_delay(struct schedule_node *n)  in compute_delay()
993                            struct schedule_node *node,  in mark_instruction_scheduled()
1000                 struct schedule_node *child =  in mark_instruction_scheduled()
1243         list_for_each_entry_safe(struct schedule_node, n, schedule_list, link) {  in schedule_instructions()
1249                 struct schedule_node *chosen =  in schedule_instructions()
1254                 struct schedule_node *merge = NULL;  in schedule_instructions()
1384                 struct schedule_node *n =  in qpu_schedule_instructions_block()
1385                         rzalloc(mem_ctx, struct schedule_node);  in qpu_schedule_instructions_block()
1396         list_for_each_entry(struct schedule_node, n, &schedule_list, link) {  in qpu_schedule_instructions_block()