Searched refs:r_2 (Results 1 – 5 of 5) sorted by relevance
| /external/libvpx/libvpx/vpx_dsp/arm/ |
| D | intrapred_neon.c | 494 const uint8x16_t r_2 = vextq_u8(row_0, row_1, 13); in vpx_d135_predictor_16x16_neon() local
508 d135_store_16x8(&dst, stride, r_0, r_1, r_2, r_3, r_4, r_5, r_6, r_7); in vpx_d135_predictor_16x16_neon()
565 const uint8x16_t r_2 = vextq_u8(row_2, row_3, 15); in vpx_d135_predictor_32x32_neon() local
566 d135_store_32x2(&dst, stride, r_0, r_1, r_2); in vpx_d135_predictor_32x32_neon()
572 const uint8x16_t r_2 = vextq_u8(row_2, row_3, 14); in vpx_d135_predictor_32x32_neon() local
573 d135_store_32x2(&dst, stride, r_0, r_1, r_2); in vpx_d135_predictor_32x32_neon()
579 const uint8x16_t r_2 = vextq_u8(row_2, row_3, 13); in vpx_d135_predictor_32x32_neon() local
580 d135_store_32x2(&dst, stride, r_0, r_1, r_2); in vpx_d135_predictor_32x32_neon()
586 const uint8x16_t r_2 = vextq_u8(row_2, row_3, 12); in vpx_d135_predictor_32x32_neon() local
587 d135_store_32x2(&dst, stride, r_0, r_1, r_2); in vpx_d135_predictor_32x32_neon()
[all …]
|
| /external/llvm/test/CodeGen/Generic/ |
| D | print-mul-exp.ll | 16 %r_2 = mul i32 %a, 2 ; <i32> [#uses=1]
36 call i32 (i8*, ...) @printf( i8* %a_mul_s, i32 2, i32 %r_2 ) ; <i32>:4 [#uses=0]
|
| /external/llvm-project/llvm/test/CodeGen/Generic/ |
| D | print-mul-exp.ll | 16 %r_2 = mul i32 %a, 2 ; <i32> [#uses=1]
36 call i32 (i8*, ...) @printf( i8* %a_mul_s, i32 2, i32 %r_2 ) ; <i32>:4 [#uses=0]
|
| /external/llvm-project/lldb/test/API/functionalities/data-formatter/data-formatter-advanced/ |
| D | main.cpp | 116 int r_2; member
|
| /external/eigen/unsupported/Eigen/ |
| D | Polynomials | 61 where \f$ p \f$ is known through its roots i.e. \f$ p(x) = (x-r_1)(x-r_2)...(x-r_n) \f$.
114 … guaranteed to provide a correct result only when the complex roots \f$r_1,r_2,...,r_d\f$ have dis…
|