Searched refs:sched_nodes (Results 1 - 1 of 1) sorted by relevance
| /haiku-buildtools/gcc/gcc/ |
| H A D | modulo-sched.c | 971 sbitmap sched_nodes = sbitmap_alloc (g->num_nodes);
1016 bitmap_ones (sched_nodes);
1020 if (get_sched_window (ps, g->closing_branch, sched_nodes, ii, &start,
1071 step, ii, sched_nodes,
1088 sched_nodes, &num_splits,
1106 branch_cycle, sched_nodes,
1133 free (sched_nodes);
1904 sbitmap sched_nodes, int ii, int *start_p, int *step_p,
1922 psp_not_empty = bitmap_and (psp, u_node_preds, sched_nodes);
1923 pss_not_empty = bitmap_and (pss, u_node_succs, sched_nodes);
968 sbitmap sched_nodes = sbitmap_alloc (g->num_nodes); local
1900 get_sched_window(partial_schedule_ptr ps, ddg_node_ptr u_node, sbitmap sched_nodes, int ii, int *start_p, int *step_p, int *end_p) argument
2068 calculate_must_precede_follow(ddg_node_ptr u_node, int start, int end, int step, int ii, sbitmap sched_nodes, sbitmap must_precede, sbitmap must_follow) argument
2155 try_scheduling_node_in_cycle(partial_schedule_ptr ps, int u, int cycle, sbitmap sched_nodes, int *num_splits, sbitmap must_precede, sbitmap must_follow) argument
2189 sbitmap sched_nodes = sbitmap_alloc (num_nodes); local
2315 ps_insert_empty_row(partial_schedule_ptr ps, int split_row, sbitmap sched_nodes) argument
2403 compute_split_row(sbitmap sched_nodes, int low, int up, int ii, ddg_node_ptr u_node) argument
2457 verify_partial_schedule(partial_schedule_ptr ps, sbitmap sched_nodes) argument
[all...] |
Completed in 51 milliseconds