diff options
| author | Kazu Hirata <kazu@cs.umass.edu> | 2004-05-30 07:12:58 +0000 |
|---|---|---|
| committer | Kazu Hirata <kazu@gcc.gnu.org> | 2004-05-30 07:12:58 +0000 |
| commit | 1ea7e6ad84d890cc6d002e9e698055de85a28cfd (patch) | |
| tree | 353029a3fd14257b6028935077f92705d8a886d5 /gcc/tree-ssa-pre.c | |
| parent | b453c95fd3fa689a6d70e8878848e5d6531e9ac5 (diff) | |
| download | gcc-1ea7e6ad84d890cc6d002e9e698055de85a28cfd.zip gcc-1ea7e6ad84d890cc6d002e9e698055de85a28cfd.tar.gz gcc-1ea7e6ad84d890cc6d002e9e698055de85a28cfd.tar.bz2 | |
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
Diffstat (limited to 'gcc/tree-ssa-pre.c')
| -rw-r--r-- | gcc/tree-ssa-pre.c | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/gcc/tree-ssa-pre.c b/gcc/tree-ssa-pre.c index c249441..5896953 100644 --- a/gcc/tree-ssa-pre.c +++ b/gcc/tree-ssa-pre.c @@ -1596,7 +1596,7 @@ process_delayed_rename (struct expr_info *ei, tree use, tree real_occ) /* For the uninitiated, the algorithm is a modified SSA renaming algorithm (working on expressions rather than variables) . We attempt to determine which expression occurrences have the same - ESSA version (we call it class, for equivalence/redunancy class, + ESSA version (we call it class, for equivalence/redundancy class, which is what the papers call it. Open64 calls it e-version), and which occurrences are actually operands for an EPHI (since this has to be discovered from the program). @@ -2149,7 +2149,7 @@ insert_one_operand (struct expr_info *ei, tree ephi, int opnd_indx, /* First step of finalization. Determine which expressions are being saved and which are being deleted. - This is done as a simple dominator based availabilty calculation, + This is done as a simple dominator based availability calculation, using the e-versions/redundancy classes. */ static bool |