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 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158
|
/*
* Copyright (C) 2013-2021 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
#if ENABLE(DFG_JIT)
#include "BaselineJITCode.h"
#include "CallLinkInfo.h"
#include "CodeBlockJettisoningWatchpoint.h"
#include "DFGAdaptiveInferredPropertyValueWatchpoint.h"
#include "DFGAdaptiveStructureWatchpoint.h"
#include "DFGCodeOriginPool.h"
#include "DFGJumpReplacement.h"
#include "DFGOSREntry.h"
#include "InlineCallFrameSet.h"
#include "JITMathIC.h"
#include "JSCast.h"
#include "PCToCodeOriginMap.h"
#include "ProfilerCompilation.h"
#include "RecordedStatuses.h"
#include "StructureStubInfo.h"
#include "YarrJIT.h"
#include <wtf/Bag.h>
#include <wtf/Noncopyable.h>
#include <wtf/text/StringSearch.h>
namespace JSC {
class CodeBlock;
class Identifier;
class TrackedReferences;
namespace DFG {
struct Node;
class Plan;
// CommonData holds the set of data that both DFG and FTL code blocks need to know
// about themselves.
struct WeakReferenceTransition {
WeakReferenceTransition() { }
WeakReferenceTransition(VM& vm, JSCell* owner, JSCell* codeOrigin, JSCell* from, JSCell* to)
: m_from(vm, owner, from)
, m_to(vm, owner, to)
{
if (!!codeOrigin)
m_codeOrigin.set(vm, owner, codeOrigin);
}
WriteBarrier<JSCell> m_codeOrigin;
WriteBarrier<JSCell> m_from;
WriteBarrier<JSCell> m_to;
};
class CommonData : public MathICHolder {
WTF_MAKE_NONCOPYABLE(CommonData);
public:
CommonData(bool isUnlinked)
: codeOrigins(CodeOriginPool::create())
, m_isUnlinked(isUnlinked)
{ }
~CommonData();
void shrinkToFit();
bool invalidateLinkedCode(); // Returns true if we did invalidate, or false if the code block was already invalidated.
bool hasInstalledVMTrapsBreakpoints() const { return m_isStillValid && m_hasVMTrapsBreakpointsInstalled; }
void installVMTrapBreakpoints(CodeBlock* owner);
bool isUnlinked() const { return m_isUnlinked; }
bool isStillValid() const { return m_isStillValid; }
CatchEntrypointData* catchOSREntryDataForBytecodeIndex(BytecodeIndex bytecodeIndex)
{
return tryBinarySearch<CatchEntrypointData, BytecodeIndex>(
m_catchEntrypoints, m_catchEntrypoints.size(), bytecodeIndex,
[] (const CatchEntrypointData* item) { return item->bytecodeIndex; });
}
void finalizeCatchEntrypoints(Vector<CatchEntrypointData>&&);
unsigned requiredRegisterCountForExecutionAndExit() const
{
return std::max(frameRegisterCount, requiredRegisterCountForExit);
}
void validateReferences(const TrackedReferences&);
static constexpr ptrdiff_t frameRegisterCountOffset() { return OBJECT_OFFSETOF(CommonData, frameRegisterCount); }
void clearWatchpoints();
RefPtr<InlineCallFrameSet> inlineCallFrames;
Ref<CodeOriginPool> codeOrigins;
FixedVector<Identifier> m_dfgIdentifiers;
FixedVector<WeakReferenceTransition> m_transitions;
FixedVector<WriteBarrier<JSCell>> m_weakReferences;
FixedVector<StructureID> m_weakStructureReferences;
FixedVector<CatchEntrypointData> m_catchEntrypoints;
FixedVector<CodeBlockJettisoningWatchpoint> m_watchpoints;
FixedVector<AdaptiveStructureWatchpoint> m_adaptiveStructureWatchpoints;
FixedVector<AdaptiveInferredPropertyValueWatchpoint> m_adaptiveInferredPropertyValueWatchpoints;
std::unique_ptr<PCToCodeOriginMap> m_pcToCodeOriginMap;
std::unique_ptr<RecordedStatuses> recordedStatuses;
FixedVector<JumpReplacement> m_jumpReplacements;
FixedVector<std::unique_ptr<BoyerMooreHorspoolTable<uint8_t>>> m_stringSearchTable8;
Bag<StructureStubInfo> m_stubInfos;
Bag<OptimizingCallLinkInfo> m_callLinkInfos;
Bag<DirectCallLinkInfo> m_directCallLinkInfos;
Yarr::YarrBoyerMooreData m_boyerMooreData;
ScratchBuffer* catchOSREntryBuffer;
RefPtr<Profiler::Compilation> compilation;
#if USE(JSVALUE32_64)
Bag<double> doubleConstants;
#endif
unsigned frameRegisterCount { std::numeric_limits<unsigned>::max() };
unsigned requiredRegisterCountForExit { std::numeric_limits<unsigned>::max() };
private:
bool m_isUnlinked { false };
bool m_isStillValid { true };
bool m_hasVMTrapsBreakpointsInstalled { false };
};
CodeBlock* codeBlockForVMTrapPC(void* pc);
} } // namespace JSC::DFG
#endif // ENABLE(DFG_JIT)
|