Searched defs:__i (Results 1 - 25 of 35) sorted by relevance

12

/external/libcxx/src/
H A Dvalarray.cpp25 for (size_t __i = 0; __i < __size_.size(); ++__i)
26 __k *= __size_[__i];
34 size_t __i = __indices.size() - 1; local
37 if (++__indices[__i] < __size_[__i])
40 __1d_[__k] = __1d_[__k-1] + __stride_[__i];
41 for (size_t __j = __i + 1; __j != __indices.size(); ++__j)
47 if (__i
[all...]
H A Ddebug.cpp109 __libcpp_db::__find_c_from_i(void* __i) const
112 __i_node* i = __find_iterator(__i);
118 __libcpp_db::__insert_ic(void* __i, const void* __c) argument
133 __i_node* i = __insert_iterator(__i);
185 __libcpp_db::__erase_i(void* __i) argument
190 size_t hi = hash<void*>()(__i) % static_cast<size_t>(__iend_ - __ibeg_);
195 while (p->__i_ != __i)
323 __libcpp_db::__iterator_copy(void* __i, const void* __i0) argument
326 __i_node* i = __find_iterator(__i);
330 i = __insert_iterator(__i);
365 __addable(const void* __i, ptrdiff_t __n) const argument
373 __subscriptable(const void* __i, ptrdiff_t __n) const argument
381 __less_than_comparable(const void* __i, const void* __j) const argument
421 __insert_i(void* __i) argument
457 __insert_iterator(void* __i) argument
[all...]
/external/stlport/stlport/stl/
H A D_carray.h38 for (size_t __i = 0; __i < _Nb; ++__i) {
39 _Copy_Construct(__REINTERPRET_CAST(_Tp*, _M_data + __i * sizeof(_Tp)), __val);
48 _Tp& operator [] (size_t __i) { argument
49 _STLP_ASSERT(__i < _Nb)
50 return *__REINTERPRET_CAST(_Tp*, _M_data + __i * sizeof(_Tp));
H A D_threads.c124 unsigned __i; local
126 for (__i = 0; __i < __my_spin_max; ++__i) {
127 if (__i < __my_last_spins/2 || *__lock) {
136 _STLP_mutex_spin<0>::__last = __i;
146 for (__i = 0 ;; ++__i) {
147 int __log_nsec = __i + 6;
153 _S_nsec_sleep(__log_nsec, __i);
[all...]
H A D_complex.h124 value_type __i = _M_re * __z._M_im + _M_im * __z._M_re; local
126 _M_im = __i;
132 value_type __i; local
133 _div(_M_re, _M_im, __z._M_re, __z._M_im, __r, __i);
135 _M_im = __i;
154 value_type __i = _M_re * __z._M_im + _M_im * __z._M_re; local
156 _M_im = __i;
162 value_type __i; local
163 _div(_M_re, _M_im, __z._M_re, __z._M_im, __r, __i);
165 _M_im = __i;
259 float __i = _M_re * __z._M_im + _M_im * __z._M_re; local
268 float __i; local
297 value_type __i = _M_re * __z._M_im + _M_im * __z._M_re; local
305 value_type __i; local
397 double __i = _M_re * __z._M_im + _M_im * __z._M_re; local
406 double __i; local
435 value_type __i = _M_re * __z._M_im + _M_im * __z._M_re; local
443 value_type __i; local
537 long double __i = _M_re * __z._M_im + _M_im * __z._M_re; local
546 long double __i; local
575 value_type __i = _M_re * __z._M_im + _M_im * __z._M_re; local
583 value_type __i; local
[all...]
H A D_list.c96 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, en
218 int __i = 0; local
[all...]
H A D_slist.c193 int __i = 0; local
194 while (__i < __fill && !__counter[__i].empty()) {
195 _STLP_PRIV _Slist_merge(__counter[__i], __carry, __comp);
196 __carry.swap(__counter[__i]);
197 ++__i;
199 __carry.swap(__counter[__i]);
200 if (__i == __fill) {
209 for (int __i = 1; __i < __fil
[all...]
H A D_algo.h556 _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);
H A D_iterator.h230 insert_iterator(_Container& __x, typename _Container::iterator __i) argument
231 : container(&__x), _M_iter(__i) {}
250 inserter(_Container& __x, _Iterator __i) { argument
252 return insert_iterator<_Container>(__x, __iter(__i));
H A D_iterator_base.h480 __advance(_InputIter& __i, _Distance __n, const input_iterator_tag &) argument
481 { while (__n--) ++__i; }
486 __advance(_InputIter& __i, _Distance __n, const output_iterator_tag &) argument
487 { while (__n--) ++__i; }
498 __advance(_BidirectionalIterator& __i, _Distance __n, argument
501 while (__n--) ++__i;
503 while (__n++) --__i;
508 __advance(_RandomAccessIterator& __i, _Distance __n, argument
510 { __i += __n; }
515 inline void _STLP_CALL advance(_InputIterator& __i, _Distanc argument
[all...]
H A D_map.h176 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;
H A D_time_facets.c81 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
[all...]
H A D_deque.c749 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;
[all...]
H A D_monetary.c148 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];
H A D_function.h404 _STLP_UINT32_T __i; local
405 for (__i = 0; __i < 54; __i++) {
406 _STLP_UINT32_T __ii = (21 * (__i + 1) % 55) - 1;
412 for (__i = 0; __i < 55; __i++)
413 _M_table[__i] = _M_table[__i]
[all...]
H A Dconcept_checks.h407 __dereference_operator_requirement_violation(_Iterator __i) { argument
408 __sink_unused_warning(*__i);
412 __dereference_operator_and_assignment_requirement_violation(_Iterator __i) { argument
413 *__i = *__i;
417 __preincrement_operator_requirement_violation(_Iterator __i) { argument
418 ++__i;
422 __postincrement_operator_requirement_violation(_Iterator __i) { argument
423 __i++;
427 __predecrement_operator_requirement_violation(_Iterator __i) { argument
432 __postdecrement_operator_requirement_violation(_Iterator __i) argument
437 __postincrement_operator_and_assignment_requirement_violation(_Iterator __i, _Type __t) argument
443 __iterator_addition_assignment_requirement_violation(_Iterator __i, _Distance __n) argument
450 __iterator_addition_requirement_violation(_Iterator __i, _Distance __n) argument
457 __iterator_subtraction_assignment_requirement_violation(_Iterator __i, _Distance __n) argument
464 __iterator_subtraction_requirement_violation(_Iterator __i, _Distance __n) argument
470 __difference_operator_requirement_violation(_Iterator __i, _Iterator __j, _Distance __n) argument
569 _TrivialIterator_requirement_violation(_TrivialIterator __i) argument
590 _Mutable_TrivialIterator_requirement_violation(_TrivialIterator __i) argument
603 _InputIterator_requirement_violation(_InputIterator __i) argument
623 _OutputIterator_requirement_violation(_OutputIterator __i) argument
643 _ForwardIterator_requirement_violation(_ForwardIterator __i) argument
653 _Mutable_ForwardIterator_requirement_violation(_ForwardIterator __i) argument
667 _BidirectionalIterator_requirement_violation(_BidirectionalIterator __i) argument
680 _Mutable_BidirectionalIterator_requirement_violation( _BidirectionalIterator __i) argument
704 _RandomAccessIterator_requirement_violation(_RandAccIter __i) argument
743 _Mutable_RandomAccessIterator_requirement_violation(_RandAccIter __i) argument
[all...]
H A D_bvector.h131 void _M_advance (difference_type __i) { argument
132 difference_type __n = __i + _M_offset;
208 _Self& operator+=(difference_type __i) { argument
209 _M_advance(__i);
212 _Self& operator-=(difference_type __i) { argument
213 *this += -__i;
216 _Self operator+(difference_type __i) const {
218 return __tmp += __i;
220 _Self operator-(difference_type __i) const {
222 return __tmp -= __i;
227 operator [](difference_type __i) argument
406 iterator __i = _STLP_STD::copy(begin(), __position, iterator(__q, 0)); local
459 iterator __i = _STLP_STD::copy(begin(), __position, iterator(__q, 0)); local
732 iterator __i = _STLP_STD::copy(begin(), __position, iterator(__q, 0)); local
753 iterator __i = _STLP_STD::copy(begin(), __position, iterator(__q, 0)); local
774 iterator __i = _STLP_STD::copy(begin(), __position, iterator(__q, 0)); local
[all...]
/external/stlport/stlport/
H A Diostream.h87 iostream_withassign & operator=(ios& __i) { argument
88 ios::init(__i.rdbuf());
/external/stlport/stlport/stl/debug/
H A D_list.h293 _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) { argument
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,
[all...]
H A D_tree.h283 _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);
H A D_slist.h467 void splice(iterator __pos, _Self& __x, iterator __i) { argument
471 //__i should be dereferenceable, not before_begin and be owned by __x
472 _STLP_DEBUG_CHECK(_STLP_PRIV _Dereferenceable(__i))
473 _STLP_DEBUG_CHECK(_STLP_PRIV __check_if_owner(&__x._M_iter_list ,__i))
474 _STLP_VERBOSE_ASSERT(!(__i == __x.before_begin()), _StlMsg_INVALID_ARGUMENT)
476 _STLP_PRIV __change_ite_owner(__i, &_M_iter_list);
479 __x._Invalidate_iterator(__i);
481 _M_non_dbg_impl.splice(__pos._M_iterator, __x._M_non_dbg_impl, __i._M_iterator);
/external/stlport/stlport/stl/pointers/
H A D_list.h295 void splice(iterator __pos, _Self& __x, iterator __i) argument
296 { _M_impl.splice(_BaseIte(__pos._M_node), __x._M_impl, _BaseIte(__i._M_node)); }
H A D_slist.h375 void splice(iterator __pos, _Self& __x, iterator __i) argument
376 { _M_impl.splice(_BaseIte(__pos._M_node), __x._M_impl, _BaseIte(__i._M_node)); }
/external/clang/lib/Headers/
H A Dmmintrin.h44 _mm_cvtsi32_si64(int __i) argument
46 return (__m64)__builtin_ia32_vec_init_v2si(__i, 0);
56 _mm_cvtsi64_m64(long long __i) argument
58 return (__m64)__i;
406 _mm_set1_pi32(int __i) argument
408 return _mm_set_pi32(__i, __i);
/external/stlport/src/
H A Dallocators.cpp404 for (size_t __i = _p_size; __i <= (size_t)_MAX_BYTES; __i += (size_t)_ALIGN) {
405 __my_free_list = _S_free_list + _S_FREELIST_INDEX(__i);
410 _S_end_free = _S_start_free + __i;
598 for (size_t __i = _p_size; __i <= (size_t)_MAX_BYTES; __i += (size_t)_ALIGN) {
599 _Obj* __p = _S_free_list[_S_FREELIST_INDEX(__i)].pop();
601 if (__i < sizeo
860 size_t __i; local
[all...]

Completed in 654 milliseconds

12