diff options
| author | kazu <kazu@138bc75d-0d04-0410-961f-82ee72b054a4> | 2004-09-10 15:09:39 +0000 |
|---|---|---|
| committer | kazu <kazu@138bc75d-0d04-0410-961f-82ee72b054a4> | 2004-09-10 15:09:39 +0000 |
| commit | 5c9dae644b7021a01fd40612afb035b71fa4ec93 (patch) | |
| tree | eba8a248439b41ccd8953fe4272dee8155596f4d /gcc/tree-data-ref.c | |
| parent | 7df4c3748a4c335de8a71290727e279c6d968616 (diff) | |
| download | gcc-5c9dae644b7021a01fd40612afb035b71fa4ec93.tar.gz | |
* bb-reorder.c, c-common.c, c-incpath.c, c-typeck.c,
genrecog.c, lambda-code.c, mips-tdump.c, mips-tfile.c,
passes.c, tree-data-ref.c, tree-data-ref.h, tree-mudflap.c,
tree-scalar-evolution.c, tree-ssa-copyrename.c,
tree-ssa-live.c, tree-ssa-live.h: Fix comment typos.
git-svn-id: svn+ssh://gcc.gnu.org/svn/gcc/trunk@87302 138bc75d-0d04-0410-961f-82ee72b054a4
Diffstat (limited to 'gcc/tree-data-ref.c')
| -rw-r--r-- | gcc/tree-data-ref.c | 10 |
1 files changed, 5 insertions, 5 deletions
diff --git a/gcc/tree-data-ref.c b/gcc/tree-data-ref.c index 5ea9fecf435..3436c3d33d2 100644 --- a/gcc/tree-data-ref.c +++ b/gcc/tree-data-ref.c @@ -492,8 +492,8 @@ dump_data_dependence_direction (FILE *file, /* Given an ARRAY_REF node REF, records its access functions. Example: given A[i][3], record in ACCESS_FNS the opnd1 function, - ie. the constant "3", then recursively call the function on opnd0, - ie. the ARRAY_REF "A[i]". The function returns the base name: + i.e. the constant "3", then recursively call the function on opnd0, + i.e. the ARRAY_REF "A[i]". The function returns the base name: "A". */ static tree @@ -958,7 +958,7 @@ analyze_subscript_affine_affine (tree chrec_a, For answering to the question: "Is there a dependence?" we have to prove that there exists a solution to the Diophantine equation, and that the solution is in the iteration domain, - ie. the solution is positive or zero, and that the solution + i.e. the solution is positive or zero, and that the solution happens before the upper bound loop.nb_iterations. Otherwise there is no dependence. This function outputs a description of the iterations that hold the intersections. */ @@ -1049,7 +1049,7 @@ analyze_subscript_affine_affine (tree chrec_a, if (!tree_fold_divides_p (integer_type_node, gcd_alpha_beta, gamma)) { /* The "gcd-test" has determined that there is no integer - solution, ie. there is no dependence. */ + solution, i.e. there is no dependence. */ *overlaps_a = chrec_known; *overlaps_b = chrec_known; } @@ -1717,7 +1717,7 @@ compute_affine_dependence (struct data_dependence_relation *ddr) /* Compute a subset of the data dependence relation graph. Don't compute read-read relations, and avoid the computation of the - opposite relation, ie. when AB has been computed, don't compute BA. + opposite relation, i.e. when AB has been computed, don't compute BA. DATAREFS contains a list of data references, and the result is set in DEPENDENCE_RELATIONS. */ |