/external/chromium_org/cc/base/ |
util_unittest.cc | 13 for (int multiplier = 1; multiplier <= 10; ++multiplier) { 17 for (int attempt = 5 * multiplier; attempt >= -5 * multiplier; --attempt) { 18 if ((attempt % multiplier) == 0) 20 EXPECT_EQ(correct, RoundUp(attempt, multiplier)) 21 << "attempt=" << attempt << " multiplier=" << multiplier; local 25 for (unsigned multiplier = 1; multiplier <= 10; ++multiplier) 33 << "attempt=" << attempt << " multiplier=" << multiplier; local 49 << "attempt=" << attempt << " multiplier=" << multiplier; local 61 << "attempt=" << attempt << " multiplier=" << multiplier; local [all...] |
/external/chromium_org/v8/src/base/ |
division-by-constant.h | 19 : multiplier(m), shift(s), add(a) {} 22 T multiplier; member in struct:v8::base::MagicNumbersForDivision 28 // Calculate the multiplier and shift for signed division via multiplication. 34 // Calculate the multiplier and shift for unsigned division via multiplication,
|
/cts/suite/audio_quality/lib/src/audio/ |
AudioSignalFactory.cpp | 32 double multiplier = 2.0 * M_PI * (double)signalFreq / samplingRate; local 34 double val = sin(multiplier * i) * maxPositive; 55 double multiplier = (double)maxPositive / middle; local
|
/external/glide/library/src/main/java/com/bumptech/glide/ |
MemoryCategory.java | 8 private float multiplier; field in class:MemoryCategory 10 MemoryCategory(float multiplier) { 11 this.multiplier = multiplier; 15 return multiplier;
|
/cts/suite/audio_quality/test_description/processing/ |
calc_thd.py | 55 multiplier = 2.0 * np.pi * signalFrequency / float(samplingRate) variable 56 data = np.sin(index * multiplier)
|
calc_delay.py | 70 multiplier = 2.0 * np.pi * signalFrequency / float(samplingRate) variable 71 data0 = np.sin(index * multiplier)
|
/external/chromium_org/ppapi/cpp/dev/ |
scrollbar_dev.cc | 80 void Scrollbar_Dev::ScrollBy(PP_ScrollBy_Dev unit, int32_t multiplier) { 84 multiplier); local
|
/external/ppp/pppd/plugins/pppoatm/ |
text2qos.c | 28 const char *multiplier; local 44 multiplier = NULL; 45 if (*end && (multiplier = strchr(mult,*end))) { 46 while (multiplier >= mult) { 50 multiplier -= 2; 65 if (multiplier) return RATE_ERROR; 73 else if (multiplier) return RATE_ERROR;
|
/external/chromium_org/printing/ |
printing_context_no_system_dialog.cc | 69 float multiplier = 100 * settings_.device_units_per_inch(); local 70 multiplier /= kHundrethsMMPerInch; 71 width *= multiplier; 72 height *= multiplier;
|
printing_context_android.cc | 164 float multiplier = 100 * settings_.device_units_per_inch(); local 165 multiplier /= kHundrethsMMPerInch; 166 width *= multiplier; 167 height *= multiplier;
|
/external/chromium_org/sdch/open-vcdiff/src/ |
rolling_hash.h | 33 // Multiplier for incremental hashing. The compiler should be smart enough to 192 // Compute multiplier. Concisely, it is: 195 uint32_t multiplier = 1; local 197 multiplier = 198 RollingHashUtil::ModBase(multiplier * RollingHashUtil::kMult); 221 // Iteratively adding the multiplier in this loop is equivalent to 222 // computing (removed_byte * multiplier), and is faster 224 RollingHashUtil::ModBase(byte_times_multiplier + multiplier);
|
/external/chromium_org/third_party/libxslt/libxslt/ |
numbersInternals.h | 60 int multiplier; /* Scaling for percent or permille */ member in struct:_xsltFormatNumberInfo
|
/libcore/luni/src/main/java/java/util/ |
Random.java | 37 private static final long multiplier = 0x5deece66dL; field in class:Random 97 seed = (seed * multiplier + 0xbL) & ((1L << 48) - 1); 163 double multiplier = StrictMath.sqrt(-2 * StrictMath.log(s) / s); local 164 nextNextGaussian = v2 * multiplier; 166 return v1 * multiplier; 207 this.seed = (seed ^ multiplier) & ((1L << 48) - 1);
|
/external/chromium_org/v8/src/ic/ |
stub-cache.h | 148 const int multiplier = sizeof(*table) >> Name::kHashShift; local 150 offset * multiplier);
|
/libcore/luni/src/main/java/java/util/concurrent/ |
ThreadLocalRandom.java | 37 private static final long multiplier = 0x5DEECE66DL; field in class:ThreadLocalRandom 96 rnd = (seed ^ multiplier) & mask; 100 rnd = (rnd * multiplier + addend) & mask;
|
/external/chromium_org/chrome/browser/ |
upgrade_detector_impl.cc | 474 const base::TimeDelta multiplier = IsTesting() ? local 478 const base::TimeDelta severe_threshold = 14 * multiplier; 479 const base::TimeDelta high_threshold = 7 * multiplier; 480 const base::TimeDelta elevated_threshold = 4 * multiplier; 481 const base::TimeDelta low_threshold = 2 * multiplier;
|
/external/chromium_org/net/disk_cache/blockfile/ |
eviction.cc | 551 int multiplier = 1 << list; local 552 return (Time::Now() - used).InHours() > kTargetTime * multiplier;
|
eviction_v3.cc | 460 int multiplier = 1 << list; local 461 return (Time::Now() - used).InHours() > kTargetTime * multiplier;
|
/external/chromium_org/third_party/WebKit/Source/core/css/resolver/ |
FontBuilder.cpp | 444 float multiplier = style->textAutosizingMultiplier(); local 445 if (multiplier > 1) 446 computedSize = TextAutosizer::computeAutosizedFontSize(computedSize, multiplier);
|
/external/chromium_org/third_party/WebKit/Source/core/svg/ |
SVGParserUtilities.cpp | 81 FloatType multiplier = 1; local 83 integer += multiplier * static_cast<FloatType>(*(ptrScanIntPart--) - '0'); 84 multiplier *= 10;
|
/external/chromium_org/third_party/WebKit/Source/modules/webaudio/ |
AudioParamTimeline.cpp | 331 // Compute the per-sample multiplier. 332 float multiplier = powf(value2 / value1, 1 / numSampleFrames); local 334 // Set the starting value of the exponential ramp. This is the same as multiplier ^ 336 // accurate, especially if multiplier is close to 1. 342 value *= multiplier;
|
/external/chromium_org/third_party/icu/source/test/intltest/ |
dcfmapts.cpp | 253 int32_t multiplier = 0; local 255 multiplier = pat.getMultiplier(); 256 logln((UnicodeString)"Multiplier (should be 8): " + multiplier); 257 if(multiplier != 8) {
|
/external/chromium_org/third_party/mesa/src/src/mesa/drivers/dri/i965/ |
brw_blorp.h | 150 int16_t multiplier; member in struct:brw_blorp_coord_transform_params
|
/external/chromium_org/v8/test/cctest/compiler/ |
test-machine-operator-reducer.cc | 442 Node* multiplier = R.Constant<int32_t>(1 << n); local 444 multiplier); // x * 2^n => x << n 445 R.CheckFoldBinop<int32_t>(x, R.machine.Word32Shl(), n, multiplier,
|
/external/icu/icu4c/source/i18n/ |
decimalformatpattern.cpp | 183 // prematurely. We set the following variables for the multiplier, 191 int32_t multiplier = 1; local 406 if (multiplier != 1) { 415 multiplier = 100; 420 if (multiplier != 1) { 429 multiplier = 1000; 589 out.fMultiplier = multiplier;
|