mirror of
https://github.com/darlinghq/darling-JavaScriptCore.git
synced 2024-11-23 04:09:40 +00:00
101 lines
3.6 KiB
C++
101 lines
3.6 KiB
C++
/*
|
|
* Copyright (C) 2014 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.
|
|
*/
|
|
|
|
#include "config.h"
|
|
#include "FunctionHasExecutedCache.h"
|
|
|
|
#include <limits.h>
|
|
|
|
namespace JSC {
|
|
|
|
bool FunctionHasExecutedCache::hasExecutedAtOffset(intptr_t id, unsigned offset)
|
|
{
|
|
if (m_rangeMap.find(id) == m_rangeMap.end())
|
|
return false;
|
|
|
|
RangeMap& map = m_rangeMap.find(id)->second;
|
|
unsigned distance = UINT_MAX;
|
|
bool hasExecuted = false;
|
|
for (auto& pair : map) {
|
|
const FunctionRange& range = pair.first;
|
|
if (range.m_start <= offset && offset <= range.m_end && range.m_end - range.m_start < distance) {
|
|
hasExecuted = pair.second;
|
|
distance = range.m_end - range.m_start;
|
|
}
|
|
}
|
|
|
|
return hasExecuted;
|
|
}
|
|
|
|
void FunctionHasExecutedCache::insertUnexecutedRange(intptr_t id, unsigned start, unsigned end)
|
|
{
|
|
if (m_rangeMap.find(id) == m_rangeMap.end()) {
|
|
RangeMap map;
|
|
m_rangeMap[id] = map;
|
|
}
|
|
|
|
RangeMap& map = m_rangeMap.find(id)->second;
|
|
FunctionRange range;
|
|
range.m_start = start;
|
|
range.m_end = end;
|
|
// Only insert unexecuted ranges once for a given sourceID because we may run into a situation where an executable executes, then is GCed, and then is allocated again,
|
|
// and tries to reinsert itself, claiming it has never run, but this is false because it indeed already executed.
|
|
if (map.find(range) == map.end())
|
|
map[range] = false;
|
|
}
|
|
|
|
void FunctionHasExecutedCache::removeUnexecutedRange(intptr_t id, unsigned start, unsigned end)
|
|
{
|
|
// FIXME: We should never have an instance where we return here, but currently do in some situations. Find out why.
|
|
if (m_rangeMap.find(id) == m_rangeMap.end())
|
|
return;
|
|
|
|
RangeMap& map = m_rangeMap.find(id)->second;
|
|
|
|
FunctionRange range;
|
|
range.m_start = start;
|
|
range.m_end = end;
|
|
map[range] = true;
|
|
}
|
|
|
|
Vector<std::tuple<bool, unsigned, unsigned>> FunctionHasExecutedCache::getFunctionRanges(intptr_t id)
|
|
{
|
|
Vector<std::tuple<bool, unsigned, unsigned>> ranges(0);
|
|
auto findResult = m_rangeMap.find(id);
|
|
if (findResult == m_rangeMap.end())
|
|
return ranges;
|
|
|
|
RangeMap& map = m_rangeMap.find(id)->second;
|
|
for (auto& pair : map) {
|
|
const FunctionRange& range = pair.first;
|
|
bool hasExecuted = pair.second;
|
|
ranges.append(std::tuple<bool, unsigned, unsigned>(hasExecuted, range.m_start, range.m_end));
|
|
}
|
|
|
|
return ranges;
|
|
}
|
|
|
|
} // namespace JSC
|