1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
|
/*
* Copyright (C) 2013 Apple Inc. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY APPLE INC. ``AS IS'' AND ANY
* EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
* PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL APPLE INC. OR
* CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
* EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
* PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
* PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY
* OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
#pragma once
#include "GCIncomingRefCounted.h"
#include "Heap.h"
namespace JSC {
template<typename T>
bool GCIncomingRefCounted<T>::addIncomingReference(JSCell* cell)
{
if (!hasAnyIncoming()) {
m_encodedPointer = std::bit_cast<uintptr_t>(cell) | singletonFlag();
this->setIsDeferred(true);
ASSERT(hasSingleton());
return true;
}
ASSERT(Heap::heap(incomingReferenceAt(0)) == Heap::heap(cell));
if (hasSingleton()) {
Vector<JSCell*>* vector = new Vector<JSCell*>();
vector->append(singleton());
vector->append(cell);
m_encodedPointer = std::bit_cast<uintptr_t>(vector);
ASSERT(hasVectorOfCells());
return false;
}
vectorOfCells()->append(cell);
return false;
}
template<typename T>
template<typename FilterFunctionType>
bool GCIncomingRefCounted<T>::filterIncomingReferences(FilterFunctionType&& filterFunction)
{
constexpr bool verbose = false;
if (verbose)
dataLog("Filtering incoming references.\n");
if (!hasAnyIncoming()) {
ASSERT(!this->isDeferred());
ASSERT(this->refCount());
if (verbose)
dataLog(" Has no incoming.\n");
return false;
}
ASSERT(this->isDeferred());
if (hasSingleton()) {
if (filterFunction(singleton())) {
if (verbose)
dataLog(" Singleton passed.\n");
return false;
}
if (verbose)
dataLog(" Removing singleton.\n");
m_encodedPointer = 0;
ASSERT(!hasAnyIncoming());
this->setIsDeferred(false);
return true;
}
if (verbose)
dataLog(" Has ", vectorOfCells()->size(), " entries.\n");
for (size_t i = 0; i < vectorOfCells()->size(); ++i) {
if (filterFunction(vectorOfCells()->at(i)))
continue;
vectorOfCells()->at(i--) = vectorOfCells()->last();
vectorOfCells()->removeLast();
}
if (vectorOfCells()->size() >= 2) {
if (verbose)
dataLog(" Still has ", vectorOfCells()->size(), " entries.\n");
return false;
}
if (vectorOfCells()->isEmpty()) {
if (verbose)
dataLog(" Removing.\n");
delete vectorOfCells();
m_encodedPointer = 0;
ASSERT(!hasAnyIncoming());
this->setIsDeferred(false);
return true;
}
if (verbose)
dataLog(" Shrinking to singleton.\n");
JSCell* singleton = vectorOfCells()->at(0);
delete vectorOfCells();
m_encodedPointer = std::bit_cast<uintptr_t>(singleton) | singletonFlag();
ASSERT(hasSingleton());
return false;
}
} // namespace JSC
|
