Searched refs:seen_ (Results 1 – 16 of 16) sorted by relevance
55 StringBufTesterBase() : seen_(false), handler_data_val_(0) {} in StringBufTesterBase()63 ASSERT(!seen_); in CallAndVerify()68 ASSERT(seen_); in CallAndVerify()75 bool seen_; member in StringBufTesterBase105 seen_ = true; in Handler()124 seen_ = true; in Handler()143 seen_ = true; in Handler()164 seen_ = true; in Handler()182 t->seen_ = true; in Handler()202 t->seen_ = true; in Handler()[all …]
44 if (circle_node->seen_ == seen) { in DumpSortingCircleList()68 if (node->seen_ == seen) { // We use seen_ as checking flag in TopoSort()76 node->seen_ = seen; in TopoSort()83 if (next->seen_ != seen) { in TopoSort()112 if (item->seen_ == seen) { in BroadFirstSearchGraphCNodes()119 item->seen_ = seen; in BroadFirstSearchGraphCNodes()138 if (item->seen_ == seen) { in BroadFirstSearchFirstOf()145 item->seen_ = seen; in BroadFirstSearchFirstOf()161 if (item.first->seen_ == seen) { in BroadFirstSearchGraphUsed()165 item.first->seen_ = seen; in BroadFirstSearchGraphUsed()
47 seen_ = NewSeenGeneration(); in Search()54 if (node->seen_ == seen_) { in Visit()58 node->seen_ = seen_; in Visit()73 size_t seen_{0}; member in mindspore::__anon741a37940111::DeepFirstSearcher
508 if (auto ret = fg->get_return(); ret != nullptr && ret->seen_ != seen) { in FollowGraph()521 if (node->seen_ == seen) { in AcquireNodes()524 node->seen_ = seen; in AcquireNodes()863 if (gt->seen_ == 1) { in SeekParents()866 gt->seen_ = 1; in SeekParents()868 gt->seen_ = 0; in SeekParents()878 fg->seen_ = 1; in RealRecompute()880 fg->seen_ = 0; in RealRecompute()1060 if (fg->seen_ == seen_num) { in SeekJ()1073 return func_graph->seen_ != seen_num; in SeekJ()[all …]
281 if (n == nullptr || n->seen_ == seen || n == skip_input) { in GetMonadState()284 n->seen_ = seen; in GetMonadState()
369 size_t seen_; variable
40 seen_(0), in FuncGraph()
171 size_t seen_{0};
102 auto it = seen_.find(value); in TrackField()103 if (it != seen_.end()) { in TrackField()276 auto it = seen_.find(retainer); in Track()277 if (it != seen_.end()) { in Track()304 auto it = seen_.find(retainer); in AddNode()305 if (it != seen_.end()) { in AddNode()311 seen_[retainer] = n; in AddNode()
279 NodeMap seen_; variable
182 if (use_node->seen_ == seen) { in UpdateTransformingListWithUserNodes()183 use_node->seen_--; in UpdateTransformingListWithUserNodes()203 … if (node == nullptr || node->seen_ == seen || !isTraversable(node) || !all_nodes.contains(node)) { in ApplyIRToSubstitutions()206 node->seen_ = seen; in ApplyIRToSubstitutions()243 … if (node == nullptr || node->seen_ == seen || !isTraversable(node) || !all_nodes.contains(node)) { in ApplySubstitutionToIR()246 node->seen_ = seen; in ApplySubstitutionToIR()
55 const std::unordered_set<AnfNodePtr> &seen() const { return seen_; } in seen()56 void AddSeen(const AnfNodePtr &node) { (void)seen_.insert(node); } in AddSeen()68 std::unordered_set<AnfNodePtr> seen_; variable
277 user_cnode->seen_ = seen; in IsDependOn()287 if (input->seen_ == seen) { in IsDependOn()297 input_cnode->seen_ = seen; in IsDependOn()
220 ++seen_; in Dfs()253 if (clusters_[cluster_id].seed_ >= seen_) return; in DepthFirstSearch()254 clusters_[cluster_id].seed_ = seen_; in DepthFirstSearch()266 size_t seen_{0}; member in mindspore::opt::Graph
85 if (cnode->seen_ == seen) { in ExistRoute()93 cnode->seen_ = seen; in ExistRoute()
976 #define TC_CSO_SHADER_TRACK(name) TC_CSO(name, shader, tc->seen_##name = true;)