Searched defs:Lx (Results 1 – 5 of 5) sorted by relevance
| /external/eigen/Eigen/src/SparseCholesky/ |
| D | SimplicialCholesky_impl.h | 113 Scalar* Lx = m_matrix.valuePtr(); in factorize_preordered() local
|
| /external/wpa_supplicant_8/src/common/ |
| D | dpp_pkex.c | 993 u8 Lx[DPP_MAX_SHARED_SECRET_LEN]; in dpp_pkex_rx_commit_reveal_req() local
1165 u8 Lx[DPP_MAX_SHARED_SECRET_LEN]; in dpp_pkex_rx_commit_reveal_resp() local
|
| D | dpp.h | 289 u8 Lx[DPP_MAX_SHARED_SECRET_LEN]; member
|
| /external/eigen/Eigen/src/UmfPackSupport/ |
| D | UmfPackSupport.h | 108 inline int umfpack_get_numeric(int Lp[], int Lj[], double Lx[], int Up[], int Ui[], double Ux[], in umfpack_get_numeric()
114 inline int umfpack_get_numeric(int Lp[], int Lj[], std::complex<double> Lx[], int Up[], int Ui[], s… in umfpack_get_numeric()
|
| /external/skqp/src/gpu/ccpr/ |
| D | GrCCFillGeometry.cpp | 288 Sk2f Lx = C1[1]*l3 - C0[1]*l2or1; in find_chops_around_inflection_points() local
374 Sk2f Lx = -C0[1]*l2or1 + C1[1]; // l3 is always 1. in find_chops_around_loop_intersection() local
|