Home | History | Annotate | Download | only in libagl

Lines Matching full:bits

162             // There's no need to endian-swap within 'bits'
164 uint32_t bits = *d32++;
166 // Detect if any (odd, even) pair of bits are '11'
167 // bits: b31 b30 b29 ... b3 b2 b1 b0
168 // bits >> 1: b31 b31 b30 ... b4 b3 b2 b1
171 if (((bits & (bits >> 1)) & 0x55555555) != 0) {
216 uint32_t bits = *d32++;
220 bits = swap(bits);
253 int bbits = bits >> 1;
254 bool has2 = ((bbits & ~bits) & 0x55555555) != 0;
255 bool has3 = ((bbits & bits) & 0x55555555) != 0;
295 int code = bits & 0x3;
296 bits >>= 2;
339 uint32_t bits = *d32++;
343 bits = swap(bits);
360 int bbits = bits >> 1;
361 bool has2 = ((bbits & ~bits) & 0x55555555) != 0;
362 bool has3 = ((bbits & bits) & 0x55555555) != 0;
386 // Convert to 8 bits
404 int code = bits & 0x3;
405 bits >>= 2;
463 uint32_t bits = *d32++;
467 bits = swap(bits);
517 int bbits = bits >> 1;
518 bool has2 = ((bbits & ~bits) & 0x55555555) != 0;
519 bool has3 = ((bbits & bits) & 0x55555555) != 0;
543 // Convert to 8 bits
561 int code = bits & 0x3;
562 bits >>= 2;