Searched refs:p_out (Results 1 - 9 of 9) sorted by relevance

/haiku-buildtools/gcc/gcc/testsuite/gcc.dg/graphite/
H A Dpr37943.c21 unsigned char p_in, p_out; local
26 p_out |= copy(in);
30 return p_in || p_out;
/haiku-buildtools/gcc/gcc/testsuite/gcc.target/arc/
H A Dbuiltin_arc_aligned-3.c42 // @p_out is pointing to instance of outer_t, naturally aligned to 4+4 = 8
44 outer_t *p_out = some_alloc_1( ); // returns 8 byte aligned ptr local
47 // It is assigned to p_out->inner which is of type inner_t thus 32 byte
49 // Note that gcc can deduce p_out->inner is 32b aligned, not at runtime,
53 p_out->inner = ptr; // this ptr will also be 32 byte aligned
56 y2 = __builtin_arc_aligned(p_out->inner, 32); // this also shd return 1
57 // Although p_out->inner ptr is 32 byte aligned,
58 // it's container &(p_out->inner) need not be.
60 // p_out is not gauranteed to be 32 byte
61 // aligned, so it's member @inner in p_out nee
[all...]
/haiku-buildtools/gcc/libstdc++-v3/include/ext/pb_ds/detail/pairing_heap_/
H A Dsplit_join_fn_imps.hpp60 node_pointer p_out = base_type::prune(pred); local
61 while (p_out != 0)
66 node_pointer p_next = p_out->m_p_next_sibling;
67 p_out->m_p_l_child = p_out->m_p_next_sibling = p_out->m_p_prev_or_parent = 0;
69 other.push_imp(p_out);
70 p_out = p_next;
H A Derase_fn_imps.hpp210 node_pointer p_out = base_type::prune(pred); local
212 while (p_out != 0)
215 node_pointer p_next = p_out->m_p_next_sibling;
216 base_type::actual_erase_node(p_out);
217 p_out = p_next;
/haiku-buildtools/gcc/libstdc++-v3/include/ext/pb_ds/detail/thin_heap_/
H A Dsplit_join_fn_imps.hpp59 node_pointer p_out = base_type::prune(pred); local
61 while (p_out != 0)
66 node_pointer p_next = p_out->m_p_next_sibling;
67 other.make_root_and_link(p_out);
68 p_out = p_next;
H A Derase_fn_imps.hpp217 node_pointer p_out = base_type::prune(pred); local
219 while (p_out != 0)
222 node_pointer p_next = p_out->m_p_next_sibling;
223 base_type::actual_erase_node(p_out);
224 p_out = p_next;
/haiku-buildtools/gcc/libstdc++-v3/include/ext/pb_ds/detail/left_child_next_sibling_heap_/
H A Derase_fn_imps.hpp115 node_pointer p_out = 0; local
121 p_cur->m_p_next_sibling = p_out;
122 if (p_out != 0)
123 p_out->m_p_prev_or_parent = p_cur;
124 p_out = p_cur;
135 return p_out;
/haiku-buildtools/gcc/libstdc++-v3/include/ext/pb_ds/detail/binomial_heap_base_/
H A Dsplit_join_fn_imps.hpp59 node_pointer p_out = base_type::prune(pred); local
60 while (p_out != 0)
66 node_pointer p_next = p_out->m_p_next_sibling;
67 p_out->m_p_l_child = p_out->m_p_prev_or_parent = 0;
68 p_out->m_metadata = 0;
70 p_out->m_p_next_sibling = other.m_p_root;
72 other.m_p_root->m_p_prev_or_parent = p_out;
74 other.m_p_root = p_out;
76 p_out
[all...]
H A Derase_fn_imps.hpp131 node_pointer p_out = base_type::prune(pred); local
133 while (p_out != 0)
136 node_pointer p_next = p_out->m_p_next_sibling;
137 base_type::actual_erase_node(p_out);
138 p_out = p_next;

Completed in 172 milliseconds