Searched refs:m_entry (Results 1 – 9 of 9) sorted by relevance
78 const struct map_entry *me = citer.m_entry; in atf_map_citer_key()108 return i1.m_map == i2.m_map && i1.m_entry == i2.m_entry; in atf_equal_map_citer_map_citer()122 const struct map_entry *me = iter.m_entry; in atf_map_iter_key()130 const struct map_entry *me = iter.m_entry; in atf_map_iter_data()142 newiter.m_entry = ((struct map_entry *) in atf_map_iter_next()152 return i1.m_map == i2.m_map && i1.m_entry == i2.m_entry; in atf_equal_map_iter_map_iter()246 iter.m_entry = NULL; in atf_map_end()256 iter.m_entry = NULL; in atf_map_end_c()272 i.m_entry = me; in atf_map_find()292 i.m_entry = me; in atf_map_find_c()[all …]
52 iter.m_entry = le; in entry_to_citer()62 iter.m_entry = le; in entry_to_iter()123 const struct list_entry *le = citer.m_entry; in atf_list_citer_data()131 const struct list_entry *le = citer.m_entry; in atf_list_citer_next()137 newciter.m_entry = le->m_next; in atf_list_citer_next()146 return i1.m_list == i2.m_list && i1.m_entry == i2.m_entry; in atf_equal_list_citer_list_citer()160 const struct list_entry *le = iter.m_entry; in atf_list_iter_data()168 const struct list_entry *le = iter.m_entry; in atf_list_iter_next()174 newiter.m_entry = le->m_next; in atf_list_iter_next()183 return i1.m_list == i2.m_list && i1.m_entry == i2.m_entry; in atf_equal_list_iter_list_iter()
41 const void *m_entry; member61 void *m_entry; member
41 const void *m_entry; member59 void *m_entry; member
249 ATF_CHECK(end1.m_entry != end2.m_entry); in ATF_TC_BODY()252 ATF_CHECK(atf_list_end_c(&l1).m_entry == end2.m_entry); in ATF_TC_BODY()
92 : m_entry(rhs.m_entry), m_max_depth(rhs.m_max_depth), m_error(false) {} in MapIterator()111 return m_entry.GetEntry(); in advance()116 if (m_entry.null()) in next()118 MapEntry right(m_entry.right()); in next()120 m_entry = tree_min(std::move(right)); in next()124 while (!is_left_child(m_entry)) { in next()125 if (m_entry.error()) { in next()129 m_entry.SetEntry(m_entry.parent()); in next()132 m_entry = MapEntry(); in next()136 m_entry = MapEntry(m_entry.parent()); in next()[all …]
75 ListIterator(ListEntry entry) : m_entry(std::move(entry)) {} in ListIterator()77 ListIterator(ValueObject *entry) : m_entry(entry) {} in ListIterator()79 ValueObjectSP value() { return m_entry.GetEntry(); } in value()83 return m_entry.GetEntry(); in advance()86 return m_entry.GetEntry(); in advance()91 if (m_entry.null()) in advance()94 return m_entry.GetEntry(); in advance()98 return (rhs.m_entry == m_entry); in operator ==()102 void next() { m_entry = m_entry.next(); } in next()104 void prev() { m_entry = m_entry.prev(); } in prev()[all …]
54 struct mtree_entry *m_entry; member576 ac->m_entry = me; in attr_counter_new()776 struct mtree_entry **m_entry) in mtree_entry_new() argument789 *m_entry = NULL; in mtree_entry_new()796 *m_entry = NULL; in mtree_entry_new()828 *m_entry = NULL; in mtree_entry_new()841 *m_entry = NULL; in mtree_entry_new()847 *m_entry = me; in mtree_entry_new()1886 *m_entry = NULL; in mtree_entry_create_virtual_dir()1898 *m_entry = NULL; in mtree_entry_create_virtual_dir()[all …]
1780 if (m_entry->vsi_count < 2 && !m_entry->vsi_list_info) { in ice_add_update_vsi_list()1813 m_entry->vsi_list_info = in ice_add_update_vsi_list()1817 if (!m_entry->vsi_list_info) in ice_add_update_vsi_list()1826 m_entry->sw_marker_id, in ice_add_update_vsi_list()1827 m_entry->lg_act_idx); in ice_add_update_vsi_list()1832 if (!m_entry->vsi_list_info) in ice_add_update_vsi_list()1854 m_entry->vsi_count++; in ice_add_update_vsi_list()1974 if (!m_entry) { in ice_add_rule_internal()1979 cur_fltr = &m_entry->fltr_info; in ice_add_rule_internal()3845 if (!m_entry) in ice_add_mac_with_sw_marker()[all …]