[turbofan] Initial version of RedundancyElimination.

[turbofan] Initial version of RedundancyElimination.

The redundancy elimination is currently a graph reducer that tries to
combine redundant checks in the effect chain. It does this by
propagating the checks that happened along effect paths, which is pretty
similar to what the BranchElimination does on the control chain. We run
this reducer together with the other optimizations right after the
representation selection.

An upcoming CL will extend the redundancy elimination to also eliminate
redundant loads (and eventually map checks).

R=jarin@chromium.org
BUG=v8:5141
Committed: https://crrev.com/5250da68611dcac588b49e29f4671707bda10b14
Cr-Commit-Position: refs/heads/master@{#37208}

[Benedikt Meurer, 2016-06-23 08:32:18]

Hey Jaro,

Here's the baby, version 1.0.
Please take a look.

Thanks,
Benedikt

[Jarin, 2016-06-23 08:49:29]

lgtm

[Benedikt Meurer, 2016-06-23 08:49:41]

The CQ bit was checked by bmeurer@chromium.org

[commit-bot: I haz the power, 2016-06-23 08:49:48]

CQ is trying da patch. Follow status at
 https://chromium-cq-status.appspot.com/patch-status/2091503003/1

[commit-bot: I haz the power, 2016-06-23 08:56:53]

Committed patchset #1 (id:1)

[commit-bot: I haz the power, 2016-06-23 08:59:45]

Description was changed from

==========
[turbofan] Initial version of RedundancyElimination.

The redundancy elimination is currently a graph reducer that tries to
combine redundant checks in the effect chain. It does this by
propagating the checks that happened along effect paths, which is pretty
similar to what the BranchElimination does on the control chain. We run
this reducer together with the other optimizations right after the
representation selection.

An upcoming CL will extend the redundancy elimination to also eliminate
redundant loads (and eventually map checks).

R=jarin@chromium.org
BUG=v8:5141
==========

to

==========
[turbofan] Initial version of RedundancyElimination.

The redundancy elimination is currently a graph reducer that tries to
combine redundant checks in the effect chain. It does this by
propagating the checks that happened along effect paths, which is pretty
similar to what the BranchElimination does on the control chain. We run
this reducer together with the other optimizations right after the
representation selection.

An upcoming CL will extend the redundancy elimination to also eliminate
redundant loads (and eventually map checks).

R=jarin@chromium.org
BUG=v8:5141

Committed: https://crrev.com/5250da68611dcac588b49e29f4671707bda10b14
Cr-Commit-Position: refs/heads/master@{#37208}
==========

[commit-bot: I haz the power, 2016-06-23 08:59:46]

Patchset 1 (id:??) landed as
https://crrev.com/5250da68611dcac588b49e29f4671707bda10b14
Cr-Commit-Position: refs/heads/master@{#37208}