| /prebuilts/ndk/android-ndk-r7/platforms/android-9/arch-x86/usr/include/asm/ |
| uaccess_32.h | 69 #define __m(x) (*(struct __large_struct __user *)(x)) macro
71 #define __put_user_asm(x, addr, err, itype, rtype, ltype, errret) __asm__ __volatile__( "1: mov"itype" %"rtype"1,%2\n" "2:\n" ".section .fixup,\"ax\"\n" "3: movl %3,%0\n" " jmp 2b\n" ".previous\n" ".section __ex_table,\"a\"\n" " .align 4\n" " .long 1b,3b\n" ".previous" : "=r"(err) : ltype (x), "m"(__m(addr)), "i"(errret), "0"(err))
77 #define __get_user_asm(x, addr, err, itype, rtype, ltype, errret) __asm__ __volatile__( "1: mov"itype" %2,%"rtype"1\n" "2:\n" ".section .fixup,\"ax\"\n" "3: movl %3,%0\n" " xor"itype" %"rtype"1,%"rtype"1\n" " jmp 2b\n" ".previous\n" ".section __ex_table,\"a\"\n" " .align 4\n" " .long 1b,3b\n" ".previous" : "=r"(err), ltype (x) : "m"(__m(addr)), "i"(errret), "0"(err))
|
| /bionic/libc/kernel/arch-mips/asm/ |
| uaccess.h | 47 #define __m(x) (*(struct __large_struct __user *)(x)) macro
52 #define __get_user_asm(val, insn, addr) { long __gu_tmp; __asm__ __volatile__( "1: " insn " %1, %3 \n" "2: \n" " .section .fixup,\"ax\" \n" "3: li %0, %4 \n" " j 2b \n" " .previous \n" " .section __ex_table,\"a\" \n" " "__UA_ADDR "\t1b, 3b \n" " .previous \n" : "=r" (__gu_err), "=r" (__gu_tmp) : "0" (0), "o" (__m(addr)), "i" (-EFAULT)); (val) = (__typeof__(*(addr))) __gu_tmp; }
57 #define __put_user_asm(insn, ptr) { __asm__ __volatile__( "1: " insn " %z2, %3 # __put_user_asm\n" "2: \n" " .section .fixup,\"ax\" \n" "3: li %0, %4 \n" " j 2b \n" " .previous \n" " .section __ex_table,\"a\" \n" " " __UA_ADDR " 1b, 3b \n" " .previous \n" : "=r" (__pu_err) : "0" (0), "Jr" (__pu_val), "o" (__m(ptr)), "i" (-EFAULT)); }
|
| /development/ndk/platforms/android-9/arch-mips/include/asm/ |
| uaccess.h | 47 #define __m(x) (*(struct __large_struct __user *)(x)) macro
52 #define __get_user_asm(val, insn, addr) { long __gu_tmp; __asm__ __volatile__( "1: " insn " %1, %3 \n" "2: \n" " .section .fixup,\"ax\" \n" "3: li %0, %4 \n" " j 2b \n" " .previous \n" " .section __ex_table,\"a\" \n" " "__UA_ADDR "\t1b, 3b \n" " .previous \n" : "=r" (__gu_err), "=r" (__gu_tmp) : "0" (0), "o" (__m(addr)), "i" (-EFAULT)); (val) = (__typeof__(*(addr))) __gu_tmp; }
57 #define __put_user_asm(insn, ptr) { __asm__ __volatile__( "1: " insn " %z2, %3 # __put_user_asm\n" "2: \n" " .section .fixup,\"ax\" \n" "3: li %0, %4 \n" " j 2b \n" " .previous \n" " .section __ex_table,\"a\" \n" " " __UA_ADDR " 1b, 3b \n" " .previous \n" : "=r" (__pu_err) : "0" (0), "Jr" (__pu_val), "o" (__m(ptr)), "i" (-EFAULT)); }
|
| /external/kernel-headers/original/asm-x86/ |
| uaccess_32.h | 326 #define __m(x) (*(struct __large_struct __user *)(x)) macro
346 : ltype (x), "m"(__m(addr)), "i"(errret), "0"(err))
386 : "m"(__m(addr)), "i"(errret), "0"(err))
|
| /prebuilts/gcc/darwin-x86/mips/mipsel-linux-android-4.4.3/sysroot/usr/include/asm/ |
| uaccess.h | 47 #define __m(x) (*(struct __large_struct __user *)(x)) macro
52 #define __get_user_asm(val, insn, addr) { long __gu_tmp; __asm__ __volatile__( "1: " insn " %1, %3 \n" "2: \n" " .section .fixup,\"ax\" \n" "3: li %0, %4 \n" " j 2b \n" " .previous \n" " .section __ex_table,\"a\" \n" " "__UA_ADDR "\t1b, 3b \n" " .previous \n" : "=r" (__gu_err), "=r" (__gu_tmp) : "0" (0), "o" (__m(addr)), "i" (-EFAULT)); (val) = (__typeof__(*(addr))) __gu_tmp; }
57 #define __put_user_asm(insn, ptr) { __asm__ __volatile__( "1: " insn " %z2, %3 # __put_user_asm\n" "2: \n" " .section .fixup,\"ax\" \n" "3: li %0, %4 \n" " j 2b \n" " .previous \n" " .section __ex_table,\"a\" \n" " " __UA_ADDR " 1b, 3b \n" " .previous \n" : "=r" (__pu_err) : "0" (0), "Jr" (__pu_val), "o" (__m(ptr)), "i" (-EFAULT)); }
|
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/i686-linux/include/c++/4.6.x-google/tr1/ |
| random.h | 64 template<typename _Tp, _Tp __a, _Tp __c, _Tp __m, bool>
69 template<typename _Tp, _Tp __a, _Tp __c, _Tp __m>
72 { return _Mod<_Tp, __a, __c, __m, __m == 0>::__calc(__x); }
348 * large enough to store values up to (__m-1). If the template parameter
349 * @p __m is 0, the modulus @p __m used is
351 * parameters @p __a and @p __c must be less than @p __m.
355 template<class _UIntType, _UIntType __a, _UIntType __c, _UIntType __m>
359 // __glibcpp_class_requires(__a < __m && __c < __m
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/x86_64-linux/include/c++/4.6.x-google/tr1/ |
| random.h | 64 template<typename _Tp, _Tp __a, _Tp __c, _Tp __m, bool>
69 template<typename _Tp, _Tp __a, _Tp __c, _Tp __m>
72 { return _Mod<_Tp, __a, __c, __m, __m == 0>::__calc(__x); }
348 * large enough to store values up to (__m-1). If the template parameter
349 * @p __m is 0, the modulus @p __m used is
351 * parameters @p __a and @p __c must be less than @p __m.
355 template<class _UIntType, _UIntType __a, _UIntType __c, _UIntType __m>
359 // __glibcpp_class_requires(__a < __m && __c < __m
[all...] |
| /prebuilts/gcc/linux-x86/mips/mipsel-linux-android-4.4.3/sysroot/usr/include/asm/ |
| uaccess.h | 47 #define __m(x) (*(struct __large_struct __user *)(x)) macro
52 #define __get_user_asm(val, insn, addr) { long __gu_tmp; __asm__ __volatile__( "1: " insn " %1, %3 \n" "2: \n" " .section .fixup,\"ax\" \n" "3: li %0, %4 \n" " j 2b \n" " .previous \n" " .section __ex_table,\"a\" \n" " "__UA_ADDR "\t1b, 3b \n" " .previous \n" : "=r" (__gu_err), "=r" (__gu_tmp) : "0" (0), "o" (__m(addr)), "i" (-EFAULT)); (val) = (__typeof__(*(addr))) __gu_tmp; }
57 #define __put_user_asm(insn, ptr) { __asm__ __volatile__( "1: " insn " %z2, %3 # __put_user_asm\n" "2: \n" " .section .fixup,\"ax\" \n" "3: li %0, %4 \n" " j 2b \n" " .previous \n" " .section __ex_table,\"a\" \n" " " __UA_ADDR " 1b, 3b \n" " .previous \n" : "=r" (__pu_err) : "0" (0), "Jr" (__pu_val), "o" (__m(ptr)), "i" (-EFAULT)); }
|
| /external/stlport/stlport/stl/ |
| _algo.c | 432 _EuclideanRingElement __gcd(_EuclideanRingElement __m,
435 _EuclideanRingElement __t = __m % __n;
436 __m = __n;
439 return __m;
564 _Distance __m = (min) (__n, __remaining); local
566 while (__m > 0) {
567 if (_STLP_PRIV __random_number(__remaining) < __m) {
570 --__m;
587 _Distance __m = (min) (__n, __remaining); local
589 while (__m > 0)
608 _Distance __m = 0; local
630 _Distance __m = 0; local
[all...] |
| _string.c | 401 const_iterator __m = __f + __len; local
402 _M_copy(__f, __m, __first);
403 _M_insert(__last, __m, __l, __self_ref );
405 const_iterator __m = __f + __len; local
409 _M_insert(__last, __m, __l, true);
412 const_iterator __m = __f + __len; local
414 _M_insert(__last, __m, __l, true);
|
| /ndk/sources/cxx-stl/stlport/stlport/stl/ |
| _algo.c | 432 _EuclideanRingElement __gcd(_EuclideanRingElement __m,
435 _EuclideanRingElement __t = __m % __n;
436 __m = __n;
439 return __m;
564 _Distance __m = (min) (__n, __remaining); local
566 while (__m > 0) {
567 if (_STLP_PRIV __random_number(__remaining) < __m) {
570 --__m;
587 _Distance __m = (min) (__n, __remaining); local
589 while (__m > 0)
608 _Distance __m = 0; local
630 _Distance __m = 0; local
[all...] |
| _string.c | 401 const_iterator __m = __f + __len; local
402 _M_copy(__f, __m, __first);
403 _M_insert(__last, __m, __l, __self_ref );
405 const_iterator __m = __f + __len; local
409 _M_insert(__last, __m, __l, true);
412 const_iterator __m = __f + __len; local
414 _M_insert(__last, __m, __l, true);
|
| /prebuilts/ndk/android-ndk-r5/sources/cxx-stl/stlport/stlport/stl/ |
| _algo.c | 432 _EuclideanRingElement __gcd(_EuclideanRingElement __m,
435 _EuclideanRingElement __t = __m % __n;
436 __m = __n;
439 return __m;
564 _Distance __m = (min) (__n, __remaining); local
566 while (__m > 0) {
567 if (_STLP_PRIV __random_number(__remaining) < __m) {
570 --__m;
587 _Distance __m = (min) (__n, __remaining); local
589 while (__m > 0)
608 _Distance __m = 0; local
630 _Distance __m = 0; local
[all...] |
| /prebuilts/ndk/android-ndk-r6/sources/cxx-stl/stlport/stlport/stl/ |
| _algo.c | 432 _EuclideanRingElement __gcd(_EuclideanRingElement __m,
435 _EuclideanRingElement __t = __m % __n;
436 __m = __n;
439 return __m;
564 _Distance __m = (min) (__n, __remaining); local
566 while (__m > 0) {
567 if (_STLP_PRIV __random_number(__remaining) < __m) {
570 --__m;
587 _Distance __m = (min) (__n, __remaining); local
589 while (__m > 0)
608 _Distance __m = 0; local
630 _Distance __m = 0; local
[all...] |
| /prebuilts/ndk/android-ndk-r7/sources/cxx-stl/stlport/stlport/stl/ |
| _algo.c | 432 _EuclideanRingElement __gcd(_EuclideanRingElement __m,
435 _EuclideanRingElement __t = __m % __n;
436 __m = __n;
439 return __m;
564 _Distance __m = (min) (__n, __remaining); local
566 while (__m > 0) {
567 if (_STLP_PRIV __random_number(__remaining) < __m) {
570 --__m;
587 _Distance __m = (min) (__n, __remaining); local
589 while (__m > 0)
608 _Distance __m = 0; local
630 _Distance __m = 0; local
[all...] |
| /external/stlport/src/ |
| ctype.cpp | 304 _Ctype_is_mask(ctype_base::mask __m, const ctype_base::mask* __t) : _Mask(__m), _M_table(__t) {}
312 _Ctype_not_mask(ctype_base::mask __m, const ctype_base::mask* __t) : _Mask(__m), _M_table(__t) {}
331 ctype<char>::scan_is(ctype_base::mask __m, const char* __low, const char* __high) const
332 { return _STLP_STD::find_if(__low, __high, _Ctype_is_mask(__m, _M_ctype_table)); }
338 ctype<char>::scan_not(ctype_base::mask __m, const char* __low, const char* __high) const
339 { return _STLP_STD::find_if(__low, __high, _Ctype_not_mask(__m, _M_ctype_table)); }
|
| /ndk/sources/cxx-stl/stlport/src/ |
| ctype.cpp | 304 _Ctype_is_mask(ctype_base::mask __m, const ctype_base::mask* __t) : _Mask(__m), _M_table(__t) {}
312 _Ctype_not_mask(ctype_base::mask __m, const ctype_base::mask* __t) : _Mask(__m), _M_table(__t) {}
331 ctype<char>::scan_is(ctype_base::mask __m, const char* __low, const char* __high) const
332 { return _STLP_STD::find_if(__low, __high, _Ctype_is_mask(__m, _M_ctype_table)); }
338 ctype<char>::scan_not(ctype_base::mask __m, const char* __low, const char* __high) const
339 { return _STLP_STD::find_if(__low, __high, _Ctype_not_mask(__m, _M_ctype_table)); }
|
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/backward/ |
| hashtable.h | 823 for (size_type __m = __n + 1; __m < _M_buckets.size(); ++__m)
824 if (_M_buckets[__m])
826 iterator(_M_buckets[__m], this));
851 for (size_type __m = __n + 1; __m < _M_buckets.size(); ++__m)
852 if (_M_buckets[__m])
854 const_iterator(_M_buckets[__m], this))
[all...] |
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/i686-linux/include/c++/4.6.x-google/backward/ |
| hashtable.h | 843 for (size_type __m = __n + 1; __m < _M_buckets.size(); ++__m)
844 if (_M_buckets[__m])
846 iterator(_M_buckets[__m], this));
871 for (size_type __m = __n + 1; __m < _M_buckets.size(); ++__m)
872 if (_M_buckets[__m])
874 const_iterator(_M_buckets[__m], this))
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/x86_64-linux/include/c++/4.6.x-google/backward/ |
| hashtable.h | 843 for (size_type __m = __n + 1; __m < _M_buckets.size(); ++__m)
844 if (_M_buckets[__m])
846 iterator(_M_buckets[__m], this));
871 for (size_type __m = __n + 1; __m < _M_buckets.size(); ++__m)
872 if (_M_buckets[__m])
874 const_iterator(_M_buckets[__m], this))
[all...] |
| /prebuilts/ndk/android-ndk-r5/sources/cxx-stl/gnu-libstdc++/include/backward/ |
| hashtable.h | 823 for (size_type __m = __n + 1; __m < _M_buckets.size(); ++__m)
824 if (_M_buckets[__m])
826 iterator(_M_buckets[__m], this));
851 for (size_type __m = __n + 1; __m < _M_buckets.size(); ++__m)
852 if (_M_buckets[__m])
854 const_iterator(_M_buckets[__m], this))
[all...] |
| /prebuilts/ndk/android-ndk-r6/sources/cxx-stl/gnu-libstdc++/include/backward/ |
| hashtable.h | 823 for (size_type __m = __n + 1; __m < _M_buckets.size(); ++__m)
824 if (_M_buckets[__m])
826 iterator(_M_buckets[__m], this));
851 for (size_type __m = __n + 1; __m < _M_buckets.size(); ++__m)
852 if (_M_buckets[__m])
854 const_iterator(_M_buckets[__m], this))
[all...] |
| /prebuilts/ndk/android-ndk-r7/sources/cxx-stl/gnu-libstdc++/include/backward/ |
| hashtable.h | 823 for (size_type __m = __n + 1; __m < _M_buckets.size(); ++__m)
824 if (_M_buckets[__m])
826 iterator(_M_buckets[__m], this));
851 for (size_type __m = __n + 1; __m < _M_buckets.size(); ++__m)
852 if (_M_buckets[__m])
854 const_iterator(_M_buckets[__m], this))
[all...] |
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/i686-linux/include/c++/4.6.x-google/bits/ |
| random.h | 79 template<typename _Tp, _Tp __m, _Tp __a, _Tp __c, bool>
84 template<typename _Tp, _Tp __m, _Tp __a = 1, _Tp __c = 0>
87 { return _Mod<_Tp, __m, __a, __c, __m == 0>::__calc(__x); }
162 * large enough to store values up to (__m-1). If the template parameter
163 * @p __m is 0, the modulus @p __m used is
165 * parameters @p __a and @p __c must be less than @p __m.
169 template<typename _UIntType, _UIntType __a, _UIntType __c, _UIntType __m>
174 static_assert(__m == 0u || (__a < __m && __c < __m)
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/x86_64-linux/include/c++/4.6.x-google/bits/ |
| random.h | 79 template<typename _Tp, _Tp __m, _Tp __a, _Tp __c, bool>
84 template<typename _Tp, _Tp __m, _Tp __a = 1, _Tp __c = 0>
87 { return _Mod<_Tp, __m, __a, __c, __m == 0>::__calc(__x); }
162 * large enough to store values up to (__m-1). If the template parameter
163 * @p __m is 0, the modulus @p __m used is
165 * parameters @p __a and @p __c must be less than @p __m.
169 template<typename _UIntType, _UIntType __a, _UIntType __c, _UIntType __m>
174 static_assert(__m == 0u || (__a < __m && __c < __m)
[all...] |
