Lines Matching refs:StateValuesAccess

235   DCHECK_EQ(count, StateValuesAccess(tree).size());  in CheckTreeContainsValues()
238   auto access = StateValuesAccess(tree);  in CheckTreeContainsValues()
307 StateValuesAccess::iterator::iterator(Node* node) : current_depth_(0) {  in iterator()
313 SparseInputMask::InputIterator* StateValuesAccess::iterator::Top() {  in Top()
319 void StateValuesAccess::iterator::Push(Node* node) {  in Push()
327 void StateValuesAccess::iterator::Pop() {  in Pop()
333 bool StateValuesAccess::iterator::done() { return current_depth_ < 0; }  in done()
336 void StateValuesAccess::iterator::Advance() {  in Advance()
341 void StateValuesAccess::iterator::EnsureValid() {  in EnsureValid()
377 Node* StateValuesAccess::iterator::node() { return Top()->Get(nullptr); }  in node()
379 MachineType StateValuesAccess::iterator::type() {  in type()
396 bool StateValuesAccess::iterator::operator!=(iterator& other) {  in operator !=()
403 StateValuesAccess::iterator& StateValuesAccess::iterator::operator++() {  in operator ++()
409 StateValuesAccess::TypedNode StateValuesAccess::iterator::operator*() {  in operator *()
414 size_t StateValuesAccess::size() {  in size()
427         count += StateValuesAccess(value).size();  in size()