From patchwork Wed Jan 19 15:38:03 2011 Content-Type: text/plain; charset="utf-8" MIME-Version: 1.0 Content-Transfer-Encoding: 7bit X-Patchwork-Submitter: Jakub Jelinek X-Patchwork-Id: 79484 Return-Path: X-Original-To: incoming@patchwork.ozlabs.org Delivered-To: patchwork-incoming@bilbo.ozlabs.org Received: from sourceware.org (server1.sourceware.org [209.132.180.131]) by ozlabs.org (Postfix) with SMTP id CF92EB70CC for ; Thu, 20 Jan 2011 02:38:14 +1100 (EST) Received: (qmail 20518 invoked by alias); 19 Jan 2011 15:38:13 -0000 Received: (qmail 20416 invoked by uid 22791); 19 Jan 2011 15:38:12 -0000 X-SWARE-Spam-Status: No, hits=-6.3 required=5.0 tests=AWL, BAYES_00, RCVD_IN_DNSWL_HI, SPF_HELO_PASS, TW_TM, T_RP_MATCHES_RCVD X-Spam-Check-By: sourceware.org Received: from mx1.redhat.com (HELO mx1.redhat.com) (209.132.183.28) by sourceware.org (qpsmtpd/0.43rc1) with ESMTP; Wed, 19 Jan 2011 15:38:06 +0000 Received: from int-mx10.intmail.prod.int.phx2.redhat.com (int-mx10.intmail.prod.int.phx2.redhat.com [10.5.11.23]) by mx1.redhat.com (8.13.8/8.13.8) with ESMTP id p0JFc53T019323 (version=TLSv1/SSLv3 cipher=DHE-RSA-AES256-SHA bits=256 verify=OK); Wed, 19 Jan 2011 10:38:05 -0500 Received: from tyan-ft48-01.lab.bos.redhat.com (tyan-ft48-01.lab.bos.redhat.com [10.16.42.4]) by int-mx10.intmail.prod.int.phx2.redhat.com (8.14.4/8.14.4) with ESMTP id p0JFc4bw004342 (version=TLSv1/SSLv3 cipher=DHE-RSA-AES256-SHA bits=256 verify=NO); Wed, 19 Jan 2011 10:38:05 -0500 Received: from tyan-ft48-01.lab.bos.redhat.com (localhost.localdomain [127.0.0.1]) by tyan-ft48-01.lab.bos.redhat.com (8.14.4/8.14.4) with ESMTP id p0JFc4HY010880; Wed, 19 Jan 2011 16:38:04 +0100 Received: (from jakub@localhost) by tyan-ft48-01.lab.bos.redhat.com (8.14.4/8.14.4/Submit) id p0JFc3tP010879; Wed, 19 Jan 2011 16:38:03 +0100 Date: Wed, 19 Jan 2011 16:38:03 +0100 From: Jakub Jelinek To: gcc-patches@gcc.gnu.org Cc: Jan Hubicka Subject: [PATCH] Spelling fixes in ipa-split.c Message-ID: <20110119153803.GQ2724@tyan-ft48-01.lab.bos.redhat.com> Reply-To: Jakub Jelinek MIME-Version: 1.0 Content-Disposition: inline User-Agent: Mutt/1.5.21 (2010-09-15) X-IsSubscribed: yes Mailing-List: contact gcc-patches-help@gcc.gnu.org; run by ezmlm Precedence: bulk List-Id: List-Unsubscribe: List-Archive: List-Post: List-Help: Sender: gcc-patches-owner@gcc.gnu.org Delivered-To: mailing list gcc-patches@gcc.gnu.org Hi! While reading ipa-split.c I've noticed several spelling errors, fixed thusly. Ok? 2011-01-19 Jakub Jelinek * ipa-split.c: Spelling fixes. Jakub --- gcc/ipa-split.c.jj 2011-01-18 12:20:18.000000000 +0100 +++ gcc/ipa-split.c 2011-01-19 15:29:25.000000000 +0100 @@ -46,7 +46,7 @@ along with GCC; see the file COPYING3. } When func becomes inlinable and when cheap_test is often true, inlining func, - but not fund.part leads to performance imrovement similar as inlining + but not fund.part leads to performance improvement similar as inlining original func while the code size growth is smaller. The pass is organized in three stages: @@ -112,7 +112,7 @@ struct split_point /* Size of the partitions. */ unsigned int header_time, header_size, split_time, split_size; - /* SSA names that need to be passed into spit funciton. */ + /* SSA names that need to be passed into spit function. */ bitmap ssa_names_to_pass; /* Basic block where we split (that will become entry point of new function. */ @@ -285,7 +285,7 @@ consider_split (struct split_point *curr edge_iterator ei; gimple_stmt_iterator bsi; unsigned int i; - int incomming_freq = 0; + int incoming_freq = 0; tree retval; if (dump_file && (dump_flags & TDF_DETAILS)) @@ -293,16 +293,16 @@ consider_split (struct split_point *curr FOR_EACH_EDGE (e, ei, current->entry_bb->preds) if (!bitmap_bit_p (current->split_bbs, e->src->index)) - incomming_freq += EDGE_FREQUENCY (e); + incoming_freq += EDGE_FREQUENCY (e); /* Do not split when we would end up calling function anyway. */ - if (incomming_freq + if (incoming_freq >= (ENTRY_BLOCK_PTR->frequency * PARAM_VALUE (PARAM_PARTIAL_INLINING_ENTRY_PROBABILITY) / 100)) { if (dump_file && (dump_flags & TDF_DETAILS)) fprintf (dump_file, - " Refused: incomming frequency is too large.\n"); + " Refused: incoming frequency is too large.\n"); return; } @@ -313,8 +313,8 @@ consider_split (struct split_point *curr return; } - /* Verify that PHI args on entry are either virutal or all their operands - incomming from header are the same. */ + /* Verify that PHI args on entry are either virtual or all their operands + incoming from header are the same. */ for (bsi = gsi_start_phis (current->entry_bb); !gsi_end_p (bsi); gsi_next (&bsi)) { gimple stmt = gsi_stmt (bsi); @@ -540,7 +540,7 @@ find_return_bb (void) return return_bb; } -/* Given return basicblock RETURN_BB, see where return value is really +/* Given return basic block RETURN_BB, see where return value is really stored. */ static tree find_retval (basic_block return_bb) @@ -703,7 +703,7 @@ visit_bb (basic_block bb, basic_block re mark_nonssa_use, mark_nonssa_use); } - /* Record also uses comming from PHI operand in return BB. */ + /* Record also uses coming from PHI operand in return BB. */ FOR_EACH_EDGE (e, ei, bb->succs) if (e->dest == return_bb) { @@ -741,11 +741,11 @@ typedef struct bitmap bbs_visited; /* Last examined edge in DFS walk. Since we walk unoriented graph, - the value is up to sum of incomming and outgoing edges of BB. */ + the value is up to sum of incoming and outgoing edges of BB. */ unsigned int edge_num; /* Stack entry index of earliest BB reachable from current BB - or any BB visited later in DFS valk. */ + or any BB visited later in DFS walk. */ int earliest; /* Overall time and size of all BBs reached from this BB in DFS walk. */ @@ -888,8 +888,8 @@ find_split_points (int overall_time, int && (intptr_t)dest->aux < entry->earliest) entry->earliest = (intptr_t)dest->aux; } - /* We are done with examing the edges. pop off the value from stack and - merge stuff we cummulate during the walk. */ + /* We are done with examining the edges. Pop off the value from stack + and merge stuff we accumulate during the walk. */ else if (entry->bb != ENTRY_BLOCK_PTR) { stack_entry *prev = VEC_index (stack_entry, stack, @@ -1254,7 +1254,7 @@ execute_split_functions (void) if (node->local.disregard_inline_limits) { if (dump_file) - fprintf (dump_file, "Not splitting: disregading inline limits.\n"); + fprintf (dump_file, "Not splitting: disregarding inline limits.\n"); return 0; } /* This can be relaxed; most of versioning tests actually prevents