Home
last modified time | relevance | path

Searched refs:kVisited (Results 1 – 8 of 8) sorted by relevance

/third_party/node/deps/v8/src/compiler/
Dgraph-reducer.cc26 kVisited enumerator
187 DCHECK_IMPLIES(user == node, state_.Get(node) != State::kVisited); in ReduceTop()
291 state_.Set(node, State::kVisited); in Pop()
311 if (state_.Get(node) == State::kVisited) { in Revisit()
Descape-analysis.h71 enum class State : uint8_t { kUnvisited = 0, kRevisit, kOnStack, kVisited }; enumerator
72 const uint8_t kNumStates = static_cast<uint8_t>(State::kVisited) + 1;
Dint64-lowering.h47 enum class State : uint8_t { kUnvisited, kOnStack, kVisited }; enumerator
Descape-analysis.cc317 case State::kVisited: in ReduceFrom()
344 state_.Set(current, State::kVisited); in ReduceFrom()
361 if (state_.Get(node) == State::kVisited) { in Revisit()
Dgraph-visualizer.cc826 const int kVisited = 2; variable
862 state[n->id()] = kVisited; in operator <<()
Dint64-lowering.cc58 state_[top.node->id()] = State::kVisited; in LowerGraph()
Dsimplified-lowering.cc296 void set_visited() { state_ = kVisited; } in set_visited()
299 bool visited() const { return state_ == kVisited; } in visited()
319 enum State : uint8_t { kUnvisited, kPushed, kVisited, kQueued }; enumerator
Dpipeline.cc2835 constexpr byte kVisited = 2; in HashGraphForPGO() local
2871 state[n->id()] = kVisited; in HashGraphForPGO()