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

alias.c (init_alias_analysis): Correct whitespace. 

* alias.c (init_alias_analysis): Correct whitespace.
	* bb-reorder.c (fix_edges_for_rarely_executed_code,
	partition_hot_cold_basic_blocks): Likewise.
	* builtins.c (expand_builtin_printf, expand_builtin_fprintf,
	expand_builtin_sprintf, fold_builtin_carg, fold_builtin_sprintf,
	maybe_emit_sprintf_chk_warning, fold_builtin_sprintf_chk,
	fold_builtin_snprintf_chk, fold_builtin_printf,
	fold_builtin_fprintf, do_mpfr_ckconv, do_mpfr_arg1, do_mpfr_arg2,
	do_mpfr_arg3, do_mpfr_sincos): Likewise.
	* cfgcleanup.c (cleanup_cfg): Likewise.
	* cfgexpand.c (tree_expand_cfg): Likewise.
	* fold-const.c (fold_binary) <RDIV_EXPR>: Likewise.
	* function.c (get_next_funcdef_no): Likewise.
	* gengtype.c (main): Likewise.
	* genmodes.c (main): Likewise.
	* gcse.c (bypass_conditional_jumps, print_ldst_list): Likewise.
	* haifa-sched.c (schedule_block, extend_h_i_d): Likewise.
	* ifcvt.c (noce_emit_move_insn): Likewise.
	* modulo-sched.c (generate_prolog_epilog, sms_schedule_by_order):
	Likewise.
	* stor-layout.c (get_best_mode): Likewise.
	* tree-ssa-loop-niter.c (get_val_for): Likewise.
	* tree-ssa-structalias.c (get_varinfo, get_varinfo_fc,
	scc_visit, do_ds_constraint, do_complex_constraint, label_visit,
	perform_var_substitution, solve_graph): Likewise.
	* tree-vrp.c (vrp_finalize): Likewise.

From-SVN: r121470
This commit is contained in:
Roger Sayle 2007-02-01 20:32:20 +00:00 committed by Roger Sayle
parent 0f160ccf28
commit 62e5bf5d42
18 changed files with 97 additions and 64 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

29
gcc/ChangeLog
View File

@ -1,3 +1,32 @@
2007-02-01 Roger Sayle <roger@eyesopen.com>
* alias.c (init_alias_analysis): Correct whitespace.
* bb-reorder.c (fix_edges_for_rarely_executed_code,
partition_hot_cold_basic_blocks): Likewise.
* builtins.c (expand_builtin_printf, expand_builtin_fprintf,
expand_builtin_sprintf, fold_builtin_carg, fold_builtin_sprintf,
maybe_emit_sprintf_chk_warning, fold_builtin_sprintf_chk,
fold_builtin_snprintf_chk, fold_builtin_printf,
fold_builtin_fprintf, do_mpfr_ckconv, do_mpfr_arg1, do_mpfr_arg2,
do_mpfr_arg3, do_mpfr_sincos): Likewise.
* cfgcleanup.c (cleanup_cfg): Likewise.
* cfgexpand.c (tree_expand_cfg): Likewise.
* fold-const.c (fold_binary) <RDIV_EXPR>: Likewise.
* function.c (get_next_funcdef_no): Likewise.
* gengtype.c (main): Likewise.
* genmodes.c (main): Likewise.
* gcse.c (bypass_conditional_jumps, print_ldst_list): Likewise.
* haifa-sched.c (schedule_block, extend_h_i_d): Likewise.
* ifcvt.c (noce_emit_move_insn): Likewise.
* modulo-sched.c (generate_prolog_epilog, sms_schedule_by_order):
Likewise.
* stor-layout.c (get_best_mode): Likewise.
* tree-ssa-loop-niter.c (get_val_for): Likewise.
* tree-ssa-structalias.c (get_varinfo, get_varinfo_fc,
scc_visit, do_ds_constraint, do_complex_constraint, label_visit,
perform_var_substitution, solve_graph): Likewise.
* tree-vrp.c (vrp_finalize): Likewise.
2007-02-01 Ian Lance Taylor <iant@google.com>
* lower-subreg.c (simplify_gen_subreg_concatn): If we ask for the

6
gcc/alias.c
View File

@ -1,6 +1,6 @@
/* Alias analysis for GNU C
Copyright (C) 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006
Free Software Foundation, Inc.
Copyright (C) 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006,
2007 Free Software Foundation, Inc.
Contributed by John Carr (jfc@mit.edu).
This file is part of GCC.
@ -2583,7 +2583,7 @@ init_alias_analysis (void)
}
/* Now propagate values from new_reg_base_value to reg_base_value. */
gcc_assert (maxreg == (unsigned int) max_reg_num());
gcc_assert (maxreg == (unsigned int) max_reg_num ());
for (ui = 0; ui < maxreg; ui++)
{

7
gcc/bb-reorder.c
View File

@ -1,5 +1,6 @@
/* Basic block reordering routines for the GNU compiler.
Copyright (C) 2000, 2002, 2003, 2004, 2005 Free Software Foundation, Inc.
Copyright (C) 2000, 2002, 2003, 2004, 2005, 2006, 2007
Free Software Foundation, Inc.
This file is part of GCC.
@ -1841,7 +1842,7 @@ fix_edges_for_rarely_executed_code (edge *crossing_edges,
if (!HAS_LONG_UNCOND_BRANCH)
{
fix_crossing_unconditional_branches ();
reg_scan (get_insns(), max_reg_num ());
reg_scan (get_insns (), max_reg_num ());
}
add_reg_crossing_jump_notes ();
@ -2191,7 +2192,7 @@ partition_hot_cold_basic_blocks (void)
free (crossing_edges);
cfg_layout_finalize();
cfg_layout_finalize ();
}
static bool

32
gcc/builtins.c
View File

@ -5108,7 +5108,7 @@ expand_builtin_printf (tree exp, rtx target, enum machine_mode mode,
if (fmt_str == NULL)
return 0;
if (!init_target_chars())
if (!init_target_chars ())
return 0;
/* If the format specifier was "%s\n", call __builtin_puts(arg). */
@ -5224,7 +5224,7 @@ expand_builtin_fprintf (tree exp, rtx target, enum machine_mode mode,
if (fmt_str == NULL)
return 0;
if (!init_target_chars())
if (!init_target_chars ())
return 0;
/* If the format specifier was "%s", call __builtin_fputs(arg,fp). */
@ -5316,7 +5316,7 @@ expand_builtin_sprintf (tree arglist, rtx target, enum machine_mode mode)
if (fmt_str == NULL)
return 0;
if (!init_target_chars())
if (!init_target_chars ())
return 0;
/* If the format doesn't contain % args or %%, use strcpy. */
@ -9145,7 +9145,7 @@ fold_builtin_fmin_fmax (tree arglist, tree type, bool max)
/* Fold a call to builtin carg(a+bi) -> atan2(b,a). */
static tree
fold_builtin_carg(tree arglist, tree type)
fold_builtin_carg (tree arglist, tree type)
{
if (validate_arglist (arglist, COMPLEX_TYPE, VOID_TYPE))
{
@ -10562,7 +10562,7 @@ fold_builtin_sprintf (tree arglist, int ignored)
call = NULL_TREE;
retval = NULL_TREE;
if (!init_target_chars())
if (!init_target_chars ())
return 0;
/* If the format doesn't contain % args or %%, use strcpy. */
@ -10901,7 +10901,7 @@ maybe_emit_sprintf_chk_warning (tree exp, enum built_in_function fcode)
if (fmt_str == NULL)
return;
if (!init_target_chars())
if (!init_target_chars ())
return;
/* If the format doesn't contain % args or %%, we know its size. */
@ -11363,7 +11363,7 @@ fold_builtin_sprintf_chk (tree arglist, enum built_in_function fcode)
len = NULL_TREE;
if (!init_target_chars())
if (!init_target_chars ())
return 0;
/* Check whether the format is a literal string constant. */
@ -11488,7 +11488,7 @@ fold_builtin_snprintf_chk (tree arglist, tree maxlen,
return 0;
}
if (!init_target_chars())
if (!init_target_chars ())
return 0;
/* Only convert __{,v}snprintf_chk to {,v}snprintf if flag is 0
@ -11572,7 +11572,7 @@ fold_builtin_printf (tree fndecl, tree arglist, bool ignore,
fn_puts = implicit_built_in_decls[BUILT_IN_PUTS];
}
if (!init_target_chars())
if (!init_target_chars ())
return 0;
if (strcmp (fmt_str, target_percent_s) == 0 || strchr (fmt_str, target_percent) == NULL)
@ -11733,7 +11733,7 @@ fold_builtin_fprintf (tree fndecl, tree arglist, bool ignore,
fn_fputs = implicit_built_in_decls[BUILT_IN_FPUTS];
}
if (!init_target_chars())
if (!init_target_chars ())
return 0;
/* If the format doesn't contain % args or %%, use strcpy. */
@ -11841,12 +11841,12 @@ init_target_chars (void)
entering this function. Return NULL_TREE if any checks fail. */
static tree
do_mpfr_ckconv(mpfr_srcptr m, tree type, int inexact)
do_mpfr_ckconv (mpfr_srcptr m, tree type, int inexact)
{
/* Proceed iff we get a normal number, i.e. not NaN or Inf and no
overflow/underflow occurred. If -frounding-math, proceed iff the
result of calling FUNC was exact. */
if (mpfr_number_p (m) && !mpfr_overflow_p() && !mpfr_underflow_p()
if (mpfr_number_p (m) && !mpfr_overflow_p () && !mpfr_underflow_p ()
&& (!flag_rounding_math || !inexact))
{
REAL_VALUE_TYPE rr;
@ -11905,7 +11905,7 @@ do_mpfr_arg1 (tree arg, tree type, int (*func)(mpfr_ptr, mpfr_srcptr, mp_rnd_t),
mpfr_init2 (m, prec);
mpfr_from_real (m, ra);
mpfr_clear_flags();
mpfr_clear_flags ();
inexact = func (m, m, GMP_RNDN);
result = do_mpfr_ckconv (m, type, inexact);
mpfr_clear (m);
@ -11949,7 +11949,7 @@ do_mpfr_arg2 (tree arg1, tree arg2, tree type,
mpfr_inits2 (prec, m1, m2, NULL);
mpfr_from_real (m1, ra1);
mpfr_from_real (m2, ra2);
mpfr_clear_flags();
mpfr_clear_flags ();
inexact = func (m1, m1, m2, GMP_RNDN);
result = do_mpfr_ckconv (m1, type, inexact);
mpfr_clears (m1, m2, NULL);
@ -11998,7 +11998,7 @@ do_mpfr_arg3 (tree arg1, tree arg2, tree arg3, tree type,
mpfr_from_real (m1, ra1);
mpfr_from_real (m2, ra2);
mpfr_from_real (m3, ra3);
mpfr_clear_flags();
mpfr_clear_flags ();
inexact = func (m1, m1, m2, m3, GMP_RNDN);
result = do_mpfr_ckconv (m1, type, inexact);
mpfr_clears (m1, m2, m3, NULL);
@ -12040,7 +12040,7 @@ do_mpfr_sincos (tree arg, tree arg_sinp, tree arg_cosp)
mpfr_inits2 (prec, m, ms, mc, NULL);
mpfr_from_real (m, ra);
mpfr_clear_flags();
mpfr_clear_flags ();
inexact = mpfr_sin_cos (ms, mc, m, GMP_RNDN);
result_s = do_mpfr_ckconv (ms, type, inexact);
result_c = do_mpfr_ckconv (mc, type, inexact);

7
gcc/cfgcleanup.c
View File

@ -1,6 +1,7 @@
/* Control flow optimization code for GNU compiler.
Copyright (C) 1987, 1988, 1992, 1993, 1994, 1995, 1996, 1997, 1998,
1999, 2000, 2001, 2002, 2003, 2004, 2005 Free Software Foundation, Inc.
1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007
Free Software Foundation, Inc.
This file is part of GCC.
@ -2234,7 +2235,7 @@ cleanup_cfg (int mode)
now to introduce more opportunities for try_optimize_cfg. */
if (!(mode & (CLEANUP_NO_INSN_DEL | CLEANUP_UPDATE_LIFE))
&& !reload_completed)
delete_trivially_dead_insns (get_insns(), max_reg_num ());
delete_trivially_dead_insns (get_insns (), max_reg_num ());
}
compact_blocks ();
@ -2259,7 +2260,7 @@ cleanup_cfg (int mode)
&& (mode & CLEANUP_EXPENSIVE)
&& !reload_completed)
{
if (!delete_trivially_dead_insns (get_insns(), max_reg_num ()))
if (!delete_trivially_dead_insns (get_insns (), max_reg_num ()))
break;
}
else

4
gcc/cfgexpand.c
View File

@ -1,5 +1,5 @@
/* A pass for lowering trees to RTL.
Copyright (C) 2004, 2005 Free Software Foundation, Inc.
Copyright (C) 2004, 2005, 2006, 2007 Free Software Foundation, Inc.
This file is part of GCC.
@ -1829,7 +1829,7 @@ tree_expand_cfg (void)
compact_blocks ();
#ifdef ENABLE_CHECKING
verify_flow_info();
verify_flow_info ();
#endif
/* There's no need to defer outputting this function any more; we

4
gcc/fold-const.c
View File

@ -10232,8 +10232,8 @@ fold_binary (enum tree_code code, tree type, tree op0, tree op1)
tree arg10 = TREE_VALUE (TREE_OPERAND (arg1, 1));
tree arg11 = TREE_VALUE (TREE_CHAIN (TREE_OPERAND (arg1, 1)));
tree neg11 = fold_convert (type, negate_expr (arg11));
tree arglist = tree_cons(NULL_TREE, arg10,
build_tree_list (NULL_TREE, neg11));
tree arglist = tree_cons (NULL_TREE, arg10,
build_tree_list (NULL_TREE, neg11));
arg1 = build_function_call_expr (powfn, arglist);
return fold_build2 (MULT_EXPR, type, arg0, arg1);
}

4
gcc/function.c
View File

@ -1,6 +1,6 @@
/* Expands front end tree to back end RTL for GCC.
Copyright (C) 1987, 1988, 1989, 1991, 1992, 1993, 1994, 1995, 1996, 1997,
1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006
1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007
Free Software Foundation, Inc.
This file is part of GCC.
@ -3776,7 +3776,7 @@ debug_find_var_in_block_tree (tree var, tree block)
/* Return value of funcdef and increase it. */
int
get_next_funcdef_no(void)
get_next_funcdef_no (void)
{
return funcdef_no++;
}

8
gcc/gcse.c
View File

@ -1,7 +1,7 @@
/* Global common subexpression elimination/Partial redundancy elimination
and global constant/copy propagation for GNU compiler.
Copyright (C) 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005
Free Software Foundation, Inc.
Copyright (C) 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005,
2006, 2007 Free Software Foundation, Inc.
This file is part of GCC.
@ -3731,7 +3731,7 @@ bypass_conditional_jumps (void)
/* If we bypassed any register setting insns, we inserted a
copy on the redirected edge. These need to be committed. */
if (changed)
commit_edge_insertions();
commit_edge_insertions ();
return changed;
}
@ -5127,7 +5127,7 @@ print_ldst_list (FILE * file)
fprintf (file, "LDST list: \n");
for (ptr = first_ls_expr(); ptr != NULL; ptr = next_ls_expr (ptr))
for (ptr = first_ls_expr (); ptr != NULL; ptr = next_ls_expr (ptr))
{
fprintf (file, " Pattern (%3d): ", ptr->index);

5
gcc/gengtype.c
View File

@ -1,5 +1,6 @@
/* Process source files and output type information.
Copyright (C) 2002, 2003, 2004, 2005 Free Software Foundation, Inc.
Copyright (C) 2002, 2003, 2004, 2005, 2006, 2007
Free Software Foundation, Inc.
This file is part of GCC.
@ -3046,7 +3047,7 @@ write_roots (pair_p variables)
extern int main (int argc, char **argv);
int
main(int ARG_UNUSED (argc), char ** ARG_UNUSED (argv))
main (int ARG_UNUSED (argc), char ** ARG_UNUSED (argv))
{
unsigned i;
static struct fileloc pos = { __FILE__, __LINE__ };

4
gcc/genmodes.c
View File

@ -1,5 +1,5 @@
/* Generate the machine mode enumeration and associated tables.
Copyright (C) 2003, 2004
Copyright (C) 2003, 2004, 2005, 2006, 2007
Free Software Foundation, Inc.
This file is part of GCC.
@ -1260,7 +1260,7 @@ emit_min_insn_modes_c (void)
/* Master control. */
int
main(int argc, char **argv)
main (int argc, char **argv)
{
bool gen_header = false, gen_min = false;
progname = argv[0];

8
gcc/haifa-sched.c
View File

@ -1,6 +1,6 @@
/* Instruction scheduling pass.
Copyright (C) 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999,
2000, 2001, 2002, 2003, 2004, 2005, 2006 Free Software Foundation, Inc.
Copyright (C) 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000,
2001, 2002, 2003, 2004, 2005, 2006, 2007 Free Software Foundation, Inc.
Contributed by Michael Tiemann (tiemann@cygnus.com) Enhanced by,
and currently maintained by, Jim Wilson (wilson@cygnus.com)
@ -2202,7 +2202,7 @@ schedule_block (basic_block *target_bb, int rgn_n_insns1)
there's nothing better to do (ready list is empty) but
there are still vacant dispatch slots in the current cycle. */
if (sched_verbose >= 6)
fprintf(sched_dump,";;\t\tSecond chance\n");
fprintf (sched_dump,";;\t\tSecond chance\n");
memcpy (temp_state, curr_state, dfa_state_size);
if (early_queue_to_ready (temp_state, &ready))
ready_sort (&ready);
@ -3027,7 +3027,7 @@ extend_h_i_d (void)
{
/* We use LUID 0 for the fake insn (UID 0) which holds dependencies for
pseudos which do not cross calls. */
int new_max_uid = get_max_uid() + 1;
int new_max_uid = get_max_uid () + 1;
h_i_d = xrecalloc (h_i_d, new_max_uid, old_max_uid, sizeof (*h_i_d));
old_max_uid = new_max_uid;

4
gcc/ifcvt.c
View File

@ -1,5 +1,5 @@
/* If-conversion support.
Copyright (C) 2000, 2001, 2002, 2003, 2004, 2005, 2006
Copyright (C) 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007
Free Software Foundation, Inc.
This file is part of GCC.
@ -722,7 +722,7 @@ noce_emit_move_insn (rtx x, rtx y)
? emit_move_insn (x, y)
: emit_insn (gen_rtx_SET (VOIDmode, x, y));
seq = get_insns ();
end_sequence();
end_sequence ();
if (recog_memoized (insn) <= 0)
{

15
gcc/modulo-sched.c
View File

@ -1,5 +1,5 @@
/* Swing Modulo Scheduling implementation.
Copyright (C) 2004, 2005, 2006
Copyright (C) 2004, 2005, 2006, 2007
Free Software Foundation, Inc.
Contributed by Ayal Zaks and Mustafa Hagog <zaks,mustafa@il.ibm.com>
@ -744,7 +744,7 @@ generate_prolog_epilog (partial_schedule_ptr ps, struct loop * loop, rtx count_r
/* Put the prolog on the entry edge. */
e = loop_preheader_edge (loop);
split_edge_and_insert (e, get_insns());
split_edge_and_insert (e, get_insns ());
end_sequence ();
@ -757,7 +757,7 @@ generate_prolog_epilog (partial_schedule_ptr ps, struct loop * loop, rtx count_r
/* Put the epilogue on the exit edge. */
gcc_assert (single_exit (loop));
e = single_exit (loop);
split_edge_and_insert (e, get_insns());
split_edge_and_insert (e, get_insns ());
end_sequence ();
}
@ -1469,7 +1469,7 @@ sms_schedule_by_order (ddg_ptr g, int mii, int maxii, int *nodes_order)
bool unscheduled_nodes = false;
if (dump_file)
fprintf(dump_file, "Starting with ii=%d\n", ii);
fprintf (dump_file, "Starting with ii=%d\n", ii);
if (try_again_with_larger_ii)
{
try_again_with_larger_ii = false;
@ -1521,8 +1521,9 @@ sms_schedule_by_order (ddg_ptr g, int mii, int maxii, int *nodes_order)
}
/* 2. Try scheduling u in window. */
if (dump_file)
fprintf(dump_file, "Trying to schedule node %d in (%d .. %d) step %d\n",
u, start, end, step);
fprintf (dump_file,
"Trying to schedule node %d in (%d .. %d) step %d\n",
u, start, end, step);
/* use must_follow & must_precede bitmaps to determine order
of nodes within the cycle. */
@ -1556,7 +1557,7 @@ sms_schedule_by_order (ddg_ptr g, int mii, int maxii, int *nodes_order)
SET_BIT (sched_nodes, u);
success = 1;
if (dump_file)
fprintf(dump_file, "Schedule in %d\n", c);
fprintf (dump_file, "Schedule in %d\n", c);
break;
}
}

2
gcc/stor-layout.c
View File

@ -2162,7 +2162,7 @@ get_best_mode (int bitsize, int bitpos, unsigned int align,
return VOIDmode;
if ((SLOW_BYTE_ACCESS && ! volatilep)
|| (volatilep && !targetm.narrow_volatile_bitfield()))
|| (volatilep && !targetm.narrow_volatile_bitfield ()))
{
enum machine_mode wide_mode = VOIDmode, tmode;

2
gcc/tree-ssa-loop-niter.c
View File

@ -1311,7 +1311,7 @@ get_val_for (tree x, tree base)
}
/* Should never reach here. */
gcc_unreachable();
gcc_unreachable ();
}
/* Tries to count the number of iterations of LOOP till it exits by EXIT

18
gcc/tree-ssa-structalias.c
View File

@ -1,5 +1,5 @@
/* Tree based points-to analysis
Copyright (C) 2005, 2006 Free Software Foundation, Inc.
Copyright (C) 2005, 2006, 2007 Free Software Foundation, Inc.
Contributed by Daniel Berlin <dberlin@dberlin.org>
This file is part of GCC.
@ -288,7 +288,7 @@ static VEC(varinfo_t,heap) *varmap;
static inline varinfo_t
get_varinfo (unsigned int n)
{
return VEC_index(varinfo_t, varmap, n);
return VEC_index (varinfo_t, varmap, n);
}
/* Return the varmap element N, following the collapsed_to link. */
@ -296,7 +296,7 @@ get_varinfo (unsigned int n)
static inline varinfo_t
get_varinfo_fc (unsigned int n)
{
varinfo_t v = VEC_index(varinfo_t, varmap, n);
varinfo_t v = VEC_index (varinfo_t, varmap, n);
if (v->collapsed_to)
return v->collapsed_to;
@ -1124,7 +1124,7 @@ scc_visit (constraint_graph_t graph, struct scc_info *si, unsigned int n)
{
unsigned int t = find (w);
unsigned int nnode = find (n);
gcc_assert(nnode == n);
gcc_assert (nnode == n);
if (si->dfs[t] < si->dfs[nnode])
si->dfs[n] = si->dfs[t];
@ -1465,7 +1465,7 @@ do_ds_constraint (constraint_t c, bitmap delta)
EXECUTE_IF_SET_IN_BITMAP (delta, 0, j, bi)
{
unsigned HOST_WIDE_INT loff = c->lhs.offset;
if (type_safe (j, &loff) && !(get_varinfo(j)->is_special_var))
if (type_safe (j, &loff) && !(get_varinfo (j)->is_special_var))
{
varinfo_t v;
unsigned int t;
@ -1527,7 +1527,7 @@ do_complex_constraint (constraint_graph_t graph, constraint_t c, bitmap delta)
bool flag = false;
unsigned int t;
gcc_assert(c->rhs.type == SCALAR && c->lhs.type == SCALAR);
gcc_assert (c->rhs.type == SCALAR && c->lhs.type == SCALAR);
t = find (c->rhs.var);
solution = get_varinfo (t)->solution;
t = find (c->lhs.var);
@ -1692,7 +1692,7 @@ label_visit (constraint_graph_t graph, struct scc_info *si, unsigned int n)
{
unsigned int t = si->node_mapping[w];
unsigned int nnode = si->node_mapping[n];
gcc_assert(nnode == n);
gcc_assert (nnode == n);
if (si->dfs[t] < si->dfs[nnode])
si->dfs[n] = si->dfs[t];
@ -1797,7 +1797,7 @@ perform_var_substitution (constraint_graph_t graph)
fprintf (dump_file,
"Equivalence class for %s node id %d:%s is %d\n",
direct_node ? "Direct node" : "Indirect node", i,
get_varinfo(i)->name,
get_varinfo (i)->name,
graph->label[si->node_mapping[i]]);
}
@ -2053,7 +2053,7 @@ solve_graph (constraint_graph_t graph)
/* In certain indirect cycle cases, we may merge this
variable to another. */
if (eliminate_indirect_cycles (i) && find(i) != i)
if (eliminate_indirect_cycles (i) && find (i) != i)
continue;
/* If the node has changed, we need to process the

2
gcc/tree-vrp.c
View File

@ -4960,7 +4960,7 @@ vrp_finalize (void)
substitute_and_fold (single_val_range, true);
if (warn_array_bounds)
check_all_array_refs();
check_all_array_refs ();
/* We must identify jump threading opportunities before we release
the datastructures built by VRP. */