/external/v8/test/mjsunit/asm/ |
H A D | int32mod.js | 19 var divisors = [-2147483648, -32 * 1024, -1000, -16, -7, -2, -1, 0, variable 21 for (var i in divisors) { 22 var divisor = divisors[i];
|
H A D | int32modb.js | 19 var divisors = [-2147483648, -32 * 1024, -1000, -16, -7, -2, -1, 0, variable 21 for (var i = 0; i < divisors.length; i++) { 22 var divisor = divisors[i];
|
H A D | uint32mod.js | 19 var divisors = [0, 1, 3, 4, 10, 42, 64, 100, 1024, 2147483647, 4294967295]; variable 20 for (var i in divisors) { 21 var divisor = divisors[i];
|
H A D | int32div.js | 25 var divisors = [-2147483648, -32 * 1024, -1000, -16, -7, -2, -1, 0, variable 27 for (var i in divisors) { 28 var divisor = divisors[i];
|
H A D | int32mod-constant.js | 25 var divisors = [-2147483648, -32 * 1024, -1000, -16, -7, -2, -1, 0, variable 27 for (var i in divisors) { 28 var divisor = divisors[i];
|
H A D | uint32div.js | 22 var divisors = [0, 1, 3, 4, 10, 42, 64, 100, 1024, 2147483647, 4294967295]; variable 23 for (var i in divisors) { 24 var divisor = divisors[i]; 39 for (var i in divisors) { 40 var divisor = divisors[i];
|
H A D | uint32mod-constant.js | 22 var divisors = [0, 1, 3, 4, 10, 42, 64, 100, 1024, 2147483647, 4294967295]; variable 23 for (var i in divisors) { 24 var divisor = divisors[i];
|
/external/v8/test/mjsunit/ |
H A D | div-mod.js | 69 var divisors = [ variable 88 for (var i = 0; i < divisors.length; i++) { 89 run_tests_for(divisors[i]); 212 for (var j = 0; j < divisors.length; j++) { 213 mod_func = this.eval("(function(left) { return left % " + divisors[j]+ "; })"); 214 assertEquals((mod_func)(left_operands[i]), left_operands[i] % divisors[j]); 215 assertEquals((mod_func)(-left_operands[i]), -left_operands[i] % divisors[j]);
|
/external/guava/guava-tests/benchmark/com/google/common/primitives/ |
H A D | UnsignedLongsBenchmark.java | 34 private static final long[] divisors = new long[ARRAY_SIZE]; field in class:UnsignedLongsBenchmark 44 divisors[i] = randomDivisor(longs[i]); 56 tmp += UnsignedLongs.divide(longs[j], divisors[j]); 65 tmp += UnsignedLongs.remainder(longs[j], divisors[j]);
|
/external/icu/android_icu4j/src/main/java/android/icu/text/ |
H A D | CompactDecimalDataCache.java | 48 * of one array and two hashmaps. The index of the divisors array as well 52 * by before doing formatting. In the case of english, <code>divisors[4]</code> 66 long[] divisors; field in class:CompactDecimalDataCache.Data 69 Data(long[] divisors, Map<String, DecimalFormat.Unit[]> units) { argument 70 this.divisors = divisors; 270 // Silently ignore divisors that are too big. 326 result.divisors[thisIndex] = divisor; 432 for (int i = 0; i < result.divisors.length; i++) { 434 result.divisors[ [all...] |
/external/icu/android_icu4j/src/main/tests/android/icu/dev/test/format/ |
H A D | CompactDecimalFormatTest.java | 221 long[] divisors = new long[] { 227 checkCore(affixes, null, divisors, TestACoreCompactFormatList); 228 checkCore(affixes, currencyAffixes, divisors, TestACoreCompactFormatListCurrency); 231 private void checkCore(Map<String, String[][]> affixes, Map<String, String[]> currencyAffixes, long[] divisors, Object[][] testItems) { argument 237 divisors, affixes, currencyAffixes,
|
/external/icu/icu4j/main/classes/core/src/com/ibm/icu/text/ |
H A D | CompactDecimalDataCache.java | 47 * of one array and two hashmaps. The index of the divisors array as well 51 * by before doing formatting. In the case of english, <code>divisors[4]</code> 65 long[] divisors; field in class:CompactDecimalDataCache.Data 68 Data(long[] divisors, Map<String, DecimalFormat.Unit[]> units) { argument 69 this.divisors = divisors; 269 // Silently ignore divisors that are too big. 325 result.divisors[thisIndex] = divisor; 431 for (int i = 0; i < result.divisors.length; i++) { 433 result.divisors[ [all...] |
/external/icu/icu4j/main/tests/core/src/com/ibm/icu/dev/test/format/ |
H A D | CompactDecimalFormatTest.java | 217 long[] divisors = new long[] { 223 checkCore(affixes, null, divisors, TestACoreCompactFormatList); 224 checkCore(affixes, currencyAffixes, divisors, TestACoreCompactFormatListCurrency); 227 private void checkCore(Map<String, String[][]> affixes, Map<String, String[]> currencyAffixes, long[] divisors, Object[][] testItems) { argument 233 divisors, affixes, currencyAffixes,
|
/external/pdfium/third_party/libjpeg/ |
H A D | fpdfapi_jcdctmgr.c | 28 /* The actual post-DCT divisors --- not identical to the quant table 32 DCTELEM * divisors[NUM_QUANT_TBLS]; member in struct:__anon15288 70 /* Compute divisors for this quant table */ 75 /* For LL&M IDCT method, divisors are equal to raw quantization 78 if (fdct->divisors[qtblno] == NULL) { 79 fdct->divisors[qtblno] = (DCTELEM *) 83 dtbl = fdct->divisors[qtblno]; 92 /* For AA&N IDCT method, divisors are equal to quantization 112 if (fdct->divisors[qtblno] == NULL) { 113 fdct->divisors[qtbln 189 DCTELEM * divisors = fdct->divisors[compptr->quant_tbl_no]; local 279 FAST_FLOAT * divisors = fdct->float_divisors[compptr->quant_tbl_no]; local [all...] |
/external/libjpeg-turbo/ |
H A D | jcdctmgr.c | 37 typedef void (*quantize_method_ptr) (JCOEFPTR coef_block, DCTELEM * divisors, 40 FAST_FLOAT * divisors, 53 /* The actual post-DCT divisors --- not identical to the quant table 57 DCTELEM * divisors[NUM_QUANT_TBLS]; member in struct:__anon9863 247 /* Compute divisors for this quant table */ 252 /* For LL&M IDCT method, divisors are equal to raw quantization 255 if (fdct->divisors[qtblno] == NULL) { 256 fdct->divisors[qtblno] = (DCTELEM *) 260 dtbl = fdct->divisors[qtblno]; 275 /* For AA&N IDCT method, divisors ar 403 quantize(JCOEFPTR coef_block, DCTELEM * divisors, DCTELEM * workspace) argument 493 DCTELEM * divisors = fdct->divisors[compptr->quant_tbl_no]; local 553 quantize_float(JCOEFPTR coef_block, FAST_FLOAT * divisors, FAST_FLOAT * workspace) argument 583 FAST_FLOAT * divisors = fdct->float_divisors[compptr->quant_tbl_no]; local [all...] |
H A D | jsimd_none.c | 288 jsimd_quantize (JCOEFPTR coef_block, DCTELEM * divisors, argument 294 jsimd_quantize_float (JCOEFPTR coef_block, FAST_FLOAT * divisors, argument
|
/external/libjpeg-turbo/simd/ |
H A D | jsimd_arm.c | 548 jsimd_quantize (JCOEFPTR coef_block, DCTELEM * divisors, argument 552 jsimd_quantize_neon(coef_block, divisors, workspace); 556 jsimd_quantize_float (JCOEFPTR coef_block, FAST_FLOAT * divisors, argument
|
H A D | jsimd_arm64.c | 386 jsimd_quantize (JCOEFPTR coef_block, DCTELEM * divisors, argument 392 jsimd_quantize_float (JCOEFPTR coef_block, FAST_FLOAT * divisors, argument
|
H A D | jsimd_i386.c | 845 jsimd_quantize (JCOEFPTR coef_block, DCTELEM * divisors, argument 849 jsimd_quantize_sse2(coef_block, divisors, workspace); 851 jsimd_quantize_mmx(coef_block, divisors, workspace); 855 jsimd_quantize_float (JCOEFPTR coef_block, FAST_FLOAT * divisors, argument 859 jsimd_quantize_float_sse2(coef_block, divisors, workspace); 861 jsimd_quantize_float_sse(coef_block, divisors, workspace); 863 jsimd_quantize_float_3dnow(coef_block, divisors, workspace);
|
H A D | jsimd_x86_64.c | 594 jsimd_quantize (JCOEFPTR coef_block, DCTELEM * divisors, argument 597 jsimd_quantize_sse2(coef_block, divisors, workspace); 601 jsimd_quantize_float (JCOEFPTR coef_block, FAST_FLOAT * divisors, argument 604 jsimd_quantize_float_sse2(coef_block, divisors, workspace);
|
H A D | jsimd_mips.c | 840 jsimd_quantize (JCOEFPTR coef_block, DCTELEM * divisors, argument 844 jsimd_quantize_mips_dspr2(coef_block, divisors, workspace); 848 jsimd_quantize_float (JCOEFPTR coef_block, FAST_FLOAT * divisors, argument 852 jsimd_quantize_float_mips_dspr2(coef_block, divisors, workspace);
|
/external/deqp/external/vulkancts/modules/vulkan/pipeline/ |
H A D | vktPipelineImageUtil.cpp | 51 /*! Gets the next value that is multiple of all given divisors */ 52 static deUint32 getNextMultiple (const std::vector<deUint32>& divisors, deUint32 value) argument 61 for (size_t divNdx = 0; divNdx < divisors.size(); divNdx++) 62 nextMultipleFound = nextMultipleFound && (nextMultiple % divisors[divNdx] == 0); 68 nextMultiple = getNextMultiple(divisors[0], nextMultiple + 1);
|
/external/icu/icu4c/source/i18n/ |
H A D | compactdecimalformat.cpp | 88 double divisors[MAX_DIGITS]; member in class:CDFLocaleStyleData 91 // first compute log10(x). Compute displayNum = (x / divisors[log10(x)]). 168 const double* divisors, 170 : DecimalFormat(decimalFormat), _unitsByVariant(unitsByVariant), _divisors(divisors), _pluralRules(pluralRules) { 193 new CompactDecimalFormat(*decfmt, data->unitsByVariant, data->divisors, pluralRules.getAlias()); 747 // Silently ignore divisors that are too big. 800 result->divisors[log10Value] = divisor; 911 result->divisors[i] = lastDivisor; 914 lastDivisor = result->divisors[i]; 165 CompactDecimalFormat( const DecimalFormat& decimalFormat, const UHashtable* unitsByVariant, const double* divisors, PluralRules* pluralRules) argument
|