/dragonfly/contrib/gcc-4.7/gcc/ |
H A D | df-core.c | 983 int n_blocks) in df_worklist_dataflow_doublequeue() argument 1034 for (i = 0; i < n_blocks; i++) in df_worklist_dataflow_doublequeue() 1061 int n_blocks) in df_worklist_dataflow() argument 1089 for (i = 0; i < n_blocks; i++) in df_worklist_dataflow() 1104 n_blocks); in df_worklist_dataflow() 1137 int *postorder, int n_blocks) in df_analyze_problem() argument 1157 postorder, n_blocks); in df_analyze_problem() 1207 for (i = 0; i < df->n_blocks; i++) in df_analyze() 1224 df->n_blocks, df->blocks_to_analyze); in df_analyze() 1252 df->n_blocks); in df_analyze() [all …]
|
H A D | gcov-dump.c | 308 unsigned n_blocks = GCOV_TAG_BLOCKS_NUM (length); in tag_blocks() local 310 printf (" %u blocks", n_blocks); in tag_blocks() 316 for (ix = 0; ix != n_blocks; ix++) in tag_blocks()
|
H A D | dce.c | 945 int n_blocks = df_get_n_blocks (DF_BACKWARD); in fast_dce() local 965 for (i = 0; i < n_blocks; i++) in fast_dce() 972 for (i = 0; i < n_blocks; i++) in fast_dce() 1027 df_analyze_problem (df_word_lr, all_blocks, postorder, n_blocks); in fast_dce() 1029 df_analyze_problem (df_lr, all_blocks, postorder, n_blocks); in fast_dce()
|
H A D | gcse.c | 1766 alloc_pre_mem (int n_blocks, int n_exprs) in alloc_pre_mem() argument 1768 transp = sbitmap_vector_alloc (n_blocks, n_exprs); in alloc_pre_mem() 1769 comp = sbitmap_vector_alloc (n_blocks, n_exprs); in alloc_pre_mem() 1770 antloc = sbitmap_vector_alloc (n_blocks, n_exprs); in alloc_pre_mem() 1776 ae_kill = sbitmap_vector_alloc (n_blocks, n_exprs); in alloc_pre_mem() 2746 alloc_code_hoist_mem (int n_blocks, int n_exprs) in alloc_code_hoist_mem() argument 2748 antloc = sbitmap_vector_alloc (n_blocks, n_exprs); in alloc_code_hoist_mem() 2749 transp = sbitmap_vector_alloc (n_blocks, n_exprs); in alloc_code_hoist_mem() 2750 comp = sbitmap_vector_alloc (n_blocks, n_exprs); in alloc_code_hoist_mem() 2752 hoist_vbein = sbitmap_vector_alloc (n_blocks, n_exprs); in alloc_code_hoist_mem() [all …]
|
H A D | cprop.c | 563 alloc_cprop_mem (int n_blocks, int n_sets) in alloc_cprop_mem() argument 565 cprop_avloc = sbitmap_vector_alloc (n_blocks, n_sets); in alloc_cprop_mem() 566 cprop_kill = sbitmap_vector_alloc (n_blocks, n_sets); in alloc_cprop_mem() 568 cprop_avin = sbitmap_vector_alloc (n_blocks, n_sets); in alloc_cprop_mem() 569 cprop_avout = sbitmap_vector_alloc (n_blocks, n_sets); in alloc_cprop_mem()
|
H A D | tree-dfa.c | 171 renumber_gimple_stmt_uids_in_blocks (basic_block *blocks, int n_blocks) in renumber_gimple_stmt_uids_in_blocks() argument 176 for (i = 0; i < n_blocks; i++) in renumber_gimple_stmt_uids_in_blocks()
|
H A D | function.c | 4209 int n_blocks = 0; in all_blocks() local 4217 vector[n_blocks] = block; in all_blocks() 4219 ++n_blocks; in all_blocks() 4222 n_blocks += all_blocks (BLOCK_SUBBLOCKS (block), in all_blocks() 4223 vector ? vector + n_blocks : 0); in all_blocks() 4227 return n_blocks; in all_blocks() 4255 int n_blocks; in number_blocks() local 4266 block_vector = get_block_vector (DECL_INITIAL (fn), &n_blocks); in number_blocks() 4269 for (i = 1; i < n_blocks; ++i) in number_blocks()
|
H A D | sel-sched-ir.c | 3643 int *postorder, n_blocks; in sel_recompute_toporder() local 3646 n_blocks = post_order_compute (postorder, false, false); in sel_recompute_toporder() 3649 for (n = 0, i = n_blocks - 1; i >= 0; i--) in sel_recompute_toporder() 4918 int n_blocks, i; in recompute_rev_top_order() local 4929 n_blocks = post_order_compute (postorder, true, false); in recompute_rev_top_order() 4930 gcc_assert (n_basic_blocks == n_blocks); in recompute_rev_top_order() 4934 for (i = 0; i < n_blocks; i++) in recompute_rev_top_order()
|
H A D | df.h | 568 int n_blocks; /* The number of blocks in reverse postorder. */ member
|
H A D | cse.c | 6401 int i, n_blocks; in cse_main() local 6433 n_blocks = pre_and_rev_post_order_compute (NULL, rc_order, false); in cse_main() 6435 while (i < n_blocks) in cse_main() 6444 && i < n_blocks); in cse_main()
|
H A D | df-problems.c | 1037 df_worklist_dataflow (df_lr, all_blocks, df->postorder, df->n_blocks); in df_lr_finalize()
|
/dragonfly/contrib/gcc-8.0/gcc/ |
H A D | df-core.c | 1005 int n_blocks) in df_worklist_dataflow_doublequeue() argument 1053 for (i = 0; i < n_blocks; i++) in df_worklist_dataflow_doublequeue() 1080 int n_blocks) in df_worklist_dataflow() argument 1108 for (i = 0; i < n_blocks; i++) in df_worklist_dataflow() 1123 n_blocks); in df_worklist_dataflow() 1155 int *postorder, int n_blocks) in df_analyze_problem() argument 1175 postorder, n_blocks); in df_analyze_problem() 1258 for (int i = 0; i < df->n_blocks; i++) in df_analyze() 1276 df->n_blocks, df->blocks_to_analyze); in df_analyze() 1434 for (int i = 0; i < df->n_blocks; ++i) in df_analyze_loop() [all …]
|
H A D | dce.c | 1072 int n_blocks = df_get_n_blocks (DF_BACKWARD); in fast_dce() local 1093 for (i = 0; i < n_blocks; i++) in fast_dce() 1102 for (i = 0; i < n_blocks; i++) in fast_dce() 1159 df_analyze_problem (df_word_lr, all_blocks, postorder, n_blocks); in fast_dce() 1161 df_analyze_problem (df_lr, all_blocks, postorder, n_blocks); in fast_dce()
|
H A D | gcse.c | 1653 alloc_pre_mem (int n_blocks, int n_exprs) in alloc_pre_mem() argument 1655 transp = sbitmap_vector_alloc (n_blocks, n_exprs); in alloc_pre_mem() 1656 comp = sbitmap_vector_alloc (n_blocks, n_exprs); in alloc_pre_mem() 1657 antloc = sbitmap_vector_alloc (n_blocks, n_exprs); in alloc_pre_mem() 1663 ae_kill = sbitmap_vector_alloc (n_blocks, n_exprs); in alloc_pre_mem() 2707 alloc_code_hoist_mem (int n_blocks, int n_exprs) in alloc_code_hoist_mem() argument 2709 antloc = sbitmap_vector_alloc (n_blocks, n_exprs); in alloc_code_hoist_mem() 2710 transp = sbitmap_vector_alloc (n_blocks, n_exprs); in alloc_code_hoist_mem() 2711 comp = sbitmap_vector_alloc (n_blocks, n_exprs); in alloc_code_hoist_mem() 2713 hoist_vbein = sbitmap_vector_alloc (n_blocks, n_exprs); in alloc_code_hoist_mem() [all …]
|
H A D | cprop.c | 556 alloc_cprop_mem (int n_blocks, int n_sets) in alloc_cprop_mem() argument 558 cprop_avloc = sbitmap_vector_alloc (n_blocks, n_sets); in alloc_cprop_mem() 559 cprop_kill = sbitmap_vector_alloc (n_blocks, n_sets); in alloc_cprop_mem() 561 cprop_avin = sbitmap_vector_alloc (n_blocks, n_sets); in alloc_cprop_mem() 562 cprop_avout = sbitmap_vector_alloc (n_blocks, n_sets); in alloc_cprop_mem()
|
H A D | tree-dfa.c | 89 renumber_gimple_stmt_uids_in_blocks (basic_block *blocks, int n_blocks) in renumber_gimple_stmt_uids_in_blocks() argument 94 for (i = 0; i < n_blocks; i++) in renumber_gimple_stmt_uids_in_blocks()
|
H A D | early-remat.c | 1019 unsigned int n_blocks = last_basic_block_for_fn (m_fn); in init_block_info() local 1020 m_block_info.safe_grow_cleared (n_blocks); in init_block_info() 1063 unsigned int n_blocks = last_basic_block_for_fn (m_fn); in sort_candidates() local 1066 postorder_index = new unsigned int[n_blocks]; in sort_candidates()
|
H A D | function.c | 4704 int n_blocks = 0; in all_blocks() local 4712 vector[n_blocks] = block; in all_blocks() 4714 ++n_blocks; in all_blocks() 4717 n_blocks += all_blocks (BLOCK_SUBBLOCKS (block), in all_blocks() 4718 vector ? vector + n_blocks : 0); in all_blocks() 4722 return n_blocks; in all_blocks() 4750 int n_blocks; in number_blocks() local 4761 block_vector = get_block_vector (DECL_INITIAL (fn), &n_blocks); in number_blocks() 4764 for (i = 1; i < n_blocks; ++i) in number_blocks()
|
H A D | sel-sched-ir.c | 3684 int *postorder, n_blocks; in sel_recompute_toporder() local 3687 n_blocks = post_order_compute (postorder, false, false); in sel_recompute_toporder() 3690 for (n = 0, i = n_blocks - 1; i >= 0; i--) in sel_recompute_toporder() 4940 int n_blocks, i; in recompute_rev_top_order() local 4952 n_blocks = post_order_compute (postorder, true, false); in recompute_rev_top_order() 4953 gcc_assert (n_basic_blocks_for_fn (cfun) == n_blocks); in recompute_rev_top_order() 4957 for (i = 0; i < n_blocks; i++) in recompute_rev_top_order()
|
H A D | df.h | 587 int n_blocks; /* The number of blocks in reverse postorder. */ member
|
H A D | cse.c | 6720 int i, n_blocks; in cse_main() local 6757 n_blocks = pre_and_rev_post_order_compute (NULL, rc_order, false); in cse_main() 6759 while (i < n_blocks) in cse_main() 6768 && i < n_blocks); in cse_main()
|
H A D | df-problems.c | 1035 df_worklist_dataflow (df_lr, all_blocks, df->postorder, df->n_blocks); in df_lr_finalize()
|
/dragonfly/contrib/libpcap/ |
H A D | optimize.c | 432 i = opt_state->n_blocks * opt_state->nodewords; in find_dom() 2140 for (i = 0; i < opt_state->n_blocks; ++i) in find_inedges() 2361 for (i = 0; i < opt_state->n_blocks; ++i) in intern_blocks() 2366 for (i = opt_state->n_blocks - 1; i != 0; ) { in intern_blocks() 2380 for (i = 0; i < opt_state->n_blocks; ++i) { in intern_blocks() 2466 n = opt_state->n_blocks++; in number_blks_r() 2467 if (opt_state->n_blocks == 0) { in number_blks_r() 2533 opt_state->n_blocks = 0; in opt_init() 2539 if (opt_state->n_blocks == 0) in opt_init() 2542 opt_state->n_edges = 2 * opt_state->n_blocks; in opt_init() [all …]
|