Searched refs:p_next (Results 1 - 25 of 52) sorted by relevance

123

/freebsd-11-stable/contrib/libstdc++/include/ext/pb_ds/detail/rc_binomial_heap_/
H A Ddebug_fn_imps.hpp77 const_node_pointer p_next = p_nd->m_p_next_sibling; local
78 _GLIBCXX_DEBUG_ASSERT(p_next != NULL);
79 _GLIBCXX_DEBUG_ASSERT(p_nd->m_metadata == p_next->m_metadata);
80 _GLIBCXX_DEBUG_ASSERT(p_next->m_p_next_sibling == NULL ||
81 p_next->m_metadata < p_next->m_p_next_sibling->m_metadata);
97 node_pointer p_next = p_nd->m_p_next_sibling;
99 if (p_next == NULL)
102 if (p_nd->m_metadata == p_next->m_metadata)
105 return next_2_pointer(p_next);
[all...]
H A Dinsert_fn_imps.hpp102 node_pointer p_next = p_nd->m_p_next_sibling; local
104 _GLIBCXX_DEBUG_ASSERT(p_next != NULL);
105 _GLIBCXX_DEBUG_ASSERT(p_next->m_p_prev_or_parent == p_nd);
107 if (Cmp_Fn::operator()(p_nd->m_value, p_next->m_value))
109 p_next->m_p_prev_or_parent = p_nd->m_p_prev_or_parent;
111 if (p_next->m_p_prev_or_parent == NULL)
112 base_type::m_p_root = p_next;
114 p_next->m_p_prev_or_parent->m_p_next_sibling = p_next;
117 base_type::m_p_max = p_next;
[all...]
H A Derase_fn_imps.hpp75 node_pointer p_next = p_nd->m_p_next_sibling; local
76 if (p_next == NULL)
77 p_nd = p_next;
78 else if (p_nd->m_metadata == p_next->m_metadata)
80 else if (p_nd->m_metadata < p_next->m_metadata)
81 p_nd = p_next;
/freebsd-11-stable/contrib/libstdc++/include/ext/pb_ds/detail/list_update_map_/
H A Dfind_fn_imps.hpp64 entry_pointer p_next = p_l->m_p_next; local
65 if (s_eq_fn(r_key, PB_DS_V2F(p_next->m_value)))
67 if (apply_update(p_next, s_metadata_type_indicator))
69 p_l->m_p_next = p_next->m_p_next;
70 p_next->m_p_next = m_p_l;
71 m_p_l = p_next;
74 return p_next;
77 p_l = p_next;
H A Derase_fn_imps.hpp58 entry_pointer p_next = m_p_l->m_p_next; local
60 m_p_l = p_next;
94 entry_pointer p_next = m_p_l->m_p_next; local
97 m_p_l = p_next;
/freebsd-11-stable/contrib/libstdc++/include/ext/pb_ds/detail/pairing_heap_/
H A Derase_fn_imps.hpp158 forward_join(node_pointer p_nd, node_pointer p_next) argument
161 _GLIBCXX_DEBUG_ASSERT(p_nd->m_p_next_sibling == p_next);
162 if (Cmp_Fn::operator()(p_nd->m_value, p_next->m_value))
164 p_next->m_p_prev_or_parent = p_nd->m_p_prev_or_parent;
165 base_type::make_child_of(p_nd, p_next);
166 return p_next->m_p_next_sibling == NULL
167 ? p_next : p_next->m_p_next_sibling;
170 if (p_next->m_p_next_sibling != NULL)
172 p_next
187 back_join(node_pointer p_nd, node_pointer p_next) argument
224 node_pointer p_next = p_out->m_p_next_sibling; local
233 node_pointer p_next = p_cur->m_p_next_sibling; local
[all...]
H A Dsplit_join_fn_imps.hpp77 node_pointer p_next = p_out->m_p_next_sibling; local
83 p_out = p_next;
94 node_pointer p_next = p_cur->m_p_next_sibling; local
100 p_cur = p_next;
H A Dpairing_heap_.hpp200 forward_join(node_pointer p_nd, node_pointer p_next);
203 back_join(node_pointer p_nd, node_pointer p_next);
/freebsd-11-stable/contrib/libstdc++/include/ext/pb_ds/detail/thin_heap_/
H A Dsplit_join_fn_imps.hpp77 node_pointer p_next = p_out->m_p_next_sibling; local
81 p_out = p_next;
94 node_pointer p_next = p_cur->m_p_next_sibling; local
98 p_cur = p_next;
117 node_pointer p_next = p_other->m_p_next_sibling; local
121 p_other = p_next;
H A Derase_fn_imps.hpp264 node_pointer p_next = p_out->m_p_next_sibling; local
268 p_out = p_next;
277 node_pointer p_next = p_cur->m_p_next_sibling; local
281 p_cur = p_next;
/freebsd-11-stable/contrib/libstdc++/include/ext/pb_ds/detail/binomial_heap_base_/
H A Dinsert_fn_imps.hpp140 node_pointer p_next = p_nd->m_p_next_sibling; local
142 if (Cmp_Fn::operator()(p_nd->m_value, p_next->m_value))
144 p_next->m_p_prev_or_parent =
148 p_nd->m_p_prev_or_parent->m_p_next_sibling = p_next;
150 base_type::make_child_of(p_nd, p_next);
152 ++p_next->m_metadata;
154 p_nd = p_next;
158 p_nd->m_p_next_sibling = p_next->m_p_next_sibling;
161 p_next->m_p_next_sibling = NULL;
163 base_type::make_child_of(p_next, p_n
[all...]
H A Dsplit_join_fn_imps.hpp77 node_pointer p_next = p_out->m_p_next_sibling; local
92 p_out = p_next;
103 node_pointer p_next = p_cur->m_p_next_sibling; local
118 p_cur = p_next;
140 node_pointer p_next = p_other->m_p_next_sibling; local
144 p_other = p_next;
H A Derase_fn_imps.hpp161 node_pointer p_next = p_out->m_p_next_sibling; local
165 p_out = p_next;
174 node_pointer p_next = p_cur->m_p_next_sibling; local
189 p_cur = p_next;
/freebsd-11-stable/contrib/libstdc++/include/ext/pb_ds/detail/left_child_next_sibling_heap_/
H A Derase_fn_imps.hpp76 node_pointer p_next = p_nd->m_p_next_sibling; local
78 p_nd = p_next;
124 node_pointer p_next = p_cur->m_p_next_sibling; local
139 p_cur = p_next;
H A Dconst_iterator.hpp154 node_pointer p_next = base_type::m_p_nd; local
156 if (base_type::m_p_nd == NULL || base_type::m_p_nd->m_p_l_child == p_next)
/freebsd-11-stable/contrib/less/
H A Doutput.c100 char *anchor, *p, *p_next; local
130 for (anchor = p_next = obuf;
131 (p_next = memchr(p_next, ESC, ob - p_next)) != NULL; )
133 p = p_next;
155 anchor = p_next = p;
164 p_next = p;
194 p_next = q;
283 if (!is_ansi_end(*p) || p == p_next)
[all...]
/freebsd-11-stable/contrib/ofed/opensm/opensm/
H A Dosm_prtn.c310 cl_map_item_t *p_next; local
313 p_next = cl_qmap_head(&p_subn->prtn_pkey_tbl);
314 while (p_next != cl_qmap_end(&p_subn->prtn_pkey_tbl)) {
315 p = (osm_prtn_t *) p_next;
316 p_next = cl_qmap_next(&p->map_item);
393 cl_map_item_t *p_next; local
407 p_next = cl_qmap_head(&p_subn->prtn_pkey_tbl);
408 while (p_next != cl_qmap_end(&p_subn->prtn_pkey_tbl)) {
409 p = (osm_prtn_t *) p_next;
410 p_next
[all...]
H A Dosm_db_pack.c65 char *p_next; local
71 p_num = strtok_r(lids_str, " \t", &p_next);
80 p_num = strtok_r(NULL, " \t", &p_next);
111 char *p_num, *p_next; local
116 p_num = strtok_r(tmp_str, ":", &p_next);
122 p_num = strtok_r(NULL, ":", &p_next);
H A Dosm_pkey_mgr.c813 cl_map_item_t *p_next; local
837 p_next = cl_qmap_head(p_tbl);
838 while (p_next != cl_qmap_end(p_tbl)) {
839 p_prtn = (osm_prtn_t *) p_next;
840 p_next = cl_qmap_next(p_next);
849 p_next = cl_qmap_head(p_tbl);
850 while (p_next != cl_qmap_end(p_tbl)) {
851 p_port = (osm_port_t *) p_next;
852 p_next
[all...]
/freebsd-11-stable/contrib/ofed/opensm/include/complib/
H A Dcl_qlist.h117 struct _cl_list_item *p_next; member in struct:_cl_list_item
125 * p_next
291 p_new_item->p_next = p_list_item;
294 p_new_item->p_prev->p_next = p_new_item;
325 p_list_item->p_next->p_prev = p_list_item->p_prev;
327 p_list_item->p_prev->p_next = p_list_item->p_next;
331 if (p_list_item != p_list_item->p_next) {
332 p_list_item->p_next = NULL;
416 p_list->end.p_next
[all...]
H A Dcl_fleximap.h459 return ((cl_fmap_item_t *) p_map->nil.pool_item.list_item.p_next);
531 return ((cl_fmap_item_t *) p_item->pool_item.list_item.p_next);
804 p_map->nil.pool_item.list_item.p_next = &p_map->nil.pool_item.list_item;
H A Dcl_qmap.h532 return ((cl_map_item_t *) p_map->nil.pool_item.list_item.p_next);
603 return ((cl_map_item_t *) p_item->pool_item.list_item.p_next);
836 p_map->nil.pool_item.list_item.p_next = &p_map->nil.pool_item.list_item;
/freebsd-11-stable/sys/dev/qlnx/qlnxe/
H A Decore_chain.h334 struct ecore_chain_next *p_next = OSAL_NULL; local
339 p_next = (struct ecore_chain_next *)(*p_next_elem);
340 *p_next_elem = p_next->next_virt;
701 struct ecore_chain_next *p_next; local
705 p_next = (struct ecore_chain_next *)((u8 *)p_virt_curr + size);
707 DMA_REGPAIR_LE(p_next->next_phys, p_phys_next);
709 p_next->next_virt = p_virt_next;
723 struct ecore_chain_next *p_next = OSAL_NULL; local
734 p_next = (struct ecore_chain_next *)((u8 *)p_virt_addr + size);
735 while (p_next
[all...]
/freebsd-11-stable/contrib/tcsh/
H A Dsh.proc.c274 for (pp = proclist.p_next; pp != NULL; pp = pp->p_next)
430 for (pp = proclist.p_next; pp != NULL; pp = pp->p_next) {
467 for (pp = (fp = &proclist)->p_next; pp != NULL; pp = (fp = pp)->p_next)
469 fp->p_next = pp->p_next;
627 for (pp = proclist.p_next; pp; pp = pp->p_next)
[all...]
H A Dsh.proc.h47 struct process *p_next; /* next in global "proclist" */ member in struct:process

Completed in 138 milliseconds

123