* flow.c (recompute_reg_usage): Remove all arguments.
* passes.c (rest_of_compilation): Adjust the call to
recompute_reg_usage.
* rtl.h: Adjust the prototype for recompute_reg_usage.
From-SVN: r95058
* passes.c (rest_of_handle_loop_optimize): Adjust the call to
find_basic_blocks.
+ * flow.c (recompute_reg_usage): Remove all arguments.
+ * passes.c (rest_of_compilation): Adjust the call to
+ recompute_reg_usage.
+ * rtl.h: Adjust the prototype for recompute_reg_usage.
+
2005-02-14 Daniel Berlin <dberlin@dberlin.org>
* tree-dump.c (dump_files): Update to reflect new member
register allocators to prioritize pseudos for allocation to hard regs.
More accurate reference counts generally lead to better register allocation.
- F is the first insn to be scanned.
-
- LOOP_STEP denotes how much loop_depth should be incremented per
- loop nesting level in order to increase the ref count more for
- references in a loop.
-
It might be worthwhile to update REG_LIVE_LENGTH, REG_BASIC_BLOCK and
possibly other information which is used by the register allocators. */
void
-recompute_reg_usage (rtx f ATTRIBUTE_UNUSED, int loop_step ATTRIBUTE_UNUSED)
+recompute_reg_usage (void)
{
allocate_reg_life_data ();
/* distribute_notes in combiner fails to convert some of the REG_UNUSED notes
/* Any of the several passes since flow1 will have munged register
lifetime data a bit. We need it to be up to date for scheduling
(see handling of reg_known_equiv in init_alias_analysis). */
- recompute_reg_usage (get_insns (), !optimize_size);
+ recompute_reg_usage ();
#ifdef INSN_SCHEDULING
if (optimize > 0 && flag_modulo_sched)
unsigned int, int);
/* In flow.c */
-extern void recompute_reg_usage (rtx, int);
+extern void recompute_reg_usage (void);
extern int initialize_uninitialized_subregs (void);
extern void delete_dead_jumptables (void);
extern void print_rtl_with_bb (FILE *, rtx);