From 5d3cc252060adbc8457b1d1b9fb30c1fa7803c4a Mon Sep 17 00:00:00 2001 From: Kazu Hirata Date: Tue, 6 Jan 2004 16:51:21 +0000 Subject: [PATCH] alias.c: Fix comment typos. * alias.c: Fix comment typos. * builtins.c: Likewise. * cfg.c: Likewise. * df.c: Likewise. * dominance.c: Likewise. * dwarf2out.c: Likewise. * emit-rtl.c: Likewise. * expr.c: Likewise. * final.c: Likewise. * fold-const.c: Likewise. * gcse.c: Likewise. * genattrtab.c: Likewise. * genrecog.c: Likewise. * gensupport.c: Likewise. * ggc-zone.c: Likewise. * integrate.c: Likewise. * local-alloc.c: Likewise. * loop.c: Likewise. * recog.c: Likewise. * regmove.c: Likewise. * reg-stack.c: Likewise. * reorg.c: Likewise. * rtlanal.c: Likewise. * rtl.h: Likewise. * sched-ebb.c: Likewise. * simplify-rtx.c: Likewise. * toplev.c: Likewise. * varasm.c: Likewise. From-SVN: r75475 --- gcc/ChangeLog | 31 +++++++++++++++++++++++++++++++ gcc/alias.c | 6 +++--- gcc/builtins.c | 2 +- gcc/cfg.c | 2 +- gcc/df.c | 2 +- gcc/dominance.c | 4 ++-- gcc/dwarf2out.c | 2 +- gcc/emit-rtl.c | 2 +- gcc/expr.c | 2 +- gcc/final.c | 2 +- gcc/fold-const.c | 2 +- gcc/gcse.c | 2 +- gcc/genattrtab.c | 2 +- gcc/genrecog.c | 6 +++--- gcc/gensupport.c | 6 +++--- gcc/ggc-zone.c | 2 +- gcc/integrate.c | 2 +- gcc/local-alloc.c | 6 +++--- gcc/loop.c | 2 +- gcc/recog.c | 2 +- gcc/reg-stack.c | 2 +- gcc/regmove.c | 2 +- gcc/reorg.c | 2 +- gcc/rtl.h | 2 +- gcc/rtlanal.c | 4 ++-- gcc/sched-ebb.c | 2 +- gcc/simplify-rtx.c | 2 +- gcc/toplev.c | 2 +- gcc/varasm.c | 6 +++--- 29 files changed, 71 insertions(+), 40 deletions(-) diff --git a/gcc/ChangeLog b/gcc/ChangeLog index 185d63d4351..95a1dcfee77 100644 --- a/gcc/ChangeLog +++ b/gcc/ChangeLog @@ -1,3 +1,34 @@ +2004-01-06 Kazu Hirata + + * alias.c: Fix comment typos. + * builtins.c: Likewise. + * cfg.c: Likewise. + * df.c: Likewise. + * dominance.c: Likewise. + * dwarf2out.c: Likewise. + * emit-rtl.c: Likewise. + * expr.c: Likewise. + * final.c: Likewise. + * fold-const.c: Likewise. + * gcse.c: Likewise. + * genattrtab.c: Likewise. + * genrecog.c: Likewise. + * gensupport.c: Likewise. + * ggc-zone.c: Likewise. + * integrate.c: Likewise. + * local-alloc.c: Likewise. + * loop.c: Likewise. + * recog.c: Likewise. + * regmove.c: Likewise. + * reg-stack.c: Likewise. + * reorg.c: Likewise. + * rtlanal.c: Likewise. + * rtl.h: Likewise. + * sched-ebb.c: Likewise. + * simplify-rtx.c: Likewise. + * toplev.c: Likewise. + * varasm.c: Likewise. + 2004-01-06 Kazu Hirata * doc/install.texi: Fix typos. diff --git a/gcc/alias.c b/gcc/alias.c index e4485375975..584f565ad3a 100644 --- a/gcc/alias.c +++ b/gcc/alias.c @@ -2386,7 +2386,7 @@ nonlocal_mentioned_p_1 (rtx *loc, void *data ATTRIBUTE_UNUSED) if (MEM_VOLATILE_P (x)) return 1; - /* FALLTHROUGH */ + /* Fall through. */ default: break; @@ -2480,7 +2480,7 @@ nonlocal_referenced_p_1 (rtx *loc, void *data ATTRIBUTE_UNUSED) if (MEM_VOLATILE_P (x)) return 1; - /* FALLTHROUGH */ + /* Fall through. */ default: break; @@ -2556,7 +2556,7 @@ nonlocal_set_p_1 (rtx *loc, void *data ATTRIBUTE_UNUSED) if (MEM_VOLATILE_P (x)) return 1; - /* FALLTHROUGH */ + /* Fall through. */ default: break; diff --git a/gcc/builtins.c b/gcc/builtins.c index df93f48238e..266039632f6 100644 --- a/gcc/builtins.c +++ b/gcc/builtins.c @@ -4354,7 +4354,7 @@ expand_builtin_fputs (tree arglist, rtx target, bool unlocked) break; } } - /* FALLTHROUGH */ + /* Fall through. */ case 1: /* length is greater than 1, call fwrite. */ { tree string_arg; diff --git a/gcc/cfg.c b/gcc/cfg.c index 96dac25d0ac..fb1bce7a3a7 100644 --- a/gcc/cfg.c +++ b/gcc/cfg.c @@ -334,7 +334,7 @@ cached_make_edge (sbitmap *edge_cache, basic_block src, basic_block dst, int fla if (flags == 0) return NULL; - /* FALLTHRU */ + /* Fall through. */ case 0: for (e = src->succ; e; e = e->succ_next) if (e->dest == dst) diff --git a/gcc/df.c b/gcc/df.c index 96c8ad8dbd2..63f6c7c8245 100644 --- a/gcc/df.c +++ b/gcc/df.c @@ -1006,7 +1006,7 @@ df_uses_record (struct df *df, rtx *loc, enum df_ref_type ref_type, insn, DF_REF_READ_WRITE); break; } - /* ... FALLTHRU ... */ + /* Fall through. */ case REG: case PARALLEL: case PC: diff --git a/gcc/dominance.c b/gcc/dominance.c index 1b6c9fd8f42..9d691a3d07c 100644 --- a/gcc/dominance.c +++ b/gcc/dominance.c @@ -537,7 +537,7 @@ assign_dfs_numbers (struct et_node *node, int *num) node->dfs_num_out = (*num)++; } -/* Compute the data neccesary for fast resolving of dominator queries in a +/* Compute the data necessary for fast resolving of dominator queries in a static dominator tree. */ static void @@ -659,7 +659,7 @@ set_immediate_dominator (enum cdi_direction dir, basic_block bb, dom_computed[dir] = DOM_NO_FAST_QUERY; } -/* Store all basic blocks immediatelly dominated by BB into BBS and return +/* Store all basic blocks immediately dominated by BB into BBS and return their number. */ int get_dominated_by (enum cdi_direction dir, basic_block bb, basic_block **bbs) diff --git a/gcc/dwarf2out.c b/gcc/dwarf2out.c index b765aefdc94..60177f1c515 100644 --- a/gcc/dwarf2out.c +++ b/gcc/dwarf2out.c @@ -8503,7 +8503,7 @@ loc_descriptor_from_tree (tree loc, int addressp) indirect_p = 1; break; } - /* FALLTHRU */ + /* Fall through. */ case PARM_DECL: { diff --git a/gcc/emit-rtl.c b/gcc/emit-rtl.c index 6558fa73fe9..cf491e87f01 100644 --- a/gcc/emit-rtl.c +++ b/gcc/emit-rtl.c @@ -2876,7 +2876,7 @@ repeat: if (copied && len > 0) XVEC (x, i) = gen_rtvec_v (len, XVEC (x, i)->elem); - /* Call recsusively on all inside the vector. */ + /* Call recursively on all inside the vector. */ for (j = 0; j < len; j++) { if (last_ptr) diff --git a/gcc/expr.c b/gcc/expr.c index e873865c6c6..b593a515bac 100644 --- a/gcc/expr.c +++ b/gcc/expr.c @@ -5829,7 +5829,7 @@ safe_from_p (rtx x, tree exp, int top_p) case '<': if (!safe_from_p (x, TREE_OPERAND (exp, 1), 0)) return 0; - /* FALLTHRU */ + /* Fall through. */ case '1': return safe_from_p (x, TREE_OPERAND (exp, 0), 0); diff --git a/gcc/final.c b/gcc/final.c index 3310a40d691..d3785fda195 100644 --- a/gcc/final.c +++ b/gcc/final.c @@ -3779,7 +3779,7 @@ leaf_renumber_regs_insn (rtx in_rtx) calls into this file, i.e., dbxout_symbol, dbxout_parms, and dbxout_reg_params. Those routines may also be called from a higher level intercepted routine. So to prevent recording data for an inner call to one of these for an intercept, - we maintain a intercept nesting counter (debug_nesting). We only save the + we maintain an intercept nesting counter (debug_nesting). We only save the intercepted arguments if the nesting is 1. */ int debug_nesting = 0; diff --git a/gcc/fold-const.c b/gcc/fold-const.c index 7a939c49666..fb9f037a696 100644 --- a/gcc/fold-const.c +++ b/gcc/fold-const.c @@ -8425,7 +8425,7 @@ fold_checksum_tree (tree expr, struct md5_ctx *ctx, htab_t ht) case WITH_CLEANUP_EXPR: len = 2; break; default: break; } - /* FALLTHROUGH */ + /* Fall through. */ case 'r': case '<': case '1': diff --git a/gcc/gcse.c b/gcc/gcse.c index 798437649ce..55f6d1bed72 100644 --- a/gcc/gcse.c +++ b/gcc/gcse.c @@ -817,7 +817,7 @@ gcse_main (rtx f, FILE *file) partial redundancy elimination. */ free_gcse_mem (); - /* It does not make sense to run code hoisting unless we optimizing + /* It does not make sense to run code hoisting unless we are optimizing for code size -- it rarely makes programs faster, and can make them bigger if we did partial redundancy elimination (when optimizing for space, we use a classic gcse algorithm instead of partial diff --git a/gcc/genattrtab.c b/gcc/genattrtab.c index ccf82c68a2a..05f7d222e8b 100644 --- a/gcc/genattrtab.c +++ b/gcc/genattrtab.c @@ -1155,7 +1155,7 @@ check_attr_value (rtx exp, struct attr_desc *attr) have_error = 1; break; } - /* FALLTHRU */ + /* Fall through. */ case IOR: case AND: diff --git a/gcc/genrecog.c b/gcc/genrecog.c index 208ea8e57f2..467f96e0fc1 100644 --- a/gcc/genrecog.c +++ b/gcc/genrecog.c @@ -378,7 +378,7 @@ find_operand (rtx pattern, int n) case 'V': if (! XVEC (pattern, i)) break; - /* FALLTHRU */ + /* Fall through. */ case 'E': for (j = 0; j < XVECLEN (pattern, i); j++) @@ -429,7 +429,7 @@ find_matching_operand (rtx pattern, int n) case 'V': if (! XVEC (pattern, i)) break; - /* FALLTHRU */ + /* Fall through. */ case 'E': for (j = 0; j < XVECLEN (pattern, i); j++) @@ -812,7 +812,7 @@ add_to_sequence (rtx pattern, struct decision_head *last, const char *position, beyond the end of the vector. */ test = new_decision_test (DT_veclen_ge, &place); test->u.veclen = XVECLEN (pattern, 2); - /* FALLTHRU */ + /* Fall through. */ case MATCH_OPERAND: case MATCH_SCRATCH: diff --git a/gcc/gensupport.c b/gcc/gensupport.c index fede14a5130..377b08d50a6 100644 --- a/gcc/gensupport.c +++ b/gcc/gensupport.c @@ -512,7 +512,7 @@ collect_insn_data (rtx pattern, int *palt, int *pmax) case MATCH_OPERAND: i = n_alternatives (XSTR (pattern, 2)); *palt = (i > *palt ? i : *palt); - /* FALLTHRU */ + /* Fall through. */ case MATCH_OPERATOR: case MATCH_SCRATCH: @@ -540,7 +540,7 @@ collect_insn_data (rtx pattern, int *palt, int *pmax) case 'V': if (XVEC (pattern, i) == NULL) break; - /* FALLTHRU */ + /* Fall through. */ case 'E': for (j = XVECLEN (pattern, i) - 1; j >= 0; --j) collect_insn_data (XVECEXP (pattern, i, j), palt, pmax); @@ -595,7 +595,7 @@ alter_predicate_for_insn (rtx pattern, int alt, int max_op, int lineno) XSTR (pattern, 2) = new_c; } } - /* FALLTHRU */ + /* Fall through. */ case MATCH_OPERATOR: case MATCH_SCRATCH: diff --git a/gcc/ggc-zone.c b/gcc/ggc-zone.c index 5a7d6d447f5..b9ad7334655 100644 --- a/gcc/ggc-zone.c +++ b/gcc/ggc-zone.c @@ -172,7 +172,7 @@ struct alloc_chunk { Similar with increasing max_free_bin_size without increasing num_free_bins. After much histogramming of allocation sizes and time spent on gc, - on a powerpc G4 7450 - 667 mhz, and an pentium 4 - 2.8ghz, + on a PowerPC G4 7450 - 667 mhz, and a Pentium 4 - 2.8ghz, these were determined to be the optimal values. */ #define NUM_FREE_BINS 64 #define MAX_FREE_BIN_SIZE 256 diff --git a/gcc/integrate.c b/gcc/integrate.c index f317627e487..d3e47a6a055 100644 --- a/gcc/integrate.c +++ b/gcc/integrate.c @@ -2090,7 +2090,7 @@ copy_rtx_and_substitute (rtx orig, struct inline_remap *map, int for_lhs) if (NOTE_LINE_NUMBER (orig) != NOTE_INSN_DELETED_LABEL) break; - /* ... FALLTHRU ... */ + /* Fall through. */ case CODE_LABEL: LABEL_PRESERVE_P (get_label_from_map (map, CODE_LABEL_NUMBER (orig))) = LABEL_PRESERVE_P (orig); diff --git a/gcc/local-alloc.c b/gcc/local-alloc.c index f3caba4f6a6..6524f6c7959 100644 --- a/gcc/local-alloc.c +++ b/gcc/local-alloc.c @@ -538,7 +538,7 @@ equiv_init_varies_p (rtx x) if (MEM_VOLATILE_P (x)) return 1; - /* FALLTHROUGH */ + /* Fall through. */ default: break; @@ -603,7 +603,7 @@ equiv_init_movable_p (rtx x, int regno) if (MEM_VOLATILE_P (x)) return 0; - /* FALLTHROUGH */ + /* Fall through. */ default: break; @@ -2412,7 +2412,7 @@ requires_inout (const char *p) if (REG_CLASS_FROM_CONSTRAINT (c, p) == NO_REGS && !EXTRA_ADDRESS_CONSTRAINT (c, p)) break; - /* FALLTHRU */ + /* Fall through. */ case 'p': case 'g': case 'r': reg_allowed = 1; diff --git a/gcc/loop.c b/gcc/loop.c index 0169dd05976..c0cf160a868 100644 --- a/gcc/loop.c +++ b/gcc/loop.c @@ -2643,7 +2643,7 @@ prescan_loop (struct loop *loop) loop_info->has_multiple_exit_targets = 1; } } - /* FALLTHRU */ + /* Fall through. */ case INSN: if (volatile_refs_p (PATTERN (insn))) diff --git a/gcc/recog.c b/gcc/recog.c index f366e39c9a6..9f5c152082e 100644 --- a/gcc/recog.c +++ b/gcc/recog.c @@ -1707,7 +1707,7 @@ asm_operand_ok (rtx op, const char *constraint) || (GET_CODE (op) == CONST_DOUBLE && GET_MODE (op) == VOIDmode)) break; - /* FALLTHRU */ + /* Fall through. */ case 'i': if (CONSTANT_P (op) diff --git a/gcc/reg-stack.c b/gcc/reg-stack.c index 228723b8ac5..8ebae4be70c 100644 --- a/gcc/reg-stack.c +++ b/gcc/reg-stack.c @@ -1769,7 +1769,7 @@ subst_stack_regs_pat (rtx insn, stack regstack, rtx pat) if (GET_CODE (pat_src) != UNSPEC || XINT (pat_src, 1) != UNSPEC_FNSTSW) abort (); - /* FALLTHRU */ + /* Fall through. */ case UNSPEC_FNSTSW: /* Combined fcomp+fnstsw generated for doing well with diff --git a/gcc/regmove.c b/gcc/regmove.c index c6c30d10706..d5b35cc1d4d 100644 --- a/gcc/regmove.c +++ b/gcc/regmove.c @@ -375,7 +375,7 @@ static int perhaps_ends_bb_p (rtx insn) very conservative. */ if (nonlocal_goto_handler_labels) return 1; - /* FALLTHRU */ + /* Fall through. */ default: return can_throw_internal (insn); } diff --git a/gcc/reorg.c b/gcc/reorg.c index 46b66577980..ec15a4fb6bc 100644 --- a/gcc/reorg.c +++ b/gcc/reorg.c @@ -1621,7 +1621,7 @@ try_merge_delay_insns (rtx insn, rtx thread) If we are not careful, this routine can take up a significant fraction of the total compilation time (4%), but only wins rarely. Hence we speed this routine up by making two passes. The first pass goes back - until it hits a label and sees if it find an insn with an identical + until it hits a label and sees if it finds an insn with an identical pattern. Only in this (relatively rare) event does it check for data conflicts. diff --git a/gcc/rtl.h b/gcc/rtl.h index 12c70509923..d403dda195b 100644 --- a/gcc/rtl.h +++ b/gcc/rtl.h @@ -1986,7 +1986,7 @@ struct cse_basic_block_data; N times that of a fast register-to-register instruction. */ #define COSTS_N_INSNS(N) ((N) * 4) -/* Maximum cost of a rtl expression. This value has the special meaning +/* Maximum cost of an rtl expression. This value has the special meaning not to use an rtx with this cost under any circumstances. */ #define MAX_COST INT_MAX diff --git a/gcc/rtlanal.c b/gcc/rtlanal.c index 0a0d4d4a51a..059fe9e522b 100644 --- a/gcc/rtlanal.c +++ b/gcc/rtlanal.c @@ -99,7 +99,7 @@ rtx_unstable_p (rtx x) if (MEM_VOLATILE_P (x)) return 1; - /* FALLTHROUGH */ + /* Fall through. */ default: break; @@ -189,7 +189,7 @@ rtx_varies_p (rtx x, int for_alias) if (MEM_VOLATILE_P (x)) return 1; - /* FALLTHROUGH */ + /* Fall through. */ default: break; diff --git a/gcc/sched-ebb.c b/gcc/sched-ebb.c index 2d4f125e62f..c553cddd183 100644 --- a/gcc/sched-ebb.c +++ b/gcc/sched-ebb.c @@ -445,7 +445,7 @@ add_deps_for_risky_insns (rtx head, rtx tail) prev = BB_END (bb); } } - /* FALLTHRU */ + /* Fall through. */ case TRAP_RISKY: case IRISKY: case PRISKY_CANDIDATE: diff --git a/gcc/simplify-rtx.c b/gcc/simplify-rtx.c index ffa87cd785f..10a9047d739 100644 --- a/gcc/simplify-rtx.c +++ b/gcc/simplify-rtx.c @@ -3148,7 +3148,7 @@ simplify_subreg (enum machine_mode outermode, rtx op, pretend this is actually an integer. */ innermode = mode_for_size (HOST_BITS_PER_WIDE_INT, MODE_INT, 0); - /* FALLTHROUGH */ + /* Fall through. */ case CONST_INT: if (GET_CODE (op) == CONST_INT) val = INTVAL (op); diff --git a/gcc/toplev.c b/gcc/toplev.c index 6c4970a109d..51a5e56722e 100644 --- a/gcc/toplev.c +++ b/gcc/toplev.c @@ -2100,7 +2100,7 @@ rest_of_handle_stack_regs (tree decl, rtx insns) #if defined (HAVE_ATTR_length) /* If flow2 creates new instructions which need splitting and scheduling after reload is not done, they might not be - splitten until final which doesn't allow splitting + split until final which doesn't allow splitting if HAVE_ATTR_length. */ #ifdef INSN_SCHEDULING if (optimize && !flag_schedule_insns_after_reload) diff --git a/gcc/varasm.c b/gcc/varasm.c index 70c13bb6bd1..3f5905ab397 100644 --- a/gcc/varasm.c +++ b/gcc/varasm.c @@ -2704,7 +2704,7 @@ decode_rtx_const (enum machine_mode mode, rtx x, struct rtx_const *value) break; case rvc_normal: value->un.du.exp = r->exp; - /* FALLTHRU */ + /* Fall through. */ case rvc_nan: memcpy (value->un.du.sig, r->sig, sizeof (r->sig)); break; @@ -2764,7 +2764,7 @@ decode_rtx_const (enum machine_mode mode, rtx x, struct rtx_const *value) break; case rvc_normal: d->exp = r->exp; - /* FALLTHRU */ + /* Fall through. */ case rvc_nan: memcpy (d->sig, r->sig, sizeof (r->sig)); break; @@ -3132,7 +3132,7 @@ output_constant_pool (const char *fnname ATTRIBUTE_UNUSED, || GET_CODE (XEXP (XEXP (x, 0), 0)) != LABEL_REF) break; tmp = XEXP (XEXP (x, 0), 0); - /* FALLTHRU */ + /* Fall through. */ case LABEL_REF: tmp = XEXP (x, 0); -- 2.30.2