1 /*
2 * Copyright (c) 2021 Huawei Device Co., Ltd.
3 * Licensed under the Apache License, Version 2.0 (the "License");
4 * you may not use this file except in compliance with the License.
5 * You may obtain a copy of the License at
6 *
7 * http://www.apache.org/licenses/LICENSE-2.0
8 *
9 * Unless required by applicable law or agreed to in writing, software
10 * distributed under the License is distributed on an "AS IS" BASIS,
11 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
12 * See the License for the specific language governing permissions and
13 * limitations under the License.
14 */
15
16 #include "ecmascript/containers/containers_private.h"
17 #include "ecmascript/ecma_string.h"
18 #include "ecmascript/ecma_vm.h"
19 #include "ecmascript/global_env.h"
20 #include "ecmascript/js_api_tree_set.h"
21 #include "ecmascript/js_api_tree_set_iterator.h"
22 #include "ecmascript/js_function.h"
23 #include "ecmascript/js_handle.h"
24 #include "ecmascript/js_iterator.h"
25 #include "ecmascript/js_object-inl.h"
26 #include "ecmascript/js_tagged_value.h"
27 #include "ecmascript/object_factory.h"
28 #include "ecmascript/tagged_tree-inl.h"
29 #include "ecmascript/tests/test_helper.h"
30
31 using namespace panda;
32
33 using namespace panda::ecmascript;
34
35 namespace panda::test {
36 class JSAPITreeSetTest : public testing::Test {
37 public:
SetUpTestCase()38 static void SetUpTestCase()
39 {
40 GTEST_LOG_(INFO) << "SetUpTestCase";
41 }
42
TearDownTestCase()43 static void TearDownTestCase()
44 {
45 GTEST_LOG_(INFO) << "TearDownCase";
46 }
47
SetUp()48 void SetUp() override
49 {
50 TestHelper::CreateEcmaVMWithScope(instance, thread, scope);
51 }
52
TearDown()53 void TearDown() override
54 {
55 TestHelper::DestroyEcmaVMWithScope(instance, scope);
56 }
57
58 PandaVM *instance {nullptr};
59 ecmascript::EcmaHandleScope *scope {nullptr};
60 JSThread *thread {nullptr};
61
62 protected:
CreateTreeSet()63 JSAPITreeSet *CreateTreeSet()
64 {
65 ObjectFactory *factory = thread->GetEcmaVM()->GetFactory();
66 JSHandle<GlobalEnv> env = thread->GetEcmaVM()->GetGlobalEnv();
67
68 JSHandle<JSTaggedValue> globalObject = env->GetJSGlobalObject();
69 JSHandle<JSTaggedValue> key(factory->NewFromCanBeCompressString("ArkPrivate"));
70 JSHandle<JSTaggedValue> value =
71 JSObject::GetProperty(thread, JSHandle<JSTaggedValue>(globalObject), key).GetValue();
72
73 auto objCallInfo = TestHelper::CreateEcmaRuntimeCallInfo(thread, JSTaggedValue::Undefined(), 6);
74 objCallInfo->SetFunction(JSTaggedValue::Undefined());
75 objCallInfo->SetThis(value.GetTaggedValue());
76 objCallInfo->SetCallArg(0, JSTaggedValue(static_cast<int>(containers::ContainerTag::TreeSet)));
77
78 [[maybe_unused]] auto prev = TestHelper::SetupFrame(thread, objCallInfo.get());
79 JSTaggedValue result = containers::ContainersPrivate::Load(objCallInfo.get());
80 TestHelper::TearDownFrame(thread, prev);
81
82 JSHandle<JSTaggedValue> constructor(thread, result);
83 JSHandle<JSAPITreeSet> set(factory->NewJSObjectByConstructor(JSHandle<JSFunction>(constructor), constructor));
84 JSTaggedValue internal = TaggedTreeSet::Create(thread);
85 set->SetTreeSet(thread, internal);
86 return *set;
87 }
88 };
89
HWTEST_F_L0(JSAPITreeSetTest,TreeSetCreate)90 HWTEST_F_L0(JSAPITreeSetTest, TreeSetCreate)
91 {
92 JSAPITreeSet *set = CreateTreeSet();
93 EXPECT_TRUE(set != nullptr);
94 }
95
HWTEST_F_L0(JSAPITreeSetTest,TreeSetAddAndHas)96 HWTEST_F_L0(JSAPITreeSetTest, TreeSetAddAndHas)
97 {
98 constexpr uint32_t NODE_NUMBERS = 8;
99 ObjectFactory *factory = thread->GetEcmaVM()->GetFactory();
100 JSMutableHandle<JSTaggedValue> key(thread, JSTaggedValue::Undefined());
101
102 // test JSAPITreeSet
103 JSHandle<JSAPITreeSet> tset(thread, CreateTreeSet());
104 std::string myKey("mykey");
105 for (uint32_t i = 0; i < NODE_NUMBERS; i++) {
106 std::string ikey = myKey + std::to_string(i);
107 key.Update(factory->NewFromStdString(ikey).GetTaggedValue());
108 JSAPITreeSet::Add(thread, tset, key);
109 }
110 EXPECT_EQ(tset->GetSize(), NODE_NUMBERS);
111
112 for (uint32_t i = 0; i < NODE_NUMBERS; i++) {
113 std::string ikey = myKey + std::to_string(i);
114 key.Update(factory->NewFromStdString(ikey).GetTaggedValue());
115
116 // test has
117 bool has = JSAPITreeSet::Has(thread, tset, key);
118 EXPECT_EQ(has, true);
119 }
120 }
121
HWTEST_F_L0(JSAPITreeSetTest,TreeSetDeleteAndHas)122 HWTEST_F_L0(JSAPITreeSetTest, TreeSetDeleteAndHas)
123 {
124 constexpr uint32_t NODE_NUMBERS = 64;
125 constexpr uint32_t REMOVE_SIZE = 48;
126 ObjectFactory *factory = thread->GetEcmaVM()->GetFactory();
127 JSMutableHandle<JSTaggedValue> key(thread, JSTaggedValue::Undefined());
128
129 // test JSAPITreeSet
130 JSHandle<JSAPITreeSet> tset(thread, CreateTreeSet());
131 std::string myKey("mykey");
132 for (uint32_t i = 0; i < NODE_NUMBERS; i++) {
133 std::string ikey = myKey + std::to_string(i);
134 key.Update(factory->NewFromStdString(ikey).GetTaggedValue());
135 JSAPITreeSet::Add(thread, tset, key);
136 }
137 EXPECT_EQ(tset->GetSize(), NODE_NUMBERS);
138
139 for (uint32_t i = 0; i < REMOVE_SIZE; i++) {
140 std::string ikey = myKey + std::to_string(i);
141 key.Update(factory->NewFromStdString(ikey).GetTaggedValue());
142 bool success = JSAPITreeSet::Delete(thread, tset, key);
143 EXPECT_EQ(success, true);
144 }
145 EXPECT_EQ(tset->GetSize(), NODE_NUMBERS - REMOVE_SIZE);
146
147 for (uint32_t i = 0; i < REMOVE_SIZE; i++) {
148 std::string ikey = myKey + std::to_string(i);
149 key.Update(factory->NewFromStdString(ikey).GetTaggedValue());
150
151 // test has
152 bool has= JSAPITreeSet::Has(thread, tset, key);
153 EXPECT_EQ(has, false);
154 }
155
156 for (uint32_t i = REMOVE_SIZE; i < NODE_NUMBERS; i++) {
157 std::string ikey = myKey + std::to_string(i);
158 key.Update(factory->NewFromStdString(ikey).GetTaggedValue());
159
160 // test has
161 bool has= JSAPITreeSet::Has(thread, tset, key);
162 EXPECT_EQ(has, true);
163 }
164 }
165
HWTEST_F_L0(JSAPITreeSetTest,TreeSetClear)166 HWTEST_F_L0(JSAPITreeSetTest, TreeSetClear)
167 {
168 constexpr uint32_t NODE_NUMBERS = 8;
169 ObjectFactory *factory = thread->GetEcmaVM()->GetFactory();
170 JSMutableHandle<JSTaggedValue> key(thread, JSTaggedValue::Undefined());
171
172 // test TaggedTreeSet
173 JSHandle<JSAPITreeSet> tset(thread, CreateTreeSet());
174 std::string myKey("mykey");
175 for (uint32_t i = 0; i < NODE_NUMBERS; i++) {
176 std::string ikey = myKey + std::to_string(i);
177 key.Update(factory->NewFromStdString(ikey).GetTaggedValue());
178 JSAPITreeSet::Add(thread, tset, key);
179 }
180 EXPECT_EQ(tset->GetSize(), NODE_NUMBERS);
181
182 JSAPITreeSet::Clear(thread, tset);
183 EXPECT_EQ(tset->GetSize(), 0);
184 for (uint32_t i = 0; i < NODE_NUMBERS; i++) {
185 std::string ikey = myKey + std::to_string(i);
186 key.Update(factory->NewFromStdString(ikey).GetTaggedValue());
187
188 // test has
189 bool has= JSAPITreeSet::Has(thread, tset, key);
190 EXPECT_EQ(has, false);
191 }
192 }
193
HWTEST_F_L0(JSAPITreeSetTest,TreeSetPop)194 HWTEST_F_L0(JSAPITreeSetTest, TreeSetPop)
195 {
196 constexpr uint32_t NODE_NUMBERS = 8;
197 ObjectFactory *factory = thread->GetEcmaVM()->GetFactory();
198 JSMutableHandle<JSTaggedValue> key(thread, JSTaggedValue::Undefined());
199
200 // test TaggedTreeSet
201 JSHandle<JSAPITreeSet> tset(thread, CreateTreeSet());
202 std::string myKey("mykey");
203 for (uint32_t i = 0; i < NODE_NUMBERS; i++) {
204 std::string ikey = myKey + std::to_string(i);
205 key.Update(factory->NewFromStdString(ikey).GetTaggedValue());
206 JSAPITreeSet::Add(thread, tset, key);
207 }
208 EXPECT_EQ(tset->GetSize(), NODE_NUMBERS);
209
210 // test popFirst
211 std::string fkey = myKey + std::to_string(0);
212 key.Update(factory->NewFromStdString(fkey).GetTaggedValue());
213 JSTaggedValue fvalue = JSAPITreeSet::PopFirst(thread, tset);
214 EXPECT_EQ(tset->GetSize(), NODE_NUMBERS - 1);
215 EXPECT_EQ(fvalue, key.GetTaggedValue());
216 bool has= JSAPITreeSet::Has(thread, tset, key);
217 EXPECT_EQ(has, false);
218
219 // test popLast
220 std::string lkey = myKey + std::to_string(NODE_NUMBERS - 1);
221 key.Update(factory->NewFromStdString(lkey).GetTaggedValue());
222 JSTaggedValue lvalue = JSAPITreeSet::PopLast(thread, tset);
223 EXPECT_EQ(tset->GetSize(), NODE_NUMBERS - 2);
224 EXPECT_EQ(lvalue, key.GetTaggedValue());
225 has= JSAPITreeSet::Has(thread, tset, key);
226 EXPECT_EQ(has, false);
227 }
228
HWTEST_F_L0(JSAPITreeSetTest,JSAPITreeSetIterator)229 HWTEST_F_L0(JSAPITreeSetTest, JSAPITreeSetIterator)
230 {
231 constexpr uint32_t NODE_NUMBERS = 8;
232 ObjectFactory *factory = thread->GetEcmaVM()->GetFactory();
233 JSHandle<JSAPITreeSet> tset(thread, CreateTreeSet());
234
235 JSMutableHandle<JSTaggedValue> key(thread, JSTaggedValue::Undefined());
236 for (int i = 0; i < NODE_NUMBERS; i++) {
237 key.Update(JSTaggedValue(i));
238 JSAPITreeSet::Add(thread, tset, key);
239 }
240
241 // test key or value
242 JSHandle<JSTaggedValue> keyIter(factory->NewJSAPITreeSetIterator(tset, IterationKind::KEY));
243 JSHandle<JSTaggedValue> valueIter(factory->NewJSAPITreeSetIterator(tset, IterationKind::VALUE));
244 JSMutableHandle<JSTaggedValue> keyIterResult(thread, JSTaggedValue::Undefined());
245 JSMutableHandle<JSTaggedValue> valueIterResult(thread, JSTaggedValue::Undefined());
246 for (int i = 0; i < NODE_NUMBERS / 2; i++) {
247 keyIterResult.Update(JSIterator::IteratorStep(thread, keyIter).GetTaggedValue());
248 valueIterResult.Update(JSIterator::IteratorStep(thread, valueIter).GetTaggedValue());
249 EXPECT_EQ(i, JSIterator::IteratorValue(thread, keyIterResult)->GetInt());
250 EXPECT_EQ(i, JSIterator::IteratorValue(thread, valueIterResult)->GetInt());
251 }
252
253 // test key and value
254 JSHandle<JSTaggedValue> indexKey(thread, JSTaggedValue(0));
255 JSHandle<JSTaggedValue> elementKey(thread, JSTaggedValue(1));
256 JSHandle<JSTaggedValue> iter(factory->NewJSAPITreeSetIterator(tset, IterationKind::KEY_AND_VALUE));
257 JSMutableHandle<JSTaggedValue> iterResult(thread, JSTaggedValue::Undefined());
258 JSMutableHandle<JSTaggedValue> result(thread, JSTaggedValue::Undefined());
259 for (int i = 0; i < NODE_NUMBERS; i++) {
260 iterResult.Update(JSIterator::IteratorStep(thread, iter).GetTaggedValue());
261 result.Update(JSIterator::IteratorValue(thread, iterResult).GetTaggedValue());
262 EXPECT_EQ(i, JSObject::GetProperty(thread, result, indexKey).GetValue()->GetInt());
263 EXPECT_EQ(i, JSObject::GetProperty(thread, result, elementKey).GetValue()->GetInt());
264 }
265
266 // test delete
267 key.Update(JSTaggedValue(NODE_NUMBERS / 2));
268 bool success = JSAPITreeSet::Delete(thread, tset, key);
269 EXPECT_EQ(success, true);
270 for (int i = NODE_NUMBERS / 2 + 1; i < NODE_NUMBERS; i++) {
271 keyIterResult.Update(JSIterator::IteratorStep(thread, keyIter).GetTaggedValue());
272 valueIterResult.Update(JSIterator::IteratorStep(thread, valueIter).GetTaggedValue());
273 EXPECT_EQ(i, JSIterator::IteratorValue(thread, keyIterResult)->GetInt());
274 EXPECT_EQ(i, JSIterator::IteratorValue(thread, valueIterResult)->GetInt());
275 }
276
277 // test set
278 key.Update(JSTaggedValue(NODE_NUMBERS));
279 JSAPITreeSet::Add(thread, tset, key);
280 keyIterResult.Update(JSIterator::IteratorStep(thread, keyIter).GetTaggedValue());
281 EXPECT_EQ(NODE_NUMBERS, JSIterator::IteratorValue(thread, keyIterResult)->GetInt());
282
283 // test end
284 keyIterResult.Update(JSIterator::IteratorStep(thread, keyIter).GetTaggedValue());
285 EXPECT_EQ(JSTaggedValue::False(), keyIterResult.GetTaggedValue());
286 }
287 } // namespace panda::test
288