]>
Commit | Line | Data |
---|---|---|
ed1e77d3 A |
1 | /* |
2 | * Copyright (C) 2014, 2015 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 | #ifndef DFGPromoteHeapAccess_h | |
27 | #define DFGPromoteHeapAccess_h | |
28 | ||
29 | #if ENABLE(DFG_JIT) | |
30 | ||
31 | #include "DFGNode.h" | |
32 | #include "DFGPromotedHeapLocation.h" | |
33 | ||
34 | namespace JSC { namespace DFG { | |
35 | ||
36 | template<typename WriteFunctor, typename ReadFunctor> | |
37 | void promoteHeapAccess(Node* node, const WriteFunctor& write, const ReadFunctor& read) | |
38 | { | |
39 | switch (node->op()) { | |
40 | case CheckStructure: { | |
41 | if (node->child1()->isPhantomObjectAllocation()) | |
42 | read(PromotedHeapLocation(StructurePLoc, node->child1())); | |
43 | break; | |
44 | } | |
45 | ||
46 | case GetByOffset: | |
47 | case GetGetterSetterByOffset: { | |
48 | if (node->child2()->isPhantomObjectAllocation()) { | |
49 | unsigned identifierNumber = node->storageAccessData().identifierNumber; | |
50 | read(PromotedHeapLocation(NamedPropertyPLoc, node->child2(), identifierNumber)); | |
51 | } | |
52 | break; | |
53 | } | |
54 | ||
55 | case MultiGetByOffset: { | |
56 | if (node->child1()->isPhantomObjectAllocation()) { | |
57 | unsigned identifierNumber = node->multiGetByOffsetData().identifierNumber; | |
58 | read(PromotedHeapLocation(NamedPropertyPLoc, node->child1(), identifierNumber)); | |
59 | } | |
60 | break; | |
61 | } | |
62 | ||
63 | case GetClosureVar: | |
64 | if (node->child1()->isPhantomActivationAllocation()) | |
65 | read(PromotedHeapLocation(ClosureVarPLoc, node->child1(), node->scopeOffset().offset())); | |
66 | break; | |
67 | ||
68 | case SkipScope: | |
69 | if (node->child1()->isPhantomActivationAllocation()) | |
70 | read(PromotedHeapLocation(ActivationScopePLoc, node->child1())); | |
71 | break; | |
72 | ||
73 | case GetScope: | |
74 | if (node->child1()->isPhantomFunctionAllocation()) | |
75 | read(PromotedHeapLocation(FunctionActivationPLoc, node->child1())); | |
76 | break; | |
77 | ||
78 | case GetExecutable: | |
79 | if (node->child1()->isPhantomFunctionAllocation()) | |
80 | read(PromotedHeapLocation(FunctionExecutablePLoc, node->child1())); | |
81 | break; | |
82 | ||
83 | case PutHint: { | |
84 | ASSERT(node->child1()->isPhantomAllocation()); | |
85 | write( | |
86 | PromotedHeapLocation(node->child1().node(), node->promotedLocationDescriptor()), | |
87 | node->child2()); | |
88 | break; | |
89 | } | |
90 | ||
91 | default: | |
92 | break; | |
93 | } | |
94 | } | |
95 | ||
96 | } } // namespace JSC::DFG | |
97 | ||
98 | #endif // ENABLE(DFG_JIT) | |
99 | ||
100 | #endif // DFGPromoteHeapAccess_h | |
101 |