HomeSort by relevance Sort by last modified time
    Searched refs:modulo (Results 1 - 25 of 167) sorted by null

1 2 3 4 5 6 7

  /frameworks/rs/rsov/tests/RSoVTest/src/com/android/rs/rsov/test/
modulo.rs 21 int RS_KERNEL modulo(int a) {
  /external/valgrind/none/tests/ppc32/
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/
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/icu/android_icu4j/src/main/java/android/icu/impl/coll/
BOCSU.java 56 * number of byte values available, the modulo is used for one trail
233 * Integer division and modulo with negative numerators
234 * yields negative modulo results and quotients that are one more than
238 * @return (result of division) << 32 | modulo
242 int modulo = number % factor; local
244 if (modulo < 0) {
246 modulo += factor;
248 return (result << 32) | modulo;
296 int modulo = (int)division; local
300 buffer[offset ++] = (byte)(SLOPE_MIN_ + modulo);
    [all...]
  /external/icu/icu4j/main/classes/collate/src/com/ibm/icu/impl/coll/
BOCSU.java 55 * number of byte values available, the modulo is used for one trail
232 * Integer division and modulo with negative numerators
233 * yields negative modulo results and quotients that are one more than
237 * @return (result of division) << 32 | modulo
241 int modulo = number % factor; local
243 if (modulo < 0) {
245 modulo += factor;
247 return (result << 32) | modulo;
295 int modulo = (int)division; local
299 buffer[offset ++] = (byte)(SLOPE_MIN_ + modulo);
    [all...]
  /external/fio/lib/
num2str.c 26 unsigned int modulo; local
68 modulo = -1U;
74 modulo = num % thousand[!!pow2];
76 carry = modulo >= thousand[!!pow2] / 2;
81 * If no modulo, then we're done.
83 if (modulo == -1U) {
107 assert(modulo < thousand[!!pow2]);
109 sprintf(tmp, fmt, (double)modulo / (double)thousand[!!pow2]);
  /frameworks/av/media/libstagefright/foundation/
ADebug.cpp 127 bool allow, const char *name, uint64_t modulo,
139 UNUSED(modulo);
179 // MINOR: use modulo for counter and time, so that their sum does not
182 time_t counter = (time(NULL) / timeDivisor) % modulo + plus + serialNum % modulo;
183 bool enable = allow && (counter % modulo < limit);
  /prebuilts/go/darwin-x86/misc/cgo/test/
issue5242.go 7 // modulo-by-zero computations.
  /prebuilts/go/linux-x86/misc/cgo/test/
issue5242.go 7 // modulo-by-zero computations.
  /external/v8/src/
codegen.h 101 V8_EXPORT_PRIVATE double modulo(double x, double y);
codegen.cc 27 double modulo(double x, double y) { function in namespace:v8::internal
39 double modulo(double x, double y) {
  /frameworks/base/core/java/android/widget/
AdapterViewAnimator.java 349 int modulo(int pos, int size) { method in class:AdapterViewAnimator
365 int i = modulo(mCurrentWindowStartUnbounded + relativeIndex, getWindowSize());
414 int index = modulo(i, getWindowSize());
418 final View updatedChild = mAdapter.getView(modulo(i, adapterCount), null, this);
486 int rangeStart = modulo(newWindowStart, getWindowSize());
487 int rangeEnd = modulo(newWindowEnd, getWindowSize());
521 int index = modulo(i, getWindowSize());
544 final int adapterPosition = modulo(i, adapterCount);
568 int adapterStart = modulo(mCurrentWindowStart, adapterCount);
569 int adapterEnd = modulo(mCurrentWindowEnd, adapterCount)
    [all...]
  /prebuilts/go/darwin-x86/src/cmd/asm/internal/asm/
expr_test.go 85 {"3%0", "modulo by zero"},
86 {"(1<<63)%0", "modulo of value with high bit set"},
  /prebuilts/go/linux-x86/src/cmd/asm/internal/asm/
expr_test.go 85 {"3%0", "modulo by zero"},
86 {"(1<<63)%0", "modulo of value with high bit set"},
  /prebuilts/go/darwin-x86/src/math/
sincos.go 46 j &= 7 // octant modulo 2Pi radians (360 degrees)
sin.go 146 j &= 7 // octant modulo 2Pi radians (360 degrees)
206 j &= 7 // octant modulo 2Pi radians (360 degrees)
  /prebuilts/go/darwin-x86/src/runtime/debug/
stack_test.go 23 The traceback should look something like this, modulo line numbers and hex constants.
  /prebuilts/go/linux-x86/src/math/
sincos.go 46 j &= 7 // octant modulo 2Pi radians (360 degrees)
sin.go 146 j &= 7 // octant modulo 2Pi radians (360 degrees)
206 j &= 7 // octant modulo 2Pi radians (360 degrees)
  /prebuilts/go/linux-x86/src/runtime/debug/
stack_test.go 23 The traceback should look something like this, modulo line numbers and hex constants.
  /external/skia/tools/lua/
lua_pictures.cpp 32 // Example usage for the modulo flag:
33 // for i in {0..5}; do lua_pictures --skpPath SKP_PATH -l YOUR_SCRIPT --modulo $i 6 &; done
34 static DEFINE_string(modulo, "", "[--modulo <remainder> <divisor>]: only run tests for which "
113 SkDebugf("invalid modulo values.\n");
  /external/skqp/tools/lua/
lua_pictures.cpp 32 // Example usage for the modulo flag:
33 // for i in {0..5}; do lua_pictures --skpPath SKP_PATH -l YOUR_SCRIPT --modulo $i 6 &; done
34 static DEFINE_string(modulo, "", "[--modulo <remainder> <divisor>]: only run tests for which "
113 SkDebugf("invalid modulo values.\n");
  /frameworks/av/media/libstagefright/foundation/include/media/stagefright/foundation/
ADebug.h 193 bool allow, const char *name, uint64_t modulo, uint64_t limit,
  /prebuilts/go/darwin-x86/src/strconv/
itoa.go 120 // since 64bit division and modulo operations
179 // since 64bit division and modulo operations
  /prebuilts/go/linux-x86/src/strconv/
itoa.go 120 // since 64bit division and modulo operations
179 // since 64bit division and modulo operations

Completed in 550 milliseconds

1 2 3 4 5 6 7