Home
last modified time | relevance | path

Searched refs:NodeState (Results 1 – 23 of 23) sorted by relevance

/external/tensorflow/tensorflow/core/grappler/utils/
Dtraversal.cc41 enum class NodeState { kNotVisited, kVisiting, kDone }; enum
61 absl::flat_hash_map<int, NodeState> node_state; in DfsTraversal()
66 NodeState& state = node_state[w.node]; in DfsTraversal()
67 if (state == NodeState::kDone) continue; in DfsTraversal()
71 state = NodeState::kDone; in DfsTraversal()
77 state = NodeState::kDone; in DfsTraversal()
85 if (state == NodeState::kVisiting) { in DfsTraversal()
93 state = NodeState::kVisiting; in DfsTraversal()
/external/tensorflow/tensorflow/core/grappler/costs/
Dvirtual_scheduler.h35 struct NodeState { struct
83 NodeState() { in NodeState() function
159 const std::unordered_map<const NodeDef*, NodeState>* node_map) { in Init()
213 const std::unordered_map<const NodeDef*, NodeState>* node_map) override;
238 const std::unordered_map<const NodeDef*, NodeState>* node_map_;
285 const std::unordered_map<const NodeDef*, NodeState>* node_map) override;
303 const std::unordered_map<const NodeDef*, NodeState>* node_map_;
355 const std::unordered_map<const NodeDef*, NodeState>* GetNodeStates() const { in GetNodeStates()
364 NodeState& GetNodeStateOrCreateIt(const NodeDef* node);
378 std::unordered_map<const NodeDef*, NodeState> node_map_;
Dvirtual_scheduler.cc92 const NodeState& node_state, in UpdateDeviceAnnotationState()
139 const std::unordered_map<const NodeDef*, NodeState>* node_map) { in Init()
187 const std::unordered_map<const NodeDef*, NodeState>* node_map, in FirstReadyCmp()
239 const std::unordered_map<const NodeDef*, NodeState>* node_map) { in Init()
727 NodeState& VirtualScheduler::GetNodeStateOrCreateIt(const NodeDef* node) { in GetNodeStateOrCreateIt()
736 it = node_map_.emplace(node, NodeState()).first; in GetNodeStateOrCreateIt()
1128 const NodeState& nodestate = node_map_.at(node_def); in GenerateRunMetadata()
Dvirtual_scheduler_test.cc60 node_states_[node] = NodeState(); in NodeSetUp()
66 std::unordered_map<const NodeDef*, NodeState> node_states_;
2547 const NodeState* bn_node = nullptr; in TEST_F()
2548 const NodeState* x_node = nullptr; in TEST_F()
2551 const NodeState& node_state = nodedef_node_state.second; in TEST_F()
/external/tensorflow/tensorflow/core/common_runtime/eager/
Deager_executor.cc119 item->state = NodeState::kPENDING; in AddOrExecute()
204 DCHECK(item->state != NodeState::kDONE); in NodeDone()
205 item->state = NodeState::kDONE; in NodeDone()
337 item->state = NodeState::kSCHEDULED; in RunItem()
Deager_executor.h154 enum class NodeState { enum
165 NodeState state;
/external/v8/src/compiler/
Dint64-lowering.h80 struct NodeState { struct
90 ZoneDeque<NodeState> stack_; argument
Dgraph-reducer.h156 struct NodeState { in NON_EXPORTED_BASE() struct
193 ZoneStack<NodeState> stack_; in NON_EXPORTED_BASE()
Dsimd-scalar-lowering.h58 struct NodeState { struct
127 ZoneDeque<NodeState> stack_;
Descape-analysis.h66 struct NodeState { struct
76 ZoneStack<NodeState> stack_; argument
Dgraph-reducer.cc136 NodeState& entry = stack_.top(); in ReduceTop()
Dint64-lowering.cc54 NodeState& top = stack_.back(); in LowerGraph()
Dsimplified-lowering.cc536 ZoneStack<NodeState> stack(zone_); in GenerateTraversal()
541 NodeState& current = stack.top(); in GenerateTraversal()
3842 struct NodeState { struct in v8::internal::compiler::RepresentationSelector
Dsimd-scalar-lowering.cc84 NodeState& top = stack_.back(); in LowerGraph()
/external/tensorflow/tensorflow/core/common_runtime/
Dpending_counts.h51 enum NodeState { enum
109 NodeState node_state(Handle h) { in node_state()
283 NodeState NodeStateForStruct(T* c) const { in NodeStateForStruct()
Dexecutor.cc1026 PendingCounts::NodeState node_state(PendingCounts::Handle h) { in node_state()
/external/v8/src/handles/
Dglobal-handles.cc409 STATIC_ASSERT(static_cast<int>(NodeState::kMask) == in Node()
429 State state() const { return NodeState::decode(flags_); } in state()
430 void set_state(State state) { flags_ = NodeState::update(flags_, state); } in set_state()
614 using NodeState = base::BitField8<State, 0, 3>; typedef in v8::internal::GlobalHandles::Node
615 using IsInYoungList = NodeState::Next<bool, 1>;
639 State state() const { return NodeState::decode(flags_); } in state()
640 void set_state(State state) { flags_ = NodeState::update(flags_, state); } in set_state()
705 using NodeState = base::BitField8<State, 0, 2>; typedef in v8::internal::GlobalHandles::TracedNode
706 using IsInYoungList = NodeState::Next<bool, 1>;
/external/llvm/include/llvm/Object/
DMachO.h81 struct NodeState { struct
82 NodeState(const uint8_t *Ptr);
97 SmallVector<NodeState, 16> Stack; argument
/external/tensorflow/tensorflow/core/grappler/optimizers/
Dauto_mixed_precision.cc736 enum class NodeState { kNotVisited, kVisiting, kDone }; enum
755 absl::flat_hash_map<int, NodeState> node_state; in DfsTypeTraversal()
760 NodeState& state = node_state[w.node]; in DfsTypeTraversal()
761 if (state == NodeState::kDone) continue; in DfsTypeTraversal()
765 state = NodeState::kDone; in DfsTypeTraversal()
771 state = NodeState::kDone; in DfsTypeTraversal()
779 if (state == NodeState::kVisiting) { in DfsTypeTraversal()
786 state = NodeState::kVisiting; in DfsTypeTraversal()
/external/swiftshader/third_party/llvm-7.0/llvm/include/llvm/Object/
DMachO.h98 struct NodeState { struct
99 NodeState(const uint8_t *Ptr);
112 using NodeList = SmallVector<NodeState, 16>; argument
/external/tensorflow/tensorflow/core/nccl/
Dnccl_manager_test.cc296 struct NodeState { struct in tensorflow::NcclManagerTest
304 std::vector<NodeState> node_states(num_nodes); in RunMultiNodeAllReduceTest()
362 std::vector<NodeState> node_states(num_nodes); in RunMultiNodeBroadcastTest()
/external/llvm/lib/Object/
DMachOObjectFile.cpp1405 ExportEntry::NodeState::NodeState(const uint8_t *Ptr) in NodeState() function in ExportEntry::NodeState
1412 NodeState State(Ptr); in pushNode()
1437 NodeState &Top = Stack.back(); in pushDownUntilBottom()
1478 NodeState &Top = Stack.back(); in moveNext()
/external/swiftshader/third_party/llvm-7.0/llvm/lib/Object/
DMachOObjectFile.cpp2782 ExportEntry::NodeState::NodeState(const uint8_t *Ptr) in NodeState() function in ExportEntry::NodeState
2788 NodeState State(Ptr); in pushNode()
2924 NodeState &Top = Stack.back(); in pushDownUntilBottom()
2947 for (const NodeState &node : nodes()) { in pushDownUntilBottom()
2998 NodeState &Top = Stack.back(); in moveNext()