| /OK3568_Linux_fs/external/rk_pcba_test/pcba_minui/ |
| H A D | safe_iop.c | 20 /* Read off the type if the first value matches a type prefix 30 /* Extract a type for the operation if there is one */ in _safe_op_read_type() 56 _type a = va_arg(ap, _type), value = *((_type *) result); \ 58 value = a; \ 59 a = va_arg(ap, _type); \ 62 if (! _func( (_type *) result, value, a)) \ 183 int8_t a, b; in T_add_s8() local 184 a=SCHAR_MIN; b=-1; EXPECT_FALSE(safe_add(NULL, a, b)); in T_add_s8() 185 a=SCHAR_MAX; b=1; EXPECT_FALSE(safe_add(NULL, a, b)); in T_add_s8() 186 a=10; b=11; EXPECT_TRUE(safe_add(NULL, a, b)); in T_add_s8() [all …]
|
| /OK3568_Linux_fs/external/recovery/ |
| H A D | safe_iop.c | 20 /* Read off the type if the first value matches a type prefix 31 /* Extract a type for the operation if there is one */ in _safe_op_read_type() 57 _type a = va_arg(ap, _type), value = *((_type *) result); \ 59 value = a; \ 60 a = va_arg(ap, _type); \ 63 if (! _func( (_type *) result, value, a)) \ 186 int8_t a, b; in T_add_s8() local 187 a = SCHAR_MIN; b = -1; EXPECT_FALSE(safe_add(NULL, a, b)); in T_add_s8() 188 a = SCHAR_MAX; b = 1; EXPECT_FALSE(safe_add(NULL, a, b)); in T_add_s8() 189 a = 10; b = 11; EXPECT_TRUE(safe_add(NULL, a, b)); in T_add_s8() [all …]
|
| /OK3568_Linux_fs/buildroot/dl/qt5location/git/src/3rdparty/mapbox-gl-native/deps/boost/1.65.1/include/boost/math/tools/detail/ |
| H A D | polynomial_horner1_20.hpp | 21 inline V evaluate_polynomial_c_imp(const T* a, const V&, const mpl::int_<1>*) BOOST_MATH_NOEXCEPT(V) in evaluate_polynomial_c_imp() argument 23 return static_cast<V>(a[0]); in evaluate_polynomial_c_imp() 27 inline V evaluate_polynomial_c_imp(const T* a, const V& x, const mpl::int_<2>*) BOOST_MATH_NOEXCEPT… in evaluate_polynomial_c_imp() argument 29 return static_cast<V>(a[1] * x + a[0]); in evaluate_polynomial_c_imp() 33 inline V evaluate_polynomial_c_imp(const T* a, const V& x, const mpl::int_<3>*) BOOST_MATH_NOEXCEPT… in evaluate_polynomial_c_imp() argument 35 return static_cast<V>((a[2] * x + a[1]) * x + a[0]); in evaluate_polynomial_c_imp() 39 inline V evaluate_polynomial_c_imp(const T* a, const V& x, const mpl::int_<4>*) BOOST_MATH_NOEXCEPT… in evaluate_polynomial_c_imp() argument 41 return static_cast<V>(((a[3] * x + a[2]) * x + a[1]) * x + a[0]); in evaluate_polynomial_c_imp() 45 inline V evaluate_polynomial_c_imp(const T* a, const V& x, const mpl::int_<5>*) BOOST_MATH_NOEXCEPT… in evaluate_polynomial_c_imp() argument 47 return static_cast<V>((((a[4] * x + a[3]) * x + a[2]) * x + a[1]) * x + a[0]); in evaluate_polynomial_c_imp() [all …]
|
| H A D | polynomial_horner2_20.hpp | 21 inline V evaluate_polynomial_c_imp(const T* a, const V&, const mpl::int_<1>*) BOOST_MATH_NOEXCEPT(V) in evaluate_polynomial_c_imp() argument 23 return static_cast<V>(a[0]); in evaluate_polynomial_c_imp() 27 inline V evaluate_polynomial_c_imp(const T* a, const V& x, const mpl::int_<2>*) BOOST_MATH_NOEXCEPT… in evaluate_polynomial_c_imp() argument 29 return static_cast<V>(a[1] * x + a[0]); in evaluate_polynomial_c_imp() 33 inline V evaluate_polynomial_c_imp(const T* a, const V& x, const mpl::int_<3>*) BOOST_MATH_NOEXCEPT… in evaluate_polynomial_c_imp() argument 35 return static_cast<V>((a[2] * x + a[1]) * x + a[0]); in evaluate_polynomial_c_imp() 39 inline V evaluate_polynomial_c_imp(const T* a, const V& x, const mpl::int_<4>*) BOOST_MATH_NOEXCEPT… in evaluate_polynomial_c_imp() argument 41 return static_cast<V>(((a[3] * x + a[2]) * x + a[1]) * x + a[0]); in evaluate_polynomial_c_imp() 45 inline V evaluate_polynomial_c_imp(const T* a, const V& x, const mpl::int_<5>*) BOOST_MATH_NOEXCEPT… in evaluate_polynomial_c_imp() argument 48 return static_cast<V>((a[4] * x2 + a[2]) * x2 + a[0] + (a[3] * x2 + a[1]) * x); in evaluate_polynomial_c_imp() [all …]
|
| H A D | polynomial_horner2_19.hpp | 21 inline V evaluate_polynomial_c_imp(const T* a, const V&, const mpl::int_<1>*) BOOST_MATH_NOEXCEPT(V) in evaluate_polynomial_c_imp() argument 23 return static_cast<V>(a[0]); in evaluate_polynomial_c_imp() 27 inline V evaluate_polynomial_c_imp(const T* a, const V& x, const mpl::int_<2>*) BOOST_MATH_NOEXCEPT… in evaluate_polynomial_c_imp() argument 29 return static_cast<V>(a[1] * x + a[0]); in evaluate_polynomial_c_imp() 33 inline V evaluate_polynomial_c_imp(const T* a, const V& x, const mpl::int_<3>*) BOOST_MATH_NOEXCEPT… in evaluate_polynomial_c_imp() argument 35 return static_cast<V>((a[2] * x + a[1]) * x + a[0]); in evaluate_polynomial_c_imp() 39 inline V evaluate_polynomial_c_imp(const T* a, const V& x, const mpl::int_<4>*) BOOST_MATH_NOEXCEPT… in evaluate_polynomial_c_imp() argument 41 return static_cast<V>(((a[3] * x + a[2]) * x + a[1]) * x + a[0]); in evaluate_polynomial_c_imp() 45 inline V evaluate_polynomial_c_imp(const T* a, const V& x, const mpl::int_<5>*) BOOST_MATH_NOEXCEPT… in evaluate_polynomial_c_imp() argument 48 return static_cast<V>((a[4] * x2 + a[2]) * x2 + a[0] + (a[3] * x2 + a[1]) * x); in evaluate_polynomial_c_imp() [all …]
|
| H A D | polynomial_horner1_19.hpp | 21 inline V evaluate_polynomial_c_imp(const T* a, const V&, const mpl::int_<1>*) BOOST_MATH_NOEXCEPT(V) in evaluate_polynomial_c_imp() argument 23 return static_cast<V>(a[0]); in evaluate_polynomial_c_imp() 27 inline V evaluate_polynomial_c_imp(const T* a, const V& x, const mpl::int_<2>*) BOOST_MATH_NOEXCEPT… in evaluate_polynomial_c_imp() argument 29 return static_cast<V>(a[1] * x + a[0]); in evaluate_polynomial_c_imp() 33 inline V evaluate_polynomial_c_imp(const T* a, const V& x, const mpl::int_<3>*) BOOST_MATH_NOEXCEPT… in evaluate_polynomial_c_imp() argument 35 return static_cast<V>((a[2] * x + a[1]) * x + a[0]); in evaluate_polynomial_c_imp() 39 inline V evaluate_polynomial_c_imp(const T* a, const V& x, const mpl::int_<4>*) BOOST_MATH_NOEXCEPT… in evaluate_polynomial_c_imp() argument 41 return static_cast<V>(((a[3] * x + a[2]) * x + a[1]) * x + a[0]); in evaluate_polynomial_c_imp() 45 inline V evaluate_polynomial_c_imp(const T* a, const V& x, const mpl::int_<5>*) BOOST_MATH_NOEXCEPT… in evaluate_polynomial_c_imp() argument 47 return static_cast<V>((((a[4] * x + a[3]) * x + a[2]) * x + a[1]) * x + a[0]); in evaluate_polynomial_c_imp() [all …]
|
| H A D | polynomial_horner2_18.hpp | 21 inline V evaluate_polynomial_c_imp(const T* a, const V&, const mpl::int_<1>*) BOOST_MATH_NOEXCEPT(V) in evaluate_polynomial_c_imp() argument 23 return static_cast<V>(a[0]); in evaluate_polynomial_c_imp() 27 inline V evaluate_polynomial_c_imp(const T* a, const V& x, const mpl::int_<2>*) BOOST_MATH_NOEXCEPT… in evaluate_polynomial_c_imp() argument 29 return static_cast<V>(a[1] * x + a[0]); in evaluate_polynomial_c_imp() 33 inline V evaluate_polynomial_c_imp(const T* a, const V& x, const mpl::int_<3>*) BOOST_MATH_NOEXCEPT… in evaluate_polynomial_c_imp() argument 35 return static_cast<V>((a[2] * x + a[1]) * x + a[0]); in evaluate_polynomial_c_imp() 39 inline V evaluate_polynomial_c_imp(const T* a, const V& x, const mpl::int_<4>*) BOOST_MATH_NOEXCEPT… in evaluate_polynomial_c_imp() argument 41 return static_cast<V>(((a[3] * x + a[2]) * x + a[1]) * x + a[0]); in evaluate_polynomial_c_imp() 45 inline V evaluate_polynomial_c_imp(const T* a, const V& x, const mpl::int_<5>*) BOOST_MATH_NOEXCEPT… in evaluate_polynomial_c_imp() argument 48 return static_cast<V>((a[4] * x2 + a[2]) * x2 + a[0] + (a[3] * x2 + a[1]) * x); in evaluate_polynomial_c_imp() [all …]
|
| H A D | polynomial_horner1_18.hpp | 21 inline V evaluate_polynomial_c_imp(const T* a, const V&, const mpl::int_<1>*) BOOST_MATH_NOEXCEPT(V) in evaluate_polynomial_c_imp() argument 23 return static_cast<V>(a[0]); in evaluate_polynomial_c_imp() 27 inline V evaluate_polynomial_c_imp(const T* a, const V& x, const mpl::int_<2>*) BOOST_MATH_NOEXCEPT… in evaluate_polynomial_c_imp() argument 29 return static_cast<V>(a[1] * x + a[0]); in evaluate_polynomial_c_imp() 33 inline V evaluate_polynomial_c_imp(const T* a, const V& x, const mpl::int_<3>*) BOOST_MATH_NOEXCEPT… in evaluate_polynomial_c_imp() argument 35 return static_cast<V>((a[2] * x + a[1]) * x + a[0]); in evaluate_polynomial_c_imp() 39 inline V evaluate_polynomial_c_imp(const T* a, const V& x, const mpl::int_<4>*) BOOST_MATH_NOEXCEPT… in evaluate_polynomial_c_imp() argument 41 return static_cast<V>(((a[3] * x + a[2]) * x + a[1]) * x + a[0]); in evaluate_polynomial_c_imp() 45 inline V evaluate_polynomial_c_imp(const T* a, const V& x, const mpl::int_<5>*) BOOST_MATH_NOEXCEPT… in evaluate_polynomial_c_imp() argument 47 return static_cast<V>((((a[4] * x + a[3]) * x + a[2]) * x + a[1]) * x + a[0]); in evaluate_polynomial_c_imp() [all …]
|
| H A D | polynomial_horner1_17.hpp | 21 inline V evaluate_polynomial_c_imp(const T* a, const V&, const mpl::int_<1>*) BOOST_MATH_NOEXCEPT(V) in evaluate_polynomial_c_imp() argument 23 return static_cast<V>(a[0]); in evaluate_polynomial_c_imp() 27 inline V evaluate_polynomial_c_imp(const T* a, const V& x, const mpl::int_<2>*) BOOST_MATH_NOEXCEPT… in evaluate_polynomial_c_imp() argument 29 return static_cast<V>(a[1] * x + a[0]); in evaluate_polynomial_c_imp() 33 inline V evaluate_polynomial_c_imp(const T* a, const V& x, const mpl::int_<3>*) BOOST_MATH_NOEXCEPT… in evaluate_polynomial_c_imp() argument 35 return static_cast<V>((a[2] * x + a[1]) * x + a[0]); in evaluate_polynomial_c_imp() 39 inline V evaluate_polynomial_c_imp(const T* a, const V& x, const mpl::int_<4>*) BOOST_MATH_NOEXCEPT… in evaluate_polynomial_c_imp() argument 41 return static_cast<V>(((a[3] * x + a[2]) * x + a[1]) * x + a[0]); in evaluate_polynomial_c_imp() 45 inline V evaluate_polynomial_c_imp(const T* a, const V& x, const mpl::int_<5>*) BOOST_MATH_NOEXCEPT… in evaluate_polynomial_c_imp() argument 47 return static_cast<V>((((a[4] * x + a[3]) * x + a[2]) * x + a[1]) * x + a[0]); in evaluate_polynomial_c_imp() [all …]
|
| H A D | polynomial_horner2_17.hpp | 21 inline V evaluate_polynomial_c_imp(const T* a, const V&, const mpl::int_<1>*) BOOST_MATH_NOEXCEPT(V) in evaluate_polynomial_c_imp() argument 23 return static_cast<V>(a[0]); in evaluate_polynomial_c_imp() 27 inline V evaluate_polynomial_c_imp(const T* a, const V& x, const mpl::int_<2>*) BOOST_MATH_NOEXCEPT… in evaluate_polynomial_c_imp() argument 29 return static_cast<V>(a[1] * x + a[0]); in evaluate_polynomial_c_imp() 33 inline V evaluate_polynomial_c_imp(const T* a, const V& x, const mpl::int_<3>*) BOOST_MATH_NOEXCEPT… in evaluate_polynomial_c_imp() argument 35 return static_cast<V>((a[2] * x + a[1]) * x + a[0]); in evaluate_polynomial_c_imp() 39 inline V evaluate_polynomial_c_imp(const T* a, const V& x, const mpl::int_<4>*) BOOST_MATH_NOEXCEPT… in evaluate_polynomial_c_imp() argument 41 return static_cast<V>(((a[3] * x + a[2]) * x + a[1]) * x + a[0]); in evaluate_polynomial_c_imp() 45 inline V evaluate_polynomial_c_imp(const T* a, const V& x, const mpl::int_<5>*) BOOST_MATH_NOEXCEPT… in evaluate_polynomial_c_imp() argument 48 return static_cast<V>((a[4] * x2 + a[2]) * x2 + a[0] + (a[3] * x2 + a[1]) * x); in evaluate_polynomial_c_imp() [all …]
|
| H A D | polynomial_horner1_16.hpp | 21 inline V evaluate_polynomial_c_imp(const T* a, const V&, const mpl::int_<1>*) BOOST_MATH_NOEXCEPT(V) in evaluate_polynomial_c_imp() argument 23 return static_cast<V>(a[0]); in evaluate_polynomial_c_imp() 27 inline V evaluate_polynomial_c_imp(const T* a, const V& x, const mpl::int_<2>*) BOOST_MATH_NOEXCEPT… in evaluate_polynomial_c_imp() argument 29 return static_cast<V>(a[1] * x + a[0]); in evaluate_polynomial_c_imp() 33 inline V evaluate_polynomial_c_imp(const T* a, const V& x, const mpl::int_<3>*) BOOST_MATH_NOEXCEPT… in evaluate_polynomial_c_imp() argument 35 return static_cast<V>((a[2] * x + a[1]) * x + a[0]); in evaluate_polynomial_c_imp() 39 inline V evaluate_polynomial_c_imp(const T* a, const V& x, const mpl::int_<4>*) BOOST_MATH_NOEXCEPT… in evaluate_polynomial_c_imp() argument 41 return static_cast<V>(((a[3] * x + a[2]) * x + a[1]) * x + a[0]); in evaluate_polynomial_c_imp() 45 inline V evaluate_polynomial_c_imp(const T* a, const V& x, const mpl::int_<5>*) BOOST_MATH_NOEXCEPT… in evaluate_polynomial_c_imp() argument 47 return static_cast<V>((((a[4] * x + a[3]) * x + a[2]) * x + a[1]) * x + a[0]); in evaluate_polynomial_c_imp() [all …]
|
| H A D | polynomial_horner2_16.hpp | 21 inline V evaluate_polynomial_c_imp(const T* a, const V&, const mpl::int_<1>*) BOOST_MATH_NOEXCEPT(V) in evaluate_polynomial_c_imp() argument 23 return static_cast<V>(a[0]); in evaluate_polynomial_c_imp() 27 inline V evaluate_polynomial_c_imp(const T* a, const V& x, const mpl::int_<2>*) BOOST_MATH_NOEXCEPT… in evaluate_polynomial_c_imp() argument 29 return static_cast<V>(a[1] * x + a[0]); in evaluate_polynomial_c_imp() 33 inline V evaluate_polynomial_c_imp(const T* a, const V& x, const mpl::int_<3>*) BOOST_MATH_NOEXCEPT… in evaluate_polynomial_c_imp() argument 35 return static_cast<V>((a[2] * x + a[1]) * x + a[0]); in evaluate_polynomial_c_imp() 39 inline V evaluate_polynomial_c_imp(const T* a, const V& x, const mpl::int_<4>*) BOOST_MATH_NOEXCEPT… in evaluate_polynomial_c_imp() argument 41 return static_cast<V>(((a[3] * x + a[2]) * x + a[1]) * x + a[0]); in evaluate_polynomial_c_imp() 45 inline V evaluate_polynomial_c_imp(const T* a, const V& x, const mpl::int_<5>*) BOOST_MATH_NOEXCEPT… in evaluate_polynomial_c_imp() argument 48 return static_cast<V>((a[4] * x2 + a[2]) * x2 + a[0] + (a[3] * x2 + a[1]) * x); in evaluate_polynomial_c_imp() [all …]
|
| H A D | rational_horner1_20.hpp | 21 inline V evaluate_rational_c_imp(const T* a, const U* b, const V&, const mpl::int_<1>*) BOOST_MATH_… in evaluate_rational_c_imp() argument 23 return static_cast<V>(a[0]) / static_cast<V>(b[0]); in evaluate_rational_c_imp() 27 inline V evaluate_rational_c_imp(const T* a, const U* b, const V& x, const mpl::int_<2>*) BOOST_MAT… in evaluate_rational_c_imp() argument 30 return static_cast<V>((a[1] * x + a[0]) / (b[1] * x + b[0])); in evaluate_rational_c_imp() 34 return static_cast<V>((a[0] * z + a[1]) / (b[0] * z + b[1])); in evaluate_rational_c_imp() 39 inline V evaluate_rational_c_imp(const T* a, const U* b, const V& x, const mpl::int_<3>*) BOOST_MAT… in evaluate_rational_c_imp() argument 42 return static_cast<V>(((a[2] * x + a[1]) * x + a[0]) / ((b[2] * x + b[1]) * x + b[0])); in evaluate_rational_c_imp() 46 return static_cast<V>(((a[0] * z + a[1]) * z + a[2]) / ((b[0] * z + b[1]) * z + b[2])); in evaluate_rational_c_imp() 51 inline V evaluate_rational_c_imp(const T* a, const U* b, const V& x, const mpl::int_<4>*) BOOST_MAT… in evaluate_rational_c_imp() argument 54 …return static_cast<V>((((a[3] * x + a[2]) * x + a[1]) * x + a[0]) / (((b[3] * x + b[2]) * x + b[1]… in evaluate_rational_c_imp() [all …]
|
| H A D | rational_horner2_20.hpp | 21 inline V evaluate_rational_c_imp(const T* a, const U* b, const V&, const mpl::int_<1>*) BOOST_MATH_… in evaluate_rational_c_imp() argument 23 return static_cast<V>(a[0]) / static_cast<V>(b[0]); in evaluate_rational_c_imp() 27 inline V evaluate_rational_c_imp(const T* a, const U* b, const V& x, const mpl::int_<2>*) BOOST_MAT… in evaluate_rational_c_imp() argument 29 return static_cast<V>((a[1] * x + a[0]) / (b[1] * x + b[0])); in evaluate_rational_c_imp() 33 inline V evaluate_rational_c_imp(const T* a, const U* b, const V& x, const mpl::int_<3>*) BOOST_MAT… in evaluate_rational_c_imp() argument 35 return static_cast<V>(((a[2] * x + a[1]) * x + a[0]) / ((b[2] * x + b[1]) * x + b[0])); in evaluate_rational_c_imp() 39 inline V evaluate_rational_c_imp(const T* a, const U* b, const V& x, const mpl::int_<4>*) BOOST_MAT… in evaluate_rational_c_imp() argument 41 …return static_cast<V>((((a[3] * x + a[2]) * x + a[1]) * x + a[0]) / (((b[3] * x + b[2]) * x + b[1]… in evaluate_rational_c_imp() 45 inline V evaluate_rational_c_imp(const T* a, const U* b, const V& x, const mpl::int_<5>*) BOOST_MAT… in evaluate_rational_c_imp() argument 50 …return static_cast<V>(((a[4] * x2 + a[2]) * x2 + a[0] + (a[3] * x2 + a[1]) * x) / ((b[4] * x2 + b[… in evaluate_rational_c_imp() [all …]
|
| /OK3568_Linux_fs/kernel/drivers/net/ethernet/marvell/octeontx2/af/ |
| H A D | rvu_reg.h | 29 #define RVU_AF_AFPFX_MBOXX(a, b) (0x2000 | (a) << 4 | (b) << 3) argument 53 #define RVU_PRIV_PFX_CFG(a) (0x8000100 | (a) << 16) argument 54 #define RVU_PRIV_PFX_MSIX_CFG(a) (0x8000110 | (a) << 16) argument 55 #define RVU_PRIV_PFX_ID_CFG(a) (0x8000120 | (a) << 16) argument 56 #define RVU_PRIV_PFX_INT_CFG(a) (0x8000200 | (a) << 16) argument 63 #define RVU_PRIV_BLOCK_TYPEX_REV(a) (0x8000400 | (a) << 3) argument 64 #define RVU_PRIV_HWVFX_INT_CFG(a) (0x8001280 | (a) << 16) argument 75 #define RVU_PF_VFX_PFVF_MBOXX(a, b) (0x0 | (a) << 12 | (b) << 3) argument 77 #define RVU_PF_BLOCK_ADDRX_DISC(a) (0x200 | (a) << 3) argument 78 #define RVU_PF_VFME_STATUSX(a) (0x800 | (a) << 3) argument [all …]
|
| /OK3568_Linux_fs/buildroot/dl/sox/git/src/ |
| H A D | fft4g.c | 38 (notes: sum_j=0^n-1 is a summation from j=0 to n-1) 42 cdft(2*n, 1, a, ip, w); 45 cdft(2*n, -1, a, ip, w); 49 a[0...2*n-1] :input/output data (double *) 51 a[2*j] = Re(x[j]), 52 a[2*j+1] = Im(x[j]), 0<=j<n 54 a[2*k] = Re(X[k]), 55 a[2*k+1] = Im(X[k]), 0<=k<n 66 cdft(2*n, -1, a, ip, w); 68 cdft(2*n, 1, a, ip, w); [all …]
|
| /OK3568_Linux_fs/buildroot/dl/qt5location/git/src/3rdparty/mapbox-gl-native/deps/boost/1.65.1/include/boost/multiprecision/cpp_int/ |
| H A D | checked.hpp | 12 // Simple routines for performing checked arithmetic with a builtin arithmetic type. 13 // Note that this is not a complete header, it must be included as part of boost/multiprecision/cpp… 26 …BOOST_THROW_EXCEPTION(std::range_error("Subtraction resulted in a negative value, but the type is … in raise_subtract_overflow() 37 template <class A> 38 inline A checked_add_imp(A a, A b, const mpl::true_&) in checked_add_imp() argument 40 if(a > 0) in checked_add_imp() 42 if((b > 0) && ((integer_traits<A>::const_max - b) < a)) in checked_add_imp() 47 if((b < 0) && ((integer_traits<A>::const_min - b) > a)) in checked_add_imp() 50 return a + b; in checked_add_imp() 52 template <class A> [all …]
|
| /OK3568_Linux_fs/kernel/drivers/scsi/esas2r/ |
| H A D | esas2r_init.c | 15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 22 * MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE. Each Recipient is 38 * You should have received a copy of the GNU General Public License 46 static bool esas2r_initmem_alloc(struct esas2r_adapter *a, in esas2r_initmem_alloc() argument 53 mem_desc->esas2r_data = dma_alloc_coherent(&a->pcid->dev, in esas2r_initmem_alloc() 75 static void esas2r_initmem_free(struct esas2r_adapter *a, in esas2r_initmem_free() argument 92 dma_free_coherent(&a->pcid->dev, in esas2r_initmem_free() 103 static bool alloc_vda_req(struct esas2r_adapter *a, in alloc_vda_req() argument 117 if (!esas2r_initmem_alloc(a, memdesc, 256)) { in alloc_vda_req() 123 a->num_vrqs++; in alloc_vda_req() [all …]
|
| /OK3568_Linux_fs/prebuilts/gcc/linux-x86/aarch64/gcc-arm-10.3-2021.07-x86_64-aarch64-none-linux-gnu/share/doc/ld.html/ |
| H A D | LD-Index.html | 4 (GNU Toolchain for the A-profile Architecture 10.3-2021.07 (arm-10.29)) 13 Back-Cover Texts. A copy of the license is included in the 32 a.summary-letter {text-decoration: none} 63 <a name="LD-Index"></a> 66 …a href="GNU-Free-Documentation-License.html#GNU-Free-Documentation-License" accesskey="p" rel="pre… 69 <a name="LD-Index-1"></a> 72 …h valign="top">Jump to: </th><td><a class="summary-letter" href="#LD-Index_cp_symbol-1"><b>… 74 <a class="summary-letter" href="#LD-Index_cp_symbol-2"><b>-</b></a> 76 <a class="summary-letter" href="#LD-Index_cp_symbol-3"><b>.</b></a> 78 <a class="summary-letter" href="#LD-Index_cp_symbol-4"><b>/</b></a> [all …]
|
| /OK3568_Linux_fs/prebuilts/gcc/linux-x86/arm/gcc-arm-10.3-2021.07-x86_64-arm-none-linux-gnueabihf/share/doc/ld.html/ |
| H A D | LD-Index.html | 4 (GNU Toolchain for the A-profile Architecture 10.3-2021.07 (arm-10.29)) 13 Back-Cover Texts. A copy of the license is included in the 32 a.summary-letter {text-decoration: none} 63 <a name="LD-Index"></a> 66 …a href="GNU-Free-Documentation-License.html#GNU-Free-Documentation-License" accesskey="p" rel="pre… 69 <a name="LD-Index-1"></a> 72 …h valign="top">Jump to: </th><td><a class="summary-letter" href="#LD-Index_cp_symbol-1"><b>… 74 <a class="summary-letter" href="#LD-Index_cp_symbol-2"><b>-</b></a> 76 <a class="summary-letter" href="#LD-Index_cp_symbol-3"><b>.</b></a> 78 <a class="summary-letter" href="#LD-Index_cp_symbol-4"><b>/</b></a> [all …]
|
| /OK3568_Linux_fs/buildroot/dl/qt5location/git/src/3rdparty/mapbox-gl-native/deps/boost/1.65.1/include/boost/qvm/gen/ |
| H A D | mat_operations3.hpp | 9 //This file was generated by a program. Do not edit manually. 26 template <class A,class B> 29 mat_traits<A>::rows==3 && mat_traits<B>::rows==3 && 30 mat_traits<A>::cols==3 && mat_traits<B>::cols==3, 31 deduce_mat2<A,B,3,3> >::type 32 operator+( A const & a, B const & b ) in operator +() argument 34 typedef typename deduce_mat2<A,B,3,3>::type R; in operator +() 38 …mat_traits<R>::template write_element<0,0>(r)=mat_traits<A>::template read_element<0,0>(a)+mat_tra… in operator +() 39 …mat_traits<R>::template write_element<0,1>(r)=mat_traits<A>::template read_element<0,1>(a)+mat_tra… in operator +() 40 …mat_traits<R>::template write_element<0,2>(r)=mat_traits<A>::template read_element<0,2>(a)+mat_tra… in operator +() [all …]
|
| H A D | mat_operations2.hpp | 9 //This file was generated by a program. Do not edit manually. 24 template <class A,class B> 27 mat_traits<A>::rows==2 && mat_traits<B>::rows==2 && 28 mat_traits<A>::cols==2 && mat_traits<B>::cols==2, 29 deduce_mat2<A,B,2,2> >::type 30 operator+( A const & a, B const & b ) in operator +() argument 32 typedef typename deduce_mat2<A,B,2,2>::type R; in operator +() 36 …mat_traits<R>::template write_element<0,0>(r)=mat_traits<A>::template read_element<0,0>(a)+mat_tra… in operator +() 37 …mat_traits<R>::template write_element<0,1>(r)=mat_traits<A>::template read_element<0,1>(a)+mat_tra… in operator +() 38 …mat_traits<R>::template write_element<1,0>(r)=mat_traits<A>::template read_element<1,0>(a)+mat_tra… in operator +() [all …]
|
| /OK3568_Linux_fs/prebuilts/gcc/linux-x86/arm/gcc-arm-10.3-2021.07-x86_64-arm-none-linux-gnueabihf/share/doc/as.html/ |
| H A D | index.html | 11 Back-Cover Texts. A copy of the license is included in the 31 a.summary-letter {text-decoration: none} 77 <a name="SEC_Contents"></a> 83 <li><a name="toc-Overview-1" href="Overview.html#Overview">1 Overview</a> 85 …<li><a name="toc-Structure-of-this-Manual" href="Manual.html#Manual">1.1 Structure of this Manual<… 86 …<li><a name="toc-The-GNU-Assembler" href="GNU-Assembler.html#GNU-Assembler">1.2 The GNU Assembler<… 87 …<li><a name="toc-Object-File-Formats" href="Object-Formats.html#Object-Formats">1.3 Object File Fo… 88 <li><a name="toc-Command-Line-1" href="Command-Line.html#Command-Line">1.4 Command Line</a></li> 89 <li><a name="toc-Input-Files-1" href="Input-Files.html#Input-Files">1.5 Input Files</a></li> 90 …<li><a name="toc-Output-_0028Object_0029-File" href="Object.html#Object">1.6 Output (Object) File<… [all …]
|
| /OK3568_Linux_fs/prebuilts/gcc/linux-x86/aarch64/gcc-arm-10.3-2021.07-x86_64-aarch64-none-linux-gnu/share/doc/as.html/ |
| H A D | index.html | 11 Back-Cover Texts. A copy of the license is included in the 31 a.summary-letter {text-decoration: none} 77 <a name="SEC_Contents"></a> 83 <li><a name="toc-Overview-1" href="Overview.html#Overview">1 Overview</a> 85 …<li><a name="toc-Structure-of-this-Manual" href="Manual.html#Manual">1.1 Structure of this Manual<… 86 …<li><a name="toc-The-GNU-Assembler" href="GNU-Assembler.html#GNU-Assembler">1.2 The GNU Assembler<… 87 …<li><a name="toc-Object-File-Formats" href="Object-Formats.html#Object-Formats">1.3 Object File Fo… 88 <li><a name="toc-Command-Line-1" href="Command-Line.html#Command-Line">1.4 Command Line</a></li> 89 <li><a name="toc-Input-Files-1" href="Input-Files.html#Input-Files">1.5 Input Files</a></li> 90 …<li><a name="toc-Output-_0028Object_0029-File" href="Object.html#Object">1.6 Output (Object) File<… [all …]
|
| /OK3568_Linux_fs/prebuilts/gcc/linux-x86/arm/gcc-arm-10.3-2021.07-x86_64-arm-none-linux-gnueabihf/share/doc/binutils.html/ |
| H A D | Binutils-Index.html | 9 Back-Cover Texts. A copy of the license is included in the 29 a.summary-letter {text-decoration: none} 60 <a name="Binutils-Index"></a> 63 …a href="GNU-Free-Documentation-License.html#GNU-Free-Documentation-License" accesskey="p" rel="pre… 66 <a name="Binutils-Index-1"></a> 69 …h valign="top">Jump to: </th><td><a class="summary-letter" href="#Binutils-Index_cp_symbol-… 71 <a class="summary-letter" href="#Binutils-Index_cp_symbol-2"><b>.</b></a> 74 <a class="summary-letter" href="#Binutils-Index_cp_letter-A"><b>A</b></a> 76 <a class="summary-letter" href="#Binutils-Index_cp_letter-B"><b>B</b></a> 78 <a class="summary-letter" href="#Binutils-Index_cp_letter-C"><b>C</b></a> [all …]
|