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

/netbsd-current/external/gpl3/gcc.old/dist/gcc/
H A Dmodulo-sched.c1867 get_sched_window (partial_schedule_ptr ps, ddg_node_ptr u_node,
1876 sbitmap u_node_preds = NODE_PREDECESSORS (u_node);
1877 sbitmap u_node_succs = NODE_SUCCESSORS (u_node);
1903 "; ii = %d\n\n", u_node->cuid, INSN_UID (u_node->insn), ii);
1911 for (e = u_node->in; e != 0; e = e->next_in)
1939 for (e = u_node->out; e != 0; e = e->next_out)
1976 early_start = NODE_ASAP (u_node);
2031 calculate_must_precede_follow (ddg_node_ptr u_node, int start, int end,
2067 for (e = u_node
1864 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
2028 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
2175 ddg_node_ptr u_node = &ps->g->nodes[u]; local
2359 compute_split_row(sbitmap sched_nodes, int low, int up, int ii, ddg_node_ptr u_node) argument
2602 ddg_node_ptr u_node = &g->nodes[u]; local
2614 ddg_node_ptr u_node = &g->nodes[u]; local
2632 ddg_node_ptr u_node = &g->nodes[u]; local
2653 ddg_node_ptr u_node = &g->nodes[u]; local
2675 ddg_node_ptr u_node = &g->nodes[u]; local
2704 ddg_node_ptr u_node = &g->nodes[u]; local
[all...]
H A Dddg.c1114 ddg_node_ptr u_node = &g->nodes[u];
1116 for (e = u_node->out; e != (ddg_edge_ptr) 0; e = e->next_out)
1143 ddg_node_ptr u_node = &g->nodes[u];
1145 for (e = u_node->in; e != (ddg_edge_ptr) 0; e = e->next_in)
1111 ddg_node_ptr u_node = &g->nodes[u]; local
1140 ddg_node_ptr u_node = &g->nodes[u]; local
/netbsd-current/external/gpl3/gcc/dist/gcc/
H A Dmodulo-sched.cc1868 get_sched_window (partial_schedule_ptr ps, ddg_node_ptr u_node,
1877 sbitmap u_node_preds = NODE_PREDECESSORS (u_node);
1878 sbitmap u_node_succs = NODE_SUCCESSORS (u_node);
1904 "; ii = %d\n\n", u_node->cuid, INSN_UID (u_node->insn), ii);
1912 for (e = u_node->in; e != 0; e = e->next_in)
1940 for (e = u_node->out; e != 0; e = e->next_out)
1977 early_start = NODE_ASAP (u_node);
2032 calculate_must_precede_follow (ddg_node_ptr u_node, int start, int end,
2068 for (e = u_node
1865 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
2029 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
2176 ddg_node_ptr u_node = &ps->g->nodes[u]; local
2360 compute_split_row(sbitmap sched_nodes, int low, int up, int ii, ddg_node_ptr u_node) argument
2603 ddg_node_ptr u_node = &g->nodes[u]; local
2615 ddg_node_ptr u_node = &g->nodes[u]; local
2633 ddg_node_ptr u_node = &g->nodes[u]; local
2654 ddg_node_ptr u_node = &g->nodes[u]; local
2676 ddg_node_ptr u_node = &g->nodes[u]; local
2705 ddg_node_ptr u_node = &g->nodes[u]; local
[all...]
H A Dddg.cc1114 ddg_node_ptr u_node = &g->nodes[u];
1116 for (e = u_node->out; e != (ddg_edge_ptr) 0; e = e->next_out)
1143 ddg_node_ptr u_node = &g->nodes[u];
1145 for (e = u_node->in; e != (ddg_edge_ptr) 0; e = e->next_in)
1111 ddg_node_ptr u_node = &g->nodes[u]; local
1140 ddg_node_ptr u_node = &g->nodes[u]; local

Completed in 257 milliseconds