Searched refs:nodeA (Results 1 – 5 of 5) sorted by relevance
| /arkcompiler/ets_runtime/ecmascript/compiler/ |
| D | verifier.cpp | 555 auto isAncestor = [timeIn, timeOut](size_t nodeA, size_t nodeB) -> bool { in Run() argument
556 return timeIn[nodeA] <= timeIn[nodeB] && timeOut[nodeA] >= timeOut[nodeB]; in Run()
558 auto lowestCommonAncestor = [&](size_t nodeA, size_t nodeB) -> size_t { in Run() argument
559 if (isAncestor(nodeA, nodeB)) { in Run()
560 return nodeA; in Run()
562 if (isAncestor(nodeB, nodeA)) { in Run()
566 if (!isAncestor(jumpUp[nodeA][stepSize - 1], nodeB)) { in Run()
567 nodeA = jumpUp[nodeA][stepSize - 1]; in Run()
570 return jumpUp[nodeA][0]; in Run()
|
| D | scheduler.cpp | 190 auto isAncestor = [&](size_t nodeA, size_t nodeB) -> bool { in Run() argument
191 return (timeIn[nodeA] <= timeIn[nodeB]) && (timeOut[nodeA] >= timeOut[nodeB]); in Run()
193 auto lowestCommonAncestor = [&](size_t nodeA, size_t nodeB) -> size_t { in Run() argument
194 if (isAncestor(nodeA, nodeB)) { in Run()
195 return nodeA; in Run()
197 if (isAncestor(nodeB, nodeA)) { in Run()
201 if (!isAncestor(jumpUp[nodeA][stepSize - 1], nodeB)) { in Run()
202 nodeA = jumpUp[nodeA][stepSize - 1]; in Run()
205 return jumpUp[nodeA][0]; in Run()
|
| D | bytecode_circuit_builder.cpp | 154 bool BytecodeCircuitBuilder::IsAncestor(size_t nodeA, size_t nodeB) in IsAncestor() argument
156 return timeIn_[bbIdToDfsTimestamp_[nodeA]] <= timeIn_[bbIdToDfsTimestamp_[nodeB]] && in IsAncestor()
157 timeOut_[bbIdToDfsTimestamp_[nodeA]] >= timeOut_[bbIdToDfsTimestamp_[nodeB]]; in IsAncestor()
|
| D | bytecode_circuit_builder.h | 643 bool IsAncestor(size_t nodeA, size_t nodeB);
|
| /arkcompiler/runtime_core/static_core/plugins/ets/tests/ets_func_tests/escompat/ |
| D | JsonTest.sts | 260 const nodeA = new TestNode("A")
261 const nodeB = new TestNode("B", nodeA)
263 nodeA.next = nodeB
267 const json = JSON.stringify(nodeA)
|