OpenE2K/gcc
2
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

cfg.c, [...]: Fix comment typos.

Browse Source 
* cfg.c, tree-ssa-threadupdate.c, tree-vectorizer.c: Fix
	comment typos.

From-SVN: r87753
This commit is contained in:
Kazu Hirata 2004-09-20 11:17:22 +00:00 committed by Kazu Hirata
parent b898b8d923
commit d4a9b3a336
4 changed files with 11 additions and 6 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

5
gcc/ChangeLog
View File

@ -1,3 +1,8 @@
2004-09-20 Kazu Hirata <kazu@cs.umass.edu>
* cfg.c, tree-ssa-threadupdate.c, tree-vectorizer.c: Fix
comment typos.
2004-09-20 Richard Sandiford <rsandifo@redhat.com>
PR target/17565

4
gcc/cfg.c
View File

@ -891,11 +891,11 @@ brief_dump_cfg (FILE *file)
/* An edge originally destinating BB of FREQUENCY and COUNT has been proved to
leave the block by TAKEN_EDGE. Update profile of BB such that edge E can be
redirected to destiantion of TAKEN_EDGE.
redirected to destination of TAKEN_EDGE.
This function may leave the profile inconsistent in the case TAKEN_EDGE
frequency or count is believed to be lower than FREQUENCY or COUNT
respectivly. */
respectively. */
void
update_bb_profile_for_threading (basic_block bb, int edge_frequency,
gcov_type count, edge taken_edge)

4
gcc/tree-ssa-threadupdate.c
View File

@ -55,7 +55,7 @@ Boston, MA 02111-1307, USA. */
with the edge B'->C.
4. For each PHI in B, find or create a PHI in B' with an identical
PHI_RESULT. Add an argument to the PHI in B' which as the same
PHI_RESULT. Add an argument to the PHI in B' which has the same
value as the PHI in B associated with the edge A->B. Associate
the new argument in the PHI in B' with the edge A->B.
@ -226,7 +226,7 @@ create_block_for_threading (basic_block bb, struct redirection_data *rd)
to update the SSA graph for those names.
We are also going to experiment with a true incremental update
scheme for the duplicated resources. Of of the interesting
scheme for the duplicated resources. One of the interesting
properties we can exploit here is that all the resources set
in BB will have the same IDFS, so we have one IDFS computation
per block with incoming threaded edges, which can lower the

4
gcc/tree-vectorizer.c
View File

@ -2346,7 +2346,7 @@ vect_get_first_index (tree ref, tree *array_first_index)
Input:
ARRAY - an array_ref (possibly multidimensional) of type ARRAY_TYPE.
VECTYPE - we are interested in the misalignment modulu the size of vectype.
VECTYPE - we are interested in the misalignment modulo the size of vectype.
if NULL: don't compute misalignment, just return the base of ARRAY.
PREV_DIMENSIONS - initialized to one.
MISALIGNMENT - the computed misalignment in bits.
@ -3123,7 +3123,7 @@ vect_get_symbl_and_dr (tree memref, tree stmt, bool is_read,
STRIP_NOPS(oprnd1);
/* Only {address_base + offset} expressions are supported,
where address_base can be POINTER_TYPE or ARRRAY_TYPE and
where address_base can be POINTER_TYPE or ARRAY_TYPE and
offset can be anything but POINTER_TYPE or ARRAY_TYPE.
TODO: swap operands if {offset + address_base}. */
if ((TREE_CODE (TREE_TYPE (oprnd1)) == POINTER_TYPE