HomeSort by relevance Sort by last modified time
    Searched defs:bits (Results 26 - 50 of 935) sorted by null

12 3 4 5 6 7 8 91011>>

  /dalvik/dexgen/src/com/android/dexgen/rop/cst/
CstFloat.java 40 * @param bits the {@code float} value as {@code int} bits
42 public static CstFloat make(int bits) {
47 return new CstFloat(bits);
53 * @param bits the {@code float} value as {@code int} bits
55 private CstFloat(int bits) {
56 super(bits);
62 int bits = getIntBits(); local
63 return "float{0x" + Hex.u4(bits) + " / "
    [all...]
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) {
33 this.bits = bits;
41 bits == ((CstLiteral32) other).bits;
47 return bits;
    [all...]
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) {
33 this.bits = bits;
41 bits == ((CstLiteral64) other).bits;
47 return (int) bits ^ (int) (bits >> 32)
    [all...]
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 = getIntBits() local
79 int bits = getIntBits(); local
    [all...]
  /dalvik/dx/src/com/android/dx/rop/cst/
CstDouble.java 39 * @param bits the {@code double} value as {@code long} bits
41 public static CstDouble make(long bits) {
46 return new CstDouble(bits);
52 * @param bits the {@code double} value as {@code long} bits
54 private CstDouble(long bits) {
55 super(bits);
61 long bits = getLongBits(); local
62 return "double{0x" + Hex.u8(bits) + " / "
    [all...]
CstFloat.java 40 * @param bits the {@code float} value as {@code int} bits
42 public static CstFloat make(int bits) {
47 return new CstFloat(bits);
53 * @param bits the {@code float} value as {@code int} bits
55 private CstFloat(int bits) {
56 super(bits);
62 int bits = getIntBits(); local
63 return "float{0x" + Hex.u4(bits) + " / "
    [all...]
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) {
33 this.bits = bits;
41 bits == ((CstLiteral32) other).bits;
47 return bits;
    [all...]
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) {
33 this.bits = bits;
41 bits == ((CstLiteral64) other).bits;
47 return (int) bits ^ (int) (bits >> 32)
    [all...]
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 = getIntBits() local
79 int bits = getIntBits(); local
    [all...]
  /development/ndk/platforms/android-14/include/android/
native_window.h 52 // The actual bits.
53 void* bits; member in struct:ANativeWindow_Buffer
  /development/ndk/platforms/android-9/include/android/
native_window.h 52 // The actual bits.
53 void* bits; member in struct:ANativeWindow_Buffer
  /external/aac/libMpegTPEnc/src/
tpenc_adts.cpp 101 int mBits /*!< number of bits in crc region */
124 int bits = 0; local
127 /* Static and variable header bits */
128 bits = 56;
130 /* Add header/ single raw data block CRC bits */
131 bits += 16;
133 /* Add bits of raw data block position markers */
134 bits += (hAdts->num_raw_blocks)*16;
139 /* Add raw data block CRC bits. Not really part of the header, put they cause bit overhead to be accounted. */
140 bits += 16
    [all...]
  /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/crypto/params/
RC2Parameters.java 9 private int bits; field in class:RC2Parameters
19 int bits)
22 this.bits = bits;
34 return bits;
  /external/dexmaker/src/dx/java/com/android/dx/rop/cst/
CstDouble.java 39 * @param bits the {@code double} value as {@code long} bits
41 public static CstDouble make(long bits) {
46 return new CstDouble(bits);
52 * @param bits the {@code double} value as {@code long} bits
54 private CstDouble(long bits) {
55 super(bits);
61 long bits = getLongBits(); local
62 return "double{0x" + Hex.u8(bits) + " / "
    [all...]
CstFloat.java 40 * @param bits the {@code float} value as {@code int} bits
42 public static CstFloat make(int bits) {
47 return new CstFloat(bits);
53 * @param bits the {@code float} value as {@code int} bits
55 private CstFloat(int bits) {
56 super(bits);
62 int bits = getIntBits(); local
63 return "float{0x" + Hex.u4(bits) + " / "
    [all...]
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) {
33 this.bits = bits;
41 bits == ((CstLiteral32) other).bits;
47 return bits;
    [all...]
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) {
33 this.bits = bits;
41 bits == ((CstLiteral64) other).bits;
47 return (int) bits ^ (int) (bits >> 32)
    [all...]
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 = getIntBits() local
79 int bits = getIntBits(); local
    [all...]
  /external/elfutils/src/libebl/
libebl.h 150 /* Check whether only valid bits are set on the st_other symbol flag. */
235 int *bits, int *type);
359 uint8_t bits; /* Bits of data for one register. */ member in struct:__anon8951
413 the architecture adds some extra non-address bits to it. This is
  /external/guava/guava/src/com/google/common/hash/
HashFunction.java 37 * length (given by {@link #bits}). For example, {@link Hashing#sha1} produces a
38 * 160-bit number, while {@link Hashing#murmur3_32()} yields only 32 bits. Because a
72 * hash code's bits as possible. The result is that, for example, when choosing a
73 * bucket in a hash table of size 2^8, <i>any</i> eight bits could be consistently
114 * <p>Java's baked-in concept of hash codes is constrained to 32 bits, and provides no
224 * Returns the number of bits (a multiple of 32) that each hash code produced by this
227 int bits(); method in interface:HashFunction
  /external/icu/icu4c/source/common/
patternprops.cpp 100 * Same as syntax2000, but with additional bits set for the
125 uint32_t bits=syntax2000[index2000[(c-0x2000)>>5]]; local
126 return (UBool)((bits>>(c&0x1f))&1);
143 uint32_t bits=syntaxOrWhiteSpace2000[index2000[(c-0x2000)>>5]]; local
144 return (UBool)((bits>>(c&0x1f))&1);
  /external/icu/icu4c/source/layout/
DeviceTables.cpp 29 le_uint16 bits = fieldBits[format]; local
30 le_uint16 count = 16 / bits;
33 le_uint16 shift = 16 - (bits * (fieldIndex + 1));
  /external/iptables/extensions/
libip6t_NETMAP.c 58 int bits; local
64 bits = xtables_ip6mask_to_cidr(&a);
65 if (bits < 0)
68 printf("/%d", bits);
  /external/pdfium/core/src/fxcodec/fx_zlib/zlib_v128/
inftrees.h 14 table that indexes more bits of the code. op indicates whether
17 pointer, the low four bits of op is the number of index bits of
18 that table. For a length or distance, the low four bits of op
19 is the number of extra bits to get after the code. bits is
20 the number of bits in this code or part of the code to drop off
25 unsigned char op; /* operation, extra bits, table bits */
26 unsigned char bits; /* bits in this part of the code * member in struct:__anon17467
    [all...]
  /external/slf4j/slf4j-api/src/test/java/org/slf4j/helpers/
MyRandom.java 34 int bits = 32; field in class:MyRandom
48 unused = y >>> (48 - bits); // just exercise the >>> operator

Completed in 1570 milliseconds

12 3 4 5 6 7 8 91011>>