Home
last modified time | relevance | path

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

/dflybsd-src/contrib/gcc-4.7/gcc/
H A Dmodulo-sched.c1869 get_sched_window (partial_schedule_ptr ps, ddg_node_ptr u_node, in get_sched_window() argument
1878 sbitmap u_node_preds = NODE_PREDECESSORS (u_node); in get_sched_window()
1879 sbitmap u_node_succs = NODE_SUCCESSORS (u_node); in get_sched_window()
1905 "; ii = %d\n\n", u_node->cuid, INSN_UID (u_node->insn), ii); in get_sched_window()
1913 for (e = u_node->in; e != 0; e = e->next_in) in get_sched_window()
1941 for (e = u_node->out; e != 0; e = e->next_out) in get_sched_window()
1978 early_start = NODE_ASAP (u_node); in get_sched_window()
2037 calculate_must_precede_follow (ddg_node_ptr u_node, int start, int end, in calculate_must_precede_follow() argument
2073 for (e = u_node->in; e != 0; e = e->next_in) in calculate_must_precede_follow()
2098 for (e = u_node->out; e != 0; e = e->next_out) in calculate_must_precede_follow()
[all …]
H A Dddg.c1140 ddg_node_ptr u_node = &g->nodes[u]; in find_nodes_on_paths() local
1142 for (e = u_node->out; e != (ddg_edge_ptr) 0; e = e->next_out) in find_nodes_on_paths()
1169 ddg_node_ptr u_node = &g->nodes[u]; in find_nodes_on_paths() local
1171 for (e = u_node->in; e != (ddg_edge_ptr) 0; e = e->next_in) in find_nodes_on_paths()
1200 update_dist_to_successors (ddg_node_ptr u_node, sbitmap nodes, sbitmap tmp) in update_dist_to_successors() argument
1205 for (e = u_node->out; e; e = e->next_out) in update_dist_to_successors()
1212 && (v_node->aux.count < u_node->aux.count + e->latency)) in update_dist_to_successors()
1214 v_node->aux.count = u_node->aux.count + e->latency; in update_dist_to_successors()
1255 ddg_node_ptr u_node = &g->nodes[u]; in longest_simple_path() local
1257 change |= update_dist_to_successors (u_node, nodes, tmp); in longest_simple_path()
/dflybsd-src/contrib/gcc-8.0/gcc/
H A Dmodulo-sched.c1857 get_sched_window (partial_schedule_ptr ps, ddg_node_ptr u_node, in get_sched_window() argument
1866 sbitmap u_node_preds = NODE_PREDECESSORS (u_node); in get_sched_window()
1867 sbitmap u_node_succs = NODE_SUCCESSORS (u_node); in get_sched_window()
1893 "; ii = %d\n\n", u_node->cuid, INSN_UID (u_node->insn), ii); in get_sched_window()
1901 for (e = u_node->in; e != 0; e = e->next_in) in get_sched_window()
1929 for (e = u_node->out; e != 0; e = e->next_out) in get_sched_window()
1966 early_start = NODE_ASAP (u_node); in get_sched_window()
2021 calculate_must_precede_follow (ddg_node_ptr u_node, int start, int end, in calculate_must_precede_follow() argument
2057 for (e = u_node->in; e != 0; e = e->next_in) in calculate_must_precede_follow()
2082 for (e = u_node->out; e != 0; e = e->next_out) in calculate_must_precede_follow()
[all …]
H A Dddg.c1109 ddg_node_ptr u_node = &g->nodes[u]; in find_nodes_on_paths() local
1111 for (e = u_node->out; e != (ddg_edge_ptr) 0; e = e->next_out) in find_nodes_on_paths()
1138 ddg_node_ptr u_node = &g->nodes[u]; in find_nodes_on_paths() local
1140 for (e = u_node->in; e != (ddg_edge_ptr) 0; e = e->next_in) in find_nodes_on_paths()
1164 update_dist_to_successors (ddg_node_ptr u_node, sbitmap nodes, sbitmap tmp) in update_dist_to_successors() argument
1169 for (e = u_node->out; e; e = e->next_out) in update_dist_to_successors()
1176 && (v_node->aux.count < u_node->aux.count + e->latency)) in update_dist_to_successors()
1178 v_node->aux.count = u_node->aux.count + e->latency; in update_dist_to_successors()
1218 ddg_node_ptr u_node = &g->nodes[u]; in longest_simple_path() local
1220 change |= update_dist_to_successors (u_node, nodes, tmp); in longest_simple_path()