/external/chromium_org/third_party/openssl/openssl/crypto/bn/asm/ |
mips3.s | 736 #define a_1 t1 define 778 ld a_1,8(a1) 806 dmultu a_1,b_0 /* mul_add_c(a[1],b[0],c2,c3,c1); */ 826 dmultu a_1,b_1 /* mul_add_c(a[1],b[1],c3,c1,c2); */ 853 dmultu a_1,b_2 /* mul_add_c(a[1],b[2],c1,c2,c3); */ 908 dmultu a_1,b_3 /* mul_add_c(a[1],b[3],c2,c3,c1); */ 936 dmultu a_1,b_4 /* mul_add_c(a[1],b[4],c3,c1,c2); */ 1027 dmultu a_1,b_5 /* mul_add_c(a[1],b[5],c1,c2,c3); */ 1055 dmultu a_1,b_6 /* mul_add_c(a[1],b[6],c2,c3,c1); */ 1173 dmultu a_1,b_7 /* mul_add_c(a[1],b[7],c3,c1,c2); * [all...] |
sparcv8.S | 541 #define a_1 %l1 define 574 ld ap(1),a_1 580 umul a_1,b_0,t_1 !mul_add_c(a[1],b[0],c2,c3,c1); 593 umul a_1,b_1,t_1 !mul_add_c(a[1],b[1],c3,c1,c2); 611 umul a_1,b_2,t_1 !=!mul_add_c(a[1],b[2],c1,c2,c3); 646 umul a_1,b_3,t_1 !mul_add_c(a[1],b[3],c2,c3,c1); 664 umul a_1,b_4,t_1 !mul_add_c(a[1],b[4],c3,c1,c2); 719 umul a_1,b_5,t_1 !mul_add_c(a[1],b[5],c1,c2,c3); 737 umul a_1,b_6,t_1 !mul_add_c(a[1],b[6],c2,c3,c1); 805 umul a_1,b_7,t_1 !mul_add_c(a[1],b[7],c3,c1,c2) [all...] |
sparcv8plus.S | 648 #define a_1 %l1 define 682 lduw ap(1),a_1 689 mulx a_1,b_0,t_1 !=!mul_add_c(a[1],b[0],c2,c3,c1); 703 mulx a_1,b_1,t_1 !mul_add_c(a[1],b[1],c3,c1,c2); 721 mulx a_1,b_2,t_1 !=!mul_add_c(a[1],b[2],c1,c2,c3); 753 mulx a_1,b_3,t_1 !mul_add_c(a[1],b[3],c2,c3,c1); 771 mulx a_1,b_4,t_1 !mul_add_c(a[1],b[4],c3,c1,c2); 819 mulx a_1,b_5,t_1 !mul_add_c(a[1],b[5],c1,c2,c3); 837 mulx a_1,b_6,t_1 !mul_add_c(a[1],b[6],c2,c3,c1); 895 mulx a_1,b_7,t_1 !mul_add_c(a[1],b[7],c3,c1,c2) [all...] |
mips.pl | 1009 ($a_0,$a_1,$a_2,$a_3)=($t0,$t1,$t2,$t3); 1066 $LD $a_1,$BNSZ($a1) 1087 $MULTU $a_1,$b_0 # mul_add_c(a[1],b[0],c2,c3,c1); 1106 $MULTU $a_1,$b_1 # mul_add_c(a[1],b[1],c3,c1,c2); 1132 $MULTU $a_1,$b_2 # mul_add_c(a[1],b[2],c1,c2,c3); 1186 $MULTU $a_1,$b_3 # mul_add_c(a[1],b[3],c2,c3,c1); 1215 $MULTU $a_1,$b_4 # mul_add_c(a[1],b[4],c3,c1,c2); 1305 $MULTU $a_1,$b_5 # mul_add_c(a[1],b[5],c1,c2,c3); 1334 $MULTU $a_1,$b_6 # mul_add_c(a[1],b[6],c2,c3,c1); 1451 $MULTU $a_1,$b_7 # mul_add_c(a[1],b[7],c3,c1,c2) [all...] |
/external/openssl/crypto/bn/asm/ |
mips3.s | 736 #define a_1 t1 define 778 ld a_1,8(a1) 806 dmultu a_1,b_0 /* mul_add_c(a[1],b[0],c2,c3,c1); */ 826 dmultu a_1,b_1 /* mul_add_c(a[1],b[1],c3,c1,c2); */ 853 dmultu a_1,b_2 /* mul_add_c(a[1],b[2],c1,c2,c3); */ 908 dmultu a_1,b_3 /* mul_add_c(a[1],b[3],c2,c3,c1); */ 936 dmultu a_1,b_4 /* mul_add_c(a[1],b[4],c3,c1,c2); */ 1027 dmultu a_1,b_5 /* mul_add_c(a[1],b[5],c1,c2,c3); */ 1055 dmultu a_1,b_6 /* mul_add_c(a[1],b[6],c2,c3,c1); */ 1173 dmultu a_1,b_7 /* mul_add_c(a[1],b[7],c3,c1,c2); * [all...] |
sparcv8.S | 541 #define a_1 %l1 define 574 ld ap(1),a_1 580 umul a_1,b_0,t_1 !mul_add_c(a[1],b[0],c2,c3,c1); 593 umul a_1,b_1,t_1 !mul_add_c(a[1],b[1],c3,c1,c2); 611 umul a_1,b_2,t_1 !=!mul_add_c(a[1],b[2],c1,c2,c3); 646 umul a_1,b_3,t_1 !mul_add_c(a[1],b[3],c2,c3,c1); 664 umul a_1,b_4,t_1 !mul_add_c(a[1],b[4],c3,c1,c2); 719 umul a_1,b_5,t_1 !mul_add_c(a[1],b[5],c1,c2,c3); 737 umul a_1,b_6,t_1 !mul_add_c(a[1],b[6],c2,c3,c1); 805 umul a_1,b_7,t_1 !mul_add_c(a[1],b[7],c3,c1,c2) [all...] |
sparcv8plus.S | 648 #define a_1 %l1 define 682 lduw ap(1),a_1 689 mulx a_1,b_0,t_1 !=!mul_add_c(a[1],b[0],c2,c3,c1); 703 mulx a_1,b_1,t_1 !mul_add_c(a[1],b[1],c3,c1,c2); 721 mulx a_1,b_2,t_1 !=!mul_add_c(a[1],b[2],c1,c2,c3); 753 mulx a_1,b_3,t_1 !mul_add_c(a[1],b[3],c2,c3,c1); 771 mulx a_1,b_4,t_1 !mul_add_c(a[1],b[4],c3,c1,c2); 819 mulx a_1,b_5,t_1 !mul_add_c(a[1],b[5],c1,c2,c3); 837 mulx a_1,b_6,t_1 !mul_add_c(a[1],b[6],c2,c3,c1); 895 mulx a_1,b_7,t_1 !mul_add_c(a[1],b[7],c3,c1,c2) [all...] |
mips.pl | 1009 ($a_0,$a_1,$a_2,$a_3)=($t0,$t1,$t2,$t3); 1066 $LD $a_1,$BNSZ($a1) 1087 $MULTU $a_1,$b_0 # mul_add_c(a[1],b[0],c2,c3,c1); 1106 $MULTU $a_1,$b_1 # mul_add_c(a[1],b[1],c3,c1,c2); 1132 $MULTU $a_1,$b_2 # mul_add_c(a[1],b[2],c1,c2,c3); 1186 $MULTU $a_1,$b_3 # mul_add_c(a[1],b[3],c2,c3,c1); 1215 $MULTU $a_1,$b_4 # mul_add_c(a[1],b[4],c3,c1,c2); 1305 $MULTU $a_1,$b_5 # mul_add_c(a[1],b[5],c1,c2,c3); 1334 $MULTU $a_1,$b_6 # mul_add_c(a[1],b[6],c2,c3,c1); 1451 $MULTU $a_1,$b_7 # mul_add_c(a[1],b[7],c3,c1,c2) [all...] |
/external/ceres-solver/include/ceres/ |
solver.h | 510 // y = a_1 exp(b_1 x) + a_2 exp(b_3 x^2 + c_1) 513 // a_1, a_2, b_1, b_2, and c_1. 515 // Notice here that the expression on the left is linear in a_1 518 // values of a_1 and a_2. Indeed, its possible to analytically 519 // eliminate the variables a_1 and a_2 from the problem all 538 // computed for the whole problem (a_1, a_2, b_1, b_2, c_1) and 539 // additional optimization step is performed to estimate a_1 and 543 // linear in a_1 and a_2, i.e., Solve for the trust region step 545 // further optimize just a_1 and a_2. For the linear case, this 547 // non-linear problems, any method for solving the a_1 and a_ [all...] |
/external/webrtc/src/common_audio/signal_processing/ |
splitting_filter.c | 53 // a_3 + q^-1 a_2 + q^-1 a_1 + q^-1 76 // y_1[0] = x[-1] + a_1 * (x[0] - y_1[-1]) 83 // y_1[n] = x[n-1] + a_1 * (x[n] - y_1[n-1])
|
/external/eigen/unsupported/Eigen/ |
Polynomials | 96 The roots of \f$ p(x) = a_0 + a_1 x + a_2 x^2 + a_{3} x^3 + x^4 \f$ are the eigenvalues of 101 1 & 0 & 0 & a_1 \\
|
/external/ceres-solver/docs/source/ |
solving.rst | 255 .. math:: y = a_1 e^{b_1 x} + a_2 e^{b_3 x^2 + c_1} 259 :math:`a_1, a_2, b_1, b_2`, and :math:`c_1`. 261 Notice that the expression on the left is linear in :math:`a_1` and 264 of :math:`a_1` and :math:`a_2`. It's possible to analytically 265 eliminate the variables :math:`a_1` and :math:`a_2` from the problem 281 additional optimization step to estimate :math:`a_1` and :math:`a_2` 286 linear in :math:`a_1` and :math:`a_2`, i.e., 288 .. math:: y = f_1(a_1, e^{b_1 x}) + f_2(a_2, e^{b_3 x^2 + c_1}) 291 and then use it as the starting point to further optimize just `a_1` 294 the `a_1` and `a_2` optimization problems will do. The only constrain [all...] |
/external/llvm/include/llvm/ADT/ |
VariadicFunction.h | 64 /// ResultT Foo(const ArgT &A_0, const ArgT &A_1, ..., const ArgT &A_N);
|
/external/eigen/Eigen/src/LU/ |
PartialPivLU.h | 330 // lu = A_0 | A_1 | A_2 = A10 | A11 | A12
|
/external/llvm/lib/CodeGen/ |
StrongPHIElimination.cpp | 493 /// for two variables. If there are variables a_1, ..., a_n such that 495 /// def(a_1) dom ... dom def(a_n),
|
/external/bison/tests/ |
actions.at | 274 %type <val> a_1 a_2 a_5 278 exp: a_1 a_2 { $<val>$ = 3; } { $<val>$ = $<val>3 + 1; } a_5 285 a_1: { $$ = 1; }; [all...] |
/external/libvorbis/doc/ |
stereo.html | 284 A_0, B_0, A_1, B_1, A_2 ... A_n-1, B_n-1) before entropy encoding. Thus
|
/prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/sysroot/usr/lib/ |
libmenu.a | [all...] |
libaudiofile.a | 9 ELF > |