From 62e5bf5d4203458b41813a79213b3f513a4ca98c Mon Sep 17 00:00:00 2001 From: Roger Sayle Date: Thu, 1 Feb 2007 20:32:20 +0000 Subject: 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) : 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 --- gcc/tree-ssa-structalias.c | 18 +++++++++--------- 1 file changed, 9 insertions(+), 9 deletions(-) (limited to 'gcc/tree-ssa-structalias.c') diff --git a/gcc/tree-ssa-structalias.c b/gcc/tree-ssa-structalias.c index 0340a80..576ae1b 100644 --- a/gcc/tree-ssa-structalias.c +++ b/gcc/tree-ssa-structalias.c @@ -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 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 -- cgit v1.1