Searched refs:bits (Results 26 - 50 of 751) sorted by relevance

1234567891011>>

/external/antlr/antlr-3.4/runtime/JavaScript/src/org/antlr/runtime/
H A DBitSet.js10 * @param {Number|Array} [bits] a 32 bit number or array of 32 bit numbers
14 org.antlr.runtime.BitSet = function(bits) {
15 if (!bits) {
16 bits = org.antlr.runtime.BitSet.BITS;
19 if (org.antlr.lang.isArray(bits)) {
24 this.bits = bits;
25 } else if(org.antlr.lang.isNumber(bits)) {
26 this.bits = [];
32 * Number of bits i
[all...]
/external/speex/libspeex/
H A Dquant_lsp.h56 /* Quantizes narrowband LSPs with 30 bits */
57 void lsp_quant_nb(spx_lsp_t *lsp, spx_lsp_t *qlsp, int order, SpeexBits *bits);
60 void lsp_unquant_nb(spx_lsp_t *lsp, int order, SpeexBits *bits);
62 /* Quantizes low bit-rate narrowband LSPs with 18 bits */
63 void lsp_quant_lbr(spx_lsp_t *lsp, spx_lsp_t *qlsp, int order, SpeexBits *bits);
66 void lsp_unquant_lbr(spx_lsp_t *lsp, int order, SpeexBits *bits);
68 /* Quantizes high-band LSPs with 12 bits */
69 void lsp_quant_high(spx_lsp_t *lsp, spx_lsp_t *qlsp, int order, SpeexBits *bits);
72 void lsp_unquant_high(spx_lsp_t *lsp, int order, SpeexBits *bits);
H A Dcb_search.h61 SpeexBits *bits,
71 SpeexBits *bits,
87 SpeexBits *bits,
98 SpeexBits *bits,
/external/elfutils/libebl/
H A Deblreginfo.c59 ebl_register_info (ebl, regno, name, namelen, prefix, setname, bits, type)
66 int *bits;
70 prefix, setname, bits, type);
/external/kernel-headers/original/linux/
H A Dcpumask.h22 * void cpus_setall(mask) set all bits
23 * void cpus_clear(mask) clear all bits
36 * int cpus_empty(mask) Is mask empty (no bits sets)?
37 * int cpus_full(mask) Is mask full (all bits sets)?
38 * int cpus_weight(mask) Hamming weigh - number of set bits
47 * CPU_MASK_ALL Initializer - all bits set
48 * CPU_MASK_NONE Initializer - no bits set
88 typedef struct { DECLARE_BITMAP(bits, NR_CPUS); } cpumask_t;
94 set_bit(cpu, dstp->bits);
100 clear_bit(cpu, dstp->bits);
[all...]
H A Dnodemask.h22 * void nodes_setall(mask) set all bits
23 * void nodes_clear(mask) clear all bits
36 * int nodes_empty(mask) Is mask empty (no bits sets)?
37 * int nodes_full(mask) Is mask full (all bits sets)?
38 * int nodes_weight(mask) Hamming weight - number of set bits
49 * NODE_MASK_ALL Initializer - all bits set
50 * NODE_MASK_NONE Initializer - no bits set
88 typedef struct { DECLARE_BITMAP(bits, MAX_NUMNODES); } nodemask_t;
94 set_bit(node, dstp->bits);
100 clear_bit(node, dstp->bits);
[all...]
/external/apache-http/src/org/apache/commons/codec/binary/
H A DBinaryCodec.java177 for (int bits = 0; bits < BITS.length; ++bits) {
178 if (ascii[jj - bits] == '1') {
179 l_raw[ii] |= BITS[bits];
204 for (int bits = 0; bits < BITS.length; ++bits) {
205 if (ascii[jj - bits] == '1') {
206 l_raw[ii] |= BITS[bits];
[all...]
/external/qemu/distrib/zlib-1.2.3/
H A Dinffast.c46 state->bits < 8
56 - The maximum input bits used by a length/distance pair is 15 bits for the
57 length code, 5 bits for the length extra, 15 bits for the distance code,
58 and 13 bits for the distance extra. This totals 48 bits, or six bytes.
85 unsigned bits; /* local strm->bits */ local
91 unsigned op; /* code bits, operatio
[all...]
H A Dinftrees.h14 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:__anon10744
[all...]
/external/zlib/src/
H A Dinffast.c46 state->bits < 8
56 - The maximum input bits used by a length/distance pair is 15 bits for the
57 length code, 5 bits for the length extra, 15 bits for the distance code,
58 and 13 bits for the distance extra. This totals 48 bits, or six bytes.
85 unsigned bits; /* local strm->bits */ local
91 unsigned op; /* code bits, operatio
[all...]
H A Dinftrees.h14 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/elfutils/backends/
H A Di386_regs.c40 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 Dalpha_corenote.c41 { .offset = 0, .regno = 0, .count = 31, .bits = 64 }, /* r0-r30 */
42 { .offset = 32 * 8, .regno = 64, .count = 1, .bits = 64 }, /* pc */
43 { .offset = 33 * 8, .regno = 66, .count = 1, .bits = 64 }, /* unique */
49 { .offset = 0, .regno = 32, .count = 32, .bits = 64 }, /* f0-f30, fpcr */
/external/linux-tools-perf/util/include/linux/
H A Dtypes.h10 #define DECLARE_BITMAP(name,bits) \
11 unsigned long name[BITS_TO_LONGS(bits)]
/external/zlib/src/contrib/infback9/
H A Dinftree9.h14 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...]
H A Dinfback9.c56 unsigned sym, bits, low, size; local
69 bits = 9;
70 inflate_table9(LENS, state.lens, 288, &(next), &(bits), state.work);
76 bits = 5;
77 inflate_table9(DISTS, state.lens, 32, &(next), &(bits), state.work);
94 printf("{%u,%u,%d}", lenfix[low].op, lenfix[low].bits,
105 printf("{%u,%u,%d}", distfix[low].op, distfix[low].bits,
120 bits = 0; \
143 hold += (unsigned long)(*next++) << bits; \
144 bits
235 unsigned bits; /* bits in bit buffer */ local
[all...]
/external/webrtc/src/common_audio/signal_processing/include/
H A Dspl_inl.h82 int bits; local
85 bits = 16;
87 bits = 0;
89 if (0x0000FF00 & (n >> bits)) bits += 8;
90 if (0x000000F0 & (n >> bits)) bits += 4;
91 if (0x0000000C & (n >> bits)) bits += 2;
92 if (0x00000002 & (n >> bits)) bit
[all...]
/external/llvm/lib/Support/
H A DDisassembler.cpp49 unsigned bits; local
51 bits = 32;
53 bits = 64;
60 ud_set_mode(&ud_obj, bits);
65 << std::setw(bits/4);
/external/antlr/antlr-3.4/runtime/Perl5/lib/ANTLR/Runtime/
H A DBitSet.pm14 # number of bits / long
30 has 'bits' => (
46 my $bits;
48 # Construct a bitset of size one word (64 bits)
49 $bits = '0' x BITS;
51 elsif (exists $args->{bits}) {
52 $bits = $args->{bits};
55 $bits = reverse unpack('B*', pack('N', $args->{number}));
66 $bits
[all...]
/external/qemu/distrib/sdl-1.2.15/src/video/bwindow/
H A DSDL_sysmouse.cc33 /* Convert bits to padded bytes */
34 #define PADDED_BITS(bits) ((bits+7)/8)
38 char *bits; member in struct:WMcursor
65 cursor->bits = (char *)SDL_malloc(4+2*((allowed_x/8)*allowed_y));
66 if ( cursor->bits == NULL ) {
71 cursor->bits[0] = allowed_y; /* Size of the cursor */
72 cursor->bits[1] = 1; /* Bit depth of cursor */
73 cursor->bits[2] = hot_y;
74 cursor->bits[
[all...]
/external/guava/guava/src/com/google/common/hash/
H A DHashing.java50 int bits = checkPositiveAndMakeMultipleOf32(minimumBits);
52 if (bits == 32) {
54 } else if (bits <= 128) {
58 int hashFunctionsNeeded = (bits + 127) / 128;
150 * If {@code hashCode} has enough bits, returns {@code hashCode.asLong()}, otherwise
155 return (hashCode.bits() < 64) ? UnsignedInts.toLong(hashCode.asInt()) : hashCode.asLong();
223 int bits = iterator.next().bits();
224 byte[] resultBytes = new byte[bits / 8];
249 byte[] resultBytes = new byte[iterator.next().bits() /
264 checkPositiveAndMakeMultipleOf32(int bits) argument
271 final int bits; field in class:Hashing.ConcatenatedHashFunction
293 public int bits() { method in class:Hashing.ConcatenatedHashFunction
[all...]
/external/speex/include/speex/
H A Dspeex_stereo.h71 /** Transforms a stereo frame into a mono frame and stores intensity stereo info in 'bits' */
72 void speex_encode_stereo(float *data, int frame_size, SpeexBits *bits);
74 /** Transforms a stereo frame into a mono frame and stores intensity stereo info in 'bits' */
75 void speex_encode_stereo_int(spx_int16_t *data, int frame_size, SpeexBits *bits);
84 int speex_std_stereo_request_handler(SpeexBits *bits, void *state, void *data);
/external/icu4c/test/perf/unisetperf/draft/
H A Dbitset.cpp86 BitSet(const UnicodeSet &set, UErrorCode &errorCode) : bits(shortBits), restSet(set.clone()) {
133 // Set bits for the start of the range.
150 bits=(int64_t *)uprv_malloc(bitHash->countKeys()*8);
152 if(bits!=NULL) {
153 bitHash->invert(bits);
155 bits=shortBits;
160 latin1Set[0]=(uint32_t)bits[0];
161 latin1Set[1]=(uint32_t)(bits[0]>>32);
162 latin1Set[2]=(uint32_t)bits[1];
163 latin1Set[3]=(uint32_t)(bits[
192 int64_t *bits; member in class:BitSet
[all...]
/external/libogg/src/
H A Dbitwise.c18 /* We're 'LSb' endian; if we write a word but read individual bits,
59 void oggpack_writetrunc(oggpack_buffer *b,long bits){ argument
60 long bytes=bits>>3;
62 bits-=bytes*8;
64 b->endbit=bits;
66 *b->ptr&=mask[bits];
70 void oggpackB_writetrunc(oggpack_buffer *b,long bits){ argument
71 long bytes=bits>>3;
73 bits-=bytes*8;
75 b->endbit=bits;
82 oggpack_write(oggpack_buffer *b,unsigned long value,int bits) argument
123 oggpackB_write(oggpack_buffer *b,unsigned long value,int bits) argument
164 int bits=8-b->endbit; local
170 int bits=8-b->endbit; local
175 oggpack_writecopy_helper(oggpack_buffer *b, void *source, long bits, void (*w)(oggpack_buffer *, unsigned long, int), int msb) argument
221 oggpack_writecopy(oggpack_buffer *b,void *source,long bits) argument
225 oggpackB_writecopy(oggpack_buffer *b,void *source,long bits) argument
260 oggpack_look(oggpack_buffer *b,int bits) argument
287 oggpackB_look(oggpack_buffer *b,int bits) argument
323 oggpack_adv(oggpack_buffer *b,int bits) argument
330 oggpackB_adv(oggpack_buffer *b,int bits) argument
347 oggpack_read(oggpack_buffer *b,int bits) argument
383 oggpackB_read(oggpack_buffer *b,int bits) argument
511 cliptest(unsigned long *b,int vals,int bits,int *comp,int compsize) argument
546 cliptestB(unsigned long *b,int vals,int bits,int *comp,int compsize) argument
[all...]
/external/dexmaker/src/dx/java/com/android/dx/dex/code/form/
H A DForm21h.java90 // Where the high bits are depends on the category of the target.
92 int bits = cb.getIntBits();
93 return ((bits & 0xffff) == 0);
95 long bits = cb.getLongBits();
96 return ((bits & 0xffffffffffffL) == 0);
104 BitSet bits = new BitSet(1);
106 bits.set(0, unsignedFitsInByte(regs.get(0).getReg()));
107 return bits;
115 short bits;
117 // Where the high bits ar
[all...]

Completed in 481 milliseconds

1234567891011>>