Searched refs:kVisited (Results 1 – 8 of 8) sorted by relevance
/third_party/node/deps/v8/src/compiler/ |
D | graph-reducer.cc | 26 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()
|
D | escape-analysis.h | 71 enum class State : uint8_t { kUnvisited = 0, kRevisit, kOnStack, kVisited }; enumerator 72 const uint8_t kNumStates = static_cast<uint8_t>(State::kVisited) + 1;
|
D | int64-lowering.h | 47 enum class State : uint8_t { kUnvisited, kOnStack, kVisited }; enumerator
|
D | escape-analysis.cc | 317 case State::kVisited: in ReduceFrom() 344 state_.Set(current, State::kVisited); in ReduceFrom() 361 if (state_.Get(node) == State::kVisited) { in Revisit()
|
D | graph-visualizer.cc | 826 const int kVisited = 2; variable 862 state[n->id()] = kVisited; in operator <<()
|
D | int64-lowering.cc | 58 state_[top.node->id()] = State::kVisited; in LowerGraph()
|
D | simplified-lowering.cc | 296 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
|
D | pipeline.cc | 2835 constexpr byte kVisited = 2; in HashGraphForPGO() local 2871 state[n->id()] = kVisited; in HashGraphForPGO()
|