Lines Matching refs:integerPartWidth
2273 COMPILE_TIME_ASSERT(integerPartWidth % 2 == 0);
2283 assert(bits != 0 && bits <= integerPartWidth);
2285 return ~(integerPart) 0 >> (integerPartWidth - bits);
2292 return part & lowBitMask(integerPartWidth / 2);
2299 return part >> (integerPartWidth / 2);
2360 return (parts[bit / integerPartWidth] &
2361 ((integerPart) 1 << bit % integerPartWidth)) != 0;
2368 parts[bit / integerPartWidth] |= (integerPart) 1 << (bit % integerPartWidth);
2375 parts[bit / integerPartWidth] &=
2376 ~((integerPart) 1 << (bit % integerPartWidth));
2390 return lsb + i * integerPartWidth;
2410 return msb + n * integerPartWidth;
2427 dstParts = (srcBits + integerPartWidth - 1) / integerPartWidth;
2430 firstSrcPart = srcLSB / integerPartWidth;
2433 shift = srcLSB % integerPartWidth;
2436 /* We now have (dstParts * integerPartWidth - shift) bits from SRC
2439 n = dstParts * integerPartWidth - shift;
2443 << n % integerPartWidth);
2445 if (srcBits % integerPartWidth)
2446 dst[dstParts - 1] &= lowBitMask (srcBits % integerPartWidth);
2560 mid <<= integerPartWidth / 2;
2567 mid <<= integerPartWidth / 2;
2687 shiftCount = parts * integerPartWidth - shiftCount;
2688 n = shiftCount / integerPartWidth;
2689 mask = (integerPart) 1 << (shiftCount % integerPartWidth);
2712 mask = (integerPart) 1 << (integerPartWidth - 1), n--;
2727 jump = count / integerPartWidth;
2728 shift = count % integerPartWidth;
2741 part |= dst[parts - jump - 1] >> (integerPartWidth - shift);
2761 jump = count / integerPartWidth;
2762 shift = count % integerPartWidth;
2776 part |= dst[i + jump + 1] << (integerPartWidth - shift);
2880 while (bits > integerPartWidth) {
2882 bits -= integerPartWidth;
2886 dst[i++] = ~(integerPart) 0 >> (integerPartWidth - bits);
