blob: 05094a388eee2951869ac0756d32c02d810991f0 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
|
// Copyright 2016 the V8 project authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#ifndef V8_COMPILER_REDUNDANCY_ELIMINATION_H_
#define V8_COMPILER_REDUNDANCY_ELIMINATION_H_
#include "src/compiler/graph-reducer.h"
namespace v8 {
namespace internal {
namespace compiler {
class RedundancyElimination final : public AdvancedReducer {
public:
RedundancyElimination(Editor* editor, Zone* zone);
~RedundancyElimination() final;
const char* reducer_name() const override { return "RedundancyElimination"; }
Reduction Reduce(Node* node) final;
private:
struct Check {
Check(Node* node, Check* next) : node(node), next(next) {}
Node* node;
Check* next;
};
class EffectPathChecks final {
public:
static EffectPathChecks* Copy(Zone* zone, EffectPathChecks const* checks);
static EffectPathChecks const* Empty(Zone* zone);
bool Equals(EffectPathChecks const* that) const;
void Merge(EffectPathChecks const* that);
EffectPathChecks const* AddCheck(Zone* zone, Node* node) const;
Node* LookupCheck(Node* node) const;
Node* LookupBoundsCheckFor(Node* node) const;
private:
EffectPathChecks(Check* head, size_t size) : head_(head), size_(size) {}
// We keep track of the list length so that we can find the longest
// common tail easily.
Check* head_;
size_t size_;
};
class PathChecksForEffectNodes final {
public:
explicit PathChecksForEffectNodes(Zone* zone) : info_for_node_(zone) {}
EffectPathChecks const* Get(Node* node) const;
void Set(Node* node, EffectPathChecks const* checks);
private:
ZoneVector<EffectPathChecks const*> info_for_node_;
};
Reduction ReduceCheckNode(Node* node);
Reduction ReduceEffectPhi(Node* node);
Reduction ReduceStart(Node* node);
Reduction ReduceOtherNode(Node* node);
Reduction TakeChecksFromFirstEffect(Node* node);
Reduction UpdateChecks(Node* node, EffectPathChecks const* checks);
Reduction TryReuseBoundsCheckForFirstInput(Node* node);
Zone* zone() const { return zone_; }
PathChecksForEffectNodes node_checks_;
Zone* const zone_;
DISALLOW_COPY_AND_ASSIGN(RedundancyElimination);
};
} // namespace compiler
} // namespace internal
} // namespace v8
#endif // V8_COMPILER_REDUNDANCY_ELIMINATION_H_
|
