* basic-block.h: Fix comment formatting.
* bt-load.c: Likewise.
* builtins.c: Likewise.
* c-common.c: Likewise.
* c-common.h: Likewise.
* c-format.c: Likewise.
* coverage.c: Likewise.
* cpplib.h: Likewise.
* cpppch.c: Likewise.
* dbxout.c: Likewise.
* diagnostic.c: Likewise.
* dwarf2out.c: Likewise.
* expr.c: Likewise.
* fold-const.c: Likewise.
* function.c: Likewise.
* gcc.c: Likewise.
* gcov-io.c: Likewise.
* gcov-io.h: Likewise.
* gcov.c: Likewise.
* profile.c: Likewise.
* real.h: Likewise.
* sched-deps.c: Likewise.
From-SVN: r68369
+2003-06-23 Kazu Hirata <kazu@cs.umass.edu>
+
+ * basic-block.h: Fix comment formatting.
+ * bt-load.c: Likewise.
+ * builtins.c: Likewise.
+ * c-common.c: Likewise.
+ * c-common.h: Likewise.
+ * c-format.c: Likewise.
+ * coverage.c: Likewise.
+ * cpplib.h: Likewise.
+ * cpppch.c: Likewise.
+ * dbxout.c: Likewise.
+ * diagnostic.c: Likewise.
+ * dwarf2out.c: Likewise.
+ * expr.c: Likewise.
+ * fold-const.c: Likewise.
+ * function.c: Likewise.
+ * gcc.c: Likewise.
+ * gcov-io.c: Likewise.
+ * gcov-io.h: Likewise.
+ * gcov.c: Likewise.
+ * profile.c: Likewise.
+ * real.h: Likewise.
+ * sched-deps.c: Likewise.
+
2003-06-23 Roger Sayle <roger@eyesopen.com>
Gerald Pfeifer <pfeifer@dbai.tuwien.ac.at>
#define EDGE_COMPLEX (EDGE_ABNORMAL | EDGE_ABNORMAL_CALL | EDGE_EH)
/* Counter summary from the last set of coverage counts read by
- profile.c. */
+ profile.c. */
extern const struct gcov_ctr_summary *profile_info;
/* Declared in cfgloop.h. */
containing the def (before the def), or in a block containing
a use (after the use). If there are such other live ranges, then
other_btr_uses_before_def or other_btr_uses_after_use must be set true
- as appropriate. */
+ as appropriate. */
char other_btr_uses_before_def;
char other_btr_uses_after_use;
bitmap live_range;
return 0;
}
-/* Find and return a use of a target register within an instruction INSN. */
+/* Find and return a use of a target register within an instruction INSN. */
static rtx *
find_btr_use (rtx insn)
{
return user;
}
-/* Write the contents of S to the dump file. */
+/* Write the contents of S to the dump file. */
static void
dump_hard_reg_set (HARD_REG_SET s)
{
fprintf (rtl_dump_file, " %d", reg);
}
-/* Write the set of target regs live in block BB to the dump file. */
+/* Write the set of target regs live in block BB to the dump file. */
static void
dump_btrs_live (int bb)
{
int regno;
/* For each basic block, form the set BB_KILL - the set
- of definitions that the block kills. */
+ of definitions that the block kills. */
sbitmap_vector_zero (bb_kill, n_basic_blocks);
for (i = 0; i < n_basic_blocks; i++)
{
sbitmap reaching_defs = sbitmap_alloc (max_uid);
/* Link uses to the uses lists of all of their reaching defs.
- Count up the number of reaching defs of each use. */
+ Count up the number of reaching defs of each use. */
for (i = 0; i < n_basic_blocks; i++)
{
basic_block bb = BASIC_BLOCK (i);
if (def != NULL)
{
/* Remove all reaching defs of regno except
- for this one. */
+ for this one. */
sbitmap_difference (reaching_defs, reaching_defs,
btr_defset[def->btr - first_btr]);
SET_BIT(reaching_defs, insn_uid);
if (user->first_reaching_def != -1)
{ /* There is more than one reaching def. This is
a rare case, so just give up on this def/use
- web when it occurs. */
+ web when it occurs. */
def->has_ambiguous_use = 1;
def_array[user->first_reaching_def]
->has_ambiguous_use = 1;
Blocks at the boundary of the live range may contain other live
ranges for the same target register, so we have to be careful
to remove the target register from the live set of these blocks
- only if they do not contain other live ranges for the same register. */
+ only if they do not contain other live ranges for the same register. */
static void
clear_btr_from_live_range (btr_def def)
{
&& dominated_by_p (dom, other_def->bb, def->bb))
{
/* def->bb dominates the other def, so def and other_def could
- be combined. */
+ be combined. */
/* Merge their live ranges, and get the set of
- target registers live over the merged range. */
+ target registers live over the merged range. */
int btr;
HARD_REG_SET combined_btrs_live;
bitmap combined_live_range = BITMAP_XMALLOC ();
some REG_DEAD notes may no longer be correct. We could
be more precise about this if we looked at the combined
live range, but here I just delete any REG_DEAD notes
- in case they are no longer correct. */
+ in case they are no longer correct. */
for (user = def->uses; user != NULL; user = user->next)
remove_note (user->insn,
find_regno_note (user->insn, REG_DEAD,
Set a target register in block NEW_DEF_BB to the value
needed for this target register definition.
Replace all uses of the old target register definition by
- uses of the new definition. Delete the old definition. */
+ uses of the new definition. Delete the old definition. */
basic_block b = new_def_bb;
rtx insp = b->head;
rtx old_insn = def->insn;
new_insn = gen_move_insn (btr_rtx, src);
- /* Insert target register initialization at head of basic block. */
+ /* Insert target register initialization at head of basic block. */
def->insn = emit_insn_after (new_insn, insp);
regs_ever_live[btr] = 1;
delete_insn (old_insn);
/* Replace each use of the old target register by a use of the new target
- register. */
+ register. */
for (user = def->uses; user != NULL; user = user->next)
{
/* Some extra work here to ensure consistent modes, because
it seems that a target register REG rtx can be given a different
mode depending on the context (surely that should not be
- the case?). */
+ the case?). */
rtx replacement_rtx;
if (GET_MODE (user->use) == GET_MODE (btr_rtx)
|| GET_MODE (user->use) == VOIDmode)
Return nonzero if there may be benefit from attempting to
migrate this DEF further (i.e. we have reduced the cost below
MIN_COST, but we may be able to reduce it further).
- Return zero if no further migration is possible. */
+ Return zero if no further migration is possible. */
static int
migrate_btr_def (btr_def def, int min_cost)
{
try = get_immediate_dominator (dom, try))
{
/* Try to move the instruction that sets the target register into
- basic block TRY. */
+ basic block TRY. */
int try_freq = basic_block_freq (try);
if (rtl_dump_file)
}
/* Attempt to move instructions that set target registers earlier
- in the flowgraph, away from their corresponding uses. */
+ in the flowgraph, away from their corresponding uses. */
static void
migrate_btr_defs (enum reg_class btr_class, int allow_callee_save)
{
else
issue_rate = 1;
- /* Build the CFG for migrate_btr_defs. */
+ /* Build the CFG for migrate_btr_defs. */
#if 1
/* This may or may not be needed, depending on where we
- run this phase. */
+ run this phase. */
cleanup_cfg (optimize ? CLEANUP_EXPENSIVE : 0);
#endif
life_analysis (insns, NULL, 0);
- /* Dominator info is also needed for migrate_btr_def. */
+ /* Dominator info is also needed for migrate_btr_def. */
dom = calculate_dominance_info (CDI_DOMINATORS);
migrate_btr_defs (class,
((*targetm.branch_target_register_callee_saved)
{
tree string_arg;
- /* If optimizing for size keep fputs. */
+ /* If optimizing for size keep fputs. */
if (optimize_size)
return 0;
string_arg = TREE_VALUE (arglist);
int warn_abi = 0;
-/* Nonzero means warn about invalid uses of offsetof. */
+/* Nonzero means warn about invalid uses of offsetof. */
int warn_invalid_offsetof = 1;
extern int warn_abi;
-/* Nonzero means warn about invalid uses of offsetof. */
+/* Nonzero means warn about invalid uses of offsetof. */
extern int warn_invalid_offsetof;
/* Strip any conversions from the expression, verify it is a constant,
and store its value. If validated_p is true, abort on errors.
- Returns true on success, false otherwise. */
+ Returns true on success, false otherwise. */
bool
get_constant(tree expr, unsigned HOST_WIDE_INT *value, int validated_p)
{
static unsigned prg_n_ctrs[GCOV_COUNTERS]; /* Total counters allocated. */
/* Counter information for current function. */
-static unsigned fn_ctr_mask; /* Mask of counters used. */
+static unsigned fn_ctr_mask; /* Mask of counters used. */
static unsigned fn_n_ctrs[GCOV_COUNTERS]; /* Counters allocated. */
static unsigned fn_b_ctrs[GCOV_COUNTERS]; /* Allocation base. */
{
counts_entry_t *entry, elt;
- /* No hash table, no counts. */
+ /* No hash table, no counts. */
if (!counts_hash)
{
static int warned = 0;
}
\f
/* Generate a checksum for a string. CHKSUM is the current
- checksum. */
+ checksum. */
static unsigned
checksum_string (unsigned chksum, const char *string)
}
\f
/* Perform file-level initialization. Read in data file, generate name
- of graph file. */
+ of graph file. */
void
coverage_init (filename)
#define NODE_DIAGNOSTIC (1 << 3) /* Possible diagnostic when lexed. */
#define NODE_WARN (1 << 4) /* Warn if redefined or undefined. */
#define NODE_DISABLED (1 << 5) /* A disabled macro. */
-#define NODE_MACRO_ARG (1 << 6) /* Used during #define processing. */
+#define NODE_MACRO_ARG (1 << 6) /* Used during #define processing. */
/* Different flavors of hash node. */
enum node_type
unsigned int is_directive : 1;
unsigned int directive_index : 7; /* If is_directive,
then index into directive table.
- Otherwise, a NODE_OPERATOR. */
+ Otherwise, a NODE_OPERATOR. */
unsigned char rid_code; /* Rid code - for front ends. */
ENUM_BITFIELD(node_type) type : 8; /* CPP node type. */
unsigned char flags; /* CPP flags. */
size_t hashsize;
/* Number of definitions */
size_t n_defs;
- /* Array of definitions. In cpp_write_pch_deps it is used for sorting. */
+ /* Array of definitions. In cpp_write_pch_deps it is used for sorting. */
cpp_hashnode **defs;
/* Space for the next definition. Definitions are null-terminated
strings. */
}
}
-/* Collect the identifiers into the state's string table. */
+/* Collect the identifiers into the state's string table. */
static int
write_defs (cpp_reader *pfile ATTRIBUTE_UNUSED, cpp_hashnode *hn, void *ss_p)
{
ss->n_defs = 0;
cpp_forall_identifiers (r, write_defs, ss);
- /* Sort the list, copy it into a buffer, and write it out. */
+ /* Sort the list, copy it into a buffer, and write it out. */
qsort (ss->defs, ss->n_defs, sizeof (cpp_hashnode *), &comp_hashnodes);
definedstrs = ss->definedstrs = xmalloc (ss->hashsize);
for (i = 0; i < ss->n_defs; ++i)
qsort (nl.defs, nl.n_defs, sizeof (cpp_hashnode *), &comp_hashnodes);
/* Loop through nl.defs and undeftab, both of which are sorted lists.
- There should be no matches. */
+ There should be no matches. */
first = undeftab;
last = undeftab + m.definition_length;
i = 0;
}
else
{
- /* ... and an EINCL. */
+ /* ... and an EINCL. */
dbxout_end_source_file (0);
/* Deal with cases where 'lastfile' was never actually changed. */
output_long_long_decimal
(buffer, va_arg (*text->args_ptr, long long));
else
- /* Sould not happen. */
+ /* Sould not happen. */
abort();
break;
static int comp_unit_has_inlines;
#endif
-/* Number of file tables emited in maybe_emit_file(). */
+/* Number of file tables emited in maybe_emit_file(). */
static GTY(()) int emitcount = 0;
-/* Number of internal labels generated by gen_internal_sym(). */
+/* Number of internal labels generated by gen_internal_sym(). */
static GTY(()) int label_num;
#ifdef DWARF2_DEBUGGING_INFO
{
/* C++ can generate ?: expressions with a throw expression in one
branch and an rvalue in the other. Here, we resolve attempts to
- store the throw expression's nonexistant result. */
+ store the throw expression's nonexistant result. */
if (want_value)
abort ();
expand_expr (exp, const0_rtx, VOIDmode, 0);
return original_target;
}
- /* ... fall through ... */
+ /* ... fall through ... */
case STRING_CST:
temp = output_constant_def (exp, 1);
}
}
- /* ... fall through ... */
+ /* ... fall through ... */
default:
if (truth_value_p (TREE_CODE (t)))
static GTY(()) rtx initial_trampoline;
-/* Generate RTL for the end of the current function. */
+/* Generate RTL for the end of the current function. */
void
expand_function_end ()
}
}
- /* Process sysroot_suffix_spec. */
+ /* Process sysroot_suffix_spec. */
if (*sysroot_suffix_spec != 0
&& do_spec_2 (sysroot_suffix_spec) == 0)
{
target_sysroot_suffix = xstrdup (argbuf[argbuf_index -1]);
}
- /* Process sysroot_hdrs_suffix_spec. */
+ /* Process sysroot_hdrs_suffix_spec. */
if (*sysroot_hdrs_suffix_spec != 0
&& do_spec_2 (sysroot_hdrs_suffix_spec) == 0)
{
#endif /*!IN_GCOV */
/* Return a pointer to read BYTES bytes from the gcov file. Returns
- NULL on failure (read past EOF). */
+ NULL on failure (read past EOF). */
static const unsigned char *
gcov_read_bytes (unsigned bytes)
#if IN_LIBGCOV
/* Move to the a set position in a gcov file. BASE is zero to move to
- the end, and nonzero to move to that position. */
+ the end, and nonzero to move to that position. */
GCOV_LINKAGE void
gcov_seek (gcov_position_t base)
#define gcov_read_counter __gcov_read_counter
#define gcov_read_summary __gcov_read_summary
-/* Poison these, so they don't accidentally slip in. */
+/* Poison these, so they don't accidentally slip in. */
#pragma GCC poison gcov_write_string gcov_write_tag gcov_write_length
#pragma GCC poison gcov_read_string gcov_sync gcov_time
/* Counters that are collected. */
#define GCOV_COUNTER_ARCS 0 /* Arc transitions. */
#define GCOV_COUNTERS_SUMMABLE 1 /* Counters which can be
- summaried. */
+ summaried. */
#define GCOV_COUNTERS 1
/* A list of human readable names of the counters */
/* Names of merge functions for counters. */
#define GCOV_MERGE_FUNCTIONS {"__gcov_merge_add"}
-/* Convert a counter index to a tag. */
+/* Convert a counter index to a tag. */
#define GCOV_TAG_FOR_COUNTER(COUNT) \
(GCOV_TAG_COUNTER_BASE + ((gcov_unsigned_t)(COUNT) << 17))
/* Convert a tag to a counter. */
{
gcov_unsigned_t num; /* number of counters. */
gcov_unsigned_t runs; /* number of program runs */
- gcov_type sum_all; /* sum of all counters accumulated. */
+ gcov_type sum_all; /* sum of all counters accumulated. */
gcov_type run_max; /* maximum value on a single run. */
- gcov_type sum_max; /* sum of individual run max values. */
+ gcov_type sum_max; /* sum of individual run max values. */
};
/* Object & program summary record. */
{
FILE *file;
gcov_position_t start; /* Position of first byte of block */
- unsigned offset; /* Read/write position within the block. */
- unsigned length; /* Read limit in the block. */
+ unsigned offset; /* Read/write position within the block. */
+ unsigned length; /* Read limit in the block. */
unsigned overread; /* Number of bytes overread. */
int error; /* < 0 overflow, > 0 disk error. */
int mode; /* < 0 writing, > 0 reading */
may use the gcov_write functions, gcov_seek & gcov_error. When a
file is to be rewritten you use the functions for reading, then
gcov_rewrite then the functions for writing. Your file may become
- corrupted if you break these invariants. */
+ corrupted if you break these invariants. */
GCOV_LINKAGE int gcov_open (const char */*name*/, int /*truncate*/);
GCOV_LINKAGE int gcov_close (void);
struct
{
/* Single line graph cycle workspace. Used for all-blocks
- mode. */
+ mode. */
arc_t *arc;
unsigned ident;
} cycle; /* Used in all-blocks mode, after blocks are linked onto
- lines. */
+ lines. */
} u;
/* Temporary chain for solving graph, and for chaining blocks on one
{
arc_t *branches; /* branches from blocks that end on this
line. Used for branch-counts when not
- all-blocks mode. */
+ all-blocks mode. */
block_t *blocks; /* blocks which start on this line. Used
- in all-blocks mode. */
+ in all-blocks mode. */
} u;
unsigned exists : 1;
} line_t;
arc_t *cycle_arc = arc;
arc_t *probe_arc;
- /* Locate the smallest arc count of the loop. */
+ /* Locate the smallest arc count of the loop. */
for (dst = head; (probe_arc = dst->u.cycle.arc);
dst = probe_arc->src)
if (cycle_count > probe_arc->count)
arc = head->u.cycle.arc;
if (arc)
{
- /* It was not the first vertex. Move onto next arc. */
+ /* It was not the first vertex. Move onto next arc. */
head->u.cycle.arc = NULL;
head = arc->src;
arc = arc->succ_next;
#define EDGE_INFO(e) ((struct edge_info *) (e)->aux)
#define BB_INFO(b) ((struct bb_info *) (b)->aux)
-/* Counter summary from the last set of coverage counts read. */
+/* Counter summary from the last set of coverage counts read. */
const struct gcov_ctr_summary *profile_info;
}
}
- /* Line numbers. */
+ /* Line numbers. */
if (coverage_begin_output ())
{
char const *prev_file_name = NULL;
enum machine_mode,
const REAL_VALUE_TYPE *));
-/* Calculate R as X raised to the integer exponent N in mode MODE. */
+/* Calculate R as X raised to the integer exponent N in mode MODE. */
extern bool real_powi PARAMS ((REAL_VALUE_TYPE *,
enum machine_mode,
const REAL_VALUE_TYPE *,
them as writes to get proper dependencies for following
instructions. We must handle them as reads to get proper
dependencies from this to previous instructions.
- Thus we need to call sched_analyze_2. */
+ Thus we need to call sched_analyze_2. */
sched_analyze_2 (deps, XEXP (dest, 0), insn);
}
projects / thirdparty / gcc.git / commitdiff
