diff options
| -rw-r--r-- | gcc/ChangeLog | 34 | ||||
| -rw-r--r-- | gcc/bt-load.c | 2 | ||||
| -rw-r--r-- | gcc/c-incpath.c | 2 | ||||
| -rw-r--r-- | gcc/cfg.c | 2 | ||||
| -rw-r--r-- | gcc/cfgcleanup.c | 2 | ||||
| -rw-r--r-- | gcc/cfgloop.h | 2 | ||||
| -rw-r--r-- | gcc/cfgloopmanip.c | 2 | ||||
| -rw-r--r-- | gcc/cfgrtl.c | 2 | ||||
| -rw-r--r-- | gcc/diagnostic.h | 2 | ||||
| -rw-r--r-- | gcc/dwarfout.c | 2 | ||||
| -rw-r--r-- | gcc/emit-rtl.c | 4 | ||||
| -rw-r--r-- | gcc/et-forest.c | 2 | ||||
| -rw-r--r-- | gcc/et-forest.h | 2 | ||||
| -rw-r--r-- | gcc/expr.c | 2 | ||||
| -rw-r--r-- | gcc/gcse.c | 2 | ||||
| -rw-r--r-- | gcc/genattr.c | 2 | ||||
| -rw-r--r-- | gcc/jump.c | 2 | ||||
| -rw-r--r-- | gcc/langhooks.h | 2 | ||||
| -rw-r--r-- | gcc/local-alloc.c | 4 | ||||
| -rw-r--r-- | gcc/loop-unroll.c | 2 | ||||
| -rw-r--r-- | gcc/loop-unswitch.c | 2 | ||||
| -rw-r--r-- | gcc/ra-build.c | 2 | ||||
| -rw-r--r-- | gcc/regclass.c | 2 | ||||
| -rw-r--r-- | gcc/regmove.c | 2 | ||||
| -rw-r--r-- | gcc/rtl.def | 2 | ||||
| -rw-r--r-- | gcc/rtlanal.c | 2 | ||||
| -rw-r--r-- | gcc/sched-ebb.c | 4 | ||||
| -rw-r--r-- | gcc/sched-rgn.c | 2 | ||||
| -rw-r--r-- | gcc/simplify-rtx.c | 2 | ||||
| -rw-r--r-- | gcc/ssa.c | 6 | ||||
| -rw-r--r-- | gcc/tracer.c | 2 | ||||
| -rw-r--r-- | gcc/tree.c | 2 |
32 files changed, 70 insertions, 36 deletions
diff --git a/gcc/ChangeLog b/gcc/ChangeLog index dc56966..a1e1227 100644 --- a/gcc/ChangeLog +++ b/gcc/ChangeLog @@ -1,3 +1,37 @@ +2003-07-05 Kazu Hirata <kazu@cs.umass.edu> + + * bt-load.c: Fix comment typos. + * c-incpath.c: Likewise. + * cfg.c: Likewise. + * cfgcleanup.c: Likewise. + * cfgloop.h: Likewise. + * cfgloopmanip.c: Likewise. + * cfgrtl.c: Likewise. + * diagnostic.h: Likewise. + * dwarfout.c: Likewise. + * emit-rtl.c: Likewise. + * et-forest.c: Likewise. + * et-forest.h: Likewise. + * expr.c: Likewise. + * gcse.c: Likewise. + * genattr.c: Likewise. + * jump.c: Likewise. + * langhooks.h: Likewise. + * local-alloc.c: Likewise. + * loop-unroll.c: Likewise. + * loop-unswitch.c: Likewise. + * ra-build.c: Likewise. + * regclass.c: Likewise. + * regmove.c: Likewise. + * rtl.def: Likewise. + * rtlanal.c: Likewise. + * sched-ebb.c: Likewise. + * sched-rgn.c: Likewise. + * simplify-rtx.c: Likewise. + * ssa.c: Likewise. + * tracer.c: Likewise. + * tree.c: Likewise. + 2003-07-05 Zack Weinberg <zack@codesourcery.com> * cppcharset.c: Use the correct return type for the fallback iconv diff --git a/gcc/bt-load.c b/gcc/bt-load.c index 180a8ba..4bcf76c 100644 --- a/gcc/bt-load.c +++ b/gcc/bt-load.c @@ -1157,7 +1157,7 @@ can_move_up (basic_block bb, rtx insn, int n_insns) MIN_COST is the lower bound on the cost of the DEF after migration. If we migrate DEF so that its cost falls below MIN_COST, then we do not attempt to migrate further. The idea is that - we migrate defintions in a priority order based on their cost, + we migrate definitions in a priority order based on their cost, when the cost of this definition falls below MIN_COST, then there is another definition with cost == MIN_COST which now has a higher priority than this definition. diff --git a/gcc/c-incpath.c b/gcc/c-incpath.c index 3776530..efcd19b 100644 --- a/gcc/c-incpath.c +++ b/gcc/c-incpath.c @@ -208,7 +208,7 @@ remove_duplicates (cpp_reader *pfile, struct cpp_path *head, if (!tmp) { - /* Dupicate of something earlier in the same chain? */ + /* Duplicate of something earlier in the same chain? */ reason = REASON_DUP; for (tmp = head; tmp != cur; tmp = tmp->next) if (INO_T_EQ (cur->ino, tmp->ino) && cur->dev == tmp->dev) @@ -20,7 +20,7 @@ Software Foundation, 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. */ /* This file contains low level functions to manipulate the CFG and - analyze it. All other modules should not transform the datastructure + analyze it. All other modules should not transform the data structure directly and use abstraction instead. The file is supposed to be ordered bottom-up and should not contain any code dependent on a particular intermediate language (RTL or trees). diff --git a/gcc/cfgcleanup.c b/gcc/cfgcleanup.c index da874f7..7dbed9b 100644 --- a/gcc/cfgcleanup.c +++ b/gcc/cfgcleanup.c @@ -769,7 +769,7 @@ merge_blocks_move_successor_nojumps (basic_block a, basic_block b) It may be good idea to return basic block before C in the case C has been moved after B and originally appeared earlier in the - insn seqeunce, but we have no infromation available about the + insn sequence, but we have no information available about the relative ordering of these two. Hopefully it is not too common. */ static basic_block diff --git a/gcc/cfgloop.h b/gcc/cfgloop.h index 3fdc609..e879e52 100644 --- a/gcc/cfgloop.h +++ b/gcc/cfgloop.h @@ -266,7 +266,7 @@ extern int flow_loop_scan (struct loops *, struct loop *, int); extern void flow_loop_free (struct loop *); void mark_irreducible_loops (struct loops *); -/* Loop datastructure manipulation/querying. */ +/* Loop data structure manipulation/querying. */ extern void flow_loop_tree_node_add (struct loop *, struct loop *); extern void flow_loop_tree_node_remove (struct loop *); extern bool flow_loop_outside_edge_p (const struct loop *, edge); diff --git a/gcc/cfgloopmanip.c b/gcc/cfgloopmanip.c index 6075b4c..8892720 100644 --- a/gcc/cfgloopmanip.c +++ b/gcc/cfgloopmanip.c @@ -169,7 +169,7 @@ fix_bb_placement (struct loops *loops, basic_block bb) his placement no longer has to be correct, and iteratively fix placement of its predecessors that may change if placement of FROM changed. Also fix placement of subloops of FROM->loop_father, that might also be altered due - to this change; the condition for them is simmilar, except that instead of + to this change; the condition for them is similar, except that instead of successors we consider edges coming out of the loops. */ static void fix_bb_placements (struct loops *loops, basic_block from) diff --git a/gcc/cfgrtl.c b/gcc/cfgrtl.c index 1f878ee..09e2e1c 100644 --- a/gcc/cfgrtl.c +++ b/gcc/cfgrtl.c @@ -1340,7 +1340,7 @@ rtl_split_edge (edge edge_in) make_single_succ_edge (bb, edge_in->dest, EDGE_FALLTHRU); - /* For non-fallthry edges, we must adjust the predecessor's + /* For non-fallthru edges, we must adjust the predecessor's jump instruction to target our new block. */ if ((edge_in->flags & EDGE_FALLTHRU) == 0) { diff --git a/gcc/diagnostic.h b/gcc/diagnostic.h index 73a3bd9..cd0ceba 100644 --- a/gcc/diagnostic.h +++ b/gcc/diagnostic.h @@ -34,7 +34,7 @@ typedef struct int err_no; /* for %m */ } text_info; -/* Contants used to discriminate diagnostics. */ +/* Constants used to discriminate diagnostics. */ typedef enum { #define DEFINE_DIAGNOSTIC_KIND(K, M) K, diff --git a/gcc/dwarfout.c b/gcc/dwarfout.c index 02159a9..caed460 100644 --- a/gcc/dwarfout.c +++ b/gcc/dwarfout.c @@ -2182,7 +2182,7 @@ output_loc_descriptor (rtx rtl) /* Given a tree node describing an array bound (either lower or upper) output a representation for that bound. DIM_NUM is used for - multi-dimensional arrays and U_OR_L disgnates upper or lower + multi-dimensional arrays and U_OR_L designates upper or lower bound. */ static void diff --git a/gcc/emit-rtl.c b/gcc/emit-rtl.c index 2cc83ea..d191b28 100644 --- a/gcc/emit-rtl.c +++ b/gcc/emit-rtl.c @@ -912,7 +912,7 @@ set_decl_rtl (tree t, rtx x) if (!x) return; - /* For register, we maitain the reverse information too. */ + /* For register, we maintain the reverse information too. */ if (GET_CODE (x) == REG) REG_ATTRS (x) = get_reg_attrs (t, 0); else if (GET_CODE (x) == SUBREG) @@ -2241,7 +2241,7 @@ offset_address (rtx memref, rtx offset, unsigned HOST_WIDE_INT pow2) new = simplify_gen_binary (PLUS, Pmode, addr, offset); /* At this point we don't know _why_ the address is invalid. It - could have secondary memory refereces, multiplies or anything. + could have secondary memory references, multiplies or anything. However, if we did go and rearrange things, we can wind up not being able to recognize the magic around pic_offset_table_rtx. diff --git a/gcc/et-forest.c b/gcc/et-forest.c index 1d5cd26..ffdce1d 100644 --- a/gcc/et-forest.c +++ b/gcc/et-forest.c @@ -1,4 +1,4 @@ -/* ET-trees datastructure implementation. +/* ET-trees data structure implementation. Contributed by Pavel Nejedly Copyright (C) 2002, 2003 Free Software Foundation, Inc. diff --git a/gcc/et-forest.h b/gcc/et-forest.h index 7f73439..66aec48 100644 --- a/gcc/et-forest.h +++ b/gcc/et-forest.h @@ -20,7 +20,7 @@ Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. */ for tree operations (insertion and removal of nodes and edges) and poly-logarithmic time for nearest common ancestor. - ET tree strores its structue as a sequence of symbols obtained + ET tree stores its structue as a sequence of symbols obtained by dfs(root) dfs (node) @@ -4398,7 +4398,7 @@ store_expr (tree exp, rtx target, int want_value) { /* C++ can generate ?: expressions with a throw expression in one branch and an rvalue in the other. Here, we resolve attempts to - store the throw expression's nonexistant result. */ + store the throw expression's nonexistent result. */ if (want_value) abort (); expand_expr (exp, const0_rtx, VOIDmode, 0); @@ -5327,7 +5327,7 @@ insert_insn_end_bb (expr, bb, pre) pat_end = NEXT_INSN (pat_end); /* If the last insn is a jump, insert EXPR in front [taking care to - handle cc0, etc. properly]. Similary we need to care trapping + handle cc0, etc. properly]. Similarly we need to care trapping instructions in presence of non-call exceptions. */ if (GET_CODE (insn) == JUMP_INSN diff --git a/gcc/genattr.c b/gcc/genattr.c index 5877516..cccacba 100644 --- a/gcc/genattr.c +++ b/gcc/genattr.c @@ -165,7 +165,7 @@ write_units (int num_units, struct range *multiplicity, struct range *simultanei printf ("#define BLOCKAGE_BITS %d\n", i + 1); /* INSN_QUEUE_SIZE is a power of two larger than MAX_BLOCKAGE and - MAX_READY_COST. This is the longest time an isnsn may be queued. */ + MAX_READY_COST. This is the longest time an insn may be queued. */ i = MAX (blockage->max, ready_cost->max); for (q_size = 1; q_size <= i; q_size <<= 1) ; @@ -681,7 +681,7 @@ reversed_comparison_code_parts (code, arg0, arg1, insn) case NE: case EQ: /* It is always safe to reverse EQ and NE, even for the floating - point. Similary the unsigned comparisons are never used for + point. Similarly the unsigned comparisons are never used for floating point so we can reverse them in the default way. */ return reverse_condition (code); case ORDERED: diff --git a/gcc/langhooks.h b/gcc/langhooks.h index eadff12..d0abc29 100644 --- a/gcc/langhooks.h +++ b/gcc/langhooks.h @@ -211,7 +211,7 @@ struct lang_hooks /* Handle the switch CODE, which has real type enum opt_code from options.h. If the switch takes an argument, it is passed in ARG - which points to permanent storage. The handler is resonsible for + which points to permanent storage. The handler is responsible for checking whether ARG is NULL, which indicates that no argument was in fact supplied. For -f and -W switches, VALUE is 1 or 0 for the positive and negative forms respectively. diff --git a/gcc/local-alloc.c b/gcc/local-alloc.c index 8e06b8d..3881e40 100644 --- a/gcc/local-alloc.c +++ b/gcc/local-alloc.c @@ -922,7 +922,7 @@ update_equiv_regs () || (CLASS_LIKELY_SPILLED_P (reg_preferred_class (regno)) && GET_CODE (src) == MEM)) { - /* This might be seting a SUBREG of a pseudo, a pseudo that is + /* This might be setting a SUBREG of a pseudo, a pseudo that is also set somewhere else to a constant. */ note_stores (set, no_equiv, NULL); continue; @@ -1035,7 +1035,7 @@ update_equiv_regs () registers only used that once. If so, see if we can replace the reference with the equivalent from. If we can, delete the initializing reference and this register will go away. If we - can't replace the reference, and the initialzing reference is + can't replace the reference, and the initializing reference is within the same loop (or in an inner loop), then move the register initialization just before the use, so that they are in the same basic block. */ diff --git a/gcc/loop-unroll.c b/gcc/loop-unroll.c index b8c035f..a0f253b 100644 --- a/gcc/loop-unroll.c +++ b/gcc/loop-unroll.c @@ -35,7 +35,7 @@ Software Foundation, 59 Temple Place - Suite 330, Boston, MA optimizations on innermost loops (with single exception) because the impact on performance is greatest here, and we want to avoid unnecessary code size growth. The gain is caused by greater sequentiality - of code, better code to optimize for futher passes and in some cases + of code, better code to optimize for further passes and in some cases by fewer testings of exit conditions. The main problem is code growth, that impacts performance negatively due to effect of caches. diff --git a/gcc/loop-unswitch.c b/gcc/loop-unswitch.c index 202cbff..05ac83e 100644 --- a/gcc/loop-unswitch.c +++ b/gcc/loop-unswitch.c @@ -410,7 +410,7 @@ unswitch_loop (loops, loop, unswitch_on) remove_path (loops, unswitch_on_alt->succ); /* One of created loops do not have to be subloop of the outer loop now, - so fix its placement in loop datastructure. */ + so fix its placement in loop data structure. */ fix_loop_placement (loop); fix_loop_placement (nloop); diff --git a/gcc/ra-build.c b/gcc/ra-build.c index c4cc59a..e6f846a 100644 --- a/gcc/ra-build.c +++ b/gcc/ra-build.c @@ -667,7 +667,7 @@ defuse_overlap_p_1 (def, use) if they refer to the same word. */ if (SUBREG_BYTE (def) == SUBREG_BYTE (use->x)) return 1; - /* Now the more difficult part: the same regno is refered, but the + /* Now the more difficult part: the same regno is referred, but the sizes of the references or the words differ. E.g. (subreg:SI (reg:CDI a) 0) and (subreg:DI (reg:CDI a) 2) do not overlap, whereas the latter overlaps with (subreg:SI (reg:CDI a) 3). diff --git a/gcc/regclass.c b/gcc/regclass.c index e587f71..32ef9cc 100644 --- a/gcc/regclass.c +++ b/gcc/regclass.c @@ -1828,7 +1828,7 @@ record_reg_classes (n_alts, n_ops, ops, modes, 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 coliding registers into single + register allocator by preferrencing two colliding registers into single class. Also avoid the adjustment if a copy between registers of the class diff --git a/gcc/regmove.c b/gcc/regmove.c index 0c3c25d..bdd7ae8 100644 --- a/gcc/regmove.c +++ b/gcc/regmove.c @@ -2070,7 +2070,7 @@ fixup_match_1 (insn, set, src, src_subreg, dst, backward, operand_number, } -/* return nonzero if X is stable and mentions no regsiters but for +/* return nonzero if X is stable and mentions no registers but for mentioning SRC or mentioning / changing DST . If in doubt, presume it is unstable. The rationale is that we want to check if we can move an insn easily diff --git a/gcc/rtl.def b/gcc/rtl.def index 1388b6ffd..54b6940 100644 --- a/gcc/rtl.def +++ b/gcc/rtl.def @@ -528,7 +528,7 @@ DEF_RTL_EXPR(DEFINE_RESERVATION, "define_reservation", "ss", 'x') first regular expression *and* the reservation described by the second regular expression *and* etc. - 4. "*" is used for convinience and simply means sequence in + 4. "*" is used for convenience and simply means sequence in which the regular expression are repeated NUMBER times with cycle advancing (see ","). diff --git a/gcc/rtlanal.c b/gcc/rtlanal.c index 8ad6281..de228e3 100644 --- a/gcc/rtlanal.c +++ b/gcc/rtlanal.c @@ -3693,7 +3693,7 @@ can_hoist_insn_p (insn, val, live) break; case USE: /* We need to fix callers to really ensure availability - of all values inisn uses, but for now it is safe to prohibit + of all values insn uses, but for now it is safe to prohibit hoisting of any insn having such a hidden uses. */ return false; break; diff --git a/gcc/sched-ebb.c b/gcc/sched-ebb.c index d27630e..7f44866 100644 --- a/gcc/sched-ebb.c +++ b/gcc/sched-ebb.c @@ -290,7 +290,7 @@ fix_basic_block_boundaries (bb, last, head, tail) it by splitting the edge and repositioning the block. This is somewhat hackish, but at least avoid cut&paste - Safter sollution can be to bring the code into sequence, + A safer solution can be to bring the code into sequence, do the split and re-emit it back in case this will ever trigger problem. */ f = bb->prev_bb->succ; @@ -410,7 +410,7 @@ earliest_block_with_similiar_load (last_block, load_insn) return earliest_block; } -/* The following function adds dependecies between jumps and risky +/* The following function adds dependencies between jumps and risky insns in given ebb. */ static void diff --git a/gcc/sched-rgn.c b/gcc/sched-rgn.c index c7e7f80..8310243 100644 --- a/gcc/sched-rgn.c +++ b/gcc/sched-rgn.c @@ -142,7 +142,7 @@ static int *rgn_bb_table; /* Topological order of blocks in the region (if b2 is reachable from b1, block_to_bb[b2] > block_to_bb[b1]). Note: A basic block is always referred to by either block or b, while its topological - order name (in the region) is refered to by bb. */ + order name (in the region) is referred to by bb. */ static int *block_to_bb; /* The number of the region containing a block. */ diff --git a/gcc/simplify-rtx.c b/gcc/simplify-rtx.c index f49f53d..0b584ae 100644 --- a/gcc/simplify-rtx.c +++ b/gcc/simplify-rtx.c @@ -2897,7 +2897,7 @@ simplify_subreg (outermode, op, innermode, byte) return NULL_RTX; } - /* Recurse for futher possible simplifications. */ + /* Recurse for further possible simplifications. */ new = simplify_subreg (outermode, SUBREG_REG (op), GET_MODE (SUBREG_REG (op)), final_offset); @@ -142,7 +142,7 @@ static void ssa_rename_from_free typedef int (*srf_trav) PARAMS ((int regno, rtx r, sbitmap canonical_elements, partition reg_partition)); static void ssa_rename_from_traverse PARAMS ((htab_trav callback_function, sbitmap canonical_elements, partition reg_partition)); -/*static Avoid warnign message. */ void ssa_rename_from_print +/*static Avoid warning message. */ void ssa_rename_from_print PARAMS ((void)); static int ssa_rename_from_print_1 PARAMS ((void **slot, void *data)); @@ -360,7 +360,7 @@ ssa_rename_from_print () } /* Print the contents of the hash table entry SLOT, passing the unused - sttribute DATA. Used as a callback function with htab_traverse (). */ + attribute DATA. Used as a callback function with htab_traverse (). */ static int ssa_rename_from_print_1 (slot, data) @@ -1568,7 +1568,7 @@ make_regs_equivalent_over_bad_edges (bb, reg_partition) } /* Consider phi insns in basic block BB pairwise. If the set target - of both isns are equivalent pseudos, make the corresponding phi + of both insns are equivalent pseudos, make the corresponding phi alternatives in each phi corresponding equivalent. Return nonzero if any new register classes were unioned. */ diff --git a/gcc/tracer.c b/gcc/tracer.c index ba1f09e..a0164dd 100644 --- a/gcc/tracer.c +++ b/gcc/tracer.c @@ -316,7 +316,7 @@ tail_duplicate () fibheap_delete (heap); } -/* Connect the superblocks into linear seuqence. At the moment we attempt to keep +/* Connect the superblocks into linear sequence. At the moment we attempt to keep the original order as much as possible, but the algorithm may be made smarter later if needed. BB reordering pass should void most of the benefits of such change though. */ @@ -5080,7 +5080,7 @@ build_common_tree_nodes_2 (short_double) tree t; BUILD_VA_LIST_TYPE (t); - /* Many back-ends define record types without seting TYPE_NAME. + /* Many back-ends define record types without setting TYPE_NAME. If we copied the record type here, we'd keep the original record type without a name. This breaks name mangling. So, don't copy record types and let c_common_nodes_and_builtins() |