Searched refs:kVisited (Results 1 – 17 of 17) sorted by relevance
| /external/tensorflow/tensorflow/compiler/xla/service/ |
| D | hlo_module_group_util.cc | 269 if ((*visit_state)[hlo] == VisitState::kVisited) { in VisitTopologicalOrder()
272 TF_RET_CHECK((*visit_state)[instruction] == VisitState::kVisited); in VisitTopologicalOrder()
284 (*visit_state)[instruction] = VisitState::kVisited; in VisitTopologicalOrder()
341 TF_RET_CHECK(state.second == VisitState::kVisited); in VerifyComputations()
|
| D | dfs_hlo_visitor.cc | 61 visit_state_[instruction.unique_id()] = VisitState::kVisited; in SetVisited()
|
| D | hlo_module_group_util.h | 65 kVisited, enumerator
|
| D | dfs_hlo_visitor.h | 275 kVisited = 2, enumerator
315 return GetVisitState(instruction) == kVisited; in DidVisit()
|
| D | hlo_computation.cc | 326 if (it->second == kVisited) { in ComputeInstructionPostOrder()
335 it->second = kVisited; in ComputeInstructionPostOrder()
977 if (it->second == kVisited) { in CloneWithReplacements()
982 it->second = kVisited; in CloneWithReplacements()
|
| D | indexed_array_analysis.cc | 97 enum DfsState { kDiscovered, kVisited }; in TraverseAndPopulateCache() enumerator
120 dfs_state_map[instr] = kVisited; in TraverseAndPopulateCache()
124 case kVisited: in TraverseAndPopulateCache()
|
| D | hlo_computation.h | 448 enum VisitState { kVisiting, kVisited }; enumerator
|
| D | hlo_instruction.cc | 2696 case Visitor::kVisited: in PushDFSChild()
2733 if (visit_state == Visitor::kVisited) { in PostOrderDFS()
2746 visitor->SetVisitState(current_id, Visitor::kVisited); in PostOrderDFS()
|
| /external/v8/src/compiler/ |
| D | graph-reducer.cc | 22 kVisited enumerator
264 state_.Set(node, State::kVisited); in Pop()
284 if (state_.Get(node) == State::kVisited) { in Revisit()
|
| D | escape-analysis.h | 65 enum class State : uint8_t { kUnvisited = 0, kRevisit, kOnStack, kVisited }; enumerator
66 const uint8_t kNumStates = static_cast<uint8_t>(State::kVisited) + 1;
|
| D | int64-lowering.h | 35 enum class State : uint8_t { kUnvisited, kOnStack, kVisited }; enumerator
|
| D | simd-scalar-lowering.h | 33 enum class State : uint8_t { kUnvisited, kOnStack, kVisited }; enumerator
|
| D | escape-analysis.cc | 300 case State::kVisited: in ReduceFrom()
327 state_.Set(current, State::kVisited); in ReduceFrom()
344 if (state_.Get(node) == State::kVisited) { in Revisit()
|
| D | graph-visualizer.cc | 816 const int kVisited = 2; variable
852 state[n->id()] = kVisited; in operator <<()
|
| D | int64-lowering.cc | 55 state_.Set(top.node, State::kVisited); in LowerGraph()
|
| D | simplified-lowering.cc | 258 void set_visited() { state_ = kVisited; } in set_visited()
261 bool visited() const { return state_ == kVisited; } in visited()
278 enum State : uint8_t { kUnvisited, kPushed, kVisited, kQueued }; enumerator
|
| D | simd-scalar-lowering.cc | 54 state_.Set(top.node, State::kVisited); in LowerGraph()
|