From cf40364820f180bdb35437db31cdfb21ba0b0142 Mon Sep 17 00:00:00 2001 From: Kazu Hirata Date: Tue, 22 Jan 2002 14:33:35 +0000 Subject: [PATCH] predict.c: Fix formatting. * predict.c: Fix formatting. * print-tree.c: Likewise. * protoize.c: Likewise. * real.h: Likewise. * rtl.h: Likewise. * sbitmap.h: Likewise. * scan.c: Likewise. * sched-deps.c: Likewise. * sched-vis.c: Likewise. * sdbout.c: Likewise. * sibcall.c: Likewise. * ssa.c: Likewise. * ssa-ccp.c: Likewise. * ssa-dce.c: Likewise. * stmt.c: Likewise. * stor-layout.c: Likewise. * system.h: Likewise. From-SVN: r49074 --- gcc/ChangeLog | 20 ++++++++++++++++++++ gcc/predict.c | 2 +- gcc/print-tree.c | 6 +++--- gcc/protoize.c | 18 +++++++++--------- gcc/real.h | 8 ++++---- gcc/rtl.h | 4 ++-- gcc/sbitmap.h | 4 ++-- gcc/scan.c | 32 ++++++++++++++++---------------- gcc/sched-deps.c | 6 +++--- gcc/sched-vis.c | 4 ++-- gcc/sdbout.c | 12 ++++++------ gcc/sibcall.c | 4 ++-- gcc/ssa-ccp.c | 4 ++-- gcc/ssa-dce.c | 8 ++++---- gcc/ssa.c | 24 ++++++++++++------------ gcc/stmt.c | 2 +- gcc/stor-layout.c | 4 ++-- gcc/system.h | 4 ++-- 18 files changed, 93 insertions(+), 73 deletions(-) diff --git a/gcc/ChangeLog b/gcc/ChangeLog index fb10f397a6e4..db51fc63dd59 100644 --- a/gcc/ChangeLog +++ b/gcc/ChangeLog @@ -1,3 +1,23 @@ +2002-01-22 Kazu Hirata + + * predict.c: Fix formatting. + * print-tree.c: Likewise. + * protoize.c: Likewise. + * real.h: Likewise. + * rtl.h: Likewise. + * sbitmap.h: Likewise. + * scan.c: Likewise. + * sched-deps.c: Likewise. + * sched-vis.c: Likewise. + * sdbout.c: Likewise. + * sibcall.c: Likewise. + * ssa.c: Likewise. + * ssa-ccp.c: Likewise. + * ssa-dce.c: Likewise. + * stmt.c: Likewise. + * stor-layout.c: Likewise. + * system.h: Likewise. + Tue Jan 22 06:26:33 2002 Richard Kenner * tree.c (int_fits_type_p): If bounds of a subtype are variable, see diff --git a/gcc/predict.c b/gcc/predict.c index 9c14dbca2267..6961a33fb458 100644 --- a/gcc/predict.c +++ b/gcc/predict.c @@ -367,7 +367,7 @@ estimate_probability (loops_info) predict_edge (e, PRED_LOOP_EXIT, (REG_BR_PROB_BASE - - predictor_info [(int)PRED_LOOP_EXIT].hitrate) + - predictor_info [(int) PRED_LOOP_EXIT].hitrate) / exits); } } diff --git a/gcc/print-tree.c b/gcc/print-tree.c index 669c03e499dc..594cf0ba4c2c 100644 --- a/gcc/print-tree.c +++ b/gcc/print-tree.c @@ -1,6 +1,6 @@ /* Prints out tree in human readable form - GNU C-compiler Copyright (C) 1990, 1991, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000, - 2001 Free Software Foundation, Inc. + 2001, 2002 Free Software Foundation, Inc. This file is part of GCC. @@ -387,7 +387,7 @@ print_node (file, prefix, node, indent) if (DECL_LANG_FLAG_7 (node)) fputs (" decl_7", file); - fprintf (file, " %s", GET_MODE_NAME(mode)); + fprintf (file, " %s", GET_MODE_NAME (mode)); fprintf (file, " file %s line %d", DECL_SOURCE_FILE (node), DECL_SOURCE_LINE (node)); @@ -531,7 +531,7 @@ print_node (file, prefix, node, indent) fputs (" type_6", file); mode = TYPE_MODE (node); - fprintf (file, " %s", GET_MODE_NAME(mode)); + fprintf (file, " %s", GET_MODE_NAME (mode)); print_node (file, "size", TYPE_SIZE (node), indent + 4); print_node (file, "unit size", TYPE_SIZE_UNIT (node), indent + 4); diff --git a/gcc/protoize.c b/gcc/protoize.c index 34fdb2bdb36d..f8d8a9e7fbe4 100644 --- a/gcc/protoize.c +++ b/gcc/protoize.c @@ -1,6 +1,6 @@ /* Protoize program - Original version by Ron Guilmette (rfg@segfault.us.com). Copyright (C) 1989, 1992, 1993, 1994, 1995, 1996, 1997, 1998, - 1999, 2000, 2001 Free Software Foundation, Inc. + 1999, 2000, 2001, 2002 Free Software Foundation, Inc. This file is part of GCC. @@ -2467,20 +2467,20 @@ reverse_def_dec_list (hp) { file_info *file_p = hp->fip; def_dec_info *prev = NULL; - def_dec_info *current = (def_dec_info *)file_p->defs_decs; + def_dec_info *current = (def_dec_info *) file_p->defs_decs; if (!current) return; /* no list to reverse */ prev = current; - if (! (current = (def_dec_info *)current->next_in_file)) + if (! (current = (def_dec_info *) current->next_in_file)) return; /* can't reverse a single list element */ prev->next_in_file = NULL; while (current) { - def_dec_info *next = (def_dec_info *)current->next_in_file; + def_dec_info *next = (def_dec_info *) current->next_in_file; current->next_in_file = prev; prev = current; @@ -2825,7 +2825,7 @@ connect_defs_and_decs (hp) for (dd_p2 = dd_p->next_for_func; dd_p2; dd_p2 = dd_p2->next_for_func) if (!dd_p2->is_func_def && dd_p2->is_static && !dd_p2->definition && (dd_p2->file == dd_p->file)) - ((NONCONST def_dec_info *)dd_p2)->definition = dd_p->definition; + ((NONCONST def_dec_info *) dd_p2)->definition = dd_p->definition; } /* Convert any dummy (-1) definitions we created in the step above back to @@ -3460,7 +3460,7 @@ find_rightmost_formals_list (clean_text_p) by an alphabetic character, while others *cannot* validly be followed by such characters. */ - if ((ch == '{') || ISALPHA ((unsigned char)ch)) + if ((ch == '{') || ISALPHA ((unsigned char) ch)) break; /* At this point, we have found a right paren, but we know that it is @@ -3806,7 +3806,7 @@ edit_fn_definition (def_dec_p, clean_text_p) have_newlines |= (*scan_orig == '\n'); /* Leave identical whitespace alone. */ if (!ISSPACE ((const unsigned char)*scan_orig)) - *((NONCONST char *)scan_orig) = ' '; /* identical - so whiteout */ + *((NONCONST char *) scan_orig) = ' '; /* identical - so whiteout */ } else have_flotsam = 1; @@ -3877,7 +3877,7 @@ do_cleaning (new_clean_text_base, new_clean_text_limit) while (scan_p[1] != '\'' || scan_p[0] == '\\') { if (scan_p[0] == '\\' - && !ISSPACE ((const unsigned char)scan_p[1])) + && !ISSPACE ((const unsigned char) scan_p[1])) scan_p[1] = ' '; if (!ISSPACE ((const unsigned char)*scan_p)) *scan_p = ' '; @@ -3892,7 +3892,7 @@ do_cleaning (new_clean_text_base, new_clean_text_limit) while (scan_p[1] != '"' || scan_p[0] == '\\') { if (scan_p[0] == '\\' - && !ISSPACE ((const unsigned char)scan_p[1])) + && !ISSPACE ((const unsigned char) scan_p[1])) scan_p[1] = ' '; if (!ISSPACE ((const unsigned char)*scan_p)) *scan_p = ' '; diff --git a/gcc/real.h b/gcc/real.h index b9ee36356f27..2d3a9090e042 100644 --- a/gcc/real.h +++ b/gcc/real.h @@ -1,6 +1,6 @@ /* Definitions of floating-point access for GNU compiler. Copyright (C) 1989, 1991, 1994, 1996, 1997, 1998, - 1999, 2000 Free Software Foundation, Inc. + 1999, 2000, 2002 Free Software Foundation, Inc. This file is part of GCC. @@ -212,7 +212,7 @@ extern REAL_VALUE_TYPE ereal_from_double PARAMS ((HOST_WIDE_INT *)); (LONG_DOUBLE_TYPE_SIZE == 64 ? etardouble ((IN), (OUT)) \ : LONG_DOUBLE_TYPE_SIZE == 96 ? etarldouble ((IN), (OUT)) \ : LONG_DOUBLE_TYPE_SIZE == 128 ? etartdouble ((IN), (OUT)) \ - : abort()) + : abort ()) #define REAL_VALUE_TO_TARGET_DOUBLE(IN, OUT) (etardouble ((IN), (OUT))) /* IN is a REAL_VALUE_TYPE. OUT is a long. */ @@ -285,7 +285,7 @@ do { \ HOST_WIDE_INT l; \ } u; \ if (sizeof(HOST_WIDE_INT) < sizeof(float)) \ - abort(); \ + abort (); \ u.l = 0; \ u.f = (IN); \ (OUT) = u.l; \ @@ -303,7 +303,7 @@ do { \ HOST_WIDE_INT l[2]; \ } u; \ if (sizeof(HOST_WIDE_INT) * 2 < sizeof(REAL_VALUE_TYPE)) \ - abort(); \ + abort (); \ u.l[0] = u.l[1] = 0; \ u.f = (IN); \ if (HOST_FLOAT_WORDS_BIG_ENDIAN == FLOAT_WORDS_BIG_ENDIAN) \ diff --git a/gcc/rtl.h b/gcc/rtl.h index 3147926fc604..4ef5c4c3420b 100644 --- a/gcc/rtl.h +++ b/gcc/rtl.h @@ -48,7 +48,7 @@ enum rtx_code { NUM_RTX_CODE. Assumes default enum value assignment. */ -#define NUM_RTX_CODE ((int)LAST_AND_UNUSED_RTX_CODE) +#define NUM_RTX_CODE ((int) LAST_AND_UNUSED_RTX_CODE) /* The cast here, saves many elsewhere. */ extern const unsigned char rtx_length[NUM_RTX_CODE]; @@ -1706,7 +1706,7 @@ extern rtx gen_lowpart_SUBREG PARAMS ((enum machine_mode, rtx)); && (REGNUM) <= LAST_VIRTUAL_REGISTER)) /* REGNUM never really appearing in the INSN stream. */ -#define INVALID_REGNUM (~(unsigned int)0) +#define INVALID_REGNUM (~(unsigned int) 0) extern rtx find_next_ref PARAMS ((rtx, rtx)); diff --git a/gcc/sbitmap.h b/gcc/sbitmap.h index 29aee15bb2ca..889680188b29 100644 --- a/gcc/sbitmap.h +++ b/gcc/sbitmap.h @@ -1,5 +1,5 @@ /* Simple bitmaps. - Copyright (C) 1999, 2000 Free Software Foundation, Inc. + Copyright (C) 1999, 2000, 2002 Free Software Foundation, Inc. This file is part of GCC. @@ -71,7 +71,7 @@ do { \ if (word_ != 0) \ for (; bit_num_ < SBITMAP_ELT_BITS; bit_num_++) \ { \ - SBITMAP_ELT_TYPE _mask = (SBITMAP_ELT_TYPE)1 << bit_num_; \ + SBITMAP_ELT_TYPE _mask = (SBITMAP_ELT_TYPE) 1 << bit_num_; \ \ if ((word_ & _mask) != 0) \ { \ diff --git a/gcc/scan.c b/gcc/scan.c index 892daaefdc74..ee2607c575ef 100644 --- a/gcc/scan.c +++ b/gcc/scan.c @@ -1,5 +1,5 @@ /* Utility functions for scan-decls and fix-header programs. - Copyright (C) 1993, 1994, 1998 Free Software Foundation, Inc. + Copyright (C) 1993, 1994, 1998, 2002 Free Software Foundation, Inc. This program is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the @@ -46,9 +46,9 @@ sstring_append (dst, src) sstring *src; { char *d, *s; - int count = SSTRING_LENGTH(src); + int count = SSTRING_LENGTH (src); - MAKE_SSTRING_SPACE(dst, count + 1); + MAKE_SSTRING_SPACE (dst, count + 1); d = dst->ptr; s = src->base; while (--count >= 0) *d++ = *s++; @@ -63,17 +63,17 @@ scan_ident (fp, s, c) int c; { s->ptr = s->base; - if (ISIDST(c)) + if (ISIDST (c)) { for (;;) { - SSTRING_PUT(s, c); + SSTRING_PUT (s, c); c = getc (fp); - if (c == EOF || ! ISIDNUM(c)) + if (c == EOF || ! ISIDNUM (c)) break; } } - MAKE_SSTRING_SPACE(s, 1); + MAKE_SSTRING_SPACE (s, 1); *s->ptr = 0; return c; } @@ -104,9 +104,9 @@ scan_string (fp, s, init) if (c == '\n') continue; } - SSTRING_PUT(s, c); + SSTRING_PUT (s, c); } - MAKE_SSTRING_SPACE(s, 1); + MAKE_SSTRING_SPACE (s, 1); *s->ptr = 0; return c; } @@ -164,9 +164,9 @@ read_upto (fp, str, delim) ch = getc (fp); if (ch == EOF || ch == delim) break; - SSTRING_PUT(str, ch); + SSTRING_PUT (str, ch); } - MAKE_SSTRING_SPACE(str, 1); + MAKE_SSTRING_SPACE (str, 1); *str->ptr = 0; return ch; } @@ -215,9 +215,9 @@ get_token (fp, s) { do { - SSTRING_PUT(s, c); + SSTRING_PUT (s, c); c = getc (fp); - } while (c != EOF && ISDIGIT(c)); + } while (c != EOF && ISDIGIT (c)); ungetc (c, fp); c = INT_TOKEN; goto done; @@ -234,9 +234,9 @@ get_token (fp, s) ungetc (c, fp); return c == '\'' ? CHAR_TOKEN : STRING_TOKEN; } - SSTRING_PUT(s, c); + SSTRING_PUT (s, c); done: - MAKE_SSTRING_SPACE(s, 1); + MAKE_SSTRING_SPACE (s, 1); *s->ptr = 0; return c; } @@ -248,7 +248,7 @@ hashstr (str, len) { unsigned int n = len; unsigned int r = 0; - const unsigned char *s = (const unsigned char *)str; + const unsigned char *s = (const unsigned char *) str; do r = r * 67 + (*s++ - 113); diff --git a/gcc/sched-deps.c b/gcc/sched-deps.c index e315a4c22472..edf1feea505f 100644 --- a/gcc/sched-deps.c +++ b/gcc/sched-deps.c @@ -1,7 +1,7 @@ /* Instruction scheduling pass. This file computes dependencies between instructions. Copyright (C) 1992, 1993, 1994, 1995, 1996, 1997, 1998, - 1999, 2000, 2001 Free Software Foundation, Inc. + 1999, 2000, 2001, 2002 Free Software Foundation, Inc. Contributed by Michael Tiemann (tiemann@cygnus.com) Enhanced by, and currently maintained by, Jim Wilson (wilson@cygnus.com) @@ -334,7 +334,7 @@ add_dependence (insn, elem, dep_type) note that in the bitmap caches of dependency information. */ if (true_dependency_cache != NULL) { - if ((int)REG_NOTE_KIND (link) == 0) + if ((int) REG_NOTE_KIND (link) == 0) SET_BIT (true_dependency_cache[INSN_LUID (insn)], INSN_LUID (elem)); else if (REG_NOTE_KIND (link) == REG_DEP_ANTI) @@ -360,7 +360,7 @@ add_dependence (insn, elem, dep_type) in the bitmap caches of dependency information. */ if (true_dependency_cache != NULL) { - if ((int)dep_type == 0) + if ((int) dep_type == 0) SET_BIT (true_dependency_cache[INSN_LUID (insn)], INSN_LUID (elem)); else if (dep_type == REG_DEP_ANTI) SET_BIT (anti_dependency_cache[INSN_LUID (insn)], INSN_LUID (elem)); diff --git a/gcc/sched-vis.c b/gcc/sched-vis.c index bf7f968f06d3..2dd20d0cd506 100644 --- a/gcc/sched-vis.c +++ b/gcc/sched-vis.c @@ -1,6 +1,6 @@ /* Instruction scheduling pass. Copyright (C) 1992, 1993, 1994, 1995, 1996, 1997, 1998, - 1999, 2000 Free Software Foundation, Inc. + 1999, 2000, 2002 Free Software Foundation, Inc. Contributed by Michael Tiemann (tiemann@cygnus.com) Enhanced by, and currently maintained by, Jim Wilson (wilson@cygnus.com) @@ -928,7 +928,7 @@ visualize_stall_cycles (stalls) strcpy (p, prefix); p += strlen (prefix); - if ((unsigned)stalls > + if ((unsigned) stalls > visual_tbl_line_length - strlen (prefix) - strlen (suffix)) { suffix = "[...]\n"; diff --git a/gcc/sdbout.c b/gcc/sdbout.c index 91f92aa77a57..8405c0a8f29d 100644 --- a/gcc/sdbout.c +++ b/gcc/sdbout.c @@ -1,6 +1,6 @@ /* Output sdb-format symbol table information from GNU compiler. Copyright (C) 1988, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999, - 2000, 2001 Free Software Foundation, Inc. + 2000, 2001, 2002 Free Software Foundation, Inc. This file is part of GCC. @@ -150,7 +150,7 @@ static void sdbout_global_decl PARAMS ((tree)); #define PUT_SDB_INT_VAL(a) \ do { \ fputs ("\t.val\t", asm_out_file); \ - fprintf (asm_out_file, HOST_WIDE_INT_PRINT_DEC, (HOST_WIDE_INT)(a)); \ + fprintf (asm_out_file, HOST_WIDE_INT_PRINT_DEC, (HOST_WIDE_INT) (a)); \ fprintf (asm_out_file, "%s", SDB_DELIM); \ } while (0) @@ -186,7 +186,7 @@ do { fprintf (asm_out_file, "\t.def\t"); \ #define PUT_SDB_SIZE(a) \ do { \ fputs ("\t.size\t", asm_out_file); \ - fprintf (asm_out_file, HOST_WIDE_INT_PRINT_DEC, (HOST_WIDE_INT)(a)); \ + fprintf (asm_out_file, HOST_WIDE_INT_PRINT_DEC, (HOST_WIDE_INT) (a)); \ fprintf (asm_out_file, "%s", SDB_DELIM); \ } while(0) #endif @@ -381,9 +381,9 @@ gen_fake_label () PREV is the number describing the target, value or element type. DT_type describes how to transform that type. */ #define PUSH_DERIVED_LEVEL(DT_type,PREV) \ - ((((PREV) & ~(int)N_BTMASK) << (int)N_TSHIFT) \ - | ((int)DT_type << (int)N_BTSHFT) \ - | ((PREV) & (int)N_BTMASK)) + ((((PREV) & ~(int) N_BTMASK) << (int) N_TSHIFT) \ + | ((int) DT_type << (int) N_BTSHFT) \ + | ((PREV) & (int) N_BTMASK)) /* Number of elements used in sdb_dims. */ static int sdb_n_dims = 0; diff --git a/gcc/sibcall.c b/gcc/sibcall.c index fe76865aa3ca..6c2dc5c09146 100644 --- a/gcc/sibcall.c +++ b/gcc/sibcall.c @@ -1,5 +1,5 @@ /* Generic sibling call optimization support - Copyright (C) 1999, 2000, 2001 Free Software Foundation, Inc. + Copyright (C) 1999, 2000, 2001, 2002 Free Software Foundation, Inc. This file is part of GCC. @@ -546,7 +546,7 @@ replace_call_placeholder (insn, use) else if (use == sibcall_use_normal) emit_insns_before (XEXP (PATTERN (insn), 0), insn); else - abort(); + abort (); /* Turn off LABEL_PRESERVE_P for the tail recursion label if it exists. We only had to set it long enough to keep the jump diff --git a/gcc/ssa-ccp.c b/gcc/ssa-ccp.c index ba275c370c4d..9d2d9c9170e7 100644 --- a/gcc/ssa-ccp.c +++ b/gcc/ssa-ccp.c @@ -1,5 +1,5 @@ /* Conditional constant propagation pass for the GNU compiler. - Copyright (C) 2000,2001 Free Software Foundation, Inc. + Copyright (C) 2000, 2001, 2002 Free Software Foundation, Inc. Original framework by Daniel Berlin Fleshed out and major cleanups by Jeff Law @@ -1102,7 +1102,7 @@ mark_references (current_rtx, data) void *data; { rtx x = *current_rtx; - sbitmap worklist = (sbitmap)data; + sbitmap worklist = (sbitmap) data; if (x == NULL_RTX) return 0; diff --git a/gcc/ssa-dce.c b/gcc/ssa-dce.c index cd37b2fc9103..83b4e44bf804 100644 --- a/gcc/ssa-dce.c +++ b/gcc/ssa-dce.c @@ -1,5 +1,5 @@ /* Dead-code elimination pass for the GNU compiler. - Copyright (C) 2000, 2001 Free Software Foundation, Inc. + Copyright (C) 2000, 2001, 2002 Free Software Foundation, Inc. Written by Jeffrey D. Oldham . This file is part of GCC. @@ -341,7 +341,7 @@ note_inherently_necessary_set (dest, set, data) rtx dest; void *data; { - int *inherently_necessary_set_p = (int *)data; + int *inherently_necessary_set_p = (int *) data; while (GET_CODE (dest) == SUBREG || GET_CODE (dest) == STRICT_LOW_PART @@ -396,7 +396,7 @@ find_inherently_necessary (x) } default: /* Found an impossible insn type. */ - abort(); + abort (); break; } } @@ -521,7 +521,7 @@ ssa_eliminate_dead_code () for (i = 0; i < n_basic_blocks; ++i) if (pdom[i] == INVALID_BLOCK) pdom[i] = EXIT_BLOCK; - el = create_edge_list(); + el = create_edge_list (); find_all_control_dependences (el, pdom, cdbte); /* Find inherently necessary instructions. */ diff --git a/gcc/ssa.c b/gcc/ssa.c index 503d1a74f6d2..c97b35c35883 100644 --- a/gcc/ssa.c +++ b/gcc/ssa.c @@ -1,5 +1,5 @@ /* Static Single Assignment conversion routines for the GNU compiler. - Copyright (C) 2000, 2001 Free Software Foundation, Inc. + Copyright (C) 2000, 2001, 2002 Free Software Foundation, Inc. This file is part of GCC. @@ -625,9 +625,9 @@ compute_iterated_dominance_frontiers (idfs, frontiers, evals, nregs) if (rtl_dump_file) { - fprintf(rtl_dump_file, - "Iterated dominance frontier: %d passes on %d regs.\n", - passes, nregs); + fprintf (rtl_dump_file, + "Iterated dominance frontier: %d passes on %d regs.\n", + passes, nregs); } } @@ -743,7 +743,7 @@ create_delayed_rename (c, reg_loc) if (GET_CODE (*reg_loc) != REG || !CONVERT_REGISTER_TO_SSA_P (REGNO (*reg_loc))) - abort(); + abort (); r->reg_loc = reg_loc; r->old_reg = *reg_loc; @@ -779,7 +779,7 @@ apply_delayed_renames (c) /* Failure here means that someone has a PARALLEL that sets a register twice (bad!). */ if (ssa_rename_to_lookup (r->old_reg) != r->prev_reg) - abort(); + abort (); /* Failure here means we have changed REG_LOC before applying the rename. */ /* For the first set we come across, reuse the original regno. */ @@ -1091,7 +1091,7 @@ rename_block (bb, idom) rtx old_reg = *set_data->reg_loc; if (*set_data->reg_loc != set_data->old_reg) - abort(); + abort (); *set_data->reg_loc = set_data->new_reg; ssa_rename_to_insert (old_reg, set_data->prev_reg); @@ -1149,7 +1149,7 @@ convert_to_ssa () life_analysis (get_insns (), NULL, 0); idom = (int *) alloca (n_basic_blocks * sizeof (int)); - memset ((void *)idom, -1, (size_t)n_basic_blocks * sizeof (int)); + memset ((void *) idom, -1, (size_t) n_basic_blocks * sizeof (int)); calculate_dominance_info (idom, NULL, CDI_DOMINATORS); if (rtl_dump_file) @@ -1175,7 +1175,7 @@ convert_to_ssa () /* Compute register evaluations. */ - ssa_max_reg_num = max_reg_num(); + ssa_max_reg_num = max_reg_num (); nregs = ssa_max_reg_num; evals = sbitmap_vector_alloc (nregs, n_basic_blocks); find_evaluations (evals, nregs); @@ -1395,7 +1395,7 @@ eliminate_phi (e, reg_partition) reg = *preg; if (GET_CODE (reg) != REG || GET_CODE (tgt) != REG) - abort(); + abort (); reg = regno_reg_rtx[partition_find (reg_partition, REGNO (reg))]; tgt = regno_reg_rtx[partition_find (reg_partition, REGNO (tgt))]; @@ -2122,7 +2122,7 @@ rename_equivalent_regs (reg_partition) int i; if (slen <= 1) - abort(); + abort (); PATTERN (insn) = XVECEXP (s, 0, slen-1); for (i = 0; i < slen - 1; i++) @@ -2139,7 +2139,7 @@ rename_equivalent_regs (reg_partition) /* The main entry point for moving from SSA. */ void -convert_from_ssa() +convert_from_ssa () { int bb; partition reg_partition; diff --git a/gcc/stmt.c b/gcc/stmt.c index 6933599a89e4..c7c6b2a084d3 100644 --- a/gcc/stmt.c +++ b/gcc/stmt.c @@ -110,7 +110,7 @@ static int cost_table_initialized; /* Special care is needed because we allow -1, but TREE_INT_CST_LOW is unsigned. */ -#define COST_TABLE(I) cost_table_[(unsigned HOST_WIDE_INT)((I) + 1)] +#define COST_TABLE(I) cost_table_[(unsigned HOST_WIDE_INT) ((I) + 1)] /* Stack of control and binding constructs we are currently inside. diff --git a/gcc/stor-layout.c b/gcc/stor-layout.c index fe9ed2c9ca85..91aa45461835 100644 --- a/gcc/stor-layout.c +++ b/gcc/stor-layout.c @@ -1,6 +1,6 @@ /* C-compiler utilities for types and variables storage layout Copyright (C) 1987, 1988, 1992, 1993, 1994, 1995, 1996, 1996, 1998, - 1999, 2000, 2001 Free Software Foundation, Inc. + 1999, 2000, 2001, 2002 Free Software Foundation, Inc. This file is part of GCC. @@ -1563,7 +1563,7 @@ layout_type (type) case SET_TYPE: /* Used by Chill and Pascal. */ if (TREE_CODE (TYPE_MAX_VALUE (TYPE_DOMAIN (type))) != INTEGER_CST || TREE_CODE (TYPE_MIN_VALUE (TYPE_DOMAIN (type))) != INTEGER_CST) - abort(); + abort (); else { #ifndef SET_WORD_SIZE diff --git a/gcc/system.h b/gcc/system.h index 08be6449bdd9..a55351a0fcbd 100644 --- a/gcc/system.h +++ b/gcc/system.h @@ -178,7 +178,7 @@ extern int errno; UPPER. However the bounds themselves can be either positive or negative. */ #define IN_RANGE(VALUE, LOWER, UPPER) \ - ((unsigned HOST_WIDE_INT)((VALUE) - (LOWER)) <= ((UPPER) - (LOWER))) + ((unsigned HOST_WIDE_INT) ((VALUE) - (LOWER)) <= ((UPPER) - (LOWER))) /* Infrastructure for defining missing _MAX and _MIN macros. Note that macros defined with these cannot be used in #if. */ @@ -507,7 +507,7 @@ extern void abort PARAMS ((void)); #endif #ifndef offsetof -#define offsetof(TYPE, MEMBER) ((size_t) &((TYPE *)0)->MEMBER) +#define offsetof(TYPE, MEMBER) ((size_t) &((TYPE *) 0)->MEMBER) #endif /* Traditional C cannot initialize union members of structs. Provide -- 2.39.5