Home
last modified time | relevance | path

Searched refs:MarkCode (Results 1 – 13 of 13) sorted by relevance

/arkcompiler/ets_runtime/ecmascript/compiler/
Dcombined_pass_visitor.cpp70 if (acc_.GetMark(*it) == MarkCode::FINISHED) { in ReplaceGate()
109 if (acc_.GetMark(gate) == MarkCode::PREVISIT) { in VisitGraph()
123 if (acc_.GetMark(gate) == MarkCode::FINISHED) { in ReVisitGate()
172 if (acc_.GetMark(input) < MarkCode::VISITED) { in VisitTopGate()
185 if (acc_.GetMark(input) < MarkCode::VISITED) { in VisitTopGate()
207 if (acc_.GetMark(*it) == MarkCode::FINISHED) { in VisitTopGate()
Dgate.h49 enum MarkCode : GateMark { enum
201 [[nodiscard]] MarkCode GetMark(TimeStamp stamp) const;
202 void SetMark(MarkCode mark, TimeStamp stamp);
293 MarkCode mark_ { MarkCode::NO_MARK }; // uint8_t
Dcombined_pass_visitor.h86 acc_.SetMark(gate, MarkCode::VISITED); in PushGate()
92 acc_.SetMark(gate, MarkCode::PREVISIT); in PushChangedGate()
98 acc_.SetMark(gate, MarkCode::FINISHED); in PopGate()
Dgraph_linearizer.h46 acc.SetMark(state_, MarkCode::VISITED); in SetVisited()
51 acc.SetMark(state_, MarkCode::FINISHED); in SetFinished()
56 return acc.GetMark(state_) == MarkCode::NO_MARK; in IsUnvisited()
61 return acc.GetMark(state_) == MarkCode::VISITED; in IsVisited()
66 return acc.GetMark(state_) == MarkCode::FINISHED; in IsFinished()
Dstate_split_linearizer.cpp121 if (acc_.GetMark(gate) == MarkCode::NO_MARK && in DeleteUnusedGates()
138 acc_.SetMark(curGate, MarkCode::VISITED); in TryFindDependStart()
191 acc_.SetMark(gate, MarkCode::VISITED); in VisitGate()
226 acc_.SetMark(dependRelay, MarkCode::VISITED); in TryInsertRelay()
Dgraph_linearizer.cpp73 acc_.SetMark(startGate, MarkCode::VISITED); in VisitStateGates()
92 if (acc_.GetMark(bTrue) == MarkCode::NO_MARK) { in VisitStateGates()
93 acc_.SetMark(bTrue, MarkCode::VISITED); in VisitStateGates()
96 if (acc_.GetMark(bFalse) == MarkCode::NO_MARK) { in VisitStateGates()
97 acc_.SetMark(bFalse, MarkCode::VISITED); in VisitStateGates()
103 … if (acc_.IsStateIn(useIt) && acc_.IsState(*useIt) && acc_.GetMark(*useIt) == MarkCode::NO_MARK) { in VisitStateGates()
104 acc_.SetMark(*useIt, MarkCode::VISITED); in VisitStateGates()
Dverifier.cpp274 if (circuit->GetMark(predGate) == MarkCode::NO_MARK) { in RunFlowCyclesFind()
276 circuit->SetMark(predGate, MarkCode::VISITED); in RunFlowCyclesFind()
286 if (circuit->GetMark(predGate) == MarkCode::NO_MARK) { in RunFlowCyclesFind()
288 circuit->SetMark(predGate, MarkCode::VISITED); in RunFlowCyclesFind()
Dcircuit.cpp221 const_cast<Gate *>(LoadGatePtrConst(gate))->SetMark(MarkCode::NO_MARK, 0); in ResetAllGateTimeStamps()
230 MarkCode Circuit::GetMark(GateRef gate) const in GetMark()
235 void Circuit::SetMark(GateRef gate, MarkCode mark) const in SetMark()
Dcircuit.h225 void SetMark(GateRef gate, MarkCode mark) const;
233 MarkCode GetMark(GateRef gate) const;
Dscheduler.cpp36 acc.SetMark(startGate, MarkCode::VISITED); in CalculateDominatorTree()
47 acc.IsState(*useIt) && acc.GetMark(*useIt) == MarkCode::NO_MARK) { in CalculateDominatorTree()
48 acc.SetMark(*useIt, MarkCode::VISITED); in CalculateDominatorTree()
Dgate_accessor.cpp31 MarkCode GateAccessor::GetMark(GateRef gate) const in GetMark()
36 void GateAccessor::SetMark(GateRef gate, MarkCode mark) in SetMark()
43 return GetMark(gate) == MarkCode::FINISHED; in IsFinished()
48 return GetMark(gate) == MarkCode::VISITED; in IsVisited()
53 return GetMark(gate) == MarkCode::PREVISIT; in IsPrevisit()
58 return GetMark(gate) == MarkCode::NO_MARK; in IsNotMarked()
63 SetMark(gate, MarkCode::FINISHED); in SetFinished()
68 SetMark(gate, MarkCode::VISITED); in SetVisited()
73 SetMark(gate, MarkCode::PREVISIT); in SetPrevisit()
Dgate.cpp922 MarkCode Gate::GetMark(TimeStamp stamp) const in GetMark()
924 return (stamp_ == stamp) ? mark_ : MarkCode::NO_MARK; in GetMark()
927 void Gate::SetMark(MarkCode mark, TimeStamp stamp) in SetMark()
Dgate_accessor.h514 MarkCode GetMark(GateRef gate) const;
515 void SetMark(GateRef gate, MarkCode mark);