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

c-decl.c: Fix a comment typo. 

* c-decl.c: Fix a comment typo.
	* cfg.c: Likewise.
	* cfgcleanup.c: Likewise.
	* cfglayout.c: Likewise.
	* cfgrtl.c: Likewise.
	* c-typeck.c: Likewise.
	* dominance.c: Likewise.
	* dwarf2asm.c: Likewise.
	* dwarfout.c: Likewise.
	* expmed.c: Likewise.
	* expr.c: Likewise.
	* final.c: Likewise.
	* flow.c: Likewise.
	* function.c: Likewise.
	* gcc.c: Likewise.
	* genautomata.c: Likewise.
	* integrate.c: Likewise.
	* loop.c: Likewise.
	* loop.h: Likewise.
	* output.h: Likewise.
	* profile.c: Likewise.
	* ra.h: Likewise.
	* reload1.c: Likewise.
	* reload.c: Likewise.
	* sched-rgn.c: Likewise.
	* stmt.c: Likewise.
	* tree.h: Likewise.
	* vmsdbgout.c: Likewise.

From-SVN: r60085
This commit is contained in:
Kazu Hirata 2002-12-13 00:17:22 +00:00 committed by Kazu Hirata
parent 7930523de8
commit 09da15320b
29 changed files with 68 additions and 37 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

31
gcc/ChangeLog
View File

@ -1,3 +1,34 @@
2002-12-12 Kazu Hirata <kazu@cs.umass.edu>
* c-decl.c: Fix a comment typo.
* cfg.c: Likewise.
* cfgcleanup.c: Likewise.
* cfglayout.c: Likewise.
* cfgrtl.c: Likewise.
* c-typeck.c: Likewise.
* dominance.c: Likewise.
* dwarf2asm.c: Likewise.
* dwarfout.c: Likewise.
* expmed.c: Likewise.
* expr.c: Likewise.
* final.c: Likewise.
* flow.c: Likewise.
* function.c: Likewise.
* gcc.c: Likewise.
* genautomata.c: Likewise.
* integrate.c: Likewise.
* loop.c: Likewise.
* loop.h: Likewise.
* output.h: Likewise.
* profile.c: Likewise.
* ra.h: Likewise.
* reload1.c: Likewise.
* reload.c: Likewise.
* sched-rgn.c: Likewise.
* stmt.c: Likewise.
* tree.h: Likewise.
* vmsdbgout.c: Likewise.
2002-12-12 Kazu Hirata <kazu@cs.umass.edu>
* config/h8300/h8300.md: Add a new peephole2.

2
gcc/c-decl.c
View File

@ -1726,7 +1726,7 @@ pushdecl (x)
}
/* If we are processing a typedef statement, generate a whole new
..._TYPE node (which will be just an variant of the existing
..._TYPE node (which will be just a variant of the existing
..._TYPE node with identical properties) and then install the
TYPE_DECL node generated to represent the typedef name as the
TYPE_NAME of this brand new (duplicate) ..._TYPE node.

4
gcc/c-typeck.c
View File

@ -5214,7 +5214,7 @@ really_start_incremental_init (type)
constructor_max_index = build_int_2 (-1, -1);
/* constructor_max_index needs to be an INTEGER_CST. Attempts
to initialize VLAs will cause an proper error; avoid tree
to initialize VLAs will cause a proper error; avoid tree
checking errors as well by setting a safe value. */
if (constructor_max_index
&& TREE_CODE (constructor_max_index) != INTEGER_CST)
@ -5404,7 +5404,7 @@ push_init_level (implicit)
constructor_max_index = build_int_2 (-1, -1);
/* constructor_max_index needs to be an INTEGER_CST. Attempts
to initialize VLAs will cause an proper error; avoid tree
to initialize VLAs will cause a proper error; avoid tree
checking errors as well by setting a safe value. */
if (constructor_max_index
&& TREE_CODE (constructor_max_index) != INTEGER_CST)

4
gcc/cfg.c
View File

@ -684,7 +684,7 @@ static void *first_block_aux_obj = 0;
static struct obstack edge_aux_obstack;
static void *first_edge_aux_obj = 0;
/* Allocate an memory block of SIZE as BB->aux. The obstack must
/* Allocate a memory block of SIZE as BB->aux. The obstack must
be first initialized by alloc_aux_for_blocks. */
inline void
@ -752,7 +752,7 @@ free_aux_for_blocks ()
clear_aux_for_blocks ();
}
/* Allocate an memory edge of SIZE as BB->aux. The obstack must
/* Allocate a memory edge of SIZE as BB->aux. The obstack must
be first initialized by alloc_aux_for_edges. */
inline void

2
gcc/cfgcleanup.c
View File

@ -1246,7 +1246,7 @@ outgoing_edges_match (mode, bb1, bb2)
return match;
}
/* Generic case - we are seeing an computed jump, table jump or trapping
/* Generic case - we are seeing a computed jump, table jump or trapping
instruction. */
/* First ensure that the instructions match. There may be many outgoing

4
gcc/cfglayout.c
View File

@ -708,7 +708,7 @@ cfg_layout_can_duplicate_bb_p (bb)
if (bb == EXIT_BLOCK_PTR || bb == ENTRY_BLOCK_PTR)
return false;
/* Duplicating fallthru block to exit would require adding an jump
/* Duplicating fallthru block to exit would require adding a jump
and splitting the real last BB. */
for (s = bb->succ; s; s = s->succ_next)
if (s->dest == EXIT_BLOCK_PTR && s->flags & EDGE_FALLTHRU)
@ -862,7 +862,7 @@ cfg_layout_redirect_edge (e, dest)
src->next_bb = old_next_bb;
}
/* Create an duplicate of the basic block BB and redirect edge E into it. */
/* Create a duplicate of the basic block BB and redirect edge E into it. */
basic_block
cfg_layout_duplicate_bb (bb, e)

2
gcc/cfgrtl.c
View File

@ -793,7 +793,7 @@ try_redirect_by_replacing_jump (e, target)
/* Return last loop_beg note appearing after INSN, before start of next
basic block. Return INSN if there are no such notes.
When emitting jump to redirect an fallthru edge, it should always appear
When emitting jump to redirect a fallthru edge, it should always appear
after the LOOP_BEG notes, as loop optimizer expect loop to either start by
fallthru edge or jump following the LOOP_BEG note jumping to the loop exit
test. */

2
gcc/dominance.c
View File

@ -101,7 +101,7 @@ struct dom_info
number of that node in DFS order counted from 1. This is an index
into most of the other arrays in this structure. */
TBB *dfs_order;
/* If x is the DFS-index of a node which corresponds with an basic block,
/* If x is the DFS-index of a node which corresponds with a basic block,
dfs_to_bb[x] is that basic block. Note, that in our structure there are
more nodes that basic blocks, so only dfs_to_bb[dfs_order[bb->index]]==bb
is true for every basic block bb, but not the opposite. */

2
gcc/dwarf2asm.c
View File

@ -564,7 +564,7 @@ dw2_asm_output_data_uleb128 VPARAMS ((unsigned HOST_WIDE_INT value,
VA_CLOSE (ap);
}
/* Output an signed LEB128 quantity. */
/* Output a signed LEB128 quantity. */
void
dw2_asm_output_data_sleb128 VPARAMS ((HOST_WIDE_INT value,

2
gcc/dwarfout.c
View File

@ -162,7 +162,7 @@ Software Foundation, 59 Temple Place - Suite 330, Boston, MA
is required by the current DWARF draft specification.
Specifically, the current DWARF draft specification seems to require that
the type of an non-unsigned integral bit-field member of a struct or union
the type of a non-unsigned integral bit-field member of a struct or union
type be represented as either a "signed" type or as a "plain" type,
depending upon the exact set of keywords that were used in the
type specification for the given bit-field member. It was felt (by the

2
gcc/expmed.c
View File

@ -2922,7 +2922,7 @@ expand_mult_highpart (mode, op0, cnst1, target, unsignedp, max_cost)
the result is exact for inputs up to 0x1fffffff.
The input range can be reduced by using cross-sum rules.
For odd divisors >= 3, the following table gives right shift counts
so that if an number is shifted by an integer multiple of the given
so that if a number is shifted by an integer multiple of the given
amount, the remainder stays the same:
2, 4, 3, 6, 10, 12, 4, 8, 18, 6, 11, 20, 18, 0, 5, 10, 12, 0, 12, 20,
14, 12, 23, 21, 8, 0, 20, 18, 0, 0, 6, 12, 0, 22, 0, 18, 20, 30, 0, 0,

2
gcc/expr.c
View File

@ -4358,7 +4358,7 @@ store_expr (exp, target, want_value)
dont_return_target = 1;
}
else if (GET_CODE (target) == SUBREG && SUBREG_PROMOTED_VAR_P (target))
/* If this is an scalar in a register that is stored in a wider mode
/* If this is a scalar in a register that is stored in a wider mode
than the declared mode, compute the result into its declared mode
and then convert to the wider mode. Our value is the computed
expression. */

4
gcc/final.c
View File

@ -994,7 +994,7 @@ compute_alignments ()
}
}
/* In case block is frequent and reached mostly by non-fallthru edge,
align it. It is most likely an first block of loop. */
align it. It is most likely a first block of loop. */
if (has_fallthru
&& branch_frequency + fallthru_frequency > BB_FREQ_MAX / 10
&& branch_frequency > fallthru_frequency * 2)
@ -4011,7 +4011,7 @@ leaf_function_p ()
return 1;
}
/* Return 1 if branch is an forward branch.
/* Return 1 if branch is a forward branch.
Uses insn_shuid array, so it works only in the final pass. May be used by
output templates to customary add branch prediction hints.
*/

2
gcc/flow.c
View File

@ -1380,7 +1380,7 @@ calculate_global_regs_live (blocks_in, blocks_out, flags)
}
/* This structure is used to pass parameters to an from the
/* This structure is used to pass parameters to and from the
the function find_regno_partial(). It is used to pass in the
register number we are looking, as well as to return any rtx
we find. */

2
gcc/function.c
View File

@ -2380,7 +2380,7 @@ fixup_var_refs_1 (var, promoted_mode, loc, insn, replacements, no_share)
copy SET_SRC (x) to SET_DEST (x) in some way. So
we generate the move and see whether it requires more
than one insn. If it does, we emit those insns and
delete INSN. Otherwise, we an just replace the pattern
delete INSN. Otherwise, we can just replace the pattern
of INSN; we have already verified above that INSN has
no other function that to do X. */

4
gcc/gcc.c
View File

@ -420,7 +420,7 @@ or with constant text in a single argument.
and substitute the full name found.
%eSTR Print STR as an error message. STR is terminated by a newline.
Use this when inconsistent options are detected.
%nSTR Print STR as an notice. STR is terminated by a newline.
%nSTR Print STR as a notice. STR is terminated by a newline.
%x{OPTION} Accumulate an option for %X.
%X Output the accumulated linker options specified by compilations.
%Y Output the accumulated assembler options specified by compilations.
@ -4399,7 +4399,7 @@ do_spec_1 (spec, inswitch, soft_matched_part)
}
break;
case 'n':
/* %nfoo means report an notice with `foo' on stderr. */
/* %nfoo means report a notice with `foo' on stderr. */
{
const char *q = p;
char *buf;

4
gcc/genautomata.c
View File

@ -2492,7 +2492,7 @@ add_excls (dest_list, source_list, excl_pos)
}
}
/* Checking NAMES in an presence clause vector and returning formed
/* Checking NAMES in a presence clause vector and returning formed
unit_set_el_list. The function is called only after processing all
exclusion sets. */
static unit_set_el_t
@ -4531,7 +4531,7 @@ get_excl_set (in_set)
/* The page contains abstract data for work with presence/absence sets
(see presence_set/absence_set in file rtl.def). */
/* The following variables refer to correspondingly an presence and an
/* The following variables refer to correspondingly a presence and an
absence set returned by get_presence_absence_set. This is bit
string of length equal to cpu units number. */
static reserv_sets_t presence_set, absence_set;

2
gcc/integrate.c
View File

@ -861,7 +861,7 @@ expand_inline_function (fndecl, parms, target, ignore, type,
??? These numbers are quite arbitrary and were obtained by
experimentation. At some point, we should try to allocate the
table after all the parameters are set up so we an more accurately
table after all the parameters are set up so we can more accurately
estimate the number of pseudos we will need. */
VARRAY_CONST_EQUIV_INIT (map->const_equiv_varray,

2
gcc/loop.c
View File

@ -2884,7 +2884,7 @@ find_and_verify_loops (f, loops)
/* If no suitable BARRIER was found, create a suitable
one before TARGET. Since TARGET is a fall through
path, we'll need to insert an jump around our block
path, we'll need to insert a jump around our block
and add a BARRIER before TARGET.
This creates an extra unconditional jump outside

2
gcc/loop.h
View File

@ -248,7 +248,7 @@ struct loop_reg
During code motion, a negative value indicates a reg that has
been made a candidate; in particular -2 means that it is an
candidate that we know is equal to a constant and -1 means that
it is an candidate not known equal to a constant. After code
it is a candidate not known equal to a constant. After code
motion, regs moved have 0 (which is accurate now) while the
failed candidates have the original number of times set.

2
gcc/output.h
View File

@ -118,7 +118,7 @@ extern void split_double PARAMS ((rtx, rtx *, rtx *));
/* Return nonzero if this function has no function calls. */
extern int leaf_function_p PARAMS ((void));
/* Return 1 if branch is an forward branch.
/* Return 1 if branch is a forward branch.
Uses insn_shuid array, so it works only in the final pass. May be used by
output templates to add branch prediction hints, for example. */
extern int final_forward_branch_p PARAMS ((rtx));

6
gcc/profile.c
View File

@ -1109,7 +1109,7 @@ union_groups (bb1, bb2)
/* This function searches all of the edges in the program flow graph, and puts
as many bad edges as possible onto the spanning tree. Bad edges include
abnormals edges, which can't be instrumented at the moment. Since it is
possible for fake edges to form an cycle, we will have to develop some
possible for fake edges to form a cycle, we will have to develop some
better way in the future. Also put critical edges to the tree, since they
are more expensive to instrument. */
@ -1128,7 +1128,7 @@ find_spanning_tree (el)
/* Add fake edge exit to entry we can't instrument. */
union_groups (EXIT_BLOCK_PTR, ENTRY_BLOCK_PTR);
/* First add all abnormal edges to the tree unless they form an cycle. Also
/* First add all abnormal edges to the tree unless they form a cycle. Also
add all edges to EXIT_BLOCK_PTR to avoid inserting profiling code behind
setting return value from function. */
for (i = 0; i < num_edges; i++)
@ -1148,7 +1148,7 @@ find_spanning_tree (el)
}
}
/* Now insert all critical edges to the tree unless they form an cycle. */
/* Now insert all critical edges to the tree unless they form a cycle. */
for (i = 0; i < num_edges; i++)
{
edge e = INDEX_EDGE (el, i);

2
gcc/ra.h
View File

@ -303,7 +303,7 @@ struct web_link
struct web *web;
};
/* A subconflict is part of an conflict edge to track precisely,
/* A subconflict is part of a conflict edge to track precisely,
which parts of two webs conflict, in case not all of both webs do. */
struct sub_conflict
{

4
gcc/reload.c
View File

@ -2143,13 +2143,13 @@ operands_match_p (x, y)
/* If two operands must match, because they are really a single
operand of an assembler insn, then two postincrements are invalid
because the assembler insn would increment only once.
On the other hand, an postincrement matches ordinary indexing
On the other hand, a postincrement matches ordinary indexing
if the postincrement is the output operand. */
if (code == POST_DEC || code == POST_INC || code == POST_MODIFY)
return operands_match_p (XEXP (x, 0), y);
/* Two preincrements are invalid
because the assembler insn would increment only once.
On the other hand, an preincrement matches ordinary indexing
On the other hand, a preincrement matches ordinary indexing
if the preincrement is the input operand.
In this case, return 2, since some callers need to do special
things when this happens. */

2
gcc/reload1.c
View File

@ -9464,7 +9464,7 @@ fixup_abnormal_edges ()
{
edge e;
/* Look for cases we are interested in - an calls or instructions causing
/* Look for cases we are interested in - calls or instructions causing
exceptions. */
for (e = bb->succ; e; e = e->succ_next)
{

2
gcc/sched-rgn.c
View File

@ -637,7 +637,7 @@ find_rgns (edge_list, dom)
/* Note if a block is a natural loop header. */
sbitmap header;
/* Note if a block is an natural inner loop header. */
/* Note if a block is a natural inner loop header. */
sbitmap inner;
/* Note if a block is in the block queue. */

2
gcc/stmt.c
View File

@ -5244,7 +5244,7 @@ expand_end_case_type (orig_index, orig_type)
do_pending_stack_adjust ();
/* This might get an spurious warning in the presence of a syntax error;
/* This might get a spurious warning in the presence of a syntax error;
it could be fixed by moving the call to check_seenlabel after the
check for error_mark_node, and copying the code of check_seenlabel that
deals with case_stack->data.case_stmt.line_number_status /

2
gcc/tree.h
View File

@ -457,7 +457,7 @@ extern void tree_vec_elt_check_failed PARAMS ((int, int, const char *,
is sufficient to check bounds at the time the reference is seated,
and assume that all future uses of the reference are safe, since
the address of references cannot change. (2) When a reference
supertype is seated to an subtype object. The bounds "remember"
supertype is seated to a subtype object. The bounds "remember"
the true size of the complete object, so that subsequent upcasts of
the address of the reference will be checked properly (is such a
thing valid C++?). */

2
gcc/vmsdbgout.c
View File

@ -84,7 +84,7 @@ dst_file_info_entry;
#define PTR_SIZE 4 /* Must be 32 bits for VMS debug info */
#endif
/* Pointer to an structure of filenames referenced by this compilation unit. */
/* Pointer to a structure of filenames referenced by this compilation unit. */
static dst_file_info_ref file_info_table;
/* Total number of entries in the table (i.e. array) pointed to by