699               int nreg_moves4e = (SCHED_TIME (e->dest->cuid)  in schedule_reg_moves()
700                                         - SCHED_TIME (e->src->cuid)) / ii;  in schedule_reg_moves()
703               nreg_moves4e = (SCHED_TIME (e->dest->cuid)  in schedule_reg_moves()
704                                     - SCHED_TIME (e->src->cuid) + ii) / ii;  in schedule_reg_moves()
708               if (SCHED_ROW (e->dest->cuid) == SCHED_ROW (e->src->cuid)  in schedule_reg_moves()
709                     && SCHED_COLUMN (e->dest->cuid) < SCHED_COLUMN (e->src->cuid))  in schedule_reg_moves()
776               int dest_copy = (SCHED_TIME (e->dest->cuid)  in schedule_reg_moves()
777                                    - SCHED_TIME (e->src->cuid)) / ii;  in schedule_reg_moves()
780                 dest_copy = (SCHED_TIME (e->dest->cuid)  in schedule_reg_moves()
781                                  - SCHED_TIME (e->src->cuid) + ii) / ii;  in schedule_reg_moves()
783               if (SCHED_ROW (e->dest->cuid) == SCHED_ROW (e->src->cuid)  in schedule_reg_moves()
784                     && SCHED_COLUMN (e->dest->cuid) < SCHED_COLUMN (e->src->cuid))  in schedule_reg_moves()
792                     bitmap_set_bit (move->uses, e->dest->cuid);  in schedule_reg_moves()
794                       bitmap_set_bit (distance1_uses, e->dest->cuid);  in schedule_reg_moves()
941     calculate_stage_count (ps, SCHED_TIME (g->closing_branch->cuid) - (ii - 1));  in optimize_sc()
969   if (SMODULO (SCHED_TIME (g->closing_branch->cuid), ii) == ii - 1)  in optimize_sc()
982       int branch_cycle = SCHED_TIME (g->closing_branch->cuid);  in optimize_sc()
991                      g->closing_branch->cuid,  in optimize_sc()
1036           if (next_ps_i->id == g->closing_branch->cuid)  in optimize_sc()
1042           try_scheduling_node_in_cycle (ps, g->closing_branch->cuid, c,  in optimize_sc()
1060               try_scheduling_node_in_cycle (ps, g->closing_branch->cuid,  in optimize_sc()
1074             update_node_sched_params (g->closing_branch->cuid, ii, c,  in optimize_sc()
1635                       int amount = (SCHED_TIME (g->closing_branch->cuid)  in sms_schedule()
1672               int amount = SCHED_TIME (g->closing_branch->cuid) - (ps->ii - 1);  in sms_schedule()
1893                  "; ii = %d\n\n", u_node->cuid, INSN_UID (u_node->insn), ii);  in get_sched_window()
1903           int v = e->src->cuid;  in get_sched_window()
1931           int v = e->dest->cuid;  in get_sched_window()
2058     if (bitmap_bit_p (sched_nodes, e->src->cuid)  in calculate_must_precede_follow()
2059           && ((SCHED_TIME (e->src->cuid) - (e->distance * ii)) ==  in calculate_must_precede_follow()
2063             fprintf (dump_file, "%d ", e->src->cuid);  in calculate_must_precede_follow()
2065           bitmap_set_bit (must_precede, e->src->cuid);  in calculate_must_precede_follow()
2083     if (bitmap_bit_p (sched_nodes, e->dest->cuid)  in calculate_must_precede_follow()
2084           && ((SCHED_TIME (e->dest->cuid) + (e->distance * ii)) ==  in calculate_must_precede_follow()
2088             fprintf (dump_file, "%d ", e->dest->cuid);  in calculate_must_precede_follow()
2090           bitmap_set_bit (must_follow, e->dest->cuid);  in calculate_must_precede_follow()
2362       int v = e->src->cuid;  in compute_split_row()
2381       int v = e->dest->cuid;  in compute_split_row()