Home
last modified time | relevance | path

Searched refs:pred_next (Results 1 – 25 of 35) sorted by relevance

12

/openbsd/gnu/usr.bin/gcc/gcc/
H A Dcfgloop.c247 for (e = loop->header->pred; e; e = e->pred_next)
356 for (e = node->pred; e; e = e->pred_next)
426 for (e = header->pred; e; e = e->pred_next)
623 next_e = e->pred_next;
664 for (e = header->pred; e; e = e->pred_next) in canonicalize_loop_headers()
719 for (e = header->pred; e; e = e->pred_next) in canonicalize_loop_headers()
723 for (e = header->pred; e; e = e->pred_next) in canonicalize_loop_headers()
809 for (e = header->pred; e; e = e->pred_next)
896 for (e = header->pred; e; e = e->pred_next)
1141 && (!loop->header->pred->pred_next
[all …]
H A Dcfg.c315 e->pred_next = dst->pred;
422 for (tmp = dest->pred; tmp && tmp != e; tmp = tmp->pred_next)
428 last_pred->pred_next = e->pred_next;
430 dest->pred = e->pred_next;
445 for (pe = &e->dest->pred; *pe != e; pe = &(*pe)->pred_next)
447 *pe = (*pe)->pred_next;
450 e->pred_next = new_succ->pred;
589 for (e = bb->pred; e; e = e->pred_next)
616 for (e = bb->pred; e; e = e->pred_next)
623 for (e = bb->pred; e; e = e->pred_next)
H A Dcfgcleanup.c150 if (jump_block->pred->pred_next
867 for (tmp_edge = b->pred; tmp_edge; tmp_edge = tmp_edge->pred_next)
1361 && !src1->pred->pred_next
1366 && !src2->pred->pred_next
1508 if (!bb->pred || !bb->pred->pred_next)
1516 for (e = bb->pred; e ; e = e->pred_next, n++)
1527 nexte = e->pred_next;
1562 nexte2 = e2->pred_next;
1648 if (b->pred->pred_next == NULL
1675 if (b->pred->pred_next == NULL
[all …]
H A Dsbitmap.c555 for (e = b->pred; e != 0; e = e->pred_next)
567 for (e = e->pred_next; e != 0; e = e->pred_next)
635 for (e = b->pred; e != 0; e = e->pred_next)
647 for (e = e->pred_next; e != 0; e = e->pred_next)
H A Dtracer.c141 for (e = bb->pred; e; e = e->pred_next)
276 if (bb2->pred && bb2->pred->pred_next in tail_duplicate()
283 e = e->pred_next; in tail_duplicate()
H A Dlcm.c139 for (e = EXIT_BLOCK_PTR->pred; e; e = e->pred_next)
170 for (e = bb->pred; e; e = e->pred_next)
324 for (e = bb->pred; e != NULL; e = e->pred_next)
349 for (e = EXIT_BLOCK_PTR->pred; e != NULL; e = e->pred_next)
647 for (e = EXIT_BLOCK_PTR->pred; e; e = e->pred_next)
672 for (e = bb->pred; e != NULL; e = e->pred_next)
951 for (e = b->pred; e; e = e->pred_next)
1063 for (pre_exit = 0, eg = EXIT_BLOCK_PTR->pred; eg; eg = eg->pred_next)
H A Ddominance.c260 e = e->pred_next;
309 e = e->pred_next;
504 e_next = e->pred_next;
746 for (e = bb->pred; e; e = e->pred_next)
H A Dprofile.c442 for (e = bb->pred; e; e = e->pred_next) in compute_branch_probabilities()
531 for (e = bb->pred; e; e = e->pred_next) in compute_branch_probabilities()
574 for (e = bb->pred; e; e = e->pred_next) in compute_branch_probabilities()
578 for (e = bb->pred; e; e = e->pred_next) in compute_branch_probabilities()
847 for (e = bb->pred; e; e = e->pred_next) in branch_prob()
H A Dgcov.c119 struct adj_list *pred_next; member
561 arcptr->pred_next = bb_graph[target].pred;
879 arcptr = arcptr->pred_next)
918 arcptr = arcptr->pred_next)
924 arcptr = arcptr->pred_next)
H A Difcvt.c2107 || join_bb->pred->pred_next == NULL)
2308 && test_bb->pred->pred_next == NULL_EDGE
2344 if (bb->pred == NULL_EDGE || bb->pred->pred_next != NULL_EDGE)
2366 cur_edge = cur_edge->pred_next)
2376 cur_edge = cur_edge->pred_next)
2403 if (else_bb->pred->pred_next == NULL_EDGE)
2437 && else_bb->pred->pred_next == NULL_EDGE
2728 if (then_bb->pred->pred_next != NULL)
2802 if (else_bb->pred->pred_next != NULL)
H A Dcfganal.c587 for (e = s->pred; e; e = e->pred_next)
1110 for (e = bb->pred; e; e = e->pred_next)
1159 for (e = lbb->pred; e; e = e->pred_next)
H A Dssa.c652 for (e = b->pred, npred = 0; e; e = e->pred_next)
667 for (e = b->pred, i = 0; e ; e = e->pred_next, i += 2)
1531 for (e = b->pred; e; e = e->pred_next)
1613 for (e = b->pred; e; e = e->pred_next)
2203 for (e = b->pred; e; e = e->pred_next) in convert_from_ssa()
H A Dcfgrtl.c1296 for (e = edge_in->dest->pred; e; e = e->pred_next)
1405 if (watch_calls && (e->flags & EDGE_FALLTHRU) && !e->dest->pred->pred_next
1425 if (e->dest->pred->pred_next == NULL && e->dest != EXIT_BLOCK_PTR)
1620 for (e = bb->pred; e; e = e->pred_next)
2040 for (e = bb->pred; e; e = e->pred_next) in verify_flow_info()
2127 for (e = EXIT_BLOCK_PTR->pred; e ; e = e->pred_next) in verify_flow_info()
H A Dpredict.c939 for (e = bb->pred; e; e = e->pred_next)
967 for (e = bb->pred; e; e = e->pred_next)
972 for (e = bb->pred; e; e = e->pred_next)
H A Dbasic-block.h122 struct edge_def *pred_next, *succ_next; member
611 && (e)->dest->pred->pred_next)
H A Dcfgbuild.c813 for (e = bb->pred; e; e=e->pred_next)
854 for (e = b->pred; e; e=e->pred_next)
H A Ddf.c3652 for (e = bb->pred; e != 0; e = e->pred_next)
3702 for (e = bb->pred; e != 0; e = e->pred_next)
3725 for (e = bb->pred; e != 0; e = e->pred_next)
3763 for (e = bb->pred; e != 0; e = e->pred_next)
3813 for (e = bb->pred; e != 0; e = e->pred_next)
3836 for (e = bb->pred; e != 0; e = e->pred_next)
H A Dgcse.c3188 for (pred = bb->pred; pred != NULL; pred = pred->pred_next)
4689 enext = e->pred_next;
4798 if (bb->pred && bb->pred->pred_next) in bypass_conditional_jumps()
4958 for (e = bb->pred; e ; e = e->pred_next) in compute_pre_data()
5003 for (pred = bb->pred; pred != NULL; pred = pred->pred_next)
6160 for (pred = bb->pred; pred != NULL; pred = pred->pred_next)
7321 for (tmp = e->dest->pred; tmp ; tmp = tmp->pred_next)
7334 for (tmp = e->dest->pred; tmp ; tmp = tmp->pred_next)
H A Dsibcall.c604 e = e->pred_next) in optimize_sibling_and_tail_recursive_calls()
H A Dsched-rgn.c398 && b->pred->pred_next == NULL))
893 for (e = bb->pred; e; e = e->pred_next)
950 for (e = BASIC_BLOCK (child)->pred; e; e = e->pred_next)
H A Dra.c663 for (e = EXIT_BLOCK_PTR->pred; e; e = e->pred_next) in reg_alloc()
H A Dreg-stack.c451 for (e = bb->pred; e; e=e->pred_next)
2644 for (e = block->pred; e ; e = e->pred_next)
2806 for (e = block->pred; e ; e = e->pred_next)
H A Dcfglayout.c712 for (e = EXIT_BLOCK_PTR->pred; e; e = e->pred_next) in fixup_fallthru_exit_predecessor()
/openbsd/gnu/gcc/gcc/
H A Dcfgloopanal.c58 struct edge *pred_next, *succ_next; member
100 for (e = g->vertices[i].pred; e; e = e->pred_next) in dump_graph()
135 e->pred_next = g->vertices[t].pred; in add_edge()
160 #define NEXT_EDGE(E) (forward ? (E)->succ_next : (E)->pred_next) in dfs()
H A Dgcov.c109 struct arc_info *pred_next; member
822 arc->pred_next = fn->blocks[dest].pred; in read_graph_file()
946 arc_n = arc->pred_next; in read_graph_file()
947 arc->pred_next = arc_p; in read_graph_file()
1140 && arc->dst->pred == arc && !arc->pred_next) in solve_flow_graph()
1202 for (arc = blk->pred; arc; arc = arc->pred_next) in solve_flow_graph()
1262 for (arc = blk->pred; arc; arc = arc->pred_next) in solve_flow_graph()
1614 for (arc = block->pred; arc; arc = arc->pred_next) in accumulate_line_counts()
1828 for (; arc; arc = arc->pred_next) in output_lines()

12