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
127
128
129
130
131
132
|
/*
* Copyright (C) 1999 Lars Knoll (knoll@kde.org)
* (C) 1999 Antti Koivisto (koivisto@kde.org)
* (C) 2001 Dirk Mueller (mueller@kde.org)
* Copyright (C) 2004-2020 Apple Inc. All rights reserved.
* Copyright (C) 2008, 2009 Torch Mobile Inc. All rights reserved. (http://www.torchmobile.com/)
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Library General Public
* License as published by the Free Software Foundation; either
* version 2 of the License, or (at your option) any later version.
*
* This library is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
* Library General Public License for more details.
*
* You should have received a copy of the GNU Library General Public License
* along with this library; see the file COPYING.LIB. If not, write to
* the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,
* Boston, MA 02110-1301, USA.
*
*/
#pragma once
#include "root.h"
#include "EventTarget.h"
#include "ExceptionOr.h"
#include <wtf/CompactUniquePtrTuple.h>
#include <wtf/FixedVector.h>
#include <wtf/Forward.h>
// #include <wtf/IsoMalloc.h>
#include <wtf/ListHashSet.h>
#include <wtf/MainThread.h>
#include <wtf/OptionSet.h>
#include <wtf/URLHash.h>
#include <wtf/WeakPtr.h>
#include "EventTargetConcrete.h"
namespace WebCore {
// The full Node type is way too much stuff
// this ones just a baby
class Node : public RefPtr<Node>, CanMakeWeakPtr<Node>, public EventTarget {
WTF_MAKE_ISO_ALLOCATED(Node);
static constexpr uint32_t s_refCountIncrement = 2;
static constexpr uint32_t s_refCountMask = ~static_cast<uint32_t>(1);
public:
void defaultEventHandler(Event&)
{
// do nothing
}
void handleEvent(ScriptExecutionContext&, Event&)
{
}
bool hasEventTargetData()
{
return true;
}
void ref() const;
void deref() const;
bool hasOneRef() const;
unsigned refCount() const;
void removedLastRef() {}
mutable uint32_t m_refCountAndParentBit { s_refCountIncrement };
// mutable OptionSet<NodeFlag> m_nodeFlags;
};
#if ASSERT_ENABLED
inline void adopted(Node* node)
{
if (!node)
return;
ASSERT(!node->m_deletionHasBegun);
ASSERT(!node->m_inRemovedLastRefFunction);
node->m_adoptionIsRequired = false;
}
#endif // ASSERT_ENABLED
ALWAYS_INLINE void Node::ref() const
{
ASSERT(isMainThread());
ASSERT(!m_deletionHasBegun);
ASSERT(!m_inRemovedLastRefFunction);
ASSERT(!m_adoptionIsRequired);
m_refCountAndParentBit += s_refCountIncrement;
}
ALWAYS_INLINE void Node::deref() const
{
ASSERT(isMainThread());
ASSERT(refCount());
ASSERT(!m_deletionHasBegun);
ASSERT(!m_inRemovedLastRefFunction);
ASSERT(!m_adoptionIsRequired);
auto updatedRefCount = m_refCountAndParentBit - s_refCountIncrement;
if (!updatedRefCount) {
// Don't update m_refCountAndParentBit to avoid double destruction through use of Ref<T>/RefPtr<T>.
// (This is a security mitigation in case of programmer error. It will ASSERT in debug builds.)
#if ASSERT_ENABLED
m_inRemovedLastRefFunction = true;
#endif
const_cast<Node&>(*this).removedLastRef();
return;
}
m_refCountAndParentBit = updatedRefCount;
}
ALWAYS_INLINE bool Node::hasOneRef() const
{
ASSERT(!m_deletionHasBegun);
ASSERT(!m_inRemovedLastRefFunction);
return refCount() == 1;
}
ALWAYS_INLINE unsigned Node::refCount() const
{
return m_refCountAndParentBit / s_refCountIncrement;
}
}
|
