/haiku-buildtools/gcc/libstdc++-v3/include/ext/pb_ds/detail/rc_binomial_heap_/ |
H A D | debug_fn_imps.hpp | 71 node_const_pointer p_next = p_nd->m_p_next_sibling; local 72 PB_DS_DEBUG_VERIFY(p_next != 0); 73 PB_DS_DEBUG_VERIFY(p_nd->m_metadata == p_next->m_metadata); 74 PB_DS_DEBUG_VERIFY(p_next->m_p_next_sibling == 0 || 75 p_next->m_metadata < p_next->m_p_next_sibling->m_metadata); 91 node_pointer p_next = p_nd->m_p_next_sibling; 93 if (p_next == 0) 96 if (p_nd->m_metadata == p_next->m_metadata) 99 return next_2_pointer(p_next); [all...] |
H A D | erase_fn_imps.hpp | 69 node_pointer p_next = p_nd->m_p_next_sibling; local 70 if (p_next == 0) 71 p_nd = p_next; 72 else if (p_nd->m_metadata == p_next->m_metadata) 74 else if (p_nd->m_metadata < p_next->m_metadata) 75 p_nd = p_next;
|
H A D | insert_fn_imps.hpp | 96 node_pointer p_next = p_nd->m_p_next_sibling; local 98 _GLIBCXX_DEBUG_ASSERT(p_next != 0); 99 _GLIBCXX_DEBUG_ASSERT(p_next->m_p_prev_or_parent == p_nd); 101 if (Cmp_Fn::operator()(p_nd->m_value, p_next->m_value)) 103 p_next->m_p_prev_or_parent = p_nd->m_p_prev_or_parent; 105 if (p_next->m_p_prev_or_parent == 0) 106 base_type::m_p_root = p_next; 108 p_next->m_p_prev_or_parent->m_p_next_sibling = p_next; 111 base_type::m_p_max = p_next; [all...] |
/haiku-buildtools/gcc/libstdc++-v3/include/ext/pb_ds/detail/list_update_map_/ |
H A D | find_fn_imps.hpp | 58 entry_pointer p_next = p_l->m_p_next; local 59 if (s_eq_fn(r_key, PB_DS_V2F(p_next->m_value))) 61 if (apply_update(p_next, s_metadata_type_indicator)) 63 p_l->m_p_next = p_next->m_p_next; 64 p_next->m_p_next = m_p_l; 65 m_p_l = p_next; 68 return p_next; 71 p_l = p_next;
|
H A D | erase_fn_imps.hpp | 52 entry_pointer p_next = m_p_l->m_p_next; local 54 m_p_l = p_next; 88 entry_pointer p_next = m_p_l->m_p_next; local 91 m_p_l = p_next;
|
/haiku-buildtools/gcc/libstdc++-v3/include/ext/pb_ds/detail/pairing_heap_/ |
H A D | erase_fn_imps.hpp | 149 forward_join(node_pointer p_nd, node_pointer p_next) argument 152 _GLIBCXX_DEBUG_ASSERT(p_nd->m_p_next_sibling == p_next); 153 if (Cmp_Fn::operator()(p_nd->m_value, p_next->m_value)) 155 p_next->m_p_prev_or_parent = p_nd->m_p_prev_or_parent; 156 base_type::make_child_of(p_nd, p_next); 157 return p_next->m_p_next_sibling == 0 158 ? p_next : p_next->m_p_next_sibling; 161 if (p_next->m_p_next_sibling != 0) 163 p_next 178 back_join(node_pointer p_nd, node_pointer p_next) argument 215 node_pointer p_next = p_out->m_p_next_sibling; local 224 node_pointer p_next = p_cur->m_p_next_sibling; local [all...] |
H A D | split_join_fn_imps.hpp | 66 node_pointer p_next = p_out->m_p_next_sibling; local 70 p_out = p_next; 78 node_pointer p_next = p_cur->m_p_next_sibling; local 82 p_cur = p_next;
|
/haiku-buildtools/gcc/libstdc++-v3/include/ext/pb_ds/detail/thin_heap_/ |
H A D | split_join_fn_imps.hpp | 66 node_pointer p_next = p_out->m_p_next_sibling; local 68 p_out = p_next; 77 node_pointer p_next = p_cur->m_p_next_sibling; local 79 p_cur = p_next; 97 node_pointer p_next = p_other->m_p_next_sibling; local 99 p_other = p_next;
|
H A D | erase_fn_imps.hpp | 222 node_pointer p_next = p_out->m_p_next_sibling; local 224 p_out = p_next; 231 node_pointer p_next = p_cur->m_p_next_sibling; local 233 p_cur = p_next;
|
/haiku-buildtools/gcc/libstdc++-v3/include/ext/pb_ds/detail/binomial_heap_base_/ |
H A D | insert_fn_imps.hpp | 111 node_pointer p_next = p_nd->m_p_next_sibling; local 112 if (Cmp_Fn::operator()(p_nd->m_value, p_next->m_value)) 114 p_next->m_p_prev_or_parent = p_nd->m_p_prev_or_parent; 117 p_nd->m_p_prev_or_parent->m_p_next_sibling = p_next; 119 base_type::make_child_of(p_nd, p_next); 120 ++p_next->m_metadata; 121 p_nd = p_next; 125 p_nd->m_p_next_sibling = p_next->m_p_next_sibling; 128 p_next->m_p_next_sibling = 0; 130 base_type::make_child_of(p_next, p_n [all...] |
H A D | split_join_fn_imps.hpp | 66 node_pointer p_next = p_out->m_p_next_sibling; local 76 p_out = p_next; 85 node_pointer p_next = p_cur->m_p_next_sibling; local 95 p_cur = p_next; 115 node_pointer p_next = p_other->m_p_next_sibling; local 117 p_other = p_next;
|
H A D | erase_fn_imps.hpp | 136 node_pointer p_next = p_out->m_p_next_sibling; local 138 p_out = p_next; 145 node_pointer p_next = p_cur->m_p_next_sibling; local 155 p_cur = p_next;
|
/haiku-buildtools/gcc/libstdc++-v3/include/ext/pb_ds/detail/left_child_next_sibling_heap_/ |
H A D | erase_fn_imps.hpp | 70 node_pointer p_next = p_nd->m_p_next_sibling; local 72 p_nd = p_next; 118 node_pointer p_next = p_cur->m_p_next_sibling; local 133 p_cur = p_next;
|
H A D | const_iterator.hpp | 144 node_pointer p_next = base_type::m_p_nd; local 147 || base_type::m_p_nd->m_p_l_child == p_next)
|
/haiku-buildtools/gcc/gcc/testsuite/gcc.dg/ |
H A D | pr35065.c | 30 block_t *p_next; member in struct:block_t 50 while( p->p_next ) p = p->p_next; 51 p->p_next = p_block;
|
/haiku-buildtools/cloog/osl/autoconf/ |
H A D | ltmain.sh | 4628 const char *p_next; 4675 for (p = path; *p; p = p_next) 4683 p_next = (*q == '\0' ? q : q + 1);
|
/haiku-buildtools/cloog/autoconf/ |
H A D | ltmain.sh | 4628 const char *p_next; 4675 for (p = path; *p; p = p_next) 4683 p_next = (*q == '\0' ? q : q + 1);
|
/haiku-buildtools/gcc/gmp/ |
H A D | ltmain.sh | 4628 const char *p_next; 4675 for (p = path; *p; p = p_next) 4683 p_next = (*q == '\0' ? q : q + 1);
|
/haiku-buildtools/gcc/mpc/ |
H A D | ltmain.sh | 4628 const char *p_next; 4675 for (p = path; *p; p = p_next) 4683 p_next = (*q == '\0' ? q : q + 1);
|
/haiku-buildtools/gcc/mpfr/ |
H A D | ltmain.sh | 4628 const char *p_next; 4675 for (p = path; *p; p = p_next) 4683 p_next = (*q == '\0' ? q : q + 1);
|
/haiku-buildtools/isl/ |
H A D | ltmain.sh | 5882 const char *p_next; 5929 for (p = path; *p; p = p_next) 5937 p_next = (*q == '\0' ? q : q + 1);
|
/haiku-buildtools/binutils/ |
H A D | ltmain.sh | 3804 const char *p_next; 3851 for (p = path; *p; p = p_next) 3859 p_next = (*q == '\0' ? q : q + 1);
|
/haiku-buildtools/gcc/ |
H A D | ltmain.sh | 3804 const char *p_next; 3851 for (p = path; *p; p = p_next) 3859 p_next = (*q == '\0' ? q : q + 1);
|