This is the mail archive of the
gcc-patches@gcc.gnu.org
mailing list for the GCC project.
[patch] gcc/l*.[ch]: Fix formatting.
- From: Kazu Hirata <kazu at cs dot umass dot edu>
- To: gcc-patches at gcc dot gnu dot org
- Date: Thu, 30 May 2002 16:55:39 -0400 (EDT)
- Subject: [patch] gcc/l*.[ch]: Fix formatting.
Hi,
Attached is a patch to fix formatting. Committed as obvious.
Kazu Hirata
2002-05-30 Kazu Hirata <kazu@cs.umass.edu>
* langhooks.c: Fix formatting.
* langhooks.h: Likewise.
* lcm.c: Likewise.
* libgcc2.c: Likewise.
* lists.c: Likewise.
* local-alloc.c: Likewise.
* loop.c: Likewise.
* loop.h: Likewise.
Index: langhooks.c
===================================================================
RCS file: /cvs/gcc/gcc/gcc/langhooks.c,v
retrieving revision 1.30
diff -u -r1.30 langhooks.c
--- langhooks.c 25 Apr 2002 06:24:22 -0000 1.30
+++ langhooks.c 30 May 2002 20:48:48 -0000
@@ -158,9 +158,9 @@
VAR_DECLs for variables with static storage duration need a real
DECL_ASSEMBLER_NAME. */
if (TREE_CODE (decl) == FUNCTION_DECL
- || (TREE_CODE (decl) == VAR_DECL
- && (TREE_STATIC (decl)
- || DECL_EXTERNAL (decl)
+ || (TREE_CODE (decl) == VAR_DECL
+ && (TREE_STATIC (decl)
+ || DECL_EXTERNAL (decl)
|| TREE_PUBLIC (decl))))
/* By default, assume the name to use in assembly code is the
same as that used in the source language. (That's correct
@@ -400,8 +400,8 @@
return value;
}
-/* lang_hooks.tree_dump.dump_tree: Dump language-specific parts of tree
- nodes. Returns non-zero if it does not want the usual dumping of the
+/* lang_hooks.tree_dump.dump_tree: Dump language-specific parts of tree
+ nodes. Returns non-zero if it does not want the usual dumping of the
second argument. */
int
@@ -412,7 +412,7 @@
return 0;
}
-/* lang_hooks.tree_dump.type_qual: Determine type qualifiers in a
+/* lang_hooks.tree_dump.type_qual: Determine type qualifiers in a
language-specific way. */
int
@@ -421,4 +421,3 @@
{
return TYPE_QUALS (t);
}
-
Index: langhooks.h
===================================================================
RCS file: /cvs/gcc/gcc/gcc/langhooks.h,v
retrieving revision 1.40
diff -u -r1.40 langhooks.h
--- langhooks.h 22 May 2002 05:40:09 -0000 1.40
+++ langhooks.h 30 May 2002 20:48:48 -0000
@@ -81,7 +81,7 @@
struct lang_hooks_for_tree_dump
{
- /* Dump language-specific parts of tree nodes. Returns non-zero if it
+ /* Dump language-specific parts of tree nodes. Returns non-zero if it
does not want the usual dumping of the second argument. */
int (*dump_tree) PARAMS ((void *, tree));
@@ -96,7 +96,7 @@
/* Return a new type (with the indicated CODE), doing whatever
language-specific processing is required. */
tree (*make_type) PARAMS ((enum tree_code));
-
+
/* Given MODE and UNSIGNEDP, return a suitable type-tree with that
mode. */
tree (*type_for_mode) PARAMS ((enum machine_mode, int));
@@ -344,7 +344,7 @@
struct lang_hooks_for_functions function;
struct lang_hooks_for_tree_inlining tree_inlining;
-
+
struct lang_hooks_for_tree_dump tree_dump;
struct lang_hooks_for_decls decls;
Index: lcm.c
===================================================================
RCS file: /cvs/gcc/gcc/gcc/lcm.c,v
retrieving revision 1.47
diff -u -r1.47 lcm.c
--- lcm.c 30 May 2002 18:58:31 -0000 1.47
+++ lcm.c 30 May 2002 20:48:50 -0000
@@ -147,7 +147,7 @@
qlen--;
if (qout >= qend)
- qout = worklist;
+ qout = worklist;
if (bb->aux == EXIT_BLOCK_PTR)
/* Do not clear the aux field for blocks which are predecessors of
@@ -174,7 +174,7 @@
e->src->aux = e;
qlen++;
if (qin >= qend)
- qin = worklist;
+ qin = worklist;
}
}
@@ -207,7 +207,7 @@
if (pred == ENTRY_BLOCK_PTR)
sbitmap_copy (earliest[x], antin[succ->index]);
else
- {
+ {
if (succ == EXIT_BLOCK_PTR)
sbitmap_zero (earliest[x]);
else
@@ -317,7 +317,7 @@
bb->aux = NULL;
qlen--;
if (qout >= qend)
- qout = worklist;
+ qout = worklist;
/* Compute the intersection of LATERIN for each incoming edge to B. */
sbitmap_ones (laterin[bb->index]);
@@ -529,7 +529,7 @@
qlen--;
if (qout >= qend)
- qout = worklist;
+ qout = worklist;
/* If one of the predecessor blocks is the ENTRY block, then the
intersection of avouts is the null set. We can identify such blocks
@@ -558,7 +558,7 @@
qlen++;
if (qin >= qend)
- qin = worklist;
+ qin = worklist;
}
}
@@ -930,7 +930,7 @@
{
ptr = head->seginfo;
while (ptr->next != NULL)
- ptr = ptr->next;
+ ptr = ptr->next;
ptr->next = info;
}
}
@@ -1035,7 +1035,7 @@
/* Create the list of segments within each basic block.
If NORMAL_MODE is defined, allow for two extra
- blocks split from the entry and exit block. */
+ blocks split from the entry and exit block. */
#ifdef NORMAL_MODE
entry_exit_extra = 2;
#endif
Index: libgcc2.c
===================================================================
RCS file: /cvs/gcc/gcc/gcc/libgcc2.c,v
retrieving revision 1.140
diff -u -r1.140 libgcc2.c
--- libgcc2.c 19 May 2002 08:31:47 -0000 1.140
+++ libgcc2.c 30 May 2002 20:48:51 -0000
@@ -151,9 +151,9 @@
Wtype
__negvsi2 (Wtype a)
{
- Wtype w;
+ Wtype w;
- w = -a;
+ w = -a;
if (a >= 0 ? w > 0 : w < 0)
abort ();
@@ -166,14 +166,14 @@
DWtype
__negvdi2 (DWtype a)
{
- DWtype w;
+ DWtype w;
- w = -a;
+ w = -a;
if (a >= 0 ? w > 0 : w < 0)
abort ();
- return w;
+ return w;
}
#endif
@@ -181,16 +181,16 @@
Wtype
__absvsi2 (Wtype a)
{
- Wtype w = a;
+ Wtype w = a;
- if (a < 0)
+ if (a < 0)
#ifdef L_negvsi2
- w = __negvsi2 (a);
+ w = __negvsi2 (a);
#else
- w = -a;
+ w = -a;
- if (w < 0)
- abort ();
+ if (w < 0)
+ abort ();
#endif
return w;
@@ -201,19 +201,19 @@
DWtype
__absvdi2 (DWtype a)
{
- DWtype w = a;
+ DWtype w = a;
- if (a < 0)
+ if (a < 0)
#ifdef L_negvsi2
- w = __negvsi2 (a);
+ w = __negvsi2 (a);
#else
- w = -a;
+ w = -a;
- if (w < 0)
- abort ();
+ if (w < 0)
+ abort ();
#endif
- return w;
+ return w;
}
#endif
@@ -221,7 +221,7 @@
DWtype
__mulvdi3 (DWtype u, DWtype v)
{
- DWtype w;
+ DWtype w;
w = u * v;
@@ -1383,21 +1383,21 @@
/* length of extra data in bytes. */
__write_long ((4 + 8 + 8) + (4 + 8 + 8), da_file, 4);
- /* overall statistics. */
+ /* overall statistics. */
/* number of counters. */
- __write_long (n_counters_p, da_file, 4);
+ __write_long (n_counters_p, da_file, 4);
/* sum of counters. */
- __write_gcov_type (sum_counters_p, da_file, 8);
+ __write_gcov_type (sum_counters_p, da_file, 8);
/* maximal counter. */
- __write_gcov_type (max_counter_p, da_file, 8);
+ __write_gcov_type (max_counter_p, da_file, 8);
- /* per-object statistics. */
+ /* per-object statistics. */
/* number of counters. */
- __write_long (ptr->ncounts, da_file, 4);
+ __write_long (ptr->ncounts, da_file, 4);
/* sum of counters. */
- __write_gcov_type (sum_counters_o, da_file, 8);
+ __write_gcov_type (sum_counters_o, da_file, 8);
/* maximal counter. */
- __write_gcov_type (max_counter_o, da_file, 8);
+ __write_gcov_type (max_counter_o, da_file, 8);
/* write execution counts for each function. */
@@ -1460,7 +1460,7 @@
if (blocks->zero_word)
return;
-
+
/* Initialize destructor and per-thread data. */
if (!bb_head)
atexit (__bb_exit_func);
@@ -1474,7 +1474,7 @@
/* Called before fork or exec - write out profile information gathered so
far and reset it to zero. This avoids duplication or loss of the
profile information gathered so far. */
-void
+void
__bb_fork_func (void)
{
struct bb *ptr;
Index: lists.c
===================================================================
RCS file: /cvs/gcc/gcc/gcc/lists.c,v
retrieving revision 1.10
diff -u -r1.10 lists.c
--- lists.c 11 Oct 2001 03:15:53 -0000 1.10
+++ lists.c 30 May 2002 20:48:52 -0000
@@ -62,7 +62,7 @@
}
/* This call is used in place of a gen_rtx_INSN_LIST. If there is a cached
- node available, we'll use it, otherwise a call to gen_rtx_INSN_LIST
+ node available, we'll use it, otherwise a call to gen_rtx_INSN_LIST
is made. */
rtx
alloc_INSN_LIST (val, next)
@@ -85,7 +85,7 @@
}
/* This call is used in place of a gen_rtx_EXPR_LIST. If there is a cached
- node available, we'll use it, otherwise a call to gen_rtx_EXPR_LIST
+ node available, we'll use it, otherwise a call to gen_rtx_EXPR_LIST
is made. */
rtx
alloc_EXPR_LIST (kind, val, next)
@@ -118,14 +118,14 @@
unused_insn_list = NULL;
}
-void
+void
init_EXPR_INSN_LIST_cache ()
{
ggc_add_root (&unused_expr_list, 1, 1, zap_lists);
}
/* This function will free up an entire list of EXPR_LIST nodes. */
-void
+void
free_EXPR_LIST_list (listp)
rtx *listp;
{
@@ -135,7 +135,7 @@
}
/* This function will free up an entire list of INSN_LIST nodes. */
-void
+void
free_INSN_LIST_list (listp)
rtx *listp;
{
@@ -145,7 +145,7 @@
}
/* This function will free up an individual EXPR_LIST node. */
-void
+void
free_EXPR_LIST_node (ptr)
rtx ptr;
{
@@ -154,7 +154,7 @@
}
/* This function will free up an individual INSN_LIST node. */
-void
+void
free_INSN_LIST_node (ptr)
rtx ptr;
{
Index: local-alloc.c
===================================================================
RCS file: /cvs/gcc/gcc/gcc/local-alloc.c,v
retrieving revision 1.108
diff -u -r1.108 local-alloc.c
--- local-alloc.c 23 May 2002 19:23:41 -0000 1.108
+++ local-alloc.c 30 May 2002 20:48:55 -0000
@@ -1115,7 +1115,7 @@
REG_N_REFS (regno) = 0;
REG_FREQ (regno) = 0;
delete_insn (equiv_insn);
-
+
reg_equiv[regno].init_insns
= XEXP (reg_equiv[regno].init_insns, 1);
}
@@ -1159,7 +1159,7 @@
{
int j;
if (clear_regnos > 8)
- {
+ {
FOR_EACH_BB (bb)
{
AND_COMPL_REG_SET (bb->global_live_at_start, &cleared_regs);
@@ -1167,8 +1167,8 @@
}
}
else
- EXECUTE_IF_SET_IN_REG_SET (&cleared_regs, 0, j,
- {
+ EXECUTE_IF_SET_IN_REG_SET (&cleared_regs, 0, j,
+ {
FOR_EACH_BB (bb)
{
CLEAR_REGNO_REG_SET (bb->global_live_at_start, j);
Index: loop.c
===================================================================
RCS file: /cvs/gcc/gcc/gcc/loop.c,v
retrieving revision 1.403
diff -u -r1.403 loop.c
--- loop.c 17 May 2002 02:31:37 -0000 1.403
+++ loop.c 30 May 2002 20:49:06 -0000
@@ -1073,7 +1073,7 @@
unconditional jump, otherwise the code at the top of the
loop might never be executed. Unconditional jumps are
followed by a barrier then the loop_end. */
- && ! (GET_CODE (p) == JUMP_INSN && JUMP_LABEL (p) == loop->top
+ && ! (GET_CODE (p) == JUMP_INSN && JUMP_LABEL (p) == loop->top
&& NEXT_INSN (NEXT_INSN (p)) == loop_end
&& any_uncondjump_p (p)))
maybe_never = 1;
@@ -3742,9 +3742,9 @@
/* In case our parameter was constant, remove extra zero from the
expression. */
if (XEXP (exp, 0) == const0_rtx)
- *x = XEXP (exp, 1);
+ *x = XEXP (exp, 1);
else if (XEXP (exp, 1) == const0_rtx)
- *x = XEXP (exp, 0);
+ *x = XEXP (exp, 0);
}
return addval;
@@ -8647,9 +8647,9 @@
/* Start with test for not first so that INSN == REFERENCE yields not
first. */
if (q == insn || ! p)
- return 0;
+ return 0;
if (p == reference || ! q)
- return 1;
+ return 1;
/* Either of P or Q might be a NOTE. Notes have the same LUID as the
previous insn, hence the <= comparison below does not work if
@@ -9642,11 +9642,11 @@
if (LOOP_INFO (loop)->has_call)
for (i = 0; i < FIRST_PSEUDO_REGISTER; i++)
if (TEST_HARD_REG_BIT (regs_invalidated_by_call, i)
- && rtx_varies_p (gen_rtx_REG (Pmode, i), /*for_alias=*/1))
- {
- regs->array[i].may_not_optimize = 1;
- regs->array[i].set_in_loop = 1;
- }
+ && rtx_varies_p (gen_rtx_REG (Pmode, i), /*for_alias=*/1))
+ {
+ regs->array[i].may_not_optimize = 1;
+ regs->array[i].set_in_loop = 1;
+ }
#ifdef AVOID_CCMODE_COPIES
/* Don't try to move insns which set CC registers if we should not
@@ -10583,9 +10583,9 @@
fprintf (file, " Giv%d: insn %d, benefit %d, ",
i, INSN_UID (v->insn), v->benefit);
if (v->giv_type == DEST_ADDR)
- print_simple_rtl (file, v->mem);
+ print_simple_rtl (file, v->mem);
else
- print_simple_rtl (file, single_set (v->insn));
+ print_simple_rtl (file, single_set (v->insn));
fputc ('\n', file);
}
}
@@ -10628,7 +10628,7 @@
if (v->giv_type == DEST_REG)
fprintf (file, "Giv %d: insn %d",
- REGNO (v->dest_reg), INSN_UID (v->insn));
+ REGNO (v->dest_reg), INSN_UID (v->insn));
else
fprintf (file, "Dest address: insn %d",
INSN_UID (v->insn));
Index: loop.h
===================================================================
RCS file: /cvs/gcc/gcc/gcc/loop.h,v
retrieving revision 1.60
diff -u -r1.60 loop.h
--- loop.h 16 May 2002 18:37:06 -0000 1.60
+++ loop.h 30 May 2002 20:49:06 -0000
@@ -205,7 +205,7 @@
struct iv
{
enum iv_mode type;
- union
+ union
{
struct iv_class *class;
struct induction *info;
@@ -394,7 +394,7 @@
rtx get_condition_for_loop PARAMS ((const struct loop *, rtx));
void loop_iv_add_mult_hoist PARAMS ((const struct loop *, rtx, rtx, rtx, rtx));
void loop_iv_add_mult_sink PARAMS ((const struct loop *, rtx, rtx, rtx, rtx));
-void loop_iv_add_mult_emit_before PARAMS ((const struct loop *, rtx,
+void loop_iv_add_mult_emit_before PARAMS ((const struct loop *, rtx,
rtx, rtx, rtx,
basic_block, rtx));
rtx express_from PARAMS ((struct induction *, struct induction *));
@@ -414,7 +414,7 @@
int loop_insn_first_p PARAMS ((rtx, rtx));
typedef rtx (*loop_insn_callback) PARAMS ((struct loop *, rtx, int, int));
void for_each_insn_in_loop PARAMS ((struct loop *, loop_insn_callback));
-rtx loop_insn_emit_before PARAMS((const struct loop *, basic_block,
+rtx loop_insn_emit_before PARAMS((const struct loop *, basic_block,
rtx, rtx));
rtx loop_insn_sink PARAMS((const struct loop *, rtx));
rtx loop_insn_hoist PARAMS((const struct loop *, rtx));