procyberian/gcc
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

cgraph.c: Fix typos in comments.

Browse source 
gcc/
	* cgraph.c: Fix typos in comments.
	(cgraph_availability_names): Fix string typo.
	* fold-const.c: Fix typos in comments.
	(fold_binary): Fix typo in warning.
	* genautomata.c: Fix typos in comments.
	(check_presence_pattern_sets): Fix typo in local variable.
	(output_description): Fix typo in output.
	* ggc-zone.c (ggc_pch_finish): Fix typo in error message.
	* hwint.h: Likewise.
	* matrix-reorg.c (check_allocation_function): Likewise.
	* omega.c (smooth_weird_equations): Likewise.
	* auto-inc-dec.c: Fix typos in comments.
	* bb-reorder.c: Likewise.
	* builtins.c: Likewise.
	* c-common.c: Likewise.
	* c-cppbuiltin.c: Likewise.
	* c-parser.c: Likewise.
	* c-pretty-print.c: Likewise.
	* cfgcleanup.c: Likewise.
	* cfgexpand.c: Likewise.
	* cfghooks.c: Likewise.
	* cfglayout.c: Likewise.
	* cfgloopmanip.c: Likewise.
	* cgraphunit.c: Likewise.
	* coverage.c: Likewise.
	* dbxout.c: Likewise.
	* df-byte-scan.c: Likewise.
	* df-core.c: Likewise.
	* df-problems.c: Likewise.
	* df-scan.c: Likewise.
	* dfp.c: Likewise.
	* dominance.c: Likewise.
	* domwalk.c: Likewise.
	* dse.c: Likewise.
	* dwarf2out.c: Likewise.
	* emit-rtl.c: Likewise.
	* et-forest.c: Likewise.
	* function.c: Likewise.
	* function.h: Likewise.
	* gcc.c: Likewise.
	* gcov-io.c: Likewise.
	* gcov.c: Likewise.
	* gcse.c: Likewise.
	* genattrtab.c: Likewise.
	* ggc-page.c: Likewise.
	* gimplify.c: Likewise.
	* gthr-lynx.h: Likewise.
	* haifa-sched.c: Likewise.
	* ipa-cp.c: Likewise.
	* ipa-inline.c: Likewise.
	* ipa-prop.h: Likewise.
	* ipa-pure-const.c: Likewise.
	* ipa-struct-reorg.c: Likewise.
	* ipa-struct-reorg.h: Likewise.
	* ipa-type-escape.c: Likewise.
	* ipa.c: Likewise.
	* loop-doloop.c: Likewise.
	* mips-tfile.c: Likewise.
	* mkmap-flat.awk: Likewise.
	* mkmap-symver.awk: Likewise.
	* modulo-sched.c: Likewise.
	* omp-low.c: Likewise.
	* optabs.c: Likewise.
	* optabs.h: Likewise.
	* opts.c: Likewise.
	* passes.c: Likewise.
	* postreload-gcse.c: Likewise.
	* postreload.c: Likewise.
	* predict.c: Likewise.
	* pretty-print.h: Likewise.
	* profile.c: Likewise.
	* protoize.c: Likewise.
	* ra-conflict.c: Likewise.
	* real.c: Likewise.
	* recog.c: Likewise.
	* regclass.c: Likewise.
	* regs.h: Likewise.
	* reload.c: Likewise.
	* rtl-error.c: Likewise.
	* rtlanal.c: Likewise.
	* scan.h: Likewise.
	* sched-rgn.c: Likewise.
	* see.c: Likewise.
	* stmt.c: Likewise.
	* target.h: Likewise.
	* tree-dfa.c: Likewise.
	* tree-eh.c: Likewise.
	* tree-flow-inline.h: Likewise.
	* tree-inline.c: Likewise.
	* tree-into-ssa.c: Likewise.
	* tree-loop-distribution.c: Likewise.
	* tree-nested.c: Likewise.
	* tree-parloops.c: Likewise.
	* tree-pass.h: Likewise.
	* tree-pretty-print.c: Likewise.
	* tree-profile.c: Likewise.
	* tree-scalar-evolution.c: Likewise.
	* tree-sra.c: Likewise.
	* tree-ssa-alias-warnings.c: Likewise.
	* tree-ssa-ccp.c: Likewise.
	* tree-ssa-coalesce.c: Likewise.
	* tree-ssa-dom.c: Likewise.
	* tree-ssa-dse.c: Likewise.
	* tree-ssa-forwprop.c: Likewise.
	* tree-ssa-live.c: Likewise.
	* tree-ssa-live.h: Likewise.
	* tree-ssa-loop-im.c: Likewise.
	* tree-ssa-loop-ivopts.c: Likewise.
	* tree-ssa-loop-niter.c: Likewise.
	* tree-ssa-loop-prefetch.c: Likewise.
	* tree-ssa-phiopt.c: Likewise.
	* tree-ssa-phiprop.c: Likewise.
	* tree-ssa-sccvn.c: Likewise.
	* tree-ssa-ter.c: Likewise.
	* tree-ssa-threadupdate.c: Likewise.
	* tree-ssa.c: Likewise.
	* tree-vect-analyze.c: Likewise.
	* tree-vect-transform.c: Likewise.
	* tree-vectorizer.c: Likewise.
	* tree-vn.c: Likewise.
	* tree-vrp.c: Likewise.
	* tree.c: Likewise.
	* tree.def: Likewise.
	* tree.h: Likewise.
	* unwind-dw2-fde.c: Likewise.
	* unwind.inc: Likewise.
	* value-prof.c: Likewise.
	* vmsdbgout.c: Likewise.

From-SVN: r136425
This commit is contained in:
Ralf Wildenhues 2008-06-06 05:42:00 +00:00 • committed by Ralf Wildenhues
parent 6bf2f78acc
commit fa10beec52
125 changed files with 503 additions and 342 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

131
gcc/ChangeLog
View file

@ -1,3 +1,134 @@
2008-06-06 Ralf Wildenhues <Ralf.Wildenhues@gmx.de>
* cgraph.c: Fix typos in comments.
(cgraph_availability_names): Fix string typo.
* fold-const.c: Fix typos in comments.
(fold_binary): Fix typo in warning.
* genautomata.c: Fix typos in comments.
(check_presence_pattern_sets): Fix typo in local variable.
(output_description): Fix typo in output.
* ggc-zone.c (ggc_pch_finish): Fix typo in error message.
* hwint.h: Likewise.
* matrix-reorg.c (check_allocation_function): Likewise.
* omega.c (smooth_weird_equations): Likewise.
* auto-inc-dec.c: Fix typos in comments.
* bb-reorder.c: Likewise.
* builtins.c: Likewise.
* c-common.c: Likewise.
* c-cppbuiltin.c: Likewise.
* c-parser.c: Likewise.
* c-pretty-print.c: Likewise.
* cfgcleanup.c: Likewise.
* cfgexpand.c: Likewise.
* cfghooks.c: Likewise.
* cfglayout.c: Likewise.
* cfgloopmanip.c: Likewise.
* cgraphunit.c: Likewise.
* coverage.c: Likewise.
* dbxout.c: Likewise.
* df-byte-scan.c: Likewise.
* df-core.c: Likewise.
* df-problems.c: Likewise.
* df-scan.c: Likewise.
* dfp.c: Likewise.
* dominance.c: Likewise.
* domwalk.c: Likewise.
* dse.c: Likewise.
* dwarf2out.c: Likewise.
* emit-rtl.c: Likewise.
* et-forest.c: Likewise.
* function.c: Likewise.
* function.h: Likewise.
* gcc.c: Likewise.
* gcov-io.c: Likewise.
* gcov.c: Likewise.
* gcse.c: Likewise.
* genattrtab.c: Likewise.
* ggc-page.c: Likewise.
* gimplify.c: Likewise.
* gthr-lynx.h: Likewise.
* haifa-sched.c: Likewise.
* ipa-cp.c: Likewise.
* ipa-inline.c: Likewise.
* ipa-prop.h: Likewise.
* ipa-pure-const.c: Likewise.
* ipa-struct-reorg.c: Likewise.
* ipa-struct-reorg.h: Likewise.
* ipa-type-escape.c: Likewise.
* ipa.c: Likewise.
* loop-doloop.c: Likewise.
* mips-tfile.c: Likewise.
* mkmap-flat.awk: Likewise.
* mkmap-symver.awk: Likewise.
* modulo-sched.c: Likewise.
* omp-low.c: Likewise.
* optabs.c: Likewise.
* optabs.h: Likewise.
* opts.c: Likewise.
* passes.c: Likewise.
* postreload-gcse.c: Likewise.
* postreload.c: Likewise.
* predict.c: Likewise.
* pretty-print.h: Likewise.
* profile.c: Likewise.
* protoize.c: Likewise.
* ra-conflict.c: Likewise.
* real.c: Likewise.
* recog.c: Likewise.
* regclass.c: Likewise.
* regs.h: Likewise.
* reload.c: Likewise.
* rtl-error.c: Likewise.
* rtlanal.c: Likewise.
* scan.h: Likewise.
* sched-rgn.c: Likewise.
* see.c: Likewise.
* stmt.c: Likewise.
* target.h: Likewise.
* tree-dfa.c: Likewise.
* tree-eh.c: Likewise.
* tree-flow-inline.h: Likewise.
* tree-inline.c: Likewise.
* tree-into-ssa.c: Likewise.
* tree-loop-distribution.c: Likewise.
* tree-nested.c: Likewise.
* tree-parloops.c: Likewise.
* tree-pass.h: Likewise.
* tree-pretty-print.c: Likewise.
* tree-profile.c: Likewise.
* tree-scalar-evolution.c: Likewise.
* tree-sra.c: Likewise.
* tree-ssa-alias-warnings.c: Likewise.
* tree-ssa-ccp.c: Likewise.
* tree-ssa-coalesce.c: Likewise.
* tree-ssa-dom.c: Likewise.
* tree-ssa-dse.c: Likewise.
* tree-ssa-forwprop.c: Likewise.
* tree-ssa-live.c: Likewise.
* tree-ssa-live.h: Likewise.
* tree-ssa-loop-im.c: Likewise.
* tree-ssa-loop-ivopts.c: Likewise.
* tree-ssa-loop-niter.c: Likewise.
* tree-ssa-loop-prefetch.c: Likewise.
* tree-ssa-phiopt.c: Likewise.
* tree-ssa-phiprop.c: Likewise.
* tree-ssa-sccvn.c: Likewise.
* tree-ssa-ter.c: Likewise.
* tree-ssa-threadupdate.c: Likewise.
* tree-ssa.c: Likewise.
* tree-vect-analyze.c: Likewise.
* tree-vect-transform.c: Likewise.
* tree-vectorizer.c: Likewise.
* tree-vn.c: Likewise.
* tree-vrp.c: Likewise.
* tree.c: Likewise.
* tree.def: Likewise.
* tree.h: Likewise.
* unwind-dw2-fde.c: Likewise.
* unwind.inc: Likewise.
* value-prof.c: Likewise.
* vmsdbgout.c: Likewise.
2008-06-05 David Edelsohn <edelsohn@gnu.org>
* config/rs6000/xcoff.h (ASM_OUTPUT_SPECIAL_POOL_ENTRY_P): Do not

4
gcc/auto-inc-dec.c
View file

@ -1,5 +1,5 @@
/* Discovery of auto-inc and auto-dec instructions.
Copyright (C) 2006, 2007 Free Software Foundation, Inc.
Copyright (C) 2006, 2007, 2008 Free Software Foundation, Inc.
Contributed by Kenneth Zadeck <zadeck@naturalbridge.com>
This file is part of GCC.
@ -636,7 +636,7 @@ attempt_change (rtx new_addr, rtx inc_reg)
/* Try to combine the instruction in INC_INSN with the instruction in
MEM_INSN. First the form is determined using the DECISION_TABLE
and and the results of parsing the INC_INSN and the MEM_INSN.
and the results of parsing the INC_INSN and the MEM_INSN.
Assuming the form is ok, a prototype new address is built which is
passed to ATTEMPT_CHANGE for final processing. */

4
gcc/bb-reorder.c
View file

@ -1,5 +1,5 @@
/* Basic block reordering routines for the GNU compiler.
Copyright (C) 2000, 2002, 2003, 2004, 2005, 2006, 2007
Copyright (C) 2000, 2002, 2003, 2004, 2005, 2006, 2007, 2008
Free Software Foundation, Inc.
This file is part of GCC.
@ -1490,7 +1490,7 @@ fix_up_fall_thru_edges (void)
}
}
/* This function checks the destination blockof a "crossing jump" to
/* This function checks the destination block of a "crossing jump" to
see if it has any crossing predecessors that begin with a code label
and end with an unconditional jump. If so, it returns that predecessor
block. (This is to avoid creating lots of new basic blocks that all

8
gcc/builtins.c
View file

@ -1,6 +1,6 @@
/* Expand builtin functions.
Copyright (C) 1988, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999,
2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007
2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008
Free Software Foundation, Inc.
This file is part of GCC.
@ -4783,7 +4783,7 @@ std_gimplify_va_arg_expr (tree valist, tree type, tree *pre_p, tree *post_p)
/* If the actual alignment is less than the alignment of the type,
adjust the type accordingly so that we don't assume strict alignment
when deferencing the pointer. */
when dereferencing the pointer. */
boundary *= BITS_PER_UNIT;
if (boundary < TYPE_ALIGN (type))
{
@ -8768,9 +8768,9 @@ fold_builtin_memory_op (tree dest, tree src, tree len, tree type, bool ignore, i
if (!tree_int_cst_equal (lang_hooks.expr_size (srcvar), len))
return NULL_TREE;
/* With memcpy, it is possible to bypass aliasing rules, so without
this check i. e. execute/20060930-2.c would be misoptimized, because
this check i.e. execute/20060930-2.c would be misoptimized, because
it use conflicting alias set to hold argument for the memcpy call.
This check is probably unnecesary with -fno-strict-aliasing.
This check is probably unnecessary with -fno-strict-aliasing.
Similarly for destvar. See also PR29286. */
if (!var_decl_component_p (srcvar)
/* Accept: memcpy (*char_var, "test", 1); that simplify

6
gcc/c-common.c
View file

@ -221,7 +221,7 @@ tree c_global_trees[CTI_MAX];
/* Switches common to the C front ends. */
/* Nonzero if prepreprocessing only. */
/* Nonzero if preprocessing only. */
int flag_preprocess_only;
@ -360,7 +360,7 @@ int flag_gen_declaration;
int print_struct_values;
/* Tells the compiler what is the constant string class for Objc. */
/* Tells the compiler what is the constant string class for ObjC. */
const char *constant_string_class_name;
@ -4496,7 +4496,7 @@ c_do_switch_warnings (splay_tree cases, location_t switch_location,
}
/* Even though there wasn't an exact match, there might be a
case range which includes the enumator's value. */
case range which includes the enumerator's value. */
node = splay_tree_predecessor (cases, (splay_tree_key) value);
if (node && CASE_HIGH ((tree) node->value))
{

4
gcc/c-cppbuiltin.c
View file

@ -1,5 +1,5 @@
/* Define builtin-in macros for the C family front ends.
Copyright (C) 2002, 2003, 2004, 2005, 2006, 2007
Copyright (C) 2002, 2003, 2004, 2005, 2006, 2007, 2008
Free Software Foundation, Inc.
This file is part of GCC.
@ -301,7 +301,7 @@ builtin_define_decimal_float_constants (const char *name_prefix,
sprintf (buf, "1E-%d%s", fmt->p - 1, suffix);
builtin_define_with_value (name, buf, 0);
/* Minimum denormalized postive decimal value. */
/* Minimum denormalized positive decimal value. */
sprintf (name, "__%s_DEN__", name_prefix);
p = buf;
for (digits = fmt->p; digits > 1; digits--)

2
gcc/c-parser.c
View file

@ -7522,7 +7522,7 @@ c_parser_omp_flush (c_parser *parser)
c_finish_omp_flush ();
}
/* Parse the restricted form of the for statment allowed by OpenMP.
/* Parse the restricted form of the for statement allowed by OpenMP.
The real trick here is to determine the loop control variable early
so that we can push a new decl if necessary to make it private. */

4
gcc/c-pretty-print.c
View file

@ -1019,7 +1019,7 @@ pp_c_constant (c_pretty_printer *pp, tree e)
case COMPLEX_CST:
/* Sometimes, we are confused and we think a complex literal
is a constant. Such thing is a compound literal which
grammatically belongs to postifx-expr production. */
grammatically belongs to postfix-expr production. */
pp_c_compound_literal (pp, e);
break;
@ -1096,7 +1096,7 @@ pp_c_primary_expression (c_pretty_printer *pp, tree e)
break;
default:
/* FIXME: Make sure we won't get into an infinie loop. */
/* FIXME: Make sure we won't get into an infinite loop. */
pp_c_left_paren (pp);
pp_expression (pp, e);
pp_c_right_paren (pp);

6
gcc/cfgcleanup.c
View file

@ -1,6 +1,6 @@
/* Control flow optimization code for GNU compiler.
Copyright (C) 1987, 1988, 1992, 1993, 1994, 1995, 1996, 1997, 1998,
1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007
1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008
Free Software Foundation, Inc.
This file is part of GCC.
@ -418,8 +418,8 @@ try_forward_edges (int mode, basic_block b)
and cold sections.
Basic block partitioning may result in some jumps that appear to
be optimizable (or blocks that appear to be mergeable), but which really m
ust be left untouched (they are required to make it safely across
be optimizable (or blocks that appear to be mergeable), but which really
must be left untouched (they are required to make it safely across
partition boundaries). See the comments at the top of
bb-reorder.c:partition_hot_cold_basic_blocks for complete details. */

4
gcc/cfgexpand.c
View file

@ -125,7 +125,7 @@ static struct stack_var *stack_vars;
static size_t stack_vars_alloc;
static size_t stack_vars_num;
/* An array of indicies such that stack_vars[stack_vars_sorted[i]].size
/* An array of indices such that stack_vars[stack_vars_sorted[i]].size
is non-decreasing. */
static size_t *stack_vars_sorted;
@ -341,7 +341,7 @@ add_alias_set_conflicts (void)
}
/* A subroutine of partition_stack_vars. A comparison function for qsort,
sorting an array of indicies by the size of the object. */
sorting an array of indices by the size of the object. */
static int
stack_var_size_cmp (const void *a, const void *b)

5
gcc/cfghooks.c
View file

@ -1,5 +1,6 @@
/* Hooks for cfg representation specific functions.
Copyright (C) 2003, 2004, 2005, 2007 Free Software Foundation, Inc.
Copyright (C) 2003, 2004, 2005, 2007, 2008 Free Software Foundation,
Inc.
Contributed by Sebastian Pop <s.pop@laposte.net>
This file is part of GCC.
@ -1029,7 +1030,7 @@ cfg_hook_duplicate_loop_to_header_edge (struct loop *loop, edge e,
/* Conditional jumps are represented differently in trees and RTL,
this hook takes a basic block that is known to have a cond jump
at its end and extracts the taken and not taken eges out of it
at its end and extracts the taken and not taken edges out of it
and store it in E1 and E2 respectively. */
void
extract_cond_bb_edges (basic_block b, edge *e1, edge *e2)

2
gcc/cfglayout.c
View file

@ -378,7 +378,7 @@ struct rtl_opt_pass pass_outof_cfg_layout_mode =
}
};
/* Return sope resulting from combination of S1 and S2. */
/* Return scope resulting from combination of S1 and S2. */
static tree
choose_inner_scope (tree s1, tree s2)
{

9
gcc/cfgloopmanip.c
View file

@ -1,5 +1,6 @@
/* Loop manipulation code for GNU compiler.
Copyright (C) 2002, 2003, 2004, 2005, 2007 Free Software Foundation, Inc.
Copyright (C) 2002, 2003, 2004, 2005, 2007, 2008 Free Software
Foundation, Inc.
This file is part of GCC.
@ -1361,8 +1362,8 @@ loop_version (struct loop *loop,
free (bbs);
}
/* At this point condition_bb is loop predheader with two successors,
first_head and second_head. Make sure that loop predheader has only
/* At this point condition_bb is loop preheader with two successors,
first_head and second_head. Make sure that loop preheader has only
one successor. */
split_edge (loop_preheader_edge (loop));
split_edge (loop_preheader_edge (nloop));
@ -1375,7 +1376,7 @@ loop_version (struct loop *loop,
removed (thus the loop nesting may be wrong), and some blocks and edges
were changed (so the information about bb --> loop mapping does not have
to be correct). But still for the remaining loops the header dominates
the latch, and loops did not get new subloobs (new loops might possibly
the latch, and loops did not get new subloops (new loops might possibly
get created, but we are not interested in them). Fix up the mess.
If CHANGED_BBS is not NULL, basic blocks whose loop has changed are

6
gcc/cgraph.c
View file

@ -296,7 +296,7 @@ cgraph_edge (struct cgraph_node *node, tree call_stmt)
return e;
}
/* Change call_smtt of edge E to NEW_STMT. */
/* Change call_stmt of edge E to NEW_STMT. */
void
cgraph_set_call_stmt (struct cgraph_edge *e, tree new_stmt)
@ -701,7 +701,7 @@ cgraph_node_name (struct cgraph_node *node)
/* Names used to print out the availability enum. */
const char * const cgraph_availability_names[] =
{"unset", "not_available", "overwrittable", "available", "local"};
{"unset", "not_available", "overwritable", "available", "local"};
/* Dump call graph node NODE to file F. */
@ -1038,7 +1038,7 @@ cgraph_add_new_function (tree fndecl, bool lowered)
switch (cgraph_state)
{
case CGRAPH_STATE_CONSTRUCTION:
/* Just enqueue function to be processed at nearest occurence. */
/* Just enqueue function to be processed at nearest occurrence. */
node = cgraph_node (fndecl);
node->next_needed = cgraph_new_nodes;
if (lowered)

8
gcc/cgraphunit.c
View file

@ -119,9 +119,9 @@ along with GCC; see the file COPYING3. If not see
Functions are output early using call of
cgraph_assemble_pending_function from cgraph_finalize_function. The
decision on whether function is needed is made more conservative so
uninlininable static functions are needed too. During the call-graph
uninlinable static functions are needed too. During the call-graph
construction the edge destinations are not marked as reachable and it
is completely relied upn assemble_variable to mark them. */
is completely relied upon assemble_variable to mark them. */
#include "config.h"
@ -326,7 +326,7 @@ cgraph_build_cdtor_fns (void)
/* Determine if function DECL is needed. That is, visible to something
either outside this translation unit, something magic in the system
configury, or (if not doing unit-at-a-time) to something we havn't
configury, or (if not doing unit-at-a-time) to something we haven't
seen yet. */
static bool
@ -1455,7 +1455,7 @@ cgraph_optimize (void)
/* Generate and emit a static constructor or destructor. WHICH must
be one of 'I' (for a constructor) or 'D' (for a destructor). BODY
is a STATEMENT_LIST containing GENERIC statements. PRIORITY is the
initialization priority fot this constructor or destructor. */
initialization priority for this constructor or destructor. */
void
cgraph_build_static_cdtor (char which, tree body, int priority)

5
gcc/coverage.c
View file

@ -1,6 +1,7 @@
/* Read and write coverage files, and associated functionality.
Copyright (C) 1990, 1991, 1992, 1993, 1994, 1996, 1997, 1998, 1999,
2000, 2001, 2003, 2004, 2005, 2007 Free Software Foundation, Inc.
2000, 2001, 2003, 2004, 2005, 2007, 2008 Free Software Foundation,
Inc.
Contributed by James E. Wilson, UC Berkeley/Cygnus Support;
based on some ideas from Dain Samples of UC Berkeley.
Further mangling by Bob Manson, Cygnus Support.
@ -489,7 +490,7 @@ coverage_checksum_string (unsigned chksum, const char *string)
_GLOBAL__N_<filename>_<wrongmagicnumber>_<magicnumber>functionname
since filename might contain extra underscores there seems
to be no better chance then walk all possible offsets looking
for magicnuber. */
for magicnumber. */
if (offset)
{
for (i = i + offset; string[i]; i++)

4
gcc/dbxout.c
View file

@ -2334,7 +2334,7 @@ dbxout_class_name_qualifiers (tree decl)
/* This is a specialized subset of expand_expr for use by dbxout_symbol in
evaluating DECL_VALUE_EXPR. In particular, we stop if we find decls that
havn't been expanded, or if the expression is getting so complex we won't
haven't been expanded, or if the expression is getting so complex we won't
be able to represent it in stabs anyway. Returns NULL on failure. */
static rtx
@ -2500,7 +2500,7 @@ dbxout_symbol (tree decl, int local ATTRIBUTE_UNUSED)
/* If we are to generate only the symbols actually used then such
symbol nodes are flagged with TREE_USED. Ignore any that
aren't flaged as TREE_USED. */
aren't flagged as TREE_USED. */
if (flag_debug_only_used_symbols
&& (!TREE_USED (decl)

4
gcc/df-byte-scan.c
View file

@ -161,7 +161,7 @@ df_compute_accessed_bytes_strict_low_part (struct df_ref *ref,
int m2_size;
int offset;
/* In order to accomodate multiword subregs of a hardreg, df_scan
/* In order to accommodate multiword subregs of a hardreg, df_scan
eats the subreg and it can only be found from the loc. */
if (REG_P (reg))
reg = *(DF_REF_LOC (ref));
@ -214,7 +214,7 @@ df_compute_accessed_bytes_subreg (struct df_ref *ref, unsigned int *start_byte,
enum machine_mode m2;
int m2_size;
/* In order to accomodate multiword subregs of a hardreg, df_scan
/* In order to accommodate multiword subregs of a hardreg, df_scan
eats the subreg and it can only be found from the loc. */
if (REG_P (reg))
reg = *(DF_REF_LOC (ref));

11
gcc/df-core.c
View file

@ -1,6 +1,6 @@
/* Allocation for dataflow support routines.
Copyright (C) 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007
Free Software Foundation, Inc.
Copyright (C) 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007,
2008 Free Software Foundation, Inc.
Originally contributed by Michael P. Hayes
(m.hayes@elec.canterbury.ac.nz, mhayes@redhat.com)
Major rewrite contributed by Danny Berlin (dberlin@dberlin.org)
@ -42,7 +42,7 @@ requirement is that there be a correct control flow graph.
There are three variations of the live variable problem that are
available whenever dataflow is available. The LR problem finds the
areas that can reach a use of a variable, the UR problems finds the
areas tha can be reached from a definition of a variable. The LIVE
areas that can be reached from a definition of a variable. The LIVE
problem finds the intersection of these two areas.
There are several optional problems. These can be enabled when they
@ -57,7 +57,7 @@ making this happen and are described in the INCREMENTAL SCANNING
section.
In the middle layer, basic blocks are scanned to produce transfer
functions which describe the effects of that block on the a global
functions which describe the effects of that block on the global
dataflow solution. The transfer functions are only rebuilt if the
some instruction within the block has changed.
@ -343,7 +343,6 @@ There are 4 ways to obtain access to refs:
chains.
4) An array of all of the uses (and an array of all of the defs) can
be built. These arrays are indexed by the value in the id
structure. These arrays are only lazily kept up to date, and that
process can be expensive. To have these arrays built, call
@ -370,7 +369,7 @@ address in this second example.
A set to a REG inside a ZERO_EXTRACT, or a set to a non-paradoxical SUBREG
for which the number of word_mode units covered by the outer mode is
smaller than that covered by the inner mode, invokes a read-modify-write.
smaller than that covered by the inner mode, invokes a read-modify-write
operation. We generate both a use and a def and again mark them
read/write.

7
gcc/df-problems.c
View file

@ -1,7 +1,6 @@
/* Standard problems for dataflow support routines.
Copyright (C) 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008
Free Software Foundation, Inc.
Copyright (C) 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007,
2008 Free Software Foundation, Inc.
Originally contributed by Michael P. Hayes
(m.hayes@elec.canterbury.ac.nz, mhayes@redhat.com)
Major rewrite contributed by Danny Berlin (dberlin@dberlin.org)
@ -2335,7 +2334,7 @@ df_chain_add_problem (enum df_chain_flags chain_flags)
reach in the backwards direction. In and out bitvectors are built
for each basic block. There are two mapping functions,
df_byte_lr_get_regno_start and df_byte_lr_get_regno_len that are
used to map regnos into bit vector postions.
used to map regnos into bit vector positions.
This problem differs from the regular df_lr function in the way
that subregs, *_extracts and strict_low_parts are handled. In lr

4
gcc/df-scan.c
View file

@ -462,7 +462,7 @@ df_scan_add_problem (void)
/* First, grow the reg_info information. If the current size is less than
the number of psuedos, grow to 25% more than the number of
the number of pseudos, grow to 25% more than the number of
pseudos.
Second, assure that all of the slots up to max_reg_num have been
@ -3434,7 +3434,7 @@ df_bb_refs_collect (struct df_collection_rec *collection_rec, basic_block bb)
bottom of the sender block.
The bottom of the sender block is problematic because not all
out-edges of the a block are eh-edges. However, it is true
out-edges of a block are eh-edges. However, it is true
that all edges into a block are either eh-edges or none of
them are eh-edges. Thus, we can model this at the top of the
eh-receiver for all of the edges at once. */

4
gcc/dfp.c
View file

@ -1,5 +1,5 @@
/* Decimal floating point support.
Copyright (C) 2005, 2006, 2007 Free Software Foundation, Inc.
Copyright (C) 2005, 2006, 2007, 2008 Free Software Foundation, Inc.
This file is part of GCC.
@ -528,7 +528,7 @@ decimal_real_to_integer2 (HOST_WIDE_INT *plow, HOST_WIDE_INT *phigh,
decNumberZero (&dn3);
decNumberRescale (&dn, &dn2, &dn3, &set);
/* Conver to REAL_VALUE_TYPE and call appropriate conversion
/* Convert to REAL_VALUE_TYPE and call appropriate conversion
function. */
decNumberToString (&dn, string);
real_from_string (&to, string);

7
gcc/dominance.c
View file

@ -1,5 +1,6 @@
/* Calculate (post)dominators in slightly super-linear time.
Copyright (C) 2000, 2003, 2004, 2005, 2006, 2007 Free Software Foundation, Inc.
Copyright (C) 2000, 2003, 2004, 2005, 2006, 2007, 2008 Free
Software Foundation, Inc.
Contributed by Michael Matz (matz@ifh.de).
This file is part of GCC.
@ -82,7 +83,7 @@ struct dom_info
/* The following few fields implement the structures needed for disjoint
sets. */
/* set_chain[x] is the next node on the path from x to the representant
/* set_chain[x] is the next node on the path from x to the representative
of the set containing x. If set_chain[x]==0 then x is a root. */
TBB *set_chain;
/* set_size[x] is the number of elements in the set named by x. */
@ -421,7 +422,7 @@ compress (struct dom_info *di, TBB v)
static inline TBB
eval (struct dom_info *di, TBB v)
{
/* The representant of the set V is in, also called root (as the set
/* The representative of the set V is in, also called root (as the set
representation is a tree). */
TBB rep = di->set_chain[v];

5
gcc/domwalk.c
View file

@ -1,5 +1,6 @@
/* Generic dominator tree walker
Copyright (C) 2003, 2004, 2005, 2007 Free Software Foundation, Inc.
Copyright (C) 2003, 2004, 2005, 2007, 2008 Free Software Foundation,
Inc.
Contributed by Diego Novillo <dnovillo@redhat.com>
This file is part of GCC.
@ -213,7 +214,7 @@ walk_dominator_tree (struct dom_walk_data *walk_data, basic_block bb)
(*walk_data->before_dom_children_after_stmts) (walk_data, bb);
/* Mark the current BB to be popped out of the recursion stack
once childs are processed. */
once children are processed. */
worklist[sp++] = bb;
worklist[sp++] = NULL;

4
gcc/dse.c
View file

@ -1,5 +1,5 @@
/* RTL dead store elimination.
Copyright (C) 2005, 2006, 2007 Free Software Foundation, Inc.
Copyright (C) 2005, 2006, 2007, 2008 Free Software Foundation, Inc.
Contributed by Richard Sandiford <rsandifor@codesourcery.com>
and Kenneth Zadeck <zadeck@naturalbridge.com>
@ -345,7 +345,7 @@ struct insn_info
/* The linked list of insns that are in consideration for removal in
the forwards pass thru the basic block. This pointer may be
trash as it is not cleared when a wild read occurs. The only
time it is guaranteed to be correct is when the traveral starts
time it is guaranteed to be correct is when the traversal starts
at active_local_stores. */
struct insn_info * next_local_store;
};

2
gcc/dwarf2out.c
View file

@ -12558,7 +12558,7 @@ gen_subprogram_die (tree decl, dw_die_ref context_die)
}
else
{ /* Do nothing for now; maybe need to duplicate die, one for
hot section and ond for cold section, then use the hot/cold
hot section and one for cold section, then use the hot/cold
section begin/end labels to generate the aranges... */
/*
add_AT_lbl_id (subr_die, DW_AT_low_pc, hot_section_label);

8
gcc/emit-rtl.c
View file

@ -1141,7 +1141,7 @@ get_first_label_num (void)
/* If the rtx for label was created during the expansion of a nested
function, then first_label_num won't include this label number.
Fix this now so that array indicies work later. */
Fix this now so that array indices work later. */
void
maybe_set_first_label_num (rtx x)
@ -1623,7 +1623,7 @@ set_mem_attributes_minus_bitpos (rtx ref, tree t, int objectp,
}
/* If this is a field reference and not a bit-field, record it. */
/* ??? There is some information that can be gleened from bit-fields,
/* ??? There is some information that can be gleaned from bit-fields,
such as the word offset in the structure that might be modified.
But skip it for now. */
else if (TREE_CODE (t) == COMPONENT_REF
@ -1726,7 +1726,7 @@ set_mem_attributes_minus_bitpos (rtx ref, tree t, int objectp,
if (TREE_CODE (t) == ALIGN_INDIRECT_REF)
{
/* Force EXPR and OFFSE to NULL, since we don't know exactly what
/* Force EXPR and OFFSET to NULL, since we don't know exactly what
we're overlapping. */
offset = NULL;
expr = NULL;
@ -1960,7 +1960,7 @@ adjust_address_1 (rtx memref, enum machine_mode mode, HOST_WIDE_INT offset,
/* Return a memory reference like MEMREF, but with its mode changed
to MODE and its address changed to ADDR, which is assumed to be
MEMREF offseted by OFFSET bytes. If VALIDATE is
MEMREF offset by OFFSET bytes. If VALIDATE is
nonzero, the memory address is forced to be valid. */
rtx

5
gcc/et-forest.c
View file

@ -1,6 +1,7 @@
/* ET-trees data structure implementation.
Contributed by Pavel Nejedly
Copyright (C) 2002, 2003, 2004, 2005, 2007 Free Software Foundation, Inc.
Copyright (C) 2002, 2003, 2004, 2005, 2007, 2008 Free Software
Foundation, Inc.
This file is part of the libiberty library.
Libiberty is free software; you can redistribute it and/or
@ -754,7 +755,7 @@ et_root (struct et_node *node)
{
struct et_occ *occ = node->rightmost_occ, *r;
/* The root of the tree corresponds to the rightmost occurence in the
/* The root of the tree corresponds to the rightmost occurrence in the
represented path. */
et_splay (occ);
for (r = occ; r->next; r = r->next)

4
gcc/fold-const.c
View file

@ -11389,7 +11389,7 @@ fold_binary (enum tree_code code, tree type, tree op0, tree op1)
{
if (strict_overflow_p)
fold_overflow_warning (("assuming signed overflow does not occur "
"when simplifying modulos"),
"when simplifying modulus"),
WARN_STRICT_OVERFLOW_MISC);
return fold_convert (type, tem);
}
@ -14758,7 +14758,7 @@ fold_read_from_constant_string (tree exp)
with constant folding. (E.g. suppose the lower bound is 1,
and its mode is QI. Without the conversion,l (ARRAY
+(INDEX-(unsigned char)1)) becomes ((ARRAY+(-(unsigned char)1))
+INDEX), which becomes (ARRAY+255+INDEX). Opps!) */
+INDEX), which becomes (ARRAY+255+INDEX). Oops!) */
if (! integer_zerop (low_bound))
index = size_diffop (index, fold_convert (sizetype, low_bound));

14
gcc/function.c
View file

@ -2009,15 +2009,15 @@ assign_parm_find_data_types (struct assign_parm_data_all *all, tree parm,
memset (data, 0, sizeof (*data));
/* NAMED_ARG is a mis-nomer. We really mean 'non-varadic'. */
/* NAMED_ARG is a misnomer. We really mean 'non-variadic'. */
if (!cfun->stdarg)
data->named_arg = 1; /* No varadic parms. */
data->named_arg = 1; /* No variadic parms. */
else if (TREE_CHAIN (parm))
data->named_arg = 1; /* Not the last non-varadic parm. */
data->named_arg = 1; /* Not the last non-variadic parm. */
else if (targetm.calls.strict_argument_naming (&all->args_so_far))
data->named_arg = 1; /* Only varadic ones are unnamed. */
data->named_arg = 1; /* Only variadic ones are unnamed. */
else
data->named_arg = 0; /* Treat as varadic. */
data->named_arg = 0; /* Treat as variadic. */
nominal_type = TREE_TYPE (parm);
passed_type = DECL_ARG_TYPE (parm);
@ -5304,7 +5304,7 @@ match_asm_constraints_1 (rtx insn, rtx *p_sets, int noutputs)
emit_insn_before (insns, insn);
/* Now replace all mentions of the input with output. We can't
just replace the occurence in inputs[i], as the register might
just replace the occurrence in inputs[i], as the register might
also be used in some other input (or even in an address of an
output), which would mean possibly increasing the number of
inputs by one (namely 'output' in addition), which might pose
@ -5314,7 +5314,7 @@ match_asm_constraints_1 (rtx insn, rtx *p_sets, int noutputs)
Here 'input' is used in two occurrences as input (once for the
input operand, once for the address in the second output operand).
If we would replace only the occurence of the input operand (to
If we would replace only the occurrence of the input operand (to
make the matching) we would be left with this:
output = input

4
gcc/function.h
View file

@ -414,9 +414,9 @@ struct rtl_data GTY(())
extern GTY(()) struct rtl_data x_rtl;
/* Accestor to RTL datastructures. We keep them statically allocated now since
/* Accessor to RTL datastructures. We keep them statically allocated now since
we never keep multiple functions. For threaded compiler we might however
want to do differntly. */
want to do differently. */
#define crtl (&x_rtl)
/* This structure can save all the important global and static variables

6
gcc/gcc.c
View file

@ -1203,7 +1203,7 @@ static const struct {
/* Translate the options described by *ARGCP and *ARGVP.
Make a new vector and store it back in *ARGVP,
and store its length in *ARGVC. */
and store its length in *ARGCP. */
static void
translate_options (int *argcp, const char *const **argvp)
@ -7823,8 +7823,8 @@ getenv_spec_function (int argc, const char **argv)
fatal ("environment variable \"%s\" not defined", argv[0]);
/* We have to escape every character of the environment variable so
they are not interpretted as active spec characters. A
particulaly painful case is when we are reading a variable
they are not interpreted as active spec characters. A
particularly painful case is when we are reading a variable
holding a windows path complete with \ separators. */
len = strlen (value) * 2 + strlen (argv[1]) + 1;
result = xmalloc (len);

6
gcc/gcov-io.c
View file

@ -1,6 +1,6 @@
/* File format for coverage information
Copyright (C) 1996, 1997, 1998, 2000, 2002, 2003, 2004, 2005, 2007
Free Software Foundation, Inc.
Copyright (C) 1996, 1997, 1998, 2000, 2002, 2003, 2004, 2005, 2007,
2008 Free Software Foundation, Inc.
Contributed by Bob Manson <manson@cygnus.com>.
Completely remangled by Nathan Sidwell <nathan@codesourcery.com>.
@ -507,7 +507,7 @@ gcov_sync (gcov_position_t base, gcov_unsigned_t length)
#endif
#if IN_LIBGCOV
/* Move to the a set position in a gcov file. */
/* Move to a given position in a gcov file. */
GCOV_LINKAGE void
gcov_seek (gcov_position_t base)

2
gcc/gcov.c
View file

@ -83,7 +83,7 @@ typedef struct arc_info
/* Arc is for a function that abnormally returns. */
unsigned int is_call_non_return : 1;
/* Arc is for catch/setjump. */
/* Arc is for catch/setjmp. */
unsigned int is_nonlocal_return : 1;
/* Is an unconditional branch. */

4
gcc/gcse.c
View file

@ -1705,7 +1705,7 @@ hash_scan_set (rtx pat, rtx insn, struct hash_table *table)
same PRE GCSE operation repeatedly on the same REG_EQUAL value if we
do more than one PRE GCSE pass.
Note that this does not impede profitale constant propagations. We
Note that this does not impede profitable constant propagations. We
"look through" reg-reg sets in lookup_avail_set. */
note = find_reg_equal_equiv_note (insn);
if (note != 0
@ -4680,7 +4680,7 @@ compute_transpout (void)
FOR_EACH_BB (bb)
{
/* Note that flow inserted a nop a the end of basic blocks that
/* Note that flow inserted a nop at the end of basic blocks that
end in call instructions for reasons other than abnormal
control flow. */
if (! CALL_P (BB_END (bb)))

4
gcc/genattrtab.c
View file

@ -1,6 +1,6 @@
/* Generate code from machine description to compute values of attributes.
Copyright (C) 1991, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000,
2002, 2003, 2004, 2005, 2006, 2007 Free Software Foundation, Inc.
2002, 2003, 2004, 2005, 2006, 2007, 2008 Free Software Foundation, Inc.
Contributed by Richard Kenner (kenner@vlsi1.ultra.nyu.edu)
This file is part of GCC.
@ -135,7 +135,7 @@ struct insn_def
struct insn_def *next; /* Next insn in chain. */
rtx def; /* The DEFINE_... */
int insn_code; /* Instruction number. */
int insn_index; /* Expression numer in file, for errors. */
int insn_index; /* Expression number in file, for errors. */
int lineno; /* Line number. */
int num_alternatives; /* Number of alternatives. */
int vec_idx; /* Index of attribute vector in `def'. */

24
gcc/genautomata.c
View file

@ -1,5 +1,5 @@
/* Pipeline hazard description translator.
Copyright (C) 2000, 2001, 2002, 2003, 2004, 2005, 2007
Copyright (C) 2000, 2001, 2002, 2003, 2004, 2005, 2007, 2008
Free Software Foundation, Inc.
Written by Vladimir Makarov <vmakarov@redhat.com>
@ -471,7 +471,7 @@ struct insn_reserv_decl
/* The following field is the insn regexp transformed that
the regexp has not optional regexp, repetition regexp, and an
reservation name (i.e. reservation identifiers are changed by the
corresponding regexp) and all alternations are the topest level
corresponding regexp) and all alternations are the top level
of the regexp. The value can be NULL only if it is special
insn `cycle advancing'. */
regexp_t transformed_regexp;
@ -4247,11 +4247,11 @@ initiate_presence_absence_pattern_sets (void)
}
/* The function checks that CHECKED_SET satisfies all presence pattern
sets for units in ORIGIONAL_SET. The function returns TRUE if it
sets for units in ORIGINAL_SET. The function returns TRUE if it
is ok. */
static int
check_presence_pattern_sets (reserv_sets_t checked_set,
reserv_sets_t origional_set,
reserv_sets_t original_set,
int final_p)
{
int char_num;
@ -4264,9 +4264,9 @@ check_presence_pattern_sets (reserv_sets_t checked_set,
chars_num = els_in_cycle_reserv * sizeof (set_el_t);
for (char_num = 0; char_num < chars_num; char_num++)
if (((unsigned char *) origional_set) [char_num])
if (((unsigned char *) original_set) [char_num])
for (i = CHAR_BIT - 1; i >= 0; i--)
if ((((unsigned char *) origional_set) [char_num] >> i) & 1)
if ((((unsigned char *) original_set) [char_num] >> i) & 1)
{
start_unit_num = char_num * CHAR_BIT + i;
if (start_unit_num >= description->units_num)
@ -4296,11 +4296,11 @@ check_presence_pattern_sets (reserv_sets_t checked_set,
}
/* The function checks that CHECKED_SET satisfies all absence pattern
sets for units in ORIGIONAL_SET. The function returns TRUE if it
sets for units in ORIGINAL_SET. The function returns TRUE if it
is ok. */
static int
check_absence_pattern_sets (reserv_sets_t checked_set,
reserv_sets_t origional_set,
reserv_sets_t original_set,
int final_p)
{
int char_num;
@ -4312,9 +4312,9 @@ check_absence_pattern_sets (reserv_sets_t checked_set,
chars_num = els_in_cycle_reserv * sizeof (set_el_t);
for (char_num = 0; char_num < chars_num; char_num++)
if (((unsigned char *) origional_set) [char_num])
if (((unsigned char *) original_set) [char_num])
for (i = CHAR_BIT - 1; i >= 0; i--)
if ((((unsigned char *) origional_set) [char_num] >> i) & 1)
if ((((unsigned char *) original_set) [char_num] >> i) & 1)
{
start_unit_num = char_num * CHAR_BIT + i;
if (start_unit_num >= description->units_num)
@ -5393,7 +5393,7 @@ make_automaton (automaton_t automaton)
VEC_free (state_t,heap, state_stack);
}
/* Foms lists of all arcs of STATE marked by the same ainsn. */
/* Form lists of all arcs of STATE marked by the same ainsn. */
static void
form_arcs_marked_by_insn (state_t state)
{
@ -8488,7 +8488,7 @@ output_description (void)
{
if (DECL_UNIT (decl)->excl_list != NULL)
{
fprintf (output_description_file, "unit %s exlusion_set: ",
fprintf (output_description_file, "unit %s exclusion_set: ",
DECL_UNIT (decl)->name);
output_unit_set_el_list (DECL_UNIT (decl)->excl_list);
fprintf (output_description_file, "\n");

2
gcc/ggc-page.c
View file

@ -386,7 +386,7 @@ static struct globals
/* Maximum number of elements that can be used before resizing. */
unsigned int depth_max;
/* Each element of this arry is an index in by_depth where the given
/* Each element of this array is an index in by_depth where the given
depth starts. This structure is indexed by that given depth we
are interested in. */
unsigned int *depth;

2
gcc/ggc-zone.c
View file

@ -2445,7 +2445,7 @@ ggc_pch_finish (struct ggc_pch_data *d, FILE *f)
fatal_error ("can't seek PCH file: %m");
if (fwrite (d->alloc_bits, d->alloc_size, 1, f) != 1)
fatal_error ("can't write PCH fle: %m");
fatal_error ("can't write PCH file: %m");
/* Done with the PCH, so write out our footer. */
if (fwrite (&d->d, sizeof (d->d), 1, f) != 1)

2
gcc/gimplify.c
View file

@ -6494,7 +6494,7 @@ gimplify_body (tree *body_p, tree fndecl, bool do_parms)
unshare_body (body_p, fndecl);
unvisit_body (body_p, fndecl);
/* Make sure input_location isn't set to something wierd. */
/* Make sure input_location isn't set to something weird. */
input_location = DECL_SOURCE_LOCATION (fndecl);
/* Resolve callee-copies. This has to be done before processing

4
gcc/gthr-lynx.h
View file

@ -1,7 +1,7 @@
/* Threads compatibility routines for libgcc2 and libobjc for
LynxOS. */
/* Compile this one with gcc. */
/* Copyright (C) 2004 Free Software Foundation, Inc.
/* Copyright (C) 2004, 2008 Free Software Foundation, Inc.
This file is part of GCC.
@ -44,7 +44,7 @@ Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA
/* When using static libc on LynxOS, we cannot define pthread_create
weak. If the multi-threaded application includes iostream.h,
gthr-posix.h is included and pthread_create will be defined weak.
If pthead_create is weak its defining module in libc is not
If pthread_create is weak its defining module in libc is not
necessarily included in the link and the symbol is resolved to zero.
Therefore the first call to it will crash.

6
gcc/haifa-sched.c
View file

@ -1110,7 +1110,7 @@ ready_sort (struct ready_list *ready)
/* PREV is an insn that is ready to execute. Adjust its priority if that
will help shorten or lengthen register lifetimes as appropriate. Also
provide a hook for the target to tweek itself. */
provide a hook for the target to tweak itself. */
HAIFA_INLINE static void
adjust_priority (rtx prev)
@ -2373,7 +2373,7 @@ schedule_block (basic_block *target_bb, int rgn_n_insns1)
asm_p = (GET_CODE (PATTERN (insn)) == ASM_INPUT
|| asm_noperands (PATTERN (insn)) >= 0);
if (!first_cycle_insn_p && asm_p)
/* This is asm insn which is tryed to be issued on the
/* This is asm insn which is tried to be issued on the
cycle not first. Issue it on the next cycle. */
cost = 1;
else
@ -2548,7 +2548,7 @@ schedule_block (basic_block *target_bb, int rgn_n_insns1)
{
targetm.sched.md_finish (sched_dump, sched_verbose);
/* Target might have added some instructions to the scheduled block.
/* Target might have added some instructions to the scheduled block
in its md_finish () hook. These new insns don't have any data
initialized and to identify them we extend h_i_d so that they'll
get zero luids.*/

4
gcc/hwint.h
View file

@ -1,5 +1,5 @@
/* HOST_WIDE_INT definitions for the GNU compiler.
Copyright (C) 1998, 2002, 2004 Free Software Foundation, Inc.
Copyright (C) 1998, 2002, 2004, 2008 Free Software Foundation, Inc.
This file is part of GCC.
@ -139,7 +139,7 @@ extern char sizeof_long_long_must_be_8[sizeof(long long) == 8 ? 1 : -1];
# define HOST_WIDEST_FAST_INT __int64
# define HOST_BITS_PER_WIDEST_FAST_INT HOST_BITS_PER___INT64
# else
# error "Your host said it wantted to use long long or __int64 but neither"
# error "Your host said it wanted to use long long or __int64 but neither"
# error "exist"
# endif
#else

4
gcc/ipa-cp.c
View file

@ -99,7 +99,7 @@ along with GCC; see the file COPYING3. If not see
2. For read-only parameters that do not live in memory, we replace all their
uses with the constant.
We also need to modify some callsites to call the cloned functiosns instead
We also need to modify some callsites to call the cloned functions instead
of the original ones. For a callsite passing an argument found to be a
constant by IPCP, there are two different cases to handle:
1. A constant is passed as an argument. In this case the callsite in the
@ -109,7 +109,7 @@ along with GCC; see the file COPYING3. If not see
only the callsite in the cloned caller is redirected to call to the
cloned callee.
This update is done in two steps: First all cloned functionss are created
This update is done in two steps: First all cloned functions are created
during a traversal of the call graph, during which all callsites are
redirected to call the cloned function. Then the callsites are traversed
and many calls redirected back to fit the description above.

4
gcc/ipa-inline.c
View file

@ -1,5 +1,5 @@
/* Inlining decision heuristics.
Copyright (C) 2003, 2004, 2007 Free Software Foundation, Inc.
Copyright (C) 2003, 2004, 2007, 2008 Free Software Foundation, Inc.
Contributed by Jan Hubicka
This file is part of GCC.
@ -520,7 +520,7 @@ cgraph_edge_badness (struct cgraph_edge *edge)
within function, the function itself is infrequent.
Other objective to optimize for is number of different calls inlined.
We add the estimated growth after inlining all functions to biass the
We add the estimated growth after inlining all functions to bias the
priorities slightly in this direction (so fewer times called functions
of the same size gets priority). */
else if (flag_guess_branch_prob)

8
gcc/ipa-prop.h
View file

@ -1,5 +1,5 @@
/* Interprocedural analyses.
Copyright (C) 2005, 2007 Free Software Foundation, Inc.
Copyright (C) 2005, 2007, 2008 Free Software Foundation, Inc.
This file is part of GCC.
@ -115,7 +115,7 @@ struct ipa_replace_map
struct ipa_node_params
{
/* Number of formal parameters of this function. When set to 0,
this functions's parameters would not be analyzed by the different
this function's parameters would not be analyzed by the different
stages of IPA CP. */
int param_count;
/* Array of lattices. */
@ -134,7 +134,7 @@ struct ipa_node_params
one. */
gcov_type count_scale;
/* Whether this fynction is called with variable number of actual
/* Whether this function is called with variable number of actual
arguments. */
unsigned called_with_var_arguments : 1;
};
@ -165,7 +165,7 @@ ipa_get_ith_param (struct ipa_node_params *info, int i)
return info->param_decls[i];
}
/* Returns the modification flag corresponding o the ith paramterer. Note
/* Returns the modification flag corresponding to the ith parameter. Note
there is no setter method as the goal is to set all flags when building the
array in ipa_detect_param_modifications. */
static inline bool

14
gcc/ipa-pure-const.c
View file

@ -1,5 +1,5 @@
/* Callgraph based analysis of static variables.
Copyright (C) 2004, 2005, 2007 Free Software Foundation, Inc.
Copyright (C) 2004, 2005, 2007, 2008 Free Software Foundation, Inc.
Contributed by Kenneth Zadeck <zadeck@naturalbridge.com>
This file is part of GCC.
@ -18,9 +18,9 @@ You should have received a copy of the GNU General Public License
along with GCC; see the file COPYING3. If not see
<http://www.gnu.org/licenses/>. */
/* This file mark functions as being either const (TREE_READONLY) or
pure (DECL_PURE_P). It can also set the a variant of these that
are allowed to infinite loop (DECL_LOOPING_CONST_PURE_P).
/* This file marks functions as being either const (TREE_READONLY) or
pure (DECL_PURE_P). It can also set a variant of these that
are allowed to loop indefinitely (DECL_LOOPING_CONST_PURE_P).
This must be run after inlining decisions have been made since
otherwise, the local sets will not contain information that is
@ -85,7 +85,7 @@ get_function_state (struct cgraph_node *node)
return (funct_state) info->aux;
}
/* Check to see if the use (or definition when CHECHING_WRITE is true)
/* Check to see if the use (or definition when CHECKING_WRITE is true)
variable T is legal in a function that is either pure or const. */
static inline void
@ -174,7 +174,7 @@ check_tree (funct_state local, tree t, bool checking_write)
|| TREE_CODE (t) == SSA_NAME)
return;
/* Any tree which is volatile disqualifies thie function from being
/* Any tree which is volatile disqualifies this function from being
const or pure. */
if (TREE_THIS_VOLATILE (t))
{
@ -641,7 +641,7 @@ static_execute (void)
is a master clone. However, we do NOT process any
AVAIL_OVERWRITABLE functions (these are never clones) we cannot
guarantee that what we learn about the one we see will be true
for the one that overriders it.
for the one that overrides it.
*/
for (node = cgraph_nodes; node; node = node->next)
if (node->analyzed && cgraph_is_master_clone (node))

28
gcc/ipa-struct-reorg.c
View file

@ -1,5 +1,5 @@
/* Struct-reorg optimization.
Copyright (C) 2007 Free Software Foundation, Inc.
Copyright (C) 2007, 2008 Free Software Foundation, Inc.
Contributed by Olga Golovanevsky <olga@il.ibm.com>
(Initial version of this code was developed
by Caroline Tice and Mostafa Hagog.)
@ -309,7 +309,7 @@ is_result_of_mult (tree arg, tree *num, tree struct_size)
{
tree size_def_stmt = SSA_NAME_DEF_STMT (arg);
/* If allocation statementt was of the form
/* If the allocation statement was of the form
D.2229_10 = <alloc_func> (D.2228_9);
then size_def_stmt can be D.2228_9 = num.3_8 * 8; */
@ -406,7 +406,7 @@ decompose_indirect_ref_acc (tree str_decl, struct field_access_site *acc)
/* This function checks whether the access ACC of structure type STR
is of the form suitable for tranformation. If yes, it returns true.
is of the form suitable for transformation. If yes, it returns true.
False otherwise. */
static bool
@ -435,7 +435,7 @@ make_field_acc_node (void)
}
/* This function returns the structure field access, defined by STMT,
if it is aready in hashtable of function accesses F_ACCS. */
if it is already in hashtable of function accesses F_ACCS. */
static struct field_access_site *
is_in_field_accs (tree stmt, htab_t f_accs)
@ -538,7 +538,7 @@ finalize_new_vars_creation (void **slot, void *data ATTRIBUTE_UNUSED)
return 1;
}
/* This funciton updates statements in STMT_LIST with BB info. */
/* This function updates statements in STMT_LIST with BB info. */
static void
add_bb_info (basic_block bb, tree stmt_list)
@ -587,7 +587,7 @@ is_in_new_vars_htab (tree decl, htab_t new_vars_htab)
htab_hash_pointer (decl));
}
/* Given original varaiable ORIG_VAR, this function returns
/* Given original variable ORIG_VAR, this function returns
new variable corresponding to it of NEW_TYPE type. */
static tree
@ -1616,7 +1616,7 @@ is_equal_types (tree type1, tree type2)
case ENUMERAL_TYPE:
{
tree field1;
/* Compare fields of struture. */
/* Compare fields of structure. */
for (field1 = TYPE_FIELDS (type1); field1;
field1 = TREE_CHAIN (field1))
{
@ -1760,7 +1760,7 @@ create_new_malloc (tree malloc_stmt, tree new_type, tree *new_stmts, tree num)
/* This function returns a tree representing
the number of instances of structure STR_DECL allocated
by allocation STMT. If new statments are generated,
by allocation STMT. If new statements are generated,
they are filled into NEW_STMTS_P. */
static tree
@ -2074,7 +2074,7 @@ dump_acc (void **slot, void *data ATTRIBUTE_UNUSED)
return 1;
}
/* This function frees memory allocated for strcuture clusters,
/* This function frees memory allocated for structure clusters,
starting from CLUSTER. */
static void
@ -2402,7 +2402,7 @@ remove_structure (unsigned i)
}
/* Currently we support only EQ_EXPR or NE_EXPR conditions.
COND_STNT is a condition statement to check. */
COND_STMT is a condition statement to check. */
static bool
is_safe_cond_expr (tree cond_stmt)
@ -2861,7 +2861,7 @@ check_bitfields (d_str str, VEC (tree, heap) **unsuitable_types)
}
/* This function adds to UNSUITABLE_TYPES those types that escape
due to results of ipa-type-escpae analysis. See ipa-type-escpae.[c,h]. */
due to results of ipa-type-escape analysis. See ipa-type-escape.[c,h]. */
static void
exclude_escaping_types_1 (VEC (tree, heap) **unsuitable_types)
@ -3158,7 +3158,7 @@ exclude_alloc_and_field_accs_1 (d_str str, struct cgraph_node *node)
htab_traverse (dt.str->accs, exclude_from_accs, &dt);
}
/* Collect accesses to the structure types that apear in basic bloack BB. */
/* Collect accesses to the structure types that appear in basic block BB. */
static void
collect_accesses_in_bb (basic_block bb)
@ -3181,8 +3181,8 @@ collect_accesses_in_bb (basic_block bb)
}
}
/* This function generates cluster substructure that cointains FIELDS.
The cluster added to the set of clusters of the structure SRT. */
/* This function generates cluster substructure that contains FIELDS.
The cluster added to the set of clusters of the structure STR. */
static void
gen_cluster (sbitmap fields, d_str str)

4
gcc/ipa-struct-reorg.h
View file

@ -1,5 +1,5 @@
/* Struct-reorg optimization.
Copyright (C) 2002, 2003-2007 Free Software Foundation, Inc.
Copyright (C) 2002, 2003-2007, 2008 Free Software Foundation, Inc.
Contributed by Olga Golovanevsky <olga@il.ibm.com>
This file is part of GCC.
@ -104,7 +104,7 @@ struct data_structure
/* A data structure representing a reorganization decision. */
struct field_cluster *struct_clustering;
/* New types to replace an the original structure type. */
/* New types to replace the original structure type. */
VEC(tree, heap) *new_types;
};

7
gcc/ipa-type-escape.c
View file

@ -1,5 +1,6 @@
/* Type based alias analysis.
Copyright (C) 2004, 2005, 2006, 2007 Free Software Foundation, Inc.
Copyright (C) 2004, 2005, 2006, 2007, 2008 Free Software Foundation,
Inc.
Contributed by Kenneth Zadeck <zadeck@naturalbridge.com>
This file is part of GCC.
@ -1781,7 +1782,7 @@ type_for_uid (int uid)
else return NULL;
}
/* Return the a bitmap with the subtypes of the type for UID. If it
/* Return a bitmap with the subtypes of the type for UID. If it
does not exist, return either NULL or a new bitmap depending on the
value of CREATE. */
@ -2054,7 +2055,7 @@ type_escape_execute (void)
FOR_EACH_STATIC_VARIABLE (vnode)
analyze_variable (vnode);
/* Process all of the functions. next
/* Process all of the functions next.
We do not want to process any of the clones so we check that this
is a master clone. However, we do need to process any

5
gcc/ipa.c
View file

@ -1,5 +1,6 @@
/* Basic IPA optimizations and utilities.
Copyright (C) 2003, 2004, 2005, 2007 Free Software Foundation, Inc.
Copyright (C) 2003, 2004, 2005, 2007, 2008 Free Software Foundation,
Inc.
This file is part of GCC.
@ -42,7 +43,7 @@ cgraph_postorder (struct cgraph_node **order)
/* We have to deal with cycles nicely, so use a depth first traversal
output algorithm. Ignore the fact that some functions won't need
to be output and put them into order as well, so we get dependencies
right through intline functions. */
right through inline functions. */
for (node = cgraph_nodes; node; node = node->next)
node->aux = NULL;
for (node = cgraph_nodes; node; node = node->next)

5
gcc/loop-doloop.c
View file

@ -1,5 +1,6 @@
/* Perform doloop optimizations
Copyright (C) 2004, 2005, 2006, 2007 Free Software Foundation, Inc.
Copyright (C) 2004, 2005, 2006, 2007, 2008 Free Software Foundation,
Inc.
Based on code by Michael P. Hayes (m.hayes@elec.canterbury.ac.nz)
This file is part of GCC.
@ -362,7 +363,7 @@ doloop_modify (struct loop *loop, struct niter_desc *desc,
fputs (" iterations).\n", dump_file);
}
/* Get the probabilty of the original branch. If it exists we would
/* Get the probability of the original branch. If it exists we would
need to update REG_BR_PROB of the new jump_insn. */
true_prob_val = find_reg_note (jump_insn, REG_BR_PROB, NULL_RTX);

4
gcc/matrix-reorg.c
View file

@ -1,5 +1,5 @@
/* Matrix layout transformations.
Copyright (C) 2006, 2007 Free Software Foundation, Inc.
Copyright (C) 2006, 2007, 2008 Free Software Foundation, Inc.
Contributed by Razya Ladelsky <razya@il.ibm.com>
Originally written by Revital Eres and Mustafa Hagog.
@ -1543,7 +1543,7 @@ check_allocation_function (void **slot, void *data ATTRIBUTE_UNUSED)
mark_min_matrix_escape_level (mi, level, call_stmt);
if (dump_file)
fprintf (dump_file,
"Matrix %s: Cannot calculate the size of allocation. escaping at level %d\n",
"Matrix %s: Cannot calculate the size of allocation, escaping at level %d\n",
get_name (mi->decl), level);
break;
}

2
gcc/mips-tfile.c
View file

@ -56,7 +56,7 @@ along with GCC; see the file COPYING3. If not see
The auxiliary table is a series of 32 bit integers, that are
referenced as needed from the local symbol table. Unlike standard
COFF, the aux. information does not follow the symbol that uses
COFF, the aux. information does not follow the symbol that uses
it, but rather is a separate table. In theory, this would allow
the MIPS compilers to collapse duplicate aux. entries, but I've not
noticed this happening with the 1.31 compiler suite. The different

4
gcc/mkmap-flat.awk
View file

@ -1,5 +1,5 @@
# Generate a flat list of symbols to export.
# Copyright (C) 2007 Free Software Foundation, Inc.
# Copyright (C) 2007, 2008 Free Software Foundation, Inc.
# Contributed by Richard Henderson <rth@cygnus.com>
#
# This file is part of GCC.
@ -56,7 +56,7 @@ state == "nm" {
# Now we process a simplified variant of the Solaris symbol version
# script. We have one symbol per line, no semicolons, simple markers
# for beginning and ending each section, and %inherit markers for
# describing version inheritence. A symbol may appear in more than
# describing version inheritance. A symbol may appear in more than
# one symbol version, and the last seen takes effect.
# The magic version name '%exclude' causes all the symbols given that
# version to be dropped from the output (unless a later version overrides).

4
gcc/mkmap-symver.awk
View file

@ -1,5 +1,5 @@
# Generate an ELF symbol version map a-la Solaris and GNU ld.
# Copyright (C) 2007 Free Software Foundation, Inc.
# Copyright (C) 2007, 2008 Free Software Foundation, Inc.
# Contributed by Richard Henderson <rth@cygnus.com>
#
# This file is part of GCC.
@ -58,7 +58,7 @@ state == "nm" {
# Now we process a simplified variant of the Solaris symbol version
# script. We have one symbol per line, no semicolons, simple markers
# for beginning and ending each section, and %inherit markers for
# describing version inheritence. A symbol may appear in more than
# describing version inheritance. A symbol may appear in more than
# one symbol version, and the last seen takes effect.
# The magic version name '%exclude' causes all the symbols given that
# version to be dropped from the output (unless a later version overrides).

10
gcc/modulo-sched.c
View file

@ -1,5 +1,5 @@
/* Swing Modulo Scheduling implementation.
Copyright (C) 2004, 2005, 2006, 2007
Copyright (C) 2004, 2005, 2006, 2007, 2008
Free Software Foundation, Inc.
Contributed by Ayal Zaks and Mustafa Hagog <zaks,mustafa@il.ibm.com>
@ -965,7 +965,7 @@ sms_schedule (void)
if (single_exit (loop)->count)
trip_count = latch_edge->count / single_exit (loop)->count;
/* Perfrom SMS only on loops that their average count is above threshold. */
/* Perform SMS only on loops that their average count is above threshold. */
if ( latch_edge->count
&& (latch_edge->count < single_exit (loop)->count * SMS_LOOP_AVERAGE_COUNT_THRESHOLD))
@ -1680,7 +1680,7 @@ calculate_must_precede_follow (ddg_node_ptr u_node, int start, int end,
parameters to decide if that's possible:
PS - The partial schedule.
U - The serial number of U_NODE.
NUM_SPLITS - The number of row spilts made so far.
NUM_SPLITS - The number of row splits made so far.
MUST_PRECEDE - The nodes that must precede U_NODE. (only valid at
the first row of the scheduling window)
MUST_FOLLOW - The nodes that must follow U_NODE. (only valid at the
@ -2125,7 +2125,7 @@ order_nodes_of_sccs (ddg_all_sccs_ptr all_sccs, int * node_order)
sbitmap_zero (prev_sccs);
sbitmap_ones (ones);
/* Perfrom the node ordering starting from the SCC with the highest recMII.
/* Perform the node ordering starting from the SCC with the highest recMII.
For each SCC order the nodes according to their ASAP/ALAP/HEIGHT etc. */
for (i = 0; i < all_sccs->num_sccs; i++)
{
@ -2740,7 +2740,7 @@ ps_has_conflicts (partial_schedule_ptr ps, int from, int to)
return true;
/* Update the DFA state and return with failure if the DFA found
recource conflicts. */
resource conflicts. */
if (state_transition (curr_state, insn) >= 0)
return true;

5
gcc/omega.c
View file

@ -5,7 +5,8 @@
This code has no license restrictions, and is considered public
domain.
Changes copyright (C) 2005, 2006, 2007 Free Software Foundation, Inc.
Changes copyright (C) 2005, 2006, 2007, 2008 Free Software Foundation,
Inc.
Contributed by Sebastian Pop <sebastian.pop@inria.fr>
This file is part of GCC.
@ -2433,7 +2434,7 @@ smooth_weird_equations (omega_pb pb)
if (dump_file && (dump_flags & TDF_DETAILS))
{
fprintf (dump_file,
"Smoothing wierd equations; adding:\n");
"Smoothing weird equations; adding:\n");
omega_print_geq (dump_file, pb, &pb->geqs[e3]);
fprintf (dump_file, "\nto:\n");
omega_print_problem (dump_file, pb);

4
gcc/omp-low.c
View file

@ -4110,7 +4110,7 @@ build_omp_regions_1 (basic_block bb, struct omp_region *parent,
}
else if (code == OMP_ATOMIC_STORE)
{
/* OMP_ATOMIC_STORE is analoguous to OMP_RETURN, but matches with
/* OMP_ATOMIC_STORE is analogous to OMP_RETURN, but matches with
OMP_ATOMIC_LOAD. */
gcc_assert (parent);
gcc_assert (parent->type == OMP_ATOMIC_LOAD);
@ -5124,7 +5124,7 @@ diagnose_sb_0 (tree *stmt_p, tree branch_ctx, tree label_ctx)
return false;
/* Try to avoid confusing the user by producing and error message
with correct "exit" or "enter" verbage. We prefer "exit"
with correct "exit" or "enter" verbiage. We prefer "exit"
unless we can show that LABEL_CTX is nested within BRANCH_CTX. */
if (branch_ctx == NULL)
exit_p = false;

2
gcc/optabs.c
View file

@ -5785,7 +5785,7 @@ gen_fp_to_int_conv_libfunc (convert_optab tab,
gen_interclass_conv_libfunc (tab, opname, tmode, fmode);
}
/* Initialize the libfunc fiels of an of an intra-mode-class conversion optab.
/* Initialize the libfunc fields of an of an intra-mode-class conversion optab.
The string formation rules are
similar to the ones for init_libfunc, above. */

6
gcc/optabs.h
View file

@ -1,5 +1,5 @@
/* Definitions for code generation pass of GNU compiler.
Copyright (C) 2001, 2002, 2003, 2004, 2005, 2006, 2007
Copyright (C) 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008
Free Software Foundation, Inc.
This file is part of GCC.
@ -115,7 +115,7 @@ enum optab_index
wider than the multiplicand and multiplier.
All involved operations are saturating. */
OTI_ssmadd_widen,
/* Unigned multiply and add with the result and addend one machine mode
/* Unsigned multiply and add with the result and addend one machine mode
wider than the multiplicand and multiplier.
All involved operations are saturating. */
OTI_usmadd_widen,
@ -129,7 +129,7 @@ enum optab_index
wider than the multiplicand and multiplier.
All involved operations are saturating. */
OTI_ssmsub_widen,
/* Unigned multiply and subtract the result and minuend one machine mode
/* Unsigned multiply and subtract the result and minuend one machine mode
wider than the multiplicand and multiplier.
All involved operations are saturating. */
OTI_usmsub_widen,

8
gcc/opts.c
View file

@ -1,5 +1,5 @@
/* Command line option handling.
Copyright (C) 2002, 2003, 2004, 2005, 2006, 2007
Copyright (C) 2002, 2003, 2004, 2005, 2006, 2007, 2008
Free Software Foundation, Inc.
Contributed by Neil Booth.
@ -950,7 +950,7 @@ decode_options (unsigned int argc, const char **argv)
modify it. */
target_flags = targetm.default_target_flags;
/* Some tagets have ABI-specified unwind tables. */
/* Some targets have ABI-specified unwind tables. */
flag_unwind_tables = targetm.unwind_tables_default;
#ifdef OPTIMIZATION_OPTIONS
@ -1405,7 +1405,7 @@ common_handle_option (size_t scode, const char *arg, int value,
unsigned int include_flags = 0;
/* Note - by default we include undocumented options when listing
specific classes. If you only want to see documented options
then add ",^undocumented" to the --help= option. e.g.:
then add ",^undocumented" to the --help= option. E.g.:
--help=target,^undocumented */
unsigned int exclude_flags = 0;
@ -1465,7 +1465,7 @@ common_handle_option (size_t scode, const char *arg, int value,
/* Check to see if the string matches a language name.
Note - we rely upon the alpha-sorted nature of the entries in
the lang_names array, specifically that shorter names appear
before their longer variants. (ie C before C++). That way
before their longer variants. (i.e. C before C++). That way
when we are attempting to match --help=c for example we will
match with C first and not C++. */
for (i = 0, lang_flag = 0; i < cl_lang_count; i++)

4
gcc/passes.c
View file

@ -1,6 +1,6 @@
/* Top level of GCC compilers (cc1, cc1plus, etc.)
Copyright (C) 1987, 1988, 1989, 1992, 1993, 1994, 1995, 1996, 1997, 1998,
1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007
1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008
Free Software Foundation, Inc.
This file is part of GCC.
@ -1236,7 +1236,7 @@ execute_one_pass (struct opt_pass *pass)
unsigned int todo_after = 0;
/* IPA passes are executed on whole program, so cfun should be NULL.
Ohter passes needs function context set. */
Other passes need function context set. */
if (pass->type == SIMPLE_IPA_PASS || pass->type == IPA_PASS)
gcc_assert (!cfun && !current_function_decl);
else

4
gcc/postreload-gcse.c
View file

@ -1,5 +1,5 @@
/* Post reload partially redundant load elimination
Copyright (C) 2004, 2005, 2006, 2007
Copyright (C) 2004, 2005, 2006, 2007, 2008
Free Software Foundation, Inc.
This file is part of GCC.
@ -1269,7 +1269,7 @@ gcse_after_reload_main (rtx f ATTRIBUTE_UNUSED)
memset (&stats, 0, sizeof (stats));
/* Allocate ememory for this pass.
/* Allocate memory for this pass.
Also computes and initializes the insns' CUIDs. */
alloc_mem ();

4
gcc/postreload.c
View file

@ -1,6 +1,6 @@
/* Perform simple optimizations to clean up the result of reload.
Copyright (C) 1987, 1988, 1989, 1992, 1993, 1994, 1995, 1996, 1997,
1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007
1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008
Free Software Foundation, Inc.
This file is part of GCC.
@ -661,7 +661,7 @@ reload_cse_simplify_operands (rtx insn, rtx testreg)
replace them with reg+reg addressing. */
#define RELOAD_COMBINE_MAX_USES 6
/* INSN is the insn where a register has ben used, and USEP points to the
/* INSN is the insn where a register has been used, and USEP points to the
location of the register within the rtl. */
struct reg_use { rtx insn, *usep; };

4
gcc/predict.c
View file

@ -1,5 +1,5 @@
/* Branch prediction routines for the GNU compiler.
Copyright (C) 2000, 2001, 2002, 2003, 2004, 2005, 2007
Copyright (C) 2000, 2001, 2002, 2003, 2004, 2005, 2007, 2008
Free Software Foundation, Inc.
This file is part of GCC.
@ -1493,7 +1493,7 @@ tree_estimate_probability (void)
return 0;
}
/* Predict edges to succestors of CUR whose sources are not postdominated by
/* Predict edges to successors of CUR whose sources are not postdominated by
BB by PRED and recurse to all postdominators. */
static void

4
gcc/pretty-print.h
View file

@ -1,5 +1,5 @@
/* Various declarations for language-independent pretty-print subroutines.
Copyright (C) 2002, 2003, 2004, 2007 Free Software Foundation, Inc.
Copyright (C) 2002, 2003, 2004, 2007, 2008 Free Software Foundation, Inc.
Contributed by Gabriel Dos Reis <gdr@integrable-solutions.net>
This file is part of GCC.
@ -142,7 +142,7 @@ typedef bool (*printer_fn) (pretty_printer *, text_info *, const char *,
formatting. */
#define pp_needs_newline(PP) pp_base (PP)->need_newline
/* True if PRETTY-PTINTER is in line-wrapping mode. */
/* True if PRETTY-PRINTER is in line-wrapping mode. */
#define pp_is_wrapping_line(PP) (pp_line_cutoff (PP) > 0)
/* The amount of whitespace to be emitted when starting a new line. */

2
gcc/profile.c
View file

@ -441,7 +441,7 @@ compute_branch_probabilities (void)
FOR_EACH_EDGE (e, ei, bb->succs)
total += e->count;
/* Seedgeh for the invalid edge, and set its count. */
/* Search for the invalid edge, and set its count. */
FOR_EACH_EDGE (e, ei, bb->succs)
if (! EDGE_INFO (e)->count_valid && ! EDGE_INFO (e)->ignore)
break;

5
gcc/protoize.c
View file

@ -1,6 +1,7 @@
/* Protoize program - Original version by Ron Guilmette (rfg@segfault.us.com).
Copyright (C) 1989, 1992, 1993, 1994, 1995, 1996, 1997, 1998,
1999, 2000, 2001, 2002, 2003, 2004, 2005, 2007 Free Software Foundation, Inc.
1999, 2000, 2001, 2002, 2003, 2004, 2005, 2007, 2008 Free Software
Foundation, Inc.
This file is part of GCC.
@ -1723,7 +1724,7 @@ save_def_or_dec (const char *l, int is_syscalls)
}
/* Since we are unprotoizing, if this item is already in old (K&R) style,
we can just ignore it. If that is true, throw away the itme now. */
we can just ignore it. If that is true, throw away the item now. */
if (!def_dec_p->prototyped)
{

4
gcc/ra-conflict.c
View file

@ -1,5 +1,5 @@
/* Allocate registers for pseudo-registers that span basic blocks.
Copyright (C) 2007 Free Software Foundation, Inc.
Copyright (C) 2007, 2008 Free Software Foundation, Inc.
Contributed by Kenneth Zadeck <zadeck@naturalbridge.com>
This file is part of GCC.
@ -405,7 +405,7 @@ set_conflicts_for_earlyclobber (rtx insn)
/* Init LIVE_SUBREGS[ALLOCNUM] and LIVE_SUBREGS_USED[ALLOCNUM] using
REG to the the number of nregs, and INIT_VALUE to get the
REG to the number of nregs, and INIT_VALUE to get the
initialization. ALLOCNUM need not be the regno of REG. */
void

2
gcc/real.c
View file

@ -3526,7 +3526,7 @@ encode_ibm_extended (const struct real_format *fmt, long *buf,
base_fmt = fmt->qnan_msb_set ? &ieee_double_format : &mips_double_format;
/* Renormlize R before doing any arithmetic on it. */
/* Renormalize R before doing any arithmetic on it. */
normr = *r;
if (normr.cl == rvc_normal)
normalize (&normr);

2
gcc/recog.c
View file

@ -451,7 +451,7 @@ confirm_change_group (void)
if (changes[i].unshare)
*changes[i].loc = copy_rtx (*changes[i].loc);
/* Avoid unnecesary rescanning when multiple changes to same instruction
/* Avoid unnecessary rescanning when multiple changes to same instruction
are made. */
if (object)
{

2
gcc/regclass.c
View file

@ -1961,7 +1961,7 @@ record_reg_classes (int n_alts, int n_ops, rtx *ops,
we may want to adjust the cost of that register class to -1.
Avoid the adjustment if the source does not die to avoid stressing of
register allocator by preferrencing two colliding registers into single
register allocator by preferencing two colliding registers into single
class.
Also avoid the adjustment if a copy between registers of the class

5
gcc/regs.h
View file

@ -1,6 +1,7 @@
/* Define per-register tables for data flow info and register allocation.
Copyright (C) 1987, 1993, 1994, 1995, 1996, 1997, 1998,
1999, 2000, 2003, 2004, 2005, 2006, 2007 Free Software Foundation, Inc.
1999, 2000, 2003, 2004, 2005, 2006, 2007, 2008 Free Software
Foundation, Inc.
This file is part of GCC.
@ -129,7 +130,7 @@ extern size_t reg_info_p_size;
#define REG_FREQ(N) (reg_info_p[N].freq)
/* The weights for each insn varries from 0 to REG_FREQ_BASE.
/* The weights for each insn varies from 0 to REG_FREQ_BASE.
This constant does not need to be high, as in infrequently executed
regions we want to count instructions equivalently to optimize for
size instead of speed. */

4
gcc/reload.c
View file

@ -1,6 +1,6 @@
/* Search an insn for pseudo regs that must be in hard regs and are not.
Copyright (C) 1987, 1988, 1989, 1992, 1993, 1994, 1995, 1996, 1997, 1998,
1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007
1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008
Free Software Foundation, Inc.
This file is part of GCC.
@ -988,7 +988,7 @@ push_reload (rtx in, rtx out, rtx *inloc, rtx *outloc,
we can't handle it here because CONST_INT does not indicate a mode.
Similarly, we must reload the inside expression if we have a
STRICT_LOW_PART (presumably, in == out in the cas).
STRICT_LOW_PART (presumably, in == out in this case).
Also reload the inner expression if it does not require a secondary
reload but the SUBREG does.

2
gcc/rtl-error.c
View file

@ -64,7 +64,7 @@ location_for_asm (const_rtx insn)
return loc;
}
/* Report a diagnostic MESSAGE (an errror or a WARNING) at the line number
/* Report a diagnostic MESSAGE (an error or a WARNING) at the line number
of the insn INSN. This is used only when INSN is an `asm' with operands,
and each ASM_OPERANDS records its own source file and line. */
static void

4
gcc/rtlanal.c
View file

@ -841,7 +841,7 @@ reg_set_p (const_rtx reg, const_rtx insn)
/* Similar to reg_set_between_p, but check all registers in X. Return 0
only if none of them are modified between START and END. Return 1 if
X contains a MEM; this routine does usememory aliasing. */
X contains a MEM; this routine does use memory aliasing. */
int
modified_between_p (const_rtx x, const_rtx start, const_rtx end)
@ -1124,7 +1124,7 @@ noop_move_p (const_rtx insn)
return 0;
/* For now treat an insn with a REG_RETVAL note as a
a special insn which should not be considered a no-op. */
special insn which should not be considered a no-op. */
if (find_reg_note (insn, REG_RETVAL, NULL_RTX))
return 0;

5
gcc/scan.h
View file

@ -1,5 +1,6 @@
/* scan.h - Utility declarations for scan-decls and fix-header programs.
Copyright (C) 1993, 1998, 1999, 2003, 2004, 2007 Free Software Foundation, Inc.
Copyright (C) 1993, 1998, 1999, 2003, 2004, 2007, 2008 Free Software
Foundation, Inc.
This program is free software; you can redistribute it and/or modify it
under the terms of the GNU General Public License as published by the
@ -65,7 +66,7 @@ extern int scan_decls (struct cpp_reader *, int, char **);
#define INT_TOKEN 303
extern int get_token (FILE *, sstring *);
/* Current file and line numer, taking #-directives into account */
/* Current file and line number, taking #-directives into account */
extern int source_lineno;
extern sstring source_filename;
/* Current physical line number */

8
gcc/sched-rgn.c
View file

@ -1,6 +1,6 @@
/* Instruction scheduling pass.
Copyright (C) 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000,
2001, 2002, 2003, 2004, 2005, 2006, 2007
2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008
Free Software Foundation, Inc.
Contributed by Michael Tiemann (tiemann@cygnus.com) Enhanced by,
and currently maintained by, Jim Wilson (wilson@cygnus.com)
@ -1566,7 +1566,7 @@ check_live_1 (int src, rtx x)
int t = bitmap_bit_p (&not_in_df, b->index);
/* We can have split blocks, that were recently generated.
such blocks are always outside current region. */
Such blocks are always outside current region. */
gcc_assert (!t || (CONTAINING_RGN (b->index)
!= CONTAINING_RGN (BB_TO_BLOCK (src))));
@ -1753,11 +1753,11 @@ find_conditional_protection (rtx insn, int load_insn_bb)
/* Returns 1 if the same insn1 that participates in the computation
of load_insn's address is feeding a conditional branch that is
guarding on load_insn. This is true if we find a the two DEF-USE
guarding on load_insn. This is true if we find two DEF-USE
chains:
insn1 -> ... -> conditional-branch
insn1 -> ... -> load_insn,
and if a flow path exist:
and if a flow path exists:
insn1 -> ... -> conditional-branch -> ... -> load_insn,
and if insn1 is on the path
region-entry -> ... -> bb_trg -> ... load_insn.

6
gcc/see.c
View file

@ -1,5 +1,5 @@
/* Sign extension elimination optimization for GNU compiler.
Copyright (C) 2005, 2006, 2007 Free Software Foundation, Inc.
Copyright (C) 2005, 2006, 2007, 2008 Free Software Foundation, Inc.
Contributed by Leehod Baruch <leehod@il.ibm.com>
This file is part of GCC.
@ -1253,7 +1253,7 @@ see_update_leader_extra_info (struct web_entry *first, struct web_entry *second)
}
break;
default:
/* Unknown patern type. */
/* Unknown pattern type. */
gcc_unreachable ();
}
@ -1945,7 +1945,7 @@ see_analyze_unmerged_def_local_prop (void **slot, void *b)
}
/* Analyze the properties of a use extension for the LCM and record anic and
/* Analyze the properties of a use extension for the LCM and record any and
avail occurrences.
This is a subroutine of see_analyze_ref_local_prop called

4
gcc/stmt.c
View file

@ -1,6 +1,6 @@
/* Expands front end tree to back end RTL for GCC
Copyright (C) 1987, 1988, 1989, 1992, 1993, 1994, 1995, 1996, 1997,
1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007
1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008
Free Software Foundation, Inc.
This file is part of GCC.
@ -622,7 +622,7 @@ tree_conflicts_with_clobbers_p (tree t, HARD_REG_SET *clobbered_regs)
STRING is the instruction template.
OUTPUTS is a list of output arguments (lvalues); INPUTS a list of inputs.
Each output or input has an expression in the TREE_VALUE and
and a tree list in TREE_PURPOSE which in turn contains a constraint
a tree list in TREE_PURPOSE which in turn contains a constraint
name in TREE_VALUE (or NULL_TREE) and a constraint string
in TREE_PURPOSE.
CLOBBERS is a list of STRING_CST nodes each naming a hard register

4
gcc/target.h
View file

@ -1,5 +1,5 @@
/* Data structure definitions for a generic GCC target.
Copyright (C) 2001, 2002, 2003, 2004, 2005, 2006, 2007
Copyright (C) 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008
Free Software Foundation, Inc.
This program is free software; you can redistribute it and/or modify it
@ -351,7 +351,7 @@ struct gcc_target
second argument is the cost of the dependence as estimated by
the scheduler. The last argument is the distance in cycles
between the already scheduled insn (first parameter) and the
the second insn (second parameter). */
second insn (second parameter). */
bool (* is_costly_dependence) (struct _dep *_dep, int, int);
/* The following member value is a pointer to a function called

11
gcc/tree-dfa.c
View file

@ -1,5 +1,6 @@
/* Data flow functions for trees.
Copyright (C) 2001, 2002, 2003, 2004, 2005, 2007 Free Software Foundation, Inc.
Copyright (C) 2001, 2002, 2003, 2004, 2005, 2007, 2008 Free Software
Foundation, Inc.
Contributed by Diego Novillo <dnovillo@redhat.com>
This file is part of GCC.
@ -724,7 +725,7 @@ add_referenced_var (tree var)
/* Scan DECL_INITIAL for pointer variables as they may contain
address arithmetic referencing the address of other
variables.
Even non-constant intializers need to be walked, because
Even non-constant initializers need to be walked, because
IPA passes might prove that their are invariant later on. */
if (DECL_INITIAL (var)
/* Initializers of external variables are not useful to the
@ -911,7 +912,7 @@ get_ref_base_and_extent (tree exp, HOST_WIDE_INT *poffset,
{
tree csize = TYPE_SIZE (TREE_TYPE (TREE_OPERAND (exp, 0)));
/* We need to adjust maxsize to the whole structure bitsize.
But we can subtract any constant offset seen sofar,
But we can subtract any constant offset seen so far,
because that would get us out of the structure otherwise. */
if (maxsize != -1 && csize && host_integerp (csize, 1))
maxsize = TREE_INT_CST_LOW (csize) - bit_offset;
@ -949,7 +950,7 @@ get_ref_base_and_extent (tree exp, HOST_WIDE_INT *poffset,
{
tree asize = TYPE_SIZE (TREE_TYPE (TREE_OPERAND (exp, 0)));
/* We need to adjust maxsize to the whole array bitsize.
But we can subtract any constant offset seen sofar,
But we can subtract any constant offset seen so far,
because that would get us outside of the array otherwise. */
if (maxsize != -1 && asize && host_integerp (asize, 1))
maxsize = TREE_INT_CST_LOW (asize) - bit_offset;
@ -1060,7 +1061,7 @@ refs_may_alias_p (tree ref1, tree ref2)
/* If both references are based on different variables, they cannot alias.
If both references are based on the same variable, they cannot alias if
if the accesses do not overlap. */
the accesses do not overlap. */
if (SSA_VAR_P (base1)
&& SSA_VAR_P (base2))
{

5
gcc/tree-eh.c
View file

@ -1,5 +1,6 @@
/* Exception handling semantics and decomposition for trees.
Copyright (C) 2003, 2004, 2005, 2006, 2007 Free Software Foundation, Inc.
Copyright (C) 2003, 2004, 2005, 2006, 2007, 2008 Free Software
Foundation, Inc.
This file is part of GCC.
@ -314,7 +315,7 @@ struct leh_tf_state
size_t goto_queue_size;
size_t goto_queue_active;
/* Pointer map to help in searching qoto_queue when it is large. */
/* Pointer map to help in searching goto_queue when it is large. */
struct pointer_map_t *goto_queue_map;
/* The set of unique labels seen as entries in the goto queue. */

5
gcc/tree-flow-inline.h
View file

@ -1,5 +1,6 @@
/* Inline functions for tree-flow.h
Copyright (C) 2001, 2003, 2005, 2006, 2007 Free Software Foundation, Inc.
Copyright (C) 2001, 2003, 2005, 2006, 2007, 2008 Free Software
Foundation, Inc.
Contributed by Diego Novillo <dnovillo@redhat.com>
This file is part of GCC.
@ -1463,7 +1464,7 @@ link_use_stmts_after (use_operand_p head, imm_use_iterator *imm)
if (USE_FROM_PTR (use_p) == use)
last_p = move_use_after_head (use_p, head, last_p);
}
/* LInk iter node in after last_p. */
/* Link iter node in after last_p. */
if (imm->iter_node.prev != NULL)
delink_imm_use (&imm->iter_node);
link_imm_use_to_list (&(imm->iter_node), last_p);

4
gcc/tree-inline.c
View file

@ -192,7 +192,7 @@ remap_ssa_name (tree name, copy_body_data *id)
/* By inlining function having uninitialized variable, we might
extend the lifetime (variable might get reused). This cause
ICE in the case we end up extending lifetime of SSA name across
abnormal edge, but also increase register presure.
abnormal edge, but also increase register pressure.
We simply initialize all uninitialized vars by 0 except for case
we are inlining to very first BB. We can avoid this for all
@ -1603,7 +1603,7 @@ setup_one_parameter (copy_body_data *id, tree p, tree value, tree fn,
}
/* If VAR represents a zero-sized variable, it's possible that the
assignment statment may result in no gimple statements. */
assignment statement may result in no gimple statements. */
if (init_stmt)
bsi_insert_after (&bsi, init_stmt, BSI_NEW_STMT);
if (gimple_in_ssa_p (cfun))

6
gcc/tree-into-ssa.c
View file

@ -1,5 +1,5 @@
/* Rewrite a program in Normal form into SSA.
Copyright (C) 2001, 2002, 2003, 2004, 2005, 2007
Copyright (C) 2001, 2002, 2003, 2004, 2005, 2007, 2008
Free Software Foundation, Inc.
Contributed by Diego Novillo <dnovillo@redhat.com>
@ -207,7 +207,7 @@ struct ssa_name_info
ENUM_BITFIELD (need_phi_state) need_phi_state : 2;
/* Age of this record (so that info_for_ssa_name table can be cleared
quicky); if AGE < CURRENT_INFO_FOR_SSA_NAME_AGE, then the fields
quickly); if AGE < CURRENT_INFO_FOR_SSA_NAME_AGE, then the fields
are assumed to be null. */
unsigned age;
};
@ -362,7 +362,7 @@ set_current_def (tree var, tree def)
}
/* Compute global livein information given the set of blockx where
/* Compute global livein information given the set of blocks where
an object is locally live at the start of the block (LIVEIN)
and the set of blocks where the object is defined (DEF_BLOCKS).

4
gcc/tree-loop-distribution.c
View file

@ -1,5 +1,5 @@
/* Loop distribution.
Copyright (C) 2006, 2007 Free Software Foundation, Inc.
Copyright (C) 2006, 2007, 2008 Free Software Foundation, Inc.
Contributed by Georges-Andre Silber <Georges-Andre.Silber@ensmp.fr>
and Sebastian Pop <sebastian.pop@amd.com>.
@ -639,7 +639,7 @@ rdg_flag_vertex (struct graph *rdg, int v, bitmap partition, bitmap loops,
}
/* Flag in the bitmap PARTITION the vertex V and all its predecessors.
Alse flag their loop number in LOOPS. */
Also flag their loop number in LOOPS. */
static void
rdg_flag_vertex_and_dependent (struct graph *rdg, int v, bitmap partition,

2
gcc/tree-nested.c
View file

@ -156,7 +156,7 @@ build_addr (tree exp, tree context)
/* Building the ADDR_EXPR will compute a set of properties for
that ADDR_EXPR. Those properties are unfortunately context
specific. ie, they are dependent on CURRENT_FUNCTION_DECL.
specific, i.e., they are dependent on CURRENT_FUNCTION_DECL.
Temporarily set CURRENT_FUNCTION_DECL to the desired context,
build the ADDR_EXPR, then restore CURRENT_FUNCTION_DECL. That

12
gcc/tree-parloops.c
View file

@ -106,7 +106,7 @@ parloop
....
# Storing the the initial value given by the user. #
# Storing the initial value given by the user. #
.paral_data_store.32.sum.27 = 1;
@ -885,7 +885,7 @@ add_field_for_name (void **slot, void *data)
/* Callback for htab_traverse. A local result is the intermediate result
computed by a single
thread, or the intial value in case no iteration was executed.
thread, or the initial value in case no iteration was executed.
This function creates a phi node reflecting these values.
The phi's result will be stored in NEW_PHI field of the
reduction's data structure. */
@ -1043,7 +1043,7 @@ create_loads_for_reductions (void **slot, void *data)
/* Load the reduction result that was stored in LD_ST_DATA.
REDUCTION_LIST describes the list of reductions that the
loades should be generated for. */
loads should be generated for. */
static void
create_final_loads_for_reduction (htab_t reduction_list,
struct clsn_data *ld_st_data)
@ -1416,7 +1416,7 @@ canonicalize_loop_ivs (struct loop *loop, htab_t reduction_list, tree nit)
exit of the loop. NIT is the number of iterations of the loop
(used to initialize the variables in the duplicated part).
TODO: the common case is that latch of the loop is empty and immediatelly
TODO: the common case is that latch of the loop is empty and immediately
follows the loop exit. In this case, it would be better not to copy the
body of the loop, but only move the entry of the loop directly before the
exit check and increase the number of iterations of the loop by one.
@ -1648,7 +1648,7 @@ create_parallel_loop (struct loop *loop, tree loop_fn, tree data,
/* Generates code to execute the iterations of LOOP in N_THREADS threads in
parallel. NITER describes number of iterations of LOOP.
REDUCTION_LIST describes the reductions existant in the LOOP. */
REDUCTION_LIST describes the reductions existent in the LOOP. */
static void
gen_parallel_loop (struct loop *loop, htab_t reduction_list,
@ -1757,7 +1757,7 @@ gen_parallel_loop (struct loop *loop, htab_t reduction_list,
/* Ensure that the exit condition is the first statement in the loop. */
transform_to_exit_first_loop (loop, reduction_list, nit);
/* Generate intializations for reductions. */
/* Generate initializations for reductions. */
if (htab_elements (reduction_list) > 0)
htab_traverse (reduction_list, initialize_reductions, loop);

5
gcc/tree-pass.h
View file

@ -1,5 +1,6 @@
/* Definitions for describing one tree-ssa optimization pass.
Copyright (C) 2004, 2005, 2006, 2007 Free Software Foundation, Inc.
Copyright (C) 2004, 2005, 2006, 2007, 2008 Free Software Foundation,
Inc.
Contributed by Richard Henderson <rth@redhat.com>
This file is part of GCC.
@ -142,7 +143,7 @@ struct gimple_opt_pass
struct opt_pass pass;
};
/* Decription of RTL pass. */
/* Description of RTL pass. */
struct rtl_opt_pass
{
struct opt_pass pass;

2
gcc/tree-pretty-print.c
View file

@ -2253,7 +2253,7 @@ print_declaration (pretty_printer *buffer, tree t, int spc, int flags)
pp_character (buffer, ')');
}
/* The initial value of a function serves to determine wether the function
/* The initial value of a function serves to determine whether the function
is declared or defined. So the following does not apply to function
nodes. */
if (TREE_CODE (t) != FUNCTION_DECL)

2
gcc/tree-profile.c
View file

@ -65,7 +65,7 @@ static GTY(()) tree ptr_void;
/* Add code:
static gcov* __gcov_indirect_call_counters; // pointer to actual counter
static void* __gcov_indirect_call_callee; // actual callee addres
static void* __gcov_indirect_call_callee; // actual callee address
*/
static void
tree_init_ic_make_global_vars (void)

7
gcc/tree-scalar-evolution.c
View file

@ -1,5 +1,6 @@
/* Scalar evolution detector.
Copyright (C) 2003, 2004, 2005, 2006, 2007 Free Software Foundation, Inc.
Copyright (C) 2003, 2004, 2005, 2006, 2007, 2008 Free Software
Foundation, Inc.
Contributed by Sebastian Pop <s.pop@laposte.net>
This file is part of GCC.
@ -2357,7 +2358,7 @@ end:
/* Returns the number of executions of the exit condition of LOOP,
i.e., the number by one higher than number_of_latch_executions.
Note that unline number_of_latch_executions, this number does
Note that unlike number_of_latch_executions, this number does
not necessarily fit in the unsigned variant of the type of
the control variable -- if the number of iterations is a constant,
we return chrec_dont_know if adding one to number_of_latch_executions
@ -2843,7 +2844,7 @@ scev_const_prop (void)
and avoided final value elimination if that is the case. The problem
is that it is hard to evaluate whether the expression is too
expensive, as we do not know what optimization opportunities the
the elimination of the final value may reveal. Therefore, we now
elimination of the final value may reveal. Therefore, we now
eliminate the final values of induction variables unconditionally. */
if (niter == chrec_dont_know)
continue;

6
gcc/tree-sra.c
View file

@ -357,7 +357,7 @@ decl_can_be_decomposed_p (tree var)
/* HACK: if we decompose a va_list_type_node before inlining, then we'll
confuse tree-stdarg.c, and we won't be able to figure out which and
how many arguments are accessed. This really should be improved in
tree-stdarg.c, as the decomposition is truely a win. This could also
tree-stdarg.c, as the decomposition is truly a win. This could also
be fixed if the stdarg pass ran early, but this can't be done until
we've aliasing information early too. See PR 30791. */
if (early_sra
@ -2076,7 +2076,7 @@ generate_one_element_ref (struct sra_elt *elt, tree base)
{
tree field = elt->element;
/* We can't test elt->in_bitfld_blk here because, when this is
/* We can't test elt->in_bitfld_block here because, when this is
called from instantiate_element, we haven't set this field
yet. */
if (TREE_CODE (field) == BIT_FIELD_REF)
@ -2162,7 +2162,7 @@ sra_build_assignment (tree dst, tree src)
var = TREE_OPERAND (src, 0);
width = TREE_OPERAND (src, 1);
/* The offset needs to be adjusted to a right shift quantity
depending on the endianess. */
depending on the endianness. */
if (BYTES_BIG_ENDIAN)
{
tree tmp = size_binop (PLUS_EXPR, width, TREE_OPERAND (src, 2));

4
gcc/tree-ssa-alias-warnings.c
View file

@ -1,5 +1,5 @@
/* Strict aliasing checks.
Copyright (C) 2007 Free Software Foundation, Inc.
Copyright (C) 2007, 2008 Free Software Foundation, Inc.
Contributed by Silvius Rus <rus@google.com>.
This file is part of GCC.
@ -93,7 +93,7 @@
-Wstrict-aliasing=3 (default)
===================
Should have very few false positives and few false negatives.
Takes care of the common punn+dereference pattern in the front end:
Takes care of the common pun+dereference pattern in the front end:
*(int*)&some_float.
Takes care of multiple statement cases in the back end,
using flow-sensitive points-to information (-O required).

4
gcc/tree-ssa-ccp.c
View file

@ -1,5 +1,5 @@
/* Conditional constant propagation pass for the GNU compiler.
Copyright (C) 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007
Copyright (C) 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008
Free Software Foundation, Inc.
Adapted from original RTL SSA-CCP by Daniel Berlin <dberlin@dberlin.org>
Adapted to GIMPLE trees by Diego Novillo <dnovillo@redhat.com>
@ -286,7 +286,7 @@ get_symbol_constant_value (tree sym)
return val;
}
/* Variables declared 'const' without an initializer
have zero as the intializer if they may not be
have zero as the initializer if they may not be
overridden at link or run time. */
if (!val
&& targetm.binds_local_p (sym)

5
gcc/tree-ssa-coalesce.c
View file

@ -1,5 +1,6 @@
/* Coalesce SSA_NAMES together for the out-of-ssa pass.
Copyright (C) 2004, 2005, 2006, 2007 Free Software Foundation, Inc.
Copyright (C) 2004, 2005, 2006, 2007, 2008 Free Software Foundation,
Inc.
Contributed by Andrew MacLeod <amacleod@redhat.com>
This file is part of GCC.
@ -582,7 +583,7 @@ ssa_conflicts_merge (ssa_conflicts_p ptr, unsigned x, unsigned y)
return;
/* Add a conflict between X and every one Y has. If the bitmap doesn't
exist, then it has already been coalesced, and we dont need to add a
exist, then it has already been coalesced, and we don't need to add a
conflict. */
EXECUTE_IF_SET_IN_BITMAP (ptr->conflicts[y], 0, z, bi)
if (ptr->conflicts[z])

8
gcc/tree-ssa-dom.c
View file

@ -1,5 +1,5 @@
/* SSA Dominator optimizations for trees
Copyright (C) 2001, 2002, 2003, 2004, 2005, 2006, 2007
Copyright (C) 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008
Free Software Foundation, Inc.
Contributed by Diego Novillo <dnovillo@redhat.com>
@ -283,7 +283,7 @@ tree_ssa_dominator_optimize (void)
loop_optimizer_init (LOOPS_HAVE_SIMPLE_LATCHES);
/* We need accurate information regarding back edges in the CFG
for jump threading; this may include back edes that are not part of
for jump threading; this may include back edges that are not part of
a single loop. */
mark_dfs_back_edges ();
@ -610,7 +610,7 @@ dom_opt_finalize_block (struct dom_walk_data *walk_data, basic_block bb)
/* If we have an outgoing edge to a block with multiple incoming and
outgoing edges, then we may be able to thread the edge. ie, we
outgoing edges, then we may be able to thread the edge, i.e., we
may be able to statically determine which of the outgoing edges
will be traversed when the incoming edge from BB is traversed. */
if (single_succ_p (bb)
@ -1360,7 +1360,7 @@ record_edge_info (basic_block bb)
tree op1 = TREE_OPERAND (cond, 1);
/* Special case comparing booleans against a constant as we
know the value of OP0 on both arms of the branch. i.e., we
know the value of OP0 on both arms of the branch, i.e., we
can record an equivalence for OP0 rather than COND. */
if ((TREE_CODE (cond) == EQ_EXPR || TREE_CODE (cond) == NE_EXPR)
&& TREE_CODE (op0) == SSA_NAME

7
gcc/tree-ssa-dse.c
View file

@ -1,5 +1,6 @@
/* Dead store elimination
Copyright (C) 2004, 2005, 2006, 2007 Free Software Foundation, Inc.
Copyright (C) 2004, 2005, 2006, 2007, 2008 Free Software Foundation,
Inc.
This file is part of GCC.
@ -207,7 +208,7 @@ memory_address_same (tree store1, tree store2)
}
/* Return true if there is a stmt that kills the lhs of STMT and is in the
virtual def-use chain of STMT without a use inbetween the kill and STMT.
virtual def-use chain of STMT without a use in between the kill and STMT.
Returns false if no such stmt is found.
*FIRST_USE_P is set to the first use of the single virtual def of
STMT. *USE_P is set to the vop killed by *USE_STMT. */
@ -691,7 +692,7 @@ execute_simple_dse (void)
if (TREE_THIS_VOLATILE (op))
dead = false;
/* Look for possible occurence var = indirect_ref (...) where
/* Look for possible occurrence var = indirect_ref (...) where
indirect_ref itself is volatile. */
if (dead && TREE_THIS_VOLATILE (GIMPLE_STMT_OPERAND (stmt, 1)))

Some files were not shown because too many files have changed in this diff Show more