1/*
2 * Copyright (C) 2013-2016 Apple Inc. All rights reserved.
3 *
4 * Redistribution and use in source and binary forms, with or without
5 * modification, are permitted provided that the following conditions
6 * are met:
7 * 1. Redistributions of source code must retain the above copyright
8 * notice, this list of conditions and the following disclaimer.
9 * 2. Redistributions in binary form must reproduce the above copyright
10 * notice, this list of conditions and the following disclaimer in the
11 * documentation and/or other materials provided with the distribution.
12 *
13 * THIS SOFTWARE IS PROVIDED BY APPLE INC. ``AS IS'' AND ANY
14 * EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
15 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
16 * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL APPLE INC. OR
17 * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
18 * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
19 * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
20 * PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY
21 * OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
22 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
23 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
24 */
25
26#include "config.h"
27#include "FTLAbstractHeapRepository.h"
28
29#if ENABLE(FTL_JIT)
30
31#include "B3CCallValue.h"
32#include "B3FenceValue.h"
33#include "B3MemoryValue.h"
34#include "B3PatchpointValue.h"
35#include "B3ValueInlines.h"
36#include "DateInstance.h"
37#include "DirectArguments.h"
38#include "FTLState.h"
39#include "GetterSetter.h"
40#include "JSPropertyNameEnumerator.h"
41#include "JSScope.h"
42#include "JSCInlines.h"
43#include "RegExpObject.h"
44#include "ScopedArguments.h"
45#include "ScopedArgumentsTable.h"
46#include "ShadowChicken.h"
47
48namespace JSC { namespace FTL {
49
50AbstractHeapRepository::AbstractHeapRepository()
51 : root(nullptr, "jscRoot")
52
53#define ABSTRACT_HEAP_INITIALIZATION(name) , name(&root, #name)
54 FOR_EACH_ABSTRACT_HEAP(ABSTRACT_HEAP_INITIALIZATION)
55#undef ABSTRACT_HEAP_INITIALIZATION
56
57#define ABSTRACT_FIELD_INITIALIZATION(name, offset) , name(&root, #name, offset)
58 FOR_EACH_ABSTRACT_FIELD(ABSTRACT_FIELD_INITIALIZATION)
59#undef ABSTRACT_FIELD_INITIALIZATION
60
61 , JSCell_freeListNext(JSCell_header)
62 , ArrayStorage_publicLength(Butterfly_publicLength)
63 , ArrayStorage_vectorLength(Butterfly_vectorLength)
64
65#define INDEXED_ABSTRACT_HEAP_INITIALIZATION(name, offset, size) , name(&root, #name, offset, size)
66 FOR_EACH_INDEXED_ABSTRACT_HEAP(INDEXED_ABSTRACT_HEAP_INITIALIZATION)
67#undef INDEXED_ABSTRACT_HEAP_INITIALIZATION
68
69#define NUMBERED_ABSTRACT_HEAP_INITIALIZATION(name) , name(&root, #name)
70 FOR_EACH_NUMBERED_ABSTRACT_HEAP(NUMBERED_ABSTRACT_HEAP_INITIALIZATION)
71#undef NUMBERED_ABSTRACT_HEAP_INITIALIZATION
72
73 , JSString_value(JSRopeString_fiber0)
74
75 , absolute(&root, "absolute")
76{
77 // Make sure that our explicit assumptions about the StructureIDBlob match reality.
78 RELEASE_ASSERT(!(JSCell_indexingTypeAndMisc.offset() & (sizeof(int32_t) - 1)));
79 RELEASE_ASSERT(JSCell_indexingTypeAndMisc.offset() + 1 == JSCell_typeInfoType.offset());
80 RELEASE_ASSERT(JSCell_indexingTypeAndMisc.offset() + 2 == JSCell_typeInfoFlags.offset());
81 RELEASE_ASSERT(JSCell_indexingTypeAndMisc.offset() + 3 == JSCell_cellState.offset());
82
83 JSCell_structureID.changeParent(&JSCell_header);
84 JSCell_usefulBytes.changeParent(&JSCell_header);
85 JSCell_indexingTypeAndMisc.changeParent(&JSCell_usefulBytes);
86 JSCell_typeInfoType.changeParent(&JSCell_usefulBytes);
87 JSCell_typeInfoFlags.changeParent(&JSCell_usefulBytes);
88 JSCell_cellState.changeParent(&JSCell_usefulBytes);
89 JSRopeString_flags.changeParent(&JSRopeString_fiber0);
90 JSRopeString_length.changeParent(&JSRopeString_fiber1);
91
92 RELEASE_ASSERT(!JSCell_freeListNext.offset());
93}
94
95AbstractHeapRepository::~AbstractHeapRepository()
96{
97}
98
99void AbstractHeapRepository::decorateMemory(const AbstractHeap* heap, B3::Value* value)
100{
101 m_heapForMemory.append(HeapForValue(heap, value));
102}
103
104void AbstractHeapRepository::decorateCCallRead(const AbstractHeap* heap, B3::Value* value)
105{
106 m_heapForCCallRead.append(HeapForValue(heap, value));
107}
108
109void AbstractHeapRepository::decorateCCallWrite(const AbstractHeap* heap, B3::Value* value)
110{
111 m_heapForCCallWrite.append(HeapForValue(heap, value));
112}
113
114void AbstractHeapRepository::decoratePatchpointRead(const AbstractHeap* heap, B3::Value* value)
115{
116 m_heapForPatchpointRead.append(HeapForValue(heap, value));
117}
118
119void AbstractHeapRepository::decoratePatchpointWrite(const AbstractHeap* heap, B3::Value* value)
120{
121 m_heapForPatchpointWrite.append(HeapForValue(heap, value));
122}
123
124void AbstractHeapRepository::decorateFenceRead(const AbstractHeap* heap, B3::Value* value)
125{
126 m_heapForFenceRead.append(HeapForValue(heap, value));
127}
128
129void AbstractHeapRepository::decorateFenceWrite(const AbstractHeap* heap, B3::Value* value)
130{
131 m_heapForFenceWrite.append(HeapForValue(heap, value));
132}
133
134void AbstractHeapRepository::decorateFencedAccess(const AbstractHeap* heap, B3::Value* value)
135{
136 m_heapForFencedAccess.append(HeapForValue(heap, value));
137}
138
139void AbstractHeapRepository::computeRangesAndDecorateInstructions()
140{
141 using namespace B3;
142 root.compute();
143
144 if (verboseCompilationEnabled()) {
145 dataLog("Abstract Heap Repository:\n");
146 root.deepDump(WTF::dataFile());
147 }
148
149 auto rangeFor = [&] (const AbstractHeap* heap) -> HeapRange {
150 if (heap)
151 return heap->range();
152 return HeapRange();
153 };
154
155 for (HeapForValue entry : m_heapForMemory)
156 entry.value->as<MemoryValue>()->setRange(rangeFor(entry.heap));
157 for (HeapForValue entry : m_heapForCCallRead)
158 entry.value->as<CCallValue>()->effects.reads = rangeFor(entry.heap);
159 for (HeapForValue entry : m_heapForCCallWrite)
160 entry.value->as<CCallValue>()->effects.writes = rangeFor(entry.heap);
161 for (HeapForValue entry : m_heapForPatchpointRead)
162 entry.value->as<PatchpointValue>()->effects.reads = rangeFor(entry.heap);
163 for (HeapForValue entry : m_heapForPatchpointWrite)
164 entry.value->as<PatchpointValue>()->effects.writes = rangeFor(entry.heap);
165 for (HeapForValue entry : m_heapForFenceRead)
166 entry.value->as<FenceValue>()->read = rangeFor(entry.heap);
167 for (HeapForValue entry : m_heapForFenceWrite)
168 entry.value->as<FenceValue>()->write = rangeFor(entry.heap);
169 for (HeapForValue entry : m_heapForFencedAccess)
170 entry.value->as<MemoryValue>()->setFenceRange(rangeFor(entry.heap));
171}
172
173} } // namespace JSC::FTL
174
175#endif // ENABLE(FTL_JIT)
176
177