/netbsd/external/gpl3/gcc.old/dist/libstdc++-v3/include/ext/pb_ds/detail/pairing_heap_/ |
H A D | erase_fn_imps.hpp | 158 base_type::make_child_of(p_nd, p_next); in forward_join() 159 return p_next->m_p_next_sibling == 0 in forward_join() 160 ? p_next : p_next->m_p_next_sibling; in forward_join() 163 if (p_next->m_p_next_sibling != 0) in forward_join() 167 base_type::make_child_of(p_next, p_nd); in forward_join() 172 base_type::make_child_of(p_next, p_nd); in forward_join() 188 base_type::make_child_of(p_nd, p_next); in back_join() 190 return p_next; in back_join() 194 base_type::make_child_of(p_next, p_nd); in back_join() 219 p_out = p_next; in erase_if() [all …]
|
H A D | split_join_fn_imps.hpp | 68 node_pointer p_next = p_out->m_p_next_sibling; in split() local 72 p_out = p_next; in split() 80 node_pointer p_next = p_cur->m_p_next_sibling; in split() local 84 p_cur = p_next; in split()
|
/netbsd/external/gpl3/gcc/dist/libstdc++-v3/include/ext/pb_ds/detail/pairing_heap_/ |
H A D | erase_fn_imps.hpp | 158 base_type::make_child_of(p_nd, p_next); in forward_join() 159 return p_next->m_p_next_sibling == 0 in forward_join() 160 ? p_next : p_next->m_p_next_sibling; in forward_join() 163 if (p_next->m_p_next_sibling != 0) in forward_join() 167 base_type::make_child_of(p_next, p_nd); in forward_join() 172 base_type::make_child_of(p_next, p_nd); in forward_join() 188 base_type::make_child_of(p_nd, p_next); in back_join() 190 return p_next; in back_join() 194 base_type::make_child_of(p_next, p_nd); in back_join() 219 p_out = p_next; in erase_if() [all …]
|
H A D | split_join_fn_imps.hpp | 68 node_pointer p_next = p_out->m_p_next_sibling; in split() local 72 p_out = p_next; in split() 80 node_pointer p_next = p_cur->m_p_next_sibling; in split() local 84 p_cur = p_next; in split()
|
/netbsd/external/gpl3/gcc.old/dist/libstdc++-v3/include/ext/pb_ds/detail/rc_binomial_heap_/ |
H A D | debug_fn_imps.hpp | 74 PB_DS_DEBUG_VERIFY(p_next != 0); in assert_valid() 77 p_next->m_metadata < p_next->m_p_next_sibling->m_metadata); in assert_valid() 93 node_pointer p_next = p_nd->m_p_next_sibling; in next_2_pointer() local 95 if (p_next == 0) in next_2_pointer() 98 if (p_nd->m_metadata == p_next->m_metadata) in next_2_pointer() 101 return next_2_pointer(p_next); in next_2_pointer() 112 node_pointer p_next = p_nd->m_p_next_sibling; in next_after_0_pointer() local 114 if (p_next == 0) in next_after_0_pointer() 117 if (p_nd->m_metadata < p_next->m_metadata) in next_after_0_pointer() 118 return p_next; in next_after_0_pointer() [all …]
|
H A D | insert_fn_imps.hpp | 98 node_pointer p_next = p_nd->m_p_next_sibling; in link_with_next_sibling() local 100 _GLIBCXX_DEBUG_ASSERT(p_next != 0); in link_with_next_sibling() 107 if (p_next->m_p_prev_or_parent == 0) in link_with_next_sibling() 108 base_type::m_p_root = p_next; in link_with_next_sibling() 110 p_next->m_p_prev_or_parent->m_p_next_sibling = p_next; in link_with_next_sibling() 113 base_type::m_p_max = p_next; in link_with_next_sibling() 115 base_type::make_child_of(p_nd, p_next); in link_with_next_sibling() 117 ++p_next->m_metadata; in link_with_next_sibling() 119 return p_next; in link_with_next_sibling() 127 if (base_type::m_p_max == p_next) in link_with_next_sibling() [all …]
|
H A D | erase_fn_imps.hpp | 71 node_pointer p_next = p_nd->m_p_next_sibling; in make_binomial_heap() local 72 if (p_next == 0) in make_binomial_heap() 73 p_nd = p_next; in make_binomial_heap() 74 else if (p_nd->m_metadata == p_next->m_metadata) in make_binomial_heap() 76 else if (p_nd->m_metadata < p_next->m_metadata) in make_binomial_heap() 77 p_nd = p_next; in make_binomial_heap()
|
/netbsd/external/gpl3/gcc/dist/libstdc++-v3/include/ext/pb_ds/detail/rc_binomial_heap_/ |
H A D | debug_fn_imps.hpp | 74 PB_DS_DEBUG_VERIFY(p_next != 0); in assert_valid() 77 p_next->m_metadata < p_next->m_p_next_sibling->m_metadata); in assert_valid() 93 node_pointer p_next = p_nd->m_p_next_sibling; in next_2_pointer() local 95 if (p_next == 0) in next_2_pointer() 98 if (p_nd->m_metadata == p_next->m_metadata) in next_2_pointer() 101 return next_2_pointer(p_next); in next_2_pointer() 112 node_pointer p_next = p_nd->m_p_next_sibling; in next_after_0_pointer() local 114 if (p_next == 0) in next_after_0_pointer() 117 if (p_nd->m_metadata < p_next->m_metadata) in next_after_0_pointer() 118 return p_next; in next_after_0_pointer() [all …]
|
H A D | insert_fn_imps.hpp | 98 node_pointer p_next = p_nd->m_p_next_sibling; in link_with_next_sibling() local 100 _GLIBCXX_DEBUG_ASSERT(p_next != 0); in link_with_next_sibling() 107 if (p_next->m_p_prev_or_parent == 0) in link_with_next_sibling() 108 base_type::m_p_root = p_next; in link_with_next_sibling() 110 p_next->m_p_prev_or_parent->m_p_next_sibling = p_next; in link_with_next_sibling() 113 base_type::m_p_max = p_next; in link_with_next_sibling() 115 base_type::make_child_of(p_nd, p_next); in link_with_next_sibling() 117 ++p_next->m_metadata; in link_with_next_sibling() 119 return p_next; in link_with_next_sibling() 127 if (base_type::m_p_max == p_next) in link_with_next_sibling() [all …]
|
H A D | erase_fn_imps.hpp | 71 node_pointer p_next = p_nd->m_p_next_sibling; in make_binomial_heap() local 72 if (p_next == 0) in make_binomial_heap() 73 p_nd = p_next; in make_binomial_heap() 74 else if (p_nd->m_metadata == p_next->m_metadata) in make_binomial_heap() 76 else if (p_nd->m_metadata < p_next->m_metadata) in make_binomial_heap() 77 p_nd = p_next; in make_binomial_heap()
|
/netbsd/external/gpl3/gcc.old/dist/libstdc++-v3/include/ext/pb_ds/detail/list_update_map_/ |
H A D | find_fn_imps.hpp | 60 entry_pointer p_next = p_l->m_p_next; in find_imp() local 61 if (s_eq_fn(r_key, PB_DS_V2F(p_next->m_value))) in find_imp() 63 if (apply_update(p_next, s_metadata_type_indicator)) in find_imp() 65 p_l->m_p_next = p_next->m_p_next; in find_imp() 66 p_next->m_p_next = m_p_l; in find_imp() 67 m_p_l = p_next; in find_imp() 70 return p_next; in find_imp() 73 p_l = p_next; in find_imp()
|
H A D | erase_fn_imps.hpp | 54 entry_pointer p_next = m_p_l->m_p_next; in erase() local 56 m_p_l = p_next; in erase() 90 entry_pointer p_next = m_p_l->m_p_next; in erase_if() local 93 m_p_l = p_next; in erase_if()
|
/netbsd/external/gpl3/gcc/dist/libstdc++-v3/include/ext/pb_ds/detail/list_update_map_/ |
H A D | find_fn_imps.hpp | 60 entry_pointer p_next = p_l->m_p_next; in find_imp() local 61 if (s_eq_fn(r_key, PB_DS_V2F(p_next->m_value))) in find_imp() 63 if (apply_update(p_next, s_metadata_type_indicator)) in find_imp() 65 p_l->m_p_next = p_next->m_p_next; in find_imp() 66 p_next->m_p_next = m_p_l; in find_imp() 67 m_p_l = p_next; in find_imp() 70 return p_next; in find_imp() 73 p_l = p_next; in find_imp()
|
H A D | erase_fn_imps.hpp | 54 entry_pointer p_next = m_p_l->m_p_next; in erase() local 56 m_p_l = p_next; in erase() 90 entry_pointer p_next = m_p_l->m_p_next; in erase_if() local 93 m_p_l = p_next; in erase_if()
|
/netbsd/external/gpl3/gcc.old/dist/libstdc++-v3/include/ext/pb_ds/detail/binomial_heap_base_/ |
H A D | insert_fn_imps.hpp | 113 node_pointer p_next = p_nd->m_p_next_sibling; in fix() local 114 if (Cmp_Fn::operator()(p_nd->m_value, p_next->m_value)) in fix() 116 p_next->m_p_prev_or_parent = p_nd->m_p_prev_or_parent; in fix() 119 p_nd->m_p_prev_or_parent->m_p_next_sibling = p_next; in fix() 121 base_type::make_child_of(p_nd, p_next); in fix() 122 ++p_next->m_metadata; in fix() 123 p_nd = p_next; in fix() 127 p_nd->m_p_next_sibling = p_next->m_p_next_sibling; in fix() 130 p_next->m_p_next_sibling = 0; in fix() 132 base_type::make_child_of(p_next, p_nd); in fix()
|
H A D | split_join_fn_imps.hpp | 68 node_pointer p_next = p_out->m_p_next_sibling; in split() local 78 p_out = p_next; in split() 87 node_pointer p_next = p_cur->m_p_next_sibling; in split() local 97 p_cur = p_next; in split() 117 node_pointer p_next = p_other->m_p_next_sibling; in join() local 119 p_other = p_next; in join()
|
/netbsd/external/gpl3/gcc/dist/libstdc++-v3/include/ext/pb_ds/detail/binomial_heap_base_/ |
H A D | insert_fn_imps.hpp | 113 node_pointer p_next = p_nd->m_p_next_sibling; in fix() local 114 if (Cmp_Fn::operator()(p_nd->m_value, p_next->m_value)) in fix() 116 p_next->m_p_prev_or_parent = p_nd->m_p_prev_or_parent; in fix() 119 p_nd->m_p_prev_or_parent->m_p_next_sibling = p_next; in fix() 121 base_type::make_child_of(p_nd, p_next); in fix() 122 ++p_next->m_metadata; in fix() 123 p_nd = p_next; in fix() 127 p_nd->m_p_next_sibling = p_next->m_p_next_sibling; in fix() 130 p_next->m_p_next_sibling = 0; in fix() 132 base_type::make_child_of(p_next, p_nd); in fix()
|
H A D | split_join_fn_imps.hpp | 68 node_pointer p_next = p_out->m_p_next_sibling; in split() local 78 p_out = p_next; in split() 87 node_pointer p_next = p_cur->m_p_next_sibling; in split() local 97 p_cur = p_next; in split() 117 node_pointer p_next = p_other->m_p_next_sibling; in join() local 119 p_other = p_next; in join()
|
/netbsd/external/gpl3/gcc.old/dist/libstdc++-v3/include/ext/pb_ds/detail/thin_heap_/ |
H A D | split_join_fn_imps.hpp | 68 node_pointer p_next = p_out->m_p_next_sibling; in split() local 70 p_out = p_next; in split() 79 node_pointer p_next = p_cur->m_p_next_sibling; in split() local 81 p_cur = p_next; in split() 99 node_pointer p_next = p_other->m_p_next_sibling; in join() local 101 p_other = p_next; in join()
|
/netbsd/external/gpl3/gcc/dist/libstdc++-v3/include/ext/pb_ds/detail/thin_heap_/ |
H A D | split_join_fn_imps.hpp | 68 node_pointer p_next = p_out->m_p_next_sibling; in split() local 70 p_out = p_next; in split() 79 node_pointer p_next = p_cur->m_p_next_sibling; in split() local 81 p_cur = p_next; in split() 99 node_pointer p_next = p_other->m_p_next_sibling; in join() local 101 p_other = p_next; in join()
|
/netbsd/external/bsd/less/dist/ |
H A D | output.c | 130 char *anchor, *p, *p_next; in flush() local 152 for (anchor = p_next = obuf; in flush() 153 (p_next = memchr(p_next, ESC, ob - p_next)) != NULL; ) in flush() 155 p = p_next; in flush() 177 anchor = p_next = p; in flush() 182 p_next = p; in flush() 213 p_next = q; in flush() 273 if (!is_ansi_end(*p) || p == p_next) in flush() 308 p_next = anchor = p + 1; in flush() 310 p_next++; in flush()
|
/netbsd/bin/csh/ |
H A D | proc.c | 109 for (pp = proclist.p_next; pp != NULL; pp = pp->p_next) in pchild() 244 fp->p_next = pp->p_next; in pwait() 365 for (pp = proclist.p_next; pp; pp = pp->p_next) in dowait() 416 for (np = proclist.p_next, idx = 0; np; np = np->p_next) in pflush() 497 for (np = proclist.p_next; np; np = np->p_next) in palloc() 512 pp->p_next = proclist.p_next; in palloc() 861 for (pp = proclist.p_next; pp; pp = pp->p_next) in dojobs() 1145 for (pp = proclist.p_next; pp; pp = pp->p_next) in panystop() 1168 for (pp = proclist.p_next; pp; pp = pp->p_next) in pfind() 1174 for (pp = proclist.p_next; pp; pp = pp->p_next) in pfind() [all …]
|
/netbsd/external/gpl3/gcc.old/dist/libstdc++-v3/include/ext/pb_ds/detail/left_child_next_sibling_heap_/ |
H A D | erase_fn_imps.hpp | 72 node_pointer p_next = p_nd->m_p_next_sibling; in clear_imp() local 74 p_nd = p_next; in clear_imp() 120 node_pointer p_next = p_cur->m_p_next_sibling; in prune() local 135 p_cur = p_next; in prune()
|
/netbsd/external/gpl3/gcc/dist/libstdc++-v3/include/ext/pb_ds/detail/left_child_next_sibling_heap_/ |
H A D | erase_fn_imps.hpp | 72 node_pointer p_next = p_nd->m_p_next_sibling; in clear_imp() local 74 p_nd = p_next; in clear_imp() 120 node_pointer p_next = p_cur->m_p_next_sibling; in prune() local 135 p_cur = p_next; in prune()
|
/netbsd/external/gpl2/xcvs/dist/lib/ |
H A D | pagealign_alloc.c | 107 memnode_t **p_next = &memnode_table; in get_memnode() local 109 for (c = *p_next; c != NULL; p_next = &c->next, c = c->next) in get_memnode() 119 *p_next = c->next; in get_memnode()
|