diff options
| author | Kazu Hirata <kazu@cs.umass.edu> | 2005-01-10 19:34:36 +0000 |
|---|---|---|
| committer | Kazu Hirata <kazu@gcc.gnu.org> | 2005-01-10 19:34:36 +0000 |
| commit | 1618f9483f44a3f6ee5791ae1609d8493eb52253 (patch) | |
| tree | a75410aebc3dd80bbaa2e1c5f88eddd9e4fd101a /gcc | |
| parent | 0006c7b00d82d3e08e7ea2080ebc586d15c5ef95 (diff) | |
| download | gcc-1618f9483f44a3f6ee5791ae1609d8493eb52253.zip gcc-1618f9483f44a3f6ee5791ae1609d8493eb52253.tar.gz gcc-1618f9483f44a3f6ee5791ae1609d8493eb52253.tar.bz2 | |
* tree-vectorizer.c, tree.def: Fix comment typos.
From-SVN: r93153
Diffstat (limited to 'gcc')
| -rw-r--r-- | gcc/ChangeLog | 4 | ||||
| -rw-r--r-- | gcc/tree-vectorizer.c | 6 | ||||
| -rw-r--r-- | gcc/tree.def | 2 |
3 files changed, 8 insertions, 4 deletions
diff --git a/gcc/ChangeLog b/gcc/ChangeLog index 42292ad..f9d67ab 100644 --- a/gcc/ChangeLog +++ b/gcc/ChangeLog @@ -1,3 +1,7 @@ +2005-01-10 Kazu Hirata <kazu@cs.umass.edu> + + * tree-vectorizer.c, tree.def: Fix comment typos. + 2005-01-10 Mark Dettinger <dettinge@de.ibm.com> * config/s390/s390.c (struct processor_costs): 4 new fields: diff --git a/gcc/tree-vectorizer.c b/gcc/tree-vectorizer.c index b890801..9276b89 100644 --- a/gcc/tree-vectorizer.c +++ b/gcc/tree-vectorizer.c @@ -1377,13 +1377,13 @@ vect_strip_conversion (tree expr) a[j].b[i][j] = 0; For a[j].b[i][j], EXPR will be 'i * C_i + j * C_j + C'. 'i' cannot be - subsituted, since its access_fn in the inner loop is i. 'j' will be + substituted, since its access_fn in the inner loop is i. 'j' will be substituted with 3. An INITIAL_OFFSET will be 'i * C_i + C`', where C` = 3 * C_j + C. Compute MISALIGN (the misalignment of the data reference initial access from its base) if possible. Misalignment can be calculated only if all the - variables can be substitued with constants, or if a variable is multiplied + variables can be substituted with constants, or if a variable is multiplied by a multiple of VECTYPE_ALIGNMENT. In the above example, since 'i' cannot be substituted, MISALIGN will be NULL_TREE in case that C_i is not a multiple of VECTYPE_ALIGNMENT, and C` otherwise. (We perform MISALIGN modulo @@ -4894,7 +4894,7 @@ vect_get_memtag_and_dr (tree memref, tree stmt, bool is_read, 1.1.1- vect_get_base_and_offset(): Calculate base, initial_offset, step and alignment. For ARRAY_REFs and COMPONENT_REFs use call get_inner_reference. - 2- vect_analyze_dependences(): apply dependece testing using ref_stmt.DR + 2- vect_analyze_dependences(): apply dependence testing using ref_stmt.DR 3- vect_analyze_drs_alignment(): check that ref_stmt.alignment is ok. 4- vect_analyze_drs_access(): check that ref_stmt.step is ok. diff --git a/gcc/tree.def b/gcc/tree.def index b69dfcc..37f85ad 100644 --- a/gcc/tree.def +++ b/gcc/tree.def @@ -32,7 +32,7 @@ Software Foundation, 59 Temple Place - Suite 330, Boston, MA These tree codes have been sorted so that the macros in tree.h that check for various tree codes are optimized into range checks. This - gives a measureable performance improvement. When adding a new + gives a measurable performance improvement. When adding a new code, consider its placement in relation to the other codes. */ /* Any erroneous construct is parsed into a node of this type. |