1/*
2 * Copyright (C) 2014 Apple Inc. All rights reserved.
3 * Copyright (C) 2014 Saam Barati. <[email protected]>
4 *
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
7 * are met:
8 * 1. Redistributions of source code must retain the above copyright
9 * notice, this list of conditions and the following disclaimer.
10 * 2. Redistributions in binary form must reproduce the above copyright
11 * notice, this list of conditions and the following disclaimer in the
12 * documentation and/or other materials provided with the distribution.
13 *
14 * THIS SOFTWARE IS PROVIDED BY APPLE INC. ``AS IS'' AND ANY
15 * EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
16 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
17 * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL APPLE INC. OR
18 * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
19 * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
20 * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
21 * PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY
22 * OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
23 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
24 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
25 */
26
27#include "config.h"
28#include "BasicBlockLocation.h"
29
30#include "CCallHelpers.h"
31#include <climits>
32#include <wtf/DataLog.h>
33
34namespace JSC {
35
36BasicBlockLocation::BasicBlockLocation(int startOffset, int endOffset)
37 : m_startOffset(startOffset)
38 , m_endOffset(endOffset)
39 , m_executionCount(0)
40{
41}
42
43void BasicBlockLocation::insertGap(int startOffset, int endOffset)
44{
45 std::pair<int, int> gap(startOffset, endOffset);
46 if (!m_gaps.contains(gap))
47 m_gaps.append(gap);
48}
49
50Vector<std::pair<int, int>> BasicBlockLocation::getExecutedRanges() const
51{
52 Vector<Gap> result;
53 Vector<Gap> gaps = m_gaps;
54 int nextRangeStart = m_startOffset;
55 while (gaps.size()) {
56 Gap minGap(INT_MAX, 0);
57 unsigned minIdx = std::numeric_limits<unsigned>::max();
58 for (unsigned idx = 0; idx < gaps.size(); idx++) {
59 // 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.
60 if (gaps[idx].first < minGap.first) {
61 minGap = gaps[idx];
62 minIdx = idx;
63 }
64 }
65 result.append(Gap(nextRangeStart, minGap.first - 1));
66 nextRangeStart = minGap.second + 1;
67 gaps.remove(minIdx);
68 }
69
70 result.append(Gap(nextRangeStart, m_endOffset));
71 return result;
72}
73
74void BasicBlockLocation::dumpData() const
75{
76 Vector<Gap> executedRanges = getExecutedRanges();
77 for (Gap gap : executedRanges) {
78 dataLogF("\tBasicBlock: [%d, %d] hasExecuted: %s, executionCount:", gap.first, gap.second, hasExecuted() ? "true" : "false");
79 dataLogLn(m_executionCount);
80 }
81}
82
83#if ENABLE(JIT)
84#if USE(JSVALUE64)
85void BasicBlockLocation::emitExecuteCode(CCallHelpers& jit) const
86{
87 static_assert(sizeof(UCPURegister) == 8, "Assuming size_t is 64 bits on 64 bit platforms.");
88 jit.add64(CCallHelpers::TrustedImm32(1), CCallHelpers::AbsoluteAddress(&m_executionCount));
89}
90#else
91void BasicBlockLocation::emitExecuteCode(CCallHelpers& jit, MacroAssembler::RegisterID scratch) const
92{
93 static_assert(sizeof(size_t) == 4, "Assuming size_t is 32 bits on 32 bit platforms.");
94 jit.load32(&m_executionCount, scratch);
95 CCallHelpers::Jump done = jit.branchAdd32(CCallHelpers::Zero, scratch, CCallHelpers::TrustedImm32(1), scratch);
96 jit.store32(scratch, bitwise_cast<void*>(&m_executionCount));
97 done.link(&jit);
98}
99#endif // USE(JSVALUE64)
100#endif // ENABLE(JIT)
101
102} // namespace JSC
103