Lines Matching refs:df
410 class df_d *df; variable
427 dflow = df->problems_by_index[problem->id]; in df_add_problem()
436 df->problems_by_index[dflow->problem->id] = dflow; in df_add_problem()
445 df->num_problems_defined++; in df_add_problem()
446 for (i = df->num_problems_defined - 2; i >= 0; i--) in df_add_problem()
448 if (problem->id < df->problems_in_order[i]->problem->id) in df_add_problem()
449 df->problems_in_order[i+1] = df->problems_in_order[i]; in df_add_problem()
452 df->problems_in_order[i+1] = dflow; in df_add_problem()
456 df->problems_in_order[0] = dflow; in df_add_problem()
466 int old_flags = df->changeable_flags; in df_set_flags()
467 df->changeable_flags |= changeable_flags; in df_set_flags()
478 int old_flags = df->changeable_flags; in df_clear_flags()
479 df->changeable_flags &= ~changeable_flags; in df_clear_flags()
495 if (df->blocks_to_analyze) in df_set_blocks()
501 bitmap_and_compl (diff, df->blocks_to_analyze, blocks); in df_set_blocks()
502 for (p = 0; p < df->num_problems_defined; p++) in df_set_blocks()
504 struct dataflow *dflow = df->problems_in_order[p]; in df_set_blocks()
506 dflow->problem->reset_fun (df->blocks_to_analyze); in df_set_blocks()
532 for (p = 0; p < df->num_problems_defined; p++) in df_set_blocks()
534 struct dataflow *dflow = df->problems_in_order[p]; in df_set_blocks()
552 df->blocks_to_analyze = BITMAP_ALLOC (&df_bitmap_obstack); in df_set_blocks()
554 bitmap_copy (df->blocks_to_analyze, blocks); in df_set_blocks()
555 df->analyze_subset = true; in df_set_blocks()
563 if (df->blocks_to_analyze) in df_set_blocks()
565 BITMAP_FREE (df->blocks_to_analyze); in df_set_blocks()
566 df->blocks_to_analyze = NULL; in df_set_blocks()
568 df->analyze_subset = false; in df_set_blocks()
595 for (i = 0; i < df->num_problems_defined; i++) in df_remove_problem()
596 if (df->problems_in_order[i]->problem->dependent_problem == problem) in df_remove_problem()
597 df_remove_problem (df->problems_in_order[i]); in df_remove_problem()
600 for (i = 0; i < df->num_problems_defined; i++) in df_remove_problem()
601 if (df->problems_in_order[i] == dflow) in df_remove_problem()
604 for (j = i + 1; j < df->num_problems_defined; j++) in df_remove_problem()
605 df->problems_in_order[j-1] = df->problems_in_order[j]; in df_remove_problem()
606 df->problems_in_order[j-1] = NULL; in df_remove_problem()
607 df->num_problems_defined--; in df_remove_problem()
612 df->problems_by_index[problem->id] = NULL; in df_remove_problem()
629 if (!df) in df_finish_pass()
636 saved_flags = df->changeable_flags; in df_finish_pass()
643 struct dataflow *dflow = df->problems_by_index[i]; in df_finish_pass()
650 df->changeable_flags = 0; in df_finish_pass()
654 if (df->blocks_to_analyze) in df_finish_pass()
656 BITMAP_FREE (df->blocks_to_analyze); in df_finish_pass()
657 df->blocks_to_analyze = NULL; in df_finish_pass()
659 df->analyze_subset = false; in df_finish_pass()
677 df->changeable_flags |= DF_VERIFY_SCHEDULED; in df_finish_pass()
686 gcc_assert (!df); in rest_of_handle_df_initialize()
687 df = XCNEW (class df_d); in rest_of_handle_df_initialize()
688 df->changeable_flags = 0; in rest_of_handle_df_initialize()
704 df->postorder = XNEWVEC (int, last_basic_block_for_fn (cfun)); in rest_of_handle_df_initialize()
705 df->n_blocks = post_order_compute (df->postorder, true, true); in rest_of_handle_df_initialize()
706 inverted_post_order_compute (&df->postorder_inverted); in rest_of_handle_df_initialize()
707 gcc_assert ((unsigned) df->n_blocks == df->postorder_inverted.length ()); in rest_of_handle_df_initialize()
709 df->hard_regs_live_count = XCNEWVEC (unsigned int, FIRST_PSEUDO_REGISTER); in rest_of_handle_df_initialize()
809 gcc_assert (df); in rest_of_handle_df_finish()
811 for (i = 0; i < df->num_problems_defined; i++) in rest_of_handle_df_finish()
813 struct dataflow *dflow = df->problems_in_order[i]; in rest_of_handle_df_finish()
817 free (df->postorder); in rest_of_handle_df_finish()
818 df->postorder_inverted.release (); in rest_of_handle_df_finish()
819 free (df->hard_regs_live_count); in rest_of_handle_df_finish()
820 free (df); in rest_of_handle_df_finish()
821 df = NULL; in rest_of_handle_df_finish()
1201 gcc_assert ((unsigned) df->n_blocks == df->postorder_inverted.length ()); in df_analyze_1()
1212 if (df->changeable_flags & DF_VERIFY_SCHEDULED) in df_analyze_1()
1217 for (i = 1; i < df->num_problems_defined; i++) in df_analyze_1()
1219 struct dataflow *dflow = df->problems_in_order[i]; in df_analyze_1()
1224 df->blocks_to_analyze, in df_analyze_1()
1225 df->postorder_inverted.address (), in df_analyze_1()
1226 df->postorder_inverted.length ()); in df_analyze_1()
1229 df->blocks_to_analyze, in df_analyze_1()
1230 df->postorder, in df_analyze_1()
1231 df->n_blocks); in df_analyze_1()
1235 if (!df->analyze_subset) in df_analyze_1()
1237 BITMAP_FREE (df->blocks_to_analyze); in df_analyze_1()
1238 df->blocks_to_analyze = NULL; in df_analyze_1()
1253 free (df->postorder); in df_analyze()
1254 df->postorder = XNEWVEC (int, last_basic_block_for_fn (cfun)); in df_analyze()
1255 df->n_blocks = post_order_compute (df->postorder, true, true); in df_analyze()
1256 df->postorder_inverted.truncate (0); in df_analyze()
1257 inverted_post_order_compute (&df->postorder_inverted); in df_analyze()
1259 for (int i = 0; i < df->n_blocks; i++) in df_analyze()
1260 bitmap_set_bit (current_all_blocks, df->postorder[i]); in df_analyze()
1266 for (unsigned int i = 0; i < df->postorder_inverted.length (); i++) in df_analyze()
1268 df->postorder_inverted[i])); in df_analyze()
1273 if (df->analyze_subset) in df_analyze()
1275 bitmap_and_into (df->blocks_to_analyze, current_all_blocks); in df_analyze()
1276 df->n_blocks = df_prune_to_subcfg (df->postorder, in df_analyze()
1277 df->n_blocks, df->blocks_to_analyze); in df_analyze()
1278 unsigned int newlen = df_prune_to_subcfg (df->postorder_inverted.address (), in df_analyze()
1279 df->postorder_inverted.length (), in df_analyze()
1280 df->blocks_to_analyze); in df_analyze()
1281 df->postorder_inverted.truncate (newlen); in df_analyze()
1286 df->blocks_to_analyze = current_all_blocks; in df_analyze()
1425 free (df->postorder); in df_analyze_loop()
1427 df->postorder = XNEWVEC (int, loop->num_nodes); in df_analyze_loop()
1428 df->postorder_inverted.truncate (0); in df_analyze_loop()
1429 df->n_blocks = loop_post_order_compute (df->postorder, loop); in df_analyze_loop()
1430 loop_inverted_post_order_compute (&df->postorder_inverted, loop); in df_analyze_loop()
1431 gcc_assert ((unsigned) df->n_blocks == loop->num_nodes); in df_analyze_loop()
1432 gcc_assert (df->postorder_inverted.length () == loop->num_nodes); in df_analyze_loop()
1435 for (int i = 0; i < df->n_blocks; ++i) in df_analyze_loop()
1436 bitmap_set_bit (blocks, df->postorder[i]); in df_analyze_loop()
1453 gcc_assert (df->postorder_inverted.length ()); in df_get_n_blocks()
1454 return df->postorder_inverted.length (); in df_get_n_blocks()
1457 gcc_assert (df->postorder); in df_get_n_blocks()
1458 return df->n_blocks; in df_get_n_blocks()
1473 gcc_assert (df->postorder_inverted.length ()); in df_get_postorder()
1474 return df->postorder_inverted.address (); in df_get_postorder()
1476 gcc_assert (df->postorder); in df_get_postorder()
1477 return df->postorder; in df_get_postorder()
1561 if (df) in df_mark_solutions_dirty()
1564 for (p = 1; p < df->num_problems_defined; p++) in df_mark_solutions_dirty()
1565 df->problems_in_order[p]->solutions_dirty = true; in df_mark_solutions_dirty()
1588 if (df) in df_set_bb_dirty()
1591 for (p = 1; p < df->num_problems_defined; p++) in df_set_bb_dirty()
1593 struct dataflow *dflow = df->problems_in_order[p]; in df_set_bb_dirty()
1632 for (p = 1; p < df->num_problems_defined; p++) in df_clear_bb_dirty()
1634 struct dataflow *dflow = df->problems_in_order[p]; in df_clear_bb_dirty()
1651 for (p = 0; p < df->num_problems_defined; p++) in df_compact_blocks()
1653 struct dataflow *dflow = df->problems_in_order[p]; in df_compact_blocks()
1705 if (df->blocks_to_analyze) in df_compact_blocks()
1708 bitmap_set_bit (df->blocks_to_analyze, ENTRY_BLOCK); in df_compact_blocks()
1710 bitmap_set_bit (df->blocks_to_analyze, EXIT_BLOCK); in df_compact_blocks()
1711 bitmap_copy (tmp, df->blocks_to_analyze); in df_compact_blocks()
1712 bitmap_clear (df->blocks_to_analyze); in df_compact_blocks()
1717 bitmap_set_bit (df->blocks_to_analyze, i); in df_compact_blocks()
1754 gcc_assert (df); in df_bb_replace()
1757 for (p = 0; p < df->num_problems_defined; p++) in df_bb_replace()
1759 struct dataflow *dflow = df->problems_in_order[p]; in df_bb_replace()
1786 if (!df) in df_bb_delete()
1789 for (i = 0; i < df->num_problems_defined; i++) in df_bb_delete()
1791 struct dataflow *dflow = df->problems_in_order[i]; in df_bb_delete()
1824 df->changeable_flags &= ~DF_VERIFY_SCHEDULED; in df_verify()
1878 if (!df) in df_check_cfg_clean()
1996 if (df->changeable_flags & DF_EQ_NOTES) in df_find_use()
2138 if (df->blocks_to_analyze) in df_dump_region()
2146 EXECUTE_IF_SET_IN_BITMAP (df->blocks_to_analyze, 0, bb_index, bi) in df_dump_region()
2165 if (!df || !file) in df_dump_start()
2170 if (df->blocks_to_analyze) in df_dump_start()
2174 for (i = 0; i < df->num_problems_defined; i++) in df_dump_start()
2176 struct dataflow *dflow = df->problems_in_order[i]; in df_dump_start()
2193 if (!df || !file) in df_dump_bb_problem_data()
2196 for (i = 0; i < df->num_problems_defined; i++) in df_dump_bb_problem_data()
2198 struct dataflow *dflow = df->problems_in_order[i]; in df_dump_bb_problem_data()
2237 if (!df || !file) in df_dump_insn_problem_data()
2240 for (i = 0; i < df->num_problems_defined; i++) in df_dump_insn_problem_data()
2242 struct dataflow *dflow = df->problems_in_order[i]; in df_dump_insn_problem_data()