HomeSort by relevance Sort by last modified time
    Searched refs:p_ret (Results 1 - 25 of 54) sorted by null

1 2 3

  /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/ext/pb_ds/detail/left_child_next_sibling_heap_/
constructors_destructor_fn_imps.hpp 117 node_pointer p_ret = s_node_allocator.allocate(1);
121 new (p_ret) node(*p_nd);
125 s_node_allocator.deallocate(p_ret, 1);
129 p_ret->m_p_l_child = p_ret->m_p_next_sibling =
130 p_ret->m_p_prev_or_parent = 0;
134 p_ret->m_p_l_child = recursive_copy_node(p_nd->m_p_l_child);
135 p_ret->m_p_next_sibling = recursive_copy_node(p_nd->m_p_next_sibling);
139 clear_imp(p_ret);
143 if (p_ret->m_p_l_child != 0
    [all...]
  /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/ext/pb_ds/detail/left_child_next_sibling_heap_/
constructors_destructor_fn_imps.hpp 117 node_pointer p_ret = s_node_allocator.allocate(1);
121 new (p_ret) node(*p_nd);
125 s_node_allocator.deallocate(p_ret, 1);
129 p_ret->m_p_l_child = p_ret->m_p_next_sibling =
130 p_ret->m_p_prev_or_parent = 0;
134 p_ret->m_p_l_child = recursive_copy_node(p_nd->m_p_l_child);
135 p_ret->m_p_next_sibling = recursive_copy_node(p_nd->m_p_next_sibling);
139 clear_imp(p_ret);
143 if (p_ret->m_p_l_child != 0
    [all...]
  /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/ext/pb_ds/detail/left_child_next_sibling_heap_/
constructors_destructor_fn_imps.hpp 117 node_pointer p_ret = s_node_allocator.allocate(1);
121 new (p_ret) node(*p_nd);
125 s_node_allocator.deallocate(p_ret, 1);
129 p_ret->m_p_l_child = p_ret->m_p_next_sibling =
130 p_ret->m_p_prev_or_parent = 0;
134 p_ret->m_p_l_child = recursive_copy_node(p_nd->m_p_l_child);
135 p_ret->m_p_next_sibling = recursive_copy_node(p_nd->m_p_next_sibling);
139 clear_imp(p_ret);
143 if (p_ret->m_p_l_child != 0
    [all...]
  /prebuilts/ndk/r10/sources/cxx-stl/gnu-libstdc++/4.9/include/ext/pb_ds/detail/left_child_next_sibling_heap_/
constructors_destructor_fn_imps.hpp 117 node_pointer p_ret = s_node_allocator.allocate(1);
121 new (p_ret) node(*p_nd);
125 s_node_allocator.deallocate(p_ret, 1);
129 p_ret->m_p_l_child = p_ret->m_p_next_sibling =
130 p_ret->m_p_prev_or_parent = 0;
134 p_ret->m_p_l_child = recursive_copy_node(p_nd->m_p_l_child);
135 p_ret->m_p_next_sibling = recursive_copy_node(p_nd->m_p_next_sibling);
139 clear_imp(p_ret);
143 if (p_ret->m_p_l_child != 0
    [all...]
  /prebuilts/ndk/r11/sources/cxx-stl/gnu-libstdc++/4.9/include/ext/pb_ds/detail/left_child_next_sibling_heap_/
constructors_destructor_fn_imps.hpp 117 node_pointer p_ret = s_node_allocator.allocate(1);
121 new (p_ret) node(*p_nd);
125 s_node_allocator.deallocate(p_ret, 1);
129 p_ret->m_p_l_child = p_ret->m_p_next_sibling =
130 p_ret->m_p_prev_or_parent = 0;
134 p_ret->m_p_l_child = recursive_copy_node(p_nd->m_p_l_child);
135 p_ret->m_p_next_sibling = recursive_copy_node(p_nd->m_p_next_sibling);
139 clear_imp(p_ret);
143 if (p_ret->m_p_l_child != 0
    [all...]
  /prebuilts/ndk/r13/sources/cxx-stl/gnu-libstdc++/4.9/include/ext/pb_ds/detail/left_child_next_sibling_heap_/
constructors_destructor_fn_imps.hpp 117 node_pointer p_ret = s_node_allocator.allocate(1);
121 new (p_ret) node(*p_nd);
125 s_node_allocator.deallocate(p_ret, 1);
129 p_ret->m_p_l_child = p_ret->m_p_next_sibling =
130 p_ret->m_p_prev_or_parent = 0;
134 p_ret->m_p_l_child = recursive_copy_node(p_nd->m_p_l_child);
135 p_ret->m_p_next_sibling = recursive_copy_node(p_nd->m_p_next_sibling);
139 clear_imp(p_ret);
143 if (p_ret->m_p_l_child != 0
    [all...]
  /system/bt/stack/include/
a2dp_sbc_up_sample.h 70 * The number of bytes used in p_src (in *p_ret)
74 uint32_t dst_samples, uint32_t* p_ret);
92 * The number of bytes used in p_src (in *p_ret)
96 uint32_t dst_samples, uint32_t* p_ret);
114 * The number of bytes used in p_src (in *p_ret)
118 uint32_t dst_samples, uint32_t* p_ret);
136 * The number of bytes used in p_src (in *p_ret)
140 uint32_t dst_samples, uint32_t* p_ret);
157 * The number of bytes used in p_src (in *p_ret)
161 uint32_t dst_samples, uint32_t* p_ret);
    [all...]
  /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/ext/pb_ds/detail/bin_search_tree_/
constructors_destructor_fn_imps.hpp 159 node_pointer p_ret = s_node_allocator.allocate(1);
162 new (p_ret) node(*p_nd);
166 s_node_allocator.deallocate(p_ret, 1);
170 p_ret->m_p_left = p_ret->m_p_right = 0;
174 p_ret->m_p_left = recursive_copy_node(p_nd->m_p_left);
175 p_ret->m_p_right = recursive_copy_node(p_nd->m_p_right);
179 clear_imp(p_ret);
183 if (p_ret->m_p_left != 0)
184 p_ret->m_p_left->m_p_parent = p_ret
    [all...]
  /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/ext/pb_ds/detail/bin_search_tree_/
constructors_destructor_fn_imps.hpp 159 node_pointer p_ret = s_node_allocator.allocate(1);
162 new (p_ret) node(*p_nd);
166 s_node_allocator.deallocate(p_ret, 1);
170 p_ret->m_p_left = p_ret->m_p_right = 0;
174 p_ret->m_p_left = recursive_copy_node(p_nd->m_p_left);
175 p_ret->m_p_right = recursive_copy_node(p_nd->m_p_right);
179 clear_imp(p_ret);
183 if (p_ret->m_p_left != 0)
184 p_ret->m_p_left->m_p_parent = p_ret
    [all...]
  /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/ext/pb_ds/detail/bin_search_tree_/
constructors_destructor_fn_imps.hpp 159 node_pointer p_ret = s_node_allocator.allocate(1);
162 new (p_ret) node(*p_nd);
166 s_node_allocator.deallocate(p_ret, 1);
170 p_ret->m_p_left = p_ret->m_p_right = 0;
174 p_ret->m_p_left = recursive_copy_node(p_nd->m_p_left);
175 p_ret->m_p_right = recursive_copy_node(p_nd->m_p_right);
179 clear_imp(p_ret);
183 if (p_ret->m_p_left != 0)
184 p_ret->m_p_left->m_p_parent = p_ret
    [all...]
  /prebuilts/ndk/r10/sources/cxx-stl/gnu-libstdc++/4.9/include/ext/pb_ds/detail/bin_search_tree_/
constructors_destructor_fn_imps.hpp 159 node_pointer p_ret = s_node_allocator.allocate(1);
162 new (p_ret) node(*p_nd);
166 s_node_allocator.deallocate(p_ret, 1);
170 p_ret->m_p_left = p_ret->m_p_right = 0;
174 p_ret->m_p_left = recursive_copy_node(p_nd->m_p_left);
175 p_ret->m_p_right = recursive_copy_node(p_nd->m_p_right);
179 clear_imp(p_ret);
183 if (p_ret->m_p_left != 0)
184 p_ret->m_p_left->m_p_parent = p_ret
    [all...]
  /prebuilts/ndk/r11/sources/cxx-stl/gnu-libstdc++/4.9/include/ext/pb_ds/detail/bin_search_tree_/
constructors_destructor_fn_imps.hpp 159 node_pointer p_ret = s_node_allocator.allocate(1);
162 new (p_ret) node(*p_nd);
166 s_node_allocator.deallocate(p_ret, 1);
170 p_ret->m_p_left = p_ret->m_p_right = 0;
174 p_ret->m_p_left = recursive_copy_node(p_nd->m_p_left);
175 p_ret->m_p_right = recursive_copy_node(p_nd->m_p_right);
179 clear_imp(p_ret);
183 if (p_ret->m_p_left != 0)
184 p_ret->m_p_left->m_p_parent = p_ret
    [all...]
  /prebuilts/ndk/r13/sources/cxx-stl/gnu-libstdc++/4.9/include/ext/pb_ds/detail/bin_search_tree_/
constructors_destructor_fn_imps.hpp 159 node_pointer p_ret = s_node_allocator.allocate(1);
162 new (p_ret) node(*p_nd);
166 s_node_allocator.deallocate(p_ret, 1);
170 p_ret->m_p_left = p_ret->m_p_right = 0;
174 p_ret->m_p_left = recursive_copy_node(p_nd->m_p_left);
175 p_ret->m_p_right = recursive_copy_node(p_nd->m_p_right);
179 clear_imp(p_ret);
183 if (p_ret->m_p_left != 0)
184 p_ret->m_p_left->m_p_parent = p_ret
    [all...]
  /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/ext/pb_ds/detail/pairing_heap_/
erase_fn_imps.hpp 135 node_pointer p_ret = p_nd->m_p_l_child; local
136 if (p_ret == 0)
138 while (p_ret->m_p_next_sibling != 0)
139 p_ret = forward_join(p_ret, p_ret->m_p_next_sibling);
140 while (p_ret->m_p_prev_or_parent != p_nd)
141 p_ret = back_join(p_ret->m_p_prev_or_parent, p_ret);
    [all...]
  /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/ext/pb_ds/detail/pairing_heap_/
erase_fn_imps.hpp 135 node_pointer p_ret = p_nd->m_p_l_child; local
136 if (p_ret == 0)
138 while (p_ret->m_p_next_sibling != 0)
139 p_ret = forward_join(p_ret, p_ret->m_p_next_sibling);
140 while (p_ret->m_p_prev_or_parent != p_nd)
141 p_ret = back_join(p_ret->m_p_prev_or_parent, p_ret);
    [all...]
  /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/ext/pb_ds/detail/pairing_heap_/
erase_fn_imps.hpp 135 node_pointer p_ret = p_nd->m_p_l_child; local
136 if (p_ret == 0)
138 while (p_ret->m_p_next_sibling != 0)
139 p_ret = forward_join(p_ret, p_ret->m_p_next_sibling);
140 while (p_ret->m_p_prev_or_parent != p_nd)
141 p_ret = back_join(p_ret->m_p_prev_or_parent, p_ret);
    [all...]
  /prebuilts/ndk/r10/sources/cxx-stl/gnu-libstdc++/4.9/include/ext/pb_ds/detail/pairing_heap_/
erase_fn_imps.hpp 135 node_pointer p_ret = p_nd->m_p_l_child; local
136 if (p_ret == 0)
138 while (p_ret->m_p_next_sibling != 0)
139 p_ret = forward_join(p_ret, p_ret->m_p_next_sibling);
140 while (p_ret->m_p_prev_or_parent != p_nd)
141 p_ret = back_join(p_ret->m_p_prev_or_parent, p_ret);
    [all...]
  /prebuilts/ndk/r11/sources/cxx-stl/gnu-libstdc++/4.9/include/ext/pb_ds/detail/pairing_heap_/
erase_fn_imps.hpp 135 node_pointer p_ret = p_nd->m_p_l_child; local
136 if (p_ret == 0)
138 while (p_ret->m_p_next_sibling != 0)
139 p_ret = forward_join(p_ret, p_ret->m_p_next_sibling);
140 while (p_ret->m_p_prev_or_parent != p_nd)
141 p_ret = back_join(p_ret->m_p_prev_or_parent, p_ret);
    [all...]
  /prebuilts/ndk/r13/sources/cxx-stl/gnu-libstdc++/4.9/include/ext/pb_ds/detail/pairing_heap_/
erase_fn_imps.hpp 135 node_pointer p_ret = p_nd->m_p_l_child; local
136 if (p_ret == 0)
138 while (p_ret->m_p_next_sibling != 0)
139 p_ret = forward_join(p_ret, p_ret->m_p_next_sibling);
140 while (p_ret->m_p_prev_or_parent != p_nd)
141 p_ret = back_join(p_ret->m_p_prev_or_parent, p_ret);
    [all...]
  /system/bt/stack/a2dp/
a2dp_sbc_up_sample.cc 29 uint32_t dst_samples, uint32_t* p_ret);
111 * The number of bytes used in p_src (in *p_ret)
115 uint32_t dst_samples, uint32_t* p_ret) {
122 return (*a2dp_sbc_ups_cb.p_act)(p_src, p_dst, src, dst, p_ret);
124 *p_ret = 0;
145 * The number of bytes used in p_src (in *p_ret)
149 uint32_t dst_samples, uint32_t* p_ret) {
184 *p_ret = ((char*)p_src_tmp - (char*)p_src);
204 * The number of bytes used in p_src (in *p_ret)
208 uint32_t dst_samples, uint32_t* p_ret) {
    [all...]
  /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/ext/pb_ds/detail/binomial_heap_base_/
split_join_fn_imps.hpp 138 node_pointer p_ret = 0; local
146 p_ret = p_cur = p_lhs;
158 p_ret = p_cur = p_rhs;
172 p_ret = p_cur = p_lhs;
193 if (p_ret != 0)
194 p_ret->m_p_prev_or_parent = 0;
196 return p_ret;
  /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/ext/pb_ds/detail/binomial_heap_base_/
split_join_fn_imps.hpp 138 node_pointer p_ret = 0; local
146 p_ret = p_cur = p_lhs;
158 p_ret = p_cur = p_rhs;
172 p_ret = p_cur = p_lhs;
193 if (p_ret != 0)
194 p_ret->m_p_prev_or_parent = 0;
196 return p_ret;
  /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/ext/pb_ds/detail/binomial_heap_base_/
split_join_fn_imps.hpp 138 node_pointer p_ret = 0; local
146 p_ret = p_cur = p_lhs;
158 p_ret = p_cur = p_rhs;
172 p_ret = p_cur = p_lhs;
193 if (p_ret != 0)
194 p_ret->m_p_prev_or_parent = 0;
196 return p_ret;
  /prebuilts/ndk/r10/sources/cxx-stl/gnu-libstdc++/4.9/include/ext/pb_ds/detail/binomial_heap_base_/
split_join_fn_imps.hpp 138 node_pointer p_ret = 0; local
146 p_ret = p_cur = p_lhs;
158 p_ret = p_cur = p_rhs;
172 p_ret = p_cur = p_lhs;
193 if (p_ret != 0)
194 p_ret->m_p_prev_or_parent = 0;
196 return p_ret;
  /prebuilts/ndk/r11/sources/cxx-stl/gnu-libstdc++/4.9/include/ext/pb_ds/detail/binomial_heap_base_/
split_join_fn_imps.hpp 138 node_pointer p_ret = 0; local
146 p_ret = p_cur = p_lhs;
158 p_ret = p_cur = p_rhs;
172 p_ret = p_cur = p_lhs;
193 if (p_ret != 0)
194 p_ret->m_p_prev_or_parent = 0;
196 return p_ret;

Completed in 1097 milliseconds

1 2 3