/dalvik/dx/src/com/android/dx/rop/cst/ |
H A D | CstLiteral64.java | 24 /** the value as {@code long} bits */ 25 private final long bits; field in class:CstLiteral64 30 * @param bits the value as {@code long} bits 32 /*package*/ CstLiteral64(long bits) { argument 33 this.bits = bits; 41 bits == ((CstLiteral64) other).bits; 47 return (int) bits [all...] |
H A D | CstLiteral32.java | 24 /** the value as {@code int} bits */ 25 private final int bits; field in class:CstLiteral32 30 * @param bits the value as {@code int} bits 32 /*package*/ CstLiteral32(int bits) { argument 33 this.bits = bits; 41 bits == ((CstLiteral32) other).bits; 47 return bits; [all...] |
H A D | CstLiteralBits.java | 36 * Gets the value as {@code int} bits. If this instance contains 37 * more bits than fit in an {@code int}, then this returns only 38 * the low-order bits. 40 * @return the bits 45 * Gets the value as {@code long} bits. If this instance contains 46 * fewer bits than fit in a {@code long}, then the result of this 49 * @return the bits 54 * Returns true if this value can fit in 16 bits with sign-extension. 56 * @return true if the sign-extended lower 16 bits are the same as 64 int bits [all...] |
H A D | CstDouble.java | 39 * @param bits the {@code double} value as {@code long} bits 41 public static CstDouble make(long bits) { argument 46 return new CstDouble(bits); 52 * @param bits the {@code double} value as {@code long} bits 54 private CstDouble(long bits) { argument 55 super(bits); 61 long bits = getLongBits(); 62 return "double{0x" + Hex.u8(bits) [all...] |
H A D | CstFloat.java | 40 * @param bits the {@code float} value as {@code int} bits 42 public static CstFloat make(int bits) { argument 47 return new CstFloat(bits); 53 * @param bits the {@code float} value as {@code int} bits 55 private CstFloat(int bits) { argument 56 super(bits); 62 int bits = getIntBits(); 63 return "float{0x" + Hex.u4(bits) [all...] |
/dalvik/libcore/security/src/main/java/org/bouncycastle/crypto/params/ |
H A D | RC2Parameters.java | 9 private int bits; field in class:RC2Parameters 19 int bits) 22 this.bits = bits; 34 return bits; 17 RC2Parameters( byte[] key, int bits) argument
|
/dalvik/dx/src/com/android/dx/util/_tests/ |
H A D | _Bits.java | 60 int[] bits = Bits.makeBitSet(100); 63 assertFalse(label(i), Bits.get(bits, i)); 68 int[] bits = Bits.makeBitSet(100); 69 for (int i = 0; i < bits.length; i++) { 70 bits[i] = -1; 74 assertTrue(label(i), Bits.get(bits, i)); 79 int[] bits = Bits.makeBitSet(100); 82 Bits.set(bits, i, (i % 5) == 0); 87 assertTrue(label(i), Bits.get(bits, i) == expect); 92 int[] bits [all...] |
/dalvik/dx/src/com/android/dx/util/ |
H A D | Bits.java | 31 * Constructs a bit set to contain bits up to the given index (exclusive). 44 * @param bits {@code non-null;} bit set in question 47 public static int getMax(int[] bits) { argument 48 return bits.length * 0x20; 54 * @param bits {@code non-null;} bit set to operate on 58 public static boolean get(int[] bits, int idx) { argument 61 return (bits[arrayIdx] & bit) != 0; 67 * @param bits {@code non-null;} bit set to operate on 71 public static void set(int[] bits, int idx, boolean value) { argument 76 bits[arrayId 88 set(int[] bits, int idx) argument 100 clear(int[] bits, int idx) argument 113 isEmpty(int[] bits) argument 131 bitCount(int[] bits) argument 152 anyInRange(int[] bits, int start, int end) argument 166 findFirst(int[] bits, int idx) argument 215 toHuman(int[] bits) argument [all...] |
H A D | BitIntSet.java | 27 int[] bits; field in class:BitIntSet 35 bits = Bits.makeBitSet(max); 41 Bits.set(bits, value, true); 50 if (value >= Bits.getMax(bits)) { 52 Math.max(value + 1, 2 * Bits.getMax(bits))); 53 System.arraycopy(bits, 0, newBits, 0, bits.length); 54 bits = newBits; 60 if (value < Bits.getMax(bits)) { 61 Bits.set(bits, valu [all...] |
/dalvik/libcore/support/src/test/java/tests/support/ |
H A D | Support_BitSet.java | 21 private long[] bits; field in class:Support_BitSet 23 private static final int ELM_SIZE = 64; // Size in bits of the data type 25 // being used in the bits array 28 * Create a new BitSet with size equal to 64 bits 30 * @return The number of bits contained in this BitSet. 51 bits = new long[(nbits / ELM_SIZE) + (nbits % ELM_SIZE > 0 ? 1 : 0)]; 69 if (pos < bits.length * ELM_SIZE) { 70 bits[pos / ELM_SIZE] &= ~(1L << (pos % ELM_SIZE)); 94 if (pos < bits.length * ELM_SIZE) { 95 return (bits[po [all...] |
/dalvik/libcore/luni/src/main/native/ |
H A D | java_lang_Float.c | 14 unsigned int bits; member in union:__anon11 23 static int IsNaN(unsigned bits) argument 25 return ((bits >= 0x7f800001U && bits <= 0x7fffffffU) 26 || (bits >= 0xff800001U && bits <= 0xffffffffU)); 41 if (IsNaN(f.bits)) 42 f.bits = NaN; 44 return f.bits; 56 return f.bits; [all...] |
H A D | java_lang_Double.c | 15 uint64_t bits; member in union:__anon10 34 d.bits = NaN; 36 return d.bits; 48 return d.bits; 52 * public static native double longBitsToDouble(long bits) 58 d.bits = val;
|
/dalvik/libcore/luni/src/main/java/java/util/ |
H A D | BitSet.java | 57 private long[] bits; field in class:BitSet 66 * Create a new {@code BitSet} with size equal to 64 bits. 77 bits = new long[1]; 103 bits = new long[(nbits >> OFFSET) + ((nbits & RIGHT_BITS) > 0 ? 1 : 0)]; 111 * @param bits 114 private BitSet(long[] bits, boolean needClear, int actualArrayLength, argument 116 this.bits = bits; 131 clone.bits = bits [all...] |
H A D | HugeEnumSet.java | 30 private long[] bits; field in class:HugeEnumSet 45 bits = new long[(enums.length + BIT_IN_LONG - 1) / BIT_IN_LONG]; 52 * The bits yet to be returned for the long in bits[index]. As values from the current index 53 * are returned, their bits are zeroed out. When this reaches zero, the index must be 56 private long currentBits = bits[0]; 59 * The index into HugeEnumSet.bits of the next value to return. 85 } else if (++index < bits.length) { 86 currentBits = bits[index]; 131 long oldBits = bits[inde [all...] |
H A D | MiniEnumSet.java | 31 private long bits; field in class:MiniEnumSet 50 * The bits yet to be returned for bits. As values from the current index are returned, 51 * their bits are zeroed out. 53 private long currentBits = bits; 105 bits = 0; 115 long oldBits = bits; 118 bits = newBits; 137 long oldBits = bits; 138 long newBits = oldBits | miniSet.bits; [all...] |
H A D | Random.java | 84 * the number of bits specified by the argument {@code bits} as 88 * @param bits 89 * number of bits of the returned value. 99 protected synchronized int next(int bits) { argument 101 return (int) (seed >>> (48 - bits)); 218 int bits, val; 220 bits = next(31); 221 val = bits % n; 222 } while (bits [all...] |
/dalvik/dx/src/com/android/dx/dex/code/form/ |
H A D | Form21h.java | 88 // Where the high bits are depends on the category of the target. 90 int bits = cb.getIntBits(); 91 return ((bits & 0xffff) == 0); 93 long bits = cb.getLongBits(); 94 return ((bits & 0xffffffffffffL) == 0); 109 short bits; 111 // Where the high bits are depends on the category of the target. 113 bits = (short) (cb.getIntBits() >>> 16); 115 bits = (short) (cb.getLongBits() >>> 48); 118 write(out, opcodeUnit(insn, regs.get(0).getReg()), bits); [all...] |
/dalvik/vm/mterp/x86/ |
H A D | OP_CONST.S | 4 movl 2(rPC),%eax # grab all 32 bits at once
|
/dalvik/vm/mterp/x86-atom/ |
H A D | OP_SHL_LONG.S | 34 movq .LshiftMask, %xmm2 # %xmm2<- mask for the shift bits 36 pand %xmm2, %xmm0 # %xmm0<- masked shift bits
|
H A D | OP_SHL_LONG_2ADDR.S | 37 movq .LshiftMask, %xmm2 # %xmm2<- mask for the shift bits 38 pand %xmm2, %xmm0 # %xmm0<- masked shift bits
|
H A D | OP_USHR_LONG.S | 33 movsd .LshiftMask, %xmm2 # %xmm2<- mask for the shift bits 35 pand %xmm2, %xmm0 # %xmm0<- masked shift bits
|
H A D | OP_USHR_LONG_2ADDR.S | 35 movq .LshiftMask, %xmm2 # %xmm2<- mask for the shift bits 38 pand %xmm2, %xmm0 # %xmm0<- masked shift bits
|
H A D | OP_SHR_LONG.S | 37 pand %xmm2, %xmm0 # %xmm0<- masked for the shift bits 47 movq .L64bits, %xmm4 # %xmm4<- lower 64 bits set 48 psllq %xmm3, %xmm4 # %xmm4<- correct mask for sign bits
|
/dalvik/libcore/luni/src/main/java/org/apache/harmony/luni/util/ |
H A D | Base64.java | 68 int bits = 0; 82 bits = chr - 65; 87 bits = chr - 71; 92 bits = chr + 4; 94 bits = 62; 96 bits = 63; 101 quantum = (quantum << 6) | (byte) bits;
|
/dalvik/vm/alloc/ |
H A D | HeapBitmap.c | 41 void *bits; local 49 bitsLen = HB_OFFSET_TO_INDEX(maxSize) * sizeof(*hb->bits); 63 bits = mmap(NULL, bitsLen, PROT_READ | PROT_WRITE, MAP_PRIVATE, fd, 0); 65 if (bits == MAP_FAILED) { 72 hb->bits = bits; 128 if (hb->bits != NULL) { 131 munmap((char *)hb->bits, allocLen); 158 if (hb->bits != NULL) { 162 madvise(hb->bits, h 289 unsigned long bits = *p++; local [all...] |