Home
last modified time | relevance | path

Searched full:compare (Results 1 – 25 of 256) sorted by relevance

1234567891011

/arkcompiler/ets_runtime/ecmascript/compiler/
Dbinary_section.h65 if (str.compare(".rodata") == 0) { in ElfSection()
67 } else if (str.compare(".rodata.cst4") == 0) { in ElfSection()
69 } else if (str.compare(".rodata.cst8") == 0) { in ElfSection()
71 } else if (str.compare(".rodata.cst16") == 0) { in ElfSection()
73 } else if (str.compare(".rodata.cst32") == 0) { in ElfSection()
75 } else if (str.compare(".text") == 0) { in ElfSection()
77 } else if (str.compare(".data") == 0) { in ElfSection()
79 } else if (str.compare(".got") == 0) { in ElfSection()
81 } else if (str.compare(".rela.text") == 0) { in ElfSection()
83 } else if (str.compare(".strtab") == 0) { in ElfSection()
[all …]
/arkcompiler/ets_runtime/ecmascript/mem/
Dchunk_containers.h64 template<typename K, typename Compare = std::less<K>>
65 class PUBLIC_API ChunkSet : public std::set<K, Compare, ChunkAllocator<K>> {
69 : std::set<K, Compare, ChunkAllocator<K>>(Compare(), ChunkAllocator<K>(chunk)) in ChunkSet()
75 template<typename K, typename V, typename Compare = std::less<K>>
76 class PUBLIC_API ChunkMap : public std::map<K, V, Compare, ChunkAllocator<std::pair<const K, V>>> {
80 : std::map<K, V, Compare, ChunkAllocator<std::pair<const K, V>>>(Compare(), in ChunkMap()
101 template<typename K, typename V, typename Compare = std::less<K>>
102 class PUBLIC_API ChunkMultimap : public std::multimap<K, V, Compare, ChunkAllocator<std::pair<const…
106 : std::multimap<K, V, Compare, ChunkAllocator<std::pair<const K, V>>>( in ChunkMultimap()
107 Compare(), ChunkAllocator<std::pair<const K, V>>(chunk)) in ChunkMultimap()
Dc_containers.h40 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/
Dgraph_comparator_test.cpp92 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 …]
Dcode_sink_test.cpp35 INST(6, Opcode::Compare).b().CC(CC_NE).Inputs(0, 3); in TEST_F()
56 INST(6, Opcode::Compare).b().CC(CC_NE).Inputs(0, 3); in TEST_F()
72 ASSERT_TRUE(GraphComparator().Compare(GetGraph(), sunk_graph)); in TEST_F()
94 INST(8, Opcode::Compare).b().CC(CC_NE).Inputs(0, 3); in TEST_F()
117 INST(8, Opcode::Compare).b().CC(CC_NE).Inputs(0, 3); in TEST_F()
134 ASSERT_TRUE(GraphComparator().Compare(GetGraph(), sunk_graph)); in TEST_F()
153 INST(6, Opcode::Compare).b().CC(CC_NE).Inputs(0, 3); in TEST_F()
168 ASSERT_TRUE(GraphComparator().Compare(equal_graphs[0], equal_graphs[1])); in TEST_F()
188 INST(10, Opcode::Compare).b().CC(CC_NE).Inputs(2, 3); in TEST_F()
203 ASSERT_TRUE(GraphComparator().Compare(equal_graphs[0], equal_graphs[1])); in TEST_F()
[all …]
Dcleanup_test.cpp45 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 …]
Dadjust_arefs_test.cpp46 INST(15, Opcode::Compare).b().Inputs(10, 1); in TEST_F()
75 INST(16, Opcode::Compare).b().Inputs(10, 1); in TEST_F()
92 ASSERT_TRUE(GraphComparator().Compare(graph, graph_et)); in TEST_F()
117 INST(16, Opcode::Compare).b().Inputs(10, 1); in TEST_F()
151 INST(18, Opcode::Compare).b().Inputs(10, 1); in TEST_F()
168 ASSERT_TRUE(GraphComparator().Compare(graph, graph_et)); in TEST_F()
189 INST(15, Opcode::Compare).b().Inputs(10, 1); in TEST_F()
194 INST(41, Opcode::Compare).b().Inputs(10, 1); in TEST_F()
227 INST(15, Opcode::Compare).b().Inputs(10, 1); in TEST_F()
232 INST(41, Opcode::Compare).b().Inputs(10, 1); in TEST_F()
[all …]
Dir_builder_test.cpp79 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 …]
Dgraph_cloner_test.cpp44 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 …]
Ddeoptimize_elimination_test.cpp50 INST(4, Opcode::Compare).b().Inputs(0, 1).CC(CC_GT); in TEST_F()
72 INST(4, Opcode::Compare).b().Inputs(0, 1).CC(CC_GT); in TEST_F()
78 ASSERT_TRUE(GraphComparator().Compare(GetGraph(), graph)); in TEST_F()
117 ASSERT_TRUE(GraphComparator().Compare(GetGraph(), graph)); in TEST_F()
143 ASSERT_TRUE(GraphComparator().Compare(GetGraph(), clone)); in TEST_F()
194 ASSERT_TRUE(GraphComparator().Compare(GetGraph(), graph)); in TEST_F()
239 ASSERT_TRUE(GraphComparator().Compare(GetGraph(), graph)); in TEST_F()
264 INST(3, Opcode::Compare).b().CC(CC_LT).Inputs(10, 11); in TEST_F()
282 ASSERT_TRUE(GraphComparator().Compare(GetGraph(), clone)); in TEST_F()
313 INST(3, Opcode::Compare).b().CC(CC_LT).Inputs(10, 11); in TEST_F()
[all …]
Dloop_peeling_test.cpp100 INST(7, Opcode::Compare).CC(CC_EQ).b().Inputs(4, 0); in BuildGraphHeaderAndBackEdgeExit()
169 INST(7, Opcode::Compare).CC(CC_EQ).b().Inputs(0, 3); in TEST_F()
196 INST(15, Opcode::Compare).CC(CC_EQ).b().Inputs(0, 1); in TEST_F()
204 INST(7, Opcode::Compare).CC(CC_EQ).b().Inputs(0, 3); in TEST_F()
220 ASSERT_TRUE(GraphComparator().Compare(GetGraph(), expected_graph)); in TEST_F()
268 INST(7, Opcode::Compare).CC(CC_EQ).b().Inputs(5, 0); in TEST_F()
291 INST(13, Opcode::Compare).CC(CC_EQ).b().Inputs(12, 0); in TEST_F()
302 INST(7, Opcode::Compare).CC(CC_EQ).b().Inputs(5, 0); in TEST_F()
315 EXPECT_TRUE(GraphComparator().Compare(GetGraph(), expected_graph)); in TEST_F()
368 INST(6, Opcode::Compare).CC(CC_LT).b().Inputs(5, 2); // while i < 100 in TEST_F()
[all …]
Dif_conversion_test.cpp52 INST(3, Opcode::Compare).b().CC(CC_B).Inputs(0, 1); in TEST_F()
76 INST(3, Opcode::Compare).b().CC(CC_B).Inputs(0, 1); in TEST_F()
82 ASSERT_TRUE(GraphComparator().Compare(GetGraph(), graph)); in TEST_F()
122 ASSERT_TRUE(GraphComparator().Compare(GetGraph(), graph)); in TEST_F()
146 INST(3, Opcode::Compare).b().CC(CC_AE).Inputs(0, 1); in TEST_F()
170 INST(3, Opcode::Compare).b().CC(CC_AE).Inputs(0, 1); in TEST_F()
176 ASSERT_TRUE(GraphComparator().Compare(GetGraph(), graph)); in TEST_F()
216 ASSERT_TRUE(GraphComparator().Compare(GetGraph(), graph)); in TEST_F()
242 INST(3, Opcode::Compare).b().Inputs(0, 1); in TEST_F()
248 INST(6, Opcode::Compare).b().Inputs(5, 1); in TEST_F()
[all …]
Dloop_analyzer_test.cpp130 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()
380 … INST(5, Opcode::Compare).SrcType(DataType::INT32).CC(CC_LT).b().Inputs(0, 16); // 0 < len_array in TEST_F()
[all …]
Dloop_unroll_test.cpp94 INST(8, Opcode::Compare).CC(CC_LT).b().Inputs(7, 2); // while b < c in CheckSimpleLoop()
110 EXPECT_EQ(GetOpcodeCount(Opcode::Compare), expected_factor); in CheckSimpleLoop()
178 INST(9, Opcode::Compare).CC(CC_EQ).b().Inputs(8, 3); // if mod == 1 in CheckLoopWithPhiAndSafePoint()
194 INST(16, Opcode::Compare).CC(CC_EQ).b().Inputs(6, 2); // if a = 0 in CheckLoopWithPhiAndSafePoint()
214 EXPECT_EQ(GetOpcodeCount(Opcode::Compare), 2 * expected_factor); in CheckLoopWithPhiAndSafePoint()
445 INST(3, Opcode::Compare).b().Inputs(0, 1); in TEST_F()
458 INST(8, Opcode::Compare).b().Inputs(13, 0); in TEST_F()
463 INST(10, Opcode::Compare).b().Inputs(1, 2); in TEST_F()
472 auto cmp_count = GetOpcodeCount(Opcode::Compare); in TEST_F()
479 EXPECT_EQ(GetOpcodeCount(Opcode::Compare), cmp_count); in TEST_F()
[all …]
/arkcompiler/runtime_core/docs/
DPBC2IR.md34 | 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/runtime_core/compiler/optimizer/optimizations/
Dloop_unroll.cpp42 * TODO(a.popov) Create pre-header compare if it doesn't exist
55 if (pre_header_cmp->GetOpcode() != Opcode::Compare) { in HasPreHeaderCompare()
59 ASSERT(back_edge_cmp->GetOpcode() == Opcode::Compare); in HasPreHeaderCompare()
61 // Compare condition codes in HasPreHeaderCompare()
71 // Compare control-flow in HasPreHeaderCompare()
77 // Compare test inputs in HasPreHeaderCompare()
134 // Unroll loop without side-exits and fix compare in the pre-header and back-edge in TransformLoop()
187 * @return - `if_imm`'s compare input when `if_imm` its single user,
188 * otherwise create a new one Compare for this `if_imm` and return it
193 auto compare = if_imm->GetInput(0).GetInst(); in GetOrCreateIfImmUniqueCompare() local
[all …]
/arkcompiler/runtime_core/runtime/include/mem/
Dpanda_containers.h88 template <class T, class Container = PandaVector<T>, class Compare = std::less<typename Container::…
89 using PandaPriorityQueue = std::priority_queue<T, Container, Compare>;
91 template <class T, class Container = PandaVectorTL<T>, class Compare = std::less<typename Container…
92 using PandaPriorityQueueTL = std::priority_queue<T, Container, Compare>;
94 template <class Key, class T, class Compare = std::less<>>
95 using PandaMap = std::map<Key, T, Compare, mem::AllocatorAdapter<std::pair<const Key, T>>>;
97 template <class Key, class T, class Compare = std::less<>>
98 using PandaMapTL = std::map<Key, T, Compare, mem::AllocatorAdapter<std::pair<const Key, T>, mem::Al…
100 template <class Key, class T, class Compare = std::less<>>
101 using PandaMultiMap = std::multimap<Key, T, Compare, mem::AllocatorAdapter<std::pair<const Key, T>>…
[all …]
/arkcompiler/ets_runtime/ecmascript/ic/
Dic_compare_op.cpp222 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(xString, yString); 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/
Dnumber_helper_test.cpp89 EXPECT_EQ(EcmaStringAccessor::Compare(*handleEcmaStr1, *resultStr), 0); in HWTEST_F_L0()
94 EXPECT_EQ(EcmaStringAccessor::Compare(*handleEcmaStr2, *resultStr), 0); in HWTEST_F_L0()
99 EXPECT_EQ(EcmaStringAccessor::Compare(*handleEcmaStr3, *resultStr), 0); in HWTEST_F_L0()
104 EXPECT_EQ(EcmaStringAccessor::Compare(*handleEcmaStr4, *resultStr), 0); in HWTEST_F_L0()
109 EXPECT_EQ(EcmaStringAccessor::Compare(*handleEcmaStr6, *resultStr), 0); in HWTEST_F_L0()
114 EXPECT_EQ(EcmaStringAccessor::Compare(*handleEcmaStr7, *resultStr), 0); in HWTEST_F_L0()
119 EXPECT_EQ(EcmaStringAccessor::Compare(*handleEcmaStr5, *resultStr), 0); in HWTEST_F_L0()
130 EXPECT_EQ(EcmaStringAccessor::Compare(*handleEcmaStr1, *resultStr), 0); in HWTEST_F_L0()
134 EXPECT_EQ(EcmaStringAccessor::Compare(*handleEcmaStr2, *resultStr), 0); in HWTEST_F_L0()
138 EXPECT_EQ(EcmaStringAccessor::Compare(*handleEcmaStr3, *resultStr), 0); in HWTEST_F_L0()
[all …]
/arkcompiler/runtime_core/compiler/optimizer/ir/
Dgraph_cloner.cpp211 …* 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/ecmascript/builtins/tests/
Dbuiltins_errors_test.cpp93 EXPECT_EQ(EcmaStringAccessor::Compare(reinterpret_cast<EcmaString *>(msgValue->GetRawData()), in HWTEST_F_L0()
99 ASSERT_EQ(EcmaStringAccessor::Compare(reinterpret_cast<EcmaString *>( in HWTEST_F_L0()
119 ASSERT_EQ(EcmaStringAccessor::Compare(reinterpret_cast<EcmaString *>( in HWTEST_F_L0()
125 ASSERT_EQ(EcmaStringAccessor::Compare(reinterpret_cast<EcmaString *>( in HWTEST_F_L0()
157 ASSERT_EQ(EcmaStringAccessor::Compare( in HWTEST_F_L0()
163 ASSERT_EQ(EcmaStringAccessor::Compare( in HWTEST_F_L0()
197 ASSERT_EQ(EcmaStringAccessor::Compare(reinterpret_cast<EcmaString *>( in HWTEST_F_L0()
203 ASSERT_EQ(EcmaStringAccessor::Compare(reinterpret_cast<EcmaString *>( in HWTEST_F_L0()
231 EXPECT_EQ(EcmaStringAccessor::Compare(reinterpret_cast<EcmaString *>( in HWTEST_F_L0()
264 EXPECT_EQ(EcmaStringAccessor::Compare(reinterpret_cast<EcmaString *>( in HWTEST_F_L0()
[all …]
/arkcompiler/ets_runtime/ecmascript/regexp/tests/
Dregexp_test.cpp656 ASSERT_TRUE(EcmaStringAccessor::Compare(*result.captures_[0].second, *str) == 0); in HWTEST_F_L0()
678 ASSERT_TRUE(EcmaStringAccessor::Compare(*result.captures_[0].second, *str) == 0); in HWTEST_F_L0()
679 ASSERT_TRUE(EcmaStringAccessor::Compare(*result.captures_[1].second, *str) == 0); in HWTEST_F_L0()
680 ASSERT_TRUE(EcmaStringAccessor::Compare(*result.captures_[2].second, *str) == 0); in HWTEST_F_L0()
681 ASSERT_TRUE(EcmaStringAccessor::Compare(*result.captures_[3].second, *str) == 0); in HWTEST_F_L0()
710 ASSERT_TRUE(EcmaStringAccessor::Compare(*result.captures_[0].second, *str1) == 0); in HWTEST_F_L0()
711 ASSERT_TRUE(EcmaStringAccessor::Compare(*result.captures_[1].second, *str2) == 0); in HWTEST_F_L0()
733 ASSERT_TRUE(EcmaStringAccessor::Compare(*result.captures_[0].second, *str) == 0); in HWTEST_F_L0()
755 ASSERT_TRUE(EcmaStringAccessor::Compare(*result.captures_[0].second, *str) == 0); in HWTEST_F_L0()
781 ASSERT_TRUE(EcmaStringAccessor::Compare(*result.captures_[0].second, *str1) == 0); in HWTEST_F_L0()
[all …]
/arkcompiler/runtime_core/runtime/tests/
Dstring_test.cpp554 ASSERT_LT(string1->Compare(string2), 0); in TEST_F()
555 ASSERT_GT(string2->Compare(string1), 0); in TEST_F()
556 ASSERT_EQ(string1->Compare(string3), 0); in TEST_F()
557 ASSERT_EQ(string3->Compare(string1), 0); in TEST_F()
558 ASSERT_LT(string2->Compare(string4), 0); in TEST_F()
559 ASSERT_GT(string4->Compare(string2), 0); in TEST_F()
566 ASSERT_LT(string2->Compare(string5), 0); in TEST_F()
567 ASSERT_GT(string5->Compare(string2), 0); in TEST_F()
568 ASSERT_LT(string4->Compare(string5), 0); in TEST_F()
569 ASSERT_GT(string5->Compare(string4), 0); in TEST_F()
[all …]
/arkcompiler/runtime_core/libpandabase/utils/
Darena_containers.h46 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/runtime_core/compiler/docs/
Dloop_unrolling.md38 Loop is countable if it contains compare between loop-index instruction and test-instruction define…
48 Compare(update, test)
57 …ix loop-backedge compare by incrementing/decrementing test input with constant, counted using form…
144 INST(3, Opcode::Compare).b().SrcType(DataType::INT32).CC(CC_LT).Inputs(1, 0);
152 INST(9, Opcode::Compare).b().SrcType(DataType::INT32).CC(CC_LT).Inputs(7, 0);
172 …INST(3, Opcode::Compare).b().SrcType(DataType::INT32).CC(CC_LT).Inputs(1, 20); // if (a < 10 - (U…
182 INST(9, Opcode::Compare).b().SrcType(DataType::INT32).CC(CC_LT).Inputs(21, 20);
189 … INST(27, Opcode::Compare).b().SrcType(DataType::INT32).CC(CC_LT).Inputs(25, 0); // if (a < 10)

1234567891011