Lines Matching refs:dfs
700 in the dfs numbering of the dominance tree. */
707 /* The dfs number of this node. */
786 To quickly locate the nearest def that dominates use, we use dfs numbering
788 queries). For each def, we have the interval given by the dfs number on
791 that contains entry and exit dfs numbers for the basic block with the use.
815 dfs number corresponds. Change them to the number of basic block that
816 corresponds to the interval following the dfs number. Also, for the
817 dfs_out numbers, increase the dfs number by one (so that it corresponds
1067 insert_phi_nodes (bitmap_head *dfs)
1139 bitmap idf = compute_idf (info->info.def_blocks.def_blocks, dfs);
2429 bitmap_head *dfs;
2451 dfs = XNEWVEC (bitmap_head, last_basic_block_for_fn (fun));
2453 bitmap_initialize (&dfs[bb->index], &bitmap_default_obstack);
2457 compute_dominance_frontiers (dfs);
2463 insert_phi_nodes (dfs);
2470 bitmap_clear (&dfs[bb->index]);
2471 free (dfs);
3146 insert_updated_phi_nodes_for (tree var, bitmap_head *dfs, bitmap blocks,
3168 idf = compute_idf (db->def_blocks, dfs);
3468 bitmap_head *dfs;
3472 dfs = XNEWVEC (bitmap_head, last_basic_block_for_fn (cfun));
3474 bitmap_initialize (&dfs[bb->index], &bitmap_default_obstack);
3475 compute_dominance_frontiers (dfs);
3489 insert_updated_phi_nodes_for (ssa_name (i), dfs, blocks_to_update,
3495 insert_updated_phi_nodes_for (sym, dfs, blocks_to_update,
3499 bitmap_clear (&dfs[bb->index]);
3500 free (dfs);