Home
last modified time | relevance | path

Searched defs:succ (Results 1 – 25 of 47) sorted by relevance

12

/dflybsd-src/contrib/gcc-8.0/gcc/
H A Dhw-doloop.c283 basic_block succ = EDGE_SUCC (bb, ei.index)->dest; in discover_loop() local
382 basic_block succ = FALLTHRU_EDGE (bb)->dest; in discover_loops() local
H A Dgraphds.h37 struct graph_edge *pred, *succ; member
H A Dlcm.c174 basic_block pred, succ; in compute_earliest() local
590 basic_block pred, succ; in compute_farthest() local
H A Dcfganal.c292 int pred, succ, index; in verify_edge_list() local
493 find_edge (basic_block pred, basic_block succ) in find_edge()
518 find_edge_index (struct edge_list *edge_list, basic_block pred, basic_block succ) in find_edge_index()
H A Dsel-sched-ir.c595 insn_t succ; in init_fences() local
683 insn_t succ; in merge_fences() local
860 add_clean_fence_to_fences (flist_tail_t new_fences, insn_t succ, fence_t fence) in add_clean_fence_to_fences()
876 add_dirty_fence_to_fences (flist_tail_t new_fences, insn_t succ, fence_t fence) in add_dirty_fence_to_fences()
3636 insn_t succ; in bookkeeping_can_be_created_if_moved_through_p() local
4036 insn_t succ = NULL; in get_seqno_by_succs() local
4079 insn_t succ = NULL; in get_seqno_for_a_jump() local
4706 insn_t succ; in sel_insn_has_single_succ_p() local
4766 insn_t succ; in compute_succs_info() local
4914 in_same_ebb_p (insn_t insn, insn_t succ) in in_same_ebb_p()
[all …]
H A Dtree-cfgcleanup.c447 edge succ = single_succ_edge (bb), e, s; in remove_forwarder_block() local
990 edge succ = single_succ_edge (bb); in remove_forwarder_block_with_phi() local
H A Dsel-sched.c600 in_fallthru_bb_p (rtx_insn *insn, rtx succ) in in_fallthru_bb_p()
630 insn_t succ; in extract_new_fences_from() local
651 insn_t succ; in extract_new_fences_from() local
2745 insn_t succ, zero_succ = NULL; in compute_av_set_at_bb_end() local
3177 rtx_insn *succ; in compute_live_below_insn() local
4589 basic_block succ; in create_block_for_bookkeeping() local
5391 insn_t succ; in update_boundaries() local
5783 fur_merge_succs (insn_t insn ATTRIBUTE_UNUSED, insn_t succ, in fur_merge_succs()
6321 insn_t succ; in code_motion_process_successors() local
6751 basic_block succ = BLOCK_FOR_INSN (succ_insn); in init_seqno_1() local
H A Dhsa-regalloc.c477 hsa_bb *succ = hsa_bb_for_bb (e->dest); in linear_scan_regalloc() local
H A Dsel-sched-dump.c532 rtx_insn *succ; in dump_insn_vector() local
H A Dtree-outof-ssa.c445 elim_graph_add_edge (elim_graph *g, int pred, int succ, source_location locus) in elim_graph_add_edge()
H A Dcfghooks.c1033 basic_block succ = single_succ (ret); in force_nonfallthru() local
H A Dddg.c943 find_successors (sbitmap succ, ddg_ptr g, sbitmap ops) in find_successors()
/dflybsd-src/contrib/gcc-4.7/gcc/
H A Dhw-doloop.c290 basic_block succ = EDGE_SUCC (bb, ei.index)->dest; in discover_loop() local
390 basic_block succ = FALLTHRU_EDGE (bb)->dest; in discover_loops() local
H A Dgraphds.h35 struct graph_edge *pred, *succ; member
H A Dcfganal.c422 int pred, succ, index; in verify_edge_list() local
486 find_edge (basic_block pred, basic_block succ) in find_edge()
511 find_edge_index (struct edge_list *edge_list, basic_block pred, basic_block succ) in find_edge_index()
H A Dtree-cfgcleanup.c369 edge succ = single_succ_edge (bb), e, s; in remove_forwarder_block() local
784 edge succ = single_succ_edge (bb); in remove_forwarder_block_with_phi() local
H A Dlcm.c185 basic_block pred, succ; in compute_earliest() local
567 basic_block pred, succ; in compute_farthest() local
H A Dsel-sched-ir.c600 insn_t succ; in init_fences() local
687 insn_t succ; in merge_fences() local
863 add_clean_fence_to_fences (flist_tail_t new_fences, insn_t succ, fence_t fence) in add_clean_fence_to_fences()
879 add_dirty_fence_to_fences (flist_tail_t new_fences, insn_t succ, fence_t fence) in add_dirty_fence_to_fences()
3593 insn_t succ; in bookkeeping_can_be_created_if_moved_through_p() local
3988 insn_t succ = NULL; in get_seqno_by_succs() local
4030 insn_t succ = NULL; in get_seqno_for_a_jump() local
4683 insn_t succ; in sel_insn_has_single_succ_p() local
4746 insn_t succ; in compute_succs_info() local
4892 in_same_ebb_p (insn_t insn, insn_t succ) in in_same_ebb_p()
[all …]
H A Dsel-sched.c614 in_fallthru_bb_p (rtx insn, rtx succ) in in_fallthru_bb_p()
644 insn_t succ; in extract_new_fences_from() local
665 insn_t succ; in extract_new_fences_from() local
2786 insn_t succ, zero_succ = NULL; in compute_av_set_at_bb_end() local
3218 rtx succ; in compute_live_below_insn() local
4654 basic_block succ; in create_block_for_bookkeeping() local
5462 insn_t succ; in update_boundaries() local
5854 fur_merge_succs (insn_t insn ATTRIBUTE_UNUSED, insn_t succ, in fur_merge_succs()
6395 rtx succ; in code_motion_process_successors() local
6812 basic_block succ = BLOCK_FOR_INSN (succ_insn); in init_seqno_1() local
H A Dsel-sched-dump.c467 rtx succ; in dump_insn_vector() local
H A Dtree-outof-ssa.c416 elim_graph_add_edge (elim_graph g, int pred, int succ, source_location locus) in elim_graph_add_edge()
H A Dbb-reorder.c1776 edge succ; in fix_crossing_unconditional_branches() local
/dflybsd-src/bin/ed/
H A Ded.h160 #define REQUE(pred, succ) (pred)->q_forw = (succ), (succ)->q_back = (pred) argument
/dflybsd-src/contrib/bmake/
H A Dmake.c645 GNode *succ = ln->datum; in ScheduleOrderSuccessors() local
/dflybsd-src/contrib/libpcap/
H A Dgencode.h246 struct block *succ; /* successor vertex */ member

12