Lines Matching refs:current
163 StateBase* current = this;
165 while (current->visibility_dependency_ &&
166 current->visibility_dependency_ != current) {
167 DCHECK_EQ(Visibility::kDependentVisibility, current->visibility_);
168 dependencies.push_back(current);
169 current = current->visibility_dependency_;
172 auto* new_visibility_dependency = current;
173 if (current->visibility_ == Visibility::kVisible) {
183 current->visibility_ = new_visibility;
184 current->visibility_dependency_ = new_visibility_dependency;
189 return current;
444 auto& current = states_.GetExistingState(header);
445 if (!current.IsVisibleNotDependent()) return;
452 if (!current.get_node()) {
453 current.set_node(AddNode(header));
457 graph_.AddEdge(parent.get_node(), current.get_node(),
460 graph_.AddEdge(parent.get_node(), current.get_node());
726 WorkstackItemBase(State* parent, State& current)
727 : parent_(parent), current_(current) {}
749 VisitationDoneItem(State* parent, State& current)
750 : WorkstackItemBase(parent, current) {}
761 VisitationItem(State* parent, State& current)
762 : WorkstackItemBase(parent, current) {}
782 auto& current = states_.GetOrCreateState(header);
784 if (current.IsVisited()) {
788 parent->MarkDependentVisibility(¤t);
793 current.MarkVisited();
795 current.MarkPending();
797 new VisitationItem(parent, current)});
800 current.MarkVisible();
851 State& current = states_.GetExistingState(header);
852 if (!current.IsVisibleNotDependent()) return;
854 AddRootEdge(root, current, loc.ToString());