Searched refs:bits (Results 51 - 75 of 751) sorted by relevance

1234567891011>>

/external/guava/guava/src/com/google/common/hash/
H A DBloomFilterStrategies.java12 * 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...]
/external/openssl/crypto/dsa/
H A Ddsa_locl.h57 int dsa_builtin_paramgen(DSA *ret, size_t bits, size_t qbits,
/external/qemu/
H A Daes.h13 int AES_set_encrypt_key(const unsigned char *userKey, const int bits,
15 int AES_set_decrypt_key(const unsigned char *userKey, const int bits,
/external/qemu/distrib/sdl-1.2.15/src/video/qtopia/
H A DSDL_sysmouse.cc32 char *bits; member in struct:WMcursor
38 dummy.bits = 0;
/external/elfutils/backends/
H A Dx86_64_corenote.c43 { .offset = at * 8, .regno = dwreg, .count = n, .bits = 64 }
45 { .offset = at * 8, .regno = dwreg, .count = n, .bits = 16, .pad = 6 }
99 { .offset = 0, .regno = 65, .count = 2, .bits = 16 }, /* fcw-fsw */
100 { .offset = 24, .regno = 64, .count = 1, .bits = 32 }, /* mxcsr */
101 { .offset = 32, .regno = 33, .count = 8, .bits = 80, .pad = 6 }, /* stN */
102 { .offset = 32 + 128, .regno = 17, .count = 16, .bits = 128 }, /* xmm */
H A Dppc_corenote.c48 { .offset = at * BITS/8, .regno = dwreg, .count = n, .bits = BITS }
69 { .offset = 0, .regno = 32, .count = 32, .bits = 64 }, /* f0-f31 */
70 { .offset = 32 * 8 + 4, .regno = 65, .count = 1, .bits = 32 } /* fpscr */
77 { .offset = 0, .regno = 1124, .count = 32, .bits = 128 },
79 { .offset = 32 * 16, .regno = 67, .count = 1, .bits = 32, .pad = 12 },
81 { .offset = 33 * 16, .regno = 356, .count = 1, .bits = 32, .pad = 12 }
87 { .offset = 0, .regno = ???, .count = 32, .bits = 32 },
89 { .offset = 32 * 4, .regno = ???, .count = 1, .bits = 64 }, */
91 { .offset = 34 * 4, .regno = 612, .count = 1, .bits = 32 }
H A Dx86_64_regs.c41 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
H A Dia64_regs.c40 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 Di386_corenote.c43 { .offset = at * 4, .regno = dwreg, .count = n, .bits = 32 }
45 { .offset = at * 4, .regno = dwreg, .count = n, .bits = 16, .pad = 2 }
90 { .offset = 0, .regno = 37, .count = 2, .bits = 32 }, /* fctrl-fstat */
91 { .offset = 7 * 4, .regno = 11, .count = 8, .bits = 80 }, /* stN */
97 { .offset = 0, .regno = 37, .count = 2, .bits = 16 }, /* fctrl-fstat */
98 { .offset = 24, .regno = 39, .count = 1, .bits = 32 }, /* mxcsr */
99 { .offset = 32, .regno = 11, .count = 8, .bits = 80, .pad = 6 }, /* stN */
100 { .offset = 32 + 128, .regno = 21, .count = 8, .bits = 128 }, /* xmm */
/external/openssl/crypto/bn/
H A Dbn_rand.c118 static int bnrand(int pseudorand, BIGNUM *rnd, int bits, int top, int bottom) argument
124 if (bits == 0)
130 bytes=(bits+7)/8;
131 bit=(bits-1)%8;
141 /* make a random number and set the top and bottom bits */
211 int BN_rand(BIGNUM *rnd, int bits, int top, int bottom) argument
213 return bnrand(0, rnd, bits, top, bottom);
216 int BN_pseudo_rand(BIGNUM *rnd, int bits, int top, int bottom) argument
218 return bnrand(1, rnd, bits, top, bottom);
222 int BN_bntest_rand(BIGNUM *rnd, int bits, in argument
[all...]
H A Dbn_mpi.c65 int bits; local
70 bits=BN_num_bits(a);
71 num=(bits+7)/8;
72 if (bits > 0)
74 ext=((bits & 0x07) == 0);
/external/flac/libFLAC/
H A Dbitwriter.c57 /* WATCHOUT: there are a few places where the code will not work unless bwword is >= 32 bits wide */
84 #define FLAC__TOTAL_BITS(bw) (FLAC__WORDS_TO_BITS((bw)->words) + (bw)->bits)
104 bwword accum; /* accumulator; bits are right-justified; when full, accum is appended to buffer */
107 unsigned bits; /* # of used bits in accum */ member in struct:FLAC__BitWriter
128 /* calculate total words needed to store 'bits_to_add' additional bits */
129 new_capacity = bw->words + ((bw->bits + bits_to_add + FLAC__BITS_PER_WORD - 1) / FLAC__BITS_PER_WORD);
143 FLAC__ASSERT(new_capacity >= bw->words + ((bw->bits + bits_to_add + FLAC__BITS_PER_WORD - 1) / FLAC__BITS_PER_WORD));
185 bw->words = bw->bits = 0;
202 bw->words = bw->bits
302 FLAC__bitwriter_write_zeroes(FLAC__BitWriter *bw, unsigned bits) argument
340 FLAC__bitwriter_write_raw_uint32(FLAC__BitWriter *bw, FLAC__uint32 val, unsigned bits) argument
379 FLAC__bitwriter_write_raw_int32(FLAC__BitWriter *bw, FLAC__int32 val, unsigned bits) argument
388 FLAC__bitwriter_write_raw_uint64(FLAC__BitWriter *bw, FLAC__uint64 val, unsigned bits) argument
[all...]
/external/openssl/crypto/asn1/
H A Da_bitstr.c68 int ret,j,bits,len; local
79 bits=(int)a->flags&0x07;
88 if (j & 0x01) bits=0;
89 else if (j & 0x02) bits=1;
90 else if (j & 0x04) bits=2;
91 else if (j & 0x08) bits=3;
92 else if (j & 0x10) bits=4;
93 else if (j & 0x20) bits=5;
94 else if (j & 0x40) bits=6;
95 else if (j & 0x80) bits
[all...]
/external/v8/test/mjsunit/regress/
H A Dregress-1199401.js31 var ranges = [{min: -1073741824, max: 1073741823, bits: 31},
32 {min: -2147483648, max: 2147483647, bits: 32}];
38 var bits = range.bits;
39 var name = bits + "-bit";
68 var half_min_smi = -(1 << (bits >> 1));
69 var half_max_smi = 1 << ((bits - 1) >> 1);
/external/quake/quake/src/QW/server/
H A Dsv_ents.c46 // if this is a leaf, accumulate the pvs bits
112 byte bits[6]; // [48 bits] xyzpy 12 12 12 4 8 local
132 bits[0] = x;
133 bits[1] = (x>>8) | (y<<4);
134 bits[2] = (y>>4);
135 bits[3] = z;
136 bits[4] = (z>>8) | (p<<4);
137 bits[5] = yaw;
140 MSG_WriteByte (msg, bits[
157 int bits; local
[all...]
/external/webkit/Source/JavaScriptCore/wtf/
H A DStdLibExtras.h105 // Returns a count of the number of bits set in 'bits'.
106 inline size_t bitCount(unsigned bits) argument
108 bits = bits - ((bits >> 1) & 0x55555555);
109 bits = (bits & 0x33333333) + ((bits >> 2) & 0x33333333);
110 return (((bits
[all...]
H A DRandomNumber.cpp57 uint32_t bits = cryptographicallyRandomNumber(); local
58 return static_cast<double>(bits) / (static_cast<double>(std::numeric_limits<uint32_t>::max()) + 1.0);
75 uint32_t bits;
82 ISOURCE_Read(randomSource.get(), reinterpret_cast<char*>(&bits), 4);
84 return static_cast<double>(bits) / (static_cast<double>(std::numeric_limits<uint32_t>::max()) + 1.0);
88 // rand only provides 31 bits, and the low order bits of that aren't very random
89 // so we take the high 26 bits of part 1, and the high 27 bits of part2.
90 part1 >>= 5; // drop the low 5 bits
[all...]
H A DBitmap.h59 FixedArray<WordType, words> bits; member in class:WTF::Bitmap
71 return !!(bits[n / wordSize] & (one << (n % wordSize)));
77 bits[n / wordSize] |= (one << (n % wordSize));
85 bool result = bits[index] & mask;
86 bits[index] |= mask;
93 bits[n / wordSize] &= ~(one << (n % wordSize));
99 memset(bits.data(), 0, sizeof(bits));
105 if (!~bits[start / wordSize])
139 result += WTF::bitCount(bits[
[all...]
/external/speex/libspeex/
H A Dspeex.c73 int speex_encode_native(void *state, spx_word16_t *in, SpeexBits *bits) argument
75 return (*((SpeexMode**)state))->enc(state, in, bits);
78 int speex_decode_native(void *state, SpeexBits *bits, spx_word16_t *out) argument
80 return (*((SpeexMode**)state))->dec(state, bits, out);
88 EXPORT int speex_encode(void *state, float *in, SpeexBits *bits) argument
103 return (*((SpeexMode**)state))->enc(state, short_in, bits);
107 EXPORT int speex_encode_int(void *state, spx_int16_t *in, SpeexBits *bits) argument
111 return (mode)->enc(state, in, bits);
115 EXPORT int speex_decode(void *state, SpeexBits *bits, float *out) argument
121 ret = (*((SpeexMode**)state))->dec(state, bits, short_ou
128 speex_decode_int(void *state, SpeexBits *bits, spx_int16_t *out) argument
136 speex_encode(void *state, float *in, SpeexBits *bits) argument
141 speex_encode_int(void *state, spx_int16_t *in, SpeexBits *bits) argument
152 speex_decode(void *state, SpeexBits *bits, float *out) argument
157 speex_decode_int(void *state, SpeexBits *bits, spx_int16_t *out) argument
[all...]
/external/elfutils/libdwfl/
H A Ddwfl_module_report_build_id.c55 const unsigned char *bits, size_t len,
68 && !memcmp (bits, mod->build_id_bits, len))
90 memcpy (copy, bits, len);
54 dwfl_module_report_build_id(Dwfl_Module *mod, const unsigned char *bits, size_t len, GElf_Addr vaddr) argument
/external/libogg/include/ogg/
H A Dogg.h120 extern void oggpack_writetrunc(oggpack_buffer *b,long bits);
122 extern void oggpack_writecopy(oggpack_buffer *b,void *source,long bits);
126 extern void oggpack_write(oggpack_buffer *b,unsigned long value,int bits);
127 extern long oggpack_look(oggpack_buffer *b,int bits);
129 extern void oggpack_adv(oggpack_buffer *b,int bits);
131 extern long oggpack_read(oggpack_buffer *b,int bits);
139 extern void oggpackB_writetrunc(oggpack_buffer *b,long bits);
141 extern void oggpackB_writecopy(oggpack_buffer *b,void *source,long bits);
145 extern void oggpackB_write(oggpack_buffer *b,unsigned long value,int bits);
146 extern long oggpackB_look(oggpack_buffer *b,int bits);
[all...]
/external/qemu/distrib/zlib-1.2.3/
H A Dinfback.c83 unsigned sym, bits; local
94 bits = 9;
95 inflate_table(LENS, state->lens, 288, &(next), &(bits), state->work);
101 bits = 5;
102 inflate_table(DISTS, state->lens, 32, &(next), &(bits), state->work);
126 bits = state->bits; \
137 state->bits = bits; \
144 bits
253 unsigned bits; /* bits in bit buffer */ local
[all...]
/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/valgrind/main/coregrind/m_initimg/
H A Dsimple_huffman.c15 * size of 32 bits). If I'm not mistaking, this should not be possible
22 * 12 bits per symbol (for 8 bit symbols), meaning a maximum of 384
102 * _Huffman_ReadBits() - Read bits from a bitstream.
106 UInt bits )
115 /* Extract bits */
117 for( count = 0; count < bits; ++ count )
136 * _Huffman_WriteBits() - Write bits to a bitstream.
140 UInt bits )
150 /* Append bits */
151 mask = 1 << (bits
224 _Huffman_MakeTree( huff_sym_t *sym, huff_bitstream_t *stream, UInt code, UInt bits, UInt first, UInt last ) argument
309 _Huffman_RecoverTree( huff_sym_t *sym, huff_bitstream_t *stream, UInt code, UInt bits, UInt *symnum ) argument
455 UInt bits, delta_bits, new_bits, code; local
[all...]
/external/valgrind/main/exp-bbv/tests/ppc32-linux/
H A Dmillion.S8 lis 15,499997@ha # load high 16-bits of counter
9 addi 15,15,499997@l # load low 16-bits of counter

Completed in 486 milliseconds

1234567891011>>