| /prebuilts/ndk/6/sources/cxx-stl/stlport/stlport/stl/ |
| _time_facets.c | 81 difference_type __i, __start = 0; local
91 for (__i = __start; __i < __n; ++__i) {
92 if (!__do_not_check[__i]) {
93 if (*__first == __name[__i][__pos]) {
94 if (__pos == (__name[__i].size() - 1)) {
95 __matching_name_index = __i;
96 __do_not_check[__i] = true;
97 if (__i == __start) ++__start
[all...] |
| /prebuilts/ndk/7/sources/cxx-stl/stlport/stlport/stl/ |
| _algo.h | 556 _ForwardIter __i = _STLP_PRIV __lower_bound(__first, __last, __val, local
560 return __i != __last && !(__val < *__i);
568 _ForwardIter __i = _STLP_PRIV __lower_bound(__first, __last, __val, __comp, __comp, local
570 return __i != __last && !__comp(__val, *__i);
|
| _list.c | 96 iterator __i = begin(); local
98 for ( ; __i != end() && __len < __new_size; ++__i, ++__len);
101 erase(__i, end());
102 else // __i == end()
125 iterator __i = begin(); local
126 for ( ; __i != end() && __n > 0; ++__i, --__n)
127 *__i = __val;
131 erase(__i, end())
218 int __i = 0; local
[all...] |
| _time_facets.c | 81 difference_type __i, __start = 0; local
91 for (__i = __start; __i < __n; ++__i) {
92 if (!__do_not_check[__i]) {
93 if (*__first == __name[__i][__pos]) {
94 if (__pos == (__name[__i].size() - 1)) {
95 __matching_name_index = __i;
96 __do_not_check[__i] = true;
97 if (__i == __start) ++__start
[all...] |
| /prebuilts/ndk/8/sources/cxx-stl/stlport/stlport/stl/ |
| _algo.h | 556 _ForwardIter __i = _STLP_PRIV __lower_bound(__first, __last, __val, local
560 return __i != __last && !(__val < *__i);
568 _ForwardIter __i = _STLP_PRIV __lower_bound(__first, __last, __val, __comp, __comp, local
570 return __i != __last && !__comp(__val, *__i);
|
| _list.c | 96 iterator __i = begin(); local
98 for ( ; __i != end() && __len < __new_size; ++__i, ++__len);
101 erase(__i, end());
102 else // __i == end()
125 iterator __i = begin(); local
126 for ( ; __i != end() && __n > 0; ++__i, --__n)
127 *__i = __val;
131 erase(__i, end())
218 int __i = 0; local
[all...] |
| _time_facets.c | 81 difference_type __i, __start = 0; local
91 for (__i = __start; __i < __n; ++__i) {
92 if (!__do_not_check[__i]) {
93 if (*__first == __name[__i][__pos]) {
94 if (__pos == (__name[__i].size() - 1)) {
95 __matching_name_index = __i;
96 __do_not_check[__i] = true;
97 if (__i == __start) ++__start
[all...] |
| /prebuilts/ndk/9/sources/cxx-stl/EH/stlport/stlport/stl/ |
| _algo.h | 556 _ForwardIter __i = _STLP_PRIV __lower_bound(__first, __last, __val, local
560 return __i != __last && !(__val < *__i);
568 _ForwardIter __i = _STLP_PRIV __lower_bound(__first, __last, __val, __comp, __comp, local
570 return __i != __last && !__comp(__val, *__i);
|
| _list.c | 96 iterator __i = begin(); local
98 for ( ; __i != end() && __len < __new_size; ++__i, ++__len);
101 erase(__i, end());
102 else // __i == end()
125 iterator __i = begin(); local
126 for ( ; __i != end() && __n > 0; ++__i, --__n)
127 *__i = __val;
131 erase(__i, end())
218 int __i = 0; local
[all...] |
| _time_facets.c | 81 difference_type __i, __start = 0; local
91 for (__i = __start; __i < __n; ++__i) {
92 if (!__do_not_check[__i]) {
93 if (*__first == __name[__i][__pos]) {
94 if (__pos == (__name[__i].size() - 1)) {
95 __matching_name_index = __i;
96 __do_not_check[__i] = true;
97 if (__i == __start) ++__start
[all...] |
| /external/kernel-headers/original/asm-x86/ |
| local_32.h | 135 long __i; local
142 __i = i;
147 return i + __i;
152 __i = local_read(l);
153 local_set(l, i + __i);
155 return i + __i;
|
| /external/stlport/stlport/stl/ |
| _deque.c | 749 size_type __i = 1; local
751 for (; __i <= __new_nodes; ++__i)
752 *(this->_M_start._M_node - __i) = this->_M_map_size.allocate(this->buffer_size());
754 _STLP_UNWIND(for (size_type __j = 1; __j < __i; ++__j)
763 size_type __i = 1; local
765 for (; __i <= __new_nodes; ++__i)
766 *(this->_M_finish._M_node + __i) = this->_M_map_size.allocate(this->buffer_size());
768 _STLP_UNWIND(for (size_type __j = 1; __j < __i; ++__j
[all...] |
| _map.h | 176 iterator __i = lower_bound(__k); local
177 // __i->first is greater than or equivalent to __k.
178 if (__i == end() || key_comp()(__k, (*__i).first))
179 __i = insert(__i, value_type(__k, _STLP_DEFAULT_CONSTRUCTED(_Tp)));
180 return (*__i).second;
|
| _monetary.c | 148 int __i; local
153 for (__i = 0; __i < 4; ++__i) {
154 switch (__format.field[__i]) {
452 for (int __i = 0; __i < 4; ++__i) {
453 char __ffield = __format.field[__i];
|
| /external/stlport/stlport/stl/debug/ |
| _list.h | 293 _Base_iterator __i = _M_non_dbg_impl.begin(); local
295 for ( ; __i != _M_non_dbg_impl.end() && __len < __new_size; ++__i, ++__len);
298 erase(iterator(&_M_iter_list, __i), end());
299 else // __i == end()
371 void splice(iterator __pos, _Self& __x, iterator __i) {
373 _STLP_DEBUG_CHECK(_STLP_PRIV _Dereferenceable(__i))
374 _STLP_DEBUG_CHECK(_STLP_PRIV __check_if_owner(&(__x._M_iter_list),__i))
375 _M_non_dbg_impl.splice(__pos._M_iterator, __x._M_non_dbg_impl, __i._M_iterator);
378 _STLP_PRIV __change_ite_owner(__i, &_M_iter_list)
[all...] |
| _tree.h | 283 _Base_iterator __i = _M_non_dbg_impl.find(__x); local
284 if (__i != _M_non_dbg_impl.end()) {
285 _Invalidate_iterator(iterator(&_M_iter_list, __i));
286 _M_non_dbg_impl.erase(__i);
|
| /ndk/sources/cxx-stl/stlport/stlport/stl/ |
| _deque.c | 749 size_type __i = 1; local
751 for (; __i <= __new_nodes; ++__i)
752 *(this->_M_start._M_node - __i) = this->_M_map_size.allocate(this->buffer_size());
754 _STLP_UNWIND(for (size_type __j = 1; __j < __i; ++__j)
763 size_type __i = 1; local
765 for (; __i <= __new_nodes; ++__i)
766 *(this->_M_finish._M_node + __i) = this->_M_map_size.allocate(this->buffer_size());
768 _STLP_UNWIND(for (size_type __j = 1; __j < __i; ++__j
[all...] |
| _map.h | 176 iterator __i = lower_bound(__k); local
177 // __i->first is greater than or equivalent to __k.
178 if (__i == end() || key_comp()(__k, (*__i).first))
179 __i = insert(__i, value_type(__k, _STLP_DEFAULT_CONSTRUCTED(_Tp)));
180 return (*__i).second;
|
| _monetary.c | 148 int __i; local
153 for (__i = 0; __i < 4; ++__i) {
154 switch (__format.field[__i]) {
452 for (int __i = 0; __i < 4; ++__i) {
453 char __ffield = __format.field[__i];
|
| /ndk/sources/cxx-stl/stlport/stlport/stl/debug/ |
| _list.h | 293 _Base_iterator __i = _M_non_dbg_impl.begin(); local
295 for ( ; __i != _M_non_dbg_impl.end() && __len < __new_size; ++__i, ++__len);
298 erase(iterator(&_M_iter_list, __i), end());
299 else // __i == end()
371 void splice(iterator __pos, _Self& __x, iterator __i) {
373 _STLP_DEBUG_CHECK(_STLP_PRIV _Dereferenceable(__i))
374 _STLP_DEBUG_CHECK(_STLP_PRIV __check_if_owner(&(__x._M_iter_list),__i))
375 _M_non_dbg_impl.splice(__pos._M_iterator, __x._M_non_dbg_impl, __i._M_iterator);
378 _STLP_PRIV __change_ite_owner(__i, &_M_iter_list)
[all...] |
| _tree.h | 283 _Base_iterator __i = _M_non_dbg_impl.find(__x); local
284 if (__i != _M_non_dbg_impl.end()) {
285 _Invalidate_iterator(iterator(&_M_iter_list, __i));
286 _M_non_dbg_impl.erase(__i);
|
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/bits/ |
| stl_map.h | 447 iterator __i = lower_bound(__k); local
448 // __i->first is greater than or equivalent to __k.
449 if (__i == end() || key_comp()(__k, (*__i).first))
450 __i = insert(__i, value_type(__k, mapped_type()));
451 return (*__i).second;
466 iterator __i = lower_bound(__k); local
467 if (__i == end() || key_comp()(__k, (*__i).first)
475 const_iterator __i = lower_bound(__k); local
[all...] |
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/parallel/ |
| base.h | 87 int __i = omp_get_max_threads(); local
88 return __i > 1 ? __i : 1;
|
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/i686-linux/include/c++/4.6.x-google/bits/ |
| stl_map.h | 450 iterator __i = lower_bound(__k); local
451 // __i->first is greater than or equivalent to __k.
452 if (__i == end() || key_comp()(__k, (*__i).first))
453 __i = insert(__i, value_type(__k, mapped_type()));
454 return (*__i).second;
464 iterator __i = lower_bound(__k); local
465 // __i->first is greater than or equivalent to __k.
466 if (__i == end() || key_comp()(__k, (*__i).first)
484 iterator __i = lower_bound(__k); local
493 const_iterator __i = lower_bound(__k); local
[all...] |
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/i686-linux/include/c++/4.6.x-google/profile/ |
| map.h | 289 iterator __i = iterator(_Base::insert(__position, __x)); local
292 return __i;
303 iterator __i local
307 return __i;
325 iterator __i = _Base::erase(__position); local
327 return __i;
|
