contrib/gcc/df-problems.c

44 #include "df.h"
147 df_get_live_in (struct df *df, basic_block bb)
149   gcc_assert (df->problems_by_index[DF_LR]);
151   if (df->problems_by_index[DF_UREC])
152     return DF_RA_LIVE_IN (df, bb);
153   else if (df->problems_by_index[DF_UR])
154     return DF_LIVE_IN (df, bb);
156     return DF_UPWARD_LIVE_IN (df, bb);
164 df_get_live_out (struct df *df, basic_block bb)
166   gcc_assert (df->problems_by_index[DF_LR]);
168   if (df->problems_by_index[DF_UREC])
169     return DF_RA_LIVE_OUT (df, bb);
170   else if (df->problems_by_index[DF_UR])
171     return DF_LIVE_OUT (df, bb);
173     return DF_UPWARD_LIVE_OUT (df, bb);
291    See df.h for details.
463   struct df *df = dflow->df;
472 	  unsigned int begin = DF_REG_USE_GET (df, regno)->begin;
473 	  unsigned int n_uses = DF_REG_USE_GET (df, regno)->n_refs;
529   struct df *df = dflow->df;
542 				      df_get_artificial_uses (df, bb_index),
546 				      df_get_artificial_defs (df, bb_index),
556 					  DF_INSN_UID_USES (df, uid), 0);
559 					  DF_INSN_UID_DEFS (df, uid), 0);
567 				      df_get_artificial_uses (df, bb_index), 0);
570 				      df_get_artificial_defs (df, bb_index), 0);
581   struct df *df = dflow->df;
592   if (!df->use_info.refs_organized)
593     df_reorganize_refs (&df->use_info);
603       struct df_reg_info *reg_info = DF_REG_USE_GET (df, regno);
649       struct df *df = dflow->df;
660  			      DF_REG_USE_GET (df, regno)->begin,
661  			      DF_REG_USE_GET (df, regno)->n_refs);
689       struct df *df = dflow->df;
696  			      DF_REG_USE_GET (df, regno)->begin,
697  			      DF_REG_USE_GET (df, regno)->n_refs);
765   struct df *df = dflow->df;
782     if (DF_REG_USE_GET (df, regno)->n_refs)
784 	       DF_REG_USE_GET (df, regno)->begin,
785 	       DF_REG_USE_GET (df, regno)->n_refs);
836 df_ru_add_problem (struct df *df, int flags)
838   return df_add_problem (df, &problem_RU, flags);
849    See df.h for details.
1004   struct df *df = dflow->df;
1010 	  unsigned int begin = DF_REG_DEF_GET (df, regno)->begin;
1011 	  unsigned int n_defs = DF_REG_DEF_GET (df, regno)->n_refs;
1058   struct df *df = dflow->df;
1067 				      df_get_artificial_defs (df, bb_index), 0);
1077 					  DF_INSN_UID_DEFS (df, uid), 0);
1093 				      df_get_artificial_defs (df, bb_index),
1105   struct df *df = dflow->df;
1116   if (!df->def_info.refs_organized)
1117     df_reorganize_refs (&df->def_info);
1127       struct df_reg_info *reg_info = DF_REG_DEF_GET (df, regno);
1174       struct df *df = dflow->df;
1185  			      DF_REG_DEF_GET (df, regno)->begin,
1186  			      DF_REG_DEF_GET (df, regno)->n_refs);
1214       struct df *df = dflow->df;
1221 			      DF_REG_DEF_GET (df, regno)->begin,
1222 			      DF_REG_DEF_GET (df, regno)->n_refs);
1289   struct df *df = dflow->df;
1307     if (DF_REG_DEF_GET (df, regno)->n_refs)
1309 	       DF_REG_DEF_GET (df, regno)->begin,
1310 	       DF_REG_DEF_GET (df, regno)->n_refs);
1361 df_rd_add_problem (struct df *df, int flags)
1363   return df_add_problem (df, &problem_RD, flags);
1375    See df.h for details.
1457 			struct df *df, unsigned int bb_index)
1466   for (def = df_get_artificial_defs (df, bb_index); def; def = def->next_ref)
1476   for (use = df_get_artificial_uses (df, bb_index); use; use = use->next_ref)
1490 	  for (def = DF_INSN_UID_DEFS (df, uid); def; def = def->next_ref)
1496 		       && bitmap_bit_p (df->exit_block_uses, dregno)
1513 	  for (def = DF_INSN_UID_DEFS (df, uid); def; def = def->next_ref)
1517 	      if (DF_INSN_CONTAINS_ASM (df, insn)
1536       for (use = DF_INSN_UID_USES (df, uid); use; use = use->next_ref)
1542   for (def = df_get_artificial_defs (df, bb_index); def; def = def->next_ref)
1553   for (use = df_get_artificial_uses (df, bb_index); use; use = use->next_ref)
1568   struct df *df = dflow->df;
1577   bitmap_clear (df->hardware_regs_used);
1580   bitmap_set_bit (df->hardware_regs_used, STACK_POINTER_REGNUM);
1589       bitmap_set_bit (df->hardware_regs_used, FRAME_POINTER_REGNUM);
1595 	bitmap_set_bit (df->hardware_regs_used, ARG_POINTER_REGNUM);
1602 	bitmap_set_bit (df->hardware_regs_used, PIC_OFFSET_TABLE_REGNUM);
1610       bitmap_copy (bb_info->use, df->exit_block_uses);
1617       df_lr_bb_local_compute (dflow, df, bb_index);
1645   struct df *df = dflow->df;
1649     bitmap_copy (op1, df->hardware_regs_used);
1669   bitmap_ior_into (op1, dflow->df->hardware_regs_used);
1776 df_lr_add_problem (struct df *df, int flags)
1778   return df_add_problem (df, &problem_LR, flags);
1790    See df.h for details.
1873   struct df *df = dflow->df;
1882   for (def = df_get_artificial_defs (df, bb_index); def; def = def->next_ref)
1899       for (def = DF_INSN_UID_DEFS (df, uid); def; def = def->next_ref)
1924   for (def = df_get_artificial_defs (df, bb_index); def; def = def->next_ref)
1982   struct df *df = dflow->df;
1983   struct dataflow *lr_dflow = df->problems_by_index[DF_LR];
2133 df_ur_add_problem (struct df *df, int flags)
2135   return df_add_problem (df, &problem_UR, flags);
2147    See df.h for details.
2450   struct df *df = dflow->df;
2456   for (def = df_get_artificial_defs (df, bb_index); def; def = def->next_ref)
2479   for (def = df_get_artificial_defs (df, bb_index); def; def = def->next_ref)
2565   struct df *df = dflow->df;
2566   struct dataflow *lr_dflow = df->problems_by_index[DF_LR];
2742 df_urec_add_problem (struct df *df, int flags)
2744   return df_add_problem (df, &problem_UREC, flags);
2769   struct df *df = dflow->df;
2781       if (!df->def_info.refs_organized)
2782 	df_reorganize_refs (&df->def_info);
2785       for (i = 0; i < DF_DEFS_SIZE (df); i++)
2787 	  struct df_ref *ref = df->def_info.refs[i];
2794       if (!df->use_info.refs_organized)
2795 	df_reorganize_refs (&df->use_info);
2796       for (i = 0; i < DF_USES_SIZE (df); i++)
2798 	  struct df_ref *ref = df->use_info.refs[i];
2810   struct df *df = dflow->df;
2815   if (uid < df->insns_size)
2816     insn_info = DF_INSN_UID_GET (df, uid);
2848   struct df *df = dflow->df;
2869       def = df_get_artificial_defs (df, bb_index);
2880       use = df_get_artificial_uses (df, bb_index);
2917   struct df *df = dflow->df;
2925       int count = DF_REG_DEF_GET (df, uregno)->n_refs;
2930 	      unsigned int first_index = DF_REG_DEF_GET (df, uregno)->begin;
2939 		  def = DF_DEFS_GET (df, def_index);
2965   struct df *df = dflow->df;
2977 				  df_get_artificial_uses (df, bb->index),
2981   for (def = df_get_artificial_defs (df, bb_index); def; def = def->next_ref)
2987 			      DF_REG_DEF_GET (df, dregno)->begin,
2988 			      DF_REG_DEF_GET (df, dregno)->n_refs);
3005 				     DF_INSN_UID_USES (df, uid), 0);
3009       for (def = DF_INSN_UID_DEFS (df, uid); def; def = def->next_ref)
3014 				DF_REG_DEF_GET (df, dregno)->begin,
3015 				DF_REG_DEF_GET (df, dregno)->n_refs);
3025 				  df_get_artificial_uses (df, bb->index), 0);
3036   struct df *df = dflow->df;
3037   struct dataflow *rd_dflow = df->problems_by_index [DF_RD];
3061   struct df *df = dflow->df;
3067       for (j = 0; j < df->def_info.bitmap_size; j++)
3069 	  struct df_ref *def = DF_DEFS_GET (df, j);
3075 		       DF_INSN_LUID (df, DF_REF_INSN (def)):
3090       for (j = 0; j < df->use_info.bitmap_size; j++)
3092 	  struct df_ref *use = DF_USES_GET (df, j);
3098 		       DF_INSN_LUID (df, DF_REF_INSN (use))
3100 		       DF_REF_INSN (DF_USES_GET (df, j)) ?
3101 		       DF_REF_INSN_UID (DF_USES_GET (df,j))
3144 df_chain_add_problem (struct df *df, int flags)
3146   return df_add_problem (df, &problem_CHAIN, flags);
3180   struct df *df = dflow->df;
3190 	  REG_N_SETS (i) = DF_REG_DEF_COUNT (df, i);
3191 	  REG_N_REFS (i) = DF_REG_USE_COUNT (df, i) + REG_N_SETS (i);
3498   struct df *df = dflow->df;
3505   bitmap_copy (live, df_get_live_out (df, bb));
3520   for (def = df_get_artificial_defs (df, bb_index); def; def = def->next_ref)
3524   for (use = df_get_artificial_uses (df, bb_index); use; use = use->next_ref)
3593 	  for (mws = DF_INSN_UID_MWS (df, uid); mws; mws = mws->next)
3603 	  for (def = DF_INSN_UID_DEFS (df, uid); def; def = def->next_ref)
3613 	  for (mws = DF_INSN_UID_MWS (df, uid); mws; mws = mws->next)
3620 	  for (def = DF_INSN_UID_DEFS (df, uid); def; def = def->next_ref)
3627       for (mws = DF_INSN_UID_MWS (df, uid); mws; mws = mws->next)
3635       for (use = DF_INSN_UID_USES (df, uid); use; use = use->next_ref)
3732   df_lr_dump (dflow->df->problems_by_index [DF_LR], stderr);
3819 df_ri_add_problem (struct df *df, int flags)
3821   return df_add_problem (df, &problem_RI, flags);