* 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
+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
/* 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.
}
/* 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++)
{
/* 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.
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 ();
free (crossing_edges);
- cfg_layout_finalize();
+ cfg_layout_finalize ();
}
\f
static bool
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). */
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). */
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. */
/* 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))
{
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. */
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. */
len = NULL_TREE;
- if (!init_target_chars())
+ if (!init_target_chars ())
return 0;
/* Check whether the format is a literal string constant. */
return 0;
}
- if (!init_target_chars())
+ if (!init_target_chars ())
return 0;
/* Only convert __{,v}snprintf_chk to {,v}snprintf if flag is 0
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)
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. */
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;
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);
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);
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);
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);
/* 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.
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 ();
&& (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
/* 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.
compact_blocks ();
#ifdef ENABLE_CHECKING
- verify_flow_info();
+ verify_flow_info ();
#endif
/* There's no need to defer outputting this function any more; we
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);
}
/* 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.
/* Return value of funcdef and increase it. */
int
-get_next_funcdef_no(void)
+get_next_funcdef_no (void)
{
return funcdef_no++;
}
/* 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.
/* 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;
}
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);
/* 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.
\f
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__ };
/* 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.
/* Master control. */
int
-main(int argc, char **argv)
+main (int argc, char **argv)
{
bool gen_header = false, gen_min = false;
progname = argv[0];
/* 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)
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);
{
/* 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;
/* 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.
? 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)
{
/* 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>
/* 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 ();
/* 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 ();
}
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;
}
/* 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. */
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;
}
}
return VOIDmode;
if ((SLOW_BYTE_ACCESS && ! volatilep)
- || (volatilep && !targetm.narrow_volatile_bitfield()))
+ || (volatilep && !targetm.narrow_volatile_bitfield ()))
{
enum machine_mode wide_mode = VOIDmode, tmode;
}
/* Should never reach here. */
- gcc_unreachable();
+ gcc_unreachable ();
}
/* Tries to count the number of iterations of LOOP till it exits by EXIT
/* 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.
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. */
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;
{
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];
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;
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);
{
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];
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]]);
}
/* 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
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. */
projects / gcc.git / commitdiff