diff options
| -rw-r--r-- | gcc/ChangeLog | 6 | ||||
| -rw-r--r-- | gcc/c-common.c | 2 | ||||
| -rw-r--r-- | gcc/c-pretty-print.c | 2 | ||||
| -rw-r--r-- | gcc/cfgcleanup.c | 2 | ||||
| -rw-r--r-- | gcc/cgraphunit.c | 6 | ||||
| -rw-r--r-- | gcc/expmed.c | 2 | ||||
| -rw-r--r-- | gcc/ggc-common.c | 9 | ||||
| -rw-r--r-- | gcc/jump.c | 6 | ||||
| -rw-r--r-- | gcc/passes.c | 2 | ||||
| -rw-r--r-- | gcc/recog.c | 2 | ||||
| -rw-r--r-- | gcc/regmove.c | 2 | ||||
| -rw-r--r-- | gcc/reorg.c | 2 | ||||
| -rw-r--r-- | gcc/tree.h | 2 |
13 files changed, 26 insertions, 19 deletions
diff --git a/gcc/ChangeLog b/gcc/ChangeLog index 4be5285..292b956 100644 --- a/gcc/ChangeLog +++ b/gcc/ChangeLog @@ -1,3 +1,9 @@ +2004-03-20 Kazu Hirata <kazu@cs.umass.edu> + + * c-common.c, cfgcleanup.c, cgraphunit.c, c-pretty-print.c, + expmed.c, ggc-common.c, jump.c, passes.c, recog.c, regmove.c, + reorg.c, tree.h: Fix comment typos. + 2004-03-19 Kazu Hirata <kazu@cs.umass.edu> * alias.c, attribs.c, bt-load.c, builtins.c, c-common.c, diff --git a/gcc/c-common.c b/gcc/c-common.c index e21d5bd..5f79d37 100644 --- a/gcc/c-common.c +++ b/gcc/c-common.c @@ -2229,7 +2229,7 @@ shorten_compare (tree *op0_ptr, tree *op1_ptr, tree *restype_ptr, TREE_TYPE (primop0)); /* In C, if TYPE is an enumeration, then we need to get its - min/max values from it's underlying integral type, not the + min/max values from its underlying integral type, not the enumerated type itself. In C++, TYPE_MAX_VALUE and TYPE_MIN_VALUE have already been set correctly on the enumeration type. */ diff --git a/gcc/c-pretty-print.c b/gcc/c-pretty-print.c index 94869b4..51e34e7 100644 --- a/gcc/c-pretty-print.c +++ b/gcc/c-pretty-print.c @@ -932,7 +932,7 @@ pp_c_constant (c_pretty_printer *pp, tree e) } } -/* Pretty-print an IDENTIFIER_NODE, precedeed by whitespace is necessary. */ +/* Pretty-print an IDENTIFIER_NODE, preceded by whitespace is necessary. */ void pp_c_identifier (c_pretty_printer *pp, const char *id) diff --git a/gcc/cfgcleanup.c b/gcc/cfgcleanup.c index 9029b5f..3cde9b2 100644 --- a/gcc/cfgcleanup.c +++ b/gcc/cfgcleanup.c @@ -23,7 +23,7 @@ Software Foundation, 59 Temple Place - Suite 330, Boston, MA cleanup_cfg. Following optimizations are performed: - Unreachable blocks removal - - Edge forwarding (edge to the forwarder block is forwarded to it's + - Edge forwarding (edge to the forwarder block is forwarded to its successor. Simplification of the branch instruction is performed by underlying infrastructure so branch can be converted to simplejump or eliminated). diff --git a/gcc/cgraphunit.c b/gcc/cgraphunit.c index 2ebc4d7..f871ef4 100644 --- a/gcc/cgraphunit.c +++ b/gcc/cgraphunit.c @@ -398,7 +398,7 @@ cgraph_finalize_compilation_unit (void) cgraph_nodes_queue = cgraph_nodes_queue->next_needed; /* ??? It is possible to create extern inline function and later using - weak alas attribute to kill it's body. See + weak alas attribute to kill its body. See gcc.c-torture/compile/20011119-1.c */ if (!DECL_SAVED_TREE (decl)) continue; @@ -1508,7 +1508,7 @@ cgraph_inline_p (tree caller_decl, tree callee_decl, const char **reason) Attempt to topologically sort the nodes so function is output when all called functions are already assembled to allow data to be propagated across the callgraph. Use a stack to get smaller distance - between a function and it's callees (later we may choose to use a more + between a function and its callees (later we may choose to use a more sophisticated algorithm for function reordering; we will likely want to use subsections to make the output functions appear in top-down order). */ @@ -1543,7 +1543,7 @@ cgraph_expand_all_functions (void) /* Mark all local functions. A local function is one whose calls can occur only in the - current compilation unit and all it's calls are explicit, + current compilation unit and all its calls are explicit, so we can change its calling convention. We simply mark all static functions whose address is not taken as local. */ diff --git a/gcc/expmed.c b/gcc/expmed.c index da0a9fe..bb42ce9 100644 --- a/gcc/expmed.c +++ b/gcc/expmed.c @@ -2409,7 +2409,7 @@ synth_mult (struct algorithm *alg_out, unsigned HOST_WIDE_INT t, alg_out->ops * sizeof *alg_out->log); } -/* Find the cheapeast way of multiplying a value of mode MODE by VAL. +/* Find the cheapest way of multiplying a value of mode MODE by VAL. Try three variations: - a shift/add sequence based on VAL itself diff --git a/gcc/ggc-common.c b/gcc/ggc-common.c index d8a8039..4939cb6 100644 --- a/gcc/ggc-common.c +++ b/gcc/ggc-common.c @@ -615,7 +615,7 @@ default_gt_pch_use_address (void *base, size_t size, int fd ATTRIBUTE_UNUSED, #if HAVE_MMAP_FILE /* Default version of HOST_HOOKS_GT_PCH_GET_ADDRESS when mmap is present. We temporarily allocate SIZE bytes, and let the kernel place the data - whereever it will. If it worked, that's our spot, if not we're likely + wherever it will. If it worked, that's our spot, if not we're likely to be in trouble. */ void * @@ -793,9 +793,10 @@ loc_descriptor (const char *name, int line, const char *function) return *slot; } -/* Record ALLOCATED and OVERHEAD bytes to descritor NAME:LINE (FUNCTION). */ -void ggc_record_overhead (size_t allocated, size_t overhead, - const char *name, int line, const char *function) +/* Record ALLOCATED and OVERHEAD bytes to descriptor NAME:LINE (FUNCTION). */ +void +ggc_record_overhead (size_t allocated, size_t overhead, + const char *name, int line, const char *function) { struct loc_descriptor *loc = loc_descriptor (name, line, function); @@ -645,9 +645,9 @@ reversed_comparison_code_parts (enum rtx_code code, rtx arg0, rtx arg1, rtx insn if (mode == VOIDmode) mode = GET_MODE (arg1); - /* First see if machine description supply us way to reverse the comparison. - Give it priority over everything else to allow machine description to do - tricks. */ + /* First see if machine description supplies us way to reverse the + comparison. Give it priority over everything else to allow + machine description to do tricks. */ if (GET_MODE_CLASS (mode) == MODE_CC && REVERSIBLE_CC_MODE (mode)) { diff --git a/gcc/passes.c b/gcc/passes.c index f70cb85..5ee44d4 100644 --- a/gcc/passes.c +++ b/gcc/passes.c @@ -1677,7 +1677,7 @@ rest_of_compilation (tree decl) #ifdef SETJMP_VIA_SAVE_AREA /* This must be performed before virtual register instantiation. - Please be aware the everything in the compiler that can look + Please be aware that everything in the compiler that can look at the RTL up to this point must understand that REG_SAVE_AREA is just like a use of the REG contained inside. */ if (current_function_calls_alloca) diff --git a/gcc/recog.c b/gcc/recog.c index c3cf522..6d6135a 100644 --- a/gcc/recog.c +++ b/gcc/recog.c @@ -1591,7 +1591,7 @@ decode_asm_operands (rtx body, rtx *operands, rtx **operand_locs, return template; } -/* Check if an asm_operand matches it's constraints. +/* Check if an asm_operand matches its constraints. Return > 0 if ok, = 0 if bad, < 0 if inconclusive. */ int diff --git a/gcc/regmove.c b/gcc/regmove.c index 671d9c8..13a6d39 100644 --- a/gcc/regmove.c +++ b/gcc/regmove.c @@ -291,7 +291,7 @@ mark_flags_life_zones (rtx flags) #endif PUT_MODE (insn, (live ? HImode : VOIDmode)); - /* In either case, birth is denoted simply by it's presence + /* In either case, birth is denoted simply by its presence as the destination of a set. */ flags_set_1_set = 0; note_stores (PATTERN (insn), flags_set_1, NULL); diff --git a/gcc/reorg.c b/gcc/reorg.c index cab9d46..9a58d34 100644 --- a/gcc/reorg.c +++ b/gcc/reorg.c @@ -3170,7 +3170,7 @@ relax_delay_slots (rtx first) /* See if we have a RETURN insn with a filled delay slot followed by a RETURN insn with an unfilled a delay slot. If so, we can delete - the first RETURN (but not it's delay insn). This gives the same + the first RETURN (but not its delay insn). This gives the same effect in fewer instructions. Only do so if optimizing for size since this results in slower, but @@ -1000,7 +1000,7 @@ struct tree_block GTY(()) /* See tree.def for documentation of the use of these fields. Look at the documentation of the various ..._TYPE tree codes. - Note that the type.values, type.minval, and type.maxval fiels are + Note that the type.values, type.minval, and type.maxval fields are overloaded and used for different macros in different kinds of types. Each macro must check to ensure the tree node is of the proper kind of type. Note also that some of the front-ends also overload these fields, |