| /arkcompiler/ets_runtime/ecmascript/compiler/codegen/maple/maple_be/include/cg/ |
| D | schedule_heuristic.h | 31 int operator()(const DepNode &node1, const DepNode &node2) const in operator()
33 return static_cast<int>(node1.GetDelay() - node2.GetDelay()); in operator()
45 int operator()(const DepNode &node1, const DepNode &node2) in operator()
49 Insn *insn2 = node2.GetInsn(); in operator()
110 int operator()(const DepNode &node1, const DepNode &node2) const in operator()
120 for (auto *predLink : node2.GetPreds()) { in operator()
176 int operator()(const DepNode &node1, const DepNode &node2) const in operator()
178 return static_cast<int>(node2.GetEStart() - node1.GetEStart()); in operator()
185 int operator()(const DepNode &node1, const DepNode &node2) const in operator()
187 return static_cast<int>(node2.GetLStart() - node1.GetLStart()); in operator()
[all …]
|
| D | list_scheduler.h | 27 using SchedRankFunctor = bool (*)(const DepNode *node1, const DepNode *node2);
205 static bool DelayRankScheduleInsns(const DepNode *node1, const DepNode *node2) in DelayRankScheduleInsns() argument
209 int p1 = compareDelay(*node1, *node2); in DelayRankScheduleInsns()
215 int p2 = compareDataCache(*node1, *node2); in DelayRankScheduleInsns()
221 int p3 = compareClassOfLSN(*node1, *node2); in DelayRankScheduleInsns()
227 int p4 = compareSuccNodeSize(*node1, *node2); in DelayRankScheduleInsns()
233 int p6 = compareInsnId(*node1, *node2); in DelayRankScheduleInsns()
242 static bool CriticalPathRankScheduleInsns(const DepNode *node1, const DepNode *node2);
|
| D | schedule.h | 182 static bool DepNodePriorityCmp(const DepNode *node1, const DepNode *node2);
|
| /arkcompiler/ets_runtime/ecmascript/compiler/codegen/maple/maple_be/src/cg/aarch64/ |
| D | aarch64_schedule.cpp | 719 AArch64Schedule::CSRResult AArch64Schedule::DoCSR(DepNode &node1, DepNode &node2, in DoCSR() argument
723 RegisterInfoUnit defRIU2 = GetDepNodeDefType(node2, cgFunc); in DoCSR()
727 CSRResult csrInfo = ScheduleCrossCall(node1, node2); in DoCSR()
729 (csrInfo == kNode2 && defRIU2.intRegNum >= scheduleInfo.GetFreeIntRegs(node2))) { in DoCSR()
736 CSRResult csrInfo = ScheduleCrossCall(node1, node2); in DoCSR()
738 (csrInfo == kNode2 && defRIU2.fpRegNum >= scheduleInfo.GetFreeFpRegs(node2))) { in DoCSR()
743 auto findFreeRegNode = [&scheduleInfo, &node1, &node2](bool isInt) -> CSRResult { in DoCSR()
745 …if (freeRegNodes.find(&node1) != freeRegNodes.end() && freeRegNodes.find(&node2) == freeRegNodes.e… in DoCSR()
748 …if (freeRegNodes.find(&node1) == freeRegNodes.end() && freeRegNodes.find(&node2) != freeRegNodes.e… in DoCSR()
780 …return canDoCSPFurther ? kDoCSP : (node1.GetInsn()->GetId() < node2.GetInsn()->GetId() ? kNode1 : … in DoCSR()
[all …]
|
| /arkcompiler/ets_runtime/ecmascript/compiler/codegen/maple/maple_me/include/ |
| D | dominance.h | 227 bool Dominate(const BaseGraphNode &node1, const BaseGraphNode &node2) const in Dominate() argument
229 if (&node1 == &node2) { in Dominate()
232 const auto *iDom = &node2; in Dominate()
385 BaseGraphNode *Intersect(BaseGraphNode &node1, const BaseGraphNode &node2) const in Intersect() argument
388 auto *ptrNode2 = &node2; in Intersect()
|
| /arkcompiler/ets_runtime/ecmascript/compiler/codegen/maple/maple_be/include/cg/aarch64/ |
| D | aarch64_schedule.h | 193 …bool CompareDepNode(DepNode &node1, DepNode &node2, AArch64ScheduleProcessInfo &scheduleInfo) cons…
200 CSRResult DoCSR(DepNode &node1, DepNode &node2, AArch64ScheduleProcessInfo &scheduleInfo) const;
201 AArch64Schedule::CSRResult ScheduleCrossCall(const DepNode &node1, const DepNode &node2) const;
|
| /arkcompiler/ets_runtime/ecmascript/compiler/codegen/maple/maple_be/src/cg/ |
| D | schedule.cpp | 146 bool RegPressureSchedule::DepNodePriorityCmp(const DepNode *node1, const DepNode *node2) in DepNodePriorityCmp() argument
149 CHECK_NULL_FATAL(node2); in DepNodePriorityCmp()
151 int32 priority2 = node2->GetPriority(); in DepNodePriorityCmp()
157 int32 numCall2 = node2->GetNumCall(); in DepNodePriorityCmp()
158 if (node1->GetIncPressure() && node2->GetIncPressure()) { in DepNodePriorityCmp()
167 int32 depthS2 = node2->GetMaxDepth() + near2; in DepNodePriorityCmp()
186 if (node1->GetHasPreg() != node2->GetHasPreg()) { in DepNodePriorityCmp()
190 return node1->GetInsn()->GetId() < node2->GetInsn()->GetId(); in DepNodePriorityCmp()
|
| D | list_scheduler.cpp | 165 bool ListScheduler::CriticalPathRankScheduleInsns(const DepNode *node1, const DepNode *node2) in CriticalPathRankScheduleInsns() argument
169 int p1 = compareLStart(*node1, *node2); in CriticalPathRankScheduleInsns()
175 int p2 = compareCost(*node1, *node2); in CriticalPathRankScheduleInsns()
181 int p3 = compareEStart(*node1, *node2); in CriticalPathRankScheduleInsns()
187 int p4 = compareSuccNodeSize(*node1, *node2); in CriticalPathRankScheduleInsns()
193 int p5 = compareUnitKindNum(*node1, *node2); in CriticalPathRankScheduleInsns()
199 int p6 = compareSlotType(*node1, *node2); in CriticalPathRankScheduleInsns()
205 int p7 = compareInsnId(*node1, *node2); in CriticalPathRankScheduleInsns()
|
| /arkcompiler/runtime_core/static_core/compiler/tests/ |
| D | reg_alloc_interference_graph_test.cpp | 84 auto *node2 = gr.AllocNode(); in TEST_F() local
86 EXPECT_EQ(node2->GetNumber(), 1U); in TEST_F()
87 EXPECT_NE(node1, node2); in TEST_F()
|
| /arkcompiler/runtime_core/compiler/tests/ |
| D | reg_alloc_interference_graph_test.cpp | 76 auto *node2 = gr.AllocNode(); in TEST_F() local
78 EXPECT_EQ(node2->GetNumber(), 1); in TEST_F()
79 EXPECT_NE(node1, node2); in TEST_F()
|
| D | reg_alloc_interference_graph_new_test.cpp | 141 ColorNode node2(1, allocator.Adapter()); variable
142 EXPECT_EQ(node2.GetNumber(), 1);
248 auto *node2 = ig.AllocNode(); variable
250 EXPECT_EQ(node2->GetNumber(), 1);
251 EXPECT_NE(node1, node2);
|
| D | compiler_regalloc_test.cpp | 256 auto *node2 = gr.AllocNode(); in __anondbc4d24d0802() local
258 EXPECT_EQ(node2->GetNumber(), 1); in __anondbc4d24d0802()
259 EXPECT_NE(node1, node2); in __anondbc4d24d0802()
|
| /arkcompiler/ets_runtime/ecmascript/compiler/codegen/maple/maple_ipa/src/old/ |
| D | ea_connection_graph.cpp | 1037 …ectionGraph::UpdateCallerEdgesInternal(EACGObjectNode *node1, int32 fieldID, EACGObjectNode *node2) in UpdateCallerEdgesInternal() argument
1040 CHECK_FATAL(callee2Caller.find(node2) != callee2Caller.end(), "find failed"); in UpdateCallerEdgesInternal()
1042 for (EACGObjectNode *q1 : callee2Caller[node2]) { in UpdateCallerEdgesInternal()
|
| /arkcompiler/ets_runtime/ecmascript/compiler/codegen/maple/maple_ipa/include/old/ |
| D | ea_connection_graph.h | 247 void UpdateCallerEdgesInternal(EACGObjectNode *node1, int32 fieldID, EACGObjectNode *node2);
|