/* Web construction code for GNU compiler.
Contributed by Jan Hubicka.
- Copyright (C) 2001, 2002, 2004, 2006
+ Copyright (C) 2001, 2002, 2004, 2006, 2007
Free Software Foundation, Inc.
This file is part of GCC.
GCC is free software; you can redistribute it and/or modify it under
the terms of the GNU General Public License as published by the Free
-Software Foundation; either version 2, or (at your option) any later
+Software Foundation; either version 3, or (at your option) any later
version.
GCC is distributed in the hope that it will be useful, but WITHOUT ANY
for more details.
You should have received a copy of the GNU General Public License
-along with GCC; see the file COPYING. If not, write to the Free
-Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA
-02110-1301, USA. */
+along with GCC; see the file COPYING3. If not see
+<http://www.gnu.org/licenses/>. */
/* Simple optimization pass that splits independent uses of each pseudo,
increasing effectiveness of other optimizations. The optimization can
#include "tree-pass.h"
-/* This entry is allocated for each reference in the insn stream. */
-struct web_entry
-{
- /* Pointer to the parent in the union/find tree. */
- struct web_entry *pred;
- /* Newly assigned register to the entry. Set only for roots. */
- rtx reg;
-};
-
-static struct web_entry *unionfind_root (struct web_entry *);
-static void unionfind_union (struct web_entry *, struct web_entry *);
-static void union_defs (struct df *, struct df_ref *, struct web_entry *,
- struct web_entry *);
static rtx entry_register (struct web_entry *, struct df_ref *, char *);
static void replace_ref (struct df_ref *, rtx);
/* Find the root of unionfind tree (the representative of set). */
-static struct web_entry *
+struct web_entry *
unionfind_root (struct web_entry *element)
{
struct web_entry *element1 = element, *element2;
return element;
}
-/* Union sets. */
+/* Union sets.
+ Return true if FIRST and SECOND points to the same web entry structure and
+ nothing is done. Otherwise, return false. */
-static void
+bool
unionfind_union (struct web_entry *first, struct web_entry *second)
{
first = unionfind_root (first);
second = unionfind_root (second);
if (first == second)
- return;
+ return true;
second->pred = first;
+ return false;
}
/* For each use, all possible defs reaching it must come in the same
- register, union them. */
+ register, union them.
+ FUN is the function that does the union. */
-static void
-union_defs (struct df *df, struct df_ref *use, struct web_entry *def_entry,
- struct web_entry *use_entry)
+void
+union_defs (struct df_ref *use, struct web_entry *def_entry,
+ struct web_entry *use_entry,
+ bool (*fun) (struct web_entry *, struct web_entry *))
{
- rtx insn = DF_REF_INSN (use);
+ struct df_insn_info *insn_info = DF_REF_INSN_INFO (use);
struct df_link *link = DF_REF_CHAIN (use);
- struct df_ref *use_link = DF_INSN_USES (df, insn);
- struct df_ref *def_link = DF_INSN_DEFS (df, insn);
- rtx set = single_set (insn);
+ struct df_ref **use_link;
+ struct df_ref **eq_use_link;
+ struct df_ref **def_link;
+ rtx set;
+
+ if (insn_info)
+ {
+ rtx insn = insn_info->insn;
+ use_link = DF_INSN_INFO_USES (insn_info);
+ eq_use_link = DF_INSN_INFO_EQ_USES (insn_info);
+ def_link = DF_INSN_INFO_DEFS (insn_info);
+ set = single_set (insn);
+ }
+ else
+ {
+ /* An artificial use. It links up with nothing. */
+ use_link = NULL;
+ eq_use_link = NULL;
+ def_link = NULL;
+ set = NULL;
+ }
/* Some instructions may use match_dup for their operands. In case the
operands are dead, we will assign them different pseudos, creating
invalid instructions, so union all uses of the same operand for each
insn. */
- while (use_link)
- {
- if (use != use_link
- && DF_REF_REAL_REG (use) == DF_REF_REAL_REG (use_link))
- unionfind_union (use_entry + DF_REF_ID (use),
- use_entry + DF_REF_ID (use_link));
- use_link = use_link->next_ref;
+ if (use_link)
+ while (*use_link)
+ {
+ if (use != *use_link
+ && DF_REF_REAL_REG (use) == DF_REF_REAL_REG (*use_link))
+ (*fun) (use_entry + DF_REF_ID (use),
+ use_entry + DF_REF_ID (*use_link));
+ use_link++;
+ }
+
+ if (eq_use_link)
+ while (*eq_use_link)
+ {
+ if (use != *eq_use_link
+ && DF_REF_REAL_REG (use) == DF_REF_REAL_REG (*eq_use_link))
+ (*fun) (use_entry + DF_REF_ID (use),
+ use_entry + DF_REF_ID (*eq_use_link));
+ eq_use_link++;
}
- /* Recognize trivial noop moves and attempt to keep them as noop.
- While most of noop moves should be removed, we still keep some
- of them at libcall boundaries and such. */
+ /* Recognize trivial noop moves and attempt to keep them as noop. */
if (set
&& SET_SRC (set) == DF_REF_REG (use)
&& SET_SRC (set) == SET_DEST (set))
{
- while (def_link)
- {
- if (DF_REF_REAL_REG (use) == DF_REF_REAL_REG (def_link))
- unionfind_union (use_entry + DF_REF_ID (use),
- def_entry + DF_REF_ID (def_link));
- def_link = def_link->next_ref;
- }
+ if (def_link)
+ while (*def_link)
+ {
+ if (DF_REF_REAL_REG (use) == DF_REF_REAL_REG (*def_link))
+ (*fun) (use_entry + DF_REF_ID (use),
+ def_entry + DF_REF_ID (*def_link));
+ def_link++;
+ }
}
while (link)
{
- unionfind_union (use_entry + DF_REF_ID (use),
- def_entry + DF_REF_ID (link->ref));
+ (*fun) (use_entry + DF_REF_ID (use),
+ def_entry + DF_REF_ID (link->ref));
link = link->next;
}
register. Find it and union. */
if (use->flags & DF_REF_READ_WRITE)
{
- struct df_ref *link = DF_INSN_DEFS (df, DF_REF_INSN (use));
-
- while (link)
- {
- if (DF_REF_REAL_REG (link) == DF_REF_REAL_REG (use))
- unionfind_union (use_entry + DF_REF_ID (use),
- def_entry + DF_REF_ID (link));
- link = link->next_ref;
- }
+ struct df_ref **link;
+
+ if (insn_info)
+ link = DF_INSN_INFO_DEFS (insn_info);
+ else
+ link = NULL;
+
+ if (link)
+ while (*link)
+ {
+ if (DF_REF_REAL_REG (*link) == DF_REF_REAL_REG (use))
+ (*fun) (use_entry + DF_REF_ID (use),
+ def_entry + DF_REF_ID (*link));
+ link++;
+ }
}
}
{
rtx oldreg = DF_REF_REAL_REG (ref);
rtx *loc = DF_REF_REAL_LOC (ref);
+ unsigned int uid = INSN_UID (DF_REF_INSN (ref));
if (oldreg == reg)
return;
if (dump_file)
fprintf (dump_file, "Updating insn %i (%i->%i)\n",
- INSN_UID (DF_REF_INSN (ref)), REGNO (oldreg), REGNO (reg));
+ uid, REGNO (oldreg), REGNO (reg));
*loc = reg;
+ df_insn_rescan (DF_REF_INSN (ref));
+}
+
+\f
+static bool
+gate_handle_web (void)
+{
+ return (optimize > 0 && flag_web);
}
/* Main entry point. */
-static void
+static unsigned int
web_main (void)
{
- struct df *df;
struct web_entry *def_entry;
struct web_entry *use_entry;
- unsigned int i;
- int max = max_reg_num ();
+ unsigned int max = max_reg_num ();
char *used;
+ basic_block bb;
+ unsigned int uses_num = 0;
+ rtx insn;
+
+ df_set_flags (DF_NO_HARD_REGS + DF_EQ_NOTES);
+ df_chain_add_problem (DF_UD_CHAIN);
+ df_analyze ();
+ df_set_flags (DF_DEFER_INSN_RESCAN);
+
+ /* Assign ids to the uses. */
+ FOR_ALL_BB (bb)
+ FOR_BB_INSNS (bb, insn)
+ {
+ unsigned int uid = INSN_UID (insn);
+ if (INSN_P (insn))
+ {
+ struct df_ref **use_rec;
+ for (use_rec = DF_INSN_UID_USES (uid); *use_rec; use_rec++)
+ {
+ struct df_ref *use = *use_rec;
+ if (DF_REF_REGNO (use) >= FIRST_PSEUDO_REGISTER)
+ DF_REF_ID (use) = uses_num++;
+ }
+ for (use_rec = DF_INSN_UID_EQ_USES (uid); *use_rec; use_rec++)
+ {
+ struct df_ref *use = *use_rec;
+ if (DF_REF_REGNO (use) >= FIRST_PSEUDO_REGISTER)
+ DF_REF_ID (use) = uses_num++;
+ }
+ }
+ }
- df = df_init (DF_EQUIV_NOTES);
- df_chain_add_problem (df, DF_UD_CHAIN);
- df_analyze (df);
- df_reorganize_refs (&df->def_info);
- df_reorganize_refs (&df->use_info);
-
- def_entry = XCNEWVEC (struct web_entry, DF_DEFS_SIZE (df));
- use_entry = XCNEWVEC (struct web_entry, DF_USES_SIZE (df));
+ /* Record the number of uses and defs at the beginning of the optimization. */
+ def_entry = XCNEWVEC (struct web_entry, DF_DEFS_TABLE_SIZE());
used = XCNEWVEC (char, max);
-
- if (dump_file)
- df_dump (df, dump_file);
+ use_entry = XCNEWVEC (struct web_entry, uses_num);
/* Produce the web. */
- for (i = 0; i < DF_USES_SIZE (df); i++)
- union_defs (df, DF_USES_GET (df, i), def_entry, use_entry);
+ FOR_ALL_BB (bb)
+ FOR_BB_INSNS (bb, insn)
+ {
+ unsigned int uid = INSN_UID (insn);
+ if (INSN_P (insn))
+ {
+ struct df_ref **use_rec;
+ for (use_rec = DF_INSN_UID_USES (uid); *use_rec; use_rec++)
+ {
+ struct df_ref *use = *use_rec;
+ if (DF_REF_REGNO (use) >= FIRST_PSEUDO_REGISTER)
+ union_defs (use, def_entry, use_entry, unionfind_union);
+ }
+ for (use_rec = DF_INSN_UID_EQ_USES (uid); *use_rec; use_rec++)
+ {
+ struct df_ref *use = *use_rec;
+ if (DF_REF_REGNO (use) >= FIRST_PSEUDO_REGISTER)
+ union_defs (use, def_entry, use_entry, unionfind_union);
+ }
+ }
+ }
/* Update the instruction stream, allocating new registers for split pseudos
in progress. */
- for (i = 0; i < DF_USES_SIZE (df); i++)
- replace_ref (DF_USES_GET (df, i),
- entry_register (use_entry + i, DF_USES_GET (df, i), used));
- for (i = 0; i < DF_DEFS_SIZE (df); i++)
- replace_ref (DF_DEFS_GET (df, i),
- entry_register (def_entry + i, DF_DEFS_GET (df, i), used));
-
- /* Dataflow information is corrupt here, but it can be easily updated
- by creating new entries for new registers and updates or calling
- df_insns_modify. */
+ FOR_ALL_BB (bb)
+ FOR_BB_INSNS (bb, insn)
+ {
+ unsigned int uid = INSN_UID (insn);
+ if (INSN_P (insn))
+ {
+ struct df_ref **use_rec;
+ struct df_ref **def_rec;
+ for (use_rec = DF_INSN_UID_USES (uid); *use_rec; use_rec++)
+ {
+ struct df_ref *use = *use_rec;
+ if (DF_REF_REGNO (use) >= FIRST_PSEUDO_REGISTER)
+ replace_ref (use, entry_register (use_entry + DF_REF_ID (use), use, used));
+ }
+ for (use_rec = DF_INSN_UID_EQ_USES (uid); *use_rec; use_rec++)
+ {
+ struct df_ref *use = *use_rec;
+ if (DF_REF_REGNO (use) >= FIRST_PSEUDO_REGISTER)
+ replace_ref (use, entry_register (use_entry + DF_REF_ID (use), use, used));
+ }
+ for (def_rec = DF_INSN_UID_DEFS (uid); *def_rec; def_rec++)
+ {
+ struct df_ref *def = *def_rec;
+ if (DF_REF_REGNO (def) >= FIRST_PSEUDO_REGISTER)
+ replace_ref (def, entry_register (def_entry + DF_REF_ID (def), def, used));
+ }
+ }
+ }
+
free (def_entry);
free (use_entry);
free (used);
- df_finish (df);
- df = NULL;
-}
-\f
-static bool
-gate_handle_web (void)
-{
- return (optimize > 0 && flag_web);
-}
-
-static unsigned int
-rest_of_handle_web (void)
-{
- web_main ();
- delete_trivially_dead_insns (get_insns (), max_reg_num ());
- cleanup_cfg (CLEANUP_EXPENSIVE);
- reg_scan (get_insns (), max_reg_num ());
return 0;
}
-
-struct tree_opt_pass pass_web =
+\f
+struct rtl_opt_pass pass_web =
{
+ {
+ RTL_PASS,
"web", /* name */
gate_handle_web, /* gate */
- rest_of_handle_web, /* execute */
+ web_main, /* execute */
NULL, /* sub */
NULL, /* next */
0, /* static_pass_number */
0, /* properties_provided */
0, /* properties_destroyed */
0, /* todo_flags_start */
- TODO_dump_func, /* todo_flags_finish */
- 'Z' /* letter */
+ TODO_df_finish | TODO_verify_rtl_sharing |
+ TODO_dump_func /* todo_flags_finish */
+ }
};
OSDN Git Service
