Skip to content

R
riscv-gcc-1
Commit cf403648 by Kazu Hirata Committed by Kazu Hirata
Options

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