OpenE2K
/
gcc
2
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

* gcse.c: Fix formatting. 

From-SVN: r48502
This commit is contained in:
Kazu Hirata 2002-01-03 06:36:42 +00:00 committed by Kazu Hirata
parent 22e85ed463
commit 8e42ace183
2 changed files with 47 additions and 42 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
gcc/ChangeLog
View File

@ -1,3 +1,7 @@
2002-01-03 Kazu Hirata <kazu@hxi.com>
* gcse.c: Fix formatting.
2002-01-03 Graham Stott <grahams@redhat.com>
* mkconfig.sh: Output to config.h, hconfig.h and tconfig.h

85
gcc/gcse.c
View File

@ -1,6 +1,7 @@
/* Global common subexpression elimination/Partial redundancy elimination
and global constant/copy propagation for GNU compiler.
Copyright (C) 1997, 1998, 1999, 2000, 2001 Free Software Foundation, Inc.
Copyright (C) 1997, 1998, 1999, 2000, 2001, 2002
Free Software Foundation, Inc.
This file is part of GCC.
@ -753,8 +754,8 @@ gcse_main (f, file)
if (n_basic_blocks > 1000 && n_edges / n_basic_blocks >= 20)
{
if (warn_disabled_optimization)
warning ("GCSE disabled: %d > 1000 basic blocks and %d >= 20 edges/basic block",
n_basic_blocks, n_edges / n_basic_blocks);
warning ("GCSE disabled: %d > 1000 basic blocks and %d >= 20 edges/basic block",
n_basic_blocks, n_edges / n_basic_blocks);
return 0;
}
@ -917,7 +918,7 @@ compute_can_copy ()
{
int i;
#ifndef AVOID_CCMODE_COPIES
rtx reg,insn;
rtx reg, insn;
#endif
memset (can_copy_p, 0, NUM_MACHINE_MODES);
@ -982,7 +983,7 @@ static void
alloc_gcse_mem (f)
rtx f;
{
int i,n;
int i, n;
rtx insn;
/* Find the largest UID and create a mapping from UIDs to CUIDs.
@ -1237,7 +1238,7 @@ record_one_set (regno, insn)
= (struct reg_set **) grealloc ((char *) reg_set_table,
new_size * sizeof (struct reg_set *));
memset ((char *) (reg_set_table + reg_set_table_size), 0,
(new_size - reg_set_table_size) * sizeof (struct reg_set *));
(new_size - reg_set_table_size) * sizeof (struct reg_set *));
reg_set_table_size = new_size;
}
@ -1580,7 +1581,7 @@ hash_string_1 (ps)
const char *ps;
{
unsigned hash = 0;
const unsigned char *p = (const unsigned char *)ps;
const unsigned char *p = (const unsigned char *) ps;
if (p)
while (*p)
@ -1913,7 +1914,7 @@ expr_equiv_p (x, y)
default:
abort ();
}
}
}
return 1;
}
@ -2414,7 +2415,7 @@ record_last_mem_set_info (insn)
bitmap_set_bit (canon_modify_mem_list_set, BLOCK_NUM (insn));
}
else
note_stores (PATTERN (insn), canon_list_insert, (void*)insn );
note_stores (PATTERN (insn), canon_list_insert, (void*) insn );
}
/* Called from compute_hash_table via note_stores to handle one
@ -2529,7 +2530,7 @@ compute_hash_table (set_p)
hash_scan_insn (insn, set_p, in_libcall_block);
if (!set_p && find_reg_note (insn, REG_RETVAL, NULL_RTX))
in_libcall_block = 0;
}
}
}
free (reg_avail_info);
@ -2574,7 +2575,7 @@ compute_set_hash_table ()
/* Initialize count of number of entries in hash table. */
n_sets = 0;
memset ((char *) set_hash_table, 0,
set_hash_table_size * sizeof (struct expr *));
set_hash_table_size * sizeof (struct expr *));
compute_hash_table (1);
}
@ -2618,7 +2619,7 @@ compute_expr_hash_table ()
/* Initialize count of number of entries in hash table. */
n_exprs = 0;
memset ((char *) expr_hash_table, 0,
expr_hash_table_size * sizeof (struct expr *));
expr_hash_table_size * sizeof (struct expr *));
compute_hash_table (0);
}
@ -3436,10 +3437,10 @@ handle_avail_expr (insn, expr)
|| (((this_reg = reg_set_table[regnum_for_replacing]),
this_reg->next == NULL)
|| can_disregard_other_sets (&this_reg, insn, 0)))
{
use_src = 1;
found_setting = 1;
}
{
use_src = 1;
found_setting = 1;
}
}
if (!found_setting)
@ -3968,7 +3969,7 @@ find_avail_set (regno, insn)
This can not happen since the set of (reg Y) would have killed the
set of (reg X) making it unavailable at the start of this block. */
while (1)
{
{
rtx src;
struct expr *set = lookup_set (regno, NULL_RTX);
@ -4009,7 +4010,7 @@ find_avail_set (regno, insn)
/* Follow the copy chain, ie start another iteration of the loop
and see if we have an available copy into SRC. */
regno = REGNO (src);
}
}
/* SET1 holds the last set that was available and anticipatable at
INSN. */
@ -4103,7 +4104,7 @@ cprop_cc0_jump (bb, insn, reg_used, src)
delete_insn (insn);
return 1;
}
}
#endif
/* Perform constant and copy propagation on INSN.
@ -4271,7 +4272,7 @@ cprop (alter_jumps)
call mark_oprs_set if we turned the insn into a NOTE. */
if (GET_CODE (insn) != NOTE)
mark_oprs_set (insn);
}
}
}
if (gcse_file != NULL)
@ -4536,7 +4537,7 @@ pre_expr_reaches_here_p (occr_bb, expr, bb)
int rval;
char *visited = (char *) xcalloc (n_basic_blocks, 1);
rval = pre_expr_reaches_here_p_work(occr_bb, expr, bb, visited);
rval = pre_expr_reaches_here_p_work (occr_bb, expr, bb, visited);
free (visited);
return rval;
@ -5584,8 +5585,8 @@ hoist_expr_reaches_here_p (expr_bb, expr_index, bb, visited)
if (visited == NULL)
{
visited_allocated_locally = 1;
visited = xcalloc (n_basic_blocks, 1);
visited_allocated_locally = 1;
visited = xcalloc (n_basic_blocks, 1);
}
for (pred = bb->pred; pred != NULL; pred = pred->pred_next)
@ -5786,7 +5787,7 @@ hoist_code ()
}
}
free (index_map);
free (index_map);
}
/* Top level routine to perform one code hoisting (aka unification) pass
@ -6023,7 +6024,7 @@ invalidate_any_buried_refs (x)
rtx x;
{
const char * fmt;
int i,j;
int i, j;
struct ls_expr * ptr;
/* Invalidate it in the list. */
@ -6457,7 +6458,7 @@ find_loads (x, store_pattern)
rtx x, store_pattern;
{
const char * fmt;
int i,j;
int i, j;
int ret = 0;
if (!x)
@ -6539,10 +6540,10 @@ store_killed_after (x, insn, bb)
rtx x, insn;
basic_block bb;
{
rtx last = bb->end;
rtx last = bb->end;
if (insn == last)
return 0;
if (insn == last)
return 0;
/* Check if the register operands of the store are OK in this block.
Note that if registers are changed ANYWHERE in the block, we'll
@ -6552,9 +6553,9 @@ store_killed_after (x, insn, bb)
if (!store_ops_ok (XEXP (x, 0), bb))
return 1;
for ( ; insn && insn != NEXT_INSN (last); insn = NEXT_INSN (insn))
if (store_killed_in_insn (x, insn))
return 1;
for ( ; insn && insn != NEXT_INSN (last); insn = NEXT_INSN (insn))
if (store_killed_in_insn (x, insn))
return 1;
return 0;
}
@ -6566,10 +6567,10 @@ store_killed_before (x, insn, bb)
rtx x, insn;
basic_block bb;
{
rtx first = bb->head;
rtx first = bb->head;
if (insn == first)
return store_killed_in_insn (x, insn);
if (insn == first)
return store_killed_in_insn (x, insn);
/* Check if the register operands of the store are OK in this block.
Note that if registers are changed ANYWHERE in the block, we'll
@ -6579,11 +6580,11 @@ store_killed_before (x, insn, bb)
if (!store_ops_ok (XEXP (x, 0), bb))
return 1;
for ( ; insn && insn != PREV_INSN (first); insn = PREV_INSN (insn))
if (store_killed_in_insn (x, insn))
return 1;
for ( ; insn && insn != PREV_INSN (first); insn = PREV_INSN (insn))
if (store_killed_in_insn (x, insn))
return 1;
return 0;
return 0;
}
#define ANTIC_STORE_LIST(x) ((x)->loads)
@ -6638,7 +6639,7 @@ build_store_vectors ()
{
rtx r = gen_reg_rtx (GET_MODE (ptr->pattern));
if (gcse_file)
fprintf(gcse_file, "Removing redundant store:\n");
fprintf (gcse_file, "Removing redundant store:\n");
replace_store_insn (r, XEXP (st, 0), bb);
XEXP (st, 0) = insn;
continue;
@ -6828,9 +6829,9 @@ replace_store_insn (reg, del, bb)
fprintf (gcse_file,
"STORE_MOTION delete insn in BB %d:\n ", bb->index);
print_inline_rtx (gcse_file, del, 6);
fprintf(gcse_file, "\nSTORE MOTION replaced with insn:\n ");
fprintf (gcse_file, "\nSTORE MOTION replaced with insn:\n ");
print_inline_rtx (gcse_file, insn, 6);
fprintf(gcse_file, "\n");
fprintf (gcse_file, "\n");
}
delete_insn (del);