Home
last modified time | relevance | path

Searched refs:u_node (Results 1 – 4 of 4) sorted by relevance

/netbsd-src/external/gpl3/gcc/dist/gcc/
H A Dmodulo-sched.cc1865 get_sched_window (partial_schedule_ptr ps, ddg_node_ptr u_node, in get_sched_window() argument
1874 sbitmap u_node_preds = NODE_PREDECESSORS (u_node); in get_sched_window()
1875 sbitmap u_node_succs = NODE_SUCCESSORS (u_node); in get_sched_window()
1901 "; ii = %d\n\n", u_node->cuid, INSN_UID (u_node->insn), ii); in get_sched_window()
1909 for (e = u_node->in; e != 0; e = e->next_in) in get_sched_window()
1937 for (e = u_node->out; e != 0; e = e->next_out) in get_sched_window()
1974 early_start = NODE_ASAP (u_node); in get_sched_window()
2029 calculate_must_precede_follow (ddg_node_ptr u_node, int start, int end, in calculate_must_precede_follow() argument
2065 for (e = u_node->in; e != 0; e = e->next_in) in calculate_must_precede_follow()
2090 for (e = u_node->out; e != 0; e = e->next_out) in calculate_must_precede_follow()
[all …]
H A Dddg.cc1111 ddg_node_ptr u_node = &g->nodes[u]; in find_nodes_on_paths() local
1113 for (e = u_node->out; e != (ddg_edge_ptr) 0; e = e->next_out) in find_nodes_on_paths()
1140 ddg_node_ptr u_node = &g->nodes[u]; in find_nodes_on_paths() local
1142 for (e = u_node->in; e != (ddg_edge_ptr) 0; e = e->next_in) in find_nodes_on_paths()
/netbsd-src/external/gpl3/gcc.old/dist/gcc/
H A Dmodulo-sched.c1864 get_sched_window (partial_schedule_ptr ps, ddg_node_ptr u_node, in get_sched_window() argument
1873 sbitmap u_node_preds = NODE_PREDECESSORS (u_node); in get_sched_window()
1874 sbitmap u_node_succs = NODE_SUCCESSORS (u_node); in get_sched_window()
1900 "; ii = %d\n\n", u_node->cuid, INSN_UID (u_node->insn), ii); in get_sched_window()
1908 for (e = u_node->in; e != 0; e = e->next_in) in get_sched_window()
1936 for (e = u_node->out; e != 0; e = e->next_out) in get_sched_window()
1973 early_start = NODE_ASAP (u_node); in get_sched_window()
2028 calculate_must_precede_follow (ddg_node_ptr u_node, int start, int end, in calculate_must_precede_follow() argument
2064 for (e = u_node->in; e != 0; e = e->next_in) in calculate_must_precede_follow()
2089 for (e = u_node->out; e != 0; e = e->next_out) in calculate_must_precede_follow()
[all …]
H A Dddg.c1111 ddg_node_ptr u_node = &g->nodes[u]; in find_nodes_on_paths() local
1113 for (e = u_node->out; e != (ddg_edge_ptr) 0; e = e->next_out) in find_nodes_on_paths()
1140 ddg_node_ptr u_node = &g->nodes[u]; in find_nodes_on_paths() local
1142 for (e = u_node->in; e != (ddg_edge_ptr) 0; e = e->next_in) in find_nodes_on_paths()