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 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269
|
/*
* Copyright (C) 2008, 2012, 2013, 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.
*/
#ifndef StructureStubInfo_h
#define StructureStubInfo_h
#include "CodeOrigin.h"
#include "Instruction.h"
#include "JITStubRoutine.h"
#include "MacroAssembler.h"
#include "Opcode.h"
#include "PolymorphicAccessStructureList.h"
#include "RegisterSet.h"
#include "SpillRegistersMode.h"
#include "Structure.h"
#include "StructureStubClearingWatchpoint.h"
#include <wtf/OwnPtr.h>
namespace JSC {
#if ENABLE(JIT)
class PolymorphicGetByIdList;
class PolymorphicPutByIdList;
enum AccessType {
access_get_by_id_self,
access_get_by_id_list,
access_put_by_id_transition_normal,
access_put_by_id_transition_direct,
access_put_by_id_replace,
access_put_by_id_list,
access_unset,
access_in_list
};
inline bool isGetByIdAccess(AccessType accessType)
{
switch (accessType) {
case access_get_by_id_self:
case access_get_by_id_list:
return true;
default:
return false;
}
}
inline bool isPutByIdAccess(AccessType accessType)
{
switch (accessType) {
case access_put_by_id_transition_normal:
case access_put_by_id_transition_direct:
case access_put_by_id_replace:
case access_put_by_id_list:
return true;
default:
return false;
}
}
inline bool isInAccess(AccessType accessType)
{
switch (accessType) {
case access_in_list:
return true;
default:
return false;
}
}
struct StructureStubInfo {
StructureStubInfo()
: accessType(access_unset)
, seen(false)
, resetByGC(false)
{
}
void initGetByIdSelf(VM& vm, JSCell* owner, Structure* baseObjectStructure)
{
accessType = access_get_by_id_self;
u.getByIdSelf.baseObjectStructure.set(vm, owner, baseObjectStructure);
}
void initGetByIdList(PolymorphicGetByIdList* list)
{
accessType = access_get_by_id_list;
u.getByIdList.list = list;
}
// PutById*
void initPutByIdTransition(VM& vm, JSCell* owner, Structure* previousStructure, Structure* structure, StructureChain* chain, bool isDirect)
{
if (isDirect)
accessType = access_put_by_id_transition_direct;
else
accessType = access_put_by_id_transition_normal;
u.putByIdTransition.previousStructure.set(vm, owner, previousStructure);
u.putByIdTransition.structure.set(vm, owner, structure);
u.putByIdTransition.chain.set(vm, owner, chain);
}
void initPutByIdReplace(VM& vm, JSCell* owner, Structure* baseObjectStructure)
{
accessType = access_put_by_id_replace;
u.putByIdReplace.baseObjectStructure.set(vm, owner, baseObjectStructure);
}
void initPutByIdList(PolymorphicPutByIdList* list)
{
accessType = access_put_by_id_list;
u.putByIdList.list = list;
}
void initInList(PolymorphicAccessStructureList* list, int listSize)
{
accessType = access_in_list;
u.inList.structureList = list;
u.inList.listSize = listSize;
}
void reset()
{
deref();
accessType = access_unset;
stubRoutine.clear();
watchpoints.clear();
}
void deref();
// Check if the stub has weak references that are dead. If there are dead ones that imply
// that the stub should be entirely reset, this should return false. If there are dead ones
// that can be handled internally by the stub and don't require a full reset, then this
// should reset them and return true. If there are no dead weak references, return true.
// If this method returns true it means that it has left the stub in a state where all
// outgoing GC pointers are known to point to currently marked objects; this method is
// allowed to accomplish this by either clearing those pointers somehow or by proving that
// they have already been marked. It is not allowed to mark new objects.
bool visitWeakReferences(RepatchBuffer&);
bool seenOnce()
{
return seen;
}
void setSeen()
{
seen = true;
}
StructureStubClearingWatchpoint* addWatchpoint(CodeBlock* codeBlock)
{
return WatchpointsOnStructureStubInfo::ensureReferenceAndAddWatchpoint(
watchpoints, codeBlock, this);
}
int8_t accessType;
bool seen : 1;
bool resetByGC : 1;
CodeOrigin codeOrigin;
struct {
unsigned spillMode : 8;
int8_t baseGPR;
#if USE(JSVALUE32_64)
int8_t valueTagGPR;
#endif
int8_t valueGPR;
RegisterSet usedRegisters;
int32_t deltaCallToDone;
int32_t deltaCallToStorageLoad;
int32_t deltaCallToJump;
int32_t deltaCallToSlowCase;
int32_t deltaCheckImmToCall;
#if USE(JSVALUE64)
int32_t deltaCallToLoadOrStore;
#else
int32_t deltaCallToTagLoadOrStore;
int32_t deltaCallToPayloadLoadOrStore;
#endif
} patch;
union {
struct {
// It would be unwise to put anything here, as it will surely be overwritten.
} unset;
struct {
WriteBarrierBase<Structure> baseObjectStructure;
} getByIdSelf;
struct {
WriteBarrierBase<Structure> baseObjectStructure;
WriteBarrierBase<Structure> prototypeStructure;
bool isDirect;
} getByIdProto;
struct {
WriteBarrierBase<Structure> baseObjectStructure;
WriteBarrierBase<StructureChain> chain;
unsigned count : 31;
bool isDirect : 1;
} getByIdChain;
struct {
PolymorphicGetByIdList* list;
} getByIdList;
struct {
WriteBarrierBase<Structure> previousStructure;
WriteBarrierBase<Structure> structure;
WriteBarrierBase<StructureChain> chain;
} putByIdTransition;
struct {
WriteBarrierBase<Structure> baseObjectStructure;
} putByIdReplace;
struct {
PolymorphicPutByIdList* list;
} putByIdList;
struct {
PolymorphicAccessStructureList* structureList;
int listSize;
} inList;
} u;
RefPtr<JITStubRoutine> stubRoutine;
CodeLocationCall callReturnLocation;
RefPtr<WatchpointsOnStructureStubInfo> watchpoints;
};
inline CodeOrigin getStructureStubInfoCodeOrigin(StructureStubInfo& structureStubInfo)
{
return structureStubInfo.codeOrigin;
}
typedef HashMap<CodeOrigin, StructureStubInfo*, CodeOriginApproximateHash> StubInfoMap;
#else
typedef HashMap<int, void*> StubInfoMap;
#endif // ENABLE(JIT)
} // namespace JSC
#endif // StructureStubInfo_h
|