Home
last modified time | relevance | path

Searched refs:adef (Results 1 – 4 of 4) sorted by relevance

/dragonfly/contrib/gcc-4.7/gcc/
H A Dloop-iv.c300 df_ref single_rd = NULL, adef; in latch_dominating_def() local
304 for (adef = DF_REG_DEF_CHAIN (regno); adef; adef = DF_REF_NEXT_REG (adef)) in latch_dominating_def()
317 single_rd = adef; in latch_dominating_def()
329 df_ref use, adef; in iv_get_reaching_def() local
357 def_insn = DF_REF_INSN (adef); in iv_get_reaching_def()
358 def_bb = DF_REF_BB (adef); in iv_get_reaching_def()
368 *def = adef; in iv_get_reaching_def()
1195 df_ref adef; in iv_analyze_result() local
1198 if (!adef) in iv_analyze_result()
1379 df_ref adef; in replace_single_def_regs() local
[all …]
H A Dtree-into-ssa.c846 unsigned n_defs, adef; in prune_unused_phi_nodes() local
888 adef = 1; in prune_unused_phi_nodes()
892 defs[adef].bb_index = i; in prune_unused_phi_nodes()
893 defs[adef].dfs_num = bb_dom_dfs_in (CDI_DOMINATORS, def_bb); in prune_unused_phi_nodes()
894 defs[adef + 1].bb_index = i; in prune_unused_phi_nodes()
895 defs[adef + 1].dfs_num = bb_dom_dfs_out (CDI_DOMINATORS, def_bb); in prune_unused_phi_nodes()
896 adef += 2; in prune_unused_phi_nodes()
899 gcc_assert (adef == 2 * n_defs + 1); in prune_unused_phi_nodes()
900 qsort (defs, adef, sizeof (struct dom_dfsnum), cmp_dfsnum); in prune_unused_phi_nodes()
913 for (i = 1; i < adef; i++) in prune_unused_phi_nodes()
/dragonfly/contrib/gcc-8.0/gcc/
H A Dloop-iv.c302 df_ref single_rd = NULL, adef; in latch_dominating_def() local
306 for (adef = DF_REG_DEF_CHAIN (regno); adef; adef = DF_REF_NEXT_REG (adef)) in latch_dominating_def()
319 single_rd = adef; in latch_dominating_def()
331 df_ref use, adef; in iv_get_reaching_def() local
359 def_insn = DF_REF_INSN (adef); in iv_get_reaching_def()
360 def_bb = DF_REF_BB (adef); in iv_get_reaching_def()
370 *def = adef; in iv_get_reaching_def()
1193 df_ref adef; in iv_analyze_result() local
1196 if (!adef) in iv_analyze_result()
1383 df_ref adef; in find_single_def_src() local
[all …]
H A Dtree-into-ssa.c757 unsigned n_defs, adef; in prune_unused_phi_nodes() local
799 adef = 1; in prune_unused_phi_nodes()
803 defs[adef].bb_index = i; in prune_unused_phi_nodes()
804 defs[adef].dfs_num = bb_dom_dfs_in (CDI_DOMINATORS, def_bb); in prune_unused_phi_nodes()
805 defs[adef + 1].bb_index = i; in prune_unused_phi_nodes()
806 defs[adef + 1].dfs_num = bb_dom_dfs_out (CDI_DOMINATORS, def_bb); in prune_unused_phi_nodes()
807 adef += 2; in prune_unused_phi_nodes()
810 gcc_assert (adef == 2 * n_defs + 1); in prune_unused_phi_nodes()
811 qsort (defs, adef, sizeof (struct dom_dfsnum), cmp_dfsnum); in prune_unused_phi_nodes()
824 for (i = 1; i < adef; i++) in prune_unused_phi_nodes()