-
Notifications
You must be signed in to change notification settings - Fork 2k
Expand file tree
/
Copy pathBasicBlockLocation.cpp
More file actions
105 lines (94 loc) · 3.88 KB
/
BasicBlockLocation.cpp
File metadata and controls
105 lines (94 loc) · 3.88 KB
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
/*
* Copyright (C) 2014-2023 Apple Inc. All rights reserved.
* Copyright (C) 2014 Saam Barati. <saambarati1@gmail.com>
*
* 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.
*/
#include "config.h"
#include "BasicBlockLocation.h"
#include "CCallHelpers.h"
#include <climits>
#include <wtf/DataLog.h>
#include <wtf/TZoneMallocInlines.h>
namespace JSC {
WTF_MAKE_TZONE_ALLOCATED_IMPL(BasicBlockLocation);
BasicBlockLocation::BasicBlockLocation(int startOffset, int endOffset)
: m_startOffset(startOffset)
, m_endOffset(endOffset)
, m_executionCount(0)
{
}
void BasicBlockLocation::insertGap(int startOffset, int endOffset)
{
std::pair<int, int> gap(startOffset, endOffset);
if (!m_gaps.contains(gap))
m_gaps.append(gap);
}
Vector<std::pair<int, int>> BasicBlockLocation::getExecutedRanges() const
{
Vector<Gap> result;
Vector<Gap> gaps = m_gaps;
int nextRangeStart = m_startOffset;
while (gaps.size()) {
Gap minGap(INT_MAX, 0);
unsigned minIdx = std::numeric_limits<unsigned>::max();
for (unsigned idx = 0; idx < gaps.size(); idx++) {
// Because we know that the Gaps inside m_gaps aren't enclosed within one another, it suffices to just check the first element to test ordering.
if (gaps[idx].first < minGap.first) {
minGap = gaps[idx];
minIdx = idx;
}
}
result.append(Gap(nextRangeStart, minGap.first - 1));
nextRangeStart = minGap.second + 1;
gaps.removeAt(minIdx);
}
result.append(Gap(nextRangeStart, m_endOffset));
return result;
}
void BasicBlockLocation::dumpData() const
{
Vector<Gap> executedRanges = getExecutedRanges();
for (Gap gap : executedRanges) {
dataLogF("\tBasicBlock: [%d, %d] hasExecuted: %s, executionCount:", gap.first, gap.second, hasExecuted() ? "true" : "false");
dataLogLn(m_executionCount);
}
}
#if ENABLE(JIT)
#if USE(JSVALUE64)
void BasicBlockLocation::emitExecuteCode(CCallHelpers& jit) const
{
static_assert(sizeof(UCPURegister) == 8, "Assuming size_t is 64 bits on 64 bit platforms.");
jit.add64(CCallHelpers::TrustedImm32(1), CCallHelpers::AbsoluteAddress(&m_executionCount));
}
#else
void BasicBlockLocation::emitExecuteCode(CCallHelpers& jit, MacroAssembler::RegisterID scratch) const
{
static_assert(sizeof(size_t) == 4, "Assuming size_t is 32 bits on 32 bit platforms.");
jit.load32(&m_executionCount, scratch);
CCallHelpers::Jump done = jit.branchAdd32(CCallHelpers::Zero, scratch, CCallHelpers::TrustedImm32(1), scratch);
jit.store32(scratch, std::bit_cast<void*>(&m_executionCount));
done.link(&jit);
}
#endif // USE(JSVALUE64)
#endif // ENABLE(JIT)
} // namespace JSC