+2005-03-08 Kazu Hirata <kazu@cs.umass.edu>
+
+ * c-common.c, c-opts.c, combine.c, cse.c, dojump.c,
+ gimplify.c, tree-dfa.c, tree-ssa-loop-ivopts.c,
+ tree-ssa-phiopt.c, tree-ssa-pre.c, tree-ssa-sink.c,
+ tree-vect-analyze.c, tree.def, tree.h: Fix comment formatting.
+
2005-03-08 Alexey Neyman <alex.neyman@auriga.ru>
PR c/14411
/* Look up the function in built_in_decls that corresponds to DECL
and set ASMSPEC as its user assembler name. DECL must be a
- function decl that declares a builtin. */
+ function decl that declares a builtin. */
void
set_builtin_user_assembler_name (tree decl, const char *asmspec)
c_parse_file ();
finish_file ();
pop_file_scope ();
- /* And end the main input file. */
+ /* And end the main input file. */
(*debug_hooks->end_source_file) (0);
if (++i >= num_in_fnames)
break;
/* Disable -dD, -dN and -dI if normal output is suppressed. Allow
-dM since at least glibc relies on -M -dM to work. */
- /* Also, flag_no_output implies flag_no_line_commands, always. */
+ /* Also, flag_no_output implies flag_no_line_commands, always. */
if (flag_no_output)
{
if (flag_dump_macros != 'M')
if (WORDS_BIG_ENDIAN)
offset = MAX (isize, UNITS_PER_WORD) - MAX (osize, UNITS_PER_WORD);
- /* Adjust the address so that the address-after-the-data is unchanged. */
+ /* Adjust the address so that the address-after-the-data is
+ unchanged. */
if (BYTES_BIG_ENDIAN)
offset -= MIN (UNITS_PER_WORD, osize) - MIN (UNITS_PER_WORD, isize);
int new_cost;
/* Get the canonical version of the address so we can accept
- more. */
+ more. */
new = canon_for_address (new);
new_cost = address_cost (new, mode);
be reliably compared, then canonicalize them.
Only do this if *both* sides of the comparison are function pointers.
If one side isn't, we want a noncanonicalized comparison. See PR
- middle-end/17564. */
+ middle-end/17564. */
if (HAVE_canonicalize_funcptr_for_compare
&& TREE_CODE (TREE_TYPE (TREE_OPERAND (exp, 0))) == POINTER_TYPE
&& TREE_CODE (TREE_TYPE (TREE_TYPE (TREE_OPERAND (exp, 0))))
can't easily test for. We could pass TYPE down to gimplify_one_sizepos
and test there, but it doesn't seem worth it. */
- /* We first do the main variant, then copy into any other variants. */
+ /* We first do the main variant, then copy into any other variants. */
type = TYPE_MAIN_VARIANT (type);
switch (TREE_CODE (type))
&& !DECL_EXTERNAL (var)
/* It's not necessary to walk the initial value of non-constant
public variables because it cannot be propagated by the
- optimizers. */
+ optimizers. */
&& (!TREE_PUBLIC (var) || !TREE_CONSTANT (var)))
walk_tree (&DECL_INITIAL (var), find_vars_r, walk_state, 0);
}
}
/* Joins two lists of changes L1 and L2. Destructive -- old lists
- are rewritten. */
+ are rewritten. */
static struct iv_ca_delta *
iv_ca_delta_join (struct iv_ca_delta *l1, struct iv_ca_delta *l2)
replacement. Return true if the replacement is done. Otherwise return
false.
bb is the basic block where the replacement is going to be done on. arg0
- is argument 0 from the phi. Likewise for arg1. */
+ is argument 0 from the phi. Likewise for arg1. */
static bool
abs_replacement (basic_block cond_bb, basic_block middle_bb,
}
/* Replace an instance of EXPR's VALUE with EXPR in SET if it exists,
- and add it otherwise. */
+ and add it otherwise. */
static void
bitmap_value_replace_in_set (bitmap_set_t set, tree expr)
}
/* Return the folded version of T if T, when folded, is a gimple
- min_invariant. Otherwise, return T. */
+ min_invariant. Otherwise, return T. */
static tree
fully_constant_expression (tree t)
static struct
{
- /* The number of statements sunk down the flowgraph by code sinking. */
+ /* The number of statements sunk down the flowgraph by code sinking. */
int sunk;
} sink_stats;
and all the other uses are in phis in the same basic block, but this
requires some expensive checking later (you have to make sure no def/vdef
in the statement occurs for multiple edges in the various phi nodes it's
- used in, so that you only have one place you can sink it to. */
+ used in, so that you only have one place you can sink it to. */
static bool
all_immediate_uses_same_place (dataflow_t imm)
/* Given a statement (STMT) and the basic block it is currently in (FROMBB),
determine the location to sink the statement to, if any.
Return the basic block to sink it to, or NULL if we should not sink
- it. */
+ it. */
static tree
statement_sink_location (tree stmt, basic_block frombb)
return NULL_TREE;
/* Part 2: Combine the results of object and address analysis to calculate
- INITIAL_OFFSET, STEP and misalignment info. */
+ INITIAL_OFFSET, STEP and misalignment info. */
*offset = size_binop (PLUS_EXPR, object_offset, address_offset);
if (object_misalign && address_misalign)
*misalign = size_binop (PLUS_EXPR, object_misalign, address_misalign);
DEFTREECODE (ENUMERAL_TYPE, "enumeral_type", tcc_type, 0)
/* Boolean type (true or false are the only values). Looks like an
- INTEGRAL_TYPE. */
+ INTEGRAL_TYPE. */
DEFTREECODE (BOOLEAN_TYPE, "boolean_type", tcc_type, 0)
/* CHAR in Java; not used in C. Looks like an INTEGRAL_TYPE. */
/* The ordering of the following codes is optimized for the checking
macros in tree.h. Changing the order will degrade the speed of the
compiler. POINTER_TYPE, REFERENCE_TYPE. Note that this range
- overlaps the previous range of ordered types. */
+ overlaps the previous range of ordered types. */
/* All pointer-to-x types have code POINTER_TYPE.
The TREE_TYPE points to the node for the type pointed to. */
PHI_ARG_ELT returns the Ith tuple <ssa_name, edge> from the
argument list. Each tuple contains the incoming reaching
definition (SSA_NAME node) and the edge via which that definition
- is coming through. */
+ is coming through. */
DEFTREECODE (PHI_NODE, "phi_node", tcc_exceptional, 0)
/* Used to represent a typed exception handler. CATCH_TYPES is the type (or
/* Nonzero if TYPE represents an integral type. Note that we do not
include COMPLEX types here. Keep these checks in ascending code
- order. */
+ order. */
#define INTEGRAL_TYPE_P(TYPE) \
(TREE_CODE (TYPE) == ENUMERAL_TYPE \
projects / gcc.git / commitdiff