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
|
/*
* Copyright (C) 2013, 2016 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 "IterationKind.h"
#include "JSMap.h"
#include "JSObject.h"
namespace JSC {
class JSMapIterator : public JSNonFinalObject {
typedef HashMapBucket<HashMapBucketDataKeyValue> HashMapBucketType;
public:
typedef JSNonFinalObject Base;
DECLARE_EXPORT_INFO;
static Structure* createStructure(VM& vm, JSGlobalObject* globalObject, JSValue prototype)
{
return Structure::create(vm, globalObject, prototype, TypeInfo(ObjectType, StructureFlags), info());
}
static JSMapIterator* create(VM& vm, Structure* structure, JSMap* iteratedObject, IterationKind kind)
{
JSMapIterator* instance = new (NotNull, allocateCell<JSMapIterator>(vm.heap)) JSMapIterator(vm, structure, iteratedObject, kind);
instance->finishCreation(vm, iteratedObject);
return instance;
}
ALWAYS_INLINE HashMapBucketType* advanceIter(ExecState* exec)
{
HashMapBucketType* prev = m_iter.get();
if (!prev)
return nullptr;
HashMapBucketType* bucket = m_iter->next();
while (bucket && bucket->deleted())
bucket = bucket->next();
if (!bucket) {
setIterator(exec->vm(), nullptr);
return nullptr;
}
setIterator(exec->vm(), bucket); // We keep m_iter on the last value since the first thing we do in this function is call next().
return bucket;
}
bool next(ExecState* exec, JSValue& value)
{
HashMapBucketType* bucket = advanceIter(exec);
if (!bucket)
return false;
if (m_kind == IterateValue)
value = bucket->value();
else if (m_kind == IterateKey)
value = bucket->key();
else
value = createPair(exec, bucket->key(), bucket->value());
return true;
}
bool nextKeyValue(ExecState* exec, JSValue& key, JSValue& value)
{
HashMapBucketType* bucket = advanceIter(exec);
if (!bucket)
return false;
key = bucket->key();
value = bucket->value();
return true;
}
IterationKind kind() const { return m_kind; }
JSValue iteratedValue() const { return m_map.get(); }
JSMapIterator* clone(ExecState*);
private:
JSMapIterator(VM& vm, Structure* structure, JSMap*, IterationKind kind)
: Base(vm, structure)
, m_kind(kind)
{ }
void setIterator(VM& vm, HashMapBucketType* bucket)
{
m_iter.setMayBeNull(vm, this, bucket);
}
JS_EXPORT_PRIVATE void finishCreation(VM&, JSMap*);
JSValue createPair(CallFrame*, JSValue, JSValue);
static void visitChildren(JSCell*, SlotVisitor&);
WriteBarrier<JSMap> m_map;
WriteBarrier<HashMapBucketType> m_iter;
IterationKind m_kind;
};
STATIC_ASSERT_IS_TRIVIALLY_DESTRUCTIBLE(JSMapIterator);
} // namespace JSC
|
