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
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
|
/*
* Copyright (C) 2015-2016 Apple Inc. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY APPLE INC. ``AS IS'' AND ANY
* EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
* PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL APPLE INC. OR
* CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
* EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
* PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
* PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY
* OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
#ifndef B3SwitchValue_h
#define B3SwitchValue_h
#if ENABLE(B3_JIT)
#include "B3ControlValue.h"
#include "B3SwitchCase.h"
namespace JSC { namespace B3 {
class SwitchValue : public ControlValue {
public:
static bool accepts(Opcode opcode) { return opcode == Switch; }
~SwitchValue();
// numCaseValues() + 1 == numSuccessors().
unsigned numCaseValues() const { return m_values.size(); }
// The successor for this case value is at the same index.
int64_t caseValue(unsigned index) const { return m_values[index]; }
const Vector<int64_t>& caseValues() const { return m_values; }
FrequentedBlock fallThrough() const { return successors().last(); }
FrequentedBlock& fallThrough() { return successors().last(); }
unsigned size() const { return numCaseValues(); }
SwitchCase at(unsigned index) const
{
return SwitchCase(caseValue(index), successor(index));
}
SwitchCase operator[](unsigned index) const
{
return at(index);
}
class iterator {
public:
iterator()
: m_switch(nullptr)
, m_index(0)
{
}
iterator(const SwitchValue& switchValue, unsigned index)
: m_switch(&switchValue)
, m_index(index)
{
}
SwitchCase operator*()
{
return m_switch->at(m_index);
}
iterator& operator++()
{
m_index++;
return *this;
}
bool operator==(const iterator& other) const
{
ASSERT(m_switch == other.m_switch);
return m_index == other.m_index;
}
bool operator!=(const iterator& other) const
{
return !(*this == other);
}
private:
const SwitchValue* m_switch;
unsigned m_index;
};
typedef iterator const_iterator;
iterator begin() const { return iterator(*this, 0); }
iterator end() const { return iterator(*this, size()); }
// This removes the case and reorders things a bit. If you're iterating the cases from 0 to N,
// then you can keep iterating after this so long as you revisit this same index (which will now
// contain some other case value). This removes the case that was removed.
SwitchCase removeCase(unsigned index);
JS_EXPORT_PRIVATE void appendCase(const SwitchCase&);
protected:
void dumpMeta(CommaPrinter&, PrintStream&) const override;
Value* cloneImpl() const override;
private:
friend class Procedure;
JS_EXPORT_PRIVATE SwitchValue(Origin, Value* child, const FrequentedBlock& fallThrough);
Vector<int64_t> m_values;
};
} } // namespace JSC::B3
#endif // ENABLE(B3_JIT)
#endif // B3SwitchValue_h
|
