| /l4re-core-master/cxx/lib/io/src/ |
| A D | iob_write.cc | 41 int pos = 20; in write() local
51 if (pos == 20) in write()
52 pos = 19; in write()
54 buffer[--pos] = '-'; in write()
56 write(buffer + pos, 20 - pos); in write()
62 int pos = 20; in write() local
69 if (pos == 20) in write()
70 pos = 19; in write()
72 write(buffer + pos, 20 - pos); in write()
81 while (pos > 0 && u) in write()
[all …]
|
| /l4re-core-master/uclibc/lib/contrib/uclibc/libc/stdlib/ |
| A D | _strtod.c | 240 ++pos; in __XL_NPP()
246 case '+': ++pos; in __XL_NPP()
250 if ((*pos == '0') && (((pos[1])|0x20) == 'x')) { in __XL_NPP()
291 + (isdigit(*pos) in __XL_NPP()
298 ++pos; in __XL_NPP()
304 pos0 = ++pos; in __XL_NPP()
324 pos = poshex; in __XL_NPP()
386 pos1 = pos; in __XL_NPP()
394 pos0 = pos; in __XL_NPP()
404 ++pos; in __XL_NPP()
[all …]
|
| /l4re-core-master/uclibc/lib/contrib/uclibc/libpthread/nptl/sysdeps/pthread/ |
| A D | list.h | 86 #define list_for_each(pos, head) \ argument
87 for (pos = (head)->next; pos != (head); pos = pos->next)
91 #define list_for_each_prev(pos, head) \ argument
92 for (pos = (head)->prev; pos != (head); pos = pos->prev)
97 #define list_for_each_prev_safe(pos, p, head) \ argument
98 for (pos = (head)->prev, p = pos->prev; \
99 pos != (head); \
100 pos = p, p = pos->prev)
|
| /l4re-core-master/libstdc++-v3/contrib/libstdc++-v3-5/include/ext/pb_ds/detail/cc_hash_table_map_/ |
| A D | erase_fn_imps.hpp | 62 for (size_type pos = 0; pos < m_num_e; ++pos) in erase_if() local
64 while (m_entries[pos] != 0 && pred(m_entries[pos]->m_value)) in erase_if()
67 entry_pointer p_next_e = m_entries[pos]->m_p_next; in erase_if()
68 erase_entry_pointer(m_entries[pos]); in erase_if()
69 m_entries[pos] = p_next_e; in erase_if()
72 entry_pointer p_e = m_entries[pos]; in erase_if()
94 for (size_type pos = 0; pos < m_num_e; ++pos) in clear() local
95 while (m_entries[pos] != 0) in clear()
96 erase_entry_pointer(m_entries[pos]); in clear()
|
| /l4re-core-master/libstdc++-v3/contrib/libstdc++-v3-8/include/ext/pb_ds/detail/cc_hash_table_map_/ |
| A D | erase_fn_imps.hpp | 62 for (size_type pos = 0; pos < m_num_e; ++pos) in erase_if() local
64 while (m_entries[pos] != 0 && pred(m_entries[pos]->m_value)) in erase_if()
67 entry_pointer p_next_e = m_entries[pos]->m_p_next; in erase_if()
68 erase_entry_pointer(m_entries[pos]); in erase_if()
69 m_entries[pos] = p_next_e; in erase_if()
72 entry_pointer p_e = m_entries[pos]; in erase_if()
94 for (size_type pos = 0; pos < m_num_e; ++pos) in clear() local
95 while (m_entries[pos] != 0) in clear()
96 erase_entry_pointer(m_entries[pos]); in clear()
|
| /l4re-core-master/libstdc++-v3/contrib/libstdc++-v3-6/include/ext/pb_ds/detail/cc_hash_table_map_/ |
| A D | erase_fn_imps.hpp | 62 for (size_type pos = 0; pos < m_num_e; ++pos) in erase_if() local
64 while (m_entries[pos] != 0 && pred(m_entries[pos]->m_value)) in erase_if()
67 entry_pointer p_next_e = m_entries[pos]->m_p_next; in erase_if()
68 erase_entry_pointer(m_entries[pos]); in erase_if()
69 m_entries[pos] = p_next_e; in erase_if()
72 entry_pointer p_e = m_entries[pos]; in erase_if()
94 for (size_type pos = 0; pos < m_num_e; ++pos) in clear() local
95 while (m_entries[pos] != 0) in clear()
96 erase_entry_pointer(m_entries[pos]); in clear()
|
| /l4re-core-master/libstdc++-v3/contrib/libstdc++-v3-7/include/ext/pb_ds/detail/cc_hash_table_map_/ |
| A D | erase_fn_imps.hpp | 62 for (size_type pos = 0; pos < m_num_e; ++pos) in erase_if() local
64 while (m_entries[pos] != 0 && pred(m_entries[pos]->m_value)) in erase_if()
67 entry_pointer p_next_e = m_entries[pos]->m_p_next; in erase_if()
68 erase_entry_pointer(m_entries[pos]); in erase_if()
69 m_entries[pos] = p_next_e; in erase_if()
72 entry_pointer p_e = m_entries[pos]; in erase_if()
94 for (size_type pos = 0; pos < m_num_e; ++pos) in clear() local
95 while (m_entries[pos] != 0) in clear()
96 erase_entry_pointer(m_entries[pos]); in clear()
|
| /l4re-core-master/libstdc++-v3/contrib/libstdc++-v3-9/include/ext/pb_ds/detail/cc_hash_table_map_/ |
| A D | erase_fn_imps.hpp | 62 for (size_type pos = 0; pos < m_num_e; ++pos) in erase_if() local
64 while (m_entries[pos] != 0 && pred(m_entries[pos]->m_value)) in erase_if()
67 entry_pointer p_next_e = m_entries[pos]->m_p_next; in erase_if()
68 erase_entry_pointer(m_entries[pos]); in erase_if()
69 m_entries[pos] = p_next_e; in erase_if()
72 entry_pointer p_e = m_entries[pos]; in erase_if()
94 for (size_type pos = 0; pos < m_num_e; ++pos) in clear() local
95 while (m_entries[pos] != 0) in clear()
96 erase_entry_pointer(m_entries[pos]); in clear()
|
| /l4re-core-master/libstdc++-v3/contrib/libstdc++-v3-4.9/include/ext/pb_ds/detail/cc_hash_table_map_/ |
| A D | erase_fn_imps.hpp | 62 for (size_type pos = 0; pos < m_num_e; ++pos) in erase_if() local
64 while (m_entries[pos] != 0 && pred(m_entries[pos]->m_value)) in erase_if()
67 entry_pointer p_next_e = m_entries[pos]->m_p_next; in erase_if()
68 erase_entry_pointer(m_entries[pos]); in erase_if()
69 m_entries[pos] = p_next_e; in erase_if()
72 entry_pointer p_e = m_entries[pos]; in erase_if()
94 for (size_type pos = 0; pos < m_num_e; ++pos) in clear() local
95 while (m_entries[pos] != 0) in clear()
96 erase_entry_pointer(m_entries[pos]); in clear()
|
| /l4re-core-master/libstdc++-v3/contrib/libstdc++-v3-10/include/ext/pb_ds/detail/cc_hash_table_map_/ |
| A D | erase_fn_imps.hpp | 64 for (size_type pos = 0; pos < m_num_e; ++pos) in erase_if() local
66 while (m_entries[pos] != 0 && pred(m_entries[pos]->m_value)) in erase_if()
69 entry_pointer p_next_e = m_entries[pos]->m_p_next; in erase_if()
70 erase_entry_pointer(m_entries[pos]); in erase_if()
71 m_entries[pos] = p_next_e; in erase_if()
74 entry_pointer p_e = m_entries[pos]; in erase_if()
96 for (size_type pos = 0; pos < m_num_e; ++pos) in clear() local
97 while (m_entries[pos] != 0) in clear()
98 erase_entry_pointer(m_entries[pos]); in clear()
|
| /l4re-core-master/libstdc++-v3/contrib/libstdc++-v3-11/include/ext/pb_ds/detail/cc_hash_table_map_/ |
| A D | erase_fn_imps.hpp | 64 for (size_type pos = 0; pos < m_num_e; ++pos) in erase_if() local
66 while (m_entries[pos] != 0 && pred(m_entries[pos]->m_value)) in erase_if()
69 entry_pointer p_next_e = m_entries[pos]->m_p_next; in erase_if()
70 erase_entry_pointer(m_entries[pos]); in erase_if()
71 m_entries[pos] = p_next_e; in erase_if()
74 entry_pointer p_e = m_entries[pos]; in erase_if()
96 for (size_type pos = 0; pos < m_num_e; ++pos) in clear() local
97 while (m_entries[pos] != 0) in clear()
98 erase_entry_pointer(m_entries[pos]); in clear()
|
| /l4re-core-master/uclibc/lib/contrib/uclibc/libpthread/linuxthreads/sysdeps/pthread/ |
| A D | list.h | 97 #define list_for_each(pos, head) \ argument
98 for (pos = (head)->next; pos != (head); pos = pos->next)
102 #define list_for_each_prev(pos, head) \ argument
103 for (pos = (head)->prev; pos != (head); pos = pos->prev)
108 #define list_for_each_prev_safe(pos, p, head) \ argument
109 for (pos = (head)->prev, p = pos->prev; \
110 pos != (head); \
111 pos = p, p = pos->prev)
|
| /l4re-core-master/uclibc/lib/contrib/uclibc/libc/stdio/ |
| A D | fmemopen.c | 19 size_t pos; member
31 size_t count = COOKIE->len - COOKIE->pos; in fmo_read()
43 COOKIE->pos += bufsize; in fmo_read()
56 COOKIE->pos = COOKIE->eof; in fmo_write()
59 count = COOKIE->len - COOKIE->pos; in fmo_write()
70 COOKIE->pos += bufsize; in fmo_write()
72 if (COOKIE->pos > COOKIE->eof) { in fmo_write()
73 COOKIE->eof = COOKIE->pos; in fmo_write()
75 *(COOKIE->buf + COOKIE->pos) = 0; in fmo_write()
85 __offmax_t p = *pos; in fmo_seek()
[all …]
|
| A D | ftello.c | 19 __offmax_t pos = ftello64(stream); in FTELL() local
21 if ((sizeof(long) >= sizeof(__offmax_t)) || (((long) pos) == pos)) { in FTELL()
22 return ((long) pos); in FTELL()
30 __offmax_t pos = 0; in FTELL()
37 if ((__SEEK(stream, &pos, in FTELL()
41 || (__stdio_adjust_position(stream, &pos) < 0)) { in FTELL()
42 pos = -1; in FTELL()
47 return pos; in FTELL()
|
| /l4re-core-master/uclibc/lib/contrib/uclibc/extra/config/ |
| A D | list.h | 48 #define list_for_each_entry(pos, head, member) \ argument
49 for (pos = list_entry((head)->next, typeof(*pos), member); \
50 &pos->member != (head); \
51 pos = list_entry(pos->member.next, typeof(*pos), member))
60 #define list_for_each_entry_safe(pos, n, head, member) \ argument
61 for (pos = list_entry((head)->next, typeof(*pos), member), \
62 n = list_entry(pos->member.next, typeof(*pos), member); \
63 &pos->member != (head); \
64 pos = n, n = list_entry(n->member.next, typeof(*n), member))
|
| /l4re-core-master/libstdc++-v3/contrib/libstdc++-v3-5/include/ext/pb_ds/detail/gp_hash_table_map_/ |
| A D | insert_no_store_hash_fn_imps.hpp | 57 const size_type pos = ranged_probe_fn_base::operator()(r_key, hash, i); in find_ins_pos() local
58 _GLIBCXX_DEBUG_ASSERT(pos < m_num_e); in find_ins_pos()
59 entry* const p_e = m_entries + pos; in find_ins_pos()
66 return (ins_pos == m_num_e) ? pos : ins_pos; in find_ins_pos()
71 ins_pos = pos; in find_ins_pos()
78 return pos; in find_ins_pos()
99 const size_type pos = find_ins_pos(r_key, in insert_imp() local
102 if (m_entries[pos].m_stat == valid_entry_status) in insert_imp()
105 return std::make_pair(&(m_entries + pos)->m_value, false); in insert_imp()
109 return std::make_pair(insert_new_imp(r_val, pos), true); in insert_imp()
|
| /l4re-core-master/libstdc++-v3/contrib/libstdc++-v3-9/include/ext/pb_ds/detail/gp_hash_table_map_/ |
| A D | insert_no_store_hash_fn_imps.hpp | 57 const size_type pos = ranged_probe_fn_base::operator()(r_key, hash, i); in find_ins_pos() local
58 _GLIBCXX_DEBUG_ASSERT(pos < m_num_e); in find_ins_pos()
59 entry* const p_e = m_entries + pos; in find_ins_pos()
66 return (ins_pos == m_num_e) ? pos : ins_pos; in find_ins_pos()
71 ins_pos = pos; in find_ins_pos()
78 return pos; in find_ins_pos()
99 const size_type pos = find_ins_pos(r_key, in insert_imp() local
102 if (m_entries[pos].m_stat == valid_entry_status) in insert_imp()
105 return std::make_pair(&(m_entries + pos)->m_value, false); in insert_imp()
109 return std::make_pair(insert_new_imp(r_val, pos), true); in insert_imp()
|
| /l4re-core-master/libstdc++-v3/contrib/libstdc++-v3-8/include/ext/pb_ds/detail/gp_hash_table_map_/ |
| A D | insert_no_store_hash_fn_imps.hpp | 57 const size_type pos = ranged_probe_fn_base::operator()(r_key, hash, i); in find_ins_pos() local
58 _GLIBCXX_DEBUG_ASSERT(pos < m_num_e); in find_ins_pos()
59 entry* const p_e = m_entries + pos; in find_ins_pos()
66 return (ins_pos == m_num_e) ? pos : ins_pos; in find_ins_pos()
71 ins_pos = pos; in find_ins_pos()
78 return pos; in find_ins_pos()
99 const size_type pos = find_ins_pos(r_key, in insert_imp() local
102 if (m_entries[pos].m_stat == valid_entry_status) in insert_imp()
105 return std::make_pair(&(m_entries + pos)->m_value, false); in insert_imp()
109 return std::make_pair(insert_new_imp(r_val, pos), true); in insert_imp()
|
| /l4re-core-master/libstdc++-v3/contrib/libstdc++-v3-6/include/ext/pb_ds/detail/gp_hash_table_map_/ |
| A D | insert_no_store_hash_fn_imps.hpp | 57 const size_type pos = ranged_probe_fn_base::operator()(r_key, hash, i); in find_ins_pos() local
58 _GLIBCXX_DEBUG_ASSERT(pos < m_num_e); in find_ins_pos()
59 entry* const p_e = m_entries + pos; in find_ins_pos()
66 return (ins_pos == m_num_e) ? pos : ins_pos; in find_ins_pos()
71 ins_pos = pos; in find_ins_pos()
78 return pos; in find_ins_pos()
99 const size_type pos = find_ins_pos(r_key, in insert_imp() local
102 if (m_entries[pos].m_stat == valid_entry_status) in insert_imp()
105 return std::make_pair(&(m_entries + pos)->m_value, false); in insert_imp()
109 return std::make_pair(insert_new_imp(r_val, pos), true); in insert_imp()
|
| /l4re-core-master/libstdc++-v3/contrib/libstdc++-v3-11/include/ext/pb_ds/detail/gp_hash_table_map_/ |
| A D | insert_no_store_hash_fn_imps.hpp | 59 const size_type pos = ranged_probe_fn_base::operator()(r_key, hash, i); in find_ins_pos() local
60 _GLIBCXX_DEBUG_ASSERT(pos < m_num_e); in find_ins_pos()
61 entry* const p_e = m_entries + pos; in find_ins_pos()
68 return (ins_pos == m_num_e) ? pos : ins_pos; in find_ins_pos()
73 ins_pos = pos; in find_ins_pos()
80 return pos; in find_ins_pos()
101 const size_type pos = find_ins_pos(r_key, in insert_imp() local
104 if (m_entries[pos].m_stat == valid_entry_status) in insert_imp()
107 return std::make_pair(&(m_entries + pos)->m_value, false); in insert_imp()
111 return std::make_pair(insert_new_imp(r_val, pos), true); in insert_imp()
|
| /l4re-core-master/libstdc++-v3/contrib/libstdc++-v3-4.9/include/ext/pb_ds/detail/gp_hash_table_map_/ |
| A D | insert_no_store_hash_fn_imps.hpp | 57 const size_type pos = ranged_probe_fn_base::operator()(r_key, hash, i); in find_ins_pos() local
58 _GLIBCXX_DEBUG_ASSERT(pos < m_num_e); in find_ins_pos()
59 entry* const p_e = m_entries + pos; in find_ins_pos()
66 return (ins_pos == m_num_e) ? pos : ins_pos; in find_ins_pos()
71 ins_pos = pos; in find_ins_pos()
78 return pos; in find_ins_pos()
99 const size_type pos = find_ins_pos(r_key, in insert_imp() local
102 if (m_entries[pos].m_stat == valid_entry_status) in insert_imp()
105 return std::make_pair(&(m_entries + pos)->m_value, false); in insert_imp()
109 return std::make_pair(insert_new_imp(r_val, pos), true); in insert_imp()
|
| /l4re-core-master/libstdc++-v3/contrib/libstdc++-v3-10/include/ext/pb_ds/detail/gp_hash_table_map_/ |
| A D | insert_no_store_hash_fn_imps.hpp | 59 const size_type pos = ranged_probe_fn_base::operator()(r_key, hash, i); in find_ins_pos() local
60 _GLIBCXX_DEBUG_ASSERT(pos < m_num_e); in find_ins_pos()
61 entry* const p_e = m_entries + pos; in find_ins_pos()
68 return (ins_pos == m_num_e) ? pos : ins_pos; in find_ins_pos()
73 ins_pos = pos; in find_ins_pos()
80 return pos; in find_ins_pos()
101 const size_type pos = find_ins_pos(r_key, in insert_imp() local
104 if (m_entries[pos].m_stat == valid_entry_status) in insert_imp()
107 return std::make_pair(&(m_entries + pos)->m_value, false); in insert_imp()
111 return std::make_pair(insert_new_imp(r_val, pos), true); in insert_imp()
|
| /l4re-core-master/libstdc++-v3/contrib/libstdc++-v3-7/include/ext/pb_ds/detail/gp_hash_table_map_/ |
| A D | insert_no_store_hash_fn_imps.hpp | 57 const size_type pos = ranged_probe_fn_base::operator()(r_key, hash, i); in find_ins_pos() local
58 _GLIBCXX_DEBUG_ASSERT(pos < m_num_e); in find_ins_pos()
59 entry* const p_e = m_entries + pos; in find_ins_pos()
66 return (ins_pos == m_num_e) ? pos : ins_pos; in find_ins_pos()
71 ins_pos = pos; in find_ins_pos()
78 return pos; in find_ins_pos()
99 const size_type pos = find_ins_pos(r_key, in insert_imp() local
102 if (m_entries[pos].m_stat == valid_entry_status) in insert_imp()
105 return std::make_pair(&(m_entries + pos)->m_value, false); in insert_imp()
109 return std::make_pair(insert_new_imp(r_val, pos), true); in insert_imp()
|
| /l4re-core-master/libstdc++-v3/contrib/libstdc++-v3-5/src/filesystem/ |
| A D | path.cc | 336 size_t pos = 0; in _M_split_cmpts() local
355 pos = 3; in _M_split_cmpts()
356 while (pos < len && !_S_is_dir_sep(_M_pathname[pos])) in _M_split_cmpts()
357 ++pos; in _M_split_cmpts()
371 ++pos; in _M_split_cmpts()
380 pos = 2; in _M_split_cmpts()
385 while (pos < len) in _M_split_cmpts()
389 if (back != pos) in _M_split_cmpts()
391 back = ++pos; in _M_split_cmpts()
394 ++pos; in _M_split_cmpts()
[all …]
|
| /l4re-core-master/libstdc++-v3/contrib/libstdc++-v3-6/src/filesystem/ |
| A D | path.cc | 336 size_t pos = 0; in _M_split_cmpts() local
355 pos = 3; in _M_split_cmpts()
356 while (pos < len && !_S_is_dir_sep(_M_pathname[pos])) in _M_split_cmpts()
357 ++pos; in _M_split_cmpts()
371 ++pos; in _M_split_cmpts()
380 pos = 2; in _M_split_cmpts()
385 while (pos < len) in _M_split_cmpts()
389 if (back != pos) in _M_split_cmpts()
391 back = ++pos; in _M_split_cmpts()
394 ++pos; in _M_split_cmpts()
[all …]
|