/prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.8/include/bits/ |
atomic_base.h | 280 constexpr atomic_flag(bool __i) noexcept 281 : __atomic_flag_base{ _S_init(__i) } 320 _S_init(bool __i) 321 { return __i ? __GCC_ATOMIC_TEST_AND_SET_TRUEVAL : 0; } 364 constexpr __atomic_base(__int_type __i) noexcept : _M_i (__i) { } 373 operator=(__int_type __i) noexcept 375 store(__i); variable 376 return __i; 380 operator=(__int_type __i) volatile noexcep 382 store(__i); variable [all...] |
stl_iterator_base_funcs.h | 123 __advance(_InputIterator& __i, _Distance __n, input_iterator_tag) 129 ++__i; 134 __advance(_BidirectionalIterator& __i, _Distance __n, 142 ++__i; 145 --__i; 150 __advance(_RandomAccessIterator& __i, _Distance __n, 156 __i += __n; 161 * @param __i An input iterator. 162 * @param __n The @a delta by which to change @p __i. 166 * iterators, @p __n may be negative, in which case @p __i is decremented [all...] |
/prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/sysroot/usr/include/X11/ |
Xpoll.h | 209 u_int __i; \ 211 for (__i = 0; __i < XFD_SETCOUNT(src) ; __i++) { \ 212 XFD_FD(dst,__i) = XFD_FD(src,__i); \ 218 u_int __i; \ 220 for (__i = 0; __i < XFD_SETCOUNT(b1) ; __i++) { [all...] |
/prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/sysroot/usr/include/X11/ |
Xpoll.h | 209 u_int __i; \ 211 for (__i = 0; __i < XFD_SETCOUNT(src) ; __i++) { \ 212 XFD_FD(dst,__i) = XFD_FD(src,__i); \ 218 u_int __i; \ 220 for (__i = 0; __i < XFD_SETCOUNT(b1) ; __i++) { [all...] |
/prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/sysroot/usr/include/X11/ |
Xpoll.h | 209 u_int __i; \ 211 for (__i = 0; __i < XFD_SETCOUNT(src) ; __i++) { \ 212 XFD_FD(dst,__i) = XFD_FD(src,__i); \ 218 u_int __i; \ 220 for (__i = 0; __i < XFD_SETCOUNT(b1) ; __i++) { [all...] |
/prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.7/include/bits/ |
atomic_base.h | 252 constexpr atomic_flag(bool __i) noexcept 253 : __atomic_flag_base({ __i ? __GCC_ATOMIC_TEST_AND_SET_TRUEVAL : 0 }) 329 constexpr __atomic_base(__int_type __i) noexcept : _M_i (__i) { } 338 operator=(__int_type __i) noexcept 340 store(__i); variable 341 return __i; 345 operator=(__int_type __i) volatile noexcept 347 store(__i); variable 348 return __i; [all...] |
stl_iterator_base_funcs.h | 123 __advance(_InputIterator& __i, _Distance __n, input_iterator_tag) 128 ++__i; 133 __advance(_BidirectionalIterator& __i, _Distance __n, 141 ++__i; 144 --__i; 149 __advance(_RandomAccessIterator& __i, _Distance __n, 155 __i += __n; 160 * @param __i An input iterator. 161 * @param __n The @a delta by which to change @p __i. 165 * iterators, @p __n may be negative, in which case @p __i is decremented [all...] |
/prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.7/include/bits/ |
atomic_base.h | 252 constexpr atomic_flag(bool __i) noexcept 253 : __atomic_flag_base({ __i ? __GCC_ATOMIC_TEST_AND_SET_TRUEVAL : 0 }) 329 constexpr __atomic_base(__int_type __i) noexcept : _M_i (__i) { } 338 operator=(__int_type __i) noexcept 340 store(__i); variable 341 return __i; 345 operator=(__int_type __i) volatile noexcept 347 store(__i); variable 348 return __i; [all...] |
stl_iterator_base_funcs.h | 123 __advance(_InputIterator& __i, _Distance __n, input_iterator_tag) 128 ++__i; 133 __advance(_BidirectionalIterator& __i, _Distance __n, 141 ++__i; 144 --__i; 149 __advance(_RandomAccessIterator& __i, _Distance __n, 155 __i += __n; 160 * @param __i An input iterator. 161 * @param __n The @a delta by which to change @p __i. 165 * iterators, @p __n may be negative, in which case @p __i is decremented [all...] |
/external/iptables/include/linux/netfilter/ |
x_tables.h | 124 unsigned int __i; \ 128 for (__i = sizeof(type); \ 129 __i < (e)->target_offset; \ 130 __i += __m->u.match_size) { \ 131 __m = (void *)e + __i; \ 143 unsigned int __i, __n; \ 147 for (__i = 0, __n = 0; __i < (size); \ 148 __i += __entry->next_offset, __n++) { \ 149 __entry = (void *)(entries) + __i; \ [all...] |
/prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/bits/ |
stl_iterator_base_funcs.h | 119 __advance(_InputIterator& __i, _Distance __n, input_iterator_tag) 124 ++__i; 129 __advance(_BidirectionalIterator& __i, _Distance __n, 137 ++__i; 140 --__i; 145 __advance(_RandomAccessIterator& __i, _Distance __n, 151 __i += __n; 168 advance(_InputIterator& __i, _Distance __n) 172 std::__advance(__i, __d, std::__iterator_category(__i)); [all...] |
char_traits.h | 154 for (std::size_t __i = 0; __i < __n; ++__i) 155 if (lt(__s1[__i], __s2[__i])) 157 else if (lt(__s2[__i], __s1[__i])) 167 std::size_t __i = 0; local 168 while (!eq(__p[__i], char_type())) 169 ++__i; 418 size_t __i = 0; local 511 size_t __i = 0; local [all...] |
/prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/i686-linux/include/c++/4.6.x-google/bits/ |
stl_iterator_base_funcs.h | 122 __advance(_InputIterator& __i, _Distance __n, input_iterator_tag) 127 ++__i; 132 __advance(_BidirectionalIterator& __i, _Distance __n, 140 ++__i; 143 --__i; 148 __advance(_RandomAccessIterator& __i, _Distance __n, 154 __i += __n; 171 advance(_InputIterator& __i, _Distance __n) 175 std::__advance(__i, __d, std::__iterator_category(__i)); [all...] |
char_traits.h | 149 for (std::size_t __i = 0; __i < __n; ++__i) 150 if (lt(__s1[__i], __s2[__i])) 152 else if (lt(__s2[__i], __s1[__i])) 162 std::size_t __i = 0; local 163 while (!eq(__p[__i], char_type())) 164 ++__i; 419 size_t __i = 0; local 512 size_t __i = 0; local [all...] |
/prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/x86_64-linux/include/c++/4.6.x-google/bits/ |
stl_iterator_base_funcs.h | 122 __advance(_InputIterator& __i, _Distance __n, input_iterator_tag) 127 ++__i; 132 __advance(_BidirectionalIterator& __i, _Distance __n, 140 ++__i; 143 --__i; 148 __advance(_RandomAccessIterator& __i, _Distance __n, 154 __i += __n; 171 advance(_InputIterator& __i, _Distance __n) 175 std::__advance(__i, __d, std::__iterator_category(__i)); [all...] |
char_traits.h | 149 for (std::size_t __i = 0; __i < __n; ++__i) 150 if (lt(__s1[__i], __s2[__i])) 152 else if (lt(__s2[__i], __s1[__i])) 162 std::size_t __i = 0; local 163 while (!eq(__p[__i], char_type())) 164 ++__i; 419 size_t __i = 0; local 512 size_t __i = 0; local [all...] |
/prebuilts/ndk/5/sources/cxx-stl/gnu-libstdc++/include/bits/ |
stl_iterator_base_funcs.h | 119 __advance(_InputIterator& __i, _Distance __n, input_iterator_tag) 124 ++__i; 129 __advance(_BidirectionalIterator& __i, _Distance __n, 137 ++__i; 140 --__i; 145 __advance(_RandomAccessIterator& __i, _Distance __n, 151 __i += __n; 168 advance(_InputIterator& __i, _Distance __n) 172 std::__advance(__i, __d, std::__iterator_category(__i)); [all...] |
char_traits.h | 154 for (std::size_t __i = 0; __i < __n; ++__i) 155 if (lt(__s1[__i], __s2[__i])) 157 else if (lt(__s2[__i], __s1[__i])) 167 std::size_t __i = 0; local 168 while (!eq(__p[__i], char_type())) 169 ++__i; 418 size_t __i = 0; local 511 size_t __i = 0; local [all...] |
/prebuilts/ndk/6/sources/cxx-stl/gnu-libstdc++/include/bits/ |
stl_iterator_base_funcs.h | 119 __advance(_InputIterator& __i, _Distance __n, input_iterator_tag) 124 ++__i; 129 __advance(_BidirectionalIterator& __i, _Distance __n, 137 ++__i; 140 --__i; 145 __advance(_RandomAccessIterator& __i, _Distance __n, 151 __i += __n; 168 advance(_InputIterator& __i, _Distance __n) 172 std::__advance(__i, __d, std::__iterator_category(__i)); [all...] |
char_traits.h | 154 for (std::size_t __i = 0; __i < __n; ++__i) 155 if (lt(__s1[__i], __s2[__i])) 157 else if (lt(__s2[__i], __s1[__i])) 167 std::size_t __i = 0; local 168 while (!eq(__p[__i], char_type())) 169 ++__i; 418 size_t __i = 0; local 511 size_t __i = 0; local [all...] |
/prebuilts/ndk/7/sources/cxx-stl/gnu-libstdc++/include/bits/ |
stl_iterator_base_funcs.h | 119 __advance(_InputIterator& __i, _Distance __n, input_iterator_tag) 124 ++__i; 129 __advance(_BidirectionalIterator& __i, _Distance __n, 137 ++__i; 140 --__i; 145 __advance(_RandomAccessIterator& __i, _Distance __n, 151 __i += __n; 168 advance(_InputIterator& __i, _Distance __n) 172 std::__advance(__i, __d, std::__iterator_category(__i)); [all...] |
char_traits.h | 154 for (std::size_t __i = 0; __i < __n; ++__i) 155 if (lt(__s1[__i], __s2[__i])) 157 else if (lt(__s2[__i], __s1[__i])) 167 std::size_t __i = 0; local 168 while (!eq(__p[__i], char_type())) 169 ++__i; 418 size_t __i = 0; local 511 size_t __i = 0; local [all...] |
/prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.4.3/include/bits/ |
stl_iterator_base_funcs.h | 119 __advance(_InputIterator& __i, _Distance __n, input_iterator_tag) 124 ++__i; 129 __advance(_BidirectionalIterator& __i, _Distance __n, 137 ++__i; 140 --__i; 145 __advance(_RandomAccessIterator& __i, _Distance __n, 151 __i += __n; 168 advance(_InputIterator& __i, _Distance __n) 172 std::__advance(__i, __d, std::__iterator_category(__i)); [all...] |
/prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.6/include/bits/ |
stl_iterator_base_funcs.h | 122 __advance(_InputIterator& __i, _Distance __n, input_iterator_tag) 127 ++__i; 132 __advance(_BidirectionalIterator& __i, _Distance __n, 140 ++__i; 143 --__i; 148 __advance(_RandomAccessIterator& __i, _Distance __n, 154 __i += __n; 171 advance(_InputIterator& __i, _Distance __n) 175 std::__advance(__i, __d, std::__iterator_category(__i)); [all...] |
/prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.6/include/bits/ |
stl_iterator_base_funcs.h | 122 __advance(_InputIterator& __i, _Distance __n, input_iterator_tag) 127 ++__i; 132 __advance(_BidirectionalIterator& __i, _Distance __n, 140 ++__i; 143 --__i; 148 __advance(_RandomAccessIterator& __i, _Distance __n, 154 __i += __n; 171 advance(_InputIterator& __i, _Distance __n) 175 std::__advance(__i, __d, std::__iterator_category(__i)); [all...] |