/external/dexmaker/src/dx/java/com/android/dx/rop/cst/ |
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 | 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...] |
/external/elfutils/backends/ |
H A D | i386_regs.c | 40 int *bits, int *type) 49 *bits = 32; 61 *bits = 80; 66 *bits = 128; 71 *bits = 64; 78 *bits = 16; 128 *bits = 16; 131 *bits = 16; 37 i386_register_info(Ebl *ebl __attribute__ ((unused)), int regno, char *name, size_t namelen, const char **prefix, const char **setname, int *bits, int *type) argument
|
H A D | ia64_regs.c | 40 int *bits, int *type) 50 *bits = 64; 86 *bits = 128; 107 *bits = 128; 211 *bits = 1; 224 *bits = 1; 238 *bits = 1; 248 *bits = 1; 259 *bits = 1; 37 ia64_register_info(Ebl *ebl __attribute__ ((unused)), int regno, char *name, size_t namelen, const char **prefix, const char **setname, int *bits, int *type) argument
|
H A D | sparc_regs.c | 40 int *bits, int *type) 51 *bits = ebl->machine == EM_SPARC ? 32 : 64; 90 *bits = 32; 37 sparc_register_info(Ebl *ebl, int regno, char *name, size_t namelen, const char **prefix, const char **setname, int *bits, int *type) argument
|
H A D | x86_64_regs.c | 41 int *bits, int *type) 50 *bits = 64; 60 *bits = 128; 66 *bits = 80; 73 *bits = 16; 154 *bits = 64; 169 *bits = 16; 38 x86_64_register_info(Ebl *ebl __attribute__ ((unused)), int regno, char *name, size_t namelen, const char **prefix, const char **setname, int *bits, int *type) argument
|
/external/elfutils/libebl/ |
H A D | libebl.h | 249 int *bits, int *type); 333 uint8_t bits; /* Bits of data for one register. */ member in struct:__anon5243
|
/external/guava/guava/src/com/google/common/hash/ |
H A D | BloomFilterStrategies.java | 12 * Collections of strategies of generating the {@code k * log(M)} bits required for an element to 13 * be mapped to a {@link BloomFilter} of {@code M} bits and {@code k} hash functions. These 27 int numHashFunctions, BitArray bits) { 38 bits.set(nextHash % bits.size()); 43 int numHashFunctions, BitArray bits) { 53 if (!bits.get(nextHash % bits.size())) { 64 BitArray(int bits) { argument 65 this(new long[IntMath.divide(bits, 6 [all...] |
H A D | 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 71 * hash code's bits as possible. The result is that, for example, when choosing a 72 * bucket in a hash table of size 2^8, <i>any</i> eight bits could be consistently 113 * <p>Java's baked-in concept of hash codes is constrained to 32 bits, and provides no 193 * Returns the number of bits (a multiple of 32) that each hash code produced by this 196 int bits(); method in interface:HashFunction
|
H A D | HashCode.java | 43 * @throws IllegalStateException if {@code bits() < 64} 73 * Returns the number of bits in this hash code; a positive multiple of 32. 75 public abstract int bits(); method in class:HashCode
|
H A D | HashCodes.java | 40 @Override public int bits() { method in class:HashCodes.IntHashCode 57 throw new IllegalStateException("this HashCode only has 32 bits; cannot create a long"); 76 @Override public int bits() { method in class:HashCodes.LongHashCode 117 @Override public int bits() { method in class:HashCodes.BytesHashCode
|
/external/icu4c/layout/ |
H A D | DeviceTables.cpp | 29 le_uint16 bits = fieldBits[format]; local 30 le_uint16 count = 16 / bits; 33 le_uint16 shift = 16 - (bits * (fieldIndex + 1));
|
/external/linux-tools-perf/util/include/linux/added/ |
H A D | hash.h | 30 #define hash_long(val, bits) hash_32(val, bits) 32 #define hash_long(val, bits) hash_64(val, bits) 38 static inline u64 hash_64(u64 val, unsigned int bits) argument 42 /* Sigh, gcc can't optimise this alone like it does for 32 bits. */ 57 /* High bits are more random, so use them. */ 58 return hash >> (64 - bits); 61 static inline u32 hash_32(u32 val, unsigned int bits) argument 66 /* High bits ar 70 hash_ptr(void *ptr, unsigned int bits) argument [all...] |
/external/openssl/apps/ |
H A D | prime.c | 66 int bits=0; local 85 else if(!strcmp(*argv,"-bits")) 89 bits=atoi(*++argv); 127 if(!bits) 129 BIO_printf(bio_err,"Specifiy the number of bits.\n"); 133 BN_generate_prime_ex(bn,bits,safe,NULL,NULL,NULL);
|
/external/openssl/crypto/bn/ |
H A D | bn_mpi.c | 65 int bits; local 70 bits=BN_num_bits(a); 71 num=(bits+7)/8; 72 if (bits > 0) 74 ext=((bits & 0x07) == 0);
|
/external/openssl/crypto/dsa/ |
H A D | dsa_depr.c | 86 DSA *DSA_generate_parameters(int bits, argument 99 if(DSA_generate_parameters_ex(ret, bits, seed_in, seed_len,
|
/external/openssl/crypto/rc2/ |
H A D | rc2_skey.c | 96 * the same as specifying 1024 for the 'bits' parameter. Bsafe uses 97 * a version where the bits parameter is the same as len*8 */ 98 void RC2_set_key(RC2_KEY *key, int len, const unsigned char *data, int bits) argument 102 private_RC2_set_key(key, len, data, bits); 104 void private_RC2_set_key(RC2_KEY *key, int len, const unsigned char *data, int bits) argument 116 if (bits <= 0) bits=1024; 117 if (bits > 1024) bits=1024; 131 /* hmm.... key reduction to 'bits' bit [all...] |
/external/qemu/distrib/sdl-1.2.15/src/video/qtopia/ |
H A D | SDL_sysmouse.cc | 32 char *bits; member in struct:WMcursor 38 dummy.bits = 0;
|
/external/skia/tests/ |
H A D | RegionTest.cpp | 13 int bits = 6; local 14 int shift = 32 - bits;
|
/external/v8/test/cctest/ |
H A D | test-double.cc | 32 // The 52 mantissa bits, plus the implicit 1 in bit 52 as a UINT64. 72 uint64_t bits = V8_2PART_UINT64_C(0x000FFFFF, FFFFFFFF); local 73 CHECK(Double(bits).IsDenormal()); 74 bits = V8_2PART_UINT64_C(0x00100000, 00000000); 75 CHECK(!Double(bits).IsDenormal()); 83 uint64_t bits = V8_2PART_UINT64_C(0xFFF12345, 00000000); local 84 CHECK(Double(bits).IsSpecial());
|
/external/webkit/Tools/DumpRenderTree/win/ |
H A D | PixelDumpSupportWin.cpp | 61 void* bits = 0; local 62 HBITMAP bitmap = CreateDIBSection(0, &bmp, DIB_RGB_COLORS, &bits, 0, 0);
|
/external/zlib/src/contrib/infback9/ |
H A D | inftree9.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; /* bit member in struct:__anon16097 [all...] |
/external/zlib/src/ |
H A D | 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; /* bit member in struct:__anon16113 [all...] |
/external/aac/libMpegTPEnc/src/ |
H A D | 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 [all...] |
/external/dexmaker/src/dx/java/com/android/dx/util/ |
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...] |