| /external/icu/icu4j/tools/misc/src/com/ibm/icu/dev/tool/layout/ |
| TaggedRecord.java | 56 int log2 = Utility.highBit(count); local
57 int power = 1 << log2;
|
| ClassTable.java | 70 int log2 = Utility.highBit(table.length); local
71 int power = 1 << log2;
|
| /prebuilts/go/darwin-x86/src/math/big/ |
| natconv_test.go | 22 // log2 computes the integer binary logarithm of x.
25 func log2(x Word) int { func
39 i := x.bitLen()/log2(Word(base)) + 1 // +1: round up
|
| /prebuilts/go/linux-x86/src/math/big/ |
| natconv_test.go | 22 // log2 computes the integer binary logarithm of x.
25 func log2(x Word) int { func
39 i := x.bitLen()/log2(Word(base)) + 1 // +1: round up
|
| /cts/common/device-side/util/tests/src/com/android/compatibility/common/util/ |
| DeviceReportTest.java | 109 DeviceReportLog log2 = new DeviceReportLog(REPORT_NAME_1, STREAM_NAME_2); local
110 log2.addValue(TEST_MESSAGE_2, TEST_VALUE_2, TEST_TYPE_2, TEST_UNIT_2);
111 log2.setSummary(TEST_MESSAGE_2, TEST_VALUE_2, TEST_TYPE_2, TEST_UNIT_2);
112 log2.submit(inst);
|
| /prebuilts/go/darwin-x86/src/image/gif/ |
| writer.go | 27 func log2(x int) int { func
159 paddedSize := log2(len(p)) // Size of Global Color Table: 2^(1+n).
304 paddedSize := log2(len(pm.Palette)) // Size of Local Color Table: 2^(1+n).
|
| /prebuilts/go/linux-x86/src/image/gif/ |
| writer.go | 27 func log2(x int) int { func
159 paddedSize := log2(len(p)) // Size of Global Color Table: 2^(1+n).
304 paddedSize := log2(len(pm.Palette)) // Size of Local Color Table: 2^(1+n).
|
| /external/guava/guava-gwt/test-super/com/google/common/math/super/com/google/common/math/ |
| IntMathTest.java | 61 IntMath.log2(0, mode);
71 IntMath.log2(x, mode);
78 // Relies on the correctness of BigIntegrerMath.log2 for all modes except UNNECESSARY.
82 assertEquals(BigIntegerMath.log2(valueOf(x), mode), IntMath.log2(x, mode));
93 assertEquals(x, 1 << IntMath.log2(x, UNNECESSARY));
|
| BigIntegerMathTest.java | 60 BigIntegerMath.log2(ZERO, mode);
69 BigIntegerMath.log2(BigInteger.valueOf(-1), mode);
78 int result = BigIntegerMath.log2(x, mode);
88 int result = BigIntegerMath.log2(x, mode);
101 assertEquals(x, ZERO.setBit(BigIntegerMath.log2(x, UNNECESSARY)));
111 int result = BigIntegerMath.log2(x, HALF_UP);
122 int result = BigIntegerMath.log2(x, HALF_DOWN);
131 // Relies on the correctness of log2(BigInteger, {HALF_UP,HALF_DOWN}).
134 int halfEven = BigIntegerMath.log2(x, HALF_EVEN);
137 boolean floorWasEven = (BigIntegerMath.log2(x, FLOOR) & 1) == 0
[all...] |
| /bionic/linker/ |
| linker_allocator.cpp | 75 static inline uint16_t log2(size_t number) { function
274 uint16_t log2_size = log2(size);
|
| /external/guava/guava/src/com/google/common/math/ |
| DoubleMath.java | 214 * {@link #log2(double, RoundingMode)} is faster.
216 public static double log2(double x) { method in class:DoubleMath
226 * <p>Regardless of the rounding mode, this is faster than {@code (int) log2(x)}.
233 public static int log2(double x, RoundingMode mode) { method in class:DoubleMath
237 return log2(x * IMPLICIT_BIT, mode) - SIGNIFICAND_BITS;
263 // so log2(x) is never exactly exponent + 0.5.
|
| BigIntegerMath.java | 69 public static int log2(BigInteger x, RoundingMode mode) { method in class:BigIntegerMath
96 * Since sqrt(2) is irrational, log2(x) - logFloor cannot be exactly 0.5
135 int approxLog10 = (int) (log2(x, FLOOR) * LN_2 / LN_10);
263 int log2 = log2(x, FLOOR); local
264 if (log2 < Double.MAX_EXPONENT) {
267 int shift = (log2 - DoubleUtils.SIGNIFICAND_BITS) & ~1; // even!
325 int approxSize = IntMath.divide(n * IntMath.log2(n, CEILING), Long.SIZE, CEILING);
335 // Use floor(log2(num)) + 1 to prevent overflow of multiplication.
336 int productBits = LongMath.log2(product, FLOOR) + 1
[all...] |
| IntMath.java | 87 public static int log2(int x, RoundingMode mode) { method in class:IntMath
104 // Since sqrt(2) is irrational, log2(x) - logFloor cannot be exactly 0.5
156 * The key idea is that based on the number of leading zeros (equivalently, floor(log2(x))),
157 * we can narrow the possible floor(log10(x)) values to two. For example, if floor(log2(x))
|
| LongMath.java | 85 public static int log2(long x, RoundingMode mode) { method in class:LongMath
102 // Since sqrt(2) is irrational, log2(x) - logFloor cannot be exactly 0.5
156 * The key idea is that based on the number of leading zeros (equivalently, floor(log2(x))),
157 * we can narrow the possible floor(log10(x)) values to two. For example, if floor(log2(x))
674 int nBits = LongMath.log2(n, RoundingMode.CEILING);
681 // This is an upper bound on log2(numerator, ceiling).
|
| /external/guava/guava-gwt/src-super/com/google/common/math/super/com/google/common/math/ |
| BigIntegerMath.java | 67 public static int log2(BigInteger x, RoundingMode mode) { method in class:BigIntegerMath
94 * Since sqrt(2) is irrational, log2(x) - logFloor cannot be exactly 0.5
142 int approxSize = IntMath.divide(n * IntMath.log2(n, CEILING), Long.SIZE, CEILING);
152 // Use floor(log2(num)) + 1 to prevent overflow of multiplication.
153 int productBits = LongMath.log2(product, FLOOR) + 1;
154 int bits = LongMath.log2(startingNumber, FLOOR) + 1;
160 // Check to see if the floor(log2(num)) + 1 has changed.
169 // Adjust floor(log2(num)) + 1.
178 productBits = LongMath.log2(product, FLOOR) + 1;
233 int bits = LongMath.log2(n, RoundingMode.CEILING)
[all...] |
| IntMath.java | 84 public static int log2(int x, RoundingMode mode) { method in class:IntMath
101 // Since sqrt(2) is irrational, log2(x) - logFloor cannot be exactly 0.5
120 * The key idea is that based on the number of leading zeros (equivalently, floor(log2(x))),
121 * we can narrow the possible floor(log10(x)) values to two. For example, if floor(log2(x))
|
| LongMath.java | 80 public static int log2(long x, RoundingMode mode) { method in class:LongMath
97 // Since sqrt(2) is irrational, log2(x) - logFloor cannot be exactly 0.5
229 int nBits = LongMath.log2(n, RoundingMode.CEILING);
236 // This is an upper bound on log2(numerator, ceiling).
|
| /tools/tradefederation/core/tests/src/com/android/tradefed/result/ |
| FileMetadataCollectorTest.java | 86 LogFile log2 = LogFile.newBuilder().setLogType(LOG_TYPE_BR).setName(NAME_BR2).build(); local
88 .addLogFiles(log1).addLogFiles(log2).build();
107 LogFile log2 = LogFile.newBuilder().setLogType(LOG_TYPE_BR).setName(NAME_BR2).build(); local
111 .addLogFiles(log1).addLogFiles(log2).addLogFiles(log3).addLogFiles(log4).build();
|
| /external/guava/guava-tests/test/com/google/common/math/ |
| IntMathTest.java | 124 IntMath.log2(0, mode);
134 IntMath.log2(x, mode);
141 // Relies on the correctness of BigIntegrerMath.log2 for all modes except UNNECESSARY.
145 assertEquals(BigIntegerMath.log2(valueOf(x), mode), IntMath.log2(x, mode));
156 assertEquals(x, 1 << IntMath.log2(x, UNNECESSARY));
|
| BigIntegerMathTest.java | 72 BigIntegerMath.log2(ZERO, mode);
81 BigIntegerMath.log2(BigInteger.valueOf(-1), mode);
90 int result = BigIntegerMath.log2(x, mode);
100 int result = BigIntegerMath.log2(x, mode);
113 assertEquals(x, ZERO.setBit(BigIntegerMath.log2(x, UNNECESSARY)));
123 int result = BigIntegerMath.log2(x, HALF_UP);
134 int result = BigIntegerMath.log2(x, HALF_DOWN);
143 // Relies on the correctness of log2(BigInteger, {HALF_UP,HALF_DOWN}).
146 int halfEven = BigIntegerMath.log2(x, HALF_EVEN);
149 boolean floorWasEven = (BigIntegerMath.log2(x, FLOOR) & 1) == 0
[all...] |
| LongMathTest.java | 177 LongMath.log2(0L, mode);
187 LongMath.log2(x, mode);
194 /* Relies on the correctness of BigIntegerMath.log2 for all modes except UNNECESSARY. */
199 assertEquals(BigIntegerMath.log2(valueOf(x), mode), LongMath.log2(x, mode));
210 assertEquals(x, 1L << LongMath.log2(x, UNNECESSARY));
|
| /external/swiftshader/src/Common/ |
| Math.hpp | 157 inline unsigned long log2(int x) function in namespace:sw
175 inline float log2(float x) function in namespace:sw
|
| /external/testng/kobalt/wrapper/ |
| kobalt-wrapper.jar | |
| /prebuilts/go/darwin-x86/src/cmd/compile/internal/ssa/ |
| rewrite.go | 283 // log2(0) == 1, so nlz(0) == 64
284 return 63 - log2(x)
306 // log2 returns logarithm in base 2 of uint64(n), with log2(0) = -1.
308 func log2(n int64) (l int64) { func
|
| /prebuilts/go/linux-x86/src/cmd/compile/internal/ssa/ |
| rewrite.go | 283 // log2(0) == 1, so nlz(0) == 64
284 return 63 - log2(x)
306 // log2 returns logarithm in base 2 of uint64(n), with log2(0) = -1.
308 func log2(n int64) (l int64) { func
|
