| /dragonfly/contrib/gcc-4.7/libstdc++-v3/include/ext/pb_ds/detail/binomial_heap_base_/ |
| H A D | split_join_fn_imps.hpp | 59 node_pointer p_out = base_type::prune(pred); in split() local
60 while (p_out != 0) in split()
66 node_pointer p_next = p_out->m_p_next_sibling; in split()
67 p_out->m_p_l_child = p_out->m_p_prev_or_parent = 0; in split()
68 p_out->m_metadata = 0; in split()
70 p_out->m_p_next_sibling = other.m_p_root; in split()
72 other.m_p_root->m_p_prev_or_parent = p_out; in split()
74 other.m_p_root = p_out; in split()
76 p_out = p_next; in split()
|
| H A D | erase_fn_imps.hpp | 131 node_pointer p_out = base_type::prune(pred); in erase_if() local
133 while (p_out != 0) in erase_if()
136 node_pointer p_next = p_out->m_p_next_sibling; in erase_if()
137 base_type::actual_erase_node(p_out); in erase_if()
138 p_out = p_next; in erase_if()
|
| /dragonfly/contrib/gcc-8.0/libstdc++-v3/include/ext/pb_ds/detail/binomial_heap_base_/ |
| H A D | split_join_fn_imps.hpp | 59 node_pointer p_out = base_type::prune(pred); in split() local
60 while (p_out != 0) in split()
66 node_pointer p_next = p_out->m_p_next_sibling; in split()
67 p_out->m_p_l_child = p_out->m_p_prev_or_parent = 0; in split()
68 p_out->m_metadata = 0; in split()
70 p_out->m_p_next_sibling = other.m_p_root; in split()
72 other.m_p_root->m_p_prev_or_parent = p_out; in split()
74 other.m_p_root = p_out; in split()
76 p_out = p_next; in split()
|
| H A D | erase_fn_imps.hpp | 131 node_pointer p_out = base_type::prune(pred); in erase_if() local
133 while (p_out != 0) in erase_if()
136 node_pointer p_next = p_out->m_p_next_sibling; in erase_if()
137 base_type::actual_erase_node(p_out); in erase_if()
138 p_out = p_next; in erase_if()
|
| /dragonfly/contrib/gcc-4.7/libstdc++-v3/include/ext/pb_ds/detail/pairing_heap_/ |
| H A D | split_join_fn_imps.hpp | 60 node_pointer p_out = base_type::prune(pred); in split() local
61 while (p_out != 0) in split()
66 node_pointer p_next = p_out->m_p_next_sibling; in split()
67 p_out->m_p_l_child = p_out->m_p_next_sibling = p_out->m_p_prev_or_parent = 0; in split()
69 other.push_imp(p_out); in split()
70 p_out = p_next; in split()
|
| H A D | erase_fn_imps.hpp | 210 node_pointer p_out = base_type::prune(pred); in erase_if() local
212 while (p_out != 0) in erase_if()
215 node_pointer p_next = p_out->m_p_next_sibling; in erase_if()
216 base_type::actual_erase_node(p_out); in erase_if()
217 p_out = p_next; in erase_if()
|
| /dragonfly/contrib/gcc-8.0/libstdc++-v3/include/ext/pb_ds/detail/pairing_heap_/ |
| H A D | split_join_fn_imps.hpp | 60 node_pointer p_out = base_type::prune(pred); in split() local
61 while (p_out != 0) in split()
66 node_pointer p_next = p_out->m_p_next_sibling; in split()
67 p_out->m_p_l_child = p_out->m_p_next_sibling = p_out->m_p_prev_or_parent = 0; in split()
69 other.push_imp(p_out); in split()
70 p_out = p_next; in split()
|
| H A D | erase_fn_imps.hpp | 210 node_pointer p_out = base_type::prune(pred); in erase_if() local
212 while (p_out != 0) in erase_if()
215 node_pointer p_next = p_out->m_p_next_sibling; in erase_if()
216 base_type::actual_erase_node(p_out); in erase_if()
217 p_out = p_next; in erase_if()
|
| /dragonfly/contrib/gcc-4.7/libstdc++-v3/include/ext/pb_ds/detail/left_child_next_sibling_heap_/ |
| H A D | erase_fn_imps.hpp | 115 node_pointer p_out = 0; in prune() local
121 p_cur->m_p_next_sibling = p_out; in prune()
122 if (p_out != 0) in prune()
123 p_out->m_p_prev_or_parent = p_cur; in prune()
124 p_out = p_cur; in prune()
135 return p_out; in prune()
|
| /dragonfly/contrib/gcc-8.0/libstdc++-v3/include/ext/pb_ds/detail/left_child_next_sibling_heap_/ |
| H A D | erase_fn_imps.hpp | 115 node_pointer p_out = 0; in prune() local
121 p_cur->m_p_next_sibling = p_out; in prune()
122 if (p_out != 0) in prune()
123 p_out->m_p_prev_or_parent = p_cur; in prune()
124 p_out = p_cur; in prune()
135 return p_out; in prune()
|
| /dragonfly/contrib/gcc-8.0/libstdc++-v3/include/ext/pb_ds/detail/thin_heap_/ |
| H A D | split_join_fn_imps.hpp | 59 node_pointer p_out = base_type::prune(pred); in split() local
61 while (p_out != 0) in split()
66 node_pointer p_next = p_out->m_p_next_sibling; in split()
67 other.make_root_and_link(p_out); in split()
68 p_out = p_next; in split()
|
| H A D | erase_fn_imps.hpp | 217 node_pointer p_out = base_type::prune(pred); in erase_if() local
219 while (p_out != 0) in erase_if()
222 node_pointer p_next = p_out->m_p_next_sibling; in erase_if()
223 base_type::actual_erase_node(p_out); in erase_if()
224 p_out = p_next; in erase_if()
|
| /dragonfly/contrib/gcc-4.7/libstdc++-v3/include/ext/pb_ds/detail/thin_heap_/ |
| H A D | split_join_fn_imps.hpp | 59 node_pointer p_out = base_type::prune(pred); in split() local
61 while (p_out != 0) in split()
66 node_pointer p_next = p_out->m_p_next_sibling; in split()
67 other.make_root_and_link(p_out); in split()
68 p_out = p_next; in split()
|
| H A D | erase_fn_imps.hpp | 217 node_pointer p_out = base_type::prune(pred); in erase_if() local
219 while (p_out != 0) in erase_if()
222 node_pointer p_next = p_out->m_p_next_sibling; in erase_if()
223 base_type::actual_erase_node(p_out); in erase_if()
224 p_out = p_next; in erase_if()
|
| /dragonfly/sys/dev/drm/i915/ |
| H A D | intel_dpll_mgr.c | 688 unsigned *r2_out, unsigned *n2_out, unsigned *p_out) in hsw_ddi_calculate_wrpll() argument
703 *p_out = 1; in hsw_ddi_calculate_wrpll()
747 *p_out = best.p; in hsw_ddi_calculate_wrpll()
|