| /external/fio/lib/ |
| D | num2str.c | 17 unsigned int modulo, decimals; in num2str() local
37 modulo = -1U; in num2str()
43 modulo = num % thousand[!!pow2]; in num2str()
45 carry = modulo >= thousand[!!pow2] / 2; in num2str()
49 if (modulo == -1U) { in num2str()
68 sprintf(tmp, "%u", modulo); in num2str()
72 modulo = (modulo + 9) / 10; in num2str()
75 sprintf(buf, "%llu.%u%s%s", (unsigned long long) num, modulo, in num2str()
|
| /external/icu/icu4j/main/classes/collate/src/com/ibm/icu/impl/coll/ |
| D | BOCSU.java | 239 int modulo = number % factor; in getNegDivMod() local
241 if (modulo < 0) { in getNegDivMod()
243 modulo += factor; in getNegDivMod()
245 return (result << 32) | modulo; in getNegDivMod()
293 int modulo = (int)division; in writeDiff() local
297 buffer[offset ++] = (byte)(SLOPE_MIN_ + modulo); in writeDiff()
300 buffer[offset + 2] = (byte)(SLOPE_MIN_ + modulo); in writeDiff()
303 modulo = (int)division; in writeDiff()
305 buffer[offset + 1] = (byte)(SLOPE_MIN_ + modulo); in writeDiff()
310 buffer[offset + 3] = (byte)(SLOPE_MIN_ + modulo); in writeDiff()
[all …]
|
| /external/icu/android_icu4j/src/main/java/android/icu/impl/coll/ |
| D | BOCSU.java | 240 int modulo = number % factor; in getNegDivMod() local
242 if (modulo < 0) { in getNegDivMod()
244 modulo += factor; in getNegDivMod()
246 return (result << 32) | modulo; in getNegDivMod()
294 int modulo = (int)division; in writeDiff() local
298 buffer[offset ++] = (byte)(SLOPE_MIN_ + modulo); in writeDiff()
301 buffer[offset + 2] = (byte)(SLOPE_MIN_ + modulo); in writeDiff()
304 modulo = (int)division; in writeDiff()
306 buffer[offset + 1] = (byte)(SLOPE_MIN_ + modulo); in writeDiff()
311 buffer[offset + 3] = (byte)(SLOPE_MIN_ + modulo); in writeDiff()
[all …]
|
| /external/antlr/antlr-3.4/runtime/JavaScript/tests/functional/ |
| D | t058rewriteAST70.g | 4 modulo
5 : 'modulo' ID ('(' parms+ ')')? -> ^('modulo' ID ^(PARMS parms+)?)
|
| /external/valgrind/none/tests/ppc32/ |
| D | data-cache-instructions.stdout.exp | 2 Passed dcbzl test at un-aligned (1 modulo block_size) address within the test block.
3 Passed dcbzl test at un-aligned ((block_size - 1) modulo block_size) address within the test block.
|
| /external/valgrind/none/tests/ppc64/ |
| D | data-cache-instructions.stdout.exp | 2 Passed dcbzl test at un-aligned (1 modulo block_size) address within the test block.
3 Passed dcbzl test at un-aligned ((block_size - 1) modulo block_size) address within the test block.
|
| /external/chromium-trace/catapult/third_party/gsutil/third_party/rsa/rsa/ |
| D | common.py | 171 for modulo in modulo_values:
172 m *= modulo
|
| /external/chromium-trace/catapult/third_party/Paste/paste/exceptions/ |
| D | serial_number_generator.py | 72 modulo = base ** length
75 number = (number * 256 + six.byte2int([c])) % modulo
|
| /external/antlr/antlr-3.4/runtime/C/src/ |
| D | antlr3collections.c | 155 table->modulo = sizeHint; in antlr3HashTableNew()
208 for (bucket = 0; bucket < table->modulo; bucket++) in antlr3HashFree()
283 hash = (ANTLR3_UINT32)(key % (ANTLR3_INTKEY)(table->modulo)); in antlr3HashRemoveI()
344 bucket = table->buckets + (hash % table->modulo); in antlr3HashRemove()
452 hash = (ANTLR3_UINT32)(key % (ANTLR3_INTKEY)(table->modulo)); in antlr3HashGetI()
496 bucket = table->buckets + (hash % table->modulo); in antlr3HashGet()
532 hash = (ANTLR3_UINT32)(key % (ANTLR3_INTKEY)(table->modulo)); in antlr3HashPutI()
607 bucket = table->buckets + (hash % table->modulo); in antlr3HashPut()
733 if (en->bucket >= en->table->modulo) in antlr3EnumNext()
791 while (en->bucket < en->table->modulo) in antlr3EnumNextEntry()
|
| /external/v8/src/ |
| D | codegen.cc | 22 double modulo(double x, double y) { in modulo() function
34 double modulo(double x, double y) {
|
| D | codegen.h | 99 double modulo(double x, double y);
|
| D | conversions.cc | 444 double remainder = modulo(integer_part, radix); in DoubleToRadixCString()
|
| /external/lldb/examples/python/ |
| D | sbvalue.py | 196 def __ipow__(self, other, modulo): argument
197 result = self.__pow__(self, other, modulo)
|
| /external/v8/test/webkit/ |
| D | mod-by-zero-expected.txt | 24 This tests that modulo with zero does not crash but returns NaN.
|
| /external/skia/tools/lua/ |
| D | lua_pictures.cpp | 34 DEFINE_string(modulo, "", "[--modulo <remainder> <divisor>]: only run tests for which "
|
| /external/v8/test/mjsunit/es6/ |
| D | array-concat.js | 248 function testConcatTypedArray(type, elems, modulo) { argument
253 ta_by_len[i] = items[i] = modulo === false ? i : elems % modulo;
|
| /external/autotest/client/deps/glbench/src/ |
| D | yuv2rgb_2.glslf | 35 * of the original image is 2 modulo 4.
|
| /external/antlr/antlr-3.4/runtime/C/include/ |
| D | antlr3collections.h | 111 ANTLR3_UINT32 modulo; member
|
| /external/zlib/src/doc/ |
| D | rfc1950.txt | 327 are done modulo 65521. s1 is initialized to 1, s2 to zero. The
484 The modulo on unsigned long accumulators can be delayed for 5552
485 bytes, so the modulo operation time is negligible. If the bytes
525 % modulo operator: a % b is the remainder of a divided by b.
|
| /external/chromium-trace/catapult/third_party/gsutil/third_party/pyasn1/pyasn1/type/ |
| D | univ.py | 42 def __pow__(self, value, modulo=None): return self.clone(pow(self._value, value, modulo)) argument
583 def __pow__(self, value, modulo=None): return self.clone(pow(float(self), value, modulo)) argument
|
| /external/iputils/doc/ |
| D | clockdiff.sgml | 76 <command/clockdiff/ shows difference in time modulo 24 days.
|
| /external/llvm/docs/ |
| D | AMDGPUUsage.rst | 19 Below some of the currently supported features (modulo bugs). These
|
| /external/jsilver/src/com/google/clearsilver/jsilver/syntax/ |
| D | jsilver.sablecc | 499 | {modulo} [left]:factor percent [right]:value // x.y % a.b
500 {->New expression.modulo(left.expression, right.expression)}
700 | {modulo} [left]:expression [right]:expression // x % y
|
| /external/libopus/ |
| D | README | 136 modulo 2^N to be within range of the type,
|
| /external/srtp/doc/ |
| D | draft-irtf-cfrg-icm-00.txt | 217 Implementation of the `add one modulo 2^m' operation is simple. For
223 The implementation of general purpose addition modulo 2^m is
|