Searched refs:m_stack (Results 1 – 7 of 7) sorted by relevance
608 imp->m_stack.push_back(std::move(dir_it)); in recursive_directory_iterator_construct()610 imp->m_stack.push_back(dir_it); in recursive_directory_iterator_construct()631 imp->m_stack.pop_back(); in recursive_directory_iterator_pop_on_error()633 while (!imp->m_stack.empty()) in recursive_directory_iterator_pop_on_error()635 directory_iterator& dir_it = imp->m_stack.back(); in recursive_directory_iterator_pop_on_error()641 imp->m_stack.pop_back(); in recursive_directory_iterator_pop_on_error()656 imp->m_stack.pop_back(); in recursive_directory_iterator_pop()660 if (imp->m_stack.empty()) in recursive_directory_iterator_pop()666 directory_iterator& dir_it = imp->m_stack.back(); in recursive_directory_iterator_pop()680 if (imp->m_stack.empty()) in recursive_directory_iterator_pop()[all …]
377 Object[] m_stack = new Object[max]; field in NamespaceMappings.Stack383 clone.m_stack = new Object[clone.max]; in clone()387 clone.m_stack[i] = this.m_stack[i]; in clone()401 System.arraycopy(m_stack,0, newArray, 0, max); in push()403 m_stack = newArray; in push()405 m_stack[top] = o; in push()412 o = m_stack[top]; in pop()424 o = m_stack[top]; in peek()432 return m_stack[idx]; in peek()444 m_stack[i] = null; in clear()[all …]
72 m_stack[head_idx].ret_addr = addr; in push()73 m_stack[head_idx].ret_isa = isa; in push()89 addr = m_stack[head_idx].ret_addr; in pop()90 isa = m_stack[head_idx].ret_isa; in pop()
50 vector<ConstValueRangeAccess> m_stack; member in rsg::SubValueRangeIterator55 m_stack.push_back(valueRange); in SubValueRangeIterator()60 return !m_stack.empty(); in hasItem()65 return m_stack[m_stack.size() - 1]; in getItem()71 m_stack.pop_back(); // Remove current in next()79 m_stack.push_back(curItem.member(ndx)); in next()87 m_stack.push_back(curItem.member(ndx)); in next()
414 std::vector< element_type > m_stack; member507 return static_cast< int >(m_imp->m_stack.size() - 1u); in depth()548 return m_imp->m_stack.back()->status(); in status()554 return m_imp->m_stack.back()->symlink_status(); in symlink_status()565 return *m_imp->m_stack.back(); in dereference()579 return !m_imp || m_imp->m_stack.empty(); in is_end()
100 retStackElement m_stack[16]; variable
594 } m_stack SEC(".maps");598 struct bpf_queue_stack *stack = (struct bpf_queue_stack *)&m_stack; in check_stack()599 struct bpf_map *map = (struct bpf_map *)&m_stack; in check_stack()