Skip to content

R
riscv-gcc-1
Commit 3a538a66 by Kazu Hirata Committed by Kazu Hirata
Options

dbxout.c: Fix formatting. 

	* dbxout.c: Fix formatting.
	* dependence.c: Likewise.
	* df.c: Likewise.
	* diagnostic.c: Likewise.
	* doloop.c: Likewise.
	* dominance.c: Likewise.
	* doschk.c: Likewise.
	* dwarf2asm.c: Likewise.
	* dwarf2out.c: Likewise.
	* dwarfout.c: Likewise.

From-SVN: r53380
parent c9c2cb7c
Showing with 89 additions and 72 deletions
gcc/ChangeLog
2002-05-11 Kazu Hirata <kazu@cs.umass.edu>
* dbxout.c: Fix formatting.
* dependence.c: Likewise.
* df.c: Likewise.
* diagnostic.c: Likewise.
* doloop.c: Likewise.
* dominance.c: Likewise.
* doschk.c: Likewise.
* dwarf2asm.c: Likewise.
* dwarf2out.c: Likewise.
* dwarfout.c: Likewise.
2002-05-10 Richard Henderson <rth@redhat.com>
* final.c (end_final): Tidy whitespace. Don't honor flag_pack_struct.
......
gcc/dbxout.c
......@@ -669,7 +669,7 @@ dbxout_global_decl (decl)
&& ! DECL_EXTERNAL (decl)
&& DECL_RTL_SET_P (decl)) /* Not necessary? */
dbxout_symbol (decl, 0);
}
}
/* At the end of compilation, finish writing the symbol table.
Unless you define DBX_OUTPUT_MAIN_SOURCE_FILE_END, the default is
......@@ -959,7 +959,7 @@ dbxout_type_methods (type)
}
if (!need_prefix)
{
putc (';', asmfile);
putc (';', asmfile);
CHARS (1);
}
}
......@@ -1219,7 +1219,7 @@ dbxout_type (type, full)
write it as a subtype. */
else if (TREE_TYPE (type) != 0
&& TREE_CODE (TREE_TYPE (type)) == INTEGER_TYPE)
{
{
/* If the size is non-standard, say what it is if we can use
GDB extensions. */
......@@ -1232,10 +1232,10 @@ dbxout_type (type, full)
}
dbxout_range_type (type);
}
}
else
{
{
/* If the size is non-standard, say what it is if we can use
GDB extensions. */
......@@ -1259,7 +1259,7 @@ dbxout_type (type, full)
larger. This is because we print the bounds as signed decimal,
and hence they can't span same size unsigned types. */
if (use_gnu_debug_info_extensions
if (use_gnu_debug_info_extensions
&& TYPE_MIN_VALUE (type) != 0
&& TREE_CODE (TYPE_MIN_VALUE (type)) == INTEGER_CST
&& TYPE_MAX_VALUE (type) != 0
......@@ -1288,7 +1288,7 @@ dbxout_type (type, full)
else
/* Output other integer types as subranges of `int'. */
dbxout_range_type (type);
}
}
break;
......@@ -1801,7 +1801,7 @@ print_wide_int (c)
CHARS (digs);
}
/* Output the name of type TYPE, with no punctuation.
Such names can be set up either by typedef declarations
or by struct, enum and union tags. */
......@@ -1947,7 +1947,7 @@ dbxout_symbol (decl, local)
&& !TREE_ASM_WRITTEN (TYPE_NAME (type))
/* Distinguish the implicit typedefs of C++
from explicit ones that might be found in C. */
&& DECL_ARTIFICIAL (decl)
&& DECL_ARTIFICIAL (decl)
/* Do not generate a tag for records of variable size,
since this type can not be properly described in the
DBX format, and it confuses some tools such as objdump. */
......@@ -1979,7 +1979,7 @@ dbxout_symbol (decl, local)
&& TYPE_NAME (type) == decl
/* Distinguish the implicit typedefs of C++
from explicit ones that might be found in C. */
&& DECL_ARTIFICIAL (decl))
&& DECL_ARTIFICIAL (decl))
{
if (use_gnu_debug_info_extensions && have_used_extensions)
{
......@@ -2112,7 +2112,7 @@ dbxout_symbol (decl, local)
result = dbxout_symbol_location (decl, type, 0, DECL_RTL (decl));
break;
default:
break;
}
......@@ -2136,7 +2136,7 @@ dbxout_symbol_location (decl, type, suffix, home)
/* Don't mention a variable at all
if it was completely optimized into nothingness.
If the decl was from an inline function, then its rtl
is not identically the rtl that was used in this
particular compilation. */
......@@ -2215,7 +2215,7 @@ dbxout_symbol_location (decl, type, suffix, home)
|| GET_CODE (tmp) == LABEL_REF)
current_sym_addr = tmp;
}
/* Ultrix `as' seems to need this. */
#ifdef DBX_STATIC_STAB_DATA_SECTION
data_section ();
......@@ -2504,7 +2504,7 @@ dbxout_parms (parms)
}
/* It is quite tempting to use:
dbxout_type (TREE_TYPE (parms), 0);
as the next statement, rather than using DECL_ARG_TYPE(), so
......@@ -2517,7 +2517,7 @@ dbxout_parms (parms)
double on the stack, but if we emit a stab saying the type is a
float, then gdb will only read in a single value, and this will
produce an erroneous value. */
dbxout_type (DECL_ARG_TYPE (parms), 0);
dbxout_type (DECL_ARG_TYPE (parms), 0);
current_sym_value = DEBUGGER_ARG_OFFSET (current_sym_value, addr);
dbxout_finish_symbol (parms);
}
......@@ -2635,13 +2635,13 @@ dbxout_parms (parms)
const char *const decl_name = (DECL_NAME (parms)
? IDENTIFIER_POINTER (DECL_NAME (parms))
: "(anon)");
if (GET_CODE (XEXP (XEXP (DECL_RTL (parms), 0), 0)) == REG)
current_sym_value = 0;
if (GET_CODE (XEXP (XEXP (DECL_RTL (parms), 0), 0)) == REG)
current_sym_value = 0;
else
current_sym_value
= INTVAL (XEXP (XEXP (XEXP (DECL_RTL (parms), 0), 0), 1));
current_sym_addr = 0;
FORCE_TEXT;
fprintf (asmfile, "%s\"%s:v", ASM_STABS_OP, decl_name);
......@@ -2679,7 +2679,7 @@ dbxout_parms (parms)
&& TYPE_MODE (TREE_TYPE (parms)) != GET_MODE (DECL_RTL (parms))
&& GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (parms))) < UNITS_PER_WORD)
{
current_sym_value +=
current_sym_value +=
GET_MODE_SIZE (GET_MODE (DECL_RTL (parms)))
- GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (parms)));
}
......@@ -2789,7 +2789,7 @@ dbxout_block (block, depth, args)
int blocknum = -1;
#if DBX_BLOCKS_FUNCTION_RELATIVE
const char *begin_label;
const char *begin_label;
if (current_function_func_begin_label != NULL_TREE)
begin_label = IDENTIFIER_POINTER (current_function_func_begin_label);
else
......
gcc/dependence.c
......@@ -149,7 +149,7 @@ typedef struct dependence
int distance[MAX_SUBSCRIPTS];
struct dependence *next;
} dependence;
/* subscripts are represented by an array of these. Each reflects one
X * i + Y term, where X and Y are constants. */
......@@ -255,7 +255,7 @@ init_dependence_analysis (exp)
}
/* Build ARRAY_REF def/use info 'def_use_chain' starting at EXP which is a def
or use DU_TYPE */
or use DU_TYPE */
static void
build_def_use (exp, du_type)
......@@ -277,7 +277,7 @@ build_def_use (exp, du_type)
nloop = 0;
du_idx = 0;
}
while (node)
switch (TREE_CODE (node))
{
......@@ -301,7 +301,7 @@ build_def_use (exp, du_type)
TREE_OPERAND (node, 2), loop_def)
== 0)
loop_def->status = unnormal;
build_def_use (TREE_OPERAND (node, 3), 0);
nloop--;
current_loop = 0;
......@@ -309,7 +309,7 @@ build_def_use (exp, du_type)
break;
case MODIFY_EXPR:
/* Is an induction variable modified? */
if (loop_def
if (loop_def
&& TREE_CODE (TREE_OPERAND (node, 0)) == VAR_DECL
&& have_induction_variable
(loop_def->outer_loop,
......@@ -362,7 +362,7 @@ build_def_use (exp, du_type)
break;
}
}
for (i = 0;
i < du_idx
&& strcmp (IDENTIFIER_POINTER (DECL_NAME (array_ref)),
......@@ -388,7 +388,7 @@ build_def_use (exp, du_type)
case DECL_STMT:
node = TREE_CHAIN (node);
break;
case EXPR_STMT:
if (TREE_CODE (TREE_OPERAND (node, 0)) == MODIFY_EXPR)
build_def_use (TREE_OPERAND (node, 0), def);
......@@ -514,7 +514,7 @@ find_induction_variable (init_node, cond_node, incr_node, loop_def)
ind_ptr->low_bound = get_low_bound (init_node, ind_ptr->variable);
if (TREE_CODE (TREE_OPERAND (cond_node, 0)) == VAR_DECL
&& IDENTIFIER_POINTER (DECL_NAME (TREE_OPERAND (cond_node, 0)))
&& IDENTIFIER_POINTER (DECL_NAME (TREE_OPERAND (cond_node, 0)))
== ind_ptr->variable)
{
if (TREE_CODE (TREE_OPERAND (cond_node, 1)) == INTEGER_CST)
......@@ -732,7 +732,7 @@ check_node_dependence (du)
ck_loop_ptr, j);
/* ?? Add other tests: single variable exact test, banerjee */
}
ck_loop_ptr = ck_loop_ptr->next_nest;
}
......@@ -752,8 +752,8 @@ check_node_dependence (du)
dep_ptr->source = use_ptr->expression;
dep_ptr->destination = def_ptr->expression;
dep_ptr->next = 0;
if (def_ptr < use_ptr && use_ptr->type == use)
if (def_ptr < use_ptr && use_ptr->type == use)
dep_ptr->dependence = dt_flow;
else if (def_ptr > use_ptr && use_ptr->type == use)
dep_ptr->dependence = dt_anti;
......@@ -832,7 +832,7 @@ get_coefficients (du, coefficients)
coefficients[i].variable = 0;
coefficients[i].next = 0;
}
for (array_ref = du->expression;
TREE_CODE (array_ref) == ARRAY_REF;
array_ref = TREE_OPERAND (array_ref, 0))
......@@ -951,7 +951,7 @@ normalize_coefficients (coefficients, loop_ptr, count)
for (i = 1; i <= count; i++)
{
for (ck_loop_ptr = loop_ptr; ck_loop_ptr;
for (ck_loop_ptr = loop_ptr; ck_loop_ptr;
ck_loop_ptr = ck_loop_ptr->next_nest)
for (ind_ptr = ck_loop_ptr->ind; ind_ptr; ind_ptr = ind_ptr->next)
{
......@@ -1014,7 +1014,7 @@ classify_dependence (icoefficients, ocoefficients, complexity, separability,
}
}
}
for (idx = 1; idx <= count; idx++)
{
if (iiv_used[idx] == 0 && oiv_used[idx] == 0)
......@@ -1178,7 +1178,7 @@ gcd_test (icoefficients, ocoefficients, direction, distance, loop_ptr, sub)
}
/* ?? gcd does not yield direction and distance. Wolfe's direction
vector hierarchy can be used to give this. */
}
}
/* Find the gcd of X and Y using Euclid's algorithm */
......@@ -1213,7 +1213,7 @@ find_gcd (x, y)
}
/* Merge SUBSCRIPT_COUNT DIRECTIONs and DISTANCEs for LOOP_COUNT loops.
We use a predefined array to handle the direction merge.
We use a predefined array to handle the direction merge.
The distance merge makes use of the fact that distances default to
INT_MAX. Distances are '&' together. Watch out for a negative distance.
*/
......@@ -1228,7 +1228,7 @@ merge_dependencies (direction, distance, loop_count, subscript_count)
int i, j;
int sign;
static const enum direction_type direction_merge [8][8] =
static const enum direction_type direction_merge [8][8] =
{{lt, le, le, star, star, lt, independent, lt},
{le, le, le, star, star, le, independent, le},
{le, le, eq, ge, ge, eq, independent, eq},
......@@ -1238,7 +1238,7 @@ merge_dependencies (direction, distance, loop_count, subscript_count)
{independent, independent, independent, independent, independent},
{independent, independent, independent}
};
for (i = 1; i <= loop_count; i++)
{
distance[i][0] = INT_MAX;
......@@ -1314,7 +1314,7 @@ dump_one_node (du, seen)
for (array_ref = du_ptr->expression;
TREE_CODE (array_ref) == ARRAY_REF;
array_ref = TREE_OPERAND (array_ref, 0))
{
{
printf ("[");
dump_array_ref (TREE_OPERAND (array_ref, 1));
printf ("]");
......@@ -1395,7 +1395,7 @@ search_dependence (node)
return dep_idx + 1;
}
}
return 0;
}
......@@ -1418,7 +1418,7 @@ remember_dest_for_dependence (node)
#define MEM_DEPENDENCY(RTX) XCWINT (RTX, 2, MEM)
#endif
/* Return 1 along with the dependence DIRECTION and DISTANCE if there is a
/* Return 1 along with the dependence DIRECTION and DISTANCE if there is a
dependence from dest_rtx to src_rtx. */
int
......
gcc/doloop.c
......@@ -263,7 +263,7 @@ doloop_valid_p (loop, jump_insn)
|| ! onlyjump_p (jump_insn))
{
if (loop_dump_stream)
fprintf (loop_dump_stream,
fprintf (loop_dump_stream,
"Doloop: Invalid jump at loop end.\n");
return 0;
}
......@@ -801,7 +801,7 @@ doloop_optimize (loop)
&increment, &mode))
{
if (loop_dump_stream)
fprintf (loop_dump_stream,
fprintf (loop_dump_stream,
"Doloop: Cannot precondition loop.\n");
return 0;
}
......
gcc/dominance.c
/* Calculate (post)dominators in slightly super-linear time.
Copyright (C) 2000 Free Software Foundation, Inc.
Contributed by Michael Matz (matz@ifh.de).
This file is part of GCC.
GCC is free software; you can redistribute it and/or modify it
under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 2, or (at your option)
......@@ -119,17 +119,19 @@ static void idoms_to_doms PARAMS ((struct dom_info *,
/* Helper macro for allocating and initializing an array,
for aesthetic reasons. */
#define init_ar(var, type, num, content) \
do { \
unsigned int i = 1; /* Catch content == i. */ \
if (! (content)) \
(var) = (type *) xcalloc ((num), sizeof (type)); \
else \
{ \
(var) = (type *) xmalloc ((num) * sizeof (type)); \
for (i = 0; i < num; i++) \
(var)[i] = (content); \
} \
} while (0)
do \
{ \
unsigned int i = 1; /* Catch content == i. */ \
if (! (content)) \
(var) = (type *) xcalloc ((num), sizeof (type)); \
else \
{ \
(var) = (type *) xmalloc ((num) * sizeof (type)); \
for (i = 0; i < num; i++) \
(var)[i] = (content); \
} \
} \
while (0)
/* Allocate all needed memory in a pessimistic fashion (so we round up).
This initialises the contents of DI, which already must be allocated. */
......
gcc/doschk.c
......@@ -71,13 +71,13 @@ char *path;
char *last_slash = strrchr (path, '/');
char *cp, *dp;
int dots_seen, chars_seen;
if (last_slash+1 == null)
{
* --null = '\0';
last_slash = strrchr (path, '/');
}
if (!last_slash)
{
last_slash = first-1;
......@@ -239,7 +239,7 @@ display_problems ()
{
ENT **elist, *ent;
int ecount, i, first, first_err;
for (ecount=0, ent=eroot; ent; ent=ent->next, ecount++);
elist = (ENT **)malloc (sizeof (ENT *) * ecount);
for (ecount=0, ent=eroot; ent; ent=ent->next, ecount++)
......
gcc/dwarf2asm.c
......@@ -60,7 +60,7 @@ dw2_assemble_integer (size, x)
else
assemble_integer (x, size, BITS_PER_UNIT, 1);
}
/* Output an immediate constant in a given size. */
......@@ -316,7 +316,7 @@ size_of_sleb128 (value)
}
/* Given an encoding, return the number of bytes the format occupies.
This is only defined for fixed-size encodings, and so does not
This is only defined for fixed-size encodings, and so does not
include leb128. */
int
......@@ -845,7 +845,7 @@ dw2_asm_output_encoded_addr_rtx VPARAMS ((int encoding,
{
restart:
/* Allow the target first crack at emitting this. Some of the
special relocations require special directives instead of
special relocations require special directives instead of
just ".4byte" or whatever. */
#ifdef ASM_MAYBE_OUTPUT_ENCODED_ADDR_RTX
ASM_MAYBE_OUTPUT_ENCODED_ADDR_RTX (asm_out_file, encoding, size,
......@@ -883,7 +883,7 @@ dw2_asm_output_encoded_addr_rtx VPARAMS ((int encoding,
break;
default:
/* Other encodings should have been handled by
/* Other encodings should have been handled by
ASM_MAYBE_OUTPUT_ENCODED_ADDR_RTX. */
abort ();
}
......
gcc/dwarf2out.c
......@@ -344,15 +344,17 @@ static void def_cfa_1 PARAMS ((const char *,
#ifdef SET_ASM_OP
#ifndef ASM_OUTPUT_DEFINE_LABEL_DIFFERENCE_SYMBOL
#define ASM_OUTPUT_DEFINE_LABEL_DIFFERENCE_SYMBOL(FILE, SY, HI, LO) \
do { \
fprintf (FILE, "%s", SET_ASM_OP); \
assemble_name (FILE, SY); \
fputc (',', FILE); \
assemble_name (FILE, HI); \
fputc ('-', FILE); \
assemble_name (FILE, LO); \
} while (0)
#define ASM_OUTPUT_DEFINE_LABEL_DIFFERENCE_SYMBOL(FILE, SY, HI, LO) \
do \
{ \
fprintf (FILE, "%s", SET_ASM_OP); \
assemble_name (FILE, SY); \
fputc (',', FILE); \
assemble_name (FILE, HI); \
fputc ('-', FILE); \
assemble_name (FILE, LO); \
} \
while (0)
#endif
#endif
......
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