| /external/chromium_org/third_party/mesa/src/src/glx/ |
| dri2.h | 90 CARD64 remainder, CARD64 *count);
97 CARD64 remainder, CARD64 *ust, CARD64 *msc, CARD64 *sbc);
|
| /external/mesa3d/src/glx/ |
| dri2.h | 90 CARD64 remainder, CARD64 *count);
97 CARD64 remainder, CARD64 *ust, CARD64 *msc, CARD64 *sbc);
|
| /system/core/toolbox/upstream-netbsd/bin/cp/ |
| utils.c | 216 size_t remainder; local
229 remainder = fsize;
233 chunk = (remainder > MMAP_MAX_WRITE) ?
234 MMAP_MAX_WRITE : remainder;
235 if (write(to_fd, &p[fsize - remainder],
241 remainder -= chunk;
245 } while (remainder > 0);
|
| /external/proguard/src/proguard/evaluation/value/ |
| LongValue.java | 128 * Returns the remainder of this LongValue divided by the given
131 public LongValue remainder(LongValue other) method in class:LongValue
138 * Returns the remainder of the given LongValue divided by this
144 return other.remainder(this);
284 * Returns the remainder of this LongValue divided by the given
287 public LongValue remainder(SpecificLongValue other) method in class:LongValue
293 * Returns the remainder of the given SpecificLongValue divided by this
440 * Returns the remainder of this LongValue divided by the given
443 public LongValue remainder(ParticularLongValue other) method in class:LongValue
445 return remainder((SpecificLongValue)other)
[all...] |
| ParticularLongValue.java | 112 public LongValue remainder(LongValue other) method in class:ParticularLongValue
121 return other.remainder(this);
200 public LongValue remainder(ParticularLongValue other) method in class:ParticularLongValue
|
| SpecificLongValue.java | 92 public LongValue remainder(LongValue other) method in class:SpecificLongValue
101 return other.remainder(this);
184 public LongValue remainder(SpecificLongValue other) method in class:SpecificLongValue
187 return new CompositeLongValue(this, CompositeLongValue.REMAINDER, other);
193 return new CompositeLongValue(other, CompositeLongValue.REMAINDER, this);
|
| UnknownLongValue.java | 93 public LongValue remainder(LongValue other) method in class:UnknownLongValue
|
| IntegerValue.java | 121 * Returns the remainder of this IntegerValue divided by the given
124 public abstract IntegerValue remainder(IntegerValue other) method in class:IntegerValue
128 * Returns the remainder of the given IntegerValue divided by this
312 * Returns the remainder of this IntegerValue divided by the given
315 public IntegerValue remainder(UnknownIntegerValue other) method in class:IntegerValue
317 return remainder((IntegerValue)other);
321 * Returns the remainder of the given UnknownIntegerValue divided by this
556 * Returns the remainder of this IntegerValue divided by the given
559 public IntegerValue remainder(SpecificIntegerValue other) method in class:IntegerValue
561 return remainder((IntegerValue)other)
803 public IntegerValue remainder(ParticularIntegerValue other) method in class:IntegerValue
[all...] |
| /external/chromium_org/third_party/WebKit/Source/core/html/forms/ |
| StepRange.cpp | 154 // remainder makes no sense.
161 const Decimal remainder = (value - m_step * (value / m_step).round()).abs(); local
165 return computedAcceptableError < remainder && remainder < (m_step - computedAcceptableError);
|
| /external/chromium_org/third_party/icu/source/i18n/ |
| persncal.cpp | 110 int32_t remainder; local
111 ClockMath::floorDivide(25 * year + 11, 33, remainder);
112 return (remainder < 8);
|
| /external/chromium_org/third_party/skia/src/core/ |
| SkRTree.cpp | 341 int remainder = branches->count() % fMaxChildren; local
344 if (0 != remainder) {
346 // If the remainder isn't enough to fill a node, we'll need to add fewer nodes to
348 if (remainder >= fMinChildren) {
349 remainder = 0;
351 remainder = fMinChildren - remainder;
365 int end = currentBranch + numTiles * fMaxChildren - SkMin32(remainder,
377 if (remainder != 0) {
378 // if need be, omit some nodes to make up for remainder
[all...] |
| /external/icu/icu4c/source/i18n/ |
| persncal.cpp | 110 int32_t remainder; local
111 ClockMath::floorDivide(25 * year + 11, 33, remainder);
112 return (remainder < 8);
|
| /external/skia/src/core/ |
| SkRTree.cpp | 334 int remainder = branches->count() % fMaxChildren; local
337 if (0 != remainder) {
339 // If the remainder isn't enough to fill a node, we'll need to add fewer nodes to
341 if (remainder >= fMinChildren) {
342 remainder = 0;
344 remainder = fMinChildren - remainder;
358 int end = currentBranch + numTiles * fMaxChildren - SkMin32(remainder,
370 if (remainder != 0) {
371 // if need be, omit some nodes to make up for remainder
[all...] |
| /system/core/libutils/ |
| LinearTransform.cpp | 87 // Divide again. Keep the remainder around in order to round properly.
237 const T remainder = a % b; local
238 if (remainder == 0) {
243 // by swapping remainder and b, we are guaranteeing that a is
246 b = remainder;
|
| /external/chromium_org/chrome/browser/chromeos/policy/ |
| auto_enrollment_client.cc | 258 uint64 remainder = 0;
261 remainder = remainder | (byte << (8 * i));
263 remainder = remainder & ((GG_UINT64_C(1) << current_power_) - 1);
274 request->set_remainder(remainder);
|
| /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/crypto/generators/ |
| RSAKeyPairGenerator.java | 139 dP = d.remainder(pSub1);
140 dQ = d.remainder(qSub1);
|
| /external/chromium_org/third_party/WebKit/Source/platform/ |
| DecimalTest.cpp | [all...] |
| /bionic/libm/upstream-freebsd/lib/msun/src/ |
| e_remainder.c | 78 __weak_reference(remainder, remainderl);
|
| /external/chromium_org/third_party/libva/va/x11/ |
| va_dri2.h | 72 CARD64 remainder, CARD64 *count);
|
| /external/openfst/src/include/fst/ |
| partition.h | 168 size_t remainder = class_size_[class_id] - split_size_[class_id]; local
169 if (remainder < split_size_[class_id]) { // add smaller
173 class_size_[new_class] = remainder;
179 class_size_[class_id] = remainder;
|
| /external/srec/tools/thirdparty/OpenFst/fst/lib/ |
| partition.h | 163 size_t remainder = class_size_[class_id] - split_size_[class_id]; local
164 if (remainder < (size_t)split_size_[class_id]) { // add smaller
168 class_size_[new_class] = remainder;
174 class_size_[class_id] = remainder;
|
| /hardware/intel/common/libva/va/x11/ |
| va_dri2.h | 72 CARD64 remainder, CARD64 *count);
|
| /ndk/tests/device/issue42891-boost-1_52/jni/boost/boost/test/utils/runtime/cla/ |
| argv_traverser.hpp | 50 void remainder( int& argc, char_type** argv );
|
| /external/chromium_org/third_party/webrtc/modules/bitrate_controller/ |
| bitrate_controller_impl.cc | 320 // Carry the remainder forward.
321 uint32_t remainder = observer_allowance - max_it->first; local
323 bitrate_per_observer += remainder / number_of_observers;
354 uint32_t remainder = bitrate; local
358 uint32_t allocation = std::min(remainder, it->second->min_bitrate_);
360 remainder -= allocation;
|
| /libcore/harmony-tests/src/test/java/org/apache/harmony/tests/java/math/ |
| BigIntegerDivideTest.java | 28 * Methods: divide, remainder, mod, and divideAndRemainder
399 * Remainder of division by zero
409 aNumber.remainder(bNumber);
416 * Remainder of division of equal numbers
426 BigInteger result = aNumber.remainder(bNumber);
436 * Remainder of division of two positive numbers
446 BigInteger result = aNumber.remainder(bNumber);
456 * Remainder of division of two negative numbers
466 BigInteger result = aNumber.remainder(bNumber);
476 * Remainder of division of two numbers of different signs
[all...] |
