]>
Commit | Line | Data |
---|---|---|
81345200 A |
1 | /* |
2 | * Copyright (C) 2013 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 "ArityCheckFailReturnThunks.h" | |
28 | ||
29 | #if ENABLE(JIT) | |
30 | ||
31 | #include "AssemblyHelpers.h" | |
32 | #include "LinkBuffer.h" | |
33 | #include "JSCInlines.h" | |
34 | #include "StackAlignment.h" | |
35 | ||
36 | namespace JSC { | |
37 | ||
38 | ArityCheckFailReturnThunks::ArityCheckFailReturnThunks() | |
39 | : m_nextSize(0) | |
40 | { | |
41 | } | |
42 | ||
43 | ArityCheckFailReturnThunks::~ArityCheckFailReturnThunks() { } | |
44 | ||
45 | CodeLocationLabel* ArityCheckFailReturnThunks::returnPCsFor( | |
46 | VM& vm, unsigned numExpectedArgumentsIncludingThis) | |
47 | { | |
48 | ASSERT(numExpectedArgumentsIncludingThis >= 1); | |
49 | ||
50 | numExpectedArgumentsIncludingThis = WTF::roundUpToMultipleOf( | |
51 | stackAlignmentRegisters(), numExpectedArgumentsIncludingThis); | |
52 | ||
53 | { | |
54 | ConcurrentJITLocker locker(m_lock); | |
55 | if (numExpectedArgumentsIncludingThis < m_nextSize) | |
56 | return m_returnPCArrays.last().get(); | |
57 | } | |
58 | ||
59 | ASSERT(!isCompilationThread()); | |
60 | ||
61 | numExpectedArgumentsIncludingThis = std::max(numExpectedArgumentsIncludingThis, m_nextSize * 2); | |
62 | ||
63 | AssemblyHelpers jit(&vm, 0); | |
64 | ||
65 | Vector<AssemblyHelpers::Label> labels; | |
66 | ||
67 | for (unsigned size = m_nextSize; size <= numExpectedArgumentsIncludingThis; size += stackAlignmentRegisters()) { | |
68 | labels.append(jit.label()); | |
69 | ||
70 | jit.load32( | |
71 | AssemblyHelpers::Address( | |
72 | AssemblyHelpers::stackPointerRegister, | |
73 | (JSStack::ArgumentCount - JSStack::CallerFrameAndPCSize) * sizeof(Register) + | |
74 | PayloadOffset), | |
75 | GPRInfo::regT4); | |
76 | jit.add32( | |
77 | AssemblyHelpers::TrustedImm32( | |
78 | JSStack::CallFrameHeaderSize - JSStack::CallerFrameAndPCSize + size - 1), | |
79 | GPRInfo::regT4, GPRInfo::regT2); | |
80 | jit.lshift32(AssemblyHelpers::TrustedImm32(3), GPRInfo::regT2); | |
81 | jit.addPtr(AssemblyHelpers::stackPointerRegister, GPRInfo::regT2); | |
82 | jit.loadPtr(GPRInfo::regT2, GPRInfo::regT2); | |
83 | ||
84 | jit.addPtr( | |
85 | AssemblyHelpers::TrustedImm32(size * sizeof(Register)), | |
86 | AssemblyHelpers::stackPointerRegister); | |
87 | ||
88 | // Thunks like ours want to use the return PC to figure out where things | |
89 | // were saved. So, we pay it forward. | |
90 | jit.store32( | |
91 | GPRInfo::regT4, | |
92 | AssemblyHelpers::Address( | |
93 | AssemblyHelpers::stackPointerRegister, | |
94 | (JSStack::ArgumentCount - JSStack::CallerFrameAndPCSize) * sizeof(Register) + | |
95 | PayloadOffset)); | |
96 | ||
97 | jit.jump(GPRInfo::regT2); | |
98 | } | |
99 | ||
ed1e77d3 A |
100 | // Sadly, we cannot fail here because the LLInt may need us. |
101 | LinkBuffer linkBuffer(vm, jit, GLOBAL_THUNK_ID, JITCompilationMustSucceed); | |
81345200 A |
102 | |
103 | unsigned returnPCsSize = numExpectedArgumentsIncludingThis / stackAlignmentRegisters() + 1; | |
104 | std::unique_ptr<CodeLocationLabel[]> returnPCs = | |
105 | std::make_unique<CodeLocationLabel[]>(returnPCsSize); | |
106 | for (unsigned size = 0; size <= numExpectedArgumentsIncludingThis; size += stackAlignmentRegisters()) { | |
107 | unsigned index = size / stackAlignmentRegisters(); | |
108 | RELEASE_ASSERT(index < returnPCsSize); | |
109 | if (size < m_nextSize) | |
110 | returnPCs[index] = m_returnPCArrays.last()[index]; | |
111 | else | |
112 | returnPCs[index] = linkBuffer.locationOf(labels[(size - m_nextSize) / stackAlignmentRegisters()]); | |
113 | } | |
114 | ||
115 | CodeLocationLabel* result = returnPCs.get(); | |
116 | ||
117 | { | |
118 | ConcurrentJITLocker locker(m_lock); | |
119 | m_returnPCArrays.append(WTF::move(returnPCs)); | |
120 | m_refs.append(FINALIZE_CODE(linkBuffer, ("Arity check fail return thunks for up to numArgs = %u", numExpectedArgumentsIncludingThis))); | |
121 | m_nextSize = numExpectedArgumentsIncludingThis + stackAlignmentRegisters(); | |
122 | } | |
123 | ||
124 | return result; | |
125 | } | |
126 | ||
127 | CodeLocationLabel ArityCheckFailReturnThunks::returnPCFor(VM& vm, unsigned slotsToAdd) | |
128 | { | |
129 | return returnPCsFor(vm, slotsToAdd)[slotsToAdd / stackAlignmentRegisters()]; | |
130 | } | |
131 | ||
132 | } // namespace JSC | |
133 | ||
134 | #endif // ENABLE(JIT) | |
135 |