OpenE2K
/
gcc
2
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

basic-block.h: Fix comment formatting. 

* basic-block.h: Fix comment formatting.
	* c-common.c: Likewise.
	* c-common.h: Likewise.
	* c-lex.c: Likewise.
	* c-pretty-print.c: Likewise.
	* cfglayout.c: Likewise.
	* cfgloop.c: Likewise.
	* defaults.h: Likewise.
	* et-forest.c: Likewise.
	* explow.c: Likewise.
	* function.h: Likewise.
	* gcov.c: Likewise.
	* genattrtab.c: Likewise.
	* gengtype.c: Likewise.
	* ifcvt.c: Likewise.
	* libgcc2.c: Likewise.
	* loop.c: Likewise.
	* profile.c: Likewise.
	* ra-build.c: Likewise.
	* real.c: Likewise.
	* rtl.h: Likewise.
	* tracer.c: Likewise.
	* tree-inline.c: Likewise.
	* varasm.c: Likewise.

From-SVN: r56952
This commit is contained in:
Kazu Hirata 2002-09-08 12:47:27 +00:00 committed by Kazu Hirata
parent 2567406a17
commit 4b7e68e7d2
25 changed files with 78 additions and 51 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

27
gcc/ChangeLog
View File

@ -1,3 +1,30 @@
2002-09-08 Kazu Hirata <kazu@cs.umass.edu>
* basic-block.h: Fix comment formatting.
* c-common.c: Likewise.
* c-common.h: Likewise.
* c-lex.c: Likewise.
* c-pretty-print.c: Likewise.
* cfglayout.c: Likewise.
* cfgloop.c: Likewise.
* defaults.h: Likewise.
* et-forest.c: Likewise.
* explow.c: Likewise.
* function.h: Likewise.
* gcov.c: Likewise.
* genattrtab.c: Likewise.
* gengtype.c: Likewise.
* ifcvt.c: Likewise.
* libgcc2.c: Likewise.
* loop.c: Likewise.
* profile.c: Likewise.
* ra-build.c: Likewise.
* real.c: Likewise.
* rtl.h: Likewise.
* tracer.c: Likewise.
* tree-inline.c: Likewise.
* varasm.c: Likewise.
2002-09-08 Jan Hubicka <jh@suse.cz>
* emit-rtl.c (set_mem_attributes_minus_bitpos): Fix array_ref

2
gcc/basic-block.h
View File

@ -144,7 +144,7 @@ typedef struct edge_def {
#define EDGE_FAKE 16 /* Not a real edge (profile.c) */
#define EDGE_DFS_BACK 32 /* A backwards edge */
#define EDGE_CAN_FALLTHRU 64 /* Candidate for straight line
flow. */
flow. */
#define EDGE_COMPLEX (EDGE_ABNORMAL | EDGE_ABNORMAL_CALL | EDGE_EH)

4
gcc/c-common.c
View File

@ -291,7 +291,7 @@ int warn_write_strings;
int warn_redundant_decls;
/* Warn about testing equality of floating point numbers. */
/* Warn about testing equality of floating point numbers. */
int warn_float_equal;
@ -1121,7 +1121,7 @@ fname_decl (rid, id)
the current statement. Later this tree will be moved to the
beginning of the function and this line number will be wrong.
To avoid this problem set the lineno to 0 here; that prevents
it from appearing in the RTL. */
it from appearing in the RTL. */
int saved_lineno = lineno;
lineno = 0;

2
gcc/c-common.h
View File

@ -465,7 +465,7 @@ extern int warn_write_strings;
extern int warn_redundant_decls;
/* Warn about testing equality of floating point numbers. */
/* Warn about testing equality of floating point numbers. */
extern int warn_float_equal;

2
gcc/c-lex.c
View File

@ -1016,7 +1016,7 @@ lex_string (str, len, wide)
#ifdef MULTIBYTE_CHARS
else if (char_len > 1)
{
/* We're dealing with a multibyte character. */
/* We're dealing with a multibyte character. */
for ( ; char_len >0; --char_len)
{
*q++ = *(p - char_len);

4
gcc/c-pretty-print.c
View File

@ -463,7 +463,7 @@ pp_c_integer_literal (ppi, i)
}
}
/* Print out a REAL value. */
/* Print out a REAL value. */
static inline void
pp_c_real_literal (ppi, r)
c_pretty_printer ppi;
@ -556,7 +556,7 @@ pp_c_primary_expression (ppi, e)
break;
default:
/* Make sure this call won't cause any infinite loop. */
/* Make sure this call won't cause any infinite loop. */
pp_c_left_paren (ppi);
pp_c_expression (ppi, e);
pp_c_right_paren (ppi);

2
gcc/cfglayout.c
View File

@ -342,7 +342,7 @@ scope_to_insns_finalize ()
this_block = INSN_SCOPE (insn);
/* For sequences compute scope resulting from merging all scopes
of instructions nested inside. */
of instructions nested inside. */
if (GET_CODE (PATTERN (insn)) == SEQUENCE)
{
int i;

2
gcc/cfgloop.c
View File

@ -617,7 +617,7 @@ make_forwarder_block (bb, redirect_latch, redirect_nonlatch, except,
HEADER_BLOCK (dummy) = 0;
HEADER_BLOCK (bb) = 1;
/* Redirect back edges we want to keep. */
/* Redirect back edges we want to keep. */
for (e = dummy->pred; e; e = next_e)
{
next_e = e->pred_next;

4
gcc/defaults.h
View File

@ -437,7 +437,7 @@ do { fputs (integer_asm_op (POINTER_SIZE / UNITS_PER_WORD, TRUE), FILE); \
/* By default, the vtable entries are void pointers, the so the alignment
is the same as pointer alignment. The value of this macro specifies
the alignment of the vtable entry in bits. It should be defined only
when special alignment is necessary. */
when special alignment is necessary. */
#ifndef TARGET_VTABLE_ENTRY_ALIGN
#define TARGET_VTABLE_ENTRY_ALIGN POINTER_SIZE
#endif
@ -576,7 +576,7 @@ You Lose! You must define PREFERRED_DEBUGGING_TYPE!
#endif
/* Determine whether __cxa_atexit, rather than atexit, is used to
register C++ destructors for local statics and global objects. */
register C++ destructors for local statics and global objects. */
#ifndef DEFAULT_USE_CXA_ATEXIT
#define DEFAULT_USE_CXA_ATEXIT 0
#endif

2
gcc/et-forest.c
View File

@ -664,7 +664,7 @@ et_forest_enumerate_sons (forest, node, array)
/* Parent is the rightmost node of the left successor.
Look for all occurences having no right succesor
and lookup the sons. */
and lookup the sons. */
while (occ != stop)
{
splay (occ);

2
gcc/explow.c
View File

@ -1087,7 +1087,7 @@ emit_stack_restore (save_level, sa, after)
sa = validize_mem (sa);
/* These clobbers prevent the scheduler from moving
references to variable arrays below the code
that deletes (pops) the arrays. */
that deletes (pops) the arrays. */
emit_insn (gen_rtx_CLOBBER (VOIDmode,
gen_rtx_MEM (BLKmode,
gen_rtx_SCRATCH (VOIDmode))));

2
gcc/function.h
View File

@ -441,7 +441,7 @@ struct function GTY(())
calls (if any) are sibling calls. Such functions do not have to
have EH tables generated, as they cannot throw. A call to such a
function, however, should be treated as throwing if any of its callees
can throw. */
can throw. */
unsigned int all_throwers_are_sibcalls : 1;
/* Nonzero if instrumentation calls for function entry and exit should be

30
gcc/gcov.c
View File

@ -159,12 +159,12 @@ struct bb_info_list
struct bb_info_list *next;
};
/* Used to hold information about each line. */
/* Used to hold information about each line. */
struct line_info
{
gcov_type count; /* execution count */
struct arcdata *branches; /* list of branch probabilities for line. */
unsigned exists : 1; /* has code associated with it. */
struct arcdata *branches; /* list of branch probabilities for line. */
unsigned exists : 1; /* has code associated with it. */
};
struct coverage
@ -186,7 +186,7 @@ struct coverage
static struct bb_info_list *bb_graph_list = 0;
/* Modification time of data files. */
/* Modification time of data files. */
static time_t bb_file_time;
@ -477,7 +477,7 @@ open_files ()
strcat (name, cptr);
}
/* Remove the extension. */
/* Remove the extension. */
cptr = strrchr (name, '.');
if (cptr)
*cptr = 0;
@ -1225,7 +1225,7 @@ function_summary (function, title)
to each output name (except when the current source file is the
input file, so you don't get a double concatenation). The two
components are separated by '##'. Also '.' filename components are
removed and '..' components are renamed to '^'. */
removed and '..' components are renamed to '^'. */
static char *
make_gcov_file_name (src_name)
@ -1244,7 +1244,7 @@ make_gcov_file_name (src_name)
strcat (name, "##");
}
/* Generate the source filename part. */
/* Generate the source filename part. */
cptr = preserve_paths ? NULL : strrchr (src_name, '/');
cptr = cptr ? cptr + 1 : src_name;
strcat (name, cptr);
@ -1303,12 +1303,12 @@ init_line_info (line_info, total, maxlineno)
struct bb_info *block_ptr = NULL; /* current block ptr */
struct coverage function;
struct coverage *func_ptr = NULL;
struct bb_info_list *current_graph = NULL; /* Graph for current function. */
int is_this_file = 0; /* We're scanning a block from the desired file. */
struct bb_info_list *current_graph = NULL; /* Graph for current function. */
int is_this_file = 0; /* We're scanning a block from the desired file. */
char *ptr = bb_data;
long count;
long line_num;
struct line_info *line_ptr = 0; /* line info ptr. */
struct line_info *line_ptr = 0; /* line info ptr. */
memset (&function, 0, sizeof (function));
if (output_function_summary)
@ -1431,7 +1431,7 @@ init_line_info (line_info, total, maxlineno)
total->lines_executed++;
}
/* Total and reverse the branch information. */
/* Total and reverse the branch information. */
for (a_ptr = line_ptr->branches, prev = NULL; a_ptr; a_ptr = next)
{
next = a_ptr->next;
@ -1457,9 +1457,9 @@ output_line_info (gcov_file, line_info, total, maxlineno)
{
FILE *source_file;
long line_num; /* current line number */
const struct line_info *line_ptr; /* current line info ptr. */
char string[STRING_SIZE]; /* line buffer. */
char const *retval = ""; /* status of source file reading. */
const struct line_info *line_ptr; /* current line info ptr. */
char string[STRING_SIZE]; /* line buffer. */
char const *retval = ""; /* status of source file reading. */
fprintf (gcov_file, "%9s:%5d:Source:%s\n", "-", 0, total->name);
fprintf (gcov_file, "%9s:%5d:Object:%s\n", "-", 0, bb_file_name);
@ -1619,7 +1619,7 @@ output_data (s_ptr)
free (gcov_file_name);
}
/* Free data. */
/* Free data. */
for (line_num = 1; line_num != s_ptr->maxlineno; line_num++)
{
struct arcdata *branch, *next;

2
gcc/genattrtab.c
View File

@ -6246,7 +6246,7 @@ from the machine description file `md'. */\n\n");
/* Write out information about function units. */
write_function_unit_info ();
/* Output code for pipeline hazards recognition based on DFA
(deterministic finite state automata. */
(deterministic finite state automata. */
write_automata ();
}

2
gcc/gengtype.c
View File

@ -1081,7 +1081,7 @@ write_gc_structure_fields (of, s, val, prev_val, opts, indent, line, bitmap,
break;
}
}
/* Fall through... */
/* Fall through... */
case TYPE_STRUCT:
case TYPE_UNION:
{

2
gcc/ifcvt.c
View File

@ -358,7 +358,7 @@ cond_exec_process_if_block (ce_info, do_multiple_p)
rtx then_end; /* last insn + 1 in THEN block */
rtx else_start = NULL_RTX; /* first insn in ELSE block or NULL */
rtx else_end = NULL_RTX; /* last insn + 1 in ELSE block */
int max; /* max # of insns to convert. */
int max; /* max # of insns to convert. */
int then_mod_ok; /* whether conditional mods are ok in THEN */
rtx true_expr; /* test for else block insns */
rtx false_expr; /* test for then block insns */

6
gcc/libgcc2.c
View File

@ -1271,7 +1271,7 @@ struct bb
#include <errno.h>
#endif
/* Chain of per-object file bb structures. */
/* Chain of per-object file bb structures. */
static struct bb *bb_head;
/* Dump the coverage counts. We merge with existing counts when
@ -1295,7 +1295,7 @@ __bb_exit_func (void)
s_flock.l_type = F_WRLCK;
s_flock.l_whence = SEEK_SET;
s_flock.l_start = 0;
s_flock.l_len = 0; /* Until EOF. */
s_flock.l_len = 0; /* Until EOF. */
s_flock.l_pid = getpid ();
#endif
@ -1432,7 +1432,7 @@ __bb_exit_func (void)
merged_max = object_max;
merged_arcs += ptr->ncounts;
/* Write out the data. */
/* Write out the data. */
if (/* magic */
__write_long (-123, da_file, 4)
/* number of functions in object file. */

2
gcc/loop.c
View File

@ -4279,7 +4279,7 @@ for_each_insn_in_loop (loop, fncall)
if (prev_nonnote_insn (loop->scan_start) != prev_nonnote_insn (loop->start))
maybe_multiple = back_branch_in_range_p (loop, loop->scan_start);
/* Scan through loop and update NOT_EVERY_ITERATION and MAYBE_MULTIPLE. */
/* Scan through loop and update NOT_EVERY_ITERATION and MAYBE_MULTIPLE. */
for (p = next_insn_in_loop (loop, loop->scan_start);
p != NULL_RTX;
p = next_insn_in_loop (loop, p))

6
gcc/profile.c
View File

@ -91,18 +91,18 @@ Software Foundation, 59 Temple Place - Suite 330, Boston, MA
struct edge_info {
unsigned int count_valid : 1;
/* Is on the spanning tree. */
/* Is on the spanning tree. */
unsigned int on_tree : 1;
/* Pretend this edge does not exist (it is abnormal and we've
inserted a fake to compensate). */
inserted a fake to compensate). */
unsigned int ignore : 1;
};
struct bb_info {
unsigned int count_valid : 1;
/* Number of successor and predecessor edges. */
/* Number of successor and predecessor edges. */
gcov_type succ_count;
gcov_type pred_count;
};

10
gcc/ra-build.c
View File

@ -275,7 +275,7 @@ copy_insn_p (insn, source, target)
s_regno = (unsigned) REGNO (GET_CODE (s) == SUBREG ? SUBREG_REG (s) : s);
d_regno = (unsigned) REGNO (GET_CODE (d) == SUBREG ? SUBREG_REG (d) : d);
/* Copies between hardregs are useless for us, as not coalesable anyway. */
/* Copies between hardregs are useless for us, as not coalesable anyway. */
if ((s_regno < FIRST_PSEUDO_REGISTER
&& d_regno < FIRST_PSEUDO_REGISTER)
|| s_regno >= max_normal_pseudo
@ -563,7 +563,7 @@ remember_move (insn)
SET_BIT (move_handled, INSN_UID (insn));
if (copy_insn_p (insn, &s, &d))
{
/* Some sanity test for the copy insn. */
/* Some sanity test for the copy insn. */
struct df_link *slink = DF_INSN_USES (df, insn);
struct df_link *link = DF_INSN_DEFS (df, insn);
if (!link || !link->ref || !slink || !slink->ref)
@ -844,7 +844,7 @@ live_out_1 (df, use, insn)
else
{
/* If this insn doesn't completely define the USE, increment also
it's spanned deaths count (if this insn contains a death). */
it's spanned deaths count (if this insn contains a death). */
if (uid >= death_insns_max_uid)
abort ();
if (TEST_BIT (insns_with_deaths, uid))
@ -876,7 +876,7 @@ live_out (df, use, insn)
&& (use->undefined & ~visit_trace[uid].undefined) == 0)
{
union_web_parts (visit_trace[uid].wp, use->wp);
/* Don't search any further, as we already were here with this regno. */
/* Don't search any further, as we already were here with this regno. */
return 0;
}
else
@ -2813,7 +2813,7 @@ moves_to_webs (df)
if (m->source_web && m->target_web
/* If the usable_regs don't intersect we can't coalesce the two
webs anyway, as this is no simple copy insn (it might even
need an intermediate stack temp to execute this "copy" insn). */
need an intermediate stack temp to execute this "copy" insn). */
&& hard_regs_intersect_p (&m->source_web->usable_regs,
&m->target_web->usable_regs))
{

6
gcc/real.c
View File

@ -129,14 +129,14 @@ unknown arithmetic type
#define REAL_WORDS_BIG_ENDIAN FLOAT_WORDS_BIG_ENDIAN
/* Make sure that the endianness is correct for IBM and DEC. */
/* Make sure that the endianness is correct for IBM and DEC. */
#if defined(DEC)
#undef LARGEST_EXPONENT_IS_NORMAL
#define LARGEST_EXPONENT_IS_NORMAL(x) 1
#undef REAL_WORDS_BIG_ENDIAN
/* Strangely enough, DEC float most closely resembles big endian IEEE */
#define REAL_WORDS_BIG_ENDIAN 1
/* ... but the halfwords are reversed from IEEE big endian. */
/* ... but the halfwords are reversed from IEEE big endian. */
#ifndef VAX_HALFWORD_ORDER
#define VAX_HALFWORD_ORDER 1
#endif
@ -3942,7 +3942,7 @@ toieee (x, y, fmt)
}
/* Shift denormal double extended Intel format significand down
one bit. */
one bit. */
if (fmt->precision == 64 && x[E] == 0 && ! REAL_WORDS_BIG_ENDIAN)
eshdn1 (x);

2
gcc/rtl.h
View File

@ -860,7 +860,7 @@ enum insn_note
NOTE_EXPECTED_VALUE; stored as (eq (reg) (const_int)). */
NOTE_INSN_EXPECTED_VALUE,
/* Record a prediction. Uses NOTE_PREDICTION. */
/* Record a prediction. Uses NOTE_PREDICTION. */
NOTE_INSN_PREDICTION,
NOTE_INSN_MAX

2
gcc/tracer.c
View File

@ -65,7 +65,7 @@ static int branch_ratio_cutoff;
#define seen(bb) (RBI (bb)->visited || RBI (bb)->next)
/* Return true if we should ignore the basic block for purposes of tracing. */
/* Return true if we should ignore the basic block for purposes of tracing. */
static bool
ignore_bb_p (bb)
basic_block bb;

2
gcc/tree-inline.c
View File

@ -1737,7 +1737,7 @@ remap_save_expr (tp, st_, fn, walk_subtrees)
#ifdef INLINER_FOR_JAVA
/* Add STMT to EXISTING if possible, otherwise create a new
COMPOUND_EXPR and add STMT to it. */
COMPOUND_EXPR and add STMT to it. */
static tree
add_stmt_to_compound (existing, type, stmt)

2
gcc/varasm.c
View File

@ -2452,7 +2452,7 @@ compare_constant (t1, t2)
l1 && l2;
l1 = TREE_CHAIN (l1), l2 = TREE_CHAIN (l2))
{
/* Check that each value is the same... */
/* Check that each value is the same... */
if (! compare_constant (TREE_VALUE (l1), TREE_VALUE (l2)))
return 0;
/* ... and that they apply to the same fields! */