From 1ea7e6ad84d890cc6d002e9e698055de85a28cfd Mon Sep 17 00:00:00 2001 From: Kazu Hirata Date: Sun, 30 May 2004 07:12:58 +0000 Subject: c-common.c, [...]: Fix comment typos. * c-common.c, calls.c, cfgcleanup.c, cgraph.c, cgraphunit.c, ddg.c, ddg.h, df.c, df.h, except.c, expr.c, flags.h, fold-const.c, gcc.c, gimplify.c, haifa-sched.c, modulo-sched.c, tree-inline.c, tree-into-ssa.c, tree-nested.c, tree-nrv.c, tree-ssa-ccp.c, tree-ssa-dom.c, tree-ssa-live.c, tree-ssa-loop.c, tree-ssa-pre.c, tree-tailcall.c, tree.h: Fix comment typos. Follow spelling conventions. From-SVN: r82439 --- gcc/ddg.c | 12 ++++++------ 1 file changed, 6 insertions(+), 6 deletions(-) (limited to 'gcc/ddg.c') diff --git a/gcc/ddg.c b/gcc/ddg.c index 408a4d8..377ad99 100644 --- a/gcc/ddg.c +++ b/gcc/ddg.c @@ -80,7 +80,7 @@ mark_mem_use_1 (rtx *x, void *data) for_each_rtx (x, mark_mem_use, data); } -/* Returns non-zero if INSN reads from memory. */ +/* Returns nonzero if INSN reads from memory. */ static bool mem_read_insn_p (rtx insn) { @@ -96,7 +96,7 @@ mark_mem_store (rtx loc, rtx setter ATTRIBUTE_UNUSED, void *data ATTRIBUTE_UNUSE mem_ref_p = true; } -/* Returns non-zero if INSN writes to memory. */ +/* Returns nonzero if INSN writes to memory. */ static bool mem_write_insn_p (rtx insn) { @@ -105,7 +105,7 @@ mem_write_insn_p (rtx insn) return mem_ref_p; } -/* Returns non-zero if X has access to memory. */ +/* Returns nonzero if X has access to memory. */ static bool rtx_mem_access_p (rtx x) { @@ -138,7 +138,7 @@ rtx_mem_access_p (rtx x) return false; } -/* Returns non-zero if INSN reads to or writes from memory. */ +/* Returns nonzero if INSN reads to or writes from memory. */ static bool mem_access_insn_p (rtx insn) { @@ -383,7 +383,7 @@ build_intra_loop_deps (ddg_ptr g) get_block_head_tail (g->bb->index, &head, &tail); sched_analyze (&tmp_deps, head, tail); - /* Build intra-loop data dependecies using the schedular dependecy + /* Build intra-loop data dependecies using the scheduler dependecy analysis. */ for (i = 0; i < g->num_nodes; i++) { @@ -980,7 +980,7 @@ find_nodes_on_paths (sbitmap result, ddg_ptr g, sbitmap from, sbitmap to) /* Updates the counts of U_NODE's successors (that belong to NODES) to be at-least as large as the count of U_NODE plus the latency between them. Sets a bit in TMP for each successor whose count was changed (increased). - Returns non-zero if any count was changed. */ + Returns nonzero if any count was changed. */ static int update_dist_to_successors (ddg_node_ptr u_node, sbitmap nodes, sbitmap tmp) { -- cgit v1.1