Home
last modified time | relevance | path

Searched refs:CC_LT (Results 1 - 25 of 60) sorted by relevance

123

/arkcompiler/runtime_core/compiler/tests/
H A 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()
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()
190 INST(5, Opcode::Compare).CC(ConditionCode::CC_LT) in TEST_F()
[all...]
H A Dbranch_elimination_test.cpp975 ConditionCode::CC_LT); in TEST_F()
996 ConditionCode::CC_LT); in TEST_F()
1012 BuildGraphAndCheckElimination<DominantCondResult::TRUE, RemainedSuccessor::FALSE_SUCCESSOR>(ConditionCode::CC_LT, in TEST_F()
1014 BuildGraphAndCheckElimination<DominantCondResult::TRUE, RemainedSuccessor::TRUE_SUCCESSOR>(ConditionCode::CC_LT, in TEST_F()
1016 BuildGraphAndCheckElimination<DominantCondResult::TRUE, RemainedSuccessor::TRUE_SUCCESSOR>(ConditionCode::CC_LT, in TEST_F()
1017 ConditionCode::CC_LT); in TEST_F()
1018 BuildGraphAndCheckElimination<DominantCondResult::TRUE, RemainedSuccessor::TRUE_SUCCESSOR>(ConditionCode::CC_LT, in TEST_F()
1020 BuildGraphAndCheckElimination<DominantCondResult::TRUE, RemainedSuccessor::FALSE_SUCCESSOR>(ConditionCode::CC_LT, in TEST_F()
1022 BuildGraphAndCheckElimination<DominantCondResult::TRUE, RemainedSuccessor::FALSE_SUCCESSOR>(ConditionCode::CC_LT, in TEST_F()
1024 BuildGraphAndCheckElimination<DominantCondResult::TRUE, RemainedSuccessor::BOTH>(ConditionCode::CC_LT, in TEST_F()
[all...]
H A Dcleanup_test.cpp113 INST(2, Opcode::If).SrcType(DataType::Type::INT64).CC(CC_LT).Inputs(0, 1); in TEST_F()
138 INST(2, Opcode::If).SrcType(DataType::Type::INT64).CC(CC_LT).Inputs(0, 1); in TEST_F()
165 INST(3, Opcode::If).SrcType(DataType::Type::INT64).CC(CC_LT).Inputs(0, 1); 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()
366 INST(2, Opcode::Compare).b().CC(CC_LT).SrcType(DataType::Type::INT64).Inputs(1, 0); in TEST_F()
397 INST(2, Opcode::Compare).b().CC(CC_LT).SrcType(DataType::Type::INT64).Inputs(1, 0); in TEST_F()
477 INST(2, Opcode::Compare).b().CC(CC_LT).SrcType(DataType::Type::INT64).Inputs(1, 0); in TEST_F()
497 INST(2, Opcode::Compare).b().CC(CC_LT).SrcType(DataType::Type::INT64).Inputs(1, 0); in TEST_F()
518 INST(2, Opcode::Compare).b().CC(CC_LT) in TEST_F()
[all...]
H A Dreg_alloc_graph_coloring_test.cpp54 INST(3, Opcode::Compare).b().CC(CC_LT).SrcType(DataType::Type::UINT64).Inputs(2, 0); in TEST_F()
102 INST(3, Opcode::Compare).b().CC(CC_LT).SrcType(DataType::Type::UINT64).Inputs(2, 0); in TEST_F()
113 INST(7, Opcode::Compare).b().CC(CC_LT).SrcType(DataType::Type::UINT64).Inputs(1, 0); in TEST_F()
H A Dbasicblock_test.cpp370 INST(14, Opcode::Compare).CC(ConditionCode::CC_LT).b().Inputs(0, 13); // i < X in TEST_F()
382 INST(5, Opcode::Compare).CC(ConditionCode::CC_LT).b().Inputs(10, 13); // i < X in TEST_F()
403 INST(14, Opcode::Compare).CC(ConditionCode::CC_LT).b().Inputs(0, 13); // i < X in TEST_F()
418 INST(5, Opcode::Compare).CC(ConditionCode::CC_LT).b().Inputs(10, 13); // i < X in TEST_F()
/arkcompiler/runtime_core/static_core/compiler/tests/
H A Dgraph_cloner_test.cpp45 INST(14U, Opcode::Compare).CC(ConditionCode::CC_LT).b().Inputs(0U, 13U); // i < X in SRC_GRAPH()
55 INST(5U, Opcode::Compare).CC(ConditionCode::CC_LT).b().Inputs(10U, 13U); // i < X in SRC_GRAPH()
82 INST(14U, Opcode::Compare).CC(ConditionCode::CC_LT).b().Inputs(0U, 13U); // i < X in OUT_GRAPH()
92 INST(5U, Opcode::Compare).CC(ConditionCode::CC_LT).b().Inputs(10U, 13U); // i < X in OUT_GRAPH()
101 INST(17U, Opcode::Compare).CC(ConditionCode::CC_LT).b().Inputs(16U, 13U); // i < X in OUT_GRAPH()
111 INST(20U, Opcode::Compare).CC(ConditionCode::CC_LT).b().Inputs(25U, 13U); // i < X in OUT_GRAPH()
150 INST(14U, Opcode::Compare).CC(ConditionCode::CC_LT).b().Inputs(0U, 13U); // i < X in SRC_GRAPH()
162 INST(5U, Opcode::Compare).CC(ConditionCode::CC_LT).b().Inputs(10U, 13U); // i < X in SRC_GRAPH()
193 INST(14U, Opcode::Compare).CC(ConditionCode::CC_LT).b().Inputs(0U, 13U); // i < X in OUT_GRAPH()
205 INST(5U, Opcode::Compare).CC(ConditionCode::CC_LT) in OUT_GRAPH()
[all...]
H A Dredundant_loop_elimination_test.cpp47 INST(5U, Opcode::Compare).CC(CC_LT).b().Inputs(4U, 2U); in TEST_F()
86 INST(5U, Opcode::Compare).CC(CC_LT).b().Inputs(4U, 2U); in TEST_F()
108 INST(5U, Opcode::Compare).CC(CC_LT).b().Inputs(4U, 2U); in TEST_F()
133 INST(5U, Opcode::Compare).CC(CC_LT).b().Inputs(4U, 2U); in SRC_GRAPH()
159 INST(5U, Opcode::Compare).CC(CC_LT).b().Inputs(4U, 2U); in OUT_GRAPH()
197 INST(6U, Opcode::Compare).b().CC(ConditionCode::CC_LT).Inputs(5U, 4U); in TEST_F()
203 INST(11U, Opcode::Compare).b().CC(ConditionCode::CC_LT).Inputs(10U, 3U); in TEST_F()
247 INST(6U, Opcode::Compare).b().CC(ConditionCode::CC_LT).Inputs(5U, 4U); in SRC_GRAPH()
253 INST(11U, Opcode::Compare).b().CC(ConditionCode::CC_LT).Inputs(10U, 3U); in SRC_GRAPH()
284 INST(6U, Opcode::Compare).b().CC(ConditionCode::CC_LT) in OUT_GRAPH()
[all...]
H A Dloop_unroll_test.cpp98 INST(8U, Opcode::Compare).CC(CC_LT).b().Inputs(7U, 2U); // while b < c in BuildGraphSimpleLoop()
532 INST(8U, Opcode::IfImm).SrcType(DataType::UINT64).CC(CC_LT).Imm(100U).Inputs(7U); in BuildGraphPhiInputOfAnotherPhi()
561 INST(8U, Opcode::IfImm).SrcType(DataType::UINT64).CC(CC_LT).Imm(100U).Inputs(7U); in TEST_F()
567 INST(12U, Opcode::IfImm).SrcType(DataType::UINT64).CC(CC_LT).Imm(100U).Inputs(11U); in TEST_F()
601 INST(8U, Opcode::IfImm).SrcType(DataType::UINT64).CC(CC_LT).Imm(100U).Inputs(7U); in TEST_F()
607 INST(12U, Opcode::IfImm).SrcType(DataType::UINT64).CC(CC_LT).Imm(100U).Inputs(11U); in TEST_F()
613 INST(14U, Opcode::IfImm).SrcType(DataType::UINT64).CC(CC_LT).Imm(100U).Inputs(13U); in TEST_F()
619 INST(16U, Opcode::IfImm).SrcType(DataType::UINT64).CC(CC_LT).Imm(100U).Inputs(15U); in TEST_F()
650 INST(7U, Opcode::IfImm).SrcType(DataType::UINT64).CC(CC_LT).Imm(100U).Inputs(6U); in TEST_F()
677 INST(7U, Opcode::IfImm).SrcType(DataType::UINT64).CC(CC_LT) in TEST_F()
[all...]
H A Dbranch_elimination_test.cpp992 ConditionCode::CC_LT); in TEST_F()
1013 ConditionCode::CC_LT); in TEST_F()
1032 BuildGraphAndCheckElimination<DominantCondResult::TRUE, RemainedSuccessor::FALSE_SUCCESSOR>(ConditionCode::CC_LT, in TEST_F()
1034 BuildGraphAndCheckElimination<DominantCondResult::TRUE, RemainedSuccessor::TRUE_SUCCESSOR>(ConditionCode::CC_LT, in TEST_F()
1036 BuildGraphAndCheckElimination<DominantCondResult::TRUE, RemainedSuccessor::TRUE_SUCCESSOR>(ConditionCode::CC_LT, in TEST_F()
1037 ConditionCode::CC_LT); in TEST_F()
1038 BuildGraphAndCheckElimination<DominantCondResult::TRUE, RemainedSuccessor::TRUE_SUCCESSOR>(ConditionCode::CC_LT, in TEST_F()
1040 BuildGraphAndCheckElimination<DominantCondResult::TRUE, RemainedSuccessor::FALSE_SUCCESSOR>(ConditionCode::CC_LT, in TEST_F()
1042 BuildGraphAndCheckElimination<DominantCondResult::TRUE, RemainedSuccessor::FALSE_SUCCESSOR>(ConditionCode::CC_LT, in TEST_F()
1044 BuildGraphAndCheckElimination<DominantCondResult::TRUE, RemainedSuccessor::BOTH>(ConditionCode::CC_LT, in TEST_F()
[all...]
H A Dloop_idioms_test.cpp40 INST(7U, Opcode::Compare).b().Inputs(2U, 6U).CC(CC_LT).SrcType(DataType::INT32); in CheckFillArrayFullInitial()
79 INST(7U, Opcode::Compare).b().Inputs(2U, 6U).CC(CC_LT).SrcType(DataType::INT32); in BuildExpectedFillArrayFull()
180 INST(7U, Opcode::Compare).b().Inputs(2U, 6U).CC(CC_LT).SrcType(DataType::INT32); in TEST_F()
222 INST(7U, Opcode::Compare).b().Inputs(2U, 6U).CC(CC_LT).SrcType(DataType::INT32); in TEST_F()
266 INST(7U, Opcode::Compare).b().Inputs(2U, 6U).CC(CC_LT).SrcType(DataType::INT32); in TEST_F()
310 INST(7U, Opcode::Compare).b().Inputs(15U, 6U).CC(CC_LT).SrcType(DataType::INT32); in TEST_F()
349 INST(7U, Opcode::Compare).b().Inputs(15U, 6U).CC(CC_LT).SrcType(DataType::INT32); in FillLargeArrayWithConstantIterationsCount()
386 INST(7U, Opcode::Compare).b().Inputs(15U, 6U).CC(CC_LT).SrcType(DataType::INT32); in FillLargeArrayWithConstantIterationsCountExpected()
450 INST(7U, Opcode::Compare).b().Inputs(2U, 6U).CC(CC_LT).SrcType(DataType::INT32); in TEST_F()
493 INST(7U, Opcode::Compare).b().Inputs(2U, 6U).CC(CC_LT) in TEST_F()
[all...]
H A Dchecks_elimination_test.cpp530 INST(5U, Opcode::Compare).SrcType(DataType::INT32).CC(CC_LT).b().Inputs(0U, 2U); // 0 < 10 in BuildGraphNullCheckTest3()
541 INST(13U, Opcode::Compare).CC(CC_LT).b().Inputs(10U, 2U); // i < 10 in BuildGraphNullCheckTest3()
567 INST(23U, Opcode::Compare).SrcType(DataType::INT32).CC(CC_LT).b().Inputs(16U, 2U); // len_array < 10 in TEST_F()
569 INST(5U, Opcode::Compare).SrcType(DataType::INT32).CC(CC_LT).b().Inputs(0U, 2U); // 0 < 10 in TEST_F()
579 INST(13U, Opcode::Compare).CC(CC_LT).b().Inputs(10U, 2U); // i < 10 in TEST_F()
601 INST(5U, Opcode::Compare).SrcType(DataType::INT32).CC(CC_LT).b().Inputs(0U, 2U); // 0 < 10 in BuildGraphNullCheckTest4()
611 INST(13U, Opcode::Compare).CC(CC_LT).b().Inputs(10U, 2U); // i < 10 in BuildGraphNullCheckTest4()
635 INST(5U, Opcode::Compare).SrcType(DataType::INT32).CC(CC_LT).b().Inputs(0U, 2U); // 0 < 10 in TEST_F()
822 INST(5U, Opcode::Compare).SrcType(DataType::INT32).CC(CC_LT).b().Inputs(0U, 2U); // 0 < 10 in BuildGraphHoistNegativeCheckTest()
833 INST(13U, Opcode::Compare).CC(CC_LT) in BuildGraphHoistNegativeCheckTest()
[all...]
H A Dcleanup_test.cpp135 INST(2U, Opcode::If).SrcType(DataType::Type::INT64).CC(CC_LT).Inputs(0U, 1U); in TEST_F()
160 INST(2U, Opcode::If).SrcType(DataType::Type::INT64).CC(CC_LT).Inputs(0U, 1U); in TEST_F()
187 INST(3U, Opcode::If).SrcType(DataType::Type::INT64).CC(CC_LT).Inputs(0U, 1U); in TEST_F()
223 INST(5U, Opcode::Compare).b().CC(CC_LT).SrcType(DataType::Type::INT64).Inputs(1U, 3U); in TEST_F()
243 INST(5U, Opcode::Compare).b().CC(CC_LT).SrcType(DataType::Type::INT64).Inputs(1U, 3U); in TEST_F()
408 INST(2U, Opcode::Compare).b().CC(CC_LT).SrcType(DataType::Type::INT64).Inputs(1U, 0U); in TEST_F()
439 INST(2U, Opcode::Compare).b().CC(CC_LT).SrcType(DataType::Type::INT64).Inputs(1U, 0U); in TEST_F()
519 INST(2U, Opcode::Compare).b().CC(CC_LT).SrcType(DataType::Type::INT64).Inputs(1U, 0U); in TEST_F()
539 INST(2U, Opcode::Compare).b().CC(CC_LT).SrcType(DataType::Type::INT64).Inputs(1U, 0U); in TEST_F()
560 INST(2U, Opcode::Compare).b().CC(CC_LT) in TEST_F()
[all...]
H A Dbounds_analysis_test.cpp201 CCTest(ConditionCode::CC_LT, BR(10U, 50U), BR(20U, 60U), BR(10U, 50U), BR(20U, 60U)); in TEST_F()
213 CCTest(ConditionCode::CC_LT, BR(10U, 20U), BR(50U, 60U), BR(10U, 20U), BR(50U, 60U)); in TEST_F()
225 CCTest(ConditionCode::CC_LT, BR(10U, 60U), BR(20U, 50U), BR(10U, 49U), BR(20U, 50U)); in TEST_F()
240 CCTest(ConditionCode::CC_LT, BR(20U, 60U), BR(10U, 50U), BR(20U, 49U), BR(21U, 50U)); in TEST_F()
252 CCTest(ConditionCode::CC_LT, BR(50U, 60U), BR(10U, 20U), BR(INT64_MIN, INT64_MAX), BR(INT64_MIN, INT64_MAX)); in TEST_F()
264 CCTest(ConditionCode::CC_LT, BR(20U, 50U), BR(10U, 60U), BR(20U, 50U), BR(21U, 60U)); in TEST_F()
276 CCTest(ConditionCode::CC_LT, BR(-5L, 0U), BR(-10L, -5L), BR(INT64_MIN, INT64_MAX), BR(INT64_MIN, INT64_MAX)); in TEST_F()
279 CCTest(ConditionCode::CC_LT, BR(0U, 20U), BR(0U, 0U), BR(INT64_MIN, INT64_MAX), BR(INT64_MIN, INT64_MAX)); in TEST_F()
281 CCTest(ConditionCode::CC_LT, BR(32U, 32U), BR(16U, 32U), BR(INT64_MIN, INT64_MAX), BR(INT64_MIN, INT64_MAX)); in TEST_F()
447 INST(5U, Opcode::Compare).SrcType(DataType::INT32).CC(CC_LT) in TEST_F()
[all...]
H A Ddeoptimize_elimination_test.cpp277 INST(3U, Opcode::Compare).b().CC(CC_LT).Inputs(10U, 11U); in TEST_F()
314 INST(3U, Opcode::Compare).b().CC(CC_LT).Inputs(10U, 11U); in SRC_GRAPH()
349 INST(3U, Opcode::Compare).b().CC(CC_LT).Inputs(10U, 11U); in OUT_GRAPH()
405 INST(8U, Opcode::Compare).b().CC(CC_LT).Inputs(3U, 12U); in SRC_GRAPH()
438 INST(8U, Opcode::Compare).b().CC(CC_LT).Inputs(3U, 12U); in OUT_GRAPH()
480 INST(8U, Opcode::Compare).b().CC(CC_LT).Inputs(3U, 12U); in TEST_F()
518 INST(8U, Opcode::Compare).b().CC(CC_LT).Inputs(3U, 12U); in TEST_F()
556 INST(8U, Opcode::Compare).b().CC(CC_LT).Inputs(3U, 12U); in SRC_GRAPH()
594 INST(8U, Opcode::Compare).b().CC(CC_LT).Inputs(3U, 12U); in OUT_GRAPH()
634 INST(3U, Opcode::Compare).b().CC(CC_LT) in SRC_GRAPH()
[all...]
H A Dreg_alloc_graph_coloring_test.cpp56 INST(3U, Opcode::Compare).b().CC(CC_LT).SrcType(DataType::Type::UINT64).Inputs(2U, 0U); in TEST_F()
99 INST(3U, Opcode::Compare).b().CC(CC_LT).SrcType(DataType::Type::UINT64).Inputs(2U, 0U); in SRC_GRAPH()
110 INST(7U, Opcode::Compare).b().CC(CC_LT).SrcType(DataType::Type::UINT64).Inputs(1U, 0U); in SRC_GRAPH()
171 INST(4U, Opcode::Compare).b().CC(CC_LT).SrcType(DataType::Type::UINT64).Inputs(3U, 1U); in SRC_GRAPH()
H A Dloop_analyzer_test.cpp501 // Loop isn't countable because const_step is negative and condition is CC_LT in TEST_F()
511 INST(5U, Opcode::Compare).SrcType(DataType::INT32).CC(CC_LT).b().Inputs(0U, 16U); // 0 < len_array in TEST_F()
521 INST(13U, Opcode::Compare).CC(CC_LT).b().Inputs(10U, 16U); // i < len_array in TEST_F()
546 INST(5U, Opcode::Compare).SrcType(DataType::INT32).CC(CC_LT).b().Inputs(0U, 16U); // 0 < len_array in TEST_F()
581 // Loop isn't countable because const_step is negative and condition is CC_LT in TEST_F()
591 INST(5U, Opcode::Compare).SrcType(DataType::INT32).CC(CC_LT).b().Inputs(0U, 16U); // 0 < len_array in TEST_F()
601 INST(13U, Opcode::Compare).CC(CC_LT).b().Inputs(10U, 16U); // i < len_array in TEST_F()
658 INST(3U, Opcode::Compare).b().CC(CC_LT).Inputs(2U, 10U); in TEST_F()
682 ASSERT_EQ(loopInfoValue.normalizedCc, ConditionCode::CC_LT); in TEST_F()
H A Dbasicblock_test.cpp408 INST(14U, Opcode::Compare).CC(ConditionCode::CC_LT).b().Inputs(0U, 13U); // i < X in SplitByPhi1BuildGraph()
420 INST(5U, Opcode::Compare).CC(ConditionCode::CC_LT).b().Inputs(10U, 13U); // i < X in SplitByPhi1BuildGraph()
447 INST(14U, Opcode::Compare).CC(ConditionCode::CC_LT).b().Inputs(0U, 13U); // i < X in TEST_F()
462 INST(5U, Opcode::Compare).CC(ConditionCode::CC_LT).b().Inputs(10U, 13U); // i < X in TEST_F()
H A Dloop_unswitch_test.cpp1198 auto ifImm0 = CreateInstIfImm(firstInput, secondInput, ConditionCode::CC_LT, 10U, ConditionCode::CC_NE); in TEST_F()
1199 auto ifImm1 = CreateInstIfImm(firstInput, secondInput, ConditionCode::CC_LT, 10U, ConditionCode::CC_NE); in TEST_F()
1204 auto ifImm0 = CreateInstIfImm(firstInput, secondInput, ConditionCode::CC_LT, 1U, ConditionCode::CC_NE); in TEST_F()
1205 auto ifImm1 = CreateInstIfImm(firstInput, thirdInput, ConditionCode::CC_LT, 1U, ConditionCode::CC_NE); in TEST_F()
1210 auto ifImm0 = CreateInstIfImm(firstInput, secondInput, ConditionCode::CC_LT, 0U, ConditionCode::CC_NE); in TEST_F()
1211 auto ifImm1 = CreateInstIfImm(firstInput, secondInput, ConditionCode::CC_LT, 0U, ConditionCode::CC_NE); in TEST_F()
1216 auto ifImm0 = CreateInstIfImm(firstInput, secondInput, ConditionCode::CC_LT, 0U, ConditionCode::CC_NE); in TEST_F()
1222 auto ifImm0 = CreateInstIfImm(firstInput, secondInput, ConditionCode::CC_LT, 0U, ConditionCode::CC_NE); in TEST_F()
1223 auto ifImm1 = CreateInstIfImm(firstInput, secondInput, ConditionCode::CC_LT, 0U, ConditionCode::CC_EQ); in TEST_F()
1229 auto ifImm1 = CreateInstIfImm(firstInput, secondInput, ConditionCode::CC_LT, in TEST_F()
[all...]
H A Dloop_peeling_test.cpp386 INST(6U, Opcode::Compare).CC(CC_LT).b().Inputs(5U, 2U); // while i < 100 in BuildGraphInnerLoop()
393 INST(10U, Opcode::Compare).CC(CC_LT).b().Inputs(9U, 2U); // while j < 100 in BuildGraphInnerLoop()
426 INST(6U, Opcode::Compare).CC(CC_LT).b().Inputs(5U, 2U); in TEST_F()
431 INST(16U, Opcode::Compare).CC(CC_LT).b().Inputs(5U, 2U); in TEST_F()
440 INST(10U, Opcode::Compare).CC(CC_LT).b().Inputs(13U, 2U); in TEST_F()
949 INST(7U, Opcode::Compare).CC(CC_LT).b().Inputs(6U, 1U); // while a < b in BuildGraphNeedSaveStateBridge()
983 INST(27U, Opcode::Compare).CC(CC_LT).b().Inputs(26U, 1U); // while a < b in TEST_F()
994 INST(7U, Opcode::Compare).CC(CC_LT).b().Inputs(6U, 1U); // while a < b in TEST_F()
/arkcompiler/ets_runtime/ecmascript/compiler/codegen/maple/maple_be/include/be/
H A Dcommon_utils.h246 CC_LT, /* signed less than */
276 case CC_LT: in GetReverseCC()
279 return CC_LT; in GetReverseCC()
296 case CC_LT: in GetReverseBasicCC()
299 return CC_LT; in GetReverseBasicCC()
/arkcompiler/runtime_core/static_core/compiler/optimizer/ir/
H A Dinst.cpp33 case ConditionCode::CC_LT: in GetInverseConditionCode()
40 return ConditionCode::CC_LT; in GetInverseConditionCode()
69 case ConditionCode::CC_LT: in InverseSignednessConditionCode()
79 return ConditionCode::CC_LT; in InverseSignednessConditionCode()
100 case ConditionCode::CC_LT: in IsSignedConditionCode()
128 case ConditionCode::CC_LT: in SwapOperandsConditionCode()
133 return ConditionCode::CC_LT; in SwapOperandsConditionCode()
/arkcompiler/runtime_core/static_core/bytecode_optimizer/tests/
H A Dcodegen_test.cpp179 std::vector<compiler::ConditionCode> conds {ConditionCode::CC_EQ, ConditionCode::CC_NE, ConditionCode::CC_LT, in TEST_F() member in ark::bytecodeopt::test::ConditionCode
212 std::vector<compiler::ConditionCode> conds {ConditionCode::CC_EQ, ConditionCode::CC_NE, ConditionCode::CC_LT, in TEST_F() member in ark::bytecodeopt::test::ConditionCode
247 std::vector<compiler::ConditionCode> conds {ConditionCode::CC_EQ, ConditionCode::CC_NE, ConditionCode::CC_LT, in TEST_F() member in ark::bytecodeopt::test::ConditionCode
280 std::vector<compiler::ConditionCode> conds {ConditionCode::CC_EQ, ConditionCode::CC_NE, ConditionCode::CC_LT, in TEST_F() member in ark::bytecodeopt::test::ConditionCode
315 std::vector<compiler::ConditionCode> conds {ConditionCode::CC_EQ, ConditionCode::CC_NE, ConditionCode::CC_LT, in TEST_F() member in ark::bytecodeopt::test::ConditionCode
348 std::vector<compiler::ConditionCode> conds {ConditionCode::CC_EQ, ConditionCode::CC_NE, ConditionCode::CC_LT, in TEST_F() member in ark::bytecodeopt::test::ConditionCode
415 std::vector<compiler::ConditionCode> conds {ConditionCode::CC_EQ, ConditionCode::CC_NE, ConditionCode::CC_LT, in TEST_F() member in ark::bytecodeopt::test::ConditionCode
451 std::vector<compiler::ConditionCode> conds {ConditionCode::CC_EQ, ConditionCode::CC_NE, ConditionCode::CC_LT, in TEST_F() member in ark::bytecodeopt::test::ConditionCode
488 std::vector<compiler::ConditionCode> conds {ConditionCode::CC_EQ, ConditionCode::CC_NE, ConditionCode::CC_LT, in TEST_F() member in ark::bytecodeopt::test::ConditionCode
524 std::vector<compiler::ConditionCode> conds {ConditionCode::CC_EQ, ConditionCode::CC_NE, ConditionCode::CC_LT, in TEST_F() member in ark::bytecodeopt::test::ConditionCode
561 std::vector<compiler::ConditionCode> conds {ConditionCode::CC_EQ, ConditionCode::CC_NE, ConditionCode::CC_LT, TEST_F() member in ark::bytecodeopt::test::ConditionCode
597 std::vector<compiler::ConditionCode> conds {ConditionCode::CC_EQ, ConditionCode::CC_NE, ConditionCode::CC_LT, TEST_F() member in ark::bytecodeopt::test::ConditionCode
705 std::vector<compiler::ConditionCode> conds {ConditionCode::CC_EQ, ConditionCode::CC_NE, ConditionCode::CC_LT, TEST_F() member in ark::bytecodeopt::test::ConditionCode
741 std::vector<compiler::ConditionCode> conds {ConditionCode::CC_EQ, ConditionCode::CC_NE, ConditionCode::CC_LT, TEST_F() member in ark::bytecodeopt::test::ConditionCode
777 std::vector<compiler::ConditionCode> conds {ConditionCode::CC_EQ, ConditionCode::CC_NE, ConditionCode::CC_LT, TEST_F() member in ark::bytecodeopt::test::ConditionCode
[all...]
/arkcompiler/runtime_core/static_core/compiler/optimizer/analysis/
H A Dcountable_loop_parser.cpp185 if (loopInfo.normalizedCc == CC_LT || loopInfo.normalizedCc == CC_GT) { in GetLoopIterations()
301 if (loopInfo_.isInc && cc != CC_LE && cc != CC_LT) { in IsConditionCodeAcceptable()
H A Dbounds_analysis.cpp505 if (cc == ConditionCode::CC_LT || cc == ConditionCode::CC_B) { in NarrowBoundsCase3()
526 if (cc == ConditionCode::CC_LT || cc == ConditionCode::CC_B) { in NarrowBoundsCase4()
541 if (cc == ConditionCode::CC_LT || cc == ConditionCode::CC_LE || cc == ConditionCode::CC_EQ || in NarrowBoundsCase5()
562 if (cc == ConditionCode::CC_LT || cc == ConditionCode::CC_B) { in NarrowBoundsCase6()
1060 } else if (cc == CC_LT) { in MoveRangeAccordingCC()
1076 ASSERT(cc == CC_LE || cc == CC_LT || cc == CC_GE || cc == CC_GT); in ProcessIndexPhi()
1109 if (cc == CC_LE || cc == CC_LT) { in ProcessIndexPhi()
1323 if (cc == ConditionCode::CC_LT && IsLenArray(right)) { in CalcNewBoundsRangeForCompare()
/arkcompiler/runtime_core/static_core/compiler/optimizer/optimizations/
H A Dchecks_elimination.cpp891 loopInfoValue.normalizedCc == CC_LE ? CC_LE : CC_LT, isHeadLoopExit, in FindLoopInfo()
931 if (loopCc == CC_LT || loopCc == CC_LE) { in InsertDeoptimizationForIndexOverflow()
937 auto maxUpper = BoundsRange::GetMax(indexType) - step + (loopCc == CC_LT ? 1 : 0); in InsertDeoptimizationForIndexOverflow()
947 InsertBoundsCheckDeoptimization(ConditionCode::CC_LT, {nullptr, loopUpper}, maxUpper, {ss, insertAfter}); in InsertDeoptimizationForIndexOverflow()
997 if (cc == CC_LT) { in TryInsertDeoptimizationForLargeStep()
1024 ASSERT(cc == CC_LT || cc == CC_LE); in TryInsertDeoptimization()
1049 NeedUpperDeoptimization(header, {lenArray, upper}, {cc == CC_LT, upperRangeIsMax}, maxAdd, in TryInsertDeoptimization()
1060 InsertBoundsCheckDeoptimization(ConditionCode::CC_LT, {lower, lowerConst}, minAdd, {ss, ss}); in TryInsertDeoptimization()
1092 } else if (lowerRange.IsConst() && lowerRange.GetLeft() == 0 && countableLoopInfo.normalizedCc == CC_LT && in TryInsertUpperDeoptimization()
1256 InsertBoundsCheckDeoptimization(ConditionCode::CC_LT, {inde in ReplaceOneBoundsCheckToDeoptimizationInLoop()
[all...]

Completed in 30 milliseconds

123