Home
last modified time | relevance | path

Searched refs:prevGate (Results 1 - 3 of 3) sorted by relevance

/arkcompiler/ets_runtime/ecmascript/compiler/
H A Dscheduler.cpp389 const auto &prevGate = prevGates[idx]; in CalculateSchedulingLowerBound() local
390 if (!acc.IsSchedulable(prevGate)) { in CalculateSchedulingLowerBound()
394 useCount[prevGate]++; in CalculateSchedulingLowerBound()
395 if (useCount[prevGate] == 1) { in CalculateSchedulingLowerBound()
399 acc.GetIns(prevGate, newPrevGates); in CalculateSchedulingLowerBound()
426 const auto &prevGate = prevGates[idx]; in CalculateSchedulingLowerBound() local
427 if (!acc.IsSchedulable(prevGate)) { in CalculateSchedulingLowerBound()
431 useCount[prevGate]--; in CalculateSchedulingLowerBound()
444 if (lowerBound.count(prevGate) == 0) { in CalculateSchedulingLowerBound()
445 lowerBound[prevGate] in CalculateSchedulingLowerBound()
[all...]
H A Dverifier.cpp35 GateRef prevGate = sizeof(Out); in RunDataIntegrityCheck() local
36 gatesList.push_back(prevGate); in RunDataIntegrityCheck()
37 gatesSet.insert(prevGate); in RunDataIntegrityCheck()
43 if (gate < prevGate + static_cast<int64_t>(sizeof(Gate)) || in RunDataIntegrityCheck()
51 prevGate = gate; in RunDataIntegrityCheck()
H A Dgraph_linearizer.cpp677 auto prevGate = acc_.GetIn(curGate, edge.GetIndex()); in VisitPreparedGate() local
678 if (acc_.IsProlog(prevGate) || acc_.IsRoot(prevGate)) { in VisitPreparedGate()
681 auto& prevInfo = linearizer_->GetGateInfo(prevGate); in VisitPreparedGate()
688 pendingList_.emplace_back(prevGate); in VisitPreparedGate()

Completed in 4 milliseconds