| /external/jemalloc/include/jemalloc/internal/ |
| nstime.h | 34 void nstime_idivide(nstime_t *time, uint64_t divisor);
35 uint64_t nstime_divide(const nstime_t *time, const nstime_t *divisor);
|
| /external/caliper/caliper/src/main/java/com/google/caliper/util/ |
| LinearTranslation.java | 40 double divisor = in1 - in2; local
41 this.m = (out1 - out2) / divisor;
42 this.b = (in1 * out2 - in2 * out1) / divisor;
|
| ShortDuration.java | 146 * value {@code divisor}, rounded according to {@code roundingMode} if necessary.
151 public abstract ShortDuration dividedBy(long divisor, RoundingMode roundingMode);
155 * divisor}, rounded according to {@code roundingMode} if necessary.
160 public abstract ShortDuration dividedBy(BigDecimal divisor, RoundingMode roundingMode);
181 @Override public ShortDuration dividedBy(long divisor, RoundingMode roundingMode) {
182 return dividedBy(new BigDecimal(divisor), roundingMode);
184 @Override public ShortDuration dividedBy(BigDecimal divisor, RoundingMode roundingMode) {
185 checkArgument(divisor.compareTo(BigDecimal.ZERO) != 0);
215 BigDecimal divisor = ONE_IN_PICOS.get(unit); local
216 return toLong(new BigDecimal(picos).divide(divisor), roundingMode)
275 BigDecimal divisor = ONE_IN_PICOS.get(bestUnit); local
[all...] |
| /packages/apps/TvSettings/Settings/src/com/android/tv/settings/widget/ |
| Lerper.java | 20 * Lerper model tracks target position by adding (target - source) / divisor to source position
29 public void setDivisor(float divisor) {
30 if (divisor < 1f) throw new IllegalArgumentException();
31 mDivisor = divisor;
32 mMinDelta = 1 / divisor;
|
| /external/llvm/lib/Support/ |
| ScaledNumber.cpp | 58 uint32_t Divisor) {
60 assert(Divisor && "expected non-zero divisor");
69 uint64_t Quotient = Dividend64 / Divisor;
70 uint64_t Remainder = Dividend64 % Divisor;
77 return getRounded<uint32_t>(Quotient, Shift, Remainder >= getHalf(Divisor));
81 uint64_t Divisor) {
83 assert(Divisor && "expected non-zero divisor");
85 // Minimize size of divisor
[all...] |
| /external/v8/test/mjsunit/ |
| div-mod.js | 44 function run_tests_for(divisor) {
45 print("(function(left) { return left / " + divisor + "; })");
46 var div_func = this.eval("(function(left) { return left / " + divisor + "; })");
47 var mod_func = this.eval("(function(left) { return left % " + divisor + "; })");
50 divmod(div_func, mod_func, 0, divisor);
51 divmod(div_func, mod_func, 1 / 0, divisor);
54 divmod(div_func, mod_func, Math.pow(2, exp), divisor);
55 divmod(div_func, mod_func, 0.9999999 * Math.pow(2, exp), divisor);
56 divmod(div_func, mod_func, 1.0000001 * Math.pow(2, exp), divisor);
60 divmod(div_func, mod_func, 1 << exp, divisor);
[all...] |
| /external/llvm/test/CodeGen/X86/ |
| phys_subreg_coalesce-2.ll | 19 %indvar = phi i32 [ 0, %forcond.preheader ], [ %divisor.02, %forbody ] ; <i32> [#uses=3]
21 %divisor.02 = add i32 %indvar, 1 ; <i32> [#uses=2]
24 %div = udiv i32 %mul, %divisor.02 ; <i32> [#uses=2]
|
| pr2659.ll | 32 %indvar = phi i32 [ 0, %forcond.preheader ], [ %divisor.02, %forbody ] ; <i32> [#uses=3]
34 %divisor.02 = add i32 %indvar, 1 ; <i32> [#uses=2]
37 %div = udiv i32 %mul, %divisor.02 ; <i32> [#uses=2]
|
| /external/llvm/lib/Transforms/Utils/ |
| BypassSlowDivision.cpp | 32 Value *Divisor;
35 : SignedOp(InSignedOp), Dividend(InDividend), Divisor(InDivisor) {}
53 Val1.Divisor == Val2.Divisor;
66 reinterpret_cast<uintptr_t>(Val.Divisor)) ^
87 Value *Divisor = Instr->getOperand(1);
89 if (isa<ConstantInt>(Divisor) ||
90 (isa<ConstantInt>(Dividend) && isa<ConstantInt>(Divisor))) {
109 SlowQuotientV = SlowBuilder.CreateSDiv(Dividend, Divisor);
110 SlowRemainderV = SlowBuilder.CreateSRem(Dividend, Divisor);
[all...] |
| IntegerDivision.cpp | 34 static Value *generateSignedRemainderCode(Value *Dividend, Value *Divisor,
50 // ; %divisor_sgn = ashr i32 %divisor, 31
52 // ; %dvs_xor = xor i32 %divisor, %divisor_sgn
55 // ; %urem = urem i32 %dividend, %divisor
59 Value *DivisorSign = Builder.CreateAShr(Divisor, Shift);
61 Value *DvsXor = Builder.CreateXor(Divisor, DivisorSign);
80 static Value *generatedUnsignedRemainderCode(Value *Dividend, Value *Divisor,
82 // Remainder = Dividend - Quotient*Divisor
86 // ; %quotient = udiv i32 %dividend, %divisor
87 // ; %product = mul i32 %divisor, %quotien
[all...] |
| /libcore/luni/src/main/java/java/math/ |
| BigDecimal.java | 1087 long divisor = scaledDivisor.longValue(); local
[all...] |
| Division.java | 50 final int divisor) {
53 long bLong = divisor & 0xffffffffL;
67 long bPos = divisor >>> 1;
72 if ((divisor & 1) != 0) {
73 // the divisor is odd
|
| /external/guava/guava/src/com/google/common/primitives/ |
| UnsignedInts.java | 173 * Returns dividend / divisor, where the dividend and divisor are treated as unsigned 32-bit
177 * @param divisor the divisor (denominator)
178 * @throws ArithmeticException if divisor is 0
180 public static int divide(int dividend, int divisor) {
181 return (int) (toLong(dividend) / toLong(divisor));
185 * Returns dividend % divisor, where the dividend and divisor are treated as unsigned 32-bit
189 * @param divisor the divisor (denominator
[all...] |
| /external/mesa3d/src/glx/apple/ |
| glx_empty.c | 45 glXWaitVideoSyncSGI(int divisor, int remainder, unsigned int *count)
102 int64_t target_msc, int64_t divisor, int64_t remainder)
107 (void) divisor;
115 int64_t target_msc, int64_t divisor,
122 (void) divisor;
|
| /prebuilts/go/darwin-x86/src/runtime/ |
| vlop_arm_test.go | 39 func bmUint32Div(divisor uint32, b *testing.B) {
42 sum += numerators[i&(numeratorsSize-1)] / divisor
57 func bmUint32Mod(divisor uint32, b *testing.B) {
60 sum += numerators[i&(numeratorsSize-1)] % divisor
|
| /prebuilts/go/linux-x86/src/runtime/ |
| vlop_arm_test.go | 39 func bmUint32Div(divisor uint32, b *testing.B) {
42 sum += numerators[i&(numeratorsSize-1)] / divisor
57 func bmUint32Mod(divisor uint32, b *testing.B) {
60 sum += numerators[i&(numeratorsSize-1)] % divisor
|
| /art/cmdline/ |
| memory_representation.h | 29 // The underlying runtime size_t value is guaranteed to be a multiple of Divisor.
32 static_assert(IsPowerOfTwo(kDivisor), "Divisor must be a power of 2");
|
| /art/test/435-try-finally-without-catch/ |
| info.txt | 8 divisor is non-null, as it wouldn't be used. However, dx is not
9 that clever regarding exception handling: if the divisor is known to
|
| /external/iproute2/man/man8/ |
| tc-sfq.8 | 6 .B [ divisor
82 After linux-3.3, maximum length of SFQ is 65535 packets, and divisor limit is 65536.
87 divisor
89 The specified divisor must be a power of two and cannot be larger than 65536.
104 Its better to increase divisor value to lower risk of hash collisions.
186 # tc filter add ... flow hash keys src,dst perturb 30 divisor 1024
188 Note that the given divisor should match the one used by sfq. If you have
194 # tc qdisc add dev eth0 parent 1:1 handle 10: sfq limit 3000 flows 512 divisor 16384
|
| tc-flow.8 | 33 .B divisor
79 .BI divisor " NUM"
89 .B divisor
168 .B divisor
231 keys src,dst,proto,proto-src,proto-dst divisor 1024
239 divisor 1024
246 key dst addend -192.168.0.0 divisor 256
|
| /external/v8/src/base/ |
| division-by-constant.h | 29 // The divisor must not be -1, 0 or 1 when interpreted as a signed value.
35 // see Warren's "Hacker's Delight", chapter 10. The divisor must not be 0 and
|
| /external/libnl/lib/route/sch/ |
| sfq.c | 22 * - \b Divisor: Hash table divisor, i.e. size of hash table.
75 sfq->qs_divisor = opts->divisor;
104 nl_dump(p, "limit %u divisor %u",
251 * Get divisor of SFQ qdisc.
253 * @return Divisor in number of entries or a negative error code.
|
| /external/iproute2/tc/ |
| q_sfq.c | 31 fprintf(stderr, " [ divisor NUMBER ] [ flows NUMBER] [ depth NUMBER ]\n");
75 } else if (strcmp(*argv, "divisor") == 0) {
77 if (get_u32(&opt.v0.divisor, *argv, 0)) {
78 fprintf(stderr, "Illegal \"divisor\"\n");
229 fprintf(f, "flows %u/%u ", qopt->flows, qopt->divisor);
231 fprintf(f, "divisor %u ", qopt->divisor);
|
| /external/skia/dm/ |
| DMSrcSink.cpp | 141 const uint32_t divisor = 2; local
142 if (width < divisor || height < divisor) {
143 return Error::Nonfatal("Divisor is larger than image dimension.");
150 const uint32_t maxBorder = SkTMin(width, height) / (fSampleSize * divisor);
167 for (uint32_t x = 0; x < divisor; x++) {
168 for (uint32_t y = 0; y < divisor; y++) {
170 uint32_t subsetWidth = width / divisor;
171 uint32_t subsetHeight = height / divisor;
176 // divisor does not divide evenly into the image dimension
555 int divisor = 2; local
725 const int divisor = 2; local
[all...] |
| /external/boringssl/src/crypto/bn/ |
| div.c | 109 /* BN_div computes dv := num / divisor, rounding towards
110 * zero, and sets up rm such that dv*divisor + rm = num holds.
112 * dv->neg == num->neg ^ divisor->neg (unless the result is zero)
115 int BN_div(BIGNUM *dv, BIGNUM *rm, const BIGNUM *num, const BIGNUM *divisor,
127 (divisor->top > 0 && divisor->d[divisor->top - 1] == 0)) {
133 (divisor->flags & BN_FLG_CONSTTIME) != 0) {
137 if (BN_is_zero(divisor)) {
142 if (!no_branch && BN_ucmp(num, divisor) < 0)
[all...] |
