Searched defs:bit (Results 201 - 225 of 352) sorted by relevance

1234567891011>>

/external/tremolo/Tremolo/
H A Dmdct.c251 int bit = 0; local
255 DATA_TYPE b = bitrev12(bit++);
H A Dbitwise.c443 /* does EOF trip properly after a single additional bit? */
449 /* does EOF stay set over additional bit reads? */
477 /* does EOF trip properly after a single additional bit? */
488 /* does EOF stay set over additional bit reads? */
593 fprintf(stderr,"\nNull bit call (LSb): ");
601 fprintf(stderr,"\n32 bit preclipped packing (LSb): ");
637 fprintf(stderr,"\nSingle bit unclipped packing (LSb): ");
703 long bit=0; local
711 flat[word] |= ((values[j]>>k)&0x1)<<bit;
712 bit
[all...]
/external/valgrind/memcheck/tests/vbit-test/
H A Dvbits.c49 /* Return the bits of V if they fit into 64-bit. If V has fewer than
50 64 bits, the bit pattern is zero-extended to the left. */
131 /* The following routines named undefined_vbits_BxE() return a 128-bit
157 /* The following routines named undefined_vbits_BxE_rotate() return a 128-bit
214 /* Create a 128-bit mask with the bits in the even numbered
229 /* Concatenate bit i from each byte j. Place concatenated 8 bit value into
231 * 64-bit element.
237 unsigned int bit, byte, element; local
244 for (bit
[all...]
/external/ImageMagick/MagickCore/
H A Dcompress.c390 #define InputBit(bit) \
400 bit=(size_t) ((byte & mask) != 0 ? 0x01 : 0x00); \
402 if (bit != 0) \
432 bit,
488 InputBit(bit);
489 do { InputBit(bit); } while ((int) bit == 0);
522 InputBit(bit);
523 do { InputBit(bit); } while ((int) bit
427 bit, local
729 bit, local
[all...]
H A Dshear.c403 bit,
417 bit=0;
427 bit++;
428 if (bit == 8)
432 bit=0;
437 if (bit != 0)
439 byte<<=(8-bit);
460 bit,
474 bit=0;
484 bit
400 bit, local
457 bit, local
[all...]
/external/ImageMagick/coders/
H A Dbmp.c526 bit,
973 reports about 32 bit files with alpha. We do a quick check to see if
1066 for (bit=0; bit < 8; bit++)
1068 index=(Quantum) (((*p) & (0x80 >> bit)) != 0 ? 0x01 : 0x00);
1076 for (bit=0; bit < (image->columns % 8); bit++)
1078 index=(Quantum) (((*p) & (0x80 >> bit)) !
518 bit, local
1723 bit, local
[all...]
H A Dviff.c223 bit;
632 for (bit=0; bit < 8; bit++)
634 quantum=(size_t) ((*p) & (0x01 << bit) ? 0 : 1);
646 for (bit=0; bit < (int) (image->columns % 8); bit++)
648 quantum=(size_t) ((*p) & (0x01 << bit) ? 0 : 1);
1184 bit,
219 bit; local
1177 bit, local
[all...]
H A Dwpg.c275 bit;
295 for (bit=0; bit < 8; bit++)
297 index=((*p) & (0x80 >> bit) ? 0x01 : 0x00);
306 for (bit=0; bit < (ssize_t) (image->columns % 8); bit++)
308 index=((*p) & (0x80 >> bit) ? 0x01 : 0x00);
271 bit; local
H A Dgif.c93 bit;
244 lzw_info->code_info.bit=8*lzw_info->code_info.count;
276 while (((lzw_info->code_info.bit+bits) > (8*lzw_info->code_info.count)) &&
286 lzw_info->code_info.bit-=8*(lzw_info->code_info.count-2);
295 if ((lzw_info->code_info.bit+bits) > (8*lzw_info->code_info.count))
301 code|=((lzw_info->code_info.buffer[lzw_info->code_info.bit/8] &
302 (one << (lzw_info->code_info.bit % 8))) != 0) << i;
303 lzw_info->code_info.bit++;
953 #define BitSet(byte,bit) (((byte) & (bit))
90 bit; member in struct:_LZWCodeInfo
[all...]
H A Dps.c1528 bit,
1766 bit=0;
1774 bit++;
1775 if (bit == 8)
1785 bit=0;
1789 if (bit != 0)
1791 byte<<=(8-bit);
1954 bit=0;
1962 bit++;
1963 if (bit
1520 bit, local
[all...]
/external/antlr/antlr-3.4/runtime/C/src/
H A Dantlr3baserecognizer.c1229 ANTLR3_UINT32 bit; local
1253 // No token number 0, so look for bit 1 and on.
1255 for (bit = 1; bit < numbits && count < 8 && count < size; bit++)
1257 // TODO: This doesn;t look right - should be asking if the bit is set!!
1259 if (tokenNames[bit])
1261 ANTLR3_FPRINTF(stderr, "%s%s", count > 0 ? ", " : "", tokenNames[bit]);
1870 /* Did not find it, so create a new one for it, with a bit depth based on the
1871 * size of the input stream. We need the bit dept
[all...]
/external/blktrace/
H A Dblkiomon.c45 struct blk_io_trace bit; member in struct:trace
108 struct blk_io_trace *bit = &t->bit; local
114 fprintf(debug.fp, "magic %16d\n", bit->magic);
115 fprintf(debug.fp, "sequence %16d\n", bit->sequence);
116 fprintf(debug.fp, "time %16ld\n", (unsigned long)bit->time);
117 fprintf(debug.fp, "sector %16ld\n", (unsigned long)bit->sector);
118 fprintf(debug.fp, "bytes %16d\n", bit->bytes);
119 fprintf(debug.fp, "action %16x\n", bit->action);
120 fprintf(debug.fp, "pid %16d\n", bit
374 blkiomon_fetch_trace(struct blk_io_trace *bit) argument
431 blkiomon_dump_drvdata(struct blk_io_trace *bit, void *pdu_buf) argument
454 struct blk_io_trace *bit; local
[all...]
/external/boringssl/src/crypto/bytestring/
H A Dbytestring_test.cc823 {0x07, 0x80}, // 1 bit
838 // It's not possible to take an unused bit off the empty string.
858 unsigned bit; member in struct:__anon905
882 SCOPED_TRACE(test.bit);
886 CBS_asn1_bitstring_has_bit(&cbs, test.bit));
H A Dcbs.c203 // Values end at an octet with the high bit cleared.
277 // The high bit indicate that this is the long form, while the next 7 bits
552 int CBS_asn1_bitstring_has_bit(const CBS *cbs, unsigned bit) { argument
557 const unsigned byte_num = (bit >> 3) + 1;
558 const unsigned bit_num = 7 - (bit & 7);
/external/e2fsprogs/lib/ext2fs/
H A Dblkmap64_rb.c322 rb_test_bit(struct ext2fs_rb_private *bp, __u64 bit) argument
333 if (bit >= rcursor->start && bit < rcursor->start + rcursor->count) {
348 if ((bit >= rcursor->start + rcursor->count) &&
349 (bit < next_ext->start)) {
363 if (bit >= rcursor->start && bit < rcursor->start + rcursor->count)
371 if (bit < ext->start)
373 else if (bit >= (ext->start + ext->count))
874 /* The start bit i
[all...]
/external/libchrome/crypto/
H A Dp224.cc31 // Using 28-bit limbs means that there's only 4 bits of headroom, which is less
89 // kZero31ModP is 0 mod p where bit 31 is set in all limbs so that we can
111 // kZero63ModP is 0 mod p where bit 63 is set in all limbs. See the section
146 // 32-bit operations.
605 uint32_t bit = static_cast<uint32_t>(static_cast<int32_t>( local
608 CopyConditional(out, tmp, bit);
/external/libmojo/mojo/public/java/bindings/src/org/chromium/mojo/bindings/
H A DDecoder.java260 public boolean readBoolean(int offset, int bit) { argument
262 return (readByte(offset) & (1 << bit)) != 0;
/external/libopus/celt/
H A Drate.c52 /*Determines if V(N,K) fits in a 32-bit unsigned integer.
153 /* N=1 bands only have a sign bit and fine bits. */
323 In the first case, we'd be coding a bit to signal we're going to waste
325 In the second case, we'd be coding a bit to redistribute all the bits
329 /* Give the bit we reserved to end skipping back. */
371 /*We used a bit to skip this band.*/
382 /*If we have enough for a fine energy bit per channel, use it.*/
440 opus_int32 excess, bit; local
445 bit = (opus_int32)bits[j]+balance;
449 excess = MAX32(bit
[all...]
/external/libvncserver/libvncserver/
H A Dcursor.c259 unsigned char bit; local
270 for(i=0,bit=0x80;i<width;i++,bit=(bit&1)?0x80:bit>>1,cp++)
271 if(*cp!=' ') cursor->source[j*w+i/8]|=bit;
276 for(i=0,bit=0x80;i<width;i++,bit=(bit&1)?0x80:bit>>
377 unsigned char bit; local
447 unsigned char bit; local
713 unsigned char bit; local
[all...]
/external/ltp/testcases/kernel/controllers/cpuset/cpuset_lib/
H A Dlibbitmask.c58 /* Return the value (0 or 1) of bit n in bitmask bmp */
67 /* Set bit n in bitmask bmp to value v (0 or 1) */
138 int bit; local
140 for (bit = HEXCHUNKSZ - 1; bit >= 0; bit--)
141 val = val << 1 | _getbit(bmp, chunk * HEXCHUNKSZ + bit);
176 * decimal numbers, the smallest and largest bit numbers set in
188 /* current bit is 'cur', most recently seen range is [rbot, rtop] */
237 int bit; local
[all...]
/external/ltp/testcases/network/lib6/
H A Dasapi_01.c85 * set each bit in an address and check for unequal; then set
90 int word, bit; local
99 for (bit = 0; bit < 32; ++bit) {
100 uint32_t newbit = 1U << bit;
/external/syslinux/gpxe/src/drivers/net/
H A Db44.c127 * Wait until the given bit is set/cleared.
129 static int b44_wait_bit(struct b44_private *bp, unsigned long reg, u32 bit, argument
137 if (clear && !(val & bit))
140 if (!clear && (val & bit))
/external/v8/src/
H A Dapi-natives.cc225 Object* bit = properties->get(i++); local
226 if (bit->IsSmi()) {
227 PropertyDetails details(Smi::cast(bit));
/external/vixl/src/
H A Dutils-vixl.h191 // If the highest extracted bit is set, sign extend.
297 // An fpclassify() function for 16-bit half-precision floats.
413 // Split the 64-bit value into an 8-bit array, where b[0] is the least
514 inline T ExtractBit(T value, unsigned bit) { argument
515 return (value >> bit) & T(1);
525 int bit,
528 VIXL_ASSERT(bit >= 0);
529 VIXL_ASSERT(bit < static_cast<int>(sizeof(Td) * 8));
531 dst &= ~(mask << bit);
524 AssignBit(Td& dst, int bit, Ts value) argument
[all...]
/external/zopfli/src/zopfli/
H A Ddeflate.c35 is not simply bytesize * 8 + bp because even representing one bit requires a
38 static void AddBit(int bit, argument
41 (*out)[*outsize - 1] |= bit << *bp;
50 unsigned bit = (symbol >> i) & 1; local
52 (*out)[*outsize - 1] |= bit << *bp;
67 unsigned bit = (symbol >> (length - i - 1)) & 1; local
69 (*out)[*outsize - 1] |= bit << *bp;
468 Calculates the bit lengths for the symbols for dynamic blocks. Chooses bit
471 bit length
[all...]

Completed in 766 milliseconds

1234567891011>>