1 /*
2 * Copyright (c) 2022 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/js_api_tree_set.h"
21 #include "ecmascript/js_api/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.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 EcmaVM *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->NewFromASCII("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);
79 JSTaggedValue result = containers::ContainersPrivate::Load(objCallInfo);
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 int 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 (int 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 // test Add exception
113 key.Update(JSTaggedValue::Hole());
114 JSAPITreeSet::Add(thread, tset, key);
115 EXPECT_EXCEPTION();
116
117 for (int i = 0; i < NODE_NUMBERS; i++) {
118 std::string ikey = myKey + std::to_string(i);
119 key.Update(factory->NewFromStdString(ikey).GetTaggedValue());
120
121 // test has
122 bool has = JSAPITreeSet::Has(thread, tset, key);
123 EXPECT_EQ(has, true);
124 }
125 }
126
HWTEST_F_L0(JSAPITreeSetTest,TreeSetDeleteAndHas)127 HWTEST_F_L0(JSAPITreeSetTest, TreeSetDeleteAndHas)
128 {
129 constexpr int NODE_NUMBERS = 64;
130 constexpr int REMOVE_SIZE = 48;
131 ObjectFactory *factory = thread->GetEcmaVM()->GetFactory();
132 JSMutableHandle<JSTaggedValue> key(thread, JSTaggedValue::Undefined());
133
134 // test JSAPITreeSet
135 JSHandle<JSAPITreeSet> tset(thread, CreateTreeSet());
136 std::string myKey("mykey");
137 for (int i = 0; i < NODE_NUMBERS; i++) {
138 std::string ikey = myKey + std::to_string(i);
139 key.Update(factory->NewFromStdString(ikey).GetTaggedValue());
140 JSAPITreeSet::Add(thread, tset, key);
141 }
142 EXPECT_EQ(tset->GetSize(), NODE_NUMBERS);
143
144 // test delete
145 {
146 std::string ikey = myKey + std::to_string(NODE_NUMBERS);
147 key.Update(factory->NewFromStdString(ikey).GetTaggedValue());
148 bool success = JSAPITreeSet::Delete(thread, tset, key);
149 EXPECT_EQ(success, false);
150 }
151
152 for (int i = 0; i < REMOVE_SIZE; i++) {
153 std::string ikey = myKey + std::to_string(i);
154 key.Update(factory->NewFromStdString(ikey).GetTaggedValue());
155 bool success = JSAPITreeSet::Delete(thread, tset, key);
156 EXPECT_EQ(success, true);
157 }
158 EXPECT_EQ(tset->GetSize(), NODE_NUMBERS - REMOVE_SIZE);
159
160 for (int i = 0; i < REMOVE_SIZE; i++) {
161 std::string ikey = myKey + std::to_string(i);
162 key.Update(factory->NewFromStdString(ikey).GetTaggedValue());
163
164 // test has
165 bool has = JSAPITreeSet::Has(thread, tset, key);
166 EXPECT_EQ(has, false);
167 }
168
169 for (int i = REMOVE_SIZE; i < NODE_NUMBERS; i++) {
170 std::string ikey = myKey + std::to_string(i);
171 key.Update(factory->NewFromStdString(ikey).GetTaggedValue());
172
173 // test has
174 bool has = JSAPITreeSet::Has(thread, tset, key);
175 EXPECT_EQ(has, true);
176 }
177 }
178
HWTEST_F_L0(JSAPITreeSetTest,TreeSetClear)179 HWTEST_F_L0(JSAPITreeSetTest, TreeSetClear)
180 {
181 constexpr int NODE_NUMBERS = 8;
182 ObjectFactory *factory = thread->GetEcmaVM()->GetFactory();
183 JSMutableHandle<JSTaggedValue> key(thread, JSTaggedValue::Undefined());
184
185 // test TaggedTreeSet
186 JSHandle<JSAPITreeSet> tset(thread, CreateTreeSet());
187 std::string myKey("mykey");
188 for (int i = 0; i < NODE_NUMBERS; i++) {
189 std::string ikey = myKey + std::to_string(i);
190 key.Update(factory->NewFromStdString(ikey).GetTaggedValue());
191 JSAPITreeSet::Add(thread, tset, key);
192 }
193 EXPECT_EQ(tset->GetSize(), NODE_NUMBERS);
194
195 JSAPITreeSet::Clear(thread, tset);
196 EXPECT_EQ(tset->GetSize(), 0);
197 for (int i = 0; i < NODE_NUMBERS; i++) {
198 std::string ikey = myKey + std::to_string(i);
199 key.Update(factory->NewFromStdString(ikey).GetTaggedValue());
200
201 // test has
202 bool has = JSAPITreeSet::Has(thread, tset, key);
203 EXPECT_EQ(has, false);
204 }
205 }
206
HWTEST_F_L0(JSAPITreeSetTest,TreeSetPop)207 HWTEST_F_L0(JSAPITreeSetTest, TreeSetPop)
208 {
209 constexpr int NODE_NUMBERS = 8;
210 ObjectFactory *factory = thread->GetEcmaVM()->GetFactory();
211 JSMutableHandle<JSTaggedValue> key(thread, JSTaggedValue::Undefined());
212
213 // test TaggedTreeSet
214 JSHandle<JSAPITreeSet> tset(thread, CreateTreeSet());
215
216 // test popFirst and popLast of empty treeset
217 JSTaggedValue fvalue1 = JSAPITreeSet::PopFirst(thread, tset);
218 EXPECT_EQ(fvalue1, JSTaggedValue::Undefined());
219 JSTaggedValue lvalue1 = JSAPITreeSet::PopFirst(thread, tset);
220 EXPECT_EQ(lvalue1, JSTaggedValue::Undefined());
221
222 std::string myKey("mykey");
223 for (int i = 0; i < NODE_NUMBERS; i++) {
224 std::string ikey = myKey + std::to_string(i);
225 key.Update(factory->NewFromStdString(ikey).GetTaggedValue());
226 JSAPITreeSet::Add(thread, tset, key);
227 }
228 EXPECT_EQ(tset->GetSize(), NODE_NUMBERS);
229
230 // test popFirst
231 std::string fkey = myKey + std::to_string(0);
232 key.Update(factory->NewFromStdString(fkey).GetTaggedValue());
233 JSTaggedValue fvalue = JSAPITreeSet::PopFirst(thread, tset);
234 EXPECT_EQ(tset->GetSize(), NODE_NUMBERS - 1);
235 EXPECT_EQ(fvalue, key.GetTaggedValue());
236 bool has = JSAPITreeSet::Has(thread, tset, key);
237 EXPECT_EQ(has, false);
238
239 // test popLast
240 std::string lkey = myKey + std::to_string(NODE_NUMBERS - 1);
241 key.Update(factory->NewFromStdString(lkey).GetTaggedValue());
242 JSTaggedValue lvalue = JSAPITreeSet::PopLast(thread, tset);
243 EXPECT_EQ(tset->GetSize(), NODE_NUMBERS - 2);
244 EXPECT_EQ(lvalue, key.GetTaggedValue());
245 has = JSAPITreeSet::Has(thread, tset, key);
246 EXPECT_EQ(has, false);
247 }
248
HWTEST_F_L0(JSAPITreeSetTest,JSAPITreeSetIterator)249 HWTEST_F_L0(JSAPITreeSetTest, JSAPITreeSetIterator)
250 {
251 constexpr int NODE_NUMBERS = 8;
252 ObjectFactory *factory = thread->GetEcmaVM()->GetFactory();
253 JSHandle<JSAPITreeSet> tset(thread, CreateTreeSet());
254
255 JSMutableHandle<JSTaggedValue> key(thread, JSTaggedValue::Undefined());
256 for (int i = 0; i < NODE_NUMBERS; i++) {
257 key.Update(JSTaggedValue(i));
258 JSAPITreeSet::Add(thread, tset, key);
259 }
260
261 // test key or value
262 JSHandle<JSTaggedValue> keyIter(factory->NewJSAPITreeSetIterator(tset, IterationKind::KEY));
263 JSHandle<JSTaggedValue> valueIter(factory->NewJSAPITreeSetIterator(tset, IterationKind::VALUE));
264 JSMutableHandle<JSTaggedValue> keyIterResult(thread, JSTaggedValue::Undefined());
265 JSMutableHandle<JSTaggedValue> valueIterResult(thread, JSTaggedValue::Undefined());
266 for (int i = 0; i < NODE_NUMBERS / 2; i++) {
267 keyIterResult.Update(JSIterator::IteratorStep(thread, keyIter).GetTaggedValue());
268 valueIterResult.Update(JSIterator::IteratorStep(thread, valueIter).GetTaggedValue());
269 EXPECT_EQ(i, JSIterator::IteratorValue(thread, keyIterResult)->GetInt());
270 EXPECT_EQ(i, JSIterator::IteratorValue(thread, valueIterResult)->GetInt());
271 }
272
273 // test key and value
274 JSHandle<JSTaggedValue> indexKey(thread, JSTaggedValue(0));
275 JSHandle<JSTaggedValue> elementKey(thread, JSTaggedValue(1));
276 JSHandle<JSTaggedValue> iter(factory->NewJSAPITreeSetIterator(tset, IterationKind::KEY_AND_VALUE));
277 JSMutableHandle<JSTaggedValue> iterResult(thread, JSTaggedValue::Undefined());
278 JSMutableHandle<JSTaggedValue> result(thread, JSTaggedValue::Undefined());
279 for (int i = 0; i < NODE_NUMBERS; i++) {
280 iterResult.Update(JSIterator::IteratorStep(thread, iter).GetTaggedValue());
281 result.Update(JSIterator::IteratorValue(thread, iterResult).GetTaggedValue());
282 EXPECT_EQ(i, JSObject::GetProperty(thread, result, indexKey).GetValue()->GetInt());
283 EXPECT_EQ(i, JSObject::GetProperty(thread, result, elementKey).GetValue()->GetInt());
284 }
285
286 // test delete
287 key.Update(JSTaggedValue(NODE_NUMBERS / 2));
288 bool success = JSAPITreeSet::Delete(thread, tset, key);
289 EXPECT_EQ(success, true);
290 for (int i = NODE_NUMBERS / 2 + 1; i < NODE_NUMBERS; i++) {
291 keyIterResult.Update(JSIterator::IteratorStep(thread, keyIter).GetTaggedValue());
292 valueIterResult.Update(JSIterator::IteratorStep(thread, valueIter).GetTaggedValue());
293 EXPECT_EQ(i, JSIterator::IteratorValue(thread, keyIterResult)->GetInt());
294 EXPECT_EQ(i, JSIterator::IteratorValue(thread, valueIterResult)->GetInt());
295 }
296
297 // test set
298 key.Update(JSTaggedValue(NODE_NUMBERS));
299 JSAPITreeSet::Add(thread, tset, key);
300 keyIterResult.Update(JSIterator::IteratorStep(thread, keyIter).GetTaggedValue());
301 EXPECT_EQ(NODE_NUMBERS, JSIterator::IteratorValue(thread, keyIterResult)->GetInt());
302
303 // test end
304 keyIterResult.Update(JSIterator::IteratorStep(thread, keyIter).GetTaggedValue());
305 EXPECT_EQ(JSTaggedValue::False(), keyIterResult.GetTaggedValue());
306 }
307
HWTEST_F_L0(JSAPITreeSetTest,TreeSetGetKey)308 HWTEST_F_L0(JSAPITreeSetTest, TreeSetGetKey)
309 {
310 constexpr int NODE_NUMBERS = 8;
311 JSMutableHandle<JSTaggedValue> key(thread, JSTaggedValue::Undefined());
312
313 // init treeset
314 JSHandle<JSAPITreeSet> tset(thread, CreateTreeSet());
315 for (int i = 0; i < NODE_NUMBERS; i++) {
316 key.Update(JSTaggedValue(i));
317 JSAPITreeSet::Add(thread, tset, key);
318 }
319 EXPECT_EQ(tset->GetSize(), NODE_NUMBERS);
320
321 // test GetKey
322 for (int i = 0; i < NODE_NUMBERS; i++) {
323 EXPECT_EQ(tset->GetKey(i), JSTaggedValue(i));
324 }
325 EXPECT_EQ(tset->GetKey(-1), JSTaggedValue::Undefined());
326 }
327 } // namespace panda::test
328