summaryrefslogtreecommitdiff
path: root/Source/JavaScriptCore/runtime/FunctionHasExecutedCache.cpp
diff options
context:
space:
mode:
authorLorry Tar Creator <lorry-tar-importer@lorry>2016-04-10 09:28:39 +0000
committerLorry Tar Creator <lorry-tar-importer@lorry>2016-04-10 09:28:39 +0000
commit32761a6cee1d0dee366b885b7b9c777e67885688 (patch)
treed6bec92bebfb216f4126356e55518842c2f476a1 /Source/JavaScriptCore/runtime/FunctionHasExecutedCache.cpp
parenta4e969f4965059196ca948db781e52f7cfebf19e (diff)
downloadWebKitGtk-tarball-32761a6cee1d0dee366b885b7b9c777e67885688.tar.gz
webkitgtk-2.4.11webkitgtk-2.4.11
Diffstat (limited to 'Source/JavaScriptCore/runtime/FunctionHasExecutedCache.cpp')
-rw-r--r--Source/JavaScriptCore/runtime/FunctionHasExecutedCache.cpp100
1 files changed, 0 insertions, 100 deletions
diff --git a/Source/JavaScriptCore/runtime/FunctionHasExecutedCache.cpp b/Source/JavaScriptCore/runtime/FunctionHasExecutedCache.cpp
deleted file mode 100644
index 3d7e31b2e..000000000
--- a/Source/JavaScriptCore/runtime/FunctionHasExecutedCache.cpp
+++ /dev/null
@@ -1,100 +0,0 @@
-/*
- * 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 iter = map.begin(), end = map.end(); iter != end; ++iter) {
- const FunctionRange& range = iter->first;
- if (range.m_start <= offset && offset <= range.m_end && range.m_end - range.m_start < distance) {
- hasExecuted = iter->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 iter = map.begin(), end = map.end(); iter != end; ++iter) {
- const FunctionRange& range = iter->first;
- bool hasExecuted = iter->second;
- ranges.append(std::tuple<bool, unsigned, unsigned>(hasExecuted, range.m_start, range.m_end));
- }
-
- return ranges;
-}
-
-} // namespace JSC