Searched defs:bits (Results 51 - 75 of 403) sorted by relevance

1234567891011>>

/external/guava/guava/src/com/google/common/hash/
H A DMurmur3_32HashFunction.java36 @Override public int bits() { method in class:Murmur3_32HashFunction
H A DMurmur3_128HashFunction.java38 @Override public int bits() { method in class:Murmur3_128HashFunction
/external/guava/guava-tests/test/com/google/common/hash/
H A DAbstractNonStreamingHashFunctionTest.java46 public int bits() { method in class:AbstractNonStreamingHashFunctionTest.StreamingVersion
78 public int bits() { method in class:AbstractNonStreamingHashFunctionTest.NonStreamingVersion
/external/icu4c/common/
H A Dpatternprops.cpp100 * 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/libvorbis/doc/
H A D02-bitpacking.tex10 bitstream in which bits are coded one-by-one by the encoder and then
12 decoder. Most current binary storage arrangements group bits into a
13 native word size of eight bits (octets), sixteen bits, thirty-two bits
22 'octet', that is, eight bits. This has not always been the case;
26 modern platforms, this is generally assumed to be eight bits (not
33 octet (eight bits) and a word to be a group of two, four or eight
34 bytes (16, 32 or 64 bits). Note however that the Vorbis bitpacking
68 \subsubsection{coding bits int
[all...]
/external/openssh/
H A Dbufbn.c56 * by (bits+7)/8 bytes of binary data, msb first.
61 int bits = BN_num_bits(value); local
62 int bin_size = (bits + 7) / 8;
76 /* Store the number of bits in the buffer in two bytes, msb first. */
77 put_u16(msg, bits);
101 u_int bits, bytes; local
104 /* Get the number of bits. */
109 bits = get_u16(buf);
111 bytes = (bits + 7) / 8;
/external/openssl/crypto/bn/
H A Dbn_depr.c68 BIGNUM *BN_generate_prime(BIGNUM *ret, int bits, int safe, argument
84 if(!BN_generate_prime_ex(rnd, bits, safe, add, rem, &cb))
/external/webkit/Source/JavaScriptCore/runtime/
H A DJSValue.cpp144 // bits of the resulting value in 2s-complement representation.
147 int64_t bits = WTF::bitwise_cast<int64_t>(number); local
148 int32_t exp = (static_cast<int32_t>(bits >> 52) & 0x7ff) - 0x3ff;
150 // If exponent < 0 there will be no bits to the left of the decimal point
151 // after rounding; if the exponent is > 83 then no bits of precision can be
152 // left in the low 32-bit range of the result (IEEE-754 doubles have 52 bits
158 // Select the appropriate 32-bits from the floating point mantissa. If the
159 // exponent is 52 then the bits we need to select are already aligned to the
160 // lowest bits of the 64-bit integer representation of tghe number, no need
165 ? static_cast<int32_t>(bits << (ex
[all...]
/external/aac/libFDK/src/
H A DFDK_crc.cpp308 * \brief Calculate crc bits.
316 * \param nBits Number of processing bits.
318 * \return Number of processed bits.
364 * \return Number of processed bits.
401 * \return Number of processed bits.
422 int bits, rBits; local
423 rBits = (rD->maxBits>=0) ? rD->maxBits : -rD->maxBits; /* ramaining bits */
425 bits = rD->bitBufCntBits;
428 bits = rBits;
431 int words = bits >>
[all...]
/external/antlr/antlr-3.4/runtime/C/include/
H A Dantlr3bitset.h43 /** How many bits in the elements
47 /** How many bits in a nible of bits
71 /// Pointer to the allocated array of bits for this bit set, which
79 pANTLR3_BITWORD bits; member in struct:ANTLR3_BITSET_LIST_struct
89 /// The actual bits themselves
/external/bouncycastle/bcprov/src/main/java/org/bouncycastle/crypto/engines/
H A DRC2Engine.java62 int bits)
89 // Phase 2 - reduce effective key size to "bits"
90 len = (bits + 7) >> 3;
91 x = piTable[xKey[128 - len] & (255 >> (7 & -bits))] & 0xff;
60 generateWorkingKey( byte[] key, int bits) argument
/external/chromium/third_party/libjingle/source/talk/xmllite/
H A Dqname.cc46 static const int bits = 9; member in namespace:buzz
48 static QName::Data qname_table[1 << bits];
55 int increment = index >> (bits - 1) | 1;
58 index &= ((1 << bits) - 1);
74 int increment = index >> (bits - 1) | 1;
77 index &= ((1 << bits) - 1);
/external/chromium/webkit/glue/
H A Dwebcursor_gtk.cc34 GdkPixmap* source = gdk_bitmap_create_from_data(NULL, custom.bits,
55 const char bits[] = { 0 }; local
57 GdkPixmap* bitmap = gdk_bitmap_create_from_data(NULL, bits, 1, 1);
/external/clang/test/CodeGenCXX/
H A D2007-01-06-PtrMethodInit.cpp57 PRUint8 bits; member in struct:EventDispatchData
/external/dexmaker/src/dx/java/com/android/dx/util/
H A DBits.java31 * 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...]
/external/dropbear/libtomcrypt/src/ciphers/
H A Drc2.c75 int i, bits; local
99 /* Phase 2 - reduce effective key size to "bits" */
100 bits = keylen<<3;
101 T8 = (unsigned)(bits+7)>>3;
102 TM = (255 >> (unsigned)(7 & -bits));
/external/dropbear/libtomcrypt/src/prngs/
H A Drng_get_bytes.c15 portable way to get secure random bits to feed a PRNG (Tom St Denis)
61 int l, acc, bits, a, b; local
68 bits = 8;
72 while (bits--) {
81 bits = 8;
83 acc = bits = a = b = 0;
/external/elfutils/libdwfl/
H A Ddwfl_module_build_id.c54 const void *bits, int len, GElf_Addr vaddr)
57 /* When checking bits, we do not compare VADDR because the
61 && !memcmp (bits, mod->build_id_bits, len));
70 mod->build_id_bits = memcpy (copy, bits, len);
146 const unsigned char **bits, GElf_Addr *vaddr)
150 const unsigned char **bits, GElf_Addr *vaddr)
171 *bits = mod->build_id_bits;
185 const unsigned char **bits, GElf_Addr *vaddr)
187 int result = INTUSE(dwfl_module_build_id) (mod, bits, vaddr);
53 found_build_id(Dwfl_Module *mod, bool set, const void *bits, int len, GElf_Addr vaddr) argument
149 dwfl_module_build_id(Dwfl_Module *mod, const unsigned char **bits, GElf_Addr *vaddr) argument
/external/icu4c/i18n/
H A DdecNumber.h41 /* Bit settings for decNumber.bits */
46 /* The remaining bits are reserved; they must be 0 */
85 uint8_t bits; /* Indicator bits (see above) */ member in struct:__anon5870
184 #define decNumberIsFinite(dn) (((dn)->bits&DECSPECIAL)==0)
185 #define decNumberIsInfinite(dn) (((dn)->bits&DECINF)!=0)
186 #define decNumberIsNaN(dn) (((dn)->bits&(DECNAN|DECSNAN))!=0)
187 #define decNumberIsNegative(dn) (((dn)->bits&DECNEG)!=0)
188 #define decNumberIsQNaN(dn) (((dn)->bits&(DECNAN))!=0)
189 #define decNumberIsSNaN(dn) (((dn)->bits
[all...]
/external/ipsec-tools/src/racoon/
H A Dplainrsa-gen.c72 fprintf(stderr, " -b bits Generate <bits> long RSA key (default=1024)\n");
119 gen_rsa_key(FILE *fp, size_t bits, unsigned long exp) argument
124 key = RSA_generate_key(bits, exp, NULL, NULL);
138 fprintf(fp, "\t# RSA %zu bits\n", bits);
159 size_t bits = 1024; local
176 bits = atoi(optarg);
203 gen_rsa_key(fp, bits, pubexp);
/external/iptables/extensions/
H A Dlibipt_NETMAP.c36 int bits; local
39 for (bits = 0, bm = 0x80000000; netmask & bm; netmask <<= 1)
40 bits++;
43 return bits;
71 int bits; local
76 bits = netmask2bits(a.s_addr);
77 if (bits < 0)
80 printf("/%d", bits);
/external/libvpx/vp8/decoder/
H A Ddboolhuff.h107 static int vp8_decode_value(BOOL_DECODER *br, int bits) argument
112 for (bit = bits - 1; bit >= 0; bit--)
124 * Variable 'count' stores the number of bits in the 'value' buffer,
125 * minus 8. So if count == 8, there are 16 bits available to be read.
129 * bits from the bitstream. So the last bit in the bitstream will be
135 /* We have tried to decode bits after the end of
/external/libvpx/vp8/encoder/
H A Dboolhuff.c141 void vp8_encode_value(BOOL_CODER *br, int data, int bits) argument
145 for (bit = bits - 1; bit >= 0; bit--)
/external/llvm/utils/TableGen/
H A DTGValueTypes.cpp34 explicit ExtendedIntegerType(unsigned bits) argument
35 : BitWidth(bits) {}
/external/openssl/apps/
H A Ddh.c282 int len,l,bits; local
285 bits=BN_num_bits(dh->p);
293 printf("static unsigned char dh%d_p[]={",bits);
302 printf("static unsigned char dh%d_g[]={",bits);
310 printf("DH *get_dh%d()\n\t{\n",bits);
314 bits,bits);
316 bits,bits);

Completed in 528 milliseconds

1234567891011>>