2 * Copyright (C) 2012, 2014 Apple Inc. All rights reserved.
4 * Redistribution and use in source and binary forms, with or without
5 * modification, are permitted provided that the following conditions
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.
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.
27 #include "PolymorphicPutByIdList.h"
31 #include "StructureStubInfo.h"
35 PutByIdAccess
PutByIdAccess::fromStructureStubInfo(StructureStubInfo
& stubInfo
)
37 MacroAssemblerCodePtr initialSlowPath
=
38 stubInfo
.callReturnLocation
.labelAtOffset(stubInfo
.patch
.deltaCallToSlowCase
);
42 switch (stubInfo
.accessType
) {
43 case access_put_by_id_replace
:
44 result
.m_type
= Replace
;
45 result
.m_oldStructure
.copyFrom(stubInfo
.u
.putByIdReplace
.baseObjectStructure
);
46 result
.m_stubRoutine
= JITStubRoutine::createSelfManagedRoutine(initialSlowPath
);
49 case access_put_by_id_transition_direct
:
50 case access_put_by_id_transition_normal
:
51 result
.m_type
= Transition
;
52 result
.m_oldStructure
.copyFrom(stubInfo
.u
.putByIdTransition
.previousStructure
);
53 result
.m_newStructure
.copyFrom(stubInfo
.u
.putByIdTransition
.structure
);
54 result
.m_chain
.copyFrom(stubInfo
.u
.putByIdTransition
.chain
);
55 result
.m_stubRoutine
= stubInfo
.stubRoutine
;
59 RELEASE_ASSERT_NOT_REACHED();
65 bool PutByIdAccess::visitWeak(RepatchBuffer
& repatchBuffer
) const
69 if (!Heap::isMarked(m_oldStructure
.get()))
73 if (!Heap::isMarked(m_oldStructure
.get()))
75 if (!Heap::isMarked(m_newStructure
.get()))
77 if (!Heap::isMarked(m_chain
.get()))
82 if (!Heap::isMarked(m_oldStructure
.get()))
84 if (m_chain
&& !Heap::isMarked(m_chain
.get()))
88 RELEASE_ASSERT_NOT_REACHED();
91 if (!m_stubRoutine
->visitWeak(repatchBuffer
))
96 PolymorphicPutByIdList::PolymorphicPutByIdList(
97 PutKind putKind
, StructureStubInfo
& stubInfo
)
100 if (stubInfo
.accessType
!= access_unset
)
101 m_list
.append(PutByIdAccess::fromStructureStubInfo(stubInfo
));
104 PolymorphicPutByIdList
* PolymorphicPutByIdList::from(
105 PutKind putKind
, StructureStubInfo
& stubInfo
)
107 if (stubInfo
.accessType
== access_put_by_id_list
)
108 return stubInfo
.u
.putByIdList
.list
;
110 ASSERT(stubInfo
.accessType
== access_put_by_id_replace
111 || stubInfo
.accessType
== access_put_by_id_transition_normal
112 || stubInfo
.accessType
== access_put_by_id_transition_direct
113 || stubInfo
.accessType
== access_unset
);
115 PolymorphicPutByIdList
* result
=
116 new PolymorphicPutByIdList(putKind
, stubInfo
);
118 stubInfo
.initPutByIdList(result
);
123 PolymorphicPutByIdList::~PolymorphicPutByIdList() { }
125 bool PolymorphicPutByIdList::isFull() const
127 ASSERT(size() <= POLYMORPHIC_LIST_CACHE_SIZE
);
128 return size() == POLYMORPHIC_LIST_CACHE_SIZE
;
131 bool PolymorphicPutByIdList::isAlmostFull() const
133 ASSERT(size() <= POLYMORPHIC_LIST_CACHE_SIZE
);
134 return size() >= POLYMORPHIC_LIST_CACHE_SIZE
- 1;
137 void PolymorphicPutByIdList::addAccess(const PutByIdAccess
& putByIdAccess
)
140 // Make sure that the resizing optimizes for space, not time.
141 m_list
.resize(m_list
.size() + 1);
142 m_list
.last() = putByIdAccess
;
145 bool PolymorphicPutByIdList::visitWeak(RepatchBuffer
& repatchBuffer
) const
147 for (unsigned i
= 0; i
< size(); ++i
) {
148 if (!at(i
).visitWeak(repatchBuffer
))
156 #endif // ENABLE(JIT)