| /hardware/ril/reference-ril/ |
| at_tok.h | 22 int at_tok_nextint(char **p_cur, int *p_out);
23 int at_tok_nexthexint(char **p_cur, int *p_out);
25 int at_tok_nextbool(char **p_cur, char *p_out);
|
| at_tok.c | 91 * Parses the next integer in the AT response line and places it in *p_out
97 static int at_tok_nextint_base(char **p_cur, int *p_out, int base, int uns)
118 *p_out = (int)l;
130 * and places it in *p_out
134 int at_tok_nextint(char **p_cur, int *p_out)
136 return at_tok_nextint_base(p_cur, p_out, 10, 0);
141 * and places it in *p_out
145 int at_tok_nexthexint(char **p_cur, int *p_out)
147 return at_tok_nextint_base(p_cur, p_out, 16, 1);
150 int at_tok_nextbool(char **p_cur, char *p_out)
[all...] |
| /prebuilt/linux-x86/toolchain/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/ext/pb_ds/detail/pairing_heap_/ |
| split_join_fn_imps.hpp | 62 node_pointer p_out = base_type::prune(pred); local
64 while (p_out != NULL)
71 node_pointer p_next = p_out->m_p_next_sibling;
73 p_out->m_p_l_child = p_out->m_p_next_sibling = p_out->m_p_prev_or_parent = NULL;
75 other.push_imp(p_out);
77 p_out = p_next;
|
| erase_fn_imps.hpp | 213 node_pointer p_out = base_type::prune(pred); local
215 while (p_out != NULL)
218 node_pointer p_next = p_out->m_p_next_sibling;
219 base_type::actual_erase_node(p_out);
220 p_out = p_next;
|
| /prebuilt/linux-x86/toolchain/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/ext/pb_ds/detail/thin_heap_/ |
| split_join_fn_imps.hpp | 62 node_pointer p_out = base_type::prune(pred); local
64 while (p_out != NULL)
71 node_pointer p_next = p_out->m_p_next_sibling;
73 other.make_root_and_link(p_out);
75 p_out = p_next;
|
| erase_fn_imps.hpp | 250 node_pointer p_out = base_type::prune(pred); local
254 while (p_out != NULL)
258 node_pointer p_next = p_out->m_p_next_sibling;
260 base_type::actual_erase_node(p_out);
262 p_out = p_next;
|
| /prebuilt/linux-x86/toolchain/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/ext/pb_ds/detail/left_child_next_sibling_heap_/ |
| erase_fn_imps.hpp | 115 node_pointer p_out = NULL; local
121 p_cur->m_p_next_sibling = p_out;
122 if (p_out != NULL)
123 p_out->m_p_prev_or_parent = p_cur;
124 p_out = p_cur;
135 return p_out;
|
| /external/kernel-headers/original/linux/ |
| capella_cm3602.h | 34 int p_out; /* proximity-sensor outpuCAPELLA_CM3602_IOCTL_ENABLE,t */ member in struct:capella_cm3602_platform_data
|
| /prebuilt/linux-x86/toolchain/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/ext/pb_ds/detail/binomial_heap_base_/ |
| split_join_fn_imps.hpp | 62 node_pointer p_out = base_type::prune(pred); local
64 while (p_out != NULL)
71 node_pointer p_next = p_out->m_p_next_sibling;
73 p_out->m_p_l_child = p_out->m_p_prev_or_parent = NULL;
75 p_out->m_metadata = 0;
77 p_out->m_p_next_sibling = other.m_p_root;
80 other.m_p_root->m_p_prev_or_parent = p_out;
82 other.m_p_root = p_out;
86 p_out = p_next
[all...] |
| erase_fn_imps.hpp | 147 node_pointer p_out = base_type::prune(pred); local
151 while (p_out != NULL)
155 node_pointer p_next = p_out->m_p_next_sibling;
157 base_type::actual_erase_node(p_out);
159 p_out = p_next;
|
