Commit c4f2c499 by Kazu Hirata Committed by Kazu Hirata

cse.c: Fix formatting.

	* cse.c: Fix formatting.
	* dwarf2asm.c: Likewise.
	* dwarf2out.c: Likewise.
	* explow.c: Likewise.
	* expmed.c: Likewise.
	* function.c: Likewise.
	* gcov.c: Likewise.
	* gencheck.c: Likewise.
	* genrecog.c: Likewise.
	* ggc-common.c: Likewise.
	* ggc-page.c: Likewise.
	* global.c: Likewise.

From-SVN: r48570
parent cf0d9408
2002-01-05 Kazu Hirata <kazu@hxi.com>
* cse.c: Fix formatting.
* dwarf2asm.c: Likewise.
* dwarf2out.c: Likewise.
* explow.c: Likewise.
* expmed.c: Likewise.
* function.c: Likewise.
* gcov.c: Likewise.
* gencheck.c: Likewise.
* genrecog.c: Likewise.
* ggc-common.c: Likewise.
* ggc-page.c: Likewise.
* global.c: Likewise.
2002-01-05 Kazu Hirata <kazu@hxi.com>
* combine.c: Fix formatting.
2002-01-05 Craig Rodrigues <crodrigu@bbn.com>
......
/* Common subexpression elimination for GNU compiler.
Copyright (C) 1987, 1988, 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.
......@@ -1989,7 +1989,7 @@ remove_invalid_refs (regno)
{
next = p->next_same_hash;
if (GET_CODE (p->exp) != REG
&& refers_to_regno_p (regno, regno + 1, p->exp, (rtx*)0))
&& refers_to_regno_p (regno, regno + 1, p->exp, (rtx*) 0))
remove_from_table (p, i);
}
}
......@@ -2019,7 +2019,7 @@ remove_invalid_subreg_refs (regno, offset, mode)
|| (((SUBREG_BYTE (exp)
+ (GET_MODE_SIZE (GET_MODE (exp)) - 1)) >= offset)
&& SUBREG_BYTE (exp) <= end))
&& refers_to_regno_p (regno, regno + 1, p->exp, (rtx*)0))
&& refers_to_regno_p (regno, regno + 1, p->exp, (rtx*) 0))
remove_from_table (p, i);
}
}
......
/* Dwarf2 assembler output helper routines.
Copyright (C) 2001 Free Software Foundation, Inc.
Copyright (C) 2001, 2002 Free Software Foundation, Inc.
This file is part of GCC.
......@@ -74,7 +74,7 @@ dw2_asm_output_data VPARAMS ((int size, unsigned HOST_WIDE_INT value,
VA_FIXEDARG (ap, const char *, comment);
if (size * 8 < HOST_BITS_PER_WIDE_INT)
value &= ~(~(unsigned HOST_WIDE_INT)0 << (size * 8));
value &= ~(~(unsigned HOST_WIDE_INT) 0 << (size * 8));
dw2_assemble_integer (size, GEN_INT (value));
......
......@@ -6195,7 +6195,7 @@ output_loc_list (list_head)
if (strcmp (curr->section, ".text") == 0)
{
/* dw2_asm_output_data will mask off any extra bits in the ~0. */
dw2_asm_output_data (DWARF2_ADDR_SIZE, ~(unsigned HOST_WIDE_INT)0,
dw2_asm_output_data (DWARF2_ADDR_SIZE, ~(unsigned HOST_WIDE_INT) 0,
"Location list base address specifier fake entry");
dw2_asm_output_offset (DWARF2_ADDR_SIZE, curr->section,
"Location list base address specifier base");
......
/* Subroutines for manipulating rtx's in semantically interesting ways.
Copyright (C) 1987, 1991, 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.
......@@ -1133,7 +1133,7 @@ optimize_save_area_alloca (insns)
break;
if (srch == NULL_RTX)
abort();
abort ();
XEXP (srch, 1) = XEXP (note, 1);
}
......
/* Medium-level subroutines: convert bit-field store and extract
and shifts, multiplies and divides to rtl instructions.
Copyright (C) 1987, 1988, 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.
......@@ -1209,8 +1209,8 @@ extract_bit_field (str_rtx, bitsize, bitnum, unsignedp,
if (int_mode == BLKmode)
int_mode = int_mode_for_mode (mode);
if (int_mode == BLKmode)
abort(); /* Should probably push op0 out to memory and then
do a load. */
abort (); /* Should probably push op0 out to memory and then
do a load. */
/* OFFSET is the number of words or bytes (UNIT says which)
from STR_RTX to the first word or byte containing part of the field. */
......@@ -2637,7 +2637,7 @@ choose_multiplier (d, n, precision, multiplier_ptr, post_shift_ptr, lgup_ptr)
abort ();
/* assert that mlow < mhigh. */
if (! (mlow_hi < mhigh_hi || (mlow_hi == mhigh_hi && mlow_lo < mhigh_lo)))
abort();
abort ();
/* If precision == N, then mlow, mhigh exceed 2^N
(but they do not exceed 2^(N+1)). */
......@@ -4702,18 +4702,18 @@ do_cmp_and_jump (arg1, arg2, op, mode, label)
that's the only equality operations we do */
case EQ:
if (arg2 != const0_rtx || mode != GET_MODE(arg1))
abort();
abort ();
do_jump_by_parts_equality_rtx (arg1, label2, label);
break;
case NE:
if (arg2 != const0_rtx || mode != GET_MODE(arg1))
abort();
abort ();
do_jump_by_parts_equality_rtx (arg1, label, label2);
break;
default:
abort();
abort ();
}
emit_label (label2);
......
/* Expands front end tree to back end RTL for GNU C-Compiler
Copyright (C) 1987, 1988, 1989, 1991, 1992, 1993, 1994, 1995, 1996, 1997,
1998, 1999, 2000, 2001 Free Software Foundation, Inc.
1998, 1999, 2000, 2001, 2002 Free Software Foundation, Inc.
This file is part of GCC.
......@@ -726,7 +726,7 @@ assign_stack_temp_for_type (mode, size, keep, type)
and round it now. We also make sure ALIGNMENT is at least
BIGGEST_ALIGNMENT. */
if (mode == BLKmode && align < BIGGEST_ALIGNMENT)
abort();
abort ();
p->slot = assign_stack_local (mode,
(mode == BLKmode
? CEIL_ROUND (size, align / BITS_PER_UNIT)
......
/* Gcov.c: prepend line execution counts and branch probabilities to a
source file.
Copyright (C) 1990, 1991, 1992, 1993, 1994, 1996, 1997, 1998,
1999, 2000, 2001 Free Software Foundation, Inc.
1999, 2000, 2001, 2002 Free Software Foundation, Inc.
Contributed by James E. Wilson of Cygnus Support.
Mangled by Bob Manson of Cygnus Support.
......@@ -615,7 +615,7 @@ create_program_flow_graph (bptr)
{
gcov_type tmp_count = 0;
if (da_file && __read_gcov_type (&tmp_count, da_file, 8))
abort();
abort ();
arcptr->arc_count = tmp_count;
arcptr->count_valid = 1;
......@@ -760,7 +760,7 @@ read_files ()
/* Read and ignore the first word of the .da file, which is the count of
how many numbers follow. */
if (da_file && __read_long (&total, da_file, 8))
abort();
abort ();
while (! feof (bbg_file))
{
......@@ -885,7 +885,7 @@ scan_for_source_files ()
else if (line_num < 0)
{
/* Don't know what this is, but it's garbage. */
abort();
abort ();
}
}
}
......
/* Generate check macros for tree codes.
Copyright (C) 1998, 1999, 2000 Free Software Foundation, Inc.
Copyright (C) 1998, 1999, 2000, 2002 Free Software Foundation, Inc.
This file is part of GCC.
......@@ -27,7 +27,7 @@ static const char *const tree_codes[] = {
#include "tree.def"
#include "c-common.def"
#include "gencheck.h"
(char*)0
(char*) 0
};
static void usage PARAMS ((void));
......
/* Generate code from machine description to recognize rtl as insns.
Copyright (C) 1987, 1988, 1992, 1993, 1994, 1995, 1997, 1998,
1999, 2000, 2001 Free Software Foundation, Inc.
1999, 2000, 2001, 2002 Free Software Foundation, Inc.
This file is part of GCC.
......@@ -1258,7 +1258,7 @@ maybe_both_true (d1, d2, toplevel)
if (cmp != 0)
{
if (toplevel)
abort();
abort ();
/* If the d2->position was lexically lower, swap. */
if (cmp > 0)
......
/* Simple garbage collection for the GNU compiler.
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.
......@@ -165,7 +165,7 @@ ggc_del_root (base)
x = x->next;
}
abort();
abort ();
}
/* Add a hash table to be scanned when all roots have been processed. We
......
/* "Bag-of-pages" garbage collector for the GNU compiler.
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.
......@@ -535,7 +535,7 @@ static inline size_t
page_group_index (allocation, page)
char *allocation, *page;
{
return (size_t)(page - allocation) >> G.lg_pagesize;
return (size_t) (page - allocation) >> G.lg_pagesize;
}
/* Set and clear the in_use bit for this page in the page group. */
......@@ -654,7 +654,7 @@ alloc_page (order)
alloc_size = entry_size + G.pagesize - 1;
allocation = xmalloc (alloc_size);
page = (char *)(((size_t) allocation + G.pagesize - 1) & -G.pagesize);
page = (char *) (((size_t) allocation + G.pagesize - 1) & -G.pagesize);
head_slop = page - allocation;
if (multiple_pages)
tail_slop = ((size_t) allocation + alloc_size) & (G.pagesize - 1);
......
/* Allocate registers for pseudo-registers that span basic blocks.
Copyright (C) 1987, 1988, 1991, 1994, 1996, 1997, 1998,
1999, 2000 Free Software Foundation, Inc.
1999, 2000, 2002 Free Software Foundation, Inc.
This file is part of GCC.
......@@ -168,12 +168,12 @@ static int allocno_row_words;
/* Two macros to test or store 1 in an element of `conflicts'. */
#define CONFLICTP(I, J) \
(conflicts[(I) * allocno_row_words + (unsigned)(J) / INT_BITS] \
& ((INT_TYPE) 1 << ((unsigned)(J) % INT_BITS)))
(conflicts[(I) * allocno_row_words + (unsigned) (J) / INT_BITS] \
& ((INT_TYPE) 1 << ((unsigned) (J) % INT_BITS)))
#define SET_CONFLICT(I, J) \
(conflicts[(I) * allocno_row_words + (unsigned)(J) / INT_BITS] \
|= ((INT_TYPE) 1 << ((unsigned)(J) % INT_BITS)))
(conflicts[(I) * allocno_row_words + (unsigned) (J) / INT_BITS] \
|= ((INT_TYPE) 1 << ((unsigned) (J) % INT_BITS)))
/* For any allocno set in ALLOCNO_SET, set ALLOCNO to that allocno,
and execute CODE. */
......@@ -248,16 +248,16 @@ static INT_TYPE *allocnos_live;
a bit vector indexed by allocno. */
#define ALLOCNO_LIVE_P(I) \
(allocnos_live[(unsigned)(I) / INT_BITS] \
& ((INT_TYPE) 1 << ((unsigned)(I) % INT_BITS)))
(allocnos_live[(unsigned) (I) / INT_BITS] \
& ((INT_TYPE) 1 << ((unsigned) (I) % INT_BITS)))
#define SET_ALLOCNO_LIVE(I) \
(allocnos_live[(unsigned)(I) / INT_BITS] \
|= ((INT_TYPE) 1 << ((unsigned)(I) % INT_BITS)))
(allocnos_live[(unsigned) (I) / INT_BITS] \
|= ((INT_TYPE) 1 << ((unsigned) (I) % INT_BITS)))
#define CLEAR_ALLOCNO_LIVE(I) \
(allocnos_live[(unsigned)(I) / INT_BITS] \
&= ~((INT_TYPE) 1 << ((unsigned)(I) % INT_BITS)))
(allocnos_live[(unsigned) (I) / INT_BITS] \
&= ~((INT_TYPE) 1 << ((unsigned) (I) % INT_BITS)))
/* This is turned off because it doesn't work right for DImode.
(And it is only used for DImode, so the other cases are worthless.)
......
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