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
|
/*
* Copyright (C) 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.
*/
#pragma once
#include <wtf/MathExtras.h>
#include <wtf/PrintStream.h>
namespace JSC { namespace DOMJIT {
class HeapRange {
public:
constexpr HeapRange()
: m_begin(UINT16_MAX)
, m_end(UINT16_MAX)
{
}
HeapRange(uint16_t begin, uint16_t end)
: m_begin(begin)
, m_end(end)
{
ASSERT_WITH_MESSAGE(begin <= end, "begin <= end is the invariant of this HeapRange.");
}
enum ConstExprTag { ConstExpr };
constexpr HeapRange(ConstExprTag, uint16_t begin, uint16_t end)
: m_begin(begin)
, m_end(end)
{
}
enum RawRepresentationTag { RawRepresentation };
explicit constexpr HeapRange(RawRepresentationTag, uint32_t value)
: m_raw(value)
{
}
constexpr static HeapRange fromRaw(uint32_t value)
{
return HeapRange(RawRepresentation, value);
}
uint16_t begin() const { return m_begin; }
uint16_t end() const { return m_end; }
uint32_t rawRepresentation() { return m_raw; }
constexpr explicit operator bool() const
{
return m_begin != m_end;
}
constexpr bool operator==(const HeapRange& other) const
{
return m_begin == other.m_begin && m_end == other.m_end;
}
constexpr bool operator!=(const HeapRange& other) const
{
return !operator==(other);
}
template<uint16_t begin, uint16_t end>
static constexpr HeapRange fromConstant()
{
static_assert(begin < end || (begin == UINT16_MAX && end == UINT16_MAX), "begin < end or the both are UINT16_MAX is the invariant of this HeapRange.");
return HeapRange(ConstExpr, begin, end);
}
static constexpr HeapRange top() { return fromConstant<0, UINT16_MAX>(); }
static constexpr HeapRange none() { return fromConstant<UINT16_MAX, UINT16_MAX>(); } // Empty range.
bool isStrictSubtypeOf(const HeapRange& other) const
{
if (!*this || !other)
return false;
if (*this == other)
return false;
return other.m_begin <= m_begin && m_end <= other.m_end;
}
bool isSubtypeOf(const HeapRange& other) const
{
if (!*this || !other)
return false;
if (*this == other)
return true;
return isStrictSubtypeOf(other);
}
bool overlaps(const HeapRange& other) const
{
return WTF::rangesOverlap(m_begin, m_end, other.m_begin, other.m_end);
}
JS_EXPORT_PRIVATE void dump(PrintStream&) const;
private:
union {
struct {
uint16_t m_begin;
uint16_t m_end;
};
uint32_t m_raw;
};
};
} }
|
