Searched refs:kUnvisited (Results 1 – 10 of 10) sorted by relevance
| /third_party/node/deps/v8/src/compiler/ |
| D | escape-analysis.h | 56 DCHECK_EQ(State::kUnvisited, state_.Get(node)); in AddRoot()
71 enum class State : uint8_t { kUnvisited = 0, kRevisit, kOnStack, kVisited }; enumerator
|
| D | decompression-optimizer.cc | 157 DCHECK_NE(state, State::kUnvisited); in MaybeMarkAndQueueForRevisit()
160 if (previous_state == State::kUnvisited || in MaybeMarkAndQueueForRevisit()
|
| D | decompression-optimizer.h | 57 kUnvisited = 0, enumerator
|
| D | int64-lowering.h | 47 enum class State : uint8_t { kUnvisited, kOnStack, kVisited }; enumerator
|
| D | graph-reducer.cc | 23 kUnvisited, enumerator
|
| D | graph-visualizer.cc | 824 const int kUnvisited = 0; variable
845 ZoneVector<byte> state(ar.graph.NodeCount(), kUnvisited, &local_zone); in operator <<()
854 if (state[i->id()] == kUnvisited) { in operator <<()
|
| D | int64-lowering.cc | 34 state_(graph->NodeCount(), State::kUnvisited), in Int64Lowering()
63 if (state_[input->id()] == State::kUnvisited) { in LowerGraph()
|
| D | escape-analysis.cc | 324 case State::kUnvisited: in ReduceFrom()
|
| D | pipeline.cc | 2833 constexpr byte kUnvisited = 0; in HashGraphForPGO() local
2847 ZoneVector<byte> state(graph->NodeCount(), kUnvisited, &local_zone); in HashGraphForPGO()
2862 if (state[i->id()] == kUnvisited) { in HashGraphForPGO()
|
| D | simplified-lowering.cc | 298 void reset_state() { state_ = kUnvisited; } in reset_state()
302 bool unvisited() const { return state_ == kUnvisited; } in unvisited()
319 enum State : uint8_t { kUnvisited, kPushed, kVisited, kQueued }; enumerator
320 State state_ = kUnvisited;
|