basic-block.h: Fix comment formatting.
* basic-block.h: Fix comment formatting. * calls.c: Likewise. * combine.c: Likewise. * convert.c: Likewise. * gcov.c: Likewise. * haifa-sched.c: Likewise. * libgcc2.c: Likewise. * loop.c: Likewise. * profile.c: Likewise. * system.h: Likewise. From-SVN: r61478
This commit is contained in:
Kazu Hirata
Kazu Hirata
parent
634661fe5a
commit
32dd366d5e
@ -1,3 +1,16 @@
|
||||
2003-01-18 Kazu Hirata <kazu@cs.umass.edu>
|
||||
|
||||
* basic-block.h: Fix comment formatting.
|
||||
* calls.c: Likewise.
|
||||
* combine.c: Likewise.
|
||||
* convert.c: Likewise.
|
||||
* gcov.c: Likewise.
|
||||
* haifa-sched.c: Likewise.
|
||||
* libgcc2.c: Likewise.
|
||||
* loop.c: Likewise.
|
||||
* profile.c: Likewise.
|
||||
* system.h: Likewise.
|
||||
|
||||
2003-01-18 Roger Sayle <roger@eyesopen.com>
|
||||
|
||||
* config/pa/pa.md (muldi3): Avoid invalid sharing of SUBREG RTXs.
|
||||
|
||||
@ -117,7 +117,7 @@ do { \
|
||||
64bit. Although a counter cannot be negative, we use a signed
|
||||
type, because erroneous negative counts can be generated when the
|
||||
flow graph is manipulated by various optimizations. A signed type
|
||||
makes those easy to detect. */
|
||||
makes those easy to detect. */
|
||||
typedef HOST_WIDEST_INT gcov_type;
|
||||
|
||||
/* Control flow edge information. */
|
||||
|
||||
@ -1770,7 +1770,7 @@ load_register_parameters (args, num_actuals, call_fusage, flags,
|
||||
|
||||
/* When a parameter is a block, and perhaps in other cases, it is
|
||||
possible that it did a load from an argument slot that was
|
||||
already clobbered. */
|
||||
already clobbered. */
|
||||
if (is_sibcall
|
||||
&& check_sibcall_argument_overlap (before_arg, &args[i], 0))
|
||||
*sibcall_failure = 1;
|
||||
|
||||
@ -4350,7 +4350,7 @@ combine_simplify_rtx (x, op0_mode, last, in_dest)
|
||||
}
|
||||
|
||||
/* Canonicalize (minus (neg A) (mult B C)) to
|
||||
(minus (mult (neg B) C) A). */
|
||||
(minus (mult (neg B) C) A). */
|
||||
if (GET_CODE (XEXP (x, 1)) == MULT
|
||||
&& GET_CODE (XEXP (x, 0)) == NEG)
|
||||
{
|
||||
|
||||
@ -210,7 +210,7 @@ convert_to_real (type, expr)
|
||||
|
||||
/* ??? Fortran frontend does not initialize built_in_decls.
|
||||
For some reason creating the decl using builtin_function does not
|
||||
work as it should. */
|
||||
work as it should. */
|
||||
if (built_in_decls [fcode])
|
||||
{
|
||||
arglist = build_tree_list (NULL_TREE, fold (convert_to_real (newtype, arg0)));
|
||||
|
||||
28
gcc/gcov.c
28
gcc/gcov.c
@ -74,7 +74,7 @@ struct block_info;
|
||||
|
||||
typedef struct arc_info
|
||||
{
|
||||
/* source and destination blocks. */
|
||||
/* source and destination blocks. */
|
||||
struct block_info *src;
|
||||
struct block_info *dst;
|
||||
|
||||
@ -106,11 +106,11 @@ typedef struct block_info
|
||||
arc_t *succ;
|
||||
arc_t *pred;
|
||||
|
||||
/* Number of unprocessed exit and entry arcs. */
|
||||
/* Number of unprocessed exit and entry arcs. */
|
||||
gcov_type num_succ;
|
||||
gcov_type num_pred;
|
||||
|
||||
/* Block execution count. */
|
||||
/* Block execution count. */
|
||||
gcov_type count;
|
||||
unsigned count_valid : 1;
|
||||
unsigned valid_chain : 1;
|
||||
@ -122,7 +122,7 @@ typedef struct block_info
|
||||
unsigned *encoding;
|
||||
unsigned num_encodings;
|
||||
|
||||
/* Temporary chain for solving graph. */
|
||||
/* Temporary chain for solving graph. */
|
||||
struct block_info *chain;
|
||||
|
||||
} block_t;
|
||||
@ -171,7 +171,7 @@ typedef struct line_info
|
||||
{
|
||||
gcov_type count; /* execution count */
|
||||
arc_t *branches; /* branches from blocks that end on this
|
||||
line. */
|
||||
line. */
|
||||
unsigned exists : 1;
|
||||
} line_t;
|
||||
|
||||
@ -184,7 +184,7 @@ typedef struct source_info
|
||||
char *name;
|
||||
unsigned index;
|
||||
|
||||
/* Array of line information. */
|
||||
/* Array of line information. */
|
||||
line_t *lines;
|
||||
unsigned num_lines;
|
||||
|
||||
@ -202,7 +202,7 @@ static function_t *functions;
|
||||
|
||||
static source_t *sources;
|
||||
|
||||
/* Modification time of graph file. */
|
||||
/* Modification time of graph file. */
|
||||
|
||||
static time_t bbg_file_time;
|
||||
|
||||
@ -245,7 +245,7 @@ static char *object_directory = 0;
|
||||
static int flag_preserve_paths = 0;
|
||||
|
||||
/* Output the number of times a branch was taken as opposed to the percentage
|
||||
of times it was taken. */
|
||||
of times it was taken. */
|
||||
|
||||
static int flag_counts = 0;
|
||||
|
||||
@ -977,8 +977,8 @@ solve_flow_graph (fn)
|
||||
unsigned ix;
|
||||
arc_t *arc;
|
||||
gcov_type *count_ptr = fn->counts;
|
||||
block_t *valid_blocks = NULL; /* valid, but unpropagated blocks. */
|
||||
block_t *invalid_blocks = NULL; /* invalid, but inferable blocks. */
|
||||
block_t *valid_blocks = NULL; /* valid, but unpropagated blocks. */
|
||||
block_t *invalid_blocks = NULL; /* invalid, but inferable blocks. */
|
||||
|
||||
if (fn->num_blocks < 2)
|
||||
fnotice (stderr, "%s:`%s' lacks entry and/or exit blocks\n",
|
||||
@ -1027,7 +1027,7 @@ solve_flow_graph (fn)
|
||||
/* Sort the successor arcs into ascending dst order. profile.c
|
||||
normally produces arcs in the right order, but sometimes with
|
||||
one or two out of order. We're not using a particularly
|
||||
smart sort. */
|
||||
smart sort. */
|
||||
if (out_of_order)
|
||||
{
|
||||
arc_t *start = fn->blocks[ix].succ;
|
||||
@ -1380,7 +1380,7 @@ add_line_counts (coverage, fn)
|
||||
line_t *line = NULL; /* this is propagated from one iteration to the
|
||||
next. */
|
||||
|
||||
/* Scan each basic block. */
|
||||
/* Scan each basic block. */
|
||||
for (ix = 0; ix != fn->num_blocks; ix++)
|
||||
{
|
||||
const block_t *block = &fn->blocks[ix];
|
||||
@ -1434,7 +1434,7 @@ add_line_counts (coverage, fn)
|
||||
fnotice (stderr, "%s:no lines for `%s'\n", bbg_file_name, fn->name);
|
||||
}
|
||||
|
||||
/* Accumulate the line counts of a file. */
|
||||
/* Accumulate the line counts of a file. */
|
||||
|
||||
static void
|
||||
accumulate_line_counts (src)
|
||||
@ -1447,7 +1447,7 @@ accumulate_line_counts (src)
|
||||
{
|
||||
arc_t *arc, *arc_p, *arc_n;
|
||||
|
||||
/* Total and reverse the branch information. */
|
||||
/* Total and reverse the branch information. */
|
||||
for (arc = line->branches, arc_p = NULL; arc; arc_p = arc, arc = arc_n)
|
||||
{
|
||||
arc_n = arc->line_next;
|
||||
|
||||
@ -1543,7 +1543,7 @@ rm_other_notes (head, tail)
|
||||
|
||||
/* This function looks for a new register being defined.
|
||||
If the destination register is already used by the source,
|
||||
a new register is not needed. */
|
||||
a new register is not needed. */
|
||||
|
||||
static int
|
||||
find_set_reg_weight (x)
|
||||
@ -2263,7 +2263,7 @@ schedule_block (b, rgn_n_insns)
|
||||
|
||||
/* Sort the ready list based on priority. This must be
|
||||
redone here, as schedule_insn may have readied additional
|
||||
insns that will not be sorted correctly. */
|
||||
insns that will not be sorted correctly. */
|
||||
if (ready.n_ready > 0)
|
||||
ready_sort (&ready);
|
||||
|
||||
|
||||
@ -1279,7 +1279,7 @@ gcov_version_mismatch (struct gcov_info *ptr, unsigned version)
|
||||
program's checksum to make sure we only accumulate whole program
|
||||
statistics to the correct summary. An object file might be embedded
|
||||
in two separate programs, and we must keep the two program
|
||||
summaries separate. */
|
||||
summaries separate. */
|
||||
|
||||
static void
|
||||
gcov_exit (void)
|
||||
@ -1503,7 +1503,7 @@ gcov_exit (void)
|
||||
count_ptr = ptr->arc_counts;
|
||||
for (ix = ptr->n_functions, fn_info = ptr->functions; ix--; fn_info++)
|
||||
{
|
||||
/* Announce function. */
|
||||
/* Announce function. */
|
||||
if (gcov_write_unsigned (da_file, GCOV_TAG_FUNCTION)
|
||||
|| !(base = gcov_reserve_length (da_file))
|
||||
/* function name */
|
||||
@ -1533,7 +1533,7 @@ gcov_exit (void)
|
||||
goto write_error;
|
||||
}
|
||||
|
||||
/* Object file summary. */
|
||||
/* Object file summary. */
|
||||
if (gcov_write_summary (da_file, GCOV_TAG_OBJECT_SUMMARY, &object))
|
||||
goto write_error;
|
||||
|
||||
|
||||
@ -3267,7 +3267,7 @@ loop_invariant_p (loop, x)
|
||||
|
||||
/* Out-of-range regs can occur when we are called from unrolling.
|
||||
These have always been created by the unroller and are set in
|
||||
the loop, hence are never invariant. */
|
||||
the loop, hence are never invariant. */
|
||||
|
||||
if (REGNO (x) >= (unsigned) regs->num)
|
||||
return 0;
|
||||
|
||||
@ -1674,7 +1674,7 @@ create_profiler ()
|
||||
/* Build structure. */
|
||||
assemble_variable (structure, 0, 0, 0);
|
||||
|
||||
/* Build the constructor function to invoke __gcov_init. */
|
||||
/* Build the constructor function to invoke __gcov_init. */
|
||||
ctor_name = concat (IDENTIFIER_POINTER (get_file_function_name ('I')),
|
||||
"_GCOV", NULL);
|
||||
ctor = build_decl (FUNCTION_DECL, get_identifier (ctor_name),
|
||||
|
||||
@ -569,7 +569,7 @@ typedef char _Bool;
|
||||
|
||||
#if defined(FLEX_SCANNER) || defined(YYBISON)
|
||||
/* Flex and bison use malloc and realloc. Yuk. Note that this means
|
||||
really_call_* cannot be used in a .l or .y file. */
|
||||
really_call_* cannot be used in a .l or .y file. */
|
||||
#define malloc xmalloc
|
||||
#define realloc xrealloc
|
||||
#endif
|
||||
|
||||
Loading…
Reference in New Issue
Block a user