| /toolchain/binutils/binutils-2.25/gas/testsuite/gas/mips/ |
| vr4130.s | 24 mult $3,$3
29 mult $3,$3
36 mult $3,$3 # 4 nops
40 mult $4,$4 # 3 nops
45 mult $5,$5 # 2 nops
51 mult $6,$6 # 1 nop
58 mult $7,$7 # 0 nops
62 mult $3,$3 # 4 nops
68 mult $4,$4 # 3 nops before noreorder
75 mult $5,$5 # 2 nops before noreorde
[all...] |
| vr4130.d | 18 .* mult .*
25 .* mult .*
34 .* mult .*
41 .* mult .*
48 .* mult .*
55 .* mult .*
62 .* mult .*
69 .* mult .*
76 .* mult .*
83 .* mult .
[all...] |
| mul-ilocks.d | 16 0+0014 <[^>]*> mult a1,at
19 0+0020 <[^>]*> mult a1,at
22 0+002c <[^>]*> mult a1,at
25 0+0038 <[^>]*> mult a1,at
28 0+0044 <[^>]*> mult a1,at
32 0+0054 <[^>]*> mult a1,at
34 0+005c <[^>]*> mult a0,a1
42 0+007c <[^>]*> mult a1,a2
|
| mul.d | 17 0+0020 <[^>]*> mult a1,at
21 0+0030 <[^>]*> mult a1,at
25 0+0040 <[^>]*> mult a1,at
29 0+0050 <[^>]*> mult a1,at
33 0+0060 <[^>]*> mult a1,at
37 0+0070 <[^>]*> mult a1,at
40 0+0080 <[^>]*> mult a0,a1
49 0+00a8 <[^>]*> mult a1,a2
|
| /external/syslinux/gpxe/src/crypto/ |
| crc32.c | 42 u32 mult; local
48 mult = ( crc & 1 ) ? CRCPOLY : 0;
49 crc = ( crc >> 1 ) ^ mult;
|
| /external/ltp/lib/ |
| tst_fs_has_free.c | 30 unsigned int size, unsigned int mult)
40 if ((uint64_t)sf.f_bavail * sf.f_bsize >= (uint64_t)size * mult)
|
| random_range.c | 45 int mult; member in struct:range
54 * min:max[:mult]
56 * any of the values may be blank (ie. min::mult, :max, etc.) and default
62 * which is malloc'd by the routine. The min, max, and mult entries of each
73 * defmult default value to plug in for mult, if missing
75 * can call to parse the min, max, and mult strings. This
135 rp->mult = defmult;
148 * Parse the 'min' field - if it is zero length (:n2[:mult]
185 * Process the 'mult' field - if one was not present
187 * then set the mult field to defmult - otherwise pass the
[all...] |
| /external/ltp/testcases/kernel/fs/doio/ |
| bytes_by_prefix.c | 44 * char mult
56 * Returns -1 if mult is an invalid character, or if the integer portion of
75 char mult, junk; local
80 nconv = sscanf(s, "%f%c%c", &num, &mult, &junk);
89 switch (mult) {
123 char mult, junk; local
128 nconv = sscanf(s, "%f%c%c", &num, &mult, &junk);
137 switch (mult) {
175 char mult, junk; local
180 nconv = sscanf(s, "%lf%c%c", &num, &mult, &junk)
[all...] |
| /cts/hostsidetests/appsecurity/test-apps/SplitApp/feature/src/com/android/cts/splitapp/ |
| FeatureLogic.java | 24 public static int mult(int a, int b) { method in class:FeatureLogic
25 Log.d(TAG, "FeatureLogic.mult(" + a + ", " + b + ")");
|
| /external/jemalloc/test/src/ |
| timer.c | 34 uint64_t mult; local
43 mult = 1;
45 mult *= 10;
53 uint64_t round = (i+1 == buflen-1 && ((t0 * mult * 10 / t1) % 10
56 "%"FMTu64, (t0 * mult / t1) % 10 + round);
58 mult *= 10;
|
| /external/iptables/extensions/ |
| libxt_limit.c | 48 uint32_t mult = 1; /* Seconds by default. */ local
56 mult = 1;
58 mult = 60;
60 mult = 60*60;
62 mult = 24*60*60;
70 *val = XT_LIMIT_SCALE * mult / r;
115 uint32_t mult; member in struct:rates
131 if (period > rates[i].mult
132 || rates[i].mult/period < rates[i].mult%period
[all...] |
| libebt_limit.c | 54 uint32_t mult = 1; /* Seconds by default. */ local
62 mult = 1;
64 mult = 60;
66 mult = 60*60;
68 mult = 24*60*60;
78 if (r / mult > EBT_LIMIT_SCALE)
81 *val = EBT_LIMIT_SCALE * mult / r;
129 uint32_t mult; member in struct:rates
145 if (period > g_rates[i].mult ||
146 g_rates[i].mult/period < g_rates[i].mult%period
[all...] |
| /packages/apps/LegacyCamera/jni/feature_stab/db_vlvm/ |
| db_metrics.h | 121 double x0,x1,x2,mult; local
127 mult=1.0/((x2!=0.0)?x2:1.0);
128 sd=db_sqr((y[0]-x0*mult))+db_sqr((y[1]-x1*mult));
135 double x0,x1,x2,mult; local
141 mult=1.0/((x2!=0.0)?x2:1.0);
142 sd=db_sqr((y[0]-x0*mult))+db_sqr((y[1]-x1*mult));
168 double xh,yh,zh,mult,mult2,xh_mult2,yh_mult2; local
186 mult=1.0/((zh!=0.0)?zh:1.0)
258 double xh,yh,zh,mult,mult2,xh_mult2,yh_mult2; local
[all...] |
| db_utilities.h | 353 * Scalar multiplication in place: A(3)=mult*A(3).
355 inline void db_MultiplyScalar3(double *A,double mult)
357 (*A++) *= mult; (*A++) *= mult; (*A++) *= mult;
361 * Scalar multiplication: A(3)=mult*B(3).
363 inline void db_MultiplyScalarCopy3(double *A,const double *B,double mult)
365 (*A++)=(*B++)*mult; (*A++)=(*B++)*mult; (*A++)=(*B++)*mult;
[all...] |
| /device/google/contexthub/firmware/os/cpu/cortexm4/ |
| cpuMath.c | 5 uint64_t mult = 0x4189374BCULL; local
6 uint32_t multLo = mult;
7 uint32_t multHi = mult >> 32;
|
| /frameworks/av/media/libstagefright/codecs/amrnb/common/include/ |
| mac_32.h | 116 product = mult(L_var1_hi, L_var2_lo, pOverflow);
119 product = mult(L_var1_lo, L_var2_hi, pOverflow);
135 product = mult(L_var1_lo, var2, pOverflow);
|
| mult.h | 31 Filename: /audio/gsm_amr/c/include/mult.h
36 Description: Created separate header file for mult function.
38 Description: Changed prototype of the mult() function. Instead of using global
56 needed by the mult function.
109 __inline Word16 mult(Word16 var1, Word16 var2, Flag *pOverflow) function
128 __inline Word16 mult(Word16 var1, Word16 var2, Flag *pOverflow) function
159 static inline Word16 mult(Word16 var1, Word16 var2, Flag *pOverflow) function
|
| /external/ltp/include/ |
| tst_fs.h | 54 * @mult: mult should be TST_KB, TST_MB or TST_GB
55 * the required free space is calculated by @size * @mult
58 unsigned int size, unsigned int mult);
157 unsigned int mult)
159 return tst_fs_has_free_(NULL, path, size, mult);
183 unsigned int size, unsigned int mult)
185 return tst_fs_has_free_(cleanup, path, size, mult);
|
| /external/openssh/ |
| smult_curve25519_ref.c | 62 static void mult(unsigned int out[32],const unsigned int a[32],const unsigned int b[32]) function
162 mult(b1,a1,a0 + 32);
163 mult(b1 + 32,a1 + 32,a0);
170 mult(xznb,b0,b0 + 32);
171 mult(xznb + 32,s,u);
173 mult(xzn1b + 32,r,work);
197 /* 9 */ mult(z9,t0,z);
198 /* 11 */ mult(z11,z9,z2);
200 /* 2^5 - 2^0 = 31 */ mult(z2_5_0,t0,z9);
207 /* 2^10 - 2^0 */ mult(z2_10_0,t0,z2_5_0)
[all...] |
| /frameworks/av/media/libstagefright/codecs/amrnb/dec/src/ |
| preemph.cpp | 256 temp2 = mult(g, *(p2--), pOverflow);
262 temp2 = mult(g, st->mem_pre, pOverflow);
|
| d8_31pf.cpp | 48 (2) Added includes of mult.h, shl.h, shr.h, add.h, sub.h, negate.h,
189 mult(
203 mult(
230 mult(
248 mult(
433 mult(
442 mult(
478 mult(
|
| /external/icu/icu4c/source/test/perf/perldriver/ |
| Format.pm | 61 my $mult = shift;
65 my $result = formatSigDig($sigdig, $a*$mult);
67 my $d = formatSigDig($sigdig, $delta*$mult);
99 my @MULT = (1 , 1e3, 1e6, 1e9);
105 ++$i while ($a*$MULT[$i] < 1 && $i < @MULT);
107 formatNumber($sigdig, $MULT[$i], $a, $delta) . ' ' . $SUFF[$i];
|
| /external/icu/icu4j/perf-tests/perldriver/ |
| Format.pm | 59 my $mult = shift;
63 my $result = formatSigDig($sigdig, $a*$mult);
65 my $d = formatSigDig($sigdig, $delta*$mult);
97 my @MULT = (1 , 1e3, 1e6, 1e9);
103 ++$i while ($a*$MULT[$i] < 1 && $i < @MULT);
105 formatNumber($sigdig, $MULT[$i], $a, $delta) . ' ' . $SUFF[$i];
|
| /cts/tests/tests/media/src/android/media/cts/ |
| PresentationSyncTest.java | 112 // Tests with mult < 1.0f are flaky, for two reasons:
114 // (a) They assume that the GPU can render the test scene in less than mult*refreshNsec.
123 // throughput won't be much better than with mult=1.0.
140 * If mult is -1, the test runs in "training" mode, rendering frames as quickly as
145 private long runThroughputTest(InputSurface output, long frameTimeNsec, float mult) {
146 Log.d(TAG, "runThroughputTest: " + mult);
159 drawFrame(0, mult);
168 if (mult != -1.0f) {
169 showNsec = startNsec + (long) (frameNum * frameTimeNsec * mult);
171 drawFrame(frameNum, mult);
[all...] |
| /external/eigen/bench/btl/libs/gmm/ |
| gmm_interface.hh | 82 gmm::mult(A,B, X);
86 gmm::mult(gmm::transposed(A),gmm::transposed(B), X);
90 gmm::mult(gmm::transposed(A),A, X);
94 gmm::mult(A,gmm::transposed(A), X);
98 gmm::mult(A,B,X);
102 gmm::mult(gmm::transposed(A),B,X);
|
