1 | /* |
2 | * Copyright (C) 2017 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. AND ITS CONTRIBUTORS ``AS IS'' |
14 | * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, |
15 | * THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR |
16 | * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL APPLE INC. OR ITS CONTRIBUTORS |
17 | * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR |
18 | * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF |
19 | * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS |
20 | * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN |
21 | * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) |
22 | * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF |
23 | * THE POSSIBILITY OF SUCH DAMAGE. |
24 | */ |
25 | |
26 | #include "config.h" |
27 | #include "MarkStackMergingConstraint.h" |
28 | |
29 | #include "GCSegmentedArrayInlines.h" |
30 | #include "JSCInlines.h" |
31 | |
32 | namespace JSC { |
33 | |
34 | MarkStackMergingConstraint::MarkStackMergingConstraint(Heap& heap) |
35 | : MarkingConstraint("Msm" , "Mark Stack Merging" , ConstraintVolatility::GreyedByExecution) |
36 | , m_heap(heap) |
37 | { |
38 | } |
39 | |
40 | MarkStackMergingConstraint::~MarkStackMergingConstraint() |
41 | { |
42 | } |
43 | |
44 | double MarkStackMergingConstraint::quickWorkEstimate(SlotVisitor&) |
45 | { |
46 | return m_heap.m_mutatorMarkStack->size() + m_heap.m_raceMarkStack->size(); |
47 | } |
48 | |
49 | void MarkStackMergingConstraint::prepareToExecuteImpl(const AbstractLocker&, SlotVisitor& visitor) |
50 | { |
51 | // Logging the work here ensures that the constraint solver knows that it doesn't need to produce |
52 | // anymore work. |
53 | size_t size = m_heap.m_mutatorMarkStack->size() + m_heap.m_raceMarkStack->size(); |
54 | visitor.addToVisitCount(size); |
55 | |
56 | if (Options::logGC()) |
57 | dataLog("(" , size, ")" ); |
58 | } |
59 | |
60 | void MarkStackMergingConstraint::executeImpl(SlotVisitor& visitor) |
61 | { |
62 | m_heap.m_mutatorMarkStack->transferTo(visitor.mutatorMarkStack()); |
63 | m_heap.m_raceMarkStack->transferTo(visitor.mutatorMarkStack()); |
64 | } |
65 | |
66 | } // namespace JSC |
67 | |
68 | |