Home
last modified time | relevance | path

Searched refs:Has (Results 1 – 25 of 137) sorted by relevance

123456

/arkcompiler/runtime_core/static_core/compiler/optimizer/code_generator/target/amd64/
Dregfile.cpp41 if (calleeSaved_.Has(i)) { in GetCalleeSaved()
44 if (calleeSavedv_.Has(i)) { in GetCalleeSaved()
88 if (!scalarUsed && calleeSaved_.Has(i)) { in SetUsedRegs()
91 if (!scalarUsed && callerSaved_.Has(i)) { in SetUsedRegs()
96 if (!vectorUsed && calleeSavedv_.Has(i)) { in SetUsedRegs()
99 if (!vectorUsed && callerSavedv_.Has(i)) { in SetUsedRegs()
Dcallconv.cpp57 if (vregs.Has(ii)) { in PushRegs()
66 if (regs.Has(ii)) { in PushRegs()
81 if (regs.Has(i)) { in PopRegs()
88 if (vregs.Has(i)) { in PopRegs()
/arkcompiler/ets_runtime/ecmascript/
Djs_weak_container.cpp50 bool JSWeakMap::Has(JSThread *thread, JSTaggedValue key) const in Has() function in panda::ecmascript::JSWeakMap
52 return LinkedHashMap::Cast(GetLinkedMap().GetTaggedObject())->Has(thread, key); in Has()
101 bool JSWeakSet::Has(JSThread *thread, JSTaggedValue value) const in Has() function in panda::ecmascript::JSWeakSet
103 return LinkedHashSet::Cast(GetLinkedSet().GetTaggedObject())->Has(thread, value); in Has()
Djs_weak_container.h35 bool Has(JSThread *thread, JSTaggedValue key) const;
63 bool Has(JSThread *thread, JSTaggedValue value) const;
Djs_set.cpp54 bool JSSet::Has(const JSThread *thread, JSTaggedValue value) const in Has() function in panda::ecmascript::JSSet
56 return LinkedHashSet::Cast(GetLinkedSet().GetTaggedObject())->Has(thread, value); in Has()
Djs_map.cpp54 bool JSMap::Has(JSThread *thread, JSTaggedValue key) const in Has() function in panda::ecmascript::JSMap
56 return LinkedHashMap::Cast(GetLinkedMap().GetTaggedObject())->Has(thread, key); in Has()
/arkcompiler/runtime_core/static_core/runtime/interpreter/
Dcache.h26 bool Has(const void *pc, Method *caller) const in Has() function
35 if (UNLIKELY(!Has(pc, caller))) { in Get()
/arkcompiler/ets_runtime/ecmascript/builtins/
Dbuiltins_set.h40 V("has", Has, 1, SetHas) \
62 static JSTaggedValue Has(EcmaRuntimeCallInfo *argv);
Dbuiltins_map.h38 V("has", Has, 1, MapHas) \
64 static JSTaggedValue Has(EcmaRuntimeCallInfo *argv);
Dbuiltins_weak_map.cpp97 JSTaggedValue BuiltinsWeakMap::Has(EcmaRuntimeCallInfo *argv) in Has() function in panda::ecmascript::builtins::BuiltinsWeakMap
100 BUILTINS_API_TRACE(argv->GetThread(), WeakMap, Has); in Has()
115 return GetTaggedBoolean(jsWeakMap->Has(thread, key.GetTaggedValue())); in Has()
Dbuiltins_weak_set.cpp151 JSTaggedValue BuiltinsWeakSet::Has(EcmaRuntimeCallInfo *argv) in Has() function in panda::ecmascript::builtins::BuiltinsWeakSet
154 BUILTINS_API_TRACE(argv->GetThread(), WeakSet, Has); in Has()
169 return GetTaggedBoolean(jsWeakSet->Has(thread, value.GetTaggedValue())); in Has()
Dbuiltins_weak_set.h32 static JSTaggedValue Has(EcmaRuntimeCallInfo *argv);
Dbuiltins_weak_map.h32 static JSTaggedValue Has(EcmaRuntimeCallInfo *argv);
/arkcompiler/ets_runtime/ecmascript/builtins/tests/
Dbuiltins_weak_set_test.cpp137 JSTaggedValue result1 = BuiltinsWeakSet::Has(ecmaRuntimeCallInfo); in HWTEST_F_L0()
156 JSTaggedValue result3 = BuiltinsWeakSet::Has(ecmaRuntimeCallInfo1); in HWTEST_F_L0()
195 JSTaggedValue result2 = BuiltinsWeakSet::Has(ecmaRuntimeCallInfo1); in HWTEST_F_L0()
206 JSTaggedValue result4 = BuiltinsWeakSet::Has(ecmaRuntimeCallInfo1); in HWTEST_F_L0()
248 JSTaggedValue result2 = BuiltinsWeakSet::Has(ecmaRuntimeCallInfo1); in HWTEST_F_L0()
257 JSTaggedValue result4 = BuiltinsWeakSet::Has(ecmaRuntimeCallInfo1); in HWTEST_F_L0()
Dbuiltins_weak_map_test.cpp141 JSTaggedValue result1 = BuiltinsWeakMap::Has(ecmaRuntimeCallInfo); in HWTEST_F_L0()
161 JSTaggedValue result3 = BuiltinsWeakMap::Has(ecmaRuntimeCallInfo1); in HWTEST_F_L0()
201 JSTaggedValue result2 = BuiltinsWeakMap::Has(ecmaRuntimeCallInfo1); in HWTEST_F_L0()
212 JSTaggedValue result4 = BuiltinsWeakMap::Has(ecmaRuntimeCallInfo1); in HWTEST_F_L0()
264 JSTaggedValue result4 = BuiltinsWeakMap::Has(ecmaRuntimeCallInfo1); in HWTEST_F_L0()
/arkcompiler/ets_runtime/ecmascript/tests/
Djs_api_hashset_test.cpp116 JSTaggedValue bHas = hashSet->Has(thread, value.GetTaggedValue()); in HWTEST_F_L0()
126 JSTaggedValue exceptionHas = hashSet->Has(thread, JSTaggedValue::Hole()); in HWTEST_F_L0()
159 JSTaggedValue has = hashSet->Has(thread, value.GetTaggedValue()); in HWTEST_F_L0()
168 JSTaggedValue has = hashSet->Has(thread, value.GetTaggedValue()); in HWTEST_F_L0()
209 JSTaggedValue has = hashSet->Has(thread, value.GetTaggedValue()); in HWTEST_F_L0()
215 JSTaggedValue has = hashSet->Has(thread, value.GetTaggedValue()); in HWTEST_F_L0()
259 JSTaggedValue iterValueFlag = hashSet->Has(thread, tmpIterValue.GetTaggedValue()); in HWTEST_F_L0()
277 JSTaggedValue iterValueFlag = hashSet->Has(thread, tmpValue.GetTaggedValue()); in HWTEST_F_L0()
Djs_set_test.cpp91 EXPECT_TRUE(set->Has(thread, key.GetTaggedValue())); in HWTEST_F_L0()
106 EXPECT_TRUE(set->Has(thread, key.GetTaggedValue())); in HWTEST_F_L0()
113 EXPECT_FALSE(set->Has(thread, deleteKey.GetTaggedValue())); in HWTEST_F_L0()
Djs_api_tree_set_test.cpp122 bool has = JSAPITreeSet::Has(thread, tset, key); in HWTEST_F_L0()
165 bool has = JSAPITreeSet::Has(thread, tset, key); in HWTEST_F_L0()
174 bool has = JSAPITreeSet::Has(thread, tset, key); in HWTEST_F_L0()
202 bool has = JSAPITreeSet::Has(thread, tset, key); in HWTEST_F_L0()
236 bool has = JSAPITreeSet::Has(thread, tset, key); in HWTEST_F_L0()
245 has = JSAPITreeSet::Has(thread, tset, key); in HWTEST_F_L0()
Djs_map_test.cpp91 EXPECT_TRUE(map->Has(thread, key.GetTaggedValue())); in HWTEST_F_L0()
107 EXPECT_TRUE(map->Has(thread, key.GetTaggedValue())); in HWTEST_F_L0()
115 EXPECT_FALSE(map->Has(thread, deleteKey.GetTaggedValue())); in HWTEST_F_L0()
Djs_api_linked_list_test.cpp126 EXPECT_TRUE(toor->Has(value.GetTaggedValue())); in HWTEST_F_L0()
236 EXPECT_EQ(toor->Has(value.GetTaggedValue()), false); in HWTEST_F_L0()
241 EXPECT_EQ(toor->Has(value.GetTaggedValue()), false); in HWTEST_F_L0()
246 EXPECT_EQ(toor->Has(value.GetTaggedValue()), false); in HWTEST_F_L0()
251 EXPECT_EQ(toor->Has(value.GetTaggedValue()), false); in HWTEST_F_L0()
256 EXPECT_EQ(toor->Has(value.GetTaggedValue()), false); in HWTEST_F_L0()
261 EXPECT_EQ(toor->Has(value.GetTaggedValue()), false); in HWTEST_F_L0()
/arkcompiler/ets_runtime/ecmascript/compiler/builtins/
Dbuiltins_collection_stub_builder.cpp229 void BuiltinsCollectionStubBuilder<CollectionType>::Has(Variable *result, Label *exit, Label *slowP… in Has() function in panda::ecmascript::kungfu::BuiltinsCollectionStubBuilder
242 res = linkedHashTableStubBuilder.Has(linkedTable, key); in Has()
245 res = linkedHashTableStubBuilder.Has(linkedTable, key); in Has()
251 template void BuiltinsCollectionStubBuilder<JSMap>::Has(Variable *result, Label *exit, Label *slowP…
252 template void BuiltinsCollectionStubBuilder<JSSet>::Has(Variable *result, Label *exit, Label *slowP…
/arkcompiler/ets_runtime/ecmascript/containers/tests/
Dcontainers_hashset_test.cpp148 JSTaggedValue result = ContainersHashSet::Has(callInfo); in HWTEST_F_L0()
187 JSTaggedValue result = ContainersHashSet::Has(callInfo); in HWTEST_F_L0()
265 JSTaggedValue result = ContainersHashSet::Has(callInfo); in HWTEST_F_L0()
309 JSTaggedValue result = ContainersHashSet::Has(callInfo); in HWTEST_F_L0()
351 JSTaggedValue valueFlag = tSet->Has(thread, iterValue.GetTaggedValue()); in HWTEST_F_L0()
379 JSTaggedValue keyFlag = tSet->Has(thread, key.GetTaggedValue()); in HWTEST_F_L0()
407 JSTaggedValue valueFlag = tSet->Has(thread, iterValue.GetTaggedValue()); in HWTEST_F_L0()
443 CONTAINERS_API_TYPE_MISMATCH_EXCEPTION_TEST(ContainersHashSet, Has); in HWTEST_F_L0()
/arkcompiler/ets_runtime/ecmascript/containers/
Dcontainers_hashset.h27 static JSTaggedValue Has(EcmaRuntimeCallInfo *argv);
Dcontainers_deque.h31 static JSTaggedValue Has(EcmaRuntimeCallInfo *argv);
/arkcompiler/runtime_core/static_core/plugins/ets/templates/stdlib/
Dsearch.ets.j230 …* @param arr array to find a lower bound of a key. Has to be sorted, otherwise the answer is imple…
68 …* @param arr array to find a lower bound of a key. Has to be sorted, otherwise the answer is imple…
89 …* @param arr array to find a upper bound of a key. Has to be sorted, otherwise the answer is imple…
127 …* @param arr array to find a upper bound of a key. Has to be sorted, otherwise the answer is imple…
148 …* @param arr array to find a lower bound of a key. Has to be sorted, otherwise the answer is imple…
186 …* @param arr array to find a lower bound of a key. Has to be sorted, otherwise the answer is imple…
207 …* @param arr array to find a upper bound of a key. Has to be sorted, otherwise the answer is imple…
245 …* @param arr array to find a upper bound of a key. Has to be sorted, otherwise the answer is imple…

123456