/arkcompiler/ets_runtime/ecmascript/compiler/ |
D | binary_section.h | 72 if (str.compare(".rodata") == 0) { in ElfSection() 74 } else if (str.compare(".rodata.cst4") == 0) { in ElfSection() 76 } else if (str.compare(".rodata.cst8") == 0) { in ElfSection() 78 } else if (str.compare(".rodata.cst16") == 0) { in ElfSection() 80 } else if (str.compare(".rodata.cst32") == 0) { in ElfSection() 82 } else if (str.compare(".text") == 0) { in ElfSection() 84 } else if (str.compare(".data") == 0) { in ElfSection() 86 } else if (str.compare(".got") == 0) { in ElfSection() 88 } else if (str.compare(".rela.text") == 0) { in ElfSection() 90 } else if (str.compare(".strtab") == 0) { in ElfSection() [all …]
|
/arkcompiler/ets_runtime/ecmascript/mem/ |
D | chunk_containers.h | 71 template<typename K, typename Compare = std::less<K>> 72 class PUBLIC_API ChunkSet : public std::set<K, Compare, ChunkAllocator<K>> { 76 : std::set<K, Compare, ChunkAllocator<K>>(Compare(), ChunkAllocator<K>(chunk)) in ChunkSet() 82 template<typename K, typename V, typename Compare = std::less<K>> 83 class PUBLIC_API ChunkMap : public std::map<K, V, Compare, ChunkAllocator<std::pair<const K, V>>> { 87 : std::map<K, V, Compare, ChunkAllocator<std::pair<const K, V>>>(Compare(), in ChunkMap() 109 template<typename K, typename V, typename Compare = std::less<K>> 110 class PUBLIC_API ChunkMultimap : public std::multimap<K, V, Compare, ChunkAllocator<std::pair<const… 114 : std::multimap<K, V, Compare, ChunkAllocator<std::pair<const K, V>>>( in ChunkMultimap() 115 Compare(), ChunkAllocator<std::pair<const K, V>>(chunk)) in ChunkMultimap()
|
D | c_containers.h | 40 template<class Key, class T, class Compare = std::less<>> 41 using CMap = std::map<Key, T, Compare, CAddressAllocator<std::pair<const Key, T>>>; 43 template<class Key, class T, class Compare = std::less<>> 44 using CMultiMap = std::multimap<Key, T, Compare, CAddressAllocator<std::pair<const Key, T>>>;
|
/arkcompiler/runtime_core/compiler/tests/ |
D | graph_comparator_test.cpp | 92 ASSERT_TRUE(GraphComparator().Compare(graph1, graph2)); in TEST_F() 146 ASSERT_TRUE(GraphComparator().Compare(graph1, graph2)); in TEST_F() 157 ASSERT_TRUE(GraphComparator().Compare(graph1, graph2)); in TEST_F() 158 ASSERT_TRUE(GraphComparator().Compare(graph1, graph3)); in TEST_F() 159 ASSERT_TRUE(GraphComparator().Compare(graph1, graph4)); in TEST_F() 160 ASSERT_TRUE(GraphComparator().Compare(graph1, graph5)); in TEST_F() 161 ASSERT_TRUE(GraphComparator().Compare(graph1, graph6)); in TEST_F() 162 ASSERT_TRUE(GraphComparator().Compare(graph2, graph3)); in TEST_F() 163 ASSERT_TRUE(GraphComparator().Compare(graph2, graph4)); in TEST_F() 164 ASSERT_TRUE(GraphComparator().Compare(graph2, graph5)); in TEST_F() [all …]
|
D | cleanup_test.cpp | 45 ASSERT_TRUE(GraphComparator().Compare(GetGraph(), graph)); in TEST_F() 102 ASSERT_TRUE(GraphComparator().Compare(GetGraph(), graph)); in TEST_F() 150 ASSERT_TRUE(GraphComparator().Compare(GetGraph(), graph)); in TEST_F() 188 ASSERT_TRUE(GraphComparator().Compare(GetGraph(), graph)); in TEST_F() 201 INST(5, Opcode::Compare).b().CC(CC_LT).SrcType(DataType::Type::INT64).Inputs(1, 3); in TEST_F() 221 INST(5, Opcode::Compare).b().CC(CC_LT).SrcType(DataType::Type::INT64).Inputs(1, 3); in TEST_F() 225 ASSERT_TRUE(GraphComparator().Compare(GetGraph(), graph)); in TEST_F() 236 INST(2, Opcode::Compare).b().CC(CC_LE).SrcType(DataType::Type::INT64).Inputs(1, 0); in TEST_F() 265 INST(2, Opcode::Compare).b().CC(CC_LE).SrcType(DataType::Type::INT64).Inputs(1, 0); in TEST_F() 283 ASSERT_TRUE(GraphComparator().Compare(GetGraph(), graph)); in TEST_F() [all …]
|
D | ir_builder_test.cpp | 79 ASSERT_TRUE(GraphComparator().Compare(GetGraph(), graph)); in CheckSimple() 120 ASSERT_TRUE(GraphComparator().Compare(GetGraph(), graph)); in CheckSimpleWithImm() 156 ASSERT_TRUE(GraphComparator().Compare(GetGraph(), graph)); in CheckCmp() 188 ASSERT_TRUE(GraphComparator().Compare(GetGraph(), graph)); in CheckFloatCmp() 246 INST(2, Opcode::Compare).b().CC(CC).Inputs(0, 1); in CheckCondJump() 255 ASSERT_TRUE(GraphComparator().Compare(GetGraph(), graph)); in CheckCondJump() 312 INST(1, Opcode::Compare).b().CC(CC).Inputs(0, 2); in CheckCondJumpWithZero() 321 ASSERT_TRUE(GraphComparator().Compare(GetGraph(), graph)); in CheckCondJumpWithZero() 363 ASSERT_TRUE(GraphComparator().Compare(GetGraph(), graph)); in TEST_F() 400 ASSERT_TRUE(GraphComparator().Compare(GetGraph(), graph)); in TEST_F() [all …]
|
D | graph_cloner_test.cpp | 44 INST(14, Opcode::Compare).CC(ConditionCode::CC_LT).b().Inputs(0, 13); // i < X in TEST_F() 54 INST(5, Opcode::Compare).CC(ConditionCode::CC_LT).b().Inputs(10, 13); // i < X in TEST_F() 79 INST(14, Opcode::Compare).CC(ConditionCode::CC_LT).b().Inputs(0, 13); // i < X in TEST_F() 89 INST(5, Opcode::Compare).CC(ConditionCode::CC_LT).b().Inputs(10, 13); // i < X in TEST_F() 98 INST(17, Opcode::Compare).CC(ConditionCode::CC_LT).b().Inputs(16, 13); // i < X in TEST_F() 108 INST(20, Opcode::Compare).CC(ConditionCode::CC_LT).b().Inputs(25, 13); // i < X in TEST_F() 120 ASSERT_TRUE(GraphComparator().Compare(GetGraph(), graph1)); in TEST_F() 138 INST(14, Opcode::Compare).CC(ConditionCode::CC_LT).b().Inputs(0, 13); // i < X in TEST_F() 150 INST(5, Opcode::Compare).CC(ConditionCode::CC_LT).b().Inputs(10, 13); // i < X in TEST_F() 178 INST(14, Opcode::Compare).CC(ConditionCode::CC_LT).b().Inputs(0, 13); // i < X in TEST_F() [all …]
|
D | split_resolver_test.cpp | 107 ASSERT_TRUE(GraphComparator().Compare(initial_graph, expected_graph)); in TEST_F() 139 ASSERT_TRUE(GraphComparator().Compare(initial_graph, expected_graph)); in TEST_F() 153 INST(1, Opcode::Compare).b().SrcType(DataType::Type::UINT64).Inputs(0, 0); in TEST_F() 188 INST(1, Opcode::Compare).b().SrcType(DataType::Type::UINT64).Inputs(0, 0); in TEST_F() 221 ASSERT_TRUE(GraphComparator().Compare(initial_graph, expected_graph)); in TEST_F() 236 INST(1, Opcode::Compare).b().SrcType(DataType::Type::UINT64).Inputs(0, 0); in TEST_F() 269 INST(1, Opcode::Compare).b().SrcType(DataType::Type::UINT64).Inputs(0, 0); in TEST_F() 291 ASSERT_TRUE(GraphComparator().Compare(initial_graph, expected_graph)); in TEST_F() 316 INST(1, Opcode::Compare).b().SrcType(DataType::Type::UINT64).Inputs(0, 0); in TEST_F() 355 INST(1, Opcode::Compare).b().SrcType(DataType::Type::UINT64).Inputs(0, 0); in TEST_F() [all …]
|
D | loop_analyzer_test.cpp | 130 INST(5, Opcode::Compare).b().SrcType(DataType::Type::INT64).Inputs(0, 1); in TEST_F() 137 INST(9, Opcode::Compare).b().SrcType(DataType::Type::INT64).Inputs(0, 1); in TEST_F() 142 INST(11, Opcode::Compare).b().SrcType(DataType::Type::INT64).Inputs(0, 1); in TEST_F() 147 INST(13, Opcode::Compare).b().SrcType(DataType::Type::INT64).Inputs(0, 1); in TEST_F() 154 INST(17, Opcode::Compare).b().SrcType(DataType::Type::INT64).Inputs(0, 1); in TEST_F() 266 INST(19, Opcode::Compare).b().Inputs(0, 1); in TEST_F() 285 INST(10, Opcode::Compare).b().Inputs(9, 2); in TEST_F() 345 INST(3, Opcode::Compare).b().SrcType(DataType::Type::INT64).Inputs(0, 1); in TEST_F() 351 INST(6, Opcode::Compare).b().SrcType(DataType::Type::INT64).Inputs(0, 1); in TEST_F() 392 INST(4, Opcode::Compare).b().CC(CC_NE).Inputs(3, 1); in TEST_F() [all …]
|
D | graph_comparator.h | 26 bool Compare(Graph *graph1, Graph *graph2) in Compare() function 42 … graph2->GetBlocksRPO().end(), [this](auto bb1, auto bb2) { return Compare(bb1, bb2); }); in Compare() 45 bool Compare(BasicBlock *block1, BasicBlock *block2) in Compare() function 61 bool t = Compare(inst1, inst2); in Compare() 73 bool Compare(Inst *inst1, Inst *inst2) in Compare() function 92 …auto eq_lambda = [this](Input input1, Input input2) { return Compare(input1.GetInst(), input2.GetI… in Compare() 111 if (!Compare(input1, input2)) { in Compare() 129 CHECK(Compare, GetCc) in Compare() 130 CHECK(Compare, GetOperandsType) in Compare()
|
D | vn_test.cpp | 90 ASSERT_TRUE(GraphComparator().Compare(GetGraph(), graph_et)); in TEST_F() 111 INST(10, Opcode::Compare).b().CC(CC_EQ).Inputs(0, 1); in TEST_F() 126 INST(18, Opcode::Compare).b().CC(CC_EQ).Inputs(0, 1); in TEST_F() 156 INST(10, Opcode::Compare).b().CC(CC_EQ).Inputs(0, 1); in TEST_F() 171 INST(18, Opcode::Compare).b().CC(CC_EQ).Inputs(0, 1); in TEST_F() 188 ASSERT_TRUE(GraphComparator().Compare(GetGraph(), graph_et)); in TEST_F() 251 ASSERT_TRUE(GraphComparator().Compare(GetGraph(), graph_et)); in TEST_F() 276 INST(10, Opcode::Compare).b().CC(CC_LT).Inputs(0, 1); in TEST_F() 291 INST(18, Opcode::Compare).b().CC(CC_EQ).Inputs(0, 1); in TEST_F() 322 INST(10, Opcode::Compare).b().CC(CC_LT).Inputs(0, 1); in TEST_F() [all …]
|
D | basicblock_test.cpp | 94 INST(18, Opcode::Compare).b().SrcType(DataType::Type::INT64).Inputs(0, 1); in TEST_F() 102 INST(17, Opcode::Compare).b().SrcType(DataType::Type::INT64).Inputs(0, 1); in TEST_F() 176 INST(2, Opcode::Compare).b().Inputs(0, 1); in TEST_F() 240 INST(2, Opcode::Compare).b().SrcType(DataType::Type::INT64).CC(CC_EQ).Inputs(0, 1); in TEST_F() 245 INST(4, Opcode::Compare).b().SrcType(DataType::Type::INT64).CC(CC_NE).Inputs(0, 1); in TEST_F() 293 INST(2, Opcode::Compare).b().SrcType(DataType::Type::INT64).CC(CC_EQ).Inputs(0, 1); in TEST_F() 298 INST(4, Opcode::Compare).b().SrcType(DataType::Type::INT64).CC(CC_NE).Inputs(0, 1); in TEST_F() 303 INST(6, Opcode::Compare).b().SrcType(DataType::Type::INT64).CC(CC_EQ).Inputs(0, 1); in TEST_F() 328 INST(4, Opcode::Compare).b().CC(CC_EQ).Inputs(2, 3); in TEST_F() 370 INST(14, Opcode::Compare).CC(ConditionCode::CC_LT).b().Inputs(0, 13); // i < X in TEST_F() [all …]
|
/arkcompiler/runtime_core/docs/ |
D | PBC2IR.md | 34 | jeq.obj | bool Compare EQ, IfImm | 35 | jne.obj | bool Compare NE, IfImm | 36 | jeqz.obj | i64 Constant 0, bool Compare EQ, IfImm | 37 | jnez.obj | i64 Constant 0, bool Compare NE, IfImm | 38 | jeqz | i64 Constant 0, bool Compare EQ, IfImm | 39 | jnez | i64 Constant 0, bool Compare NE, IfImm | 40 | jltz | i64 Constant 0, bool Compare LT, IfImm | 41 | jgtz | i64 Constant 0, bool Compare GT, IfImm | 42 | jlez | i64 Constant 0, bool Compare LE, IfImm | 43 | jgez | i64 Constant 0, bool Compare GE, IfImm | [all …]
|
/arkcompiler/ets_runtime/ecmascript/ic/ |
D | ic_compare_op.cpp | 222 ComparisonResult CompareOp::Compare(JSThread *thread, JSTaggedValue left, in Compare() function in panda::ecmascript::CompareOp 225 INTERPRETER_TRACE(thread, Compare); in Compare() 260 ret = Compare(thread, leftHandle.GetTaggedValue(), in Compare() 263 ret = Compare(thread, leftHandle.GetTaggedValue(), in Compare() 266 ret = Compare(thread, leftHandle.GetTaggedValue(), in Compare() 274 int result = EcmaStringAccessor::Compare(thread->GetEcmaVM(), xHandle, yHandle); in Compare() 310 ret = Compare(thread, leftHandle.GetTaggedValue(), in Compare() 313 ret = Compare(thread, leftHandle.GetTaggedValue(), in Compare() 316 ret = Compare(thread, leftHandle.GetTaggedValue(), in Compare() 359 ret = Compare(thread, rightPrimitive.GetTaggedValue(), in Compare() [all …]
|
/arkcompiler/ets_runtime/ecmascript/base/tests/ |
D | number_helper_test.cpp | 89 EXPECT_EQ(EcmaStringAccessor::Compare(instance, handleEcmaStr1, resultStr), 0); in HWTEST_F_L0() 94 EXPECT_EQ(EcmaStringAccessor::Compare(instance, handleEcmaStr2, resultStr), 0); in HWTEST_F_L0() 99 EXPECT_EQ(EcmaStringAccessor::Compare(instance, handleEcmaStr3, resultStr), 0); in HWTEST_F_L0() 104 EXPECT_EQ(EcmaStringAccessor::Compare(instance, handleEcmaStr4, resultStr), 0); in HWTEST_F_L0() 110 EXPECT_EQ(EcmaStringAccessor::Compare(instance, handleEcmaStr5, resultStr), 0); in HWTEST_F_L0() 115 EXPECT_EQ(EcmaStringAccessor::Compare(instance, handleEcmaStr6, resultStr), 0); in HWTEST_F_L0() 120 EXPECT_EQ(EcmaStringAccessor::Compare(instance, handleEcmaStr7, resultStr), 0); in HWTEST_F_L0() 125 EXPECT_EQ(EcmaStringAccessor::Compare(instance, handleEcmaStr8, resultStr), 0); in HWTEST_F_L0() 136 EXPECT_EQ(EcmaStringAccessor::Compare(instance, handleEcmaStr1, resultStr), 0); in HWTEST_F_L0() 140 EXPECT_EQ(EcmaStringAccessor::Compare(instance, handleEcmaStr2, resultStr), 0); in HWTEST_F_L0() [all …]
|
/arkcompiler/runtime_core/compiler/optimizer/ir/ |
D | graph_cloner.cpp | 211 …* Split back-edge for cloning without side exits - in order not to clone `Compare` and `IfImm` ins… 217 auto compare = ifimm->GetInput(0).GetInst(); in SplitBackEdge() local 218 ASSERT(compare->GetOpcode() == Opcode::Compare); in SplitBackEdge() 219 …// If there are intructions between `Compare` and `IfImm`, clone `Compare` and insert before `IfIm… in SplitBackEdge() 220 if (ifimm->GetPrev() != compare) { in SplitBackEdge() 221 auto new_cmp = compare->Clone(compare->GetBasicBlock()->GetGraph()); in SplitBackEdge() 222 new_cmp->SetInput(0, compare->GetInput(0).GetInst()); in SplitBackEdge() 223 new_cmp->SetInput(1, compare->GetInput(1).GetInst()); in SplitBackEdge() 226 compare = new_cmp; in SplitBackEdge() 228 if (compare->GetPrev() != nullptr) { in SplitBackEdge() [all …]
|
/arkcompiler/ets_runtime/test/typeinfer/automatedcases/ |
D | reverseInferenceInContextualInstantiation.ts | 21 function compare<T>(a: T, b: T): number { 29 x.sort(compare); // Error, but shouldn't be 30 AssertType(x.sort(compare), "number[]"); 32 AssertType(compare, "<T>(T, T) => number");
|
/arkcompiler/ets_runtime/ecmascript/builtins/tests/ |
D | builtins_errors_test.cpp | 94 EXPECT_EQ(EcmaStringAccessor::Compare(instance, in HWTEST_F_L0() 98 ASSERT_EQ(EcmaStringAccessor::Compare(instance, in HWTEST_F_L0() 116 ASSERT_EQ(EcmaStringAccessor::Compare(instance, in HWTEST_F_L0() 120 ASSERT_EQ(EcmaStringAccessor::Compare(instance, in HWTEST_F_L0() 150 ASSERT_EQ(EcmaStringAccessor::Compare(instance, in HWTEST_F_L0() 154 ASSERT_EQ(EcmaStringAccessor::Compare(instance, in HWTEST_F_L0() 186 ASSERT_EQ(EcmaStringAccessor::Compare(instance, in HWTEST_F_L0() 190 ASSERT_EQ(EcmaStringAccessor::Compare(instance, in HWTEST_F_L0() 216 … EXPECT_EQ(EcmaStringAccessor::Compare(instance, factory->NewFromASCII("Error"), resultHandle), 0); in HWTEST_F_L0() 246 …EXPECT_EQ(EcmaStringAccessor::Compare(instance, factory->NewFromASCII("Error: This is Error!"), re… in HWTEST_F_L0() [all …]
|
D | builtins_regexp_test.cpp | 99 …ASSERT_EQ(EcmaStringAccessor::Compare(instance, JSHandle<EcmaString>(originalSource), pattern), 0); in HWTEST_F_L0() 100 ASSERT_EQ(EcmaStringAccessor::Compare(instance, JSHandle<EcmaString>(originalFlags), flags), 0); in HWTEST_F_L0() 134 …ASSERT_EQ(EcmaStringAccessor::Compare(instance, JSHandle<EcmaString>(originalSource), pattern), 0); in HWTEST_F_L0() 135 ASSERT_EQ(EcmaStringAccessor::Compare(instance, JSHandle<EcmaString>(originalFlags), flags), 0); in HWTEST_F_L0() 169 …ASSERT_EQ(EcmaStringAccessor::Compare(instance, JSHandle<EcmaString>(originalSource), pattern1), 0… in HWTEST_F_L0() 170 … ASSERT_EQ(EcmaStringAccessor::Compare(instance, JSHandle<EcmaString>(originalFlags), flags2), 0); in HWTEST_F_L0() 187 ASSERT_EQ(EcmaStringAccessor::Compare(instance, JSHandle<EcmaString>(sourceResult), expect), 0); in HWTEST_F_L0() 203 ASSERT_EQ(EcmaStringAccessor::Compare(instance, JSHandle<EcmaString>(sourceResult), expect), 0); in HWTEST_F_L0() 253 …ASSERT_EQ(EcmaStringAccessor::Compare(instance, JSHandle<EcmaString>(flagsResult), expectResult), … in HWTEST_F_L0() 274 ASSERT_EQ(EcmaStringAccessor::Compare(instance, in HWTEST_F_L0() [all …]
|
/arkcompiler/runtime_core/libpandabase/utils/ |
D | arena_containers.h | 46 template <class Key, class Compare = std::less<Key>, bool use_oom_handler = false> 47 using ArenaSet = std::set<Key, Compare, ArenaAllocatorAdapter<Key, use_oom_handler>>; 48 template <class Key, class T, class Compare = std::less<Key>, bool use_oom_handler = false> 49 using ArenaMap = std::map<Key, T, Compare, ArenaAllocatorAdapter<std::pair<const Key, T>, use_oom_h… 50 template <class Key, class T, class Compare = std::less<Key>, bool use_oom_handler = false> 51 using ArenaMultiMap = std::multimap<Key, T, Compare, ArenaAllocatorAdapter<std::pair<const Key, T>,…
|
/arkcompiler/ets_runtime/ecmascript/regexp/tests/ |
D | regexp_test.cpp | 656 ASSERT_TRUE(EcmaStringAccessor::Compare(instance, result.captures_[0].second, str) == 0); in HWTEST_F_L0() 678 ASSERT_TRUE(EcmaStringAccessor::Compare(instance, result.captures_[0].second, str) == 0); in HWTEST_F_L0() 679 ASSERT_TRUE(EcmaStringAccessor::Compare(instance, result.captures_[1].second, str) == 0); in HWTEST_F_L0() 680 ASSERT_TRUE(EcmaStringAccessor::Compare(instance, result.captures_[2].second, str) == 0); in HWTEST_F_L0() 681 ASSERT_TRUE(EcmaStringAccessor::Compare(instance, result.captures_[3].second, str) == 0); in HWTEST_F_L0() 710 ASSERT_TRUE(EcmaStringAccessor::Compare(instance, result.captures_[0].second, str1) == 0); in HWTEST_F_L0() 711 ASSERT_TRUE(EcmaStringAccessor::Compare(instance, result.captures_[1].second, str2) == 0); in HWTEST_F_L0() 733 ASSERT_TRUE(EcmaStringAccessor::Compare(instance, result.captures_[0].second, str) == 0); in HWTEST_F_L0() 755 ASSERT_TRUE(EcmaStringAccessor::Compare(instance, result.captures_[0].second, str) == 0); in HWTEST_F_L0() 781 ASSERT_TRUE(EcmaStringAccessor::Compare(instance, result.captures_[0].second, str1) == 0); in HWTEST_F_L0() [all …]
|
/arkcompiler/runtime_core/bytecode_optimizer/tests/ |
D | canonicalization_test.cpp | 32 INST(3, Opcode::Compare).b().Inputs(0, 2); in TEST_F() 48 INST(3, Opcode::Compare).b().Inputs(2, 0); in TEST_F() 53 EXPECT_TRUE(GraphComparator().Compare(graph, expected)); in TEST_F()
|
D | common.h | 273 bool Compare(Graph *graph1, Graph *graph2) in Compare() function 283 … graph2->GetBlocksRPO().end(), [this](auto bb1, auto bb2) { return Compare(bb1, bb2); }); in Compare() 286 bool Compare(BasicBlock *block1, BasicBlock *block2) in Compare() function 303 bool t = Compare(inst1, inst2); in Compare() 313 bool Compare(Inst *inst1, Inst *inst2) in Compare() function 339 … [this](Input input1, Input input2) { return Compare(input1.GetInst(), input2.GetInst()); })) { in Compare() 347 … [this, &input1](Input input2) { return Compare(input1.GetInst(), input2.GetInst()); }); in Compare() 368 CHECK(Compare, GetCc) in Compare() 369 CHECK(Compare, GetOperandsType) in Compare() 465 ASSERT_TRUE(GraphComparator().Compare(GetGraph(), graph)); in CheckSimple() [all …]
|
/arkcompiler/ets_frontend/es2panda/typescript/types/ |
D | unionType.cpp | 92 auto compare = constituentTypes.begin(); in RemoveDuplicatedTypes() local 94 while (compare != constituentTypes.end()) { in RemoveDuplicatedTypes() 95 auto it = compare + 1; in RemoveDuplicatedTypes() 100 (*compare)->Identical(relation, *it); in RemoveDuplicatedTypes() 109 compare++; in RemoveDuplicatedTypes()
|
/arkcompiler/ets_runtime/ecmascript/builtins/ |
D | builtins_collator.cpp | 84 // 11.3.3 get Intl.Collator.prototype.compare 85 JSTaggedValue BuiltinsCollator::Compare(EcmaRuntimeCallInfo *argv) in Compare() function in panda::ecmascript::builtins::BuiltinsCollator 88 BUILTINS_API_TRACE(thread, Collator, Compare); in Compare() 114 // 11.3.3.1 Collator Compare Functions 117 …// A Collator compare function is an anonymous built-in function that has a [[Collator]] internal … in AnonymousCollator() 118 …// When a Collator compare function F is called with arguments x and y, the following steps are ta… in AnonymousCollator()
|