| /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, "%lu.%u%s%s", num, modulo, postfix[post_index], in num2str()
|
| /external/antlr/antlr-3.4/runtime/JavaScript/tests/functional/ |
| D | t058rewriteAST70.g | 4 modulo
5 : 'modulo' ID ('(' parms+ ')')? -> ^('modulo' ID ^(PARMS parms+)?)
|
| /external/valgrind/main/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/valgrind/main/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/chromium_org/v8/src/ |
| D | codegen.cc | 31 double modulo(double x, double y) { in modulo() function
38 double modulo(double x, double y) {
50 double modulo(double x, double y) {
|
| D | codegen.h | 104 double modulo(double x, double y);
|
| /external/libcxx/test/numerics/numarray/template.gslice.array/gslice.array.comp.assign/ |
| D | Android.mk | 39 test_name := numerics/numarray/template.gslice.array/gslice.array.comp.assign/modulo
40 test_src := modulo.pass.cpp
|
| /external/libcxx/test/numerics/numarray/template.mask.array/mask.array.comp.assign/ |
| D | Android.mk | 39 test_name := numerics/numarray/template.mask.array/mask.array.comp.assign/modulo
40 test_src := modulo.pass.cpp
|
| /external/libcxx/test/numerics/numarray/template.slice.array/slice.arr.comp.assign/ |
| D | Android.mk | 39 test_name := numerics/numarray/template.slice.array/slice.arr.comp.assign/modulo
40 test_src := modulo.pass.cpp
|
| /external/libcxx/test/numerics/numarray/template.indirect.array/indirect.array.comp.assign/ |
| D | Android.mk | 39 test_name := numerics/numarray/template.indirect.array/indirect.array.comp.assign/modulo
40 test_src := modulo.pass.cpp
|
| /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/lldb/examples/python/ |
| D | sbvalue.py | 196 def __ipow__(self, other, modulo): argument
197 result = self.__pow__(self, other, modulo)
|
| /external/chromium_org/v8/test/webkit/ |
| D | mod-by-zero-expected.txt | 24 This tests that modulo with zero does not crash but returns NaN.
|
| /external/qemu/target-mips/ |
| D | TODO | 21 for read/write/execute, a TLB index which is just a modulo of the
|
| /external/chromium_org/third_party/skia/tools/lua/ |
| D | lua_pictures.cpp | 33 DEFINE_string(modulo, "", "[--modulo <remainder> <divisor>]: only run tests for which "
|
| /external/skia/tools/lua/ |
| D | lua_pictures.cpp | 33 DEFINE_string(modulo, "", "[--modulo <remainder> <divisor>]: only run tests for which "
|
| /external/antlr/antlr-3.4/runtime/C/include/ |
| D | antlr3collections.h | 111 ANTLR3_UINT32 modulo; member
|
| /external/openssl/crypto/modes/asm/ |
| D | ghash-x86_64.pl | 355 my ($Xhi,$Xi,$Hkey,$modulo)=@_;
357 $code.=<<___ if (!defined($modulo));
|
| /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/iputils/doc/ |
| D | clockdiff.sgml | 76 <command/clockdiff/ shows difference in time modulo 24 days.
|
| /external/openssl/crypto/aes/asm/ |
| D | aes-mips.S | 936 lw $8,16($6) # modulo-scheduled
988 lw $8,4($6) # modulo-scheduled
|
| /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/chromium_org/third_party/opus/src/ |
| 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
|