alias.c: Fix comment formatting.
* alias.c: Fix comment formatting. * alloc-pool.c: Likewise. * bitmap.c: Likewise. * bitmap.h: Likewise. * bt-load.c: Likewise. * c-common.c: Likewise. * c-common.h: Likewise. * c-decl.c: Likewise. * c-opts.c: Likewise. * c-pretty-print.c: Likewise. * caller-save.c: Likewise. * cfghooks.h: Likewise. * cgraph.c: Likewise. * collect2.c: Likewise. * cppfiles.c: Likewise. * cpplib.h: Likewise. * dwarf2out.c: Likewise. * dwarfout.c: Likewise. * emit-rtl.c: Likewise. * final.c: Likewise. * function.c: Likewise. * gcov.c: Likewise. * gcse.c: Likewise. * genemit.c: Likewise. * ggc.h: Likewise. * haifa-sched.c: Likewise. * ifcvt.c: Likewise. * libgcc2.h: Likewise. * loop.c: Likewise. * predict.h: Likewise. * unwind-libunwind.c: Likewise. * varasm.c: Likewise. From-SVN: r74907
This commit is contained in:
Kazu Hirata
Kazu Hirata
parent
5b24813d3e
commit
6614fd40d2
|
|
@ -1,3 +1,38 @@
|
|||
2003-12-21 Kazu Hirata <kazu@cs.umass.edu>
|
||||
|
||||
* alias.c: Fix comment formatting.
|
||||
* alloc-pool.c: Likewise.
|
||||
* bitmap.c: Likewise.
|
||||
* bitmap.h: Likewise.
|
||||
* bt-load.c: Likewise.
|
||||
* c-common.c: Likewise.
|
||||
* c-common.h: Likewise.
|
||||
* c-decl.c: Likewise.
|
||||
* c-opts.c: Likewise.
|
||||
* c-pretty-print.c: Likewise.
|
||||
* caller-save.c: Likewise.
|
||||
* cfghooks.h: Likewise.
|
||||
* cgraph.c: Likewise.
|
||||
* collect2.c: Likewise.
|
||||
* cppfiles.c: Likewise.
|
||||
* cpplib.h: Likewise.
|
||||
* dwarf2out.c: Likewise.
|
||||
* dwarfout.c: Likewise.
|
||||
* emit-rtl.c: Likewise.
|
||||
* final.c: Likewise.
|
||||
* function.c: Likewise.
|
||||
* gcov.c: Likewise.
|
||||
* gcse.c: Likewise.
|
||||
* genemit.c: Likewise.
|
||||
* ggc.h: Likewise.
|
||||
* haifa-sched.c: Likewise.
|
||||
* ifcvt.c: Likewise.
|
||||
* libgcc2.h: Likewise.
|
||||
* loop.c: Likewise.
|
||||
* predict.h: Likewise.
|
||||
* unwind-libunwind.c: Likewise.
|
||||
* varasm.c: Likewise.
|
||||
|
||||
2003-12-21 Kazu Hirata <kazu@cs.umass.edu>
|
||||
|
||||
* config/mn10300/mn10300.c (mn10300_encode_section_info): Fix
|
||||
|
|
|
|||
|
|
@ -692,7 +692,7 @@ record_component_aliases (tree type)
|
|||
case RECORD_TYPE:
|
||||
case UNION_TYPE:
|
||||
case QUAL_UNION_TYPE:
|
||||
/* Recursively record aliases for the base classes, if there are any */
|
||||
/* Recursively record aliases for the base classes, if there are any. */
|
||||
if (TYPE_BINFO (type) != NULL && TYPE_BINFO_BASETYPES (type) != NULL)
|
||||
{
|
||||
int i;
|
||||
|
|
|
|||
|
|
@ -112,7 +112,7 @@ create_alloc_pool (const char *name, size_t size, size_t num)
|
|||
pool->elt_size = size;
|
||||
pool->elts_per_block = num;
|
||||
|
||||
/* List header size should be a multiple of 8 */
|
||||
/* List header size should be a multiple of 8. */
|
||||
header_size = align_eight (sizeof (struct alloc_pool_list_def));
|
||||
|
||||
pool->block_size = (size * num) + header_size;
|
||||
|
|
|
|||
|
|
@ -348,7 +348,7 @@ bitmap_clear_bit (bitmap head, int bit)
|
|||
unsigned word_num = bit / BITMAP_WORD_BITS % BITMAP_ELEMENT_WORDS;
|
||||
ptr->bits[word_num] &= ~ (((BITMAP_WORD) 1) << bit_num);
|
||||
|
||||
/* If we cleared the entire word, free up the element */
|
||||
/* If we cleared the entire word, free up the element. */
|
||||
if (bitmap_element_zerop (ptr))
|
||||
bitmap_element_free (head, ptr);
|
||||
}
|
||||
|
|
|
|||
|
|
@ -305,7 +305,7 @@ do { \
|
|||
\
|
||||
for (; ptr1_ != 0 ; ptr1_ = ptr1_->next) \
|
||||
{ \
|
||||
/* Advance BITMAP2 to the equivalent link */ \
|
||||
/* Advance BITMAP2 to the equivalent link. */ \
|
||||
while (ptr2_ != 0 && ptr2_->indx < ptr1_->indx) \
|
||||
ptr2_ = ptr2_->next; \
|
||||
\
|
||||
|
|
|
|||
|
|
@ -155,7 +155,7 @@ static void note_btr_set (rtx, rtx, void *);
|
|||
migrating branch target load instructions. */
|
||||
static struct obstack migrate_btrl_obstack;
|
||||
|
||||
/* Basic block dominator information used when migrating PT instructions */
|
||||
/* Basic block dominator information used when migrating PT instructions. */
|
||||
static dominance_info dom;
|
||||
|
||||
/* Array indexed by basic block number, giving the set of registers
|
||||
|
|
|
|||
|
|
@ -386,7 +386,7 @@ int flag_isoc94;
|
|||
|
||||
int flag_isoc99;
|
||||
|
||||
/* Nonzero means that we have builtin functions, and main is an int */
|
||||
/* Nonzero means that we have builtin functions, and main is an int. */
|
||||
|
||||
int flag_hosted = 1;
|
||||
|
||||
|
|
|
|||
|
|
@ -553,7 +553,7 @@ extern int flag_isoc94;
|
|||
|
||||
extern int flag_isoc99;
|
||||
|
||||
/* Nonzero means that we have builtin functions, and main is an int */
|
||||
/* Nonzero means that we have builtin functions, and main is an int. */
|
||||
|
||||
extern int flag_hosted;
|
||||
|
||||
|
|
|
|||
14
gcc/c-decl.c
14
gcc/c-decl.c
|
|
@ -125,7 +125,7 @@ static GTY(()) struct stmt_tree_s c_stmt_tree;
|
|||
|
||||
static GTY(()) tree c_scope_stmt_stack;
|
||||
|
||||
/* State saving variables. */
|
||||
/* State saving variables. */
|
||||
int c_in_iteration_stmt;
|
||||
int c_in_case_stmt;
|
||||
|
||||
|
|
@ -541,7 +541,7 @@ poplevel (int keep, int dummy ATTRIBUTE_UNUSED, int functionbody)
|
|||
tree decl;
|
||||
tree p;
|
||||
|
||||
/* The following line does not use |= due to a bug in HP's C compiler */
|
||||
/* The following line does not use |= due to a bug in HP's C compiler. */
|
||||
scope->function_body = scope->function_body | functionbody;
|
||||
|
||||
if (keep == KEEP_MAYBE)
|
||||
|
|
@ -1335,7 +1335,7 @@ duplicate_decls (tree newdecl, tree olddecl, int different_binding_level,
|
|||
Currently, it can only be defined in the prototype. */
|
||||
COPY_DECL_ASSEMBLER_NAME (olddecl, newdecl);
|
||||
|
||||
/* If either declaration has a nondefault visibility, use it. */
|
||||
/* If either declaration has a nondefault visibility, use it. */
|
||||
if (DECL_VISIBILITY (olddecl) != VISIBILITY_DEFAULT)
|
||||
{
|
||||
if (DECL_VISIBILITY (newdecl) != VISIBILITY_DEFAULT
|
||||
|
|
@ -1425,7 +1425,7 @@ duplicate_decls (tree newdecl, tree olddecl, int different_binding_level,
|
|||
{
|
||||
if (TREE_USED (olddecl)
|
||||
/* In unit-at-a-time mode we never inline re-defined extern
|
||||
inline functions. */
|
||||
inline functions. */
|
||||
&& !flag_unit_at_a_time)
|
||||
(*debug_hooks->outlining_inline_function) (olddecl);
|
||||
|
||||
|
|
@ -2775,7 +2775,7 @@ finish_decl (tree decl, tree init, tree asmspec_tree)
|
|||
|| TREE_CODE (decl) == FIELD_DECL))
|
||||
objc_check_decl (decl);
|
||||
|
||||
/* Deduce size of array from initialization, if not already known */
|
||||
/* Deduce size of array from initialization, if not already known. */
|
||||
if (TREE_CODE (type) == ARRAY_TYPE
|
||||
&& TYPE_DOMAIN (type) == 0
|
||||
&& TREE_CODE (decl) != TYPE_DECL)
|
||||
|
|
@ -5089,7 +5089,7 @@ finish_struct (tree t, tree fieldlist, tree attributes)
|
|||
|
||||
layout_type (t);
|
||||
|
||||
/* Delete all zero-width bit-fields from the fieldlist */
|
||||
/* Delete all zero-width bit-fields from the fieldlist. */
|
||||
{
|
||||
tree *fieldlistp = &fieldlist;
|
||||
while (*fieldlistp)
|
||||
|
|
@ -5105,7 +5105,7 @@ finish_struct (tree t, tree fieldlist, tree attributes)
|
|||
TYPE_FIELDS (t) = fieldlist;
|
||||
|
||||
/* If there are lots of fields, sort so we can look through them fast.
|
||||
We arbitrarily consider 16 or more elts to be "a lot". */
|
||||
We arbitrarily consider 16 or more elts to be "a lot". */
|
||||
|
||||
{
|
||||
int len = 0;
|
||||
|
|
|
|||
|
|
@ -1441,7 +1441,7 @@ finish_options (const char *tif)
|
|||
if (opt->code == OPT_imacros
|
||||
&& cpp_push_include (parse_in, opt->arg))
|
||||
{
|
||||
/* Disable push_command_line_include callback for now. */
|
||||
/* Disable push_command_line_include callback for now. */
|
||||
include_cursor = deferred_count + 1;
|
||||
cpp_scan_nooutput (parse_in);
|
||||
}
|
||||
|
|
|
|||
|
|
@ -1106,7 +1106,7 @@ pp_c_initializer_list (c_pretty_printer *pp, tree e)
|
|||
}
|
||||
}
|
||||
|
||||
/* Pretty-print a brace-enclosed initializer-list. */
|
||||
/* Pretty-print a brace-enclosed initializer-list. */
|
||||
|
||||
static void
|
||||
pp_c_brace_enclosed_initializer_list (c_pretty_printer *pp, tree l)
|
||||
|
|
@ -1246,7 +1246,7 @@ pp_c_postfix_expression (c_pretty_printer *pp, tree e)
|
|||
}
|
||||
}
|
||||
|
||||
/* Print out an expression-list; E is expected to be a TREE_LIST */
|
||||
/* Print out an expression-list; E is expected to be a TREE_LIST. */
|
||||
|
||||
void
|
||||
pp_c_expression_list (c_pretty_printer *pp, tree e)
|
||||
|
|
@ -1259,7 +1259,7 @@ pp_c_expression_list (c_pretty_printer *pp, tree e)
|
|||
}
|
||||
}
|
||||
|
||||
/* Print out an expression-list in parens, as in a function call. */
|
||||
/* Print out an expression-list in parens, as in a function call. */
|
||||
|
||||
void
|
||||
pp_c_call_argument_list (c_pretty_printer *pp, tree t)
|
||||
|
|
|
|||
|
|
@ -699,7 +699,7 @@ insert_restore (struct insn_chain *chain, int before_p, int regno,
|
|||
n_regs_saved--;
|
||||
}
|
||||
|
||||
/* Tell our callers how many extra registers we saved/restored */
|
||||
/* Tell our callers how many extra registers we saved/restored. */
|
||||
return numregs - 1;
|
||||
}
|
||||
|
||||
|
|
@ -771,7 +771,7 @@ insert_save (struct insn_chain *chain, int before_p, int regno,
|
|||
n_regs_saved++;
|
||||
}
|
||||
|
||||
/* Tell our callers how many extra registers we saved/restored */
|
||||
/* Tell our callers how many extra registers we saved/restored. */
|
||||
return numregs - 1;
|
||||
}
|
||||
|
||||
|
|
|
|||
|
|
@ -31,7 +31,7 @@ struct cfg_hooks
|
|||
|
||||
/* Basic CFG manipulation. */
|
||||
|
||||
/* Return new basic block */
|
||||
/* Return new basic block. */
|
||||
basic_block (*create_basic_block) (void *head, void *end, basic_block after);
|
||||
|
||||
/* Redirect edge E to the given basic block B and update underlying program
|
||||
|
|
|
|||
|
|
@ -268,7 +268,7 @@ cgraph_mark_needed_node (struct cgraph_node *node)
|
|||
cgraph_mark_reachable_node (node);
|
||||
}
|
||||
|
||||
/* Record call from CALLER to CALLEE */
|
||||
/* Record call from CALLER to CALLEE. */
|
||||
|
||||
struct cgraph_edge *
|
||||
cgraph_record_call (tree caller, tree callee)
|
||||
|
|
|
|||
|
|
@ -1432,10 +1432,10 @@ main (int argc, char **argv)
|
|||
|
||||
fork_execute ("gcc", c_argv);
|
||||
#ifdef COLLECT_EXPORT_LIST
|
||||
/* On AIX we must call tlink because of possible templates resolution */
|
||||
/* On AIX we must call tlink because of possible templates resolution. */
|
||||
do_tlink (ld2_argv, object_lst);
|
||||
#else
|
||||
/* Otherwise, simply call ld because tlink is already done */
|
||||
/* Otherwise, simply call ld because tlink is already done. */
|
||||
fork_execute ("ld", ld2_argv);
|
||||
|
||||
/* Let scan_prog_file do any final mods (OSF/rose needs this for
|
||||
|
|
|
|||
|
|
@ -862,7 +862,7 @@ cpp_included (cpp_reader *pfile, const char *fname)
|
|||
return entry != NULL;
|
||||
}
|
||||
|
||||
/* Calculate the hash value of a file hash entry P. */
|
||||
/* Calculate the hash value of a file hash entry P. */
|
||||
|
||||
static hashval_t
|
||||
file_hash_hash (const void *p)
|
||||
|
|
|
|||
|
|
@ -219,7 +219,7 @@ struct cpp_options
|
|||
/* Nonzero means use extra default include directories for C++. */
|
||||
unsigned char cplusplus;
|
||||
|
||||
/* Nonzero means handle cplusplus style comments */
|
||||
/* Nonzero means handle cplusplus style comments. */
|
||||
unsigned char cplusplus_comments;
|
||||
|
||||
/* Nonzero means define __OBJC__, treat @ as a special token, and
|
||||
|
|
|
|||
|
|
@ -4673,7 +4673,7 @@ add_AT_die_ref (dw_die_ref die, enum dwarf_attribute attr_kind, dw_die_ref targ_
|
|||
}
|
||||
|
||||
/* Add an AT_specification attribute to a DIE, and also make the back
|
||||
pointer from the specification to the definition. */
|
||||
pointer from the specification to the definition. */
|
||||
|
||||
static inline void
|
||||
add_AT_specification (dw_die_ref die, dw_die_ref targ_die)
|
||||
|
|
@ -11848,7 +11848,7 @@ setup_namespace_context (tree thing, dw_die_ref context_die)
|
|||
{
|
||||
tree context = DECL_P (thing) ? DECL_CONTEXT (thing) : TYPE_CONTEXT (thing);
|
||||
if (context && TREE_CODE (context) == NAMESPACE_DECL)
|
||||
/* Force out the namespace. */
|
||||
/* Force out the namespace. */
|
||||
context_die = force_namespace_die (context);
|
||||
|
||||
return context_die;
|
||||
|
|
@ -11879,7 +11879,7 @@ declare_in_namespace (tree thing, dw_die_ref context_die)
|
|||
}
|
||||
}
|
||||
|
||||
/* Generate a DIE for a namespace or namespace alias */
|
||||
/* Generate a DIE for a namespace or namespace alias. */
|
||||
|
||||
static void
|
||||
gen_namespace_die (tree decl)
|
||||
|
|
@ -11887,10 +11887,10 @@ gen_namespace_die (tree decl)
|
|||
dw_die_ref context_die = setup_namespace_context (decl, comp_unit_die);
|
||||
|
||||
/* Namespace aliases have a DECL_ABSTRACT_ORIGIN of the namespace
|
||||
they are an alias of.*/
|
||||
they are an alias of. */
|
||||
if (DECL_ABSTRACT_ORIGIN (decl) == NULL)
|
||||
{
|
||||
/* Output a real namespace */
|
||||
/* Output a real namespace. */
|
||||
dw_die_ref namespace_die
|
||||
= new_die (DW_TAG_namespace, context_die, decl);
|
||||
add_name_and_src_coords_attributes (namespace_die, decl);
|
||||
|
|
@ -11898,13 +11898,13 @@ gen_namespace_die (tree decl)
|
|||
}
|
||||
else
|
||||
{
|
||||
/* Output a namespace alias */
|
||||
/* Output a namespace alias. */
|
||||
|
||||
/* Force out the namespace we are an alias of, if necessary */
|
||||
/* Force out the namespace we are an alias of, if necessary. */
|
||||
dw_die_ref origin_die
|
||||
= force_namespace_die (DECL_ABSTRACT_ORIGIN (decl));
|
||||
|
||||
/* Now create the namespace alias DIE. */
|
||||
/* Now create the namespace alias DIE. */
|
||||
dw_die_ref namespace_die
|
||||
= new_die (DW_TAG_imported_declaration, context_die, decl);
|
||||
add_name_and_src_coords_attributes (namespace_die, decl);
|
||||
|
|
@ -12670,7 +12670,7 @@ prune_unused_types_mark (dw_die_ref die, int dokids)
|
|||
prune_unused_types_walk_attribs (die);
|
||||
|
||||
/* If this node is a specification,
|
||||
also mark the definition, if it exists. */
|
||||
also mark the definition, if it exists. */
|
||||
if (get_AT_flag (die, DW_AT_declaration) && die->die_definition)
|
||||
prune_unused_types_mark (die->die_definition, 1);
|
||||
}
|
||||
|
|
|
|||
|
|
@ -2956,7 +2956,7 @@ subscript_data_attribute (tree type)
|
|||
FMT_CODE (1, TREE_CODE (lower) == INTEGER_CST,
|
||||
upper && TREE_CODE (upper) == INTEGER_CST));
|
||||
|
||||
/* Output the index type for this dimension. */
|
||||
/* Output the index type for this dimension. */
|
||||
ASM_OUTPUT_DWARF_FUND_TYPE (asm_out_file,
|
||||
fundamental_type_code (domain));
|
||||
|
||||
|
|
@ -2985,7 +2985,7 @@ subscript_data_attribute (tree type)
|
|||
|
||||
ASM_OUTPUT_DWARF_FUND_TYPE (asm_out_file, FT_integer);
|
||||
|
||||
/* Output the (assumed) lower bound (constant) value. */
|
||||
/* Output the (assumed) lower bound (constant) value. */
|
||||
|
||||
ASM_OUTPUT_DWARF_DATA4 (asm_out_file, 0);
|
||||
|
||||
|
|
@ -4282,7 +4282,7 @@ output_die (void (*die_specific_output_function) (void *), void *param)
|
|||
|
||||
ASM_OUTPUT_LABEL (asm_out_file, begin_label);
|
||||
|
||||
/* Write the DIE-length word. */
|
||||
/* Write the DIE-length word. */
|
||||
|
||||
ASM_OUTPUT_DWARF_DELTA4 (asm_out_file, end_label, begin_label);
|
||||
|
||||
|
|
@ -4291,7 +4291,7 @@ output_die (void (*die_specific_output_function) (void *), void *param)
|
|||
next_unused_dienum++;
|
||||
die_specific_output_function (param);
|
||||
|
||||
/* Write a label which will act as the name for the end of this DIE. */
|
||||
/* Write a label which will act as the name for the end of this DIE. */
|
||||
|
||||
ASM_OUTPUT_LABEL (asm_out_file, end_label);
|
||||
}
|
||||
|
|
@ -4310,7 +4310,7 @@ end_sibling_chain (void)
|
|||
|
||||
ASM_OUTPUT_LABEL (asm_out_file, begin_label);
|
||||
|
||||
/* Write the DIE-length word. */
|
||||
/* Write the DIE-length word. */
|
||||
|
||||
ASM_OUTPUT_DWARF_DATA4 (asm_out_file, 4);
|
||||
|
||||
|
|
|
|||
|
|
@ -971,7 +971,7 @@ mark_reg_pointer (rtx reg, int align)
|
|||
REGNO_POINTER_ALIGN (REGNO (reg)) = align;
|
||||
}
|
||||
else if (align && align < REGNO_POINTER_ALIGN (REGNO (reg)))
|
||||
/* We can no-longer be sure just how aligned this pointer is */
|
||||
/* We can no-longer be sure just how aligned this pointer is. */
|
||||
REGNO_POINTER_ALIGN (REGNO (reg)) = align;
|
||||
}
|
||||
|
||||
|
|
@ -2551,7 +2551,7 @@ verify_rtx_sharing (rtx orig, rtx insn)
|
|||
}
|
||||
RTX_FLAG (x, used) = 1;
|
||||
|
||||
/* Now scan the subexpressions recursively. */
|
||||
/* Now scan the subexpressions recursively. */
|
||||
|
||||
format_ptr = GET_RTX_FORMAT (code);
|
||||
|
||||
|
|
@ -2867,11 +2867,12 @@ repeat:
|
|||
int j;
|
||||
int len = XVECLEN (x, i);
|
||||
|
||||
/* Copy the vector iff I copied the rtx and the length is nonzero. */
|
||||
/* Copy the vector iff I copied the rtx and the length
|
||||
is nonzero. */
|
||||
if (copied && len > 0)
|
||||
XVEC (x, i) = gen_rtvec_v (len, XVEC (x, i)->elem);
|
||||
|
||||
/* Call recsusively on all inside the vector. */
|
||||
/* Call recsusively on all inside the vector. */
|
||||
for (j = 0; j < len; j++)
|
||||
{
|
||||
if (last_ptr)
|
||||
|
|
|
|||
|
|
@ -1907,7 +1907,7 @@ final_scan_insn (rtx insn, FILE *file, int optimize ATTRIBUTE_UNUSED,
|
|||
/* An INSN, JUMP_INSN or CALL_INSN.
|
||||
First check for special kinds that recog doesn't recognize. */
|
||||
|
||||
if (GET_CODE (body) == USE /* These are just declarations */
|
||||
if (GET_CODE (body) == USE /* These are just declarations. */
|
||||
|| GET_CODE (body) == CLOBBER)
|
||||
break;
|
||||
|
||||
|
|
|
|||
|
|
@ -4844,7 +4844,7 @@ assign_parms (tree fndecl)
|
|||
size_stored / UNITS_PER_WORD);
|
||||
}
|
||||
/* If parm is already bound to register pair, don't change
|
||||
this binding. */
|
||||
this binding. */
|
||||
if (! DECL_RTL_SET_P (parm))
|
||||
SET_DECL_RTL (parm, stack_parm);
|
||||
}
|
||||
|
|
|
|||
|
|
@ -906,7 +906,7 @@ read_graph_file (void)
|
|||
}
|
||||
gcov_close ();
|
||||
|
||||
/* We built everything backwards, so nreverse them all */
|
||||
/* We built everything backwards, so nreverse them all. */
|
||||
|
||||
/* Reverse sources. Not strictly necessary, but we'll then process
|
||||
them in the 'expected' order. */
|
||||
|
|
|
|||
|
|
@ -7990,7 +7990,7 @@ bypass_jumps (FILE *file)
|
|||
if (file)
|
||||
dump_flow_info (file);
|
||||
|
||||
/* Return if there's nothing to do, or it is too expensive */
|
||||
/* Return if there's nothing to do, or it is too expensive. */
|
||||
if (n_basic_blocks <= 1 || is_too_expensive (_ ("jump bypassing disabled")))
|
||||
return 0;
|
||||
|
||||
|
|
|
|||
|
|
@ -389,7 +389,7 @@ gen_insn (rtx insn, int lineno)
|
|||
printf (")\n");
|
||||
printf ("{\n");
|
||||
|
||||
/* Output code to construct and return the rtl for the instruction body */
|
||||
/* Output code to construct and return the rtl for the instruction body. */
|
||||
|
||||
if (XVECLEN (insn, 1) == 1)
|
||||
{
|
||||
|
|
|
|||
|
|
@ -213,7 +213,7 @@ extern struct alloc_zone *tree_zone;
|
|||
extern void *ggc_alloc (size_t);
|
||||
/* Allocate an object into the specified allocation zone. */
|
||||
extern void *ggc_alloc_zone (size_t, struct alloc_zone *);
|
||||
/* Allocate an object of the specified type and size. */
|
||||
/* Allocate an object of the specified type and size. */
|
||||
extern void *ggc_alloc_typed (enum gt_types_enum, size_t);
|
||||
/* Like ggc_alloc, but allocates cleared memory. */
|
||||
extern void *ggc_alloc_cleared (size_t);
|
||||
|
|
|
|||
|
|
@ -1871,7 +1871,7 @@ ok_for_early_queue_removal (rtx insn)
|
|||
|
||||
|
||||
/* Remove insns from the queue, before they become "ready" with respect
|
||||
to FU latency considerations. */
|
||||
to FU latency considerations. */
|
||||
|
||||
static int
|
||||
early_queue_to_ready (state_t state, struct ready_list *ready)
|
||||
|
|
|
|||
|
|
@ -452,7 +452,7 @@ cond_exec_process_if_block (ce_if_block_t * ce_info,
|
|||
conditional execution register from a comparison, it can do so here. */
|
||||
IFCVT_MODIFY_TESTS (ce_info, true_expr, false_expr);
|
||||
|
||||
/* See if the conversion failed */
|
||||
/* See if the conversion failed. */
|
||||
if (!true_expr || !false_expr)
|
||||
goto fail;
|
||||
#endif
|
||||
|
|
@ -521,7 +521,7 @@ cond_exec_process_if_block (ce_if_block_t * ce_info,
|
|||
#ifdef IFCVT_MODIFY_MULTIPLE_TESTS
|
||||
IFCVT_MODIFY_MULTIPLE_TESTS (ce_info, bb, t, f);
|
||||
|
||||
/* See if the conversion failed */
|
||||
/* See if the conversion failed. */
|
||||
if (!t || !f)
|
||||
goto fail;
|
||||
#endif
|
||||
|
|
@ -563,7 +563,7 @@ cond_exec_process_if_block (ce_if_block_t * ce_info,
|
|||
}
|
||||
|
||||
#ifdef IFCVT_MODIFY_FINAL
|
||||
/* Do any machine dependent final modifications */
|
||||
/* Do any machine dependent final modifications. */
|
||||
IFCVT_MODIFY_FINAL (ce_info);
|
||||
#endif
|
||||
|
||||
|
|
|
|||
|
|
@ -69,15 +69,15 @@ typedef unsigned int UQItype __attribute__ ((mode (QI)));
|
|||
typedef int HItype __attribute__ ((mode (HI)));
|
||||
typedef unsigned int UHItype __attribute__ ((mode (HI)));
|
||||
#if MIN_UNITS_PER_WORD > 1
|
||||
/* These typedefs are usually forbidden on dsp's with UNITS_PER_WORD 1 */
|
||||
/* These typedefs are usually forbidden on dsp's with UNITS_PER_WORD 1. */
|
||||
typedef int SItype __attribute__ ((mode (SI)));
|
||||
typedef unsigned int USItype __attribute__ ((mode (SI)));
|
||||
#if LONG_LONG_TYPE_SIZE > 32
|
||||
/* These typedefs are usually forbidden on archs with UNITS_PER_WORD 2 */
|
||||
/* These typedefs are usually forbidden on archs with UNITS_PER_WORD 2. */
|
||||
typedef int DItype __attribute__ ((mode (DI)));
|
||||
typedef unsigned int UDItype __attribute__ ((mode (DI)));
|
||||
#if MIN_UNITS_PER_WORD > 4
|
||||
/* These typedefs are usually forbidden on archs with UNITS_PER_WORD 4 */
|
||||
/* These typedefs are usually forbidden on archs with UNITS_PER_WORD 4. */
|
||||
typedef int TItype __attribute__ ((mode (TI)));
|
||||
typedef unsigned int UTItype __attribute__ ((mode (TI)));
|
||||
#endif
|
||||
|
|
|
|||
|
|
@ -5654,7 +5654,7 @@ record_biv (struct loop *loop, struct induction *v, rtx insn, rtx dest_reg,
|
|||
/* Set initial value to the reg itself. */
|
||||
bl->initial_value = dest_reg;
|
||||
bl->final_value = 0;
|
||||
/* We haven't seen the initializing insn yet */
|
||||
/* We haven't seen the initializing insn yet. */
|
||||
bl->init_insn = 0;
|
||||
bl->init_set = 0;
|
||||
bl->initial_test = 0;
|
||||
|
|
|
|||
|
|
@ -39,7 +39,7 @@ enum prediction
|
|||
extern void predict_insn_def (rtx, enum br_predictor, enum prediction);
|
||||
extern void predict_insn (rtx, enum br_predictor, int);
|
||||
|
||||
/* Avoid unneeded dependency on basic_block.h */
|
||||
/* Avoid unneeded dependency on basic_block.h. */
|
||||
#ifdef BASIC_BLOCK
|
||||
extern void predict_edge (edge, enum br_predictor, int);
|
||||
extern void predict_edge_def (edge, enum br_predictor, enum prediction);
|
||||
|
|
|
|||
|
|
@ -126,7 +126,7 @@ _Unwind_SetGR (struct _Unwind_Context *context, int index, _Unwind_Word val)
|
|||
unw_set_reg (&context->cursor, index, val);
|
||||
#ifdef UNW_TARGET_IA64
|
||||
if (index >= UNW_IA64_GR && index <= UNW_IA64_GR + 127)
|
||||
/* Clear the NaT bit. */
|
||||
/* Clear the NaT bit. */
|
||||
unw_set_reg (&context->cursor, UNW_IA64_NAT + (index - UNW_IA64_GR), 0);
|
||||
#endif
|
||||
}
|
||||
|
|
|
|||
|
|
@ -1135,7 +1135,7 @@ assemble_start_function (tree decl, const char *fnname)
|
|||
maybe_assemble_visibility (decl);
|
||||
}
|
||||
|
||||
/* Do any machine/system dependent processing of the function name */
|
||||
/* Do any machine/system dependent processing of the function name. */
|
||||
#ifdef ASM_DECLARE_FUNCTION_NAME
|
||||
ASM_DECLARE_FUNCTION_NAME (asm_out_file, fnname, current_function_decl);
|
||||
#else
|
||||
|
|
|
|||
Loading…
Reference in New Issue